gun-eth 1.4.32 → 1.4.34

package/dist/browser/gun-eth.min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gun-eth.min.js","sources":["../../node_modules/gun/gun.js","../../node_modules/ethers/lib.esm/_version.js","../../node_modules/ethers/lib.esm/utils/properties.js","../../node_modules/ethers/lib.esm/utils/errors.js","../../node_modules/ethers/lib.esm/utils/data.js","../../node_modules/ethers/lib.esm/utils/maths.js","../../node_modules/ethers/lib.esm/utils/base58.js","../../node_modules/ethers/lib.esm/utils/events.js","../../node_modules/ethers/lib.esm/utils/utf8.js","../../node_modules/ethers/lib.esm/utils/geturl-browser.js","../../node_modules/ethers/lib.esm/utils/fetch.js","../../node_modules/ethers/lib.esm/utils/base64-browser.js","../../node_modules/ethers/lib.esm/utils/rlp-decode.js","../../node_modules/ethers/lib.esm/utils/rlp-encode.js","../../node_modules/ethers/lib.esm/utils/uuid.js","../../node_modules/ethers/lib.esm/abi/coders/abstract-coder.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/_assert.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/crypto.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/utils.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/hmac.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/pbkdf2.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/_sha2.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/sha256.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/_u64.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/sha512.js","../../node_modules/ethers/lib.esm/crypto/crypto-browser.js","../../node_modules/ethers/lib.esm/crypto/hmac.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/sha3.js","../../node_modules/ethers/lib.esm/crypto/keccak.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/ripemd160.js","../../node_modules/ethers/lib.esm/crypto/ripemd160.js","../../node_modules/ethers/lib.esm/crypto/pbkdf2.js","../../node_modules/ethers/lib.esm/crypto/random.js","../../node_modules/ethers/node_modules/@noble/hashes/esm/scrypt.js","../../node_modules/ethers/lib.esm/crypto/scrypt.js","../../node_modules/ethers/lib.esm/crypto/sha2.js","../../node_modules/ethers/node_modules/@noble/curves/esm/abstract/utils.js","../../node_modules/ethers/node_modules/@noble/curves/esm/abstract/modular.js","../../node_modules/ethers/node_modules/@noble/curves/esm/abstract/curve.js","../../node_modules/ethers/node_modules/@noble/curves/esm/abstract/weierstrass.js","../../node_modules/ethers/node_modules/@noble/curves/esm/_shortw_utils.js","../../node_modules/ethers/node_modules/@noble/curves/esm/secp256k1.js","../../node_modules/ethers/lib.esm/constants/addresses.js","../../node_modules/ethers/lib.esm/constants/hashes.js","../../node_modules/ethers/lib.esm/crypto/signature.js","../../node_modules/ethers/lib.esm/crypto/signing-key.js","../../node_modules/ethers/lib.esm/address/address.js","../../node_modules/ethers/lib.esm/address/checks.js","../../node_modules/ethers/lib.esm/abi/typed.js","../../node_modules/ethers/lib.esm/abi/coders/address.js","../../node_modules/ethers/lib.esm/abi/coders/anonymous.js","../../node_modules/ethers/lib.esm/abi/coders/array.js","../../node_modules/ethers/lib.esm/abi/coders/boolean.js","../../node_modules/ethers/lib.esm/abi/coders/bytes.js","../../node_modules/ethers/lib.esm/abi/coders/fixed-bytes.js","../../node_modules/ethers/lib.esm/abi/coders/null.js","../../node_modules/ethers/lib.esm/abi/coders/number.js","../../node_modules/ethers/lib.esm/abi/coders/string.js","../../node_modules/ethers/lib.esm/abi/coders/tuple.js","../../node_modules/ethers/lib.esm/hash/id.js","../../node_modules/@adraffy/ens-normalize/dist/index.mjs","../../node_modules/ethers/lib.esm/hash/namehash.js","../../node_modules/ethers/lib.esm/transaction/accesslist.js","../../node_modules/ethers/lib.esm/transaction/address.js","../../node_modules/ethers/lib.esm/transaction/transaction.js","../../node_modules/ethers/lib.esm/hash/message.js","../../node_modules/ethers/lib.esm/constants/strings.js","../../node_modules/ethers/lib.esm/hash/typed-data.js","../../node_modules/ethers/lib.esm/abi/fragments.js","../../node_modules/ethers/lib.esm/abi/abi-coder.js","../../node_modules/ethers/lib.esm/abi/interface.js","../../node_modules/ethers/lib.esm/providers/provider.js","../../node_modules/ethers/lib.esm/contract/wrappers.js","../../node_modules/ethers/lib.esm/contract/contract.js","../../node_modules/ethers/lib.esm/providers/ens-resolver.js","../../node_modules/ethers/lib.esm/providers/format.js","../../node_modules/ethers/lib.esm/address/contract-address.js","../../node_modules/ethers/lib.esm/providers/plugins-network.js","../../node_modules/ethers/lib.esm/providers/network.js","../../node_modules/ethers/lib.esm/providers/subscriber-polling.js","../../node_modules/ethers/lib.esm/providers/abstract-provider.js","../../node_modules/ethers/lib.esm/providers/abstract-signer.js","../../node_modules/ethers/lib.esm/providers/subscriber-filterid.js","../../node_modules/ethers/lib.esm/providers/provider-jsonrpc.js","../../node_modules/ethers/lib.esm/providers/provider-browser.js","../../node_modules/ethers/lib.esm/wallet/base-wallet.js","../../node_modules/ethers/lib.esm/wordlists/decode-owl.js","../../node_modules/ethers/lib.esm/wordlists/wordlist.js","../../node_modules/ethers/lib.esm/wordlists/wordlist-owl.js","../../node_modules/ethers/lib.esm/wordlists/lang-en.js","../../node_modules/ethers/lib.esm/wallet/mnemonic.js","../../node_modules/aes-js/lib.esm/aes.js","../../node_modules/aes-js/lib.esm/mode.js","../../node_modules/aes-js/lib.esm/mode-cbc.js","../../node_modules/aes-js/lib.esm/mode-ctr.js","../../node_modules/ethers/lib.esm/wallet/utils.js","../../node_modules/ethers/lib.esm/wallet/json-keystore.js","../../node_modules/ethers/lib.esm/wallet/hdwallet.js","../../node_modules/ethers/lib.esm/wallet/json-crowdsale.js","../../node_modules/aes-js/lib.esm/padding.js","../../node_modules/ethers/lib.esm/wallet/wallet.js","../../src/config/local.js","../../src/abis/abis.js","../../node_modules/gun/sea.js","../../src/index.js"],"sourcesContent":[";(function(){\n\n  /* UNBUILD */\n  function USE(arg, req){\n    return req? require(arg) : arg.slice? USE[R(arg)] : function(mod, path){\n      arg(mod = {exports: {}});\n      USE[R(path)] = mod.exports;\n    }\n    function R(p){\n      return p.split('/').slice(-1).toString().replace('.js','');\n    }\n  }\n  if(typeof module !== \"undefined\"){ var MODULE = module }\n  /* UNBUILD */\n\n\t;USE(function(module){\n\t\t// Shim for generic javascript utilities.\n\t\tString.random = function(l, c){\n\t\t\tvar s = '';\n\t\t\tl = l || 24; // you are not going to make a 0 length random number, so no need to check type\n\t\t\tc = c || '0123456789ABCDEFGHIJKLMNOPQRSTUVWXZabcdefghijklmnopqrstuvwxyz';\n\t\t\twhile(l-- > 0){ s += c.charAt(Math.floor(Math.random() * c.length)) }\n\t\t\treturn s;\n\t\t}\n\t\tString.match = function(t, o){ var tmp, u;\n\t\t\tif('string' !== typeof t){ return false }\n\t\t\tif('string' == typeof o){ o = {'=': o} }\n\t\t\to = o || {};\n\t\t\ttmp = (o['='] || o['*'] || o['>'] || o['<']);\n\t\t\tif(t === tmp){ return true }\n\t\t\tif(u !== o['=']){ return false }\n\t\t\ttmp = (o['*'] || o['>']);\n\t\t\tif(t.slice(0, (tmp||'').length) === tmp){ return true }\n\t\t\tif(u !== o['*']){ return false }\n\t\t\tif(u !== o['>'] && u !== o['<']){\n\t\t\t\treturn (t >= o['>'] && t <= o['<'])? true : false;\n\t\t\t}\n\t\t\tif(u !== o['>'] && t >= o['>']){ return true }\n\t\t\tif(u !== o['<'] && t <= o['<']){ return true }\n\t\t\treturn false;\n\t\t}\n\t\tString.hash = function(s, c){ // via SO\n\t\t\tif(typeof s !== 'string'){ return }\n\t    c = c || 0; // CPU schedule hashing by\n\t    if(!s.length){ return c }\n\t    for(var i=0,l=s.length,n; i<l; ++i){\n\t      n = s.charCodeAt(i);\n\t      c = ((c<<5)-c)+n;\n\t      c |= 0;\n\t    }\n\t    return c;\n\t  }\n\t\tvar has = Object.prototype.hasOwnProperty;\n\t\tObject.plain = function(o){ return o? (o instanceof Object && o.constructor === Object) || Object.prototype.toString.call(o).match(/^\\[object (\\w+)\\]$/)[1] === 'Object' : false }\n\t\tObject.empty = function(o, n){\n\t\t\tfor(var k in o){ if(has.call(o, k) && (!n || -1==n.indexOf(k))){ return false } }\n\t\t\treturn true;\n\t\t}\n\t\tObject.keys = Object.keys || function(o){\n\t\t\tvar l = [];\n\t\t\tfor(var k in o){ if(has.call(o, k)){ l.push(k) } }\n\t\t\treturn l;\n\t\t}\n\t\t;(function(){\n\t\t\tvar u, sT = setTimeout, l = 0, c = 0\n\t\t\t, sI = (typeof setImmediate !== ''+u && setImmediate) || (function(c,f){\n\t\t\t\tif(typeof MessageChannel == ''+u){ return sT }\n\t\t\t\t(c = new MessageChannel()).port1.onmessage = function(e){ ''==e.data && f() }\n\t\t\t\treturn function(q){ f=q;c.port2.postMessage('') }\n\t\t\t}()), check = sT.check = sT.check || (typeof performance !== ''+u && performance)\n\t\t\t|| {now: function(){ return +new Date }};\n\t\t\tsT.hold = sT.hold || 9; // half a frame benchmarks faster than < 1ms?\n\t\t\tsT.poll = sT.poll || function(f){\n\t\t\t\tif((sT.hold >= (check.now() - l)) && c++ < 3333){ f(); return }\n\t\t\t\tsI(function(){ l = check.now(); f() },c=0)\n\t\t\t}\n\t\t}());\n\t\t;(function(){ // Too many polls block, this \"threads\" them in turns over a single thread in time.\n\t\t\tvar sT = setTimeout, t = sT.turn = sT.turn || function(f){ 1 == s.push(f) && p(T) }\n\t\t\t, s = t.s = [], p = sT.poll, i = 0, f, T = function(){\n\t\t\t\tif(f = s[i++]){ f() }\n\t\t\t\tif(i == s.length || 99 == i){\n\t\t\t\t\ts = t.s = s.slice(i);\n\t\t\t\t\ti = 0;\n\t\t\t\t}\n\t\t\t\tif(s.length){ p(T) }\n\t\t\t}\n\t\t}());\n\t\t;(function(){\n\t\t\tvar u, sT = setTimeout, T = sT.turn;\n\t\t\t(sT.each = sT.each || function(l,f,e,S){ S = S || 9; (function t(s,L,r){\n\t\t\t  if(L = (s = (l||[]).splice(0,S)).length){\n\t\t\t  \tfor(var i = 0; i < L; i++){\n\t\t\t  \t\tif(u !== (r = f(s[i]))){ break }\n\t\t\t  \t}\n\t\t\t  \tif(u === r){ T(t); return }\n\t\t\t  } e && e(r);\n\t\t\t}())})();\n\t\t}());\n\t})(USE, './shim');\n\n\t;USE(function(module){\n\t\t// On event emitter generic javascript utility.\n\t\tmodule.exports = function onto(tag, arg, as){\n\t\t\tif(!tag){ return {to: onto} }\n\t\t\tvar u, f = 'function' == typeof arg, tag = (this.tag || (this.tag = {}))[tag] || f && (\n\t\t\t\tthis.tag[tag] = {tag: tag, to: onto._ = { next: function(arg){ var tmp;\n\t\t\t\t\tif(tmp = this.to){ tmp.next(arg) }\n\t\t\t}}});\n\t\t\tif(f){\n\t\t\t\tvar be = {\n\t\t\t\t\toff: onto.off ||\n\t\t\t\t\t(onto.off = function(){\n\t\t\t\t\t\tif(this.next === onto._.next){ return !0 }\n\t\t\t\t\t\tif(this === this.the.last){\n\t\t\t\t\t\t\tthis.the.last = this.back;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tthis.to.back = this.back;\n\t\t\t\t\t\tthis.next = onto._.next;\n\t\t\t\t\t\tthis.back.to = this.to;\n\t\t\t\t\t\tif(this.the.last === this.the){\n\t\t\t\t\t\t\tdelete this.on.tag[this.the.tag];\n\t\t\t\t\t\t}\n\t\t\t\t\t}),\n\t\t\t\t\tto: onto._,\n\t\t\t\t\tnext: arg,\n\t\t\t\t\tthe: tag,\n\t\t\t\t\ton: this,\n\t\t\t\t\tas: as,\n\t\t\t\t};\n\t\t\t\t(be.back = tag.last || tag).to = be;\n\t\t\t\treturn tag.last = be;\n\t\t\t}\n\t\t\tif((tag = tag.to) && u !== arg){ tag.next(arg) }\n\t\t\treturn tag;\n\t\t};\n\t})(USE, './onto');\n\n\t;USE(function(module){\n\t\t// Valid values are a subset of JSON: null, binary, number (!Infinity), text,\n\t\t// or a soul relation. Arrays need special algorithms to handle concurrency,\n\t\t// so they are not supported directly. Use an extension that supports them if\n\t\t// needed but research their problems first.\n\t\tmodule.exports = function (v) {\n\t\t  // \"deletes\", nulling out keys.\n\t\t  return v === null ||\n\t\t\t\"string\" === typeof v ||\n\t\t\t\"boolean\" === typeof v ||\n\t\t\t// we want +/- Infinity to be, but JSON does not support it, sad face.\n\t\t\t// can you guess what v === v checks for? ;)\n\t\t\t(\"number\" === typeof v && v != Infinity && v != -Infinity && v === v) ||\n\t\t\t(!!v && \"string\" == typeof v[\"#\"] && Object.keys(v).length === 1 && v[\"#\"]);\n\t\t}\n\t})(USE, './valid');\n\n\t;USE(function(module){\n\t\tUSE('./shim');\n\t\tfunction State(){\n\t\t\tvar t = +new Date;\n\t\t\tif(last < t){\n\t\t\t\treturn N = 0, last = t + State.drift;\n\t\t\t}\n\t\t\treturn last = t + ((N += 1) / D) + State.drift;\n\t\t}\n\t\tState.drift = 0;\n\t\tvar NI = -Infinity, N = 0, D = 999, last = NI, u; // WARNING! In the future, on machines that are D times faster than 2016AD machines, you will want to increase D by another several orders of magnitude so the processing speed never out paces the decimal resolution (increasing an integer effects the state accuracy).\n\t\tState.is = function(n, k, o){ // convenience function to get the state on a key on a node and return it.\n\t\t\tvar tmp = (k && n && n._ && n._['>']) || o;\n\t\t\tif(!tmp){ return }\n\t\t\treturn ('number' == typeof (tmp = tmp[k]))? tmp : NI;\n\t\t}\n\t\tState.ify = function(n, k, s, v, soul){ // put a key's state on a node.\n\t\t\t(n = n || {})._ = n._ || {}; // safety check or init.\n\t\t\tif(soul){ n._['#'] = soul } // set a soul if specified.\n\t\t\tvar tmp = n._['>'] || (n._['>'] = {}); // grab the states data.\n\t\t\tif(u !== k && k !== '_'){\n\t\t\t\tif('number' == typeof s){ tmp[k] = s } // add the valid state.\n\t\t\t\tif(u !== v){ n[k] = v } // Note: Not its job to check for valid values!\n\t\t\t}\n\t\t\treturn n;\n\t\t}\n\t\tmodule.exports = State;\n\t})(USE, './state');\n\n\t;USE(function(module){\n\t\tUSE('./shim');\n\t\tfunction Dup(opt){\n\t\t\tvar dup = {s:{}}, s = dup.s;\n\t\t\topt = opt || {max: 999, age: 1000 * 9};//*/ 1000 * 9 * 3};\n\t\t\tdup.check = function(id){\n\t\t\t\tif(!s[id]){ return false }\n\t\t\t\treturn dt(id);\n\t\t\t}\n\t\t\tvar dt = dup.track = function(id){\n\t\t\t\tvar it = s[id] || (s[id] = {});\n\t\t\t\tit.was = dup.now = +new Date;\n\t\t\t\tif(!dup.to){ dup.to = setTimeout(dup.drop, opt.age + 9) }\n\t\t\t\tif(dt.ed){ dt.ed(id) }\n\t\t\t\treturn it;\n\t\t\t}\n\t\t\tdup.drop = function(age){\n\t\t\t\tdup.to = null;\n\t\t\t\tdup.now = +new Date;\n\t\t\t\tvar l = Object.keys(s);\n\t\t\t\tconsole.STAT && console.STAT(dup.now, +new Date - dup.now, 'dup drop keys'); // prev ~20% CPU 7% RAM 300MB // now ~25% CPU 7% RAM 500MB\n\t\t\t\tsetTimeout.each(l, function(id){ var it = s[id]; // TODO: .keys( is slow?\n\t\t\t\t\tif(it && (age || opt.age) > (dup.now - it.was)){ return }\n\t\t\t\t\tdelete s[id];\n\t\t\t\t},0,99);\n\t\t\t}\n\t\t\treturn dup;\n\t\t}\n\t\tmodule.exports = Dup;\n\t})(USE, './dup');\n\n\t;USE(function(module){\n\t\t// request / response module, for asking and acking messages.\n\t\tUSE('./onto'); // depends upon onto!\n\t\tmodule.exports = function ask(cb, as){\n\t\t\tif(!this.on){ return }\n\t\t\tvar lack = (this.opt||{}).lack || 9000;\n\t\t\tif(!('function' == typeof cb)){\n\t\t\t\tif(!cb){ return }\n\t\t\t\tvar id = cb['#'] || cb, tmp = (this.tag||'')[id];\n\t\t\t\tif(!tmp){ return }\n\t\t\t\tif(as){\n\t\t\t\t\ttmp = this.on(id, as);\n\t\t\t\t\tclearTimeout(tmp.err);\n\t\t\t\t\ttmp.err = setTimeout(function(){ tmp.off() }, lack);\n\t\t\t\t}\n\t\t\t\treturn true;\n\t\t\t}\n\t\t\tvar id = (as && as['#']) || random(9);\n\t\t\tif(!cb){ return id }\n\t\t\tvar to = this.on(id, cb, as);\n\t\t\tto.err = to.err || setTimeout(function(){ to.off();\n\t\t\t\tto.next({err: \"Error: No ACK yet.\", lack: true});\n\t\t\t}, lack);\n\t\t\treturn id;\n\t\t}\n\t\tvar random = String.random || function(){ return Math.random().toString(36).slice(2) }\n\t})(USE, './ask');\n\n\t;USE(function(module){\n\n\t\tfunction Gun(o){\n\t\t\tif(o instanceof Gun){ return (this._ = {$: this}).$ }\n\t\t\tif(!(this instanceof Gun)){ return new Gun(o) }\n\t\t\treturn Gun.create(this._ = {$: this, opt: o});\n\t\t}\n\n\t\tGun.is = function($){ return ($ instanceof Gun) || ($ && $._ && ($ === $._.$)) || false }\n\n\t\tGun.version = 0.2020;\n\n\t\tGun.chain = Gun.prototype;\n\t\tGun.chain.toJSON = function(){};\n\n\t\tUSE('./shim');\n\t\tGun.valid = USE('./valid');\n\t\tGun.state = USE('./state');\n\t\tGun.on = USE('./onto');\n\t\tGun.dup = USE('./dup');\n\t\tGun.ask = USE('./ask');\n\n\t\t;(function(){\n\t\t\tGun.create = function(at){\n\t\t\t\tat.root = at.root || at;\n\t\t\t\tat.graph = at.graph || {};\n\t\t\t\tat.on = at.on || Gun.on;\n\t\t\t\tat.ask = at.ask || Gun.ask;\n\t\t\t\tat.dup = at.dup || Gun.dup();\n\t\t\t\tvar gun = at.$.opt(at.opt);\n\t\t\t\tif(!at.once){\n\t\t\t\t\tat.on('in', universe, at);\n\t\t\t\t\tat.on('out', universe, at);\n\t\t\t\t\tat.on('put', map, at);\n\t\t\t\t\tGun.on('create', at);\n\t\t\t\t\tat.on('create', at);\n\t\t\t\t}\n\t\t\t\tat.once = 1;\n\t\t\t\treturn gun;\n\t\t\t}\n\t\t\tfunction universe(msg){\n\t\t\t\t// TODO: BUG! msg.out = null being set!\n\t\t\t\t//if(!F){ var eve = this; setTimeout(function(){ universe.call(eve, msg,1) },Math.random() * 100);return; } // ADD F TO PARAMS!\n\t\t\t\tif(!msg){ return }\n\t\t\t\tif(msg.out === universe){ this.to.next(msg); return }\n\t\t\t\tvar eve = this, as = eve.as, at = as.at || as, gun = at.$, dup = at.dup, tmp, DBG = msg.DBG;\n\t\t\t\t(tmp = msg['#']) || (tmp = msg['#'] = text_rand(9));\n\t\t\t\tif(dup.check(tmp)){ return } dup.track(tmp);\n\t\t\t\ttmp = msg._; msg._ = ('function' == typeof tmp)? tmp : function(){};\n\t\t\t\t(msg.$ && (msg.$ === (msg.$._||'').$)) || (msg.$ = gun);\n\t\t\t\tif(msg['@'] && !msg.put){ ack(msg) }\n\t\t\t\tif(!at.ask(msg['@'], msg)){ // is this machine listening for an ack?\n\t\t\t\t\tDBG && (DBG.u = +new Date);\n\t\t\t\t\tif(msg.put){ put(msg); return } else\n\t\t\t\t\tif(msg.get){ Gun.on.get(msg, gun) }\n\t\t\t\t}\n\t\t\t\tDBG && (DBG.uc = +new Date);\n\t\t\t\teve.to.next(msg);\n\t\t\t\tDBG && (DBG.ua = +new Date);\n\t\t\t\tif(msg.nts || msg.NTS){ return } // TODO: This shouldn't be in core, but fast way to prevent NTS spread. Delete this line after all peers have upgraded to newer versions.\n\t\t\t\tmsg.out = universe; at.on('out', msg);\n\t\t\t\tDBG && (DBG.ue = +new Date);\n\t\t\t}\n\t\t\tfunction put(msg){\n\t\t\t\tif(!msg){ return }\n\t\t\t\tvar ctx = msg._||'', root = ctx.root = ((ctx.$ = msg.$||'')._||'').root;\n\t\t\t\tif(msg['@'] && ctx.faith && !ctx.miss){ // TODO: AXE may split/route based on 'put' what should we do here? Detect @ in AXE? I think we don't have to worry, as DAM will route it on @.\n\t\t\t\t\tmsg.out = universe;\n\t\t\t\t\troot.on('out', msg);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tctx.latch = root.hatch; ctx.match = root.hatch = [];\n\t\t\t\tvar put = msg.put;\n\t\t\t\tvar DBG = ctx.DBG = msg.DBG, S = +new Date; CT = CT || S;\n\t\t\t\tif(put['#'] && put['.']){ /*root && root.on('put', msg);*/ return } // TODO: BUG! This needs to call HAM instead.\n\t\t\t\tDBG && (DBG.p = S);\n\t\t\t\tctx['#'] = msg['#'];\n\t\t\t\tctx.msg = msg;\n\t\t\t\tctx.all = 0;\n\t\t\t\tctx.stun = 1;\n\t\t\t\tvar nl = Object.keys(put);//.sort(); // TODO: This is unbounded operation, large graphs will be slower. Write our own CPU scheduled sort? Or somehow do it in below? Keys itself is not O(1) either, create ES5 shim over ?weak map? or custom which is constant.\n\t\t\t\tconsole.STAT && console.STAT(S, ((DBG||ctx).pk = +new Date) - S, 'put sort');\n\t\t\t\tvar ni = 0, nj, kl, soul, node, states, err, tmp;\n\t\t\t\t(function pop(o){\n\t\t\t\t\tif(nj != ni){ nj = ni;\n\t\t\t\t\t\tif(!(soul = nl[ni])){\n\t\t\t\t\t\t\tconsole.STAT && console.STAT(S, ((DBG||ctx).pd = +new Date) - S, 'put');\n\t\t\t\t\t\t\tfire(ctx);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(!(node = put[soul])){ err = ERR+cut(soul)+\"no node.\" } else\n\t\t\t\t\t\tif(!(tmp = node._)){ err = ERR+cut(soul)+\"no meta.\" } else\n\t\t\t\t\t\tif(soul !== tmp['#']){ err = ERR+cut(soul)+\"soul not same.\" } else\n\t\t\t\t\t\tif(!(states = tmp['>'])){ err = ERR+cut(soul)+\"no state.\" }\n\t\t\t\t\t\tkl = Object.keys(node||{}); // TODO: .keys( is slow\n\t\t\t\t\t}\n\t\t\t\t\tif(err){\n\t\t\t\t\t\tmsg.err = ctx.err = err; // invalid data should error and stun the message.\n\t\t\t\t\t\tfire(ctx);\n\t\t\t\t\t\t//console.log(\"handle error!\", err) // handle!\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tvar i = 0, key; o = o || 0;\n\t\t\t\t\twhile(o++ < 9 && (key = kl[i++])){\n\t\t\t\t\t\tif('_' === key){ continue }\n\t\t\t\t\t\tvar val = node[key], state = states[key];\n\t\t\t\t\t\tif(u === state){ err = ERR+cut(key)+\"on\"+cut(soul)+\"no state.\"; break }\n\t\t\t\t\t\tif(!valid(val)){ err = ERR+cut(key)+\"on\"+cut(soul)+\"bad \"+(typeof val)+cut(val); break }\n\t\t\t\t\t\t//ctx.all++; //ctx.ack[soul+key] = '';\n\t\t\t\t\t\tham(val, key, soul, state, msg);\n\t\t\t\t\t\t++C; // courtesy count;\n\t\t\t\t\t}\n\t\t\t\t\tif((kl = kl.slice(i)).length){ turn(pop); return }\n\t\t\t\t\t++ni; kl = null; pop(o);\n\t\t\t\t}());\n\t\t\t} Gun.on.put = put;\n\t\t\t// TODO: MARK!!! clock below, reconnect sync, SEA certify wire merge, User.auth taking multiple times, // msg put, put, say ack, hear loop...\n\t\t\t// WASIS BUG! local peer not ack. .off other people: .open\n\t\t\tfunction ham(val, key, soul, state, msg){\n\t\t\t\tvar ctx = msg._||'', root = ctx.root, graph = root.graph, lot, tmp;\n\t\t\t\tvar vertex = graph[soul] || empty, was = state_is(vertex, key, 1), known = vertex[key];\n\t\t\t\t\n\t\t\t\tvar DBG = ctx.DBG; if(tmp = console.STAT){ if(!graph[soul] || !known){ tmp.has = (tmp.has || 0) + 1 } }\n\n\t\t\t\tvar now = State(), u;\n\t\t\t\tif(state > now){\n\t\t\t\t\tsetTimeout(function(){ ham(val, key, soul, state, msg) }, (tmp = state - now) > MD? MD : tmp); // Max Defer 32bit. :(\n\t\t\t\t\tconsole.STAT && console.STAT(((DBG||ctx).Hf = +new Date), tmp, 'future');\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif(state < was){ /*old;*/ if(true || !ctx.miss){ return } } // but some chains have a cache miss that need to re-fire. // TODO: Improve in future. // for AXE this would reduce rebroadcast, but GUN does it on message forwarding. // TURNS OUT CACHE MISS WAS NOT NEEDED FOR NEW CHAINS ANYMORE!!! DANGER DANGER DANGER, ALWAYS RETURN! (or am I missing something?)\n\t\t\t\tif(!ctx.faith){ // TODO: BUG? Can this be used for cache miss as well? // Yes this was a bug, need to check cache miss for RAD tests, but should we care about the faith check now? Probably not.\n\t\t\t\t\tif(state === was && (val === known || L(val) <= L(known))){ /*console.log(\"same\");*/ /*same;*/ if(!ctx.miss){ return } } // same\n\t\t\t\t}\n\t\t\t\tctx.stun++; // TODO: 'forget' feature in SEA tied to this, bad approach, but hacked in for now. Any changes here must update there.\n\t\t\t\tvar aid = msg['#']+ctx.all++, id = {toString: function(){ return aid }, _: ctx}; id.toJSON = id.toString; // this *trick* makes it compatible between old & new versions.\n\t\t\t\troot.dup.track(id)['#'] = msg['#']; // fixes new OK acks for RPC like RTC.\n\t\t\t\tDBG && (DBG.ph = DBG.ph || +new Date);\n\t\t\t\troot.on('put', {'#': id, '@': msg['@'], put: {'#': soul, '.': key, ':': val, '>': state}, ok: msg.ok, _: ctx});\n\t\t\t}\n\t\t\tfunction map(msg){\n\t\t\t\tvar DBG; if(DBG = (msg._||'').DBG){ DBG.pa = +new Date; DBG.pm = DBG.pm || +new Date}\n      \tvar eve = this, root = eve.as, graph = root.graph, ctx = msg._, put = msg.put, soul = put['#'], key = put['.'], val = put[':'], state = put['>'], id = msg['#'], tmp;\n      \tif((tmp = ctx.msg) && (tmp = tmp.put) && (tmp = tmp[soul])){ state_ify(tmp, key, state, val, soul) } // necessary! or else out messages do not get SEA transforms.\n      \t//var bytes = ((graph[soul]||'')[key]||'').length||1;\n\t\t\t\tgraph[soul] = state_ify(graph[soul], key, state, val, soul);\n\t\t\t\tif(tmp = (root.next||'')[soul]){\n\t\t\t\t\t//tmp.bytes = (tmp.bytes||0) + ((val||'').length||1) - bytes;\n\t\t\t\t\t//if(tmp.bytes > 2**13){ Gun.log.once('byte-limit', \"Note: In the future, GUN peers will enforce a ~4KB query limit. Please see https://gun.eco/docs/Page\") }\n\t\t\t\t\ttmp.on('in', msg)\n\t\t\t\t}\n\t\t\t\tfire(ctx);\n\t\t\t\teve.to.next(msg);\n\t\t\t}\n\t\t\tfunction fire(ctx, msg){ var root;\n\t\t\t\tif(ctx.stop){ return }\n\t\t\t\tif(!ctx.err && 0 < --ctx.stun){ return } // TODO: 'forget' feature in SEA tied to this, bad approach, but hacked in for now. Any changes here must update there.\n\t\t\t\tctx.stop = 1;\n\t\t\t\tif(!(root = ctx.root)){ return }\n\t\t\t\tvar tmp = ctx.match; tmp.end = 1;\n\t\t\t\tif(tmp === root.hatch){ if(!(tmp = ctx.latch) || tmp.end){ delete root.hatch } else { root.hatch = tmp } }\n\t\t\t\tctx.hatch && ctx.hatch(); // TODO: rename/rework how put & this interact.\n\t\t\t\tsetTimeout.each(ctx.match, function(cb){cb && cb()}); \n\t\t\t\tif(!(msg = ctx.msg) || ctx.err || msg.err){ return }\n\t\t\t\tmsg.out = universe;\n\t\t\t\tctx.root.on('out', msg);\n\n\t\t\t\tCF(); // courtesy check;\n\t\t\t}\n\t\t\tfunction ack(msg){ // aggregate ACKs.\n\t\t\t\tvar id = msg['@'] || '', ctx, ok, tmp;\n\t\t\t\tif(!(ctx = id._)){\n\t\t\t\t\tvar dup = (dup = msg.$) && (dup = dup._) && (dup = dup.root) && (dup = dup.dup);\n\t\t\t\t\tif(!(dup = dup.check(id))){ return }\n\t\t\t\t\tmsg['@'] = dup['#'] || msg['@']; // This doesn't do anything anymore, backtrack it to something else?\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tctx.acks = (ctx.acks||0) + 1;\n\t\t\t\tif(ctx.err = msg.err){\n\t\t\t\t\tmsg['@'] = ctx['#'];\n\t\t\t\t\tfire(ctx); // TODO: BUG? How it skips/stops propagation of msg if any 1 item is error, this would assume a whole batch/resync has same malicious intent.\n\t\t\t\t}\n\t\t\t\tctx.ok = msg.ok || ctx.ok;\n\t\t\t\tif(!ctx.stop && !ctx.crack){ ctx.crack = ctx.match && ctx.match.push(function(){back(ctx)}) } // handle synchronous acks. NOTE: If a storage peer ACKs synchronously then the PUT loop has not even counted up how many items need to be processed, so ctx.STOP flags this and adds only 1 callback to the end of the PUT loop.\n\t\t\t\tback(ctx);\n\t\t\t}\n\t\t\tfunction back(ctx){\n\t\t\t\tif(!ctx || !ctx.root){ return }\n\t\t\t\tif(ctx.stun || ctx.acks !== ctx.all){ return }\n\t\t\t\tctx.root.on('in', {'@': ctx['#'], err: ctx.err, ok: ctx.err? u : ctx.ok || {'':1}});\n\t\t\t}\n\n\t\t\tvar ERR = \"Error: Invalid graph!\";\n\t\t\tvar cut = function(s){ return \" '\"+(''+s).slice(0,9)+\"...' \" }\n\t\t\tvar L = JSON.stringify, MD = 2147483647, State = Gun.state;\n\t\t\tvar C = 0, CT, CF = function(){if(C>999 && (C/-(CT - (CT = +new Date))>1)){Gun.window && console.log(\"Warning: You're syncing 1K+ records a second, faster than DOM can update - consider limiting query.\");CF=function(){C=0}}};\n\n\t\t}());\n\n\t\t;(function(){\n\t\t\tGun.on.get = function(msg, gun){\n\t\t\t\tvar root = gun._, get = msg.get, soul = get['#'], node = root.graph[soul], has = get['.'];\n\t\t\t\tvar next = root.next || (root.next = {}), at = next[soul];\n\n\t\t\t\t// TODO: Azarattum bug, what is in graph is not same as what is in next. Fix!\n\n\t\t\t\t// queue concurrent GETs?\n\t\t\t\t// TODO: consider tagging original message into dup for DAM.\n\t\t\t\t// TODO: ^ above? In chat app, 12 messages resulted in same peer asking for `#user.pub` 12 times. (same with #user GET too, yipes!) // DAM note: This also resulted in 12 replies from 1 peer which all had same ##hash but none of them deduped because each get was different.\n\t\t\t\t// TODO: Moving quick hacks fixing these things to axe for now.\n\t\t\t\t// TODO: a lot of GET #foo then GET #foo.\"\" happening, why?\n\t\t\t\t// TODO: DAM's ## hash check, on same get ACK, producing multiple replies still, maybe JSON vs YSON?\n\t\t\t\t// TMP note for now: viMZq1slG was chat LEX query #.\n\t\t\t\t/*if(gun !== (tmp = msg.$) && (tmp = (tmp||'')._)){\n\t\t\t\t\tif(tmp.Q){ tmp.Q[msg['#']] = ''; return } // chain does not need to ask for it again.\n\t\t\t\t\ttmp.Q = {};\n\t\t\t\t}*/\n\t\t\t\t/*if(u === has){\n\t\t\t\t\tif(at.Q){\n\t\t\t\t\t\t//at.Q[msg['#']] = '';\n\t\t\t\t\t\t//return;\n\t\t\t\t\t}\n\t\t\t\t\tat.Q = {};\n\t\t\t\t}*/\n\t\t\t\tvar ctx = msg._||{}, DBG = ctx.DBG = msg.DBG;\n\t\t\t\tDBG && (DBG.g = +new Date);\n\t\t\t\t//console.log(\"GET:\", get, node, has, at);\n\t\t\t\t//if(!node && !at){ return root.on('get', msg) }\n\t\t\t\t//if(has && node){ // replace 2 below lines to continue dev?\n\t\t\t\tif(!node){ return root.on('get', msg) }\n\t\t\t\tif(has){\n\t\t\t\t\tif('string' != typeof has || u === node[has]){\n\t\t\t\t\t\tif(!((at||'').next||'')[has]){ root.on('get', msg); return }\n\t\t\t\t\t}\n\t\t\t\t\tnode = state_ify({}, has, state_is(node, has), node[has], soul);\n\t\t\t\t\t// If we have a key in-memory, do we really need to fetch?\n\t\t\t\t\t// Maybe... in case the in-memory key we have is a local write\n\t\t\t\t\t// we still need to trigger a pull/merge from peers.\n\t\t\t\t}\n\t\t\t\t//Gun.window? Gun.obj.copy(node) : node; // HNPERF: If !browser bump Performance? Is this too dangerous to reference root graph? Copy / shallow copy too expensive for big nodes. Gun.obj.to(node); // 1 layer deep copy // Gun.obj.copy(node); // too slow on big nodes\n\t\t\t\tnode && ack(msg, node);\n\t\t\t\troot.on('get', msg); // send GET to storage adapters.\n\t\t\t}\n\t\t\tfunction ack(msg, node){\n\t\t\t\tvar S = +new Date, ctx = msg._||{}, DBG = ctx.DBG = msg.DBG;\n\t\t\t\tvar to = msg['#'], id = text_rand(9), keys = Object.keys(node||'').sort(), soul = ((node||'')._||'')['#'], kl = keys.length, j = 0, root = msg.$._.root, F = (node === root.graph[soul]);\n\t\t\t\tconsole.STAT && console.STAT(S, ((DBG||ctx).gk = +new Date) - S, 'got keys');\n\t\t\t\t// PERF: Consider commenting this out to force disk-only reads for perf testing? // TODO: .keys( is slow\n\t\t\t\tnode && (function go(){\n\t\t\t\t\tS = +new Date;\n\t\t\t\t\tvar i = 0, k, put = {}, tmp;\n\t\t\t\t\twhile(i < 9 && (k = keys[i++])){\n\t\t\t\t\t\tstate_ify(put, k, state_is(node, k), node[k], soul);\n\t\t\t\t\t}\n\t\t\t\t\tkeys = keys.slice(i);\n\t\t\t\t\t(tmp = {})[soul] = put; put = tmp;\n\t\t\t\t\tvar faith; if(F){ faith = function(){}; faith.ram = faith.faith = true; } // HNPERF: We're testing performance improvement by skipping going through security again, but this should be audited.\n\t\t\t\t\ttmp = keys.length;\n\t\t\t\t\tconsole.STAT && console.STAT(S, -(S - (S = +new Date)), 'got copied some');\n\t\t\t\t\tDBG && (DBG.ga = +new Date);\n\t\t\t\t\troot.on('in', {'@': to, '#': id, put: put, '%': (tmp? (id = text_rand(9)) : u), $: root.$, _: faith, DBG: DBG, FOO: 1});\n\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'got in');\n\t\t\t\t\tif(!tmp){ return }\n\t\t\t\t\tsetTimeout.turn(go);\n\t\t\t\t}());\n\t\t\t\tif(!node){ root.on('in', {'@': msg['#']}) } // TODO: I don't think I like this, the default lS adapter uses this but \"not found\" is a sensitive issue, so should probably be handled more carefully/individually.\n\t\t\t} Gun.on.get.ack = ack;\n\t\t}());\n\n\t\t;(function(){\n\t\t\tGun.chain.opt = function(opt){\n\t\t\t\topt = opt || {};\n\t\t\t\tvar gun = this, at = gun._, tmp = opt.peers || opt;\n\t\t\t\tif(!Object.plain(opt)){ opt = {} }\n\t\t\t\tif(!Object.plain(at.opt)){ at.opt = opt }\n\t\t\t\tif('string' == typeof tmp){ tmp = [tmp] }\n\t\t\t\tif(!Object.plain(at.opt.peers)){ at.opt.peers = {}}\n\t\t\t\tif(tmp instanceof Array){\n\t\t\t\t\topt.peers = {};\n\t\t\t\t\ttmp.forEach(function(url){\n\t\t\t\t\t\tvar p = {}; p.id = p.url = url;\n\t\t\t\t\t\topt.peers[url] = at.opt.peers[url] = at.opt.peers[url] || p;\n\t\t\t\t\t})\n\t\t\t\t}\n\t\t\t\tobj_each(opt, function each(k){ var v = this[k];\n\t\t\t\t\tif((this && this.hasOwnProperty(k)) || 'string' == typeof v || Object.empty(v)){ this[k] = v; return }\n\t\t\t\t\tif(v && v.constructor !== Object && !(v instanceof Array)){ return }\n\t\t\t\t\tobj_each(v, each);\n\t\t\t\t});\n\t\t\t\tat.opt.from = opt;\n\t\t\t\tGun.on('opt', at);\n\t\t\t\tat.opt.uuid = at.opt.uuid || function uuid(l){ return Gun.state().toString(36).replace('.','') + String.random(l||12) }\n\t\t\t\treturn gun;\n\t\t\t}\n\t\t}());\n\n\t\tvar obj_each = function(o,f){ Object.keys(o).forEach(f,o) }, text_rand = String.random, turn = setTimeout.turn, valid = Gun.valid, state_is = Gun.state.is, state_ify = Gun.state.ify, u, empty = {}, C;\n\n\t\tGun.log = function(){ return (!Gun.log.off && C.log.apply(C, arguments)), [].slice.call(arguments).join(' ') };\n\t\tGun.log.once = function(w,s,o){ return (o = Gun.log.once)[w] = o[w] || 0, o[w]++ || Gun.log(s) };\n\n\t\tif(typeof window !== \"undefined\"){ (window.GUN = window.Gun = Gun).window = window }\n\t\ttry{ if(typeof MODULE !== \"undefined\"){ MODULE.exports = Gun } }catch(e){}\n\t\tmodule.exports = Gun;\n\t\t\n\t\t(Gun.window||{}).console = (Gun.window||{}).console || {log: function(){}};\n\t\t(C = console).only = function(i, s){ return (C.only.i && i === C.only.i && C.only.i++) && (C.log.apply(C, arguments) || s) };\n\n\t\t;\"Please do not remove welcome log unless you are paying for a monthly sponsorship, thanks!\";\n\t\tGun.log.once(\"welcome\", \"Hello wonderful person! :) Thanks for using GUN, please ask for help on http://chat.gun.eco if anything takes you longer than 5min to figure out!\");\n\t})(USE, './root');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./root');\n\t\tGun.chain.back = function(n, opt){ var tmp;\n\t\t\tn = n || 1;\n\t\t\tif(-1 === n || Infinity === n){\n\t\t\t\treturn this._.root.$;\n\t\t\t} else\n\t\t\tif(1 === n){\n\t\t\t\treturn (this._.back || this._).$;\n\t\t\t}\n\t\t\tvar gun = this, at = gun._;\n\t\t\tif(typeof n === 'string'){\n\t\t\t\tn = n.split('.');\n\t\t\t}\n\t\t\tif(n instanceof Array){\n\t\t\t\tvar i = 0, l = n.length, tmp = at;\n\t\t\t\tfor(i; i < l; i++){\n\t\t\t\t\ttmp = (tmp||empty)[n[i]];\n\t\t\t\t}\n\t\t\t\tif(u !== tmp){\n\t\t\t\t\treturn opt? gun : tmp;\n\t\t\t\t} else\n\t\t\t\tif((tmp = at.back)){\n\t\t\t\t\treturn tmp.$.back(n, opt);\n\t\t\t\t}\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif('function' == typeof n){\n\t\t\t\tvar yes, tmp = {back: at};\n\t\t\t\twhile((tmp = tmp.back)\n\t\t\t\t&& u === (yes = n(tmp, opt))){}\n\t\t\t\treturn yes;\n\t\t\t}\n\t\t\tif('number' == typeof n){\n\t\t\t\treturn (at.back || at).$.back(n - 1);\n\t\t\t}\n\t\t\treturn this;\n\t\t}\n\t\tvar empty = {}, u;\n\t})(USE, './back');\n\n\t;USE(function(module){\n\t\t// WARNING: GUN is very simple, but the JavaScript chaining API around GUN\n\t\t// is complicated and was extremely hard to build. If you port GUN to another\n\t\t// language, consider implementing an easier API to build.\n\t\tvar Gun = USE('./root');\n\t\tGun.chain.chain = function(sub){\n\t\t\tvar gun = this, at = gun._, chain = new (sub || gun).constructor(gun), cat = chain._, root;\n\t\t\tcat.root = root = at.root;\n\t\t\tcat.id = ++root.once;\n\t\t\tcat.back = gun._;\n\t\t\tcat.on = Gun.on;\n\t\t\tcat.on('in', Gun.on.in, cat); // For 'in' if I add my own listeners to each then I MUST do it before in gets called. If I listen globally for all incoming data instead though, regardless of individual listeners, I can transform the data there and then as well.\n\t\t\tcat.on('out', Gun.on.out, cat); // However for output, there isn't really the global option. I must listen by adding my own listener individually BEFORE this one is ever called.\n\t\t\treturn chain;\n\t\t}\n\n\t\tfunction output(msg){\n\t\t\tvar put, get, at = this.as, back = at.back, root = at.root, tmp;\n\t\t\tif(!msg.$){ msg.$ = at.$ }\n\t\t\tthis.to.next(msg);\n\t\t\tif(at.err){ at.on('in', {put: at.put = u, $: at.$}); return }\n\t\t\tif(get = msg.get){\n\t\t\t\t/*if(u !== at.put){\n\t\t\t\t\tat.on('in', at);\n\t\t\t\t\treturn;\n\t\t\t\t}*/\n\t\t\t\tif(root.pass){ root.pass[at.id] = at; } // will this make for buggy behavior elsewhere?\n\t\t\t\tif(at.lex){ Object.keys(at.lex).forEach(function(k){ tmp[k] = at.lex[k] }, tmp = msg.get = msg.get || {}) }\n\t\t\t\tif(get['#'] || at.soul){\n\t\t\t\t\tget['#'] = get['#'] || at.soul;\n\t\t\t\t\t//root.graph[get['#']] = root.graph[get['#']] || {_:{'#':get['#'],'>':{}}};\n\t\t\t\t\tmsg['#'] || (msg['#'] = text_rand(9)); // A3120 ?\n\t\t\t\t\tback = (root.$.get(get['#'])._);\n\t\t\t\t\tif(!(get = get['.'])){ // soul\n\t\t\t\t\t\ttmp = back.ask && back.ask['']; // check if we have already asked for the full node\n\t\t\t\t\t\t(back.ask || (back.ask = {}))[''] = back; // add a flag that we are now.\n\t\t\t\t\t\tif(u !== back.put){ // if we already have data,\n\t\t\t\t\t\t\tback.on('in', back); // send what is cached down the chain\n\t\t\t\t\t\t\tif(tmp){ return } // and don't ask for it again.\n\t\t\t\t\t\t}\n\t\t\t\t\t\tmsg.$ = back.$;\n\t\t\t\t\t} else\n\t\t\t\t\tif(obj_has(back.put, get)){ // TODO: support #LEX !\n\t\t\t\t\t\ttmp = back.ask && back.ask[get];\n\t\t\t\t\t\t(back.ask || (back.ask = {}))[get] = back.$.get(get)._;\n\t\t\t\t\t\tback.on('in', {get: get, put: {'#': back.soul, '.': get, ':': back.put[get], '>': state_is(root.graph[back.soul], get)}});\n\t\t\t\t\t\tif(tmp){ return }\n\t\t\t\t\t}\n\t\t\t\t\t\t/*put = (back.$.get(get)._);\n\t\t\t\t\t\tif(!(tmp = put.ack)){ put.ack = -1 }\n\t\t\t\t\t\tback.on('in', {\n\t\t\t\t\t\t\t$: back.$,\n\t\t\t\t\t\t\tput: Gun.state.ify({}, get, Gun.state(back.put, get), back.put[get]),\n\t\t\t\t\t\t\tget: back.get\n\t\t\t\t\t\t});\n\t\t\t\t\t\tif(tmp){ return }\n\t\t\t\t\t} else\n\t\t\t\t\tif('string' != typeof get){\n\t\t\t\t\t\tvar put = {}, meta = (back.put||{})._;\n\t\t\t\t\t\tGun.obj.map(back.put, function(v,k){\n\t\t\t\t\t\t\tif(!Gun.text.match(k, get)){ return }\n\t\t\t\t\t\t\tput[k] = v;\n\t\t\t\t\t\t})\n\t\t\t\t\t\tif(!Gun.obj.empty(put)){\n\t\t\t\t\t\t\tput._ = meta;\n\t\t\t\t\t\t\tback.on('in', {$: back.$, put: put, get: back.get})\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(tmp = at.lex){\n\t\t\t\t\t\t\ttmp = (tmp._) || (tmp._ = function(){});\n\t\t\t\t\t\t\tif(back.ack < tmp.ask){ tmp.ask = back.ack }\n\t\t\t\t\t\t\tif(tmp.ask){ return }\n\t\t\t\t\t\t\ttmp.ask = 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t*/\n\t\t\t\t\troot.ask(ack, msg); // A3120 ?\n\t\t\t\t\treturn root.on('in', msg);\n\t\t\t\t}\n\t\t\t\t//if(root.now){ root.now[at.id] = root.now[at.id] || true; at.pass = {} }\n\t\t\t\tif(get['.']){\n\t\t\t\t\tif(at.get){\n\t\t\t\t\t\tmsg = {get: {'.': at.get}, $: at.$};\n\t\t\t\t\t\t(back.ask || (back.ask = {}))[at.get] = msg.$._; // TODO: PERFORMANCE? More elegant way?\n\t\t\t\t\t\treturn back.on('out', msg);\n\t\t\t\t\t}\n\t\t\t\t\tmsg = {get: at.lex? msg.get : {}, $: at.$};\n\t\t\t\t\treturn back.on('out', msg);\n\t\t\t\t}\n\t\t\t\t(at.ask || (at.ask = {}))[''] = at;\t //at.ack = at.ack || -1;\n\t\t\t\tif(at.get){\n\t\t\t\t\tget['.'] = at.get;\n\t\t\t\t\t(back.ask || (back.ask = {}))[at.get] = msg.$._; // TODO: PERFORMANCE? More elegant way?\n\t\t\t\t\treturn back.on('out', msg);\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn back.on('out', msg);\n\t\t}; Gun.on.out = output;\n\n\t\tfunction input(msg, cat){ cat = cat || this.as; // TODO: V8 may not be able to optimize functions with different parameter calls, so try to do benchmark to see if there is any actual difference.\n\t\t\tvar root = cat.root, gun = msg.$ || (msg.$ = cat.$), at = (gun||'')._ || empty, tmp = msg.put||'', soul = tmp['#'], key = tmp['.'], change = (u !== tmp['='])? tmp['='] : tmp[':'], state = tmp['>'] || -Infinity, sat; // eve = event, at = data at, cat = chain at, sat = sub at (children chains).\n\t\t\tif(u !== msg.put && (u === tmp['#'] || u === tmp['.'] || (u === tmp[':'] && u === tmp['=']) || u === tmp['>'])){ // convert from old format\n\t\t\t\tif(!valid(tmp)){\n\t\t\t\t\tif(!(soul = ((tmp||'')._||'')['#'])){ console.log(\"chain not yet supported for\", tmp, '...', msg, cat); return; }\n\t\t\t\t\tgun = cat.root.$.get(soul);\n\t\t\t\t\treturn setTimeout.each(Object.keys(tmp).sort(), function(k){ // TODO: .keys( is slow // BUG? ?Some re-in logic may depend on this being sync?\n\t\t\t\t\t\tif('_' == k || u === (state = state_is(tmp, k))){ return }\n\t\t\t\t\t\tcat.on('in', {$: gun, put: {'#': soul, '.': k, '=': tmp[k], '>': state}, VIA: msg});\n\t\t\t\t\t});\n\t\t\t\t}\n\t\t\t\tcat.on('in', {$: at.back.$, put: {'#': soul = at.back.soul, '.': key = at.has || at.get, '=': tmp, '>': state_is(at.back.put, key)}, via: msg}); // TODO: This could be buggy! It assumes/approxes data, other stuff could have corrupted it.\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif((msg.seen||'')[cat.id]){ return } (msg.seen || (msg.seen = function(){}))[cat.id] = cat; // help stop some infinite loops\n\n\t\t\tif(cat !== at){ // don't worry about this when first understanding the code, it handles changing contexts on a message. A soul chain will never have a different context.\n\t\t\t\tObject.keys(msg).forEach(function(k){ tmp[k] = msg[k] }, tmp = {}); // make copy of message\n\t\t\t\ttmp.get = cat.get || tmp.get;\n\t\t\t\tif(!cat.soul && !cat.has){ // if we do not recognize the chain type\n\t\t\t\t\ttmp.$$$ = tmp.$$$ || cat.$; // make a reference to wherever it came from.\n\t\t\t\t} else\n\t\t\t\tif(at.soul){ // a has (property) chain will have a different context sometimes if it is linked (to a soul chain). Anything that is not a soul or has chain, will always have different contexts.\n\t\t\t\t\ttmp.$ = cat.$;\n\t\t\t\t\ttmp.$$ = tmp.$$ || at.$;\n\t\t\t\t}\n\t\t\t\tmsg = tmp; // use the message with the new context instead;\n\t\t\t}\n\t\t\tunlink(msg, cat);\n\n\t\t\tif(((cat.soul/* && (cat.ask||'')['']*/) || msg.$$) && state >= state_is(root.graph[soul], key)){ // The root has an in-memory cache of the graph, but if our peer has asked for the data then we want a per deduplicated chain copy of the data that might have local edits on it.\n\t\t\t\t(tmp = root.$.get(soul)._).put = state_ify(tmp.put, key, state, change, soul);\n\t\t\t}\n\t\t\tif(!at.soul /*&& (at.ask||'')['']*/ && state >= state_is(root.graph[soul], key) && (sat = (root.$.get(soul)._.next||'')[key])){ // Same as above here, but for other types of chains. // TODO: Improve perf by preventing echoes recaching.\n\t\t\t\tsat.put = change; // update cache\n\t\t\t\tif('string' == typeof (tmp = valid(change))){\n\t\t\t\t\tsat.put = root.$.get(tmp)._.put || change; // share same cache as what we're linked to.\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tthis.to && this.to.next(msg); // 1st API job is to call all chain listeners.\n\t\t\t// TODO: Make input more reusable by only doing these (some?) calls if we are a chain we recognize? This means each input listener would be responsible for when listeners need to be called, which makes sense, as they might want to filter.\n\t\t\tcat.any && setTimeout.each(Object.keys(cat.any), function(any){ (any = cat.any[any]) && any(msg) },0,99); // 1st API job is to call all chain listeners. // TODO: .keys( is slow // BUG: Some re-in logic may depend on this being sync.\n\t\t\tcat.echo && setTimeout.each(Object.keys(cat.echo), function(lat){ (lat = cat.echo[lat]) && lat.on('in', msg) },0,99); // & linked at chains // TODO: .keys( is slow // BUG: Some re-in logic may depend on this being sync.\n\n\t\t\tif(((msg.$$||'')._||at).soul){ // comments are linear, but this line of code is non-linear, so if I were to comment what it does, you'd have to read 42 other comments first... but you can't read any of those comments until you first read this comment. What!? // shouldn't this match link's check?\n\t\t\t\t// is there cases where it is a $$ that we do NOT want to do the following? \n\t\t\t\tif((sat = cat.next) && (sat = sat[key])){ // TODO: possible trick? Maybe have `ionmap` code set a sat? // TODO: Maybe we should do `cat.ask` instead? I guess does not matter.\n\t\t\t\t\ttmp = {}; Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] });\n\t\t\t\t\ttmp.$ = (msg.$$||msg.$).get(tmp.get = key); delete tmp.$$; delete tmp.$$$;\n\t\t\t\t\tsat.on('in', tmp);\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tlink(msg, cat);\n\t\t}; Gun.on.in = input;\n\n\t\tfunction link(msg, cat){ cat = cat || this.as || msg.$._;\n\t\t\tif(msg.$$ && this !== Gun.on){ return } // $$ means we came from a link, so we are at the wrong level, thus ignore it unless overruled manually by being called directly.\n\t\t\tif(!msg.put || cat.soul){ return } // But you cannot overrule being linked to nothing, or trying to link a soul chain - that must never happen.\n\t\t\tvar put = msg.put||'', link = put['=']||put[':'], tmp;\n\t\t\tvar root = cat.root, tat = root.$.get(put['#']).get(put['.'])._;\n\t\t\tif('string' != typeof (link = valid(link))){\n\t\t\t\tif(this === Gun.on){ (tat.echo || (tat.echo = {}))[cat.id] = cat } // allow some chain to explicitly force linking to simple data.\n\t\t\t\treturn; // by default do not link to data that is not a link.\n\t\t\t}\n\t\t\tif((tat.echo || (tat.echo = {}))[cat.id] // we've already linked ourselves so we do not need to do it again. Except... (annoying implementation details)\n\t\t\t\t&& !(root.pass||'')[cat.id]){ return } // if a new event listener was added, we need to make a pass through for it. The pass will be on the chain, not always the chain passed down. \n\t\t\tif(tmp = root.pass){ if(tmp[link+cat.id]){ return } tmp[link+cat.id] = 1 } // But the above edge case may \"pass through\" on a circular graph causing infinite passes, so we hackily add a temporary check for that.\n\n\t\t\t(tat.echo||(tat.echo={}))[cat.id] = cat; // set ourself up for the echo! // TODO: BUG? Echo to self no longer causes problems? Confirm.\n\n\t\t\tif(cat.has){ cat.link = link }\n\t\t\tvar sat = root.$.get(tat.link = link)._; // grab what we're linking to.\n\t\t\t(sat.echo || (sat.echo = {}))[tat.id] = tat; // link it.\n\t\t\tvar tmp = cat.ask||''; // ask the chain for what needs to be loaded next!\n\t\t\tif(tmp[''] || cat.lex){ // we might need to load the whole thing // TODO: cat.lex probably has edge case bugs to it, need more test coverage.\n\t\t\t\tsat.on('out', {get: {'#': link}});\n\t\t\t}\n\t\t\tsetTimeout.each(Object.keys(tmp), function(get, sat){ // if sub chains are asking for data. // TODO: .keys( is slow // BUG? ?Some re-in logic may depend on this being sync?\n\t\t\t\tif(!get || !(sat = tmp[get])){ return }\n\t\t\t\tsat.on('out', {get: {'#': link, '.': get}}); // go get it.\n\t\t\t},0,99);\n\t\t}; Gun.on.link = link;\n\n\t\tfunction unlink(msg, cat){ // ugh, so much code for seemingly edge case behavior.\n\t\t\tvar put = msg.put||'', change = (u !== put['='])? put['='] : put[':'], root = cat.root, link, tmp;\n\t\t\tif(u === change){ // 1st edge case: If we have a brand new database, no data will be found.\n\t\t\t\t// TODO: BUG! because emptying cache could be async from below, make sure we are not emptying a newer cache. So maybe pass an Async ID to check against?\n\t\t\t\t// TODO: BUG! What if this is a map? // Warning! Clearing things out needs to be robust against sync/async ops, or else you'll see `map val get put` test catastrophically fail because map attempts to link when parent graph is streamed before child value gets set. Need to differentiate between lack acks and force clearing.\n\t\t\t\tif(cat.soul && u !== cat.put){ return } // data may not be found on a soul, but if a soul already has data, then nothing can clear the soul as a whole.\n\t\t\t\t//if(!cat.has){ return }\n\t\t\t\ttmp = (msg.$$||msg.$||'')._||'';\n\t\t\t\tif(msg['@'] && (u !== tmp.put || u !== cat.put)){ return } // a \"not found\" from other peers should not clear out data if we have already found it.\n\t\t\t\t//if(cat.has && u === cat.put && !(root.pass||'')[cat.id]){ return } // if we are already unlinked, do not call again, unless edge case. // TODO: BUG! This line should be deleted for \"unlink deeply nested\".\n\t\t\t\tif(link = cat.link || msg.linked){\n\t\t\t\t\tdelete (root.$.get(link)._.echo||'')[cat.id];\n\t\t\t\t}\n\t\t\t\tif(cat.has){ // TODO: Empty out links, maps, echos, acks/asks, etc.?\n\t\t\t\t\tcat.link = null;\n\t\t\t\t}\n\t\t\t\tcat.put = u; // empty out the cache if, for example, alice's car's color no longer exists (relative to alice) if alice no longer has a car.\n\t\t\t\t// TODO: BUG! For maps, proxy this so the individual sub is triggered, not all subs.\n\t\t\t\tsetTimeout.each(Object.keys(cat.next||''), function(get, sat){ // empty out all sub chains. // TODO: .keys( is slow // BUG? ?Some re-in logic may depend on this being sync? // TODO: BUG? This will trigger deeper put first, does put logic depend on nested order? // TODO: BUG! For map, this needs to be the isolated child, not all of them.\n\t\t\t\t\tif(!(sat = cat.next[get])){ return }\n\t\t\t\t\t//if(cat.has && u === sat.put && !(root.pass||'')[sat.id]){ return } // if we are already unlinked, do not call again, unless edge case. // TODO: BUG! This line should be deleted for \"unlink deeply nested\".\n\t\t\t\t\tif(link){ delete (root.$.get(link).get(get)._.echo||'')[sat.id] }\n\t\t\t\t\tsat.on('in', {get: get, put: u, $: sat.$}); // TODO: BUG? Add recursive seen check?\n\t\t\t\t},0,99);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(cat.soul){ return } // a soul cannot unlink itself.\n\t\t\tif(msg.$$){ return } // a linked chain does not do the unlinking, the sub chain does. // TODO: BUG? Will this cancel maps?\n\t\t\tlink = valid(change); // need to unlink anytime we are not the same link, though only do this once per unlink (and not on init).\n\t\t\ttmp = msg.$._||'';\n\t\t\tif(link === tmp.link || (cat.has && !tmp.link)){\n\t\t\t\tif((root.pass||'')[cat.id] && 'string' !== typeof link){\n\n\t\t\t\t} else {\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\tdelete (tmp.echo||'')[cat.id];\n\t\t\tunlink({get: cat.get, put: u, $: msg.$, linked: msg.linked = msg.linked || tmp.link}, cat); // unlink our sub chains.\n\t\t}; Gun.on.unlink = unlink;\n\n\t\tfunction ack(msg, ev){\n\t\t\t//if(!msg['%'] && (this||'').off){ this.off() } // do NOT memory leak, turn off listeners! Now handled by .ask itself\n\t\t\t// manhattan:\n\t\t\tvar as = this.as, at = as.$._, root = at.root, get = as.get||'', tmp = (msg.put||'')[get['#']]||'';\n\t\t\tif(!msg.put || ('string' == typeof get['.'] && u === tmp[get['.']])){\n\t\t\t\tif(u !== at.put){ return }\n\t\t\t\tif(!at.soul && !at.has){ return } // TODO: BUG? For now, only core-chains will handle not-founds, because bugs creep in if non-core chains are used as $ but we can revisit this later for more powerful extensions.\n\t\t\t\tat.ack = (at.ack || 0) + 1;\n\t\t\t\tat.on('in', {\n\t\t\t\t\tget: at.get,\n\t\t\t\t\tput: at.put = u,\n\t\t\t\t\t$: at.$,\n\t\t\t\t\t'@': msg['@']\n\t\t\t\t});\n\t\t\t\t/*(tmp = at.Q) && setTimeout.each(Object.keys(tmp), function(id){ // TODO: Temporary testing, not integrated or being used, probably delete.\n\t\t\t\t\tObject.keys(msg).forEach(function(k){ tmp[k] = msg[k] }, tmp = {}); tmp['@'] = id; // copy message\n\t\t\t\t\troot.on('in', tmp);\n\t\t\t\t}); delete at.Q;*/\n\t\t\t\treturn;\n\t\t\t}\n\t\t\t(msg._||{}).miss = 1;\n\t\t\tGun.on.put(msg);\n\t\t\treturn; // eom\n\t\t}\n\n\t\tvar empty = {}, u, text_rand = String.random, valid = Gun.valid, obj_has = function(o, k){ return o && Object.prototype.hasOwnProperty.call(o, k) }, state = Gun.state, state_is = state.is, state_ify = state.ify;\n\t})(USE, './chain');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./root');\n\t\tGun.chain.get = function(key, cb, as){\n\t\t\tvar gun, tmp;\n\t\t\tif(typeof key === 'string'){\n\t\t\t\tif(key.length == 0) {\t\n\t\t\t\t\t(gun = this.chain())._.err = {err: Gun.log('0 length key!', key)};\n\t\t\t\t\tif(cb){ cb.call(gun, gun._.err) }\n\t\t\t\t\treturn gun;\n\t\t\t\t}\n\t\t\t\tvar back = this, cat = back._;\n\t\t\t\tvar next = cat.next || empty;\n\t\t\t\tif(!(gun = next[key])){\n\t\t\t\t\tgun = key && cache(key, back);\n\t\t\t\t}\n\t\t\t\tgun = gun && gun.$;\n\t\t\t} else\n\t\t\tif('function' == typeof key){\n\t\t\t\tif(true === cb){ return soul(this, key, cb, as), this }\n\t\t\t\tgun = this;\n\t\t\t\tvar cat = gun._, opt = cb || {}, root = cat.root, id;\n\t\t\t\topt.at = cat;\n\t\t\t\topt.ok = key;\n\t\t\t\tvar wait = {}; // can we assign this to the at instead, like in once?\n\t\t\t\t//var path = []; cat.$.back(at => { at.get && path.push(at.get.slice(0,9))}); path = path.reverse().join('.');\n\t\t\t\tfunction any(msg, eve, f){\n\t\t\t\t\tif(any.stun){ return }\n\t\t\t\t\tif((tmp = root.pass) && !tmp[id]){ return }\n\t\t\t\t\tvar at = msg.$._, sat = (msg.$$||'')._, data = (sat||at).put, odd = (!at.has && !at.soul), test = {}, link, tmp;\n\t\t\t\t\tif(odd || u === data){ // handles non-core\n\t\t\t\t\t\tdata = (u === ((tmp = msg.put)||'')['='])? (u === (tmp||'')[':'])? tmp : tmp[':'] : tmp['='];\n\t\t\t\t\t}\n\t\t\t\t\tif(link = ('string' == typeof (tmp = Gun.valid(data)))){\n\t\t\t\t\t\tdata = (u === (tmp = root.$.get(tmp)._.put))? opt.not? u : data : tmp;\n\t\t\t\t\t}\n\t\t\t\t\tif(opt.not && u === data){ return }\n\t\t\t\t\tif(u === opt.stun){\n\t\t\t\t\t\tif((tmp = root.stun) && tmp.on){\n\t\t\t\t\t\t\tcat.$.back(function(a){ // our chain stunned?\n\t\t\t\t\t\t\t\ttmp.on(''+a.id, test = {});\n\t\t\t\t\t\t\t\tif((test.run || 0) < any.id){ return test } // if there is an earlier stun on gapless parents/self.\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\t!test.run && tmp.on(''+at.id, test = {}); // this node stunned?\n\t\t\t\t\t\t\t!test.run && sat && tmp.on(''+sat.id, test = {}); // linked node stunned?\n\t\t\t\t\t\t\tif(any.id > test.run){\n\t\t\t\t\t\t\t\tif(!test.stun || test.stun.end){\n\t\t\t\t\t\t\t\t\ttest.stun = tmp.on('stun');\n\t\t\t\t\t\t\t\t\ttest.stun = test.stun && test.stun.last;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t\tif(test.stun && !test.stun.end){\n\t\t\t\t\t\t\t\t\t//if(odd && u === data){ return }\n\t\t\t\t\t\t\t\t\t//if(u === msg.put){ return } // \"not found\" acks will be found if there is stun, so ignore these.\n\t\t\t\t\t\t\t\t\t(test.stun.add || (test.stun.add = {}))[id] = function(){ any(msg,eve,1) } // add ourself to the stun callback list that is called at end of the write.\n\t\t\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(/*odd &&*/ u === data){ f = 0 } // if data not found, keep waiting/trying.\n\t\t\t\t\t\t/*if(f && u === data){\n\t\t\t\t\t\t\tcat.on('out', opt.out);\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}*/\n\t\t\t\t\t\tif((tmp = root.hatch) && !tmp.end && u === opt.hatch && !f){ // quick hack! // What's going on here? Because data is streamed, we get things one by one, but a lot of developers would rather get a callback after each batch instead, so this does that by creating a wait list per chain id that is then called at the end of the batch by the hatch code in the root put listener.\n\t\t\t\t\t\t\tif(wait[at.$._.id]){ return } wait[at.$._.id] = 1;\n\t\t\t\t\t\t\ttmp.push(function(){any(msg,eve,1)});\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}; wait = {}; // end quick hack.\n\t\t\t\t\t}\n\t\t\t\t\t// call:\n\t\t\t\t\tif(root.pass){ if(root.pass[id+at.id]){ return } root.pass[id+at.id] = 1 }\n\t\t\t\t\tif(opt.on){ opt.ok.call(at.$, data, at.get, msg, eve || any); return } // TODO: Also consider breaking `this` since a lot of people do `=>` these days and `.call(` has slower performance.\n\t\t\t\t\tif(opt.v2020){ opt.ok(msg, eve || any); return }\n\t\t\t\t\tObject.keys(msg).forEach(function(k){ tmp[k] = msg[k] }, tmp = {}); msg = tmp; msg.put = data; // 2019 COMPATIBILITY! TODO: GET RID OF THIS!\n\t\t\t\t\topt.ok.call(opt.as, msg, eve || any); // is this the right\n\t\t\t\t};\n\t\t\t\tany.at = cat;\n\t\t\t\t//(cat.any||(cat.any=function(msg){ setTimeout.each(Object.keys(cat.any||''), function(act){ (act = cat.any[act]) && act(msg) },0,99) }))[id = String.random(7)] = any; // maybe switch to this in future?\n\t\t\t\t(cat.any||(cat.any={}))[id = String.random(7)] = any;\n\t\t\t\tany.off = function(){ any.stun = 1; if(!cat.any){ return } delete cat.any[id] }\n\t\t\t\tany.rid = rid; // logic from old version, can we clean it up now?\n\t\t\t\tany.id = opt.run || ++root.once; // used in callback to check if we are earlier than a write. // will this ever cause an integer overflow?\n\t\t\t\ttmp = root.pass; (root.pass = {})[id] = 1; // Explanation: test trade-offs want to prevent recursion so we add/remove pass flag as it gets fulfilled to not repeat, however map map needs many pass flags - how do we reconcile?\n\t\t\t\topt.out = opt.out || {get: {}};\n\t\t\t\tcat.on('out', opt.out);\n\t\t\t\troot.pass = tmp;\n\t\t\t\treturn gun;\n\t\t\t} else\n\t\t\tif('number' == typeof key){\n\t\t\t\treturn this.get(''+key, cb, as);\n\t\t\t} else\n\t\t\tif('string' == typeof (tmp = valid(key))){\n\t\t\t\treturn this.get(tmp, cb, as);\n\t\t\t} else\n\t\t\tif(tmp = this.get.next){\n\t\t\t\tgun = tmp(this, key);\n\t\t\t}\n\t\t\tif(!gun){\n\t\t\t\t(gun = this.chain())._.err = {err: Gun.log('Invalid get request!', key)}; // CLEAN UP\n\t\t\t\tif(cb){ cb.call(gun, gun._.err) }\n\t\t\t\treturn gun;\n\t\t\t}\n\t\t\tif(cb && 'function' == typeof cb){\n\t\t\t\tgun.get(cb, as);\n\t\t\t}\n\t\t\treturn gun;\n\t\t}\n\t\tfunction cache(key, back){\n\t\t\tvar cat = back._, next = cat.next, gun = back.chain(), at = gun._;\n\t\t\tif(!next){ next = cat.next = {} }\n\t\t\tnext[at.get = key] = at;\n\t\t\tif(back === cat.root.$){\n\t\t\t\tat.soul = key;\n\t\t\t\t//at.put = {};\n\t\t\t} else\n\t\t\tif(cat.soul || cat.has){\n\t\t\t\tat.has = key;\n\t\t\t\t//if(obj_has(cat.put, key)){\n\t\t\t\t\t//at.put = cat.put[key];\n\t\t\t\t//}\n\t\t\t}\n\t\t\treturn at;\n\t\t}\n\t\tfunction soul(gun, cb, opt, as){\n\t\t\tvar cat = gun._, acks = 0, tmp;\n\t\t\tif(tmp = cat.soul || cat.link){ return cb(tmp, as, cat) }\n\t\t\tif(cat.jam){ return cat.jam.push([cb, as]) }\n\t\t\tcat.jam = [[cb,as]];\n\t\t\tgun.get(function go(msg, eve){\n\t\t\t\tif(u === msg.put && !cat.root.opt.super && (tmp = Object.keys(cat.root.opt.peers).length) && ++acks <= tmp){ // TODO: super should not be in core code, bring AXE up into core instead to fix? // TODO: .keys( is slow\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\teve.rid(msg);\n\t\t\t\tvar at = ((at = msg.$) && at._) || {}, i = 0, as;\n\t\t\t\ttmp = cat.jam; delete cat.jam; // tmp = cat.jam.splice(0, 100);\n\t\t\t\t//if(tmp.length){ process.nextTick(function(){ go(msg, eve) }) }\n\t\t\t\twhile(as = tmp[i++]){ //Gun.obj.map(tmp, function(as, cb){\n\t\t\t\t\tvar cb = as[0], id; as = as[1];\n\t\t\t\t\tcb && cb(id = at.link || at.soul || Gun.valid(msg.put) || ((msg.put||{})._||{})['#'], as, msg, eve);\n\t\t\t\t} //);\n\t\t\t}, {out: {get: {'.':true}}});\n\t\t\treturn gun;\n\t\t}\n\t\tfunction rid(at){\n\t\t\tvar cat = this.at || this.on;\n\t\t\tif(!at || cat.soul || cat.has){ return this.off() }\n\t\t\tif(!(at = (at = (at = at.$ || at)._ || at).id)){ return }\n\t\t\tvar map = cat.map, tmp, seen;\n\t\t\t//if(!map || !(tmp = map[at]) || !(tmp = tmp.at)){ return }\n\t\t\tif(tmp = (seen = this.seen || (this.seen = {}))[at]){ return true }\n\t\t\tseen[at] = true;\n\t\t\treturn;\n\t\t\t//tmp.echo[cat.id] = {}; // TODO: Warning: This unsubscribes ALL of this chain's listeners from this link, not just the one callback event.\n\t\t\t//obj.del(map, at); // TODO: Warning: This unsubscribes ALL of this chain's listeners from this link, not just the one callback event.\n\t\t\treturn;\n\t\t}\n\t\tvar empty = {}, valid = Gun.valid, u;\n\t})(USE, './get');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./root');\n\t\tGun.chain.put = function(data, cb, as){ // I rewrote it :)\n\t\t\tvar gun = this, at = gun._, root = at.root;\n\t\t\tas = as || {};\n\t\t\tas.root = at.root;\n\t\t\tas.run || (as.run = root.once);\n\t\t\tstun(as, at.id); // set a flag for reads to check if this chain is writing.\n\t\t\tas.ack = as.ack || cb;\n\t\t\tas.via = as.via || gun;\n\t\t\tas.data = as.data || data;\n\t\t\tas.soul || (as.soul = at.soul || ('string' == typeof cb && cb));\n\t\t\tvar s = as.state = as.state || Gun.state();\n\t\t\tif('function' == typeof data){ data(function(d){ as.data = d; gun.put(u,u,as) }); return gun }\n\t\t\tif(!as.soul){ return get(as), gun }\n\t\t\tas.$ = root.$.get(as.soul); // TODO: This may not allow user chaining and similar?\n\t\t\tas.todo = [{it: as.data, ref: as.$}];\n\t\t\tas.turn = as.turn || turn;\n\t\t\tas.ran = as.ran || ran;\n\t\t\t//var path = []; as.via.back(at => { at.get && path.push(at.get.slice(0,9)) }); path = path.reverse().join('.');\n\t\t\t// TODO: Perf! We only need to stun chains that are being modified, not necessarily written to.\n\t\t\t(function walk(){\n\t\t\t\tvar to = as.todo, at = to.pop(), d = at.it, cid = at.ref && at.ref._.id, v, k, cat, tmp, g;\n\t\t\t\tstun(as, at.ref);\n\t\t\t\tif(tmp = at.todo){\n\t\t\t\t\tk = tmp.pop(); d = d[k];\n\t\t\t\t\tif(tmp.length){ to.push(at) }\n\t\t\t\t}\n\t\t\t\tk && (to.path || (to.path = [])).push(k);\n\t\t\t\tif(!(v = valid(d)) && !(g = Gun.is(d))){\n\t\t\t\t\tif(!Object.plain(d)){ ran.err(as, \"Invalid data: \"+ check(d) +\" at \" + (as.via.back(function(at){at.get && tmp.push(at.get)}, tmp = []) || tmp.join('.'))+'.'+(to.path||[]).join('.')); return }\n\t\t\t\t\tvar seen = as.seen || (as.seen = []), i = seen.length;\n\t\t\t\t\twhile(i--){ if(d === (tmp = seen[i]).it){ v = d = tmp.link; break } }\n\t\t\t\t}\n\t\t\t\tif(k && v){ at.node = state_ify(at.node, k, s, d) } // handle soul later.\n\t\t\t\telse {\n\t\t\t\t\tif(!as.seen){ ran.err(as, \"Data at root of graph must be a node (an object).\"); return }\n\t\t\t\t\tas.seen.push(cat = {it: d, link: {}, todo: g? [] : Object.keys(d).sort().reverse(), path: (to.path||[]).slice(), up: at}); // Any perf reasons to CPU schedule this .keys( ?\n\t\t\t\t\tat.node = state_ify(at.node, k, s, cat.link);\n\t\t\t\t\t!g && cat.todo.length && to.push(cat);\n\t\t\t\t\t// ---------------\n\t\t\t\t\tvar id = as.seen.length;\n\t\t\t\t\t(as.wait || (as.wait = {}))[id] = '';\n\t\t\t\t\ttmp = (cat.ref = (g? d : k? at.ref.get(k) : at.ref))._;\n\t\t\t\t\t(tmp = (d && (d._||'')['#']) || tmp.soul || tmp.link)? resolve({soul: tmp}) : cat.ref.get(resolve, {run: as.run, /*hatch: 0,*/ v2020:1, out:{get:{'.':' '}}}); // TODO: BUG! This should be resolve ONLY soul to prevent full data from being loaded. // Fixed now?\n\t\t\t\t\t//setTimeout(function(){ if(F){ return } console.log(\"I HAVE NOT BEEN CALLED!\", path, id, cat.ref._.id, k) }, 9000); var F; // MAKE SURE TO ADD F = 1 below!\n\t\t\t\t\tfunction resolve(msg, eve){\n\t\t\t\t\t\tvar end = cat.link['#'];\n\t\t\t\t\t\tif(eve){ eve.off(); eve.rid(msg) } // TODO: Too early! Check all peers ack not found.\n\t\t\t\t\t\t// TODO: BUG maybe? Make sure this does not pick up a link change wipe, that it uses the changign link instead.\n\t\t\t\t\t\tvar soul = end || msg.soul || (tmp = (msg.$$||msg.$)._||'').soul || tmp.link || ((tmp = tmp.put||'')._||'')['#'] || tmp['#'] || (((tmp = msg.put||'') && msg.$$)? tmp['#'] : (tmp['=']||tmp[':']||'')['#']);\n\t\t\t\t\t\t!end && stun(as, msg.$);\n\t\t\t\t\t\tif(!soul && !at.link['#']){ // check soul link above us\n\t\t\t\t\t\t\t(at.wait || (at.wait = [])).push(function(){ resolve(msg, eve) }) // wait\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(!soul){\n\t\t\t\t\t\t\tsoul = [];\n\t\t\t\t\t\t\t(msg.$$||msg.$).back(function(at){\n\t\t\t\t\t\t\t\tif(tmp = at.soul || at.link){ return soul.push(tmp) }\n\t\t\t\t\t\t\t\tsoul.push(at.get);\n\t\t\t\t\t\t\t});\n\t\t\t\t\t\t\tsoul = soul.reverse().join('/');\n\t\t\t\t\t\t}\n\t\t\t\t\t\tcat.link['#'] = soul;\n\t\t\t\t\t\t!g && (((as.graph || (as.graph = {}))[soul] = (cat.node || (cat.node = {_:{}})))._['#'] = soul);\n\t\t\t\t\t\tdelete as.wait[id];\n\t\t\t\t\t\tcat.wait && setTimeout.each(cat.wait, function(cb){ cb && cb() });\n\t\t\t\t\t\tas.ran(as);\n\t\t\t\t\t};\n\t\t\t\t\t// ---------------\n\t\t\t\t}\n\t\t\t\tif(!to.length){ return as.ran(as) }\n\t\t\t\tas.turn(walk);\n\t\t\t}());\n\t\t\treturn gun;\n\t\t}\n\n\t\tfunction stun(as, id){\n\t\t\tif(!id){ return } id = (id._||'').id||id;\n\t\t\tvar run = as.root.stun || (as.root.stun = {on: Gun.on}), test = {}, tmp;\n\t\t\tas.stun || (as.stun = run.on('stun', function(){ }));\n\t\t\tif(tmp = run.on(''+id)){ tmp.the.last.next(test) }\n\t\t\tif(test.run >= as.run){ return }\n\t\t\trun.on(''+id, function(test){\n\t\t\t\tif(as.stun.end){\n\t\t\t\t\tthis.off();\n\t\t\t\t\tthis.to.next(test);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\ttest.run = test.run || as.run;\n\t\t\t\ttest.stun = test.stun || as.stun; return;\n\t\t\t\tif(this.to.to){\n\t\t\t\t\tthis.the.last.next(test);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\ttest.stun = as.stun;\n\t\t\t});\n\t\t}\n\n\t\tfunction ran(as){\n\t\t\tif(as.err){ ran.end(as.stun, as.root); return } // move log handle here.\n\t\t\tif(as.todo.length || as.end || !Object.empty(as.wait)){ return } as.end = 1;\n\t\t\t//(as.retry = function(){ as.acks = 0;\n\t\t\tvar cat = (as.$.back(-1)._), root = cat.root, ask = cat.ask(function(ack){\n\t\t\t\troot.on('ack', ack);\n\t\t\t\tif(ack.err && !ack.lack){ Gun.log(ack) }\n\t\t\t\tif(++acks > (as.acks || 0)){ this.off() } // Adjustable ACKs! Only 1 by default.\n\t\t\t\tif(!as.ack){ return }\n\t\t\t\tas.ack(ack, this);\n\t\t\t}, as.opt), acks = 0, stun = as.stun, tmp;\n\t\t\t(tmp = function(){ // this is not official yet, but quick solution to hack in for now.\n\t\t\t\tif(!stun){ return }\n\t\t\t\tran.end(stun, root);\n\t\t\t\tsetTimeout.each(Object.keys(stun = stun.add||''), function(cb){ if(cb = stun[cb]){cb()} }); // resume the stunned reads // Any perf reasons to CPU schedule this .keys( ?\n\t\t\t}).hatch = tmp; // this is not official yet ^\n\t\t\t//console.log(1, \"PUT\", as.run, as.graph);\n\t\t\tif(as.ack && !as.ok){ as.ok = as.acks || 9 } // TODO: In future! Remove this! This is just old API support.\n\t\t\t(as.via._).on('out', {put: as.out = as.graph, ok: as.ok && {'@': as.ok+1}, opt: as.opt, '#': ask, _: tmp});\n\t\t\t//})();\n\t\t}; ran.end = function(stun,root){\n\t\t\tstun.end = noop; // like with the earlier id, cheaper to make this flag a function so below callbacks do not have to do an extra type check.\n\t\t\tif(stun.the.to === stun && stun === stun.the.last){ delete root.stun }\n\t\t\tstun.off();\n\t\t}; ran.err = function(as, err){\n\t\t\t(as.ack||noop).call(as, as.out = { err: as.err = Gun.log(err) });\n\t\t\tas.ran(as);\n\t\t}\n\n\t\tfunction get(as){\n\t\t\tvar at = as.via._, tmp;\n\t\t\tas.via = as.via.back(function(at){\n\t\t\t\tif(at.soul || !at.get){ return at.$ }\n\t\t\t\ttmp = as.data; (as.data = {})[at.get] = tmp;\n\t\t\t});\n\t\t\tif(!as.via || !as.via._.soul){\n\t\t\t\tas.via = at.root.$.get(((as.data||'')._||'')['#'] || at.$.back('opt.uuid')())\n\t\t\t}\n\t\t\tas.via.put(as.data, as.ack, as);\n\t\t\t\n\n\t\t\treturn;\n\t\t\tif(at.get && at.back.soul){\n\t\t\t\ttmp = as.data;\n\t\t\t\tas.via = at.back.$;\n\t\t\t\t(as.data = {})[at.get] = tmp; \n\t\t\t\tas.via.put(as.data, as.ack, as);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tfunction check(d, tmp){ return ((d && (tmp = d.constructor) && tmp.name) || typeof d) }\n\n\t\tvar u, empty = {}, noop = function(){}, turn = setTimeout.turn, valid = Gun.valid, state_ify = Gun.state.ify;\n\t\tvar iife = function(fn,as){fn.call(as||empty)}\n\t})(USE, './put');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./root');\n\t\tUSE('./chain');\n\t\tUSE('./back');\n\t\tUSE('./put');\n\t\tUSE('./get');\n\t\tmodule.exports = Gun;\n\t})(USE, './index');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./index');\n\t\tGun.chain.on = function(tag, arg, eas, as){ // don't rewrite!\n\t\t\tvar gun = this, cat = gun._, root = cat.root, act, off, id, tmp;\n\t\t\tif(typeof tag === 'string'){\n\t\t\t\tif(!arg){ return cat.on(tag) }\n\t\t\t\tact = cat.on(tag, arg, eas || cat, as);\n\t\t\t\tif(eas && eas.$){\n\t\t\t\t\t(eas.subs || (eas.subs = [])).push(act);\n\t\t\t\t}\n\t\t\t\treturn gun;\n\t\t\t}\n\t\t\tvar opt = arg;\n\t\t\t(opt = (true === opt)? {change: true} : opt || {}).not = 1; opt.on = 1;\n\t\t\t//opt.at = cat;\n\t\t\t//opt.ok = tag;\n\t\t\t//opt.last = {};\n\t\t\tvar wait = {}; // can we assign this to the at instead, like in once?\n\t\t\tgun.get(tag, opt);\n\t\t\t/*gun.get(function on(data,key,msg,eve){ var $ = this;\n\t\t\t\tif(tmp = root.hatch){ // quick hack!\n\t\t\t\t\tif(wait[$._.id]){ return } wait[$._.id] = 1;\n\t\t\t\t\ttmp.push(function(){on.call($, data,key,msg,eve)});\n\t\t\t\t\treturn;\n\t\t\t\t}; wait = {}; // end quick hack.\n\t\t\t\ttag.call($, data,key,msg,eve);\n\t\t\t}, opt); // TODO: PERF! Event listener leak!!!?*/\n\t\t\t/*\n\t\t\tfunction one(msg, eve){\n\t\t\t\tif(one.stun){ return }\n\t\t\t\tvar at = msg.$._, data = at.put, tmp;\n\t\t\t\tif(tmp = at.link){ data = root.$.get(tmp)._.put }\n\t\t\t\tif(opt.not===u && u === data){ return }\n\t\t\t\tif(opt.stun===u && (tmp = root.stun) && (tmp = tmp[at.id] || tmp[at.back.id]) && !tmp.end){ // Remember! If you port this into `.get(cb` make sure you allow stun:0 skip option for `.put(`.\n\t\t\t\t\ttmp[id] = function(){one(msg,eve)};\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\t//tmp = one.wait || (one.wait = {}); console.log(tmp[at.id] === ''); if(tmp[at.id] !== ''){ tmp[at.id] = tmp[at.id] || setTimeout(function(){tmp[at.id]='';one(msg,eve)},1); return } delete tmp[at.id];\n\t\t\t\t// call:\n\t\t\t\tif(opt.as){\n\t\t\t\t\topt.ok.call(opt.as, msg, eve || one);\n\t\t\t\t} else {\n\t\t\t\t\topt.ok.call(at.$, data, msg.get || at.get, msg, eve || one);\n\t\t\t\t}\n\t\t\t};\n\t\t\tone.at = cat;\n\t\t\t(cat.act||(cat.act={}))[id = String.random(7)] = one;\n\t\t\tone.off = function(){ one.stun = 1; if(!cat.act){ return } delete cat.act[id] }\n\t\t\tcat.on('out', {get: {}});*/\n\t\t\treturn gun;\n\t\t}\n\t\t// Rules:\n\t\t// 1. If cached, should be fast, but not read while write.\n\t\t// 2. Should not retrigger other listeners, should get triggered even if nothing found.\n\t\t// 3. If the same callback passed to many different once chains, each should resolve - an unsubscribe from the same callback should not effect the state of the other resolving chains, if you do want to cancel them all early you should mutate the callback itself with a flag & check for it at top of callback\n\t\tGun.chain.once = function(cb, opt){ opt = opt || {}; // avoid rewriting\n\t\t\tif(!cb){ return none(this,opt) }\n\t\t\tvar gun = this, cat = gun._, root = cat.root, data = cat.put, id = String.random(7), one, tmp;\n\t\t\tgun.get(function(data,key,msg,eve){\n\t\t\t\tvar $ = this, at = $._, one = (at.one||(at.one={}));\n\t\t\t\tif(eve.stun){ return } if('' === one[id]){ return }\n\t\t\t\tif(true === (tmp = Gun.valid(data))){ once(); return }\n\t\t\t\tif('string' == typeof tmp){ return } // TODO: BUG? Will this always load?\n\t\t\t\tclearTimeout((cat.one||'')[id]); // clear \"not found\" since they only get set on cat.\n\t\t\t\tclearTimeout(one[id]); one[id] = setTimeout(once, opt.wait||99); // TODO: Bug? This doesn't handle plural chains.\n\t\t\t\tfunction once(f){\n\t\t\t\t\tif(!at.has && !at.soul){ at = {put: data, get: key} } // handles non-core messages.\n\t\t\t\t\tif(u === (tmp = at.put)){ tmp = ((msg.$$||'')._||'').put }\n\t\t\t\t\tif('string' == typeof Gun.valid(tmp)){\n\t\t\t\t\t\ttmp = root.$.get(tmp)._.put;\n\t\t\t\t\t\tif(tmp === u && !f){\n\t\t\t\t\t\t\tone[id] = setTimeout(function(){ once(1) }, opt.wait||99); // TODO: Quick fix. Maybe use ack count for more predictable control?\n\t\t\t\t\t\t\treturn\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\t//console.log(\"AND VANISHED\", data);\n\t\t\t\t\tif(eve.stun){ return } if('' === one[id]){ return } one[id] = '';\n\t\t\t\t\tif(cat.soul || cat.has){ eve.off() } // TODO: Plural chains? // else { ?.off() } // better than one check?\n\t\t\t\t\tcb.call($, tmp, at.get);\n\t\t\t\t\tclearTimeout(one[id]); // clear \"not found\" since they only get set on cat. // TODO: This was hackily added, is it necessary or important? Probably not, in future try removing this. Was added just as a safety for the `&& !f` check.\n\t\t\t\t};\n\t\t\t}, {on: 1});\n\t\t\treturn gun;\n\t\t}\n\t\tfunction none(gun,opt,chain){\n\t\t\tGun.log.once(\"valonce\", \"Chainable val is experimental, its behavior and API may change moving forward. Please play with it and report bugs and ideas on how to improve it.\");\n\t\t\t(chain = gun.chain())._.nix = gun.once(function(data, key){ chain._.on('in', this._) });\n\t\t\tchain._.lex = gun._.lex; // TODO: Better approach in future? This is quick for now.\n\t\t\treturn chain;\n\t\t}\n\n\t\tGun.chain.off = function(){\n\t\t\t// make off more aggressive. Warning, it might backfire!\n\t\t\tvar gun = this, at = gun._, tmp;\n\t\t\tvar cat = at.back;\n\t\t\tif(!cat){ return }\n\t\t\tat.ack = 0; // so can resubscribe.\n\t\t\tif(tmp = cat.next){\n\t\t\t\tif(tmp[at.get]){\n\t\t\t\t\tdelete tmp[at.get];\n\t\t\t\t} else {\n\n\t\t\t\t}\n\t\t\t}\n\t\t\t// TODO: delete cat.one[map.id]?\n\t\t\tif (tmp = cat.any) {\n\t\t\t\tdelete cat.any;\n\t\t\t\tcat.any = {};\n\t\t\t}\n\t\t\tif(tmp = cat.ask){\n\t\t\t\tdelete tmp[at.get];\n\t\t\t}\n\t\t\tif(tmp = cat.put){\n\t\t\t\tdelete tmp[at.get];\n\t\t\t}\n\t\t\tif(tmp = at.soul){\n\t\t\t\tdelete cat.root.graph[tmp];\n\t\t\t}\n\t\t\tif(tmp = at.map){\n\t\t\t\tObject.keys(tmp).forEach(function(i,at){ at = tmp[i]; //obj_map(tmp, function(at){\n\t\t\t\t\tif(at.link){\n\t\t\t\t\t\tcat.root.$.get(at.link).off();\n\t\t\t\t\t}\n\t\t\t\t});\n\t\t\t}\n\t\t\tif(tmp = at.next){\n\t\t\t\tObject.keys(tmp).forEach(function(i,neat){ neat = tmp[i]; //obj_map(tmp, function(neat){\n\t\t\t\t\tneat.$.off();\n\t\t\t\t});\n\t\t\t}\n\t\t\tat.on('off', {});\n\t\t\treturn gun;\n\t\t}\n\t\tvar empty = {}, noop = function(){}, u;\n\t})(USE, './on');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./index'), next = Gun.chain.get.next;\n\t\tGun.chain.get.next = function(gun, lex){ var tmp;\n\t\t\tif(!Object.plain(lex)){ return (next||noop)(gun, lex) }\n\t\t\tif(tmp = ((tmp = lex['#'])||'')['='] || tmp){ return gun.get(tmp) }\n\t\t\t(tmp = gun.chain()._).lex = lex; // LEX!\n\t\t\tgun.on('in', function(eve){\n\t\t\t\tif(String.match(eve.get|| (eve.put||'')['.'], lex['.'] || lex['#'] || lex)){\n\t\t\t\t\ttmp.on('in', eve);\n\t\t\t\t}\n\t\t\t\tthis.to.next(eve);\n\t\t\t});\n\t\t\treturn tmp.$;\n\t\t}\n\t\tGun.chain.map = function(cb, opt, t){\n\t\t\tvar gun = this, cat = gun._, lex, chain;\n\t\t\tif(Object.plain(cb)){ lex = cb['.']? cb : {'.': cb}; cb = u }\n\t\t\tif(!cb){\n\t\t\t\tif(chain = cat.each){ return chain }\n\t\t\t\t(cat.each = chain = gun.chain())._.lex = lex || chain._.lex || cat.lex;\n\t\t\t\tchain._.nix = gun.back('nix');\n\t\t\t\tgun.on('in', map, chain._);\n\t\t\t\treturn chain;\n\t\t\t}\n\t\t\tGun.log.once(\"mapfn\", \"Map functions are experimental, their behavior and API may change moving forward. Please play with it and report bugs and ideas on how to improve it.\");\n\t\t\tchain = gun.chain();\n\t\t\tgun.map().on(function(data, key, msg, eve){\n\t\t\t\tvar next = (cb||noop).call(this, data, key, msg, eve);\n\t\t\t\tif(u === next){ return }\n\t\t\t\tif(data === next){ return chain._.on('in', msg) }\n\t\t\t\tif(Gun.is(next)){ return chain._.on('in', next._) }\n\t\t\t\tvar tmp = {}; Object.keys(msg.put).forEach(function(k){ tmp[k] = msg.put[k] }, tmp); tmp['='] = next; \n\t\t\t\tchain._.on('in', {get: key, put: tmp});\n\t\t\t});\n\t\t\treturn chain;\n\t\t}\n\t\tfunction map(msg){ this.to.next(msg);\n\t\t\tvar cat = this.as, gun = msg.$, at = gun._, put = msg.put, tmp;\n\t\t\tif(!at.soul && !msg.$$){ return } // this line took hundreds of tries to figure out. It only works if core checks to filter out above chains during link tho. This says \"only bother to map on a node\" for this layer of the chain. If something is not a node, map should not work.\n\t\t\tif((tmp = cat.lex) && !String.match(msg.get|| (put||'')['.'], tmp['.'] || tmp['#'] || tmp)){ return }\n\t\t\tGun.on.link(msg, cat);\n\t\t}\n\t\tvar noop = function(){}, event = {stun: noop, off: noop}, u;\n\t})(USE, './map');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./index');\n\t\tGun.chain.set = function(item, cb, opt){\n\t\t\tvar gun = this, root = gun.back(-1), soul, tmp;\n\t\t\tcb = cb || function(){};\n\t\t\topt = opt || {}; opt.item = opt.item || item;\n\t\t\tif(soul = ((item||'')._||'')['#']){ (item = {})['#'] = soul } // check if node, make link.\n\t\t\tif('string' == typeof (tmp = Gun.valid(item))){ return gun.get(soul = tmp).put(item, cb, opt) } // check if link\n\t\t\tif(!Gun.is(item)){\n\t\t\t\tif(Object.plain(item)){\n\t\t\t\t\titem = root.get(soul = gun.back('opt.uuid')()).put(item);\n\t\t\t\t}\n\t\t\t\treturn gun.get(soul || root.back('opt.uuid')(7)).put(item, cb, opt);\n\t\t\t}\n\t\t\tgun.put(function(go){\n\t\t\t\titem.get(function(soul, o, msg){ // TODO: BUG! We no longer have this option? & go error not handled?\n\t\t\t\t\tif(!soul){ return cb.call(gun, {err: Gun.log('Only a node can be linked! Not \"' + msg.put + '\"!')}) }\n\t\t\t\t\t(tmp = {})[soul] = {'#': soul}; go(tmp);\n\t\t\t\t},true);\n\t\t\t})\n\t\t\treturn item;\n\t\t}\n\t})(USE, './set');\n\n\t;USE(function(module){\n\t\tUSE('./shim');\n\n\t\tvar noop = function(){}\n\t\tvar parse = JSON.parseAsync || function(t,cb,r){ var u, d = +new Date; try{ cb(u, JSON.parse(t,r), json.sucks(+new Date - d)) }catch(e){ cb(e) } }\n\t\tvar json = JSON.stringifyAsync || function(v,cb,r,s){ var u, d = +new Date; try{ cb(u, JSON.stringify(v,r,s), json.sucks(+new Date - d)) }catch(e){ cb(e) } }\n\t\tjson.sucks = function(d){ if(d > 99){ console.log(\"Warning: JSON blocking CPU detected. Add `gun/lib/yson.js` to fix.\"); json.sucks = noop } }\n\n\t\tfunction Mesh(root){\n\t\t\tvar mesh = function(){};\n\t\t\tvar opt = root.opt || {};\n\t\t\topt.log = opt.log || console.log;\n\t\t\topt.gap = opt.gap || opt.wait || 0;\n\t\t\topt.max = opt.max || (opt.memory? (opt.memory * 999 * 999) : 300000000) * 0.3;\n\t\t\topt.pack = opt.pack || (opt.max * 0.01 * 0.01);\n\t\t\topt.puff = opt.puff || 9; // IDEA: do a start/end benchmark, divide ops/result.\n\t\t\tvar puff = setTimeout.turn || setTimeout;\n\n\t\t\tvar dup = root.dup, dup_check = dup.check, dup_track = dup.track;\n\n\t\t\tvar ST = +new Date, LT = ST;\n\n\t\t\tvar hear = mesh.hear = function(raw, peer){\n\t\t\t\tif(!raw){ return }\n\t\t\t\tif(opt.max <= raw.length){ return mesh.say({dam: '!', err: \"Message too big!\"}, peer) }\n\t\t\t\tif(mesh === this){\n\t\t\t\t\t/*if('string' == typeof raw){ try{\n\t\t\t\t\t\tvar stat = console.STAT || {};\n\t\t\t\t\t\t//console.log('HEAR:', peer.id, (raw||'').slice(0,250), ((raw||'').length / 1024 / 1024).toFixed(4));\n\t\t\t\t\t\t\n\t\t\t\t\t\t//console.log(setTimeout.turn.s.length, 'stacks', parseFloat((-(LT - (LT = +new Date))/1000).toFixed(3)), 'sec', parseFloat(((LT-ST)/1000 / 60).toFixed(1)), 'up', stat.peers||0, 'peers', stat.has||0, 'has', stat.memhused||0, stat.memused||0, stat.memax||0, 'heap mem max');\n\t\t\t\t\t}catch(e){ console.log('DBG err', e) }}*/\n\t\t\t\t\thear.d += raw.length||0 ; ++hear.c } // STATS!\n\t\t\t\tvar S = peer.SH = +new Date;\n\t\t\t\tvar tmp = raw[0], msg;\n\t\t\t\t//raw && raw.slice && console.log(\"hear:\", ((peer.wire||'').headers||'').origin, raw.length, raw.slice && raw.slice(0,50)); //tc-iamunique-tc-package-ds1\n\t\t\t\tif('[' === tmp){\n\t\t\t\t\tparse(raw, function(err, msg){\n\t\t\t\t\t\tif(err || !msg){ return mesh.say({dam: '!', err: \"DAM JSON parse error.\"}, peer) }\n\t\t\t\t\t\tconsole.STAT && console.STAT(+new Date, msg.length, '# on hear batch');\n\t\t\t\t\t\tvar P = opt.puff;\n\t\t\t\t\t\t(function go(){\n\t\t\t\t\t\t\tvar S = +new Date;\n\t\t\t\t\t\t\tvar i = 0, m; while(i < P && (m = msg[i++])){ mesh.hear(m, peer) }\n\t\t\t\t\t\t\tmsg = msg.slice(i); // slicing after is faster than shifting during.\n\t\t\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'hear loop');\n\t\t\t\t\t\t\tflush(peer); // force send all synchronously batched acks.\n\t\t\t\t\t\t\tif(!msg.length){ return }\n\t\t\t\t\t\t\tpuff(go, 0);\n\t\t\t\t\t\t}());\n\t\t\t\t\t});\n\t\t\t\t\traw = ''; // \n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif('{' === tmp || ((raw['#'] || Object.plain(raw)) && (msg = raw))){\n\t\t\t\t\tif(msg){ return hear.one(msg, peer, S) }\n\t\t\t\t\tparse(raw, function(err, msg){\n\t\t\t\t\t\tif(err || !msg){ return mesh.say({dam: '!', err: \"DAM JSON parse error.\"}, peer) }\n\t\t\t\t\t\thear.one(msg, peer, S);\n\t\t\t\t\t});\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t}\n\t\t\thear.one = function(msg, peer, S){ // S here is temporary! Undo.\n\t\t\t\tvar id, hash, tmp, ash, DBG;\n\t\t\t\tif(msg.DBG){ msg.DBG = DBG = {DBG: msg.DBG} }\n\t\t\t\tDBG && (DBG.h = S);\n\t\t\t\tDBG && (DBG.hp = +new Date);\n\t\t\t\tif(!(id = msg['#'])){ id = msg['#'] = String.random(9) }\n\t\t\t\tif(tmp = dup_check(id)){ return }\n\t\t\t\t// DAM logic:\n\t\t\t\tif(!(hash = msg['##']) && false && u !== msg.put){ /*hash = msg['##'] = Type.obj.hash(msg.put)*/ } // disable hashing for now // TODO: impose warning/penalty instead (?)\n\t\t\t\tif(hash && (tmp = msg['@'] || (msg.get && id)) && dup.check(ash = tmp+hash)){ return } // Imagine A <-> B <=> (C & D), C & D reply with same ACK but have different IDs, B can use hash to dedup. Or if a GET has a hash already, we shouldn't ACK if same.\n\t\t\t\t(msg._ = function(){}).via = mesh.leap = peer;\n\t\t\t\tif((tmp = msg['><']) && 'string' == typeof tmp){ tmp.slice(0,99).split(',').forEach(function(k){ this[k] = 1 }, (msg._).yo = {}) } // Peers already sent to, do not resend.\n\t\t\t\t// DAM ^\n\t\t\t\tif(tmp = msg.dam){\n\t\t\t\t\tif(tmp = mesh.hear[tmp]){\n\t\t\t\t\t\ttmp(msg, peer, root);\n\t\t\t\t\t}\n\t\t\t\t\tdup_track(id);\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tif(tmp = msg.ok){ msg._.near = tmp['/'] }\n\t\t\t\tvar S = +new Date;\n\t\t\t\tDBG && (DBG.is = S); peer.SI = id;\n\t\t\t\tdup_track.ed = function(d){\n\t\t\t\t\tif(id !== d){ return }\n\t\t\t\t\tdup_track.ed = 0;\n\t\t\t\t\tif(!(d = dup.s[id])){ return }\n\t\t\t\t\td.via = peer;\n\t\t\t\t\tif(msg.get){ d.it = msg }\n\t\t\t\t}\n\t\t\t\troot.on('in', mesh.last = msg);\n\t\t\t\tDBG && (DBG.hd = +new Date);\n\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, msg.get? 'msg get' : msg.put? 'msg put' : 'msg');\n\t\t\t\tdup_track(id); // in case 'in' does not call track.\n\t\t\t\tif(ash){ dup_track(ash) } //dup.track(tmp+hash, true).it = it(msg);\n\t\t\t\tmesh.leap = mesh.last = null; // warning! mesh.leap could be buggy.\n\t\t\t}\n\t\t\tvar tomap = function(k,i,m){m(k,true)};\n\t\t\thear.c = hear.d = 0;\n\n\t\t\t;(function(){\n\t\t\t\tvar SMIA = 0;\n\t\t\t\tvar loop;\n\t\t\t\tmesh.hash = function(msg, peer){ var h, s, t;\n\t\t\t\t\tvar S = +new Date;\n\t\t\t\t\tjson(msg.put, function hash(err, text){\n\t\t\t\t\t\tvar ss = (s || (s = t = text||'')).slice(0, 32768); // 1024 * 32\n\t\t\t\t\t  h = String.hash(ss, h); s = s.slice(32768);\n\t\t\t\t\t  if(s){ puff(hash, 0); return }\n\t\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'say json+hash');\n\t\t\t\t\t  msg._.$put = t;\n\t\t\t\t\t  msg['##'] = h;\n\t\t\t\t\t  mesh.say(msg, peer);\n\t\t\t\t\t  delete msg._.$put;\n\t\t\t\t\t}, sort);\n\t\t\t\t}\n\t\t\t\tfunction sort(k, v){ var tmp;\n\t\t\t\t\tif(!(v instanceof Object)){ return v }\n\t\t\t\t\tObject.keys(v).sort().forEach(sorta, {to: tmp = {}, on: v});\n\t\t\t\t\treturn tmp;\n\t\t\t\t} function sorta(k){ this.to[k] = this.on[k] }\n\n\t\t\t\tvar say = mesh.say = function(msg, peer){ var tmp;\n\t\t\t\t\tif((tmp = this) && (tmp = tmp.to) && tmp.next){ tmp.next(msg) } // compatible with middleware adapters.\n\t\t\t\t\tif(!msg){ return false }\n\t\t\t\t\tvar id, hash, raw, ack = msg['@'];\n//if(opt.super && (!ack || !msg.put)){ return } // TODO: MANHATTAN STUB //OBVIOUSLY BUG! But squelch relay. // :( get only is 100%+ CPU usage :(\n\t\t\t\t\tvar meta = msg._||(msg._=function(){});\n\t\t\t\t\tvar DBG = msg.DBG, S = +new Date; meta.y = meta.y || S; if(!peer){ DBG && (DBG.y = S) }\n\t\t\t\t\tif(!(id = msg['#'])){ id = msg['#'] = String.random(9) }\n\t\t\t\t\t!loop && dup_track(id);//.it = it(msg); // track for 9 seconds, default. Earth<->Mars would need more! // always track, maybe move this to the 'after' logic if we split function.\n\t\t\t\t\t//if(msg.put && (msg.err || (dup.s[id]||'').err)){ return false } // TODO: in theory we should not be able to stun a message, but for now going to check if it can help network performance preventing invalid data to relay.\n\t\t\t\t\tif(!(hash = msg['##']) && u !== msg.put && !meta.via && ack){ mesh.hash(msg, peer); return } // TODO: Should broadcasts be hashed?\n\t\t\t\t\tif(!peer && ack){ peer = ((tmp = dup.s[ack]) && (tmp.via || ((tmp = tmp.it) && (tmp = tmp._) && tmp.via))) || ((tmp = mesh.last) && ack === tmp['#'] && mesh.leap) } // warning! mesh.leap could be buggy! mesh last check reduces this. // TODO: CLEAN UP THIS LINE NOW? `.it` should be reliable.\n\t\t\t\t\tif(!peer && ack){ // still no peer, then ack daisy chain 'tunnel' got lost.\n\t\t\t\t\t\tif(dup.s[ack]){ return } // in dups but no peer hints that this was ack to ourself, ignore.\n\t\t\t\t\t\tconsole.STAT && console.STAT(+new Date, ++SMIA, 'total no peer to ack to'); // TODO: Delete this now. Dropping lost ACKs is protocol fine now.\n\t\t\t\t\t\treturn false;\n\t\t\t\t\t} // TODO: Temporary? If ack via trace has been lost, acks will go to all peers, which trashes browser bandwidth. Not relaying the ack will force sender to ask for ack again. Note, this is technically wrong for mesh behavior.\n\t\t\t\t\tif(ack && !msg.put && !hash && ((dup.s[ack]||'').it||'')['##']){ return false } // If we're saying 'not found' but a relay had data, do not bother sending our not found. // Is this correct, return false? // NOTE: ADD PANIC TEST FOR THIS!\n\t\t\t\t\tif(!peer && mesh.way){ return mesh.way(msg) }\n\t\t\t\t\tDBG && (DBG.yh = +new Date);\n\t\t\t\t\tif(!(raw = meta.raw)){ mesh.raw(msg, peer); return }\n\t\t\t\t\tDBG && (DBG.yr = +new Date);\n\t\t\t\t\tif(!peer || !peer.id){\n\t\t\t\t\t\tif(!Object.plain(peer || opt.peers)){ return false }\n\t\t\t\t\t\tvar S = +new Date;\n\t\t\t\t\t\tvar P = opt.puff, ps = opt.peers, pl = Object.keys(peer || opt.peers || {}); // TODO: .keys( is slow\n\t\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'peer keys');\n\t\t\t\t\t\t;(function go(){\n\t\t\t\t\t\t\tvar S = +new Date;\n\t\t\t\t\t\t\t//Type.obj.map(peer || opt.peers, each); // in case peer is a peer list.\n\t\t\t\t\t\t\tloop = 1; var wr = meta.raw; meta.raw = raw; // quick perf hack\n\t\t\t\t\t\t\tvar i = 0, p; while(i < 9 && (p = (pl||'')[i++])){\n\t\t\t\t\t\t\t\tif(!(p = ps[p] || (peer||'')[p])){ continue }\n\t\t\t\t\t\t\t\tmesh.say(msg, p);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t\tmeta.raw = wr; loop = 0;\n\t\t\t\t\t\t\tpl = pl.slice(i); // slicing after is faster than shifting during.\n\t\t\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'say loop');\n\t\t\t\t\t\t\tif(!pl.length){ return }\n\t\t\t\t\t\t\tpuff(go, 0);\n\t\t\t\t\t\t\tack && dup_track(ack); // keep for later\n\t\t\t\t\t\t}());\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\t// TODO: PERF: consider splitting function here, so say loops do less work.\n\t\t\t\t\tif(!peer.wire && mesh.wire){ mesh.wire(peer) }\n\t\t\t\t\tif(id === peer.last){ return } peer.last = id;  // was it just sent?\n\t\t\t\t\tif(peer === meta.via){ return false } // don't send back to self.\n\t\t\t\t\tif((tmp = meta.yo) && (tmp[peer.url] || tmp[peer.pid] || tmp[peer.id]) /*&& !o*/){ return false }\n\t\t\t\t\tconsole.STAT && console.STAT(S, ((DBG||meta).yp = +new Date) - (meta.y || S), 'say prep');\n\t\t\t\t\t!loop && ack && dup_track(ack); // streaming long responses needs to keep alive the ack.\n\t\t\t\t\tif(peer.batch){\n\t\t\t\t\t\tpeer.tail = (tmp = peer.tail || 0) + raw.length;\n\t\t\t\t\t\tif(peer.tail <= opt.pack){\n\t\t\t\t\t\t\tpeer.batch += (tmp?',':'')+raw;\n\t\t\t\t\t\t\treturn;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tflush(peer);\n\t\t\t\t\t}\n\t\t\t\t\tpeer.batch = '['; // Prevents double JSON!\n\t\t\t\t\tvar ST = +new Date;\n\t\t\t\t\tsetTimeout(function(){\n\t\t\t\t\t\tconsole.STAT && console.STAT(ST, +new Date - ST, '0ms TO');\n\t\t\t\t\t\tflush(peer);\n\t\t\t\t\t}, opt.gap); // TODO: queuing/batching might be bad for low-latency video game performance! Allow opt out?\n\t\t\t\t\tsend(raw, peer);\n\t\t\t\t\tconsole.STAT && (ack === peer.SI) && console.STAT(S, +new Date - peer.SH, 'say ack');\n\t\t\t\t}\n\t\t\t\tmesh.say.c = mesh.say.d = 0;\n\t\t\t\t// TODO: this caused a out-of-memory crash!\n\t\t\t\tmesh.raw = function(msg, peer){ // TODO: Clean this up / delete it / move logic out!\n\t\t\t\t\tif(!msg){ return '' }\n\t\t\t\t\tvar meta = (msg._) || {}, put, tmp;\n\t\t\t\t\tif(tmp = meta.raw){ return tmp }\n\t\t\t\t\tif('string' == typeof msg){ return msg }\n\t\t\t\t\tvar hash = msg['##'], ack = msg['@'];\n\t\t\t\t\tif(hash && ack){\n\t\t\t\t\t\tif(!meta.via && dup_check(ack+hash)){ return false } // for our own out messages, memory & storage may ack the same thing, so dedup that. Tho if via another peer, we already tracked it upon hearing, so this will always trigger false positives, so don't do that!\n\t\t\t\t\t\tif(tmp = (dup.s[ack]||'').it){\n\t\t\t\t\t\t\tif(hash === tmp['##']){ return false } // if ask has a matching hash, acking is optional.\n\t\t\t\t\t\t\tif(!tmp['##']){ tmp['##'] = hash } // if none, add our hash to ask so anyone we relay to can dedup. // NOTE: May only check against 1st ack chunk, 2nd+ won't know and still stream back to relaying peers which may then dedup. Any way to fix this wasted bandwidth? I guess force rate limiting breaking change, that asking peer has to ask for next lexical chunk.\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tif(!msg.dam && !msg['@']){\n\t\t\t\t\t\tvar i = 0, to = []; tmp = opt.peers;\n\t\t\t\t\t\tfor(var k in tmp){ var p = tmp[k]; // TODO: Make it up peers instead!\n\t\t\t\t\t\t\tto.push(p.url || p.pid || p.id);\n\t\t\t\t\t\t\tif(++i > 6){ break }\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif(i > 1){ msg['><'] = to.join() } // TODO: BUG! This gets set regardless of peers sent to! Detect?\n\t\t\t\t\t}\n\t\t\t\t\tif(msg.put && (tmp = msg.ok)){ msg.ok = {'@':(tmp['@']||1)-1, '/': (tmp['/']==msg._.near)? mesh.near : tmp['/']}; }\n\t\t\t\t\tif(put = meta.$put){\n\t\t\t\t\t\ttmp = {}; Object.keys(msg).forEach(function(k){ tmp[k] = msg[k] });\n\t\t\t\t\t\ttmp.put = ':])([:';\n\t\t\t\t\t\tjson(tmp, function(err, raw){\n\t\t\t\t\t\t\tif(err){ return } // TODO: Handle!!\n\t\t\t\t\t\t\tvar S = +new Date;\n\t\t\t\t\t\t\ttmp = raw.indexOf('\"put\":\":])([:\"');\n\t\t\t\t\t\t\tres(u, raw = raw.slice(0, tmp+6) + put + raw.slice(tmp + 14));\n\t\t\t\t\t\t\tconsole.STAT && console.STAT(S, +new Date - S, 'say slice');\n\t\t\t\t\t\t});\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tjson(msg, res);\n\t\t\t\t\tfunction res(err, raw){\n\t\t\t\t\t\tif(err){ return } // TODO: Handle!!\n\t\t\t\t\t\tmeta.raw = raw; //if(meta && (raw||'').length < (999 * 99)){ meta.raw = raw } // HNPERF: If string too big, don't keep in memory.\n\t\t\t\t\t\tmesh.say(msg, peer);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}());\n\n\t\t\tfunction flush(peer){\n\t\t\t\tvar tmp = peer.batch, t = 'string' == typeof tmp, l;\n\t\t\t\tif(t){ tmp += ']' }// TODO: Prevent double JSON!\n\t\t\t\tpeer.batch = peer.tail = null;\n\t\t\t\tif(!tmp){ return }\n\t\t\t\tif(t? 3 > tmp.length : !tmp.length){ return } // TODO: ^\n\t\t\t\tif(!t){try{tmp = (1 === tmp.length? tmp[0] : JSON.stringify(tmp));\n\t\t\t\t}catch(e){return opt.log('DAM JSON stringify error', e)}}\n\t\t\t\tif(!tmp){ return }\n\t\t\t\tsend(tmp, peer);\n\t\t\t}\n\t\t\t// for now - find better place later.\n\t\t\tfunction send(raw, peer){ try{\n\t\t\t\tvar wire = peer.wire;\n\t\t\t\tif(peer.say){\n\t\t\t\t\tpeer.say(raw);\n\t\t\t\t} else\n\t\t\t\tif(wire.send){\n\t\t\t\t\twire.send(raw);\n\t\t\t\t}\n\t\t\t\tmesh.say.d += raw.length||0; ++mesh.say.c; // STATS!\n\t\t\t}catch(e){\n\t\t\t\t(peer.queue = peer.queue || []).push(raw);\n\t\t\t}}\n\n\t\t\tmesh.near = 0;\n\t\t\tmesh.hi = function(peer){\n\t\t\t\tvar wire = peer.wire, tmp;\n\t\t\t\tif(!wire){ mesh.wire((peer.length && {url: peer, id: peer}) || peer); return }\n\t\t\t\tif(peer.id){\n\t\t\t\t\topt.peers[peer.url || peer.id] = peer;\n\t\t\t\t} else {\n\t\t\t\t\ttmp = peer.id = peer.id || peer.url || String.random(9);\n\t\t\t\t\tmesh.say({dam: '?', pid: root.opt.pid}, opt.peers[tmp] = peer);\n\t\t\t\t\tdelete dup.s[peer.last]; // IMPORTANT: see https://gun.eco/docs/DAM#self\n\t\t\t\t}\n\t\t\t\tif(!peer.met){\n\t\t\t\t\tmesh.near++;\n\t\t\t\t\tpeer.met = +(new Date);\n\t\t\t\t\troot.on('hi', peer)\n\t\t\t\t}\n\t\t\t\t// @rogowski I need this here by default for now to fix go1dfish's bug\n\t\t\t\ttmp = peer.queue; peer.queue = [];\n\t\t\t\tsetTimeout.each(tmp||[],function(msg){\n\t\t\t\t\tsend(msg, peer);\n\t\t\t\t},0,9);\n\t\t\t\t//Type.obj.native && Type.obj.native(); // dirty place to check if other JS polluted.\n\t\t\t}\n\t\t\tmesh.bye = function(peer){\n\t\t\t\tpeer.met && --mesh.near;\n\t\t\t\tdelete peer.met;\n\t\t\t\troot.on('bye', peer);\n\t\t\t\tvar tmp = +(new Date); tmp = (tmp - (peer.met||tmp));\n\t\t\t\tmesh.bye.time = ((mesh.bye.time || tmp) + tmp) / 2;\n\t\t\t}\n\t\t\tmesh.hear['!'] = function(msg, peer){ opt.log('Error:', msg.err) }\n\t\t\tmesh.hear['?'] = function(msg, peer){\n\t\t\t\tif(msg.pid){\n\t\t\t\t\tif(!peer.pid){ peer.pid = msg.pid }\n\t\t\t\t\tif(msg['@']){ return }\n\t\t\t\t}\n\t\t\t\tmesh.say({dam: '?', pid: opt.pid, '@': msg['#']}, peer);\n\t\t\t\tdelete dup.s[peer.last]; // IMPORTANT: see https://gun.eco/docs/DAM#self\n\t\t\t}\n\t\t\tmesh.hear['mob'] = function(msg, peer){ // NOTE: AXE will overload this with better logic.\n\t\t\t\tif(!msg.peers){ return }\n\t\t\t\tvar peers = Object.keys(msg.peers), one = peers[(Math.random()*peers.length) >> 0];\n\t\t\t\tif(!one){ return }\n\t\t\t\tmesh.bye(peer);\n\t\t\t\tmesh.hi(one);\n\t\t\t}\n\n\t\t\troot.on('create', function(root){\n\t\t\t\troot.opt.pid = root.opt.pid || String.random(9);\n\t\t\t\tthis.to.next(root);\n\t\t\t\troot.on('out', mesh.say);\n\t\t\t});\n\n\t\t\troot.on('bye', function(peer, tmp){\n\t\t\t\tpeer = opt.peers[peer.id || peer] || peer;\n\t\t\t\tthis.to.next(peer);\n\t\t\t\tpeer.bye? peer.bye() : (tmp = peer.wire) && tmp.close && tmp.close();\n\t\t\t\tdelete opt.peers[peer.id];\n\t\t\t\tpeer.wire = null;\n\t\t\t});\n\n\t\t\tvar gets = {};\n\t\t\troot.on('bye', function(peer, tmp){ this.to.next(peer);\n\t\t\t\tif(tmp = console.STAT){ tmp.peers = mesh.near; }\n\t\t\t\tif(!(tmp = peer.url)){ return } gets[tmp] = true;\n\t\t\t\tsetTimeout(function(){ delete gets[tmp] },opt.lack || 9000);\n\t\t\t});\n\t\t\troot.on('hi', function(peer, tmp){ this.to.next(peer);\n\t\t\t\tif(tmp = console.STAT){ tmp.peers = mesh.near }\n\t\t\t\tif(opt.super){ return } // temporary (?) until we have better fix/solution?\n\t\t\t\tvar souls = Object.keys(root.next||''); // TODO: .keys( is slow\n\t\t\t\tif(souls.length > 9999 && !console.SUBS){ console.log(console.SUBS = \"Warning: You have more than 10K live GETs, which might use more bandwidth than your screen can show - consider `.off()`.\") }\n\t\t\t\tsetTimeout.each(souls, function(soul){ var node = root.next[soul];\n\t\t\t\t\tif(opt.super || (node.ask||'')['']){ mesh.say({get: {'#': soul}}, peer); return }\n\t\t\t\t\tsetTimeout.each(Object.keys(node.ask||''), function(key){ if(!key){ return }\n\t\t\t\t\t\t// is the lack of ## a !onion hint?\n\t\t\t\t\t\tmesh.say({'##': String.hash((root.graph[soul]||'')[key]), get: {'#': soul, '.': key}}, peer);\n\t\t\t\t\t\t// TODO: Switch this so Book could route?\n\t\t\t\t\t})\n\t\t\t\t});\n\t\t\t});\n\n\t\t\treturn mesh;\n\t\t}\n\t  var empty = {}, ok = true, u;\n\n\t  try{ module.exports = Mesh }catch(e){}\n\n\t})(USE, './mesh');\n\n\t;USE(function(module){\n\t\tvar Gun = USE('./index');\n\t\tGun.Mesh = USE('./mesh');\n\n\t\t// TODO: resync upon reconnect online/offline\n\t\t//window.ononline = window.onoffline = function(){ console.log('online?', navigator.onLine) }\n\n\t\tGun.on('opt', function(root){\n\t\t\tthis.to.next(root);\n\t\t\tif(root.once){ return }\n\t\t\tvar opt = root.opt;\n\t\t\tif(false === opt.WebSocket){ return }\n\n\t\t\tvar env = Gun.window || {};\n\t\t\tvar websocket = opt.WebSocket || env.WebSocket || env.webkitWebSocket || env.mozWebSocket;\n\t\t\tif(!websocket){ return }\n\t\t\topt.WebSocket = websocket;\n\n\t\t\tvar mesh = opt.mesh = opt.mesh || Gun.Mesh(root);\n\n\t\t\tvar wire = mesh.wire || opt.wire;\n\t\t\tmesh.wire = opt.wire = open;\n\t\t\tfunction open(peer){ try{\n\t\t\t\tif(!peer || !peer.url){ return wire && wire(peer) }\n\t\t\t\tvar url = peer.url.replace(/^http/, 'ws');\n\t\t\t\tvar wire = peer.wire = new opt.WebSocket(url);\n\t\t\t\twire.onclose = function(){\n\t\t\t\t\treconnect(peer);\n\t\t\t\t\topt.mesh.bye(peer);\n\t\t\t\t};\n\t\t\t\twire.onerror = function(err){\n\t\t\t\t\treconnect(peer);\n\t\t\t\t};\n\t\t\t\twire.onopen = function(){\n\t\t\t\t\topt.mesh.hi(peer);\n\t\t\t\t}\n\t\t\t\twire.onmessage = function(msg){\n\t\t\t\t\tif(!msg){ return }\n\t\t\t\t\topt.mesh.hear(msg.data || msg, peer);\n\t\t\t\t};\n\t\t\t\treturn wire;\n\t\t\t}catch(e){ opt.mesh.bye(peer) }}\n\n\t\t\tsetTimeout(function(){ !opt.super && root.on('out', {dam:'hi'}) },1); // it can take a while to open a socket, so maybe no longer lazy load for perf reasons?\n\n\t\t\tvar wait = 2 * 999;\n\t\t\tfunction reconnect(peer){\n\t\t\t\tclearTimeout(peer.defer);\n\t\t\t\tif(!opt.peers[peer.url]){ return }\n\t\t\t\tif(doc && peer.retry <= 0){ return }\n\t\t\t\tpeer.retry = (peer.retry || opt.retry+1 || 60) - ((-peer.tried + (peer.tried = +new Date) < wait*4)?1:0);\n\t\t\t\tpeer.defer = setTimeout(function to(){\n\t\t\t\t\tif(doc && doc.hidden){ return setTimeout(to,wait) }\n\t\t\t\t\topen(peer);\n\t\t\t\t}, wait);\n\t\t\t}\n\t\t\tvar doc = (''+u !== typeof document) && document;\n\t\t});\n\t\tvar noop = function(){}, u;\n\t})(USE, './websocket');\n\n\t;USE(function(module){\n\t\tif(typeof Gun === 'undefined'){ return }\n\n\t\tvar noop = function(){}, store, u;\n\t\ttry{store = (Gun.window||noop).localStorage}catch(e){}\n\t\tif(!store){\n\t\t\tGun.log(\"Warning: No localStorage exists to persist data to!\");\n\t\t\tstore = {setItem: function(k,v){this[k]=v}, removeItem: function(k){delete this[k]}, getItem: function(k){return this[k]}};\n\t\t}\n\n\t\tvar parse = JSON.parseAsync || function(t,cb,r){ var u; try{ cb(u, JSON.parse(t,r)) }catch(e){ cb(e) } }\n\t\tvar json = JSON.stringifyAsync || function(v,cb,r,s){ var u; try{ cb(u, JSON.stringify(v,r,s)) }catch(e){ cb(e) } }\n\n\t\tGun.on('create', function lg(root){\n\t\t\tthis.to.next(root);\n\t\t\tvar opt = root.opt, graph = root.graph, acks = [], disk, to, size, stop;\n\t\t\tif(false === opt.localStorage){ return }\n\t\t\topt.prefix = opt.file || 'gun/';\n\t\t\ttry{ disk = lg[opt.prefix] = lg[opt.prefix] || JSON.parse(size = store.getItem(opt.prefix)) || {}; // TODO: Perf! This will block, should we care, since limited to 5MB anyways?\n\t\t\t}catch(e){ disk = lg[opt.prefix] = {}; }\n\t\t\tsize = (size||'').length;\n\n\t\t\troot.on('get', function(msg){\n\t\t\t\tthis.to.next(msg);\n\t\t\t\tvar lex = msg.get, soul, data, tmp, u;\n\t\t\t\tif(!lex || !(soul = lex['#'])){ return }\n\t\t\t\tdata = disk[soul] || u;\n\t\t\t\tif(data && (tmp = lex['.']) && !Object.plain(tmp)){ // pluck!\n\t\t\t\t\tdata = Gun.state.ify({}, tmp, Gun.state.is(data, tmp), data[tmp], soul);\n\t\t\t\t}\n\t\t\t\t//if(data){ (tmp = {})[soul] = data } // back into a graph.\n\t\t\t\t//setTimeout(function(){\n\t\t\t\tGun.on.get.ack(msg, data); //root.on('in', {'@': msg['#'], put: tmp, lS:1});// || root.$});\n\t\t\t\t//}, Math.random() * 10); // FOR TESTING PURPOSES!\n\t\t\t});\n\n\t\t\troot.on('put', function(msg){\n\t\t\t\tthis.to.next(msg); // remember to call next middleware adapter\n\t\t\t\tvar put = msg.put, soul = put['#'], key = put['.'], id = msg['#'], ok = msg.ok||'', tmp; // pull data off wire envelope\n\t\t\t\tdisk[soul] = Gun.state.ify(disk[soul], key, put['>'], put[':'], soul); // merge into disk object\n\t\t\t\tif(stop && size > (4999880)){ root.on('in', {'@': id, err: \"localStorage max!\"}); return; }\n\t\t\t\t//if(!msg['@']){ acks.push(id) } // then ack any non-ack write. // TODO: use batch id.\n\t\t\t\tif(!msg['@'] && (!msg._.via || Math.random() < (ok['@'] / ok['/']))){ acks.push(id) } // then ack any non-ack write. // TODO: use batch id.\n\t\t\t\tif(to){ return }\n\t\t\t\tto = setTimeout(flush, 9+(size / 333)); // 0.1MB = 0.3s, 5MB = 15s \n\t\t\t});\n\t\t\tfunction flush(){\n\t\t\t\tif(!acks.length && ((setTimeout.turn||'').s||'').length){ setTimeout(flush,99); return; } // defer if \"busy\" && no saves.\n\t\t\t\tvar err, ack = acks; clearTimeout(to); to = false; acks = [];\n\t\t\t\tjson(disk, function(err, tmp){\n\t\t\t\t\ttry{!err && store.setItem(opt.prefix, tmp);\n\t\t\t\t\t}catch(e){ err = stop = e || \"localStorage failure\" }\n\t\t\t\t\tif(err){\n\t\t\t\t\t\tGun.log(err + \" Consider using GUN's IndexedDB plugin for RAD for more storage space, https://gun.eco/docs/RAD#install\");\n\t\t\t\t\t\troot.on('localStorage:error', {err: err, get: opt.prefix, put: disk});\n\t\t\t\t\t}\n\t\t\t\t\tsize = tmp.length;\n\n\t\t\t\t\t//if(!err && !Object.empty(opt.peers)){ return } // only ack if there are no peers. // Switch this to probabilistic mode\n\t\t\t\t\tsetTimeout.each(ack, function(id){\n\t\t\t\t\t\troot.on('in', {'@': id, err: err, ok: 0}); // localStorage isn't reliable, so make its `ok` code be a low number.\n\t\t\t\t\t},0,99);\n\t\t\t\t})\n\t\t\t}\n\t\t\n\t\t});\n\t})(USE, './localStorage');\n\n}());\n\n/* BELOW IS TEMPORARY FOR OLD INTERNAL COMPATIBILITY, THEY ARE IMMEDIATELY DEPRECATED AND WILL BE REMOVED IN NEXT VERSION */\n;(function(){\n\tvar u;\n\tif(''+u == typeof Gun){ return }\n\tvar DEP = function(n){ console.warn(\"Warning! Deprecated internal utility will break in next version:\", n) }\n\t// Generic javascript utilities.\n\tvar Type = Gun;\n\t//Type.fns = Type.fn = {is: function(fn){ return (!!fn && fn instanceof Function) }}\n\tType.fn = Type.fn || {is: function(fn){ DEP('fn'); return (!!fn && 'function' == typeof fn) }}\n\tType.bi = Type.bi || {is: function(b){ DEP('bi');return (b instanceof Boolean || typeof b == 'boolean') }}\n\tType.num = Type.num || {is: function(n){ DEP('num'); return !list_is(n) && ((n - parseFloat(n) + 1) >= 0 || Infinity === n || -Infinity === n) }}\n\tType.text = Type.text || {is: function(t){ DEP('text'); return (typeof t == 'string') }}\n\tType.text.ify = Type.text.ify || function(t){ DEP('text.ify');\n\t\tif(Type.text.is(t)){ return t }\n\t\tif(typeof JSON !== \"undefined\"){ return JSON.stringify(t) }\n\t\treturn (t && t.toString)? t.toString() : t;\n\t}\n\tType.text.random = Type.text.random || function(l, c){ DEP('text.random');\n\t\tvar s = '';\n\t\tl = l || 24; // you are not going to make a 0 length random number, so no need to check type\n\t\tc = c || '0123456789ABCDEFGHIJKLMNOPQRSTUVWXZabcdefghijklmnopqrstuvwxyz';\n\t\twhile(l > 0){ s += c.charAt(Math.floor(Math.random() * c.length)); l-- }\n\t\treturn s;\n\t}\n\tType.text.match = Type.text.match || function(t, o){ var tmp, u; DEP('text.match');\n\t\tif('string' !== typeof t){ return false }\n\t\tif('string' == typeof o){ o = {'=': o} }\n\t\to = o || {};\n\t\ttmp = (o['='] || o['*'] || o['>'] || o['<']);\n\t\tif(t === tmp){ return true }\n\t\tif(u !== o['=']){ return false }\n\t\ttmp = (o['*'] || o['>'] || o['<']);\n\t\tif(t.slice(0, (tmp||'').length) === tmp){ return true }\n\t\tif(u !== o['*']){ return false }\n\t\tif(u !== o['>'] && u !== o['<']){\n\t\t\treturn (t >= o['>'] && t <= o['<'])? true : false;\n\t\t}\n\t\tif(u !== o['>'] && t >= o['>']){ return true }\n\t\tif(u !== o['<'] && t <= o['<']){ return true }\n\t\treturn false;\n\t}\n\tType.text.hash = Type.text.hash || function(s, c){ // via SO\n\t\tDEP('text.hash');\n\t\tif(typeof s !== 'string'){ return }\n\t  c = c || 0;\n\t  if(!s.length){ return c }\n\t  for(var i=0,l=s.length,n; i<l; ++i){\n\t    n = s.charCodeAt(i);\n\t    c = ((c<<5)-c)+n;\n\t    c |= 0;\n\t  }\n\t  return c;\n\t}\n\tType.list = Type.list || {is: function(l){ DEP('list'); return (l instanceof Array) }}\n\tType.list.slit = Type.list.slit || Array.prototype.slice;\n\tType.list.sort = Type.list.sort || function(k){ // creates a new sort function based off some key\n\t\tDEP('list.sort');\n\t\treturn function(A,B){\n\t\t\tif(!A || !B){ return 0 } A = A[k]; B = B[k];\n\t\t\tif(A < B){ return -1 }else if(A > B){ return 1 }\n\t\t\telse { return 0 }\n\t\t}\n\t}\n\tType.list.map = Type.list.map || function(l, c, _){ DEP('list.map'); return obj_map(l, c, _) }\n\tType.list.index = 1; // change this to 0 if you want non-logical, non-mathematical, non-matrix, non-convenient array notation\n\tType.obj = Type.boj || {is: function(o){ DEP('obj'); return o? (o instanceof Object && o.constructor === Object) || Object.prototype.toString.call(o).match(/^\\[object (\\w+)\\]$/)[1] === 'Object' : false }}\n\tType.obj.put = Type.obj.put || function(o, k, v){ DEP('obj.put'); return (o||{})[k] = v, o }\n\tType.obj.has = Type.obj.has || function(o, k){ DEP('obj.has'); return o && Object.prototype.hasOwnProperty.call(o, k) }\n\tType.obj.del = Type.obj.del || function(o, k){ DEP('obj.del'); \n\t\tif(!o){ return }\n\t\to[k] = null;\n\t\tdelete o[k];\n\t\treturn o;\n\t}\n\tType.obj.as = Type.obj.as || function(o, k, v, u){ DEP('obj.as'); return o[k] = o[k] || (u === v? {} : v) }\n\tType.obj.ify = Type.obj.ify || function(o){ DEP('obj.ify'); \n\t\tif(obj_is(o)){ return o }\n\t\ttry{o = JSON.parse(o);\n\t\t}catch(e){o={}};\n\t\treturn o;\n\t}\n\t;(function(){ var u;\n\t\tfunction map(v,k){\n\t\t\tif(obj_has(this,k) && u !== this[k]){ return }\n\t\t\tthis[k] = v;\n\t\t}\n\t\tType.obj.to = Type.obj.to || function(from, to){ DEP('obj.to'); \n\t\t\tto = to || {};\n\t\t\tobj_map(from, map, to);\n\t\t\treturn to;\n\t\t}\n\t}());\n\tType.obj.copy = Type.obj.copy || function(o){ DEP('obj.copy'); // because http://web.archive.org/web/20140328224025/http://jsperf.com/cloning-an-object/2\n\t\treturn !o? o : JSON.parse(JSON.stringify(o)); // is shockingly faster than anything else, and our data has to be a subset of JSON anyways!\n\t}\n\t;(function(){\n\t\tfunction empty(v,i){ var n = this.n, u;\n\t\t\tif(n && (i === n || (obj_is(n) && obj_has(n, i)))){ return }\n\t\t\tif(u !== i){ return true }\n\t\t}\n\t\tType.obj.empty = Type.obj.empty || function(o, n){ DEP('obj.empty'); \n\t\t\tif(!o){ return true }\n\t\t\treturn obj_map(o,empty,{n:n})? false : true;\n\t\t}\n\t}());\n\t;(function(){\n\t\tfunction t(k,v){\n\t\t\tif(2 === arguments.length){\n\t\t\t\tt.r = t.r || {};\n\t\t\t\tt.r[k] = v;\n\t\t\t\treturn;\n\t\t\t} t.r = t.r || [];\n\t\t\tt.r.push(k);\n\t\t};\n\t\tvar keys = Object.keys, map, u;\n\t\tObject.keys = Object.keys || function(o){ return map(o, function(v,k,t){t(k)}) }\n\t\tType.obj.map = map = Type.obj.map || function(l, c, _){ DEP('obj.map'); \n\t\t\tvar u, i = 0, x, r, ll, lle, f = 'function' == typeof c;\n\t\t\tt.r = u;\n\t\t\tif(keys && obj_is(l)){\n\t\t\t\tll = keys(l); lle = true;\n\t\t\t}\n\t\t\t_ = _ || {};\n\t\t\tif(list_is(l) || ll){\n\t\t\t\tx = (ll || l).length;\n\t\t\t\tfor(;i < x; i++){\n\t\t\t\t\tvar ii = (i + Type.list.index);\n\t\t\t\t\tif(f){\n\t\t\t\t\t\tr = lle? c.call(_, l[ll[i]], ll[i], t) : c.call(_, l[i], ii, t);\n\t\t\t\t\t\tif(r !== u){ return r }\n\t\t\t\t\t} else {\n\t\t\t\t\t\t//if(Type.test.is(c,l[i])){ return ii } // should implement deep equality testing!\n\t\t\t\t\t\tif(c === l[lle? ll[i] : i]){ return ll? ll[i] : ii } // use this for now\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tfor(i in l){\n\t\t\t\t\tif(f){\n\t\t\t\t\t\tif(obj_has(l,i)){\n\t\t\t\t\t\t\tr = _? c.call(_, l[i], i, t) : c(l[i], i, t);\n\t\t\t\t\t\t\tif(r !== u){ return r }\n\t\t\t\t\t\t}\n\t\t\t\t\t} else {\n\t\t\t\t\t\t//if(a.test.is(c,l[i])){ return i } // should implement deep equality testing!\n\t\t\t\t\t\tif(c === l[i]){ return i } // use this for now\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn f? t.r : Type.list.index? 0 : -1;\n\t\t}\n\t}());\n\tType.time = Type.time || {};\n\tType.time.is = Type.time.is || function(t){ DEP('time'); return t? t instanceof Date : (+new Date().getTime()) }\n\n\tvar fn_is = Type.fn.is;\n\tvar list_is = Type.list.is;\n\tvar obj = Type.obj, obj_is = obj.is, obj_has = obj.has, obj_map = obj.map;\n\n\tvar Val = {};\n\tVal.is = function(v){ DEP('val.is'); // Valid values are a subset of JSON: null, binary, number (!Infinity), text, or a soul relation. Arrays need special algorithms to handle concurrency, so they are not supported directly. Use an extension that supports them if needed but research their problems first.\n\t\tif(v === u){ return false }\n\t\tif(v === null){ return true } // \"deletes\", nulling out keys.\n\t\tif(v === Infinity){ return false } // we want this to be, but JSON does not support it, sad face.\n\t\tif(text_is(v) // by \"text\" we mean strings.\n\t\t|| bi_is(v) // by \"binary\" we mean boolean.\n\t\t|| num_is(v)){ // by \"number\" we mean integers or decimals.\n\t\t\treturn true; // simple values are valid.\n\t\t}\n\t\treturn Val.link.is(v) || false; // is the value a soul relation? Then it is valid and return it. If not, everything else remaining is an invalid data type. Custom extensions can be built on top of these primitives to support other types.\n\t}\n\tVal.link = Val.rel = {_: '#'};\n\t;(function(){\n\t\tVal.link.is = function(v){ DEP('val.link.is'); // this defines whether an object is a soul relation or not, they look like this: {'#': 'UUID'}\n\t\t\tif(v && v[rel_] && !v._ && obj_is(v)){ // must be an object.\n\t\t\t\tvar o = {};\n\t\t\t\tobj_map(v, map, o);\n\t\t\t\tif(o.id){ // a valid id was found.\n\t\t\t\t\treturn o.id; // yay! Return it.\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn false; // the value was not a valid soul relation.\n\t\t}\n\t\tfunction map(s, k){ var o = this; // map over the object...\n\t\t\tif(o.id){ return o.id = false } // if ID is already defined AND we're still looping through the object, it is considered invalid.\n\t\t\tif(k == rel_ && text_is(s)){ // the key should be '#' and have a text value.\n\t\t\t\to.id = s; // we found the soul!\n\t\t\t} else {\n\t\t\t\treturn o.id = false; // if there exists anything else on the object that isn't the soul, then it is considered invalid.\n\t\t\t}\n\t\t}\n\t}());\n\tVal.link.ify = function(t){ DEP('val.link.ify'); return obj_put({}, rel_, t) } // convert a soul into a relation and return it.\n\tType.obj.has._ = '.';\n\tvar rel_ = Val.link._, u;\n\tvar bi_is = Type.bi.is;\n\tvar num_is = Type.num.is;\n\tvar text_is = Type.text.is;\n\tvar obj = Type.obj, obj_is = obj.is, obj_put = obj.put, obj_map = obj.map;\n\n\tType.val = Type.val || Val;\n\n\tvar Node = {_: '_'};\n\tNode.soul = function(n, o){ DEP('node.soul'); return (n && n._ && n._[o || soul_]) } // convenience function to check to see if there is a soul on a node and return it.\n\tNode.soul.ify = function(n, o){ DEP('node.soul.ify'); // put a soul on an object.\n\t\to = (typeof o === 'string')? {soul: o} : o || {};\n\t\tn = n || {}; // make sure it exists.\n\t\tn._ = n._ || {}; // make sure meta exists.\n\t\tn._[soul_] = o.soul || n._[soul_] || text_random(); // put the soul on it.\n\t\treturn n;\n\t}\n\tNode.soul._ = Val.link._;\n\t;(function(){\n\t\tNode.is = function(n, cb, as){ DEP('node.is'); var s; // checks to see if an object is a valid node.\n\t\t\tif(!obj_is(n)){ return false } // must be an object.\n\t\t\tif(s = Node.soul(n)){ // must have a soul on it.\n\t\t\t\treturn !obj_map(n, map, {as:as,cb:cb,s:s,n:n});\n\t\t\t}\n\t\t\treturn false; // nope! This was not a valid node.\n\t\t}\n\t\tfunction map(v, k){ // we invert this because the way we check for this is via a negation.\n\t\t\tif(k === Node._){ return } // skip over the metadata.\n\t\t\tif(!Val.is(v)){ return true } // it is true that this is an invalid node.\n\t\t\tif(this.cb){ this.cb.call(this.as, v, k, this.n, this.s) } // optionally callback each key/value.\n\t\t}\n\t}());\n\t;(function(){\n\t\tNode.ify = function(obj, o, as){ DEP('node.ify'); // returns a node from a shallow object.\n\t\t\tif(!o){ o = {} }\n\t\t\telse if(typeof o === 'string'){ o = {soul: o} }\n\t\t\telse if('function' == typeof o){ o = {map: o} }\n\t\t\tif(o.map){ o.node = o.map.call(as, obj, u, o.node || {}) }\n\t\t\tif(o.node = Node.soul.ify(o.node || {}, o)){\n\t\t\t\tobj_map(obj, map, {o:o,as:as});\n\t\t\t}\n\t\t\treturn o.node; // This will only be a valid node if the object wasn't already deep!\n\t\t}\n\t\tfunction map(v, k){ var o = this.o, tmp, u; // iterate over each key/value.\n\t\t\tif(o.map){\n\t\t\t\ttmp = o.map.call(this.as, v, ''+k, o.node);\n\t\t\t\tif(u === tmp){\n\t\t\t\t\tobj_del(o.node, k);\n\t\t\t\t} else\n\t\t\t\tif(o.node){ o.node[k] = tmp }\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(Val.is(v)){\n\t\t\t\to.node[k] = v;\n\t\t\t}\n\t\t}\n\t}());\n\tvar obj = Type.obj, obj_is = obj.is, obj_del = obj.del, obj_map = obj.map;\n\tvar text = Type.text, text_random = text.random;\n\tvar soul_ = Node.soul._;\n\tvar u;\n\tType.node = Type.node || Node;\n\n\tvar State = Type.state;\n\tState.lex = function(){ DEP('state.lex'); return State().toString(36).replace('.','') }\n\tState.to = function(from, k, to){ DEP('state.to'); \n\t\tvar val = (from||{})[k];\n\t\tif(obj_is(val)){\n\t\t\tval = obj_copy(val);\n\t\t}\n\t\treturn State.ify(to, k, State.is(from, k), val, Node.soul(from));\n\t}\n\t;(function(){\n\t\tState.map = function(cb, s, as){ DEP('state.map'); var u; // for use with Node.ify\n\t\t\tvar o = obj_is(o = cb || s)? o : null;\n\t\t\tcb = fn_is(cb = cb || s)? cb : null;\n\t\t\tif(o && !cb){\n\t\t\t\ts = num_is(s)? s : State();\n\t\t\t\to[N_] = o[N_] || {};\n\t\t\t\tobj_map(o, map, {o:o,s:s});\n\t\t\t\treturn o;\n\t\t\t}\n\t\t\tas = as || obj_is(s)? s : u;\n\t\t\ts = num_is(s)? s : State();\n\t\t\treturn function(v, k, o, opt){\n\t\t\t\tif(!cb){\n\t\t\t\t\tmap.call({o: o, s: s}, v,k);\n\t\t\t\t\treturn v;\n\t\t\t\t}\n\t\t\t\tcb.call(as || this || {}, v, k, o, opt);\n\t\t\t\tif(obj_has(o,k) && u === o[k]){ return }\n\t\t\t\tmap.call({o: o, s: s}, v,k);\n\t\t\t}\n\t\t}\n\t\tfunction map(v,k){\n\t\t\tif(N_ === k){ return }\n\t\t\tState.ify(this.o, k, this.s) ;\n\t\t}\n\t}());\n\tvar obj = Type.obj, obj_as = obj.as, obj_has = obj.has, obj_is = obj.is, obj_map = obj.map, obj_copy = obj.copy;\n\tvar num = Type.num, num_is = num.is;\n\tvar fn = Type.fn, fn_is = fn.is;\n\tvar N_ = Node._, u;\n\n\tvar Graph = {};\n\t;(function(){\n\t\tGraph.is = function(g, cb, fn, as){ DEP('graph.is'); // checks to see if an object is a valid graph.\n\t\t\tif(!g || !obj_is(g) || obj_empty(g)){ return false } // must be an object.\n\t\t\treturn !obj_map(g, map, {cb:cb,fn:fn,as:as}); // makes sure it wasn't an empty object.\n\t\t}\n\t\tfunction map(n, s){ // we invert this because the way'? we check for this is via a negation.\n\t\t\tif(!n || s !== Node.soul(n) || !Node.is(n, this.fn, this.as)){ return true } // it is true that this is an invalid graph.\n\t\t\tif(!this.cb){ return }\n\t\t\tnf.n = n; nf.as = this.as; // sequential race conditions aren't races.\n\t\t\tthis.cb.call(nf.as, n, s, nf);\n\t\t}\n\t\tfunction nf(fn){ // optional callback for each node.\n\t\t\tif(fn){ Node.is(nf.n, fn, nf.as) } // where we then have an optional callback for each key/value.\n\t\t}\n\t}());\n\t;(function(){\n\t\tGraph.ify = function(obj, env, as){ DEP('graph.ify'); \n\t\t\tvar at = {path: [], obj: obj};\n\t\t\tif(!env){\n\t\t\t\tenv = {};\n\t\t\t} else\n\t\t\tif(typeof env === 'string'){\n\t\t\t\tenv = {soul: env};\n\t\t\t} else\n\t\t\tif('function' == typeof env){\n\t\t\t\tenv.map = env;\n\t\t\t}\n\t\t\tif(typeof as === 'string'){\n\t\t\t\tenv.soul = env.soul || as;\n\t\t\t\tas = u;\n\t\t\t}\n\t\t\tif(env.soul){\n\t\t\t\tat.link = Val.link.ify(env.soul);\n\t\t\t}\n\t\t\tenv.shell = (as||{}).shell;\n\t\t\tenv.graph = env.graph || {};\n\t\t\tenv.seen = env.seen || [];\n\t\t\tenv.as = env.as || as;\n\t\t\tnode(env, at);\n\t\t\tenv.root = at.node;\n\t\t\treturn env.graph;\n\t\t}\n\t\tfunction node(env, at){ var tmp;\n\t\t\tif(tmp = seen(env, at)){ return tmp }\n\t\t\tat.env = env;\n\t\t\tat.soul = soul;\n\t\t\tif(Node.ify(at.obj, map, at)){\n\t\t\t\tat.link = at.link || Val.link.ify(Node.soul(at.node));\n\t\t\t\tif(at.obj !== env.shell){\n\t\t\t\t\tenv.graph[Val.link.is(at.link)] = at.node;\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn at;\n\t\t}\n\t\tfunction map(v,k,n){\n\t\t\tvar at = this, env = at.env, is, tmp;\n\t\t\tif(Node._ === k && obj_has(v,Val.link._)){\n\t\t\t\treturn n._; // TODO: Bug?\n\t\t\t}\n\t\t\tif(!(is = valid(v,k,n, at,env))){ return }\n\t\t\tif(!k){\n\t\t\t\tat.node = at.node || n || {};\n\t\t\t\tif(obj_has(v, Node._) && Node.soul(v)){ // ? for safety ?\n\t\t\t\t\tat.node._ = obj_copy(v._);\n\t\t\t\t}\n\t\t\t\tat.node = Node.soul.ify(at.node, Val.link.is(at.link));\n\t\t\t\tat.link = at.link || Val.link.ify(Node.soul(at.node));\n\t\t\t}\n\t\t\tif(tmp = env.map){\n\t\t\t\ttmp.call(env.as || {}, v,k,n, at);\n\t\t\t\tif(obj_has(n,k)){\n\t\t\t\t\tv = n[k];\n\t\t\t\t\tif(u === v){\n\t\t\t\t\t\tobj_del(n, k);\n\t\t\t\t\t\treturn;\n\t\t\t\t\t}\n\t\t\t\t\tif(!(is = valid(v,k,n, at,env))){ return }\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!k){ return at.node }\n\t\t\tif(true === is){\n\t\t\t\treturn v;\n\t\t\t}\n\t\t\ttmp = node(env, {obj: v, path: at.path.concat(k)});\n\t\t\tif(!tmp.node){ return }\n\t\t\treturn tmp.link; //{'#': Node.soul(tmp.node)};\n\t\t}\n\t\tfunction soul(id){ var at = this;\n\t\t\tvar prev = Val.link.is(at.link), graph = at.env.graph;\n\t\t\tat.link = at.link || Val.link.ify(id);\n\t\t\tat.link[Val.link._] = id;\n\t\t\tif(at.node && at.node[Node._]){\n\t\t\t\tat.node[Node._][Val.link._] = id;\n\t\t\t}\n\t\t\tif(obj_has(graph, prev)){\n\t\t\t\tgraph[id] = graph[prev];\n\t\t\t\tobj_del(graph, prev);\n\t\t\t}\n\t\t}\n\t\tfunction valid(v,k,n, at,env){ var tmp;\n\t\t\tif(Val.is(v)){ return true }\n\t\t\tif(obj_is(v)){ return 1 }\n\t\t\tif(tmp = env.invalid){\n\t\t\t\tv = tmp.call(env.as || {}, v,k,n);\n\t\t\t\treturn valid(v,k,n, at,env);\n\t\t\t}\n\t\t\tenv.err = \"Invalid value at '\" + at.path.concat(k).join('.') + \"'!\";\n\t\t\tif(Type.list.is(v)){ env.err += \" Use `.set(item)` instead of an Array.\" }\n\t\t}\n\t\tfunction seen(env, at){\n\t\t\tvar arr = env.seen, i = arr.length, has;\n\t\t\twhile(i--){ has = arr[i];\n\t\t\t\tif(at.obj === has.obj){ return has }\n\t\t\t}\n\t\t\tarr.push(at);\n\t\t}\n\t}());\n\tGraph.node = function(node){ DEP('graph.node'); \n\t\tvar soul = Node.soul(node);\n\t\tif(!soul){ return }\n\t\treturn obj_put({}, soul, node);\n\t}\n\t;(function(){\n\t\tGraph.to = function(graph, root, opt){ DEP('graph.to'); \n\t\t\tif(!graph){ return }\n\t\t\tvar obj = {};\n\t\t\topt = opt || {seen: {}};\n\t\t\tobj_map(graph[root], map, {obj:obj, graph: graph, opt: opt});\n\t\t\treturn obj;\n\t\t}\n\t\tfunction map(v,k){ var tmp, obj;\n\t\t\tif(Node._ === k){\n\t\t\t\tif(obj_empty(v, Val.link._)){\n\t\t\t\t\treturn;\n\t\t\t\t}\n\t\t\t\tthis.obj[k] = obj_copy(v);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(!(tmp = Val.link.is(v))){\n\t\t\t\tthis.obj[k] = v;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tif(obj = this.opt.seen[tmp]){\n\t\t\t\tthis.obj[k] = obj;\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tthis.obj[k] = this.opt.seen[tmp] = Graph.to(this.graph, tmp, this.opt);\n\t\t}\n\t}());\n\tvar fn_is = Type.fn.is;\n\tvar obj = Type.obj, obj_is = obj.is, obj_del = obj.del, obj_has = obj.has, obj_empty = obj.empty, obj_put = obj.put, obj_map = obj.map, obj_copy = obj.copy;\n\tvar u;\n\tType.graph = Type.graph || Graph;\n}());\n","/* Do NOT modify this file; see /src.ts/_admin/update-version.ts */\n/**\n *  The current version of Ethers.\n */\nexport const version = \"6.13.4\";\n//# sourceMappingURL=_version.js.map","/**\n *  Property helper functions.\n *\n *  @_subsection api/utils:Properties  [about-properties]\n */\nfunction checkType(value, type, name) {\n    const types = type.split(\"|\").map(t => t.trim());\n    for (let i = 0; i < types.length; i++) {\n        switch (type) {\n            case \"any\":\n                return;\n            case \"bigint\":\n            case \"boolean\":\n            case \"number\":\n            case \"string\":\n                if (typeof (value) === type) {\n                    return;\n                }\n        }\n    }\n    const error = new Error(`invalid value for type ${type}`);\n    error.code = \"INVALID_ARGUMENT\";\n    error.argument = `value.${name}`;\n    error.value = value;\n    throw error;\n}\n/**\n *  Resolves to a new object that is a copy of %%value%%, but with all\n *  values resolved.\n */\nexport async function resolveProperties(value) {\n    const keys = Object.keys(value);\n    const results = await Promise.all(keys.map((k) => Promise.resolve(value[k])));\n    return results.reduce((accum, v, index) => {\n        accum[keys[index]] = v;\n        return accum;\n    }, {});\n}\n/**\n *  Assigns the %%values%% to %%target%% as read-only values.\n *\n *  It %%types%% is specified, the values are checked.\n */\nexport function defineProperties(target, values, types) {\n    for (let key in values) {\n        let value = values[key];\n        const type = (types ? types[key] : null);\n        if (type) {\n            checkType(value, type, key);\n        }\n        Object.defineProperty(target, key, { enumerable: true, value, writable: false });\n    }\n}\n//# sourceMappingURL=properties.js.map","/**\n *  All errors in ethers include properties to ensure they are both\n *  human-readable (i.e. ``.message``) and machine-readable (i.e. ``.code``).\n *\n *  The [[isError]] function can be used to check the error ``code`` and\n *  provide a type guard for the properties present on that error interface.\n *\n *  @_section: api/utils/errors:Errors  [about-errors]\n */\nimport { version } from \"../_version.js\";\nimport { defineProperties } from \"./properties.js\";\nfunction stringify(value) {\n    if (value == null) {\n        return \"null\";\n    }\n    if (Array.isArray(value)) {\n        return \"[ \" + (value.map(stringify)).join(\", \") + \" ]\";\n    }\n    if (value instanceof Uint8Array) {\n        const HEX = \"0123456789abcdef\";\n        let result = \"0x\";\n        for (let i = 0; i < value.length; i++) {\n            result += HEX[value[i] >> 4];\n            result += HEX[value[i] & 0xf];\n        }\n        return result;\n    }\n    if (typeof (value) === \"object\" && typeof (value.toJSON) === \"function\") {\n        return stringify(value.toJSON());\n    }\n    switch (typeof (value)) {\n        case \"boolean\":\n        case \"symbol\":\n            return value.toString();\n        case \"bigint\":\n            return BigInt(value).toString();\n        case \"number\":\n            return (value).toString();\n        case \"string\":\n            return JSON.stringify(value);\n        case \"object\": {\n            const keys = Object.keys(value);\n            keys.sort();\n            return \"{ \" + keys.map((k) => `${stringify(k)}: ${stringify(value[k])}`).join(\", \") + \" }\";\n        }\n    }\n    return `[ COULD NOT SERIALIZE ]`;\n}\n/**\n *  Returns true if the %%error%% matches an error thrown by ethers\n *  that matches the error %%code%%.\n *\n *  In TypeScript environments, this can be used to check that %%error%%\n *  matches an EthersError type, which means the expected properties will\n *  be set.\n *\n *  @See [ErrorCodes](api:ErrorCode)\n *  @example\n *    try {\n *      // code....\n *    } catch (e) {\n *      if (isError(e, \"CALL_EXCEPTION\")) {\n *          // The Type Guard has validated this object\n *          console.log(e.data);\n *      }\n *    }\n */\nexport function isError(error, code) {\n    return (error && error.code === code);\n}\n/**\n *  Returns true if %%error%% is a [[CallExceptionError].\n */\nexport function isCallException(error) {\n    return isError(error, \"CALL_EXCEPTION\");\n}\n/**\n *  Returns a new Error configured to the format ethers emits errors, with\n *  the %%message%%, [[api:ErrorCode]] %%code%% and additional properties\n *  for the corresponding EthersError.\n *\n *  Each error in ethers includes the version of ethers, a\n *  machine-readable [[ErrorCode]], and depending on %%code%%, additional\n *  required properties. The error message will also include the %%message%%,\n *  ethers version, %%code%% and all additional properties, serialized.\n */\nexport function makeError(message, code, info) {\n    let shortMessage = message;\n    {\n        const details = [];\n        if (info) {\n            if (\"message\" in info || \"code\" in info || \"name\" in info) {\n                throw new Error(`value will overwrite populated values: ${stringify(info)}`);\n            }\n            for (const key in info) {\n                if (key === \"shortMessage\") {\n                    continue;\n                }\n                const value = (info[key]);\n                //                try {\n                details.push(key + \"=\" + stringify(value));\n                //                } catch (error: any) {\n                //                console.log(\"MMM\", error.message);\n                //                    details.push(key + \"=[could not serialize object]\");\n                //                }\n            }\n        }\n        details.push(`code=${code}`);\n        details.push(`version=${version}`);\n        if (details.length) {\n            message += \" (\" + details.join(\", \") + \")\";\n        }\n    }\n    let error;\n    switch (code) {\n        case \"INVALID_ARGUMENT\":\n            error = new TypeError(message);\n            break;\n        case \"NUMERIC_FAULT\":\n        case \"BUFFER_OVERRUN\":\n            error = new RangeError(message);\n            break;\n        default:\n            error = new Error(message);\n    }\n    defineProperties(error, { code });\n    if (info) {\n        Object.assign(error, info);\n    }\n    if (error.shortMessage == null) {\n        defineProperties(error, { shortMessage });\n    }\n    return error;\n}\n/**\n *  Throws an EthersError with %%message%%, %%code%% and additional error\n *  %%info%% when %%check%% is falsish..\n *\n *  @see [[api:makeError]]\n */\nexport function assert(check, message, code, info) {\n    if (!check) {\n        throw makeError(message, code, info);\n    }\n}\n/**\n *  A simple helper to simply ensuring provided arguments match expected\n *  constraints, throwing if not.\n *\n *  In TypeScript environments, the %%check%% has been asserted true, so\n *  any further code does not need additional compile-time checks.\n */\nexport function assertArgument(check, message, name, value) {\n    assert(check, message, \"INVALID_ARGUMENT\", { argument: name, value: value });\n}\nexport function assertArgumentCount(count, expectedCount, message) {\n    if (message == null) {\n        message = \"\";\n    }\n    if (message) {\n        message = \": \" + message;\n    }\n    assert(count >= expectedCount, \"missing arguemnt\" + message, \"MISSING_ARGUMENT\", {\n        count: count,\n        expectedCount: expectedCount\n    });\n    assert(count <= expectedCount, \"too many arguments\" + message, \"UNEXPECTED_ARGUMENT\", {\n        count: count,\n        expectedCount: expectedCount\n    });\n}\nconst _normalizeForms = [\"NFD\", \"NFC\", \"NFKD\", \"NFKC\"].reduce((accum, form) => {\n    try {\n        // General test for normalize\n        /* c8 ignore start */\n        if (\"test\".normalize(form) !== \"test\") {\n            throw new Error(\"bad\");\n        }\n        ;\n        /* c8 ignore stop */\n        if (form === \"NFD\") {\n            const check = String.fromCharCode(0xe9).normalize(\"NFD\");\n            const expected = String.fromCharCode(0x65, 0x0301);\n            /* c8 ignore start */\n            if (check !== expected) {\n                throw new Error(\"broken\");\n            }\n            /* c8 ignore stop */\n        }\n        accum.push(form);\n    }\n    catch (error) { }\n    return accum;\n}, []);\n/**\n *  Throws if the normalization %%form%% is not supported.\n */\nexport function assertNormalize(form) {\n    assert(_normalizeForms.indexOf(form) >= 0, \"platform missing String.prototype.normalize\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"String.prototype.normalize\", info: { form }\n    });\n}\n/**\n *  Many classes use file-scoped values to guard the constructor,\n *  making it effectively private. This facilitates that pattern\n *  by ensuring the %%givenGaurd%% matches the file-scoped %%guard%%,\n *  throwing if not, indicating the %%className%% if provided.\n */\nexport function assertPrivate(givenGuard, guard, className) {\n    if (className == null) {\n        className = \"\";\n    }\n    if (givenGuard !== guard) {\n        let method = className, operation = \"new\";\n        if (className) {\n            method += \".\";\n            operation += \" \" + className;\n        }\n        assert(false, `private constructor; use ${method}from* methods`, \"UNSUPPORTED_OPERATION\", {\n            operation\n        });\n    }\n}\n//# sourceMappingURL=errors.js.map","/**\n *  Some data helpers.\n *\n *\n *  @_subsection api/utils:Data Helpers  [about-data]\n */\nimport { assert, assertArgument } from \"./errors.js\";\nfunction _getBytes(value, name, copy) {\n    if (value instanceof Uint8Array) {\n        if (copy) {\n            return new Uint8Array(value);\n        }\n        return value;\n    }\n    if (typeof (value) === \"string\" && value.match(/^0x(?:[0-9a-f][0-9a-f])*$/i)) {\n        const result = new Uint8Array((value.length - 2) / 2);\n        let offset = 2;\n        for (let i = 0; i < result.length; i++) {\n            result[i] = parseInt(value.substring(offset, offset + 2), 16);\n            offset += 2;\n        }\n        return result;\n    }\n    assertArgument(false, \"invalid BytesLike value\", name || \"value\", value);\n}\n/**\n *  Get a typed Uint8Array for %%value%%. If already a Uint8Array\n *  the original %%value%% is returned; if a copy is required use\n *  [[getBytesCopy]].\n *\n *  @see: getBytesCopy\n */\nexport function getBytes(value, name) {\n    return _getBytes(value, name, false);\n}\n/**\n *  Get a typed Uint8Array for %%value%%, creating a copy if necessary\n *  to prevent any modifications of the returned value from being\n *  reflected elsewhere.\n *\n *  @see: getBytes\n */\nexport function getBytesCopy(value, name) {\n    return _getBytes(value, name, true);\n}\n/**\n *  Returns true if %%value%% is a valid [[HexString]].\n *\n *  If %%length%% is ``true`` or a //number//, it also checks that\n *  %%value%% is a valid [[DataHexString]] of %%length%% (if a //number//)\n *  bytes of data (e.g. ``0x1234`` is 2 bytes).\n */\nexport function isHexString(value, length) {\n    if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n        return false;\n    }\n    if (typeof (length) === \"number\" && value.length !== 2 + 2 * length) {\n        return false;\n    }\n    if (length === true && (value.length % 2) !== 0) {\n        return false;\n    }\n    return true;\n}\n/**\n *  Returns true if %%value%% is a valid representation of arbitrary\n *  data (i.e. a valid [[DataHexString]] or a Uint8Array).\n */\nexport function isBytesLike(value) {\n    return (isHexString(value, true) || (value instanceof Uint8Array));\n}\nconst HexCharacters = \"0123456789abcdef\";\n/**\n *  Returns a [[DataHexString]] representation of %%data%%.\n */\nexport function hexlify(data) {\n    const bytes = getBytes(data);\n    let result = \"0x\";\n    for (let i = 0; i < bytes.length; i++) {\n        const v = bytes[i];\n        result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n    }\n    return result;\n}\n/**\n *  Returns a [[DataHexString]] by concatenating all values\n *  within %%data%%.\n */\nexport function concat(datas) {\n    return \"0x\" + datas.map((d) => hexlify(d).substring(2)).join(\"\");\n}\n/**\n *  Returns the length of %%data%%, in bytes.\n */\nexport function dataLength(data) {\n    if (isHexString(data, true)) {\n        return (data.length - 2) / 2;\n    }\n    return getBytes(data).length;\n}\n/**\n *  Returns a [[DataHexString]] by slicing %%data%% from the %%start%%\n *  offset to the %%end%% offset.\n *\n *  By default %%start%% is 0 and %%end%% is the length of %%data%%.\n */\nexport function dataSlice(data, start, end) {\n    const bytes = getBytes(data);\n    if (end != null && end > bytes.length) {\n        assert(false, \"cannot slice beyond data bounds\", \"BUFFER_OVERRUN\", {\n            buffer: bytes, length: bytes.length, offset: end\n        });\n    }\n    return hexlify(bytes.slice((start == null) ? 0 : start, (end == null) ? bytes.length : end));\n}\n/**\n *  Return the [[DataHexString]] result by stripping all **leading**\n ** zero bytes from %%data%%.\n */\nexport function stripZerosLeft(data) {\n    let bytes = hexlify(data).substring(2);\n    while (bytes.startsWith(\"00\")) {\n        bytes = bytes.substring(2);\n    }\n    return \"0x\" + bytes;\n}\nfunction zeroPad(data, length, left) {\n    const bytes = getBytes(data);\n    assert(length >= bytes.length, \"padding exceeds data length\", \"BUFFER_OVERRUN\", {\n        buffer: new Uint8Array(bytes),\n        length: length,\n        offset: length + 1\n    });\n    const result = new Uint8Array(length);\n    result.fill(0);\n    if (left) {\n        result.set(bytes, length - bytes.length);\n    }\n    else {\n        result.set(bytes, 0);\n    }\n    return hexlify(result);\n}\n/**\n *  Return the [[DataHexString]] of %%data%% padded on the **left**\n *  to %%length%% bytes.\n *\n *  If %%data%% already exceeds %%length%%, a [[BufferOverrunError]] is\n *  thrown.\n *\n *  This pads data the same as **values** are in Solidity\n *  (e.g. ``uint128``).\n */\nexport function zeroPadValue(data, length) {\n    return zeroPad(data, length, true);\n}\n/**\n *  Return the [[DataHexString]] of %%data%% padded on the **right**\n *  to %%length%% bytes.\n *\n *  If %%data%% already exceeds %%length%%, a [[BufferOverrunError]] is\n *  thrown.\n *\n *  This pads data the same as **bytes** are in Solidity\n *  (e.g. ``bytes16``).\n */\nexport function zeroPadBytes(data, length) {\n    return zeroPad(data, length, false);\n}\n//# sourceMappingURL=data.js.map","/**\n *  Some mathematic operations.\n *\n *  @_subsection: api/utils:Math Helpers  [about-maths]\n */\nimport { hexlify, isBytesLike } from \"./data.js\";\nimport { assert, assertArgument } from \"./errors.js\";\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\n//const BN_Max256 = (BN_1 << BigInt(256)) - BN_1;\n// IEEE 754 support 53-bits of mantissa\nconst maxValue = 0x1fffffffffffff;\n/**\n *  Convert %%value%% from a twos-compliment representation of %%width%%\n *  bits to its value.\n *\n *  If the highest bit is ``1``, the result will be negative.\n */\nexport function fromTwos(_value, _width) {\n    const value = getUint(_value, \"value\");\n    const width = BigInt(getNumber(_width, \"width\"));\n    assert((value >> width) === BN_0, \"overflow\", \"NUMERIC_FAULT\", {\n        operation: \"fromTwos\", fault: \"overflow\", value: _value\n    });\n    // Top bit set; treat as a negative value\n    if (value >> (width - BN_1)) {\n        const mask = (BN_1 << width) - BN_1;\n        return -(((~value) & mask) + BN_1);\n    }\n    return value;\n}\n/**\n *  Convert %%value%% to a twos-compliment representation of\n *  %%width%% bits.\n *\n *  The result will always be positive.\n */\nexport function toTwos(_value, _width) {\n    let value = getBigInt(_value, \"value\");\n    const width = BigInt(getNumber(_width, \"width\"));\n    const limit = (BN_1 << (width - BN_1));\n    if (value < BN_0) {\n        value = -value;\n        assert(value <= limit, \"too low\", \"NUMERIC_FAULT\", {\n            operation: \"toTwos\", fault: \"overflow\", value: _value\n        });\n        const mask = (BN_1 << width) - BN_1;\n        return ((~value) & mask) + BN_1;\n    }\n    else {\n        assert(value < limit, \"too high\", \"NUMERIC_FAULT\", {\n            operation: \"toTwos\", fault: \"overflow\", value: _value\n        });\n    }\n    return value;\n}\n/**\n *  Mask %%value%% with a bitmask of %%bits%% ones.\n */\nexport function mask(_value, _bits) {\n    const value = getUint(_value, \"value\");\n    const bits = BigInt(getNumber(_bits, \"bits\"));\n    return value & ((BN_1 << bits) - BN_1);\n}\n/**\n *  Gets a BigInt from %%value%%. If it is an invalid value for\n *  a BigInt, then an ArgumentError will be thrown for %%name%%.\n */\nexport function getBigInt(value, name) {\n    switch (typeof (value)) {\n        case \"bigint\": return value;\n        case \"number\":\n            assertArgument(Number.isInteger(value), \"underflow\", name || \"value\", value);\n            assertArgument(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return BigInt(value);\n        case \"string\":\n            try {\n                if (value === \"\") {\n                    throw new Error(\"empty string\");\n                }\n                if (value[0] === \"-\" && value[1] !== \"-\") {\n                    return -BigInt(value.substring(1));\n                }\n                return BigInt(value);\n            }\n            catch (e) {\n                assertArgument(false, `invalid BigNumberish string: ${e.message}`, name || \"value\", value);\n            }\n    }\n    assertArgument(false, \"invalid BigNumberish value\", name || \"value\", value);\n}\n/**\n *  Returns %%value%% as a bigint, validating it is valid as a bigint\n *  value and that it is positive.\n */\nexport function getUint(value, name) {\n    const result = getBigInt(value, name);\n    assert(result >= BN_0, \"unsigned value cannot be negative\", \"NUMERIC_FAULT\", {\n        fault: \"overflow\", operation: \"getUint\", value\n    });\n    return result;\n}\nconst Nibbles = \"0123456789abcdef\";\n/*\n * Converts %%value%% to a BigInt. If %%value%% is a Uint8Array, it\n * is treated as Big Endian data.\n */\nexport function toBigInt(value) {\n    if (value instanceof Uint8Array) {\n        let result = \"0x0\";\n        for (const v of value) {\n            result += Nibbles[v >> 4];\n            result += Nibbles[v & 0x0f];\n        }\n        return BigInt(result);\n    }\n    return getBigInt(value);\n}\n/**\n *  Gets a //number// from %%value%%. If it is an invalid value for\n *  a //number//, then an ArgumentError will be thrown for %%name%%.\n */\nexport function getNumber(value, name) {\n    switch (typeof (value)) {\n        case \"bigint\":\n            assertArgument(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return Number(value);\n        case \"number\":\n            assertArgument(Number.isInteger(value), \"underflow\", name || \"value\", value);\n            assertArgument(value >= -maxValue && value <= maxValue, \"overflow\", name || \"value\", value);\n            return value;\n        case \"string\":\n            try {\n                if (value === \"\") {\n                    throw new Error(\"empty string\");\n                }\n                return getNumber(BigInt(value), name);\n            }\n            catch (e) {\n                assertArgument(false, `invalid numeric string: ${e.message}`, name || \"value\", value);\n            }\n    }\n    assertArgument(false, \"invalid numeric value\", name || \"value\", value);\n}\n/**\n *  Converts %%value%% to a number. If %%value%% is a Uint8Array, it\n *  is treated as Big Endian data. Throws if the value is not safe.\n */\nexport function toNumber(value) {\n    return getNumber(toBigInt(value));\n}\n/**\n *  Converts %%value%% to a Big Endian hexstring, optionally padded to\n *  %%width%% bytes.\n */\nexport function toBeHex(_value, _width) {\n    const value = getUint(_value, \"value\");\n    let result = value.toString(16);\n    if (_width == null) {\n        // Ensure the value is of even length\n        if (result.length % 2) {\n            result = \"0\" + result;\n        }\n    }\n    else {\n        const width = getNumber(_width, \"width\");\n        assert(width * 2 >= result.length, `value exceeds width (${width} bytes)`, \"NUMERIC_FAULT\", {\n            operation: \"toBeHex\",\n            fault: \"overflow\",\n            value: _value\n        });\n        // Pad the value to the required width\n        while (result.length < (width * 2)) {\n            result = \"0\" + result;\n        }\n    }\n    return \"0x\" + result;\n}\n/**\n *  Converts %%value%% to a Big Endian Uint8Array.\n */\nexport function toBeArray(_value) {\n    const value = getUint(_value, \"value\");\n    if (value === BN_0) {\n        return new Uint8Array([]);\n    }\n    let hex = value.toString(16);\n    if (hex.length % 2) {\n        hex = \"0\" + hex;\n    }\n    const result = new Uint8Array(hex.length / 2);\n    for (let i = 0; i < result.length; i++) {\n        const offset = i * 2;\n        result[i] = parseInt(hex.substring(offset, offset + 2), 16);\n    }\n    return result;\n}\n/**\n *  Returns a [[HexString]] for %%value%% safe to use as a //Quantity//.\n *\n *  A //Quantity// does not have and leading 0 values unless the value is\n *  the literal value `0x0`. This is most commonly used for JSSON-RPC\n *  numeric values.\n */\nexport function toQuantity(value) {\n    let result = hexlify(isBytesLike(value) ? value : toBeArray(value)).substring(2);\n    while (result.startsWith(\"0\")) {\n        result = result.substring(1);\n    }\n    if (result === \"\") {\n        result = \"0\";\n    }\n    return \"0x\" + result;\n}\n//# sourceMappingURL=maths.js.map","/**\n *  The [Base58 Encoding](link-base58) scheme allows a **numeric** value\n *  to be encoded as a compact string using a radix of 58 using only\n *  alpha-numeric characters. Confusingly similar characters are omitted\n *  (i.e. ``\"l0O\"``).\n *\n *  Note that Base58 encodes a **numeric** value, not arbitrary bytes,\n *  since any zero-bytes on the left would get removed. To mitigate this\n *  issue most schemes that use Base58 choose specific high-order values\n *  to ensure non-zero prefixes.\n *\n *  @_subsection: api/utils:Base58 Encoding [about-base58]\n */\nimport { getBytes } from \"./data.js\";\nimport { assertArgument } from \"./errors.js\";\nimport { toBigInt } from \"./maths.js\";\nconst Alphabet = \"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\";\nlet Lookup = null;\nfunction getAlpha(letter) {\n    if (Lookup == null) {\n        Lookup = {};\n        for (let i = 0; i < Alphabet.length; i++) {\n            Lookup[Alphabet[i]] = BigInt(i);\n        }\n    }\n    const result = Lookup[letter];\n    assertArgument(result != null, `invalid base58 value`, \"letter\", letter);\n    return result;\n}\nconst BN_0 = BigInt(0);\nconst BN_58 = BigInt(58);\n/**\n *  Encode %%value%% as a Base58-encoded string.\n */\nexport function encodeBase58(_value) {\n    const bytes = getBytes(_value);\n    let value = toBigInt(bytes);\n    let result = \"\";\n    while (value) {\n        result = Alphabet[Number(value % BN_58)] + result;\n        value /= BN_58;\n    }\n    // Account for leading padding zeros\n    for (let i = 0; i < bytes.length; i++) {\n        if (bytes[i]) {\n            break;\n        }\n        result = Alphabet[0] + result;\n    }\n    return result;\n}\n/**\n *  Decode the Base58-encoded %%value%%.\n */\nexport function decodeBase58(value) {\n    let result = BN_0;\n    for (let i = 0; i < value.length; i++) {\n        result *= BN_58;\n        result += getAlpha(value[i]);\n    }\n    return result;\n}\n//# sourceMappingURL=base58.js.map","/**\n *  Events allow for applications to use the observer pattern, which\n *  allows subscribing and publishing events, outside the normal\n *  execution paths.\n *\n *  @_section api/utils/events:Events  [about-events]\n */\nimport { defineProperties } from \"./properties.js\";\n/**\n *  When an [[EventEmitterable]] triggers a [[Listener]], the\n *  callback always ahas one additional argument passed, which is\n *  an **EventPayload**.\n */\nexport class EventPayload {\n    /**\n     *  The event filter.\n     */\n    filter;\n    /**\n     *  The **EventEmitterable**.\n     */\n    emitter;\n    #listener;\n    /**\n     *  Create a new **EventPayload** for %%emitter%% with\n     *  the %%listener%% and for %%filter%%.\n     */\n    constructor(emitter, listener, filter) {\n        this.#listener = listener;\n        defineProperties(this, { emitter, filter });\n    }\n    /**\n     *  Unregister the triggered listener for future events.\n     */\n    async removeListener() {\n        if (this.#listener == null) {\n            return;\n        }\n        await this.emitter.off(this.filter, this.#listener);\n    }\n}\n//# sourceMappingURL=events.js.map","/**\n *  Using strings in Ethereum (or any security-basd system) requires\n *  additional care. These utilities attempt to mitigate some of the\n *  safety issues as well as provide the ability to recover and analyse\n *  strings.\n *\n *  @_subsection api/utils:Strings and UTF-8  [about-strings]\n */\nimport { getBytes } from \"./data.js\";\nimport { assertArgument, assertNormalize } from \"./errors.js\";\nfunction errorFunc(reason, offset, bytes, output, badCodepoint) {\n    assertArgument(false, `invalid codepoint at offset ${offset}; ${reason}`, \"bytes\", bytes);\n}\nfunction ignoreFunc(reason, offset, bytes, output, badCodepoint) {\n    // If there is an invalid prefix (including stray continuation), skip any additional continuation bytes\n    if (reason === \"BAD_PREFIX\" || reason === \"UNEXPECTED_CONTINUE\") {\n        let i = 0;\n        for (let o = offset + 1; o < bytes.length; o++) {\n            if (bytes[o] >> 6 !== 0x02) {\n                break;\n            }\n            i++;\n        }\n        return i;\n    }\n    // This byte runs us past the end of the string, so just jump to the end\n    // (but the first byte was read already read and therefore skipped)\n    if (reason === \"OVERRUN\") {\n        return bytes.length - offset - 1;\n    }\n    // Nothing to skip\n    return 0;\n}\nfunction replaceFunc(reason, offset, bytes, output, badCodepoint) {\n    // Overlong representations are otherwise \"valid\" code points; just non-deistingtished\n    if (reason === \"OVERLONG\") {\n        assertArgument(typeof (badCodepoint) === \"number\", \"invalid bad code point for replacement\", \"badCodepoint\", badCodepoint);\n        output.push(badCodepoint);\n        return 0;\n    }\n    // Put the replacement character into the output\n    output.push(0xfffd);\n    // Otherwise, process as if ignoring errors\n    return ignoreFunc(reason, offset, bytes, output, badCodepoint);\n}\n/**\n *  A handful of popular, built-in UTF-8 error handling strategies.\n *\n *  **``\"error\"``** - throws on ANY illegal UTF-8 sequence or\n *  non-canonical (overlong) codepoints (this is the default)\n *\n *  **``\"ignore\"``** - silently drops any illegal UTF-8 sequence\n *  and accepts non-canonical (overlong) codepoints\n *\n *  **``\"replace\"``** - replace any illegal UTF-8 sequence with the\n *  UTF-8 replacement character (i.e. ``\"\\\\ufffd\"``) and accepts\n *  non-canonical (overlong) codepoints\n *\n *  @returns: Record<\"error\" | \"ignore\" | \"replace\", Utf8ErrorFunc>\n */\nexport const Utf8ErrorFuncs = Object.freeze({\n    error: errorFunc,\n    ignore: ignoreFunc,\n    replace: replaceFunc\n});\n// http://stackoverflow.com/questions/13356493/decode-utf-8-with-javascript#13691499\nfunction getUtf8CodePoints(_bytes, onError) {\n    if (onError == null) {\n        onError = Utf8ErrorFuncs.error;\n    }\n    const bytes = getBytes(_bytes, \"bytes\");\n    const result = [];\n    let i = 0;\n    // Invalid bytes are ignored\n    while (i < bytes.length) {\n        const c = bytes[i++];\n        // 0xxx xxxx\n        if (c >> 7 === 0) {\n            result.push(c);\n            continue;\n        }\n        // Multibyte; how many bytes left for this character?\n        let extraLength = null;\n        let overlongMask = null;\n        // 110x xxxx 10xx xxxx\n        if ((c & 0xe0) === 0xc0) {\n            extraLength = 1;\n            overlongMask = 0x7f;\n            // 1110 xxxx 10xx xxxx 10xx xxxx\n        }\n        else if ((c & 0xf0) === 0xe0) {\n            extraLength = 2;\n            overlongMask = 0x7ff;\n            // 1111 0xxx 10xx xxxx 10xx xxxx 10xx xxxx\n        }\n        else if ((c & 0xf8) === 0xf0) {\n            extraLength = 3;\n            overlongMask = 0xffff;\n        }\n        else {\n            if ((c & 0xc0) === 0x80) {\n                i += onError(\"UNEXPECTED_CONTINUE\", i - 1, bytes, result);\n            }\n            else {\n                i += onError(\"BAD_PREFIX\", i - 1, bytes, result);\n            }\n            continue;\n        }\n        // Do we have enough bytes in our data?\n        if (i - 1 + extraLength >= bytes.length) {\n            i += onError(\"OVERRUN\", i - 1, bytes, result);\n            continue;\n        }\n        // Remove the length prefix from the char\n        let res = c & ((1 << (8 - extraLength - 1)) - 1);\n        for (let j = 0; j < extraLength; j++) {\n            let nextChar = bytes[i];\n            // Invalid continuation byte\n            if ((nextChar & 0xc0) != 0x80) {\n                i += onError(\"MISSING_CONTINUE\", i, bytes, result);\n                res = null;\n                break;\n            }\n            ;\n            res = (res << 6) | (nextChar & 0x3f);\n            i++;\n        }\n        // See above loop for invalid continuation byte\n        if (res === null) {\n            continue;\n        }\n        // Maximum code point\n        if (res > 0x10ffff) {\n            i += onError(\"OUT_OF_RANGE\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        // Reserved for UTF-16 surrogate halves\n        if (res >= 0xd800 && res <= 0xdfff) {\n            i += onError(\"UTF16_SURROGATE\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        // Check for overlong sequences (more bytes than needed)\n        if (res <= overlongMask) {\n            i += onError(\"OVERLONG\", i - 1 - extraLength, bytes, result, res);\n            continue;\n        }\n        result.push(res);\n    }\n    return result;\n}\n// http://stackoverflow.com/questions/18729405/how-to-convert-utf8-string-to-byte-array\n/**\n *  Returns the UTF-8 byte representation of %%str%%.\n *\n *  If %%form%% is specified, the string is normalized.\n */\nexport function toUtf8Bytes(str, form) {\n    assertArgument(typeof (str) === \"string\", \"invalid string value\", \"str\", str);\n    if (form != null) {\n        assertNormalize(form);\n        str = str.normalize(form);\n    }\n    let result = [];\n    for (let i = 0; i < str.length; i++) {\n        const c = str.charCodeAt(i);\n        if (c < 0x80) {\n            result.push(c);\n        }\n        else if (c < 0x800) {\n            result.push((c >> 6) | 0xc0);\n            result.push((c & 0x3f) | 0x80);\n        }\n        else if ((c & 0xfc00) == 0xd800) {\n            i++;\n            const c2 = str.charCodeAt(i);\n            assertArgument(i < str.length && ((c2 & 0xfc00) === 0xdc00), \"invalid surrogate pair\", \"str\", str);\n            // Surrogate Pair\n            const pair = 0x10000 + ((c & 0x03ff) << 10) + (c2 & 0x03ff);\n            result.push((pair >> 18) | 0xf0);\n            result.push(((pair >> 12) & 0x3f) | 0x80);\n            result.push(((pair >> 6) & 0x3f) | 0x80);\n            result.push((pair & 0x3f) | 0x80);\n        }\n        else {\n            result.push((c >> 12) | 0xe0);\n            result.push(((c >> 6) & 0x3f) | 0x80);\n            result.push((c & 0x3f) | 0x80);\n        }\n    }\n    return new Uint8Array(result);\n}\n;\n//export \nfunction _toUtf8String(codePoints) {\n    return codePoints.map((codePoint) => {\n        if (codePoint <= 0xffff) {\n            return String.fromCharCode(codePoint);\n        }\n        codePoint -= 0x10000;\n        return String.fromCharCode((((codePoint >> 10) & 0x3ff) + 0xd800), ((codePoint & 0x3ff) + 0xdc00));\n    }).join(\"\");\n}\n/**\n *  Returns the string represented by the UTF-8 data %%bytes%%.\n *\n *  When %%onError%% function is specified, it is called on UTF-8\n *  errors allowing recovery using the [[Utf8ErrorFunc]] API.\n *  (default: [error](Utf8ErrorFuncs))\n */\nexport function toUtf8String(bytes, onError) {\n    return _toUtf8String(getUtf8CodePoints(bytes, onError));\n}\n/**\n *  Returns the UTF-8 code-points for %%str%%.\n *\n *  If %%form%% is specified, the string is normalized.\n */\nexport function toUtf8CodePoints(str, form) {\n    return getUtf8CodePoints(toUtf8Bytes(str, form));\n}\n//# sourceMappingURL=utf8.js.map","import { assert, makeError } from \"./errors.js\";\nexport function createGetUrl(options) {\n    async function getUrl(req, _signal) {\n        assert(_signal == null || !_signal.cancelled, \"request cancelled before sending\", \"CANCELLED\");\n        const protocol = req.url.split(\":\")[0].toLowerCase();\n        assert(protocol === \"http\" || protocol === \"https\", `unsupported protocol ${protocol}`, \"UNSUPPORTED_OPERATION\", {\n            info: { protocol },\n            operation: \"request\"\n        });\n        assert(protocol === \"https\" || !req.credentials || req.allowInsecureAuthentication, \"insecure authorized connections unsupported\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"request\"\n        });\n        let error = null;\n        const controller = new AbortController();\n        const timer = setTimeout(() => {\n            error = makeError(\"request timeout\", \"TIMEOUT\");\n            controller.abort();\n        }, req.timeout);\n        if (_signal) {\n            _signal.addListener(() => {\n                error = makeError(\"request cancelled\", \"CANCELLED\");\n                controller.abort();\n            });\n        }\n        const init = {\n            method: req.method,\n            headers: new Headers(Array.from(req)),\n            body: req.body || undefined,\n            signal: controller.signal\n        };\n        let resp;\n        try {\n            resp = await fetch(req.url, init);\n        }\n        catch (_error) {\n            clearTimeout(timer);\n            if (error) {\n                throw error;\n            }\n            throw _error;\n        }\n        clearTimeout(timer);\n        const headers = {};\n        resp.headers.forEach((value, key) => {\n            headers[key.toLowerCase()] = value;\n        });\n        const respBody = await resp.arrayBuffer();\n        const body = (respBody == null) ? null : new Uint8Array(respBody);\n        return {\n            statusCode: resp.status,\n            statusMessage: resp.statusText,\n            headers, body\n        };\n    }\n    return getUrl;\n}\n// @TODO: remove in v7; provided for backwards compat\nconst defaultGetUrl = createGetUrl({});\nexport async function getUrl(req, _signal) {\n    return defaultGetUrl(req, _signal);\n}\n//# sourceMappingURL=geturl-browser.js.map","/**\n *  Fetching content from the web is environment-specific, so Ethers\n *  provides an abstraction that each environment can implement to provide\n *  this service.\n *\n *  On [Node.js](link-node), the ``http`` and ``https`` libs are used to\n *  create a request object, register event listeners and process data\n *  and populate the [[FetchResponse]].\n *\n *  In a browser, the [DOM fetch](link-js-fetch) is used, and the resulting\n *  ``Promise`` is waited on to retrieve the payload.\n *\n *  The [[FetchRequest]] is responsible for handling many common situations,\n *  such as redirects, server throttling, authentication, etc.\n *\n *  It also handles common gateways, such as IPFS and data URIs.\n *\n *  @_section api/utils/fetching:Fetching Web Content  [about-fetch]\n */\nimport { decodeBase64, encodeBase64 } from \"./base64.js\";\nimport { hexlify } from \"./data.js\";\nimport { assert, assertArgument } from \"./errors.js\";\nimport { defineProperties } from \"./properties.js\";\nimport { toUtf8Bytes, toUtf8String } from \"./utf8.js\";\nimport { createGetUrl } from \"./geturl.js\";\nconst MAX_ATTEMPTS = 12;\nconst SLOT_INTERVAL = 250;\n// The global FetchGetUrlFunc implementation.\nlet defaultGetUrlFunc = createGetUrl();\nconst reData = new RegExp(\"^data:([^;:]*)?(;base64)?,(.*)$\", \"i\");\nconst reIpfs = new RegExp(\"^ipfs:/\\/(ipfs/)?(.*)$\", \"i\");\n// If locked, new Gateways cannot be added\nlet locked = false;\n// https://developer.mozilla.org/en-US/docs/Web/HTTP/Basics_of_HTTP/Data_URLs\nasync function dataGatewayFunc(url, signal) {\n    try {\n        const match = url.match(reData);\n        if (!match) {\n            throw new Error(\"invalid data\");\n        }\n        return new FetchResponse(200, \"OK\", {\n            \"content-type\": (match[1] || \"text/plain\"),\n        }, (match[2] ? decodeBase64(match[3]) : unpercent(match[3])));\n    }\n    catch (error) {\n        return new FetchResponse(599, \"BAD REQUEST (invalid data: URI)\", {}, null, new FetchRequest(url));\n    }\n}\n/**\n *  Returns a [[FetchGatewayFunc]] for fetching content from a standard\n *  IPFS gateway hosted at %%baseUrl%%.\n */\nfunction getIpfsGatewayFunc(baseUrl) {\n    async function gatewayIpfs(url, signal) {\n        try {\n            const match = url.match(reIpfs);\n            if (!match) {\n                throw new Error(\"invalid link\");\n            }\n            return new FetchRequest(`${baseUrl}${match[2]}`);\n        }\n        catch (error) {\n            return new FetchResponse(599, \"BAD REQUEST (invalid IPFS URI)\", {}, null, new FetchRequest(url));\n        }\n    }\n    return gatewayIpfs;\n}\nconst Gateways = {\n    \"data\": dataGatewayFunc,\n    \"ipfs\": getIpfsGatewayFunc(\"https:/\\/gateway.ipfs.io/ipfs/\")\n};\nconst fetchSignals = new WeakMap();\n/**\n *  @_ignore\n */\nexport class FetchCancelSignal {\n    #listeners;\n    #cancelled;\n    constructor(request) {\n        this.#listeners = [];\n        this.#cancelled = false;\n        fetchSignals.set(request, () => {\n            if (this.#cancelled) {\n                return;\n            }\n            this.#cancelled = true;\n            for (const listener of this.#listeners) {\n                setTimeout(() => { listener(); }, 0);\n            }\n            this.#listeners = [];\n        });\n    }\n    addListener(listener) {\n        assert(!this.#cancelled, \"singal already cancelled\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fetchCancelSignal.addCancelListener\"\n        });\n        this.#listeners.push(listener);\n    }\n    get cancelled() { return this.#cancelled; }\n    checkSignal() {\n        assert(!this.cancelled, \"cancelled\", \"CANCELLED\", {});\n    }\n}\n// Check the signal, throwing if it is cancelled\nfunction checkSignal(signal) {\n    if (signal == null) {\n        throw new Error(\"missing signal; should not happen\");\n    }\n    signal.checkSignal();\n    return signal;\n}\n/**\n *  Represents a request for a resource using a URI.\n *\n *  By default, the supported schemes are ``HTTP``, ``HTTPS``, ``data:``,\n *  and ``IPFS:``.\n *\n *  Additional schemes can be added globally using [[registerGateway]].\n *\n *  @example:\n *    req = new FetchRequest(\"https://www.ricmoo.com\")\n *    resp = await req.send()\n *    resp.body.length\n *    //_result:\n */\nexport class FetchRequest {\n    #allowInsecure;\n    #gzip;\n    #headers;\n    #method;\n    #timeout;\n    #url;\n    #body;\n    #bodyType;\n    #creds;\n    // Hooks\n    #preflight;\n    #process;\n    #retry;\n    #signal;\n    #throttle;\n    #getUrlFunc;\n    /**\n     *  The fetch URL to request.\n     */\n    get url() { return this.#url; }\n    set url(url) {\n        this.#url = String(url);\n    }\n    /**\n     *  The fetch body, if any, to send as the request body. //(default: null)//\n     *\n     *  When setting a body, the intrinsic ``Content-Type`` is automatically\n     *  set and will be used if **not overridden** by setting a custom\n     *  header.\n     *\n     *  If %%body%% is null, the body is cleared (along with the\n     *  intrinsic ``Content-Type``).\n     *\n     *  If %%body%% is a string, the intrinsic ``Content-Type`` is set to\n     *  ``text/plain``.\n     *\n     *  If %%body%% is a Uint8Array, the intrinsic ``Content-Type`` is set to\n     *  ``application/octet-stream``.\n     *\n     *  If %%body%% is any other object, the intrinsic ``Content-Type`` is\n     *  set to ``application/json``.\n     */\n    get body() {\n        if (this.#body == null) {\n            return null;\n        }\n        return new Uint8Array(this.#body);\n    }\n    set body(body) {\n        if (body == null) {\n            this.#body = undefined;\n            this.#bodyType = undefined;\n        }\n        else if (typeof (body) === \"string\") {\n            this.#body = toUtf8Bytes(body);\n            this.#bodyType = \"text/plain\";\n        }\n        else if (body instanceof Uint8Array) {\n            this.#body = body;\n            this.#bodyType = \"application/octet-stream\";\n        }\n        else if (typeof (body) === \"object\") {\n            this.#body = toUtf8Bytes(JSON.stringify(body));\n            this.#bodyType = \"application/json\";\n        }\n        else {\n            throw new Error(\"invalid body\");\n        }\n    }\n    /**\n     *  Returns true if the request has a body.\n     */\n    hasBody() {\n        return (this.#body != null);\n    }\n    /**\n     *  The HTTP method to use when requesting the URI. If no method\n     *  has been explicitly set, then ``GET`` is used if the body is\n     *  null and ``POST`` otherwise.\n     */\n    get method() {\n        if (this.#method) {\n            return this.#method;\n        }\n        if (this.hasBody()) {\n            return \"POST\";\n        }\n        return \"GET\";\n    }\n    set method(method) {\n        if (method == null) {\n            method = \"\";\n        }\n        this.#method = String(method).toUpperCase();\n    }\n    /**\n     *  The headers that will be used when requesting the URI. All\n     *  keys are lower-case.\n     *\n     *  This object is a copy, so any changes will **NOT** be reflected\n     *  in the ``FetchRequest``.\n     *\n     *  To set a header entry, use the ``setHeader`` method.\n     */\n    get headers() {\n        const headers = Object.assign({}, this.#headers);\n        if (this.#creds) {\n            headers[\"authorization\"] = `Basic ${encodeBase64(toUtf8Bytes(this.#creds))}`;\n        }\n        ;\n        if (this.allowGzip) {\n            headers[\"accept-encoding\"] = \"gzip\";\n        }\n        if (headers[\"content-type\"] == null && this.#bodyType) {\n            headers[\"content-type\"] = this.#bodyType;\n        }\n        if (this.body) {\n            headers[\"content-length\"] = String(this.body.length);\n        }\n        return headers;\n    }\n    /**\n     *  Get the header for %%key%%, ignoring case.\n     */\n    getHeader(key) {\n        return this.headers[key.toLowerCase()];\n    }\n    /**\n     *  Set the header for %%key%% to %%value%%. All values are coerced\n     *  to a string.\n     */\n    setHeader(key, value) {\n        this.#headers[String(key).toLowerCase()] = String(value);\n    }\n    /**\n     *  Clear all headers, resetting all intrinsic headers.\n     */\n    clearHeaders() {\n        this.#headers = {};\n    }\n    [Symbol.iterator]() {\n        const headers = this.headers;\n        const keys = Object.keys(headers);\n        let index = 0;\n        return {\n            next: () => {\n                if (index < keys.length) {\n                    const key = keys[index++];\n                    return {\n                        value: [key, headers[key]], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The value that will be sent for the ``Authorization`` header.\n     *\n     *  To set the credentials, use the ``setCredentials`` method.\n     */\n    get credentials() {\n        return this.#creds || null;\n    }\n    /**\n     *  Sets an ``Authorization`` for %%username%% with %%password%%.\n     */\n    setCredentials(username, password) {\n        assertArgument(!username.match(/:/), \"invalid basic authentication username\", \"username\", \"[REDACTED]\");\n        this.#creds = `${username}:${password}`;\n    }\n    /**\n     *  Enable and request gzip-encoded responses. The response will\n     *  automatically be decompressed. //(default: true)//\n     */\n    get allowGzip() {\n        return this.#gzip;\n    }\n    set allowGzip(value) {\n        this.#gzip = !!value;\n    }\n    /**\n     *  Allow ``Authentication`` credentials to be sent over insecure\n     *  channels. //(default: false)//\n     */\n    get allowInsecureAuthentication() {\n        return !!this.#allowInsecure;\n    }\n    set allowInsecureAuthentication(value) {\n        this.#allowInsecure = !!value;\n    }\n    /**\n     *  The timeout (in milliseconds) to wait for a complete response.\n     *  //(default: 5 minutes)//\n     */\n    get timeout() { return this.#timeout; }\n    set timeout(timeout) {\n        assertArgument(timeout >= 0, \"timeout must be non-zero\", \"timeout\", timeout);\n        this.#timeout = timeout;\n    }\n    /**\n     *  This function is called prior to each request, for example\n     *  during a redirection or retry in case of server throttling.\n     *\n     *  This offers an opportunity to populate headers or update\n     *  content before sending a request.\n     */\n    get preflightFunc() {\n        return this.#preflight || null;\n    }\n    set preflightFunc(preflight) {\n        this.#preflight = preflight;\n    }\n    /**\n     *  This function is called after each response, offering an\n     *  opportunity to provide client-level throttling or updating\n     *  response data.\n     *\n     *  Any error thrown in this causes the ``send()`` to throw.\n     *\n     *  To schedule a retry attempt (assuming the maximum retry limit\n     *  has not been reached), use [[response.throwThrottleError]].\n     */\n    get processFunc() {\n        return this.#process || null;\n    }\n    set processFunc(process) {\n        this.#process = process;\n    }\n    /**\n     *  This function is called on each retry attempt.\n     */\n    get retryFunc() {\n        return this.#retry || null;\n    }\n    set retryFunc(retry) {\n        this.#retry = retry;\n    }\n    /**\n     *  This function is called to fetch content from HTTP and\n     *  HTTPS URLs and is platform specific (e.g. nodejs vs\n     *  browsers).\n     *\n     *  This is by default the currently registered global getUrl\n     *  function, which can be changed using [[registerGetUrl]].\n     *  If this has been set, setting is to ``null`` will cause\n     *  this FetchRequest (and any future clones) to revert back to\n     *  using the currently registered global getUrl function.\n     *\n     *  Setting this is generally not necessary, but may be useful\n     *  for developers that wish to intercept requests or to\n     *  configurege a proxy or other agent.\n     */\n    get getUrlFunc() {\n        return this.#getUrlFunc || defaultGetUrlFunc;\n    }\n    set getUrlFunc(value) {\n        this.#getUrlFunc = value;\n    }\n    /**\n     *  Create a new FetchRequest instance with default values.\n     *\n     *  Once created, each property may be set before issuing a\n     *  ``.send()`` to make the request.\n     */\n    constructor(url) {\n        this.#url = String(url);\n        this.#allowInsecure = false;\n        this.#gzip = true;\n        this.#headers = {};\n        this.#method = \"\";\n        this.#timeout = 300000;\n        this.#throttle = {\n            slotInterval: SLOT_INTERVAL,\n            maxAttempts: MAX_ATTEMPTS\n        };\n        this.#getUrlFunc = null;\n    }\n    toString() {\n        return `<FetchRequest method=${JSON.stringify(this.method)} url=${JSON.stringify(this.url)} headers=${JSON.stringify(this.headers)} body=${this.#body ? hexlify(this.#body) : \"null\"}>`;\n    }\n    /**\n     *  Update the throttle parameters used to determine maximum\n     *  attempts and exponential-backoff properties.\n     */\n    setThrottleParams(params) {\n        if (params.slotInterval != null) {\n            this.#throttle.slotInterval = params.slotInterval;\n        }\n        if (params.maxAttempts != null) {\n            this.#throttle.maxAttempts = params.maxAttempts;\n        }\n    }\n    async #send(attempt, expires, delay, _request, _response) {\n        if (attempt >= this.#throttle.maxAttempts) {\n            return _response.makeServerError(\"exceeded maximum retry limit\");\n        }\n        assert(getTime() <= expires, \"timeout\", \"TIMEOUT\", {\n            operation: \"request.send\", reason: \"timeout\", request: _request\n        });\n        if (delay > 0) {\n            await wait(delay);\n        }\n        let req = this.clone();\n        const scheme = (req.url.split(\":\")[0] || \"\").toLowerCase();\n        // Process any Gateways\n        if (scheme in Gateways) {\n            const result = await Gateways[scheme](req.url, checkSignal(_request.#signal));\n            if (result instanceof FetchResponse) {\n                let response = result;\n                if (this.processFunc) {\n                    checkSignal(_request.#signal);\n                    try {\n                        response = await this.processFunc(req, response);\n                    }\n                    catch (error) {\n                        // Something went wrong during processing; throw a 5xx server error\n                        if (error.throttle == null || typeof (error.stall) !== \"number\") {\n                            response.makeServerError(\"error in post-processing function\", error).assertOk();\n                        }\n                        // Ignore throttling\n                    }\n                }\n                return response;\n            }\n            req = result;\n        }\n        // We have a preflight function; update the request\n        if (this.preflightFunc) {\n            req = await this.preflightFunc(req);\n        }\n        const resp = await this.getUrlFunc(req, checkSignal(_request.#signal));\n        let response = new FetchResponse(resp.statusCode, resp.statusMessage, resp.headers, resp.body, _request);\n        if (response.statusCode === 301 || response.statusCode === 302) {\n            // Redirect\n            try {\n                const location = response.headers.location || \"\";\n                return req.redirect(location).#send(attempt + 1, expires, 0, _request, response);\n            }\n            catch (error) { }\n            // Things won't get any better on another attempt; abort\n            return response;\n        }\n        else if (response.statusCode === 429) {\n            // Throttle\n            if (this.retryFunc == null || (await this.retryFunc(req, response, attempt))) {\n                const retryAfter = response.headers[\"retry-after\"];\n                let delay = this.#throttle.slotInterval * Math.trunc(Math.random() * Math.pow(2, attempt));\n                if (typeof (retryAfter) === \"string\" && retryAfter.match(/^[1-9][0-9]*$/)) {\n                    delay = parseInt(retryAfter);\n                }\n                return req.clone().#send(attempt + 1, expires, delay, _request, response);\n            }\n        }\n        if (this.processFunc) {\n            checkSignal(_request.#signal);\n            try {\n                response = await this.processFunc(req, response);\n            }\n            catch (error) {\n                // Something went wrong during processing; throw a 5xx server error\n                if (error.throttle == null || typeof (error.stall) !== \"number\") {\n                    response.makeServerError(\"error in post-processing function\", error).assertOk();\n                }\n                // Throttle\n                let delay = this.#throttle.slotInterval * Math.trunc(Math.random() * Math.pow(2, attempt));\n                ;\n                if (error.stall >= 0) {\n                    delay = error.stall;\n                }\n                return req.clone().#send(attempt + 1, expires, delay, _request, response);\n            }\n        }\n        return response;\n    }\n    /**\n     *  Resolves to the response by sending the request.\n     */\n    send() {\n        assert(this.#signal == null, \"request already sent\", \"UNSUPPORTED_OPERATION\", { operation: \"fetchRequest.send\" });\n        this.#signal = new FetchCancelSignal(this);\n        return this.#send(0, getTime() + this.timeout, 0, this, new FetchResponse(0, \"\", {}, null, this));\n    }\n    /**\n     *  Cancels the inflight response, causing a ``CANCELLED``\n     *  error to be rejected from the [[send]].\n     */\n    cancel() {\n        assert(this.#signal != null, \"request has not been sent\", \"UNSUPPORTED_OPERATION\", { operation: \"fetchRequest.cancel\" });\n        const signal = fetchSignals.get(this);\n        if (!signal) {\n            throw new Error(\"missing signal; should not happen\");\n        }\n        signal();\n    }\n    /**\n     *  Returns a new [[FetchRequest]] that represents the redirection\n     *  to %%location%%.\n     */\n    redirect(location) {\n        // Redirection; for now we only support absolute locations\n        const current = this.url.split(\":\")[0].toLowerCase();\n        const target = location.split(\":\")[0].toLowerCase();\n        // Don't allow redirecting:\n        // - non-GET requests\n        // - downgrading the security (e.g. https => http)\n        // - to non-HTTP (or non-HTTPS) protocols [this could be relaxed?]\n        assert(this.method === \"GET\" && (current !== \"https\" || target !== \"http\") && location.match(/^https?:/), `unsupported redirect`, \"UNSUPPORTED_OPERATION\", {\n            operation: `redirect(${this.method} ${JSON.stringify(this.url)} => ${JSON.stringify(location)})`\n        });\n        // Create a copy of this request, with a new URL\n        const req = new FetchRequest(location);\n        req.method = \"GET\";\n        req.allowGzip = this.allowGzip;\n        req.timeout = this.timeout;\n        req.#headers = Object.assign({}, this.#headers);\n        if (this.#body) {\n            req.#body = new Uint8Array(this.#body);\n        }\n        req.#bodyType = this.#bodyType;\n        // Do not forward credentials unless on the same domain; only absolute\n        //req.allowInsecure = false;\n        // paths are currently supported; may want a way to specify to forward?\n        //setStore(req.#props, \"creds\", getStore(this.#pros, \"creds\"));\n        return req;\n    }\n    /**\n     *  Create a new copy of this request.\n     */\n    clone() {\n        const clone = new FetchRequest(this.url);\n        // Preserve \"default method\" (i.e. null)\n        clone.#method = this.#method;\n        // Preserve \"default body\" with type, copying the Uint8Array is present\n        if (this.#body) {\n            clone.#body = this.#body;\n        }\n        clone.#bodyType = this.#bodyType;\n        // Preserve \"default headers\"\n        clone.#headers = Object.assign({}, this.#headers);\n        // Credentials is readonly, so we copy internally\n        clone.#creds = this.#creds;\n        if (this.allowGzip) {\n            clone.allowGzip = true;\n        }\n        clone.timeout = this.timeout;\n        if (this.allowInsecureAuthentication) {\n            clone.allowInsecureAuthentication = true;\n        }\n        clone.#preflight = this.#preflight;\n        clone.#process = this.#process;\n        clone.#retry = this.#retry;\n        clone.#throttle = Object.assign({}, this.#throttle);\n        clone.#getUrlFunc = this.#getUrlFunc;\n        return clone;\n    }\n    /**\n     *  Locks all static configuration for gateways and FetchGetUrlFunc\n     *  registration.\n     */\n    static lockConfig() {\n        locked = true;\n    }\n    /**\n     *  Get the current Gateway function for %%scheme%%.\n     */\n    static getGateway(scheme) {\n        return Gateways[scheme.toLowerCase()] || null;\n    }\n    /**\n     *  Use the %%func%% when fetching URIs using %%scheme%%.\n     *\n     *  This method affects all requests globally.\n     *\n     *  If [[lockConfig]] has been called, no change is made and this\n     *  throws.\n     */\n    static registerGateway(scheme, func) {\n        scheme = scheme.toLowerCase();\n        if (scheme === \"http\" || scheme === \"https\") {\n            throw new Error(`cannot intercept ${scheme}; use registerGetUrl`);\n        }\n        if (locked) {\n            throw new Error(\"gateways locked\");\n        }\n        Gateways[scheme] = func;\n    }\n    /**\n     *  Use %%getUrl%% when fetching URIs over HTTP and HTTPS requests.\n     *\n     *  This method affects all requests globally.\n     *\n     *  If [[lockConfig]] has been called, no change is made and this\n     *  throws.\n     */\n    static registerGetUrl(getUrl) {\n        if (locked) {\n            throw new Error(\"gateways locked\");\n        }\n        defaultGetUrlFunc = getUrl;\n    }\n    /**\n     *  Creates a getUrl function that fetches content from HTTP and\n     *  HTTPS URLs.\n     *\n     *  The available %%options%% are dependent on the platform\n     *  implementation of the default getUrl function.\n     *\n     *  This is not generally something that is needed, but is useful\n     *  when trying to customize simple behaviour when fetching HTTP\n     *  content.\n     */\n    static createGetUrlFunc(options) {\n        return createGetUrl(options);\n    }\n    /**\n     *  Creates a function that can \"fetch\" data URIs.\n     *\n     *  Note that this is automatically done internally to support\n     *  data URIs, so it is not necessary to register it.\n     *\n     *  This is not generally something that is needed, but may\n     *  be useful in a wrapper to perfom custom data URI functionality.\n     */\n    static createDataGateway() {\n        return dataGatewayFunc;\n    }\n    /**\n     *  Creates a function that will fetch IPFS (unvalidated) from\n     *  a custom gateway baseUrl.\n     *\n     *  The default IPFS gateway used internally is\n     *  ``\"https:/\\/gateway.ipfs.io/ipfs/\"``.\n     */\n    static createIpfsGatewayFunc(baseUrl) {\n        return getIpfsGatewayFunc(baseUrl);\n    }\n}\n;\n/**\n *  The response for a FetchRequest.\n */\nexport class FetchResponse {\n    #statusCode;\n    #statusMessage;\n    #headers;\n    #body;\n    #request;\n    #error;\n    toString() {\n        return `<FetchResponse status=${this.statusCode} body=${this.#body ? hexlify(this.#body) : \"null\"}>`;\n    }\n    /**\n     *  The response status code.\n     */\n    get statusCode() { return this.#statusCode; }\n    /**\n     *  The response status message.\n     */\n    get statusMessage() { return this.#statusMessage; }\n    /**\n     *  The response headers. All keys are lower-case.\n     */\n    get headers() { return Object.assign({}, this.#headers); }\n    /**\n     *  The response body, or ``null`` if there was no body.\n     */\n    get body() {\n        return (this.#body == null) ? null : new Uint8Array(this.#body);\n    }\n    /**\n     *  The response body as a UTF-8 encoded string, or the empty\n     *  string (i.e. ``\"\"``) if there was no body.\n     *\n     *  An error is thrown if the body is invalid UTF-8 data.\n     */\n    get bodyText() {\n        try {\n            return (this.#body == null) ? \"\" : toUtf8String(this.#body);\n        }\n        catch (error) {\n            assert(false, \"response body is not valid UTF-8 data\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"bodyText\", info: { response: this }\n            });\n        }\n    }\n    /**\n     *  The response body, decoded as JSON.\n     *\n     *  An error is thrown if the body is invalid JSON-encoded data\n     *  or if there was no body.\n     */\n    get bodyJson() {\n        try {\n            return JSON.parse(this.bodyText);\n        }\n        catch (error) {\n            assert(false, \"response body is not valid JSON\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"bodyJson\", info: { response: this }\n            });\n        }\n    }\n    [Symbol.iterator]() {\n        const headers = this.headers;\n        const keys = Object.keys(headers);\n        let index = 0;\n        return {\n            next: () => {\n                if (index < keys.length) {\n                    const key = keys[index++];\n                    return {\n                        value: [key, headers[key]], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    constructor(statusCode, statusMessage, headers, body, request) {\n        this.#statusCode = statusCode;\n        this.#statusMessage = statusMessage;\n        this.#headers = Object.keys(headers).reduce((accum, k) => {\n            accum[k.toLowerCase()] = String(headers[k]);\n            return accum;\n        }, {});\n        this.#body = ((body == null) ? null : new Uint8Array(body));\n        this.#request = (request || null);\n        this.#error = { message: \"\" };\n    }\n    /**\n     *  Return a Response with matching headers and body, but with\n     *  an error status code (i.e. 599) and %%message%% with an\n     *  optional %%error%%.\n     */\n    makeServerError(message, error) {\n        let statusMessage;\n        if (!message) {\n            message = `${this.statusCode} ${this.statusMessage}`;\n            statusMessage = `CLIENT ESCALATED SERVER ERROR (${message})`;\n        }\n        else {\n            statusMessage = `CLIENT ESCALATED SERVER ERROR (${this.statusCode} ${this.statusMessage}; ${message})`;\n        }\n        const response = new FetchResponse(599, statusMessage, this.headers, this.body, this.#request || undefined);\n        response.#error = { message, error };\n        return response;\n    }\n    /**\n     *  If called within a [request.processFunc](FetchRequest-processFunc)\n     *  call, causes the request to retry as if throttled for %%stall%%\n     *  milliseconds.\n     */\n    throwThrottleError(message, stall) {\n        if (stall == null) {\n            stall = -1;\n        }\n        else {\n            assertArgument(Number.isInteger(stall) && stall >= 0, \"invalid stall timeout\", \"stall\", stall);\n        }\n        const error = new Error(message || \"throttling requests\");\n        defineProperties(error, { stall, throttle: true });\n        throw error;\n    }\n    /**\n     *  Get the header value for %%key%%, ignoring case.\n     */\n    getHeader(key) {\n        return this.headers[key.toLowerCase()];\n    }\n    /**\n     *  Returns true if the response has a body.\n     */\n    hasBody() {\n        return (this.#body != null);\n    }\n    /**\n     *  The request made for this response.\n     */\n    get request() { return this.#request; }\n    /**\n     *  Returns true if this response was a success statusCode.\n     */\n    ok() {\n        return (this.#error.message === \"\" && this.statusCode >= 200 && this.statusCode < 300);\n    }\n    /**\n     *  Throws a ``SERVER_ERROR`` if this response is not ok.\n     */\n    assertOk() {\n        if (this.ok()) {\n            return;\n        }\n        let { message, error } = this.#error;\n        if (message === \"\") {\n            message = `server response ${this.statusCode} ${this.statusMessage}`;\n        }\n        let requestUrl = null;\n        if (this.request) {\n            requestUrl = this.request.url;\n        }\n        let responseBody = null;\n        try {\n            if (this.#body) {\n                responseBody = toUtf8String(this.#body);\n            }\n        }\n        catch (e) { }\n        assert(false, message, \"SERVER_ERROR\", {\n            request: (this.request || \"unknown request\"), response: this, error,\n            info: {\n                requestUrl, responseBody,\n                responseStatus: `${this.statusCode} ${this.statusMessage}`\n            }\n        });\n    }\n}\nfunction getTime() { return (new Date()).getTime(); }\nfunction unpercent(value) {\n    return toUtf8Bytes(value.replace(/%([0-9a-f][0-9a-f])/gi, (all, code) => {\n        return String.fromCharCode(parseInt(code, 16));\n    }));\n}\nfunction wait(delay) {\n    return new Promise((resolve) => setTimeout(resolve, delay));\n}\n//# sourceMappingURL=fetch.js.map","// utils/base64-browser\nimport { getBytes } from \"./data.js\";\nexport function decodeBase64(textData) {\n    textData = atob(textData);\n    const data = new Uint8Array(textData.length);\n    for (let i = 0; i < textData.length; i++) {\n        data[i] = textData.charCodeAt(i);\n    }\n    return getBytes(data);\n}\nexport function encodeBase64(_data) {\n    const data = getBytes(_data);\n    let textData = \"\";\n    for (let i = 0; i < data.length; i++) {\n        textData += String.fromCharCode(data[i]);\n    }\n    return btoa(textData);\n}\n//# sourceMappingURL=base64-browser.js.map","//See: https://github.com/ethereum/wiki/wiki/RLP\nimport { hexlify } from \"./data.js\";\nimport { assert, assertArgument } from \"./errors.js\";\nimport { getBytes } from \"./data.js\";\nfunction hexlifyByte(value) {\n    let result = value.toString(16);\n    while (result.length < 2) {\n        result = \"0\" + result;\n    }\n    return \"0x\" + result;\n}\nfunction unarrayifyInteger(data, offset, length) {\n    let result = 0;\n    for (let i = 0; i < length; i++) {\n        result = (result * 256) + data[offset + i];\n    }\n    return result;\n}\nfunction _decodeChildren(data, offset, childOffset, length) {\n    const result = [];\n    while (childOffset < offset + 1 + length) {\n        const decoded = _decode(data, childOffset);\n        result.push(decoded.result);\n        childOffset += decoded.consumed;\n        assert(childOffset <= offset + 1 + length, \"child data too short\", \"BUFFER_OVERRUN\", {\n            buffer: data, length, offset\n        });\n    }\n    return { consumed: (1 + length), result: result };\n}\n// returns { consumed: number, result: Object }\nfunction _decode(data, offset) {\n    assert(data.length !== 0, \"data too short\", \"BUFFER_OVERRUN\", {\n        buffer: data, length: 0, offset: 1\n    });\n    const checkOffset = (offset) => {\n        assert(offset <= data.length, \"data short segment too short\", \"BUFFER_OVERRUN\", {\n            buffer: data, length: data.length, offset\n        });\n    };\n    // Array with extra length prefix\n    if (data[offset] >= 0xf8) {\n        const lengthLength = data[offset] - 0xf7;\n        checkOffset(offset + 1 + lengthLength);\n        const length = unarrayifyInteger(data, offset + 1, lengthLength);\n        checkOffset(offset + 1 + lengthLength + length);\n        return _decodeChildren(data, offset, offset + 1 + lengthLength, lengthLength + length);\n    }\n    else if (data[offset] >= 0xc0) {\n        const length = data[offset] - 0xc0;\n        checkOffset(offset + 1 + length);\n        return _decodeChildren(data, offset, offset + 1, length);\n    }\n    else if (data[offset] >= 0xb8) {\n        const lengthLength = data[offset] - 0xb7;\n        checkOffset(offset + 1 + lengthLength);\n        const length = unarrayifyInteger(data, offset + 1, lengthLength);\n        checkOffset(offset + 1 + lengthLength + length);\n        const result = hexlify(data.slice(offset + 1 + lengthLength, offset + 1 + lengthLength + length));\n        return { consumed: (1 + lengthLength + length), result: result };\n    }\n    else if (data[offset] >= 0x80) {\n        const length = data[offset] - 0x80;\n        checkOffset(offset + 1 + length);\n        const result = hexlify(data.slice(offset + 1, offset + 1 + length));\n        return { consumed: (1 + length), result: result };\n    }\n    return { consumed: 1, result: hexlifyByte(data[offset]) };\n}\n/**\n *  Decodes %%data%% into the structured data it represents.\n */\nexport function decodeRlp(_data) {\n    const data = getBytes(_data, \"data\");\n    const decoded = _decode(data, 0);\n    assertArgument(decoded.consumed === data.length, \"unexpected junk after rlp payload\", \"data\", _data);\n    return decoded.result;\n}\n//# sourceMappingURL=rlp-decode.js.map","//See: https://github.com/ethereum/wiki/wiki/RLP\nimport { getBytes } from \"./data.js\";\nfunction arrayifyInteger(value) {\n    const result = [];\n    while (value) {\n        result.unshift(value & 0xff);\n        value >>= 8;\n    }\n    return result;\n}\nfunction _encode(object) {\n    if (Array.isArray(object)) {\n        let payload = [];\n        object.forEach(function (child) {\n            payload = payload.concat(_encode(child));\n        });\n        if (payload.length <= 55) {\n            payload.unshift(0xc0 + payload.length);\n            return payload;\n        }\n        const length = arrayifyInteger(payload.length);\n        length.unshift(0xf7 + length.length);\n        return length.concat(payload);\n    }\n    const data = Array.prototype.slice.call(getBytes(object, \"object\"));\n    if (data.length === 1 && data[0] <= 0x7f) {\n        return data;\n    }\n    else if (data.length <= 55) {\n        data.unshift(0x80 + data.length);\n        return data;\n    }\n    const length = arrayifyInteger(data.length);\n    length.unshift(0xb7 + length.length);\n    return length.concat(data);\n}\nconst nibbles = \"0123456789abcdef\";\n/**\n *  Encodes %%object%% as an RLP-encoded [[DataHexString]].\n */\nexport function encodeRlp(object) {\n    let result = \"0x\";\n    for (const v of _encode(object)) {\n        result += nibbles[v >> 4];\n        result += nibbles[v & 0xf];\n    }\n    return result;\n}\n//# sourceMappingURL=rlp-encode.js.map","/**\n *  Explain UUID and link to RFC here.\n *\n *  @_subsection: api/utils:UUID  [about-uuid]\n */\nimport { getBytes, hexlify } from \"./data.js\";\n/**\n *  Returns the version 4 [[link-uuid]] for the %%randomBytes%%.\n *\n *  @see: https://www.ietf.org/rfc/rfc4122.txt (Section 4.4)\n */\nexport function uuidV4(randomBytes) {\n    const bytes = getBytes(randomBytes, \"randomBytes\");\n    // Section: 4.1.3:\n    // - time_hi_and_version[12:16] = 0b0100\n    bytes[6] = (bytes[6] & 0x0f) | 0x40;\n    // Section 4.4\n    // - clock_seq_hi_and_reserved[6] = 0b0\n    // - clock_seq_hi_and_reserved[7] = 0b1\n    bytes[8] = (bytes[8] & 0x3f) | 0x80;\n    const value = hexlify(bytes);\n    return [\n        value.substring(2, 10),\n        value.substring(10, 14),\n        value.substring(14, 18),\n        value.substring(18, 22),\n        value.substring(22, 34),\n    ].join(\"-\");\n}\n//# sourceMappingURL=uuid.js.map","import { defineProperties, concat, getBytesCopy, getNumber, hexlify, toBeArray, toBigInt, toNumber, assert, assertArgument\n/*, isError*/\n } from \"../../utils/index.js\";\n/**\n * @_ignore:\n */\nexport const WordSize = 32;\nconst Padding = new Uint8Array(WordSize);\n// Properties used to immediate pass through to the underlying object\n// - `then` is used to detect if an object is a Promise for await\nconst passProperties = [\"then\"];\nconst _guard = {};\nconst resultNames = new WeakMap();\nfunction getNames(result) {\n    return resultNames.get(result);\n}\nfunction setNames(result, names) {\n    resultNames.set(result, names);\n}\nfunction throwError(name, error) {\n    const wrapped = new Error(`deferred error during ABI decoding triggered accessing ${name}`);\n    wrapped.error = error;\n    throw wrapped;\n}\nfunction toObject(names, items, deep) {\n    if (names.indexOf(null) >= 0) {\n        return items.map((item, index) => {\n            if (item instanceof Result) {\n                return toObject(getNames(item), item, deep);\n            }\n            return item;\n        });\n    }\n    return names.reduce((accum, name, index) => {\n        let item = items.getValue(name);\n        if (!(name in accum)) {\n            if (deep && item instanceof Result) {\n                item = toObject(getNames(item), item, deep);\n            }\n            accum[name] = item;\n        }\n        return accum;\n    }, {});\n}\n/**\n *  A [[Result]] is a sub-class of Array, which allows accessing any\n *  of its values either positionally by its index or, if keys are\n *  provided by its name.\n *\n *  @_docloc: api/abi\n */\nexport class Result extends Array {\n    // No longer used; but cannot be removed as it will remove the\n    // #private field from the .d.ts which may break backwards\n    // compatibility\n    #names;\n    /**\n     *  @private\n     */\n    constructor(...args) {\n        // To properly sub-class Array so the other built-in\n        // functions work, the constructor has to behave fairly\n        // well. So, in the event we are created via fromItems()\n        // we build the read-only Result object we want, but on\n        // any other input, we use the default constructor\n        // constructor(guard: any, items: Array<any>, keys?: Array<null | string>);\n        const guard = args[0];\n        let items = args[1];\n        let names = (args[2] || []).slice();\n        let wrap = true;\n        if (guard !== _guard) {\n            items = args;\n            names = [];\n            wrap = false;\n        }\n        // Can't just pass in ...items since an array of length 1\n        // is a special case in the super.\n        super(items.length);\n        items.forEach((item, index) => { this[index] = item; });\n        // Find all unique keys\n        const nameCounts = names.reduce((accum, name) => {\n            if (typeof (name) === \"string\") {\n                accum.set(name, (accum.get(name) || 0) + 1);\n            }\n            return accum;\n        }, (new Map()));\n        // Remove any key thats not unique\n        setNames(this, Object.freeze(items.map((item, index) => {\n            const name = names[index];\n            if (name != null && nameCounts.get(name) === 1) {\n                return name;\n            }\n            return null;\n        })));\n        // Dummy operations to prevent TypeScript from complaining\n        this.#names = [];\n        if (this.#names == null) {\n            void (this.#names);\n        }\n        if (!wrap) {\n            return;\n        }\n        // A wrapped Result is immutable\n        Object.freeze(this);\n        // Proxy indices and names so we can trap deferred errors\n        const proxy = new Proxy(this, {\n            get: (target, prop, receiver) => {\n                if (typeof (prop) === \"string\") {\n                    // Index accessor\n                    if (prop.match(/^[0-9]+$/)) {\n                        const index = getNumber(prop, \"%index\");\n                        if (index < 0 || index >= this.length) {\n                            throw new RangeError(\"out of result range\");\n                        }\n                        const item = target[index];\n                        if (item instanceof Error) {\n                            throwError(`index ${index}`, item);\n                        }\n                        return item;\n                    }\n                    // Pass important checks (like `then` for Promise) through\n                    if (passProperties.indexOf(prop) >= 0) {\n                        return Reflect.get(target, prop, receiver);\n                    }\n                    const value = target[prop];\n                    if (value instanceof Function) {\n                        // Make sure functions work with private variables\n                        // See: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Proxy#no_private_property_forwarding\n                        return function (...args) {\n                            return value.apply((this === receiver) ? target : this, args);\n                        };\n                    }\n                    else if (!(prop in target)) {\n                        // Possible name accessor\n                        return target.getValue.apply((this === receiver) ? target : this, [prop]);\n                    }\n                }\n                return Reflect.get(target, prop, receiver);\n            }\n        });\n        setNames(proxy, getNames(this));\n        return proxy;\n    }\n    /**\n     *  Returns the Result as a normal Array. If %%deep%%, any children\n     *  which are Result objects are also converted to a normal Array.\n     *\n     *  This will throw if there are any outstanding deferred\n     *  errors.\n     */\n    toArray(deep) {\n        const result = [];\n        this.forEach((item, index) => {\n            if (item instanceof Error) {\n                throwError(`index ${index}`, item);\n            }\n            if (deep && item instanceof Result) {\n                item = item.toArray(deep);\n            }\n            result.push(item);\n        });\n        return result;\n    }\n    /**\n     *  Returns the Result as an Object with each name-value pair. If\n     *  %%deep%%, any children which are Result objects are also\n     *  converted to an Object.\n     *\n     *  This will throw if any value is unnamed, or if there are\n     *  any outstanding deferred errors.\n     */\n    toObject(deep) {\n        const names = getNames(this);\n        return names.reduce((accum, name, index) => {\n            assert(name != null, `value at index ${index} unnamed`, \"UNSUPPORTED_OPERATION\", {\n                operation: \"toObject()\"\n            });\n            return toObject(names, this, deep);\n        }, {});\n    }\n    /**\n     *  @_ignore\n     */\n    slice(start, end) {\n        if (start == null) {\n            start = 0;\n        }\n        if (start < 0) {\n            start += this.length;\n            if (start < 0) {\n                start = 0;\n            }\n        }\n        if (end == null) {\n            end = this.length;\n        }\n        if (end < 0) {\n            end += this.length;\n            if (end < 0) {\n                end = 0;\n            }\n        }\n        if (end > this.length) {\n            end = this.length;\n        }\n        const _names = getNames(this);\n        const result = [], names = [];\n        for (let i = start; i < end; i++) {\n            result.push(this[i]);\n            names.push(_names[i]);\n        }\n        return new Result(_guard, result, names);\n    }\n    /**\n     *  @_ignore\n     */\n    filter(callback, thisArg) {\n        const _names = getNames(this);\n        const result = [], names = [];\n        for (let i = 0; i < this.length; i++) {\n            const item = this[i];\n            if (item instanceof Error) {\n                throwError(`index ${i}`, item);\n            }\n            if (callback.call(thisArg, item, i, this)) {\n                result.push(item);\n                names.push(_names[i]);\n            }\n        }\n        return new Result(_guard, result, names);\n    }\n    /**\n     *  @_ignore\n     */\n    map(callback, thisArg) {\n        const result = [];\n        for (let i = 0; i < this.length; i++) {\n            const item = this[i];\n            if (item instanceof Error) {\n                throwError(`index ${i}`, item);\n            }\n            result.push(callback.call(thisArg, item, i, this));\n        }\n        return result;\n    }\n    /**\n     *  Returns the value for %%name%%.\n     *\n     *  Since it is possible to have a key whose name conflicts with\n     *  a method on a [[Result]] or its superclass Array, or any\n     *  JavaScript keyword, this ensures all named values are still\n     *  accessible by name.\n     */\n    getValue(name) {\n        const index = getNames(this).indexOf(name);\n        if (index === -1) {\n            return undefined;\n        }\n        const value = this[index];\n        if (value instanceof Error) {\n            throwError(`property ${JSON.stringify(name)}`, value.error);\n        }\n        return value;\n    }\n    /**\n     *  Creates a new [[Result]] for %%items%% with each entry\n     *  also accessible by its corresponding name in %%keys%%.\n     */\n    static fromItems(items, keys) {\n        return new Result(_guard, items, keys);\n    }\n}\n/**\n *  Returns all errors found in a [[Result]].\n *\n *  Since certain errors encountered when creating a [[Result]] do\n *  not impact the ability to continue parsing data, they are\n *  deferred until they are actually accessed. Hence a faulty string\n *  in an Event that is never used does not impact the program flow.\n *\n *  However, sometimes it may be useful to access, identify or\n *  validate correctness of a [[Result]].\n *\n *  @_docloc api/abi\n */\nexport function checkResultErrors(result) {\n    // Find the first error (if any)\n    const errors = [];\n    const checkErrors = function (path, object) {\n        if (!Array.isArray(object)) {\n            return;\n        }\n        for (let key in object) {\n            const childPath = path.slice();\n            childPath.push(key);\n            try {\n                checkErrors(childPath, object[key]);\n            }\n            catch (error) {\n                errors.push({ path: childPath, error: error });\n            }\n        }\n    };\n    checkErrors([], result);\n    return errors;\n}\nfunction getValue(value) {\n    let bytes = toBeArray(value);\n    assert(bytes.length <= WordSize, \"value out-of-bounds\", \"BUFFER_OVERRUN\", { buffer: bytes, length: WordSize, offset: bytes.length });\n    if (bytes.length !== WordSize) {\n        bytes = getBytesCopy(concat([Padding.slice(bytes.length % WordSize), bytes]));\n    }\n    return bytes;\n}\n/**\n *  @_ignore\n */\nexport class Coder {\n    // The coder name:\n    //   - address, uint256, tuple, array, etc.\n    name;\n    // The fully expanded type, including composite types:\n    //   - address, uint256, tuple(address,bytes), uint256[3][4][],  etc.\n    type;\n    // The localName bound in the signature, in this example it is \"baz\":\n    //   - tuple(address foo, uint bar) baz\n    localName;\n    // Whether this type is dynamic:\n    //  - Dynamic: bytes, string, address[], tuple(boolean[]), etc.\n    //  - Not Dynamic: address, uint256, boolean[3], tuple(address, uint8)\n    dynamic;\n    constructor(name, type, localName, dynamic) {\n        defineProperties(this, { name, type, localName, dynamic }, {\n            name: \"string\", type: \"string\", localName: \"string\", dynamic: \"boolean\"\n        });\n    }\n    _throwError(message, value) {\n        assertArgument(false, message, this.localName, value);\n    }\n}\n/**\n *  @_ignore\n */\nexport class Writer {\n    // An array of WordSize lengthed objects to concatenation\n    #data;\n    #dataLength;\n    constructor() {\n        this.#data = [];\n        this.#dataLength = 0;\n    }\n    get data() {\n        return concat(this.#data);\n    }\n    get length() { return this.#dataLength; }\n    #writeData(data) {\n        this.#data.push(data);\n        this.#dataLength += data.length;\n        return data.length;\n    }\n    appendWriter(writer) {\n        return this.#writeData(getBytesCopy(writer.data));\n    }\n    // Arrayish item; pad on the right to *nearest* WordSize\n    writeBytes(value) {\n        let bytes = getBytesCopy(value);\n        const paddingOffset = bytes.length % WordSize;\n        if (paddingOffset) {\n            bytes = getBytesCopy(concat([bytes, Padding.slice(paddingOffset)]));\n        }\n        return this.#writeData(bytes);\n    }\n    // Numeric item; pad on the left *to* WordSize\n    writeValue(value) {\n        return this.#writeData(getValue(value));\n    }\n    // Inserts a numeric place-holder, returning a callback that can\n    // be used to asjust the value later\n    writeUpdatableValue() {\n        const offset = this.#data.length;\n        this.#data.push(Padding);\n        this.#dataLength += WordSize;\n        return (value) => {\n            this.#data[offset] = getValue(value);\n        };\n    }\n}\n/**\n *  @_ignore\n */\nexport class Reader {\n    // Allows incomplete unpadded data to be read; otherwise an error\n    // is raised if attempting to overrun the buffer. This is required\n    // to deal with an old Solidity bug, in which event data for\n    // external (not public thoguh) was tightly packed.\n    allowLoose;\n    #data;\n    #offset;\n    #bytesRead;\n    #parent;\n    #maxInflation;\n    constructor(data, allowLoose, maxInflation) {\n        defineProperties(this, { allowLoose: !!allowLoose });\n        this.#data = getBytesCopy(data);\n        this.#bytesRead = 0;\n        this.#parent = null;\n        this.#maxInflation = (maxInflation != null) ? maxInflation : 1024;\n        this.#offset = 0;\n    }\n    get data() { return hexlify(this.#data); }\n    get dataLength() { return this.#data.length; }\n    get consumed() { return this.#offset; }\n    get bytes() { return new Uint8Array(this.#data); }\n    #incrementBytesRead(count) {\n        if (this.#parent) {\n            return this.#parent.#incrementBytesRead(count);\n        }\n        this.#bytesRead += count;\n        // Check for excessive inflation (see: #4537)\n        assert(this.#maxInflation < 1 || this.#bytesRead <= this.#maxInflation * this.dataLength, `compressed ABI data exceeds inflation ratio of ${this.#maxInflation} ( see: https:/\\/github.com/ethers-io/ethers.js/issues/4537 )`, \"BUFFER_OVERRUN\", {\n            buffer: getBytesCopy(this.#data), offset: this.#offset,\n            length: count, info: {\n                bytesRead: this.#bytesRead,\n                dataLength: this.dataLength\n            }\n        });\n    }\n    #peekBytes(offset, length, loose) {\n        let alignedLength = Math.ceil(length / WordSize) * WordSize;\n        if (this.#offset + alignedLength > this.#data.length) {\n            if (this.allowLoose && loose && this.#offset + length <= this.#data.length) {\n                alignedLength = length;\n            }\n            else {\n                assert(false, \"data out-of-bounds\", \"BUFFER_OVERRUN\", {\n                    buffer: getBytesCopy(this.#data),\n                    length: this.#data.length,\n                    offset: this.#offset + alignedLength\n                });\n            }\n        }\n        return this.#data.slice(this.#offset, this.#offset + alignedLength);\n    }\n    // Create a sub-reader with the same underlying data, but offset\n    subReader(offset) {\n        const reader = new Reader(this.#data.slice(this.#offset + offset), this.allowLoose, this.#maxInflation);\n        reader.#parent = this;\n        return reader;\n    }\n    // Read bytes\n    readBytes(length, loose) {\n        let bytes = this.#peekBytes(0, length, !!loose);\n        this.#incrementBytesRead(length);\n        this.#offset += bytes.length;\n        // @TODO: Make sure the length..end bytes are all 0?\n        return bytes.slice(0, length);\n    }\n    // Read a numeric values\n    readValue() {\n        return toBigInt(this.readBytes(WordSize));\n    }\n    readIndex() {\n        return toNumber(this.readBytes(WordSize));\n    }\n}\n//# sourceMappingURL=abstract-coder.js.map","function number(n) {\n    if (!Number.isSafeInteger(n) || n < 0)\n        throw new Error(`Wrong positive integer: ${n}`);\n}\nfunction bool(b) {\n    if (typeof b !== 'boolean')\n        throw new Error(`Expected boolean, not ${b}`);\n}\nfunction bytes(b, ...lengths) {\n    if (!(b instanceof Uint8Array))\n        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}\nfunction 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}\nfunction exists(instance, checkFinished = true) {\n    if (instance.destroyed)\n        throw new Error('Hash instance has been destroyed');\n    if (checkFinished && instance.finished)\n        throw new Error('Hash#digest() has already been called');\n}\nfunction output(out, instance) {\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}\nexport { number, bool, bytes, hash, exists, output };\nconst assert = { number, bool, bytes, hash, exists, output };\nexport default assert;\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */\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, we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\nconst u8a = (a) => a instanceof Uint8Array;\n// Cast array to different type\nexport const u8 = (arr) => new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\nexport const u32 = (arr) => new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n// Cast array to view\nexport const createView = (arr) => new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n// The rotate right (circular right shift) operation for uint32\nexport const rotr = (word, shift) => (word << (32 - shift)) | (word >>> shift);\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.\nexport const isLE = new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44;\nif (!isLE)\n    throw new Error('Non little-endian hardware is not supported');\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        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 * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\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// Returns control to thread each 'tick' ms to avoid blocking\nexport async function asyncLoop(iters, tick, cb) {\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)\n            continue;\n        await nextTick();\n        ts += diff;\n    }\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\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) {\n    if (typeof data === 'string')\n        data = utf8ToBytes(data);\n    if (!u8a(data))\n        throw new Error(`expected Uint8Array, got ${typeof data}`);\n    return data;\n}\n/**\n * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\n// For runtime check if class implements interface\nexport class Hash {\n    // Safe version that clones internal state\n    clone() {\n        return this._cloneInto();\n    }\n}\nconst toStr = {}.toString;\nexport function checkOpts(defaults, opts) {\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;\n}\nexport function wrapConstructor(hashCons) {\n    const hashC = (msg) => 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}\nexport function wrapConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\nexport function wrapXOFConstructorWithOpts(hashCons) {\n    const hashC = (msg, opts) => hashCons(opts).update(toBytes(msg)).digest();\n    const tmp = hashCons({});\n    hashC.outputLen = tmp.outputLen;\n    hashC.blockLen = tmp.blockLen;\n    hashC.create = (opts) => hashCons(opts);\n    return hashC;\n}\n/**\n * Secure PRNG. Uses `crypto.getRandomValues`, which defers to OS.\n */\nexport function randomBytes(bytesLength = 32) {\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//# sourceMappingURL=utils.js.map","import { hash as assertHash, bytes as assertBytes, exists as assertExists } from './_assert.js';\nimport { Hash, toBytes } from './utils.js';\n// HMAC (RFC 2104)\nexport class HMAC extends Hash {\n    constructor(hash, _key) {\n        super();\n        this.finished = false;\n        this.destroyed = false;\n        assertHash(hash);\n        const key = toBytes(_key);\n        this.iHash = hash.create();\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++)\n            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();\n        // Undo internal XOR && apply outer XOR\n        for (let i = 0; i < pad.length; i++)\n            pad[i] ^= 0x36 ^ 0x5c;\n        this.oHash.update(pad);\n        pad.fill(0);\n    }\n    update(buf) {\n        assertExists(this);\n        this.iHash.update(buf);\n        return this;\n    }\n    digestInto(out) {\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) {\n        // Create new instance without calling constructor since key already in state and we don't know it.\n        to || (to = Object.create(Object.getPrototypeOf(this), {}));\n        const { oHash, iHash, finished, destroyed, blockLen, outputLen } = this;\n        to = to;\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 * 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, key, message) => new HMAC(hash, key).update(message).digest();\nhmac.create = (hash, key) => new HMAC(hash, key);\n//# sourceMappingURL=hmac.js.map","import { hash as assertHash, number as assertNumber } from './_assert.js';\nimport { hmac } from './hmac.js';\nimport { createView, toBytes, checkOpts, asyncLoop } from './utils.js';\n// Common prologue and epilogue for sync/async functions\nfunction pbkdf2Init(hash, _password, _salt, _opts) {\n    assertHash(hash);\n    const opts = checkOpts({ dkLen: 32, asyncTick: 10 }, _opts);\n    const { c, dkLen, asyncTick } = opts;\n    assertNumber(c);\n    assertNumber(dkLen);\n    assertNumber(asyncTick);\n    if (c < 1)\n        throw new Error('PBKDF2: iterations (c) should be >= 1');\n    const password = toBytes(_password);\n    const salt = toBytes(_salt);\n    // DK = PBKDF2(PRF, Password, Salt, c, dkLen);\n    const DK = new Uint8Array(dkLen);\n    // U1 = PRF(Password, Salt + INT_32_BE(i))\n    const PRF = hmac.create(hash, password);\n    const PRFSalt = PRF._cloneInto().update(salt);\n    return { c, dkLen, asyncTick, DK, PRF, PRFSalt };\n}\nfunction pbkdf2Output(PRF, PRFSalt, DK, prfW, u) {\n    PRF.destroy();\n    PRFSalt.destroy();\n    if (prfW)\n        prfW.destroy();\n    u.fill(0);\n    return DK;\n}\n/**\n * PBKDF2-HMAC: RFC 2898 key derivation function\n * @param hash - hash function that would be used e.g. sha256\n * @param password - password from which a derived key is generated\n * @param salt - cryptographic salt\n * @param opts - {c, dkLen} where c is work factor and dkLen is output message size\n */\nexport function pbkdf2(hash, password, salt, opts) {\n    const { c, dkLen, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n    let prfW; // Working copy\n    const arr = new Uint8Array(4);\n    const view = createView(arr);\n    const u = new Uint8Array(PRF.outputLen);\n    // DK = T1 + T2 + ⋯ + Tdklen/hlen\n    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n        // Ti = F(Password, Salt, c, i)\n        const Ti = DK.subarray(pos, pos + PRF.outputLen);\n        view.setInt32(0, ti, false);\n        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n        // U1 = PRF(Password, Salt + INT_32_BE(i))\n        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n        Ti.set(u.subarray(0, Ti.length));\n        for (let ui = 1; ui < c; ui++) {\n            // Uc = PRF(Password, Uc−1)\n            PRF._cloneInto(prfW).update(u).digestInto(u);\n            for (let i = 0; i < Ti.length; i++)\n                Ti[i] ^= u[i];\n        }\n    }\n    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\nexport async function pbkdf2Async(hash, password, salt, opts) {\n    const { c, dkLen, asyncTick, DK, PRF, PRFSalt } = pbkdf2Init(hash, password, salt, opts);\n    let prfW; // Working copy\n    const arr = new Uint8Array(4);\n    const view = createView(arr);\n    const u = new Uint8Array(PRF.outputLen);\n    // DK = T1 + T2 + ⋯ + Tdklen/hlen\n    for (let ti = 1, pos = 0; pos < dkLen; ti++, pos += PRF.outputLen) {\n        // Ti = F(Password, Salt, c, i)\n        const Ti = DK.subarray(pos, pos + PRF.outputLen);\n        view.setInt32(0, ti, false);\n        // F(Password, Salt, c, i) = U1 ^ U2 ^ ⋯ ^ Uc\n        // U1 = PRF(Password, Salt + INT_32_BE(i))\n        (prfW = PRFSalt._cloneInto(prfW)).update(arr).digestInto(u);\n        Ti.set(u.subarray(0, Ti.length));\n        await asyncLoop(c - 1, asyncTick, () => {\n            // Uc = PRF(Password, Uc−1)\n            PRF._cloneInto(prfW).update(u).digestInto(u);\n            for (let i = 0; i < Ti.length; i++)\n                Ti[i] ^= u[i];\n        });\n    }\n    return pbkdf2Output(PRF, PRFSalt, DK, prfW, u);\n}\n//# sourceMappingURL=pbkdf2.js.map","import { exists, output } from './_assert.js';\nimport { Hash, createView, toBytes } from './utils.js';\n// Polyfill for Safari 14\nfunction setBigUint64(view, byteOffset, value, isLE) {\n    if (typeof view.setBigUint64 === 'function')\n        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// Base SHA2 class (RFC 6234)\nexport class SHA2 extends Hash {\n    constructor(blockLen, outputLen, padOffset, isLE) {\n        super();\n        this.blockLen = blockLen;\n        this.outputLen = outputLen;\n        this.padOffset = padOffset;\n        this.isLE = isLE;\n        this.finished = false;\n        this.length = 0;\n        this.pos = 0;\n        this.destroyed = false;\n        this.buffer = new Uint8Array(blockLen);\n        this.view = createView(this.buffer);\n    }\n    update(data) {\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)\n                    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) {\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++)\n            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)\n            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)\n            throw new Error('_sha2: outputLen bigger than state');\n        for (let i = 0; i < outLen; i++)\n            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) {\n        to || (to = new this.constructor());\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)\n            to.buffer.set(buffer);\n        return to;\n    }\n}\n//# sourceMappingURL=_sha2.js.map","import { SHA2 } from './_sha2.js';\nimport { rotr, wrapConstructor } from './utils.js';\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// Choice: a ? b : c\nconst Chi = (a, b, c) => (a & b) ^ (~a & c);\n// Majority function, true if any two inpust is true\nconst Maj = (a, b, c) => (a & b) ^ (a & c) ^ (b & c);\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// 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// 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 {\n    constructor() {\n        super(64, 32, 8, false);\n        // We cannot use array here since array allows indexing by variable\n        // which means optimizer/compiler cannot use registers.\n        this.A = IV[0] | 0;\n        this.B = IV[1] | 0;\n        this.C = IV[2] | 0;\n        this.D = IV[3] | 0;\n        this.E = IV[4] | 0;\n        this.F = IV[5] | 0;\n        this.G = IV[6] | 0;\n        this.H = IV[7] | 0;\n    }\n    get() {\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    set(A, B, C, D, E, F, G, H) {\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    process(view, offset) {\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)\n            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    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    constructor() {\n        super();\n        this.A = 0xc1059ed8 | 0;\n        this.B = 0x367cd507 | 0;\n        this.C = 0x3070dd17 | 0;\n        this.D = 0xf70e5939 | 0;\n        this.E = 0xffc00b31 | 0;\n        this.F = 0x68581511 | 0;\n        this.G = 0x64f98fa7 | 0;\n        this.H = 0xbefa4fa4 | 0;\n        this.outputLen = 28;\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//# sourceMappingURL=sha256.js.map","const U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\n// We are not using BigUint64Array, because they are extremely slow as per 2022\nfunction fromBig(n, le = false) {\n    if (le)\n        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}\nfunction split(lst, 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}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\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, Al, Bh, Bl) {\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, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { fromBig, split, toBig, shrSH, shrSL, rotrSH, rotrSL, rotrBH, rotrBL, rotr32H, rotr32L, rotlSH, rotlSL, rotlBH, rotlBL, add, add3L, add3H, add4L, add4H, add5H, add5L, };\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//# sourceMappingURL=_u64.js.map","import { SHA2 } from './_sha2.js';\nimport u64 from './_u64.js';\nimport { wrapConstructor } from './utils.js';\n// Round contants (first 32 bits of the fractional parts of the cube roots of the first 80 primes 2..409):\n// prettier-ignore\nconst [SHA512_Kh, SHA512_Kl] = /* @__PURE__ */ (() => u64.split([\n    '0x428a2f98d728ae22', '0x7137449123ef65cd', '0xb5c0fbcfec4d3b2f', '0xe9b5dba58189dbbc',\n    '0x3956c25bf348b538', '0x59f111f1b605d019', '0x923f82a4af194f9b', '0xab1c5ed5da6d8118',\n    '0xd807aa98a3030242', '0x12835b0145706fbe', '0x243185be4ee4b28c', '0x550c7dc3d5ffb4e2',\n    '0x72be5d74f27b896f', '0x80deb1fe3b1696b1', '0x9bdc06a725c71235', '0xc19bf174cf692694',\n    '0xe49b69c19ef14ad2', '0xefbe4786384f25e3', '0x0fc19dc68b8cd5b5', '0x240ca1cc77ac9c65',\n    '0x2de92c6f592b0275', '0x4a7484aa6ea6e483', '0x5cb0a9dcbd41fbd4', '0x76f988da831153b5',\n    '0x983e5152ee66dfab', '0xa831c66d2db43210', '0xb00327c898fb213f', '0xbf597fc7beef0ee4',\n    '0xc6e00bf33da88fc2', '0xd5a79147930aa725', '0x06ca6351e003826f', '0x142929670a0e6e70',\n    '0x27b70a8546d22ffc', '0x2e1b21385c26c926', '0x4d2c6dfc5ac42aed', '0x53380d139d95b3df',\n    '0x650a73548baf63de', '0x766a0abb3c77b2a8', '0x81c2c92e47edaee6', '0x92722c851482353b',\n    '0xa2bfe8a14cf10364', '0xa81a664bbc423001', '0xc24b8b70d0f89791', '0xc76c51a30654be30',\n    '0xd192e819d6ef5218', '0xd69906245565a910', '0xf40e35855771202a', '0x106aa07032bbd1b8',\n    '0x19a4c116b8d2d0c8', '0x1e376c085141ab53', '0x2748774cdf8eeb99', '0x34b0bcb5e19b48a8',\n    '0x391c0cb3c5c95a63', '0x4ed8aa4ae3418acb', '0x5b9cca4f7763e373', '0x682e6ff3d6b2b8a3',\n    '0x748f82ee5defb2fc', '0x78a5636f43172f60', '0x84c87814a1f0ab72', '0x8cc702081a6439ec',\n    '0x90befffa23631e28', '0xa4506cebde82bde9', '0xbef9a3f7b2c67915', '0xc67178f2e372532b',\n    '0xca273eceea26619c', '0xd186b8c721c0c207', '0xeada7dd6cde0eb1e', '0xf57d4f7fee6ed178',\n    '0x06f067aa72176fba', '0x0a637dc5a2c898a6', '0x113f9804bef90dae', '0x1b710b35131c471b',\n    '0x28db77f523047d84', '0x32caab7b40c72493', '0x3c9ebe0a15c9bebc', '0x431d67c49c100d4c',\n    '0x4cc5d4becb3e42b6', '0x597f299cfc657e2a', '0x5fcb6fab3ad6faec', '0x6c44198c4a475817'\n].map(n => BigInt(n))))();\n// Temporary buffer, not used to store anything between runs\nconst SHA512_W_H = /* @__PURE__ */ new Uint32Array(80);\nconst SHA512_W_L = /* @__PURE__ */ new Uint32Array(80);\nexport class SHA512 extends SHA2 {\n    constructor() {\n        super(128, 64, 16, false);\n        // We cannot use array here since array allows indexing by variable which means optimizer/compiler cannot use registers.\n        // Also looks cleaner and easier to verify with spec.\n        // Initial state (first 32 bits of the fractional parts of the square roots of the first 8 primes 2..19):\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x6a09e667 | 0;\n        this.Al = 0xf3bcc908 | 0;\n        this.Bh = 0xbb67ae85 | 0;\n        this.Bl = 0x84caa73b | 0;\n        this.Ch = 0x3c6ef372 | 0;\n        this.Cl = 0xfe94f82b | 0;\n        this.Dh = 0xa54ff53a | 0;\n        this.Dl = 0x5f1d36f1 | 0;\n        this.Eh = 0x510e527f | 0;\n        this.El = 0xade682d1 | 0;\n        this.Fh = 0x9b05688c | 0;\n        this.Fl = 0x2b3e6c1f | 0;\n        this.Gh = 0x1f83d9ab | 0;\n        this.Gl = 0xfb41bd6b | 0;\n        this.Hh = 0x5be0cd19 | 0;\n        this.Hl = 0x137e2179 | 0;\n    }\n    // prettier-ignore\n    get() {\n        const { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        return [Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl];\n    }\n    // prettier-ignore\n    set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl) {\n        this.Ah = Ah | 0;\n        this.Al = Al | 0;\n        this.Bh = Bh | 0;\n        this.Bl = Bl | 0;\n        this.Ch = Ch | 0;\n        this.Cl = Cl | 0;\n        this.Dh = Dh | 0;\n        this.Dl = Dl | 0;\n        this.Eh = Eh | 0;\n        this.El = El | 0;\n        this.Fh = Fh | 0;\n        this.Fl = Fl | 0;\n        this.Gh = Gh | 0;\n        this.Gl = Gl | 0;\n        this.Hh = Hh | 0;\n        this.Hl = Hl | 0;\n    }\n    process(view, offset) {\n        // Extend the first 16 words into the remaining 64 words w[16..79] of the message schedule array\n        for (let i = 0; i < 16; i++, offset += 4) {\n            SHA512_W_H[i] = view.getUint32(offset);\n            SHA512_W_L[i] = view.getUint32((offset += 4));\n        }\n        for (let i = 16; i < 80; i++) {\n            // s0 := (w[i-15] rightrotate 1) xor (w[i-15] rightrotate 8) xor (w[i-15] rightshift 7)\n            const W15h = SHA512_W_H[i - 15] | 0;\n            const W15l = SHA512_W_L[i - 15] | 0;\n            const s0h = u64.rotrSH(W15h, W15l, 1) ^ u64.rotrSH(W15h, W15l, 8) ^ u64.shrSH(W15h, W15l, 7);\n            const s0l = u64.rotrSL(W15h, W15l, 1) ^ u64.rotrSL(W15h, W15l, 8) ^ u64.shrSL(W15h, W15l, 7);\n            // s1 := (w[i-2] rightrotate 19) xor (w[i-2] rightrotate 61) xor (w[i-2] rightshift 6)\n            const W2h = SHA512_W_H[i - 2] | 0;\n            const W2l = SHA512_W_L[i - 2] | 0;\n            const s1h = u64.rotrSH(W2h, W2l, 19) ^ u64.rotrBH(W2h, W2l, 61) ^ u64.shrSH(W2h, W2l, 6);\n            const s1l = u64.rotrSL(W2h, W2l, 19) ^ u64.rotrBL(W2h, W2l, 61) ^ u64.shrSL(W2h, W2l, 6);\n            // SHA256_W[i] = s0 + s1 + SHA256_W[i - 7] + SHA256_W[i - 16];\n            const SUMl = u64.add4L(s0l, s1l, SHA512_W_L[i - 7], SHA512_W_L[i - 16]);\n            const SUMh = u64.add4H(SUMl, s0h, s1h, SHA512_W_H[i - 7], SHA512_W_H[i - 16]);\n            SHA512_W_H[i] = SUMh | 0;\n            SHA512_W_L[i] = SUMl | 0;\n        }\n        let { Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl } = this;\n        // Compression function main loop, 80 rounds\n        for (let i = 0; i < 80; i++) {\n            // S1 := (e rightrotate 14) xor (e rightrotate 18) xor (e rightrotate 41)\n            const sigma1h = u64.rotrSH(Eh, El, 14) ^ u64.rotrSH(Eh, El, 18) ^ u64.rotrBH(Eh, El, 41);\n            const sigma1l = u64.rotrSL(Eh, El, 14) ^ u64.rotrSL(Eh, El, 18) ^ u64.rotrBL(Eh, El, 41);\n            //const T1 = (H + sigma1 + Chi(E, F, G) + SHA256_K[i] + SHA256_W[i]) | 0;\n            const CHIh = (Eh & Fh) ^ (~Eh & Gh);\n            const CHIl = (El & Fl) ^ (~El & Gl);\n            // T1 = H + sigma1 + Chi(E, F, G) + SHA512_K[i] + SHA512_W[i]\n            // prettier-ignore\n            const T1ll = u64.add5L(Hl, sigma1l, CHIl, SHA512_Kl[i], SHA512_W_L[i]);\n            const T1h = u64.add5H(T1ll, Hh, sigma1h, CHIh, SHA512_Kh[i], SHA512_W_H[i]);\n            const T1l = T1ll | 0;\n            // S0 := (a rightrotate 28) xor (a rightrotate 34) xor (a rightrotate 39)\n            const sigma0h = u64.rotrSH(Ah, Al, 28) ^ u64.rotrBH(Ah, Al, 34) ^ u64.rotrBH(Ah, Al, 39);\n            const sigma0l = u64.rotrSL(Ah, Al, 28) ^ u64.rotrBL(Ah, Al, 34) ^ u64.rotrBL(Ah, Al, 39);\n            const MAJh = (Ah & Bh) ^ (Ah & Ch) ^ (Bh & Ch);\n            const MAJl = (Al & Bl) ^ (Al & Cl) ^ (Bl & Cl);\n            Hh = Gh | 0;\n            Hl = Gl | 0;\n            Gh = Fh | 0;\n            Gl = Fl | 0;\n            Fh = Eh | 0;\n            Fl = El | 0;\n            ({ h: Eh, l: El } = u64.add(Dh | 0, Dl | 0, T1h | 0, T1l | 0));\n            Dh = Ch | 0;\n            Dl = Cl | 0;\n            Ch = Bh | 0;\n            Cl = Bl | 0;\n            Bh = Ah | 0;\n            Bl = Al | 0;\n            const All = u64.add3L(T1l, sigma0l, MAJl);\n            Ah = u64.add3H(All, T1h, sigma0h, MAJh);\n            Al = All | 0;\n        }\n        // Add the compressed chunk to the current hash value\n        ({ h: Ah, l: Al } = u64.add(this.Ah | 0, this.Al | 0, Ah | 0, Al | 0));\n        ({ h: Bh, l: Bl } = u64.add(this.Bh | 0, this.Bl | 0, Bh | 0, Bl | 0));\n        ({ h: Ch, l: Cl } = u64.add(this.Ch | 0, this.Cl | 0, Ch | 0, Cl | 0));\n        ({ h: Dh, l: Dl } = u64.add(this.Dh | 0, this.Dl | 0, Dh | 0, Dl | 0));\n        ({ h: Eh, l: El } = u64.add(this.Eh | 0, this.El | 0, Eh | 0, El | 0));\n        ({ h: Fh, l: Fl } = u64.add(this.Fh | 0, this.Fl | 0, Fh | 0, Fl | 0));\n        ({ h: Gh, l: Gl } = u64.add(this.Gh | 0, this.Gl | 0, Gh | 0, Gl | 0));\n        ({ h: Hh, l: Hl } = u64.add(this.Hh | 0, this.Hl | 0, Hh | 0, Hl | 0));\n        this.set(Ah, Al, Bh, Bl, Ch, Cl, Dh, Dl, Eh, El, Fh, Fl, Gh, Gl, Hh, Hl);\n    }\n    roundClean() {\n        SHA512_W_H.fill(0);\n        SHA512_W_L.fill(0);\n    }\n    destroy() {\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);\n    }\n}\nclass SHA512_224 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x8c3d37c8 | 0;\n        this.Al = 0x19544da2 | 0;\n        this.Bh = 0x73e19966 | 0;\n        this.Bl = 0x89dcd4d6 | 0;\n        this.Ch = 0x1dfab7ae | 0;\n        this.Cl = 0x32ff9c82 | 0;\n        this.Dh = 0x679dd514 | 0;\n        this.Dl = 0x582f9fcf | 0;\n        this.Eh = 0x0f6d2b69 | 0;\n        this.El = 0x7bd44da8 | 0;\n        this.Fh = 0x77e36f73 | 0;\n        this.Fl = 0x04c48942 | 0;\n        this.Gh = 0x3f9d85a8 | 0;\n        this.Gl = 0x6a1d36c8 | 0;\n        this.Hh = 0x1112e6ad | 0;\n        this.Hl = 0x91d692a1 | 0;\n        this.outputLen = 28;\n    }\n}\nclass SHA512_256 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0x22312194 | 0;\n        this.Al = 0xfc2bf72c | 0;\n        this.Bh = 0x9f555fa3 | 0;\n        this.Bl = 0xc84c64c2 | 0;\n        this.Ch = 0x2393b86b | 0;\n        this.Cl = 0x6f53b151 | 0;\n        this.Dh = 0x96387719 | 0;\n        this.Dl = 0x5940eabd | 0;\n        this.Eh = 0x96283ee2 | 0;\n        this.El = 0xa88effe3 | 0;\n        this.Fh = 0xbe5e1e25 | 0;\n        this.Fl = 0x53863992 | 0;\n        this.Gh = 0x2b0199fc | 0;\n        this.Gl = 0x2c85b8aa | 0;\n        this.Hh = 0x0eb72ddc | 0;\n        this.Hl = 0x81c52ca2 | 0;\n        this.outputLen = 32;\n    }\n}\nclass SHA384 extends SHA512 {\n    constructor() {\n        super();\n        // h -- high 32 bits, l -- low 32 bits\n        this.Ah = 0xcbbb9d5d | 0;\n        this.Al = 0xc1059ed8 | 0;\n        this.Bh = 0x629a292a | 0;\n        this.Bl = 0x367cd507 | 0;\n        this.Ch = 0x9159015a | 0;\n        this.Cl = 0x3070dd17 | 0;\n        this.Dh = 0x152fecd8 | 0;\n        this.Dl = 0xf70e5939 | 0;\n        this.Eh = 0x67332667 | 0;\n        this.El = 0xffc00b31 | 0;\n        this.Fh = 0x8eb44a87 | 0;\n        this.Fl = 0x68581511 | 0;\n        this.Gh = 0xdb0c2e0d | 0;\n        this.Gl = 0x64f98fa7 | 0;\n        this.Hh = 0x47b5481d | 0;\n        this.Hl = 0xbefa4fa4 | 0;\n        this.outputLen = 48;\n    }\n}\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/* Browser Crypto Shims */\nimport { hmac } from \"@noble/hashes/hmac\";\nimport { pbkdf2 } from \"@noble/hashes/pbkdf2\";\nimport { sha256 } from \"@noble/hashes/sha256\";\nimport { sha512 } from \"@noble/hashes/sha512\";\nimport { assert, assertArgument } from \"../utils/index.js\";\nfunction getGlobal() {\n    if (typeof self !== 'undefined') {\n        return self;\n    }\n    if (typeof window !== 'undefined') {\n        return window;\n    }\n    if (typeof global !== 'undefined') {\n        return global;\n    }\n    throw new Error('unable to locate global object');\n}\n;\nconst anyGlobal = getGlobal();\nconst crypto = anyGlobal.crypto || anyGlobal.msCrypto;\nexport function createHash(algo) {\n    switch (algo) {\n        case \"sha256\": return sha256.create();\n        case \"sha512\": return sha512.create();\n    }\n    assertArgument(false, \"invalid hashing algorithm name\", \"algorithm\", algo);\n}\nexport function createHmac(_algo, key) {\n    const algo = ({ sha256, sha512 }[_algo]);\n    assertArgument(algo != null, \"invalid hmac algorithm\", \"algorithm\", _algo);\n    return hmac.create(algo, key);\n}\nexport function pbkdf2Sync(password, salt, iterations, keylen, _algo) {\n    const algo = ({ sha256, sha512 }[_algo]);\n    assertArgument(algo != null, \"invalid pbkdf2 algorithm\", \"algorithm\", _algo);\n    return pbkdf2(algo, password, salt, { c: iterations, dkLen: keylen });\n}\nexport function randomBytes(length) {\n    assert(crypto != null, \"platform does not support secure random numbers\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"randomBytes\"\n    });\n    assertArgument(Number.isInteger(length) && length > 0 && length <= 1024, \"invalid length\", \"length\", length);\n    const result = new Uint8Array(length);\n    crypto.getRandomValues(result);\n    return result;\n}\n//# sourceMappingURL=crypto-browser.js.map","/**\n *  An **HMAC** enables verification that a given key was used\n *  to authenticate a payload.\n *\n *  See: [[link-wiki-hmac]]\n *\n *  @_subsection: api/crypto:HMAC  [about-hmac]\n */\nimport { createHmac } from \"./crypto.js\";\nimport { getBytes, hexlify } from \"../utils/index.js\";\nlet locked = false;\nconst _computeHmac = function (algorithm, key, data) {\n    return createHmac(algorithm, key).update(data).digest();\n};\nlet __computeHmac = _computeHmac;\n/**\n *  Return the HMAC for %%data%% using the %%key%% key with the underlying\n *  %%algo%% used for compression.\n *\n *  @example:\n *    key = id(\"some-secret\")\n *\n *    // Compute the HMAC\n *    computeHmac(\"sha256\", key, \"0x1337\")\n *    //_result:\n *\n *    // To compute the HMAC of UTF-8 data, the data must be\n *    // converted to UTF-8 bytes\n *    computeHmac(\"sha256\", key, toUtf8Bytes(\"Hello World\"))\n *    //_result:\n *\n */\nexport function computeHmac(algorithm, _key, _data) {\n    const key = getBytes(_key, \"key\");\n    const data = getBytes(_data, \"data\");\n    return hexlify(__computeHmac(algorithm, key, data));\n}\ncomputeHmac._ = _computeHmac;\ncomputeHmac.lock = function () { locked = true; };\ncomputeHmac.register = function (func) {\n    if (locked) {\n        throw new Error(\"computeHmac is locked\");\n    }\n    __computeHmac = func;\n};\nObject.freeze(computeHmac);\n//# sourceMappingURL=hmac.js.map","import { bytes, exists, number, output } from './_assert.js';\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from './_u64.js';\nimport { Hash, u32, toBytes, wrapConstructor, wrapXOFConstructorWithOpts, } from './utils.js';\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// Various per round constants calculations\nconst [SHA3_PI, SHA3_ROTL, _SHA3_IOTA] = [[], [], []];\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)\n            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// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n// Same as keccakf1600, but allows to skip some rounds\nexport function keccakP(s, rounds = 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++)\n            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++)\n                B[x] = s[y + x];\n            for (let x = 0; x < 10; x++)\n                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}\nexport class Keccak extends Hash {\n    // NOTE: we accept arguments in bytes instead of bits here.\n    constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n        super();\n        this.blockLen = blockLen;\n        this.suffix = suffix;\n        this.outputLen = outputLen;\n        this.enableXOF = enableXOF;\n        this.rounds = rounds;\n        this.pos = 0;\n        this.posOut = 0;\n        this.finished = false;\n        this.destroyed = false;\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    keccak() {\n        keccakP(this.state32, this.rounds);\n        this.posOut = 0;\n        this.pos = 0;\n    }\n    update(data) {\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++)\n                state[this.pos++] ^= data[pos++];\n            if (this.pos === blockLen)\n                this.keccak();\n        }\n        return this;\n    }\n    finish() {\n        if (this.finished)\n            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)\n            this.keccak();\n        state[blockLen - 1] ^= 0x80;\n        this.keccak();\n    }\n    writeInto(out) {\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)\n                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) {\n        // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n        if (!this.enableXOF)\n            throw new Error('XOF is not possible for this instance');\n        return this.writeInto(out);\n    }\n    xof(bytes) {\n        number(bytes);\n        return this.xofInto(new Uint8Array(bytes));\n    }\n    digestInto(out) {\n        output(out, this);\n        if (this.finished)\n            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) {\n        const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n        to || (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}\nconst gen = (suffix, blockLen, outputLen) => wrapConstructor(() => new Keccak(blockLen, suffix, outputLen));\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);\nconst genShake = (suffix, blockLen, outputLen) => wrapXOFConstructorWithOpts((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\nexport const shake128 = /* @__PURE__ */ genShake(0x1f, 168, 128 / 8);\nexport const shake256 = /* @__PURE__ */ genShake(0x1f, 136, 256 / 8);\n//# sourceMappingURL=sha3.js.map","/**\n *  Cryptographic hashing functions\n *\n *  @_subsection: api/crypto:Hash Functions [about-crypto-hashing]\n */\nimport { keccak_256 } from \"@noble/hashes/sha3\";\nimport { getBytes, hexlify } from \"../utils/index.js\";\nlet locked = false;\nconst _keccak256 = function (data) {\n    return keccak_256(data);\n};\nlet __keccak256 = _keccak256;\n/**\n *  Compute the cryptographic KECCAK256 hash of %%data%%.\n *\n *  The %%data%% **must** be a data representation, to compute the\n *  hash of UTF-8 data use the [[id]] function.\n *\n *  @returns DataHexstring\n *  @example:\n *    keccak256(\"0x\")\n *    //_result:\n *\n *    keccak256(\"0x1337\")\n *    //_result:\n *\n *    keccak256(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n *    // Strings are assumed to be DataHexString, otherwise it will\n *    // throw. To hash UTF-8 data, see the note above.\n *    keccak256(\"Hello World\")\n *    //_error:\n */\nexport function keccak256(_data) {\n    const data = getBytes(_data, \"data\");\n    return hexlify(__keccak256(data));\n}\nkeccak256._ = _keccak256;\nkeccak256.lock = function () { locked = true; };\nkeccak256.register = function (func) {\n    if (locked) {\n        throw new TypeError(\"keccak256 is locked\");\n    }\n    __keccak256 = func;\n};\nObject.freeze(keccak256);\n//# sourceMappingURL=keccak.js.map","import { SHA2 } from './_sha2.js';\nimport { wrapConstructor } from './utils.js';\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160.html\n// https://homes.esat.kuleuven.be/~bosselae/ripemd160/pdf/AB-9601/AB-9601.pdf\nconst Rho = /* @__PURE__ */ new Uint8Array([7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8]);\nconst Id = /* @__PURE__ */ Uint8Array.from({ length: 16 }, (_, i) => i);\nconst Pi = /* @__PURE__ */ Id.map((i) => (9 * i + 5) % 16);\nlet idxL = [Id];\nlet idxR = [Pi];\nfor (let i = 0; i < 4; i++)\n    for (let j of [idxL, idxR])\n        j.push(j[i].map((k) => Rho[k]));\nconst shifts = /* @__PURE__ */ [\n    [11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8],\n    [12, 13, 11, 15, 6, 9, 9, 7, 12, 15, 11, 13, 7, 8, 7, 7],\n    [13, 15, 14, 11, 7, 7, 6, 8, 13, 14, 13, 12, 5, 5, 6, 9],\n    [14, 11, 12, 14, 8, 6, 5, 5, 15, 12, 15, 14, 9, 9, 8, 6],\n    [15, 12, 13, 13, 9, 5, 8, 6, 14, 11, 12, 11, 8, 6, 5, 5],\n].map((i) => new Uint8Array(i));\nconst shiftsL = /* @__PURE__ */ idxL.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst shiftsR = /* @__PURE__ */ idxR.map((idx, i) => idx.map((j) => shifts[i][j]));\nconst Kl = /* @__PURE__ */ new Uint32Array([\n    0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e,\n]);\nconst Kr = /* @__PURE__ */ new Uint32Array([\n    0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000,\n]);\n// The rotate left (circular left shift) operation for uint32\nconst rotl = (word, shift) => (word << shift) | (word >>> (32 - shift));\n// It's called f() in spec.\nfunction f(group, x, y, z) {\n    if (group === 0)\n        return x ^ y ^ z;\n    else if (group === 1)\n        return (x & y) | (~x & z);\n    else if (group === 2)\n        return (x | ~y) ^ z;\n    else if (group === 3)\n        return (x & z) | (y & ~z);\n    else\n        return x ^ (y | ~z);\n}\n// Temporary buffer, not used to store anything between runs\nconst BUF = /* @__PURE__ */ new Uint32Array(16);\nexport class RIPEMD160 extends SHA2 {\n    constructor() {\n        super(64, 20, 8, true);\n        this.h0 = 0x67452301 | 0;\n        this.h1 = 0xefcdab89 | 0;\n        this.h2 = 0x98badcfe | 0;\n        this.h3 = 0x10325476 | 0;\n        this.h4 = 0xc3d2e1f0 | 0;\n    }\n    get() {\n        const { h0, h1, h2, h3, h4 } = this;\n        return [h0, h1, h2, h3, h4];\n    }\n    set(h0, h1, h2, h3, h4) {\n        this.h0 = h0 | 0;\n        this.h1 = h1 | 0;\n        this.h2 = h2 | 0;\n        this.h3 = h3 | 0;\n        this.h4 = h4 | 0;\n    }\n    process(view, offset) {\n        for (let i = 0; i < 16; i++, offset += 4)\n            BUF[i] = view.getUint32(offset, true);\n        // prettier-ignore\n        let al = this.h0 | 0, ar = al, bl = this.h1 | 0, br = bl, cl = this.h2 | 0, cr = cl, dl = this.h3 | 0, dr = dl, el = this.h4 | 0, er = el;\n        // Instead of iterating 0 to 80, we split it into 5 groups\n        // And use the groups in constants, functions, etc. Much simpler\n        for (let group = 0; group < 5; group++) {\n            const rGroup = 4 - group;\n            const hbl = Kl[group], hbr = Kr[group]; // prettier-ignore\n            const rl = idxL[group], rr = idxR[group]; // prettier-ignore\n            const sl = shiftsL[group], sr = shiftsR[group]; // prettier-ignore\n            for (let i = 0; i < 16; i++) {\n                const tl = (rotl(al + f(group, bl, cl, dl) + BUF[rl[i]] + hbl, sl[i]) + el) | 0;\n                al = el, el = dl, dl = rotl(cl, 10) | 0, cl = bl, bl = tl; // prettier-ignore\n            }\n            // 2 loops are 10% faster\n            for (let i = 0; i < 16; i++) {\n                const tr = (rotl(ar + f(rGroup, br, cr, dr) + BUF[rr[i]] + hbr, sr[i]) + er) | 0;\n                ar = er, er = dr, dr = rotl(cr, 10) | 0, cr = br, br = tr; // prettier-ignore\n            }\n        }\n        // Add the compressed chunk to the current hash value\n        this.set((this.h1 + cl + dr) | 0, (this.h2 + dl + er) | 0, (this.h3 + el + ar) | 0, (this.h4 + al + br) | 0, (this.h0 + bl + cr) | 0);\n    }\n    roundClean() {\n        BUF.fill(0);\n    }\n    destroy() {\n        this.destroyed = true;\n        this.buffer.fill(0);\n        this.set(0, 0, 0, 0, 0);\n    }\n}\n/**\n * RIPEMD-160 - a hash function from 1990s.\n * @param message - msg that would be hashed\n */\nexport const ripemd160 = /* @__PURE__ */ wrapConstructor(() => new RIPEMD160());\n//# sourceMappingURL=ripemd160.js.map","import { ripemd160 as noble_ripemd160 } from \"@noble/hashes/ripemd160\";\nimport { getBytes, hexlify } from \"../utils/index.js\";\nlet locked = false;\nconst _ripemd160 = function (data) {\n    return noble_ripemd160(data);\n};\nlet __ripemd160 = _ripemd160;\n/**\n *  Compute the cryptographic RIPEMD-160 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    ripemd160(\"0x\")\n *    //_result:\n *\n *    ripemd160(\"0x1337\")\n *    //_result:\n *\n *    ripemd160(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n */\nexport function ripemd160(_data) {\n    const data = getBytes(_data, \"data\");\n    return hexlify(__ripemd160(data));\n}\nripemd160._ = _ripemd160;\nripemd160.lock = function () { locked = true; };\nripemd160.register = function (func) {\n    if (locked) {\n        throw new TypeError(\"ripemd160 is locked\");\n    }\n    __ripemd160 = func;\n};\nObject.freeze(ripemd160);\n//# sourceMappingURL=ripemd160.js.map","/**\n *  A **Password-Based Key-Derivation Function** is designed to create\n *  a sequence of bytes suitible as a **key** from a human-rememberable\n *  password.\n *\n *  @_subsection: api/crypto:Passwords  [about-pbkdf]\n */\nimport { pbkdf2Sync } from \"./crypto.js\";\nimport { getBytes, hexlify } from \"../utils/index.js\";\nlet locked = false;\nconst _pbkdf2 = function (password, salt, iterations, keylen, algo) {\n    return pbkdf2Sync(password, salt, iterations, keylen, algo);\n};\nlet __pbkdf2 = _pbkdf2;\n/**\n *  Return the [[link-pbkdf2]] for %%keylen%% bytes for %%password%% using\n *  the %%salt%% and using %%iterations%% of %%algo%%.\n *\n *  This PBKDF is outdated and should not be used in new projects, but is\n *  required to decrypt older files.\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the PBKDF2\n *    pbkdf2(passwordBytes, salt, 1024, 16, \"sha256\")\n *    //_result:\n */\nexport function pbkdf2(_password, _salt, iterations, keylen, algo) {\n    const password = getBytes(_password, \"password\");\n    const salt = getBytes(_salt, \"salt\");\n    return hexlify(__pbkdf2(password, salt, iterations, keylen, algo));\n}\npbkdf2._ = _pbkdf2;\npbkdf2.lock = function () { locked = true; };\npbkdf2.register = function (func) {\n    if (locked) {\n        throw new Error(\"pbkdf2 is locked\");\n    }\n    __pbkdf2 = func;\n};\nObject.freeze(pbkdf2);\n//# sourceMappingURL=pbkdf2.js.map","/**\n *  A **Cryptographically Secure Random Value** is one that has been\n *  generated with additional care take to prevent side-channels\n *  from allowing others to detect it and prevent others from through\n *  coincidence generate the same values.\n *\n *  @_subsection: api/crypto:Random Values  [about-crypto-random]\n */\nimport { randomBytes as crypto_random } from \"./crypto.js\";\nlet locked = false;\nconst _randomBytes = function (length) {\n    return new Uint8Array(crypto_random(length));\n};\nlet __randomBytes = _randomBytes;\n/**\n *  Return %%length%% bytes of cryptographically secure random data.\n *\n *  @example:\n *    randomBytes(8)\n *    //_result:\n */\nexport function randomBytes(length) {\n    return __randomBytes(length);\n}\nrandomBytes._ = _randomBytes;\nrandomBytes.lock = function () { locked = true; };\nrandomBytes.register = function (func) {\n    if (locked) {\n        throw new Error(\"randomBytes is locked\");\n    }\n    __randomBytes = func;\n};\nObject.freeze(randomBytes);\n//# sourceMappingURL=random.js.map","import { number as assertNumber } from './_assert.js';\nimport { sha256 } from './sha256.js';\nimport { pbkdf2 } from './pbkdf2.js';\nimport { asyncLoop, checkOpts, u32 } from './utils.js';\n// RFC 7914 Scrypt KDF\n// Left rotate for uint32\nconst rotl = (a, b) => (a << b) | (a >>> (32 - b));\n// The main Scrypt loop: uses Salsa extensively.\n// Six versions of the function were tried, this is the fastest one.\n// prettier-ignore\nfunction XorAndSalsa(prev, pi, input, ii, out, oi) {\n    // Based on https://cr.yp.to/salsa20.html\n    // Xor blocks\n    let y00 = prev[pi++] ^ input[ii++], y01 = prev[pi++] ^ input[ii++];\n    let y02 = prev[pi++] ^ input[ii++], y03 = prev[pi++] ^ input[ii++];\n    let y04 = prev[pi++] ^ input[ii++], y05 = prev[pi++] ^ input[ii++];\n    let y06 = prev[pi++] ^ input[ii++], y07 = prev[pi++] ^ input[ii++];\n    let y08 = prev[pi++] ^ input[ii++], y09 = prev[pi++] ^ input[ii++];\n    let y10 = prev[pi++] ^ input[ii++], y11 = prev[pi++] ^ input[ii++];\n    let y12 = prev[pi++] ^ input[ii++], y13 = prev[pi++] ^ input[ii++];\n    let y14 = prev[pi++] ^ input[ii++], y15 = prev[pi++] ^ input[ii++];\n    // Save state to temporary variables (salsa)\n    let x00 = y00, x01 = y01, x02 = y02, x03 = y03, x04 = y04, x05 = y05, x06 = y06, x07 = y07, x08 = y08, x09 = y09, x10 = y10, x11 = y11, x12 = y12, x13 = y13, x14 = y14, x15 = y15;\n    // Main loop (salsa)\n    for (let i = 0; i < 8; i += 2) {\n        x04 ^= rotl(x00 + x12 | 0, 7);\n        x08 ^= rotl(x04 + x00 | 0, 9);\n        x12 ^= rotl(x08 + x04 | 0, 13);\n        x00 ^= rotl(x12 + x08 | 0, 18);\n        x09 ^= rotl(x05 + x01 | 0, 7);\n        x13 ^= rotl(x09 + x05 | 0, 9);\n        x01 ^= rotl(x13 + x09 | 0, 13);\n        x05 ^= rotl(x01 + x13 | 0, 18);\n        x14 ^= rotl(x10 + x06 | 0, 7);\n        x02 ^= rotl(x14 + x10 | 0, 9);\n        x06 ^= rotl(x02 + x14 | 0, 13);\n        x10 ^= rotl(x06 + x02 | 0, 18);\n        x03 ^= rotl(x15 + x11 | 0, 7);\n        x07 ^= rotl(x03 + x15 | 0, 9);\n        x11 ^= rotl(x07 + x03 | 0, 13);\n        x15 ^= rotl(x11 + x07 | 0, 18);\n        x01 ^= rotl(x00 + x03 | 0, 7);\n        x02 ^= rotl(x01 + x00 | 0, 9);\n        x03 ^= rotl(x02 + x01 | 0, 13);\n        x00 ^= rotl(x03 + x02 | 0, 18);\n        x06 ^= rotl(x05 + x04 | 0, 7);\n        x07 ^= rotl(x06 + x05 | 0, 9);\n        x04 ^= rotl(x07 + x06 | 0, 13);\n        x05 ^= rotl(x04 + x07 | 0, 18);\n        x11 ^= rotl(x10 + x09 | 0, 7);\n        x08 ^= rotl(x11 + x10 | 0, 9);\n        x09 ^= rotl(x08 + x11 | 0, 13);\n        x10 ^= rotl(x09 + x08 | 0, 18);\n        x12 ^= rotl(x15 + x14 | 0, 7);\n        x13 ^= rotl(x12 + x15 | 0, 9);\n        x14 ^= rotl(x13 + x12 | 0, 13);\n        x15 ^= rotl(x14 + x13 | 0, 18);\n    }\n    // Write output (salsa)\n    out[oi++] = (y00 + x00) | 0;\n    out[oi++] = (y01 + x01) | 0;\n    out[oi++] = (y02 + x02) | 0;\n    out[oi++] = (y03 + x03) | 0;\n    out[oi++] = (y04 + x04) | 0;\n    out[oi++] = (y05 + x05) | 0;\n    out[oi++] = (y06 + x06) | 0;\n    out[oi++] = (y07 + x07) | 0;\n    out[oi++] = (y08 + x08) | 0;\n    out[oi++] = (y09 + x09) | 0;\n    out[oi++] = (y10 + x10) | 0;\n    out[oi++] = (y11 + x11) | 0;\n    out[oi++] = (y12 + x12) | 0;\n    out[oi++] = (y13 + x13) | 0;\n    out[oi++] = (y14 + x14) | 0;\n    out[oi++] = (y15 + x15) | 0;\n}\nfunction BlockMix(input, ii, out, oi, r) {\n    // The block B is r 128-byte chunks (which is equivalent of 2r 64-byte chunks)\n    let head = oi + 0;\n    let tail = oi + 16 * r;\n    for (let i = 0; i < 16; i++)\n        out[tail + i] = input[ii + (2 * r - 1) * 16 + i]; // X ← B[2r−1]\n    for (let i = 0; i < r; i++, head += 16, ii += 16) {\n        // We write odd & even Yi at same time. Even: 0bXXXXX0 Odd:  0bXXXXX1\n        XorAndSalsa(out, tail, input, ii, out, head); // head[i] = Salsa(blockIn[2*i] ^ tail[i-1])\n        if (i > 0)\n            tail += 16; // First iteration overwrites tmp value in tail\n        XorAndSalsa(out, head, input, (ii += 16), out, tail); // tail[i] = Salsa(blockIn[2*i+1] ^ head[i])\n    }\n}\n// Common prologue and epilogue for sync/async functions\nfunction scryptInit(password, salt, _opts) {\n    // Maxmem - 1GB+1KB by default\n    const opts = checkOpts({\n        dkLen: 32,\n        asyncTick: 10,\n        maxmem: 1024 ** 3 + 1024,\n    }, _opts);\n    const { N, r, p, dkLen, asyncTick, maxmem, onProgress } = opts;\n    assertNumber(N);\n    assertNumber(r);\n    assertNumber(p);\n    assertNumber(dkLen);\n    assertNumber(asyncTick);\n    assertNumber(maxmem);\n    if (onProgress !== undefined && typeof onProgress !== 'function')\n        throw new Error('progressCb should be function');\n    const blockSize = 128 * r;\n    const blockSize32 = blockSize / 4;\n    if (N <= 1 || (N & (N - 1)) !== 0 || N >= 2 ** (blockSize / 8) || N > 2 ** 32) {\n        // NOTE: we limit N to be less than 2**32 because of 32 bit variant of Integrify function\n        // There is no JS engines that allows alocate more than 4GB per single Uint8Array for now, but can change in future.\n        throw new Error('Scrypt: N must be larger than 1, a power of 2, less than 2^(128 * r / 8) and less than 2^32');\n    }\n    if (p < 0 || p > ((2 ** 32 - 1) * 32) / blockSize) {\n        throw new Error('Scrypt: p must be a positive integer less than or equal to ((2^32 - 1) * 32) / (128 * r)');\n    }\n    if (dkLen < 0 || dkLen > (2 ** 32 - 1) * 32) {\n        throw new Error('Scrypt: dkLen should be positive integer less than or equal to (2^32 - 1) * 32');\n    }\n    const memUsed = blockSize * (N + p);\n    if (memUsed > maxmem) {\n        throw new Error(`Scrypt: parameters too large, ${memUsed} (128 * r * (N + p)) > ${maxmem} (maxmem)`);\n    }\n    // [B0...Bp−1] ← PBKDF2HMAC-SHA256(Passphrase, Salt, 1, blockSize*ParallelizationFactor)\n    // Since it has only one iteration there is no reason to use async variant\n    const B = pbkdf2(sha256, password, salt, { c: 1, dkLen: blockSize * p });\n    const B32 = u32(B);\n    // Re-used between parallel iterations. Array(iterations) of B\n    const V = u32(new Uint8Array(blockSize * N));\n    const tmp = u32(new Uint8Array(blockSize));\n    let blockMixCb = () => { };\n    if (onProgress) {\n        const totalBlockMix = 2 * N * p;\n        // Invoke callback if progress changes from 10.01 to 10.02\n        // Allows to draw smooth progress bar on up to 8K screen\n        const callbackPer = Math.max(Math.floor(totalBlockMix / 10000), 1);\n        let blockMixCnt = 0;\n        blockMixCb = () => {\n            blockMixCnt++;\n            if (onProgress && (!(blockMixCnt % callbackPer) || blockMixCnt === totalBlockMix))\n                onProgress(blockMixCnt / totalBlockMix);\n        };\n    }\n    return { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick };\n}\nfunction scryptOutput(password, dkLen, B, V, tmp) {\n    const res = pbkdf2(sha256, password, B, { c: 1, dkLen });\n    B.fill(0);\n    V.fill(0);\n    tmp.fill(0);\n    return res;\n}\n/**\n * Scrypt KDF from RFC 7914.\n * @param password - pass\n * @param salt - salt\n * @param opts - parameters\n * - `N` is cpu/mem work factor (power of 2 e.g. 2**18)\n * - `r` is block size (8 is common), fine-tunes sequential memory read size and performance\n * - `p` is parallelization factor (1 is common)\n * - `dkLen` is output key length in bytes e.g. 32.\n * - `asyncTick` - (default: 10) max time in ms for which async function can block execution\n * - `maxmem` - (default: `1024 ** 3 + 1024` aka 1GB+1KB). A limit that the app could use for scrypt\n * - `onProgress` - callback function that would be executed for progress report\n * @returns Derived key\n */\nexport function scrypt(password, salt, opts) {\n    const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb } = scryptInit(password, salt, opts);\n    for (let pi = 0; pi < p; pi++) {\n        const Pi = blockSize32 * pi;\n        for (let i = 0; i < blockSize32; i++)\n            V[i] = B32[Pi + i]; // V[0] = B[i]\n        for (let i = 0, pos = 0; i < N - 1; i++) {\n            BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n            blockMixCb();\n        }\n        BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n        blockMixCb();\n        for (let i = 0; i < N; i++) {\n            // First u32 of the last 64-byte block (u32 is LE)\n            const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n            for (let k = 0; k < blockSize32; k++)\n                tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n            BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n            blockMixCb();\n        }\n    }\n    return scryptOutput(password, dkLen, B, V, tmp);\n}\n/**\n * Scrypt KDF from RFC 7914.\n */\nexport async function scryptAsync(password, salt, opts) {\n    const { N, r, p, dkLen, blockSize32, V, B32, B, tmp, blockMixCb, asyncTick } = scryptInit(password, salt, opts);\n    for (let pi = 0; pi < p; pi++) {\n        const Pi = blockSize32 * pi;\n        for (let i = 0; i < blockSize32; i++)\n            V[i] = B32[Pi + i]; // V[0] = B[i]\n        let pos = 0;\n        await asyncLoop(N - 1, asyncTick, () => {\n            BlockMix(V, pos, V, (pos += blockSize32), r); // V[i] = BlockMix(V[i-1]);\n            blockMixCb();\n        });\n        BlockMix(V, (N - 1) * blockSize32, B32, Pi, r); // Process last element\n        blockMixCb();\n        await asyncLoop(N, asyncTick, () => {\n            // First u32 of the last 64-byte block (u32 is LE)\n            const j = B32[Pi + blockSize32 - 16] % N; // j = Integrify(X) % iterations\n            for (let k = 0; k < blockSize32; k++)\n                tmp[k] = B32[Pi + k] ^ V[j * blockSize32 + k]; // tmp = B ^ V[j]\n            BlockMix(tmp, 0, B32, Pi, r); // B = BlockMix(B ^ V[j])\n            blockMixCb();\n        });\n    }\n    return scryptOutput(password, dkLen, B, V, tmp);\n}\n//# sourceMappingURL=scrypt.js.map","import { scrypt as _nobleSync, scryptAsync as _nobleAsync } from \"@noble/hashes/scrypt\";\nimport { getBytes, hexlify as H } from \"../utils/index.js\";\nlet lockedSync = false, lockedAsync = false;\nconst _scryptAsync = async function (passwd, salt, N, r, p, dkLen, onProgress) {\n    return await _nobleAsync(passwd, salt, { N, r, p, dkLen, onProgress });\n};\nconst _scryptSync = function (passwd, salt, N, r, p, dkLen) {\n    return _nobleSync(passwd, salt, { N, r, p, dkLen });\n};\nlet __scryptAsync = _scryptAsync;\nlet __scryptSync = _scryptSync;\n/**\n *  The [[link-wiki-scrypt]] uses a memory and cpu hard method of\n *  derivation to increase the resource cost to brute-force a password\n *  for a given key.\n *\n *  This means this algorithm is intentionally slow, and can be tuned to\n *  become slower. As computation and memory speed improve over time,\n *  increasing the difficulty maintains the cost of an attacker.\n *\n *  For example, if a target time of 5 seconds is used, a legitimate user\n *  which knows their password requires only 5 seconds to unlock their\n *  account. A 6 character password has 68 billion possibilities, which\n *  would require an attacker to invest over 10,000 years of CPU time. This\n *  is of course a crude example (as password generally aren't random),\n *  but demonstrates to value of imposing large costs to decryption.\n *\n *  For this reason, if building a UI which involved decrypting or\n *  encrypting datsa using scrypt, it is recommended to use a\n *  [[ProgressCallback]] (as event short periods can seem lik an eternity\n *  if the UI freezes). Including the phrase //\"decrypting\"// in the UI\n *  can also help, assuring the user their waiting is for a good reason.\n *\n *  @_docloc: api/crypto:Passwords\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the scrypt\n *    scrypt(passwordBytes, salt, 1024, 8, 1, 16)\n *    //_result:\n */\nexport async function scrypt(_passwd, _salt, N, r, p, dkLen, progress) {\n    const passwd = getBytes(_passwd, \"passwd\");\n    const salt = getBytes(_salt, \"salt\");\n    return H(await __scryptAsync(passwd, salt, N, r, p, dkLen, progress));\n}\nscrypt._ = _scryptAsync;\nscrypt.lock = function () { lockedAsync = true; };\nscrypt.register = function (func) {\n    if (lockedAsync) {\n        throw new Error(\"scrypt is locked\");\n    }\n    __scryptAsync = func;\n};\nObject.freeze(scrypt);\n/**\n *  Provides a synchronous variant of [[scrypt]].\n *\n *  This will completely lock up and freeze the UI in a browser and will\n *  prevent any event loop from progressing. For this reason, it is\n *  preferred to use the [async variant](scrypt).\n *\n *  @_docloc: api/crypto:Passwords\n *\n *  @example:\n *    // The password must be converted to bytes, and it is generally\n *    // best practices to ensure the string has been normalized. Many\n *    // formats explicitly indicate the normalization form to use.\n *    password = \"hello\"\n *    passwordBytes = toUtf8Bytes(password, \"NFKC\")\n *\n *    salt = id(\"some-salt\")\n *\n *    // Compute the scrypt\n *    scryptSync(passwordBytes, salt, 1024, 8, 1, 16)\n *    //_result:\n */\nexport function scryptSync(_passwd, _salt, N, r, p, dkLen) {\n    const passwd = getBytes(_passwd, \"passwd\");\n    const salt = getBytes(_salt, \"salt\");\n    return H(__scryptSync(passwd, salt, N, r, p, dkLen));\n}\nscryptSync._ = _scryptSync;\nscryptSync.lock = function () { lockedSync = true; };\nscryptSync.register = function (func) {\n    if (lockedSync) {\n        throw new Error(\"scryptSync is locked\");\n    }\n    __scryptSync = func;\n};\nObject.freeze(scryptSync);\n//# sourceMappingURL=scrypt.js.map","import { createHash } from \"./crypto.js\";\nimport { getBytes, hexlify } from \"../utils/index.js\";\nconst _sha256 = function (data) {\n    return createHash(\"sha256\").update(data).digest();\n};\nconst _sha512 = function (data) {\n    return createHash(\"sha512\").update(data).digest();\n};\nlet __sha256 = _sha256;\nlet __sha512 = _sha512;\nlet locked256 = false, locked512 = false;\n/**\n *  Compute the cryptographic SHA2-256 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    sha256(\"0x\")\n *    //_result:\n *\n *    sha256(\"0x1337\")\n *    //_result:\n *\n *    sha256(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n *\n */\nexport function sha256(_data) {\n    const data = getBytes(_data, \"data\");\n    return hexlify(__sha256(data));\n}\nsha256._ = _sha256;\nsha256.lock = function () { locked256 = true; };\nsha256.register = function (func) {\n    if (locked256) {\n        throw new Error(\"sha256 is locked\");\n    }\n    __sha256 = func;\n};\nObject.freeze(sha256);\n/**\n *  Compute the cryptographic SHA2-512 hash of %%data%%.\n *\n *  @_docloc: api/crypto:Hash Functions\n *  @returns DataHexstring\n *\n *  @example:\n *    sha512(\"0x\")\n *    //_result:\n *\n *    sha512(\"0x1337\")\n *    //_result:\n *\n *    sha512(new Uint8Array([ 0x13, 0x37 ]))\n *    //_result:\n */\nexport function sha512(_data) {\n    const data = getBytes(_data, \"data\");\n    return hexlify(__sha512(data));\n}\nsha512._ = _sha512;\nsha512.lock = function () { locked512 = true; };\nsha512.register = function (func) {\n    if (locked512) {\n        throw new Error(\"sha512 is locked\");\n    }\n    __sha512 = func;\n};\nObject.freeze(sha256);\n//# sourceMappingURL=sha2.js.map","/*! 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);\nconst u8a = (a) => a instanceof Uint8Array;\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n    if (!u8a(bytes))\n        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}\nexport function numberToHexUnpadded(num) {\n    const hex = num.toString(16);\n    return hex.length & 1 ? `0${hex}` : hex;\n}\nexport function hexToNumber(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    // Big Endian\n    return BigInt(hex === '' ? '0' : `0x${hex}`);\n}\n/**\n * @example hexToBytes('cafe0123') // Uint8Array.from([0xca, 0xfe, 0x01, 0x23])\n */\nexport function hexToBytes(hex) {\n    if (typeof hex !== 'string')\n        throw new Error('hex string expected, got ' + typeof hex);\n    const len = hex.length;\n    if (len % 2)\n        throw new Error('padded hex string expected, got unpadded hex of length ' + len);\n    const array = new Uint8Array(len / 2);\n    for (let i = 0; i < array.length; i++) {\n        const j = i * 2;\n        const hexByte = hex.slice(j, j + 2);\n        const byte = Number.parseInt(hexByte, 16);\n        if (Number.isNaN(byte) || byte < 0)\n            throw new Error('Invalid byte sequence');\n        array[i] = byte;\n    }\n    return array;\n}\n// BE: Big Endian, LE: Little Endian\nexport function bytesToNumberBE(bytes) {\n    return hexToNumber(bytesToHex(bytes));\n}\nexport function bytesToNumberLE(bytes) {\n    if (!u8a(bytes))\n        throw new Error('Uint8Array expected');\n    return hexToNumber(bytesToHex(Uint8Array.from(bytes).reverse()));\n}\nexport function numberToBytesBE(n, len) {\n    return hexToBytes(n.toString(16).padStart(len * 2, '0'));\n}\nexport function numberToBytesLE(n, len) {\n    return numberToBytesBE(n, len).reverse();\n}\n// Unpadded, rarely used\nexport function numberToVarBytesBE(n) {\n    return hexToBytes(numberToHexUnpadded(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, hex, expectedLength) {\n    let res;\n    if (typeof hex === 'string') {\n        try {\n            res = hexToBytes(hex);\n        }\n        catch (e) {\n            throw new Error(`${title} must be valid hex string, got \"${hex}\". Cause: ${e}`);\n        }\n    }\n    else if (u8a(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    }\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 * Copies several Uint8Arrays into one.\n */\nexport function concatBytes(...arrays) {\n    const r = new Uint8Array(arrays.reduce((sum, a) => sum + a.length, 0));\n    let pad = 0; // walk through each item, ensure they have proper type\n    arrays.forEach((a) => {\n        if (!u8a(a))\n            throw new Error('Uint8Array expected');\n        r.set(a, pad);\n        pad += a.length;\n    });\n    return r;\n}\nexport function equalBytes(b1, b2) {\n    // We don't care about timing attacks here\n    if (b1.length !== b2.length)\n        return false;\n    for (let i = 0; i < b1.length; i++)\n        if (b1[i] !== b2[i])\n            return false;\n    return true;\n}\n/**\n * @example utf8ToBytes('abc') // new Uint8Array([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n    if (typeof str !== 'string')\n        throw new Error(`utf8ToBytes expected string, got ${typeof str}`);\n    return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n// Bit operations\n/**\n * Calculates amount of bits in a bigint.\n * Same as `n.toString(2).length`\n */\nexport function bitLen(n) {\n    let len;\n    for (len = 0; n > _0n; n >>= _1n, len += 1)\n        ;\n    return len;\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, pos) {\n    return (n >> BigInt(pos)) & _1n;\n}\n/**\n * Sets single bit at position.\n */\nexport const bitSet = (n, pos, value) => {\n    return n | ((value ? _1n : _0n) << BigInt(pos));\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) => (_2n << BigInt(n - 1)) - _1n;\n// DRBG\nconst u8n = (data) => new Uint8Array(data); // creates Uint8Array\nconst u8fr = (arr) => Uint8Array.from(arr); // another shortcut\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(hashLen, qByteLen, hmacFn) {\n    if (typeof hashLen !== 'number' || hashLen < 2)\n        throw new Error('hashLen must be a number');\n    if (typeof qByteLen !== 'number' || qByteLen < 2)\n        throw new Error('qByteLen must be a number');\n    if (typeof hmacFn !== 'function')\n        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) => 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)\n            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)\n            throw new Error('drbg: tried 1000 values');\n        let len = 0;\n        const out = [];\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, pred) => {\n        reset();\n        reseed(seed); // Steps D-G\n        let res = undefined; // Step H: grind until k is in [1..n-1]\n        while (!(res = pred(gen())))\n            reseed();\n        reset();\n        return res;\n    };\n    return genUntil;\n}\n// Validating curves and fields\nconst validatorFns = {\n    bigint: (val) => typeof val === 'bigint',\n    function: (val) => typeof val === 'function',\n    boolean: (val) => typeof val === 'boolean',\n    string: (val) => typeof val === 'string',\n    stringOrUint8Array: (val) => typeof val === 'string' || val instanceof Uint8Array,\n    isSafeInteger: (val) => Number.isSafeInteger(val),\n    array: (val) => Array.isArray(val),\n    field: (val, object) => object.Fp.isValid(val),\n    hash: (val) => typeof val === 'function' && Number.isSafeInteger(val.outputLen),\n};\n// type Record<K extends string | number | symbol, T> = { [P in K]: T; }\nexport function validateObject(object, validators, optValidators = {}) {\n    const checkField = (fieldName, type, isOptional) => {\n        const checkVal = validatorFns[type];\n        if (typeof checkVal !== 'function')\n            throw new Error(`Invalid validator \"${type}\", expected function`);\n        const val = object[fieldName];\n        if (isOptional && val === undefined)\n            return;\n        if (!checkVal(val, object)) {\n            throw new Error(`Invalid param ${String(fieldName)}=${val} (${typeof val}), expected ${type}`);\n        }\n    };\n    for (const [fieldName, type] of Object.entries(validators))\n        checkField(fieldName, type, false);\n    for (const [fieldName, type] of Object.entries(optValidators))\n        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//# sourceMappingURL=utils.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Utilities for modular arithmetics and finite fields\nimport { bitMask, numberToBytesBE, numberToBytesLE, bytesToNumberBE, bytesToNumberLE, ensureBytes, validateObject, } 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// Calculates a modulo b\nexport function mod(a, b) {\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, power, modulo) {\n    if (modulo <= _0n || power < _0n)\n        throw new Error('Expected power/modulo > 0');\n    if (modulo === _1n)\n        return _0n;\n    let res = _1n;\n    while (power > _0n) {\n        if (power & _1n)\n            res = (res * num) % modulo;\n        num = (num * num) % modulo;\n        power >>= _1n;\n    }\n    return res;\n}\n// Does x ^ (2 ^ power) mod p. pow2(30, 4) == 30 ^ (2 ^ 4)\nexport function pow2(x, power, modulo) {\n    let res = x;\n    while (power-- > _0n) {\n        res *= res;\n        res %= modulo;\n    }\n    return res;\n}\n// Inverses number over modulo\nexport function invert(number, modulo) {\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)\n        throw new Error('invert: does not exist');\n    return mod(x, modulo);\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) {\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    let Q, S, Z;\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(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\n        };\n    }\n    // Slow-path\n    const Q1div2 = (Q + _1n) / _2n;\n    return function tonelliSlow(Fp, n) {\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))\n            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        while (!Fp.eql(b, Fp.ONE)) {\n            if (Fp.eql(b, Fp.ZERO))\n                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))\n                    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}\nexport function FpSqrt(P) {\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    // 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(Fp, n) {\n            const root = Fp.pow(n, p1div4);\n            // Throw if root**2 != n\n            if (!Fp.eql(Fp.sqr(root), n))\n                throw new Error('Cannot find square root');\n            return root;\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(Fp, n) {\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))\n                throw new Error('Cannot find square root');\n            return root;\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    // Other cases: Tonelli-Shanks algorithm\n    return tonelliShanks(P);\n}\n// Little-endian check for first LE bit (last BE bit);\nexport const isNegativeLE = (num, modulo) => (mod(num, modulo) & _1n) === _1n;\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];\nexport function validateField(field) {\n    const initial = {\n        ORDER: 'bigint',\n        MASK: 'bigint',\n        BYTES: 'isSafeInteger',\n        BITS: 'isSafeInteger',\n    };\n    const opts = FIELD_FIELDS.reduce((map, val) => {\n        map[val] = 'function';\n        return map;\n    }, initial);\n    return validateObject(field, opts);\n}\n// Generic field functions\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(f, num, power) {\n    // Should have same speed as pow for bigints\n    // TODO: benchmark!\n    if (power < _0n)\n        throw new Error('Expected power > 0');\n    if (power === _0n)\n        return f.ONE;\n    if (power === _1n)\n        return num;\n    let p = f.ONE;\n    let d = num;\n    while (power > _0n) {\n        if (power & _1n)\n            p = f.mul(p, d);\n        d = f.sqr(d);\n        power >>= _1n;\n    }\n    return p;\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(f, nums) {\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))\n            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))\n            return acc;\n        tmp[i] = f.mul(acc, tmp[i]);\n        return f.mul(acc, num);\n    }, inverted);\n    return tmp;\n}\nexport function FpDiv(f, lhs, rhs) {\n    return f.mul(lhs, typeof rhs === 'bigint' ? invert(rhs, f.ORDER) : f.inv(rhs));\n}\n// This function returns True whenever the value x is a square in the field F.\nexport function FpIsSquare(f) {\n    const legendreConst = (f.ORDER - _1n) / _2n; // Integer arithmetic\n    return (x) => {\n        const p = f.pow(x, legendreConst);\n        return f.eql(p, f.ZERO) || f.eql(p, f.ONE);\n    };\n}\n// CURVE.n lengths\nexport function nLength(n, nBitLength) {\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/**\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(ORDER, bitLen, isLE = false, redef = {}) {\n    if (ORDER <= _0n)\n        throw new Error(`Expected Field ORDER > 0, got ${ORDER}`);\n    const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n    if (BYTES > 2048)\n        throw new Error('Field lengths over 2048 bytes are not supported');\n    const sqrtP = FpSqrt(ORDER);\n    const f = 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        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        // 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        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    });\n    return Object.freeze(f);\n}\nexport function FpSqrtOdd(Fp, elm) {\n    if (!Fp.isOdd)\n        throw new Error(`Field doesn't have isOdd`);\n    const root = Fp.sqrt(elm);\n    return Fp.isOdd(root) ? root : Fp.neg(root);\n}\nexport function FpSqrtEven(Fp, elm) {\n    if (!Fp.isOdd)\n        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 * \"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(hash, groupOrder, isLE = false) {\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 * 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) {\n    if (typeof fieldOrder !== 'bigint')\n        throw new Error('field order must be bigint');\n    const bitLength = fieldOrder.toString(2).length;\n    return Math.ceil(bitLength / 8);\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) {\n    const length = getFieldBytesLength(fieldOrder);\n    return length + Math.ceil(length / 2);\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, fieldOrder, isLE = false) {\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//# sourceMappingURL=modular.js.map","/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// Abelian group utilities\nimport { validateField, nLength } from './modular.js';\nimport { validateObject } from './utils.js';\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\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(c, bits) {\n    const constTimeNegate = (condition, item) => {\n        const neg = item.negate();\n        return condition ? neg : item;\n    };\n    const opts = (W) => {\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, n) {\n            let p = c.ZERO;\n            let d = elm;\n            while (n > _0n) {\n                if (n & _1n)\n                    p = p.add(d);\n                d = d.double();\n                n >>= _1n;\n            }\n            return p;\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, W) {\n            const { windows, windowSize } = opts(W);\n            const points = [];\n            let p = 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         * 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, precomputes, n) {\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            let p = c.ZERO;\n            let f = c.BASE;\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            for (let window = 0; window < windows; window++) {\n                const offset = window * windowSize;\n                // Extract W bits.\n                let wbits = Number(n & mask);\n                // Shift number by W bits.\n                n >>= shiftBy;\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                // 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                // 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                }\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        wNAFCached(P, precomputesMap, n, transform) {\n            // @ts-ignore\n            const W = 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);\n                if (W !== 1) {\n                    precomputesMap.set(P, transform(comp));\n                }\n            }\n            return this.wNAF(W, comp, n);\n        },\n    };\n}\nexport function validateBasic(curve) {\n    validateField(curve.Fp);\n    validateObject(curve, {\n        n: 'bigint',\n        h: 'bigint',\n        Gx: 'field',\n        Gy: 'field',\n    }, {\n        nBitLength: 'isSafeInteger',\n        nByteLength: 'isSafeInteger',\n    });\n    // Set defaults\n    return Object.freeze({\n        ...nLength(curve.n, curve.nBitLength),\n        ...curve,\n        ...{ p: curve.Fp.ORDER },\n    });\n}\n//# sourceMappingURL=curve.js.map","/*! 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 { ensureBytes } from './utils.js';\nimport { wNAF, validateBasic } from './curve.js';\nfunction validatePointOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        a: 'field',\n        b: 'field',\n    }, {\n        allowedPrivateKeyLengths: 'array',\n        wrapPrivateKey: 'boolean',\n        isTorsionFree: 'function',\n        clearCofactor: 'function',\n        allowInfinityPoint: 'boolean',\n        fromBytes: 'function',\n        toBytes: 'function',\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 (typeof endo !== 'object' ||\n            typeof endo.beta !== 'bigint' ||\n            typeof endo.splitScalar !== 'function') {\n            throw new Error('Expected endomorphism with beta: bigint and splitScalar: function');\n        }\n    }\n    return Object.freeze({ ...opts });\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) {\n        const { Err: E } = DER;\n        if (data.length < 2 || data[0] !== 0x02)\n            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)\n            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)\n            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) {\n        // parse DER signature\n        const { Err: E } = DER;\n        const data = typeof hex === 'string' ? h2b(hex) : hex;\n        if (!(data instanceof Uint8Array))\n            throw new Error('ui8a expected');\n        let l = data.length;\n        if (l < 2 || data[0] != 0x30)\n            throw new E('Invalid signature tag');\n        if (data[1] !== l - 2)\n            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)\n            throw new E('Invalid signature: left bytes after parsing');\n        return { r, s };\n    },\n    hexFromSig(sig) {\n        // Add leading zero if first byte has negative bit enabled. More details in '_parseInt'\n        const slice = (s) => (Number.parseInt(s[0], 16) & 0b1000 ? '00' + s : s);\n        const h = (num) => {\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// 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);\nexport function weierstrassPoints(opts) {\n    const CURVE = validatePointOpts(opts);\n    const { Fp } = CURVE; // All curves has same field / group length as for now, but they can differ\n    const toBytes = CURVE.toBytes ||\n        ((_c, point, _isCompressed) => {\n            const a = point.toAffine();\n            return ut.concatBytes(Uint8Array.from([0x04]), Fp.toBytes(a.x), Fp.toBytes(a.y));\n        });\n    const fromBytes = CURVE.fromBytes ||\n        ((bytes) => {\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     * y² = x³ + ax + b: Short weierstrass curve formula\n     * @returns y²\n     */\n    function weierstrassEquation(x) {\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    // Valid group elements reside in range 1..n-1\n    function isWithinCurveOrder(num) {\n        return typeof num === 'bigint' && _0n < num && num < CURVE.n;\n    }\n    function assertGE(num) {\n        if (!isWithinCurveOrder(num))\n            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) {\n        const { allowedPrivateKeyLengths: lengths, nByteLength, wrapPrivateKey, n } = CURVE;\n        if (lengths && typeof key !== 'bigint') {\n            if (key instanceof Uint8Array)\n                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))\n                throw new Error('Invalid key');\n            key = key.padStart(nByteLength * 2, '0');\n        }\n        let num;\n        try {\n            num =\n                typeof key === 'bigint'\n                    ? key\n                    : ut.bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n        }\n        catch (error) {\n            throw new Error(`private key must be ${nByteLength} bytes, hex or bigint, not ${typeof key}`);\n        }\n        if (wrapPrivateKey)\n            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    const pointPrecomputes = new Map();\n    function assertPrjPoint(other) {\n        if (!(other instanceof Point))\n            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 {\n        constructor(px, py, pz) {\n            this.px = px;\n            this.py = py;\n            this.pz = pz;\n            if (px == null || !Fp.isValid(px))\n                throw new Error('x required');\n            if (py == null || !Fp.isValid(py))\n                throw new Error('y required');\n            if (pz == null || !Fp.isValid(pz))\n                throw new Error('z required');\n        }\n        // Does not validate if the point is on-curve.\n        // Use fromHex instead, or call assertValidity() later.\n        static fromAffine(p) {\n            const { x, y } = p || {};\n            if (!p || !Fp.isValid(x) || !Fp.isValid(y))\n                throw new Error('invalid affine point');\n            if (p instanceof Point)\n                throw new Error('projective point not allowed');\n            const is0 = (i) => 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))\n                return Point.ZERO;\n            return new Point(x, y, Fp.ONE);\n        }\n        get x() {\n            return this.toAffine().x;\n        }\n        get y() {\n            return this.toAffine().y;\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) {\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         * Converts hash string or Uint8Array to Point.\n         * @param hex short/long ECDSA hex\n         */\n        static fromHex(hex) {\n            const P = Point.fromAffine(fromBytes(ensureBytes('pointHex', hex)));\n            P.assertValidity();\n            return P;\n        }\n        // Multiplies generator point by privateKey.\n        static fromPrivateKey(privateKey) {\n            return Point.BASE.multiply(normPrivateKeyToScalar(privateKey));\n        }\n        // \"Private method\", don't use it directly\n        _setWindowSize(windowSize) {\n            this._WINDOW_SIZE = windowSize;\n            pointPrecomputes.delete(this);\n        }\n        // A point on curve is valid if it conforms to equation.\n        assertValidity() {\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))\n                    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))\n                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))\n                throw new Error('bad point: equation left != right');\n            if (!this.isTorsionFree())\n                throw new Error('bad point: not in prime-order subgroup');\n        }\n        hasEvenY() {\n            const { y } = this.toAffine();\n            if (Fp.isOdd)\n                return !Fp.isOdd(y);\n            throw new Error(\"Field doesn't support isOdd\");\n        }\n        /**\n         * Compare one point to another.\n         */\n        equals(other) {\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         * Flips point to one corresponding to (x, -y) in Affine coordinates.\n         */\n        negate() {\n            return new Point(this.px, Fp.neg(this.py), this.pz);\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        // 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) {\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        subtract(other) {\n            return this.add(other.negate());\n        }\n        is0() {\n            return this.equals(Point.ZERO);\n        }\n        wNAF(n) {\n            return wnaf.wNAFCached(this, pointPrecomputes, n, (comp) => {\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         * 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) {\n            const I = Point.ZERO;\n            if (n === _0n)\n                return I;\n            assertGE(n); // Will throw on 0\n            if (n === _1n)\n                return this;\n            const { endo } = CURVE;\n            if (!endo)\n                return wnaf.unsafeLadder(this, n);\n            // Apply endomorphism\n            let { k1neg, k1, k2neg, k2 } = endo.splitScalar(n);\n            let k1p = I;\n            let k2p = I;\n            let d = this;\n            while (k1 > _0n || k2 > _0n) {\n                if (k1 & _1n)\n                    k1p = k1p.add(d);\n                if (k2 & _1n)\n                    k2p = k2p.add(d);\n                d = d.double();\n                k1 >>= _1n;\n                k2 >>= _1n;\n            }\n            if (k1neg)\n                k1p = k1p.negate();\n            if (k2neg)\n                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         * 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) {\n            assertGE(scalar);\n            let n = scalar;\n            let point, fake; // 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            }\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         * 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, a, b) {\n            const G = Point.BASE; // No Strauss-Shamir trick: we have 10% faster G precomputes\n            const mul = (P, a // 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        // 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) {\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)\n                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)\n                return { x: Fp.ZERO, y: Fp.ZERO };\n            if (!Fp.eql(zz, Fp.ONE))\n                throw new Error('invZ was invalid');\n            return { x: ax, y: ay };\n        }\n        isTorsionFree() {\n            const { h: cofactor, isTorsionFree } = CURVE;\n            if (cofactor === _1n)\n                return true; // No subgroups, always torsion-free\n            if (isTorsionFree)\n                return isTorsionFree(Point, this);\n            throw new Error('isTorsionFree() has not been declared for the elliptic curve');\n        }\n        clearCofactor() {\n            const { h: cofactor, clearCofactor } = CURVE;\n            if (cofactor === _1n)\n                return this; // Fast-path\n            if (clearCofactor)\n                return clearCofactor(Point, this);\n            return this.multiplyUnsafe(CURVE.h);\n        }\n        toRawBytes(isCompressed = true) {\n            this.assertValidity();\n            return toBytes(Point, this, isCompressed);\n        }\n        toHex(isCompressed = true) {\n            return ut.bytesToHex(this.toRawBytes(isCompressed));\n        }\n    }\n    Point.BASE = new Point(CURVE.Gx, CURVE.Gy, Fp.ONE);\n    Point.ZERO = new Point(Fp.ZERO, Fp.ONE, Fp.ZERO);\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,\n        normPrivateKeyToScalar,\n        weierstrassEquation,\n        isWithinCurveOrder,\n    };\n}\nfunction validateOpts(curve) {\n    const opts = validateBasic(curve);\n    ut.validateObject(opts, {\n        hash: 'hash',\n        hmac: 'function',\n        randomBytes: 'function',\n    }, {\n        bits2int: 'function',\n        bits2int_modN: 'function',\n        lowS: 'boolean',\n    });\n    return Object.freeze({ lowS: true, ...opts });\n}\nexport function weierstrass(curveDef) {\n    const CURVE = validateOpts(curveDef);\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    function isValidFieldElement(num) {\n        return _0n < num && num < Fp.ORDER; // 0 is banned since it's not invertible FE\n    }\n    function modN(a) {\n        return mod.mod(a, CURVE_ORDER);\n    }\n    function invN(a) {\n        return mod.invert(a, CURVE_ORDER);\n    }\n    const { ProjectivePoint: Point, normPrivateKeyToScalar, weierstrassEquation, isWithinCurveOrder, } = weierstrassPoints({\n        ...CURVE,\n        toBytes(_c, point, isCompressed) {\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            }\n            else {\n                return cat(Uint8Array.from([0x04]), x, Fp.toBytes(a.y));\n            }\n        },\n        fromBytes(bytes) {\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))\n                    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)\n                    y = Fp.neg(y);\n                return { x, y };\n            }\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            }\n            else {\n                throw new Error(`Point of length ${len} was invalid. Expected ${compressedLen} compressed bytes or ${uncompressedLen} uncompressed bytes`);\n            }\n        },\n    });\n    const numToNByteStr = (num) => ut.bytesToHex(ut.numberToBytesBE(num, CURVE.nByteLength));\n    function isBiggerThanHalfOrder(number) {\n        const HALF = CURVE_ORDER >> _1n;\n        return number > HALF;\n    }\n    function normalizeS(s) {\n        return isBiggerThanHalfOrder(s) ? modN(-s) : s;\n    }\n    // slice bytes num\n    const slcNum = (b, from, to) => ut.bytesToNumberBE(b.slice(from, to));\n    /**\n     * ECDSA signature with its (r, s) properties. Supports DER & compact representations.\n     */\n    class Signature {\n        constructor(r, s, recovery) {\n            this.r = r;\n            this.s = s;\n            this.recovery = recovery;\n            this.assertValidity();\n        }\n        // pair (bytes of r, bytes of s)\n        static fromCompact(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        // 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) {\n            const { r, s } = DER.toSig(ensureBytes('DER', hex));\n            return new Signature(r, s);\n        }\n        assertValidity() {\n            // can use assertGE here\n            if (!isWithinCurveOrder(this.r))\n                throw new Error('r must be 0 < r < CURVE.n');\n            if (!isWithinCurveOrder(this.s))\n                throw new Error('s must be 0 < s < CURVE.n');\n        }\n        addRecoveryBit(recovery) {\n            return new Signature(this.r, this.s, recovery);\n        }\n        recoverPublicKey(msgHash) {\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))\n                throw new Error('recovery id invalid');\n            const radj = rec === 2 || rec === 3 ? r + CURVE.n : r;\n            if (radj >= Fp.ORDER)\n                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)\n                throw new Error('point at infinify'); // unsafe is fine: no priv data leaked\n            Q.assertValidity();\n            return Q;\n        }\n        // Signatures should be low-s, to prevent malleability.\n        hasHighS() {\n            return isBiggerThanHalfOrder(this.s);\n        }\n        normalizeS() {\n            return this.hasHighS() ? new Signature(this.r, modN(-this.s), this.recovery) : this;\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        // 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    const utils = {\n        isValidPrivateKey(privateKey) {\n            try {\n                normPrivateKeyToScalar(privateKey);\n                return true;\n            }\n            catch (error) {\n                return false;\n            }\n        },\n        normPrivateKeyToScalar: normPrivateKeyToScalar,\n        /**\n         * Produces cryptographically secure private key from random of size\n         * (groupLen + ceil(groupLen / 2)) with modulo bias being negligible.\n         */\n        randomPrivateKey: () => {\n            const length = mod.getMinHashLength(CURVE.n);\n            return mod.mapHashToField(CURVE.randomBytes(length), CURVE.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) {\n            point._setWindowSize(windowSize);\n            point.multiply(BigInt(3)); // 3 is arbitrary, just need any number here\n            return point;\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, isCompressed = true) {\n        return Point.fromPrivateKey(privateKey).toRawBytes(isCompressed);\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) {\n        const arr = item instanceof Uint8Array;\n        const str = typeof item === 'string';\n        const len = (arr || str) && item.length;\n        if (arr)\n            return len === compressedLen || len === uncompressedLen;\n        if (str)\n            return len === 2 * compressedLen || len === 2 * uncompressedLen;\n        if (item instanceof Point)\n            return true;\n        return false;\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, publicB, isCompressed = true) {\n        if (isProbPub(privateA))\n            throw new Error('first arg must be private key');\n        if (!isProbPub(publicB))\n            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    // 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 = CURVE.bits2int ||\n        function (bytes) {\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 = CURVE.bits2int_modN ||\n        function (bytes) {\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) {\n        if (typeof num !== 'bigint')\n            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    // 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, privateKey, 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)\n            lowS = true; // RFC6979 3.2: we skip step A, because we already provide hash\n        msgHash = ensureBytes('msgHash', msgHash);\n        if (prehash)\n            msgHash = ensureBytes('prehashed msgHash', hash(msgHash));\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) {\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))\n                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)\n                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)\n                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); // use normS, not s\n        }\n        return { seed, k2sig };\n    }\n    const defaultSigOpts = { lowS: CURVE.lowS, prehash: false };\n    const defaultVerOpts = { lowS: CURVE.lowS, prehash: false };\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, privKey, opts = defaultSigOpts) {\n        const { seed, k2sig } = prepSig(msgHash, privKey, opts); // Steps A, D of RFC6979 3.2.\n        const C = CURVE;\n        const drbg = ut.createHmacDrbg(C.hash.outputLen, C.nByteLength, C.hmac);\n        return drbg(seed, k2sig); // Steps B, C, D, E, F, G\n    }\n    // Enable precomputes. Slows down first publicKey computation by 20ms.\n    Point.BASE._setWindowSize(8);\n    // utils.precompute(8, ProjectivePoint.BASE)\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(signature, msgHash, publicKey, opts = defaultVerOpts) {\n        const sg = signature;\n        msgHash = ensureBytes('msgHash', msgHash);\n        publicKey = ensureBytes('publicKey', publicKey);\n        if ('strict' in opts)\n            throw new Error('options.strict was renamed to lowS');\n        const { lowS, prehash } = opts;\n        let _sig = undefined;\n        let P;\n        try {\n            if (typeof sg === 'string' || sg instanceof Uint8Array) {\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                }\n                catch (derError) {\n                    if (!(derError instanceof DER.Err))\n                        throw derError;\n                    _sig = Signature.fromCompact(sg);\n                }\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            }\n            else {\n                throw new Error('PARSE');\n            }\n            P = Point.fromHex(publicKey);\n        }\n        catch (error) {\n            if (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())\n            return false;\n        if (prehash)\n            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)\n            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 * 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(Fp, Z) {\n    // Generic implementation\n    const q = Fp.ORDER;\n    let l = _0n;\n    for (let o = q - _1n; o % _2n === _0n; o /= _2n)\n        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, v) => {\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, v) => {\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(Fp, opts) {\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)\n        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) => {\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//# sourceMappingURL=weierstrass.js.map","/*! 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 } from './abstract/weierstrass.js';\n// connects noble-curves to noble-hashes\nexport function getHash(hash) {\n    return {\n        hash,\n        hmac: (key, ...msgs) => hmac(hash, key, concatBytes(...msgs)),\n        randomBytes,\n    };\n}\nexport function createCurve(curveDef, defHash) {\n    const create = (hash) => weierstrass({ ...curveDef, ...getHash(hash) });\n    return Object.freeze({ ...create(defHash), create });\n}\n//# sourceMappingURL=_shortw_utils.js.map","/*! 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 { mapToCurveSimpleSWU } from './abstract/weierstrass.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';\nconst secp256k1P = BigInt('0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f');\nconst secp256k1N = BigInt('0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141');\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst divNearest = (a, b) => (a + b / _2n) / b;\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) {\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))\n        throw new Error('Cannot find square root');\n    return root;\n}\nconst Fp = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\nexport const secp256k1 = createCurve({\n    a: BigInt(0),\n    b: BigInt(7),\n    Fp,\n    n: secp256k1N,\n    // Base point (x, y) aka generator point\n    Gx: BigInt('55066263022277343669578718895168534326250603453777594175500187360389116729240'),\n    Gy: BigInt('32670510020758816978083085130507043184471273380659243275938904335757337482424'),\n    h: BigInt(1),\n    lowS: true,\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) => {\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            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)\n                k1 = n - k1;\n            if (k2neg)\n                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}, sha256);\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) => typeof x === 'bigint' && _0n < x && x < secp256k1P;\nconst ge = (x) => 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 = {};\nfunction taggedHash(tag, ...messages) {\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// ECDSA compact points are 33-byte. Schnorr is 32: we strip first byte 0x02 or 0x03\nconst pointToBytes = (point) => point.toRawBytes(true).slice(1);\nconst numTo32b = (n) => numberToBytesBE(n, 32);\nconst modP = (x) => mod(x, secp256k1P);\nconst modN = (x) => mod(x, secp256k1N);\nconst Point = secp256k1.ProjectivePoint;\nconst GmulAdd = (Q, a, b) => Point.BASE.multiplyAndAddUnsafe(Q, a, b);\n// Calculate point, scalar and bytes\nfunction schnorrGetExtPubKey(priv) {\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) {\n    if (!fe(x))\n        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)\n        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) {\n    return modN(bytesToNumberBE(taggedHash('BIP0340/challenge', ...args)));\n}\n/**\n * Schnorr public key is just `x` coordinate of Point as per BIP340.\n */\nfunction schnorrGetPublicKey(privateKey) {\n    return schnorrGetExtPubKey(privateKey).bytes; // d'=int(sk). Fail if d'=0 or d'≥n. Ret bytes(d'⋅G)\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(message, privateKey, auxRand = randomBytes(32)) {\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)\n        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))\n        throw new Error('sign: Invalid signature produced');\n    return sig;\n}\n/**\n * Verifies Schnorr signature.\n * Will swallow errors & return false except for initial type validation of arguments.\n */\nfunction schnorrVerify(signature, message, publicKey) {\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))\n            return false;\n        const s = bytesToNumberBE(sig.subarray(32, 64)); // Let s = int(sig[32:64]); fail if s ≥ n.\n        if (!ge(s))\n            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)\n            return false; // -eP == (n-e)P\n        return true; // Fail if is_infinite(R) / not has_even_y(R) / x(R) ≠ r.\n    }\n    catch (error) {\n        return false;\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}))();\nconst isoMap = /* @__PURE__ */ (() => isogenyMap(Fp, [\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)))))();\nconst mapSWU = /* @__PURE__ */ (() => mapToCurveSimpleSWU(Fp, {\n    A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n    B: BigInt('1771'),\n    Z: Fp.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n    const { x, y } = mapSWU(Fp.create(scalars[0]));\n    return isoMap(x, y);\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}))();\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.js.map","/**\n *  A constant for the zero address.\n *\n *  (**i.e.** ``\"0x0000000000000000000000000000000000000000\"``)\n */\nexport const ZeroAddress = \"0x0000000000000000000000000000000000000000\";\n//# sourceMappingURL=addresses.js.map","/**\n *  A constant for the zero hash.\n *\n *  (**i.e.** ``\"0x0000000000000000000000000000000000000000000000000000000000000000\"``)\n */\nexport const ZeroHash = \"0x0000000000000000000000000000000000000000000000000000000000000000\";\n//# sourceMappingURL=hashes.js.map","import { ZeroHash } from \"../constants/index.js\";\nimport { concat, dataLength, getBigInt, getBytes, getNumber, hexlify, toBeArray, isHexString, zeroPadValue, assertArgument, assertPrivate } from \"../utils/index.js\";\n// Constants\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_2 = BigInt(2);\nconst BN_27 = BigInt(27);\nconst BN_28 = BigInt(28);\nconst BN_35 = BigInt(35);\nconst _guard = {};\nfunction toUint256(value) {\n    return zeroPadValue(toBeArray(value), 32);\n}\n/**\n *  A Signature  @TODO\n *\n *\n *  @_docloc: api/crypto:Signing\n */\nexport class Signature {\n    #r;\n    #s;\n    #v;\n    #networkV;\n    /**\n     *  The ``r`` value for a signautre.\n     *\n     *  This represents the ``x`` coordinate of a \"reference\" or\n     *  challenge point, from which the ``y`` can be computed.\n     */\n    get r() { return this.#r; }\n    set r(value) {\n        assertArgument(dataLength(value) === 32, \"invalid r\", \"value\", value);\n        this.#r = hexlify(value);\n    }\n    /**\n     *  The ``s`` value for a signature.\n     */\n    get s() { return this.#s; }\n    set s(_value) {\n        assertArgument(dataLength(_value) === 32, \"invalid s\", \"value\", _value);\n        const value = hexlify(_value);\n        assertArgument(parseInt(value.substring(0, 3)) < 8, \"non-canonical s\", \"value\", value);\n        this.#s = value;\n    }\n    /**\n     *  The ``v`` value for a signature.\n     *\n     *  Since a given ``x`` value for ``r`` has two possible values for\n     *  its correspondin ``y``, the ``v`` indicates which of the two ``y``\n     *  values to use.\n     *\n     *  It is normalized to the values ``27`` or ``28`` for legacy\n     *  purposes.\n     */\n    get v() { return this.#v; }\n    set v(value) {\n        const v = getNumber(value, \"value\");\n        assertArgument(v === 27 || v === 28, \"invalid v\", \"v\", value);\n        this.#v = v;\n    }\n    /**\n     *  The EIP-155 ``v`` for legacy transactions. For non-legacy\n     *  transactions, this value is ``null``.\n     */\n    get networkV() { return this.#networkV; }\n    /**\n     *  The chain ID for EIP-155 legacy transactions. For non-legacy\n     *  transactions, this value is ``null``.\n     */\n    get legacyChainId() {\n        const v = this.networkV;\n        if (v == null) {\n            return null;\n        }\n        return Signature.getChainId(v);\n    }\n    /**\n     *  The ``yParity`` for the signature.\n     *\n     *  See ``v`` for more details on how this value is used.\n     */\n    get yParity() {\n        return (this.v === 27) ? 0 : 1;\n    }\n    /**\n     *  The [[link-eip-2098]] compact representation of the ``yParity``\n     *  and ``s`` compacted into a single ``bytes32``.\n     */\n    get yParityAndS() {\n        // The EIP-2098 compact representation\n        const yParityAndS = getBytes(this.s);\n        if (this.yParity) {\n            yParityAndS[0] |= 0x80;\n        }\n        return hexlify(yParityAndS);\n    }\n    /**\n     *  The [[link-eip-2098]] compact representation.\n     */\n    get compactSerialized() {\n        return concat([this.r, this.yParityAndS]);\n    }\n    /**\n     *  The serialized representation.\n     */\n    get serialized() {\n        return concat([this.r, this.s, (this.yParity ? \"0x1c\" : \"0x1b\")]);\n    }\n    /**\n     *  @private\n     */\n    constructor(guard, r, s, v) {\n        assertPrivate(guard, _guard, \"Signature\");\n        this.#r = r;\n        this.#s = s;\n        this.#v = v;\n        this.#networkV = null;\n    }\n    [Symbol.for('nodejs.util.inspect.custom')]() {\n        return `Signature { r: \"${this.r}\", s: \"${this.s}\", yParity: ${this.yParity}, networkV: ${this.networkV} }`;\n    }\n    /**\n     *  Returns a new identical [[Signature]].\n     */\n    clone() {\n        const clone = new Signature(_guard, this.r, this.s, this.v);\n        if (this.networkV) {\n            clone.#networkV = this.networkV;\n        }\n        return clone;\n    }\n    /**\n     *  Returns a representation that is compatible with ``JSON.stringify``.\n     */\n    toJSON() {\n        const networkV = this.networkV;\n        return {\n            _type: \"signature\",\n            networkV: ((networkV != null) ? networkV.toString() : null),\n            r: this.r, s: this.s, v: this.v,\n        };\n    }\n    /**\n     *  Compute the chain ID from the ``v`` in a legacy EIP-155 transactions.\n     *\n     *  @example:\n     *    Signature.getChainId(45)\n     *    //_result:\n     *\n     *    Signature.getChainId(46)\n     *    //_result:\n     */\n    static getChainId(v) {\n        const bv = getBigInt(v, \"v\");\n        // The v is not an EIP-155 v, so it is the unspecified chain ID\n        if ((bv == BN_27) || (bv == BN_28)) {\n            return BN_0;\n        }\n        // Bad value for an EIP-155 v\n        assertArgument(bv >= BN_35, \"invalid EIP-155 v\", \"v\", v);\n        return (bv - BN_35) / BN_2;\n    }\n    /**\n     *  Compute the ``v`` for a chain ID for a legacy EIP-155 transactions.\n     *\n     *  Legacy transactions which use [[link-eip-155]] hijack the ``v``\n     *  property to include the chain ID.\n     *\n     *  @example:\n     *    Signature.getChainIdV(5, 27)\n     *    //_result:\n     *\n     *    Signature.getChainIdV(5, 28)\n     *    //_result:\n     *\n     */\n    static getChainIdV(chainId, v) {\n        return (getBigInt(chainId) * BN_2) + BigInt(35 + v - 27);\n    }\n    /**\n     *  Compute the normalized legacy transaction ``v`` from a ``yParirty``,\n     *  a legacy transaction ``v`` or a legacy [[link-eip-155]] transaction.\n     *\n     *  @example:\n     *    // The values 0 and 1 imply v is actually yParity\n     *    Signature.getNormalizedV(0)\n     *    //_result:\n     *\n     *    // Legacy non-EIP-1559 transaction (i.e. 27 or 28)\n     *    Signature.getNormalizedV(27)\n     *    //_result:\n     *\n     *    // Legacy EIP-155 transaction (i.e. >= 35)\n     *    Signature.getNormalizedV(46)\n     *    //_result:\n     *\n     *    // Invalid values throw\n     *    Signature.getNormalizedV(5)\n     *    //_error:\n     */\n    static getNormalizedV(v) {\n        const bv = getBigInt(v);\n        if (bv === BN_0 || bv === BN_27) {\n            return 27;\n        }\n        if (bv === BN_1 || bv === BN_28) {\n            return 28;\n        }\n        assertArgument(bv >= BN_35, \"invalid v\", \"v\", v);\n        // Otherwise, EIP-155 v means odd is 27 and even is 28\n        return (bv & BN_1) ? 27 : 28;\n    }\n    /**\n     *  Creates a new [[Signature]].\n     *\n     *  If no %%sig%% is provided, a new [[Signature]] is created\n     *  with default values.\n     *\n     *  If %%sig%% is a string, it is parsed.\n     */\n    static from(sig) {\n        function assertError(check, message) {\n            assertArgument(check, message, \"signature\", sig);\n        }\n        ;\n        if (sig == null) {\n            return new Signature(_guard, ZeroHash, ZeroHash, 27);\n        }\n        if (typeof (sig) === \"string\") {\n            const bytes = getBytes(sig, \"signature\");\n            if (bytes.length === 64) {\n                const r = hexlify(bytes.slice(0, 32));\n                const s = bytes.slice(32, 64);\n                const v = (s[0] & 0x80) ? 28 : 27;\n                s[0] &= 0x7f;\n                return new Signature(_guard, r, hexlify(s), v);\n            }\n            if (bytes.length === 65) {\n                const r = hexlify(bytes.slice(0, 32));\n                const s = bytes.slice(32, 64);\n                assertError((s[0] & 0x80) === 0, \"non-canonical s\");\n                const v = Signature.getNormalizedV(bytes[64]);\n                return new Signature(_guard, r, hexlify(s), v);\n            }\n            assertError(false, \"invalid raw signature length\");\n        }\n        if (sig instanceof Signature) {\n            return sig.clone();\n        }\n        // Get r\n        const _r = sig.r;\n        assertError(_r != null, \"missing r\");\n        const r = toUint256(_r);\n        // Get s; by any means necessary (we check consistency below)\n        const s = (function (s, yParityAndS) {\n            if (s != null) {\n                return toUint256(s);\n            }\n            if (yParityAndS != null) {\n                assertError(isHexString(yParityAndS, 32), \"invalid yParityAndS\");\n                const bytes = getBytes(yParityAndS);\n                bytes[0] &= 0x7f;\n                return hexlify(bytes);\n            }\n            assertError(false, \"missing s\");\n        })(sig.s, sig.yParityAndS);\n        assertError((getBytes(s)[0] & 0x80) == 0, \"non-canonical s\");\n        // Get v; by any means necessary (we check consistency below)\n        const { networkV, v } = (function (_v, yParityAndS, yParity) {\n            if (_v != null) {\n                const v = getBigInt(_v);\n                return {\n                    networkV: ((v >= BN_35) ? v : undefined),\n                    v: Signature.getNormalizedV(v)\n                };\n            }\n            if (yParityAndS != null) {\n                assertError(isHexString(yParityAndS, 32), \"invalid yParityAndS\");\n                return { v: ((getBytes(yParityAndS)[0] & 0x80) ? 28 : 27) };\n            }\n            if (yParity != null) {\n                switch (getNumber(yParity, \"sig.yParity\")) {\n                    case 0: return { v: 27 };\n                    case 1: return { v: 28 };\n                }\n                assertError(false, \"invalid yParity\");\n            }\n            assertError(false, \"missing v\");\n        })(sig.v, sig.yParityAndS, sig.yParity);\n        const result = new Signature(_guard, r, s, v);\n        if (networkV) {\n            result.#networkV = networkV;\n        }\n        // If multiple of v, yParity, yParityAndS we given, check they match\n        assertError(sig.yParity == null || getNumber(sig.yParity, \"sig.yParity\") === result.yParity, \"yParity mismatch\");\n        assertError(sig.yParityAndS == null || sig.yParityAndS === result.yParityAndS, \"yParityAndS mismatch\");\n        return result;\n    }\n}\n//# sourceMappingURL=signature.js.map","/**\n *  Add details about signing here.\n *\n *  @_subsection: api/crypto:Signing  [about-signing]\n */\nimport { secp256k1 } from \"@noble/curves/secp256k1\";\nimport { concat, dataLength, getBytes, getBytesCopy, hexlify, toBeHex, assertArgument } from \"../utils/index.js\";\nimport { Signature } from \"./signature.js\";\n/**\n *  A **SigningKey** provides high-level access to the elliptic curve\n *  cryptography (ECC) operations and key management.\n */\nexport class SigningKey {\n    #privateKey;\n    /**\n     *  Creates a new **SigningKey** for %%privateKey%%.\n     */\n    constructor(privateKey) {\n        assertArgument(dataLength(privateKey) === 32, \"invalid private key\", \"privateKey\", \"[REDACTED]\");\n        this.#privateKey = hexlify(privateKey);\n    }\n    /**\n     *  The private key.\n     */\n    get privateKey() { return this.#privateKey; }\n    /**\n     *  The uncompressed public key.\n     *\n     * This will always begin with the prefix ``0x04`` and be 132\n     * characters long (the ``0x`` prefix and 130 hexadecimal nibbles).\n     */\n    get publicKey() { return SigningKey.computePublicKey(this.#privateKey); }\n    /**\n     *  The compressed public key.\n     *\n     *  This will always begin with either the prefix ``0x02`` or ``0x03``\n     *  and be 68 characters long (the ``0x`` prefix and 33 hexadecimal\n     *  nibbles)\n     */\n    get compressedPublicKey() { return SigningKey.computePublicKey(this.#privateKey, true); }\n    /**\n     *  Return the signature of the signed %%digest%%.\n     */\n    sign(digest) {\n        assertArgument(dataLength(digest) === 32, \"invalid digest length\", \"digest\", digest);\n        const sig = secp256k1.sign(getBytesCopy(digest), getBytesCopy(this.#privateKey), {\n            lowS: true\n        });\n        return Signature.from({\n            r: toBeHex(sig.r, 32),\n            s: toBeHex(sig.s, 32),\n            v: (sig.recovery ? 0x1c : 0x1b)\n        });\n    }\n    /**\n     *  Returns the [[link-wiki-ecdh]] shared secret between this\n     *  private key and the %%other%% key.\n     *\n     *  The %%other%% key may be any type of key, a raw public key,\n     *  a compressed/uncompressed pubic key or aprivate key.\n     *\n     *  Best practice is usually to use a cryptographic hash on the\n     *  returned value before using it as a symetric secret.\n     *\n     *  @example:\n     *    sign1 = new SigningKey(id(\"some-secret-1\"))\n     *    sign2 = new SigningKey(id(\"some-secret-2\"))\n     *\n     *    // Notice that privA.computeSharedSecret(pubB)...\n     *    sign1.computeSharedSecret(sign2.publicKey)\n     *    //_result:\n     *\n     *    // ...is equal to privB.computeSharedSecret(pubA).\n     *    sign2.computeSharedSecret(sign1.publicKey)\n     *    //_result:\n     */\n    computeSharedSecret(other) {\n        const pubKey = SigningKey.computePublicKey(other);\n        return hexlify(secp256k1.getSharedSecret(getBytesCopy(this.#privateKey), getBytes(pubKey), false));\n    }\n    /**\n     *  Compute the public key for %%key%%, optionally %%compressed%%.\n     *\n     *  The %%key%% may be any type of key, a raw public key, a\n     *  compressed/uncompressed public key or private key.\n     *\n     *  @example:\n     *    sign = new SigningKey(id(\"some-secret\"));\n     *\n     *    // Compute the uncompressed public key for a private key\n     *    SigningKey.computePublicKey(sign.privateKey)\n     *    //_result:\n     *\n     *    // Compute the compressed public key for a private key\n     *    SigningKey.computePublicKey(sign.privateKey, true)\n     *    //_result:\n     *\n     *    // Compute the uncompressed public key\n     *    SigningKey.computePublicKey(sign.publicKey, false);\n     *    //_result:\n     *\n     *    // Compute the Compressed a public key\n     *    SigningKey.computePublicKey(sign.publicKey, true);\n     *    //_result:\n     */\n    static computePublicKey(key, compressed) {\n        let bytes = getBytes(key, \"key\");\n        // private key\n        if (bytes.length === 32) {\n            const pubKey = secp256k1.getPublicKey(bytes, !!compressed);\n            return hexlify(pubKey);\n        }\n        // raw public key; use uncompressed key with 0x04 prefix\n        if (bytes.length === 64) {\n            const pub = new Uint8Array(65);\n            pub[0] = 0x04;\n            pub.set(bytes, 1);\n            bytes = pub;\n        }\n        const point = secp256k1.ProjectivePoint.fromHex(bytes);\n        return hexlify(point.toRawBytes(compressed));\n    }\n    /**\n     *  Returns the public key for the private key which produced the\n     *  %%signature%% for the given %%digest%%.\n     *\n     *  @example:\n     *    key = new SigningKey(id(\"some-secret\"))\n     *    digest = id(\"hello world\")\n     *    sig = key.sign(digest)\n     *\n     *    // Notice the signer public key...\n     *    key.publicKey\n     *    //_result:\n     *\n     *    // ...is equal to the recovered public key\n     *    SigningKey.recoverPublicKey(digest, sig)\n     *    //_result:\n     *\n     */\n    static recoverPublicKey(digest, signature) {\n        assertArgument(dataLength(digest) === 32, \"invalid digest length\", \"digest\", digest);\n        const sig = Signature.from(signature);\n        let secpSig = secp256k1.Signature.fromCompact(getBytesCopy(concat([sig.r, sig.s])));\n        secpSig = secpSig.addRecoveryBit(sig.yParity);\n        const pubKey = secpSig.recoverPublicKey(getBytesCopy(digest));\n        assertArgument(pubKey != null, \"invalid signautre for digest\", \"signature\", signature);\n        return \"0x\" + pubKey.toHex(false);\n    }\n    /**\n     *  Returns the point resulting from adding the ellipic curve points\n     *  %%p0%% and %%p1%%.\n     *\n     *  This is not a common function most developers should require, but\n     *  can be useful for certain privacy-specific techniques.\n     *\n     *  For example, it is used by [[HDNodeWallet]] to compute child\n     *  addresses from parent public keys and chain codes.\n     */\n    static addPoints(p0, p1, compressed) {\n        const pub0 = secp256k1.ProjectivePoint.fromHex(SigningKey.computePublicKey(p0).substring(2));\n        const pub1 = secp256k1.ProjectivePoint.fromHex(SigningKey.computePublicKey(p1).substring(2));\n        return \"0x\" + pub0.add(pub1).toHex(!!compressed);\n    }\n}\n//# sourceMappingURL=signing-key.js.map","import { keccak256 } from \"../crypto/index.js\";\nimport { getBytes, assertArgument } from \"../utils/index.js\";\nconst BN_0 = BigInt(0);\nconst BN_36 = BigInt(36);\nfunction getChecksumAddress(address) {\n    //    if (!isHexString(address, 20)) {\n    //        logger.throwArgumentError(\"invalid address\", \"address\", address);\n    //    }\n    address = address.toLowerCase();\n    const chars = address.substring(2).split(\"\");\n    const expanded = new Uint8Array(40);\n    for (let i = 0; i < 40; i++) {\n        expanded[i] = chars[i].charCodeAt(0);\n    }\n    const hashed = getBytes(keccak256(expanded));\n    for (let i = 0; i < 40; 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    return \"0x\" + chars.join(\"\");\n}\n// See: https://en.wikipedia.org/wiki/International_Bank_Account_Number\n// Create lookup table\nconst ibanLookup = {};\nfor (let i = 0; i < 10; i++) {\n    ibanLookup[String(i)] = String(i);\n}\nfor (let i = 0; i < 26; i++) {\n    ibanLookup[String.fromCharCode(65 + i)] = String(10 + i);\n}\n// How many decimal digits can we process? (for 64-bit float, this is 15)\n// i.e. Math.floor(Math.log10(Number.MAX_SAFE_INTEGER));\nconst safeDigits = 15;\nfunction ibanChecksum(address) {\n    address = address.toUpperCase();\n    address = address.substring(4) + address.substring(0, 2) + \"00\";\n    let expanded = address.split(\"\").map((c) => { return ibanLookup[c]; }).join(\"\");\n    // Javascript can handle integers safely up to 15 (decimal) digits\n    while (expanded.length >= safeDigits) {\n        let block = expanded.substring(0, safeDigits);\n        expanded = parseInt(block, 10) % 97 + expanded.substring(block.length);\n    }\n    let checksum = String(98 - (parseInt(expanded, 10) % 97));\n    while (checksum.length < 2) {\n        checksum = \"0\" + checksum;\n    }\n    return checksum;\n}\n;\nconst Base36 = (function () {\n    ;\n    const result = {};\n    for (let i = 0; i < 36; i++) {\n        const key = \"0123456789abcdefghijklmnopqrstuvwxyz\"[i];\n        result[key] = BigInt(i);\n    }\n    return result;\n})();\nfunction fromBase36(value) {\n    value = value.toLowerCase();\n    let result = BN_0;\n    for (let i = 0; i < value.length; i++) {\n        result = result * BN_36 + Base36[value[i]];\n    }\n    return result;\n}\n/**\n *  Returns a normalized and checksumed address for %%address%%.\n *  This accepts non-checksum addresses, checksum addresses and\n *  [[getIcapAddress]] formats.\n *\n *  The checksum in Ethereum uses the capitalization (upper-case\n *  vs lower-case) of the characters within an address to encode\n *  its checksum, which offers, on average, a checksum of 15-bits.\n *\n *  If %%address%% contains both upper-case and lower-case, it is\n *  assumed to already be a checksum address and its checksum is\n *  validated, and if the address fails its expected checksum an\n *  error is thrown.\n *\n *  If you wish the checksum of %%address%% to be ignore, it should\n *  be converted to lower-case (i.e. ``.toLowercase()``) before\n *  being passed in. This should be a very rare situation though,\n *  that you wish to bypass the safegaurds in place to protect\n *  against an address that has been incorrectly copied from another\n *  source.\n *\n *  @example:\n *    // Adds the checksum (via upper-casing specific letters)\n *    getAddress(\"0x8ba1f109551bd432803012645ac136ddd64dba72\")\n *    //_result:\n *\n *    // Converts ICAP address and adds checksum\n *    getAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\");\n *    //_result:\n *\n *    // Throws an error if an address contains mixed case,\n *    // but the checksum fails\n *    getAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_error:\n */\nexport function getAddress(address) {\n    assertArgument(typeof (address) === \"string\", \"invalid address\", \"address\", address);\n    if (address.match(/^(0x)?[0-9a-fA-F]{40}$/)) {\n        // Missing the 0x prefix\n        if (!address.startsWith(\"0x\")) {\n            address = \"0x\" + address;\n        }\n        const result = getChecksumAddress(address);\n        // It is a checksummed address with a bad checksum\n        assertArgument(!address.match(/([A-F].*[a-f])|([a-f].*[A-F])/) || result === address, \"bad address checksum\", \"address\", address);\n        return result;\n    }\n    // Maybe ICAP? (we only support direct mode)\n    if (address.match(/^XE[0-9]{2}[0-9A-Za-z]{30,31}$/)) {\n        // It is an ICAP address with a bad checksum\n        assertArgument(address.substring(2, 4) === ibanChecksum(address), \"bad icap checksum\", \"address\", address);\n        let result = fromBase36(address.substring(4)).toString(16);\n        while (result.length < 40) {\n            result = \"0\" + result;\n        }\n        return getChecksumAddress(\"0x\" + result);\n    }\n    assertArgument(false, \"invalid address\", \"address\", address);\n}\n/**\n *  The [ICAP Address format](link-icap) format is an early checksum\n *  format which attempts to be compatible with the banking\n *  industry [IBAN format](link-wiki-iban) for bank accounts.\n *\n *  It is no longer common or a recommended format.\n *\n *  @example:\n *    getIcapAddress(\"0x8ba1f109551bd432803012645ac136ddd64dba72\");\n *    //_result:\n *\n *    getIcapAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\");\n *    //_result:\n *\n *    // Throws an error if the ICAP checksum is wrong\n *    getIcapAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK37\");\n *    //_error:\n */\nexport function getIcapAddress(address) {\n    //let base36 = _base16To36(getAddress(address).substring(2)).toUpperCase();\n    let base36 = BigInt(getAddress(address)).toString(36).toUpperCase();\n    while (base36.length < 30) {\n        base36 = \"0\" + base36;\n    }\n    return \"XE\" + ibanChecksum(\"XE00\" + base36) + base36;\n}\n//# sourceMappingURL=address.js.map","import { assert, assertArgument } from \"../utils/index.js\";\nimport { getAddress } from \"./address.js\";\n/**\n *  Returns true if %%value%% is an object which implements the\n *  [[Addressable]] interface.\n *\n *  @example:\n *    // Wallets and AbstractSigner sub-classes\n *    isAddressable(Wallet.createRandom())\n *    //_result:\n *\n *    // Contracts\n *    contract = new Contract(\"dai.tokens.ethers.eth\", [ ], provider)\n *    isAddressable(contract)\n *    //_result:\n */\nexport function isAddressable(value) {\n    return (value && typeof (value.getAddress) === \"function\");\n}\n/**\n *  Returns true if %%value%% is a valid address.\n *\n *  @example:\n *    // Valid address\n *    isAddress(\"0x8ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_result:\n *\n *    // Valid ICAP address\n *    isAddress(\"XE65GB6LDNXYOFTX0NSV3FUWKOWIXAMJK36\")\n *    //_result:\n *\n *    // Invalid checksum\n *    isAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBa72\")\n *    //_result:\n *\n *    // Invalid ICAP checksum\n *    isAddress(\"0x8Ba1f109551bD432803012645Ac136ddd64DBA72\")\n *    //_result:\n *\n *    // Not an address (an ENS name requires a provided and an\n *    // asynchronous API to access)\n *    isAddress(\"ricmoo.eth\")\n *    //_result:\n */\nexport function isAddress(value) {\n    try {\n        getAddress(value);\n        return true;\n    }\n    catch (error) { }\n    return false;\n}\nasync function checkAddress(target, promise) {\n    const result = await promise;\n    if (result == null || result === \"0x0000000000000000000000000000000000000000\") {\n        assert(typeof (target) !== \"string\", \"unconfigured name\", \"UNCONFIGURED_NAME\", { value: target });\n        assertArgument(false, \"invalid AddressLike value; did not resolve to a value address\", \"target\", target);\n    }\n    return getAddress(result);\n}\n/**\n *  Resolves to an address for the %%target%%, which may be any\n *  supported address type, an [[Addressable]] or a Promise which\n *  resolves to an address.\n *\n *  If an ENS name is provided, but that name has not been correctly\n *  configured a [[UnconfiguredNameError]] is thrown.\n *\n *  @example:\n *    addr = \"0x6B175474E89094C44Da98b954EedeAC495271d0F\"\n *\n *    // Addresses are return synchronously\n *    resolveAddress(addr, provider)\n *    //_result:\n *\n *    // Address promises are resolved asynchronously\n *    resolveAddress(Promise.resolve(addr))\n *    //_result:\n *\n *    // ENS names are resolved asynchronously\n *    resolveAddress(\"dai.tokens.ethers.eth\", provider)\n *    //_result:\n *\n *    // Addressable objects are resolved asynchronously\n *    contract = new Contract(addr, [ ])\n *    resolveAddress(contract, provider)\n *    //_result:\n *\n *    // Unconfigured ENS names reject\n *    resolveAddress(\"nothing-here.ricmoo.eth\", provider)\n *    //_error:\n *\n *    // ENS names require a NameResolver object passed in\n *    // (notice the provider was omitted)\n *    resolveAddress(\"nothing-here.ricmoo.eth\")\n *    //_error:\n */\nexport function resolveAddress(target, resolver) {\n    if (typeof (target) === \"string\") {\n        if (target.match(/^0x[0-9a-f]{40}$/i)) {\n            return getAddress(target);\n        }\n        assert(resolver != null, \"ENS resolution requires a provider\", \"UNSUPPORTED_OPERATION\", { operation: \"resolveName\" });\n        return checkAddress(target, resolver.resolveName(target));\n    }\n    else if (isAddressable(target)) {\n        return checkAddress(target, target.getAddress());\n    }\n    else if (target && typeof (target.then) === \"function\") {\n        return checkAddress(target, target);\n    }\n    assertArgument(false, \"unsupported addressable value\", \"target\", target);\n}\n//# sourceMappingURL=checks.js.map","/**\n *  A Typed object allows a value to have its type explicitly\n *  specified.\n *\n *  For example, in Solidity, the value ``45`` could represent a\n *  ``uint8`` or a ``uint256``. The value ``0x1234`` could represent\n *  a ``bytes2`` or ``bytes``.\n *\n *  Since JavaScript has no meaningful way to explicitly inform any\n *  APIs which what the type is, this allows transparent interoperation\n *  with Soldity.\n *\n *  @_subsection: api/abi:Typed Values\n */\nimport { assertPrivate, defineProperties } from \"../utils/index.js\";\nconst _gaurd = {};\nfunction n(value, width) {\n    let signed = false;\n    if (width < 0) {\n        signed = true;\n        width *= -1;\n    }\n    // @TODO: Check range is valid for value\n    return new Typed(_gaurd, `${signed ? \"\" : \"u\"}int${width}`, value, { signed, width });\n}\nfunction b(value, size) {\n    // @TODO: Check range is valid for value\n    return new Typed(_gaurd, `bytes${(size) ? size : \"\"}`, value, { size });\n}\nconst _typedSymbol = Symbol.for(\"_ethers_typed\");\n/**\n *  The **Typed** class to wrap values providing explicit type information.\n */\nexport class Typed {\n    /**\n     *  The type, as a Solidity-compatible type.\n     */\n    type;\n    /**\n     *  The actual value.\n     */\n    value;\n    #options;\n    /**\n     *  @_ignore:\n     */\n    _typedSymbol;\n    /**\n     *  @_ignore:\n     */\n    constructor(gaurd, type, value, options) {\n        if (options == null) {\n            options = null;\n        }\n        assertPrivate(_gaurd, gaurd, \"Typed\");\n        defineProperties(this, { _typedSymbol, type, value });\n        this.#options = options;\n        // Check the value is valid\n        this.format();\n    }\n    /**\n     *  Format the type as a Human-Readable type.\n     */\n    format() {\n        if (this.type === \"array\") {\n            throw new Error(\"\");\n        }\n        else if (this.type === \"dynamicArray\") {\n            throw new Error(\"\");\n        }\n        else if (this.type === \"tuple\") {\n            return `tuple(${this.value.map((v) => v.format()).join(\",\")})`;\n        }\n        return this.type;\n    }\n    /**\n     *  The default value returned by this type.\n     */\n    defaultValue() {\n        return 0;\n    }\n    /**\n     *  The minimum value for numeric types.\n     */\n    minValue() {\n        return 0;\n    }\n    /**\n     *  The maximum value for numeric types.\n     */\n    maxValue() {\n        return 0;\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedBigInt]].\n     */\n    isBigInt() {\n        return !!(this.type.match(/^u?int[0-9]+$/));\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedData]].\n     */\n    isData() {\n        return this.type.startsWith(\"bytes\");\n    }\n    /**\n     *  Returns ``true`` and provides a type guard is this is a [[TypedString]].\n     */\n    isString() {\n        return (this.type === \"string\");\n    }\n    /**\n     *  Returns the tuple name, if this is a tuple. Throws otherwise.\n     */\n    get tupleName() {\n        if (this.type !== \"tuple\") {\n            throw TypeError(\"not a tuple\");\n        }\n        return this.#options;\n    }\n    // Returns the length of this type as an array\n    // - `null` indicates the length is unforced, it could be dynamic\n    // - `-1` indicates the length is dynamic\n    // - any other value indicates it is a static array and is its length\n    /**\n     *  Returns the length of the array type or ``-1`` if it is dynamic.\n     *\n     *  Throws if the type is not an array.\n     */\n    get arrayLength() {\n        if (this.type !== \"array\") {\n            throw TypeError(\"not an array\");\n        }\n        if (this.#options === true) {\n            return -1;\n        }\n        if (this.#options === false) {\n            return (this.value).length;\n        }\n        return null;\n    }\n    /**\n     *  Returns a new **Typed** of %%type%% with the %%value%%.\n     */\n    static from(type, value) {\n        return new Typed(_gaurd, type, value);\n    }\n    /**\n     *  Return a new ``uint8`` type for %%v%%.\n     */\n    static uint8(v) { return n(v, 8); }\n    /**\n     *  Return a new ``uint16`` type for %%v%%.\n     */\n    static uint16(v) { return n(v, 16); }\n    /**\n     *  Return a new ``uint24`` type for %%v%%.\n     */\n    static uint24(v) { return n(v, 24); }\n    /**\n     *  Return a new ``uint32`` type for %%v%%.\n     */\n    static uint32(v) { return n(v, 32); }\n    /**\n     *  Return a new ``uint40`` type for %%v%%.\n     */\n    static uint40(v) { return n(v, 40); }\n    /**\n     *  Return a new ``uint48`` type for %%v%%.\n     */\n    static uint48(v) { return n(v, 48); }\n    /**\n     *  Return a new ``uint56`` type for %%v%%.\n     */\n    static uint56(v) { return n(v, 56); }\n    /**\n     *  Return a new ``uint64`` type for %%v%%.\n     */\n    static uint64(v) { return n(v, 64); }\n    /**\n     *  Return a new ``uint72`` type for %%v%%.\n     */\n    static uint72(v) { return n(v, 72); }\n    /**\n     *  Return a new ``uint80`` type for %%v%%.\n     */\n    static uint80(v) { return n(v, 80); }\n    /**\n     *  Return a new ``uint88`` type for %%v%%.\n     */\n    static uint88(v) { return n(v, 88); }\n    /**\n     *  Return a new ``uint96`` type for %%v%%.\n     */\n    static uint96(v) { return n(v, 96); }\n    /**\n     *  Return a new ``uint104`` type for %%v%%.\n     */\n    static uint104(v) { return n(v, 104); }\n    /**\n     *  Return a new ``uint112`` type for %%v%%.\n     */\n    static uint112(v) { return n(v, 112); }\n    /**\n     *  Return a new ``uint120`` type for %%v%%.\n     */\n    static uint120(v) { return n(v, 120); }\n    /**\n     *  Return a new ``uint128`` type for %%v%%.\n     */\n    static uint128(v) { return n(v, 128); }\n    /**\n     *  Return a new ``uint136`` type for %%v%%.\n     */\n    static uint136(v) { return n(v, 136); }\n    /**\n     *  Return a new ``uint144`` type for %%v%%.\n     */\n    static uint144(v) { return n(v, 144); }\n    /**\n     *  Return a new ``uint152`` type for %%v%%.\n     */\n    static uint152(v) { return n(v, 152); }\n    /**\n     *  Return a new ``uint160`` type for %%v%%.\n     */\n    static uint160(v) { return n(v, 160); }\n    /**\n     *  Return a new ``uint168`` type for %%v%%.\n     */\n    static uint168(v) { return n(v, 168); }\n    /**\n     *  Return a new ``uint176`` type for %%v%%.\n     */\n    static uint176(v) { return n(v, 176); }\n    /**\n     *  Return a new ``uint184`` type for %%v%%.\n     */\n    static uint184(v) { return n(v, 184); }\n    /**\n     *  Return a new ``uint192`` type for %%v%%.\n     */\n    static uint192(v) { return n(v, 192); }\n    /**\n     *  Return a new ``uint200`` type for %%v%%.\n     */\n    static uint200(v) { return n(v, 200); }\n    /**\n     *  Return a new ``uint208`` type for %%v%%.\n     */\n    static uint208(v) { return n(v, 208); }\n    /**\n     *  Return a new ``uint216`` type for %%v%%.\n     */\n    static uint216(v) { return n(v, 216); }\n    /**\n     *  Return a new ``uint224`` type for %%v%%.\n     */\n    static uint224(v) { return n(v, 224); }\n    /**\n     *  Return a new ``uint232`` type for %%v%%.\n     */\n    static uint232(v) { return n(v, 232); }\n    /**\n     *  Return a new ``uint240`` type for %%v%%.\n     */\n    static uint240(v) { return n(v, 240); }\n    /**\n     *  Return a new ``uint248`` type for %%v%%.\n     */\n    static uint248(v) { return n(v, 248); }\n    /**\n     *  Return a new ``uint256`` type for %%v%%.\n     */\n    static uint256(v) { return n(v, 256); }\n    /**\n     *  Return a new ``uint256`` type for %%v%%.\n     */\n    static uint(v) { return n(v, 256); }\n    /**\n     *  Return a new ``int8`` type for %%v%%.\n     */\n    static int8(v) { return n(v, -8); }\n    /**\n     *  Return a new ``int16`` type for %%v%%.\n     */\n    static int16(v) { return n(v, -16); }\n    /**\n     *  Return a new ``int24`` type for %%v%%.\n     */\n    static int24(v) { return n(v, -24); }\n    /**\n     *  Return a new ``int32`` type for %%v%%.\n     */\n    static int32(v) { return n(v, -32); }\n    /**\n     *  Return a new ``int40`` type for %%v%%.\n     */\n    static int40(v) { return n(v, -40); }\n    /**\n     *  Return a new ``int48`` type for %%v%%.\n     */\n    static int48(v) { return n(v, -48); }\n    /**\n     *  Return a new ``int56`` type for %%v%%.\n     */\n    static int56(v) { return n(v, -56); }\n    /**\n     *  Return a new ``int64`` type for %%v%%.\n     */\n    static int64(v) { return n(v, -64); }\n    /**\n     *  Return a new ``int72`` type for %%v%%.\n     */\n    static int72(v) { return n(v, -72); }\n    /**\n     *  Return a new ``int80`` type for %%v%%.\n     */\n    static int80(v) { return n(v, -80); }\n    /**\n     *  Return a new ``int88`` type for %%v%%.\n     */\n    static int88(v) { return n(v, -88); }\n    /**\n     *  Return a new ``int96`` type for %%v%%.\n     */\n    static int96(v) { return n(v, -96); }\n    /**\n     *  Return a new ``int104`` type for %%v%%.\n     */\n    static int104(v) { return n(v, -104); }\n    /**\n     *  Return a new ``int112`` type for %%v%%.\n     */\n    static int112(v) { return n(v, -112); }\n    /**\n     *  Return a new ``int120`` type for %%v%%.\n     */\n    static int120(v) { return n(v, -120); }\n    /**\n     *  Return a new ``int128`` type for %%v%%.\n     */\n    static int128(v) { return n(v, -128); }\n    /**\n     *  Return a new ``int136`` type for %%v%%.\n     */\n    static int136(v) { return n(v, -136); }\n    /**\n     *  Return a new ``int144`` type for %%v%%.\n     */\n    static int144(v) { return n(v, -144); }\n    /**\n     *  Return a new ``int52`` type for %%v%%.\n     */\n    static int152(v) { return n(v, -152); }\n    /**\n     *  Return a new ``int160`` type for %%v%%.\n     */\n    static int160(v) { return n(v, -160); }\n    /**\n     *  Return a new ``int168`` type for %%v%%.\n     */\n    static int168(v) { return n(v, -168); }\n    /**\n     *  Return a new ``int176`` type for %%v%%.\n     */\n    static int176(v) { return n(v, -176); }\n    /**\n     *  Return a new ``int184`` type for %%v%%.\n     */\n    static int184(v) { return n(v, -184); }\n    /**\n     *  Return a new ``int92`` type for %%v%%.\n     */\n    static int192(v) { return n(v, -192); }\n    /**\n     *  Return a new ``int200`` type for %%v%%.\n     */\n    static int200(v) { return n(v, -200); }\n    /**\n     *  Return a new ``int208`` type for %%v%%.\n     */\n    static int208(v) { return n(v, -208); }\n    /**\n     *  Return a new ``int216`` type for %%v%%.\n     */\n    static int216(v) { return n(v, -216); }\n    /**\n     *  Return a new ``int224`` type for %%v%%.\n     */\n    static int224(v) { return n(v, -224); }\n    /**\n     *  Return a new ``int232`` type for %%v%%.\n     */\n    static int232(v) { return n(v, -232); }\n    /**\n     *  Return a new ``int240`` type for %%v%%.\n     */\n    static int240(v) { return n(v, -240); }\n    /**\n     *  Return a new ``int248`` type for %%v%%.\n     */\n    static int248(v) { return n(v, -248); }\n    /**\n     *  Return a new ``int256`` type for %%v%%.\n     */\n    static int256(v) { return n(v, -256); }\n    /**\n     *  Return a new ``int256`` type for %%v%%.\n     */\n    static int(v) { return n(v, -256); }\n    /**\n     *  Return a new ``bytes1`` type for %%v%%.\n     */\n    static bytes1(v) { return b(v, 1); }\n    /**\n     *  Return a new ``bytes2`` type for %%v%%.\n     */\n    static bytes2(v) { return b(v, 2); }\n    /**\n     *  Return a new ``bytes3`` type for %%v%%.\n     */\n    static bytes3(v) { return b(v, 3); }\n    /**\n     *  Return a new ``bytes4`` type for %%v%%.\n     */\n    static bytes4(v) { return b(v, 4); }\n    /**\n     *  Return a new ``bytes5`` type for %%v%%.\n     */\n    static bytes5(v) { return b(v, 5); }\n    /**\n     *  Return a new ``bytes6`` type for %%v%%.\n     */\n    static bytes6(v) { return b(v, 6); }\n    /**\n     *  Return a new ``bytes7`` type for %%v%%.\n     */\n    static bytes7(v) { return b(v, 7); }\n    /**\n     *  Return a new ``bytes8`` type for %%v%%.\n     */\n    static bytes8(v) { return b(v, 8); }\n    /**\n     *  Return a new ``bytes9`` type for %%v%%.\n     */\n    static bytes9(v) { return b(v, 9); }\n    /**\n     *  Return a new ``bytes10`` type for %%v%%.\n     */\n    static bytes10(v) { return b(v, 10); }\n    /**\n     *  Return a new ``bytes11`` type for %%v%%.\n     */\n    static bytes11(v) { return b(v, 11); }\n    /**\n     *  Return a new ``bytes12`` type for %%v%%.\n     */\n    static bytes12(v) { return b(v, 12); }\n    /**\n     *  Return a new ``bytes13`` type for %%v%%.\n     */\n    static bytes13(v) { return b(v, 13); }\n    /**\n     *  Return a new ``bytes14`` type for %%v%%.\n     */\n    static bytes14(v) { return b(v, 14); }\n    /**\n     *  Return a new ``bytes15`` type for %%v%%.\n     */\n    static bytes15(v) { return b(v, 15); }\n    /**\n     *  Return a new ``bytes16`` type for %%v%%.\n     */\n    static bytes16(v) { return b(v, 16); }\n    /**\n     *  Return a new ``bytes17`` type for %%v%%.\n     */\n    static bytes17(v) { return b(v, 17); }\n    /**\n     *  Return a new ``bytes18`` type for %%v%%.\n     */\n    static bytes18(v) { return b(v, 18); }\n    /**\n     *  Return a new ``bytes19`` type for %%v%%.\n     */\n    static bytes19(v) { return b(v, 19); }\n    /**\n     *  Return a new ``bytes20`` type for %%v%%.\n     */\n    static bytes20(v) { return b(v, 20); }\n    /**\n     *  Return a new ``bytes21`` type for %%v%%.\n     */\n    static bytes21(v) { return b(v, 21); }\n    /**\n     *  Return a new ``bytes22`` type for %%v%%.\n     */\n    static bytes22(v) { return b(v, 22); }\n    /**\n     *  Return a new ``bytes23`` type for %%v%%.\n     */\n    static bytes23(v) { return b(v, 23); }\n    /**\n     *  Return a new ``bytes24`` type for %%v%%.\n     */\n    static bytes24(v) { return b(v, 24); }\n    /**\n     *  Return a new ``bytes25`` type for %%v%%.\n     */\n    static bytes25(v) { return b(v, 25); }\n    /**\n     *  Return a new ``bytes26`` type for %%v%%.\n     */\n    static bytes26(v) { return b(v, 26); }\n    /**\n     *  Return a new ``bytes27`` type for %%v%%.\n     */\n    static bytes27(v) { return b(v, 27); }\n    /**\n     *  Return a new ``bytes28`` type for %%v%%.\n     */\n    static bytes28(v) { return b(v, 28); }\n    /**\n     *  Return a new ``bytes29`` type for %%v%%.\n     */\n    static bytes29(v) { return b(v, 29); }\n    /**\n     *  Return a new ``bytes30`` type for %%v%%.\n     */\n    static bytes30(v) { return b(v, 30); }\n    /**\n     *  Return a new ``bytes31`` type for %%v%%.\n     */\n    static bytes31(v) { return b(v, 31); }\n    /**\n     *  Return a new ``bytes32`` type for %%v%%.\n     */\n    static bytes32(v) { return b(v, 32); }\n    /**\n     *  Return a new ``address`` type for %%v%%.\n     */\n    static address(v) { return new Typed(_gaurd, \"address\", v); }\n    /**\n     *  Return a new ``bool`` type for %%v%%.\n     */\n    static bool(v) { return new Typed(_gaurd, \"bool\", !!v); }\n    /**\n     *  Return a new ``bytes`` type for %%v%%.\n     */\n    static bytes(v) { return new Typed(_gaurd, \"bytes\", v); }\n    /**\n     *  Return a new ``string`` type for %%v%%.\n     */\n    static string(v) { return new Typed(_gaurd, \"string\", v); }\n    /**\n     *  Return a new ``array`` type for %%v%%, allowing %%dynamic%% length.\n     */\n    static array(v, dynamic) {\n        throw new Error(\"not implemented yet\");\n        return new Typed(_gaurd, \"array\", v, dynamic);\n    }\n    /**\n     *  Return a new ``tuple`` type for %%v%%, with the optional %%name%%.\n     */\n    static tuple(v, name) {\n        throw new Error(\"not implemented yet\");\n        return new Typed(_gaurd, \"tuple\", v, name);\n    }\n    /**\n     *  Return a new ``uint8`` type for %%v%%.\n     */\n    static overrides(v) {\n        return new Typed(_gaurd, \"overrides\", Object.assign({}, v));\n    }\n    /**\n     *  Returns true only if %%value%% is a [[Typed]] instance.\n     */\n    static isTyped(value) {\n        return (value\n            && typeof (value) === \"object\"\n            && \"_typedSymbol\" in value\n            && value._typedSymbol === _typedSymbol);\n    }\n    /**\n     *  If the value is a [[Typed]] instance, validates the underlying value\n     *  and returns it, otherwise returns value directly.\n     *\n     *  This is useful for functions that with to accept either a [[Typed]]\n     *  object or values.\n     */\n    static dereference(value, type) {\n        if (Typed.isTyped(value)) {\n            if (value.type !== type) {\n                throw new Error(`invalid type: expecetd ${type}, got ${value.type}`);\n            }\n            return value.value;\n        }\n        return value;\n    }\n}\n//# sourceMappingURL=typed.js.map","import { getAddress } from \"../../address/index.js\";\nimport { toBeHex } from \"../../utils/maths.js\";\nimport { Typed } from \"../typed.js\";\nimport { Coder } from \"./abstract-coder.js\";\n/**\n *  @_ignore\n */\nexport class AddressCoder extends Coder {\n    constructor(localName) {\n        super(\"address\", \"address\", localName, false);\n    }\n    defaultValue() {\n        return \"0x0000000000000000000000000000000000000000\";\n    }\n    encode(writer, _value) {\n        let value = Typed.dereference(_value, \"string\");\n        try {\n            value = getAddress(value);\n        }\n        catch (error) {\n            return this._throwError(error.message, _value);\n        }\n        return writer.writeValue(value);\n    }\n    decode(reader) {\n        return getAddress(toBeHex(reader.readValue(), 20));\n    }\n}\n//# sourceMappingURL=address.js.map","import { Coder } from \"./abstract-coder.js\";\n/**\n *  Clones the functionality of an existing Coder, but without a localName\n *\n *  @_ignore\n */\nexport class AnonymousCoder extends Coder {\n    coder;\n    constructor(coder) {\n        super(coder.name, coder.type, \"_\", coder.dynamic);\n        this.coder = coder;\n    }\n    defaultValue() {\n        return this.coder.defaultValue();\n    }\n    encode(writer, value) {\n        return this.coder.encode(writer, value);\n    }\n    decode(reader) {\n        return this.coder.decode(reader);\n    }\n}\n//# sourceMappingURL=anonymous.js.map","import { defineProperties, isError, assert, assertArgument, assertArgumentCount } from \"../../utils/index.js\";\nimport { Typed } from \"../typed.js\";\nimport { Coder, Result, WordSize, Writer } from \"./abstract-coder.js\";\nimport { AnonymousCoder } from \"./anonymous.js\";\n/**\n *  @_ignore\n */\nexport function pack(writer, coders, values) {\n    let arrayValues = [];\n    if (Array.isArray(values)) {\n        arrayValues = values;\n    }\n    else if (values && typeof (values) === \"object\") {\n        let unique = {};\n        arrayValues = coders.map((coder) => {\n            const name = coder.localName;\n            assert(name, \"cannot encode object for signature with missing names\", \"INVALID_ARGUMENT\", { argument: \"values\", info: { coder }, value: values });\n            assert(!unique[name], \"cannot encode object for signature with duplicate names\", \"INVALID_ARGUMENT\", { argument: \"values\", info: { coder }, value: values });\n            unique[name] = true;\n            return values[name];\n        });\n    }\n    else {\n        assertArgument(false, \"invalid tuple value\", \"tuple\", values);\n    }\n    assertArgument(coders.length === arrayValues.length, \"types/value length mismatch\", \"tuple\", values);\n    let staticWriter = new Writer();\n    let dynamicWriter = new Writer();\n    let updateFuncs = [];\n    coders.forEach((coder, index) => {\n        let value = arrayValues[index];\n        if (coder.dynamic) {\n            // Get current dynamic offset (for the future pointer)\n            let dynamicOffset = dynamicWriter.length;\n            // Encode the dynamic value into the dynamicWriter\n            coder.encode(dynamicWriter, value);\n            // Prepare to populate the correct offset once we are done\n            let updateFunc = staticWriter.writeUpdatableValue();\n            updateFuncs.push((baseOffset) => {\n                updateFunc(baseOffset + dynamicOffset);\n            });\n        }\n        else {\n            coder.encode(staticWriter, value);\n        }\n    });\n    // Backfill all the dynamic offsets, now that we know the static length\n    updateFuncs.forEach((func) => { func(staticWriter.length); });\n    let length = writer.appendWriter(staticWriter);\n    length += writer.appendWriter(dynamicWriter);\n    return length;\n}\n/**\n *  @_ignore\n */\nexport function unpack(reader, coders) {\n    let values = [];\n    let keys = [];\n    // A reader anchored to this base\n    let baseReader = reader.subReader(0);\n    coders.forEach((coder) => {\n        let value = null;\n        if (coder.dynamic) {\n            let offset = reader.readIndex();\n            let offsetReader = baseReader.subReader(offset);\n            try {\n                value = coder.decode(offsetReader);\n            }\n            catch (error) {\n                // Cannot recover from this\n                if (isError(error, \"BUFFER_OVERRUN\")) {\n                    throw error;\n                }\n                value = error;\n                value.baseType = coder.name;\n                value.name = coder.localName;\n                value.type = coder.type;\n            }\n        }\n        else {\n            try {\n                value = coder.decode(reader);\n            }\n            catch (error) {\n                // Cannot recover from this\n                if (isError(error, \"BUFFER_OVERRUN\")) {\n                    throw error;\n                }\n                value = error;\n                value.baseType = coder.name;\n                value.name = coder.localName;\n                value.type = coder.type;\n            }\n        }\n        if (value == undefined) {\n            throw new Error(\"investigate\");\n        }\n        values.push(value);\n        keys.push(coder.localName || null);\n    });\n    return Result.fromItems(values, keys);\n}\n/**\n *  @_ignore\n */\nexport class ArrayCoder extends Coder {\n    coder;\n    length;\n    constructor(coder, length, localName) {\n        const type = (coder.type + \"[\" + (length >= 0 ? length : \"\") + \"]\");\n        const dynamic = (length === -1 || coder.dynamic);\n        super(\"array\", type, localName, dynamic);\n        defineProperties(this, { coder, length });\n    }\n    defaultValue() {\n        // Verifies the child coder is valid (even if the array is dynamic or 0-length)\n        const defaultChild = this.coder.defaultValue();\n        const result = [];\n        for (let i = 0; i < this.length; i++) {\n            result.push(defaultChild);\n        }\n        return result;\n    }\n    encode(writer, _value) {\n        const value = Typed.dereference(_value, \"array\");\n        if (!Array.isArray(value)) {\n            this._throwError(\"expected array value\", value);\n        }\n        let count = this.length;\n        if (count === -1) {\n            count = value.length;\n            writer.writeValue(value.length);\n        }\n        assertArgumentCount(value.length, count, \"coder array\" + (this.localName ? (\" \" + this.localName) : \"\"));\n        let coders = [];\n        for (let i = 0; i < value.length; i++) {\n            coders.push(this.coder);\n        }\n        return pack(writer, coders, value);\n    }\n    decode(reader) {\n        let count = this.length;\n        if (count === -1) {\n            count = reader.readIndex();\n            // Check that there is *roughly* enough data to ensure\n            // stray random data is not being read as a length. Each\n            // slot requires at least 32 bytes for their value (or 32\n            // bytes as a link to the data). This could use a much\n            // tighter bound, but we are erroring on the side of safety.\n            assert(count * WordSize <= reader.dataLength, \"insufficient data length\", \"BUFFER_OVERRUN\", { buffer: reader.bytes, offset: count * WordSize, length: reader.dataLength });\n        }\n        let coders = [];\n        for (let i = 0; i < count; i++) {\n            coders.push(new AnonymousCoder(this.coder));\n        }\n        return unpack(reader, coders);\n    }\n}\n//# sourceMappingURL=array.js.map","import { Typed } from \"../typed.js\";\nimport { Coder } from \"./abstract-coder.js\";\n/**\n *  @_ignore\n */\nexport class BooleanCoder extends Coder {\n    constructor(localName) {\n        super(\"bool\", \"bool\", localName, false);\n    }\n    defaultValue() {\n        return false;\n    }\n    encode(writer, _value) {\n        const value = Typed.dereference(_value, \"bool\");\n        return writer.writeValue(value ? 1 : 0);\n    }\n    decode(reader) {\n        return !!reader.readValue();\n    }\n}\n//# sourceMappingURL=boolean.js.map","import { getBytesCopy, hexlify } from \"../../utils/index.js\";\nimport { Coder } from \"./abstract-coder.js\";\n/**\n *  @_ignore\n */\nexport class DynamicBytesCoder extends Coder {\n    constructor(type, localName) {\n        super(type, type, localName, true);\n    }\n    defaultValue() {\n        return \"0x\";\n    }\n    encode(writer, value) {\n        value = getBytesCopy(value);\n        let length = writer.writeValue(value.length);\n        length += writer.writeBytes(value);\n        return length;\n    }\n    decode(reader) {\n        return reader.readBytes(reader.readIndex(), true);\n    }\n}\n/**\n *  @_ignore\n */\nexport class BytesCoder extends DynamicBytesCoder {\n    constructor(localName) {\n        super(\"bytes\", localName);\n    }\n    decode(reader) {\n        return hexlify(super.decode(reader));\n    }\n}\n//# sourceMappingURL=bytes.js.map","import { defineProperties, getBytesCopy, hexlify } from \"../../utils/index.js\";\nimport { Typed } from \"../typed.js\";\nimport { Coder } from \"./abstract-coder.js\";\n/**\n *  @_ignore\n */\nexport class FixedBytesCoder extends Coder {\n    size;\n    constructor(size, localName) {\n        let name = \"bytes\" + String(size);\n        super(name, name, localName, false);\n        defineProperties(this, { size }, { size: \"number\" });\n    }\n    defaultValue() {\n        return (\"0x0000000000000000000000000000000000000000000000000000000000000000\").substring(0, 2 + this.size * 2);\n    }\n    encode(writer, _value) {\n        let data = getBytesCopy(Typed.dereference(_value, this.type));\n        if (data.length !== this.size) {\n            this._throwError(\"incorrect data length\", _value);\n        }\n        return writer.writeBytes(data);\n    }\n    decode(reader) {\n        return hexlify(reader.readBytes(this.size));\n    }\n}\n//# sourceMappingURL=fixed-bytes.js.map","import { Coder } from \"./abstract-coder.js\";\nconst Empty = new Uint8Array([]);\n/**\n *  @_ignore\n */\nexport class NullCoder extends Coder {\n    constructor(localName) {\n        super(\"null\", \"\", localName, false);\n    }\n    defaultValue() {\n        return null;\n    }\n    encode(writer, value) {\n        if (value != null) {\n            this._throwError(\"not null\", value);\n        }\n        return writer.writeBytes(Empty);\n    }\n    decode(reader) {\n        reader.readBytes(0);\n        return null;\n    }\n}\n//# sourceMappingURL=null.js.map","import { defineProperties, fromTwos, getBigInt, mask, toTwos } from \"../../utils/index.js\";\nimport { Typed } from \"../typed.js\";\nimport { Coder, WordSize } from \"./abstract-coder.js\";\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_MAX_UINT256 = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n/**\n *  @_ignore\n */\nexport class NumberCoder extends Coder {\n    size;\n    signed;\n    constructor(size, signed, localName) {\n        const name = ((signed ? \"int\" : \"uint\") + (size * 8));\n        super(name, name, localName, false);\n        defineProperties(this, { size, signed }, { size: \"number\", signed: \"boolean\" });\n    }\n    defaultValue() {\n        return 0;\n    }\n    encode(writer, _value) {\n        let value = getBigInt(Typed.dereference(_value, this.type));\n        // Check bounds are safe for encoding\n        let maxUintValue = mask(BN_MAX_UINT256, WordSize * 8);\n        if (this.signed) {\n            let bounds = mask(maxUintValue, (this.size * 8) - 1);\n            if (value > bounds || value < -(bounds + BN_1)) {\n                this._throwError(\"value out-of-bounds\", _value);\n            }\n            value = toTwos(value, 8 * WordSize);\n        }\n        else if (value < BN_0 || value > mask(maxUintValue, this.size * 8)) {\n            this._throwError(\"value out-of-bounds\", _value);\n        }\n        return writer.writeValue(value);\n    }\n    decode(reader) {\n        let value = mask(reader.readValue(), this.size * 8);\n        if (this.signed) {\n            value = fromTwos(value, this.size * 8);\n        }\n        return value;\n    }\n}\n//# sourceMappingURL=number.js.map","import { toUtf8Bytes, toUtf8String } from \"../../utils/utf8.js\";\nimport { Typed } from \"../typed.js\";\nimport { DynamicBytesCoder } from \"./bytes.js\";\n/**\n *  @_ignore\n */\nexport class StringCoder extends DynamicBytesCoder {\n    constructor(localName) {\n        super(\"string\", localName);\n    }\n    defaultValue() {\n        return \"\";\n    }\n    encode(writer, _value) {\n        return super.encode(writer, toUtf8Bytes(Typed.dereference(_value, \"string\")));\n    }\n    decode(reader) {\n        return toUtf8String(super.decode(reader));\n    }\n}\n//# sourceMappingURL=string.js.map","import { defineProperties } from \"../../utils/properties.js\";\nimport { Typed } from \"../typed.js\";\nimport { Coder } from \"./abstract-coder.js\";\nimport { pack, unpack } from \"./array.js\";\n/**\n *  @_ignore\n */\nexport class TupleCoder extends Coder {\n    coders;\n    constructor(coders, localName) {\n        let dynamic = false;\n        const types = [];\n        coders.forEach((coder) => {\n            if (coder.dynamic) {\n                dynamic = true;\n            }\n            types.push(coder.type);\n        });\n        const type = (\"tuple(\" + types.join(\",\") + \")\");\n        super(\"tuple\", type, localName, dynamic);\n        defineProperties(this, { coders: Object.freeze(coders.slice()) });\n    }\n    defaultValue() {\n        const values = [];\n        this.coders.forEach((coder) => {\n            values.push(coder.defaultValue());\n        });\n        // We only output named properties for uniquely named coders\n        const uniqueNames = this.coders.reduce((accum, coder) => {\n            const name = coder.localName;\n            if (name) {\n                if (!accum[name]) {\n                    accum[name] = 0;\n                }\n                accum[name]++;\n            }\n            return accum;\n        }, {});\n        // Add named values\n        this.coders.forEach((coder, index) => {\n            let name = coder.localName;\n            if (!name || uniqueNames[name] !== 1) {\n                return;\n            }\n            if (name === \"length\") {\n                name = \"_length\";\n            }\n            if (values[name] != null) {\n                return;\n            }\n            values[name] = values[index];\n        });\n        return Object.freeze(values);\n    }\n    encode(writer, _value) {\n        const value = Typed.dereference(_value, \"tuple\");\n        return pack(writer, this.coders, value);\n    }\n    decode(reader) {\n        return unpack(reader, this.coders);\n    }\n}\n//# sourceMappingURL=tuple.js.map","import { keccak256 } from \"../crypto/index.js\";\nimport { toUtf8Bytes } from \"../utils/index.js\";\n/**\n *  A simple hashing function which operates on UTF-8 strings to\n *  compute an 32-byte identifier.\n *\n *  This simply computes the [UTF-8 bytes](toUtf8Bytes) and computes\n *  the [[keccak256]].\n *\n *  @example:\n *    id(\"hello world\")\n *    //_result:\n */\nexport function id(value) {\n    return keccak256(toUtf8Bytes(value));\n}\n//# sourceMappingURL=id.js.map","// created 2023-09-25T01:01:55.148Z\n// compressed base64-encoded blob for include-ens data\n// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js\n// see: https://github.com/adraffy/ens-normalize.js#security\n// SHA-256: 0565ed049b9cf1614bb9e11ba7d8ac6a6fb96c893253d890f7e2b2884b9ded32\nvar COMPRESSED$1 = 'AEEUdwmgDS8BxQKKAP4BOgDjATAAngDUAIMAoABoAOAAagCOAEQAhABMAHIAOwA9ACsANgAmAGIAHgAuACgAJwAXAC0AGgAjAB8ALwAUACkAEgAeAAkAGwARABkAFgA5ACgALQArADcAFQApABAAHgAiABAAGgAeABMAGAUhBe8BFxREN8sF2wC5AK5HAW8ArQkDzQCuhzc3NzcBP68NEfMABQdHBuw5BV8FYAA9MzkI9r4ZBg7QyQAWA9CeOwLNCjcCjqkChuA/lm+RAsXTAoP6ASfnEQDytQFJAjWVCkeXAOsA6godAB/cwdAUE0WlBCN/AQUCQRjFD/MRBjHxDQSJbw0jBzUAswBxme+tnIcAYwabAysG8QAjAEMMmxcDqgPKQyDXCMMxA7kUQwD3NXOrAKmFIAAfBC0D3x4BJQDBGdUFAhEgVD8JnwmQJiNWYUzrg0oAGwAUAB0AFnNcACkAFgBP9h3gPfsDOWDKneY2ChglX1UDYD30ABsAFAAdABZzIGRAnwDD8wAjAEEMzRbDqgMB2sAFYwXqAtCnAsS4AwpUJKRtFHsadUz9AMMVbwLpABM1NJEX0ZkCgYMBEyMAxRVvAukAEzUBUFAtmUwSAy4DBTER33EftQHfSwB5MxJ/AjkWKQLzL8E/cwBB6QH9LQDPDtO9ASNriQC5DQANAwCK21EFI91zHwCoL9kBqQcHBwcHKzUDowBvAQohPvU3fAQgHwCyAc8CKQMA5zMSezr7ULgFmDp/LzVQBgEGAi8FYQVgt8AFcTtlQhpCWEmfe5tmZ6IAExsDzQ8t+X8rBKtTAltbAn0jsy8Bl6utPWMDTR8Ei2kRANkDBrNHNysDBzECQWUAcwFpJ3kAiyUhAJ0BUb8AL3EfAbfNAz81KUsFWwF3YQZtAm0A+VEfAzEJDQBRSQCzAQBlAHsAM70GD/v3IZWHBwARKQAxALsjTwHZAeMPEzmXgIHwABIAGQA8AEUAQDt3gdvIEGcQZAkGTRFMdEIVEwK0D64L7REdDNkq09PgADSxB/MDWwfzA1sDWwfzB/MDWwfzA1sDWwNbA1scEvAi28gQZw9QBHUFlgWTBN4IiyZREYkHMAjaVBV0JhxPA00BBCMtSSQ7mzMTJUpMFE0LCAQ2SmyvfUADTzGzVP2QqgPTMlc5dAkGHnkSqAAyD3skNb1OhnpPcagKU0+2tYdJak5vAsY6sEAACikJm2/Dd1YGRRAfJ6kQ+ww3AbkBPw3xS9wE9QY/BM0fgRkdD9GVoAipLeEM8SbnLqWAXiP5KocF8Uv4POELUVFsD10LaQnnOmeBUgMlAREijwrhDT0IcRD3Cs1vDekRSQc9A9lJngCpBwULFR05FbkmFGKwCw05ewb/GvoLkyazEy17AAXXGiUGUQEtGwMA0y7rhbRaNVwgT2MGBwspI8sUrFAkDSlAu3hMGh8HGSWtApVDdEqLUToelyH6PEENai4XUYAH+TwJGVMLhTyiRq9FEhHWPpE9TCJNTDAEOYMsMyePCdMPiQy9fHYBXQklCbUMdRM1ERs3yQg9Bx0xlygnGQglRplgngT7owP3E9UDDwVDCUUHFwO5HDETMhUtBRGBKNsC9zbZLrcCk1aEARsFzw8pH+MQVEfkDu0InwJpA4cl7wAxFSUAGyKfCEdnAGOP3FMJLs8Iy2pwI3gDaxTrZRF3B5UOWwerHDcVwxzlcMxeD4YMKKezCV8BeQmdAWME5wgNNV+MpCBFZ1eLXBifIGVBQ14AAjUMaRWjRMGHfAKPD28SHwE5AXcHPQ0FAnsR8RFvEJkI74YINbkz/DopBFMhhyAVCisDU2zSCysm/Qz8bQGnEmYDEDRBd/Jnr2C6KBgBBx0yyUFkIfULlk/RDKAaxRhGVDIZ6AfDA/ca9yfuQVsGAwOnBxc6UTPyBMELbQiPCUMATQ6nGwfbGG4KdYzUATWPAbudA1uVhwJzkwY7Bw8Aaw+LBX3pACECqwinAAkA0wNbAD0CsQehAB0AiUUBQQMrMwEl6QKTA5cINc8BmTMB9y0EH8cMGQD7O25OAsO1AoBuZqYF4VwCkgJNOQFRKQQJUktVA7N15QDfAE8GF+NLARmvTs8e50cB43MvAMsA/wAJOQcJRQHRAfdxALsBYws1Caa3uQFR7S0AhwAZbwHbAo0A4QA5AIP1AVcAUQVd/QXXAlNNARU1HC9bZQG/AyMBNwERAH0Gz5GpzQsjBHEH1wIQHxXlAu8yB7kFAyLjE9FCyQK94lkAMhoKPAqrCqpgX2Q3CjV2PVQAEh+sPss/UgVVO1c7XDtXO1w7VztcO1c7XDtXO1wDm8Pmw+YKcF9JYe8Mqg3YRMw6TRPfYFVgNhPMLbsUxRXSJVoZQRrAJwkl6FUNDwgt12Y0CDA0eRfAAEMpbINFY4oeNApPHOtTlVT8LR8AtUumM7MNsBsZREQFS3XxYi4WEgomAmSFAmJGX1GzAV83JAKh+wJonAJmDQKfiDgfDwJmPwJmKgRyBIMDfxcDfpY5Cjl7GzmGOicnAmwhAjI6OA4CbcsCbbLzjgM3a0kvAWsA4gDlAE4JB5wMkQECD8YAEbkCdzMCdqZDAnlPRwJ4viFg30WyRvcCfEMCeswCfQ0CfPRIBEiBZygALxlJXEpfGRtK0ALRBQLQ0EsrA4hTA4fqRMmRNgLypV0HAwOyS9JMMSkH001QTbMCi0MCitzFHwshR2sJuwKOOwKOYESbhQKO3QKOYHxRuFM5AQ5S2FSJApP/ApMQAO0AIFUiVbNV1AosHymZijLleGpFPz0Cl6MC77ZYJawAXSkClpMCloCgAK1ZsFoNhVEAPwKWuQKWUlxIXNUCmc8CmWhczl0LHQKcnznGOqECnBoCn58CnryOACETNS4TAp31Ap6WALlBYThh8wKe1wKgcgGtAp6jIwKeUqljzGQrKS8CJ7MCJoICoP8CoFDbAqYzAqXSAqgDAIECp/ZogGi1AAdNaiBq1QKs5wKssgKtawKtBgJXIQJV4AKx5dsDH1JsmwKywRECsuwbbORtZ21MYwMl0QK2YD9DbpQDKUkCuGICuUsZArkue3A6cOUCvR0DLbYDMhUCvoxyBgMzdQK+HnMmc1MCw88CwwhzhnRPOUl05AM8qwEDPJ4DPcMCxYACxksCxhSNAshtVQLISALJUwLJMgJkoQLd1nh9ZXiyeSlL1AMYp2cGAmH4GfeVKHsPXpZevxUCz28Cz3AzT1fW9xejAMqxAs93AS3uA04Wfk8JAtwrAtuOAtJTA1JgA1NjAQUDVZCAjUMEzxrxZEl5A4LSg5EC2ssC2eKEFIRNp0ADhqkAMwNkEoZ1Xf0AWQLfaQLevHd7AuIz7RgB8zQrAfSfAfLWiwLr9wLpdH0DAur9AuroAP1LAb0C7o0C66CWrpcHAu5DA4XkmH1w5HGlAvMHAG0DjhqZlwL3FwORcgOSiwL3nAL53QL4apogmq+/O5siA52HAv7+AR8APZ8gAZ+3AwWRA6ZuA6bdANXJAwZuoYyiCQ0DDE0BEwEjB3EGZb1rCQC/BG/DFY8etxEAG3k9ACcDNxJRA42DAWcrJQCM8wAlAOanC6OVCLsGI6fJBgCvBRnDBvElRUYFFoAFcD9GSDNCKUK8X3kZX8QAls0FOgCQVCGbwTsuYDoZutcONxjOGJHJ/gVfBWAFXwVgBWsFYAVfBWAFXwVgBV8FYAVfBWBOHQjfjW8KCgoKbF7xMwTRA7kGN8PDAMMEr8MA70gxFroFTj5xPnhCR0K+X30/X/AAWBkzswCNBsxzzASm70aCRS4rDDMeLz49fnXfcsH5GcoscQFz13Y4HwVnBXLJycnACNdRYwgICAqEXoWTxgA7P4kACxbZBu21Kw0AjMsTAwkVAOVtJUUsJ1JCuULESUArXy9gPi9AKwnJRQYKTD9LPoA+iT54PnkCkULEUUpDX9NWV3JVEjQAc1w3A3IBE3YnX+g7QiMJb6MKaiszRCUuQrNCxDPMCcwEX9EWJzYREBEEBwIHKn6l33JCNVIfybPJtAltydPUCmhBZw/tEKsZAJOVJU1CLRuxbUHOQAo7P0s+eEJHHA8SJVRPdGM0NVrpvBoKhfUlM0JHHGUQUhEWO1xLSj8MO0ucNAqJIzVCRxv9EFsqKyA4OQgNj2nwZgp5ZNFgE2A1K3YHS2AhQQojJmC7DgpzGG1WYFUZCQYHZO9gHWCdYIVgu2BTYJlwFh8GvRbcXbG8YgtDHrMBwzPVyQonHQgkCyYBgQJ0Ajc4nVqIAwGSCsBPIgDsK3SWEtIVBa5N8gGjAo+kVwVIZwD/AEUSCDweX4ITrRQsJ8K3TwBXFDwEAB0TvzVcAtoTS20RIwDgVgZ9BBImYgA5AL4Coi8LFnezOkCnIQFjAY4KBAPh9RcGsgZSBsEAJctdsWIRu2kTkQstRw7DAcMBKgpPBGIGMDAwKCYnKTQaLg4AKRSVAFwCdl+YUZ0JdicFD3lPAdt1F9ZZKCGxuE3yBxkFVGcA/wBFEgiCBwAOLHQSjxOtQDg1z7deFRMAZ8QTAGtKb1ApIiPHADkAvgKiLy1DFtYCmBiDAlDDWNB0eo7fpaMO/aEVRRv0ATEQZBIODyMEAc8JQhCbDRgzFD4TAEMAu9YBCgCsAOkAm5I3ABwAYxvONnR+MhXJAxgKQyxL2+kkJhMbhQKDBMkSsvF0AD9BNQ6uQC7WqSQHwxEAEEIu1hkhAH2z4iQPwyJPHNWpdyYBRSpnJALzoBAEVPPsH20MxA0CCEQKRgAFyAtFAlMNwwjEDUQJRArELtapMg7DDZgJIw+TGukEIwvDFkMAqAtDEMMMBhioe+QAO3MMRAACrgnEBSPY9Q0FDnbSBoMAB8MSYxkSxAEJAPIJAAB8FWMOFtMc/HcXwxhDAC7DAvOowwAewwJdKDKHAAHDAALrFUQVwwAbwyvzpWMWv8wA/ABpAy++bcYDUKPD0KhDCwKmJ1MAAmMA5+UZwxAagwipBRL/eADfw6fDGOMCGsOjk3l6BwOpo4sAEsMOGxMAA5sAbcMOAAvDp0MJGkMDwgipnNIPAwfIqUMGAOGDAAPzABXDAAcDAAnDAGmTABrDAA7DChjDjnEWAwABYwAOcwAuUyYABsMAF8MIKQANUgC6wy4AA8MADqMq8wCyYgAcIwAB8wqpAAXOCx0V4wAHowBCwwEKAGnDAAuDAB3DAAjDCakABdIAbqcZ3QCZCCkABdIAAAFDAAfjAB2jCCkABqIACYMAGzMAbSMA5sOIAAhjAAhDABTDBAkpAAbSAOOTAAlDC6kOzPtnAAdDAG6kQFAATwAKwwwAA0MACbUDPwAHIwAZgwACE6cDAAojAApDAAoDp/MGwwAJIwADEwAQQwgAFEMAEXMAD5MADfMADcMAGRMOFiMAFUMAbqMWuwHDAMIAE0MLAGkzEgDhUwACQwAEWgAXgwUjAAbYABjDBSYBgzBaAEFNALcQBxUMegAwMngBrA0IZgJ0KxQHBREPd1N0ZzKRJwaIHAZqNT4DqQq8BwngAB4DAwt2AX56T1ocKQNXAh1GATQGC3tOxYNagkgAMQA5CQADAQEAWxLjAIOYNAEzAH7tFRk6TglSAF8NAAlYAQ+S1ACAQwQorQBiAN4dAJ1wPyeTANVzuQDX3AIeEMp9eyMgXiUAEdkBkJizKltbVVAaRMqRAAEAhyQ/SDEz6BmfVwB6ATEsOClKIRcDOF0E/832AFNt5AByAnkCRxGCOs94NjXdAwINGBonDBwPALW2AwICAgAAAAAAAAYDBQMDARrUAwAtAAAAAgEGBgYGBgYFBQUFBQUEBQYHCAkEBQUFBQQAAAICAAAAIgCNAJAAlT0A6gC7ANwApEQAwgCyAK0AqADuAKYA2gCjAOcBCAEDAMcAgQBiANIA1AEDAN4A8gCQAKkBMQDqAN8A3AsBCQ8yO9ra2tq8xuLT1tRJOB0BUgFcNU0BWgFpAWgBWwFMUUlLbhMBUxsNEAs6PhMOACcUKy0vMj5AQENDQ0RFFEYGJFdXV1dZWVhZL1pbXVxcI2NnZ2ZoZypsbnZ1eHh4eHh4enp6enp6enp6enp8fH18e2IARPIASQCaAHgAMgBm+ACOAFcAVwA3AnbvAIsABfj4AGQAk/IAnwBPAGIAZP//sACFAIUAaQBWALEAJAC2AIMCQAJDAPwA5wD+AP4A6AD/AOkA6QDoAOYALwJ7AVEBQAE+AVQBPgE+AT4BOQE4ATgBOAEcAVgXADEQCAEAUx8SHgsdHhYAjgCWAKYAUQBqIAIxAHYAbwCXAxUDJzIDIUlGTzEAkQJPAMcCVwKkAMAClgKWApYClgKWApYCiwKWApYClgKWApYClgKVApUCmAKgApcClgKWApQClAKUApQCkgKVAnUB1AKXAp8ClgKWApUeAIETBQD+DQOfAmECOh8BVBg9AuIZEjMbAU4/G1WZAXusRAFpYQEFA0FPAQYAmTEeIJdyADFoAHEANgCRA5zMk/C2jGINwjMWygIZCaXdfDILBCs5dAE7YnQBugDlhoiHhoiGiYqKhouOjIaNkI6Ij4qQipGGkoaThpSSlYaWhpeKmIaZhpqGm4aci52QnoqfhuIC4XTpAt90AIp0LHSoAIsAdHQEQwRABEIERQRDBEkERgRBBEcESQRIBEQERgRJAJ5udACrA490ALxuAQ10ANFZdHQA13QCFHQA/mJ0AP4BIQD+APwA/AD9APwDhGZ03ASMK23HAP4A/AD8AP0A/CR0dACRYnQA/gCRASEA/gCRAvQA/gCRA4RmdNwEjCttxyR0AP9idAEhAP4A/gD8APwA/QD8AP8A/AD8AP0A/AOEZnTcBIwrbcckdHQAkWJ0ASEA/gCRAP4AkQL0AP4AkQOEZnTcBIwrbcckdAJLAT50AlIBQXQCU8l0dAJfdHQDpgL0A6YDpgOnA6cDpwOnA4RmdNwEjCttxyR0dACRYnQBIQOmAJEDpgCRAvQDpgCRA4RmdNwEjCttxyR0BDh0AJEEOQCRDpU5dSgCADR03gV2CwArdAEFAM5iCnR0AF1iAAYcOgp0dACRCnQAXAEIwWZ0CnRmdHQAkWZ0CnRmdEXgAFF03gp0dEY0tlT2u3SOAQTwscwhjZZKrhYcBSfFp9XNbKiVDOD2b+cpe4/Z17mQnbtzzhaeQtE2GGj0IDNTjRUSyTxxw/RPHW/+vS7d1NfRt9z9QPZg4X7QFfhCnkvgNPIItOsC2eV6hPannZNHlZ9xrwZXIMOlu3jSoQSq78WEjwLjw1ELSlF1aBvfzwk5ZX7AUvQzjPQKbDuQ+sm4wNOp4A6AdVuRS0t1y/DZpg4R6m7FNjM9HgvW7Bi88zaMjOo6lM8wtBBdj8LP4ylv3zCXPhebMKJc066o9sF71oFW/8JXu86HJbwDID5lzw5GWLR/LhT0Qqnp2JQxNZNfcbLIzPy+YypqRm/lBmGmex+82+PisxUumSeJkALIT6rJezxMH+CTJmQtt5uwTVbL3ptmjDUQzlSIvWi8Tl7ng1NpuRn1Ng4n14Qc+3Iil7OwkvNWogLSPkn3pihIFytyIGmMhOe3n1tWsuMy9BdKyqF4Z3v2SgggTL9KVvMXPnCbRe+oOuFFP3HejBG/w9gvmfNYvg6JuWia2lcSSN1uIjBktzoIazOHPJZ7kKHPz8mRWVdW3lA8WGF9dQF6Bm673boov3BUWDU2JNcahR23GtfHKLOz/viZ+rYnZFaIznXO67CYEJ1fXuTRpZhYZkKe54xeoagkNGLs+NTZHE0rX45/XvQ2RGADX6vcAvdxIUBV27wxGm2zjZo4X3ILgAlrOFheuZ6wtsvaIj4yLY7qqawlliaIcrz2G+c3vscAnCkCuMzMmZvMfu9lLwTvfX+3cVSyPdN9ZwgDZhfjRgNJcLiJ67b9xx8JHswprbiE3v9UphotAPIgnXVIN5KmMc0piXhc6cChPnN+MRhG9adtdttQTTwSIpl8I4/j//d3sz1326qTBTpPRM/Hgh3kzqEXs8ZAk4ErQhNO8hzrQ0DLkWMA/N+91tn2MdOJnWC2FCZehkQrwzwbKOjhvZsbM95QoeL9skYyMf4srVPVJSgg7pOLUtr/n9eT99oe9nLtFRpjA9okV2Kj8h9k5HaC0oivRD8VyXkJ81tcd4fHNXPCfloIQasxsuO18/46dR2jgul/UIet2G0kRvnyONMKhHs6J26FEoqSqd+rfYjeEGwHWVDpX1fh1jBBcKGMqRepju9Y00mDVHC+Xdij/j44rKfvfjGinNs1jO/0F3jB83XCDINN/HB84axlP+3E/klktRo+vl3U/aiyMJbIodE1XSsDn6UAzIoMtUObY2+k/4gY/l+AkZJ5Sj2vQrkyLm3FoxjhDX+31UXBFf9XrAH31fFqoBmDEZvhvvpnZ87N+oZEu7U9O/nnk+QWj3x8uyoRbEnf+O5UMr9i0nHP38IF5AvzrBW8YWBUR0mIAzIvndQq9N3v/Jto3aPjPXUPl8ASdPPyAp7jENf8bk7VMM9ol9XGmlBmeDMuGqt+WzuL6CXAxXjIhCPM5vACchgMJ/8XBGLO/D1isVvGhwwHHr1DLaI5mn2Jr/b1pUD90uciDaS8cXNDzCWvNmT/PhQe5e8nTnnnkt8Ds/SIjibcum/fqDhKopxAY8AkSrPn+IGDEKOO+U3XOP6djFs2H5N9+orhOahiQk5KnEUWa+CzkVzhp8bMHRbg81qhjjXuIKbHjSLSIBKWqockGtKinY+z4/RdBUF6pcc3JmnlxVcNgrI4SEzKUZSwcD2QCyxzKve+gAmg6ZuSRkpPFa6mfThu7LJNu3H5K42uCpNvPAsoedolKV/LHe/eJ+BbaG5MG0NaSGVPRUmNFMFFSSpXEcXwbVh7UETOZZtoVNRGOIbbkig3McEtR68cG0RZAoJevWYo7Dg/lZ1CQzblWeUvVHmr8fY4Nqd9JJiH/zEX24mJviH60fAyFr0A3c4bC1j3yZU60VgJxXn8JgJXLUIsiBnmKmMYz+7yBQFBvqb2eYnuW59joZBf56/wXvWIR4R8wTmV80i1mZy+S4+BUES+hzjk0uXpC///z/IlqHZ1monzlXp8aCfhGKMti73FI1KbL1q6IKO4fuBuZ59gagjn5xU79muMpHXg6S+e+gDM/U9BKLHbl9l6o8czQKl4RUkJJiqftQG2i3BMg/TQlUYFkJDYBOOvAugYuzYSDnZbDDd/aSd9x0Oe6F+bJcHfl9+gp6L5/TgA+BdFFovbfCrQ40s5vMPw8866pNX8zyFGeFWdxIpPVp9Rg1UPOVFbFZrvaFq/YAzHQgqMWpahMYfqHpmwXfHL1/kpYmGuHFwT55mQu0dylfNuq2Oq0hTMCPwqfxnuBIPLXfci4Y1ANy+1CUipQxld/izVh16WyG2Q0CQQ9NqtAnx1HCHwDj7sYxOSB0wopZSnOzxQOcExmxrVTF2BkOthVpGfuhaGECfCJpJKpjnihY+xOT2QJxN61+9K6QSqtv2Shr82I3jgJrqBg0wELFZPjvHpvzTtaJnLK6Vb97Yn933koO/saN7fsjwNKzp4l2lJVx2orjCGzC/4ZL4zCver6aQYtC5sdoychuFE6ufOiog+VWi5UDkbmvmtah/3aArEBIi39s5ILUnlFLgilcGuz9CQshEY7fw2ouoILAYPVT/gyAIq3TFAIwVsl+ktkRz/qGfnCDGrm5gsl/l9QdvCWGsjPz3dU7XuqKfdUrr/6XIgjp4rey6AJBmCmUJMjITHVdFb5m1p+dLMCL8t55zD42cmftmLEJC0Da04YiRCVUBLLa8D071/N5UBNBXDh0LFsmhV/5B5ExOB4j3WVG/S3lfK5o+V6ELHvy6RR9n4ac+VsK4VE4yphPvV+kG9FegTBH4ZRXL2HytUHCduJazB/KykjfetYxOXTLws267aGOd+I+JhKP//+VnXmS90OD/jvLcVu0asyqcuYN1mSb6XTlCkqv1vigZPIYwNF/zpWcT1GR/6aEIRjkh0yhg4LXJfaGobYJTY4JI58KiAKgmmgAKWdl5nYCeLqavRJGQNuYuZtZFGx+IkI4w4NS2xwbetNMunOjBu/hmKCI/w7tfiiyUd//4rbTeWt4izBY8YvGIN6vyKYmP/8X8wHKCeN+WRcKM70+tXKNGyevU9H2Dg5BsljnTf8YbsJ1TmMs74Ce2XlHisleguhyeg44rQOHZuw/6HTkhnnurK2d62q6yS7210SsAIaR+jXMQA+svkrLpsUY+F30Uw89uOdGAR6vo4FIME0EfVVeHTu6eKicfhSqOeXJhbftcd08sWEnNUL1C9fnprTgd83IMut8onVUF0hvqzZfHduPjbjwEXIcoYmy+P6tcJZHmeOv6VrvEdkHDJecjHuHeWANe79VG662qTjA/HCvumVv3qL+LrOcpqGps2ZGwQdFJ7PU4iuyRlBrwfO+xnPyr47s2cXVbWzAyznDiBGjCM3ksxjjqM62GE9C8f5U38kB3VjtabKp/nRdvMESPGDG90bWRLAt1Qk5DyLuazRR1YzdC1c+hZXvAWV8xA72S4A8B67vjVhbba3MMop293FeEXpe7zItMWrJG/LOH9ByOXmYnNJfjmfuX9KbrpgLOba4nZ+fl8Gbdv/ihv+6wFGKHCYrVwmhFC0J3V2bn2tIB1wCc1CST3d3X2OyxhguXcs4sm679UngzofuSeBewMFJboIQHbUh/m2JhW2hG9DIvG2t7yZIzKBTz9wBtnNC+2pCRYhSIuQ1j8xsz5VvqnyUIthvuoyyu7fNIrg/KQUVmGQaqkqZk/Vx5b33/gsEs8yX7SC1J+NV4icz6bvIE7C5G6McBaI8rVg56q5QBJWxn/87Q1sPK4+sQa8fLU5gXo4paaq4cOcQ4wR0VBHPGjKh+UlPCbA1nLXyEUX45qZ8J7/Ln4FPJE2TdzD0Z8MLSNQiykMMmSyOCiFfy84Rq60emYB2vD09KjYwsoIpeDcBDTElBbXxND72yhd9pC/1CMid/5HUMvAL27OtcIJDzNKpRPNqPOpyt2aPGz9QWIs9hQ9LiX5s8m9hjTUu/f7MyIatjjd+tSfQ3ufZxPpmJhTaBtZtKLUcfOCUqADuO+QoH8B9v6U+P0HV1GLQmtoNFTb3s74ivZgjES0qfK+8RdGgBbcCMSy8eBvh98+et1KIFqSe1KQPyXULBMTsIYnysIwiZBJYdI20vseV+wuJkcqGemehKjaAb9L57xZm3g2zX0bZ2xk/fU+bCo7TlnbW7JuF1YdURo/2Gw7VclDG1W7LOtas2LX4upifZ/23rzpsnY/ALfRgrcWP5hYmV9VxVOQA1fZvp9F2UNU+7d7xRyVm5wiLp3/0dlV7vdw1PMiZrbDAYzIVqEjRY2YU03sJhPnlwIPcZUG5ltL6S8XCxU1eYS5cjr34veBmXAvy7yN4ZjArIG0dfD/5UpBNlX1ZPoxJOwyqRi3wQWtOzd4oNKh0LkoTm8cwqgIfKhqqGOhwo71I+zXnMemTv2B2AUzABWyFztGgGULjDDzWYwJUVBTjKCn5K2QGMK1CQT7SzziOjo+BhAmqBjzuc3xYym2eedGeOIRJVyTwDw37iCMe4g5Vbnsb5ZBdxOAnMT7HU4DHpxWGuQ7GeiY30Cpbvzss55+5Km1YsbD5ea3NI9QNYIXol5apgSu9dZ8f8xS5dtHpido5BclDuLWY4lhik0tbJa07yJhH0BOyEut/GRbYTS6RfiTYWGMCkNpfSHi7HvdiTglEVHKZXaVhezH4kkXiIvKopYAlPusftpE4a5IZwvw1x/eLvoDIh/zpo9FiQInsTb2SAkKHV42XYBjpJDg4374XiVb3ws4qM0s9eSQ5HzsMU4OZJKuopFjBM+dAZEl8RUMx5uU2N486Kr141tVsGQfGjORYMCJAMsxELeNT4RmWjRcpdTGBwcx6XN9drWqPmJzcrGrH4+DRc7+n1w3kPZwu0BkNr6hQrqgo7JTB9A5kdJ/H7P4cWBMwsmuixAzJB3yrQpnGIq90lxAXLzDCdn1LPibsRt7rHNjgQBklRgPZ8vTbjXdgXrTWQsK5MdrXXQVPp0Rinq3frzZKJ0qD6Qhc40VzAraUXlob1gvkhK3vpmHgI6FRlQZNx6eRqkp0zy4AQlX813fAPtL3jMRaitGFFjo0zmErloC+h+YYdVQ6k4F/epxAoF0BmqEoKNTt6j4vQZNQ2BoqF9Vj53TOIoNmDiu9Xp15RkIgQIGcoLpfoIbenzpGUAtqFJp5W+LLnx38jHeECTJ/navKY1NWfN0sY1T8/pB8kIH3DU3DX+u6W3YwpypBMYOhbSxGjq84RZ84fWJow8pyHqn4S/9J15EcCMsXqrfwyd9mhiu3+rEo9pPpoJkdZqHjra4NvzFwuThNKy6hao/SlLw3ZADUcUp3w3SRVfW2rhl80zOgTYnKE0Hs2qp1J6H3xqPqIkvUDRMFDYyRbsFI3M9MEyovPk8rlw7/0a81cDVLmBsR2ze2pBuKb23fbeZC0uXoIvDppfTwIDxk1Oq2dGesGc+oJXWJLGkOha3CX+DUnzgAp9HGH9RsPZN63Hn4RMA5eSVhPHO+9RcRb/IOgtW31V1Q5IPGtoxPjC+MEJbVlIMYADd9aHYWUIQKopuPOHmoqSkubnAKnzgKHqgIOfW5RdAgotN6BN+O2ZYHkuemLnvQ8U9THVrS1RtLmKbcC7PeeDsYznvqzeg6VCNwmr0Yyx1wnLjyT84BZz3EJyCptD3yeueAyDWIs0L2qs/VQ3HUyqfrja0V1LdDzqAikeWuV4sc7RLIB69jEIBjCkyZedoUHqCrOvShVzyd73OdrJW0hPOuQv2qOoHDc9xVb6Yu6uq3Xqp2ZaH46A7lzevbxQEmfrzvAYSJuZ4WDk1Hz3QX1LVdiUK0EvlAGAYlG3Md30r7dcPN63yqBCIj25prpvZP0nI4+EgWoFG95V596CurXpKRBGRjQlHCvy5Ib/iW8nZJWwrET3mgd6mEhfP4KCuaLjopWs7h+MdXFdIv8dHQJgg1xi1eYqB0uDYjxwVmri0Sv5XKut/onqapC+FQiC2C1lvYJ9MVco6yDYsS3AANUfMtvtbYI2hfwZatiSsnoUeMZd34GVjkMMKA+XnjJpXgRW2SHTZplVowPmJsvXy6w3cfO1AK2dvtZEKTkC/TY9LFiKHCG0DnrMQdGm2lzlBHM9iEYynH2UcVMhUEjsc0oDBTgo2ZSQ1gzkAHeWeBXYFjYLuuf8yzTCy7/RFR81WDjXMbq2BOH5dURnxo6oivmxL3cKzKInlZkD31nvpHB9Kk7GfcfE1t+1V64b9LtgeJGlpRFxQCAqWJ5DoY77ski8gsOEOr2uywZaoO/NGa0X0y1pNQHBi3b2SUGNpcZxDT7rLbBf1FSnQ8guxGW3W+36BW0gBje4DOz6Ba6SVk0xiKgt+q2JOFyr4SYfnu+Ic1QZYIuwHBrgzr6UvOcSCzPTOo7D6IC4ISeS7zkl4h+2VoeHpnG/uWR3+ysNgPcOIXQbv0n4mr3BwQcdKJxgPSeyuP/z1Jjg4e9nUvoXegqQVIE30EHx5GHv+FAVUNTowYDJgyFhf5IvlYmEqRif6+WN1MkEJmDcQITx9FX23a4mxy1AQRsOHO/+eImX9l8EMJI3oPWzVXxSOeHU1dUWYr2uAA7AMb+vAEZSbU3qob9ibCyXeypEMpZ6863o6QPqlqGHZkuWABSTVNd4cOh9hv3qEpSx2Zy/DJMP6cItEmiBJ5PFqQnDEIt3NrA3COlOSgz43D7gpNFNJ5MBh4oFzhDPiglC2ypsNU4ISywY2erkyb1NC3Qh/IfWj0eDgZI4/ln8WPfBsT3meTjq1Uqt1E7Zl/qftqkx6aM9KueMCekSnMrcHj1CqTWWzEzPsZGcDe3Ue4Ws+XFYVxNbOFF8ezkvQGR6ZOtOLU2lQEnMBStx47vE6Pb7AYMBRj2OOfZXfisjJnpTfSNjo6sZ6qSvNxZNmDeS7Gk3yYyCk1HtKN2UnhMIjOXUzAqDv90lx9O/q/AT1ZMnit5XQe9wmQxnE/WSH0CqZ9/2Hy+Sfmpeg8RwsHI5Z8kC8H293m/LHVVM/BA7HaTJYg5Enk7M/xWpq0192ACfBai2LA/qrCjCr6Dh1BIMzMXINBmX96MJ5Hn2nxln/RXPFhwHxUmSV0EV2V0jm86/dxxuYSU1W7sVkEbN9EzkG0QFwPhyHKyb3t+Fj5WoUUTErcazE/N6EW6Lvp0d//SDPj7EV9UdJN+Amnf3Wwk3A0SlJ9Z00yvXZ7n3z70G47Hfsow8Wq1JXcfwnA+Yxa5mFsgV464KKP4T31wqIgzFPd3eCe3j5ory5fBF2hgCFyVFrLzI9eetNXvM7oQqyFgDo4CTp/hDV9NMX9JDHQ/nyHTLvZLNLF6ftn2OxjGm8+PqOwhxnPHWipkE/8wbtyri80Sr7pMNkQGMfo4ZYK9OcCC4ESVFFbLMIvlxSoRqWie0wxqnLfcLSXMSpMMQEJYDVObYsXIQNv4TGNwjq1kvT1UOkicTrG3IaBZ3XdScS3u8sgeZPVpOLkbiF940FjbCeNRINNvDbd01EPBrTCPpm12m43ze1bBB59Ia6Ovhnur/Nvx3IxwSWol+3H2qfCJR8df6aQf4v6WiONxkK+IqT4pKQrZK/LplgDI/PJZbOep8dtbV7oCr6CgfpWa8NczOkPx81iSHbsNhVSJBOtrLIMrL31LK9TqHqAbAHe0RLmmV806kRLDLNEhUEJfm9u0sxpkL93Zgd6rw+tqBfTMi59xqXHLXSHwSbSBl0EK0+loECOPtrl+/nsaFe197di4yUgoe4jKoAJDXc6DGDjrQOoFDWZJ9HXwt8xDrQP+7aRwWKWI1GF8s8O4KzxWBBcwnl3vnl1Oez3oh6Ea1vjR7/z7DDTrFtqU2W/KAEzAuXDNZ7MY73MF216dzdSbWmUp4lcm7keJfWaMHgut9x5C9mj66Z0lJ+yhsjVvyiWrfk1lzPOTdhG15Y7gQlXtacvI7qv/XNSscDwqkgwHT/gUsD5yB7LdRRvJxQGYINn9hTpodKFVSTPrtGvyQw+HlRFXIkodErAGu9Iy1YpfSPc3jkFh5CX3lPxv7aqjE/JAfTIpEjGb/H7MO0e2vsViSW1qa/Lmi4/n4DEI3g7lYrcanspDfEpKkdV1OjSLOy0BCUqVoECaB55vs06rXl4jqmLsPsFM/7vYJ0vrBhDCm/00A/H81l1uekJ/6Lml3Hb9+NKiLqATJmDpyzfYZFHumEjC662L0Bwkxi7E9U4cQA0XMVDuMYAIeLMPgQaMVOd8fmt5SflFIfuBoszeAw7ow5gXPE2Y/yBc/7jExARUf/BxIHQBF5Sn3i61w4z5xJdCyO1F1X3+3ax+JSvMeZ7S6QSKp1Fp/sjYz6Z+VgCZzibGeEoujryfMulH7Rai5kAft9ebcW50DyJr2uo2z97mTWIu45YsSnNSMrrNUuG1XsYBtD9TDYzQffKB87vWbkM4EbPAFgoBV4GQS+vtFDUqOFAoi1nTtmIOvg38N4hT2Sn8r8clmBCXspBlMBYTnrqFJGBT3wZOzAyJDre9dHH7+x7qaaKDOB4UQALD5ecS0DE4obubQEiuJZ0EpBVpLuYcce8Aa4PYd/V4DLDAJBYKQPCWTcrEaZ5HYbJi11Gd6hjGom1ii18VHYnG28NKpkz2UKVPxlhYSp8uZr367iOmoy7zsxehW9wzcy2zG0a80PBMCRQMb32hnaHeOR8fnNDzZhaNYhkOdDsBUZ3loDMa1YP0uS0cjUP3b/6DBlqmZOeNABDsLl5BI5QJups8uxAuWJdkUB/pO6Zax6tsg7fN5mjjDgMGngO+DPcKqiHIDbFIGudxtPTIyDi9SFMKBDcfdGQRv41q1AqmxgkVfJMnP8w/Bc7N9/TR6C7mGObFqFkIEom8sKi2xYqJLTCHK7cxzaZvqODo22c3wisBCP4HeAgcRbNPAsBkNRhSmD48dHupdBRw4mIvtS5oeF6zeT1KMCyhMnmhpkFAGWnGscoNkwvQ8ZM5lE/vgTHFYL99OuNxdFBxTEDd5v2qLR8y9WkXsWgG6kZNndFG+pO/UAkOCipqIhL3hq7cRSdrCq7YhUsTocEcnaFa6nVkhnSeRYUA1YO0z5itF9Sly3VlxYDw239TJJH6f3EUfYO5lb7bcFcz8Bp7Oo8QmnsUHOz/fagVUBtKEw1iT88j+aKkv8cscKNkMxjYr8344D1kFoZ7/td1W6LCNYN594301tUGRmFjAzeRg5vyoM1F6+bJZ/Q54jN/k8SFd3DxPTYaAUsivsBfgTn7Mx8H2SpPt4GOdYRnEJOH6jHM2p6SgB0gzIRq6fHxGMmSmqaPCmlfwxiuloaVIitLGN8wie2CDWhkzLoCJcODh7KIOAqbHEvXdUxaS4TTTs07Clzj/6GmVs9kiZDerMxEnhUB6QQPlcfqkG9882RqHoLiHGBoHfQuXIsAG8GTAtao2KVwRnvvam8jo1e312GQAKWEa4sUVEAMG4G6ckcONDwRcg1e2D3+ohXgY4UAWF8wHKQMrSnzCgfFpsxh+aHXMGtPQroQasRY4U6UdG0rz1Vjbka0MekOGRZQEvqQFlxseFor8zWFgHek3v29+WqN6gaK5gZOTOMZzpQIC1201LkMCXild3vWXSc5UX9xcFYfbRPzGFa1FDcPfPB/jUEq/FeGt419CI3YmBlVoHsa4KdcwQP5ZSwHHhFJ7/Ph/Rap/4vmG91eDwPP0lDfCDRCLszTqfzM71xpmiKi2HwS4WlqvGNwtvwF5Dqpn6KTq8ax00UMPkxDcZrEEEsIvHiUXXEphdb4GB4FymlPwBz4Gperqq5pW7TQ6/yNRhW8VT5NhuP0udlxo4gILq5ZxAZk8ZGh3g4CqxJlPKY7AQxupfUcVpWT5VItp1+30UqoyP4wWsRo3olRRgkWZZ2ZN6VC3OZFeXB8NbnUrSdikNptD1QiGuKkr8EmSR/AK9Rw+FF3s5uwuPbvHGiPeFOViltMK7AUaOsq9+x9cndk3iJEE5LKZRlWJbKOZweROzmPNVPkjE3K/TyA57Rs68TkZ3MR8akKpm7cFjnjPd/DdkWjgYoKHSr5Wu5ssoBYU4acRs5g2DHxUmdq8VXOXRbunD8QN0LhgkssgahcdoYsNvuXGUK/KXD/7oFb+VGdhqIn02veuM5bLudJOc2Ky0GMaG4W/xWBxIJcL7yliJOXOpx0AkBqUgzlDczmLT4iILXDxxtRR1oZa2JWFgiAb43obrJnG/TZC2KSK2wqOzRZTXavZZFMb1f3bXvVaNaK828w9TO610gk8JNf3gMfETzXXsbcvRGCG9JWQZ6+cDPqc4466Yo2RcKH+PILeKOqtnlbInR3MmBeGG3FH10yzkybuqEC2HSQwpA0An7d9+73BkDUTm30bZmoP/RGbgFN+GrCOfADgqr0WbI1a1okpFms8iHYw9hm0zUvlEMivBRxModrbJJ+9/p3jUdQQ9BCtQdxnOGrT5dzRUmw0593/mbRSdBg0nRvRZM5/E16m7ZHmDEtWhwvfdZCZ8J8M12W0yRMszXamWfQTwIZ4ayYktrnscQuWr8idp3PjT2eF/jmtdhIfcpMnb+IfZY2FebW6UY/AK3jP4u3Tu4zE4qlnQgLFbM19EBIsNf7KhjdbqQ/D6yiDb+NlEi2SKD+ivXVUK8ib0oBo366gXkR8ZxGjpJIDcEgZPa9TcYe0TIbiPl/rPUQDu3XBJ9X/GNq3FAUsKsll57DzaGMrjcT+gctp+9MLYXCq+sqP81eVQ0r9lt+gcQfZbACRbEjvlMskztZG8gbC8Qn9tt26Q7y7nDrbZq/LEz7kR6Jc6pg3N9rVX8Y5MJrGlML9p9lU4jbTkKqCveeZUJjHB03m2KRKR2TytoFkTXOLg7keU1s1lrPMQJpoOKLuAAC+y1HlJucU6ysB5hsXhvSPPLq5J7JtnqHKZ4vYjC4Vy8153QY+6780xDuGARsGbOs1WqzH0QS765rnSKEbbKlkO8oI/VDwUd0is13tKpqILu1mDJFNy/iJAWcvDgjxvusIT+PGz3ST/J9r9Mtfd0jpaGeiLYIqXc7DiHSS8TcjFVksi66PEkxW1z6ujbLLUGNNYnzOWpH8BZGK4bCK7iR+MbIv8ncDAz1u4StN3vTTzewr9IQjk9wxFxn+6N1ddKs0vffJiS08N3a4G1SVrlZ97Q/M+8G9fe5AP6d9/Qq4WRnORVhofPIKEdCr3llspUfE0oKIIYoByBRPh+bX1HLS3JWGJRhIvE1aW4NTd8ePi4Z+kXb+Z8snYfSNcqijhAgVsx4RCM54cXUiYkjeBmmC4ajOHrChoELscJJC7+9jjMjw5BagZKlgRMiSNYz7h7vvZIoQqbtQmspc0cUk1G/73iXtSpROl5wtLgQi0mW2Ex8i3WULhcggx6E1LMVHUsdc9GHI1PH3U2Ko0PyGdn9KdVOLm7FPBui0i9a0HpA60MsewVE4z8CAt5d401Gv6zXlIT5Ybit1VIA0FCs7wtvYreru1fUyW3oLAZ/+aTnZrOcYRNVA8spoRtlRoWflsRClFcgzkqiHOrf0/SVw+EpVaFlJ0g4Kxq1MMOmiQdpMNpte8lMMQqm6cIFXlnGbfJllysKDi+0JJMotkqgIxOSQgU9dn/lWkeVf8nUm3iwX2Nl3WDw9i6AUK3vBAbZZrcJpDQ/N64AVwjT07Jef30GSSmtNu2WlW7YoyW2FlWfZFQUwk867EdLYKk9VG6JgEnBiBxkY7LMo4YLQJJlAo9l/oTvJkSARDF/XtyAzM8O2t3eT/iXa6wDN3WewNmQHdPfsxChU/KtLG2Mn8i4ZqKdSlIaBZadxJmRzVS/o4yA65RTSViq60oa395Lqw0pzY4SipwE0SXXsKV+GZraGSkr/RW08wPRvqvSUkYBMA9lPx4m24az+IHmCbXA+0faxTRE9wuGeO06DIXa6QlKJ3puIyiuAVfPr736vzo2pBirS+Vxel3TMm3JKhz9o2ZoRvaFVpIkykb0Hcm4oHFBMcNSNj7/4GJt43ogonY2Vg4nsDQIWxAcorpXACzgBqQPjYsE/VUpXpwNManEru4NwMCFPkXvMoqvoeLN3qyu/N1eWEHttMD65v19l/0kH2mR35iv/FI+yjoHJ9gPMz67af3Mq/BoWXqu3rphiWMXVkmnPSEkpGpUI2h1MThideGFEOK6YZHPwYzMBvpNC7+ZHxPb7epfefGyIB4JzO9DTNEYnDLVVHdQyvOEVefrk6Uv5kTQYVYWWdqrdcIl7yljwwIWdfQ/y+2QB3eR/qxYObuYyB4gTbo2in4PzarU1sO9nETkmj9/AoxDA+JM3GMqQtJR4jtduHtnoCLxd1gQUscHRB/MoRYIEsP2pDZ9KvHgtlk1iTbWWbHhohwFEYX7y51fUV2nuUmnoUcqnWIQAAgl9LTVX+Bc0QGNEhChxHR4YjfE51PUdGfsSFE6ck7BL3/hTf9jLq4G1IafINxOLKeAtO7quulYvH5YOBc+zX7CrMgWnW47/jfRsWnJjYYoE7xMfWV2HN2iyIqLI';\nconst FENCED = new Map([[8217,\"apostrophe\"],[8260,\"fraction slash\"],[12539,\"middle dot\"]]);\nconst NSM_MAX = 4;\n\nfunction decode_arithmetic(bytes) {\r\n\tlet pos = 0;\r\n\tfunction u16() { return (bytes[pos++] << 8) | bytes[pos++]; }\r\n\t\r\n\t// decode the frequency table\r\n\tlet symbol_count = u16();\r\n\tlet total = 1;\r\n\tlet acc = [0, 1]; // first symbol has frequency 1\r\n\tfor (let i = 1; i < symbol_count; i++) {\r\n\t\tacc.push(total += u16());\r\n\t}\r\n\r\n\t// skip the sized-payload that the last 3 symbols index into\r\n\tlet skip = u16();\r\n\tlet pos_payload = pos;\r\n\tpos += skip;\r\n\r\n\tlet read_width = 0;\r\n\tlet read_buffer = 0; \r\n\tfunction read_bit() {\r\n\t\tif (read_width == 0) {\r\n\t\t\t// this will read beyond end of buffer\r\n\t\t\t// but (undefined|0) => zero pad\r\n\t\t\tread_buffer = (read_buffer << 8) | bytes[pos++];\r\n\t\t\tread_width = 8;\r\n\t\t}\r\n\t\treturn (read_buffer >> --read_width) & 1;\r\n\t}\r\n\r\n\tconst N = 31;\r\n\tconst FULL = 2**N;\r\n\tconst HALF = FULL >>> 1;\r\n\tconst QRTR = HALF >> 1;\r\n\tconst MASK = FULL - 1;\r\n\r\n\t// fill register\r\n\tlet register = 0;\r\n\tfor (let i = 0; i < N; i++) register = (register << 1) | read_bit();\r\n\r\n\tlet symbols = [];\r\n\tlet low = 0;\r\n\tlet range = FULL; // treat like a float\r\n\twhile (true) {\r\n\t\tlet value = Math.floor((((register - low + 1) * total) - 1) / range);\r\n\t\tlet start = 0;\r\n\t\tlet end = symbol_count;\r\n\t\twhile (end - start > 1) { // binary search\r\n\t\t\tlet mid = (start + end) >>> 1;\r\n\t\t\tif (value < acc[mid]) {\r\n\t\t\t\tend = mid;\r\n\t\t\t} else {\r\n\t\t\t\tstart = mid;\r\n\t\t\t}\r\n\t\t}\r\n\t\tif (start == 0) break; // first symbol is end mark\r\n\t\tsymbols.push(start);\r\n\t\tlet a = low + Math.floor(range * acc[start]   / total);\r\n\t\tlet b = low + Math.floor(range * acc[start+1] / total) - 1;\r\n\t\twhile (((a ^ b) & HALF) == 0) {\r\n\t\t\tregister = (register << 1) & MASK | read_bit();\r\n\t\t\ta = (a << 1) & MASK;\r\n\t\t\tb = (b << 1) & MASK | 1;\r\n\t\t}\r\n\t\twhile (a & ~b & QRTR) {\r\n\t\t\tregister = (register & HALF) | ((register << 1) & (MASK >>> 1)) | read_bit();\r\n\t\t\ta = (a << 1) ^ HALF;\r\n\t\t\tb = ((b ^ HALF) << 1) | HALF | 1;\r\n\t\t}\r\n\t\tlow = a;\r\n\t\trange = 1 + b - a;\r\n\t}\r\n\tlet offset = symbol_count - 4;\r\n\treturn symbols.map(x => { // index into payload\r\n\t\tswitch (x - offset) {\r\n\t\t\tcase 3: return offset + 0x10100 + ((bytes[pos_payload++] << 16) | (bytes[pos_payload++] << 8) | bytes[pos_payload++]);\r\n\t\t\tcase 2: return offset + 0x100 + ((bytes[pos_payload++] << 8) | bytes[pos_payload++]);\r\n\t\t\tcase 1: return offset + bytes[pos_payload++];\r\n\t\t\tdefault: return x - 1;\r\n\t\t}\r\n\t});\r\n}\t\r\n\r\n// returns an iterator which returns the next symbol\r\nfunction read_payload(v) {\r\n\tlet pos = 0;\r\n\treturn () => v[pos++];\r\n}\r\nfunction read_compressed_payload(s) {\r\n\treturn read_payload(decode_arithmetic(unsafe_atob(s)));\r\n}\r\n\r\n// unsafe in the sense:\r\n// expected well-formed Base64 w/o padding \r\n// 20220922: added for https://github.com/adraffy/ens-normalize.js/issues/4\r\nfunction unsafe_atob(s) {\r\n\tlet lookup = [];\r\n\t[...'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'].forEach((c, i) => lookup[c.charCodeAt(0)] = i);\r\n\tlet n = s.length;\r\n\tlet ret = new Uint8Array((6 * n) >> 3);\r\n\tfor (let i = 0, pos = 0, width = 0, carry = 0; i < n; i++) {\r\n\t\tcarry = (carry << 6) | lookup[s.charCodeAt(i)];\r\n\t\twidth += 6;\r\n\t\tif (width >= 8) {\r\n\t\t\tret[pos++] = (carry >> (width -= 8));\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n// eg. [0,1,2,3...] => [0,-1,1,-2,...]\r\nfunction signed(i) { \r\n\treturn (i & 1) ? (~i >> 1) : (i >> 1);\r\n}\r\n\r\nfunction read_deltas(n, next) {\r\n\tlet v = Array(n);\r\n\tfor (let i = 0, x = 0; i < n; i++) v[i] = x += signed(next());\r\n\treturn v;\r\n}\r\n\r\n// [123][5] => [0 3] [1 1] [0 0]\r\nfunction read_sorted(next, prev = 0) {\r\n\tlet ret = [];\r\n\twhile (true) {\r\n\t\tlet x = next();\r\n\t\tlet n = next();\r\n\t\tif (!n) break;\r\n\t\tprev += x;\r\n\t\tfor (let i = 0; i < n; i++) {\r\n\t\t\tret.push(prev + i);\r\n\t\t}\r\n\t\tprev += n + 1;\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction read_sorted_arrays(next) {\r\n\treturn read_array_while(() => { \r\n\t\tlet v = read_sorted(next);\r\n\t\tif (v.length) return v;\r\n\t});\r\n}\r\n\r\n// returns map of x => ys\r\nfunction read_mapped(next) {\r\n\tlet ret = [];\r\n\twhile (true) {\r\n\t\tlet w = next();\r\n\t\tif (w == 0) break;\r\n\t\tret.push(read_linear_table(w, next));\r\n\t}\r\n\twhile (true) {\r\n\t\tlet w = next() - 1;\r\n\t\tif (w < 0) break;\r\n\t\tret.push(read_replacement_table(w, next));\r\n\t}\r\n\treturn ret.flat();\r\n}\r\n\r\n// read until next is falsy\r\n// return array of read values\r\nfunction read_array_while(next) {\r\n\tlet v = [];\r\n\twhile (true) {\r\n\t\tlet x = next(v.length);\r\n\t\tif (!x) break;\r\n\t\tv.push(x);\r\n\t}\r\n\treturn v;\r\n}\r\n\r\n// read w columns of length n\r\n// return as n rows of length w\r\nfunction read_transposed(n, w, next) {\r\n\tlet m = Array(n).fill().map(() => []);\r\n\tfor (let i = 0; i < w; i++) {\r\n\t\tread_deltas(n, next).forEach((x, j) => m[j].push(x));\r\n\t}\r\n\treturn m;\r\n}\r\n \r\n// returns [[x, ys], [x+dx, ys+dy], [x+2*dx, ys+2*dy], ...]\r\n// where dx/dy = steps, n = run size, w = length of y\r\nfunction read_linear_table(w, next) {\r\n\tlet dx = 1 + next();\r\n\tlet dy = next();\r\n\tlet vN = read_array_while(next);\r\n\tlet m = read_transposed(vN.length, 1+w, next);\r\n\treturn m.flatMap((v, i) => {\r\n\t\tlet [x, ...ys] = v;\r\n\t\treturn Array(vN[i]).fill().map((_, j) => {\r\n\t\t\tlet j_dy = j * dy;\r\n\t\t\treturn [x + j * dx, ys.map(y => y + j_dy)];\r\n\t\t});\r\n\t});\r\n}\r\n\r\n// return [[x, ys...], ...]\r\n// where w = length of y\r\nfunction read_replacement_table(w, next) { \r\n\tlet n = 1 + next();\r\n\tlet m = read_transposed(n, 1+w, next);\r\n\treturn m.map(v => [v[0], v.slice(1)]);\r\n}\r\n\r\n\r\nfunction read_trie(next) {\r\n\tlet ret = [];\r\n\tlet sorted = read_sorted(next); \r\n\texpand(decode([]), []);\r\n\treturn ret; // not sorted\r\n\tfunction decode(Q) { // characters that lead into this node\r\n\t\tlet S = next(); // state: valid, save, check\r\n\t\tlet B = read_array_while(() => { // buckets leading to new nodes\r\n\t\t\tlet cps = read_sorted(next).map(i => sorted[i]);\r\n\t\t\tif (cps.length) return decode(cps);\r\n\t\t});\r\n\t\treturn {S, B, Q};\r\n\t}\r\n\tfunction expand({S, B}, cps, saved) {\r\n\t\tif (S & 4 && saved === cps[cps.length-1]) return;\r\n\t\tif (S & 2) saved = cps[cps.length-1];\r\n\t\tif (S & 1) ret.push(cps); \r\n\t\tfor (let br of B) {\r\n\t\t\tfor (let cp of br.Q) {\r\n\t\t\t\texpand(br, [...cps, cp], saved);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\n\nfunction hex_cp(cp) {\r\n\treturn cp.toString(16).toUpperCase().padStart(2, '0');\r\n}\r\n\r\nfunction quote_cp(cp) {\r\n\treturn `{${hex_cp(cp)}}`; // raffy convention: like \"\\u{X}\" w/o the \"\\u\"\r\n}\r\n\r\n/*\r\nexport function explode_cp(s) {\r\n\treturn [...s].map(c => c.codePointAt(0));\r\n}\r\n*/\r\nfunction explode_cp(s) { // this is about 2x faster\r\n\tlet cps = [];\r\n\tfor (let pos = 0, len = s.length; pos < len; ) {\r\n\t\tlet cp = s.codePointAt(pos);\r\n\t\tpos += cp < 0x10000 ? 1 : 2;\r\n\t\tcps.push(cp);\r\n\t}\r\n\treturn cps;\r\n}\r\n\r\nfunction str_from_cps(cps) {\r\n\tconst chunk = 4096;\r\n\tlet len = cps.length;\r\n\tif (len < chunk) return String.fromCodePoint(...cps);\r\n\tlet buf = [];\r\n\tfor (let i = 0; i < len; ) {\r\n\t\tbuf.push(String.fromCodePoint(...cps.slice(i, i += chunk)));\r\n\t}\r\n\treturn buf.join('');\r\n}\r\n\r\nfunction compare_arrays(a, b) {\r\n\tlet n = a.length;\r\n\tlet c = n - b.length;\r\n\tfor (let i = 0; c == 0 && i < n; i++) c = a[i] - b[i];\r\n\treturn c;\r\n}\n\n// created 2023-09-25T01:01:55.148Z\n// compressed base64-encoded blob for include-nf data\n// source: https://github.com/adraffy/ens-normalize.js/blob/main/src/make.js\n// see: https://github.com/adraffy/ens-normalize.js#security\n// SHA-256: a974b6f8541fc29d919bc85118af0a44015851fab5343f8679cb31be2bdb209e\nvar COMPRESSED = 'AEUDTAHBCFQATQDRADAAcgAgADQAFAAsABQAHwAOACQADQARAAoAFwAHABIACAAPAAUACwAFAAwABAAQAAMABwAEAAoABQAIAAIACgABAAQAFAALAAIACwABAAIAAQAHAAMAAwAEAAsADAAMAAwACgANAA0AAwAKAAkABAAdAAYAZwDSAdsDJgC0CkMB8xhZAqfoC190UGcThgBurwf7PT09Pb09AjgJum8OjDllxHYUKXAPxzq6tABAxgK8ysUvWAgMPT09PT09PSs6LT2HcgWXWwFLoSMEEEl5RFVMKvO0XQ8ExDdJMnIgsj26PTQyy8FfEQ8AY8IPAGcEbwRwBHEEcgRzBHQEdQR2BHcEeAR6BHsEfAR+BIAEgfndBQoBYgULAWIFDAFiBNcE2ATZBRAFEQUvBdALFAsVDPcNBw13DYcOMA4xDjMB4BllHI0B2grbAMDpHLkQ7QHVAPRNQQFnGRUEg0yEB2uaJF8AJpIBpob5AERSMAKNoAXqaQLUBMCzEiACnwRZEkkVsS7tANAsBG0RuAQLEPABv9HICTUBXigPZwRBApMDOwAamhtaABqEAY8KvKx3LQ4ArAB8UhwEBAVSagD8AEFZADkBIadVj2UMUgx5Il4ANQC9AxIB1BlbEPMAs30CGxlXAhwZKQIECBc6EbsCoxngzv7UzRQA8M0BawL6ZwkN7wABAD33OQRcsgLJCjMCjqUChtw/km+NAsXPAoP2BT84PwURAK0RAvptb6cApQS/OMMey5HJS84UdxpxTPkCogVFITaTOwERAK5pAvkNBOVyA7q3BKlOJSALAgUIBRcEdASpBXqzABXFSWZOawLCOqw//AolCZdvv3dSBkEQGyelEPcMMwG1ATsN7UvYBPEGOwTJH30ZGQ/NlZwIpS3dDO0m4y6hgFoj9SqDBe1L9DzdC01RaA9ZC2UJ4zpjgU4DIQENIosK3Q05CG0Q8wrJaw3lEUUHOQPVSZoApQcBCxEdNRW1JhBirAsJOXcG+xr2C48mrxMpevwF0xohBk0BKRr/AM8u54WwWjFcHE9fBgMLJSPHFKhQIA0lQLd4SBobBxUlqQKRQ3BKh1E2HpMh9jw9DWYuE1F8B/U8BRlPC4E8nkarRQ4R0j6NPUgiSUwsBDV/LC8niwnPD4UMuXxyAVkJIQmxDHETMREXN8UIOQcZLZckJxUIIUaVYJoE958D8xPRAwsFPwlBBxMDtRwtEy4VKQUNgSTXAvM21S6zAo9WgAEXBcsPJR/fEFBH4A7pCJsCZQODJesALRUhABcimwhDYwBfj9hTBS7LCMdqbCN0A2cU52ERcweRDlcHpxwzFb8c4XDIXguGCCijrwlbAXUJmQFfBOMICTVbjKAgQWdTi1gYmyBhQT9d/AIxDGUVn0S9h3gCiw9rEhsBNQFzBzkNAQJ3Ee0RaxCVCOuGBDW1M/g6JQRPIYMgEQonA09szgsnJvkM+GkBoxJiAww0PXfuZ6tgtiQX/QcZMsVBYCHxC5JPzQycGsEYQlQuGeQHvwPzGvMn6kFXBf8DowMTOk0z7gS9C2kIiwk/AEkOoxcH1xhqCnGM0AExiwG3mQNXkYMCb48GNwcLAGcLhwV55QAdAqcIowAFAM8DVwA5Aq0HnQAZAIVBAT0DJy8BIeUCjwOTCDHLAZUvAfMpBBvDDBUA9zduSgLDsQKAamaiBd1YAo4CSTUBTSUEBU5HUQOvceEA2wBLBhPfRwEVq0rLGuNDAd9vKwDHAPsABTUHBUEBzQHzbQC3AV8LMQmis7UBTekpAIMAFWsB1wKJAN0ANQB/8QFTAE0FWfkF0wJPSQERMRgrV2EBuwMfATMBDQB5BsuNpckHHwRtB9MCEBsV4QLvLge1AQMi3xPNQsUCvd5VoWACZIECYkJbTa9bNyACofcCaJgCZgkCn4Q4GwsCZjsCZiYEbgR/A38TA36SOQY5dxc5gjojIwJsHQIyNjgKAm3HAm2u74ozZ0UrAWcA3gDhAEoFB5gMjQD+C8IADbUCdy8CdqI/AnlLQwJ4uh1c20WuRtcCfD8CesgCfQkCfPAFWQUgSABIfWMkAoFtAoAAAoAFAn+uSVhKWxUXSswC0QEC0MxLJwOITwOH5kTFkTIC8qFdAwMDrkvOTC0lA89NTE2vAos/AorYwRsHHUNnBbcCjjcCjlxAl4ECjtkCjlx4UbRTNQpS1FSFApP7ApMMAOkAHFUeVa9V0AYsGymVhjLheGZFOzkCl58C77JYIagAWSUClo8ClnycAKlZrFoJgU0AOwKWtQKWTlxEXNECmcsCmWRcyl0HGQKcmznCOp0CnBYCn5sCnriKAB0PMSoPAp3xAp6SALU9YTRh7wKe0wKgbgGpAp6fHwKeTqVjyGQnJSsCJ68CJn4CoPsCoEwCot0CocQCpi8Cpc4Cp/8AfQKn8mh8aLEAA0lqHGrRAqzjAqyuAq1nAq0CAlcdAlXcArHh1wMfTmyXArK9DQKy6Bds4G1jbUhfAyXNArZcOz9ukAMpRQK4XgK5RxUCuSp3cDZw4QK9GQK72nCWAzIRAr6IcgIDM3ECvhpzInNPAsPLAsMEc4J0SzVFdOADPKcDPJoDPb8CxXwCxkcCxhCJAshpUQLIRALJTwLJLgJknQLd0nh5YXiueSVL0AMYo2cCAmH0GfOVJHsLXpJeuxECz2sCz2wvS1PS8xOfAMatAs9zASnqA04SfksFAtwnAtuKAtJPA1JcA1NfAQEDVYyAiT8AyxbtYEWCHILTgs6DjQLaxwLZ3oQQhEmnPAOGpQAvA2QOhnFZ+QBVAt9lAt64c3cC4i/tFAHzMCcB9JsB8tKHAuvzAulweQLq+QLq5AD5RwG5Au6JAuuclqqXAwLuPwOF4Jh5cOBxoQLzAwBpA44WmZMC9xMDkW4DkocC95gC+dkC+GaaHJqruzebHgOdgwL++gEbADmfHJ+zAwWNA6ZqA6bZANHFAwZqoYiiBQkDDEkCwAA/AwDhQRdTARHzA2sHl2cFAJMtK7evvdsBiZkUfxEEOQH7KQUhDp0JnwCS/SlXxQL3AZ0AtwW5AG8LbUEuFCaNLgFDAYD8AbUmAHUDDgRtACwCFgyhAAAKAj0CagPdA34EkQEgRQUhfAoABQBEABMANhICdwEABdUDa+8KxQIA9wqfJ7+xt+UBkSFBQgHpFH8RNMCJAAQAGwBaAkUChIsABjpTOpSNbQC4Oo860ACNOME63AClAOgAywE6gTo7Ofw5+Tt2iTpbO56JOm85GAFWATMBbAUvNV01njWtNWY1dTW2NcU1gjWRNdI14TWeNa017jX9NbI1wTYCNhE1xjXVNhY2JzXeNe02LjY9Ni41LSE2OjY9Njw2yTcIBJA8VzY4Nt03IDcPNsogN4k3MAoEsDxnNiQ3GTdsOo03IULUQwdC4EMLHA8PCZsobShRVQYA6X8A6bABFCnXAukBowC9BbcAbwNzBL8MDAMMAQgDAAkKCwsLCQoGBAVVBI/DvwDz9b29kaUCb0QtsRTNLt4eGBcSHAMZFhYZEhYEARAEBUEcQRxBHEEcQRxBHEEaQRxBHEFCSTxBPElISUhBNkM2QTYbNklISVmBVIgBFLWZAu0BhQCjBcEAbykBvwGJAaQcEZ0ePCklMAAhMvAIMAL54gC7Bm8EescjzQMpARQpKgDUABavAj626xQAJP0A3etzuf4NNRA7efy2Z9NQrCnC0OSyANz5BBIbJ5IFDR6miIavYS6tprjjmuKebxm5C74Q225X1pkaYYPb6f1DK4k3xMEBb9S2WMjEibTNWhsRJIA+vwNVEiXTE5iXs/wezV66oFLfp9NZGYW+Gk19J2+bCT6Ye2w6LDYdgzKMUabk595eLBCXANz9HUpWbATq9vqXVx9XDg+Pc9Xp4+bsS005SVM/BJBM4687WUuf+Uj9dEi8aDNaPxtpbDxcG1THTImUMZq4UCaaNYpsVqraNyKLJXDYsFZ/5jl7bLRtO88t7P3xZaAxhb5OdPMXqsSkp1WCieG8jXm1U99+blvLlXzPCS+M93VnJCiK+09LfaSaBAVBomyDgJua8dfUzR7ga34IvR2Nvj+A9heJ6lsl1KG4NkI1032Cnff1m1wof2B9oHJK4bi6JkEdSqeNeiuo6QoZZincoc73/TH9SXF8sCE7XyuYyW8WSgbGFCjPV0ihLKhdPs08Tx82fYAkLLc4I2wdl4apY7GU5lHRFzRWJep7Ww3wbeA3qmd59/86P4xuNaqDpygXt6M85glSBHOCGgJDnt+pN9bK7HApMguX6+06RZNjzVmcZJ+wcUrJ9//bpRNxNuKpNl9uFds+S9tdx7LaM5ZkIrPj6nIU9mnbFtVbs9s/uLgl8MVczAwet+iOEzzBlYW7RCMgE6gyNLeq6+1tIx4dpgZnd0DksJS5f+JNDpwwcPNXaaVspq1fbQajOrJgK0ofKtJ1Ne90L6VO4MOl5S886p7u6xo7OLjG8TGL+HU1JXGJgppg4nNbNJ5nlzSpuPYy21JUEcUA94PoFiZfjZue+QnyQ80ekOuZVkxx4g+cvhJfHgNl4hy1/a6+RKcKlar/J29y//EztlbVPHVUeQ1zX86eQVAjR/M3dA9w4W8LfaXp4EgM85wOWasli837PzVMOnsLzR+k3o75/lRPAJSE1xAKQzEi5v10ke+VBvRt1cwQRMd+U5mLCTGVd6XiZtgBG5cDi0w22GKcVNvHiu5LQbZEDVtz0onn7k5+heuKXVsZtSzilkLRAUmjMXEMB3J9YC50XBxPiz53SC+EhnPl9WsKCv92SM/OFFIMJZYfl0WW8tIO3UxYcwdMAj7FSmgrsZ2aAZO03BOhP1bNNZItyXYQFTpC3SG1VuPDqH9GkiCDmE+JwxyIVSO5siDErAOpEXFgjy6PQtOVDj+s6e1r8heWVvmZnTciuf4EiNZzCAd7SOMhXERIOlsHIMG399i9aLTy3m2hRLZjJVDNLS53iGIK11dPqQt0zBDyg6qc7YqkDm2M5Ve6dCWCaCbTXX2rToaIgz6+zh4lYUi/+6nqcFMAkQJKHYLK0wYk5N9szV6xihDbDDFr45lN1K4aCXBq/FitPSud9gLt5ZVn+ZqGX7cwm2z5EGMgfFpIFyhGGuDPmso6TItTMwny+7uPnLCf4W6goFQFV0oQSsc9VfMmVLcLr6ZetDZbaSFTLqnSO/bIPjA3/zAUoqgGFAEQS4IhuMzEp2I3jJzbzkk/IEmyax+rhZTwd6f+CGtwPixu8IvzACquPWPREu9ZvGkUzpRwvRRuaNN6cr0W1wWits9ICdYJ7ltbgMiSL3sTPeufgNcVqMVWFkCPDH4jG2jA0XcVgQj62Cb29v9f/z/+2KbYvIv/zzjpQAPkliaVDzNrW57TZ/ZOyZD0nlfMmAIBIAGAI0D3k/mdN4xr9v85ZbZbbqfH2jGd5hUqNZWwl5SPfoGmfElmazUIeNL1j/mkF7VNAzTq4jNt8JoQ11NQOcmhprXoxSxfRGJ9LDEOAQ+dmxAQH90iti9e2u/MoeuaGcDTHoC+xsmEeWmxEKefQuIzHbpw5Tc5cEocboAD09oipWQhtTO1wivf/O+DRe2rpl/E9wlrzBorjJsOeG1B/XPW4EaJEFdNlECEZga5ZoGRHXgYouGRuVkm8tDESiEyFNo+3s5M5puSdTyUL2llnINVHEt91XUNW4ewdMgJ4boJfEyt/iY5WXqbA+A2Fkt5Z0lutiWhe9nZIyIUjyXDC3UsaG1t+eNx6z4W/OYoTB7A6x+dNSTOi9AInctbESqm5gvOLww7OWXPrmHwVZasrl4eD113pm+JtT7JVOvnCXqdzzdTRHgJ0PiGTFYW5Gvt9R9LD6Lzfs0v/TZZHSmyVNq7viIHE6DBK7Qp07Iz55EM8SYtQvZf/obBniTWi5C2/ovHfw4VndkE5XYdjOhCMRjDeOEfXeN/CwfGduiUIfsoFeUxXeQXba7c7972XNv8w+dTjjUM0QeNAReW+J014dKAD/McQYXT7c0GQPIkn3Ll6R7gGjuiQoZD0TEeEqQpKoZ15g/0OPQI17QiSv9AUROa/V/TQN3dvLArec3RrsYlvBm1b8LWzltdugsC50lNKYLEp2a+ZZYqPejULRlOJh5zj/LVMyTDvwKhMxxwuDkxJ1QpoNI0OTWLom4Z71SNzI9TV1iXJrIu9Wcnd+MCaAw8o1jSXd94YU/1gnkrC9BUEOtQvEIQ7g0i6h+KL2JKk8Ydl7HruvgWMSAmNe+LshGhV4qnWHhO9/RIPQzY1tHRj2VqOyNsDpK0cww+56AdDC4gsWwY0XxoucIWIqs/GcwnWqlaT0KPr8mbK5U94/301i1WLt4YINTVvCFBrFZbIbY8eycOdeJ2teD5IfPLCRg7jjcFTwlMFNl9zdh/o3E/hHPwj7BWg0MU09pPrBLbrCgm54A6H+I6v27+jL5gkjWg/iYdks9jbfVP5y/n0dlgWEMlKasl7JvFZd56LfybW1eeaVO0gxTfXZwD8G4SI116yx7UKVRgui6Ya1YpixqXeNLc8IxtAwCU5IhwQgn+NqHnRaDv61CxKhOq4pOX7M6pkA+Pmpd4j1vn6ACUALoLLc4vpXci8VidLxzm7qFBe7s+quuJs6ETYmnpgS3LwSZxPIltgBDXz8M1k/W2ySNv2f9/NPhxLGK2D21dkHeSGmenRT3Yqcdl0m/h3OYr8V+lXNYGf8aCCpd4bWjE4QIPj7vUKN4Nrfs7ML6Y2OyS830JCnofg/k7lpFpt4SqZc5HGg1HCOrHvOdC8bP6FGDbE/VV0mX4IakzbdS/op+Kt3G24/8QbBV7y86sGSQ/vZzU8FXs7u6jIvwchsEP2BpIhW3G8uWNwa3HmjfH/ZjhhCWvluAcF+nMf14ClKg5hGgtPLJ98ueNAkc5Hs2WZlk2QHvfreCK1CCGO6nMZVSb99VM/ajr8WHTte9JSmkXq/i/U943HEbdzW6Re/S88dKgg8pGOLlAeNiqrcLkUR3/aClFpMXcOUP3rmETcWSfMXZE3TUOi8i+fqRnTYLflVx/Vb/6GJ7eIRZUA6k3RYR3iFSK9c4iDdNwJuZL2FKz/IK5VimcNWEqdXjSoxSgmF0UPlDoUlNrPcM7ftmA8Y9gKiqKEHuWN+AZRIwtVSxye2Kf8rM3lhJ5XcBXU9n4v0Oy1RU2M+4qM8AQPVwse8ErNSob5oFPWxuqZnVzo1qB/IBxkM3EVUKFUUlO3e51259GgNcJbCmlvrdjtoTW7rChm1wyCKzpCTwozUUEOIcWLneRLgMXh+SjGSFkAllzbGS5HK7LlfCMRNRDSvbQPjcXaenNYxCvu2Qyznz6StuxVj66SgI0T8B6/sfHAJYZaZ78thjOSIFumNWLQbeZixDCCC+v0YBtkxiBB3jefHqZ/dFHU+crbj6OvS1x/JDD7vlm7zOVPwpUC01nhxZuY/63E7g';\n\n// https://unicode.org/reports/tr15/\r\n// for reference implementation\r\n// see: /derive/nf.js\r\n\r\n\r\n// algorithmic hangul\r\n// https://www.unicode.org/versions/Unicode15.0.0/ch03.pdf (page 144)\r\nconst S0 = 0xAC00;\r\nconst L0 = 0x1100;\r\nconst V0 = 0x1161;\r\nconst T0 = 0x11A7;\r\nconst L_COUNT = 19;\r\nconst V_COUNT = 21;\r\nconst T_COUNT = 28;\r\nconst N_COUNT = V_COUNT * T_COUNT;\r\nconst S_COUNT = L_COUNT * N_COUNT;\r\nconst S1 = S0 + S_COUNT;\r\nconst L1 = L0 + L_COUNT;\r\nconst V1 = V0 + V_COUNT;\r\nconst T1 = T0 + T_COUNT;\r\n\r\nfunction unpack_cc(packed) {\r\n\treturn (packed >> 24) & 0xFF;\r\n}\r\nfunction unpack_cp(packed) {\r\n\treturn packed & 0xFFFFFF;\r\n}\r\n\r\nlet SHIFTED_RANK, EXCLUSIONS, DECOMP, RECOMP;\r\n\r\nfunction init$1() {\r\n\t//console.time('nf');\r\n\tlet r = read_compressed_payload(COMPRESSED);\r\n\tSHIFTED_RANK = new Map(read_sorted_arrays(r).flatMap((v, i) => v.map(x => [x, (i+1) << 24]))); // pre-shifted\r\n\tEXCLUSIONS = new Set(read_sorted(r));\r\n\tDECOMP = new Map();\r\n\tRECOMP = new Map();\r\n\tfor (let [cp, cps] of read_mapped(r)) {\r\n\t\tif (!EXCLUSIONS.has(cp) && cps.length == 2) {\r\n\t\t\tlet [a, b] = cps;\r\n\t\t\tlet bucket = RECOMP.get(a);\r\n\t\t\tif (!bucket) {\r\n\t\t\t\tbucket = new Map();\r\n\t\t\t\tRECOMP.set(a, bucket);\r\n\t\t\t}\r\n\t\t\tbucket.set(b, cp);\r\n\t\t}\r\n\t\tDECOMP.set(cp, cps.reverse()); // stored reversed\r\n\t}\r\n\t//console.timeEnd('nf');\r\n\t// 20230905: 11ms\r\n}\r\n\r\nfunction is_hangul(cp) {\r\n\treturn cp >= S0 && cp < S1;\r\n}\r\n\r\nfunction compose_pair(a, b) {\r\n\tif (a >= L0 && a < L1 && b >= V0 && b < V1) {\r\n\t\treturn S0 + (a - L0) * N_COUNT + (b - V0) * T_COUNT;\r\n\t} else if (is_hangul(a) && b > T0 && b < T1 && (a - S0) % T_COUNT == 0) {\r\n\t\treturn a + (b - T0);\r\n\t} else {\r\n\t\tlet recomp = RECOMP.get(a);\r\n\t\tif (recomp) {\r\n\t\t\trecomp = recomp.get(b);\r\n\t\t\tif (recomp) {\r\n\t\t\t\treturn recomp;\r\n\t\t\t}\r\n\t\t}\r\n\t\treturn -1;\r\n\t}\r\n}\r\n\r\nfunction decomposed(cps) {\r\n\tif (!SHIFTED_RANK) init$1();\r\n\tlet ret = [];\r\n\tlet buf = [];\r\n\tlet check_order = false;\r\n\tfunction add(cp) {\r\n\t\tlet cc = SHIFTED_RANK.get(cp);\r\n\t\tif (cc) {\r\n\t\t\tcheck_order = true;\r\n\t\t\tcp |= cc;\r\n\t\t}\r\n\t\tret.push(cp);\r\n\t}\r\n\tfor (let cp of cps) {\r\n\t\twhile (true) {\r\n\t\t\tif (cp < 0x80) {\r\n\t\t\t\tret.push(cp);\r\n\t\t\t} else if (is_hangul(cp)) {\r\n\t\t\t\tlet s_index = cp - S0;\r\n\t\t\t\tlet l_index = s_index / N_COUNT | 0;\r\n\t\t\t\tlet v_index = (s_index % N_COUNT) / T_COUNT | 0;\r\n\t\t\t\tlet t_index = s_index % T_COUNT;\r\n\t\t\t\tadd(L0 + l_index);\r\n\t\t\t\tadd(V0 + v_index);\r\n\t\t\t\tif (t_index > 0) add(T0 + t_index);\r\n\t\t\t} else {\r\n\t\t\t\tlet mapped = DECOMP.get(cp);\r\n\t\t\t\tif (mapped) {\r\n\t\t\t\t\tbuf.push(...mapped);\r\n\t\t\t\t} else {\r\n\t\t\t\t\tadd(cp);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tif (!buf.length) break;\r\n\t\t\tcp = buf.pop();\r\n\t\t}\r\n\t}\r\n\tif (check_order && ret.length > 1) {\r\n\t\tlet prev_cc = unpack_cc(ret[0]);\r\n\t\tfor (let i = 1; i < ret.length; i++) {\r\n\t\t\tlet cc = unpack_cc(ret[i]);\r\n\t\t\tif (cc == 0 || prev_cc <= cc) {\r\n\t\t\t\tprev_cc = cc;\r\n\t\t\t\tcontinue;\r\n\t\t\t}\r\n\t\t\tlet j = i-1;\r\n\t\t\twhile (true) {\r\n\t\t\t\tlet tmp = ret[j+1];\r\n\t\t\t\tret[j+1] = ret[j];\r\n\t\t\t\tret[j] = tmp;\r\n\t\t\t\tif (!j) break;\r\n\t\t\t\tprev_cc = unpack_cc(ret[--j]);\r\n\t\t\t\tif (prev_cc <= cc) break;\r\n\t\t\t}\r\n\t\t\tprev_cc = unpack_cc(ret[i]);\r\n\t\t}\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction composed_from_decomposed(v) {\r\n\tlet ret = [];\r\n\tlet stack = [];\r\n\tlet prev_cp = -1;\r\n\tlet prev_cc = 0;\r\n\tfor (let packed of v) {\r\n\t\tlet cc = unpack_cc(packed);\r\n\t\tlet cp = unpack_cp(packed);\r\n\t\tif (prev_cp == -1) {\r\n\t\t\tif (cc == 0) {\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tret.push(cp);\r\n\t\t\t}\r\n\t\t} else if (prev_cc > 0 && prev_cc >= cc) {\r\n\t\t\tif (cc == 0) {\r\n\t\t\t\tret.push(prev_cp, ...stack);\r\n\t\t\t\tstack.length = 0;\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tstack.push(cp);\r\n\t\t\t}\r\n\t\t\tprev_cc = cc;\r\n\t\t} else {\r\n\t\t\tlet composed = compose_pair(prev_cp, cp);\r\n\t\t\tif (composed >= 0) {\r\n\t\t\t\tprev_cp = composed;\r\n\t\t\t} else if (prev_cc == 0 && cc == 0) {\r\n\t\t\t\tret.push(prev_cp);\r\n\t\t\t\tprev_cp = cp;\r\n\t\t\t} else {\r\n\t\t\t\tstack.push(cp);\r\n\t\t\t\tprev_cc = cc;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (prev_cp >= 0) {\r\n\t\tret.push(prev_cp, ...stack);\t\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\n// note: cps can be iterable\r\nfunction nfd(cps) {\r\n\treturn decomposed(cps).map(unpack_cp);\r\n}\r\nfunction nfc(cps) {\r\n\treturn composed_from_decomposed(decomposed(cps));\r\n}\n\nconst HYPHEN = 0x2D;\r\nconst STOP = 0x2E;\r\nconst STOP_CH = '.';\r\nconst FE0F = 0xFE0F;\r\nconst UNIQUE_PH = 1;\r\n\r\n// 20230913: replace [...v] with Array_from(v) to avoid large spreads\r\nconst Array_from = x => Array.from(x); // Array.from.bind(Array);\r\n\r\nfunction group_has_cp(g, cp) {\r\n\t// 20230913: keep primary and secondary distinct instead of creating valid union\r\n\treturn g.P.has(cp) || g.Q.has(cp);\r\n}\r\n\r\nclass Emoji extends Array {\r\n\tget is_emoji() { return true; } // free tagging system\r\n}\r\n\r\nlet MAPPED, IGNORED, CM, NSM, ESCAPE, NFC_CHECK, GROUPS, WHOLE_VALID, WHOLE_MAP, VALID, EMOJI_LIST, EMOJI_ROOT;\r\n\r\nfunction init() {\r\n\tif (MAPPED) return;\r\n\t\r\n\tlet r = read_compressed_payload(COMPRESSED$1);\r\n\tconst read_sorted_array = () => read_sorted(r);\r\n\tconst read_sorted_set = () => new Set(read_sorted_array());\r\n\tconst set_add_many = (set, v) => v.forEach(x => set.add(x));\r\n\r\n\tMAPPED = new Map(read_mapped(r)); \r\n\tIGNORED = read_sorted_set(); // ignored characters are not valid, so just read raw codepoints\r\n\r\n\t/*\r\n\t// direct include from payload is smaller than the decompression code\r\n\tconst FENCED = new Map(read_array_while(() => {\r\n\t\tlet cp = r();\r\n\t\tif (cp) return [cp, read_str(r())];\r\n\t}));\r\n\t*/\r\n\t// 20230217: we still need all CM for proper error formatting\r\n\t// but norm only needs NSM subset that are potentially-valid\r\n\tCM = read_sorted_array();\r\n\tNSM = new Set(read_sorted_array().map(i => CM[i]));\r\n\tCM = new Set(CM);\r\n\t\r\n\tESCAPE = read_sorted_set(); // characters that should not be printed\r\n\tNFC_CHECK = read_sorted_set(); // only needed to illustrate ens_tokenize() transformations\r\n\r\n\tlet chunks = read_sorted_arrays(r);\r\n\tlet unrestricted = r();\r\n\t//const read_chunked = () => new Set(read_sorted_array().flatMap(i => chunks[i]).concat(read_sorted_array()));\r\n\tconst read_chunked = () => {\r\n\t\t// 20230921: build set in parts, 2x faster\r\n\t\tlet set = new Set();\r\n\t\tread_sorted_array().forEach(i => set_add_many(set, chunks[i]));\r\n\t\tset_add_many(set, read_sorted_array());\r\n\t\treturn set; \r\n\t};\r\n\tGROUPS = read_array_while(i => {\r\n\t\t// minifier property mangling seems unsafe\r\n\t\t// so these are manually renamed to single chars\r\n\t\tlet N = read_array_while(r).map(x => x+0x60);\r\n\t\tif (N.length) {\r\n\t\t\tlet R = i >= unrestricted; // unrestricted then restricted\r\n\t\t\tN[0] -= 32; // capitalize\r\n\t\t\tN = str_from_cps(N);\r\n\t\t\tif (R) N=`Restricted[${N}]`;\r\n\t\t\tlet P = read_chunked(); // primary\r\n\t\t\tlet Q = read_chunked(); // secondary\r\n\t\t\tlet M = !r(); // not-whitelisted, check for NSM\r\n\t\t\t// *** this code currently isn't needed ***\r\n\t\t\t/*\r\n\t\t\tlet V = [...P, ...Q].sort((a, b) => a-b); // derive: sorted valid\r\n\t\t\tlet M = r()-1; // number of combining mark\r\n\t\t\tif (M < 0) { // whitelisted\r\n\t\t\t\tM = new Map(read_array_while(() => {\r\n\t\t\t\t\tlet i = r();\r\n\t\t\t\t\tif (i) return [V[i-1], read_array_while(() => {\r\n\t\t\t\t\t\tlet v = read_array_while(r);\r\n\t\t\t\t\t\tif (v.length) return v.map(x => x-1);\r\n\t\t\t\t\t})];\r\n\t\t\t\t}));\r\n\t\t\t}*/\r\n\t\t\treturn {N, P, Q, M, R};\r\n\t\t}\r\n\t});\r\n\r\n\t// decode compressed wholes\r\n\tWHOLE_VALID = read_sorted_set();\r\n\tWHOLE_MAP = new Map();\r\n\tlet wholes = read_sorted_array().concat(Array_from(WHOLE_VALID)).sort((a, b) => a-b); // must be sorted\r\n\twholes.forEach((cp, i) => {\r\n\t\tlet d = r(); \r\n\t\tlet w = wholes[i] = d ? wholes[i-d] : {V: [], M: new Map()};\r\n\t\tw.V.push(cp); // add to member set\r\n\t\tif (!WHOLE_VALID.has(cp)) {\r\n\t\t\tWHOLE_MAP.set(cp, w);  // register with whole map\r\n\t\t}\r\n\t});\r\n\r\n\t// compute confusable-extent complements\r\n\t// usage: WHOLE_MAP.get(cp).M.get(cp) = complement set\r\n\tfor (let {V, M} of new Set(WHOLE_MAP.values())) {\r\n\t\t// connect all groups that have each whole character\r\n\t\tlet recs = [];\r\n\t\tfor (let cp of V) {\r\n\t\t\tlet gs = GROUPS.filter(g => group_has_cp(g, cp));\r\n\t\t\tlet rec = recs.find(({G}) => gs.some(g => G.has(g)));\r\n\t\t\tif (!rec) {\r\n\t\t\t\trec = {G: new Set(), V: []};\r\n\t\t\t\trecs.push(rec);\r\n\t\t\t}\r\n\t\t\trec.V.push(cp);\r\n\t\t\tset_add_many(rec.G, gs);\r\n\t\t}\r\n\t\t// per character cache groups which are not a member of the extent\r\n\t\tlet union = recs.flatMap(x => Array_from(x.G)); // all of the groups used by this whole\r\n\t\tfor (let {G, V} of recs) {\r\n\t\t\tlet complement = new Set(union.filter(g => !G.has(g))); // groups not covered by the extent\r\n\t\t\tfor (let cp of V) {\r\n\t\t\t\tM.set(cp, complement); // this is the same reference\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\r\n\t// compute valid set\r\n\t// 20230924: VALID was union but can be re-used\r\n\tVALID = new Set(); // exists in 1+ groups\r\n\tlet multi = new Set(); // exists in 2+ groups\r\n\tconst add_to_union = cp => VALID.has(cp) ? multi.add(cp) : VALID.add(cp);\r\n\tfor (let g of GROUPS) {\r\n\t\tfor (let cp of g.P) add_to_union(cp);\r\n\t\tfor (let cp of g.Q) add_to_union(cp);\r\n\t}\r\n\t// dual purpose WHOLE_MAP: return placeholder if unique non-confusable\r\n\tfor (let cp of VALID) {\r\n\t\tif (!WHOLE_MAP.has(cp) && !multi.has(cp)) {\r\n\t\t\tWHOLE_MAP.set(cp, UNIQUE_PH);\r\n\t\t}\r\n\t}\r\n\t// add all decomposed parts\r\n\t// see derive: \"Valid is Closed (via Brute-force)\"\r\n\tset_add_many(VALID, nfd(VALID));\r\n\t\r\n\t// decode emoji\r\n\t// 20230719: emoji are now fully-expanded to avoid quirk logic \r\n\tEMOJI_LIST = read_trie(r).map(v => Emoji.from(v)).sort(compare_arrays);\r\n\tEMOJI_ROOT = new Map(); // this has approx 7K nodes (2+ per emoji)\r\n\tfor (let cps of EMOJI_LIST) {\r\n\t\t// 20230719: change to *slightly* stricter algorithm which disallows \r\n\t\t// insertion of misplaced FE0F in emoji sequences (matching ENSIP-15)\r\n\t\t// example: beautified [A B] (eg. flag emoji) \r\n\t\t//  before: allow: [A FE0F B], error: [A FE0F FE0F B] \r\n\t\t//   after: error: both\r\n\t\t// note: this code now matches ENSNormalize.{cs,java} logic\r\n\t\tlet prev = [EMOJI_ROOT];\r\n\t\tfor (let cp of cps) {\r\n\t\t\tlet next = prev.map(node => {\r\n\t\t\t\tlet child = node.get(cp);\r\n\t\t\t\tif (!child) {\r\n\t\t\t\t\t// should this be object? \r\n\t\t\t\t\t// (most have 1-2 items, few have many)\r\n\t\t\t\t\t// 20230719: no, v8 default map is 4?\r\n\t\t\t\t\tchild = new Map();\r\n\t\t\t\t\tnode.set(cp, child);\r\n\t\t\t\t}\r\n\t\t\t\treturn child;\r\n\t\t\t});\r\n\t\t\tif (cp === FE0F) {\r\n\t\t\t\tprev.push(...next); // less than 20 elements\r\n\t\t\t} else {\r\n\t\t\t\tprev = next;\r\n\t\t\t}\r\n\t\t}\r\n\t\tfor (let x of prev) {\r\n\t\t\tx.V = cps;\r\n\t\t}\r\n\t}\r\n}\r\n\r\n// if escaped: {HEX}\r\n//       else: \"x\" {HEX}\r\nfunction quoted_cp(cp) {\r\n\treturn (should_escape(cp) ? '' : `${bidi_qq(safe_str_from_cps([cp]))} `) + quote_cp(cp);\r\n}\r\n\r\n// 20230211: some messages can be mixed-directional and result in spillover\r\n// use 200E after a quoted string to force the remainder of a string from \r\n// acquring the direction of the quote\r\n// https://www.w3.org/International/questions/qa-bidi-unicode-controls#exceptions\r\nfunction bidi_qq(s) {\r\n\treturn `\"${s}\"\\u200E`; // strong LTR\r\n}\r\n\r\nfunction check_label_extension(cps) {\r\n\tif (cps.length >= 4 && cps[2] == HYPHEN && cps[3] == HYPHEN) {\r\n\t\tthrow new Error(`invalid label extension: \"${str_from_cps(cps.slice(0, 4))}\"`); // this can only be ascii so cant be bidi\r\n\t}\r\n}\r\nfunction check_leading_underscore(cps) {\r\n\tconst UNDERSCORE = 0x5F;\r\n\tfor (let i = cps.lastIndexOf(UNDERSCORE); i > 0; ) {\r\n\t\tif (cps[--i] !== UNDERSCORE) {\r\n\t\t\tthrow new Error('underscore allowed only at start');\r\n\t\t}\r\n\t}\r\n}\r\n// check that a fenced cp is not leading, trailing, or touching another fenced cp\r\nfunction check_fenced(cps) {\r\n\tlet cp = cps[0];\r\n\tlet prev = FENCED.get(cp);\r\n\tif (prev) throw error_placement(`leading ${prev}`);\r\n\tlet n = cps.length;\r\n\tlet last = -1; // prevents trailing from throwing\r\n\tfor (let i = 1; i < n; i++) {\r\n\t\tcp = cps[i];\r\n\t\tlet match = FENCED.get(cp);\r\n\t\tif (match) {\r\n\t\t\t// since cps[0] isn't fenced, cps[1] cannot throw\r\n\t\t\tif (last == i) throw error_placement(`${prev} + ${match}`);\r\n\t\t\tlast = i + 1;\r\n\t\t\tprev = match;\r\n\t\t}\r\n\t}\r\n\tif (last == n) throw error_placement(`trailing ${prev}`);\r\n}\r\n\r\n// create a safe to print string \r\n// invisibles are escaped\r\n// leading cm uses placeholder\r\n// if cps exceed max, middle truncate with ellipsis\r\n// quoter(cp) => string, eg. 3000 => \"{3000}\"\r\n// note: in html, you'd call this function then replace [<>&] with entities\r\nfunction safe_str_from_cps(cps, max = Infinity, quoter = quote_cp) {\r\n\t//if (Number.isInteger(cps)) cps = [cps];\r\n\t//if (!Array.isArray(cps)) throw new TypeError(`expected codepoints`);\r\n\tlet buf = [];\r\n\tif (is_combining_mark(cps[0])) buf.push('◌');\r\n\tif (cps.length > max) {\r\n\t\tmax >>= 1;\r\n\t\tcps = [...cps.slice(0, max), 0x2026, ...cps.slice(-max)];\r\n\t}\r\n\tlet prev = 0;\r\n\tlet n = cps.length;\r\n\tfor (let i = 0; i < n; i++) {\r\n\t\tlet cp = cps[i];\r\n\t\tif (should_escape(cp)) {\r\n\t\t\tbuf.push(str_from_cps(cps.slice(prev, i)));\r\n\t\t\tbuf.push(quoter(cp));\r\n\t\t\tprev = i + 1;\r\n\t\t}\r\n\t}\r\n\tbuf.push(str_from_cps(cps.slice(prev, n)));\r\n\treturn buf.join('');\r\n}\r\n\r\n// note: set(s) cannot be exposed because they can be modified\r\n// note: Object.freeze() doesn't work\r\nfunction is_combining_mark(cp) {\r\n\tinit();\r\n\treturn CM.has(cp);\r\n}\r\nfunction should_escape(cp) {\r\n\tinit();\r\n\treturn ESCAPE.has(cp);\r\n}\r\n\r\n// return all supported emoji as fully-qualified emoji \r\n// ordered by length then lexicographic \r\nfunction ens_emoji() {\r\n\tinit();\r\n\treturn EMOJI_LIST.map(x => x.slice()); // emoji are exposed so copy\r\n}\r\n\r\nfunction ens_normalize_fragment(frag, decompose) {\r\n\tinit();\r\n\tlet nf = decompose ? nfd : nfc;\r\n\treturn frag.split(STOP_CH).map(label => str_from_cps(tokens_from_str(explode_cp(label), nf, filter_fe0f).flat())).join(STOP_CH);\r\n}\r\n\r\nfunction ens_normalize(name) {\r\n\treturn flatten(split(name, nfc, filter_fe0f));\r\n}\r\n\r\nfunction ens_beautify(name) {\r\n\tlet labels = split(name, nfc, x => x); // emoji not exposed\r\n\tfor (let {type, output, error} of labels) {\r\n\t\tif (error) break; // flatten will throw\r\n\r\n\t\t// replace leading/trailing hyphen\r\n\t\t// 20230121: consider beautifing all or leading/trailing hyphen to unicode variant\r\n\t\t// not exactly the same in every font, but very similar: \"-\" vs \"‐\"\r\n\t\t/*\r\n\t\tconst UNICODE_HYPHEN = 0x2010;\r\n\t\t// maybe this should replace all for visual consistancy?\r\n\t\t// `node tools/reg-count.js regex ^-\\{2,\\}` => 592\r\n\t\t//for (let i = 0; i < output.length; i++) if (output[i] == 0x2D) output[i] = 0x2010;\r\n\t\tif (output[0] == HYPHEN) output[0] = UNICODE_HYPHEN;\r\n\t\tlet end = output.length-1;\r\n\t\tif (output[end] == HYPHEN) output[end] = UNICODE_HYPHEN;\r\n\t\t*/\r\n\t\t// 20230123: WHATWG URL uses \"CheckHyphens\" false\r\n\t\t// https://url.spec.whatwg.org/#idna\r\n\r\n\t\t// update ethereum symbol\r\n\t\t// ξ => Ξ if not greek\r\n\t\tif (type !== 'Greek') array_replace(output, 0x3BE, 0x39E);\r\n\r\n\t\t// 20221213: fixes bidi subdomain issue, but breaks invariant (200E is disallowed)\r\n\t\t// could be fixed with special case for: 2D (.) + 200E (LTR)\r\n\t\t// https://discuss.ens.domains/t/bidi-label-ordering-spoof/15824\r\n\t\t//output.splice(0, 0, 0x200E);\r\n\t}\r\n\treturn flatten(labels);\r\n}\r\n\r\nfunction array_replace(v, a, b) {\r\n\tlet prev = 0;\r\n\twhile (true) {\r\n\t\tlet next = v.indexOf(a, prev);\r\n\t\tif (next < 0) break;\r\n\t\tv[next] = b; \r\n\t\tprev = next + 1;\r\n\t}\r\n}\r\n\r\nfunction ens_split(name, preserve_emoji) {\r\n\treturn split(name, nfc, preserve_emoji ? x => x.slice() : filter_fe0f); // emoji are exposed so copy\r\n}\r\n\r\nfunction split(name, nf, ef) {\r\n\tif (!name) return []; // 20230719: empty name allowance\r\n\tinit();\r\n\tlet offset = 0;\r\n\t// https://unicode.org/reports/tr46/#Validity_Criteria\r\n\t// 4.) \"The label must not contain a U+002E ( . ) FULL STOP.\"\r\n\treturn name.split(STOP_CH).map(label => {\r\n\t\tlet input = explode_cp(label);\r\n\t\tlet info = {\r\n\t\t\tinput,\r\n\t\t\toffset, // codepoint, not substring!\r\n\t\t};\r\n\t\toffset += input.length + 1; // + stop\r\n\t\ttry {\r\n\t\t\t// 1.) \"The label must be in Unicode Normalization Form NFC\"\r\n\t\t\tlet tokens = info.tokens = tokens_from_str(input, nf, ef);\r\n\t\t\tlet token_count = tokens.length;\r\n\t\t\tlet type;\r\n\t\t\tif (!token_count) { // the label was effectively empty (could of had ignored characters)\r\n\t\t\t\t//norm = [];\r\n\t\t\t\t//type = 'None'; // use this instead of next match, \"ASCII\"\r\n\t\t\t\t// 20230120: change to strict\r\n\t\t\t\t// https://discuss.ens.domains/t/ens-name-normalization-2nd/14564/59\r\n\t\t\t\tthrow new Error(`empty label`);\r\n\t\t\t} \r\n\t\t\tlet norm = info.output = tokens.flat();\r\n\t\t\tcheck_leading_underscore(norm);\r\n\t\t\tlet emoji = info.emoji = token_count > 1 || tokens[0].is_emoji; // same as: tokens.some(x => x.is_emoji);\r\n\t\t\tif (!emoji && norm.every(cp => cp < 0x80)) { // special case for ascii\r\n\t\t\t\t// 20230123: matches matches WHATWG, see note 3.3\r\n\t\t\t\tcheck_label_extension(norm); // only needed for ascii\r\n\t\t\t\t// cant have fenced\r\n\t\t\t\t// cant have cm\r\n\t\t\t\t// cant have wholes\r\n\t\t\t\t// see derive: \"Fastpath ASCII\"\r\n\t\t\t\ttype = 'ASCII';\r\n\t\t\t} else {\r\n\t\t\t\tlet chars = tokens.flatMap(x => x.is_emoji ? [] : x); // all of the nfc tokens concat together\r\n\t\t\t\tif (!chars.length) { // theres no text, just emoji\r\n\t\t\t\t\ttype = 'Emoji';\r\n\t\t\t\t} else {\r\n\t\t\t\t\t// 5.) \"The label must not begin with a combining mark, that is: General_Category=Mark.\"\r\n\t\t\t\t\tif (CM.has(norm[0])) throw error_placement('leading combining mark');\r\n\t\t\t\t\tfor (let i = 1; i < token_count; i++) { // we've already checked the first token\r\n\t\t\t\t\t\tlet cps = tokens[i];\r\n\t\t\t\t\t\tif (!cps.is_emoji && CM.has(cps[0])) { // every text token has emoji neighbors, eg. EtEEEtEt...\r\n\t\t\t\t\t\t\t// bidi_qq() not needed since emoji is LTR and cps is a CM\r\n\t\t\t\t\t\t\tthrow error_placement(`emoji + combining mark: \"${str_from_cps(tokens[i-1])} + ${safe_str_from_cps([cps[0]])}\"`); \r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tcheck_fenced(norm);\r\n\t\t\t\t\tlet unique = Array_from(new Set(chars));\r\n\t\t\t\t\tlet [g] = determine_group(unique); // take the first match\r\n\t\t\t\t\t// see derive: \"Matching Groups have Same CM Style\"\r\n\t\t\t\t\t// alternative: could form a hybrid type: Latin/Japanese/...\t\r\n\t\t\t\t\tcheck_group(g, chars); // need text in order\r\n\t\t\t\t\tcheck_whole(g, unique); // only need unique text (order would be required for multiple-char confusables)\r\n\t\t\t\t\ttype = g.N;\r\n\t\t\t\t\t// 20230121: consider exposing restricted flag\r\n\t\t\t\t\t// it's simpler to just check for 'Restricted'\r\n\t\t\t\t\t// or even better: type.endsWith(']')\r\n\t\t\t\t\t//if (g.R) info.restricted = true;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tinfo.type = type;\r\n\t\t} catch (err) {\r\n\t\t\tinfo.error = err; // use full error object\r\n\t\t}\r\n\t\treturn info;\r\n\t});\r\n}\r\n\r\nfunction check_whole(group, unique) {\r\n\tlet maker;\r\n\tlet shared = [];\r\n\tfor (let cp of unique) {\r\n\t\tlet whole = WHOLE_MAP.get(cp);\r\n\t\tif (whole === UNIQUE_PH) return; // unique, non-confusable\r\n\t\tif (whole) {\r\n\t\t\tlet set = whole.M.get(cp); // groups which have a character that look-like this character\r\n\t\t\tmaker = maker ? maker.filter(g => set.has(g)) : Array_from(set);\r\n\t\t\tif (!maker.length) return; // confusable intersection is empty\r\n\t\t} else {\r\n\t\t\tshared.push(cp); \r\n\t\t}\r\n\t}\r\n\tif (maker) {\r\n\t\t// we have 1+ confusable\r\n\t\t// check if any of the remaining groups\r\n\t\t// contain the shared characters too\r\n\t\tfor (let g of maker) {\r\n\t\t\tif (shared.every(cp => group_has_cp(g, cp))) {\r\n\t\t\t\tthrow new Error(`whole-script confusable: ${group.N}/${g.N}`);\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n}\r\n\r\n// assumption: unique.size > 0\r\n// returns list of matching groups\r\nfunction determine_group(unique) {\r\n\tlet groups = GROUPS;\r\n\tfor (let cp of unique) {\r\n\t\t// note: we need to dodge CM that are whitelisted\r\n\t\t// but that code isn't currently necessary\r\n\t\tlet gs = groups.filter(g => group_has_cp(g, cp));\r\n\t\tif (!gs.length) {\r\n\t\t\tif (!GROUPS.some(g => group_has_cp(g, cp))) { \r\n\t\t\t\t// the character was composed of valid parts\r\n\t\t\t\t// but it's NFC form is invalid\r\n\t\t\t\t// 20230716: change to more exact statement, see: ENSNormalize.{cs,java}\r\n\t\t\t\t// note: this doesn't have to be a composition\r\n\t\t\t\t// 20230720: change to full check\r\n\t\t\t\tthrow error_disallowed(cp); // this should be rare\r\n\t\t\t} else {\r\n\t\t\t\t// there is no group that contains all these characters\r\n\t\t\t\t// throw using the highest priority group that matched\r\n\t\t\t\t// https://www.unicode.org/reports/tr39/#mixed_script_confusables\r\n\t\t\t\tthrow error_group_member(groups[0], cp);\r\n\t\t\t}\r\n\t\t}\r\n\t\tgroups = gs;\r\n\t\tif (gs.length == 1) break; // there is only one group left\r\n\t}\r\n\t// there are at least 1 group(s) with all of these characters\r\n\treturn groups;\r\n}\r\n\r\n// throw on first error\r\nfunction flatten(split) {\r\n\treturn split.map(({input, error, output}) => {\r\n\t\tif (error) {\r\n\t\t\t// don't print label again if just a single label\r\n\t\t\tlet msg = error.message;\r\n\t\t\t// bidi_qq() only necessary if msg is digits\r\n\t\t\tthrow new Error(split.length == 1 ? msg : `Invalid label ${bidi_qq(safe_str_from_cps(input, 63))}: ${msg}`); \r\n\t\t}\r\n\t\treturn str_from_cps(output);\r\n\t}).join(STOP_CH);\r\n}\r\n\r\nfunction error_disallowed(cp) {\r\n\t// TODO: add cp to error?\r\n\treturn new Error(`disallowed character: ${quoted_cp(cp)}`); \r\n}\r\nfunction error_group_member(g, cp) {\r\n\tlet quoted = quoted_cp(cp);\r\n\tlet gg = GROUPS.find(g => g.P.has(cp)); // only check primary\r\n\tif (gg) {\r\n\t\tquoted = `${gg.N} ${quoted}`;\r\n\t}\r\n\treturn new Error(`illegal mixture: ${g.N} + ${quoted}`);\r\n}\r\nfunction error_placement(where) {\r\n\treturn new Error(`illegal placement: ${where}`);\r\n}\r\n\r\n// assumption: cps.length > 0\r\n// assumption: cps[0] isn't a CM\r\n// assumption: the previous character isn't an emoji\r\nfunction check_group(g, cps) {\r\n\tfor (let cp of cps) {\r\n\t\tif (!group_has_cp(g, cp)) {\r\n\t\t\t// for whitelisted scripts, this will throw illegal mixture on invalid cm, eg. \"e{300}{300}\"\r\n\t\t\t// at the moment, it's unnecessary to introduce an extra error type\r\n\t\t\t// until there exists a whitelisted multi-character\r\n\t\t\t//   eg. if (M < 0 && is_combining_mark(cp)) { ... }\r\n\t\t\t// there are 3 cases:\r\n\t\t\t//   1. illegal cm for wrong group => mixture error\r\n\t\t\t//   2. illegal cm for same group => cm error\r\n\t\t\t//       requires set of whitelist cm per group: \r\n\t\t\t//        eg. new Set([...g.P, ...g.Q].flatMap(nfc).filter(cp => CM.has(cp)))\r\n\t\t\t//   3. wrong group => mixture error\r\n\t\t\tthrow error_group_member(g, cp);\r\n\t\t}\r\n\t}\r\n\t//if (M >= 0) { // we have a known fixed cm count\r\n\tif (g.M) { // we need to check for NSM\r\n\t\tlet decomposed = nfd(cps);\r\n\t\tfor (let i = 1, e = decomposed.length; i < e; i++) { // see: assumption\r\n\t\t\t// 20230210: bugfix: using cps instead of decomposed h/t Carbon225\r\n\t\t\t/*\r\n\t\t\tif (CM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\twhile (j < e && CM.has(decomposed[j])) j++;\r\n\t\t\t\tif (j - i > M) {\r\n\t\t\t\t\tthrow new Error(`too many combining marks: ${g.N} ${bidi_qq(str_from_cps(decomposed.slice(i-1, j)))} (${j-i}/${M})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t\t*/\r\n\t\t\t// 20230217: switch to NSM counting\r\n\t\t\t// https://www.unicode.org/reports/tr39/#Optional_Detection\r\n\t\t\tif (NSM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\tfor (let cp; j < e && NSM.has(cp = decomposed[j]); j++) {\r\n\t\t\t\t\t// a. Forbid sequences of the same nonspacing mark.\r\n\t\t\t\t\tfor (let k = i; k < j; k++) { // O(n^2) but n < 100\r\n\t\t\t\t\t\tif (decomposed[k] == cp) {\r\n\t\t\t\t\t\t\tthrow new Error(`duplicate non-spacing marks: ${quoted_cp(cp)}`);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t}\r\n\t\t\t\t// parse to end so we have full nsm count\r\n\t\t\t\t// b. Forbid sequences of more than 4 nonspacing marks (gc=Mn or gc=Me).\r\n\t\t\t\tif (j - i > NSM_MAX) {\r\n\t\t\t\t\t// note: this slice starts with a base char or spacing-mark cm\r\n\t\t\t\t\tthrow new Error(`excessive non-spacing marks: ${bidi_qq(safe_str_from_cps(decomposed.slice(i-1, j)))} (${j-i}/${NSM_MAX})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t// *** this code currently isn't needed ***\r\n\t/*\r\n\tlet cm_whitelist = M instanceof Map;\r\n\tfor (let i = 0, e = cps.length; i < e; ) {\r\n\t\tlet cp = cps[i++];\r\n\t\tlet seqs = cm_whitelist && M.get(cp);\r\n\t\tif (seqs) { \r\n\t\t\t// list of codepoints that can follow\r\n\t\t\t// if this exists, this will always be 1+\r\n\t\t\tlet j = i;\r\n\t\t\twhile (j < e && CM.has(cps[j])) j++;\r\n\t\t\tlet cms = cps.slice(i, j);\r\n\t\t\tlet match = seqs.find(seq => !compare_arrays(seq, cms));\r\n\t\t\tif (!match) throw new Error(`disallowed combining mark sequence: \"${safe_str_from_cps([cp, ...cms])}\"`);\r\n\t\t\ti = j;\r\n\t\t} else if (!V.has(cp)) {\r\n\t\t\t// https://www.unicode.org/reports/tr39/#mixed_script_confusables\r\n\t\t\tlet quoted = quoted_cp(cp);\r\n\t\t\tfor (let cp of cps) {\r\n\t\t\t\tlet u = UNIQUE.get(cp);\r\n\t\t\t\tif (u && u !== g) {\r\n\t\t\t\t\t// if both scripts are restricted this error is confusing\r\n\t\t\t\t\t// because we don't differentiate RestrictedA from RestrictedB \r\n\t\t\t\t\tif (!u.R) quoted = `${quoted} is ${u.N}`;\r\n\t\t\t\t\tbreak;\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t\tthrow new Error(`disallowed ${g.N} character: ${quoted}`);\r\n\t\t\t//throw new Error(`disallowed character: ${quoted} (expected ${g.N})`);\r\n\t\t\t//throw new Error(`${g.N} does not allow: ${quoted}`);\r\n\t\t}\r\n\t}\r\n\tif (!cm_whitelist) {\r\n\t\tlet decomposed = nfd(cps);\r\n\t\tfor (let i = 1, e = decomposed.length; i < e; i++) { // we know it can't be cm leading\r\n\t\t\tif (CM.has(decomposed[i])) {\r\n\t\t\t\tlet j = i + 1;\r\n\t\t\t\twhile (j < e && CM.has(decomposed[j])) j++;\r\n\t\t\t\tif (j - i > M) {\r\n\t\t\t\t\tthrow new Error(`too many combining marks: \"${str_from_cps(decomposed.slice(i-1, j))}\" (${j-i}/${M})`);\r\n\t\t\t\t}\r\n\t\t\t\ti = j;\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\t*/\r\n}\r\n\r\n// given a list of codepoints\r\n// returns a list of lists, where emoji are a fully-qualified (as Array subclass)\r\n// eg. explode_cp(\"abc💩d\") => [[61, 62, 63], Emoji[1F4A9, FE0F], [64]]\r\n// 20230818: rename for 'process' name collision h/t Javarome\r\n// https://github.com/adraffy/ens-normalize.js/issues/23\r\nfunction tokens_from_str(input, nf, ef) {\r\n\tlet ret = [];\r\n\tlet chars = [];\r\n\tinput = input.slice().reverse(); // flip so we can pop\r\n\twhile (input.length) {\r\n\t\tlet emoji = consume_emoji_reversed(input);\r\n\t\tif (emoji) {\r\n\t\t\tif (chars.length) {\r\n\t\t\t\tret.push(nf(chars));\r\n\t\t\t\tchars = [];\r\n\t\t\t}\r\n\t\t\tret.push(ef(emoji));\r\n\t\t} else {\r\n\t\t\tlet cp = input.pop();\r\n\t\t\tif (VALID.has(cp)) {\r\n\t\t\t\tchars.push(cp);\r\n\t\t\t} else {\r\n\t\t\t\tlet cps = MAPPED.get(cp);\r\n\t\t\t\tif (cps) {\r\n\t\t\t\t\tchars.push(...cps); // less than 10 elements\r\n\t\t\t\t} else if (!IGNORED.has(cp)) {\r\n\t\t\t\t\t// 20230912: unicode 15.1 changed the order of processing such that\r\n\t\t\t\t\t// disallowed parts are only rejected after NFC\r\n\t\t\t\t\t// https://unicode.org/reports/tr46/#Validity_Criteria\r\n\t\t\t\t\t// this doesn't impact normalization as of today\r\n\t\t\t\t\t// technically, this error can be removed as the group logic will apply similar logic\r\n\t\t\t\t\t// however the error type might be less clear\r\n\t\t\t\t\tthrow error_disallowed(cp);\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (chars.length) {\r\n\t\tret.push(nf(chars));\r\n\t}\r\n\treturn ret;\r\n}\r\n\r\nfunction filter_fe0f(cps) {\r\n\treturn cps.filter(cp => cp != FE0F);\r\n}\r\n\r\n// given array of codepoints\r\n// returns the longest valid emoji sequence (or undefined if no match)\r\n// *MUTATES* the supplied array\r\n// disallows interleaved ignored characters\r\n// fills (optional) eaten array with matched codepoints\r\nfunction consume_emoji_reversed(cps, eaten) {\r\n\tlet node = EMOJI_ROOT;\r\n\tlet emoji;\r\n\tlet pos = cps.length;\r\n\twhile (pos) {\r\n\t\tnode = node.get(cps[--pos]);\r\n\t\tif (!node) break;\r\n\t\tlet {V} = node;\r\n\t\tif (V) { // this is a valid emoji (so far)\r\n\t\t\temoji = V;\r\n\t\t\tif (eaten) eaten.push(...cps.slice(pos).reverse()); // (optional) copy input, used for ens_tokenize()\r\n\t\t\tcps.length = pos; // truncate\r\n\t\t}\r\n\t}\r\n\treturn emoji;\r\n}\r\n\r\n// ************************************************************\r\n// tokenizer \r\n\r\nconst TY_VALID = 'valid';\r\nconst TY_MAPPED = 'mapped';\r\nconst TY_IGNORED = 'ignored';\r\nconst TY_DISALLOWED = 'disallowed';\r\nconst TY_EMOJI = 'emoji';\r\nconst TY_NFC = 'nfc';\r\nconst TY_STOP = 'stop';\r\n\r\nfunction ens_tokenize(name, {\r\n\tnf = true, // collapse unnormalized runs into a single token\r\n} = {}) {\r\n\tinit();\r\n\tlet input = explode_cp(name).reverse();\r\n\tlet eaten = [];\r\n\tlet tokens = [];\r\n\twhile (input.length) {\r\n\t\tlet emoji = consume_emoji_reversed(input, eaten);\r\n\t\tif (emoji) {\r\n\t\t\ttokens.push({\r\n\t\t\t\ttype: TY_EMOJI,\r\n\t\t\t\temoji: emoji.slice(), // copy emoji\r\n\t\t\t\tinput: eaten,\r\n\t\t\t\tcps: filter_fe0f(emoji)\r\n\t\t\t});\r\n\t\t\teaten = []; // reset buffer\r\n\t\t} else {\r\n\t\t\tlet cp = input.pop();\r\n\t\t\tif (cp == STOP) {\r\n\t\t\t\ttokens.push({type: TY_STOP, cp});\r\n\t\t\t} else if (VALID.has(cp)) {\r\n\t\t\t\ttokens.push({type: TY_VALID, cps: [cp]});\r\n\t\t\t} else if (IGNORED.has(cp)) {\r\n\t\t\t\ttokens.push({type: TY_IGNORED, cp});\r\n\t\t\t} else {\r\n\t\t\t\tlet cps = MAPPED.get(cp);\r\n\t\t\t\tif (cps) {\r\n\t\t\t\t\ttokens.push({type: TY_MAPPED, cp, cps: cps.slice()});\r\n\t\t\t\t} else {\r\n\t\t\t\t\ttokens.push({type: TY_DISALLOWED, cp});\r\n\t\t\t\t}\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\tif (nf) {\r\n\t\tfor (let i = 0, start = -1; i < tokens.length; i++) {\r\n\t\t\tlet token = tokens[i];\r\n\t\t\tif (is_valid_or_mapped(token.type)) {\r\n\t\t\t\tif (requires_check(token.cps)) { // normalization might be needed\r\n\t\t\t\t\tlet end = i + 1;\r\n\t\t\t\t\tfor (let pos = end; pos < tokens.length; pos++) { // find adjacent text\r\n\t\t\t\t\t\tlet {type, cps} = tokens[pos];\r\n\t\t\t\t\t\tif (is_valid_or_mapped(type)) {\r\n\t\t\t\t\t\t\tif (!requires_check(cps)) break;\r\n\t\t\t\t\t\t\tend = pos + 1;\r\n\t\t\t\t\t\t} else if (type !== TY_IGNORED) { // || type !== TY_DISALLOWED) { \r\n\t\t\t\t\t\t\tbreak;\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t}\r\n\t\t\t\t\tif (start < 0) start = i;\r\n\t\t\t\t\tlet slice = tokens.slice(start, end);\r\n\t\t\t\t\tlet cps0 = slice.flatMap(x => is_valid_or_mapped(x.type) ? x.cps : []); // strip junk tokens\r\n\t\t\t\t\tlet cps = nfc(cps0);\r\n\t\t\t\t\tif (compare_arrays(cps, cps0)) { // bundle into an nfc token\r\n\t\t\t\t\t\ttokens.splice(start, end - start, {\r\n\t\t\t\t\t\t\ttype: TY_NFC, \r\n\t\t\t\t\t\t\tinput: cps0, // there are 3 states: tokens0 ==(process)=> input ==(nfc)=> tokens/cps\r\n\t\t\t\t\t\t\tcps, \r\n\t\t\t\t\t\t\ttokens0: collapse_valid_tokens(slice),\r\n\t\t\t\t\t\t\ttokens: ens_tokenize(str_from_cps(cps), {nf: false})\r\n\t\t\t\t\t\t});\r\n\t\t\t\t\t\ti = start;\r\n\t\t\t\t\t} else { \r\n\t\t\t\t\t\ti = end - 1; // skip to end of slice\r\n\t\t\t\t\t}\r\n\t\t\t\t\tstart = -1; // reset\r\n\t\t\t\t} else {\r\n\t\t\t\t\tstart = i; // remember last\r\n\t\t\t\t}\r\n\t\t\t} else if (token.type !== TY_IGNORED) { // 20221024: is this correct?\r\n\t\t\t\tstart = -1; // reset\r\n\t\t\t}\r\n\t\t}\r\n\t}\r\n\treturn collapse_valid_tokens(tokens);\r\n}\r\n\r\nfunction is_valid_or_mapped(type) {\r\n\treturn type == TY_VALID || type == TY_MAPPED;\r\n}\r\n\r\nfunction requires_check(cps) {\r\n\treturn cps.some(cp => NFC_CHECK.has(cp));\r\n}\r\n\r\nfunction collapse_valid_tokens(tokens) {\r\n\tfor (let i = 0; i < tokens.length; i++) {\r\n\t\tif (tokens[i].type == TY_VALID) {\r\n\t\t\tlet j = i + 1;\r\n\t\t\twhile (j < tokens.length && tokens[j].type == TY_VALID) j++;\r\n\t\t\ttokens.splice(i, j - i, {type: TY_VALID, cps: tokens.slice(i, j).flatMap(x => x.cps)});\r\n\t\t}\r\n\t}\r\n\treturn tokens;\r\n}\n\nexport { ens_beautify, ens_emoji, ens_normalize, ens_normalize_fragment, ens_split, ens_tokenize, is_combining_mark, nfc, nfd, safe_str_from_cps, should_escape };\n","import { keccak256 } from \"../crypto/index.js\";\nimport { concat, hexlify, assertArgument, toUtf8Bytes } from \"../utils/index.js\";\nimport { ens_normalize } from \"@adraffy/ens-normalize\";\nconst Zeros = new Uint8Array(32);\nZeros.fill(0);\nfunction checkComponent(comp) {\n    assertArgument(comp.length !== 0, \"invalid ENS name; empty component\", \"comp\", comp);\n    return comp;\n}\nfunction ensNameSplit(name) {\n    const bytes = toUtf8Bytes(ensNormalize(name));\n    const comps = [];\n    if (name.length === 0) {\n        return comps;\n    }\n    let last = 0;\n    for (let i = 0; i < bytes.length; i++) {\n        const d = bytes[i];\n        // A separator (i.e. \".\"); copy this component\n        if (d === 0x2e) {\n            comps.push(checkComponent(bytes.slice(last, i)));\n            last = i + 1;\n        }\n    }\n    // There was a stray separator at the end of the name\n    assertArgument(last < bytes.length, \"invalid ENS name; empty component\", \"name\", name);\n    comps.push(checkComponent(bytes.slice(last)));\n    return comps;\n}\n/**\n *  Returns the ENS %%name%% normalized.\n */\nexport function ensNormalize(name) {\n    try {\n        if (name.length === 0) {\n            throw new Error(\"empty label\");\n        }\n        return ens_normalize(name);\n    }\n    catch (error) {\n        assertArgument(false, `invalid ENS name (${error.message})`, \"name\", name);\n    }\n}\n/**\n *  Returns ``true`` if %%name%% is a valid ENS name.\n */\nexport function isValidName(name) {\n    try {\n        return (ensNameSplit(name).length !== 0);\n    }\n    catch (error) { }\n    return false;\n}\n/**\n *  Returns the [[link-namehash]] for %%name%%.\n */\nexport function namehash(name) {\n    assertArgument(typeof (name) === \"string\", \"invalid ENS name; not a string\", \"name\", name);\n    assertArgument(name.length, `invalid ENS name (empty label)`, \"name\", name);\n    let result = Zeros;\n    const comps = ensNameSplit(name);\n    while (comps.length) {\n        result = keccak256(concat([result, keccak256((comps.pop()))]));\n    }\n    return hexlify(result);\n}\n/**\n *  Returns the DNS encoded %%name%%.\n *\n *  This is used for various parts of ENS name resolution, such\n *  as the wildcard resolution.\n */\nexport function dnsEncode(name, _maxLength) {\n    const length = (_maxLength != null) ? _maxLength : 63;\n    assertArgument(length <= 255, \"DNS encoded label cannot exceed 255\", \"length\", length);\n    return hexlify(concat(ensNameSplit(name).map((comp) => {\n        assertArgument(comp.length <= length, `label ${JSON.stringify(name)} exceeds ${length} bytes`, \"name\", name);\n        const bytes = new Uint8Array(comp.length + 1);\n        bytes.set(comp, 1);\n        bytes[0] = bytes.length - 1;\n        return bytes;\n    }))) + \"00\";\n}\n//# sourceMappingURL=namehash.js.map","import { getAddress } from \"../address/index.js\";\nimport { assertArgument, isHexString } from \"../utils/index.js\";\nfunction accessSetify(addr, storageKeys) {\n    return {\n        address: getAddress(addr),\n        storageKeys: storageKeys.map((storageKey, index) => {\n            assertArgument(isHexString(storageKey, 32), \"invalid slot\", `storageKeys[${index}]`, storageKey);\n            return storageKey.toLowerCase();\n        })\n    };\n}\n/**\n *  Returns a [[AccessList]] from any ethers-supported access-list structure.\n */\nexport function accessListify(value) {\n    if (Array.isArray(value)) {\n        return value.map((set, index) => {\n            if (Array.isArray(set)) {\n                assertArgument(set.length === 2, \"invalid slot set\", `value[${index}]`, set);\n                return accessSetify(set[0], set[1]);\n            }\n            assertArgument(set != null && typeof (set) === \"object\", \"invalid address-slot set\", \"value\", value);\n            return accessSetify(set.address, set.storageKeys);\n        });\n    }\n    assertArgument(value != null && typeof (value) === \"object\", \"invalid access list\", \"value\", value);\n    const result = Object.keys(value).map((addr) => {\n        const storageKeys = value[addr].reduce((accum, storageKey) => {\n            accum[storageKey] = true;\n            return accum;\n        }, {});\n        return accessSetify(addr, Object.keys(storageKeys).sort());\n    });\n    result.sort((a, b) => (a.address.localeCompare(b.address)));\n    return result;\n}\n//# sourceMappingURL=accesslist.js.map","import { getAddress } from \"../address/index.js\";\nimport { keccak256, SigningKey } from \"../crypto/index.js\";\n/**\n *  Returns the address for the %%key%%.\n *\n *  The key may be any standard form of public key or a private key.\n */\nexport function computeAddress(key) {\n    let pubkey;\n    if (typeof (key) === \"string\") {\n        pubkey = SigningKey.computePublicKey(key, false);\n    }\n    else {\n        pubkey = key.publicKey;\n    }\n    return getAddress(keccak256(\"0x\" + pubkey.substring(4)).substring(26));\n}\n/**\n *  Returns the recovered address for the private key that was\n *  used to sign %%digest%% that resulted in %%signature%%.\n */\nexport function recoverAddress(digest, signature) {\n    return computeAddress(SigningKey.recoverPublicKey(digest, signature));\n}\n//# sourceMappingURL=address.js.map","import { getAddress } from \"../address/index.js\";\nimport { ZeroAddress } from \"../constants/addresses.js\";\nimport { keccak256, sha256, Signature, SigningKey } from \"../crypto/index.js\";\nimport { concat, decodeRlp, encodeRlp, getBytes, getBigInt, getNumber, hexlify, assert, assertArgument, isBytesLike, isHexString, toBeArray, zeroPadValue } from \"../utils/index.js\";\nimport { accessListify } from \"./accesslist.js\";\nimport { recoverAddress } from \"./address.js\";\nconst BN_0 = BigInt(0);\nconst BN_2 = BigInt(2);\nconst BN_27 = BigInt(27);\nconst BN_28 = BigInt(28);\nconst BN_35 = BigInt(35);\nconst BN_MAX_UINT = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\nconst BLOB_SIZE = 4096 * 32;\nfunction getVersionedHash(version, hash) {\n    let versioned = version.toString(16);\n    while (versioned.length < 2) {\n        versioned = \"0\" + versioned;\n    }\n    versioned += sha256(hash).substring(4);\n    return \"0x\" + versioned;\n}\nfunction handleAddress(value) {\n    if (value === \"0x\") {\n        return null;\n    }\n    return getAddress(value);\n}\nfunction handleAccessList(value, param) {\n    try {\n        return accessListify(value);\n    }\n    catch (error) {\n        assertArgument(false, error.message, param, value);\n    }\n}\nfunction handleNumber(_value, param) {\n    if (_value === \"0x\") {\n        return 0;\n    }\n    return getNumber(_value, param);\n}\nfunction handleUint(_value, param) {\n    if (_value === \"0x\") {\n        return BN_0;\n    }\n    const value = getBigInt(_value, param);\n    assertArgument(value <= BN_MAX_UINT, \"value exceeds uint size\", param, value);\n    return value;\n}\nfunction formatNumber(_value, name) {\n    const value = getBigInt(_value, \"value\");\n    const result = toBeArray(value);\n    assertArgument(result.length <= 32, `value too large`, `tx.${name}`, value);\n    return result;\n}\nfunction formatAccessList(value) {\n    return accessListify(value).map((set) => [set.address, set.storageKeys]);\n}\nfunction formatHashes(value, param) {\n    assertArgument(Array.isArray(value), `invalid ${param}`, \"value\", value);\n    for (let i = 0; i < value.length; i++) {\n        assertArgument(isHexString(value[i], 32), \"invalid ${ param } hash\", `value[${i}]`, value[i]);\n    }\n    return value;\n}\nfunction _parseLegacy(data) {\n    const fields = decodeRlp(data);\n    assertArgument(Array.isArray(fields) && (fields.length === 9 || fields.length === 6), \"invalid field count for legacy transaction\", \"data\", data);\n    const tx = {\n        type: 0,\n        nonce: handleNumber(fields[0], \"nonce\"),\n        gasPrice: handleUint(fields[1], \"gasPrice\"),\n        gasLimit: handleUint(fields[2], \"gasLimit\"),\n        to: handleAddress(fields[3]),\n        value: handleUint(fields[4], \"value\"),\n        data: hexlify(fields[5]),\n        chainId: BN_0\n    };\n    // Legacy unsigned transaction\n    if (fields.length === 6) {\n        return tx;\n    }\n    const v = handleUint(fields[6], \"v\");\n    const r = handleUint(fields[7], \"r\");\n    const s = handleUint(fields[8], \"s\");\n    if (r === BN_0 && s === BN_0) {\n        // EIP-155 unsigned transaction\n        tx.chainId = v;\n    }\n    else {\n        // Compute the EIP-155 chain ID (or 0 for legacy)\n        let chainId = (v - BN_35) / BN_2;\n        if (chainId < BN_0) {\n            chainId = BN_0;\n        }\n        tx.chainId = chainId;\n        // Signed Legacy Transaction\n        assertArgument(chainId !== BN_0 || (v === BN_27 || v === BN_28), \"non-canonical legacy v\", \"v\", fields[6]);\n        tx.signature = Signature.from({\n            r: zeroPadValue(fields[7], 32),\n            s: zeroPadValue(fields[8], 32),\n            v\n        });\n        //tx.hash = keccak256(data);\n    }\n    return tx;\n}\nfunction _serializeLegacy(tx, sig) {\n    const fields = [\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.gasPrice || 0, \"gasPrice\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n    ];\n    let chainId = BN_0;\n    if (tx.chainId != BN_0) {\n        // A chainId was provided; if non-zero we'll use EIP-155\n        chainId = getBigInt(tx.chainId, \"tx.chainId\");\n        // We have a chainId in the tx and an EIP-155 v in the signature,\n        // make sure they agree with each other\n        assertArgument(!sig || sig.networkV == null || sig.legacyChainId === chainId, \"tx.chainId/sig.v mismatch\", \"sig\", sig);\n    }\n    else if (tx.signature) {\n        // No explicit chainId, but EIP-155 have a derived implicit chainId\n        const legacy = tx.signature.legacyChainId;\n        if (legacy != null) {\n            chainId = legacy;\n        }\n    }\n    // Requesting an unsigned transaction\n    if (!sig) {\n        // We have an EIP-155 transaction (chainId was specified and non-zero)\n        if (chainId !== BN_0) {\n            fields.push(toBeArray(chainId));\n            fields.push(\"0x\");\n            fields.push(\"0x\");\n        }\n        return encodeRlp(fields);\n    }\n    // @TODO: We should probably check that tx.signature, chainId, and sig\n    //        match but that logic could break existing code, so schedule\n    //        this for the next major bump.\n    // Compute the EIP-155 v\n    let v = BigInt(27 + sig.yParity);\n    if (chainId !== BN_0) {\n        v = Signature.getChainIdV(chainId, sig.v);\n    }\n    else if (BigInt(sig.v) !== v) {\n        assertArgument(false, \"tx.chainId/sig.v mismatch\", \"sig\", sig);\n    }\n    // Add the signature\n    fields.push(toBeArray(v));\n    fields.push(toBeArray(sig.r));\n    fields.push(toBeArray(sig.s));\n    return encodeRlp(fields);\n}\nfunction _parseEipSignature(tx, fields) {\n    let yParity;\n    try {\n        yParity = handleNumber(fields[0], \"yParity\");\n        if (yParity !== 0 && yParity !== 1) {\n            throw new Error(\"bad yParity\");\n        }\n    }\n    catch (error) {\n        assertArgument(false, \"invalid yParity\", \"yParity\", fields[0]);\n    }\n    const r = zeroPadValue(fields[1], 32);\n    const s = zeroPadValue(fields[2], 32);\n    const signature = Signature.from({ r, s, yParity });\n    tx.signature = signature;\n}\nfunction _parseEip1559(data) {\n    const fields = decodeRlp(getBytes(data).slice(1));\n    assertArgument(Array.isArray(fields) && (fields.length === 9 || fields.length === 12), \"invalid field count for transaction type: 2\", \"data\", hexlify(data));\n    const tx = {\n        type: 2,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        maxPriorityFeePerGas: handleUint(fields[2], \"maxPriorityFeePerGas\"),\n        maxFeePerGas: handleUint(fields[3], \"maxFeePerGas\"),\n        gasPrice: null,\n        gasLimit: handleUint(fields[4], \"gasLimit\"),\n        to: handleAddress(fields[5]),\n        value: handleUint(fields[6], \"value\"),\n        data: hexlify(fields[7]),\n        accessList: handleAccessList(fields[8], \"accessList\"),\n    };\n    // Unsigned EIP-1559 Transaction\n    if (fields.length === 9) {\n        return tx;\n    }\n    //tx.hash = keccak256(data);\n    _parseEipSignature(tx, fields.slice(9));\n    return tx;\n}\nfunction _serializeEip1559(tx, sig) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.maxPriorityFeePerGas || 0, \"maxPriorityFeePerGas\"),\n        formatNumber(tx.maxFeePerGas || 0, \"maxFeePerGas\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || [])\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"yParity\"));\n        fields.push(toBeArray(sig.r));\n        fields.push(toBeArray(sig.s));\n    }\n    return concat([\"0x02\", encodeRlp(fields)]);\n}\nfunction _parseEip2930(data) {\n    const fields = decodeRlp(getBytes(data).slice(1));\n    assertArgument(Array.isArray(fields) && (fields.length === 8 || fields.length === 11), \"invalid field count for transaction type: 1\", \"data\", hexlify(data));\n    const tx = {\n        type: 1,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        gasPrice: handleUint(fields[2], \"gasPrice\"),\n        gasLimit: handleUint(fields[3], \"gasLimit\"),\n        to: handleAddress(fields[4]),\n        value: handleUint(fields[5], \"value\"),\n        data: hexlify(fields[6]),\n        accessList: handleAccessList(fields[7], \"accessList\")\n    };\n    // Unsigned EIP-2930 Transaction\n    if (fields.length === 8) {\n        return tx;\n    }\n    //tx.hash = keccak256(data);\n    _parseEipSignature(tx, fields.slice(8));\n    return tx;\n}\nfunction _serializeEip2930(tx, sig) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.gasPrice || 0, \"gasPrice\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || \"0x\"),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || [])\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"recoveryParam\"));\n        fields.push(toBeArray(sig.r));\n        fields.push(toBeArray(sig.s));\n    }\n    return concat([\"0x01\", encodeRlp(fields)]);\n}\nfunction _parseEip4844(data) {\n    let fields = decodeRlp(getBytes(data).slice(1));\n    let typeName = \"3\";\n    let blobs = null;\n    // Parse the network format\n    if (fields.length === 4 && Array.isArray(fields[0])) {\n        typeName = \"3 (network format)\";\n        const fBlobs = fields[1], fCommits = fields[2], fProofs = fields[3];\n        assertArgument(Array.isArray(fBlobs), \"invalid network format: blobs not an array\", \"fields[1]\", fBlobs);\n        assertArgument(Array.isArray(fCommits), \"invalid network format: commitments not an array\", \"fields[2]\", fCommits);\n        assertArgument(Array.isArray(fProofs), \"invalid network format: proofs not an array\", \"fields[3]\", fProofs);\n        assertArgument(fBlobs.length === fCommits.length, \"invalid network format: blobs/commitments length mismatch\", \"fields\", fields);\n        assertArgument(fBlobs.length === fProofs.length, \"invalid network format: blobs/proofs length mismatch\", \"fields\", fields);\n        blobs = [];\n        for (let i = 0; i < fields[1].length; i++) {\n            blobs.push({\n                data: fBlobs[i],\n                commitment: fCommits[i],\n                proof: fProofs[i],\n            });\n        }\n        fields = fields[0];\n    }\n    assertArgument(Array.isArray(fields) && (fields.length === 11 || fields.length === 14), `invalid field count for transaction type: ${typeName}`, \"data\", hexlify(data));\n    const tx = {\n        type: 3,\n        chainId: handleUint(fields[0], \"chainId\"),\n        nonce: handleNumber(fields[1], \"nonce\"),\n        maxPriorityFeePerGas: handleUint(fields[2], \"maxPriorityFeePerGas\"),\n        maxFeePerGas: handleUint(fields[3], \"maxFeePerGas\"),\n        gasPrice: null,\n        gasLimit: handleUint(fields[4], \"gasLimit\"),\n        to: handleAddress(fields[5]),\n        value: handleUint(fields[6], \"value\"),\n        data: hexlify(fields[7]),\n        accessList: handleAccessList(fields[8], \"accessList\"),\n        maxFeePerBlobGas: handleUint(fields[9], \"maxFeePerBlobGas\"),\n        blobVersionedHashes: fields[10]\n    };\n    if (blobs) {\n        tx.blobs = blobs;\n    }\n    assertArgument(tx.to != null, `invalid address for transaction type: ${typeName}`, \"data\", data);\n    assertArgument(Array.isArray(tx.blobVersionedHashes), \"invalid blobVersionedHashes: must be an array\", \"data\", data);\n    for (let i = 0; i < tx.blobVersionedHashes.length; i++) {\n        assertArgument(isHexString(tx.blobVersionedHashes[i], 32), `invalid blobVersionedHash at index ${i}: must be length 32`, \"data\", data);\n    }\n    // Unsigned EIP-4844 Transaction\n    if (fields.length === 11) {\n        return tx;\n    }\n    // @TODO: Do we need to do this? This is only called internally\n    // and used to verify hashes; it might save time to not do this\n    //tx.hash = keccak256(concat([ \"0x03\", encodeRlp(fields) ]));\n    _parseEipSignature(tx, fields.slice(11));\n    return tx;\n}\nfunction _serializeEip4844(tx, sig, blobs) {\n    const fields = [\n        formatNumber(tx.chainId, \"chainId\"),\n        formatNumber(tx.nonce, \"nonce\"),\n        formatNumber(tx.maxPriorityFeePerGas || 0, \"maxPriorityFeePerGas\"),\n        formatNumber(tx.maxFeePerGas || 0, \"maxFeePerGas\"),\n        formatNumber(tx.gasLimit, \"gasLimit\"),\n        (tx.to || ZeroAddress),\n        formatNumber(tx.value, \"value\"),\n        tx.data,\n        formatAccessList(tx.accessList || []),\n        formatNumber(tx.maxFeePerBlobGas || 0, \"maxFeePerBlobGas\"),\n        formatHashes(tx.blobVersionedHashes || [], \"blobVersionedHashes\")\n    ];\n    if (sig) {\n        fields.push(formatNumber(sig.yParity, \"yParity\"));\n        fields.push(toBeArray(sig.r));\n        fields.push(toBeArray(sig.s));\n        // We have blobs; return the network wrapped format\n        if (blobs) {\n            return concat([\n                \"0x03\",\n                encodeRlp([\n                    fields,\n                    blobs.map((b) => b.data),\n                    blobs.map((b) => b.commitment),\n                    blobs.map((b) => b.proof),\n                ])\n            ]);\n        }\n    }\n    return concat([\"0x03\", encodeRlp(fields)]);\n}\n/**\n *  A **Transaction** describes an operation to be executed on\n *  Ethereum by an Externally Owned Account (EOA). It includes\n *  who (the [[to]] address), what (the [[data]]) and how much (the\n *  [[value]] in ether) the operation should entail.\n *\n *  @example:\n *    tx = new Transaction()\n *    //_result:\n *\n *    tx.data = \"0x1234\";\n *    //_result:\n */\nexport class Transaction {\n    #type;\n    #to;\n    #data;\n    #nonce;\n    #gasLimit;\n    #gasPrice;\n    #maxPriorityFeePerGas;\n    #maxFeePerGas;\n    #value;\n    #chainId;\n    #sig;\n    #accessList;\n    #maxFeePerBlobGas;\n    #blobVersionedHashes;\n    #kzg;\n    #blobs;\n    /**\n     *  The transaction type.\n     *\n     *  If null, the type will be automatically inferred based on\n     *  explicit properties.\n     */\n    get type() { return this.#type; }\n    set type(value) {\n        switch (value) {\n            case null:\n                this.#type = null;\n                break;\n            case 0:\n            case \"legacy\":\n                this.#type = 0;\n                break;\n            case 1:\n            case \"berlin\":\n            case \"eip-2930\":\n                this.#type = 1;\n                break;\n            case 2:\n            case \"london\":\n            case \"eip-1559\":\n                this.#type = 2;\n                break;\n            case 3:\n            case \"cancun\":\n            case \"eip-4844\":\n                this.#type = 3;\n                break;\n            default:\n                assertArgument(false, \"unsupported transaction type\", \"type\", value);\n        }\n    }\n    /**\n     *  The name of the transaction type.\n     */\n    get typeName() {\n        switch (this.type) {\n            case 0: return \"legacy\";\n            case 1: return \"eip-2930\";\n            case 2: return \"eip-1559\";\n            case 3: return \"eip-4844\";\n        }\n        return null;\n    }\n    /**\n     *  The ``to`` address for the transaction or ``null`` if the\n     *  transaction is an ``init`` transaction.\n     */\n    get to() {\n        const value = this.#to;\n        if (value == null && this.type === 3) {\n            return ZeroAddress;\n        }\n        return value;\n    }\n    set to(value) {\n        this.#to = (value == null) ? null : getAddress(value);\n    }\n    /**\n     *  The transaction nonce.\n     */\n    get nonce() { return this.#nonce; }\n    set nonce(value) { this.#nonce = getNumber(value, \"value\"); }\n    /**\n     *  The gas limit.\n     */\n    get gasLimit() { return this.#gasLimit; }\n    set gasLimit(value) { this.#gasLimit = getBigInt(value); }\n    /**\n     *  The gas price.\n     *\n     *  On legacy networks this defines the fee that will be paid. On\n     *  EIP-1559 networks, this should be ``null``.\n     */\n    get gasPrice() {\n        const value = this.#gasPrice;\n        if (value == null && (this.type === 0 || this.type === 1)) {\n            return BN_0;\n        }\n        return value;\n    }\n    set gasPrice(value) {\n        this.#gasPrice = (value == null) ? null : getBigInt(value, \"gasPrice\");\n    }\n    /**\n     *  The maximum priority fee per unit of gas to pay. On legacy\n     *  networks this should be ``null``.\n     */\n    get maxPriorityFeePerGas() {\n        const value = this.#maxPriorityFeePerGas;\n        if (value == null) {\n            if (this.type === 2 || this.type === 3) {\n                return BN_0;\n            }\n            return null;\n        }\n        return value;\n    }\n    set maxPriorityFeePerGas(value) {\n        this.#maxPriorityFeePerGas = (value == null) ? null : getBigInt(value, \"maxPriorityFeePerGas\");\n    }\n    /**\n     *  The maximum total fee per unit of gas to pay. On legacy\n     *  networks this should be ``null``.\n     */\n    get maxFeePerGas() {\n        const value = this.#maxFeePerGas;\n        if (value == null) {\n            if (this.type === 2 || this.type === 3) {\n                return BN_0;\n            }\n            return null;\n        }\n        return value;\n    }\n    set maxFeePerGas(value) {\n        this.#maxFeePerGas = (value == null) ? null : getBigInt(value, \"maxFeePerGas\");\n    }\n    /**\n     *  The transaction data. For ``init`` transactions this is the\n     *  deployment code.\n     */\n    get data() { return this.#data; }\n    set data(value) { this.#data = hexlify(value); }\n    /**\n     *  The amount of ether (in wei) to send in this transactions.\n     */\n    get value() { return this.#value; }\n    set value(value) {\n        this.#value = getBigInt(value, \"value\");\n    }\n    /**\n     *  The chain ID this transaction is valid on.\n     */\n    get chainId() { return this.#chainId; }\n    set chainId(value) { this.#chainId = getBigInt(value); }\n    /**\n     *  If signed, the signature for this transaction.\n     */\n    get signature() { return this.#sig || null; }\n    set signature(value) {\n        this.#sig = (value == null) ? null : Signature.from(value);\n    }\n    /**\n     *  The access list.\n     *\n     *  An access list permits discounted (but pre-paid) access to\n     *  bytecode and state variable access within contract execution.\n     */\n    get accessList() {\n        const value = this.#accessList || null;\n        if (value == null) {\n            if (this.type === 1 || this.type === 2 || this.type === 3) {\n                // @TODO: in v7, this should assign the value or become\n                // a live object itself, otherwise mutation is inconsistent\n                return [];\n            }\n            return null;\n        }\n        return value;\n    }\n    set accessList(value) {\n        this.#accessList = (value == null) ? null : accessListify(value);\n    }\n    /**\n     *  The max fee per blob gas for Cancun transactions.\n     */\n    get maxFeePerBlobGas() {\n        const value = this.#maxFeePerBlobGas;\n        if (value == null && this.type === 3) {\n            return BN_0;\n        }\n        return value;\n    }\n    set maxFeePerBlobGas(value) {\n        this.#maxFeePerBlobGas = (value == null) ? null : getBigInt(value, \"maxFeePerBlobGas\");\n    }\n    /**\n     *  The BLOb versioned hashes for Cancun transactions.\n     */\n    get blobVersionedHashes() {\n        // @TODO: Mutation is inconsistent; if unset, the returned value\n        // cannot mutate the object, if set it can\n        let value = this.#blobVersionedHashes;\n        if (value == null && this.type === 3) {\n            return [];\n        }\n        return value;\n    }\n    set blobVersionedHashes(value) {\n        if (value != null) {\n            assertArgument(Array.isArray(value), \"blobVersionedHashes must be an Array\", \"value\", value);\n            value = value.slice();\n            for (let i = 0; i < value.length; i++) {\n                assertArgument(isHexString(value[i], 32), \"invalid blobVersionedHash\", `value[${i}]`, value[i]);\n            }\n        }\n        this.#blobVersionedHashes = value;\n    }\n    /**\n     *  The BLObs for the Transaction, if any.\n     *\n     *  If ``blobs`` is non-``null``, then the [[seriailized]]\n     *  will return the network formatted sidecar, otherwise it\n     *  will return the standard [[link-eip-2718]] payload. The\n     *  [[unsignedSerialized]] is unaffected regardless.\n     *\n     *  When setting ``blobs``, either fully valid [[Blob]] objects\n     *  may be specified (i.e. correctly padded, with correct\n     *  committments and proofs) or a raw [[BytesLike]] may\n     *  be provided.\n     *\n     *  If raw [[BytesLike]] are provided, the [[kzg]] property **must**\n     *  be already set. The blob will be correctly padded and the\n     *  [[KzgLibrary]] will be used to compute the committment and\n     *  proof for the blob.\n     *\n     *  A BLOb is a sequence of field elements, each of which must\n     *  be within the BLS field modulo, so some additional processing\n     *  may be required to encode arbitrary data to ensure each 32 byte\n     *  field is within the valid range.\n     *\n     *  Setting this automatically populates [[blobVersionedHashes]],\n     *  overwriting any existing values. Setting this to ``null``\n     *  does **not** remove the [[blobVersionedHashes]], leaving them\n     *  present.\n     */\n    get blobs() {\n        if (this.#blobs == null) {\n            return null;\n        }\n        return this.#blobs.map((b) => Object.assign({}, b));\n    }\n    set blobs(_blobs) {\n        if (_blobs == null) {\n            this.#blobs = null;\n            return;\n        }\n        const blobs = [];\n        const versionedHashes = [];\n        for (let i = 0; i < _blobs.length; i++) {\n            const blob = _blobs[i];\n            if (isBytesLike(blob)) {\n                assert(this.#kzg, \"adding a raw blob requires a KZG library\", \"UNSUPPORTED_OPERATION\", {\n                    operation: \"set blobs()\"\n                });\n                let data = getBytes(blob);\n                assertArgument(data.length <= BLOB_SIZE, \"blob is too large\", `blobs[${i}]`, blob);\n                // Pad blob if necessary\n                if (data.length !== BLOB_SIZE) {\n                    const padded = new Uint8Array(BLOB_SIZE);\n                    padded.set(data);\n                    data = padded;\n                }\n                const commit = this.#kzg.blobToKzgCommitment(data);\n                const proof = hexlify(this.#kzg.computeBlobKzgProof(data, commit));\n                blobs.push({\n                    data: hexlify(data),\n                    commitment: hexlify(commit),\n                    proof\n                });\n                versionedHashes.push(getVersionedHash(1, commit));\n            }\n            else {\n                const commit = hexlify(blob.commitment);\n                blobs.push({\n                    data: hexlify(blob.data),\n                    commitment: commit,\n                    proof: hexlify(blob.proof)\n                });\n                versionedHashes.push(getVersionedHash(1, commit));\n            }\n        }\n        this.#blobs = blobs;\n        this.#blobVersionedHashes = versionedHashes;\n    }\n    get kzg() { return this.#kzg; }\n    set kzg(kzg) {\n        this.#kzg = kzg;\n    }\n    /**\n     *  Creates a new Transaction with default values.\n     */\n    constructor() {\n        this.#type = null;\n        this.#to = null;\n        this.#nonce = 0;\n        this.#gasLimit = BN_0;\n        this.#gasPrice = null;\n        this.#maxPriorityFeePerGas = null;\n        this.#maxFeePerGas = null;\n        this.#data = \"0x\";\n        this.#value = BN_0;\n        this.#chainId = BN_0;\n        this.#sig = null;\n        this.#accessList = null;\n        this.#maxFeePerBlobGas = null;\n        this.#blobVersionedHashes = null;\n        this.#blobs = null;\n        this.#kzg = null;\n    }\n    /**\n     *  The transaction hash, if signed. Otherwise, ``null``.\n     */\n    get hash() {\n        if (this.signature == null) {\n            return null;\n        }\n        return keccak256(this.#getSerialized(true, false));\n    }\n    /**\n     *  The pre-image hash of this transaction.\n     *\n     *  This is the digest that a [[Signer]] must sign to authorize\n     *  this transaction.\n     */\n    get unsignedHash() {\n        return keccak256(this.unsignedSerialized);\n    }\n    /**\n     *  The sending address, if signed. Otherwise, ``null``.\n     */\n    get from() {\n        if (this.signature == null) {\n            return null;\n        }\n        return recoverAddress(this.unsignedHash, this.signature);\n    }\n    /**\n     *  The public key of the sender, if signed. Otherwise, ``null``.\n     */\n    get fromPublicKey() {\n        if (this.signature == null) {\n            return null;\n        }\n        return SigningKey.recoverPublicKey(this.unsignedHash, this.signature);\n    }\n    /**\n     *  Returns true if signed.\n     *\n     *  This provides a Type Guard that properties requiring a signed\n     *  transaction are non-null.\n     */\n    isSigned() {\n        return this.signature != null;\n    }\n    #getSerialized(signed, sidecar) {\n        assert(!signed || this.signature != null, \"cannot serialize unsigned transaction; maybe you meant .unsignedSerialized\", \"UNSUPPORTED_OPERATION\", { operation: \".serialized\" });\n        const sig = signed ? this.signature : null;\n        switch (this.inferType()) {\n            case 0:\n                return _serializeLegacy(this, sig);\n            case 1:\n                return _serializeEip2930(this, sig);\n            case 2:\n                return _serializeEip1559(this, sig);\n            case 3:\n                return _serializeEip4844(this, sig, sidecar ? this.blobs : null);\n        }\n        assert(false, \"unsupported transaction type\", \"UNSUPPORTED_OPERATION\", { operation: \".serialized\" });\n    }\n    /**\n     *  The serialized transaction.\n     *\n     *  This throws if the transaction is unsigned. For the pre-image,\n     *  use [[unsignedSerialized]].\n     */\n    get serialized() {\n        return this.#getSerialized(true, true);\n    }\n    /**\n     *  The transaction pre-image.\n     *\n     *  The hash of this is the digest which needs to be signed to\n     *  authorize this transaction.\n     */\n    get unsignedSerialized() {\n        return this.#getSerialized(false, false);\n    }\n    /**\n     *  Return the most \"likely\" type; currently the highest\n     *  supported transaction type.\n     */\n    inferType() {\n        const types = this.inferTypes();\n        // Prefer London (EIP-1559) over Cancun (BLOb)\n        if (types.indexOf(2) >= 0) {\n            return 2;\n        }\n        // Return the highest inferred type\n        return (types.pop());\n    }\n    /**\n     *  Validates the explicit properties and returns a list of compatible\n     *  transaction types.\n     */\n    inferTypes() {\n        // Checks that there are no conflicting properties set\n        const hasGasPrice = this.gasPrice != null;\n        const hasFee = (this.maxFeePerGas != null || this.maxPriorityFeePerGas != null);\n        const hasAccessList = (this.accessList != null);\n        const hasBlob = (this.#maxFeePerBlobGas != null || this.#blobVersionedHashes);\n        //if (hasGasPrice && hasFee) {\n        //    throw new Error(\"transaction cannot have gasPrice and maxFeePerGas\");\n        //}\n        if (this.maxFeePerGas != null && this.maxPriorityFeePerGas != null) {\n            assert(this.maxFeePerGas >= this.maxPriorityFeePerGas, \"priorityFee cannot be more than maxFee\", \"BAD_DATA\", { value: this });\n        }\n        //if (this.type === 2 && hasGasPrice) {\n        //    throw new Error(\"eip-1559 transaction cannot have gasPrice\");\n        //}\n        assert(!hasFee || (this.type !== 0 && this.type !== 1), \"transaction type cannot have maxFeePerGas or maxPriorityFeePerGas\", \"BAD_DATA\", { value: this });\n        assert(this.type !== 0 || !hasAccessList, \"legacy transaction cannot have accessList\", \"BAD_DATA\", { value: this });\n        const types = [];\n        // Explicit type\n        if (this.type != null) {\n            types.push(this.type);\n        }\n        else {\n            if (hasFee) {\n                types.push(2);\n            }\n            else if (hasGasPrice) {\n                types.push(1);\n                if (!hasAccessList) {\n                    types.push(0);\n                }\n            }\n            else if (hasAccessList) {\n                types.push(1);\n                types.push(2);\n            }\n            else if (hasBlob && this.to) {\n                types.push(3);\n            }\n            else {\n                types.push(0);\n                types.push(1);\n                types.push(2);\n                types.push(3);\n            }\n        }\n        types.sort();\n        return types;\n    }\n    /**\n     *  Returns true if this transaction is a legacy transaction (i.e.\n     *  ``type === 0``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isLegacy() {\n        return (this.type === 0);\n    }\n    /**\n     *  Returns true if this transaction is berlin hardform transaction (i.e.\n     *  ``type === 1``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isBerlin() {\n        return (this.type === 1);\n    }\n    /**\n     *  Returns true if this transaction is london hardform transaction (i.e.\n     *  ``type === 2``).\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isLondon() {\n        return (this.type === 2);\n    }\n    /**\n     *  Returns true if this transaction is an [[link-eip-4844]] BLOB\n     *  transaction.\n     *\n     *  This provides a Type Guard that the related properties are\n     *  non-null.\n     */\n    isCancun() {\n        return (this.type === 3);\n    }\n    /**\n     *  Create a copy of this transaciton.\n     */\n    clone() {\n        return Transaction.from(this);\n    }\n    /**\n     *  Return a JSON-friendly object.\n     */\n    toJSON() {\n        const s = (v) => {\n            if (v == null) {\n                return null;\n            }\n            return v.toString();\n        };\n        return {\n            type: this.type,\n            to: this.to,\n            //            from: this.from,\n            data: this.data,\n            nonce: this.nonce,\n            gasLimit: s(this.gasLimit),\n            gasPrice: s(this.gasPrice),\n            maxPriorityFeePerGas: s(this.maxPriorityFeePerGas),\n            maxFeePerGas: s(this.maxFeePerGas),\n            value: s(this.value),\n            chainId: s(this.chainId),\n            sig: this.signature ? this.signature.toJSON() : null,\n            accessList: this.accessList\n        };\n    }\n    /**\n     *  Create a **Transaction** from a serialized transaction or a\n     *  Transaction-like object.\n     */\n    static from(tx) {\n        if (tx == null) {\n            return new Transaction();\n        }\n        if (typeof (tx) === \"string\") {\n            const payload = getBytes(tx);\n            if (payload[0] >= 0x7f) { // @TODO: > vs >= ??\n                return Transaction.from(_parseLegacy(payload));\n            }\n            switch (payload[0]) {\n                case 1: return Transaction.from(_parseEip2930(payload));\n                case 2: return Transaction.from(_parseEip1559(payload));\n                case 3: return Transaction.from(_parseEip4844(payload));\n            }\n            assert(false, \"unsupported transaction type\", \"UNSUPPORTED_OPERATION\", { operation: \"from\" });\n        }\n        const result = new Transaction();\n        if (tx.type != null) {\n            result.type = tx.type;\n        }\n        if (tx.to != null) {\n            result.to = tx.to;\n        }\n        if (tx.nonce != null) {\n            result.nonce = tx.nonce;\n        }\n        if (tx.gasLimit != null) {\n            result.gasLimit = tx.gasLimit;\n        }\n        if (tx.gasPrice != null) {\n            result.gasPrice = tx.gasPrice;\n        }\n        if (tx.maxPriorityFeePerGas != null) {\n            result.maxPriorityFeePerGas = tx.maxPriorityFeePerGas;\n        }\n        if (tx.maxFeePerGas != null) {\n            result.maxFeePerGas = tx.maxFeePerGas;\n        }\n        if (tx.maxFeePerBlobGas != null) {\n            result.maxFeePerBlobGas = tx.maxFeePerBlobGas;\n        }\n        if (tx.data != null) {\n            result.data = tx.data;\n        }\n        if (tx.value != null) {\n            result.value = tx.value;\n        }\n        if (tx.chainId != null) {\n            result.chainId = tx.chainId;\n        }\n        if (tx.signature != null) {\n            result.signature = Signature.from(tx.signature);\n        }\n        if (tx.accessList != null) {\n            result.accessList = tx.accessList;\n        }\n        // This will get overwritten by blobs, if present\n        if (tx.blobVersionedHashes != null) {\n            result.blobVersionedHashes = tx.blobVersionedHashes;\n        }\n        // Make sure we assign the kzg before assigning blobs, which\n        // require the library in the event raw blob data is provided.\n        if (tx.kzg != null) {\n            result.kzg = tx.kzg;\n        }\n        if (tx.blobs != null) {\n            result.blobs = tx.blobs;\n        }\n        if (tx.hash != null) {\n            assertArgument(result.isSigned(), \"unsigned transaction cannot define '.hash'\", \"tx\", tx);\n            assertArgument(result.hash === tx.hash, \"hash mismatch\", \"tx\", tx);\n        }\n        if (tx.from != null) {\n            assertArgument(result.isSigned(), \"unsigned transaction cannot define '.from'\", \"tx\", tx);\n            assertArgument(result.from.toLowerCase() === (tx.from || \"\").toLowerCase(), \"from mismatch\", \"tx\", tx);\n        }\n        return result;\n    }\n}\n//# sourceMappingURL=transaction.js.map","import { keccak256 } from \"../crypto/index.js\";\nimport { MessagePrefix } from \"../constants/index.js\";\nimport { recoverAddress } from \"../transaction/index.js\";\nimport { concat, toUtf8Bytes } from \"../utils/index.js\";\n/**\n *  Computes the [[link-eip-191]] personal-sign message digest to sign.\n *\n *  This prefixes the message with [[MessagePrefix]] and the decimal length\n *  of %%message%% and computes the [[keccak256]] digest.\n *\n *  If %%message%% is a string, it is converted to its UTF-8 bytes\n *  first. To compute the digest of a [[DataHexString]], it must be converted\n *  to [bytes](getBytes).\n *\n *  @example:\n *    hashMessage(\"Hello World\")\n *    //_result:\n *\n *    // Hashes the SIX (6) string characters, i.e.\n *    // [ \"0\", \"x\", \"4\", \"2\", \"4\", \"3\" ]\n *    hashMessage(\"0x4243\")\n *    //_result:\n *\n *    // Hashes the TWO (2) bytes [ 0x42, 0x43 ]...\n *    hashMessage(getBytes(\"0x4243\"))\n *    //_result:\n *\n *    // ...which is equal to using data\n *    hashMessage(new Uint8Array([ 0x42, 0x43 ]))\n *    //_result:\n *\n */\nexport function hashMessage(message) {\n    if (typeof (message) === \"string\") {\n        message = toUtf8Bytes(message);\n    }\n    return keccak256(concat([\n        toUtf8Bytes(MessagePrefix),\n        toUtf8Bytes(String(message.length)),\n        message\n    ]));\n}\n/**\n *  Return the address of the private key that produced\n *  the signature %%sig%% during signing for %%message%%.\n */\nexport function verifyMessage(message, sig) {\n    const digest = hashMessage(message);\n    return recoverAddress(digest, sig);\n}\n//# sourceMappingURL=message.js.map","// NFKC (composed)             // (decomposed)\n/**\n *  A constant for the ether symbol (normalized using NFKC).\n *\n *  (**i.e.** ``\"\\\\u039e\"``)\n */\nexport const EtherSymbol = \"\\u039e\"; // \"\\uD835\\uDF63\";\n/**\n *  A constant for the [[link-eip-191]] personal message prefix.\n *\n *  (**i.e.** ``\"\\\\x19Ethereum Signed Message:\\\\n\"``)\n */\nexport const MessagePrefix = \"\\x19Ethereum Signed Message:\\n\";\n//# sourceMappingURL=strings.js.map","//import { TypedDataDomain, TypedDataField } from \"@ethersproject/providerabstract-signer\";\nimport { getAddress } from \"../address/index.js\";\nimport { keccak256 } from \"../crypto/index.js\";\nimport { recoverAddress } from \"../transaction/index.js\";\nimport { concat, defineProperties, getBigInt, getBytes, hexlify, isHexString, mask, toBeHex, toQuantity, toTwos, zeroPadValue, assertArgument } from \"../utils/index.js\";\nimport { id } from \"./id.js\";\nconst padding = new Uint8Array(32);\npadding.fill(0);\nconst BN__1 = BigInt(-1);\nconst BN_0 = BigInt(0);\nconst BN_1 = BigInt(1);\nconst BN_MAX_UINT256 = BigInt(\"0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");\n;\n;\nfunction hexPadRight(value) {\n    const bytes = getBytes(value);\n    const padOffset = bytes.length % 32;\n    if (padOffset) {\n        return concat([bytes, padding.slice(padOffset)]);\n    }\n    return hexlify(bytes);\n}\nconst hexTrue = toBeHex(BN_1, 32);\nconst hexFalse = toBeHex(BN_0, 32);\nconst domainFieldTypes = {\n    name: \"string\",\n    version: \"string\",\n    chainId: \"uint256\",\n    verifyingContract: \"address\",\n    salt: \"bytes32\"\n};\nconst domainFieldNames = [\n    \"name\", \"version\", \"chainId\", \"verifyingContract\", \"salt\"\n];\nfunction checkString(key) {\n    return function (value) {\n        assertArgument(typeof (value) === \"string\", `invalid domain value for ${JSON.stringify(key)}`, `domain.${key}`, value);\n        return value;\n    };\n}\nconst domainChecks = {\n    name: checkString(\"name\"),\n    version: checkString(\"version\"),\n    chainId: function (_value) {\n        const value = getBigInt(_value, \"domain.chainId\");\n        assertArgument(value >= 0, \"invalid chain ID\", \"domain.chainId\", _value);\n        if (Number.isSafeInteger(value)) {\n            return Number(value);\n        }\n        return toQuantity(value);\n    },\n    verifyingContract: function (value) {\n        try {\n            return getAddress(value).toLowerCase();\n        }\n        catch (error) { }\n        assertArgument(false, `invalid domain value \"verifyingContract\"`, \"domain.verifyingContract\", value);\n    },\n    salt: function (value) {\n        const bytes = getBytes(value, \"domain.salt\");\n        assertArgument(bytes.length === 32, `invalid domain value \"salt\"`, \"domain.salt\", value);\n        return hexlify(bytes);\n    }\n};\nfunction getBaseEncoder(type) {\n    // intXX and uintXX\n    {\n        const match = type.match(/^(u?)int(\\d+)$/);\n        if (match) {\n            const signed = (match[1] === \"\");\n            const width = parseInt(match[2]);\n            assertArgument(width % 8 === 0 && width !== 0 && width <= 256 && match[2] === String(width), \"invalid numeric width\", \"type\", type);\n            const boundsUpper = mask(BN_MAX_UINT256, signed ? (width - 1) : width);\n            const boundsLower = signed ? ((boundsUpper + BN_1) * BN__1) : BN_0;\n            return function (_value) {\n                const value = getBigInt(_value, \"value\");\n                assertArgument(value >= boundsLower && value <= boundsUpper, `value out-of-bounds for ${type}`, \"value\", value);\n                return toBeHex(signed ? toTwos(value, 256) : value, 32);\n            };\n        }\n    }\n    // bytesXX\n    {\n        const match = type.match(/^bytes(\\d+)$/);\n        if (match) {\n            const width = parseInt(match[1]);\n            assertArgument(width !== 0 && width <= 32 && match[1] === String(width), \"invalid bytes width\", \"type\", type);\n            return function (value) {\n                const bytes = getBytes(value);\n                assertArgument(bytes.length === width, `invalid length for ${type}`, \"value\", value);\n                return hexPadRight(value);\n            };\n        }\n    }\n    switch (type) {\n        case \"address\": return function (value) {\n            return zeroPadValue(getAddress(value), 32);\n        };\n        case \"bool\": return function (value) {\n            return ((!value) ? hexFalse : hexTrue);\n        };\n        case \"bytes\": return function (value) {\n            return keccak256(value);\n        };\n        case \"string\": return function (value) {\n            return id(value);\n        };\n    }\n    return null;\n}\nfunction encodeType(name, fields) {\n    return `${name}(${fields.map(({ name, type }) => (type + \" \" + name)).join(\",\")})`;\n}\n// foo[][3] => { base: \"foo\", index: \"[][3]\", array: {\n//     base: \"foo\", prefix: \"foo[]\", count: 3 } }\nfunction splitArray(type) {\n    const match = type.match(/^([^\\x5b]*)((\\x5b\\d*\\x5d)*)(\\x5b(\\d*)\\x5d)$/);\n    if (match) {\n        return {\n            base: match[1],\n            index: (match[2] + match[4]),\n            array: {\n                base: match[1],\n                prefix: (match[1] + match[2]),\n                count: (match[5] ? parseInt(match[5]) : -1),\n            }\n        };\n    }\n    return { base: type };\n}\n/**\n *  A **TypedDataEncode** prepares and encodes [[link-eip-712]] payloads\n *  for signed typed data.\n *\n *  This is useful for those that wish to compute various components of a\n *  typed data hash, primary types, or sub-components, but generally the\n *  higher level [[Signer-signTypedData]] is more useful.\n */\nexport class TypedDataEncoder {\n    /**\n     *  The primary type for the structured [[types]].\n     *\n     *  This is derived automatically from the [[types]], since no\n     *  recursion is possible, once the DAG for the types is consturcted\n     *  internally, the primary type must be the only remaining type with\n     *  no parent nodes.\n     */\n    primaryType;\n    #types;\n    /**\n     *  The types.\n     */\n    get types() {\n        return JSON.parse(this.#types);\n    }\n    #fullTypes;\n    #encoderCache;\n    /**\n     *  Create a new **TypedDataEncoder** for %%types%%.\n     *\n     *  This performs all necessary checking that types are valid and\n     *  do not violate the [[link-eip-712]] structural constraints as\n     *  well as computes the [[primaryType]].\n     */\n    constructor(_types) {\n        this.#fullTypes = new Map();\n        this.#encoderCache = new Map();\n        // Link struct types to their direct child structs\n        const links = new Map();\n        // Link structs to structs which contain them as a child\n        const parents = new Map();\n        // Link all subtypes within a given struct\n        const subtypes = new Map();\n        const types = {};\n        Object.keys(_types).forEach((type) => {\n            types[type] = _types[type].map(({ name, type }) => {\n                // Normalize the base type (unless name conflict)\n                let { base, index } = splitArray(type);\n                if (base === \"int\" && !_types[\"int\"]) {\n                    base = \"int256\";\n                }\n                if (base === \"uint\" && !_types[\"uint\"]) {\n                    base = \"uint256\";\n                }\n                return { name, type: (base + (index || \"\")) };\n            });\n            links.set(type, new Set());\n            parents.set(type, []);\n            subtypes.set(type, new Set());\n        });\n        this.#types = JSON.stringify(types);\n        for (const name in types) {\n            const uniqueNames = new Set();\n            for (const field of types[name]) {\n                // Check each field has a unique name\n                assertArgument(!uniqueNames.has(field.name), `duplicate variable name ${JSON.stringify(field.name)} in ${JSON.stringify(name)}`, \"types\", _types);\n                uniqueNames.add(field.name);\n                // Get the base type (drop any array specifiers)\n                const baseType = splitArray(field.type).base;\n                assertArgument(baseType !== name, `circular type reference to ${JSON.stringify(baseType)}`, \"types\", _types);\n                // Is this a base encoding type?\n                const encoder = getBaseEncoder(baseType);\n                if (encoder) {\n                    continue;\n                }\n                assertArgument(parents.has(baseType), `unknown type ${JSON.stringify(baseType)}`, \"types\", _types);\n                // Add linkage\n                parents.get(baseType).push(name);\n                links.get(name).add(baseType);\n            }\n        }\n        // Deduce the primary type\n        const primaryTypes = Array.from(parents.keys()).filter((n) => (parents.get(n).length === 0));\n        assertArgument(primaryTypes.length !== 0, \"missing primary type\", \"types\", _types);\n        assertArgument(primaryTypes.length === 1, `ambiguous primary types or unused types: ${primaryTypes.map((t) => (JSON.stringify(t))).join(\", \")}`, \"types\", _types);\n        defineProperties(this, { primaryType: primaryTypes[0] });\n        // Check for circular type references\n        function checkCircular(type, found) {\n            assertArgument(!found.has(type), `circular type reference to ${JSON.stringify(type)}`, \"types\", _types);\n            found.add(type);\n            for (const child of links.get(type)) {\n                if (!parents.has(child)) {\n                    continue;\n                }\n                // Recursively check children\n                checkCircular(child, found);\n                // Mark all ancestors as having this decendant\n                for (const subtype of found) {\n                    subtypes.get(subtype).add(child);\n                }\n            }\n            found.delete(type);\n        }\n        checkCircular(this.primaryType, new Set());\n        // Compute each fully describe type\n        for (const [name, set] of subtypes) {\n            const st = Array.from(set);\n            st.sort();\n            this.#fullTypes.set(name, encodeType(name, types[name]) + st.map((t) => encodeType(t, types[t])).join(\"\"));\n        }\n    }\n    /**\n     *  Returnthe encoder for the specific %%type%%.\n     */\n    getEncoder(type) {\n        let encoder = this.#encoderCache.get(type);\n        if (!encoder) {\n            encoder = this.#getEncoder(type);\n            this.#encoderCache.set(type, encoder);\n        }\n        return encoder;\n    }\n    #getEncoder(type) {\n        // Basic encoder type (address, bool, uint256, etc)\n        {\n            const encoder = getBaseEncoder(type);\n            if (encoder) {\n                return encoder;\n            }\n        }\n        // Array\n        const array = splitArray(type).array;\n        if (array) {\n            const subtype = array.prefix;\n            const subEncoder = this.getEncoder(subtype);\n            return (value) => {\n                assertArgument(array.count === -1 || array.count === value.length, `array length mismatch; expected length ${array.count}`, \"value\", value);\n                let result = value.map(subEncoder);\n                if (this.#fullTypes.has(subtype)) {\n                    result = result.map(keccak256);\n                }\n                return keccak256(concat(result));\n            };\n        }\n        // Struct\n        const fields = this.types[type];\n        if (fields) {\n            const encodedType = id(this.#fullTypes.get(type));\n            return (value) => {\n                const values = fields.map(({ name, type }) => {\n                    const result = this.getEncoder(type)(value[name]);\n                    if (this.#fullTypes.has(type)) {\n                        return keccak256(result);\n                    }\n                    return result;\n                });\n                values.unshift(encodedType);\n                return concat(values);\n            };\n        }\n        assertArgument(false, `unknown type: ${type}`, \"type\", type);\n    }\n    /**\n     *  Return the full type for %%name%%.\n     */\n    encodeType(name) {\n        const result = this.#fullTypes.get(name);\n        assertArgument(result, `unknown type: ${JSON.stringify(name)}`, \"name\", name);\n        return result;\n    }\n    /**\n     *  Return the encoded %%value%% for the %%type%%.\n     */\n    encodeData(type, value) {\n        return this.getEncoder(type)(value);\n    }\n    /**\n     *  Returns the hash of %%value%% for the type of %%name%%.\n     */\n    hashStruct(name, value) {\n        return keccak256(this.encodeData(name, value));\n    }\n    /**\n     *  Return the fulled encoded %%value%% for the [[types]].\n     */\n    encode(value) {\n        return this.encodeData(this.primaryType, value);\n    }\n    /**\n     *  Return the hash of the fully encoded %%value%% for the [[types]].\n     */\n    hash(value) {\n        return this.hashStruct(this.primaryType, value);\n    }\n    /**\n     *  @_ignore:\n     */\n    _visit(type, value, callback) {\n        // Basic encoder type (address, bool, uint256, etc)\n        {\n            const encoder = getBaseEncoder(type);\n            if (encoder) {\n                return callback(type, value);\n            }\n        }\n        // Array\n        const array = splitArray(type).array;\n        if (array) {\n            assertArgument(array.count === -1 || array.count === value.length, `array length mismatch; expected length ${array.count}`, \"value\", value);\n            return value.map((v) => this._visit(array.prefix, v, callback));\n        }\n        // Struct\n        const fields = this.types[type];\n        if (fields) {\n            return fields.reduce((accum, { name, type }) => {\n                accum[name] = this._visit(type, value[name], callback);\n                return accum;\n            }, {});\n        }\n        assertArgument(false, `unknown type: ${type}`, \"type\", type);\n    }\n    /**\n     *  Call %%calback%% for each value in %%value%%, passing the type and\n     *  component within %%value%%.\n     *\n     *  This is useful for replacing addresses or other transformation that\n     *  may be desired on each component, based on its type.\n     */\n    visit(value, callback) {\n        return this._visit(this.primaryType, value, callback);\n    }\n    /**\n     *  Create a new **TypedDataEncoder** for %%types%%.\n     */\n    static from(types) {\n        return new TypedDataEncoder(types);\n    }\n    /**\n     *  Return the primary type for %%types%%.\n     */\n    static getPrimaryType(types) {\n        return TypedDataEncoder.from(types).primaryType;\n    }\n    /**\n     *  Return the hashed struct for %%value%% using %%types%% and %%name%%.\n     */\n    static hashStruct(name, types, value) {\n        return TypedDataEncoder.from(types).hashStruct(name, value);\n    }\n    /**\n     *  Return the domain hash for %%domain%%.\n     */\n    static hashDomain(domain) {\n        const domainFields = [];\n        for (const name in domain) {\n            if (domain[name] == null) {\n                continue;\n            }\n            const type = domainFieldTypes[name];\n            assertArgument(type, `invalid typed-data domain key: ${JSON.stringify(name)}`, \"domain\", domain);\n            domainFields.push({ name, type });\n        }\n        domainFields.sort((a, b) => {\n            return domainFieldNames.indexOf(a.name) - domainFieldNames.indexOf(b.name);\n        });\n        return TypedDataEncoder.hashStruct(\"EIP712Domain\", { EIP712Domain: domainFields }, domain);\n    }\n    /**\n     *  Return the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.\n     */\n    static encode(domain, types, value) {\n        return concat([\n            \"0x1901\",\n            TypedDataEncoder.hashDomain(domain),\n            TypedDataEncoder.from(types).hash(value)\n        ]);\n    }\n    /**\n     *  Return the hash of the fully encoded [[link-eip-712]] %%value%% for %%types%% with %%domain%%.\n     */\n    static hash(domain, types, value) {\n        return keccak256(TypedDataEncoder.encode(domain, types, value));\n    }\n    // Replaces all address types with ENS names with their looked up address\n    /**\n     * Resolves to the value from resolving all addresses in %%value%% for\n     * %%types%% and the %%domain%%.\n     */\n    static async resolveNames(domain, types, value, resolveName) {\n        // Make a copy to isolate it from the object passed in\n        domain = Object.assign({}, domain);\n        // Allow passing null to ignore value\n        for (const key in domain) {\n            if (domain[key] == null) {\n                delete domain[key];\n            }\n        }\n        // Look up all ENS names\n        const ensCache = {};\n        // Do we need to look up the domain's verifyingContract?\n        if (domain.verifyingContract && !isHexString(domain.verifyingContract, 20)) {\n            ensCache[domain.verifyingContract] = \"0x\";\n        }\n        // We are going to use the encoder to visit all the base values\n        const encoder = TypedDataEncoder.from(types);\n        // Get a list of all the addresses\n        encoder.visit(value, (type, value) => {\n            if (type === \"address\" && !isHexString(value, 20)) {\n                ensCache[value] = \"0x\";\n            }\n            return value;\n        });\n        // Lookup each name\n        for (const name in ensCache) {\n            ensCache[name] = await resolveName(name);\n        }\n        // Replace the domain verifyingContract if needed\n        if (domain.verifyingContract && ensCache[domain.verifyingContract]) {\n            domain.verifyingContract = ensCache[domain.verifyingContract];\n        }\n        // Replace all ENS names with their address\n        value = encoder.visit(value, (type, value) => {\n            if (type === \"address\" && ensCache[value]) {\n                return ensCache[value];\n            }\n            return value;\n        });\n        return { domain, value };\n    }\n    /**\n     *  Returns the JSON-encoded payload expected by nodes which implement\n     *  the JSON-RPC [[link-eip-712]] method.\n     */\n    static getPayload(domain, types, value) {\n        // Validate the domain fields\n        TypedDataEncoder.hashDomain(domain);\n        // Derive the EIP712Domain Struct reference type\n        const domainValues = {};\n        const domainTypes = [];\n        domainFieldNames.forEach((name) => {\n            const value = domain[name];\n            if (value == null) {\n                return;\n            }\n            domainValues[name] = domainChecks[name](value);\n            domainTypes.push({ name, type: domainFieldTypes[name] });\n        });\n        const encoder = TypedDataEncoder.from(types);\n        // Get the normalized types\n        types = encoder.types;\n        const typesWithDomain = Object.assign({}, types);\n        assertArgument(typesWithDomain.EIP712Domain == null, \"types must not contain EIP712Domain type\", \"types.EIP712Domain\", types);\n        typesWithDomain.EIP712Domain = domainTypes;\n        // Validate the data structures and types\n        encoder.encode(value);\n        return {\n            types: typesWithDomain,\n            domain: domainValues,\n            primaryType: encoder.primaryType,\n            message: encoder.visit(value, (type, value) => {\n                // bytes\n                if (type.match(/^bytes(\\d*)/)) {\n                    return hexlify(getBytes(value));\n                }\n                // uint or int\n                if (type.match(/^u?int/)) {\n                    return getBigInt(value).toString();\n                }\n                switch (type) {\n                    case \"address\":\n                        return value.toLowerCase();\n                    case \"bool\":\n                        return !!value;\n                    case \"string\":\n                        assertArgument(typeof (value) === \"string\", \"invalid string\", \"value\", value);\n                        return value;\n                }\n                assertArgument(false, \"unsupported type\", \"type\", type);\n            })\n        };\n    }\n}\n/**\n *  Compute the address used to sign the typed data for the %%signature%%.\n */\nexport function verifyTypedData(domain, types, value, signature) {\n    return recoverAddress(TypedDataEncoder.hash(domain, types, value), signature);\n}\n//# sourceMappingURL=typed-data.js.map","/**\n *  A fragment is a single item from an ABI, which may represent any of:\n *\n *  - [Functions](FunctionFragment)\n *  - [Events](EventFragment)\n *  - [Constructors](ConstructorFragment)\n *  - Custom [Errors](ErrorFragment)\n *  - [Fallback or Receive](FallbackFragment) functions\n *\n *  @_subsection api/abi/abi-coder:Fragments  [about-fragments]\n */\nimport { defineProperties, getBigInt, getNumber, assert, assertPrivate, assertArgument } from \"../utils/index.js\";\nimport { id } from \"../hash/index.js\";\n;\n// [ \"a\", \"b\" ] => { \"a\": 1, \"b\": 1 }\nfunction setify(items) {\n    const result = new Set();\n    items.forEach((k) => result.add(k));\n    return Object.freeze(result);\n}\nconst _kwVisibDeploy = \"external public payable override\";\nconst KwVisibDeploy = setify(_kwVisibDeploy.split(\" \"));\n// Visibility Keywords\nconst _kwVisib = \"constant external internal payable private public pure view override\";\nconst KwVisib = setify(_kwVisib.split(\" \"));\nconst _kwTypes = \"constructor error event fallback function receive struct\";\nconst KwTypes = setify(_kwTypes.split(\" \"));\nconst _kwModifiers = \"calldata memory storage payable indexed\";\nconst KwModifiers = setify(_kwModifiers.split(\" \"));\nconst _kwOther = \"tuple returns\";\n// All Keywords\nconst _keywords = [_kwTypes, _kwModifiers, _kwOther, _kwVisib].join(\" \");\nconst Keywords = setify(_keywords.split(\" \"));\n// Single character tokens\nconst SimpleTokens = {\n    \"(\": \"OPEN_PAREN\", \")\": \"CLOSE_PAREN\",\n    \"[\": \"OPEN_BRACKET\", \"]\": \"CLOSE_BRACKET\",\n    \",\": \"COMMA\", \"@\": \"AT\"\n};\n// Parser regexes to consume the next token\nconst regexWhitespacePrefix = new RegExp(\"^(\\\\s*)\");\nconst regexNumberPrefix = new RegExp(\"^([0-9]+)\");\nconst regexIdPrefix = new RegExp(\"^([a-zA-Z$_][a-zA-Z0-9$_]*)\");\n// Parser regexs to check validity\nconst regexId = new RegExp(\"^([a-zA-Z$_][a-zA-Z0-9$_]*)$\");\nconst regexType = new RegExp(\"^(address|bool|bytes([0-9]*)|string|u?int([0-9]*))$\");\nclass TokenString {\n    #offset;\n    #tokens;\n    get offset() { return this.#offset; }\n    get length() { return this.#tokens.length - this.#offset; }\n    constructor(tokens) {\n        this.#offset = 0;\n        this.#tokens = tokens.slice();\n    }\n    clone() { return new TokenString(this.#tokens); }\n    reset() { this.#offset = 0; }\n    #subTokenString(from = 0, to = 0) {\n        return new TokenString(this.#tokens.slice(from, to).map((t) => {\n            return Object.freeze(Object.assign({}, t, {\n                match: (t.match - from),\n                linkBack: (t.linkBack - from),\n                linkNext: (t.linkNext - from),\n            }));\n        }));\n    }\n    // Pops and returns the value of the next token, if it is a keyword in allowed; throws if out of tokens\n    popKeyword(allowed) {\n        const top = this.peek();\n        if (top.type !== \"KEYWORD\" || !allowed.has(top.text)) {\n            throw new Error(`expected keyword ${top.text}`);\n        }\n        return this.pop().text;\n    }\n    // Pops and returns the value of the next token if it is `type`; throws if out of tokens\n    popType(type) {\n        if (this.peek().type !== type) {\n            const top = this.peek();\n            throw new Error(`expected ${type}; got ${top.type} ${JSON.stringify(top.text)}`);\n        }\n        return this.pop().text;\n    }\n    // Pops and returns a \"(\" TOKENS \")\"\n    popParen() {\n        const top = this.peek();\n        if (top.type !== \"OPEN_PAREN\") {\n            throw new Error(\"bad start\");\n        }\n        const result = this.#subTokenString(this.#offset + 1, top.match + 1);\n        this.#offset = top.match + 1;\n        return result;\n    }\n    // Pops and returns the items within \"(\" ITEM1 \",\" ITEM2 \",\" ... \")\"\n    popParams() {\n        const top = this.peek();\n        if (top.type !== \"OPEN_PAREN\") {\n            throw new Error(\"bad start\");\n        }\n        const result = [];\n        while (this.#offset < top.match - 1) {\n            const link = this.peek().linkNext;\n            result.push(this.#subTokenString(this.#offset + 1, link));\n            this.#offset = link;\n        }\n        this.#offset = top.match + 1;\n        return result;\n    }\n    // Returns the top Token, throwing if out of tokens\n    peek() {\n        if (this.#offset >= this.#tokens.length) {\n            throw new Error(\"out-of-bounds\");\n        }\n        return this.#tokens[this.#offset];\n    }\n    // Returns the next value, if it is a keyword in `allowed`\n    peekKeyword(allowed) {\n        const top = this.peekType(\"KEYWORD\");\n        return (top != null && allowed.has(top)) ? top : null;\n    }\n    // Returns the value of the next token if it is `type`\n    peekType(type) {\n        if (this.length === 0) {\n            return null;\n        }\n        const top = this.peek();\n        return (top.type === type) ? top.text : null;\n    }\n    // Returns the next token; throws if out of tokens\n    pop() {\n        const result = this.peek();\n        this.#offset++;\n        return result;\n    }\n    toString() {\n        const tokens = [];\n        for (let i = this.#offset; i < this.#tokens.length; i++) {\n            const token = this.#tokens[i];\n            tokens.push(`${token.type}:${token.text}`);\n        }\n        return `<TokenString ${tokens.join(\" \")}>`;\n    }\n}\nfunction lex(text) {\n    const tokens = [];\n    const throwError = (message) => {\n        const token = (offset < text.length) ? JSON.stringify(text[offset]) : \"$EOI\";\n        throw new Error(`invalid token ${token} at ${offset}: ${message}`);\n    };\n    let brackets = [];\n    let commas = [];\n    let offset = 0;\n    while (offset < text.length) {\n        // Strip off any leading whitespace\n        let cur = text.substring(offset);\n        let match = cur.match(regexWhitespacePrefix);\n        if (match) {\n            offset += match[1].length;\n            cur = text.substring(offset);\n        }\n        const token = { depth: brackets.length, linkBack: -1, linkNext: -1, match: -1, type: \"\", text: \"\", offset, value: -1 };\n        tokens.push(token);\n        let type = (SimpleTokens[cur[0]] || \"\");\n        if (type) {\n            token.type = type;\n            token.text = cur[0];\n            offset++;\n            if (type === \"OPEN_PAREN\") {\n                brackets.push(tokens.length - 1);\n                commas.push(tokens.length - 1);\n            }\n            else if (type == \"CLOSE_PAREN\") {\n                if (brackets.length === 0) {\n                    throwError(\"no matching open bracket\");\n                }\n                token.match = brackets.pop();\n                (tokens[token.match]).match = tokens.length - 1;\n                token.depth--;\n                token.linkBack = commas.pop();\n                (tokens[token.linkBack]).linkNext = tokens.length - 1;\n            }\n            else if (type === \"COMMA\") {\n                token.linkBack = commas.pop();\n                (tokens[token.linkBack]).linkNext = tokens.length - 1;\n                commas.push(tokens.length - 1);\n            }\n            else if (type === \"OPEN_BRACKET\") {\n                token.type = \"BRACKET\";\n            }\n            else if (type === \"CLOSE_BRACKET\") {\n                // Remove the CLOSE_BRACKET\n                let suffix = tokens.pop().text;\n                if (tokens.length > 0 && tokens[tokens.length - 1].type === \"NUMBER\") {\n                    const value = tokens.pop().text;\n                    suffix = value + suffix;\n                    (tokens[tokens.length - 1]).value = getNumber(value);\n                }\n                if (tokens.length === 0 || tokens[tokens.length - 1].type !== \"BRACKET\") {\n                    throw new Error(\"missing opening bracket\");\n                }\n                (tokens[tokens.length - 1]).text += suffix;\n            }\n            continue;\n        }\n        match = cur.match(regexIdPrefix);\n        if (match) {\n            token.text = match[1];\n            offset += token.text.length;\n            if (Keywords.has(token.text)) {\n                token.type = \"KEYWORD\";\n                continue;\n            }\n            if (token.text.match(regexType)) {\n                token.type = \"TYPE\";\n                continue;\n            }\n            token.type = \"ID\";\n            continue;\n        }\n        match = cur.match(regexNumberPrefix);\n        if (match) {\n            token.text = match[1];\n            token.type = \"NUMBER\";\n            offset += token.text.length;\n            continue;\n        }\n        throw new Error(`unexpected token ${JSON.stringify(cur[0])} at position ${offset}`);\n    }\n    return new TokenString(tokens.map((t) => Object.freeze(t)));\n}\n// Check only one of `allowed` is in `set`\nfunction allowSingle(set, allowed) {\n    let included = [];\n    for (const key in allowed.keys()) {\n        if (set.has(key)) {\n            included.push(key);\n        }\n    }\n    if (included.length > 1) {\n        throw new Error(`conflicting types: ${included.join(\", \")}`);\n    }\n}\n// Functions to process a Solidity Signature TokenString from left-to-right for...\n// ...the name with an optional type, returning the name\nfunction consumeName(type, tokens) {\n    if (tokens.peekKeyword(KwTypes)) {\n        const keyword = tokens.pop().text;\n        if (keyword !== type) {\n            throw new Error(`expected ${type}, got ${keyword}`);\n        }\n    }\n    return tokens.popType(\"ID\");\n}\n// ...all keywords matching allowed, returning the keywords\nfunction consumeKeywords(tokens, allowed) {\n    const keywords = new Set();\n    while (true) {\n        const keyword = tokens.peekType(\"KEYWORD\");\n        if (keyword == null || (allowed && !allowed.has(keyword))) {\n            break;\n        }\n        tokens.pop();\n        if (keywords.has(keyword)) {\n            throw new Error(`duplicate keywords: ${JSON.stringify(keyword)}`);\n        }\n        keywords.add(keyword);\n    }\n    return Object.freeze(keywords);\n}\n// ...all visibility keywords, returning the coalesced mutability\nfunction consumeMutability(tokens) {\n    let modifiers = consumeKeywords(tokens, KwVisib);\n    // Detect conflicting modifiers\n    allowSingle(modifiers, setify(\"constant payable nonpayable\".split(\" \")));\n    allowSingle(modifiers, setify(\"pure view payable nonpayable\".split(\" \")));\n    // Process mutability states\n    if (modifiers.has(\"view\")) {\n        return \"view\";\n    }\n    if (modifiers.has(\"pure\")) {\n        return \"pure\";\n    }\n    if (modifiers.has(\"payable\")) {\n        return \"payable\";\n    }\n    if (modifiers.has(\"nonpayable\")) {\n        return \"nonpayable\";\n    }\n    // Process legacy `constant` last\n    if (modifiers.has(\"constant\")) {\n        return \"view\";\n    }\n    return \"nonpayable\";\n}\n// ...a parameter list, returning the ParamType list\nfunction consumeParams(tokens, allowIndexed) {\n    return tokens.popParams().map((t) => ParamType.from(t, allowIndexed));\n}\n// ...a gas limit, returning a BigNumber or null if none\nfunction consumeGas(tokens) {\n    if (tokens.peekType(\"AT\")) {\n        tokens.pop();\n        if (tokens.peekType(\"NUMBER\")) {\n            return getBigInt(tokens.pop().text);\n        }\n        throw new Error(\"invalid gas\");\n    }\n    return null;\n}\nfunction consumeEoi(tokens) {\n    if (tokens.length) {\n        throw new Error(`unexpected tokens at offset ${tokens.offset}: ${tokens.toString()}`);\n    }\n}\nconst regexArrayType = new RegExp(/^(.*)\\[([0-9]*)\\]$/);\nfunction verifyBasicType(type) {\n    const match = type.match(regexType);\n    assertArgument(match, \"invalid type\", \"type\", type);\n    if (type === \"uint\") {\n        return \"uint256\";\n    }\n    if (type === \"int\") {\n        return \"int256\";\n    }\n    if (match[2]) {\n        // bytesXX\n        const length = parseInt(match[2]);\n        assertArgument(length !== 0 && length <= 32, \"invalid bytes length\", \"type\", type);\n    }\n    else if (match[3]) {\n        // intXX or uintXX\n        const size = parseInt(match[3]);\n        assertArgument(size !== 0 && size <= 256 && (size % 8) === 0, \"invalid numeric width\", \"type\", type);\n    }\n    return type;\n}\n// Make the Fragment constructors effectively private\nconst _guard = {};\nconst internal = Symbol.for(\"_ethers_internal\");\nconst ParamTypeInternal = \"_ParamTypeInternal\";\nconst ErrorFragmentInternal = \"_ErrorInternal\";\nconst EventFragmentInternal = \"_EventInternal\";\nconst ConstructorFragmentInternal = \"_ConstructorInternal\";\nconst FallbackFragmentInternal = \"_FallbackInternal\";\nconst FunctionFragmentInternal = \"_FunctionInternal\";\nconst StructFragmentInternal = \"_StructInternal\";\n/**\n *  Each input and output of a [[Fragment]] is an Array of **ParamType**.\n */\nexport class ParamType {\n    /**\n     *  The local name of the parameter (or ``\"\"`` if unbound)\n     */\n    name;\n    /**\n     *  The fully qualified type (e.g. ``\"address\"``, ``\"tuple(address)\"``,\n     *  ``\"uint256[3][]\"``)\n     */\n    type;\n    /**\n     *  The base type (e.g. ``\"address\"``, ``\"tuple\"``, ``\"array\"``)\n     */\n    baseType;\n    /**\n     *  True if the parameters is indexed.\n     *\n     *  For non-indexable types this is ``null``.\n     */\n    indexed;\n    /**\n     *  The components for the tuple.\n     *\n     *  For non-tuple types this is ``null``.\n     */\n    components;\n    /**\n     *  The array length, or ``-1`` for dynamic-lengthed arrays.\n     *\n     *  For non-array types this is ``null``.\n     */\n    arrayLength;\n    /**\n     *  The type of each child in the array.\n     *\n     *  For non-array types this is ``null``.\n     */\n    arrayChildren;\n    /**\n     *  @private\n     */\n    constructor(guard, name, type, baseType, indexed, components, arrayLength, arrayChildren) {\n        assertPrivate(guard, _guard, \"ParamType\");\n        Object.defineProperty(this, internal, { value: ParamTypeInternal });\n        if (components) {\n            components = Object.freeze(components.slice());\n        }\n        if (baseType === \"array\") {\n            if (arrayLength == null || arrayChildren == null) {\n                throw new Error(\"\");\n            }\n        }\n        else if (arrayLength != null || arrayChildren != null) {\n            throw new Error(\"\");\n        }\n        if (baseType === \"tuple\") {\n            if (components == null) {\n                throw new Error(\"\");\n            }\n        }\n        else if (components != null) {\n            throw new Error(\"\");\n        }\n        defineProperties(this, {\n            name, type, baseType, indexed, components, arrayLength, arrayChildren\n        });\n    }\n    /**\n     *  Return a string representation of this type.\n     *\n     *  For example,\n     *\n     *  ``sighash\" => \"(uint256,address)\"``\n     *\n     *  ``\"minimal\" => \"tuple(uint256,address) indexed\"``\n     *\n     *  ``\"full\" => \"tuple(uint256 foo, address bar) indexed baz\"``\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            const name = this.name || \"\";\n            if (this.isArray()) {\n                const result = JSON.parse(this.arrayChildren.format(\"json\"));\n                result.name = name;\n                result.type += `[${(this.arrayLength < 0 ? \"\" : String(this.arrayLength))}]`;\n                return JSON.stringify(result);\n            }\n            const result = {\n                type: ((this.baseType === \"tuple\") ? \"tuple\" : this.type),\n                name\n            };\n            if (typeof (this.indexed) === \"boolean\") {\n                result.indexed = this.indexed;\n            }\n            if (this.isTuple()) {\n                result.components = this.components.map((c) => JSON.parse(c.format(format)));\n            }\n            return JSON.stringify(result);\n        }\n        let result = \"\";\n        // Array\n        if (this.isArray()) {\n            result += this.arrayChildren.format(format);\n            result += `[${(this.arrayLength < 0 ? \"\" : String(this.arrayLength))}]`;\n        }\n        else {\n            if (this.isTuple()) {\n                result += \"(\" + this.components.map((comp) => comp.format(format)).join((format === \"full\") ? \", \" : \",\") + \")\";\n            }\n            else {\n                result += this.type;\n            }\n        }\n        if (format !== \"sighash\") {\n            if (this.indexed === true) {\n                result += \" indexed\";\n            }\n            if (format === \"full\" && this.name) {\n                result += \" \" + this.name;\n            }\n        }\n        return result;\n    }\n    /**\n     *  Returns true if %%this%% is an Array type.\n     *\n     *  This provides a type gaurd ensuring that [[arrayChildren]]\n     *  and [[arrayLength]] are non-null.\n     */\n    isArray() {\n        return (this.baseType === \"array\");\n    }\n    /**\n     *  Returns true if %%this%% is a Tuple type.\n     *\n     *  This provides a type gaurd ensuring that [[components]]\n     *  is non-null.\n     */\n    isTuple() {\n        return (this.baseType === \"tuple\");\n    }\n    /**\n     *  Returns true if %%this%% is an Indexable type.\n     *\n     *  This provides a type gaurd ensuring that [[indexed]]\n     *  is non-null.\n     */\n    isIndexable() {\n        return (this.indexed != null);\n    }\n    /**\n     *  Walks the **ParamType** with %%value%%, calling %%process%%\n     *  on each type, destructing the %%value%% recursively.\n     */\n    walk(value, process) {\n        if (this.isArray()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid array value\");\n            }\n            if (this.arrayLength !== -1 && value.length !== this.arrayLength) {\n                throw new Error(\"array is wrong length\");\n            }\n            const _this = this;\n            return value.map((v) => (_this.arrayChildren.walk(v, process)));\n        }\n        if (this.isTuple()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid tuple value\");\n            }\n            if (value.length !== this.components.length) {\n                throw new Error(\"array is wrong length\");\n            }\n            const _this = this;\n            return value.map((v, i) => (_this.components[i].walk(v, process)));\n        }\n        return process(this.type, value);\n    }\n    #walkAsync(promises, value, process, setValue) {\n        if (this.isArray()) {\n            if (!Array.isArray(value)) {\n                throw new Error(\"invalid array value\");\n            }\n            if (this.arrayLength !== -1 && value.length !== this.arrayLength) {\n                throw new Error(\"array is wrong length\");\n            }\n            const childType = this.arrayChildren;\n            const result = value.slice();\n            result.forEach((value, index) => {\n                childType.#walkAsync(promises, value, process, (value) => {\n                    result[index] = value;\n                });\n            });\n            setValue(result);\n            return;\n        }\n        if (this.isTuple()) {\n            const components = this.components;\n            // Convert the object into an array\n            let result;\n            if (Array.isArray(value)) {\n                result = value.slice();\n            }\n            else {\n                if (value == null || typeof (value) !== \"object\") {\n                    throw new Error(\"invalid tuple value\");\n                }\n                result = components.map((param) => {\n                    if (!param.name) {\n                        throw new Error(\"cannot use object value with unnamed components\");\n                    }\n                    if (!(param.name in value)) {\n                        throw new Error(`missing value for component ${param.name}`);\n                    }\n                    return value[param.name];\n                });\n            }\n            if (result.length !== this.components.length) {\n                throw new Error(\"array is wrong length\");\n            }\n            result.forEach((value, index) => {\n                components[index].#walkAsync(promises, value, process, (value) => {\n                    result[index] = value;\n                });\n            });\n            setValue(result);\n            return;\n        }\n        const result = process(this.type, value);\n        if (result.then) {\n            promises.push((async function () { setValue(await result); })());\n        }\n        else {\n            setValue(result);\n        }\n    }\n    /**\n     *  Walks the **ParamType** with %%value%%, asynchronously calling\n     *  %%process%% on each type, destructing the %%value%% recursively.\n     *\n     *  This can be used to resolve ENS names by walking and resolving each\n     *  ``\"address\"`` type.\n     */\n    async walkAsync(value, process) {\n        const promises = [];\n        const result = [value];\n        this.#walkAsync(promises, value, process, (value) => {\n            result[0] = value;\n        });\n        if (promises.length) {\n            await Promise.all(promises);\n        }\n        return result[0];\n    }\n    /**\n     *  Creates a new **ParamType** for %%obj%%.\n     *\n     *  If %%allowIndexed%% then the ``indexed`` keyword is permitted,\n     *  otherwise the ``indexed`` keyword will throw an error.\n     */\n    static from(obj, allowIndexed) {\n        if (ParamType.isParamType(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return ParamType.from(lex(obj), allowIndexed);\n            }\n            catch (error) {\n                assertArgument(false, \"invalid param type\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            let type = \"\", baseType = \"\";\n            let comps = null;\n            if (consumeKeywords(obj, setify([\"tuple\"])).has(\"tuple\") || obj.peekType(\"OPEN_PAREN\")) {\n                // Tuple\n                baseType = \"tuple\";\n                comps = obj.popParams().map((t) => ParamType.from(t));\n                type = `tuple(${comps.map((c) => c.format()).join(\",\")})`;\n            }\n            else {\n                // Normal\n                type = verifyBasicType(obj.popType(\"TYPE\"));\n                baseType = type;\n            }\n            // Check for Array\n            let arrayChildren = null;\n            let arrayLength = null;\n            while (obj.length && obj.peekType(\"BRACKET\")) {\n                const bracket = obj.pop(); //arrays[i];\n                arrayChildren = new ParamType(_guard, \"\", type, baseType, null, comps, arrayLength, arrayChildren);\n                arrayLength = bracket.value;\n                type += bracket.text;\n                baseType = \"array\";\n                comps = null;\n            }\n            let indexed = null;\n            const keywords = consumeKeywords(obj, KwModifiers);\n            if (keywords.has(\"indexed\")) {\n                if (!allowIndexed) {\n                    throw new Error(\"\");\n                }\n                indexed = true;\n            }\n            const name = (obj.peekType(\"ID\") ? obj.pop().text : \"\");\n            if (obj.length) {\n                throw new Error(\"leftover tokens\");\n            }\n            return new ParamType(_guard, name, type, baseType, indexed, comps, arrayLength, arrayChildren);\n        }\n        const name = obj.name;\n        assertArgument(!name || (typeof (name) === \"string\" && name.match(regexId)), \"invalid name\", \"obj.name\", name);\n        let indexed = obj.indexed;\n        if (indexed != null) {\n            assertArgument(allowIndexed, \"parameter cannot be indexed\", \"obj.indexed\", obj.indexed);\n            indexed = !!indexed;\n        }\n        let type = obj.type;\n        let arrayMatch = type.match(regexArrayType);\n        if (arrayMatch) {\n            const arrayLength = parseInt(arrayMatch[2] || \"-1\");\n            const arrayChildren = ParamType.from({\n                type: arrayMatch[1],\n                components: obj.components\n            });\n            return new ParamType(_guard, name || \"\", type, \"array\", indexed, null, arrayLength, arrayChildren);\n        }\n        if (type === \"tuple\" || type.startsWith(\"tuple(\" /* fix: ) */) || type.startsWith(\"(\" /* fix: ) */)) {\n            const comps = (obj.components != null) ? obj.components.map((c) => ParamType.from(c)) : null;\n            const tuple = new ParamType(_guard, name || \"\", type, \"tuple\", indexed, comps, null, null);\n            // @TODO: use lexer to validate and normalize type\n            return tuple;\n        }\n        type = verifyBasicType(obj.type);\n        return new ParamType(_guard, name || \"\", type, type, indexed, null, null, null);\n    }\n    /**\n     *  Returns true if %%value%% is a **ParamType**.\n     */\n    static isParamType(value) {\n        return (value && value[internal] === ParamTypeInternal);\n    }\n}\n/**\n *  An abstract class to represent An individual fragment from a parse ABI.\n */\nexport class Fragment {\n    /**\n     *  The type of the fragment.\n     */\n    type;\n    /**\n     *  The inputs for the fragment.\n     */\n    inputs;\n    /**\n     *  @private\n     */\n    constructor(guard, type, inputs) {\n        assertPrivate(guard, _guard, \"Fragment\");\n        inputs = Object.freeze(inputs.slice());\n        defineProperties(this, { type, inputs });\n    }\n    /**\n     *  Creates a new **Fragment** for %%obj%%, wich can be any supported\n     *  ABI frgament type.\n     */\n    static from(obj) {\n        if (typeof (obj) === \"string\") {\n            // Try parsing JSON...\n            try {\n                Fragment.from(JSON.parse(obj));\n            }\n            catch (e) { }\n            // ...otherwise, use the human-readable lexer\n            return Fragment.from(lex(obj));\n        }\n        if (obj instanceof TokenString) {\n            // Human-readable ABI (already lexed)\n            const type = obj.peekKeyword(KwTypes);\n            switch (type) {\n                case \"constructor\": return ConstructorFragment.from(obj);\n                case \"error\": return ErrorFragment.from(obj);\n                case \"event\": return EventFragment.from(obj);\n                case \"fallback\":\n                case \"receive\":\n                    return FallbackFragment.from(obj);\n                case \"function\": return FunctionFragment.from(obj);\n                case \"struct\": return StructFragment.from(obj);\n            }\n        }\n        else if (typeof (obj) === \"object\") {\n            // JSON ABI\n            switch (obj.type) {\n                case \"constructor\": return ConstructorFragment.from(obj);\n                case \"error\": return ErrorFragment.from(obj);\n                case \"event\": return EventFragment.from(obj);\n                case \"fallback\":\n                case \"receive\":\n                    return FallbackFragment.from(obj);\n                case \"function\": return FunctionFragment.from(obj);\n                case \"struct\": return StructFragment.from(obj);\n            }\n            assert(false, `unsupported type: ${obj.type}`, \"UNSUPPORTED_OPERATION\", {\n                operation: \"Fragment.from\"\n            });\n        }\n        assertArgument(false, \"unsupported frgament object\", \"obj\", obj);\n    }\n    /**\n     *  Returns true if %%value%% is a [[ConstructorFragment]].\n     */\n    static isConstructor(value) {\n        return ConstructorFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is an [[ErrorFragment]].\n     */\n    static isError(value) {\n        return ErrorFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is an [[EventFragment]].\n     */\n    static isEvent(value) {\n        return EventFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is a [[FunctionFragment]].\n     */\n    static isFunction(value) {\n        return FunctionFragment.isFragment(value);\n    }\n    /**\n     *  Returns true if %%value%% is a [[StructFragment]].\n     */\n    static isStruct(value) {\n        return StructFragment.isFragment(value);\n    }\n}\n/**\n *  An abstract class to represent An individual fragment\n *  which has a name from a parse ABI.\n */\nexport class NamedFragment extends Fragment {\n    /**\n     *  The name of the fragment.\n     */\n    name;\n    /**\n     *  @private\n     */\n    constructor(guard, type, name, inputs) {\n        super(guard, type, inputs);\n        assertArgument(typeof (name) === \"string\" && name.match(regexId), \"invalid identifier\", \"name\", name);\n        inputs = Object.freeze(inputs.slice());\n        defineProperties(this, { name });\n    }\n}\nfunction joinParams(format, params) {\n    return \"(\" + params.map((p) => p.format(format)).join((format === \"full\") ? \", \" : \",\") + \")\";\n}\n/**\n *  A Fragment which represents a //Custom Error//.\n */\nexport class ErrorFragment extends NamedFragment {\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs) {\n        super(guard, \"error\", name, inputs);\n        Object.defineProperty(this, internal, { value: ErrorFragmentInternal });\n    }\n    /**\n     *  The Custom Error selector.\n     */\n    get selector() {\n        return id(this.format(\"sighash\")).substring(0, 10);\n    }\n    /**\n     *  Returns a string representation of this fragment as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"error\",\n                name: this.name,\n                inputs: this.inputs.map((input) => JSON.parse(input.format(format))),\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"error\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        return result.join(\" \");\n    }\n    /**\n     *  Returns a new **ErrorFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (ErrorFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            return ErrorFragment.from(lex(obj));\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"error\", obj);\n            const inputs = consumeParams(obj);\n            consumeEoi(obj);\n            return new ErrorFragment(_guard, name, inputs);\n        }\n        return new ErrorFragment(_guard, obj.name, obj.inputs ? obj.inputs.map(ParamType.from) : []);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is an\n     *  **ErrorFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === ErrorFragmentInternal);\n    }\n}\n/**\n *  A Fragment which represents an Event.\n */\nexport class EventFragment extends NamedFragment {\n    /**\n     *  Whether this event is anonymous.\n     */\n    anonymous;\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs, anonymous) {\n        super(guard, \"event\", name, inputs);\n        Object.defineProperty(this, internal, { value: EventFragmentInternal });\n        defineProperties(this, { anonymous });\n    }\n    /**\n     *  The Event topic hash.\n     */\n    get topicHash() {\n        return id(this.format(\"sighash\"));\n    }\n    /**\n     *  Returns a string representation of this event as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"event\",\n                anonymous: this.anonymous,\n                name: this.name,\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format)))\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"event\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        if (format !== \"sighash\" && this.anonymous) {\n            result.push(\"anonymous\");\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Return the topic hash for an event with %%name%% and %%params%%.\n     */\n    static getTopicHash(name, params) {\n        params = (params || []).map((p) => ParamType.from(p));\n        const fragment = new EventFragment(_guard, name, params, false);\n        return fragment.topicHash;\n    }\n    /**\n     *  Returns a new **EventFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (EventFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return EventFragment.from(lex(obj));\n            }\n            catch (error) {\n                assertArgument(false, \"invalid event fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"event\", obj);\n            const inputs = consumeParams(obj, true);\n            const anonymous = !!consumeKeywords(obj, setify([\"anonymous\"])).has(\"anonymous\");\n            consumeEoi(obj);\n            return new EventFragment(_guard, name, inputs, anonymous);\n        }\n        return new EventFragment(_guard, obj.name, obj.inputs ? obj.inputs.map((p) => ParamType.from(p, true)) : [], !!obj.anonymous);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is an\n     *  **EventFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === EventFragmentInternal);\n    }\n}\n/**\n *  A Fragment which represents a constructor.\n */\nexport class ConstructorFragment extends Fragment {\n    /**\n     *  Whether the constructor can receive an endowment.\n     */\n    payable;\n    /**\n     *  The recommended gas limit for deployment or ``null``.\n     */\n    gas;\n    /**\n     *  @private\n     */\n    constructor(guard, type, inputs, payable, gas) {\n        super(guard, type, inputs);\n        Object.defineProperty(this, internal, { value: ConstructorFragmentInternal });\n        defineProperties(this, { payable, gas });\n    }\n    /**\n     *  Returns a string representation of this constructor as %%format%%.\n     */\n    format(format) {\n        assert(format != null && format !== \"sighash\", \"cannot format a constructor for sighash\", \"UNSUPPORTED_OPERATION\", { operation: \"format(sighash)\" });\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"constructor\",\n                stateMutability: (this.payable ? \"payable\" : \"undefined\"),\n                payable: this.payable,\n                gas: ((this.gas != null) ? this.gas : undefined),\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format)))\n            });\n        }\n        const result = [`constructor${joinParams(format, this.inputs)}`];\n        if (this.payable) {\n            result.push(\"payable\");\n        }\n        if (this.gas != null) {\n            result.push(`@${this.gas.toString()}`);\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Returns a new **ConstructorFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (ConstructorFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return ConstructorFragment.from(lex(obj));\n            }\n            catch (error) {\n                assertArgument(false, \"invalid constuctor fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            consumeKeywords(obj, setify([\"constructor\"]));\n            const inputs = consumeParams(obj);\n            const payable = !!consumeKeywords(obj, KwVisibDeploy).has(\"payable\");\n            const gas = consumeGas(obj);\n            consumeEoi(obj);\n            return new ConstructorFragment(_guard, \"constructor\", inputs, payable, gas);\n        }\n        return new ConstructorFragment(_guard, \"constructor\", obj.inputs ? obj.inputs.map(ParamType.from) : [], !!obj.payable, (obj.gas != null) ? obj.gas : null);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **ConstructorFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === ConstructorFragmentInternal);\n    }\n}\n/**\n *  A Fragment which represents a method.\n */\nexport class FallbackFragment extends Fragment {\n    /**\n     *  If the function can be sent value during invocation.\n     */\n    payable;\n    constructor(guard, inputs, payable) {\n        super(guard, \"fallback\", inputs);\n        Object.defineProperty(this, internal, { value: FallbackFragmentInternal });\n        defineProperties(this, { payable });\n    }\n    /**\n     *  Returns a string representation of this fallback as %%format%%.\n     */\n    format(format) {\n        const type = ((this.inputs.length === 0) ? \"receive\" : \"fallback\");\n        if (format === \"json\") {\n            const stateMutability = (this.payable ? \"payable\" : \"nonpayable\");\n            return JSON.stringify({ type, stateMutability });\n        }\n        return `${type}()${this.payable ? \" payable\" : \"\"}`;\n    }\n    /**\n     *  Returns a new **FallbackFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (FallbackFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return FallbackFragment.from(lex(obj));\n            }\n            catch (error) {\n                assertArgument(false, \"invalid fallback fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const errorObj = obj.toString();\n            const topIsValid = obj.peekKeyword(setify([\"fallback\", \"receive\"]));\n            assertArgument(topIsValid, \"type must be fallback or receive\", \"obj\", errorObj);\n            const type = obj.popKeyword(setify([\"fallback\", \"receive\"]));\n            // receive()\n            if (type === \"receive\") {\n                const inputs = consumeParams(obj);\n                assertArgument(inputs.length === 0, `receive cannot have arguments`, \"obj.inputs\", inputs);\n                consumeKeywords(obj, setify([\"payable\"]));\n                consumeEoi(obj);\n                return new FallbackFragment(_guard, [], true);\n            }\n            // fallback() [payable]\n            // fallback(bytes) [payable] returns (bytes)\n            let inputs = consumeParams(obj);\n            if (inputs.length) {\n                assertArgument(inputs.length === 1 && inputs[0].type === \"bytes\", \"invalid fallback inputs\", \"obj.inputs\", inputs.map((i) => i.format(\"minimal\")).join(\", \"));\n            }\n            else {\n                inputs = [ParamType.from(\"bytes\")];\n            }\n            const mutability = consumeMutability(obj);\n            assertArgument(mutability === \"nonpayable\" || mutability === \"payable\", \"fallback cannot be constants\", \"obj.stateMutability\", mutability);\n            if (consumeKeywords(obj, setify([\"returns\"])).has(\"returns\")) {\n                const outputs = consumeParams(obj);\n                assertArgument(outputs.length === 1 && outputs[0].type === \"bytes\", \"invalid fallback outputs\", \"obj.outputs\", outputs.map((i) => i.format(\"minimal\")).join(\", \"));\n            }\n            consumeEoi(obj);\n            return new FallbackFragment(_guard, inputs, mutability === \"payable\");\n        }\n        if (obj.type === \"receive\") {\n            return new FallbackFragment(_guard, [], true);\n        }\n        if (obj.type === \"fallback\") {\n            const inputs = [ParamType.from(\"bytes\")];\n            const payable = (obj.stateMutability === \"payable\");\n            return new FallbackFragment(_guard, inputs, payable);\n        }\n        assertArgument(false, \"invalid fallback description\", \"obj\", obj);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **FallbackFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === FallbackFragmentInternal);\n    }\n}\n/**\n *  A Fragment which represents a method.\n */\nexport class FunctionFragment extends NamedFragment {\n    /**\n     *  If the function is constant (e.g. ``pure`` or ``view`` functions).\n     */\n    constant;\n    /**\n     *  The returned types for the result of calling this function.\n     */\n    outputs;\n    /**\n     *  The state mutability (e.g. ``payable``, ``nonpayable``, ``view``\n     *  or ``pure``)\n     */\n    stateMutability;\n    /**\n     *  If the function can be sent value during invocation.\n     */\n    payable;\n    /**\n     *  The recommended gas limit to send when calling this function.\n     */\n    gas;\n    /**\n     *  @private\n     */\n    constructor(guard, name, stateMutability, inputs, outputs, gas) {\n        super(guard, \"function\", name, inputs);\n        Object.defineProperty(this, internal, { value: FunctionFragmentInternal });\n        outputs = Object.freeze(outputs.slice());\n        const constant = (stateMutability === \"view\" || stateMutability === \"pure\");\n        const payable = (stateMutability === \"payable\");\n        defineProperties(this, { constant, gas, outputs, payable, stateMutability });\n    }\n    /**\n     *  The Function selector.\n     */\n    get selector() {\n        return id(this.format(\"sighash\")).substring(0, 10);\n    }\n    /**\n     *  Returns a string representation of this function as %%format%%.\n     */\n    format(format) {\n        if (format == null) {\n            format = \"sighash\";\n        }\n        if (format === \"json\") {\n            return JSON.stringify({\n                type: \"function\",\n                name: this.name,\n                constant: this.constant,\n                stateMutability: ((this.stateMutability !== \"nonpayable\") ? this.stateMutability : undefined),\n                payable: this.payable,\n                gas: ((this.gas != null) ? this.gas : undefined),\n                inputs: this.inputs.map((i) => JSON.parse(i.format(format))),\n                outputs: this.outputs.map((o) => JSON.parse(o.format(format))),\n            });\n        }\n        const result = [];\n        if (format !== \"sighash\") {\n            result.push(\"function\");\n        }\n        result.push(this.name + joinParams(format, this.inputs));\n        if (format !== \"sighash\") {\n            if (this.stateMutability !== \"nonpayable\") {\n                result.push(this.stateMutability);\n            }\n            if (this.outputs && this.outputs.length) {\n                result.push(\"returns\");\n                result.push(joinParams(format, this.outputs));\n            }\n            if (this.gas != null) {\n                result.push(`@${this.gas.toString()}`);\n            }\n        }\n        return result.join(\" \");\n    }\n    /**\n     *  Return the selector for a function with %%name%% and %%params%%.\n     */\n    static getSelector(name, params) {\n        params = (params || []).map((p) => ParamType.from(p));\n        const fragment = new FunctionFragment(_guard, name, \"view\", params, [], null);\n        return fragment.selector;\n    }\n    /**\n     *  Returns a new **FunctionFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (FunctionFragment.isFragment(obj)) {\n            return obj;\n        }\n        if (typeof (obj) === \"string\") {\n            try {\n                return FunctionFragment.from(lex(obj));\n            }\n            catch (error) {\n                assertArgument(false, \"invalid function fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"function\", obj);\n            const inputs = consumeParams(obj);\n            const mutability = consumeMutability(obj);\n            let outputs = [];\n            if (consumeKeywords(obj, setify([\"returns\"])).has(\"returns\")) {\n                outputs = consumeParams(obj);\n            }\n            const gas = consumeGas(obj);\n            consumeEoi(obj);\n            return new FunctionFragment(_guard, name, mutability, inputs, outputs, gas);\n        }\n        let stateMutability = obj.stateMutability;\n        // Use legacy Solidity ABI logic if stateMutability is missing\n        if (stateMutability == null) {\n            stateMutability = \"payable\";\n            if (typeof (obj.constant) === \"boolean\") {\n                stateMutability = \"view\";\n                if (!obj.constant) {\n                    stateMutability = \"payable\";\n                    if (typeof (obj.payable) === \"boolean\" && !obj.payable) {\n                        stateMutability = \"nonpayable\";\n                    }\n                }\n            }\n            else if (typeof (obj.payable) === \"boolean\" && !obj.payable) {\n                stateMutability = \"nonpayable\";\n            }\n        }\n        // @TODO: verifyState for stateMutability (e.g. throw if\n        //        payable: false but stateMutability is \"nonpayable\")\n        return new FunctionFragment(_guard, obj.name, stateMutability, obj.inputs ? obj.inputs.map(ParamType.from) : [], obj.outputs ? obj.outputs.map(ParamType.from) : [], (obj.gas != null) ? obj.gas : null);\n    }\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **FunctionFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === FunctionFragmentInternal);\n    }\n}\n/**\n *  A Fragment which represents a structure.\n */\nexport class StructFragment extends NamedFragment {\n    /**\n     *  @private\n     */\n    constructor(guard, name, inputs) {\n        super(guard, \"struct\", name, inputs);\n        Object.defineProperty(this, internal, { value: StructFragmentInternal });\n    }\n    /**\n     *  Returns a string representation of this struct as %%format%%.\n     */\n    format() {\n        throw new Error(\"@TODO\");\n    }\n    /**\n     *  Returns a new **StructFragment** for %%obj%%.\n     */\n    static from(obj) {\n        if (typeof (obj) === \"string\") {\n            try {\n                return StructFragment.from(lex(obj));\n            }\n            catch (error) {\n                assertArgument(false, \"invalid struct fragment\", \"obj\", obj);\n            }\n        }\n        else if (obj instanceof TokenString) {\n            const name = consumeName(\"struct\", obj);\n            const inputs = consumeParams(obj);\n            consumeEoi(obj);\n            return new StructFragment(_guard, name, inputs);\n        }\n        return new StructFragment(_guard, obj.name, obj.inputs ? obj.inputs.map(ParamType.from) : []);\n    }\n    // @TODO: fix this return type\n    /**\n     *  Returns ``true`` and provides a type guard if %%value%% is a\n     *  **StructFragment**.\n     */\n    static isFragment(value) {\n        return (value && value[internal] === StructFragmentInternal);\n    }\n}\n//# sourceMappingURL=fragments.js.map","/**\n *  When sending values to or receiving values from a [[Contract]], the\n *  data is generally encoded using the [ABI standard](link-solc-abi).\n *\n *  The AbiCoder provides a utility to encode values to ABI data and\n *  decode values from ABI data.\n *\n *  Most of the time, developers should favour the [[Contract]] class,\n *  which further abstracts a lot of the finer details of ABI data.\n *\n *  @_section api/abi/abi-coder:ABI Encoding\n */\n// See: https://github.com/ethereum/wiki/wiki/Ethereum-Contract-ABI\nimport { assertArgumentCount, assertArgument } from \"../utils/index.js\";\nimport { Reader, Writer } from \"./coders/abstract-coder.js\";\nimport { AddressCoder } from \"./coders/address.js\";\nimport { ArrayCoder } from \"./coders/array.js\";\nimport { BooleanCoder } from \"./coders/boolean.js\";\nimport { BytesCoder } from \"./coders/bytes.js\";\nimport { FixedBytesCoder } from \"./coders/fixed-bytes.js\";\nimport { NullCoder } from \"./coders/null.js\";\nimport { NumberCoder } from \"./coders/number.js\";\nimport { StringCoder } from \"./coders/string.js\";\nimport { TupleCoder } from \"./coders/tuple.js\";\nimport { ParamType } from \"./fragments.js\";\nimport { getAddress } from \"../address/index.js\";\nimport { getBytes, hexlify, makeError } from \"../utils/index.js\";\n// https://docs.soliditylang.org/en/v0.8.17/control-structures.html\nconst PanicReasons = new Map();\nPanicReasons.set(0x00, \"GENERIC_PANIC\");\nPanicReasons.set(0x01, \"ASSERT_FALSE\");\nPanicReasons.set(0x11, \"OVERFLOW\");\nPanicReasons.set(0x12, \"DIVIDE_BY_ZERO\");\nPanicReasons.set(0x21, \"ENUM_RANGE_ERROR\");\nPanicReasons.set(0x22, \"BAD_STORAGE_DATA\");\nPanicReasons.set(0x31, \"STACK_UNDERFLOW\");\nPanicReasons.set(0x32, \"ARRAY_RANGE_ERROR\");\nPanicReasons.set(0x41, \"OUT_OF_MEMORY\");\nPanicReasons.set(0x51, \"UNINITIALIZED_FUNCTION_CALL\");\nconst paramTypeBytes = new RegExp(/^bytes([0-9]*)$/);\nconst paramTypeNumber = new RegExp(/^(u?int)([0-9]*)$/);\nlet defaultCoder = null;\nlet defaultMaxInflation = 1024;\nfunction getBuiltinCallException(action, tx, data, abiCoder) {\n    let message = \"missing revert data\";\n    let reason = null;\n    const invocation = null;\n    let revert = null;\n    if (data) {\n        message = \"execution reverted\";\n        const bytes = getBytes(data);\n        data = hexlify(data);\n        if (bytes.length === 0) {\n            message += \" (no data present; likely require(false) occurred\";\n            reason = \"require(false)\";\n        }\n        else if (bytes.length % 32 !== 4) {\n            message += \" (could not decode reason; invalid data length)\";\n        }\n        else if (hexlify(bytes.slice(0, 4)) === \"0x08c379a0\") {\n            // Error(string)\n            try {\n                reason = abiCoder.decode([\"string\"], bytes.slice(4))[0];\n                revert = {\n                    signature: \"Error(string)\",\n                    name: \"Error\",\n                    args: [reason]\n                };\n                message += `: ${JSON.stringify(reason)}`;\n            }\n            catch (error) {\n                message += \" (could not decode reason; invalid string data)\";\n            }\n        }\n        else if (hexlify(bytes.slice(0, 4)) === \"0x4e487b71\") {\n            // Panic(uint256)\n            try {\n                const code = Number(abiCoder.decode([\"uint256\"], bytes.slice(4))[0]);\n                revert = {\n                    signature: \"Panic(uint256)\",\n                    name: \"Panic\",\n                    args: [code]\n                };\n                reason = `Panic due to ${PanicReasons.get(code) || \"UNKNOWN\"}(${code})`;\n                message += `: ${reason}`;\n            }\n            catch (error) {\n                message += \" (could not decode panic code)\";\n            }\n        }\n        else {\n            message += \" (unknown custom error)\";\n        }\n    }\n    const transaction = {\n        to: (tx.to ? getAddress(tx.to) : null),\n        data: (tx.data || \"0x\")\n    };\n    if (tx.from) {\n        transaction.from = getAddress(tx.from);\n    }\n    return makeError(message, \"CALL_EXCEPTION\", {\n        action, data, reason, transaction, invocation, revert\n    });\n}\n/**\n *  The **AbiCoder** is a low-level class responsible for encoding JavaScript\n *  values into binary data and decoding binary data into JavaScript values.\n */\nexport class AbiCoder {\n    #getCoder(param) {\n        if (param.isArray()) {\n            return new ArrayCoder(this.#getCoder(param.arrayChildren), param.arrayLength, param.name);\n        }\n        if (param.isTuple()) {\n            return new TupleCoder(param.components.map((c) => this.#getCoder(c)), param.name);\n        }\n        switch (param.baseType) {\n            case \"address\":\n                return new AddressCoder(param.name);\n            case \"bool\":\n                return new BooleanCoder(param.name);\n            case \"string\":\n                return new StringCoder(param.name);\n            case \"bytes\":\n                return new BytesCoder(param.name);\n            case \"\":\n                return new NullCoder(param.name);\n        }\n        // u?int[0-9]*\n        let match = param.type.match(paramTypeNumber);\n        if (match) {\n            let size = parseInt(match[2] || \"256\");\n            assertArgument(size !== 0 && size <= 256 && (size % 8) === 0, \"invalid \" + match[1] + \" bit length\", \"param\", param);\n            return new NumberCoder(size / 8, (match[1] === \"int\"), param.name);\n        }\n        // bytes[0-9]+\n        match = param.type.match(paramTypeBytes);\n        if (match) {\n            let size = parseInt(match[1]);\n            assertArgument(size !== 0 && size <= 32, \"invalid bytes length\", \"param\", param);\n            return new FixedBytesCoder(size, param.name);\n        }\n        assertArgument(false, \"invalid type\", \"type\", param.type);\n    }\n    /**\n     *  Get the default values for the given %%types%%.\n     *\n     *  For example, a ``uint`` is by default ``0`` and ``bool``\n     *  is by default ``false``.\n     */\n    getDefaultValue(types) {\n        const coders = types.map((type) => this.#getCoder(ParamType.from(type)));\n        const coder = new TupleCoder(coders, \"_\");\n        return coder.defaultValue();\n    }\n    /**\n     *  Encode the %%values%% as the %%types%% into ABI data.\n     *\n     *  @returns DataHexstring\n     */\n    encode(types, values) {\n        assertArgumentCount(values.length, types.length, \"types/values length mismatch\");\n        const coders = types.map((type) => this.#getCoder(ParamType.from(type)));\n        const coder = (new TupleCoder(coders, \"_\"));\n        const writer = new Writer();\n        coder.encode(writer, values);\n        return writer.data;\n    }\n    /**\n     *  Decode the ABI %%data%% as the %%types%% into values.\n     *\n     *  If %%loose%% decoding is enabled, then strict padding is\n     *  not enforced. Some older versions of Solidity incorrectly\n     *  padded event data emitted from ``external`` functions.\n     */\n    decode(types, data, loose) {\n        const coders = types.map((type) => this.#getCoder(ParamType.from(type)));\n        const coder = new TupleCoder(coders, \"_\");\n        return coder.decode(new Reader(data, loose, defaultMaxInflation));\n    }\n    static _setDefaultMaxInflation(value) {\n        assertArgument(typeof (value) === \"number\" && Number.isInteger(value), \"invalid defaultMaxInflation factor\", \"value\", value);\n        defaultMaxInflation = value;\n    }\n    /**\n     *  Returns the shared singleton instance of a default [[AbiCoder]].\n     *\n     *  On the first call, the instance is created internally.\n     */\n    static defaultAbiCoder() {\n        if (defaultCoder == null) {\n            defaultCoder = new AbiCoder();\n        }\n        return defaultCoder;\n    }\n    /**\n     *  Returns an ethers-compatible [[CallExceptionError]] Error for the given\n     *  result %%data%% for the [[CallExceptionAction]] %%action%% against\n     *  the Transaction %%tx%%.\n     */\n    static getBuiltinCallException(action, tx, data) {\n        return getBuiltinCallException(action, tx, data, AbiCoder.defaultAbiCoder());\n    }\n}\n//# sourceMappingURL=abi-coder.js.map","/**\n *  The Interface class is a low-level class that accepts an\n *  ABI and provides all the necessary functionality to encode\n *  and decode paramaters to and results from methods, events\n *  and errors.\n *\n *  It also provides several convenience methods to automatically\n *  search and find matching transactions and events to parse them.\n *\n *  @_subsection api/abi:Interfaces  [interfaces]\n */\nimport { keccak256 } from \"../crypto/index.js\";\nimport { id } from \"../hash/index.js\";\nimport { concat, dataSlice, getBigInt, getBytes, getBytesCopy, hexlify, zeroPadBytes, zeroPadValue, isHexString, defineProperties, assertArgument, toBeHex, assert } from \"../utils/index.js\";\nimport { AbiCoder } from \"./abi-coder.js\";\nimport { checkResultErrors, Result } from \"./coders/abstract-coder.js\";\nimport { ConstructorFragment, ErrorFragment, EventFragment, Fragment, FunctionFragment, ParamType } from \"./fragments.js\";\nimport { Typed } from \"./typed.js\";\nexport { checkResultErrors, Result };\n/**\n *  When using the [[Interface-parseLog]] to automatically match a Log to its event\n *  for parsing, a **LogDescription** is returned.\n */\nexport class LogDescription {\n    /**\n     *  The matching fragment for the ``topic0``.\n     */\n    fragment;\n    /**\n     *  The name of the Event.\n     */\n    name;\n    /**\n     *  The full Event signature.\n     */\n    signature;\n    /**\n     *  The topic hash for the Event.\n     */\n    topic;\n    /**\n     *  The arguments passed into the Event with ``emit``.\n     */\n    args;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, topic, args) {\n        const name = fragment.name, signature = fragment.format();\n        defineProperties(this, {\n            fragment, name, signature, topic, args\n        });\n    }\n}\n/**\n *  When using the [[Interface-parseTransaction]] to automatically match\n *  a transaction data to its function for parsing,\n *  a **TransactionDescription** is returned.\n */\nexport class TransactionDescription {\n    /**\n     *  The matching fragment from the transaction ``data``.\n     */\n    fragment;\n    /**\n     *  The name of the Function from the transaction ``data``.\n     */\n    name;\n    /**\n     *  The arguments passed to the Function from the transaction ``data``.\n     */\n    args;\n    /**\n     *  The full Function signature from the transaction ``data``.\n     */\n    signature;\n    /**\n     *  The selector for the Function from the transaction ``data``.\n     */\n    selector;\n    /**\n     *  The ``value`` (in wei) from the transaction.\n     */\n    value;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, selector, args, value) {\n        const name = fragment.name, signature = fragment.format();\n        defineProperties(this, {\n            fragment, name, args, signature, selector, value\n        });\n    }\n}\n/**\n *  When using the [[Interface-parseError]] to automatically match an\n *  error for a call result for parsing, an **ErrorDescription** is returned.\n */\nexport class ErrorDescription {\n    /**\n     *  The matching fragment.\n     */\n    fragment;\n    /**\n     *  The name of the Error.\n     */\n    name;\n    /**\n     *  The arguments passed to the Error with ``revert``.\n     */\n    args;\n    /**\n     *  The full Error signature.\n     */\n    signature;\n    /**\n     *  The selector for the Error.\n     */\n    selector;\n    /**\n     *  @_ignore:\n     */\n    constructor(fragment, selector, args) {\n        const name = fragment.name, signature = fragment.format();\n        defineProperties(this, {\n            fragment, name, args, signature, selector\n        });\n    }\n}\n/**\n *  An **Indexed** is used as a value when a value that does not\n *  fit within a topic (i.e. not a fixed-length, 32-byte type). It\n *  is the ``keccak256`` of the value, and used for types such as\n *  arrays, tuples, bytes and strings.\n */\nexport class Indexed {\n    /**\n     *  The ``keccak256`` of the value logged.\n     */\n    hash;\n    /**\n     *  @_ignore:\n     */\n    _isIndexed;\n    /**\n     *  Returns ``true`` if %%value%% is an **Indexed**.\n     *\n     *  This provides a Type Guard for property access.\n     */\n    static isIndexed(value) {\n        return !!(value && value._isIndexed);\n    }\n    /**\n     *  @_ignore:\n     */\n    constructor(hash) {\n        defineProperties(this, { hash, _isIndexed: true });\n    }\n}\n// https://docs.soliditylang.org/en/v0.8.13/control-structures.html?highlight=panic#panic-via-assert-and-error-via-require\nconst PanicReasons = {\n    \"0\": \"generic panic\",\n    \"1\": \"assert(false)\",\n    \"17\": \"arithmetic overflow\",\n    \"18\": \"division or modulo by zero\",\n    \"33\": \"enum overflow\",\n    \"34\": \"invalid encoded storage byte array accessed\",\n    \"49\": \"out-of-bounds array access; popping on an empty array\",\n    \"50\": \"out-of-bounds access of an array or bytesN\",\n    \"65\": \"out of memory\",\n    \"81\": \"uninitialized function\",\n};\nconst BuiltinErrors = {\n    \"0x08c379a0\": {\n        signature: \"Error(string)\",\n        name: \"Error\",\n        inputs: [\"string\"],\n        reason: (message) => {\n            return `reverted with reason string ${JSON.stringify(message)}`;\n        }\n    },\n    \"0x4e487b71\": {\n        signature: \"Panic(uint256)\",\n        name: \"Panic\",\n        inputs: [\"uint256\"],\n        reason: (code) => {\n            let reason = \"unknown panic code\";\n            if (code >= 0 && code <= 0xff && PanicReasons[code.toString()]) {\n                reason = PanicReasons[code.toString()];\n            }\n            return `reverted with panic code 0x${code.toString(16)} (${reason})`;\n        }\n    }\n};\n/**\n *  An Interface abstracts many of the low-level details for\n *  encoding and decoding the data on the blockchain.\n *\n *  An ABI provides information on how to encode data to send to\n *  a Contract, how to decode the results and events and how to\n *  interpret revert errors.\n *\n *  The ABI can be specified by [any supported format](InterfaceAbi).\n */\nexport class Interface {\n    /**\n     *  All the Contract ABI members (i.e. methods, events, errors, etc).\n     */\n    fragments;\n    /**\n     *  The Contract constructor.\n     */\n    deploy;\n    /**\n     *  The Fallback method, if any.\n     */\n    fallback;\n    /**\n     *  If receiving ether is supported.\n     */\n    receive;\n    #errors;\n    #events;\n    #functions;\n    //    #structs: Map<string, StructFragment>;\n    #abiCoder;\n    /**\n     *  Create a new Interface for the %%fragments%%.\n     */\n    constructor(fragments) {\n        let abi = [];\n        if (typeof (fragments) === \"string\") {\n            abi = JSON.parse(fragments);\n        }\n        else {\n            abi = fragments;\n        }\n        this.#functions = new Map();\n        this.#errors = new Map();\n        this.#events = new Map();\n        //        this.#structs = new Map();\n        const frags = [];\n        for (const a of abi) {\n            try {\n                frags.push(Fragment.from(a));\n            }\n            catch (error) {\n                console.log(`[Warning] Invalid Fragment ${JSON.stringify(a)}:`, error.message);\n            }\n        }\n        defineProperties(this, {\n            fragments: Object.freeze(frags)\n        });\n        let fallback = null;\n        let receive = false;\n        this.#abiCoder = this.getAbiCoder();\n        // Add all fragments by their signature\n        this.fragments.forEach((fragment, index) => {\n            let bucket;\n            switch (fragment.type) {\n                case \"constructor\":\n                    if (this.deploy) {\n                        console.log(\"duplicate definition - constructor\");\n                        return;\n                    }\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    defineProperties(this, { deploy: fragment });\n                    return;\n                case \"fallback\":\n                    if (fragment.inputs.length === 0) {\n                        receive = true;\n                    }\n                    else {\n                        assertArgument(!fallback || fragment.payable !== fallback.payable, \"conflicting fallback fragments\", `fragments[${index}]`, fragment);\n                        fallback = fragment;\n                        receive = fallback.payable;\n                    }\n                    return;\n                case \"function\":\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    //checkNames(fragment, \"output\", (<FunctionFragment>fragment).outputs);\n                    bucket = this.#functions;\n                    break;\n                case \"event\":\n                    //checkNames(fragment, \"input\", fragment.inputs);\n                    bucket = this.#events;\n                    break;\n                case \"error\":\n                    bucket = this.#errors;\n                    break;\n                default:\n                    return;\n            }\n            // Two identical entries; ignore it\n            const signature = fragment.format();\n            if (bucket.has(signature)) {\n                return;\n            }\n            bucket.set(signature, fragment);\n        });\n        // If we do not have a constructor add a default\n        if (!this.deploy) {\n            defineProperties(this, {\n                deploy: ConstructorFragment.from(\"constructor()\")\n            });\n        }\n        defineProperties(this, { fallback, receive });\n    }\n    /**\n     *  Returns the entire Human-Readable ABI, as an array of\n     *  signatures, optionally as %%minimal%% strings, which\n     *  removes parameter names and unneceesary spaces.\n     */\n    format(minimal) {\n        const format = (minimal ? \"minimal\" : \"full\");\n        const abi = this.fragments.map((f) => f.format(format));\n        return abi;\n    }\n    /**\n     *  Return the JSON-encoded ABI. This is the format Solidiy\n     *  returns.\n     */\n    formatJson() {\n        const abi = this.fragments.map((f) => f.format(\"json\"));\n        // We need to re-bundle the JSON fragments a bit\n        return JSON.stringify(abi.map((j) => JSON.parse(j)));\n    }\n    /**\n     *  The ABI coder that will be used to encode and decode binary\n     *  data.\n     */\n    getAbiCoder() {\n        return AbiCoder.defaultAbiCoder();\n    }\n    // Find a function definition by any means necessary (unless it is ambiguous)\n    #getFunction(key, values, forceUnique) {\n        // Selector\n        if (isHexString(key)) {\n            const selector = key.toLowerCase();\n            for (const fragment of this.#functions.values()) {\n                if (selector === fragment.selector) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#functions) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (values) {\n                const lastValue = (values.length > 0) ? values[values.length - 1] : null;\n                let valueLength = values.length;\n                let allowOptions = true;\n                if (Typed.isTyped(lastValue) && lastValue.type === \"overrides\") {\n                    allowOptions = false;\n                    valueLength--;\n                }\n                // Remove all matches that don't have a compatible length. The args\n                // may contain an overrides, so the match may have n or n - 1 parameters\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs.length;\n                    if (inputs !== valueLength && (!allowOptions || inputs !== valueLength - 1)) {\n                        matching.splice(i, 1);\n                    }\n                }\n                // Remove all matches that don't match the Typed signature\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs;\n                    for (let j = 0; j < values.length; j++) {\n                        // Not a typed value\n                        if (!Typed.isTyped(values[j])) {\n                            continue;\n                        }\n                        // We are past the inputs\n                        if (j >= inputs.length) {\n                            if (values[j].type === \"overrides\") {\n                                continue;\n                            }\n                            matching.splice(i, 1);\n                            break;\n                        }\n                        // Make sure the value type matches the input type\n                        if (values[j].type !== inputs[j].baseType) {\n                            matching.splice(i, 1);\n                            break;\n                        }\n                    }\n                }\n            }\n            // We found a single matching signature with an overrides, but the\n            // last value is something that cannot possibly be an options\n            if (matching.length === 1 && values && values.length !== matching[0].inputs.length) {\n                const lastArg = values[values.length - 1];\n                if (lastArg == null || Array.isArray(lastArg) || typeof (lastArg) !== \"object\") {\n                    matching.splice(0, 1);\n                }\n            }\n            if (matching.length === 0) {\n                return null;\n            }\n            if (matching.length > 1 && forceUnique) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                assertArgument(false, `ambiguous function description (i.e. matches ${matchStr})`, \"key\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        const result = this.#functions.get(FunctionFragment.from(key).format());\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Get the function name for %%key%%, which may be a function selector,\n     *  function name or function signature that belongs to the ABI.\n     */\n    getFunctionName(key) {\n        const fragment = this.#getFunction(key, null, false);\n        assertArgument(fragment, \"no matching function\", \"key\", key);\n        return fragment.name;\n    }\n    /**\n     *  Returns true if %%key%% (a function selector, function name or\n     *  function signature) is present in the ABI.\n     *\n     *  In the case of a function name, the name may be ambiguous, so\n     *  accessing the [[FunctionFragment]] may require refinement.\n     */\n    hasFunction(key) {\n        return !!this.#getFunction(key, null, false);\n    }\n    /**\n     *  Get the [[FunctionFragment]] for %%key%%, which may be a function\n     *  selector, function name or function signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple functions match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single function in\n     *  the ABI, this will throw.\n     */\n    getFunction(key, values) {\n        return this.#getFunction(key, values || null, true);\n    }\n    /**\n     *  Iterate over all functions, calling %%callback%%, sorted by their name.\n     */\n    forEachFunction(callback) {\n        const names = Array.from(this.#functions.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#functions.get(name)), i);\n        }\n    }\n    // Find an event definition by any means necessary (unless it is ambiguous)\n    #getEvent(key, values, forceUnique) {\n        // EventTopic\n        if (isHexString(key)) {\n            const eventTopic = key.toLowerCase();\n            for (const fragment of this.#events.values()) {\n                if (eventTopic === fragment.topicHash) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#events) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (values) {\n                // Remove all matches that don't have a compatible length.\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    if (matching[i].inputs.length < values.length) {\n                        matching.splice(i, 1);\n                    }\n                }\n                // Remove all matches that don't match the Typed signature\n                for (let i = matching.length - 1; i >= 0; i--) {\n                    const inputs = matching[i].inputs;\n                    for (let j = 0; j < values.length; j++) {\n                        // Not a typed value\n                        if (!Typed.isTyped(values[j])) {\n                            continue;\n                        }\n                        // Make sure the value type matches the input type\n                        if (values[j].type !== inputs[j].baseType) {\n                            matching.splice(i, 1);\n                            break;\n                        }\n                    }\n                }\n            }\n            if (matching.length === 0) {\n                return null;\n            }\n            if (matching.length > 1 && forceUnique) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                assertArgument(false, `ambiguous event description (i.e. matches ${matchStr})`, \"key\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        const result = this.#events.get(EventFragment.from(key).format());\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Get the event name for %%key%%, which may be a topic hash,\n     *  event name or event signature that belongs to the ABI.\n     */\n    getEventName(key) {\n        const fragment = this.#getEvent(key, null, false);\n        assertArgument(fragment, \"no matching event\", \"key\", key);\n        return fragment.name;\n    }\n    /**\n     *  Returns true if %%key%% (an event topic hash, event name or\n     *  event signature) is present in the ABI.\n     *\n     *  In the case of an event name, the name may be ambiguous, so\n     *  accessing the [[EventFragment]] may require refinement.\n     */\n    hasEvent(key) {\n        return !!this.#getEvent(key, null, false);\n    }\n    /**\n     *  Get the [[EventFragment]] for %%key%%, which may be a topic hash,\n     *  event name or event signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple events match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single event in\n     *  the ABI, this will throw.\n     */\n    getEvent(key, values) {\n        return this.#getEvent(key, values || null, true);\n    }\n    /**\n     *  Iterate over all events, calling %%callback%%, sorted by their name.\n     */\n    forEachEvent(callback) {\n        const names = Array.from(this.#events.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#events.get(name)), i);\n        }\n    }\n    /**\n     *  Get the [[ErrorFragment]] for %%key%%, which may be an error\n     *  selector, error name or error signature that belongs to the ABI.\n     *\n     *  If %%values%% is provided, it will use the Typed API to handle\n     *  ambiguous cases where multiple errors match by name.\n     *\n     *  If the %%key%% and %%values%% do not refine to a single error in\n     *  the ABI, this will throw.\n     */\n    getError(key, values) {\n        if (isHexString(key)) {\n            const selector = key.toLowerCase();\n            if (BuiltinErrors[selector]) {\n                return ErrorFragment.from(BuiltinErrors[selector].signature);\n            }\n            for (const fragment of this.#errors.values()) {\n                if (selector === fragment.selector) {\n                    return fragment;\n                }\n            }\n            return null;\n        }\n        // It is a bare name, look up the function (will return null if ambiguous)\n        if (key.indexOf(\"(\") === -1) {\n            const matching = [];\n            for (const [name, fragment] of this.#errors) {\n                if (name.split(\"(\" /* fix:) */)[0] === key) {\n                    matching.push(fragment);\n                }\n            }\n            if (matching.length === 0) {\n                if (key === \"Error\") {\n                    return ErrorFragment.from(\"error Error(string)\");\n                }\n                if (key === \"Panic\") {\n                    return ErrorFragment.from(\"error Panic(uint256)\");\n                }\n                return null;\n            }\n            else if (matching.length > 1) {\n                const matchStr = matching.map((m) => JSON.stringify(m.format())).join(\", \");\n                assertArgument(false, `ambiguous error description (i.e. ${matchStr})`, \"name\", key);\n            }\n            return matching[0];\n        }\n        // Normalize the signature and lookup the function\n        key = ErrorFragment.from(key).format();\n        if (key === \"Error(string)\") {\n            return ErrorFragment.from(\"error Error(string)\");\n        }\n        if (key === \"Panic(uint256)\") {\n            return ErrorFragment.from(\"error Panic(uint256)\");\n        }\n        const result = this.#errors.get(key);\n        if (result) {\n            return result;\n        }\n        return null;\n    }\n    /**\n     *  Iterate over all errors, calling %%callback%%, sorted by their name.\n     */\n    forEachError(callback) {\n        const names = Array.from(this.#errors.keys());\n        names.sort((a, b) => a.localeCompare(b));\n        for (let i = 0; i < names.length; i++) {\n            const name = names[i];\n            callback((this.#errors.get(name)), i);\n        }\n    }\n    // Get the 4-byte selector used by Solidity to identify a function\n    /*\ngetSelector(fragment: ErrorFragment | FunctionFragment): string {\n    if (typeof(fragment) === \"string\") {\n        const matches: Array<Fragment> = [ ];\n\n        try { matches.push(this.getFunction(fragment)); } catch (error) { }\n        try { matches.push(this.getError(<string>fragment)); } catch (_) { }\n\n        if (matches.length === 0) {\n            logger.throwArgumentError(\"unknown fragment\", \"key\", fragment);\n        } else if (matches.length > 1) {\n            logger.throwArgumentError(\"ambiguous fragment matches function and error\", \"key\", fragment);\n        }\n\n        fragment = matches[0];\n    }\n\n    return dataSlice(id(fragment.format()), 0, 4);\n}\n    */\n    // Get the 32-byte topic hash used by Solidity to identify an event\n    /*\n    getEventTopic(fragment: EventFragment): string {\n        //if (typeof(fragment) === \"string\") { fragment = this.getEvent(eventFragment); }\n        return id(fragment.format());\n    }\n    */\n    _decodeParams(params, data) {\n        return this.#abiCoder.decode(params, data);\n    }\n    _encodeParams(params, values) {\n        return this.#abiCoder.encode(params, values);\n    }\n    /**\n     *  Encodes a ``tx.data`` object for deploying the Contract with\n     *  the %%values%% as the constructor arguments.\n     */\n    encodeDeploy(values) {\n        return this._encodeParams(this.deploy.inputs, values || []);\n    }\n    /**\n     *  Decodes the result %%data%% (e.g. from an ``eth_call``) for the\n     *  specified error (see [[getError]] for valid values for\n     *  %%key%%).\n     *\n     *  Most developers should prefer the [[parseCallResult]] method instead,\n     *  which will automatically detect a ``CALL_EXCEPTION`` and throw the\n     *  corresponding error.\n     */\n    decodeErrorResult(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getError(fragment);\n            assertArgument(f, \"unknown error\", \"fragment\", fragment);\n            fragment = f;\n        }\n        assertArgument(dataSlice(data, 0, 4) === fragment.selector, `data signature does not match error ${fragment.name}.`, \"data\", data);\n        return this._decodeParams(fragment.inputs, dataSlice(data, 4));\n    }\n    /**\n     *  Encodes the transaction revert data for a call result that\n     *  reverted from the the Contract with the sepcified %%error%%\n     *  (see [[getError]] for valid values for %%fragment%%) with the %%values%%.\n     *\n     *  This is generally not used by most developers, unless trying to mock\n     *  a result from a Contract.\n     */\n    encodeErrorResult(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getError(fragment);\n            assertArgument(f, \"unknown error\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return concat([\n            fragment.selector,\n            this._encodeParams(fragment.inputs, values || [])\n        ]);\n    }\n    /**\n     *  Decodes the %%data%% from a transaction ``tx.data`` for\n     *  the function specified (see [[getFunction]] for valid values\n     *  for %%fragment%%).\n     *\n     *  Most developers should prefer the [[parseTransaction]] method\n     *  instead, which will automatically detect the fragment.\n     */\n    decodeFunctionData(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            assertArgument(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        assertArgument(dataSlice(data, 0, 4) === fragment.selector, `data signature does not match function ${fragment.name}.`, \"data\", data);\n        return this._decodeParams(fragment.inputs, dataSlice(data, 4));\n    }\n    /**\n     *  Encodes the ``tx.data`` for a transaction that calls the function\n     *  specified (see [[getFunction]] for valid values for %%fragment%%) with\n     *  the %%values%%.\n     */\n    encodeFunctionData(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            assertArgument(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return concat([\n            fragment.selector,\n            this._encodeParams(fragment.inputs, values || [])\n        ]);\n    }\n    /**\n     *  Decodes the result %%data%% (e.g. from an ``eth_call``) for the\n     *  specified function (see [[getFunction]] for valid values for\n     *  %%key%%).\n     *\n     *  Most developers should prefer the [[parseCallResult]] method instead,\n     *  which will automatically detect a ``CALL_EXCEPTION`` and throw the\n     *  corresponding error.\n     */\n    decodeFunctionResult(fragment, data) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            assertArgument(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        let message = \"invalid length for result data\";\n        const bytes = getBytesCopy(data);\n        if ((bytes.length % 32) === 0) {\n            try {\n                return this.#abiCoder.decode(fragment.outputs, bytes);\n            }\n            catch (error) {\n                message = \"could not decode result data\";\n            }\n        }\n        // Call returned data with no error, but the data is junk\n        assert(false, message, \"BAD_DATA\", {\n            value: hexlify(bytes),\n            info: { method: fragment.name, signature: fragment.format() }\n        });\n    }\n    makeError(_data, tx) {\n        const data = getBytes(_data, \"data\");\n        const error = AbiCoder.getBuiltinCallException(\"call\", tx, data);\n        // Not a built-in error; try finding a custom error\n        const customPrefix = \"execution reverted (unknown custom error)\";\n        if (error.message.startsWith(customPrefix)) {\n            const selector = hexlify(data.slice(0, 4));\n            const ef = this.getError(selector);\n            if (ef) {\n                try {\n                    const args = this.#abiCoder.decode(ef.inputs, data.slice(4));\n                    error.revert = {\n                        name: ef.name, signature: ef.format(), args\n                    };\n                    error.reason = error.revert.signature;\n                    error.message = `execution reverted: ${error.reason}`;\n                }\n                catch (e) {\n                    error.message = `execution reverted (coult not decode custom error)`;\n                }\n            }\n        }\n        // Add the invocation, if available\n        const parsed = this.parseTransaction(tx);\n        if (parsed) {\n            error.invocation = {\n                method: parsed.name,\n                signature: parsed.signature,\n                args: parsed.args\n            };\n        }\n        return error;\n    }\n    /**\n     *  Encodes the result data (e.g. from an ``eth_call``) for the\n     *  specified function (see [[getFunction]] for valid values\n     *  for %%fragment%%) with %%values%%.\n     *\n     *  This is generally not used by most developers, unless trying to mock\n     *  a result from a Contract.\n     */\n    encodeFunctionResult(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getFunction(fragment);\n            assertArgument(f, \"unknown function\", \"fragment\", fragment);\n            fragment = f;\n        }\n        return hexlify(this.#abiCoder.encode(fragment.outputs, values || []));\n    }\n    /*\n        spelunk(inputs: Array<ParamType>, values: ReadonlyArray<any>, processfunc: (type: string, value: any) => Promise<any>): Promise<Array<any>> {\n            const promises: Array<Promise<>> = [ ];\n            const process = function(type: ParamType, value: any): any {\n                if (type.baseType === \"array\") {\n                    return descend(type.child\n                }\n                if (type. === \"address\") {\n                }\n            };\n    \n            const descend = function (inputs: Array<ParamType>, values: ReadonlyArray<any>) {\n                if (inputs.length !== values.length) { throw new Error(\"length mismatch\"); }\n                \n            };\n    \n            const result: Array<any> = [ ];\n            values.forEach((value, index) => {\n                if (value == null) {\n                    topics.push(null);\n                } else if (param.baseType === \"array\" || param.baseType === \"tuple\") {\n                    logger.throwArgumentError(\"filtering with tuples or arrays not supported\", (\"contract.\" + param.name), value);\n                } else if (Array.isArray(value)) {\n                    topics.push(value.map((value) => encodeTopic(param, value)));\n                } else {\n                    topics.push(encodeTopic(param, value));\n                }\n            });\n        }\n    */\n    // Create the filter for the event with search criteria (e.g. for eth_filterLog)\n    encodeFilterTopics(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            assertArgument(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        assert(values.length <= fragment.inputs.length, `too many arguments for ${fragment.format()}`, \"UNEXPECTED_ARGUMENT\", { count: values.length, expectedCount: fragment.inputs.length });\n        const topics = [];\n        if (!fragment.anonymous) {\n            topics.push(fragment.topicHash);\n        }\n        // @TODO: Use the coders for this; to properly support tuples, etc.\n        const encodeTopic = (param, value) => {\n            if (param.type === \"string\") {\n                return id(value);\n            }\n            else if (param.type === \"bytes\") {\n                return keccak256(hexlify(value));\n            }\n            if (param.type === \"bool\" && typeof (value) === \"boolean\") {\n                value = (value ? \"0x01\" : \"0x00\");\n            }\n            else if (param.type.match(/^u?int/)) {\n                value = toBeHex(value); // @TODO: Should this toTwos??\n            }\n            else if (param.type.match(/^bytes/)) {\n                value = zeroPadBytes(value, 32);\n            }\n            else if (param.type === \"address\") {\n                // Check addresses are valid\n                this.#abiCoder.encode([\"address\"], [value]);\n            }\n            return zeroPadValue(hexlify(value), 32);\n        };\n        values.forEach((value, index) => {\n            const param = fragment.inputs[index];\n            if (!param.indexed) {\n                assertArgument(value == null, \"cannot filter non-indexed parameters; must be null\", (\"contract.\" + param.name), value);\n                return;\n            }\n            if (value == null) {\n                topics.push(null);\n            }\n            else if (param.baseType === \"array\" || param.baseType === \"tuple\") {\n                assertArgument(false, \"filtering with tuples or arrays not supported\", (\"contract.\" + param.name), value);\n            }\n            else if (Array.isArray(value)) {\n                topics.push(value.map((value) => encodeTopic(param, value)));\n            }\n            else {\n                topics.push(encodeTopic(param, value));\n            }\n        });\n        // Trim off trailing nulls\n        while (topics.length && topics[topics.length - 1] === null) {\n            topics.pop();\n        }\n        return topics;\n    }\n    encodeEventLog(fragment, values) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            assertArgument(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        const topics = [];\n        const dataTypes = [];\n        const dataValues = [];\n        if (!fragment.anonymous) {\n            topics.push(fragment.topicHash);\n        }\n        assertArgument(values.length === fragment.inputs.length, \"event arguments/values mismatch\", \"values\", values);\n        fragment.inputs.forEach((param, index) => {\n            const value = values[index];\n            if (param.indexed) {\n                if (param.type === \"string\") {\n                    topics.push(id(value));\n                }\n                else if (param.type === \"bytes\") {\n                    topics.push(keccak256(value));\n                }\n                else if (param.baseType === \"tuple\" || param.baseType === \"array\") {\n                    // @TODO\n                    throw new Error(\"not implemented\");\n                }\n                else {\n                    topics.push(this.#abiCoder.encode([param.type], [value]));\n                }\n            }\n            else {\n                dataTypes.push(param);\n                dataValues.push(value);\n            }\n        });\n        return {\n            data: this.#abiCoder.encode(dataTypes, dataValues),\n            topics: topics\n        };\n    }\n    // Decode a filter for the event and the search criteria\n    decodeEventLog(fragment, data, topics) {\n        if (typeof (fragment) === \"string\") {\n            const f = this.getEvent(fragment);\n            assertArgument(f, \"unknown event\", \"eventFragment\", fragment);\n            fragment = f;\n        }\n        if (topics != null && !fragment.anonymous) {\n            const eventTopic = fragment.topicHash;\n            assertArgument(isHexString(topics[0], 32) && topics[0].toLowerCase() === eventTopic, \"fragment/topic mismatch\", \"topics[0]\", topics[0]);\n            topics = topics.slice(1);\n        }\n        const indexed = [];\n        const nonIndexed = [];\n        const dynamic = [];\n        fragment.inputs.forEach((param, index) => {\n            if (param.indexed) {\n                if (param.type === \"string\" || param.type === \"bytes\" || param.baseType === \"tuple\" || param.baseType === \"array\") {\n                    indexed.push(ParamType.from({ type: \"bytes32\", name: param.name }));\n                    dynamic.push(true);\n                }\n                else {\n                    indexed.push(param);\n                    dynamic.push(false);\n                }\n            }\n            else {\n                nonIndexed.push(param);\n                dynamic.push(false);\n            }\n        });\n        const resultIndexed = (topics != null) ? this.#abiCoder.decode(indexed, concat(topics)) : null;\n        const resultNonIndexed = this.#abiCoder.decode(nonIndexed, data, true);\n        //const result: (Array<any> & { [ key: string ]: any }) = [ ];\n        const values = [];\n        const keys = [];\n        let nonIndexedIndex = 0, indexedIndex = 0;\n        fragment.inputs.forEach((param, index) => {\n            let value = null;\n            if (param.indexed) {\n                if (resultIndexed == null) {\n                    value = new Indexed(null);\n                }\n                else if (dynamic[index]) {\n                    value = new Indexed(resultIndexed[indexedIndex++]);\n                }\n                else {\n                    try {\n                        value = resultIndexed[indexedIndex++];\n                    }\n                    catch (error) {\n                        value = error;\n                    }\n                }\n            }\n            else {\n                try {\n                    value = resultNonIndexed[nonIndexedIndex++];\n                }\n                catch (error) {\n                    value = error;\n                }\n            }\n            values.push(value);\n            keys.push(param.name || null);\n        });\n        return Result.fromItems(values, keys);\n    }\n    /**\n     *  Parses a transaction, finding the matching function and extracts\n     *  the parameter values along with other useful function details.\n     *\n     *  If the matching function cannot be found, return null.\n     */\n    parseTransaction(tx) {\n        const data = getBytes(tx.data, \"tx.data\");\n        const value = getBigInt((tx.value != null) ? tx.value : 0, \"tx.value\");\n        const fragment = this.getFunction(hexlify(data.slice(0, 4)));\n        if (!fragment) {\n            return null;\n        }\n        const args = this.#abiCoder.decode(fragment.inputs, data.slice(4));\n        return new TransactionDescription(fragment, fragment.selector, args, value);\n    }\n    parseCallResult(data) {\n        throw new Error(\"@TODO\");\n    }\n    /**\n     *  Parses a receipt log, finding the matching event and extracts\n     *  the parameter values along with other useful event details.\n     *\n     *  If the matching event cannot be found, returns null.\n     */\n    parseLog(log) {\n        const fragment = this.getEvent(log.topics[0]);\n        if (!fragment || fragment.anonymous) {\n            return null;\n        }\n        // @TODO: If anonymous, and the only method, and the input count matches, should we parse?\n        //        Probably not, because just because it is the only event in the ABI does\n        //        not mean we have the full ABI; maybe just a fragment?\n        return new LogDescription(fragment, fragment.topicHash, this.decodeEventLog(fragment, log.data, log.topics));\n    }\n    /**\n     *  Parses a revert data, finding the matching error and extracts\n     *  the parameter values along with other useful error details.\n     *\n     *  If the matching error cannot be found, returns null.\n     */\n    parseError(data) {\n        const hexData = hexlify(data);\n        const fragment = this.getError(dataSlice(hexData, 0, 4));\n        if (!fragment) {\n            return null;\n        }\n        const args = this.#abiCoder.decode(fragment.inputs, dataSlice(hexData, 4));\n        return new ErrorDescription(fragment, fragment.selector, args);\n    }\n    /**\n     *  Creates a new [[Interface]] from the ABI %%value%%.\n     *\n     *  The %%value%% may be provided as an existing [[Interface]] object,\n     *  a JSON-encoded ABI or any Human-Readable ABI format.\n     */\n    static from(value) {\n        // Already an Interface, which is immutable\n        if (value instanceof Interface) {\n            return value;\n        }\n        // JSON\n        if (typeof (value) === \"string\") {\n            return new Interface(JSON.parse(value));\n        }\n        // An Interface; possibly from another v6 instance\n        if (typeof (value.formatJson) === \"function\") {\n            return new Interface(value.formatJson());\n        }\n        // A legacy Interface; from an older version\n        if (typeof (value.format) === \"function\") {\n            return new Interface(value.format(\"json\"));\n        }\n        // Array of fragments\n        return new Interface(value);\n    }\n}\n//# sourceMappingURL=interface.js.map","//import { resolveAddress } from \"@ethersproject/address\";\nimport { defineProperties, getBigInt, getNumber, hexlify, isBytesLike, resolveProperties, assert, assertArgument, isError, makeError } from \"../utils/index.js\";\nimport { accessListify } from \"../transaction/index.js\";\nconst BN_0 = BigInt(0);\n// -----------------------\nfunction getValue(value) {\n    if (value == null) {\n        return null;\n    }\n    return value;\n}\nfunction toJson(value) {\n    if (value == null) {\n        return null;\n    }\n    return value.toString();\n}\n// @TODO? <T extends FeeData = { }> implements Required<T>\n/**\n *  A **FeeData** wraps all the fee-related values associated with\n *  the network.\n */\nexport class FeeData {\n    /**\n     *  The gas price for legacy networks.\n     */\n    gasPrice;\n    /**\n     *  The maximum fee to pay per gas.\n     *\n     *  The base fee per gas is defined by the network and based on\n     *  congestion, increasing the cost during times of heavy load\n     *  and lowering when less busy.\n     *\n     *  The actual fee per gas will be the base fee for the block\n     *  and the priority fee, up to the max fee per gas.\n     *\n     *  This will be ``null`` on legacy networks (i.e. [pre-EIP-1559](link-eip-1559))\n     */\n    maxFeePerGas;\n    /**\n     *  The additional amout to pay per gas to encourage a validator\n     *  to include the transaction.\n     *\n     *  The purpose of this is to compensate the validator for the\n     *  adjusted risk for including a given transaction.\n     *\n     *  This will be ``null`` on legacy networks (i.e. [pre-EIP-1559](link-eip-1559))\n     */\n    maxPriorityFeePerGas;\n    /**\n     *  Creates a new FeeData for %%gasPrice%%, %%maxFeePerGas%% and\n     *  %%maxPriorityFeePerGas%%.\n     */\n    constructor(gasPrice, maxFeePerGas, maxPriorityFeePerGas) {\n        defineProperties(this, {\n            gasPrice: getValue(gasPrice),\n            maxFeePerGas: getValue(maxFeePerGas),\n            maxPriorityFeePerGas: getValue(maxPriorityFeePerGas)\n        });\n    }\n    /**\n     *  Returns a JSON-friendly value.\n     */\n    toJSON() {\n        const { gasPrice, maxFeePerGas, maxPriorityFeePerGas } = this;\n        return {\n            _type: \"FeeData\",\n            gasPrice: toJson(gasPrice),\n            maxFeePerGas: toJson(maxFeePerGas),\n            maxPriorityFeePerGas: toJson(maxPriorityFeePerGas),\n        };\n    }\n}\n;\n/**\n *  Returns a copy of %%req%% with all properties coerced to their strict\n *  types.\n */\nexport function copyRequest(req) {\n    const result = {};\n    // These could be addresses, ENS names or Addressables\n    if (req.to) {\n        result.to = req.to;\n    }\n    if (req.from) {\n        result.from = req.from;\n    }\n    if (req.data) {\n        result.data = hexlify(req.data);\n    }\n    const bigIntKeys = \"chainId,gasLimit,gasPrice,maxFeePerBlobGas,maxFeePerGas,maxPriorityFeePerGas,value\".split(/,/);\n    for (const key of bigIntKeys) {\n        if (!(key in req) || req[key] == null) {\n            continue;\n        }\n        result[key] = getBigInt(req[key], `request.${key}`);\n    }\n    const numberKeys = \"type,nonce\".split(/,/);\n    for (const key of numberKeys) {\n        if (!(key in req) || req[key] == null) {\n            continue;\n        }\n        result[key] = getNumber(req[key], `request.${key}`);\n    }\n    if (req.accessList) {\n        result.accessList = accessListify(req.accessList);\n    }\n    if (\"blockTag\" in req) {\n        result.blockTag = req.blockTag;\n    }\n    if (\"enableCcipRead\" in req) {\n        result.enableCcipRead = !!req.enableCcipRead;\n    }\n    if (\"customData\" in req) {\n        result.customData = req.customData;\n    }\n    if (\"blobVersionedHashes\" in req && req.blobVersionedHashes) {\n        result.blobVersionedHashes = req.blobVersionedHashes.slice();\n    }\n    if (\"kzg\" in req) {\n        result.kzg = req.kzg;\n    }\n    if (\"blobs\" in req && req.blobs) {\n        result.blobs = req.blobs.map((b) => {\n            if (isBytesLike(b)) {\n                return hexlify(b);\n            }\n            return Object.assign({}, b);\n        });\n    }\n    return result;\n}\n/**\n *  A **Block** represents the data associated with a full block on\n *  Ethereum.\n */\nexport class Block {\n    /**\n     *  The provider connected to the block used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The block number, sometimes called the block height. This is a\n     *  sequential number that is one higher than the parent block.\n     */\n    number;\n    /**\n     *  The block hash.\n     *\n     *  This hash includes all properties, so can be safely used to identify\n     *  an exact set of block properties.\n     */\n    hash;\n    /**\n     *  The timestamp for this block, which is the number of seconds since\n     *  epoch that this block was included.\n     */\n    timestamp;\n    /**\n     *  The block hash of the parent block.\n     */\n    parentHash;\n    /**\n     *  The hash tree root of the parent beacon block for the given\n     *  execution block. See [[link-eip-4788]].\n     */\n    parentBeaconBlockRoot;\n    /**\n     *  The nonce.\n     *\n     *  On legacy networks, this is the random number inserted which\n     *  permitted the difficulty target to be reached.\n     */\n    nonce;\n    /**\n     *  The difficulty target.\n     *\n     *  On legacy networks, this is the proof-of-work target required\n     *  for a block to meet the protocol rules to be included.\n     *\n     *  On modern networks, this is a random number arrived at using\n     *  randao.  @TODO: Find links?\n     */\n    difficulty;\n    /**\n     *  The total gas limit for this block.\n     */\n    gasLimit;\n    /**\n     *  The total gas used in this block.\n     */\n    gasUsed;\n    /**\n     *  The root hash for the global state after applying changes\n     *  in this block.\n     */\n    stateRoot;\n    /**\n     *  The hash of the transaction receipts trie.\n     */\n    receiptsRoot;\n    /**\n     *  The total amount of blob gas consumed by the transactions\n     *  within the block. See [[link-eip-4844]].\n     */\n    blobGasUsed;\n    /**\n     *  The running total of blob gas consumed in excess of the\n     *  target, prior to the block. See [[link-eip-4844]].\n     */\n    excessBlobGas;\n    /**\n     *  The miner coinbase address, wihch receives any subsidies for\n     *  including this block.\n     */\n    miner;\n    /**\n     *  The latest RANDAO mix of the post beacon state of\n     *  the previous block.\n     */\n    prevRandao;\n    /**\n     *  Any extra data the validator wished to include.\n     */\n    extraData;\n    /**\n     *  The base fee per gas that all transactions in this block were\n     *  charged.\n     *\n     *  This adjusts after each block, depending on how congested the network\n     *  is.\n     */\n    baseFeePerGas;\n    #transactions;\n    /**\n     *  Create a new **Block** object.\n     *\n     *  This should generally not be necessary as the unless implementing a\n     *  low-level library.\n     */\n    constructor(block, provider) {\n        this.#transactions = block.transactions.map((tx) => {\n            if (typeof (tx) !== \"string\") {\n                return new TransactionResponse(tx, provider);\n            }\n            return tx;\n        });\n        defineProperties(this, {\n            provider,\n            hash: getValue(block.hash),\n            number: block.number,\n            timestamp: block.timestamp,\n            parentHash: block.parentHash,\n            parentBeaconBlockRoot: block.parentBeaconBlockRoot,\n            nonce: block.nonce,\n            difficulty: block.difficulty,\n            gasLimit: block.gasLimit,\n            gasUsed: block.gasUsed,\n            blobGasUsed: block.blobGasUsed,\n            excessBlobGas: block.excessBlobGas,\n            miner: block.miner,\n            prevRandao: getValue(block.prevRandao),\n            extraData: block.extraData,\n            baseFeePerGas: getValue(block.baseFeePerGas),\n            stateRoot: block.stateRoot,\n            receiptsRoot: block.receiptsRoot,\n        });\n    }\n    /**\n     *  Returns the list of transaction hashes, in the order\n     *  they were executed within the block.\n     */\n    get transactions() {\n        return this.#transactions.map((tx) => {\n            if (typeof (tx) === \"string\") {\n                return tx;\n            }\n            return tx.hash;\n        });\n    }\n    /**\n     *  Returns the complete transactions, in the order they\n     *  were executed within the block.\n     *\n     *  This is only available for blocks which prefetched\n     *  transactions, by passing ``true`` to %%prefetchTxs%%\n     *  into [[Provider-getBlock]].\n     */\n    get prefetchedTransactions() {\n        const txs = this.#transactions.slice();\n        // Doesn't matter...\n        if (txs.length === 0) {\n            return [];\n        }\n        // Make sure we prefetched the transactions\n        assert(typeof (txs[0]) === \"object\", \"transactions were not prefetched with block request\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"transactionResponses()\"\n        });\n        return txs;\n    }\n    /**\n     *  Returns a JSON-friendly value.\n     */\n    toJSON() {\n        const { baseFeePerGas, difficulty, extraData, gasLimit, gasUsed, hash, miner, prevRandao, nonce, number, parentHash, parentBeaconBlockRoot, stateRoot, receiptsRoot, timestamp, transactions } = this;\n        return {\n            _type: \"Block\",\n            baseFeePerGas: toJson(baseFeePerGas),\n            difficulty: toJson(difficulty),\n            extraData,\n            gasLimit: toJson(gasLimit),\n            gasUsed: toJson(gasUsed),\n            blobGasUsed: toJson(this.blobGasUsed),\n            excessBlobGas: toJson(this.excessBlobGas),\n            hash, miner, prevRandao, nonce, number, parentHash, timestamp,\n            parentBeaconBlockRoot, stateRoot, receiptsRoot,\n            transactions,\n        };\n    }\n    [Symbol.iterator]() {\n        let index = 0;\n        const txs = this.transactions;\n        return {\n            next: () => {\n                if (index < this.length) {\n                    return {\n                        value: txs[index++], done: false\n                    };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The number of transactions in this block.\n     */\n    get length() { return this.#transactions.length; }\n    /**\n     *  The [[link-js-date]] this block was included at.\n     */\n    get date() {\n        if (this.timestamp == null) {\n            return null;\n        }\n        return new Date(this.timestamp * 1000);\n    }\n    /**\n     *  Get the transaction at %%indexe%% within this block.\n     */\n    async getTransaction(indexOrHash) {\n        // Find the internal value by its index or hash\n        let tx = undefined;\n        if (typeof (indexOrHash) === \"number\") {\n            tx = this.#transactions[indexOrHash];\n        }\n        else {\n            const hash = indexOrHash.toLowerCase();\n            for (const v of this.#transactions) {\n                if (typeof (v) === \"string\") {\n                    if (v !== hash) {\n                        continue;\n                    }\n                    tx = v;\n                    break;\n                }\n                else {\n                    if (v.hash === hash) {\n                        continue;\n                    }\n                    tx = v;\n                    break;\n                }\n            }\n        }\n        if (tx == null) {\n            throw new Error(\"no such tx\");\n        }\n        if (typeof (tx) === \"string\") {\n            return (await this.provider.getTransaction(tx));\n        }\n        else {\n            return tx;\n        }\n    }\n    /**\n     *  If a **Block** was fetched with a request to include the transactions\n     *  this will allow synchronous access to those transactions.\n     *\n     *  If the transactions were not prefetched, this will throw.\n     */\n    getPrefetchedTransaction(indexOrHash) {\n        const txs = this.prefetchedTransactions;\n        if (typeof (indexOrHash) === \"number\") {\n            return txs[indexOrHash];\n        }\n        indexOrHash = indexOrHash.toLowerCase();\n        for (const tx of txs) {\n            if (tx.hash === indexOrHash) {\n                return tx;\n            }\n        }\n        assertArgument(false, \"no matching transaction\", \"indexOrHash\", indexOrHash);\n    }\n    /**\n     *  Returns true if this block been mined. This provides a type guard\n     *  for all properties on a [[MinedBlock]].\n     */\n    isMined() { return !!this.hash; }\n    /**\n     *  Returns true if this block is an [[link-eip-2930]] block.\n     */\n    isLondon() {\n        return !!this.baseFeePerGas;\n    }\n    /**\n     *  @_ignore:\n     */\n    orphanedEvent() {\n        if (!this.isMined()) {\n            throw new Error(\"\");\n        }\n        return createOrphanedBlockFilter(this);\n    }\n}\n//////////////////////\n// Log\n/**\n *  A **Log** in Ethereum represents an event that has been included in a\n *  transaction using the ``LOG*`` opcodes, which are most commonly used by\n *  Solidity's emit for announcing events.\n */\nexport class Log {\n    /**\n     *  The provider connected to the log used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The transaction hash of the transaction this log occurred in. Use the\n     *  [[Log-getTransaction]] to get the [[TransactionResponse]].\n     */\n    transactionHash;\n    /**\n     *  The block hash of the block this log occurred in. Use the\n     *  [[Log-getBlock]] to get the [[Block]].\n     */\n    blockHash;\n    /**\n     *  The block number of the block this log occurred in. It is preferred\n     *  to use the [[Block-hash]] when fetching the related [[Block]],\n     *  since in the case of an orphaned block, the block at that height may\n     *  have changed.\n     */\n    blockNumber;\n    /**\n     *  If the **Log** represents a block that was removed due to an orphaned\n     *  block, this will be true.\n     *\n     *  This can only happen within an orphan event listener.\n     */\n    removed;\n    /**\n     *  The address of the contract that emitted this log.\n     */\n    address;\n    /**\n     *  The data included in this log when it was emitted.\n     */\n    data;\n    /**\n     *  The indexed topics included in this log when it was emitted.\n     *\n     *  All topics are included in the bloom filters, so they can be\n     *  efficiently filtered using the [[Provider-getLogs]] method.\n     */\n    topics;\n    /**\n     *  The index within the block this log occurred at. This is generally\n     *  not useful to developers, but can be used with the various roots\n     *  to proof inclusion within a block.\n     */\n    index;\n    /**\n     *  The index within the transaction of this log.\n     */\n    transactionIndex;\n    /**\n     *  @_ignore:\n     */\n    constructor(log, provider) {\n        this.provider = provider;\n        const topics = Object.freeze(log.topics.slice());\n        defineProperties(this, {\n            transactionHash: log.transactionHash,\n            blockHash: log.blockHash,\n            blockNumber: log.blockNumber,\n            removed: log.removed,\n            address: log.address,\n            data: log.data,\n            topics,\n            index: log.index,\n            transactionIndex: log.transactionIndex,\n        });\n    }\n    /**\n     *  Returns a JSON-compatible object.\n     */\n    toJSON() {\n        const { address, blockHash, blockNumber, data, index, removed, topics, transactionHash, transactionIndex } = this;\n        return {\n            _type: \"log\",\n            address, blockHash, blockNumber, data, index,\n            removed, topics, transactionHash, transactionIndex\n        };\n    }\n    /**\n     *  Returns the block that this log occurred in.\n     */\n    async getBlock() {\n        const block = await this.provider.getBlock(this.blockHash);\n        assert(!!block, \"failed to find transaction\", \"UNKNOWN_ERROR\", {});\n        return block;\n    }\n    /**\n     *  Returns the transaction that this log occurred in.\n     */\n    async getTransaction() {\n        const tx = await this.provider.getTransaction(this.transactionHash);\n        assert(!!tx, \"failed to find transaction\", \"UNKNOWN_ERROR\", {});\n        return tx;\n    }\n    /**\n     *  Returns the transaction receipt fot the transaction that this\n     *  log occurred in.\n     */\n    async getTransactionReceipt() {\n        const receipt = await this.provider.getTransactionReceipt(this.transactionHash);\n        assert(!!receipt, \"failed to find transaction receipt\", \"UNKNOWN_ERROR\", {});\n        return receipt;\n    }\n    /**\n     *  @_ignore:\n     */\n    removedEvent() {\n        return createRemovedLogFilter(this);\n    }\n}\n//////////////////////\n// Transaction Receipt\n/*\nexport interface LegacyTransactionReceipt {\n    byzantium: false;\n    status: null;\n    root: string;\n}\n\nexport interface ByzantiumTransactionReceipt {\n    byzantium: true;\n    status: number;\n    root: null;\n}\n*/\n/**\n *  A **TransactionReceipt** includes additional information about a\n *  transaction that is only available after it has been mined.\n */\nexport class TransactionReceipt {\n    /**\n     *  The provider connected to the log used to fetch additional details\n     *  if necessary.\n     */\n    provider;\n    /**\n     *  The address the transaction was sent to.\n     */\n    to;\n    /**\n     *  The sender of the transaction.\n     */\n    from;\n    /**\n     *  The address of the contract if the transaction was directly\n     *  responsible for deploying one.\n     *\n     *  This is non-null **only** if the ``to`` is empty and the ``data``\n     *  was successfully executed as initcode.\n     */\n    contractAddress;\n    /**\n     *  The transaction hash.\n     */\n    hash;\n    /**\n     *  The index of this transaction within the block transactions.\n     */\n    index;\n    /**\n     *  The block hash of the [[Block]] this transaction was included in.\n     */\n    blockHash;\n    /**\n     *  The block number of the [[Block]] this transaction was included in.\n     */\n    blockNumber;\n    /**\n     *  The bloom filter bytes that represent all logs that occurred within\n     *  this transaction. This is generally not useful for most developers,\n     *  but can be used to validate the included logs.\n     */\n    logsBloom;\n    /**\n     *  The actual amount of gas used by this transaction.\n     *\n     *  When creating a transaction, the amount of gas that will be used can\n     *  only be approximated, but the sender must pay the gas fee for the\n     *  entire gas limit. After the transaction, the difference is refunded.\n     */\n    gasUsed;\n    /**\n     *  The gas used for BLObs. See [[link-eip-4844]].\n     */\n    blobGasUsed;\n    /**\n     *  The amount of gas used by all transactions within the block for this\n     *  and all transactions with a lower ``index``.\n     *\n     *  This is generally not useful for developers but can be used to\n     *  validate certain aspects of execution.\n     */\n    cumulativeGasUsed;\n    /**\n     *  The actual gas price used during execution.\n     *\n     *  Due to the complexity of [[link-eip-1559]] this value can only\n     *  be caluclated after the transaction has been mined, snce the base\n     *  fee is protocol-enforced.\n     */\n    gasPrice;\n    /**\n     *  The price paid per BLOB in gas. See [[link-eip-4844]].\n     */\n    blobGasPrice;\n    /**\n     *  The [[link-eip-2718]] transaction type.\n     */\n    type;\n    //readonly byzantium!: boolean;\n    /**\n     *  The status of this transaction, indicating success (i.e. ``1``) or\n     *  a revert (i.e. ``0``).\n     *\n     *  This is available in post-byzantium blocks, but some backends may\n     *  backfill this value.\n     */\n    status;\n    /**\n     *  The root hash of this transaction.\n     *\n     *  This is no present and was only included in pre-byzantium blocks, but\n     *  could be used to validate certain parts of the receipt.\n     */\n    root;\n    #logs;\n    /**\n     *  @_ignore:\n     */\n    constructor(tx, provider) {\n        this.#logs = Object.freeze(tx.logs.map((log) => {\n            return new Log(log, provider);\n        }));\n        let gasPrice = BN_0;\n        if (tx.effectiveGasPrice != null) {\n            gasPrice = tx.effectiveGasPrice;\n        }\n        else if (tx.gasPrice != null) {\n            gasPrice = tx.gasPrice;\n        }\n        defineProperties(this, {\n            provider,\n            to: tx.to,\n            from: tx.from,\n            contractAddress: tx.contractAddress,\n            hash: tx.hash,\n            index: tx.index,\n            blockHash: tx.blockHash,\n            blockNumber: tx.blockNumber,\n            logsBloom: tx.logsBloom,\n            gasUsed: tx.gasUsed,\n            cumulativeGasUsed: tx.cumulativeGasUsed,\n            blobGasUsed: tx.blobGasUsed,\n            gasPrice,\n            blobGasPrice: tx.blobGasPrice,\n            type: tx.type,\n            //byzantium: tx.byzantium,\n            status: tx.status,\n            root: tx.root\n        });\n    }\n    /**\n     *  The logs for this transaction.\n     */\n    get logs() { return this.#logs; }\n    /**\n     *  Returns a JSON-compatible representation.\n     */\n    toJSON() {\n        const { to, from, contractAddress, hash, index, blockHash, blockNumber, logsBloom, logs, //byzantium, \n        status, root } = this;\n        return {\n            _type: \"TransactionReceipt\",\n            blockHash, blockNumber,\n            //byzantium, \n            contractAddress,\n            cumulativeGasUsed: toJson(this.cumulativeGasUsed),\n            from,\n            gasPrice: toJson(this.gasPrice),\n            blobGasUsed: toJson(this.blobGasUsed),\n            blobGasPrice: toJson(this.blobGasPrice),\n            gasUsed: toJson(this.gasUsed),\n            hash, index, logs, logsBloom, root, status, to\n        };\n    }\n    /**\n     *  @_ignore:\n     */\n    get length() { return this.logs.length; }\n    [Symbol.iterator]() {\n        let index = 0;\n        return {\n            next: () => {\n                if (index < this.length) {\n                    return { value: this.logs[index++], done: false };\n                }\n                return { value: undefined, done: true };\n            }\n        };\n    }\n    /**\n     *  The total fee for this transaction, in wei.\n     */\n    get fee() {\n        return this.gasUsed * this.gasPrice;\n    }\n    /**\n     *  Resolves to the block this transaction occurred in.\n     */\n    async getBlock() {\n        const block = await this.provider.getBlock(this.blockHash);\n        if (block == null) {\n            throw new Error(\"TODO\");\n        }\n        return block;\n    }\n    /**\n     *  Resolves to the transaction this transaction occurred in.\n     */\n    async getTransaction() {\n        const tx = await this.provider.getTransaction(this.hash);\n        if (tx == null) {\n            throw new Error(\"TODO\");\n        }\n        return tx;\n    }\n    /**\n     *  Resolves to the return value of the execution of this transaction.\n     *\n     *  Support for this feature is limited, as it requires an archive node\n     *  with the ``debug_`` or ``trace_`` API enabled.\n     */\n    async getResult() {\n        return (await this.provider.getTransactionResult(this.hash));\n    }\n    /**\n     *  Resolves to the number of confirmations this transaction has.\n     */\n    async confirmations() {\n        return (await this.provider.getBlockNumber()) - this.blockNumber + 1;\n    }\n    /**\n     *  @_ignore:\n     */\n    removedEvent() {\n        return createRemovedTransactionFilter(this);\n    }\n    /**\n     *  @_ignore:\n     */\n    reorderedEvent(other) {\n        assert(!other || other.isMined(), \"unmined 'other' transction cannot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"reorderedEvent(other)\" });\n        return createReorderedTransactionFilter(this, other);\n    }\n}\n/**\n *  A **TransactionResponse** includes all properties about a transaction\n *  that was sent to the network, which may or may not be included in a\n *  block.\n *\n *  The [[TransactionResponse-isMined]] can be used to check if the\n *  transaction has been mined as well as type guard that the otherwise\n *  possibly ``null`` properties are defined.\n */\nexport class TransactionResponse {\n    /**\n     *  The provider this is connected to, which will influence how its\n     *  methods will resolve its async inspection methods.\n     */\n    provider;\n    /**\n     *  The block number of the block that this transaction was included in.\n     *\n     *  This is ``null`` for pending transactions.\n     */\n    blockNumber;\n    /**\n     *  The blockHash of the block that this transaction was included in.\n     *\n     *  This is ``null`` for pending transactions.\n     */\n    blockHash;\n    /**\n     *  The index within the block that this transaction resides at.\n     */\n    index;\n    /**\n     *  The transaction hash.\n     */\n    hash;\n    /**\n     *  The [[link-eip-2718]] transaction envelope type. This is\n     *  ``0`` for legacy transactions types.\n     */\n    type;\n    /**\n     *  The receiver of this transaction.\n     *\n     *  If ``null``, then the transaction is an initcode transaction.\n     *  This means the result of executing the [[data]] will be deployed\n     *  as a new contract on chain (assuming it does not revert) and the\n     *  address may be computed using [[getCreateAddress]].\n     */\n    to;\n    /**\n     *  The sender of this transaction. It is implicitly computed\n     *  from the transaction pre-image hash (as the digest) and the\n     *  [[signature]] using ecrecover.\n     */\n    from;\n    /**\n     *  The nonce, which is used to prevent replay attacks and offer\n     *  a method to ensure transactions from a given sender are explicitly\n     *  ordered.\n     *\n     *  When sending a transaction, this must be equal to the number of\n     *  transactions ever sent by [[from]].\n     */\n    nonce;\n    /**\n     *  The maximum units of gas this transaction can consume. If execution\n     *  exceeds this, the entries transaction is reverted and the sender\n     *  is charged for the full amount, despite not state changes being made.\n     */\n    gasLimit;\n    /**\n     *  The gas price can have various values, depending on the network.\n     *\n     *  In modern networks, for transactions that are included this is\n     *  the //effective gas price// (the fee per gas that was actually\n     *  charged), while for transactions that have not been included yet\n     *  is the [[maxFeePerGas]].\n     *\n     *  For legacy transactions, or transactions on legacy networks, this\n     *  is the fee that will be charged per unit of gas the transaction\n     *  consumes.\n     */\n    gasPrice;\n    /**\n     *  The maximum priority fee (per unit of gas) to allow a\n     *  validator to charge the sender. This is inclusive of the\n     *  [[maxFeeFeePerGas]].\n     */\n    maxPriorityFeePerGas;\n    /**\n     *  The maximum fee (per unit of gas) to allow this transaction\n     *  to charge the sender.\n     */\n    maxFeePerGas;\n    /**\n     *  The [[link-eip-4844]] max fee per BLOb gas.\n     */\n    maxFeePerBlobGas;\n    /**\n     *  The data.\n     */\n    data;\n    /**\n     *  The value, in wei. Use [[formatEther]] to format this value\n     *  as ether.\n     */\n    value;\n    /**\n     *  The chain ID.\n     */\n    chainId;\n    /**\n     *  The signature.\n     */\n    signature;\n    /**\n     *  The [[link-eip-2930]] access list for transaction types that\n     *  support it, otherwise ``null``.\n     */\n    accessList;\n    /**\n     *  The [[link-eip-4844]] BLOb versioned hashes.\n     */\n    blobVersionedHashes;\n    #startBlock;\n    /**\n     *  @_ignore:\n     */\n    constructor(tx, provider) {\n        this.provider = provider;\n        this.blockNumber = (tx.blockNumber != null) ? tx.blockNumber : null;\n        this.blockHash = (tx.blockHash != null) ? tx.blockHash : null;\n        this.hash = tx.hash;\n        this.index = tx.index;\n        this.type = tx.type;\n        this.from = tx.from;\n        this.to = tx.to || null;\n        this.gasLimit = tx.gasLimit;\n        this.nonce = tx.nonce;\n        this.data = tx.data;\n        this.value = tx.value;\n        this.gasPrice = tx.gasPrice;\n        this.maxPriorityFeePerGas = (tx.maxPriorityFeePerGas != null) ? tx.maxPriorityFeePerGas : null;\n        this.maxFeePerGas = (tx.maxFeePerGas != null) ? tx.maxFeePerGas : null;\n        this.maxFeePerBlobGas = (tx.maxFeePerBlobGas != null) ? tx.maxFeePerBlobGas : null;\n        this.chainId = tx.chainId;\n        this.signature = tx.signature;\n        this.accessList = (tx.accessList != null) ? tx.accessList : null;\n        this.blobVersionedHashes = (tx.blobVersionedHashes != null) ? tx.blobVersionedHashes : null;\n        this.#startBlock = -1;\n    }\n    /**\n     *  Returns a JSON-compatible representation of this transaction.\n     */\n    toJSON() {\n        const { blockNumber, blockHash, index, hash, type, to, from, nonce, data, signature, accessList, blobVersionedHashes } = this;\n        return {\n            _type: \"TransactionResponse\",\n            accessList, blockNumber, blockHash,\n            blobVersionedHashes,\n            chainId: toJson(this.chainId),\n            data, from,\n            gasLimit: toJson(this.gasLimit),\n            gasPrice: toJson(this.gasPrice),\n            hash,\n            maxFeePerGas: toJson(this.maxFeePerGas),\n            maxPriorityFeePerGas: toJson(this.maxPriorityFeePerGas),\n            maxFeePerBlobGas: toJson(this.maxFeePerBlobGas),\n            nonce, signature, to, index, type,\n            value: toJson(this.value),\n        };\n    }\n    /**\n     *  Resolves to the Block that this transaction was included in.\n     *\n     *  This will return null if the transaction has not been included yet.\n     */\n    async getBlock() {\n        let blockNumber = this.blockNumber;\n        if (blockNumber == null) {\n            const tx = await this.getTransaction();\n            if (tx) {\n                blockNumber = tx.blockNumber;\n            }\n        }\n        if (blockNumber == null) {\n            return null;\n        }\n        const block = this.provider.getBlock(blockNumber);\n        if (block == null) {\n            throw new Error(\"TODO\");\n        }\n        return block;\n    }\n    /**\n     *  Resolves to this transaction being re-requested from the\n     *  provider. This can be used if you have an unmined transaction\n     *  and wish to get an up-to-date populated instance.\n     */\n    async getTransaction() {\n        return this.provider.getTransaction(this.hash);\n    }\n    /**\n     *  Resolve to the number of confirmations this transaction has.\n     */\n    async confirmations() {\n        if (this.blockNumber == null) {\n            const { tx, blockNumber } = await resolveProperties({\n                tx: this.getTransaction(),\n                blockNumber: this.provider.getBlockNumber()\n            });\n            // Not mined yet...\n            if (tx == null || tx.blockNumber == null) {\n                return 0;\n            }\n            return blockNumber - tx.blockNumber + 1;\n        }\n        const blockNumber = await this.provider.getBlockNumber();\n        return blockNumber - this.blockNumber + 1;\n    }\n    /**\n     *  Resolves once this transaction has been mined and has\n     *  %%confirms%% blocks including it (default: ``1``) with an\n     *  optional %%timeout%%.\n     *\n     *  This can resolve to ``null`` only if %%confirms%% is ``0``\n     *  and the transaction has not been mined, otherwise this will\n     *  wait until enough confirmations have completed.\n     */\n    async wait(_confirms, _timeout) {\n        const confirms = (_confirms == null) ? 1 : _confirms;\n        const timeout = (_timeout == null) ? 0 : _timeout;\n        let startBlock = this.#startBlock;\n        let nextScan = -1;\n        let stopScanning = (startBlock === -1) ? true : false;\n        const checkReplacement = async () => {\n            // Get the current transaction count for this sender\n            if (stopScanning) {\n                return null;\n            }\n            const { blockNumber, nonce } = await resolveProperties({\n                blockNumber: this.provider.getBlockNumber(),\n                nonce: this.provider.getTransactionCount(this.from)\n            });\n            // No transaction or our nonce has not been mined yet; but we\n            // can start scanning later when we do start\n            if (nonce < this.nonce) {\n                startBlock = blockNumber;\n                return;\n            }\n            // We were mined; no replacement\n            if (stopScanning) {\n                return null;\n            }\n            const mined = await this.getTransaction();\n            if (mined && mined.blockNumber != null) {\n                return;\n            }\n            // We were replaced; start scanning for that transaction\n            // Starting to scan; look back a few extra blocks for safety\n            if (nextScan === -1) {\n                nextScan = startBlock - 3;\n                if (nextScan < this.#startBlock) {\n                    nextScan = this.#startBlock;\n                }\n            }\n            while (nextScan <= blockNumber) {\n                // Get the next block to scan\n                if (stopScanning) {\n                    return null;\n                }\n                const block = await this.provider.getBlock(nextScan, true);\n                // This should not happen; but we'll try again shortly\n                if (block == null) {\n                    return;\n                }\n                // We were mined; no replacement\n                for (const hash of block) {\n                    if (hash === this.hash) {\n                        return;\n                    }\n                }\n                // Search for the transaction that replaced us\n                for (let i = 0; i < block.length; i++) {\n                    const tx = await block.getTransaction(i);\n                    if (tx.from === this.from && tx.nonce === this.nonce) {\n                        // Get the receipt\n                        if (stopScanning) {\n                            return null;\n                        }\n                        const receipt = await this.provider.getTransactionReceipt(tx.hash);\n                        // This should not happen; but we'll try again shortly\n                        if (receipt == null) {\n                            return;\n                        }\n                        // We will retry this on the next block (this case could be optimized)\n                        if ((blockNumber - receipt.blockNumber + 1) < confirms) {\n                            return;\n                        }\n                        // The reason we were replaced\n                        let reason = \"replaced\";\n                        if (tx.data === this.data && tx.to === this.to && tx.value === this.value) {\n                            reason = \"repriced\";\n                        }\n                        else if (tx.data === \"0x\" && tx.from === tx.to && tx.value === BN_0) {\n                            reason = \"cancelled\";\n                        }\n                        assert(false, \"transaction was replaced\", \"TRANSACTION_REPLACED\", {\n                            cancelled: (reason === \"replaced\" || reason === \"cancelled\"),\n                            reason,\n                            replacement: tx.replaceableTransaction(startBlock),\n                            hash: tx.hash,\n                            receipt\n                        });\n                    }\n                }\n                nextScan++;\n            }\n            return;\n        };\n        const checkReceipt = (receipt) => {\n            if (receipt == null || receipt.status !== 0) {\n                return receipt;\n            }\n            assert(false, \"transaction execution reverted\", \"CALL_EXCEPTION\", {\n                action: \"sendTransaction\",\n                data: null, reason: null, invocation: null, revert: null,\n                transaction: {\n                    to: receipt.to,\n                    from: receipt.from,\n                    data: \"\" // @TODO: in v7, split out sendTransaction properties\n                }, receipt\n            });\n        };\n        const receipt = await this.provider.getTransactionReceipt(this.hash);\n        if (confirms === 0) {\n            return checkReceipt(receipt);\n        }\n        if (receipt) {\n            if ((await receipt.confirmations()) >= confirms) {\n                return checkReceipt(receipt);\n            }\n        }\n        else {\n            // Check for a replacement; throws if a replacement was found\n            await checkReplacement();\n            // Allow null only when the confirms is 0\n            if (confirms === 0) {\n                return null;\n            }\n        }\n        const waiter = new Promise((resolve, reject) => {\n            // List of things to cancel when we have a result (one way or the other)\n            const cancellers = [];\n            const cancel = () => { cancellers.forEach((c) => c()); };\n            // On cancel, stop scanning for replacements\n            cancellers.push(() => { stopScanning = true; });\n            // Set up any timeout requested\n            if (timeout > 0) {\n                const timer = setTimeout(() => {\n                    cancel();\n                    reject(makeError(\"wait for transaction timeout\", \"TIMEOUT\"));\n                }, timeout);\n                cancellers.push(() => { clearTimeout(timer); });\n            }\n            const txListener = async (receipt) => {\n                // Done; return it!\n                if ((await receipt.confirmations()) >= confirms) {\n                    cancel();\n                    try {\n                        resolve(checkReceipt(receipt));\n                    }\n                    catch (error) {\n                        reject(error);\n                    }\n                }\n            };\n            cancellers.push(() => { this.provider.off(this.hash, txListener); });\n            this.provider.on(this.hash, txListener);\n            // We support replacement detection; start checking\n            if (startBlock >= 0) {\n                const replaceListener = async () => {\n                    try {\n                        // Check for a replacement; this throws only if one is found\n                        await checkReplacement();\n                    }\n                    catch (error) {\n                        // We were replaced (with enough confirms); re-throw the error\n                        if (isError(error, \"TRANSACTION_REPLACED\")) {\n                            cancel();\n                            reject(error);\n                            return;\n                        }\n                    }\n                    // Rescheudle a check on the next block\n                    if (!stopScanning) {\n                        this.provider.once(\"block\", replaceListener);\n                    }\n                };\n                cancellers.push(() => { this.provider.off(\"block\", replaceListener); });\n                this.provider.once(\"block\", replaceListener);\n            }\n        });\n        return await waiter;\n    }\n    /**\n     *  Returns ``true`` if this transaction has been included.\n     *\n     *  This is effective only as of the time the TransactionResponse\n     *  was instantiated. To get up-to-date information, use\n     *  [[getTransaction]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  non-null property values for properties that are null for\n     *  unmined transactions.\n     */\n    isMined() {\n        return (this.blockHash != null);\n    }\n    /**\n     *  Returns true if the transaction is a legacy (i.e. ``type == 0``)\n     *  transaction.\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isLegacy() {\n        return (this.type === 0);\n    }\n    /**\n     *  Returns true if the transaction is a Berlin (i.e. ``type == 1``)\n     *  transaction. See [[link-eip-2070]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isBerlin() {\n        return (this.type === 1);\n    }\n    /**\n     *  Returns true if the transaction is a London (i.e. ``type == 2``)\n     *  transaction. See [[link-eip-1559]].\n     *\n     *  This provides a Type Guard that this transaction will have\n     *  the ``null``-ness for hardfork-specific properties set correctly.\n     */\n    isLondon() {\n        return (this.type === 2);\n    }\n    /**\n     *  Returns true if hte transaction is a Cancun (i.e. ``type == 3``)\n     *  transaction. See [[link-eip-4844]].\n     */\n    isCancun() {\n        return (this.type === 3);\n    }\n    /**\n     *  Returns a filter which can be used to listen for orphan events\n     *  that evict this transaction.\n     */\n    removedEvent() {\n        assert(this.isMined(), \"unmined transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        return createRemovedTransactionFilter(this);\n    }\n    /**\n     *  Returns a filter which can be used to listen for orphan events\n     *  that re-order this event against %%other%%.\n     */\n    reorderedEvent(other) {\n        assert(this.isMined(), \"unmined transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        assert(!other || other.isMined(), \"unmined 'other' transaction canot be orphaned\", \"UNSUPPORTED_OPERATION\", { operation: \"removeEvent()\" });\n        return createReorderedTransactionFilter(this, other);\n    }\n    /**\n     *  Returns a new TransactionResponse instance which has the ability to\n     *  detect (and throw an error) if the transaction is replaced, which\n     *  will begin scanning at %%startBlock%%.\n     *\n     *  This should generally not be used by developers and is intended\n     *  primarily for internal use. Setting an incorrect %%startBlock%% can\n     *  have devastating performance consequences if used incorrectly.\n     */\n    replaceableTransaction(startBlock) {\n        assertArgument(Number.isInteger(startBlock) && startBlock >= 0, \"invalid startBlock\", \"startBlock\", startBlock);\n        const tx = new TransactionResponse(this, this.provider);\n        tx.#startBlock = startBlock;\n        return tx;\n    }\n}\nfunction createOrphanedBlockFilter(block) {\n    return { orphan: \"drop-block\", hash: block.hash, number: block.number };\n}\nfunction createReorderedTransactionFilter(tx, other) {\n    return { orphan: \"reorder-transaction\", tx, other };\n}\nfunction createRemovedTransactionFilter(tx) {\n    return { orphan: \"drop-transaction\", tx };\n}\nfunction createRemovedLogFilter(log) {\n    return { orphan: \"drop-log\", log: {\n            transactionHash: log.transactionHash,\n            blockHash: log.blockHash,\n            blockNumber: log.blockNumber,\n            address: log.address,\n            data: log.data,\n            topics: Object.freeze(log.topics.slice()),\n            index: log.index\n        } };\n}\n//# sourceMappingURL=provider.js.map","// import from provider.ts instead of index.ts to prevent circular dep\n// from EtherscanProvider\nimport { Log, TransactionReceipt, TransactionResponse } from \"../providers/provider.js\";\nimport { defineProperties, EventPayload } from \"../utils/index.js\";\n/**\n *  An **EventLog** contains additional properties parsed from the [[Log]].\n */\nexport class EventLog extends Log {\n    /**\n     *  The Contract Interface.\n     */\n    interface;\n    /**\n     *  The matching event.\n     */\n    fragment;\n    /**\n     *  The parsed arguments passed to the event by ``emit``.\n     */\n    args;\n    /**\n     * @_ignore:\n     */\n    constructor(log, iface, fragment) {\n        super(log, log.provider);\n        const args = iface.decodeEventLog(fragment, log.data, log.topics);\n        defineProperties(this, { args, fragment, interface: iface });\n    }\n    /**\n     *  The name of the event.\n     */\n    get eventName() { return this.fragment.name; }\n    /**\n     *  The signature of the event.\n     */\n    get eventSignature() { return this.fragment.format(); }\n}\n/**\n *  An **EventLog** contains additional properties parsed from the [[Log]].\n */\nexport class UndecodedEventLog extends Log {\n    /**\n     *  The error encounted when trying to decode the log.\n     */\n    error;\n    /**\n     * @_ignore:\n     */\n    constructor(log, error) {\n        super(log, log.provider);\n        defineProperties(this, { error });\n    }\n}\n/**\n *  A **ContractTransactionReceipt** includes the parsed logs from a\n *  [[TransactionReceipt]].\n */\nexport class ContractTransactionReceipt extends TransactionReceipt {\n    #iface;\n    /**\n     *  @_ignore:\n     */\n    constructor(iface, provider, tx) {\n        super(tx, provider);\n        this.#iface = iface;\n    }\n    /**\n     *  The parsed logs for any [[Log]] which has a matching event in the\n     *  Contract ABI.\n     */\n    get logs() {\n        return super.logs.map((log) => {\n            const fragment = log.topics.length ? this.#iface.getEvent(log.topics[0]) : null;\n            if (fragment) {\n                try {\n                    return new EventLog(log, this.#iface, fragment);\n                }\n                catch (error) {\n                    return new UndecodedEventLog(log, error);\n                }\n            }\n            return log;\n        });\n    }\n}\n/**\n *  A **ContractTransactionResponse** will return a\n *  [[ContractTransactionReceipt]] when waited on.\n */\nexport class ContractTransactionResponse extends TransactionResponse {\n    #iface;\n    /**\n     *  @_ignore:\n     */\n    constructor(iface, provider, tx) {\n        super(tx, provider);\n        this.#iface = iface;\n    }\n    /**\n     *  Resolves once this transaction has been mined and has\n     *  %%confirms%% blocks including it (default: ``1``) with an\n     *  optional %%timeout%%.\n     *\n     *  This can resolve to ``null`` only if %%confirms%% is ``0``\n     *  and the transaction has not been mined, otherwise this will\n     *  wait until enough confirmations have completed.\n     */\n    async wait(confirms, timeout) {\n        const receipt = await super.wait(confirms, timeout);\n        if (receipt == null) {\n            return null;\n        }\n        return new ContractTransactionReceipt(this.#iface, this.provider, receipt);\n    }\n}\n/**\n *  A **ContractUnknownEventPayload** is included as the last parameter to\n *  Contract Events when the event does not match any events in the ABI.\n */\nexport class ContractUnknownEventPayload extends EventPayload {\n    /**\n     *  The log with no matching events.\n     */\n    log;\n    /**\n     *  @_event:\n     */\n    constructor(contract, listener, filter, log) {\n        super(contract, listener, filter);\n        defineProperties(this, { log });\n    }\n    /**\n     *  Resolves to the block the event occured in.\n     */\n    async getBlock() {\n        return await this.log.getBlock();\n    }\n    /**\n     *  Resolves to the transaction the event occured in.\n     */\n    async getTransaction() {\n        return await this.log.getTransaction();\n    }\n    /**\n     *  Resolves to the transaction receipt the event occured in.\n     */\n    async getTransactionReceipt() {\n        return await this.log.getTransactionReceipt();\n    }\n}\n/**\n *  A **ContractEventPayload** is included as the last parameter to\n *  Contract Events when the event is known.\n */\nexport class ContractEventPayload extends ContractUnknownEventPayload {\n    /**\n     *  @_ignore:\n     */\n    constructor(contract, listener, filter, fragment, _log) {\n        super(contract, listener, filter, new EventLog(_log, contract.interface, fragment));\n        const args = contract.interface.decodeEventLog(fragment, this.log.data, this.log.topics);\n        defineProperties(this, { args, fragment });\n    }\n    /**\n     *  The event name.\n     */\n    get eventName() {\n        return this.fragment.name;\n    }\n    /**\n     *  The event signature.\n     */\n    get eventSignature() {\n        return this.fragment.format();\n    }\n}\n//# sourceMappingURL=wrappers.js.map","import { Interface, Typed } from \"../abi/index.js\";\nimport { isAddressable, resolveAddress } from \"../address/index.js\";\n// import from provider.ts instead of index.ts to prevent circular dep\n// from EtherscanProvider\nimport { copyRequest, Log } from \"../providers/provider.js\";\nimport { defineProperties, getBigInt, isCallException, isHexString, resolveProperties, isError, makeError, assert, assertArgument } from \"../utils/index.js\";\nimport { ContractEventPayload, ContractUnknownEventPayload, ContractTransactionResponse, EventLog, UndecodedEventLog } from \"./wrappers.js\";\nconst BN_0 = BigInt(0);\nfunction canCall(value) {\n    return (value && typeof (value.call) === \"function\");\n}\nfunction canEstimate(value) {\n    return (value && typeof (value.estimateGas) === \"function\");\n}\nfunction canResolve(value) {\n    return (value && typeof (value.resolveName) === \"function\");\n}\nfunction canSend(value) {\n    return (value && typeof (value.sendTransaction) === \"function\");\n}\nfunction getResolver(value) {\n    if (value != null) {\n        if (canResolve(value)) {\n            return value;\n        }\n        if (value.provider) {\n            return value.provider;\n        }\n    }\n    return undefined;\n}\nclass PreparedTopicFilter {\n    #filter;\n    fragment;\n    constructor(contract, fragment, args) {\n        defineProperties(this, { fragment });\n        if (fragment.inputs.length < args.length) {\n            throw new Error(\"too many arguments\");\n        }\n        // Recursively descend into args and resolve any addresses\n        const runner = getRunner(contract.runner, \"resolveName\");\n        const resolver = canResolve(runner) ? runner : null;\n        this.#filter = (async function () {\n            const resolvedArgs = await Promise.all(fragment.inputs.map((param, index) => {\n                const arg = args[index];\n                if (arg == null) {\n                    return null;\n                }\n                return param.walkAsync(args[index], (type, value) => {\n                    if (type === \"address\") {\n                        if (Array.isArray(value)) {\n                            return Promise.all(value.map((v) => resolveAddress(v, resolver)));\n                        }\n                        return resolveAddress(value, resolver);\n                    }\n                    return value;\n                });\n            }));\n            return contract.interface.encodeFilterTopics(fragment, resolvedArgs);\n        })();\n    }\n    getTopicFilter() {\n        return this.#filter;\n    }\n}\n// A = Arguments passed in as a tuple\n// R = The result type of the call (i.e. if only one return type,\n//     the qualified type, otherwise Result)\n// D = The type the default call will return (i.e. R for view/pure,\n//     TransactionResponse otherwise)\n//export interface ContractMethod<A extends Array<any> = Array<any>, R = any, D extends R | ContractTransactionResponse = ContractTransactionResponse> {\nfunction getRunner(value, feature) {\n    if (value == null) {\n        return null;\n    }\n    if (typeof (value[feature]) === \"function\") {\n        return value;\n    }\n    if (value.provider && typeof (value.provider[feature]) === \"function\") {\n        return value.provider;\n    }\n    return null;\n}\nfunction getProvider(value) {\n    if (value == null) {\n        return null;\n    }\n    return value.provider || null;\n}\n/**\n *  @_ignore:\n */\nexport async function copyOverrides(arg, allowed) {\n    // Make sure the overrides passed in are a valid overrides object\n    const _overrides = Typed.dereference(arg, \"overrides\");\n    assertArgument(typeof (_overrides) === \"object\", \"invalid overrides parameter\", \"overrides\", arg);\n    // Create a shallow copy (we'll deep-ify anything needed during normalizing)\n    const overrides = copyRequest(_overrides);\n    assertArgument(overrides.to == null || (allowed || []).indexOf(\"to\") >= 0, \"cannot override to\", \"overrides.to\", overrides.to);\n    assertArgument(overrides.data == null || (allowed || []).indexOf(\"data\") >= 0, \"cannot override data\", \"overrides.data\", overrides.data);\n    // Resolve any from\n    if (overrides.from) {\n        overrides.from = overrides.from;\n    }\n    return overrides;\n}\n/**\n *  @_ignore:\n */\nexport async function resolveArgs(_runner, inputs, args) {\n    // Recursively descend into args and resolve any addresses\n    const runner = getRunner(_runner, \"resolveName\");\n    const resolver = canResolve(runner) ? runner : null;\n    return await Promise.all(inputs.map((param, index) => {\n        return param.walkAsync(args[index], (type, value) => {\n            value = Typed.dereference(value, type);\n            if (type === \"address\") {\n                return resolveAddress(value, resolver);\n            }\n            return value;\n        });\n    }));\n}\nfunction buildWrappedFallback(contract) {\n    const populateTransaction = async function (overrides) {\n        // If an overrides was passed in, copy it and normalize the values\n        const tx = (await copyOverrides(overrides, [\"data\"]));\n        tx.to = await contract.getAddress();\n        if (tx.from) {\n            tx.from = await resolveAddress(tx.from, getResolver(contract.runner));\n        }\n        const iface = contract.interface;\n        const noValue = (getBigInt((tx.value || BN_0), \"overrides.value\") === BN_0);\n        const noData = ((tx.data || \"0x\") === \"0x\");\n        if (iface.fallback && !iface.fallback.payable && iface.receive && !noData && !noValue) {\n            assertArgument(false, \"cannot send data to receive or send value to non-payable fallback\", \"overrides\", overrides);\n        }\n        assertArgument(iface.fallback || noData, \"cannot send data to receive-only contract\", \"overrides.data\", tx.data);\n        // Only allow payable contracts to set non-zero value\n        const payable = iface.receive || (iface.fallback && iface.fallback.payable);\n        assertArgument(payable || noValue, \"cannot send value to non-payable fallback\", \"overrides.value\", tx.value);\n        // Only allow fallback contracts to set non-empty data\n        assertArgument(iface.fallback || noData, \"cannot send data to receive-only contract\", \"overrides.data\", tx.data);\n        return tx;\n    };\n    const staticCall = async function (overrides) {\n        const runner = getRunner(contract.runner, \"call\");\n        assert(canCall(runner), \"contract runner does not support calling\", \"UNSUPPORTED_OPERATION\", { operation: \"call\" });\n        const tx = await populateTransaction(overrides);\n        try {\n            return await runner.call(tx);\n        }\n        catch (error) {\n            if (isCallException(error) && error.data) {\n                throw contract.interface.makeError(error.data, tx);\n            }\n            throw error;\n        }\n    };\n    const send = async function (overrides) {\n        const runner = contract.runner;\n        assert(canSend(runner), \"contract runner does not support sending transactions\", \"UNSUPPORTED_OPERATION\", { operation: \"sendTransaction\" });\n        const tx = await runner.sendTransaction(await populateTransaction(overrides));\n        const provider = getProvider(contract.runner);\n        // @TODO: the provider can be null; make a custom dummy provider that will throw a\n        // meaningful error\n        return new ContractTransactionResponse(contract.interface, provider, tx);\n    };\n    const estimateGas = async function (overrides) {\n        const runner = getRunner(contract.runner, \"estimateGas\");\n        assert(canEstimate(runner), \"contract runner does not support gas estimation\", \"UNSUPPORTED_OPERATION\", { operation: \"estimateGas\" });\n        return await runner.estimateGas(await populateTransaction(overrides));\n    };\n    const method = async (overrides) => {\n        return await send(overrides);\n    };\n    defineProperties(method, {\n        _contract: contract,\n        estimateGas,\n        populateTransaction,\n        send, staticCall\n    });\n    return method;\n}\nfunction buildWrappedMethod(contract, key) {\n    const getFragment = function (...args) {\n        const fragment = contract.interface.getFunction(key, args);\n        assert(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fragment\",\n            info: { key, args }\n        });\n        return fragment;\n    };\n    const populateTransaction = async function (...args) {\n        const fragment = getFragment(...args);\n        // If an overrides was passed in, copy it and normalize the values\n        let overrides = {};\n        if (fragment.inputs.length + 1 === args.length) {\n            overrides = await copyOverrides(args.pop());\n            if (overrides.from) {\n                overrides.from = await resolveAddress(overrides.from, getResolver(contract.runner));\n            }\n        }\n        if (fragment.inputs.length !== args.length) {\n            throw new Error(\"internal error: fragment inputs doesn't match arguments; should not happen\");\n        }\n        const resolvedArgs = await resolveArgs(contract.runner, fragment.inputs, args);\n        return Object.assign({}, overrides, await resolveProperties({\n            to: contract.getAddress(),\n            data: contract.interface.encodeFunctionData(fragment, resolvedArgs)\n        }));\n    };\n    const staticCall = async function (...args) {\n        const result = await staticCallResult(...args);\n        if (result.length === 1) {\n            return result[0];\n        }\n        return result;\n    };\n    const send = async function (...args) {\n        const runner = contract.runner;\n        assert(canSend(runner), \"contract runner does not support sending transactions\", \"UNSUPPORTED_OPERATION\", { operation: \"sendTransaction\" });\n        const tx = await runner.sendTransaction(await populateTransaction(...args));\n        const provider = getProvider(contract.runner);\n        // @TODO: the provider can be null; make a custom dummy provider that will throw a\n        // meaningful error\n        return new ContractTransactionResponse(contract.interface, provider, tx);\n    };\n    const estimateGas = async function (...args) {\n        const runner = getRunner(contract.runner, \"estimateGas\");\n        assert(canEstimate(runner), \"contract runner does not support gas estimation\", \"UNSUPPORTED_OPERATION\", { operation: \"estimateGas\" });\n        return await runner.estimateGas(await populateTransaction(...args));\n    };\n    const staticCallResult = async function (...args) {\n        const runner = getRunner(contract.runner, \"call\");\n        assert(canCall(runner), \"contract runner does not support calling\", \"UNSUPPORTED_OPERATION\", { operation: \"call\" });\n        const tx = await populateTransaction(...args);\n        let result = \"0x\";\n        try {\n            result = await runner.call(tx);\n        }\n        catch (error) {\n            if (isCallException(error) && error.data) {\n                throw contract.interface.makeError(error.data, tx);\n            }\n            throw error;\n        }\n        const fragment = getFragment(...args);\n        return contract.interface.decodeFunctionResult(fragment, result);\n    };\n    const method = async (...args) => {\n        const fragment = getFragment(...args);\n        if (fragment.constant) {\n            return await staticCall(...args);\n        }\n        return await send(...args);\n    };\n    defineProperties(method, {\n        name: contract.interface.getFunctionName(key),\n        _contract: contract, _key: key,\n        getFragment,\n        estimateGas,\n        populateTransaction,\n        send, staticCall, staticCallResult,\n    });\n    // Only works on non-ambiguous keys (refined fragment is always non-ambiguous)\n    Object.defineProperty(method, \"fragment\", {\n        configurable: false,\n        enumerable: true,\n        get: () => {\n            const fragment = contract.interface.getFunction(key);\n            assert(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"fragment\",\n                info: { key }\n            });\n            return fragment;\n        }\n    });\n    return method;\n}\nfunction buildWrappedEvent(contract, key) {\n    const getFragment = function (...args) {\n        const fragment = contract.interface.getEvent(key, args);\n        assert(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"fragment\",\n            info: { key, args }\n        });\n        return fragment;\n    };\n    const method = function (...args) {\n        return new PreparedTopicFilter(contract, getFragment(...args), args);\n    };\n    defineProperties(method, {\n        name: contract.interface.getEventName(key),\n        _contract: contract, _key: key,\n        getFragment\n    });\n    // Only works on non-ambiguous keys (refined fragment is always non-ambiguous)\n    Object.defineProperty(method, \"fragment\", {\n        configurable: false,\n        enumerable: true,\n        get: () => {\n            const fragment = contract.interface.getEvent(key);\n            assert(fragment, \"no matching fragment\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"fragment\",\n                info: { key }\n            });\n            return fragment;\n        }\n    });\n    return method;\n}\n// The combination of TypeScrype, Private Fields and Proxies makes\n// the world go boom; so we hide variables with some trickery keeping\n// a symbol attached to each BaseContract which its sub-class (even\n// via a Proxy) can reach and use to look up its internal values.\nconst internal = Symbol.for(\"_ethersInternal_contract\");\nconst internalValues = new WeakMap();\nfunction setInternal(contract, values) {\n    internalValues.set(contract[internal], values);\n}\nfunction getInternal(contract) {\n    return internalValues.get(contract[internal]);\n}\nfunction isDeferred(value) {\n    return (value && typeof (value) === \"object\" && (\"getTopicFilter\" in value) &&\n        (typeof (value.getTopicFilter) === \"function\") && value.fragment);\n}\nasync function getSubInfo(contract, event) {\n    let topics;\n    let fragment = null;\n    // Convert named events to topicHash and get the fragment for\n    // events which need deconstructing.\n    if (Array.isArray(event)) {\n        const topicHashify = function (name) {\n            if (isHexString(name, 32)) {\n                return name;\n            }\n            const fragment = contract.interface.getEvent(name);\n            assertArgument(fragment, \"unknown fragment\", \"name\", name);\n            return fragment.topicHash;\n        };\n        // Array of Topics and Names; e.g. `[ \"0x1234...89ab\", \"Transfer(address)\" ]`\n        topics = event.map((e) => {\n            if (e == null) {\n                return null;\n            }\n            if (Array.isArray(e)) {\n                return e.map(topicHashify);\n            }\n            return topicHashify(e);\n        });\n    }\n    else if (event === \"*\") {\n        topics = [null];\n    }\n    else if (typeof (event) === \"string\") {\n        if (isHexString(event, 32)) {\n            // Topic Hash\n            topics = [event];\n        }\n        else {\n            // Name or Signature; e.g. `\"Transfer\", `\"Transfer(address)\"`\n            fragment = contract.interface.getEvent(event);\n            assertArgument(fragment, \"unknown fragment\", \"event\", event);\n            topics = [fragment.topicHash];\n        }\n    }\n    else if (isDeferred(event)) {\n        // Deferred Topic Filter; e.g. `contract.filter.Transfer(from)`\n        topics = await event.getTopicFilter();\n    }\n    else if (\"fragment\" in event) {\n        // ContractEvent; e.g. `contract.filter.Transfer`\n        fragment = event.fragment;\n        topics = [fragment.topicHash];\n    }\n    else {\n        assertArgument(false, \"unknown event name\", \"event\", event);\n    }\n    // Normalize topics and sort TopicSets\n    topics = topics.map((t) => {\n        if (t == null) {\n            return null;\n        }\n        if (Array.isArray(t)) {\n            const items = Array.from(new Set(t.map((t) => t.toLowerCase())).values());\n            if (items.length === 1) {\n                return items[0];\n            }\n            items.sort();\n            return items;\n        }\n        return t.toLowerCase();\n    });\n    const tag = topics.map((t) => {\n        if (t == null) {\n            return \"null\";\n        }\n        if (Array.isArray(t)) {\n            return t.join(\"|\");\n        }\n        return t;\n    }).join(\"&\");\n    return { fragment, tag, topics };\n}\nasync function hasSub(contract, event) {\n    const { subs } = getInternal(contract);\n    return subs.get((await getSubInfo(contract, event)).tag) || null;\n}\nasync function getSub(contract, operation, event) {\n    // Make sure our runner can actually subscribe to events\n    const provider = getProvider(contract.runner);\n    assert(provider, \"contract runner does not support subscribing\", \"UNSUPPORTED_OPERATION\", { operation });\n    const { fragment, tag, topics } = await getSubInfo(contract, event);\n    const { addr, subs } = getInternal(contract);\n    let sub = subs.get(tag);\n    if (!sub) {\n        const address = (addr ? addr : contract);\n        const filter = { address, topics };\n        const listener = (log) => {\n            let foundFragment = fragment;\n            if (foundFragment == null) {\n                try {\n                    foundFragment = contract.interface.getEvent(log.topics[0]);\n                }\n                catch (error) { }\n            }\n            // If fragment is null, we do not deconstruct the args to emit\n            if (foundFragment) {\n                const _foundFragment = foundFragment;\n                const args = fragment ? contract.interface.decodeEventLog(fragment, log.data, log.topics) : [];\n                emit(contract, event, args, (listener) => {\n                    return new ContractEventPayload(contract, listener, event, _foundFragment, log);\n                });\n            }\n            else {\n                emit(contract, event, [], (listener) => {\n                    return new ContractUnknownEventPayload(contract, listener, event, log);\n                });\n            }\n        };\n        let starting = [];\n        const start = () => {\n            if (starting.length) {\n                return;\n            }\n            starting.push(provider.on(filter, listener));\n        };\n        const stop = async () => {\n            if (starting.length == 0) {\n                return;\n            }\n            let started = starting;\n            starting = [];\n            await Promise.all(started);\n            provider.off(filter, listener);\n        };\n        sub = { tag, listeners: [], start, stop };\n        subs.set(tag, sub);\n    }\n    return sub;\n}\n// We use this to ensure one emit resolves before firing the next to\n// ensure correct ordering (note this cannot throw and just adds the\n// notice to the event queu using setTimeout).\nlet lastEmit = Promise.resolve();\nasync function _emit(contract, event, args, payloadFunc) {\n    await lastEmit;\n    const sub = await hasSub(contract, event);\n    if (!sub) {\n        return false;\n    }\n    const count = sub.listeners.length;\n    sub.listeners = sub.listeners.filter(({ listener, once }) => {\n        const passArgs = Array.from(args);\n        if (payloadFunc) {\n            passArgs.push(payloadFunc(once ? null : listener));\n        }\n        try {\n            listener.call(contract, ...passArgs);\n        }\n        catch (error) { }\n        return !once;\n    });\n    if (sub.listeners.length === 0) {\n        sub.stop();\n        getInternal(contract).subs.delete(sub.tag);\n    }\n    return (count > 0);\n}\nasync function emit(contract, event, args, payloadFunc) {\n    try {\n        await lastEmit;\n    }\n    catch (error) { }\n    const resultPromise = _emit(contract, event, args, payloadFunc);\n    lastEmit = resultPromise;\n    return await resultPromise;\n}\nconst passProperties = [\"then\"];\nexport class BaseContract {\n    /**\n     *  The target to connect to.\n     *\n     *  This can be an address, ENS name or any [[Addressable]], such as\n     *  another contract. To get the resovled address, use the ``getAddress``\n     *  method.\n     */\n    target;\n    /**\n     *  The contract Interface.\n     */\n    interface;\n    /**\n     *  The connected runner. This is generally a [[Provider]] or a\n     *  [[Signer]], which dictates what operations are supported.\n     *\n     *  For example, a **Contract** connected to a [[Provider]] may\n     *  only execute read-only operations.\n     */\n    runner;\n    /**\n     *  All the Events available on this contract.\n     */\n    filters;\n    /**\n     *  @_ignore:\n     */\n    [internal];\n    /**\n     *  The fallback or receive function if any.\n     */\n    fallback;\n    /**\n     *  Creates a new contract connected to %%target%% with the %%abi%% and\n     *  optionally connected to a %%runner%% to perform operations on behalf\n     *  of.\n     */\n    constructor(target, abi, runner, _deployTx) {\n        assertArgument(typeof (target) === \"string\" || isAddressable(target), \"invalid value for Contract target\", \"target\", target);\n        if (runner == null) {\n            runner = null;\n        }\n        const iface = Interface.from(abi);\n        defineProperties(this, { target, runner, interface: iface });\n        Object.defineProperty(this, internal, { value: {} });\n        let addrPromise;\n        let addr = null;\n        let deployTx = null;\n        if (_deployTx) {\n            const provider = getProvider(runner);\n            // @TODO: the provider can be null; make a custom dummy provider that will throw a\n            // meaningful error\n            deployTx = new ContractTransactionResponse(this.interface, provider, _deployTx);\n        }\n        let subs = new Map();\n        // Resolve the target as the address\n        if (typeof (target) === \"string\") {\n            if (isHexString(target)) {\n                addr = target;\n                addrPromise = Promise.resolve(target);\n            }\n            else {\n                const resolver = getRunner(runner, \"resolveName\");\n                if (!canResolve(resolver)) {\n                    throw makeError(\"contract runner does not support name resolution\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"resolveName\"\n                    });\n                }\n                addrPromise = resolver.resolveName(target).then((addr) => {\n                    if (addr == null) {\n                        throw makeError(\"an ENS name used for a contract target must be correctly configured\", \"UNCONFIGURED_NAME\", {\n                            value: target\n                        });\n                    }\n                    getInternal(this).addr = addr;\n                    return addr;\n                });\n            }\n        }\n        else {\n            addrPromise = target.getAddress().then((addr) => {\n                if (addr == null) {\n                    throw new Error(\"TODO\");\n                }\n                getInternal(this).addr = addr;\n                return addr;\n            });\n        }\n        // Set our private values\n        setInternal(this, { addrPromise, addr, deployTx, subs });\n        // Add the event filters\n        const filters = new Proxy({}, {\n            get: (target, prop, receiver) => {\n                // Pass important checks (like `then` for Promise) through\n                if (typeof (prop) === \"symbol\" || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.get(target, prop, receiver);\n                }\n                try {\n                    return this.getEvent(prop);\n                }\n                catch (error) {\n                    if (!isError(error, \"INVALID_ARGUMENT\") || error.argument !== \"key\") {\n                        throw error;\n                    }\n                }\n                return undefined;\n            },\n            has: (target, prop) => {\n                // Pass important checks (like `then` for Promise) through\n                if (passProperties.indexOf(prop) >= 0) {\n                    return Reflect.has(target, prop);\n                }\n                return Reflect.has(target, prop) || this.interface.hasEvent(String(prop));\n            }\n        });\n        defineProperties(this, { filters });\n        defineProperties(this, {\n            fallback: ((iface.receive || iface.fallback) ? (buildWrappedFallback(this)) : null)\n        });\n        // Return a Proxy that will respond to functions\n        return new Proxy(this, {\n            get: (target, prop, receiver) => {\n                if (typeof (prop) === \"symbol\" || prop in target || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.get(target, prop, receiver);\n                }\n                // Undefined properties should return undefined\n                try {\n                    return target.getFunction(prop);\n                }\n                catch (error) {\n                    if (!isError(error, \"INVALID_ARGUMENT\") || error.argument !== \"key\") {\n                        throw error;\n                    }\n                }\n                return undefined;\n            },\n            has: (target, prop) => {\n                if (typeof (prop) === \"symbol\" || prop in target || passProperties.indexOf(prop) >= 0) {\n                    return Reflect.has(target, prop);\n                }\n                return target.interface.hasFunction(prop);\n            }\n        });\n    }\n    /**\n     *  Return a new Contract instance with the same target and ABI, but\n     *  a different %%runner%%.\n     */\n    connect(runner) {\n        return new BaseContract(this.target, this.interface, runner);\n    }\n    /**\n     *  Return a new Contract instance with the same ABI and runner, but\n     *  a different %%target%%.\n     */\n    attach(target) {\n        return new BaseContract(target, this.interface, this.runner);\n    }\n    /**\n     *  Return the resolved address of this Contract.\n     */\n    async getAddress() { return await getInternal(this).addrPromise; }\n    /**\n     *  Return the deployed bytecode or null if no bytecode is found.\n     */\n    async getDeployedCode() {\n        const provider = getProvider(this.runner);\n        assert(provider, \"runner does not support .provider\", \"UNSUPPORTED_OPERATION\", { operation: \"getDeployedCode\" });\n        const code = await provider.getCode(await this.getAddress());\n        if (code === \"0x\") {\n            return null;\n        }\n        return code;\n    }\n    /**\n     *  Resolve to this Contract once the bytecode has been deployed, or\n     *  resolve immediately if already deployed.\n     */\n    async waitForDeployment() {\n        // We have the deployement transaction; just use that (throws if deployement fails)\n        const deployTx = this.deploymentTransaction();\n        if (deployTx) {\n            await deployTx.wait();\n            return this;\n        }\n        // Check for code\n        const code = await this.getDeployedCode();\n        if (code != null) {\n            return this;\n        }\n        // Make sure we can subscribe to a provider event\n        const provider = getProvider(this.runner);\n        assert(provider != null, \"contract runner does not support .provider\", \"UNSUPPORTED_OPERATION\", { operation: \"waitForDeployment\" });\n        return new Promise((resolve, reject) => {\n            const checkCode = async () => {\n                try {\n                    const code = await this.getDeployedCode();\n                    if (code != null) {\n                        return resolve(this);\n                    }\n                    provider.once(\"block\", checkCode);\n                }\n                catch (error) {\n                    reject(error);\n                }\n            };\n            checkCode();\n        });\n    }\n    /**\n     *  Return the transaction used to deploy this contract.\n     *\n     *  This is only available if this instance was returned from a\n     *  [[ContractFactory]].\n     */\n    deploymentTransaction() {\n        return getInternal(this).deployTx;\n    }\n    /**\n     *  Return the function for a given name. This is useful when a contract\n     *  method name conflicts with a JavaScript name such as ``prototype`` or\n     *  when using a Contract programatically.\n     */\n    getFunction(key) {\n        if (typeof (key) !== \"string\") {\n            key = key.format();\n        }\n        const func = buildWrappedMethod(this, key);\n        return func;\n    }\n    /**\n     *  Return the event for a given name. This is useful when a contract\n     *  event name conflicts with a JavaScript name such as ``prototype`` or\n     *  when using a Contract programatically.\n     */\n    getEvent(key) {\n        if (typeof (key) !== \"string\") {\n            key = key.format();\n        }\n        return buildWrappedEvent(this, key);\n    }\n    /**\n     *  @_ignore:\n     */\n    async queryTransaction(hash) {\n        throw new Error(\"@TODO\");\n    }\n    /*\n    // @TODO: this is a non-backwards compatible change, but will be added\n    //        in v7 and in a potential SmartContract class in an upcoming\n    //        v6 release\n    async getTransactionReceipt(hash: string): Promise<null | ContractTransactionReceipt> {\n        const provider = getProvider(this.runner);\n        assert(provider, \"contract runner does not have a provider\",\n            \"UNSUPPORTED_OPERATION\", { operation: \"queryTransaction\" });\n\n        const receipt = await provider.getTransactionReceipt(hash);\n        if (receipt == null) { return null; }\n\n        return new ContractTransactionReceipt(this.interface, provider, receipt);\n    }\n    */\n    /**\n     *  Provide historic access to event data for %%event%% in the range\n     *  %%fromBlock%% (default: ``0``) to %%toBlock%% (default: ``\"latest\"``)\n     *  inclusive.\n     */\n    async queryFilter(event, fromBlock, toBlock) {\n        if (fromBlock == null) {\n            fromBlock = 0;\n        }\n        if (toBlock == null) {\n            toBlock = \"latest\";\n        }\n        const { addr, addrPromise } = getInternal(this);\n        const address = (addr ? addr : (await addrPromise));\n        const { fragment, topics } = await getSubInfo(this, event);\n        const filter = { address, topics, fromBlock, toBlock };\n        const provider = getProvider(this.runner);\n        assert(provider, \"contract runner does not have a provider\", \"UNSUPPORTED_OPERATION\", { operation: \"queryFilter\" });\n        return (await provider.getLogs(filter)).map((log) => {\n            let foundFragment = fragment;\n            if (foundFragment == null) {\n                try {\n                    foundFragment = this.interface.getEvent(log.topics[0]);\n                }\n                catch (error) { }\n            }\n            if (foundFragment) {\n                try {\n                    return new EventLog(log, this.interface, foundFragment);\n                }\n                catch (error) {\n                    return new UndecodedEventLog(log, error);\n                }\n            }\n            return new Log(log, provider);\n        });\n    }\n    /**\n     *  Add an event %%listener%% for the %%event%%.\n     */\n    async on(event, listener) {\n        const sub = await getSub(this, \"on\", event);\n        sub.listeners.push({ listener, once: false });\n        sub.start();\n        return this;\n    }\n    /**\n     *  Add an event %%listener%% for the %%event%%, but remove the listener\n     *  after it is fired once.\n     */\n    async once(event, listener) {\n        const sub = await getSub(this, \"once\", event);\n        sub.listeners.push({ listener, once: true });\n        sub.start();\n        return this;\n    }\n    /**\n     *  Emit an %%event%% calling all listeners with %%args%%.\n     *\n     *  Resolves to ``true`` if any listeners were called.\n     */\n    async emit(event, ...args) {\n        return await emit(this, event, args, null);\n    }\n    /**\n     *  Resolves to the number of listeners of %%event%% or the total number\n     *  of listeners if unspecified.\n     */\n    async listenerCount(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return 0;\n            }\n            return sub.listeners.length;\n        }\n        const { subs } = getInternal(this);\n        let total = 0;\n        for (const { listeners } of subs.values()) {\n            total += listeners.length;\n        }\n        return total;\n    }\n    /**\n     *  Resolves to the listeners subscribed to %%event%% or all listeners\n     *  if unspecified.\n     */\n    async listeners(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return [];\n            }\n            return sub.listeners.map(({ listener }) => listener);\n        }\n        const { subs } = getInternal(this);\n        let result = [];\n        for (const { listeners } of subs.values()) {\n            result = result.concat(listeners.map(({ listener }) => listener));\n        }\n        return result;\n    }\n    /**\n     *  Remove the %%listener%% from the listeners for %%event%% or remove\n     *  all listeners if unspecified.\n     */\n    async off(event, listener) {\n        const sub = await hasSub(this, event);\n        if (!sub) {\n            return this;\n        }\n        if (listener) {\n            const index = sub.listeners.map(({ listener }) => listener).indexOf(listener);\n            if (index >= 0) {\n                sub.listeners.splice(index, 1);\n            }\n        }\n        if (listener == null || sub.listeners.length === 0) {\n            sub.stop();\n            getInternal(this).subs.delete(sub.tag);\n        }\n        return this;\n    }\n    /**\n     *  Remove all the listeners for %%event%% or remove all listeners if\n     *  unspecified.\n     */\n    async removeAllListeners(event) {\n        if (event) {\n            const sub = await hasSub(this, event);\n            if (!sub) {\n                return this;\n            }\n            sub.stop();\n            getInternal(this).subs.delete(sub.tag);\n        }\n        else {\n            const { subs } = getInternal(this);\n            for (const { tag, stop } of subs.values()) {\n                stop();\n                subs.delete(tag);\n            }\n        }\n        return this;\n    }\n    /**\n     *  Alias for [on].\n     */\n    async addListener(event, listener) {\n        return await this.on(event, listener);\n    }\n    /**\n     *  Alias for [off].\n     */\n    async removeListener(event, listener) {\n        return await this.off(event, listener);\n    }\n    /**\n     *  Create a new Class for the %%abi%%.\n     */\n    static buildClass(abi) {\n        class CustomContract extends BaseContract {\n            constructor(address, runner = null) {\n                super(address, abi, runner);\n            }\n        }\n        return CustomContract;\n    }\n    ;\n    /**\n     *  Create a new BaseContract with a specified Interface.\n     */\n    static from(target, abi, runner) {\n        if (runner == null) {\n            runner = null;\n        }\n        const contract = new this(target, abi, runner);\n        return contract;\n    }\n}\nfunction _ContractBase() {\n    return BaseContract;\n}\n/**\n *  A [[BaseContract]] with no type guards on its methods or events.\n */\nexport class Contract extends _ContractBase() {\n}\n//# sourceMappingURL=contract.js.map","/**\n *  ENS is a service which allows easy-to-remember names to map to\n *  network addresses.\n *\n *  @_section: api/providers/ens-resolver:ENS Resolver  [about-ens-rsolver]\n */\nimport { getAddress } from \"../address/index.js\";\nimport { ZeroAddress } from \"../constants/index.js\";\nimport { Contract } from \"../contract/index.js\";\nimport { dnsEncode, namehash } from \"../hash/index.js\";\nimport { hexlify, isHexString, toBeHex, defineProperties, encodeBase58, assert, assertArgument, isError, FetchRequest } from \"../utils/index.js\";\n// @TODO: This should use the fetch-data:ipfs gateway\n// Trim off the ipfs:// prefix and return the default gateway URL\nfunction getIpfsLink(link) {\n    if (link.match(/^ipfs:\\/\\/ipfs\\//i)) {\n        link = link.substring(12);\n    }\n    else if (link.match(/^ipfs:\\/\\//i)) {\n        link = link.substring(7);\n    }\n    else {\n        assertArgument(false, \"unsupported IPFS format\", \"link\", link);\n    }\n    return `https:/\\/gateway.ipfs.io/ipfs/${link}`;\n}\n;\n;\n/**\n *  A provider plugin super-class for processing multicoin address types.\n */\nexport class MulticoinProviderPlugin {\n    /**\n     *  The name.\n     */\n    name;\n    /**\n     *  Creates a new **MulticoinProviderPluing** for %%name%%.\n     */\n    constructor(name) {\n        defineProperties(this, { name });\n    }\n    connect(proivder) {\n        return this;\n    }\n    /**\n     *  Returns ``true`` if %%coinType%% is supported by this plugin.\n     */\n    supportsCoinType(coinType) {\n        return false;\n    }\n    /**\n     *  Resolves to the encoded %%address%% for %%coinType%%.\n     */\n    async encodeAddress(coinType, address) {\n        throw new Error(\"unsupported coin\");\n    }\n    /**\n     *  Resolves to the decoded %%data%% for %%coinType%%.\n     */\n    async decodeAddress(coinType, data) {\n        throw new Error(\"unsupported coin\");\n    }\n}\nconst BasicMulticoinPluginId = \"org.ethers.plugins.provider.BasicMulticoin\";\n/**\n *  A **BasicMulticoinProviderPlugin** provides service for common\n *  coin types, which do not require additional libraries to encode or\n *  decode.\n */\nexport class BasicMulticoinProviderPlugin extends MulticoinProviderPlugin {\n    /**\n     *  Creates a new **BasicMulticoinProviderPlugin**.\n     */\n    constructor() {\n        super(BasicMulticoinPluginId);\n    }\n}\nconst matcherIpfs = new RegExp(\"^(ipfs):/\\/(.*)$\", \"i\");\nconst matchers = [\n    new RegExp(\"^(https):/\\/(.*)$\", \"i\"),\n    new RegExp(\"^(data):(.*)$\", \"i\"),\n    matcherIpfs,\n    new RegExp(\"^eip155:[0-9]+/(erc[0-9]+):(.*)$\", \"i\"),\n];\n/**\n *  A connected object to a resolved ENS name resolver, which can be\n *  used to query additional details.\n */\nexport class EnsResolver {\n    /**\n     *  The connected provider.\n     */\n    provider;\n    /**\n     *  The address of the resolver.\n     */\n    address;\n    /**\n     *  The name this resolver was resolved against.\n     */\n    name;\n    // For EIP-2544 names, the ancestor that provided the resolver\n    #supports2544;\n    #resolver;\n    constructor(provider, address, name) {\n        defineProperties(this, { provider, address, name });\n        this.#supports2544 = null;\n        this.#resolver = new Contract(address, [\n            \"function supportsInterface(bytes4) view returns (bool)\",\n            \"function resolve(bytes, bytes) view returns (bytes)\",\n            \"function addr(bytes32) view returns (address)\",\n            \"function addr(bytes32, uint) view returns (bytes)\",\n            \"function text(bytes32, string) view returns (string)\",\n            \"function contenthash(bytes32) view returns (bytes)\",\n        ], provider);\n    }\n    /**\n     *  Resolves to true if the resolver supports wildcard resolution.\n     */\n    async supportsWildcard() {\n        if (this.#supports2544 == null) {\n            this.#supports2544 = (async () => {\n                try {\n                    return await this.#resolver.supportsInterface(\"0x9061b923\");\n                }\n                catch (error) {\n                    // Wildcard resolvers must understand supportsInterface\n                    // and return true.\n                    if (isError(error, \"CALL_EXCEPTION\")) {\n                        return false;\n                    }\n                    // Let future attempts try again...\n                    this.#supports2544 = null;\n                    throw error;\n                }\n            })();\n        }\n        return await this.#supports2544;\n    }\n    async #fetch(funcName, params) {\n        params = (params || []).slice();\n        const iface = this.#resolver.interface;\n        // The first parameters is always the nodehash\n        params.unshift(namehash(this.name));\n        let fragment = null;\n        if (await this.supportsWildcard()) {\n            fragment = iface.getFunction(funcName);\n            assert(fragment, \"missing fragment\", \"UNKNOWN_ERROR\", {\n                info: { funcName }\n            });\n            params = [\n                dnsEncode(this.name, 255),\n                iface.encodeFunctionData(fragment, params)\n            ];\n            funcName = \"resolve(bytes,bytes)\";\n        }\n        params.push({\n            enableCcipRead: true\n        });\n        try {\n            const result = await this.#resolver[funcName](...params);\n            if (fragment) {\n                return iface.decodeFunctionResult(fragment, result)[0];\n            }\n            return result;\n        }\n        catch (error) {\n            if (!isError(error, \"CALL_EXCEPTION\")) {\n                throw error;\n            }\n        }\n        return null;\n    }\n    /**\n     *  Resolves to the address for %%coinType%% or null if the\n     *  provided %%coinType%% has not been configured.\n     */\n    async getAddress(coinType) {\n        if (coinType == null) {\n            coinType = 60;\n        }\n        if (coinType === 60) {\n            try {\n                const result = await this.#fetch(\"addr(bytes32)\");\n                // No address\n                if (result == null || result === ZeroAddress) {\n                    return null;\n                }\n                return result;\n            }\n            catch (error) {\n                if (isError(error, \"CALL_EXCEPTION\")) {\n                    return null;\n                }\n                throw error;\n            }\n        }\n        // Try decoding its EVM canonical chain as an EVM chain address first\n        if (coinType >= 0 && coinType < 0x80000000) {\n            let ethCoinType = coinType + 0x80000000;\n            const data = await this.#fetch(\"addr(bytes32,uint)\", [ethCoinType]);\n            if (isHexString(data, 20)) {\n                return getAddress(data);\n            }\n        }\n        let coinPlugin = null;\n        for (const plugin of this.provider.plugins) {\n            if (!(plugin instanceof MulticoinProviderPlugin)) {\n                continue;\n            }\n            if (plugin.supportsCoinType(coinType)) {\n                coinPlugin = plugin;\n                break;\n            }\n        }\n        if (coinPlugin == null) {\n            return null;\n        }\n        // keccak256(\"addr(bytes32,uint256\")\n        const data = await this.#fetch(\"addr(bytes32,uint)\", [coinType]);\n        // No address\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        // Compute the address\n        const address = await coinPlugin.decodeAddress(coinType, data);\n        if (address != null) {\n            return address;\n        }\n        assert(false, `invalid coin data`, \"UNSUPPORTED_OPERATION\", {\n            operation: `getAddress(${coinType})`,\n            info: { coinType, data }\n        });\n    }\n    /**\n     *  Resolves to the EIP-634 text record for %%key%%, or ``null``\n     *  if unconfigured.\n     */\n    async getText(key) {\n        const data = await this.#fetch(\"text(bytes32,string)\", [key]);\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        return data;\n    }\n    /**\n     *  Rsolves to the content-hash or ``null`` if unconfigured.\n     */\n    async getContentHash() {\n        // keccak256(\"contenthash()\")\n        const data = await this.#fetch(\"contenthash(bytes32)\");\n        // No contenthash\n        if (data == null || data === \"0x\") {\n            return null;\n        }\n        // IPFS (CID: 1, Type: 70=DAG-PB, 72=libp2p-key)\n        const ipfs = data.match(/^0x(e3010170|e5010172)(([0-9a-f][0-9a-f])([0-9a-f][0-9a-f])([0-9a-f]*))$/);\n        if (ipfs) {\n            const scheme = (ipfs[1] === \"e3010170\") ? \"ipfs\" : \"ipns\";\n            const length = parseInt(ipfs[4], 16);\n            if (ipfs[5].length === length * 2) {\n                return `${scheme}:/\\/${encodeBase58(\"0x\" + ipfs[2])}`;\n            }\n        }\n        // Swarm (CID: 1, Type: swarm-manifest; hash/length hard-coded to keccak256/32)\n        const swarm = data.match(/^0xe40101fa011b20([0-9a-f]*)$/);\n        if (swarm && swarm[1].length === 64) {\n            return `bzz:/\\/${swarm[1]}`;\n        }\n        assert(false, `invalid or unsupported content hash data`, \"UNSUPPORTED_OPERATION\", {\n            operation: \"getContentHash()\",\n            info: { data }\n        });\n    }\n    /**\n     *  Resolves to the avatar url or ``null`` if the avatar is either\n     *  unconfigured or incorrectly configured (e.g. references an NFT\n     *  not owned by the address).\n     *\n     *  If diagnosing issues with configurations, the [[_getAvatar]]\n     *  method may be useful.\n     */\n    async getAvatar() {\n        const avatar = await this._getAvatar();\n        return avatar.url;\n    }\n    /**\n     *  When resolving an avatar, there are many steps involved, such\n     *  fetching metadata and possibly validating ownership of an\n     *  NFT.\n     *\n     *  This method can be used to examine each step and the value it\n     *  was working from.\n     */\n    async _getAvatar() {\n        const linkage = [{ type: \"name\", value: this.name }];\n        try {\n            // test data for ricmoo.eth\n            //const avatar = \"eip155:1/erc721:0x265385c7f4132228A0d54EB1A9e7460b91c0cC68/29233\";\n            const avatar = await this.getText(\"avatar\");\n            if (avatar == null) {\n                linkage.push({ type: \"!avatar\", value: \"\" });\n                return { url: null, linkage };\n            }\n            linkage.push({ type: \"avatar\", value: avatar });\n            for (let i = 0; i < matchers.length; i++) {\n                const match = avatar.match(matchers[i]);\n                if (match == null) {\n                    continue;\n                }\n                const scheme = match[1].toLowerCase();\n                switch (scheme) {\n                    case \"https\":\n                    case \"data\":\n                        linkage.push({ type: \"url\", value: avatar });\n                        return { linkage, url: avatar };\n                    case \"ipfs\": {\n                        const url = getIpfsLink(avatar);\n                        linkage.push({ type: \"ipfs\", value: avatar });\n                        linkage.push({ type: \"url\", value: url });\n                        return { linkage, url };\n                    }\n                    case \"erc721\":\n                    case \"erc1155\": {\n                        // Depending on the ERC type, use tokenURI(uint256) or url(uint256)\n                        const selector = (scheme === \"erc721\") ? \"tokenURI(uint256)\" : \"uri(uint256)\";\n                        linkage.push({ type: scheme, value: avatar });\n                        // The owner of this name\n                        const owner = await this.getAddress();\n                        if (owner == null) {\n                            linkage.push({ type: \"!owner\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        const comps = (match[2] || \"\").split(\"/\");\n                        if (comps.length !== 2) {\n                            linkage.push({ type: `!${scheme}caip`, value: (match[2] || \"\") });\n                            return { url: null, linkage };\n                        }\n                        const tokenId = comps[1];\n                        const contract = new Contract(comps[0], [\n                            // ERC-721\n                            \"function tokenURI(uint) view returns (string)\",\n                            \"function ownerOf(uint) view returns (address)\",\n                            // ERC-1155\n                            \"function uri(uint) view returns (string)\",\n                            \"function balanceOf(address, uint256) view returns (uint)\"\n                        ], this.provider);\n                        // Check that this account owns the token\n                        if (scheme === \"erc721\") {\n                            const tokenOwner = await contract.ownerOf(tokenId);\n                            if (owner !== tokenOwner) {\n                                linkage.push({ type: \"!owner\", value: tokenOwner });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"owner\", value: tokenOwner });\n                        }\n                        else if (scheme === \"erc1155\") {\n                            const balance = await contract.balanceOf(owner, tokenId);\n                            if (!balance) {\n                                linkage.push({ type: \"!balance\", value: \"0\" });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"balance\", value: balance.toString() });\n                        }\n                        // Call the token contract for the metadata URL\n                        let metadataUrl = await contract[selector](tokenId);\n                        if (metadataUrl == null || metadataUrl === \"0x\") {\n                            linkage.push({ type: \"!metadata-url\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        linkage.push({ type: \"metadata-url-base\", value: metadataUrl });\n                        // ERC-1155 allows a generic {id} in the URL\n                        if (scheme === \"erc1155\") {\n                            metadataUrl = metadataUrl.replace(\"{id}\", toBeHex(tokenId, 32).substring(2));\n                            linkage.push({ type: \"metadata-url-expanded\", value: metadataUrl });\n                        }\n                        // Transform IPFS metadata links\n                        if (metadataUrl.match(/^ipfs:/i)) {\n                            metadataUrl = getIpfsLink(metadataUrl);\n                        }\n                        linkage.push({ type: \"metadata-url\", value: metadataUrl });\n                        // Get the token metadata\n                        let metadata = {};\n                        const response = await (new FetchRequest(metadataUrl)).send();\n                        response.assertOk();\n                        try {\n                            metadata = response.bodyJson;\n                        }\n                        catch (error) {\n                            try {\n                                linkage.push({ type: \"!metadata\", value: response.bodyText });\n                            }\n                            catch (error) {\n                                const bytes = response.body;\n                                if (bytes) {\n                                    linkage.push({ type: \"!metadata\", value: hexlify(bytes) });\n                                }\n                                return { url: null, linkage };\n                            }\n                            return { url: null, linkage };\n                        }\n                        if (!metadata) {\n                            linkage.push({ type: \"!metadata\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        linkage.push({ type: \"metadata\", value: JSON.stringify(metadata) });\n                        // Pull the image URL out\n                        let imageUrl = metadata.image;\n                        if (typeof (imageUrl) !== \"string\") {\n                            linkage.push({ type: \"!imageUrl\", value: \"\" });\n                            return { url: null, linkage };\n                        }\n                        if (imageUrl.match(/^(https:\\/\\/|data:)/i)) {\n                            // Allow\n                        }\n                        else {\n                            // Transform IPFS link to gateway\n                            const ipfs = imageUrl.match(matcherIpfs);\n                            if (ipfs == null) {\n                                linkage.push({ type: \"!imageUrl-ipfs\", value: imageUrl });\n                                return { url: null, linkage };\n                            }\n                            linkage.push({ type: \"imageUrl-ipfs\", value: imageUrl });\n                            imageUrl = getIpfsLink(imageUrl);\n                        }\n                        linkage.push({ type: \"url\", value: imageUrl });\n                        return { linkage, url: imageUrl };\n                    }\n                }\n            }\n        }\n        catch (error) { }\n        return { linkage, url: null };\n    }\n    static async getEnsAddress(provider) {\n        const network = await provider.getNetwork();\n        const ensPlugin = network.getPlugin(\"org.ethers.plugins.network.Ens\");\n        // No ENS...\n        assert(ensPlugin, \"network does not support ENS\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"getEnsAddress\", info: { network }\n        });\n        return ensPlugin.address;\n    }\n    static async #getResolver(provider, name) {\n        const ensAddr = await EnsResolver.getEnsAddress(provider);\n        try {\n            const contract = new Contract(ensAddr, [\n                \"function resolver(bytes32) view returns (address)\"\n            ], provider);\n            const addr = await contract.resolver(namehash(name), {\n                enableCcipRead: true\n            });\n            if (addr === ZeroAddress) {\n                return null;\n            }\n            return addr;\n        }\n        catch (error) {\n            // ENS registry cannot throw errors on resolver(bytes32),\n            // so probably a link error\n            throw error;\n        }\n        return null;\n    }\n    /**\n     *  Resolve to the ENS resolver for %%name%% using %%provider%% or\n     *  ``null`` if unconfigured.\n     */\n    static async fromName(provider, name) {\n        let currentName = name;\n        while (true) {\n            if (currentName === \"\" || currentName === \".\") {\n                return null;\n            }\n            // Optimization since the eth node cannot change and does\n            // not have a wildcard resolver\n            if (name !== \"eth\" && currentName === \"eth\") {\n                return null;\n            }\n            // Check the current node for a resolver\n            const addr = await EnsResolver.#getResolver(provider, currentName);\n            // Found a resolver!\n            if (addr != null) {\n                const resolver = new EnsResolver(provider, addr, name);\n                // Legacy resolver found, using EIP-2544 so it isn't safe to use\n                if (currentName !== name && !(await resolver.supportsWildcard())) {\n                    return null;\n                }\n                return resolver;\n            }\n            // Get the parent node\n            currentName = currentName.split(\".\").slice(1).join(\".\");\n        }\n    }\n}\n//# sourceMappingURL=ens-resolver.js.map","/**\n *  @_ignore\n */\nimport { getAddress, getCreateAddress } from \"../address/index.js\";\nimport { Signature } from \"../crypto/index.js\";\nimport { accessListify } from \"../transaction/index.js\";\nimport { getBigInt, getNumber, hexlify, isHexString, zeroPadValue, assert, assertArgument } from \"../utils/index.js\";\nconst BN_0 = BigInt(0);\nexport function allowNull(format, nullValue) {\n    return (function (value) {\n        if (value == null) {\n            return nullValue;\n        }\n        return format(value);\n    });\n}\nexport function arrayOf(format, allowNull) {\n    return ((array) => {\n        if (allowNull && array == null) {\n            return null;\n        }\n        if (!Array.isArray(array)) {\n            throw new Error(\"not an array\");\n        }\n        return array.map((i) => format(i));\n    });\n}\n// Requires an object which matches a fleet of other formatters\n// Any FormatFunc may return `undefined` to have the value omitted\n// from the result object. Calls preserve `this`.\nexport function object(format, altNames) {\n    return ((value) => {\n        const result = {};\n        for (const key in format) {\n            let srcKey = key;\n            if (altNames && key in altNames && !(srcKey in value)) {\n                for (const altKey of altNames[key]) {\n                    if (altKey in value) {\n                        srcKey = altKey;\n                        break;\n                    }\n                }\n            }\n            try {\n                const nv = format[key](value[srcKey]);\n                if (nv !== undefined) {\n                    result[key] = nv;\n                }\n            }\n            catch (error) {\n                const message = (error instanceof Error) ? error.message : \"not-an-error\";\n                assert(false, `invalid value for value.${key} (${message})`, \"BAD_DATA\", { value });\n            }\n        }\n        return result;\n    });\n}\nexport function formatBoolean(value) {\n    switch (value) {\n        case true:\n        case \"true\":\n            return true;\n        case false:\n        case \"false\":\n            return false;\n    }\n    assertArgument(false, `invalid boolean; ${JSON.stringify(value)}`, \"value\", value);\n}\nexport function formatData(value) {\n    assertArgument(isHexString(value, true), \"invalid data\", \"value\", value);\n    return value;\n}\nexport function formatHash(value) {\n    assertArgument(isHexString(value, 32), \"invalid hash\", \"value\", value);\n    return value;\n}\nexport function formatUint256(value) {\n    if (!isHexString(value)) {\n        throw new Error(\"invalid uint256\");\n    }\n    return zeroPadValue(value, 32);\n}\nconst _formatLog = object({\n    address: getAddress,\n    blockHash: formatHash,\n    blockNumber: getNumber,\n    data: formatData,\n    index: getNumber,\n    removed: allowNull(formatBoolean, false),\n    topics: arrayOf(formatHash),\n    transactionHash: formatHash,\n    transactionIndex: getNumber,\n}, {\n    index: [\"logIndex\"]\n});\nexport function formatLog(value) {\n    return _formatLog(value);\n}\nconst _formatBlock = object({\n    hash: allowNull(formatHash),\n    parentHash: formatHash,\n    parentBeaconBlockRoot: allowNull(formatHash, null),\n    number: getNumber,\n    timestamp: getNumber,\n    nonce: allowNull(formatData),\n    difficulty: getBigInt,\n    gasLimit: getBigInt,\n    gasUsed: getBigInt,\n    stateRoot: allowNull(formatHash, null),\n    receiptsRoot: allowNull(formatHash, null),\n    blobGasUsed: allowNull(getBigInt, null),\n    excessBlobGas: allowNull(getBigInt, null),\n    miner: allowNull(getAddress),\n    prevRandao: allowNull(formatHash, null),\n    extraData: formatData,\n    baseFeePerGas: allowNull(getBigInt)\n}, {\n    prevRandao: [\"mixHash\"]\n});\nexport function formatBlock(value) {\n    const result = _formatBlock(value);\n    result.transactions = value.transactions.map((tx) => {\n        if (typeof (tx) === \"string\") {\n            return tx;\n        }\n        return formatTransactionResponse(tx);\n    });\n    return result;\n}\nconst _formatReceiptLog = object({\n    transactionIndex: getNumber,\n    blockNumber: getNumber,\n    transactionHash: formatHash,\n    address: getAddress,\n    topics: arrayOf(formatHash),\n    data: formatData,\n    index: getNumber,\n    blockHash: formatHash,\n}, {\n    index: [\"logIndex\"]\n});\nexport function formatReceiptLog(value) {\n    return _formatReceiptLog(value);\n}\nconst _formatTransactionReceipt = object({\n    to: allowNull(getAddress, null),\n    from: allowNull(getAddress, null),\n    contractAddress: allowNull(getAddress, null),\n    // should be allowNull(hash), but broken-EIP-658 support is handled in receipt\n    index: getNumber,\n    root: allowNull(hexlify),\n    gasUsed: getBigInt,\n    blobGasUsed: allowNull(getBigInt, null),\n    logsBloom: allowNull(formatData),\n    blockHash: formatHash,\n    hash: formatHash,\n    logs: arrayOf(formatReceiptLog),\n    blockNumber: getNumber,\n    //confirmations: allowNull(getNumber, null),\n    cumulativeGasUsed: getBigInt,\n    effectiveGasPrice: allowNull(getBigInt),\n    blobGasPrice: allowNull(getBigInt, null),\n    status: allowNull(getNumber),\n    type: allowNull(getNumber, 0)\n}, {\n    effectiveGasPrice: [\"gasPrice\"],\n    hash: [\"transactionHash\"],\n    index: [\"transactionIndex\"],\n});\nexport function formatTransactionReceipt(value) {\n    return _formatTransactionReceipt(value);\n}\nexport function formatTransactionResponse(value) {\n    // Some clients (TestRPC) do strange things like return 0x0 for the\n    // 0 address; correct this to be a real address\n    if (value.to && getBigInt(value.to) === BN_0) {\n        value.to = \"0x0000000000000000000000000000000000000000\";\n    }\n    const result = object({\n        hash: formatHash,\n        // Some nodes do not return this, usually test nodes (like Ganache)\n        index: allowNull(getNumber, undefined),\n        type: (value) => {\n            if (value === \"0x\" || value == null) {\n                return 0;\n            }\n            return getNumber(value);\n        },\n        accessList: allowNull(accessListify, null),\n        blobVersionedHashes: allowNull(arrayOf(formatHash, true), null),\n        blockHash: allowNull(formatHash, null),\n        blockNumber: allowNull(getNumber, null),\n        transactionIndex: allowNull(getNumber, null),\n        from: getAddress,\n        // either (gasPrice) or (maxPriorityFeePerGas + maxFeePerGas) must be set\n        gasPrice: allowNull(getBigInt),\n        maxPriorityFeePerGas: allowNull(getBigInt),\n        maxFeePerGas: allowNull(getBigInt),\n        maxFeePerBlobGas: allowNull(getBigInt, null),\n        gasLimit: getBigInt,\n        to: allowNull(getAddress, null),\n        value: getBigInt,\n        nonce: getNumber,\n        data: formatData,\n        creates: allowNull(getAddress, null),\n        chainId: allowNull(getBigInt, null)\n    }, {\n        data: [\"input\"],\n        gasLimit: [\"gas\"],\n        index: [\"transactionIndex\"]\n    })(value);\n    // If to and creates are empty, populate the creates from the value\n    if (result.to == null && result.creates == null) {\n        result.creates = getCreateAddress(result);\n    }\n    // @TODO: Check fee data\n    // Add an access list to supported transaction types\n    if ((value.type === 1 || value.type === 2) && value.accessList == null) {\n        result.accessList = [];\n    }\n    // Compute the signature\n    if (value.signature) {\n        result.signature = Signature.from(value.signature);\n    }\n    else {\n        result.signature = Signature.from(value);\n    }\n    // Some backends omit ChainId on legacy transactions, but we can compute it\n    if (result.chainId == null) {\n        const chainId = result.signature.legacyChainId;\n        if (chainId != null) {\n            result.chainId = chainId;\n        }\n    }\n    // @TODO: check chainID\n    /*\n    if (value.chainId != null) {\n        let chainId = value.chainId;\n\n        if (isHexString(chainId)) {\n            chainId = BigNumber.from(chainId).toNumber();\n        }\n\n        result.chainId = chainId;\n\n    } else {\n        let chainId = value.networkId;\n\n        // geth-etc returns chainId\n        if (chainId == null && result.v == null) {\n            chainId = value.chainId;\n        }\n\n        if (isHexString(chainId)) {\n            chainId = BigNumber.from(chainId).toNumber();\n        }\n\n        if (typeof(chainId) !== \"number\" && result.v != null) {\n            chainId = (result.v - 35) / 2;\n            if (chainId < 0) { chainId = 0; }\n            chainId = parseInt(chainId);\n        }\n\n        if (typeof(chainId) !== \"number\") { chainId = 0; }\n\n        result.chainId = chainId;\n    }\n    */\n    // 0x0000... should actually be null\n    if (result.blockHash && getBigInt(result.blockHash) === BN_0) {\n        result.blockHash = null;\n    }\n    return result;\n}\n//# sourceMappingURL=format.js.map","import { keccak256 } from \"../crypto/index.js\";\nimport { concat, dataSlice, getBigInt, getBytes, encodeRlp, assertArgument } from \"../utils/index.js\";\nimport { getAddress } from \"./address.js\";\n// http://ethereum.stackexchange.com/questions/760/how-is-the-address-of-an-ethereum-contract-computed\n/**\n *  Returns the address that would result from a ``CREATE`` for %%tx%%.\n *\n *  This can be used to compute the address a contract will be\n *  deployed to by an EOA when sending a deployment transaction (i.e.\n *  when the ``to`` address is ``null``).\n *\n *  This can also be used to compute the address a contract will be\n *  deployed to by a contract, by using the contract's address as the\n *  ``to`` and the contract's nonce.\n *\n *  @example\n *    from = \"0x8ba1f109551bD432803012645Ac136ddd64DBA72\";\n *    nonce = 5;\n *\n *    getCreateAddress({ from, nonce });\n *    //_result:\n */\nexport function getCreateAddress(tx) {\n    const from = getAddress(tx.from);\n    const nonce = getBigInt(tx.nonce, \"tx.nonce\");\n    let nonceHex = nonce.toString(16);\n    if (nonceHex === \"0\") {\n        nonceHex = \"0x\";\n    }\n    else if (nonceHex.length % 2) {\n        nonceHex = \"0x0\" + nonceHex;\n    }\n    else {\n        nonceHex = \"0x\" + nonceHex;\n    }\n    return getAddress(dataSlice(keccak256(encodeRlp([from, nonceHex])), 12));\n}\n/**\n *  Returns the address that would result from a ``CREATE2`` operation\n *  with the given %%from%%, %%salt%% and %%initCodeHash%%.\n *\n *  To compute the %%initCodeHash%% from a contract's init code, use\n *  the [[keccak256]] function.\n *\n *  For a quick overview and example of ``CREATE2``, see [[link-ricmoo-wisps]].\n *\n *  @example\n *    // The address of the contract\n *    from = \"0x8ba1f109551bD432803012645Ac136ddd64DBA72\"\n *\n *    // The salt\n *    salt = id(\"HelloWorld\")\n *\n *    // The hash of the initCode\n *    initCode = \"0x6394198df16000526103ff60206004601c335afa6040516060f3\";\n *    initCodeHash = keccak256(initCode)\n *\n *    getCreate2Address(from, salt, initCodeHash)\n *    //_result:\n */\nexport function getCreate2Address(_from, _salt, _initCodeHash) {\n    const from = getAddress(_from);\n    const salt = getBytes(_salt, \"salt\");\n    const initCodeHash = getBytes(_initCodeHash, \"initCodeHash\");\n    assertArgument(salt.length === 32, \"salt must be 32 bytes\", \"salt\", _salt);\n    assertArgument(initCodeHash.length === 32, \"initCodeHash must be 32 bytes\", \"initCodeHash\", _initCodeHash);\n    return getAddress(dataSlice(keccak256(concat([\"0xff\", from, salt, initCodeHash])), 12));\n}\n//# sourceMappingURL=contract-address.js.map","import { defineProperties } from \"../utils/properties.js\";\nimport { assertArgument } from \"../utils/index.js\";\nconst EnsAddress = \"0x00000000000C2E074eC69A0dFb2997BA6C7d2e1e\";\n/**\n *  A **NetworkPlugin** provides additional functionality on a [[Network]].\n */\nexport class NetworkPlugin {\n    /**\n     *  The name of the plugin.\n     *\n     *  It is recommended to use reverse-domain-notation, which permits\n     *  unique names with a known authority as well as hierarchal entries.\n     */\n    name;\n    /**\n     *  Creates a new **NetworkPlugin**.\n     */\n    constructor(name) {\n        defineProperties(this, { name });\n    }\n    /**\n     *  Creates a copy of this plugin.\n     */\n    clone() {\n        return new NetworkPlugin(this.name);\n    }\n}\n/**\n *  A **GasCostPlugin** allows a network to provide alternative values when\n *  computing the intrinsic gas required for a transaction.\n */\nexport class GasCostPlugin extends NetworkPlugin {\n    /**\n     *  The block number to treat these values as valid from.\n     *\n     *  This allows a hardfork to have updated values included as well as\n     *  mulutiple hardforks to be supported.\n     */\n    effectiveBlock;\n    /**\n     *  The transactions base fee.\n     */\n    txBase;\n    /**\n     *  The fee for creating a new account.\n     */\n    txCreate;\n    /**\n     *  The fee per zero-byte in the data.\n     */\n    txDataZero;\n    /**\n     *  The fee per non-zero-byte in the data.\n     */\n    txDataNonzero;\n    /**\n     *  The fee per storage key in the [[link-eip-2930]] access list.\n     */\n    txAccessListStorageKey;\n    /**\n     *  The fee per address in the [[link-eip-2930]] access list.\n     */\n    txAccessListAddress;\n    /**\n     *  Creates a new GasCostPlugin from %%effectiveBlock%% until the\n     *  latest block or another GasCostPlugin supercedes that block number,\n     *  with the associated %%costs%%.\n     */\n    constructor(effectiveBlock, costs) {\n        if (effectiveBlock == null) {\n            effectiveBlock = 0;\n        }\n        super(`org.ethers.network.plugins.GasCost#${(effectiveBlock || 0)}`);\n        const props = { effectiveBlock };\n        function set(name, nullish) {\n            let value = (costs || {})[name];\n            if (value == null) {\n                value = nullish;\n            }\n            assertArgument(typeof (value) === \"number\", `invalud value for ${name}`, \"costs\", costs);\n            props[name] = value;\n        }\n        set(\"txBase\", 21000);\n        set(\"txCreate\", 32000);\n        set(\"txDataZero\", 4);\n        set(\"txDataNonzero\", 16);\n        set(\"txAccessListStorageKey\", 1900);\n        set(\"txAccessListAddress\", 2400);\n        defineProperties(this, props);\n    }\n    clone() {\n        return new GasCostPlugin(this.effectiveBlock, this);\n    }\n}\n/**\n *  An **EnsPlugin** allows a [[Network]] to specify the ENS Registry\n *  Contract address and the target network to use when using that\n *  contract.\n *\n *  Various testnets have their own instance of the contract to use, but\n *  in general, the mainnet instance supports multi-chain addresses and\n *  should be used.\n */\nexport class EnsPlugin extends NetworkPlugin {\n    /**\n     *  The ENS Registrty Contract address.\n     */\n    address;\n    /**\n     *  The chain ID that the ENS contract lives on.\n     */\n    targetNetwork;\n    /**\n     *  Creates a new **EnsPlugin** connected to %%address%% on the\n     *  %%targetNetwork%%. The default ENS address and mainnet is used\n     *  if unspecified.\n     */\n    constructor(address, targetNetwork) {\n        super(\"org.ethers.plugins.network.Ens\");\n        defineProperties(this, {\n            address: (address || EnsAddress),\n            targetNetwork: ((targetNetwork == null) ? 1 : targetNetwork)\n        });\n    }\n    clone() {\n        return new EnsPlugin(this.address, this.targetNetwork);\n    }\n}\n/**\n *  A **FeeDataNetworkPlugin** allows a network to provide and alternate\n *  means to specify its fee data.\n *\n *  For example, a network which does not support [[link-eip-1559]] may\n *  choose to use a Gas Station site to approximate the gas price.\n */\nexport class FeeDataNetworkPlugin extends NetworkPlugin {\n    #feeDataFunc;\n    /**\n     *  The fee data function provided to the constructor.\n     */\n    get feeDataFunc() {\n        return this.#feeDataFunc;\n    }\n    /**\n     *  Creates a new **FeeDataNetworkPlugin**.\n     */\n    constructor(feeDataFunc) {\n        super(\"org.ethers.plugins.network.FeeData\");\n        this.#feeDataFunc = feeDataFunc;\n    }\n    /**\n     *  Resolves to the fee data.\n     */\n    async getFeeData(provider) {\n        return await this.#feeDataFunc(provider);\n    }\n    clone() {\n        return new FeeDataNetworkPlugin(this.#feeDataFunc);\n    }\n}\nexport class FetchUrlFeeDataNetworkPlugin extends NetworkPlugin {\n    #url;\n    #processFunc;\n    /**\n     *  The URL to initialize the FetchRequest with in %%processFunc%%.\n     */\n    get url() { return this.#url; }\n    /**\n     *  The callback to use when computing the FeeData.\n     */\n    get processFunc() { return this.#processFunc; }\n    /**\n     *  Creates a new **FetchUrlFeeDataNetworkPlugin** which will\n     *  be used when computing the fee data for the network.\n     */\n    constructor(url, processFunc) {\n        super(\"org.ethers.plugins.network.FetchUrlFeeDataPlugin\");\n        this.#url = url;\n        this.#processFunc = processFunc;\n    }\n    // We are immutable, so we can serve as our own clone\n    clone() { return this; }\n}\n/*\nexport class CustomBlockNetworkPlugin extends NetworkPlugin {\n    readonly #blockFunc: (provider: Provider, block: BlockParams<string>) => Block<string>;\n    readonly #blockWithTxsFunc: (provider: Provider, block: BlockParams<TransactionResponseParams>) => Block<TransactionResponse>;\n\n    constructor(blockFunc: (provider: Provider, block: BlockParams<string>) => Block<string>, blockWithTxsFunc: (provider: Provider, block: BlockParams<TransactionResponseParams>) => Block<TransactionResponse>) {\n        super(\"org.ethers.network-plugins.custom-block\");\n        this.#blockFunc = blockFunc;\n        this.#blockWithTxsFunc = blockWithTxsFunc;\n    }\n\n    async getBlock(provider: Provider, block: BlockParams<string>): Promise<Block<string>> {\n        return await this.#blockFunc(provider, block);\n    }\n\n    async getBlockions(provider: Provider, block: BlockParams<TransactionResponseParams>): Promise<Block<TransactionResponse>> {\n        return await this.#blockWithTxsFunc(provider, block);\n    }\n\n    clone(): CustomBlockNetworkPlugin {\n        return new CustomBlockNetworkPlugin(this.#blockFunc, this.#blockWithTxsFunc);\n    }\n}\n*/\n//# sourceMappingURL=plugins-network.js.map","/**\n *  A **Network** encapsulates the various properties required to\n *  interact with a specific chain.\n *\n *  @_subsection: api/providers:Networks  [networks]\n */\nimport { accessListify } from \"../transaction/index.js\";\nimport { getBigInt, assert, assertArgument } from \"../utils/index.js\";\nimport { EnsPlugin, FetchUrlFeeDataNetworkPlugin, GasCostPlugin } from \"./plugins-network.js\";\n/* * * *\n// Networks which operation against an L2 can use this plugin to\n// specify how to access L1, for the purpose of resolving ENS,\n// for example.\nexport class LayerOneConnectionPlugin extends NetworkPlugin {\n    readonly provider!: Provider;\n// @TODO: Rename to ChainAccess and allow for connecting to any chain\n    constructor(provider: Provider) {\n        super(\"org.ethers.plugins.layer-one-connection\");\n        defineProperties<LayerOneConnectionPlugin>(this, { provider });\n    }\n\n    clone(): LayerOneConnectionPlugin {\n        return new LayerOneConnectionPlugin(this.provider);\n    }\n}\n*/\nconst Networks = new Map();\n/**\n *  A **Network** provides access to a chain's properties and allows\n *  for plug-ins to extend functionality.\n */\nexport class Network {\n    #name;\n    #chainId;\n    #plugins;\n    /**\n     *  Creates a new **Network** for %%name%% and %%chainId%%.\n     */\n    constructor(name, chainId) {\n        this.#name = name;\n        this.#chainId = getBigInt(chainId);\n        this.#plugins = new Map();\n    }\n    /**\n     *  Returns a JSON-compatible representation of a Network.\n     */\n    toJSON() {\n        return { name: this.name, chainId: String(this.chainId) };\n    }\n    /**\n     *  The network common name.\n     *\n     *  This is the canonical name, as networks migh have multiple\n     *  names.\n     */\n    get name() { return this.#name; }\n    set name(value) { this.#name = value; }\n    /**\n     *  The network chain ID.\n     */\n    get chainId() { return this.#chainId; }\n    set chainId(value) { this.#chainId = getBigInt(value, \"chainId\"); }\n    /**\n     *  Returns true if %%other%% matches this network. Any chain ID\n     *  must match, and if no chain ID is present, the name must match.\n     *\n     *  This method does not currently check for additional properties,\n     *  such as ENS address or plug-in compatibility.\n     */\n    matches(other) {\n        if (other == null) {\n            return false;\n        }\n        if (typeof (other) === \"string\") {\n            try {\n                return (this.chainId === getBigInt(other));\n            }\n            catch (error) { }\n            return (this.name === other);\n        }\n        if (typeof (other) === \"number\" || typeof (other) === \"bigint\") {\n            try {\n                return (this.chainId === getBigInt(other));\n            }\n            catch (error) { }\n            return false;\n        }\n        if (typeof (other) === \"object\") {\n            if (other.chainId != null) {\n                try {\n                    return (this.chainId === getBigInt(other.chainId));\n                }\n                catch (error) { }\n                return false;\n            }\n            if (other.name != null) {\n                return (this.name === other.name);\n            }\n            return false;\n        }\n        return false;\n    }\n    /**\n     *  Returns the list of plugins currently attached to this Network.\n     */\n    get plugins() {\n        return Array.from(this.#plugins.values());\n    }\n    /**\n     *  Attach a new %%plugin%% to this Network. The network name\n     *  must be unique, excluding any fragment.\n     */\n    attachPlugin(plugin) {\n        if (this.#plugins.get(plugin.name)) {\n            throw new Error(`cannot replace existing plugin: ${plugin.name} `);\n        }\n        this.#plugins.set(plugin.name, plugin.clone());\n        return this;\n    }\n    /**\n     *  Return the plugin, if any, matching %%name%% exactly. Plugins\n     *  with fragments will not be returned unless %%name%% includes\n     *  a fragment.\n     */\n    getPlugin(name) {\n        return (this.#plugins.get(name)) || null;\n    }\n    /**\n     *  Gets a list of all plugins that match %%name%%, with otr without\n     *  a fragment.\n     */\n    getPlugins(basename) {\n        return (this.plugins.filter((p) => (p.name.split(\"#\")[0] === basename)));\n    }\n    /**\n     *  Create a copy of this Network.\n     */\n    clone() {\n        const clone = new Network(this.name, this.chainId);\n        this.plugins.forEach((plugin) => {\n            clone.attachPlugin(plugin.clone());\n        });\n        return clone;\n    }\n    /**\n     *  Compute the intrinsic gas required for a transaction.\n     *\n     *  A GasCostPlugin can be attached to override the default\n     *  values.\n     */\n    computeIntrinsicGas(tx) {\n        const costs = this.getPlugin(\"org.ethers.plugins.network.GasCost\") || (new GasCostPlugin());\n        let gas = costs.txBase;\n        if (tx.to == null) {\n            gas += costs.txCreate;\n        }\n        if (tx.data) {\n            for (let i = 2; i < tx.data.length; i += 2) {\n                if (tx.data.substring(i, i + 2) === \"00\") {\n                    gas += costs.txDataZero;\n                }\n                else {\n                    gas += costs.txDataNonzero;\n                }\n            }\n        }\n        if (tx.accessList) {\n            const accessList = accessListify(tx.accessList);\n            for (const addr in accessList) {\n                gas += costs.txAccessListAddress + costs.txAccessListStorageKey * accessList[addr].storageKeys.length;\n            }\n        }\n        return gas;\n    }\n    /**\n     *  Returns a new Network for the %%network%% name or chainId.\n     */\n    static from(network) {\n        injectCommonNetworks();\n        // Default network\n        if (network == null) {\n            return Network.from(\"mainnet\");\n        }\n        // Canonical name or chain ID\n        if (typeof (network) === \"number\") {\n            network = BigInt(network);\n        }\n        if (typeof (network) === \"string\" || typeof (network) === \"bigint\") {\n            const networkFunc = Networks.get(network);\n            if (networkFunc) {\n                return networkFunc();\n            }\n            if (typeof (network) === \"bigint\") {\n                return new Network(\"unknown\", network);\n            }\n            assertArgument(false, \"unknown network\", \"network\", network);\n        }\n        // Clonable with network-like abilities\n        if (typeof (network.clone) === \"function\") {\n            const clone = network.clone();\n            //if (typeof(network.name) !== \"string\" || typeof(network.chainId) !== \"number\") {\n            //}\n            return clone;\n        }\n        // Networkish\n        if (typeof (network) === \"object\") {\n            assertArgument(typeof (network.name) === \"string\" && typeof (network.chainId) === \"number\", \"invalid network object name or chainId\", \"network\", network);\n            const custom = new Network((network.name), (network.chainId));\n            if (network.ensAddress || network.ensNetwork != null) {\n                custom.attachPlugin(new EnsPlugin(network.ensAddress, network.ensNetwork));\n            }\n            //if ((<any>network).layerOneConnection) {\n            //    custom.attachPlugin(new LayerOneConnectionPlugin((<any>network).layerOneConnection));\n            //}\n            return custom;\n        }\n        assertArgument(false, \"invalid network\", \"network\", network);\n    }\n    /**\n     *  Register %%nameOrChainId%% with a function which returns\n     *  an instance of a Network representing that chain.\n     */\n    static register(nameOrChainId, networkFunc) {\n        if (typeof (nameOrChainId) === \"number\") {\n            nameOrChainId = BigInt(nameOrChainId);\n        }\n        const existing = Networks.get(nameOrChainId);\n        if (existing) {\n            assertArgument(false, `conflicting network for ${JSON.stringify(existing.name)}`, \"nameOrChainId\", nameOrChainId);\n        }\n        Networks.set(nameOrChainId, networkFunc);\n    }\n}\n// We don't want to bring in formatUnits because it is backed by\n// FixedNumber and we want to keep Networks tiny. The values\n// included by the Gas Stations are also IEEE 754 with lots of\n// rounding issues and exceed the strict checks formatUnits has.\nfunction parseUnits(_value, decimals) {\n    const value = String(_value);\n    if (!value.match(/^[0-9.]+$/)) {\n        throw new Error(`invalid gwei value: ${_value}`);\n    }\n    // Break into [ whole, fraction ]\n    const comps = value.split(\".\");\n    if (comps.length === 1) {\n        comps.push(\"\");\n    }\n    // More than 1 decimal point or too many fractional positions\n    if (comps.length !== 2) {\n        throw new Error(`invalid gwei value: ${_value}`);\n    }\n    // Pad the fraction to 9 decimalplaces\n    while (comps[1].length < decimals) {\n        comps[1] += \"0\";\n    }\n    // Too many decimals and some non-zero ending, take the ceiling\n    if (comps[1].length > 9) {\n        let frac = BigInt(comps[1].substring(0, 9));\n        if (!comps[1].substring(9).match(/^0+$/)) {\n            frac++;\n        }\n        comps[1] = frac.toString();\n    }\n    return BigInt(comps[0] + comps[1]);\n}\n// Used by Polygon to use a gas station for fee data\nfunction getGasStationPlugin(url) {\n    return new FetchUrlFeeDataNetworkPlugin(url, async (fetchFeeData, provider, request) => {\n        // Prevent Cloudflare from blocking our request in node.js\n        request.setHeader(\"User-Agent\", \"ethers\");\n        let response;\n        try {\n            const [_response, _feeData] = await Promise.all([\n                request.send(), fetchFeeData()\n            ]);\n            response = _response;\n            const payload = response.bodyJson.standard;\n            const feeData = {\n                gasPrice: _feeData.gasPrice,\n                maxFeePerGas: parseUnits(payload.maxFee, 9),\n                maxPriorityFeePerGas: parseUnits(payload.maxPriorityFee, 9),\n            };\n            return feeData;\n        }\n        catch (error) {\n            assert(false, `error encountered with polygon gas station (${JSON.stringify(request.url)})`, \"SERVER_ERROR\", { request, response, error });\n        }\n    });\n}\n// See: https://chainlist.org\nlet injected = false;\nfunction injectCommonNetworks() {\n    if (injected) {\n        return;\n    }\n    injected = true;\n    /// Register popular Ethereum networks\n    function registerEth(name, chainId, options) {\n        const func = function () {\n            const network = new Network(name, chainId);\n            // We use 0 to disable ENS\n            if (options.ensNetwork != null) {\n                network.attachPlugin(new EnsPlugin(null, options.ensNetwork));\n            }\n            network.attachPlugin(new GasCostPlugin());\n            (options.plugins || []).forEach((plugin) => {\n                network.attachPlugin(plugin);\n            });\n            return network;\n        };\n        // Register the network by name and chain ID\n        Network.register(name, func);\n        Network.register(chainId, func);\n        if (options.altNames) {\n            options.altNames.forEach((name) => {\n                Network.register(name, func);\n            });\n        }\n    }\n    registerEth(\"mainnet\", 1, { ensNetwork: 1, altNames: [\"homestead\"] });\n    registerEth(\"ropsten\", 3, { ensNetwork: 3 });\n    registerEth(\"rinkeby\", 4, { ensNetwork: 4 });\n    registerEth(\"goerli\", 5, { ensNetwork: 5 });\n    registerEth(\"kovan\", 42, { ensNetwork: 42 });\n    registerEth(\"sepolia\", 11155111, { ensNetwork: 11155111 });\n    registerEth(\"holesky\", 17000, { ensNetwork: 17000 });\n    registerEth(\"classic\", 61, {});\n    registerEth(\"classicKotti\", 6, {});\n    registerEth(\"arbitrum\", 42161, {\n        ensNetwork: 1,\n    });\n    registerEth(\"arbitrum-goerli\", 421613, {});\n    registerEth(\"arbitrum-sepolia\", 421614, {});\n    registerEth(\"base\", 8453, { ensNetwork: 1 });\n    registerEth(\"base-goerli\", 84531, {});\n    registerEth(\"base-sepolia\", 84532, {});\n    registerEth(\"bnb\", 56, { ensNetwork: 1 });\n    registerEth(\"bnbt\", 97, {});\n    registerEth(\"linea\", 59144, { ensNetwork: 1 });\n    registerEth(\"linea-goerli\", 59140, {});\n    registerEth(\"linea-sepolia\", 59141, {});\n    registerEth(\"matic\", 137, {\n        ensNetwork: 1,\n        plugins: [\n            getGasStationPlugin(\"https:/\\/gasstation.polygon.technology/v2\")\n        ]\n    });\n    registerEth(\"matic-amoy\", 80002, {});\n    registerEth(\"matic-mumbai\", 80001, {\n        altNames: [\"maticMumbai\", \"maticmum\"],\n        plugins: [\n            getGasStationPlugin(\"https:/\\/gasstation-testnet.polygon.technology/v2\")\n        ]\n    });\n    registerEth(\"optimism\", 10, {\n        ensNetwork: 1,\n        plugins: []\n    });\n    registerEth(\"optimism-goerli\", 420, {});\n    registerEth(\"optimism-sepolia\", 11155420, {});\n    registerEth(\"xdai\", 100, { ensNetwork: 1 });\n}\n//# sourceMappingURL=network.js.map","import { assert, isHexString } from \"../utils/index.js\";\nfunction copy(obj) {\n    return JSON.parse(JSON.stringify(obj));\n}\n/**\n *  Return the polling subscriber for common events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport function getPollingSubscriber(provider, event) {\n    if (event === \"block\") {\n        return new PollingBlockSubscriber(provider);\n    }\n    if (isHexString(event, 32)) {\n        return new PollingTransactionSubscriber(provider, event);\n    }\n    assert(false, \"unsupported polling event\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"getPollingSubscriber\", info: { event }\n    });\n}\n// @TODO: refactor this\n/**\n *  A **PollingBlockSubscriber** polls at a regular interval for a change\n *  in the block number.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class PollingBlockSubscriber {\n    #provider;\n    #poller;\n    #interval;\n    // The most recent block we have scanned for events. The value -2\n    // indicates we still need to fetch an initial block number\n    #blockNumber;\n    /**\n     *  Create a new **PollingBlockSubscriber** attached to %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#poller = null;\n        this.#interval = 4000;\n        this.#blockNumber = -2;\n    }\n    /**\n     *  The polling interval.\n     */\n    get pollingInterval() { return this.#interval; }\n    set pollingInterval(value) { this.#interval = value; }\n    async #poll() {\n        try {\n            const blockNumber = await this.#provider.getBlockNumber();\n            // Bootstrap poll to setup our initial block number\n            if (this.#blockNumber === -2) {\n                this.#blockNumber = blockNumber;\n                return;\n            }\n            // @TODO: Put a cap on the maximum number of events per loop?\n            if (blockNumber !== this.#blockNumber) {\n                for (let b = this.#blockNumber + 1; b <= blockNumber; b++) {\n                    // We have been stopped\n                    if (this.#poller == null) {\n                        return;\n                    }\n                    await this.#provider.emit(\"block\", b);\n                }\n                this.#blockNumber = blockNumber;\n            }\n        }\n        catch (error) {\n            // @TODO: Minor bump, add an \"error\" event to let subscribers\n            //        know things went awry.\n            //console.log(error);\n        }\n        // We have been stopped\n        if (this.#poller == null) {\n            return;\n        }\n        this.#poller = this.#provider._setTimeout(this.#poll.bind(this), this.#interval);\n    }\n    start() {\n        if (this.#poller) {\n            return;\n        }\n        this.#poller = this.#provider._setTimeout(this.#poll.bind(this), this.#interval);\n        this.#poll();\n    }\n    stop() {\n        if (!this.#poller) {\n            return;\n        }\n        this.#provider._clearTimeout(this.#poller);\n        this.#poller = null;\n    }\n    pause(dropWhilePaused) {\n        this.stop();\n        if (dropWhilePaused) {\n            this.#blockNumber = -2;\n        }\n    }\n    resume() {\n        this.start();\n    }\n}\n/**\n *  An **OnBlockSubscriber** can be sub-classed, with a [[_poll]]\n *  implmentation which will be called on every new block.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class OnBlockSubscriber {\n    #provider;\n    #poll;\n    #running;\n    /**\n     *  Create a new **OnBlockSubscriber** attached to %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#running = false;\n        this.#poll = (blockNumber) => {\n            this._poll(blockNumber, this.#provider);\n        };\n    }\n    /**\n     *  Called on every new block.\n     */\n    async _poll(blockNumber, provider) {\n        throw new Error(\"sub-classes must override this\");\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        this.#poll(-2);\n        this.#provider.on(\"block\", this.#poll);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#provider.off(\"block\", this.#poll);\n    }\n    pause(dropWhilePaused) { this.stop(); }\n    resume() { this.start(); }\n}\nexport class PollingBlockTagSubscriber extends OnBlockSubscriber {\n    #tag;\n    #lastBlock;\n    constructor(provider, tag) {\n        super(provider);\n        this.#tag = tag;\n        this.#lastBlock = -2;\n    }\n    pause(dropWhilePaused) {\n        if (dropWhilePaused) {\n            this.#lastBlock = -2;\n        }\n        super.pause(dropWhilePaused);\n    }\n    async _poll(blockNumber, provider) {\n        const block = await provider.getBlock(this.#tag);\n        if (block == null) {\n            return;\n        }\n        if (this.#lastBlock === -2) {\n            this.#lastBlock = block.number;\n        }\n        else if (block.number > this.#lastBlock) {\n            provider.emit(this.#tag, block.number);\n            this.#lastBlock = block.number;\n        }\n    }\n}\n/**\n *  @_ignore:\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class PollingOrphanSubscriber extends OnBlockSubscriber {\n    #filter;\n    constructor(provider, filter) {\n        super(provider);\n        this.#filter = copy(filter);\n    }\n    async _poll(blockNumber, provider) {\n        throw new Error(\"@TODO\");\n        console.log(this.#filter);\n    }\n}\n/**\n *  A **PollingTransactionSubscriber** will poll for a given transaction\n *  hash for its receipt.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class PollingTransactionSubscriber extends OnBlockSubscriber {\n    #hash;\n    /**\n     *  Create a new **PollingTransactionSubscriber** attached to\n     *  %%provider%%, listening for %%hash%%.\n     */\n    constructor(provider, hash) {\n        super(provider);\n        this.#hash = hash;\n    }\n    async _poll(blockNumber, provider) {\n        const tx = await provider.getTransactionReceipt(this.#hash);\n        if (tx) {\n            provider.emit(this.#hash, tx);\n        }\n    }\n}\n/**\n *  A **PollingEventSubscriber** will poll for a given filter for its logs.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class PollingEventSubscriber {\n    #provider;\n    #filter;\n    #poller;\n    #running;\n    // The most recent block we have scanned for events. The value -2\n    // indicates we still need to fetch an initial block number\n    #blockNumber;\n    /**\n     *  Create a new **PollingTransactionSubscriber** attached to\n     *  %%provider%%, listening for %%filter%%.\n     */\n    constructor(provider, filter) {\n        this.#provider = provider;\n        this.#filter = copy(filter);\n        this.#poller = this.#poll.bind(this);\n        this.#running = false;\n        this.#blockNumber = -2;\n    }\n    async #poll(blockNumber) {\n        // The initial block hasn't been determined yet\n        if (this.#blockNumber === -2) {\n            return;\n        }\n        const filter = copy(this.#filter);\n        filter.fromBlock = this.#blockNumber + 1;\n        filter.toBlock = blockNumber;\n        const logs = await this.#provider.getLogs(filter);\n        // No logs could just mean the node has not indexed them yet,\n        // so we keep a sliding window of 60 blocks to keep scanning\n        if (logs.length === 0) {\n            if (this.#blockNumber < blockNumber - 60) {\n                this.#blockNumber = blockNumber - 60;\n            }\n            return;\n        }\n        for (const log of logs) {\n            this.#provider.emit(this.#filter, log);\n            // Only advance the block number when logs were found to\n            // account for networks (like BNB and Polygon) which may\n            // sacrifice event consistency for block event speed\n            this.#blockNumber = log.blockNumber;\n        }\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        if (this.#blockNumber === -2) {\n            this.#provider.getBlockNumber().then((blockNumber) => {\n                this.#blockNumber = blockNumber;\n            });\n        }\n        this.#provider.on(\"block\", this.#poller);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#provider.off(\"block\", this.#poller);\n    }\n    pause(dropWhilePaused) {\n        this.stop();\n        if (dropWhilePaused) {\n            this.#blockNumber = -2;\n        }\n    }\n    resume() {\n        this.start();\n    }\n}\n//# sourceMappingURL=subscriber-polling.js.map","/**\n *  The available providers should suffice for most developers purposes,\n *  but the [[AbstractProvider]] class has many features which enable\n *  sub-classing it for specific purposes.\n *\n *  @_section: api/providers/abstract-provider: Subclassing Provider  [abstract-provider]\n */\n// @TODO\n// Event coalescence\n//   When we register an event with an async value (e.g. address is a Signer\n//   or ENS name), we need to add it immeidately for the Event API, but also\n//   need time to resolve the address. Upon resolving the address, we need to\n//   migrate the listener to the static event. We also need to maintain a map\n//   of Signer/ENS name to address so we can sync respond to listenerCount.\nimport { getAddress, resolveAddress } from \"../address/index.js\";\nimport { ZeroAddress } from \"../constants/index.js\";\nimport { Contract } from \"../contract/index.js\";\nimport { namehash } from \"../hash/index.js\";\nimport { Transaction } from \"../transaction/index.js\";\nimport { concat, dataLength, dataSlice, hexlify, isHexString, getBigInt, getBytes, getNumber, isCallException, isError, makeError, assert, assertArgument, FetchRequest, toBeArray, toQuantity, defineProperties, EventPayload, resolveProperties, toUtf8String } from \"../utils/index.js\";\nimport { EnsResolver } from \"./ens-resolver.js\";\nimport { formatBlock, formatLog, formatTransactionReceipt, formatTransactionResponse } from \"./format.js\";\nimport { Network } from \"./network.js\";\nimport { copyRequest, Block, FeeData, Log, TransactionReceipt, TransactionResponse } from \"./provider.js\";\nimport { PollingBlockSubscriber, PollingBlockTagSubscriber, PollingEventSubscriber, PollingOrphanSubscriber, PollingTransactionSubscriber } from \"./subscriber-polling.js\";\n// Constants\nconst BN_2 = BigInt(2);\nconst MAX_CCIP_REDIRECTS = 10;\nfunction isPromise(value) {\n    return (value && typeof (value.then) === \"function\");\n}\nfunction getTag(prefix, value) {\n    return prefix + \":\" + JSON.stringify(value, (k, v) => {\n        if (v == null) {\n            return \"null\";\n        }\n        if (typeof (v) === \"bigint\") {\n            return `bigint:${v.toString()}`;\n        }\n        if (typeof (v) === \"string\") {\n            return v.toLowerCase();\n        }\n        // Sort object keys\n        if (typeof (v) === \"object\" && !Array.isArray(v)) {\n            const keys = Object.keys(v);\n            keys.sort();\n            return keys.reduce((accum, key) => {\n                accum[key] = v[key];\n                return accum;\n            }, {});\n        }\n        return v;\n    });\n}\n/**\n *  An **UnmanagedSubscriber** is useful for events which do not require\n *  any additional management, such as ``\"debug\"`` which only requires\n *  emit in synchronous event loop triggered calls.\n */\nexport class UnmanagedSubscriber {\n    /**\n     *  The name fof the event.\n     */\n    name;\n    /**\n     *  Create a new UnmanagedSubscriber with %%name%%.\n     */\n    constructor(name) { defineProperties(this, { name }); }\n    start() { }\n    stop() { }\n    pause(dropWhilePaused) { }\n    resume() { }\n}\nfunction copy(value) {\n    return JSON.parse(JSON.stringify(value));\n}\nfunction concisify(items) {\n    items = Array.from((new Set(items)).values());\n    items.sort();\n    return items;\n}\nasync function getSubscription(_event, provider) {\n    if (_event == null) {\n        throw new Error(\"invalid event\");\n    }\n    // Normalize topic array info an EventFilter\n    if (Array.isArray(_event)) {\n        _event = { topics: _event };\n    }\n    if (typeof (_event) === \"string\") {\n        switch (_event) {\n            case \"block\":\n            case \"debug\":\n            case \"error\":\n            case \"finalized\":\n            case \"network\":\n            case \"pending\":\n            case \"safe\": {\n                return { type: _event, tag: _event };\n            }\n        }\n    }\n    if (isHexString(_event, 32)) {\n        const hash = _event.toLowerCase();\n        return { type: \"transaction\", tag: getTag(\"tx\", { hash }), hash };\n    }\n    if (_event.orphan) {\n        const event = _event;\n        // @TODO: Should lowercase and whatnot things here instead of copy...\n        return { type: \"orphan\", tag: getTag(\"orphan\", event), filter: copy(event) };\n    }\n    if ((_event.address || _event.topics)) {\n        const event = _event;\n        const filter = {\n            topics: ((event.topics || []).map((t) => {\n                if (t == null) {\n                    return null;\n                }\n                if (Array.isArray(t)) {\n                    return concisify(t.map((t) => t.toLowerCase()));\n                }\n                return t.toLowerCase();\n            }))\n        };\n        if (event.address) {\n            const addresses = [];\n            const promises = [];\n            const addAddress = (addr) => {\n                if (isHexString(addr)) {\n                    addresses.push(addr);\n                }\n                else {\n                    promises.push((async () => {\n                        addresses.push(await resolveAddress(addr, provider));\n                    })());\n                }\n            };\n            if (Array.isArray(event.address)) {\n                event.address.forEach(addAddress);\n            }\n            else {\n                addAddress(event.address);\n            }\n            if (promises.length) {\n                await Promise.all(promises);\n            }\n            filter.address = concisify(addresses.map((a) => a.toLowerCase()));\n        }\n        return { filter, tag: getTag(\"event\", filter), type: \"event\" };\n    }\n    assertArgument(false, \"unknown ProviderEvent\", \"event\", _event);\n}\nfunction getTime() { return (new Date()).getTime(); }\nconst defaultOptions = {\n    cacheTimeout: 250,\n    pollingInterval: 4000\n};\n/**\n *  An **AbstractProvider** provides a base class for other sub-classes to\n *  implement the [[Provider]] API by normalizing input arguments and\n *  formatting output results as well as tracking events for consistent\n *  behaviour on an eventually-consistent network.\n */\nexport class AbstractProvider {\n    #subs;\n    #plugins;\n    // null=unpaused, true=paused+dropWhilePaused, false=paused\n    #pausedState;\n    #destroyed;\n    #networkPromise;\n    #anyNetwork;\n    #performCache;\n    // The most recent block number if running an event or -1 if no \"block\" event\n    #lastBlockNumber;\n    #nextTimer;\n    #timers;\n    #disableCcipRead;\n    #options;\n    /**\n     *  Create a new **AbstractProvider** connected to %%network%%, or\n     *  use the various network detection capabilities to discover the\n     *  [[Network]] if necessary.\n     */\n    constructor(_network, options) {\n        this.#options = Object.assign({}, defaultOptions, options || {});\n        if (_network === \"any\") {\n            this.#anyNetwork = true;\n            this.#networkPromise = null;\n        }\n        else if (_network) {\n            const network = Network.from(_network);\n            this.#anyNetwork = false;\n            this.#networkPromise = Promise.resolve(network);\n            setTimeout(() => { this.emit(\"network\", network, null); }, 0);\n        }\n        else {\n            this.#anyNetwork = false;\n            this.#networkPromise = null;\n        }\n        this.#lastBlockNumber = -1;\n        this.#performCache = new Map();\n        this.#subs = new Map();\n        this.#plugins = new Map();\n        this.#pausedState = null;\n        this.#destroyed = false;\n        this.#nextTimer = 1;\n        this.#timers = new Map();\n        this.#disableCcipRead = false;\n    }\n    get pollingInterval() { return this.#options.pollingInterval; }\n    /**\n     *  Returns ``this``, to allow an **AbstractProvider** to implement\n     *  the [[ContractRunner]] interface.\n     */\n    get provider() { return this; }\n    /**\n     *  Returns all the registered plug-ins.\n     */\n    get plugins() {\n        return Array.from(this.#plugins.values());\n    }\n    /**\n     *  Attach a new plug-in.\n     */\n    attachPlugin(plugin) {\n        if (this.#plugins.get(plugin.name)) {\n            throw new Error(`cannot replace existing plugin: ${plugin.name} `);\n        }\n        this.#plugins.set(plugin.name, plugin.connect(this));\n        return this;\n    }\n    /**\n     *  Get a plugin by name.\n     */\n    getPlugin(name) {\n        return (this.#plugins.get(name)) || null;\n    }\n    /**\n     *  Prevent any CCIP-read operation, regardless of whether requested\n     *  in a [[call]] using ``enableCcipRead``.\n     */\n    get disableCcipRead() { return this.#disableCcipRead; }\n    set disableCcipRead(value) { this.#disableCcipRead = !!value; }\n    // Shares multiple identical requests made during the same 250ms\n    async #perform(req) {\n        const timeout = this.#options.cacheTimeout;\n        // Caching disabled\n        if (timeout < 0) {\n            return await this._perform(req);\n        }\n        // Create a tag\n        const tag = getTag(req.method, req);\n        let perform = this.#performCache.get(tag);\n        if (!perform) {\n            perform = this._perform(req);\n            this.#performCache.set(tag, perform);\n            setTimeout(() => {\n                if (this.#performCache.get(tag) === perform) {\n                    this.#performCache.delete(tag);\n                }\n            }, timeout);\n        }\n        return await perform;\n    }\n    /**\n     *  Resolves to the data for executing the CCIP-read operations.\n     */\n    async ccipReadFetch(tx, calldata, urls) {\n        if (this.disableCcipRead || urls.length === 0 || tx.to == null) {\n            return null;\n        }\n        const sender = tx.to.toLowerCase();\n        const data = calldata.toLowerCase();\n        const errorMessages = [];\n        for (let i = 0; i < urls.length; i++) {\n            const url = urls[i];\n            // URL expansion\n            const href = url.replace(\"{sender}\", sender).replace(\"{data}\", data);\n            // If no {data} is present, use POST; otherwise GET\n            //const json: string | null = (url.indexOf(\"{data}\") >= 0) ? null: JSON.stringify({ data, sender });\n            //const result = await fetchJson({ url: href, errorPassThrough: true }, json, (value, response) => {\n            //    value.status = response.statusCode;\n            //    return value;\n            //});\n            const request = new FetchRequest(href);\n            if (url.indexOf(\"{data}\") === -1) {\n                request.body = { data, sender };\n            }\n            this.emit(\"debug\", { action: \"sendCcipReadFetchRequest\", request, index: i, urls });\n            let errorMessage = \"unknown error\";\n            // Fetch the resource...\n            let resp;\n            try {\n                resp = await request.send();\n            }\n            catch (error) {\n                // ...low-level fetch error (missing host, bad SSL, etc.),\n                // so try next URL\n                errorMessages.push(error.message);\n                this.emit(\"debug\", { action: \"receiveCcipReadFetchError\", request, result: { error } });\n                continue;\n            }\n            try {\n                const result = resp.bodyJson;\n                if (result.data) {\n                    this.emit(\"debug\", { action: \"receiveCcipReadFetchResult\", request, result });\n                    return result.data;\n                }\n                if (result.message) {\n                    errorMessage = result.message;\n                }\n                this.emit(\"debug\", { action: \"receiveCcipReadFetchError\", request, result });\n            }\n            catch (error) { }\n            // 4xx indicates the result is not present; stop\n            assert(resp.statusCode < 400 || resp.statusCode >= 500, `response not found during CCIP fetch: ${errorMessage}`, \"OFFCHAIN_FAULT\", { reason: \"404_MISSING_RESOURCE\", transaction: tx, info: { url, errorMessage } });\n            // 5xx indicates server issue; try the next url\n            errorMessages.push(errorMessage);\n        }\n        assert(false, `error encountered during CCIP fetch: ${errorMessages.map((m) => JSON.stringify(m)).join(\", \")}`, \"OFFCHAIN_FAULT\", {\n            reason: \"500_SERVER_ERROR\",\n            transaction: tx, info: { urls, errorMessages }\n        });\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a block before\n     *  returning it, to add additional properties or an alternate\n     *  sub-class of [[Block]].\n     */\n    _wrapBlock(value, network) {\n        return new Block(formatBlock(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a log before\n     *  returning it, to add additional properties or an alternate\n     *  sub-class of [[Log]].\n     */\n    _wrapLog(value, network) {\n        return new Log(formatLog(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a transaction\n     *  receipt before returning it, to add additional properties or an\n     *  alternate sub-class of [[TransactionReceipt]].\n     */\n    _wrapTransactionReceipt(value, network) {\n        return new TransactionReceipt(formatTransactionReceipt(value), this);\n    }\n    /**\n     *  Provides the opportunity for a sub-class to wrap a transaction\n     *  response before returning it, to add additional properties or an\n     *  alternate sub-class of [[TransactionResponse]].\n     */\n    _wrapTransactionResponse(tx, network) {\n        return new TransactionResponse(formatTransactionResponse(tx), this);\n    }\n    /**\n     *  Resolves to the Network, forcing a network detection using whatever\n     *  technique the sub-class requires.\n     *\n     *  Sub-classes **must** override this.\n     */\n    _detectNetwork() {\n        assert(false, \"sub-classes must implement this\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"_detectNetwork\"\n        });\n    }\n    /**\n     *  Sub-classes should use this to perform all built-in operations. All\n     *  methods sanitizes and normalizes the values passed into this.\n     *\n     *  Sub-classes **must** override this.\n     */\n    async _perform(req) {\n        assert(false, `unsupported method: ${req.method}`, \"UNSUPPORTED_OPERATION\", {\n            operation: req.method,\n            info: req\n        });\n    }\n    // State\n    async getBlockNumber() {\n        const blockNumber = getNumber(await this.#perform({ method: \"getBlockNumber\" }), \"%response\");\n        if (this.#lastBlockNumber >= 0) {\n            this.#lastBlockNumber = blockNumber;\n        }\n        return blockNumber;\n    }\n    /**\n     *  Returns or resolves to the address for %%address%%, resolving ENS\n     *  names and [[Addressable]] objects and returning if already an\n     *  address.\n     */\n    _getAddress(address) {\n        return resolveAddress(address, this);\n    }\n    /**\n     *  Returns or resolves to a valid block tag for %%blockTag%%, resolving\n     *  negative values and returning if already a valid block tag.\n     */\n    _getBlockTag(blockTag) {\n        if (blockTag == null) {\n            return \"latest\";\n        }\n        switch (blockTag) {\n            case \"earliest\":\n                return \"0x0\";\n            case \"finalized\":\n            case \"latest\":\n            case \"pending\":\n            case \"safe\":\n                return blockTag;\n        }\n        if (isHexString(blockTag)) {\n            if (isHexString(blockTag, 32)) {\n                return blockTag;\n            }\n            return toQuantity(blockTag);\n        }\n        if (typeof (blockTag) === \"bigint\") {\n            blockTag = getNumber(blockTag, \"blockTag\");\n        }\n        if (typeof (blockTag) === \"number\") {\n            if (blockTag >= 0) {\n                return toQuantity(blockTag);\n            }\n            if (this.#lastBlockNumber >= 0) {\n                return toQuantity(this.#lastBlockNumber + blockTag);\n            }\n            return this.getBlockNumber().then((b) => toQuantity(b + blockTag));\n        }\n        assertArgument(false, \"invalid blockTag\", \"blockTag\", blockTag);\n    }\n    /**\n     *  Returns or resolves to a filter for %%filter%%, resolving any ENS\n     *  names or [[Addressable]] object and returning if already a valid\n     *  filter.\n     */\n    _getFilter(filter) {\n        // Create a canonical representation of the topics\n        const topics = (filter.topics || []).map((t) => {\n            if (t == null) {\n                return null;\n            }\n            if (Array.isArray(t)) {\n                return concisify(t.map((t) => t.toLowerCase()));\n            }\n            return t.toLowerCase();\n        });\n        const blockHash = (\"blockHash\" in filter) ? filter.blockHash : undefined;\n        const resolve = (_address, fromBlock, toBlock) => {\n            let address = undefined;\n            switch (_address.length) {\n                case 0: break;\n                case 1:\n                    address = _address[0];\n                    break;\n                default:\n                    _address.sort();\n                    address = _address;\n            }\n            if (blockHash) {\n                if (fromBlock != null || toBlock != null) {\n                    throw new Error(\"invalid filter\");\n                }\n            }\n            const filter = {};\n            if (address) {\n                filter.address = address;\n            }\n            if (topics.length) {\n                filter.topics = topics;\n            }\n            if (fromBlock) {\n                filter.fromBlock = fromBlock;\n            }\n            if (toBlock) {\n                filter.toBlock = toBlock;\n            }\n            if (blockHash) {\n                filter.blockHash = blockHash;\n            }\n            return filter;\n        };\n        // Addresses could be async (ENS names or Addressables)\n        let address = [];\n        if (filter.address) {\n            if (Array.isArray(filter.address)) {\n                for (const addr of filter.address) {\n                    address.push(this._getAddress(addr));\n                }\n            }\n            else {\n                address.push(this._getAddress(filter.address));\n            }\n        }\n        let fromBlock = undefined;\n        if (\"fromBlock\" in filter) {\n            fromBlock = this._getBlockTag(filter.fromBlock);\n        }\n        let toBlock = undefined;\n        if (\"toBlock\" in filter) {\n            toBlock = this._getBlockTag(filter.toBlock);\n        }\n        if (address.filter((a) => (typeof (a) !== \"string\")).length ||\n            (fromBlock != null && typeof (fromBlock) !== \"string\") ||\n            (toBlock != null && typeof (toBlock) !== \"string\")) {\n            return Promise.all([Promise.all(address), fromBlock, toBlock]).then((result) => {\n                return resolve(result[0], result[1], result[2]);\n            });\n        }\n        return resolve(address, fromBlock, toBlock);\n    }\n    /**\n     *  Returns or resolves to a transaction for %%request%%, resolving\n     *  any ENS names or [[Addressable]] and returning if already a valid\n     *  transaction.\n     */\n    _getTransactionRequest(_request) {\n        const request = copyRequest(_request);\n        const promises = [];\n        [\"to\", \"from\"].forEach((key) => {\n            if (request[key] == null) {\n                return;\n            }\n            const addr = resolveAddress(request[key], this);\n            if (isPromise(addr)) {\n                promises.push((async function () { request[key] = await addr; })());\n            }\n            else {\n                request[key] = addr;\n            }\n        });\n        if (request.blockTag != null) {\n            const blockTag = this._getBlockTag(request.blockTag);\n            if (isPromise(blockTag)) {\n                promises.push((async function () { request.blockTag = await blockTag; })());\n            }\n            else {\n                request.blockTag = blockTag;\n            }\n        }\n        if (promises.length) {\n            return (async function () {\n                await Promise.all(promises);\n                return request;\n            })();\n        }\n        return request;\n    }\n    async getNetwork() {\n        // No explicit network was set and this is our first time\n        if (this.#networkPromise == null) {\n            // Detect the current network (shared with all calls)\n            const detectNetwork = (async () => {\n                try {\n                    const network = await this._detectNetwork();\n                    this.emit(\"network\", network, null);\n                    return network;\n                }\n                catch (error) {\n                    if (this.#networkPromise === detectNetwork) {\n                        this.#networkPromise = null;\n                    }\n                    throw error;\n                }\n            })();\n            this.#networkPromise = detectNetwork;\n            return (await detectNetwork).clone();\n        }\n        const networkPromise = this.#networkPromise;\n        const [expected, actual] = await Promise.all([\n            networkPromise,\n            this._detectNetwork() // The actual connected network\n        ]);\n        if (expected.chainId !== actual.chainId) {\n            if (this.#anyNetwork) {\n                // The \"any\" network can change, so notify listeners\n                this.emit(\"network\", actual, expected);\n                // Update the network if something else hasn't already changed it\n                if (this.#networkPromise === networkPromise) {\n                    this.#networkPromise = Promise.resolve(actual);\n                }\n            }\n            else {\n                // Otherwise, we do not allow changes to the underlying network\n                assert(false, `network changed: ${expected.chainId} => ${actual.chainId} `, \"NETWORK_ERROR\", {\n                    event: \"changed\"\n                });\n            }\n        }\n        return expected.clone();\n    }\n    async getFeeData() {\n        const network = await this.getNetwork();\n        const getFeeDataFunc = async () => {\n            const { _block, gasPrice, priorityFee } = await resolveProperties({\n                _block: this.#getBlock(\"latest\", false),\n                gasPrice: ((async () => {\n                    try {\n                        const value = await this.#perform({ method: \"getGasPrice\" });\n                        return getBigInt(value, \"%response\");\n                    }\n                    catch (error) { }\n                    return null;\n                })()),\n                priorityFee: ((async () => {\n                    try {\n                        const value = await this.#perform({ method: \"getPriorityFee\" });\n                        return getBigInt(value, \"%response\");\n                    }\n                    catch (error) { }\n                    return null;\n                })())\n            });\n            let maxFeePerGas = null;\n            let maxPriorityFeePerGas = null;\n            // These are the recommended EIP-1559 heuristics for fee data\n            const block = this._wrapBlock(_block, network);\n            if (block && block.baseFeePerGas) {\n                maxPriorityFeePerGas = (priorityFee != null) ? priorityFee : BigInt(\"1000000000\");\n                maxFeePerGas = (block.baseFeePerGas * BN_2) + maxPriorityFeePerGas;\n            }\n            return new FeeData(gasPrice, maxFeePerGas, maxPriorityFeePerGas);\n        };\n        // Check for a FeeDataNetWorkPlugin\n        const plugin = network.getPlugin(\"org.ethers.plugins.network.FetchUrlFeeDataPlugin\");\n        if (plugin) {\n            const req = new FetchRequest(plugin.url);\n            const feeData = await plugin.processFunc(getFeeDataFunc, this, req);\n            return new FeeData(feeData.gasPrice, feeData.maxFeePerGas, feeData.maxPriorityFeePerGas);\n        }\n        return await getFeeDataFunc();\n    }\n    async estimateGas(_tx) {\n        let tx = this._getTransactionRequest(_tx);\n        if (isPromise(tx)) {\n            tx = await tx;\n        }\n        return getBigInt(await this.#perform({\n            method: \"estimateGas\", transaction: tx\n        }), \"%response\");\n    }\n    async #call(tx, blockTag, attempt) {\n        assert(attempt < MAX_CCIP_REDIRECTS, \"CCIP read exceeded maximum redirections\", \"OFFCHAIN_FAULT\", {\n            reason: \"TOO_MANY_REDIRECTS\",\n            transaction: Object.assign({}, tx, { blockTag, enableCcipRead: true })\n        });\n        // This came in as a PerformActionTransaction, so to/from are safe; we can cast\n        const transaction = copyRequest(tx);\n        try {\n            return hexlify(await this._perform({ method: \"call\", transaction, blockTag }));\n        }\n        catch (error) {\n            // CCIP Read OffchainLookup\n            if (!this.disableCcipRead && isCallException(error) && error.data && attempt >= 0 && blockTag === \"latest\" && transaction.to != null && dataSlice(error.data, 0, 4) === \"0x556f1830\") {\n                const data = error.data;\n                const txSender = await resolveAddress(transaction.to, this);\n                // Parse the CCIP Read Arguments\n                let ccipArgs;\n                try {\n                    ccipArgs = parseOffchainLookup(dataSlice(error.data, 4));\n                }\n                catch (error) {\n                    assert(false, error.message, \"OFFCHAIN_FAULT\", {\n                        reason: \"BAD_DATA\", transaction, info: { data }\n                    });\n                }\n                // Check the sender of the OffchainLookup matches the transaction\n                assert(ccipArgs.sender.toLowerCase() === txSender.toLowerCase(), \"CCIP Read sender mismatch\", \"CALL_EXCEPTION\", {\n                    action: \"call\",\n                    data,\n                    reason: \"OffchainLookup\",\n                    transaction: transaction,\n                    invocation: null,\n                    revert: {\n                        signature: \"OffchainLookup(address,string[],bytes,bytes4,bytes)\",\n                        name: \"OffchainLookup\",\n                        args: ccipArgs.errorArgs\n                    }\n                });\n                const ccipResult = await this.ccipReadFetch(transaction, ccipArgs.calldata, ccipArgs.urls);\n                assert(ccipResult != null, \"CCIP Read failed to fetch data\", \"OFFCHAIN_FAULT\", {\n                    reason: \"FETCH_FAILED\", transaction, info: { data: error.data, errorArgs: ccipArgs.errorArgs }\n                });\n                const tx = {\n                    to: txSender,\n                    data: concat([ccipArgs.selector, encodeBytes([ccipResult, ccipArgs.extraData])])\n                };\n                this.emit(\"debug\", { action: \"sendCcipReadCall\", transaction: tx });\n                try {\n                    const result = await this.#call(tx, blockTag, attempt + 1);\n                    this.emit(\"debug\", { action: \"receiveCcipReadCallResult\", transaction: Object.assign({}, tx), result });\n                    return result;\n                }\n                catch (error) {\n                    this.emit(\"debug\", { action: \"receiveCcipReadCallError\", transaction: Object.assign({}, tx), error });\n                    throw error;\n                }\n            }\n            throw error;\n        }\n    }\n    async #checkNetwork(promise) {\n        const { value } = await resolveProperties({\n            network: this.getNetwork(),\n            value: promise\n        });\n        return value;\n    }\n    async call(_tx) {\n        const { tx, blockTag } = await resolveProperties({\n            tx: this._getTransactionRequest(_tx),\n            blockTag: this._getBlockTag(_tx.blockTag)\n        });\n        return await this.#checkNetwork(this.#call(tx, blockTag, _tx.enableCcipRead ? 0 : -1));\n    }\n    // Account\n    async #getAccountValue(request, _address, _blockTag) {\n        let address = this._getAddress(_address);\n        let blockTag = this._getBlockTag(_blockTag);\n        if (typeof (address) !== \"string\" || typeof (blockTag) !== \"string\") {\n            [address, blockTag] = await Promise.all([address, blockTag]);\n        }\n        return await this.#checkNetwork(this.#perform(Object.assign(request, { address, blockTag })));\n    }\n    async getBalance(address, blockTag) {\n        return getBigInt(await this.#getAccountValue({ method: \"getBalance\" }, address, blockTag), \"%response\");\n    }\n    async getTransactionCount(address, blockTag) {\n        return getNumber(await this.#getAccountValue({ method: \"getTransactionCount\" }, address, blockTag), \"%response\");\n    }\n    async getCode(address, blockTag) {\n        return hexlify(await this.#getAccountValue({ method: \"getCode\" }, address, blockTag));\n    }\n    async getStorage(address, _position, blockTag) {\n        const position = getBigInt(_position, \"position\");\n        return hexlify(await this.#getAccountValue({ method: \"getStorage\", position }, address, blockTag));\n    }\n    // Write\n    async broadcastTransaction(signedTx) {\n        const { blockNumber, hash, network } = await resolveProperties({\n            blockNumber: this.getBlockNumber(),\n            hash: this._perform({\n                method: \"broadcastTransaction\",\n                signedTransaction: signedTx\n            }),\n            network: this.getNetwork()\n        });\n        const tx = Transaction.from(signedTx);\n        if (tx.hash !== hash) {\n            throw new Error(\"@TODO: the returned hash did not match\");\n        }\n        return this._wrapTransactionResponse(tx, network).replaceableTransaction(blockNumber);\n    }\n    async #getBlock(block, includeTransactions) {\n        // @TODO: Add CustomBlockPlugin check\n        if (isHexString(block, 32)) {\n            return await this.#perform({\n                method: \"getBlock\", blockHash: block, includeTransactions\n            });\n        }\n        let blockTag = this._getBlockTag(block);\n        if (typeof (blockTag) !== \"string\") {\n            blockTag = await blockTag;\n        }\n        return await this.#perform({\n            method: \"getBlock\", blockTag, includeTransactions\n        });\n    }\n    // Queries\n    async getBlock(block, prefetchTxs) {\n        const { network, params } = await resolveProperties({\n            network: this.getNetwork(),\n            params: this.#getBlock(block, !!prefetchTxs)\n        });\n        if (params == null) {\n            return null;\n        }\n        return this._wrapBlock(params, network);\n    }\n    async getTransaction(hash) {\n        const { network, params } = await resolveProperties({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getTransaction\", hash })\n        });\n        if (params == null) {\n            return null;\n        }\n        return this._wrapTransactionResponse(params, network);\n    }\n    async getTransactionReceipt(hash) {\n        const { network, params } = await resolveProperties({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getTransactionReceipt\", hash })\n        });\n        if (params == null) {\n            return null;\n        }\n        // Some backends did not backfill the effectiveGasPrice into old transactions\n        // in the receipt, so we look it up manually and inject it.\n        if (params.gasPrice == null && params.effectiveGasPrice == null) {\n            const tx = await this.#perform({ method: \"getTransaction\", hash });\n            if (tx == null) {\n                throw new Error(\"report this; could not find tx or effectiveGasPrice\");\n            }\n            params.effectiveGasPrice = tx.gasPrice;\n        }\n        return this._wrapTransactionReceipt(params, network);\n    }\n    async getTransactionResult(hash) {\n        const { result } = await resolveProperties({\n            network: this.getNetwork(),\n            result: this.#perform({ method: \"getTransactionResult\", hash })\n        });\n        if (result == null) {\n            return null;\n        }\n        return hexlify(result);\n    }\n    // Bloom-filter Queries\n    async getLogs(_filter) {\n        let filter = this._getFilter(_filter);\n        if (isPromise(filter)) {\n            filter = await filter;\n        }\n        const { network, params } = await resolveProperties({\n            network: this.getNetwork(),\n            params: this.#perform({ method: \"getLogs\", filter })\n        });\n        return params.map((p) => this._wrapLog(p, network));\n    }\n    // ENS\n    _getProvider(chainId) {\n        assert(false, \"provider cannot connect to target network\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"_getProvider()\"\n        });\n    }\n    async getResolver(name) {\n        return await EnsResolver.fromName(this, name);\n    }\n    async getAvatar(name) {\n        const resolver = await this.getResolver(name);\n        if (resolver) {\n            return await resolver.getAvatar();\n        }\n        return null;\n    }\n    async resolveName(name) {\n        const resolver = await this.getResolver(name);\n        if (resolver) {\n            return await resolver.getAddress();\n        }\n        return null;\n    }\n    async lookupAddress(address) {\n        address = getAddress(address);\n        const node = namehash(address.substring(2).toLowerCase() + \".addr.reverse\");\n        try {\n            const ensAddr = await EnsResolver.getEnsAddress(this);\n            const ensContract = new Contract(ensAddr, [\n                \"function resolver(bytes32) view returns (address)\"\n            ], this);\n            const resolver = await ensContract.resolver(node);\n            if (resolver == null || resolver === ZeroAddress) {\n                return null;\n            }\n            const resolverContract = new Contract(resolver, [\n                \"function name(bytes32) view returns (string)\"\n            ], this);\n            const name = await resolverContract.name(node);\n            // Failed forward resolution\n            const check = await this.resolveName(name);\n            if (check !== address) {\n                return null;\n            }\n            return name;\n        }\n        catch (error) {\n            // No data was returned from the resolver\n            if (isError(error, \"BAD_DATA\") && error.value === \"0x\") {\n                return null;\n            }\n            // Something reerted\n            if (isError(error, \"CALL_EXCEPTION\")) {\n                return null;\n            }\n            throw error;\n        }\n        return null;\n    }\n    async waitForTransaction(hash, _confirms, timeout) {\n        const confirms = (_confirms != null) ? _confirms : 1;\n        if (confirms === 0) {\n            return this.getTransactionReceipt(hash);\n        }\n        return new Promise(async (resolve, reject) => {\n            let timer = null;\n            const listener = (async (blockNumber) => {\n                try {\n                    const receipt = await this.getTransactionReceipt(hash);\n                    if (receipt != null) {\n                        if (blockNumber - receipt.blockNumber + 1 >= confirms) {\n                            resolve(receipt);\n                            //this.off(\"block\", listener);\n                            if (timer) {\n                                clearTimeout(timer);\n                                timer = null;\n                            }\n                            return;\n                        }\n                    }\n                }\n                catch (error) {\n                    console.log(\"EEE\", error);\n                }\n                this.once(\"block\", listener);\n            });\n            if (timeout != null) {\n                timer = setTimeout(() => {\n                    if (timer == null) {\n                        return;\n                    }\n                    timer = null;\n                    this.off(\"block\", listener);\n                    reject(makeError(\"timeout\", \"TIMEOUT\", { reason: \"timeout\" }));\n                }, timeout);\n            }\n            listener(await this.getBlockNumber());\n        });\n    }\n    async waitForBlock(blockTag) {\n        assert(false, \"not implemented yet\", \"NOT_IMPLEMENTED\", {\n            operation: \"waitForBlock\"\n        });\n    }\n    /**\n     *  Clear a timer created using the [[_setTimeout]] method.\n     */\n    _clearTimeout(timerId) {\n        const timer = this.#timers.get(timerId);\n        if (!timer) {\n            return;\n        }\n        if (timer.timer) {\n            clearTimeout(timer.timer);\n        }\n        this.#timers.delete(timerId);\n    }\n    /**\n     *  Create a timer that will execute %%func%% after at least %%timeout%%\n     *  (in ms). If %%timeout%% is unspecified, then %%func%% will execute\n     *  in the next event loop.\n     *\n     *  [Pausing](AbstractProvider-paused) the provider will pause any\n     *  associated timers.\n     */\n    _setTimeout(_func, timeout) {\n        if (timeout == null) {\n            timeout = 0;\n        }\n        const timerId = this.#nextTimer++;\n        const func = () => {\n            this.#timers.delete(timerId);\n            _func();\n        };\n        if (this.paused) {\n            this.#timers.set(timerId, { timer: null, func, time: timeout });\n        }\n        else {\n            const timer = setTimeout(func, timeout);\n            this.#timers.set(timerId, { timer, func, time: getTime() });\n        }\n        return timerId;\n    }\n    /**\n     *  Perform %%func%% on each subscriber.\n     */\n    _forEachSubscriber(func) {\n        for (const sub of this.#subs.values()) {\n            func(sub.subscriber);\n        }\n    }\n    /**\n     *  Sub-classes may override this to customize subscription\n     *  implementations.\n     */\n    _getSubscriber(sub) {\n        switch (sub.type) {\n            case \"debug\":\n            case \"error\":\n            case \"network\":\n                return new UnmanagedSubscriber(sub.type);\n            case \"block\": {\n                const subscriber = new PollingBlockSubscriber(this);\n                subscriber.pollingInterval = this.pollingInterval;\n                return subscriber;\n            }\n            case \"safe\":\n            case \"finalized\":\n                return new PollingBlockTagSubscriber(this, sub.type);\n            case \"event\":\n                return new PollingEventSubscriber(this, sub.filter);\n            case \"transaction\":\n                return new PollingTransactionSubscriber(this, sub.hash);\n            case \"orphan\":\n                return new PollingOrphanSubscriber(this, sub.filter);\n        }\n        throw new Error(`unsupported event: ${sub.type}`);\n    }\n    /**\n     *  If a [[Subscriber]] fails and needs to replace itself, this\n     *  method may be used.\n     *\n     *  For example, this is used for providers when using the\n     *  ``eth_getFilterChanges`` method, which can return null if state\n     *  filters are not supported by the backend, allowing the Subscriber\n     *  to swap in a [[PollingEventSubscriber]].\n     */\n    _recoverSubscriber(oldSub, newSub) {\n        for (const sub of this.#subs.values()) {\n            if (sub.subscriber === oldSub) {\n                if (sub.started) {\n                    sub.subscriber.stop();\n                }\n                sub.subscriber = newSub;\n                if (sub.started) {\n                    newSub.start();\n                }\n                if (this.#pausedState != null) {\n                    newSub.pause(this.#pausedState);\n                }\n                break;\n            }\n        }\n    }\n    async #hasSub(event, emitArgs) {\n        let sub = await getSubscription(event, this);\n        // This is a log that is removing an existing log; we actually want\n        // to emit an orphan event for the removed log\n        if (sub.type === \"event\" && emitArgs && emitArgs.length > 0 && emitArgs[0].removed === true) {\n            sub = await getSubscription({ orphan: \"drop-log\", log: emitArgs[0] }, this);\n        }\n        return this.#subs.get(sub.tag) || null;\n    }\n    async #getSub(event) {\n        const subscription = await getSubscription(event, this);\n        // Prevent tampering with our tag in any subclass' _getSubscriber\n        const tag = subscription.tag;\n        let sub = this.#subs.get(tag);\n        if (!sub) {\n            const subscriber = this._getSubscriber(subscription);\n            const addressableMap = new WeakMap();\n            const nameMap = new Map();\n            sub = { subscriber, tag, addressableMap, nameMap, started: false, listeners: [] };\n            this.#subs.set(tag, sub);\n        }\n        return sub;\n    }\n    async on(event, listener) {\n        const sub = await this.#getSub(event);\n        sub.listeners.push({ listener, once: false });\n        if (!sub.started) {\n            sub.subscriber.start();\n            sub.started = true;\n            if (this.#pausedState != null) {\n                sub.subscriber.pause(this.#pausedState);\n            }\n        }\n        return this;\n    }\n    async once(event, listener) {\n        const sub = await this.#getSub(event);\n        sub.listeners.push({ listener, once: true });\n        if (!sub.started) {\n            sub.subscriber.start();\n            sub.started = true;\n            if (this.#pausedState != null) {\n                sub.subscriber.pause(this.#pausedState);\n            }\n        }\n        return this;\n    }\n    async emit(event, ...args) {\n        const sub = await this.#hasSub(event, args);\n        // If there is not subscription or if a recent emit removed\n        // the last of them (which also deleted the sub) do nothing\n        if (!sub || sub.listeners.length === 0) {\n            return false;\n        }\n        ;\n        const count = sub.listeners.length;\n        sub.listeners = sub.listeners.filter(({ listener, once }) => {\n            const payload = new EventPayload(this, (once ? null : listener), event);\n            try {\n                listener.call(this, ...args, payload);\n            }\n            catch (error) { }\n            return !once;\n        });\n        if (sub.listeners.length === 0) {\n            if (sub.started) {\n                sub.subscriber.stop();\n            }\n            this.#subs.delete(sub.tag);\n        }\n        return (count > 0);\n    }\n    async listenerCount(event) {\n        if (event) {\n            const sub = await this.#hasSub(event);\n            if (!sub) {\n                return 0;\n            }\n            return sub.listeners.length;\n        }\n        let total = 0;\n        for (const { listeners } of this.#subs.values()) {\n            total += listeners.length;\n        }\n        return total;\n    }\n    async listeners(event) {\n        if (event) {\n            const sub = await this.#hasSub(event);\n            if (!sub) {\n                return [];\n            }\n            return sub.listeners.map(({ listener }) => listener);\n        }\n        let result = [];\n        for (const { listeners } of this.#subs.values()) {\n            result = result.concat(listeners.map(({ listener }) => listener));\n        }\n        return result;\n    }\n    async off(event, listener) {\n        const sub = await this.#hasSub(event);\n        if (!sub) {\n            return this;\n        }\n        if (listener) {\n            const index = sub.listeners.map(({ listener }) => listener).indexOf(listener);\n            if (index >= 0) {\n                sub.listeners.splice(index, 1);\n            }\n        }\n        if (!listener || sub.listeners.length === 0) {\n            if (sub.started) {\n                sub.subscriber.stop();\n            }\n            this.#subs.delete(sub.tag);\n        }\n        return this;\n    }\n    async removeAllListeners(event) {\n        if (event) {\n            const { tag, started, subscriber } = await this.#getSub(event);\n            if (started) {\n                subscriber.stop();\n            }\n            this.#subs.delete(tag);\n        }\n        else {\n            for (const [tag, { started, subscriber }] of this.#subs) {\n                if (started) {\n                    subscriber.stop();\n                }\n                this.#subs.delete(tag);\n            }\n        }\n        return this;\n    }\n    // Alias for \"on\"\n    async addListener(event, listener) {\n        return await this.on(event, listener);\n    }\n    // Alias for \"off\"\n    async removeListener(event, listener) {\n        return this.off(event, listener);\n    }\n    /**\n     *  If this provider has been destroyed using the [[destroy]] method.\n     *\n     *  Once destroyed, all resources are reclaimed, internal event loops\n     *  and timers are cleaned up and no further requests may be sent to\n     *  the provider.\n     */\n    get destroyed() {\n        return this.#destroyed;\n    }\n    /**\n     *  Sub-classes may use this to shutdown any sockets or release their\n     *  resources and reject any pending requests.\n     *\n     *  Sub-classes **must** call ``super.destroy()``.\n     */\n    destroy() {\n        // Stop all listeners\n        this.removeAllListeners();\n        // Shut down all tiemrs\n        for (const timerId of this.#timers.keys()) {\n            this._clearTimeout(timerId);\n        }\n        this.#destroyed = true;\n    }\n    /**\n     *  Whether the provider is currently paused.\n     *\n     *  A paused provider will not emit any events, and generally should\n     *  not make any requests to the network, but that is up to sub-classes\n     *  to manage.\n     *\n     *  Setting ``paused = true`` is identical to calling ``.pause(false)``,\n     *  which will buffer any events that occur while paused until the\n     *  provider is unpaused.\n     */\n    get paused() { return (this.#pausedState != null); }\n    set paused(pause) {\n        if (!!pause === this.paused) {\n            return;\n        }\n        if (this.paused) {\n            this.resume();\n        }\n        else {\n            this.pause(false);\n        }\n    }\n    /**\n     *  Pause the provider. If %%dropWhilePaused%%, any events that occur\n     *  while paused are dropped, otherwise all events will be emitted once\n     *  the provider is unpaused.\n     */\n    pause(dropWhilePaused) {\n        this.#lastBlockNumber = -1;\n        if (this.#pausedState != null) {\n            if (this.#pausedState == !!dropWhilePaused) {\n                return;\n            }\n            assert(false, \"cannot change pause type; resume first\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"pause\"\n            });\n        }\n        this._forEachSubscriber((s) => s.pause(dropWhilePaused));\n        this.#pausedState = !!dropWhilePaused;\n        for (const timer of this.#timers.values()) {\n            // Clear the timer\n            if (timer.timer) {\n                clearTimeout(timer.timer);\n            }\n            // Remaining time needed for when we become unpaused\n            timer.time = getTime() - timer.time;\n        }\n    }\n    /**\n     *  Resume the provider.\n     */\n    resume() {\n        if (this.#pausedState == null) {\n            return;\n        }\n        this._forEachSubscriber((s) => s.resume());\n        this.#pausedState = null;\n        for (const timer of this.#timers.values()) {\n            // Remaining time when we were paused\n            let timeout = timer.time;\n            if (timeout < 0) {\n                timeout = 0;\n            }\n            // Start time (in cause paused, so we con compute remaininf time)\n            timer.time = getTime();\n            // Start the timer\n            setTimeout(timer.func, timeout);\n        }\n    }\n}\nfunction _parseString(result, start) {\n    try {\n        const bytes = _parseBytes(result, start);\n        if (bytes) {\n            return toUtf8String(bytes);\n        }\n    }\n    catch (error) { }\n    return null;\n}\nfunction _parseBytes(result, start) {\n    if (result === \"0x\") {\n        return null;\n    }\n    try {\n        const offset = getNumber(dataSlice(result, start, start + 32));\n        const length = getNumber(dataSlice(result, offset, offset + 32));\n        return dataSlice(result, offset + 32, offset + 32 + length);\n    }\n    catch (error) { }\n    return null;\n}\nfunction numPad(value) {\n    const result = toBeArray(value);\n    if (result.length > 32) {\n        throw new Error(\"internal; should not happen\");\n    }\n    const padded = new Uint8Array(32);\n    padded.set(result, 32 - result.length);\n    return padded;\n}\nfunction bytesPad(value) {\n    if ((value.length % 32) === 0) {\n        return value;\n    }\n    const result = new Uint8Array(Math.ceil(value.length / 32) * 32);\n    result.set(value);\n    return result;\n}\nconst empty = new Uint8Array([]);\n// ABI Encodes a series of (bytes, bytes, ...)\nfunction encodeBytes(datas) {\n    const result = [];\n    let byteCount = 0;\n    // Add place-holders for pointers as we add items\n    for (let i = 0; i < datas.length; i++) {\n        result.push(empty);\n        byteCount += 32;\n    }\n    for (let i = 0; i < datas.length; i++) {\n        const data = getBytes(datas[i]);\n        // Update the bytes offset\n        result[i] = numPad(byteCount);\n        // The length and padded value of data\n        result.push(numPad(data.length));\n        result.push(bytesPad(data));\n        byteCount += 32 + Math.ceil(data.length / 32) * 32;\n    }\n    return concat(result);\n}\nconst zeros = \"0x0000000000000000000000000000000000000000000000000000000000000000\";\nfunction parseOffchainLookup(data) {\n    const result = {\n        sender: \"\", urls: [], calldata: \"\", selector: \"\", extraData: \"\", errorArgs: []\n    };\n    assert(dataLength(data) >= 5 * 32, \"insufficient OffchainLookup data\", \"OFFCHAIN_FAULT\", {\n        reason: \"insufficient OffchainLookup data\"\n    });\n    const sender = dataSlice(data, 0, 32);\n    assert(dataSlice(sender, 0, 12) === dataSlice(zeros, 0, 12), \"corrupt OffchainLookup sender\", \"OFFCHAIN_FAULT\", {\n        reason: \"corrupt OffchainLookup sender\"\n    });\n    result.sender = dataSlice(sender, 12);\n    // Read the URLs from the response\n    try {\n        const urls = [];\n        const urlsOffset = getNumber(dataSlice(data, 32, 64));\n        const urlsLength = getNumber(dataSlice(data, urlsOffset, urlsOffset + 32));\n        const urlsData = dataSlice(data, urlsOffset + 32);\n        for (let u = 0; u < urlsLength; u++) {\n            const url = _parseString(urlsData, u * 32);\n            if (url == null) {\n                throw new Error(\"abort\");\n            }\n            urls.push(url);\n        }\n        result.urls = urls;\n    }\n    catch (error) {\n        assert(false, \"corrupt OffchainLookup urls\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup urls\"\n        });\n    }\n    // Get the CCIP calldata to forward\n    try {\n        const calldata = _parseBytes(data, 64);\n        if (calldata == null) {\n            throw new Error(\"abort\");\n        }\n        result.calldata = calldata;\n    }\n    catch (error) {\n        assert(false, \"corrupt OffchainLookup calldata\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup calldata\"\n        });\n    }\n    // Get the callbackSelector (bytes4)\n    assert(dataSlice(data, 100, 128) === dataSlice(zeros, 0, 28), \"corrupt OffchainLookup callbaackSelector\", \"OFFCHAIN_FAULT\", {\n        reason: \"corrupt OffchainLookup callbaackSelector\"\n    });\n    result.selector = dataSlice(data, 96, 100);\n    // Get the extra data to send back to the contract as context\n    try {\n        const extraData = _parseBytes(data, 128);\n        if (extraData == null) {\n            throw new Error(\"abort\");\n        }\n        result.extraData = extraData;\n    }\n    catch (error) {\n        assert(false, \"corrupt OffchainLookup extraData\", \"OFFCHAIN_FAULT\", {\n            reason: \"corrupt OffchainLookup extraData\"\n        });\n    }\n    result.errorArgs = \"sender,urls,calldata,selector,extraData\".split(/,/).map((k) => result[k]);\n    return result;\n}\n//# sourceMappingURL=abstract-provider.js.map","/**\n *  Generally the [[Wallet]] and [[JsonRpcSigner]] and their sub-classes\n *  are sufficent for most developers, but this is provided to\n *  fascilitate more complex Signers.\n *\n *  @_section: api/providers/abstract-signer: Subclassing Signer [abstract-signer]\n */\nimport { resolveAddress } from \"../address/index.js\";\nimport { Transaction } from \"../transaction/index.js\";\nimport { defineProperties, getBigInt, resolveProperties, assert, assertArgument } from \"../utils/index.js\";\nimport { copyRequest } from \"./provider.js\";\nfunction checkProvider(signer, operation) {\n    if (signer.provider) {\n        return signer.provider;\n    }\n    assert(false, \"missing provider\", \"UNSUPPORTED_OPERATION\", { operation });\n}\nasync function populate(signer, tx) {\n    let pop = copyRequest(tx);\n    if (pop.to != null) {\n        pop.to = resolveAddress(pop.to, signer);\n    }\n    if (pop.from != null) {\n        const from = pop.from;\n        pop.from = Promise.all([\n            signer.getAddress(),\n            resolveAddress(from, signer)\n        ]).then(([address, from]) => {\n            assertArgument(address.toLowerCase() === from.toLowerCase(), \"transaction from mismatch\", \"tx.from\", from);\n            return address;\n        });\n    }\n    else {\n        pop.from = signer.getAddress();\n    }\n    return await resolveProperties(pop);\n}\n/**\n *  An **AbstractSigner** includes most of teh functionality required\n *  to get a [[Signer]] working as expected, but requires a few\n *  Signer-specific methods be overridden.\n *\n */\nexport class AbstractSigner {\n    /**\n     *  The provider this signer is connected to.\n     */\n    provider;\n    /**\n     *  Creates a new Signer connected to %%provider%%.\n     */\n    constructor(provider) {\n        defineProperties(this, { provider: (provider || null) });\n    }\n    async getNonce(blockTag) {\n        return checkProvider(this, \"getTransactionCount\").getTransactionCount(await this.getAddress(), blockTag);\n    }\n    async populateCall(tx) {\n        const pop = await populate(this, tx);\n        return pop;\n    }\n    async populateTransaction(tx) {\n        const provider = checkProvider(this, \"populateTransaction\");\n        const pop = await populate(this, tx);\n        if (pop.nonce == null) {\n            pop.nonce = await this.getNonce(\"pending\");\n        }\n        if (pop.gasLimit == null) {\n            pop.gasLimit = await this.estimateGas(pop);\n        }\n        // Populate the chain ID\n        const network = await (this.provider).getNetwork();\n        if (pop.chainId != null) {\n            const chainId = getBigInt(pop.chainId);\n            assertArgument(chainId === network.chainId, \"transaction chainId mismatch\", \"tx.chainId\", tx.chainId);\n        }\n        else {\n            pop.chainId = network.chainId;\n        }\n        // Do not allow mixing pre-eip-1559 and eip-1559 properties\n        const hasEip1559 = (pop.maxFeePerGas != null || pop.maxPriorityFeePerGas != null);\n        if (pop.gasPrice != null && (pop.type === 2 || hasEip1559)) {\n            assertArgument(false, \"eip-1559 transaction do not support gasPrice\", \"tx\", tx);\n        }\n        else if ((pop.type === 0 || pop.type === 1) && hasEip1559) {\n            assertArgument(false, \"pre-eip-1559 transaction do not support maxFeePerGas/maxPriorityFeePerGas\", \"tx\", tx);\n        }\n        if ((pop.type === 2 || pop.type == null) && (pop.maxFeePerGas != null && pop.maxPriorityFeePerGas != null)) {\n            // Fully-formed EIP-1559 transaction (skip getFeeData)\n            pop.type = 2;\n        }\n        else if (pop.type === 0 || pop.type === 1) {\n            // Explicit Legacy or EIP-2930 transaction\n            // We need to get fee data to determine things\n            const feeData = await provider.getFeeData();\n            assert(feeData.gasPrice != null, \"network does not support gasPrice\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"getGasPrice\"\n            });\n            // Populate missing gasPrice\n            if (pop.gasPrice == null) {\n                pop.gasPrice = feeData.gasPrice;\n            }\n        }\n        else {\n            // We need to get fee data to determine things\n            const feeData = await provider.getFeeData();\n            if (pop.type == null) {\n                // We need to auto-detect the intended type of this transaction...\n                if (feeData.maxFeePerGas != null && feeData.maxPriorityFeePerGas != null) {\n                    // The network supports EIP-1559!\n                    // Upgrade transaction from null to eip-1559\n                    pop.type = 2;\n                    if (pop.gasPrice != null) {\n                        // Using legacy gasPrice property on an eip-1559 network,\n                        // so use gasPrice as both fee properties\n                        const gasPrice = pop.gasPrice;\n                        delete pop.gasPrice;\n                        pop.maxFeePerGas = gasPrice;\n                        pop.maxPriorityFeePerGas = gasPrice;\n                    }\n                    else {\n                        // Populate missing fee data\n                        if (pop.maxFeePerGas == null) {\n                            pop.maxFeePerGas = feeData.maxFeePerGas;\n                        }\n                        if (pop.maxPriorityFeePerGas == null) {\n                            pop.maxPriorityFeePerGas = feeData.maxPriorityFeePerGas;\n                        }\n                    }\n                }\n                else if (feeData.gasPrice != null) {\n                    // Network doesn't support EIP-1559...\n                    // ...but they are trying to use EIP-1559 properties\n                    assert(!hasEip1559, \"network does not support EIP-1559\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"populateTransaction\"\n                    });\n                    // Populate missing fee data\n                    if (pop.gasPrice == null) {\n                        pop.gasPrice = feeData.gasPrice;\n                    }\n                    // Explicitly set untyped transaction to legacy\n                    // @TODO: Maybe this shold allow type 1?\n                    pop.type = 0;\n                }\n                else {\n                    // getFeeData has failed us.\n                    assert(false, \"failed to get consistent fee data\", \"UNSUPPORTED_OPERATION\", {\n                        operation: \"signer.getFeeData\"\n                    });\n                }\n            }\n            else if (pop.type === 2 || pop.type === 3) {\n                // Explicitly using EIP-1559 or EIP-4844\n                // Populate missing fee data\n                if (pop.maxFeePerGas == null) {\n                    pop.maxFeePerGas = feeData.maxFeePerGas;\n                }\n                if (pop.maxPriorityFeePerGas == null) {\n                    pop.maxPriorityFeePerGas = feeData.maxPriorityFeePerGas;\n                }\n            }\n        }\n        //@TOOD: Don't await all over the place; save them up for\n        // the end for better batching\n        return await resolveProperties(pop);\n    }\n    async estimateGas(tx) {\n        return checkProvider(this, \"estimateGas\").estimateGas(await this.populateCall(tx));\n    }\n    async call(tx) {\n        return checkProvider(this, \"call\").call(await this.populateCall(tx));\n    }\n    async resolveName(name) {\n        const provider = checkProvider(this, \"resolveName\");\n        return await provider.resolveName(name);\n    }\n    async sendTransaction(tx) {\n        const provider = checkProvider(this, \"sendTransaction\");\n        const pop = await this.populateTransaction(tx);\n        delete pop.from;\n        const txObj = Transaction.from(pop);\n        return await provider.broadcastTransaction(await this.signTransaction(txObj));\n    }\n}\n/**\n *  A **VoidSigner** is a class deisgned to allow an address to be used\n *  in any API which accepts a Signer, but for which there are no\n *  credentials available to perform any actual signing.\n *\n *  This for example allow impersonating an account for the purpose of\n *  static calls or estimating gas, but does not allow sending transactions.\n */\nexport class VoidSigner extends AbstractSigner {\n    /**\n     *  The signer address.\n     */\n    address;\n    /**\n     *  Creates a new **VoidSigner** with %%address%% attached to\n     *  %%provider%%.\n     */\n    constructor(address, provider) {\n        super(provider);\n        defineProperties(this, { address });\n    }\n    async getAddress() { return this.address; }\n    connect(provider) {\n        return new VoidSigner(this.address, provider);\n    }\n    #throwUnsupported(suffix, operation) {\n        assert(false, `VoidSigner cannot sign ${suffix}`, \"UNSUPPORTED_OPERATION\", { operation });\n    }\n    async signTransaction(tx) {\n        this.#throwUnsupported(\"transactions\", \"signTransaction\");\n    }\n    async signMessage(message) {\n        this.#throwUnsupported(\"messages\", \"signMessage\");\n    }\n    async signTypedData(domain, types, value) {\n        this.#throwUnsupported(\"typed-data\", \"signTypedData\");\n    }\n}\n//# sourceMappingURL=abstract-signer.js.map","import { isError } from \"../utils/index.js\";\nimport { PollingEventSubscriber } from \"./subscriber-polling.js\";\nfunction copy(obj) {\n    return JSON.parse(JSON.stringify(obj));\n}\n/**\n *  Some backends support subscribing to events using a Filter ID.\n *\n *  When subscribing with this technique, the node issues a unique\n *  //Filter ID//. At this point the node dedicates resources to\n *  the filter, so that periodic calls to follow up on the //Filter ID//\n *  will receive any events since the last call.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class FilterIdSubscriber {\n    #provider;\n    #filterIdPromise;\n    #poller;\n    #running;\n    #network;\n    #hault;\n    /**\n     *  Creates a new **FilterIdSubscriber** which will used [[_subscribe]]\n     *  and [[_emitResults]] to setup the subscription and provide the event\n     *  to the %%provider%%.\n     */\n    constructor(provider) {\n        this.#provider = provider;\n        this.#filterIdPromise = null;\n        this.#poller = this.#poll.bind(this);\n        this.#running = false;\n        this.#network = null;\n        this.#hault = false;\n    }\n    /**\n     *  Sub-classes **must** override this to begin the subscription.\n     */\n    _subscribe(provider) {\n        throw new Error(\"subclasses must override this\");\n    }\n    /**\n     *  Sub-classes **must** override this handle the events.\n     */\n    _emitResults(provider, result) {\n        throw new Error(\"subclasses must override this\");\n    }\n    /**\n     *  Sub-classes **must** override this handle recovery on errors.\n     */\n    _recover(provider) {\n        throw new Error(\"subclasses must override this\");\n    }\n    async #poll(blockNumber) {\n        try {\n            // Subscribe if necessary\n            if (this.#filterIdPromise == null) {\n                this.#filterIdPromise = this._subscribe(this.#provider);\n            }\n            // Get the Filter ID\n            let filterId = null;\n            try {\n                filterId = await this.#filterIdPromise;\n            }\n            catch (error) {\n                if (!isError(error, \"UNSUPPORTED_OPERATION\") || error.operation !== \"eth_newFilter\") {\n                    throw error;\n                }\n            }\n            // The backend does not support Filter ID; downgrade to\n            // polling\n            if (filterId == null) {\n                this.#filterIdPromise = null;\n                this.#provider._recoverSubscriber(this, this._recover(this.#provider));\n                return;\n            }\n            const network = await this.#provider.getNetwork();\n            if (!this.#network) {\n                this.#network = network;\n            }\n            if (this.#network.chainId !== network.chainId) {\n                throw new Error(\"chaid changed\");\n            }\n            if (this.#hault) {\n                return;\n            }\n            const result = await this.#provider.send(\"eth_getFilterChanges\", [filterId]);\n            await this._emitResults(this.#provider, result);\n        }\n        catch (error) {\n            console.log(\"@TODO\", error);\n        }\n        this.#provider.once(\"block\", this.#poller);\n    }\n    #teardown() {\n        const filterIdPromise = this.#filterIdPromise;\n        if (filterIdPromise) {\n            this.#filterIdPromise = null;\n            filterIdPromise.then((filterId) => {\n                if (this.#provider.destroyed) {\n                    return;\n                }\n                this.#provider.send(\"eth_uninstallFilter\", [filterId]);\n            });\n        }\n    }\n    start() {\n        if (this.#running) {\n            return;\n        }\n        this.#running = true;\n        this.#poll(-2);\n    }\n    stop() {\n        if (!this.#running) {\n            return;\n        }\n        this.#running = false;\n        this.#hault = true;\n        this.#teardown();\n        this.#provider.off(\"block\", this.#poller);\n    }\n    pause(dropWhilePaused) {\n        if (dropWhilePaused) {\n            this.#teardown();\n        }\n        this.#provider.off(\"block\", this.#poller);\n    }\n    resume() { this.start(); }\n}\n/**\n *  A **FilterIdSubscriber** for receiving contract events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class FilterIdEventSubscriber extends FilterIdSubscriber {\n    #event;\n    /**\n     *  Creates a new **FilterIdEventSubscriber** attached to %%provider%%\n     *  listening for %%filter%%.\n     */\n    constructor(provider, filter) {\n        super(provider);\n        this.#event = copy(filter);\n    }\n    _recover(provider) {\n        return new PollingEventSubscriber(provider, this.#event);\n    }\n    async _subscribe(provider) {\n        const filterId = await provider.send(\"eth_newFilter\", [this.#event]);\n        return filterId;\n    }\n    async _emitResults(provider, results) {\n        for (const result of results) {\n            provider.emit(this.#event, provider._wrapLog(result, provider._network));\n        }\n    }\n}\n/**\n *  A **FilterIdSubscriber** for receiving pending transactions events.\n *\n *  @_docloc: api/providers/abstract-provider\n */\nexport class FilterIdPendingSubscriber extends FilterIdSubscriber {\n    async _subscribe(provider) {\n        return await provider.send(\"eth_newPendingTransactionFilter\", []);\n    }\n    async _emitResults(provider, results) {\n        for (const result of results) {\n            provider.emit(\"pending\", result);\n        }\n    }\n}\n//# sourceMappingURL=subscriber-filterid.js.map","/**\n *  One of the most common ways to interact with the blockchain is\n *  by a node running a JSON-RPC interface which can be connected to,\n *  based on the transport, using:\n *\n *  - HTTP or HTTPS - [[JsonRpcProvider]]\n *  - WebSocket - [[WebSocketProvider]]\n *  - IPC - [[IpcSocketProvider]]\n *\n * @_section: api/providers/jsonrpc:JSON-RPC Provider  [about-jsonrpcProvider]\n */\n// @TODO:\n// - Add the batching API\n// https://playground.open-rpc.org/?schemaUrl=https://raw.githubusercontent.com/ethereum/eth1.0-apis/assembled-spec/openrpc.json&uiSchema%5BappBar%5D%5Bui:splitView%5D=true&uiSchema%5BappBar%5D%5Bui:input%5D=false&uiSchema%5BappBar%5D%5Bui:examplesDropdown%5D=false\nimport { AbiCoder } from \"../abi/index.js\";\nimport { getAddress, resolveAddress } from \"../address/index.js\";\nimport { TypedDataEncoder } from \"../hash/index.js\";\nimport { accessListify } from \"../transaction/index.js\";\nimport { defineProperties, getBigInt, hexlify, isHexString, toQuantity, toUtf8Bytes, isError, makeError, assert, assertArgument, FetchRequest, resolveProperties } from \"../utils/index.js\";\nimport { AbstractProvider, UnmanagedSubscriber } from \"./abstract-provider.js\";\nimport { AbstractSigner } from \"./abstract-signer.js\";\nimport { Network } from \"./network.js\";\nimport { FilterIdEventSubscriber, FilterIdPendingSubscriber } from \"./subscriber-filterid.js\";\nimport { PollingEventSubscriber } from \"./subscriber-polling.js\";\nconst Primitive = \"bigint,boolean,function,number,string,symbol\".split(/,/g);\n//const Methods = \"getAddress,then\".split(/,/g);\nfunction deepCopy(value) {\n    if (value == null || Primitive.indexOf(typeof (value)) >= 0) {\n        return value;\n    }\n    // Keep any Addressable\n    if (typeof (value.getAddress) === \"function\") {\n        return value;\n    }\n    if (Array.isArray(value)) {\n        return (value.map(deepCopy));\n    }\n    if (typeof (value) === \"object\") {\n        return Object.keys(value).reduce((accum, key) => {\n            accum[key] = value[key];\n            return accum;\n        }, {});\n    }\n    throw new Error(`should not happen: ${value} (${typeof (value)})`);\n}\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(resolve, duration); });\n}\nfunction getLowerCase(value) {\n    if (value) {\n        return value.toLowerCase();\n    }\n    return value;\n}\nfunction isPollable(value) {\n    return (value && typeof (value.pollingInterval) === \"number\");\n}\nconst defaultOptions = {\n    polling: false,\n    staticNetwork: null,\n    batchStallTime: 10,\n    batchMaxSize: (1 << 20),\n    batchMaxCount: 100,\n    cacheTimeout: 250,\n    pollingInterval: 4000\n};\n// @TODO: Unchecked Signers\nexport class JsonRpcSigner extends AbstractSigner {\n    address;\n    constructor(provider, address) {\n        super(provider);\n        address = getAddress(address);\n        defineProperties(this, { address });\n    }\n    connect(provider) {\n        assert(false, \"cannot reconnect JsonRpcSigner\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"signer.connect\"\n        });\n    }\n    async getAddress() {\n        return this.address;\n    }\n    // JSON-RPC will automatially fill in nonce, etc. so we just check from\n    async populateTransaction(tx) {\n        return await this.populateCall(tx);\n    }\n    // Returns just the hash of the transaction after sent, which is what\n    // the bare JSON-RPC API does;\n    async sendUncheckedTransaction(_tx) {\n        const tx = deepCopy(_tx);\n        const promises = [];\n        // Make sure the from matches the sender\n        if (tx.from) {\n            const _from = tx.from;\n            promises.push((async () => {\n                const from = await resolveAddress(_from, this.provider);\n                assertArgument(from != null && from.toLowerCase() === this.address.toLowerCase(), \"from address mismatch\", \"transaction\", _tx);\n                tx.from = from;\n            })());\n        }\n        else {\n            tx.from = this.address;\n        }\n        // The JSON-RPC for eth_sendTransaction uses 90000 gas; if the user\n        // wishes to use this, it is easy to specify explicitly, otherwise\n        // we look it up for them.\n        if (tx.gasLimit == null) {\n            promises.push((async () => {\n                tx.gasLimit = await this.provider.estimateGas({ ...tx, from: this.address });\n            })());\n        }\n        // The address may be an ENS name or Addressable\n        if (tx.to != null) {\n            const _to = tx.to;\n            promises.push((async () => {\n                tx.to = await resolveAddress(_to, this.provider);\n            })());\n        }\n        // Wait until all of our properties are filled in\n        if (promises.length) {\n            await Promise.all(promises);\n        }\n        const hexTx = this.provider.getRpcTransaction(tx);\n        return this.provider.send(\"eth_sendTransaction\", [hexTx]);\n    }\n    async sendTransaction(tx) {\n        // This cannot be mined any earlier than any recent block\n        const blockNumber = await this.provider.getBlockNumber();\n        // Send the transaction\n        const hash = await this.sendUncheckedTransaction(tx);\n        // Unfortunately, JSON-RPC only provides and opaque transaction hash\n        // for a response, and we need the actual transaction, so we poll\n        // for it; it should show up very quickly\n        return await (new Promise((resolve, reject) => {\n            const timeouts = [1000, 100];\n            let invalids = 0;\n            const checkTx = async () => {\n                try {\n                    // Try getting the transaction\n                    const tx = await this.provider.getTransaction(hash);\n                    if (tx != null) {\n                        resolve(tx.replaceableTransaction(blockNumber));\n                        return;\n                    }\n                }\n                catch (error) {\n                    // If we were cancelled: stop polling.\n                    // If the data is bad: the node returns bad transactions\n                    // If the network changed: calling again will also fail\n                    // If unsupported: likely destroyed\n                    if (isError(error, \"CANCELLED\") || isError(error, \"BAD_DATA\") ||\n                        isError(error, \"NETWORK_ERROR\") || isError(error, \"UNSUPPORTED_OPERATION\")) {\n                        if (error.info == null) {\n                            error.info = {};\n                        }\n                        error.info.sendTransactionHash = hash;\n                        reject(error);\n                        return;\n                    }\n                    // Stop-gap for misbehaving backends; see #4513\n                    if (isError(error, \"INVALID_ARGUMENT\")) {\n                        invalids++;\n                        if (error.info == null) {\n                            error.info = {};\n                        }\n                        error.info.sendTransactionHash = hash;\n                        if (invalids > 10) {\n                            reject(error);\n                            return;\n                        }\n                    }\n                    // Notify anyone that cares; but we will try again, since\n                    // it is likely an intermittent service error\n                    this.provider.emit(\"error\", makeError(\"failed to fetch transation after sending (will try again)\", \"UNKNOWN_ERROR\", { error }));\n                }\n                // Wait another 4 seconds\n                this.provider._setTimeout(() => { checkTx(); }, timeouts.pop() || 4000);\n            };\n            checkTx();\n        }));\n    }\n    async signTransaction(_tx) {\n        const tx = deepCopy(_tx);\n        // Make sure the from matches the sender\n        if (tx.from) {\n            const from = await resolveAddress(tx.from, this.provider);\n            assertArgument(from != null && from.toLowerCase() === this.address.toLowerCase(), \"from address mismatch\", \"transaction\", _tx);\n            tx.from = from;\n        }\n        else {\n            tx.from = this.address;\n        }\n        const hexTx = this.provider.getRpcTransaction(tx);\n        return await this.provider.send(\"eth_signTransaction\", [hexTx]);\n    }\n    async signMessage(_message) {\n        const message = ((typeof (_message) === \"string\") ? toUtf8Bytes(_message) : _message);\n        return await this.provider.send(\"personal_sign\", [\n            hexlify(message), this.address.toLowerCase()\n        ]);\n    }\n    async signTypedData(domain, types, _value) {\n        const value = deepCopy(_value);\n        // Populate any ENS names (in-place)\n        const populated = await TypedDataEncoder.resolveNames(domain, types, value, async (value) => {\n            const address = await resolveAddress(value);\n            assertArgument(address != null, \"TypedData does not support null address\", \"value\", value);\n            return address;\n        });\n        return await this.provider.send(\"eth_signTypedData_v4\", [\n            this.address.toLowerCase(),\n            JSON.stringify(TypedDataEncoder.getPayload(populated.domain, types, populated.value))\n        ]);\n    }\n    async unlock(password) {\n        return this.provider.send(\"personal_unlockAccount\", [\n            this.address.toLowerCase(), password, null\n        ]);\n    }\n    // https://github.com/ethereum/wiki/wiki/JSON-RPC#eth_sign\n    async _legacySignMessage(_message) {\n        const message = ((typeof (_message) === \"string\") ? toUtf8Bytes(_message) : _message);\n        return await this.provider.send(\"eth_sign\", [\n            this.address.toLowerCase(), hexlify(message)\n        ]);\n    }\n}\n/**\n *  The JsonRpcApiProvider is an abstract class and **MUST** be\n *  sub-classed.\n *\n *  It provides the base for all JSON-RPC-based Provider interaction.\n *\n *  Sub-classing Notes:\n *  - a sub-class MUST override _send\n *  - a sub-class MUST call the `_start()` method once connected\n */\nexport class JsonRpcApiProvider extends AbstractProvider {\n    #options;\n    // The next ID to use for the JSON-RPC ID field\n    #nextId;\n    // Payloads are queued and triggered in batches using the drainTimer\n    #payloads;\n    #drainTimer;\n    #notReady;\n    #network;\n    #pendingDetectNetwork;\n    #scheduleDrain() {\n        if (this.#drainTimer) {\n            return;\n        }\n        // If we aren't using batching, no harm in sending it immediately\n        const stallTime = (this._getOption(\"batchMaxCount\") === 1) ? 0 : this._getOption(\"batchStallTime\");\n        this.#drainTimer = setTimeout(() => {\n            this.#drainTimer = null;\n            const payloads = this.#payloads;\n            this.#payloads = [];\n            while (payloads.length) {\n                // Create payload batches that satisfy our batch constraints\n                const batch = [(payloads.shift())];\n                while (payloads.length) {\n                    if (batch.length === this.#options.batchMaxCount) {\n                        break;\n                    }\n                    batch.push((payloads.shift()));\n                    const bytes = JSON.stringify(batch.map((p) => p.payload));\n                    if (bytes.length > this.#options.batchMaxSize) {\n                        payloads.unshift((batch.pop()));\n                        break;\n                    }\n                }\n                // Process the result to each payload\n                (async () => {\n                    const payload = ((batch.length === 1) ? batch[0].payload : batch.map((p) => p.payload));\n                    this.emit(\"debug\", { action: \"sendRpcPayload\", payload });\n                    try {\n                        const result = await this._send(payload);\n                        this.emit(\"debug\", { action: \"receiveRpcResult\", result });\n                        // Process results in batch order\n                        for (const { resolve, reject, payload } of batch) {\n                            if (this.destroyed) {\n                                reject(makeError(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: payload.method }));\n                                continue;\n                            }\n                            // Find the matching result\n                            const resp = result.filter((r) => (r.id === payload.id))[0];\n                            // No result; the node failed us in unexpected ways\n                            if (resp == null) {\n                                const error = makeError(\"missing response for request\", \"BAD_DATA\", {\n                                    value: result, info: { payload }\n                                });\n                                this.emit(\"error\", error);\n                                reject(error);\n                                continue;\n                            }\n                            // The response is an error\n                            if (\"error\" in resp) {\n                                reject(this.getRpcError(payload, resp));\n                                continue;\n                            }\n                            // All good; send the result\n                            resolve(resp.result);\n                        }\n                    }\n                    catch (error) {\n                        this.emit(\"debug\", { action: \"receiveRpcError\", error });\n                        for (const { reject } of batch) {\n                            // @TODO: augment the error with the payload\n                            reject(error);\n                        }\n                    }\n                })();\n            }\n        }, stallTime);\n    }\n    constructor(network, options) {\n        super(network, options);\n        this.#nextId = 1;\n        this.#options = Object.assign({}, defaultOptions, options || {});\n        this.#payloads = [];\n        this.#drainTimer = null;\n        this.#network = null;\n        this.#pendingDetectNetwork = null;\n        {\n            let resolve = null;\n            const promise = new Promise((_resolve) => {\n                resolve = _resolve;\n            });\n            this.#notReady = { promise, resolve };\n        }\n        const staticNetwork = this._getOption(\"staticNetwork\");\n        if (typeof (staticNetwork) === \"boolean\") {\n            assertArgument(!staticNetwork || network !== \"any\", \"staticNetwork cannot be used on special network 'any'\", \"options\", options);\n            if (staticNetwork && network != null) {\n                this.#network = Network.from(network);\n            }\n        }\n        else if (staticNetwork) {\n            // Make sure any static network is compatbile with the provided netwrok\n            assertArgument(network == null || staticNetwork.matches(network), \"staticNetwork MUST match network object\", \"options\", options);\n            this.#network = staticNetwork;\n        }\n    }\n    /**\n     *  Returns the value associated with the option %%key%%.\n     *\n     *  Sub-classes can use this to inquire about configuration options.\n     */\n    _getOption(key) {\n        return this.#options[key];\n    }\n    /**\n     *  Gets the [[Network]] this provider has committed to. On each call, the network\n     *  is detected, and if it has changed, the call will reject.\n     */\n    get _network() {\n        assert(this.#network, \"network is not available yet\", \"NETWORK_ERROR\");\n        return this.#network;\n    }\n    /**\n     *  Resolves to the non-normalized value by performing %%req%%.\n     *\n     *  Sub-classes may override this to modify behavior of actions,\n     *  and should generally call ``super._perform`` as a fallback.\n     */\n    async _perform(req) {\n        // Legacy networks do not like the type field being passed along (which\n        // is fair), so we delete type if it is 0 and a non-EIP-1559 network\n        if (req.method === \"call\" || req.method === \"estimateGas\") {\n            let tx = req.transaction;\n            if (tx && tx.type != null && getBigInt(tx.type)) {\n                // If there are no EIP-1559 or newer properties, it might be pre-EIP-1559\n                if (tx.maxFeePerGas == null && tx.maxPriorityFeePerGas == null) {\n                    const feeData = await this.getFeeData();\n                    if (feeData.maxFeePerGas == null && feeData.maxPriorityFeePerGas == null) {\n                        // Network doesn't know about EIP-1559 (and hence type)\n                        req = Object.assign({}, req, {\n                            transaction: Object.assign({}, tx, { type: undefined })\n                        });\n                    }\n                }\n            }\n        }\n        const request = this.getRpcRequest(req);\n        if (request != null) {\n            return await this.send(request.method, request.args);\n        }\n        return super._perform(req);\n    }\n    /**\n     *  Sub-classes may override this; it detects the *actual* network that\n     *  we are **currently** connected to.\n     *\n     *  Keep in mind that [[send]] may only be used once [[ready]], otherwise the\n     *  _send primitive must be used instead.\n     */\n    async _detectNetwork() {\n        const network = this._getOption(\"staticNetwork\");\n        if (network) {\n            if (network === true) {\n                if (this.#network) {\n                    return this.#network;\n                }\n            }\n            else {\n                return network;\n            }\n        }\n        if (this.#pendingDetectNetwork) {\n            return await this.#pendingDetectNetwork;\n        }\n        // If we are ready, use ``send``, which enabled requests to be batched\n        if (this.ready) {\n            this.#pendingDetectNetwork = (async () => {\n                try {\n                    const result = Network.from(getBigInt(await this.send(\"eth_chainId\", [])));\n                    this.#pendingDetectNetwork = null;\n                    return result;\n                }\n                catch (error) {\n                    this.#pendingDetectNetwork = null;\n                    throw error;\n                }\n            })();\n            return await this.#pendingDetectNetwork;\n        }\n        // We are not ready yet; use the primitive _send\n        this.#pendingDetectNetwork = (async () => {\n            const payload = {\n                id: this.#nextId++, method: \"eth_chainId\", params: [], jsonrpc: \"2.0\"\n            };\n            this.emit(\"debug\", { action: \"sendRpcPayload\", payload });\n            let result;\n            try {\n                result = (await this._send(payload))[0];\n                this.#pendingDetectNetwork = null;\n            }\n            catch (error) {\n                this.#pendingDetectNetwork = null;\n                this.emit(\"debug\", { action: \"receiveRpcError\", error });\n                throw error;\n            }\n            this.emit(\"debug\", { action: \"receiveRpcResult\", result });\n            if (\"result\" in result) {\n                return Network.from(getBigInt(result.result));\n            }\n            throw this.getRpcError(payload, result);\n        })();\n        return await this.#pendingDetectNetwork;\n    }\n    /**\n     *  Sub-classes **MUST** call this. Until [[_start]] has been called, no calls\n     *  will be passed to [[_send]] from [[send]]. If it is overridden, then\n     *  ``super._start()`` **MUST** be called.\n     *\n     *  Calling it multiple times is safe and has no effect.\n     */\n    _start() {\n        if (this.#notReady == null || this.#notReady.resolve == null) {\n            return;\n        }\n        this.#notReady.resolve();\n        this.#notReady = null;\n        (async () => {\n            // Bootstrap the network\n            while (this.#network == null && !this.destroyed) {\n                try {\n                    this.#network = await this._detectNetwork();\n                }\n                catch (error) {\n                    if (this.destroyed) {\n                        break;\n                    }\n                    console.log(\"JsonRpcProvider failed to detect network and cannot start up; retry in 1s (perhaps the URL is wrong or the node is not started)\");\n                    this.emit(\"error\", makeError(\"failed to bootstrap network detection\", \"NETWORK_ERROR\", { event: \"initial-network-discovery\", info: { error } }));\n                    await stall(1000);\n                }\n            }\n            // Start dispatching requests\n            this.#scheduleDrain();\n        })();\n    }\n    /**\n     *  Resolves once the [[_start]] has been called. This can be used in\n     *  sub-classes to defer sending data until the connection has been\n     *  established.\n     */\n    async _waitUntilReady() {\n        if (this.#notReady == null) {\n            return;\n        }\n        return await this.#notReady.promise;\n    }\n    /**\n     *  Return a Subscriber that will manage the %%sub%%.\n     *\n     *  Sub-classes may override this to modify the behavior of\n     *  subscription management.\n     */\n    _getSubscriber(sub) {\n        // Pending Filters aren't availble via polling\n        if (sub.type === \"pending\") {\n            return new FilterIdPendingSubscriber(this);\n        }\n        if (sub.type === \"event\") {\n            if (this._getOption(\"polling\")) {\n                return new PollingEventSubscriber(this, sub.filter);\n            }\n            return new FilterIdEventSubscriber(this, sub.filter);\n        }\n        // Orphaned Logs are handled automatically, by the filter, since\n        // logs with removed are emitted by it\n        if (sub.type === \"orphan\" && sub.filter.orphan === \"drop-log\") {\n            return new UnmanagedSubscriber(\"orphan\");\n        }\n        return super._getSubscriber(sub);\n    }\n    /**\n     *  Returns true only if the [[_start]] has been called.\n     */\n    get ready() { return this.#notReady == null; }\n    /**\n     *  Returns %%tx%% as a normalized JSON-RPC transaction request,\n     *  which has all values hexlified and any numeric values converted\n     *  to Quantity values.\n     */\n    getRpcTransaction(tx) {\n        const result = {};\n        // JSON-RPC now requires numeric values to be \"quantity\" values\n        [\"chainId\", \"gasLimit\", \"gasPrice\", \"type\", \"maxFeePerGas\", \"maxPriorityFeePerGas\", \"nonce\", \"value\"].forEach((key) => {\n            if (tx[key] == null) {\n                return;\n            }\n            let dstKey = key;\n            if (key === \"gasLimit\") {\n                dstKey = \"gas\";\n            }\n            result[dstKey] = toQuantity(getBigInt(tx[key], `tx.${key}`));\n        });\n        // Make sure addresses and data are lowercase\n        [\"from\", \"to\", \"data\"].forEach((key) => {\n            if (tx[key] == null) {\n                return;\n            }\n            result[key] = hexlify(tx[key]);\n        });\n        // Normalize the access list object\n        if (tx.accessList) {\n            result[\"accessList\"] = accessListify(tx.accessList);\n        }\n        if (tx.blobVersionedHashes) {\n            // @TODO: Remove this <any> case once EIP-4844 added to prepared tx\n            result[\"blobVersionedHashes\"] = tx.blobVersionedHashes.map(h => h.toLowerCase());\n        }\n        // @TODO: blobs should probably also be copied over, optionally\n        // accounting for the kzg property to backfill blobVersionedHashes\n        // using the commitment. Or should that be left as an exercise to\n        // the caller?\n        return result;\n    }\n    /**\n     *  Returns the request method and arguments required to perform\n     *  %%req%%.\n     */\n    getRpcRequest(req) {\n        switch (req.method) {\n            case \"chainId\":\n                return { method: \"eth_chainId\", args: [] };\n            case \"getBlockNumber\":\n                return { method: \"eth_blockNumber\", args: [] };\n            case \"getGasPrice\":\n                return { method: \"eth_gasPrice\", args: [] };\n            case \"getPriorityFee\":\n                return { method: \"eth_maxPriorityFeePerGas\", args: [] };\n            case \"getBalance\":\n                return {\n                    method: \"eth_getBalance\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getTransactionCount\":\n                return {\n                    method: \"eth_getTransactionCount\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getCode\":\n                return {\n                    method: \"eth_getCode\",\n                    args: [getLowerCase(req.address), req.blockTag]\n                };\n            case \"getStorage\":\n                return {\n                    method: \"eth_getStorageAt\",\n                    args: [\n                        getLowerCase(req.address),\n                        (\"0x\" + req.position.toString(16)),\n                        req.blockTag\n                    ]\n                };\n            case \"broadcastTransaction\":\n                return {\n                    method: \"eth_sendRawTransaction\",\n                    args: [req.signedTransaction]\n                };\n            case \"getBlock\":\n                if (\"blockTag\" in req) {\n                    return {\n                        method: \"eth_getBlockByNumber\",\n                        args: [req.blockTag, !!req.includeTransactions]\n                    };\n                }\n                else if (\"blockHash\" in req) {\n                    return {\n                        method: \"eth_getBlockByHash\",\n                        args: [req.blockHash, !!req.includeTransactions]\n                    };\n                }\n                break;\n            case \"getTransaction\":\n                return {\n                    method: \"eth_getTransactionByHash\",\n                    args: [req.hash]\n                };\n            case \"getTransactionReceipt\":\n                return {\n                    method: \"eth_getTransactionReceipt\",\n                    args: [req.hash]\n                };\n            case \"call\":\n                return {\n                    method: \"eth_call\",\n                    args: [this.getRpcTransaction(req.transaction), req.blockTag]\n                };\n            case \"estimateGas\": {\n                return {\n                    method: \"eth_estimateGas\",\n                    args: [this.getRpcTransaction(req.transaction)]\n                };\n            }\n            case \"getLogs\":\n                if (req.filter && req.filter.address != null) {\n                    if (Array.isArray(req.filter.address)) {\n                        req.filter.address = req.filter.address.map(getLowerCase);\n                    }\n                    else {\n                        req.filter.address = getLowerCase(req.filter.address);\n                    }\n                }\n                return { method: \"eth_getLogs\", args: [req.filter] };\n        }\n        return null;\n    }\n    /**\n     *  Returns an ethers-style Error for the given JSON-RPC error\n     *  %%payload%%, coalescing the various strings and error shapes\n     *  that different nodes return, coercing them into a machine-readable\n     *  standardized error.\n     */\n    getRpcError(payload, _error) {\n        const { method } = payload;\n        const { error } = _error;\n        if (method === \"eth_estimateGas\" && error.message) {\n            const msg = error.message;\n            if (!msg.match(/revert/i) && msg.match(/insufficient funds/i)) {\n                return makeError(\"insufficient funds\", \"INSUFFICIENT_FUNDS\", {\n                    transaction: (payload.params[0]),\n                    info: { payload, error }\n                });\n            }\n        }\n        if (method === \"eth_call\" || method === \"eth_estimateGas\") {\n            const result = spelunkData(error);\n            const e = AbiCoder.getBuiltinCallException((method === \"eth_call\") ? \"call\" : \"estimateGas\", (payload.params[0]), (result ? result.data : null));\n            e.info = { error, payload };\n            return e;\n        }\n        // Only estimateGas and call can return arbitrary contract-defined text, so now we\n        // we can process text safely.\n        const message = JSON.stringify(spelunkMessage(error));\n        if (typeof (error.message) === \"string\" && error.message.match(/user denied|ethers-user-denied/i)) {\n            const actionMap = {\n                eth_sign: \"signMessage\",\n                personal_sign: \"signMessage\",\n                eth_signTypedData_v4: \"signTypedData\",\n                eth_signTransaction: \"signTransaction\",\n                eth_sendTransaction: \"sendTransaction\",\n                eth_requestAccounts: \"requestAccess\",\n                wallet_requestAccounts: \"requestAccess\",\n            };\n            return makeError(`user rejected action`, \"ACTION_REJECTED\", {\n                action: (actionMap[method] || \"unknown\"),\n                reason: \"rejected\",\n                info: { payload, error }\n            });\n        }\n        if (method === \"eth_sendRawTransaction\" || method === \"eth_sendTransaction\") {\n            const transaction = (payload.params[0]);\n            if (message.match(/insufficient funds|base fee exceeds gas limit/i)) {\n                return makeError(\"insufficient funds for intrinsic transaction cost\", \"INSUFFICIENT_FUNDS\", {\n                    transaction, info: { error }\n                });\n            }\n            if (message.match(/nonce/i) && message.match(/too low/i)) {\n                return makeError(\"nonce has already been used\", \"NONCE_EXPIRED\", { transaction, info: { error } });\n            }\n            // \"replacement transaction underpriced\"\n            if (message.match(/replacement transaction/i) && message.match(/underpriced/i)) {\n                return makeError(\"replacement fee too low\", \"REPLACEMENT_UNDERPRICED\", { transaction, info: { error } });\n            }\n            if (message.match(/only replay-protected/i)) {\n                return makeError(\"legacy pre-eip-155 transactions not supported\", \"UNSUPPORTED_OPERATION\", {\n                    operation: method, info: { transaction, info: { error } }\n                });\n            }\n        }\n        let unsupported = !!message.match(/the method .* does not exist/i);\n        if (!unsupported) {\n            if (error && error.details && error.details.startsWith(\"Unauthorized method:\")) {\n                unsupported = true;\n            }\n        }\n        if (unsupported) {\n            return makeError(\"unsupported operation\", \"UNSUPPORTED_OPERATION\", {\n                operation: payload.method, info: { error, payload }\n            });\n        }\n        return makeError(\"could not coalesce error\", \"UNKNOWN_ERROR\", { error, payload });\n    }\n    /**\n     *  Requests the %%method%% with %%params%% via the JSON-RPC protocol\n     *  over the underlying channel. This can be used to call methods\n     *  on the backend that do not have a high-level API within the Provider\n     *  API.\n     *\n     *  This method queues requests according to the batch constraints\n     *  in the options, assigns the request a unique ID.\n     *\n     *  **Do NOT override** this method in sub-classes; instead\n     *  override [[_send]] or force the options values in the\n     *  call to the constructor to modify this method's behavior.\n     */\n    send(method, params) {\n        // @TODO: cache chainId?? purge on switch_networks\n        // We have been destroyed; no operations are supported anymore\n        if (this.destroyed) {\n            return Promise.reject(makeError(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: method }));\n        }\n        const id = this.#nextId++;\n        const promise = new Promise((resolve, reject) => {\n            this.#payloads.push({\n                resolve, reject,\n                payload: { method, params, id, jsonrpc: \"2.0\" }\n            });\n        });\n        // If there is not a pending drainTimer, set one\n        this.#scheduleDrain();\n        return promise;\n    }\n    /**\n     *  Resolves to the [[Signer]] account for  %%address%% managed by\n     *  the client.\n     *\n     *  If the %%address%% is a number, it is used as an index in the\n     *  the accounts from [[listAccounts]].\n     *\n     *  This can only be used on clients which manage accounts (such as\n     *  Geth with imported account or MetaMask).\n     *\n     *  Throws if the account doesn't exist.\n     */\n    async getSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        const accountsPromise = this.send(\"eth_accounts\", []);\n        // Account index\n        if (typeof (address) === \"number\") {\n            const accounts = (await accountsPromise);\n            if (address >= accounts.length) {\n                throw new Error(\"no such account\");\n            }\n            return new JsonRpcSigner(this, accounts[address]);\n        }\n        const { accounts } = await resolveProperties({\n            network: this.getNetwork(),\n            accounts: accountsPromise\n        });\n        // Account address\n        address = getAddress(address);\n        for (const account of accounts) {\n            if (getAddress(account) === address) {\n                return new JsonRpcSigner(this, address);\n            }\n        }\n        throw new Error(\"invalid account\");\n    }\n    async listAccounts() {\n        const accounts = await this.send(\"eth_accounts\", []);\n        return accounts.map((a) => new JsonRpcSigner(this, a));\n    }\n    destroy() {\n        // Stop processing requests\n        if (this.#drainTimer) {\n            clearTimeout(this.#drainTimer);\n            this.#drainTimer = null;\n        }\n        // Cancel all pending requests\n        for (const { payload, reject } of this.#payloads) {\n            reject(makeError(\"provider destroyed; cancelled request\", \"UNSUPPORTED_OPERATION\", { operation: payload.method }));\n        }\n        this.#payloads = [];\n        // Parent clean-up\n        super.destroy();\n    }\n}\n// @TODO: remove this in v7, it is not exported because this functionality\n// is exposed in the JsonRpcApiProvider by setting polling to true. It should\n// be safe to remove regardless, because it isn't reachable, but just in case.\n/**\n *  @_ignore:\n */\nexport class JsonRpcApiPollingProvider extends JsonRpcApiProvider {\n    #pollingInterval;\n    constructor(network, options) {\n        super(network, options);\n        let pollingInterval = this._getOption(\"pollingInterval\");\n        if (pollingInterval == null) {\n            pollingInterval = defaultOptions.pollingInterval;\n        }\n        this.#pollingInterval = pollingInterval;\n    }\n    _getSubscriber(sub) {\n        const subscriber = super._getSubscriber(sub);\n        if (isPollable(subscriber)) {\n            subscriber.pollingInterval = this.#pollingInterval;\n        }\n        return subscriber;\n    }\n    /**\n     *  The polling interval (default: 4000 ms)\n     */\n    get pollingInterval() { return this.#pollingInterval; }\n    set pollingInterval(value) {\n        if (!Number.isInteger(value) || value < 0) {\n            throw new Error(\"invalid interval\");\n        }\n        this.#pollingInterval = value;\n        this._forEachSubscriber((sub) => {\n            if (isPollable(sub)) {\n                sub.pollingInterval = this.#pollingInterval;\n            }\n        });\n    }\n}\n/**\n *  The JsonRpcProvider is one of the most common Providers,\n *  which performs all operations over HTTP (or HTTPS) requests.\n *\n *  Events are processed by polling the backend for the current block\n *  number; when it advances, all block-base events are then checked\n *  for updates.\n */\nexport class JsonRpcProvider extends JsonRpcApiPollingProvider {\n    #connect;\n    constructor(url, network, options) {\n        if (url == null) {\n            url = \"http:/\\/localhost:8545\";\n        }\n        super(network, options);\n        if (typeof (url) === \"string\") {\n            this.#connect = new FetchRequest(url);\n        }\n        else {\n            this.#connect = url.clone();\n        }\n    }\n    _getConnection() {\n        return this.#connect.clone();\n    }\n    async send(method, params) {\n        // All requests are over HTTP, so we can just start handling requests\n        // We do this here rather than the constructor so that we don't send any\n        // requests to the network (i.e. eth_chainId) until we absolutely have to.\n        await this._start();\n        return await super.send(method, params);\n    }\n    async _send(payload) {\n        // Configure a POST connection for the requested method\n        const request = this._getConnection();\n        request.body = JSON.stringify(payload);\n        request.setHeader(\"content-type\", \"application/json\");\n        const response = await request.send();\n        response.assertOk();\n        let resp = response.bodyJson;\n        if (!Array.isArray(resp)) {\n            resp = [resp];\n        }\n        return resp;\n    }\n}\nfunction spelunkData(value) {\n    if (value == null) {\n        return null;\n    }\n    // These *are* the droids we're looking for.\n    if (typeof (value.message) === \"string\" && value.message.match(/revert/i) && isHexString(value.data)) {\n        return { message: value.message, data: value.data };\n    }\n    // Spelunk further...\n    if (typeof (value) === \"object\") {\n        for (const key in value) {\n            const result = spelunkData(value[key]);\n            if (result) {\n                return result;\n            }\n        }\n        return null;\n    }\n    // Might be a JSON string we can further descend...\n    if (typeof (value) === \"string\") {\n        try {\n            return spelunkData(JSON.parse(value));\n        }\n        catch (error) { }\n    }\n    return null;\n}\nfunction _spelunkMessage(value, result) {\n    if (value == null) {\n        return;\n    }\n    // These *are* the droids we're looking for.\n    if (typeof (value.message) === \"string\") {\n        result.push(value.message);\n    }\n    // Spelunk further...\n    if (typeof (value) === \"object\") {\n        for (const key in value) {\n            _spelunkMessage(value[key], result);\n        }\n    }\n    // Might be a JSON string we can further descend...\n    if (typeof (value) === \"string\") {\n        try {\n            return _spelunkMessage(JSON.parse(value), result);\n        }\n        catch (error) { }\n    }\n}\nfunction spelunkMessage(value) {\n    const result = [];\n    _spelunkMessage(value, result);\n    return result;\n}\n//# sourceMappingURL=provider-jsonrpc.js.map","import { assertArgument } from \"../utils/index.js\";\nimport { JsonRpcApiPollingProvider } from \"./provider-jsonrpc.js\";\n;\n/**\n *  A **BrowserProvider** is intended to wrap an injected provider which\n *  adheres to the [[link-eip-1193]] standard, which most (if not all)\n *  currently do.\n */\nexport class BrowserProvider extends JsonRpcApiPollingProvider {\n    #request;\n    /**\n     *  Connnect to the %%ethereum%% provider, optionally forcing the\n     *  %%network%%.\n     */\n    constructor(ethereum, network, _options) {\n        // Copy the options\n        const options = Object.assign({}, ((_options != null) ? _options : {}), { batchMaxCount: 1 });\n        assertArgument(ethereum && ethereum.request, \"invalid EIP-1193 provider\", \"ethereum\", ethereum);\n        super(network, options);\n        this.#request = async (method, params) => {\n            const payload = { method, params };\n            this.emit(\"debug\", { action: \"sendEip1193Request\", payload });\n            try {\n                const result = await ethereum.request(payload);\n                this.emit(\"debug\", { action: \"receiveEip1193Result\", result });\n                return result;\n            }\n            catch (e) {\n                const error = new Error(e.message);\n                error.code = e.code;\n                error.data = e.data;\n                error.payload = payload;\n                this.emit(\"debug\", { action: \"receiveEip1193Error\", error });\n                throw error;\n            }\n        };\n    }\n    async send(method, params) {\n        await this._start();\n        return await super.send(method, params);\n    }\n    async _send(payload) {\n        assertArgument(!Array.isArray(payload), \"EIP-1193 does not support batch request\", \"payload\", payload);\n        try {\n            const result = await this.#request(payload.method, payload.params || []);\n            return [{ id: payload.id, result }];\n        }\n        catch (e) {\n            return [{\n                    id: payload.id,\n                    error: { code: e.code, data: e.data, message: e.message }\n                }];\n        }\n    }\n    getRpcError(payload, error) {\n        error = JSON.parse(JSON.stringify(error));\n        // EIP-1193 gives us some machine-readable error codes, so rewrite\n        // them into \n        switch (error.error.code || -1) {\n            case 4001:\n                error.error.message = `ethers-user-denied: ${error.error.message}`;\n                break;\n            case 4200:\n                error.error.message = `ethers-unsupported: ${error.error.message}`;\n                break;\n        }\n        return super.getRpcError(payload, error);\n    }\n    /**\n     *  Resolves to ``true`` if the provider manages the %%address%%.\n     */\n    async hasSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        const accounts = await this.send(\"eth_accounts\", []);\n        if (typeof (address) === \"number\") {\n            return (accounts.length > address);\n        }\n        address = address.toLowerCase();\n        return accounts.filter((a) => (a.toLowerCase() === address)).length !== 0;\n    }\n    async getSigner(address) {\n        if (address == null) {\n            address = 0;\n        }\n        if (!(await this.hasSigner(address))) {\n            try {\n                //const resp = \n                await this.#request(\"eth_requestAccounts\", []);\n                //console.log(\"RESP\", resp);\n            }\n            catch (error) {\n                const payload = error.payload;\n                throw this.getRpcError(payload, { id: payload.id, error });\n            }\n        }\n        return await super.getSigner(address);\n    }\n}\n//# sourceMappingURL=provider-browser.js.map","import { getAddress, resolveAddress } from \"../address/index.js\";\nimport { hashMessage, TypedDataEncoder } from \"../hash/index.js\";\nimport { AbstractSigner, copyRequest } from \"../providers/index.js\";\nimport { computeAddress, Transaction } from \"../transaction/index.js\";\nimport { defineProperties, resolveProperties, assert, assertArgument } from \"../utils/index.js\";\n/**\n *  The **BaseWallet** is a stream-lined implementation of a\n *  [[Signer]] that operates with a private key.\n *\n *  It is preferred to use the [[Wallet]] class, as it offers\n *  additional functionality and simplifies loading a variety\n *  of JSON formats, Mnemonic Phrases, etc.\n *\n *  This class may be of use for those attempting to implement\n *  a minimal Signer.\n */\nexport class BaseWallet extends AbstractSigner {\n    /**\n     *  The wallet address.\n     */\n    address;\n    #signingKey;\n    /**\n     *  Creates a new BaseWallet for %%privateKey%%, optionally\n     *  connected to %%provider%%.\n     *\n     *  If %%provider%% is not specified, only offline methods can\n     *  be used.\n     */\n    constructor(privateKey, provider) {\n        super(provider);\n        assertArgument(privateKey && typeof (privateKey.sign) === \"function\", \"invalid private key\", \"privateKey\", \"[ REDACTED ]\");\n        this.#signingKey = privateKey;\n        const address = computeAddress(this.signingKey.publicKey);\n        defineProperties(this, { address });\n    }\n    // Store private values behind getters to reduce visibility\n    // in console.log\n    /**\n     *  The [[SigningKey]] used for signing payloads.\n     */\n    get signingKey() { return this.#signingKey; }\n    /**\n     *  The private key for this wallet.\n     */\n    get privateKey() { return this.signingKey.privateKey; }\n    async getAddress() { return this.address; }\n    connect(provider) {\n        return new BaseWallet(this.#signingKey, provider);\n    }\n    async signTransaction(tx) {\n        tx = copyRequest(tx);\n        // Replace any Addressable or ENS name with an address\n        const { to, from } = await resolveProperties({\n            to: (tx.to ? resolveAddress(tx.to, this.provider) : undefined),\n            from: (tx.from ? resolveAddress(tx.from, this.provider) : undefined)\n        });\n        if (to != null) {\n            tx.to = to;\n        }\n        if (from != null) {\n            tx.from = from;\n        }\n        if (tx.from != null) {\n            assertArgument(getAddress((tx.from)) === this.address, \"transaction from address mismatch\", \"tx.from\", tx.from);\n            delete tx.from;\n        }\n        // Build the transaction\n        const btx = Transaction.from(tx);\n        btx.signature = this.signingKey.sign(btx.unsignedHash);\n        return btx.serialized;\n    }\n    async signMessage(message) {\n        return this.signMessageSync(message);\n    }\n    // @TODO: Add a secialized signTx and signTyped sync that enforces\n    // all parameters are known?\n    /**\n     *  Returns the signature for %%message%% signed with this wallet.\n     */\n    signMessageSync(message) {\n        return this.signingKey.sign(hashMessage(message)).serialized;\n    }\n    async signTypedData(domain, types, value) {\n        // Populate any ENS names\n        const populated = await TypedDataEncoder.resolveNames(domain, types, value, async (name) => {\n            // @TODO: this should use resolveName; addresses don't\n            //        need a provider\n            assert(this.provider != null, \"cannot resolve ENS names without a provider\", \"UNSUPPORTED_OPERATION\", {\n                operation: \"resolveName\",\n                info: { name }\n            });\n            const address = await this.provider.resolveName(name);\n            assert(address != null, \"unconfigured ENS name\", \"UNCONFIGURED_NAME\", {\n                value: name\n            });\n            return address;\n        });\n        return this.signingKey.sign(TypedDataEncoder.hash(populated.domain, types, populated.value)).serialized;\n    }\n}\n//# sourceMappingURL=base-wallet.js.map","import { assertArgument } from \"../utils/index.js\";\nconst subsChrs = \" !#$%&'()*+,-./<=>?@[]^_`{|}~\";\nconst Word = /^[a-z]*$/i;\nfunction unfold(words, sep) {\n    let initial = 97;\n    return words.reduce((accum, word) => {\n        if (word === sep) {\n            initial++;\n        }\n        else if (word.match(Word)) {\n            accum.push(String.fromCharCode(initial) + word);\n        }\n        else {\n            initial = 97;\n            accum.push(word);\n        }\n        return accum;\n    }, []);\n}\n/**\n *  @_ignore\n */\nexport function decode(data, subs) {\n    // Replace all the substitutions with their expanded form\n    for (let i = subsChrs.length - 1; i >= 0; i--) {\n        data = data.split(subsChrs[i]).join(subs.substring(2 * i, 2 * i + 2));\n    }\n    // Get all tle clumps; each suffix, first-increment and second-increment\n    const clumps = [];\n    const leftover = data.replace(/(:|([0-9])|([A-Z][a-z]*))/g, (all, item, semi, word) => {\n        if (semi) {\n            for (let i = parseInt(semi); i >= 0; i--) {\n                clumps.push(\";\");\n            }\n        }\n        else {\n            clumps.push(item.toLowerCase());\n        }\n        return \"\";\n    });\n    /* c8 ignore start */\n    if (leftover) {\n        throw new Error(`leftovers: ${JSON.stringify(leftover)}`);\n    }\n    /* c8 ignore stop */\n    return unfold(unfold(clumps, \";\"), \":\");\n}\n/**\n *  @_ignore\n */\nexport function decodeOwl(data) {\n    assertArgument(data[0] === \"0\", \"unsupported auwl data\", \"data\", data);\n    return decode(data.substring(1 + 2 * subsChrs.length), data.substring(1, 1 + 2 * subsChrs.length));\n}\n//# sourceMappingURL=decode-owl.js.map","import { defineProperties } from \"../utils/index.js\";\n/**\n *  A Wordlist represents a collection of language-specific\n *  words used to encode and devoce [[link-bip-39]] encoded data\n *  by mapping words to 11-bit values and vice versa.\n */\nexport class Wordlist {\n    locale;\n    /**\n     *  Creates a new Wordlist instance.\n     *\n     *  Sub-classes MUST call this if they provide their own constructor,\n     *  passing in the locale string of the language.\n     *\n     *  Generally there is no need to create instances of a Wordlist,\n     *  since each language-specific Wordlist creates an instance and\n     *  there is no state kept internally, so they are safe to share.\n     */\n    constructor(locale) {\n        defineProperties(this, { locale });\n    }\n    /**\n     *  Sub-classes may override this to provide a language-specific\n     *  method for spliting %%phrase%% into individual words.\n     *\n     *  By default, %%phrase%% is split using any sequences of\n     *  white-space as defined by regular expressions (i.e. ``/\\s+/``).\n     */\n    split(phrase) {\n        return phrase.toLowerCase().split(/\\s+/g);\n    }\n    /**\n     *  Sub-classes may override this to provider a language-specific\n     *  method for joining %%words%% into a phrase.\n     *\n     *  By default, %%words%% are joined by a single space.\n     */\n    join(words) {\n        return words.join(\" \");\n    }\n}\n//# sourceMappingURL=wordlist.js.map","// Use the encode-latin.js script to create the necessary\n// data files to be consumed by this class\nimport { id } from \"../hash/index.js\";\nimport { assertArgument } from \"../utils/index.js\";\nimport { decodeOwl } from \"./decode-owl.js\";\nimport { Wordlist } from \"./wordlist.js\";\n/**\n *  An OWL format Wordlist is an encoding method that exploits\n *  the general locality of alphabetically sorted words to\n *  achieve a simple but effective means of compression.\n *\n *  This class is generally not useful to most developers as\n *  it is used mainly internally to keep Wordlists for languages\n *  based on ASCII-7 small.\n *\n *  If necessary, there are tools within the ``generation/`` folder\n *  to create the necessary data.\n */\nexport class WordlistOwl extends Wordlist {\n    #data;\n    #checksum;\n    /**\n     *  Creates a new Wordlist for %%locale%% using the OWL %%data%%\n     *  and validated against the %%checksum%%.\n     */\n    constructor(locale, data, checksum) {\n        super(locale);\n        this.#data = data;\n        this.#checksum = checksum;\n        this.#words = null;\n    }\n    /**\n     *  The OWL-encoded data.\n     */\n    get _data() { return this.#data; }\n    /**\n     *  Decode all the words for the wordlist.\n     */\n    _decodeWords() {\n        return decodeOwl(this.#data);\n    }\n    #words;\n    #loadWords() {\n        if (this.#words == null) {\n            const words = this._decodeWords();\n            // Verify the computed list matches the official list\n            const checksum = id(words.join(\"\\n\") + \"\\n\");\n            /* c8 ignore start */\n            if (checksum !== this.#checksum) {\n                throw new Error(`BIP39 Wordlist for ${this.locale} FAILED`);\n            }\n            /* c8 ignore stop */\n            this.#words = words;\n        }\n        return this.#words;\n    }\n    getWord(index) {\n        const words = this.#loadWords();\n        assertArgument(index >= 0 && index < words.length, `invalid word index: ${index}`, \"index\", index);\n        return words[index];\n    }\n    getWordIndex(word) {\n        return this.#loadWords().indexOf(word);\n    }\n}\n//# sourceMappingURL=wordlist-owl.js.map","import { WordlistOwl } from \"./wordlist-owl.js\";\nconst words = \"0erleonalorenseinceregesticitStanvetearctssi#ch2Athck&tneLl0And#Il.yLeOutO=S|S%b/ra@SurdU'0Ce[Cid|CountCu'Hie=IdOu,-Qui*Ro[TT]T%T*[Tu$0AptDD-tD*[Ju,M.UltV<)Vi)0Rob-0FairF%dRaid0A(EEntRee0Ead0MRRp%tS!_rmBumCoholErtI&LLeyLowMo,O}PhaReadySoT Ways0A>urAz(gOngOuntU'd0Aly,Ch%Ci|G G!GryIm$K!Noun)Nu$O` Sw T&naTiqueXietyY1ArtOlogyPe?P!Pro=Ril1ChCt-EaEnaGueMMedM%MyOundR<+Re,Ri=RowTTefa@Ti,Tw%k0KPe@SaultSetSi,SumeThma0H!>OmTa{T&dT.udeTra@0Ct]D.Gu,NtTh%ToTumn0Era+OcadoOid0AkeA*AyEsomeFulKw?d0Is:ByChel%C#D+GL<)Lc#y~MbooN<aNn RRelyRga(R*lSeS-SketTt!3A^AnAutyCau'ComeEfF%eG(Ha=H(dLie=LowLtN^Nef./TrayTt Twe&Y#d3Cyc!DKeNdOlogyRdR`Tt _{AdeAmeAnketA,EakE[IndOodO[omOu'UeUrUsh_rdAtDyIlMbNeNusOkO,Rd R(gRrowSsTtomUn)XY_{etA(AndA[A=EadEezeI{Id+IefIghtIngIskOccoliOk&OnzeOomO` OwnUsh2Bb!DdyD+tFf$oIldLbLkL!tNd!Nk Rd&Rg R,SS(e[SyTt Y Zz:Bba+B(B!CtusGeKe~LmM aMpNN$N)lNdyNn#NoeNvasNy#Pab!P.$Pta(RRb#RdRgoRpetRryRtSeShS(o/!Su$TT$ogT^Teg%yTt!UghtU'Ut]Ve3Il(gL yM|NsusNturyRe$Rta(_irAlkAmp]An+AosApt Ar+A'AtEapE{Ee'EfErryE,I{&IefIldIm}yOi)Oo'R#-U{!UnkUrn0G?Nnam#Rc!Tiz&TyVil_imApArifyAwAyE<ErkEv I{I|IffImbIn-IpO{OgO'O`OudOwnUbUmpU, Ut^_^A,C#utDeFfeeIlInL!@L%LumnMb(eMeMf%tM-Mm#Mp<yNc tNdu@NfirmNg*[N}@Nsid NtrolNv()OkOlPp PyR$ReRnR*@/Tt#U^UntryUp!Ur'Us(V Yo>_{Ad!AftAmA}AshAt AwlAzyEamEd.EekEwI{etImeIspIt-OpO[Ou^OwdUci$UelUi'Umb!Un^UshYY,$2BeLtu*PPbo?dRiousRr|Rta(R=Sh]/omTe3C!:DMa+MpN)Ng R(gShUght WnY3AlBa>BrisCadeCemb CideCl(eC%a>C*a'ErF&'F(eFyG*eLayLiv M<dMi'Ni$Nti,NyP?tP&dPos.P`PutyRi=ScribeS tSignSkSpair/royTailTe@VelopVi)Vo>3AgramAlAm#dAryCeE'lEtFf G.$Gn.yLemmaNn NosaurRe@RtSag*eScov Sea'ShSmi[S%d Splay/<)V tVideV%)Zzy5Ct%Cum|G~Lph(Ma(Na>NkeyN%OrSeUb!Ve_ftAg#AmaA,-AwEamE[IftIllInkIpI=OpUmY2CkMbNeR(g/T^Ty1Arf1Nam-:G G!RlyRnR`Sily/Sy1HoOlogyOnomy0GeItUca>1F%t0G1GhtTh 2BowD E@r-Eg<tEm|Eph<tEvat%I>Se0B?kBodyBra)Er+Ot]PloyPow Pty0Ab!A@DD![D%'EmyErgyF%)Ga+G(eH<)JoyLi,OughR-hRollSu*T Ti*TryVelope1Isode0U$Uip0AA'OdeOs]R%Upt0CapeSayS&)Ta>0Ern$H-s1Id&)IlOkeOl=1A@Amp!Ce[Ch<+C.eCludeCu'Ecu>Erci'Hau,Hib.I!I,ItOt-P<dPe@Pi*Pla(Po'P*[T&dTra0EEbrow:Br-CeCultyDeIntI`~L'MeMilyMousNNcyNtasyRmSh]TT$Th TigueUltV%.e3Atu*Bru?yD $EEdElMa!N)/iv$T^V W3B Ct]EldGu*LeLmLt N$NdNeNg NishReRmR,Sc$ShTT}[X_gAmeAshAtAv%EeIghtIpOatO{O%Ow UidUshY_mCusGIlLd~owOdOtR)Re,R+tRkRtu}RumRw?dSsil/ UndX_gi!AmeEqu|EshI&dIn+OgOntO,OwnOz&U.2ElNNnyRna)RyTu*:D+tInLaxy~ yMePRa+Rba+Rd&Rl-Rm|SSpTeTh U+Ze3N $NiusN*Nt!Nu(e/u*2O,0AntFtGg!Ng RaffeRlVe_dAn)A*A[IdeImp'ObeOomOryO=OwUe_tDde[LdOdO'RillaSpelSsipV nWn_bA)A(AntApeA[Av.yEatE&IdIefItOc yOupOwUnt_rdE[IdeIltIt?N3M:B.IrLfMm M, NdPpyRb%RdRshR=,TVeWkZ?d3AdAl`ArtAvyD+hogIght~oLmetLpNRo3Dd&Gh~NtPRe/%y5BbyCkeyLdLeLiday~owMeNeyOdPeRnRr%R'Sp.$/TelUrV 5BGeM<Mb!M%Nd*dNgryNtRd!RryRtSb<d3Brid:1EOn0EaEntifyLe2N%e4LLeg$L}[0A+Ita>M&'Mu}Pa@Po'Pro=Pul'0ChCludeComeC*a'DexD-a>Do%Du,ryF<tFl-tF%mHa!H .Iti$Je@JuryMa>N Noc|PutQuiryS<eSe@SideSpi*/$lTa@T e,ToVe,V.eVol=3On0L<dOla>Sue0Em1Ory:CketGu?RZz3AlousAns~yWel9BInKeUr}yY5D+I)MpNg!Ni%Nk/:Ng?oo3EnEpT^upY3CkDD}yNdNgdomSsTT^&TeTt&Wi4EeIfeO{Ow:BBelB%Dd DyKeMpNgua+PtopR+T T(UghUndryVaWWnWsu.Y Zy3Ad AfArnA=Ctu*FtGG$G&dIsu*M#NdNg`NsOp?dSs#Tt Vel3ArB tyBr?yC&'FeFtGhtKeMbM.NkOnQuid/Tt!VeZ?d5AdAnB, C$CkG-NelyNgOpTt yUdUn+VeY$5CkyGga+Mb N?N^Xury3R-s:Ch(eDG-G}tIdIlInJ%KeMm$NNa+Nda>NgoNs]Nu$P!Rb!R^Rg(R(eRketRria+SkSs/ T^T i$ThTrixTt XimumZe3AdowAnAsu*AtCh<-D$DiaLodyLtMb M%yNt]NuRcyR+R.RryShSsa+T$Thod3Dd!DnightLk~]M-NdNimumN%Nu>Rac!Rr%S ySs/akeXXedXtu*5Bi!DelDifyMM|N.%NkeyN, N`OnR$ReRn(gSqu.oTh T]T%Unta(U'VeVie5ChFf(LeLtiplySc!SeumShroomS-/Tu$3Self/ yTh:I=MePk(Rrow/yT]Tu*3ArCkEdGati=G!@I` PhewR=/TTw%kUtr$V WsXt3CeGht5B!I'M(eeOd!Rm$R`SeTab!TeTh(gTi)VelW5C!?Mb R'T:K0EyJe@Li+Scu*S =Ta(Vious0CurE<Tob 0Or1FF Fi)T&2L1Ay0DI=Ymp-0It0CeEI#L(eLy1EnEraIn]Po'T]1An+B.Ch?dD D(?yG<I|Ig($Ph<0Tr-h0H 0Tdo%T TputTside0AlEnEr0NN 0Yg&0/ 0O}:CtDd!GeIrLa)LmNdaNelN-N` P RadeR|RkRrotRtySsT^ThTi|TrolTt nU'VeYm|3A)AnutArAs<tL-<NN$tyNcilOp!Pp Rfe@Rm.Rs#T2O}OtoRa'Ys-$0AnoCn-Ctu*E)GGe#~LotNkO} Pe/olT^Zza_)A}tA,-A>AyEa'Ed+U{UgUn+2EmEtIntL?LeLi)NdNyOlPul?Rt]S.]Ssib!/TatoTt yV tyWd W _@i)Ai'Ed-tEf Epa*Es|EttyEv|I)IdeIm?yIntI%.yIs#Iva>IzeOb!mO)[Odu)Of.OgramOje@Omo>OofOp tyOsp O>@OudOvide2Bl-Dd(g~LpL'Mpk(N^PilPpyR^a'R.yRpo'R'ShTZz!3Ramid:99Al.yAntumArt E,]I{ItIzO>:Bb.Cco#CeCkD?DioIlInI'~yMpN^NdomN+PidReTeTh V&WZ%3AdyAlAs#BelBuildC$lCei=CipeC%dCyc!Du)F!@F%mFu'G]G*tGul?Je@LaxLea'LiefLyMa(Memb M(dMo=Nd NewNtOp&PairPeatPla)P%tQui*ScueSemb!Si,Sour)Sp#'SultTi*T*atTurnUn]Ve$ViewW?d2Y`m0BBb#CeChDeD+F!GhtGidNgOtPp!SkTu$V$V 5AdA,BotBu,CketM<)OfOkieOmSeTa>UghUndU>Y$5Bb DeGLeNNwayR$:DDd!D}[FeIlLadLm#L#LtLu>MeMp!NdTisfyToshiU)Usa+VeY1A!AnA*Att E}HemeHoolI&)I[%sOrp]OutRapRe&RiptRub1AAr^As#AtC#dC*tCt]Cur.yEdEkGm|Le@~M(?Ni%N'Nt&)RiesRvi)Ss]Tt!TupV&_dowAftAllowA*EdEllEriffIeldIftI}IpIv O{OeOotOpOrtOuld O=RimpRugUff!Y0Bl(gCkDeE+GhtGnL|Lk~yLv Mil?Mp!N)NgR&/ Tua>XZe1A>Et^IIllInIrtUll0AbAmEepEnd I)IdeIghtImOg<OtOwUsh0AllArtI!OkeOo`0A{AkeApIffOw0ApCc Ci$CkDaFtL?Ldi LidLut]L=Me#eNgOnRryRtUlUndUpUr)U`0A)A*Ati$AwnEakEci$EedEllEndH eI)Id IkeInIr.L.OilOns%O#OrtOtRayReadR(gY0Ua*UeezeUir*l_b!AdiumAffA+AirsAmpAndArtA>AyEakEelEmEpE*oI{IllIngO{Oma^O}OolOryO=Ra>gyReetRikeR#gRugg!Ud|UffUmb!Y!0Bje@Bm.BwayC)[ChDd&Ff G?G+,ItMm NNnyN'tP PplyP*meReRfa)R+Rpri'RroundR=ySpe@/a(1AllowAmpApArmE?EetIftImIngIt^Ord1MbolMptomRup/em:B!Ck!GIlL|LkNkPeR+tSk/eTtooXi3A^Am~NN<tNnisNtRm/Xt_nkAtEmeEnE%yE*EyIngIsOughtReeRi=RowUmbUnd 0CketDeG LtMb MeNyPRedSsueT!5A,BaccoDayDdl EGe` I!tK&MatoM%rowNeNgueNightOlO`PP-Pp!R^RnadoRtoi'SsT$Uri,W?dW WnY_{AdeAff-Ag-A(Ansf ApAshA=lAyEatEeEndI$IbeI{Igg ImIpOphyOub!U{UeUlyUmpetU,U`Y2BeIt]Mb!NaN}lRkeyRnRt!1El=EntyI)InI,O1PeP-$:5Ly5B*lla0Ab!Awa*C!Cov D DoFairFoldHappyIf%mIqueItIv 'KnownLo{TilUsu$Veil1Da>GradeHoldOnP Set1B<Ge0A+EEdEfulE![U$0Il.y:C<tCuumGueLidL!yL=NNishP%Rious/Ult3H-!L=tNd%Ntu*NueRbRifyRs]RyS'lT <3Ab!Br<tCiousCt%yDeoEw~a+Nta+Ol(Rtu$RusSaS.Su$T$Vid5C$I)IdLc<oLumeTeYa+:GeG#ItLk~LnutNtRfa*RmRri%ShSp/eT VeY3Al`Ap#ArA'lA` BDd(gEk&dIrdLcome/T_!AtEatEelEnE*IpIsp 0DeD`FeLd~NNdowNeNgNkNn Nt ReSdomSeShT}[5LfM<Nd OdOlRdRkRldRryR`_pE{E,!I,I>Ong::Rd3Ar~ow9UUngU`:3BraRo9NeO\";\nconst checksum = \"0x3c8acc1e7b08d8e76f9fda015ef48dc8c710a73cb7e0f77b2c18a9b5a7adde60\";\nlet wordlist = null;\n/**\n *  The [[link-bip39-en]] for [mnemonic phrases](link-bip-39).\n *\n *  @_docloc: api/wordlists\n */\nexport class LangEn extends WordlistOwl {\n    /**\n     *  Creates a new instance of the English language Wordlist.\n     *\n     *  This should be unnecessary most of the time as the exported\n     *  [[langEn]] should suffice.\n     *\n     *  @_ignore:\n     */\n    constructor() { super(\"en\", words, checksum); }\n    /**\n     *  Returns a singleton instance of a ``LangEn``, creating it\n     *  if this is the first time being called.\n     */\n    static wordlist() {\n        if (wordlist == null) {\n            wordlist = new LangEn();\n        }\n        return wordlist;\n    }\n}\n//# sourceMappingURL=lang-en.js.map","import { pbkdf2, sha256 } from \"../crypto/index.js\";\nimport { defineProperties, getBytes, hexlify, assertNormalize, assertPrivate, assertArgument, toUtf8Bytes } from \"../utils/index.js\";\nimport { LangEn } from \"../wordlists/lang-en.js\";\n// Returns a byte with the MSB bits set\nfunction getUpperMask(bits) {\n    return ((1 << bits) - 1) << (8 - bits) & 0xff;\n}\n// Returns a byte with the LSB bits set\nfunction getLowerMask(bits) {\n    return ((1 << bits) - 1) & 0xff;\n}\nfunction mnemonicToEntropy(mnemonic, wordlist) {\n    assertNormalize(\"NFKD\");\n    if (wordlist == null) {\n        wordlist = LangEn.wordlist();\n    }\n    const words = wordlist.split(mnemonic);\n    assertArgument((words.length % 3) === 0 && words.length >= 12 && words.length <= 24, \"invalid mnemonic length\", \"mnemonic\", \"[ REDACTED ]\");\n    const entropy = new Uint8Array(Math.ceil(11 * words.length / 8));\n    let offset = 0;\n    for (let i = 0; i < words.length; i++) {\n        let index = wordlist.getWordIndex(words[i].normalize(\"NFKD\"));\n        assertArgument(index >= 0, `invalid mnemonic word at index ${i}`, \"mnemonic\", \"[ REDACTED ]\");\n        for (let bit = 0; bit < 11; bit++) {\n            if (index & (1 << (10 - bit))) {\n                entropy[offset >> 3] |= (1 << (7 - (offset % 8)));\n            }\n            offset++;\n        }\n    }\n    const entropyBits = 32 * words.length / 3;\n    const checksumBits = words.length / 3;\n    const checksumMask = getUpperMask(checksumBits);\n    const checksum = getBytes(sha256(entropy.slice(0, entropyBits / 8)))[0] & checksumMask;\n    assertArgument(checksum === (entropy[entropy.length - 1] & checksumMask), \"invalid mnemonic checksum\", \"mnemonic\", \"[ REDACTED ]\");\n    return hexlify(entropy.slice(0, entropyBits / 8));\n}\nfunction entropyToMnemonic(entropy, wordlist) {\n    assertArgument((entropy.length % 4) === 0 && entropy.length >= 16 && entropy.length <= 32, \"invalid entropy size\", \"entropy\", \"[ REDACTED ]\");\n    if (wordlist == null) {\n        wordlist = LangEn.wordlist();\n    }\n    const indices = [0];\n    let remainingBits = 11;\n    for (let i = 0; i < entropy.length; i++) {\n        // Consume the whole byte (with still more to go)\n        if (remainingBits > 8) {\n            indices[indices.length - 1] <<= 8;\n            indices[indices.length - 1] |= entropy[i];\n            remainingBits -= 8;\n            // This byte will complete an 11-bit index\n        }\n        else {\n            indices[indices.length - 1] <<= remainingBits;\n            indices[indices.length - 1] |= entropy[i] >> (8 - remainingBits);\n            // Start the next word\n            indices.push(entropy[i] & getLowerMask(8 - remainingBits));\n            remainingBits += 3;\n        }\n    }\n    // Compute the checksum bits\n    const checksumBits = entropy.length / 4;\n    const checksum = parseInt(sha256(entropy).substring(2, 4), 16) & getUpperMask(checksumBits);\n    // Shift the checksum into the word indices\n    indices[indices.length - 1] <<= checksumBits;\n    indices[indices.length - 1] |= (checksum >> (8 - checksumBits));\n    return wordlist.join(indices.map((index) => wordlist.getWord(index)));\n}\nconst _guard = {};\n/**\n *  A **Mnemonic** wraps all properties required to compute [[link-bip-39]]\n *  seeds and convert between phrases and entropy.\n */\nexport class Mnemonic {\n    /**\n     *  The mnemonic phrase of 12, 15, 18, 21 or 24 words.\n     *\n     *  Use the [[wordlist]] ``split`` method to get the individual words.\n     */\n    phrase;\n    /**\n     *  The password used for this mnemonic. If no password is used this\n     *  is the empty string (i.e. ``\"\"``) as per the specification.\n     */\n    password;\n    /**\n     *  The wordlist for this mnemonic.\n     */\n    wordlist;\n    /**\n     *  The underlying entropy which the mnemonic encodes.\n     */\n    entropy;\n    /**\n     *  @private\n     */\n    constructor(guard, entropy, phrase, password, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (wordlist == null) {\n            wordlist = LangEn.wordlist();\n        }\n        assertPrivate(guard, _guard, \"Mnemonic\");\n        defineProperties(this, { phrase, password, wordlist, entropy });\n    }\n    /**\n     *  Returns the seed for the mnemonic.\n     */\n    computeSeed() {\n        const salt = toUtf8Bytes(\"mnemonic\" + this.password, \"NFKD\");\n        return pbkdf2(toUtf8Bytes(this.phrase, \"NFKD\"), salt, 2048, 64, \"sha512\");\n    }\n    /**\n     *  Creates a new Mnemonic for the %%phrase%%.\n     *\n     *  The default %%password%% is the empty string and the default\n     *  wordlist is the [English wordlists](LangEn).\n     */\n    static fromPhrase(phrase, password, wordlist) {\n        // Normalize the case and space; throws if invalid\n        const entropy = mnemonicToEntropy(phrase, wordlist);\n        phrase = entropyToMnemonic(getBytes(entropy), wordlist);\n        return new Mnemonic(_guard, entropy, phrase, password, wordlist);\n    }\n    /**\n     *  Create a new **Mnemonic** from the %%entropy%%.\n     *\n     *  The default %%password%% is the empty string and the default\n     *  wordlist is the [English wordlists](LangEn).\n     */\n    static fromEntropy(_entropy, password, wordlist) {\n        const entropy = getBytes(_entropy, \"entropy\");\n        const phrase = entropyToMnemonic(entropy, wordlist);\n        return new Mnemonic(_guard, hexlify(entropy), phrase, password, wordlist);\n    }\n    /**\n     *  Returns the phrase for %%mnemonic%%.\n     */\n    static entropyToPhrase(_entropy, wordlist) {\n        const entropy = getBytes(_entropy, \"entropy\");\n        return entropyToMnemonic(entropy, wordlist);\n    }\n    /**\n     *  Returns the entropy for %%phrase%%.\n     */\n    static phraseToEntropy(phrase, wordlist) {\n        return mnemonicToEntropy(phrase, wordlist);\n    }\n    /**\n     *  Returns true if %%phrase%% is a valid [[link-bip-39]] phrase.\n     *\n     *  This checks all the provided words belong to the %%wordlist%%,\n     *  that the length is valid and the checksum is correct.\n     */\n    static isValidMnemonic(phrase, wordlist) {\n        try {\n            mnemonicToEntropy(phrase, wordlist);\n            return true;\n        }\n        catch (error) { }\n        return false;\n    }\n}\n//# sourceMappingURL=mnemonic.js.map","/*! MIT License. Copyright 2015-2022 Richard Moore <me@ricmoo.com>. See LICENSE.txt. */\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar _AES_key, _AES_Kd, _AES_Ke;\n// Number of rounds by keysize\nconst numberOfRounds = { 16: 10, 24: 12, 32: 14 };\n// Round constant words\nconst rcon = [0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab, 0x4d, 0x9a, 0x2f, 0x5e, 0xbc, 0x63, 0xc6, 0x97, 0x35, 0x6a, 0xd4, 0xb3, 0x7d, 0xfa, 0xef, 0xc5, 0x91];\n// S-box and Inverse S-box (S is for Substitution)\nconst S = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16];\nconst Si = [0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d];\n// Transformations for encryption\nconst T1 = [0xc66363a5, 0xf87c7c84, 0xee777799, 0xf67b7b8d, 0xfff2f20d, 0xd66b6bbd, 0xde6f6fb1, 0x91c5c554, 0x60303050, 0x02010103, 0xce6767a9, 0x562b2b7d, 0xe7fefe19, 0xb5d7d762, 0x4dababe6, 0xec76769a, 0x8fcaca45, 0x1f82829d, 0x89c9c940, 0xfa7d7d87, 0xeffafa15, 0xb25959eb, 0x8e4747c9, 0xfbf0f00b, 0x41adadec, 0xb3d4d467, 0x5fa2a2fd, 0x45afafea, 0x239c9cbf, 0x53a4a4f7, 0xe4727296, 0x9bc0c05b, 0x75b7b7c2, 0xe1fdfd1c, 0x3d9393ae, 0x4c26266a, 0x6c36365a, 0x7e3f3f41, 0xf5f7f702, 0x83cccc4f, 0x6834345c, 0x51a5a5f4, 0xd1e5e534, 0xf9f1f108, 0xe2717193, 0xabd8d873, 0x62313153, 0x2a15153f, 0x0804040c, 0x95c7c752, 0x46232365, 0x9dc3c35e, 0x30181828, 0x379696a1, 0x0a05050f, 0x2f9a9ab5, 0x0e070709, 0x24121236, 0x1b80809b, 0xdfe2e23d, 0xcdebeb26, 0x4e272769, 0x7fb2b2cd, 0xea75759f, 0x1209091b, 0x1d83839e, 0x582c2c74, 0x341a1a2e, 0x361b1b2d, 0xdc6e6eb2, 0xb45a5aee, 0x5ba0a0fb, 0xa45252f6, 0x763b3b4d, 0xb7d6d661, 0x7db3b3ce, 0x5229297b, 0xdde3e33e, 0x5e2f2f71, 0x13848497, 0xa65353f5, 0xb9d1d168, 0x00000000, 0xc1eded2c, 0x40202060, 0xe3fcfc1f, 0x79b1b1c8, 0xb65b5bed, 0xd46a6abe, 0x8dcbcb46, 0x67bebed9, 0x7239394b, 0x944a4ade, 0x984c4cd4, 0xb05858e8, 0x85cfcf4a, 0xbbd0d06b, 0xc5efef2a, 0x4faaaae5, 0xedfbfb16, 0x864343c5, 0x9a4d4dd7, 0x66333355, 0x11858594, 0x8a4545cf, 0xe9f9f910, 0x04020206, 0xfe7f7f81, 0xa05050f0, 0x783c3c44, 0x259f9fba, 0x4ba8a8e3, 0xa25151f3, 0x5da3a3fe, 0x804040c0, 0x058f8f8a, 0x3f9292ad, 0x219d9dbc, 0x70383848, 0xf1f5f504, 0x63bcbcdf, 0x77b6b6c1, 0xafdada75, 0x42212163, 0x20101030, 0xe5ffff1a, 0xfdf3f30e, 0xbfd2d26d, 0x81cdcd4c, 0x180c0c14, 0x26131335, 0xc3ecec2f, 0xbe5f5fe1, 0x359797a2, 0x884444cc, 0x2e171739, 0x93c4c457, 0x55a7a7f2, 0xfc7e7e82, 0x7a3d3d47, 0xc86464ac, 0xba5d5de7, 0x3219192b, 0xe6737395, 0xc06060a0, 0x19818198, 0x9e4f4fd1, 0xa3dcdc7f, 0x44222266, 0x542a2a7e, 0x3b9090ab, 0x0b888883, 0x8c4646ca, 0xc7eeee29, 0x6bb8b8d3, 0x2814143c, 0xa7dede79, 0xbc5e5ee2, 0x160b0b1d, 0xaddbdb76, 0xdbe0e03b, 0x64323256, 0x743a3a4e, 0x140a0a1e, 0x924949db, 0x0c06060a, 0x4824246c, 0xb85c5ce4, 0x9fc2c25d, 0xbdd3d36e, 0x43acacef, 0xc46262a6, 0x399191a8, 0x319595a4, 0xd3e4e437, 0xf279798b, 0xd5e7e732, 0x8bc8c843, 0x6e373759, 0xda6d6db7, 0x018d8d8c, 0xb1d5d564, 0x9c4e4ed2, 0x49a9a9e0, 0xd86c6cb4, 0xac5656fa, 0xf3f4f407, 0xcfeaea25, 0xca6565af, 0xf47a7a8e, 0x47aeaee9, 0x10080818, 0x6fbabad5, 0xf0787888, 0x4a25256f, 0x5c2e2e72, 0x381c1c24, 0x57a6a6f1, 0x73b4b4c7, 0x97c6c651, 0xcbe8e823, 0xa1dddd7c, 0xe874749c, 0x3e1f1f21, 0x964b4bdd, 0x61bdbddc, 0x0d8b8b86, 0x0f8a8a85, 0xe0707090, 0x7c3e3e42, 0x71b5b5c4, 0xcc6666aa, 0x904848d8, 0x06030305, 0xf7f6f601, 0x1c0e0e12, 0xc26161a3, 0x6a35355f, 0xae5757f9, 0x69b9b9d0, 0x17868691, 0x99c1c158, 0x3a1d1d27, 0x279e9eb9, 0xd9e1e138, 0xebf8f813, 0x2b9898b3, 0x22111133, 0xd26969bb, 0xa9d9d970, 0x078e8e89, 0x339494a7, 0x2d9b9bb6, 0x3c1e1e22, 0x15878792, 0xc9e9e920, 0x87cece49, 0xaa5555ff, 0x50282878, 0xa5dfdf7a, 0x038c8c8f, 0x59a1a1f8, 0x09898980, 0x1a0d0d17, 0x65bfbfda, 0xd7e6e631, 0x844242c6, 0xd06868b8, 0x824141c3, 0x299999b0, 0x5a2d2d77, 0x1e0f0f11, 0x7bb0b0cb, 0xa85454fc, 0x6dbbbbd6, 0x2c16163a];\nconst T2 = [0xa5c66363, 0x84f87c7c, 0x99ee7777, 0x8df67b7b, 0x0dfff2f2, 0xbdd66b6b, 0xb1de6f6f, 0x5491c5c5, 0x50603030, 0x03020101, 0xa9ce6767, 0x7d562b2b, 0x19e7fefe, 0x62b5d7d7, 0xe64dabab, 0x9aec7676, 0x458fcaca, 0x9d1f8282, 0x4089c9c9, 0x87fa7d7d, 0x15effafa, 0xebb25959, 0xc98e4747, 0x0bfbf0f0, 0xec41adad, 0x67b3d4d4, 0xfd5fa2a2, 0xea45afaf, 0xbf239c9c, 0xf753a4a4, 0x96e47272, 0x5b9bc0c0, 0xc275b7b7, 0x1ce1fdfd, 0xae3d9393, 0x6a4c2626, 0x5a6c3636, 0x417e3f3f, 0x02f5f7f7, 0x4f83cccc, 0x5c683434, 0xf451a5a5, 0x34d1e5e5, 0x08f9f1f1, 0x93e27171, 0x73abd8d8, 0x53623131, 0x3f2a1515, 0x0c080404, 0x5295c7c7, 0x65462323, 0x5e9dc3c3, 0x28301818, 0xa1379696, 0x0f0a0505, 0xb52f9a9a, 0x090e0707, 0x36241212, 0x9b1b8080, 0x3ddfe2e2, 0x26cdebeb, 0x694e2727, 0xcd7fb2b2, 0x9fea7575, 0x1b120909, 0x9e1d8383, 0x74582c2c, 0x2e341a1a, 0x2d361b1b, 0xb2dc6e6e, 0xeeb45a5a, 0xfb5ba0a0, 0xf6a45252, 0x4d763b3b, 0x61b7d6d6, 0xce7db3b3, 0x7b522929, 0x3edde3e3, 0x715e2f2f, 0x97138484, 0xf5a65353, 0x68b9d1d1, 0x00000000, 0x2cc1eded, 0x60402020, 0x1fe3fcfc, 0xc879b1b1, 0xedb65b5b, 0xbed46a6a, 0x468dcbcb, 0xd967bebe, 0x4b723939, 0xde944a4a, 0xd4984c4c, 0xe8b05858, 0x4a85cfcf, 0x6bbbd0d0, 0x2ac5efef, 0xe54faaaa, 0x16edfbfb, 0xc5864343, 0xd79a4d4d, 0x55663333, 0x94118585, 0xcf8a4545, 0x10e9f9f9, 0x06040202, 0x81fe7f7f, 0xf0a05050, 0x44783c3c, 0xba259f9f, 0xe34ba8a8, 0xf3a25151, 0xfe5da3a3, 0xc0804040, 0x8a058f8f, 0xad3f9292, 0xbc219d9d, 0x48703838, 0x04f1f5f5, 0xdf63bcbc, 0xc177b6b6, 0x75afdada, 0x63422121, 0x30201010, 0x1ae5ffff, 0x0efdf3f3, 0x6dbfd2d2, 0x4c81cdcd, 0x14180c0c, 0x35261313, 0x2fc3ecec, 0xe1be5f5f, 0xa2359797, 0xcc884444, 0x392e1717, 0x5793c4c4, 0xf255a7a7, 0x82fc7e7e, 0x477a3d3d, 0xacc86464, 0xe7ba5d5d, 0x2b321919, 0x95e67373, 0xa0c06060, 0x98198181, 0xd19e4f4f, 0x7fa3dcdc, 0x66442222, 0x7e542a2a, 0xab3b9090, 0x830b8888, 0xca8c4646, 0x29c7eeee, 0xd36bb8b8, 0x3c281414, 0x79a7dede, 0xe2bc5e5e, 0x1d160b0b, 0x76addbdb, 0x3bdbe0e0, 0x56643232, 0x4e743a3a, 0x1e140a0a, 0xdb924949, 0x0a0c0606, 0x6c482424, 0xe4b85c5c, 0x5d9fc2c2, 0x6ebdd3d3, 0xef43acac, 0xa6c46262, 0xa8399191, 0xa4319595, 0x37d3e4e4, 0x8bf27979, 0x32d5e7e7, 0x438bc8c8, 0x596e3737, 0xb7da6d6d, 0x8c018d8d, 0x64b1d5d5, 0xd29c4e4e, 0xe049a9a9, 0xb4d86c6c, 0xfaac5656, 0x07f3f4f4, 0x25cfeaea, 0xafca6565, 0x8ef47a7a, 0xe947aeae, 0x18100808, 0xd56fbaba, 0x88f07878, 0x6f4a2525, 0x725c2e2e, 0x24381c1c, 0xf157a6a6, 0xc773b4b4, 0x5197c6c6, 0x23cbe8e8, 0x7ca1dddd, 0x9ce87474, 0x213e1f1f, 0xdd964b4b, 0xdc61bdbd, 0x860d8b8b, 0x850f8a8a, 0x90e07070, 0x427c3e3e, 0xc471b5b5, 0xaacc6666, 0xd8904848, 0x05060303, 0x01f7f6f6, 0x121c0e0e, 0xa3c26161, 0x5f6a3535, 0xf9ae5757, 0xd069b9b9, 0x91178686, 0x5899c1c1, 0x273a1d1d, 0xb9279e9e, 0x38d9e1e1, 0x13ebf8f8, 0xb32b9898, 0x33221111, 0xbbd26969, 0x70a9d9d9, 0x89078e8e, 0xa7339494, 0xb62d9b9b, 0x223c1e1e, 0x92158787, 0x20c9e9e9, 0x4987cece, 0xffaa5555, 0x78502828, 0x7aa5dfdf, 0x8f038c8c, 0xf859a1a1, 0x80098989, 0x171a0d0d, 0xda65bfbf, 0x31d7e6e6, 0xc6844242, 0xb8d06868, 0xc3824141, 0xb0299999, 0x775a2d2d, 0x111e0f0f, 0xcb7bb0b0, 0xfca85454, 0xd66dbbbb, 0x3a2c1616];\nconst T3 = [0x63a5c663, 0x7c84f87c, 0x7799ee77, 0x7b8df67b, 0xf20dfff2, 0x6bbdd66b, 0x6fb1de6f, 0xc55491c5, 0x30506030, 0x01030201, 0x67a9ce67, 0x2b7d562b, 0xfe19e7fe, 0xd762b5d7, 0xabe64dab, 0x769aec76, 0xca458fca, 0x829d1f82, 0xc94089c9, 0x7d87fa7d, 0xfa15effa, 0x59ebb259, 0x47c98e47, 0xf00bfbf0, 0xadec41ad, 0xd467b3d4, 0xa2fd5fa2, 0xafea45af, 0x9cbf239c, 0xa4f753a4, 0x7296e472, 0xc05b9bc0, 0xb7c275b7, 0xfd1ce1fd, 0x93ae3d93, 0x266a4c26, 0x365a6c36, 0x3f417e3f, 0xf702f5f7, 0xcc4f83cc, 0x345c6834, 0xa5f451a5, 0xe534d1e5, 0xf108f9f1, 0x7193e271, 0xd873abd8, 0x31536231, 0x153f2a15, 0x040c0804, 0xc75295c7, 0x23654623, 0xc35e9dc3, 0x18283018, 0x96a13796, 0x050f0a05, 0x9ab52f9a, 0x07090e07, 0x12362412, 0x809b1b80, 0xe23ddfe2, 0xeb26cdeb, 0x27694e27, 0xb2cd7fb2, 0x759fea75, 0x091b1209, 0x839e1d83, 0x2c74582c, 0x1a2e341a, 0x1b2d361b, 0x6eb2dc6e, 0x5aeeb45a, 0xa0fb5ba0, 0x52f6a452, 0x3b4d763b, 0xd661b7d6, 0xb3ce7db3, 0x297b5229, 0xe33edde3, 0x2f715e2f, 0x84971384, 0x53f5a653, 0xd168b9d1, 0x00000000, 0xed2cc1ed, 0x20604020, 0xfc1fe3fc, 0xb1c879b1, 0x5bedb65b, 0x6abed46a, 0xcb468dcb, 0xbed967be, 0x394b7239, 0x4ade944a, 0x4cd4984c, 0x58e8b058, 0xcf4a85cf, 0xd06bbbd0, 0xef2ac5ef, 0xaae54faa, 0xfb16edfb, 0x43c58643, 0x4dd79a4d, 0x33556633, 0x85941185, 0x45cf8a45, 0xf910e9f9, 0x02060402, 0x7f81fe7f, 0x50f0a050, 0x3c44783c, 0x9fba259f, 0xa8e34ba8, 0x51f3a251, 0xa3fe5da3, 0x40c08040, 0x8f8a058f, 0x92ad3f92, 0x9dbc219d, 0x38487038, 0xf504f1f5, 0xbcdf63bc, 0xb6c177b6, 0xda75afda, 0x21634221, 0x10302010, 0xff1ae5ff, 0xf30efdf3, 0xd26dbfd2, 0xcd4c81cd, 0x0c14180c, 0x13352613, 0xec2fc3ec, 0x5fe1be5f, 0x97a23597, 0x44cc8844, 0x17392e17, 0xc45793c4, 0xa7f255a7, 0x7e82fc7e, 0x3d477a3d, 0x64acc864, 0x5de7ba5d, 0x192b3219, 0x7395e673, 0x60a0c060, 0x81981981, 0x4fd19e4f, 0xdc7fa3dc, 0x22664422, 0x2a7e542a, 0x90ab3b90, 0x88830b88, 0x46ca8c46, 0xee29c7ee, 0xb8d36bb8, 0x143c2814, 0xde79a7de, 0x5ee2bc5e, 0x0b1d160b, 0xdb76addb, 0xe03bdbe0, 0x32566432, 0x3a4e743a, 0x0a1e140a, 0x49db9249, 0x060a0c06, 0x246c4824, 0x5ce4b85c, 0xc25d9fc2, 0xd36ebdd3, 0xacef43ac, 0x62a6c462, 0x91a83991, 0x95a43195, 0xe437d3e4, 0x798bf279, 0xe732d5e7, 0xc8438bc8, 0x37596e37, 0x6db7da6d, 0x8d8c018d, 0xd564b1d5, 0x4ed29c4e, 0xa9e049a9, 0x6cb4d86c, 0x56faac56, 0xf407f3f4, 0xea25cfea, 0x65afca65, 0x7a8ef47a, 0xaee947ae, 0x08181008, 0xbad56fba, 0x7888f078, 0x256f4a25, 0x2e725c2e, 0x1c24381c, 0xa6f157a6, 0xb4c773b4, 0xc65197c6, 0xe823cbe8, 0xdd7ca1dd, 0x749ce874, 0x1f213e1f, 0x4bdd964b, 0xbddc61bd, 0x8b860d8b, 0x8a850f8a, 0x7090e070, 0x3e427c3e, 0xb5c471b5, 0x66aacc66, 0x48d89048, 0x03050603, 0xf601f7f6, 0x0e121c0e, 0x61a3c261, 0x355f6a35, 0x57f9ae57, 0xb9d069b9, 0x86911786, 0xc15899c1, 0x1d273a1d, 0x9eb9279e, 0xe138d9e1, 0xf813ebf8, 0x98b32b98, 0x11332211, 0x69bbd269, 0xd970a9d9, 0x8e89078e, 0x94a73394, 0x9bb62d9b, 0x1e223c1e, 0x87921587, 0xe920c9e9, 0xce4987ce, 0x55ffaa55, 0x28785028, 0xdf7aa5df, 0x8c8f038c, 0xa1f859a1, 0x89800989, 0x0d171a0d, 0xbfda65bf, 0xe631d7e6, 0x42c68442, 0x68b8d068, 0x41c38241, 0x99b02999, 0x2d775a2d, 0x0f111e0f, 0xb0cb7bb0, 0x54fca854, 0xbbd66dbb, 0x163a2c16];\nconst T4 = [0x6363a5c6, 0x7c7c84f8, 0x777799ee, 0x7b7b8df6, 0xf2f20dff, 0x6b6bbdd6, 0x6f6fb1de, 0xc5c55491, 0x30305060, 0x01010302, 0x6767a9ce, 0x2b2b7d56, 0xfefe19e7, 0xd7d762b5, 0xababe64d, 0x76769aec, 0xcaca458f, 0x82829d1f, 0xc9c94089, 0x7d7d87fa, 0xfafa15ef, 0x5959ebb2, 0x4747c98e, 0xf0f00bfb, 0xadadec41, 0xd4d467b3, 0xa2a2fd5f, 0xafafea45, 0x9c9cbf23, 0xa4a4f753, 0x727296e4, 0xc0c05b9b, 0xb7b7c275, 0xfdfd1ce1, 0x9393ae3d, 0x26266a4c, 0x36365a6c, 0x3f3f417e, 0xf7f702f5, 0xcccc4f83, 0x34345c68, 0xa5a5f451, 0xe5e534d1, 0xf1f108f9, 0x717193e2, 0xd8d873ab, 0x31315362, 0x15153f2a, 0x04040c08, 0xc7c75295, 0x23236546, 0xc3c35e9d, 0x18182830, 0x9696a137, 0x05050f0a, 0x9a9ab52f, 0x0707090e, 0x12123624, 0x80809b1b, 0xe2e23ddf, 0xebeb26cd, 0x2727694e, 0xb2b2cd7f, 0x75759fea, 0x09091b12, 0x83839e1d, 0x2c2c7458, 0x1a1a2e34, 0x1b1b2d36, 0x6e6eb2dc, 0x5a5aeeb4, 0xa0a0fb5b, 0x5252f6a4, 0x3b3b4d76, 0xd6d661b7, 0xb3b3ce7d, 0x29297b52, 0xe3e33edd, 0x2f2f715e, 0x84849713, 0x5353f5a6, 0xd1d168b9, 0x00000000, 0xeded2cc1, 0x20206040, 0xfcfc1fe3, 0xb1b1c879, 0x5b5bedb6, 0x6a6abed4, 0xcbcb468d, 0xbebed967, 0x39394b72, 0x4a4ade94, 0x4c4cd498, 0x5858e8b0, 0xcfcf4a85, 0xd0d06bbb, 0xefef2ac5, 0xaaaae54f, 0xfbfb16ed, 0x4343c586, 0x4d4dd79a, 0x33335566, 0x85859411, 0x4545cf8a, 0xf9f910e9, 0x02020604, 0x7f7f81fe, 0x5050f0a0, 0x3c3c4478, 0x9f9fba25, 0xa8a8e34b, 0x5151f3a2, 0xa3a3fe5d, 0x4040c080, 0x8f8f8a05, 0x9292ad3f, 0x9d9dbc21, 0x38384870, 0xf5f504f1, 0xbcbcdf63, 0xb6b6c177, 0xdada75af, 0x21216342, 0x10103020, 0xffff1ae5, 0xf3f30efd, 0xd2d26dbf, 0xcdcd4c81, 0x0c0c1418, 0x13133526, 0xecec2fc3, 0x5f5fe1be, 0x9797a235, 0x4444cc88, 0x1717392e, 0xc4c45793, 0xa7a7f255, 0x7e7e82fc, 0x3d3d477a, 0x6464acc8, 0x5d5de7ba, 0x19192b32, 0x737395e6, 0x6060a0c0, 0x81819819, 0x4f4fd19e, 0xdcdc7fa3, 0x22226644, 0x2a2a7e54, 0x9090ab3b, 0x8888830b, 0x4646ca8c, 0xeeee29c7, 0xb8b8d36b, 0x14143c28, 0xdede79a7, 0x5e5ee2bc, 0x0b0b1d16, 0xdbdb76ad, 0xe0e03bdb, 0x32325664, 0x3a3a4e74, 0x0a0a1e14, 0x4949db92, 0x06060a0c, 0x24246c48, 0x5c5ce4b8, 0xc2c25d9f, 0xd3d36ebd, 0xacacef43, 0x6262a6c4, 0x9191a839, 0x9595a431, 0xe4e437d3, 0x79798bf2, 0xe7e732d5, 0xc8c8438b, 0x3737596e, 0x6d6db7da, 0x8d8d8c01, 0xd5d564b1, 0x4e4ed29c, 0xa9a9e049, 0x6c6cb4d8, 0x5656faac, 0xf4f407f3, 0xeaea25cf, 0x6565afca, 0x7a7a8ef4, 0xaeaee947, 0x08081810, 0xbabad56f, 0x787888f0, 0x25256f4a, 0x2e2e725c, 0x1c1c2438, 0xa6a6f157, 0xb4b4c773, 0xc6c65197, 0xe8e823cb, 0xdddd7ca1, 0x74749ce8, 0x1f1f213e, 0x4b4bdd96, 0xbdbddc61, 0x8b8b860d, 0x8a8a850f, 0x707090e0, 0x3e3e427c, 0xb5b5c471, 0x6666aacc, 0x4848d890, 0x03030506, 0xf6f601f7, 0x0e0e121c, 0x6161a3c2, 0x35355f6a, 0x5757f9ae, 0xb9b9d069, 0x86869117, 0xc1c15899, 0x1d1d273a, 0x9e9eb927, 0xe1e138d9, 0xf8f813eb, 0x9898b32b, 0x11113322, 0x6969bbd2, 0xd9d970a9, 0x8e8e8907, 0x9494a733, 0x9b9bb62d, 0x1e1e223c, 0x87879215, 0xe9e920c9, 0xcece4987, 0x5555ffaa, 0x28287850, 0xdfdf7aa5, 0x8c8c8f03, 0xa1a1f859, 0x89898009, 0x0d0d171a, 0xbfbfda65, 0xe6e631d7, 0x4242c684, 0x6868b8d0, 0x4141c382, 0x9999b029, 0x2d2d775a, 0x0f0f111e, 0xb0b0cb7b, 0x5454fca8, 0xbbbbd66d, 0x16163a2c];\n// Transformations for decryption\nconst T5 = [0x51f4a750, 0x7e416553, 0x1a17a4c3, 0x3a275e96, 0x3bab6bcb, 0x1f9d45f1, 0xacfa58ab, 0x4be30393, 0x2030fa55, 0xad766df6, 0x88cc7691, 0xf5024c25, 0x4fe5d7fc, 0xc52acbd7, 0x26354480, 0xb562a38f, 0xdeb15a49, 0x25ba1b67, 0x45ea0e98, 0x5dfec0e1, 0xc32f7502, 0x814cf012, 0x8d4697a3, 0x6bd3f9c6, 0x038f5fe7, 0x15929c95, 0xbf6d7aeb, 0x955259da, 0xd4be832d, 0x587421d3, 0x49e06929, 0x8ec9c844, 0x75c2896a, 0xf48e7978, 0x99583e6b, 0x27b971dd, 0xbee14fb6, 0xf088ad17, 0xc920ac66, 0x7dce3ab4, 0x63df4a18, 0xe51a3182, 0x97513360, 0x62537f45, 0xb16477e0, 0xbb6bae84, 0xfe81a01c, 0xf9082b94, 0x70486858, 0x8f45fd19, 0x94de6c87, 0x527bf8b7, 0xab73d323, 0x724b02e2, 0xe31f8f57, 0x6655ab2a, 0xb2eb2807, 0x2fb5c203, 0x86c57b9a, 0xd33708a5, 0x302887f2, 0x23bfa5b2, 0x02036aba, 0xed16825c, 0x8acf1c2b, 0xa779b492, 0xf307f2f0, 0x4e69e2a1, 0x65daf4cd, 0x0605bed5, 0xd134621f, 0xc4a6fe8a, 0x342e539d, 0xa2f355a0, 0x058ae132, 0xa4f6eb75, 0x0b83ec39, 0x4060efaa, 0x5e719f06, 0xbd6e1051, 0x3e218af9, 0x96dd063d, 0xdd3e05ae, 0x4de6bd46, 0x91548db5, 0x71c45d05, 0x0406d46f, 0x605015ff, 0x1998fb24, 0xd6bde997, 0x894043cc, 0x67d99e77, 0xb0e842bd, 0x07898b88, 0xe7195b38, 0x79c8eedb, 0xa17c0a47, 0x7c420fe9, 0xf8841ec9, 0x00000000, 0x09808683, 0x322bed48, 0x1e1170ac, 0x6c5a724e, 0xfd0efffb, 0x0f853856, 0x3daed51e, 0x362d3927, 0x0a0fd964, 0x685ca621, 0x9b5b54d1, 0x24362e3a, 0x0c0a67b1, 0x9357e70f, 0xb4ee96d2, 0x1b9b919e, 0x80c0c54f, 0x61dc20a2, 0x5a774b69, 0x1c121a16, 0xe293ba0a, 0xc0a02ae5, 0x3c22e043, 0x121b171d, 0x0e090d0b, 0xf28bc7ad, 0x2db6a8b9, 0x141ea9c8, 0x57f11985, 0xaf75074c, 0xee99ddbb, 0xa37f60fd, 0xf701269f, 0x5c72f5bc, 0x44663bc5, 0x5bfb7e34, 0x8b432976, 0xcb23c6dc, 0xb6edfc68, 0xb8e4f163, 0xd731dcca, 0x42638510, 0x13972240, 0x84c61120, 0x854a247d, 0xd2bb3df8, 0xaef93211, 0xc729a16d, 0x1d9e2f4b, 0xdcb230f3, 0x0d8652ec, 0x77c1e3d0, 0x2bb3166c, 0xa970b999, 0x119448fa, 0x47e96422, 0xa8fc8cc4, 0xa0f03f1a, 0x567d2cd8, 0x223390ef, 0x87494ec7, 0xd938d1c1, 0x8ccaa2fe, 0x98d40b36, 0xa6f581cf, 0xa57ade28, 0xdab78e26, 0x3fadbfa4, 0x2c3a9de4, 0x5078920d, 0x6a5fcc9b, 0x547e4662, 0xf68d13c2, 0x90d8b8e8, 0x2e39f75e, 0x82c3aff5, 0x9f5d80be, 0x69d0937c, 0x6fd52da9, 0xcf2512b3, 0xc8ac993b, 0x10187da7, 0xe89c636e, 0xdb3bbb7b, 0xcd267809, 0x6e5918f4, 0xec9ab701, 0x834f9aa8, 0xe6956e65, 0xaaffe67e, 0x21bccf08, 0xef15e8e6, 0xbae79bd9, 0x4a6f36ce, 0xea9f09d4, 0x29b07cd6, 0x31a4b2af, 0x2a3f2331, 0xc6a59430, 0x35a266c0, 0x744ebc37, 0xfc82caa6, 0xe090d0b0, 0x33a7d815, 0xf104984a, 0x41ecdaf7, 0x7fcd500e, 0x1791f62f, 0x764dd68d, 0x43efb04d, 0xccaa4d54, 0xe49604df, 0x9ed1b5e3, 0x4c6a881b, 0xc12c1fb8, 0x4665517f, 0x9d5eea04, 0x018c355d, 0xfa877473, 0xfb0b412e, 0xb3671d5a, 0x92dbd252, 0xe9105633, 0x6dd64713, 0x9ad7618c, 0x37a10c7a, 0x59f8148e, 0xeb133c89, 0xcea927ee, 0xb761c935, 0xe11ce5ed, 0x7a47b13c, 0x9cd2df59, 0x55f2733f, 0x1814ce79, 0x73c737bf, 0x53f7cdea, 0x5ffdaa5b, 0xdf3d6f14, 0x7844db86, 0xcaaff381, 0xb968c43e, 0x3824342c, 0xc2a3405f, 0x161dc372, 0xbce2250c, 0x283c498b, 0xff0d9541, 0x39a80171, 0x080cb3de, 0xd8b4e49c, 0x6456c190, 0x7bcb8461, 0xd532b670, 0x486c5c74, 0xd0b85742];\nconst T6 = [0x5051f4a7, 0x537e4165, 0xc31a17a4, 0x963a275e, 0xcb3bab6b, 0xf11f9d45, 0xabacfa58, 0x934be303, 0x552030fa, 0xf6ad766d, 0x9188cc76, 0x25f5024c, 0xfc4fe5d7, 0xd7c52acb, 0x80263544, 0x8fb562a3, 0x49deb15a, 0x6725ba1b, 0x9845ea0e, 0xe15dfec0, 0x02c32f75, 0x12814cf0, 0xa38d4697, 0xc66bd3f9, 0xe7038f5f, 0x9515929c, 0xebbf6d7a, 0xda955259, 0x2dd4be83, 0xd3587421, 0x2949e069, 0x448ec9c8, 0x6a75c289, 0x78f48e79, 0x6b99583e, 0xdd27b971, 0xb6bee14f, 0x17f088ad, 0x66c920ac, 0xb47dce3a, 0x1863df4a, 0x82e51a31, 0x60975133, 0x4562537f, 0xe0b16477, 0x84bb6bae, 0x1cfe81a0, 0x94f9082b, 0x58704868, 0x198f45fd, 0x8794de6c, 0xb7527bf8, 0x23ab73d3, 0xe2724b02, 0x57e31f8f, 0x2a6655ab, 0x07b2eb28, 0x032fb5c2, 0x9a86c57b, 0xa5d33708, 0xf2302887, 0xb223bfa5, 0xba02036a, 0x5ced1682, 0x2b8acf1c, 0x92a779b4, 0xf0f307f2, 0xa14e69e2, 0xcd65daf4, 0xd50605be, 0x1fd13462, 0x8ac4a6fe, 0x9d342e53, 0xa0a2f355, 0x32058ae1, 0x75a4f6eb, 0x390b83ec, 0xaa4060ef, 0x065e719f, 0x51bd6e10, 0xf93e218a, 0x3d96dd06, 0xaedd3e05, 0x464de6bd, 0xb591548d, 0x0571c45d, 0x6f0406d4, 0xff605015, 0x241998fb, 0x97d6bde9, 0xcc894043, 0x7767d99e, 0xbdb0e842, 0x8807898b, 0x38e7195b, 0xdb79c8ee, 0x47a17c0a, 0xe97c420f, 0xc9f8841e, 0x00000000, 0x83098086, 0x48322bed, 0xac1e1170, 0x4e6c5a72, 0xfbfd0eff, 0x560f8538, 0x1e3daed5, 0x27362d39, 0x640a0fd9, 0x21685ca6, 0xd19b5b54, 0x3a24362e, 0xb10c0a67, 0x0f9357e7, 0xd2b4ee96, 0x9e1b9b91, 0x4f80c0c5, 0xa261dc20, 0x695a774b, 0x161c121a, 0x0ae293ba, 0xe5c0a02a, 0x433c22e0, 0x1d121b17, 0x0b0e090d, 0xadf28bc7, 0xb92db6a8, 0xc8141ea9, 0x8557f119, 0x4caf7507, 0xbbee99dd, 0xfda37f60, 0x9ff70126, 0xbc5c72f5, 0xc544663b, 0x345bfb7e, 0x768b4329, 0xdccb23c6, 0x68b6edfc, 0x63b8e4f1, 0xcad731dc, 0x10426385, 0x40139722, 0x2084c611, 0x7d854a24, 0xf8d2bb3d, 0x11aef932, 0x6dc729a1, 0x4b1d9e2f, 0xf3dcb230, 0xec0d8652, 0xd077c1e3, 0x6c2bb316, 0x99a970b9, 0xfa119448, 0x2247e964, 0xc4a8fc8c, 0x1aa0f03f, 0xd8567d2c, 0xef223390, 0xc787494e, 0xc1d938d1, 0xfe8ccaa2, 0x3698d40b, 0xcfa6f581, 0x28a57ade, 0x26dab78e, 0xa43fadbf, 0xe42c3a9d, 0x0d507892, 0x9b6a5fcc, 0x62547e46, 0xc2f68d13, 0xe890d8b8, 0x5e2e39f7, 0xf582c3af, 0xbe9f5d80, 0x7c69d093, 0xa96fd52d, 0xb3cf2512, 0x3bc8ac99, 0xa710187d, 0x6ee89c63, 0x7bdb3bbb, 0x09cd2678, 0xf46e5918, 0x01ec9ab7, 0xa8834f9a, 0x65e6956e, 0x7eaaffe6, 0x0821bccf, 0xe6ef15e8, 0xd9bae79b, 0xce4a6f36, 0xd4ea9f09, 0xd629b07c, 0xaf31a4b2, 0x312a3f23, 0x30c6a594, 0xc035a266, 0x37744ebc, 0xa6fc82ca, 0xb0e090d0, 0x1533a7d8, 0x4af10498, 0xf741ecda, 0x0e7fcd50, 0x2f1791f6, 0x8d764dd6, 0x4d43efb0, 0x54ccaa4d, 0xdfe49604, 0xe39ed1b5, 0x1b4c6a88, 0xb8c12c1f, 0x7f466551, 0x049d5eea, 0x5d018c35, 0x73fa8774, 0x2efb0b41, 0x5ab3671d, 0x5292dbd2, 0x33e91056, 0x136dd647, 0x8c9ad761, 0x7a37a10c, 0x8e59f814, 0x89eb133c, 0xeecea927, 0x35b761c9, 0xede11ce5, 0x3c7a47b1, 0x599cd2df, 0x3f55f273, 0x791814ce, 0xbf73c737, 0xea53f7cd, 0x5b5ffdaa, 0x14df3d6f, 0x867844db, 0x81caaff3, 0x3eb968c4, 0x2c382434, 0x5fc2a340, 0x72161dc3, 0x0cbce225, 0x8b283c49, 0x41ff0d95, 0x7139a801, 0xde080cb3, 0x9cd8b4e4, 0x906456c1, 0x617bcb84, 0x70d532b6, 0x74486c5c, 0x42d0b857];\nconst T7 = [0xa75051f4, 0x65537e41, 0xa4c31a17, 0x5e963a27, 0x6bcb3bab, 0x45f11f9d, 0x58abacfa, 0x03934be3, 0xfa552030, 0x6df6ad76, 0x769188cc, 0x4c25f502, 0xd7fc4fe5, 0xcbd7c52a, 0x44802635, 0xa38fb562, 0x5a49deb1, 0x1b6725ba, 0x0e9845ea, 0xc0e15dfe, 0x7502c32f, 0xf012814c, 0x97a38d46, 0xf9c66bd3, 0x5fe7038f, 0x9c951592, 0x7aebbf6d, 0x59da9552, 0x832dd4be, 0x21d35874, 0x692949e0, 0xc8448ec9, 0x896a75c2, 0x7978f48e, 0x3e6b9958, 0x71dd27b9, 0x4fb6bee1, 0xad17f088, 0xac66c920, 0x3ab47dce, 0x4a1863df, 0x3182e51a, 0x33609751, 0x7f456253, 0x77e0b164, 0xae84bb6b, 0xa01cfe81, 0x2b94f908, 0x68587048, 0xfd198f45, 0x6c8794de, 0xf8b7527b, 0xd323ab73, 0x02e2724b, 0x8f57e31f, 0xab2a6655, 0x2807b2eb, 0xc2032fb5, 0x7b9a86c5, 0x08a5d337, 0x87f23028, 0xa5b223bf, 0x6aba0203, 0x825ced16, 0x1c2b8acf, 0xb492a779, 0xf2f0f307, 0xe2a14e69, 0xf4cd65da, 0xbed50605, 0x621fd134, 0xfe8ac4a6, 0x539d342e, 0x55a0a2f3, 0xe132058a, 0xeb75a4f6, 0xec390b83, 0xefaa4060, 0x9f065e71, 0x1051bd6e, 0x8af93e21, 0x063d96dd, 0x05aedd3e, 0xbd464de6, 0x8db59154, 0x5d0571c4, 0xd46f0406, 0x15ff6050, 0xfb241998, 0xe997d6bd, 0x43cc8940, 0x9e7767d9, 0x42bdb0e8, 0x8b880789, 0x5b38e719, 0xeedb79c8, 0x0a47a17c, 0x0fe97c42, 0x1ec9f884, 0x00000000, 0x86830980, 0xed48322b, 0x70ac1e11, 0x724e6c5a, 0xfffbfd0e, 0x38560f85, 0xd51e3dae, 0x3927362d, 0xd9640a0f, 0xa621685c, 0x54d19b5b, 0x2e3a2436, 0x67b10c0a, 0xe70f9357, 0x96d2b4ee, 0x919e1b9b, 0xc54f80c0, 0x20a261dc, 0x4b695a77, 0x1a161c12, 0xba0ae293, 0x2ae5c0a0, 0xe0433c22, 0x171d121b, 0x0d0b0e09, 0xc7adf28b, 0xa8b92db6, 0xa9c8141e, 0x198557f1, 0x074caf75, 0xddbbee99, 0x60fda37f, 0x269ff701, 0xf5bc5c72, 0x3bc54466, 0x7e345bfb, 0x29768b43, 0xc6dccb23, 0xfc68b6ed, 0xf163b8e4, 0xdccad731, 0x85104263, 0x22401397, 0x112084c6, 0x247d854a, 0x3df8d2bb, 0x3211aef9, 0xa16dc729, 0x2f4b1d9e, 0x30f3dcb2, 0x52ec0d86, 0xe3d077c1, 0x166c2bb3, 0xb999a970, 0x48fa1194, 0x642247e9, 0x8cc4a8fc, 0x3f1aa0f0, 0x2cd8567d, 0x90ef2233, 0x4ec78749, 0xd1c1d938, 0xa2fe8cca, 0x0b3698d4, 0x81cfa6f5, 0xde28a57a, 0x8e26dab7, 0xbfa43fad, 0x9de42c3a, 0x920d5078, 0xcc9b6a5f, 0x4662547e, 0x13c2f68d, 0xb8e890d8, 0xf75e2e39, 0xaff582c3, 0x80be9f5d, 0x937c69d0, 0x2da96fd5, 0x12b3cf25, 0x993bc8ac, 0x7da71018, 0x636ee89c, 0xbb7bdb3b, 0x7809cd26, 0x18f46e59, 0xb701ec9a, 0x9aa8834f, 0x6e65e695, 0xe67eaaff, 0xcf0821bc, 0xe8e6ef15, 0x9bd9bae7, 0x36ce4a6f, 0x09d4ea9f, 0x7cd629b0, 0xb2af31a4, 0x23312a3f, 0x9430c6a5, 0x66c035a2, 0xbc37744e, 0xcaa6fc82, 0xd0b0e090, 0xd81533a7, 0x984af104, 0xdaf741ec, 0x500e7fcd, 0xf62f1791, 0xd68d764d, 0xb04d43ef, 0x4d54ccaa, 0x04dfe496, 0xb5e39ed1, 0x881b4c6a, 0x1fb8c12c, 0x517f4665, 0xea049d5e, 0x355d018c, 0x7473fa87, 0x412efb0b, 0x1d5ab367, 0xd25292db, 0x5633e910, 0x47136dd6, 0x618c9ad7, 0x0c7a37a1, 0x148e59f8, 0x3c89eb13, 0x27eecea9, 0xc935b761, 0xe5ede11c, 0xb13c7a47, 0xdf599cd2, 0x733f55f2, 0xce791814, 0x37bf73c7, 0xcdea53f7, 0xaa5b5ffd, 0x6f14df3d, 0xdb867844, 0xf381caaf, 0xc43eb968, 0x342c3824, 0x405fc2a3, 0xc372161d, 0x250cbce2, 0x498b283c, 0x9541ff0d, 0x017139a8, 0xb3de080c, 0xe49cd8b4, 0xc1906456, 0x84617bcb, 0xb670d532, 0x5c74486c, 0x5742d0b8];\nconst T8 = [0xf4a75051, 0x4165537e, 0x17a4c31a, 0x275e963a, 0xab6bcb3b, 0x9d45f11f, 0xfa58abac, 0xe303934b, 0x30fa5520, 0x766df6ad, 0xcc769188, 0x024c25f5, 0xe5d7fc4f, 0x2acbd7c5, 0x35448026, 0x62a38fb5, 0xb15a49de, 0xba1b6725, 0xea0e9845, 0xfec0e15d, 0x2f7502c3, 0x4cf01281, 0x4697a38d, 0xd3f9c66b, 0x8f5fe703, 0x929c9515, 0x6d7aebbf, 0x5259da95, 0xbe832dd4, 0x7421d358, 0xe0692949, 0xc9c8448e, 0xc2896a75, 0x8e7978f4, 0x583e6b99, 0xb971dd27, 0xe14fb6be, 0x88ad17f0, 0x20ac66c9, 0xce3ab47d, 0xdf4a1863, 0x1a3182e5, 0x51336097, 0x537f4562, 0x6477e0b1, 0x6bae84bb, 0x81a01cfe, 0x082b94f9, 0x48685870, 0x45fd198f, 0xde6c8794, 0x7bf8b752, 0x73d323ab, 0x4b02e272, 0x1f8f57e3, 0x55ab2a66, 0xeb2807b2, 0xb5c2032f, 0xc57b9a86, 0x3708a5d3, 0x2887f230, 0xbfa5b223, 0x036aba02, 0x16825ced, 0xcf1c2b8a, 0x79b492a7, 0x07f2f0f3, 0x69e2a14e, 0xdaf4cd65, 0x05bed506, 0x34621fd1, 0xa6fe8ac4, 0x2e539d34, 0xf355a0a2, 0x8ae13205, 0xf6eb75a4, 0x83ec390b, 0x60efaa40, 0x719f065e, 0x6e1051bd, 0x218af93e, 0xdd063d96, 0x3e05aedd, 0xe6bd464d, 0x548db591, 0xc45d0571, 0x06d46f04, 0x5015ff60, 0x98fb2419, 0xbde997d6, 0x4043cc89, 0xd99e7767, 0xe842bdb0, 0x898b8807, 0x195b38e7, 0xc8eedb79, 0x7c0a47a1, 0x420fe97c, 0x841ec9f8, 0x00000000, 0x80868309, 0x2bed4832, 0x1170ac1e, 0x5a724e6c, 0x0efffbfd, 0x8538560f, 0xaed51e3d, 0x2d392736, 0x0fd9640a, 0x5ca62168, 0x5b54d19b, 0x362e3a24, 0x0a67b10c, 0x57e70f93, 0xee96d2b4, 0x9b919e1b, 0xc0c54f80, 0xdc20a261, 0x774b695a, 0x121a161c, 0x93ba0ae2, 0xa02ae5c0, 0x22e0433c, 0x1b171d12, 0x090d0b0e, 0x8bc7adf2, 0xb6a8b92d, 0x1ea9c814, 0xf1198557, 0x75074caf, 0x99ddbbee, 0x7f60fda3, 0x01269ff7, 0x72f5bc5c, 0x663bc544, 0xfb7e345b, 0x4329768b, 0x23c6dccb, 0xedfc68b6, 0xe4f163b8, 0x31dccad7, 0x63851042, 0x97224013, 0xc6112084, 0x4a247d85, 0xbb3df8d2, 0xf93211ae, 0x29a16dc7, 0x9e2f4b1d, 0xb230f3dc, 0x8652ec0d, 0xc1e3d077, 0xb3166c2b, 0x70b999a9, 0x9448fa11, 0xe9642247, 0xfc8cc4a8, 0xf03f1aa0, 0x7d2cd856, 0x3390ef22, 0x494ec787, 0x38d1c1d9, 0xcaa2fe8c, 0xd40b3698, 0xf581cfa6, 0x7ade28a5, 0xb78e26da, 0xadbfa43f, 0x3a9de42c, 0x78920d50, 0x5fcc9b6a, 0x7e466254, 0x8d13c2f6, 0xd8b8e890, 0x39f75e2e, 0xc3aff582, 0x5d80be9f, 0xd0937c69, 0xd52da96f, 0x2512b3cf, 0xac993bc8, 0x187da710, 0x9c636ee8, 0x3bbb7bdb, 0x267809cd, 0x5918f46e, 0x9ab701ec, 0x4f9aa883, 0x956e65e6, 0xffe67eaa, 0xbccf0821, 0x15e8e6ef, 0xe79bd9ba, 0x6f36ce4a, 0x9f09d4ea, 0xb07cd629, 0xa4b2af31, 0x3f23312a, 0xa59430c6, 0xa266c035, 0x4ebc3774, 0x82caa6fc, 0x90d0b0e0, 0xa7d81533, 0x04984af1, 0xecdaf741, 0xcd500e7f, 0x91f62f17, 0x4dd68d76, 0xefb04d43, 0xaa4d54cc, 0x9604dfe4, 0xd1b5e39e, 0x6a881b4c, 0x2c1fb8c1, 0x65517f46, 0x5eea049d, 0x8c355d01, 0x877473fa, 0x0b412efb, 0x671d5ab3, 0xdbd25292, 0x105633e9, 0xd647136d, 0xd7618c9a, 0xa10c7a37, 0xf8148e59, 0x133c89eb, 0xa927eece, 0x61c935b7, 0x1ce5ede1, 0x47b13c7a, 0xd2df599c, 0xf2733f55, 0x14ce7918, 0xc737bf73, 0xf7cdea53, 0xfdaa5b5f, 0x3d6f14df, 0x44db8678, 0xaff381ca, 0x68c43eb9, 0x24342c38, 0xa3405fc2, 0x1dc37216, 0xe2250cbc, 0x3c498b28, 0x0d9541ff, 0xa8017139, 0x0cb3de08, 0xb4e49cd8, 0x56c19064, 0xcb84617b, 0x32b670d5, 0x6c5c7448, 0xb85742d0];\n// Transformations for decryption key expansion\nconst U1 = [0x00000000, 0x0e090d0b, 0x1c121a16, 0x121b171d, 0x3824342c, 0x362d3927, 0x24362e3a, 0x2a3f2331, 0x70486858, 0x7e416553, 0x6c5a724e, 0x62537f45, 0x486c5c74, 0x4665517f, 0x547e4662, 0x5a774b69, 0xe090d0b0, 0xee99ddbb, 0xfc82caa6, 0xf28bc7ad, 0xd8b4e49c, 0xd6bde997, 0xc4a6fe8a, 0xcaaff381, 0x90d8b8e8, 0x9ed1b5e3, 0x8ccaa2fe, 0x82c3aff5, 0xa8fc8cc4, 0xa6f581cf, 0xb4ee96d2, 0xbae79bd9, 0xdb3bbb7b, 0xd532b670, 0xc729a16d, 0xc920ac66, 0xe31f8f57, 0xed16825c, 0xff0d9541, 0xf104984a, 0xab73d323, 0xa57ade28, 0xb761c935, 0xb968c43e, 0x9357e70f, 0x9d5eea04, 0x8f45fd19, 0x814cf012, 0x3bab6bcb, 0x35a266c0, 0x27b971dd, 0x29b07cd6, 0x038f5fe7, 0x0d8652ec, 0x1f9d45f1, 0x119448fa, 0x4be30393, 0x45ea0e98, 0x57f11985, 0x59f8148e, 0x73c737bf, 0x7dce3ab4, 0x6fd52da9, 0x61dc20a2, 0xad766df6, 0xa37f60fd, 0xb16477e0, 0xbf6d7aeb, 0x955259da, 0x9b5b54d1, 0x894043cc, 0x87494ec7, 0xdd3e05ae, 0xd33708a5, 0xc12c1fb8, 0xcf2512b3, 0xe51a3182, 0xeb133c89, 0xf9082b94, 0xf701269f, 0x4de6bd46, 0x43efb04d, 0x51f4a750, 0x5ffdaa5b, 0x75c2896a, 0x7bcb8461, 0x69d0937c, 0x67d99e77, 0x3daed51e, 0x33a7d815, 0x21bccf08, 0x2fb5c203, 0x058ae132, 0x0b83ec39, 0x1998fb24, 0x1791f62f, 0x764dd68d, 0x7844db86, 0x6a5fcc9b, 0x6456c190, 0x4e69e2a1, 0x4060efaa, 0x527bf8b7, 0x5c72f5bc, 0x0605bed5, 0x080cb3de, 0x1a17a4c3, 0x141ea9c8, 0x3e218af9, 0x302887f2, 0x223390ef, 0x2c3a9de4, 0x96dd063d, 0x98d40b36, 0x8acf1c2b, 0x84c61120, 0xaef93211, 0xa0f03f1a, 0xb2eb2807, 0xbce2250c, 0xe6956e65, 0xe89c636e, 0xfa877473, 0xf48e7978, 0xdeb15a49, 0xd0b85742, 0xc2a3405f, 0xccaa4d54, 0x41ecdaf7, 0x4fe5d7fc, 0x5dfec0e1, 0x53f7cdea, 0x79c8eedb, 0x77c1e3d0, 0x65daf4cd, 0x6bd3f9c6, 0x31a4b2af, 0x3fadbfa4, 0x2db6a8b9, 0x23bfa5b2, 0x09808683, 0x07898b88, 0x15929c95, 0x1b9b919e, 0xa17c0a47, 0xaf75074c, 0xbd6e1051, 0xb3671d5a, 0x99583e6b, 0x97513360, 0x854a247d, 0x8b432976, 0xd134621f, 0xdf3d6f14, 0xcd267809, 0xc32f7502, 0xe9105633, 0xe7195b38, 0xf5024c25, 0xfb0b412e, 0x9ad7618c, 0x94de6c87, 0x86c57b9a, 0x88cc7691, 0xa2f355a0, 0xacfa58ab, 0xbee14fb6, 0xb0e842bd, 0xea9f09d4, 0xe49604df, 0xf68d13c2, 0xf8841ec9, 0xd2bb3df8, 0xdcb230f3, 0xcea927ee, 0xc0a02ae5, 0x7a47b13c, 0x744ebc37, 0x6655ab2a, 0x685ca621, 0x42638510, 0x4c6a881b, 0x5e719f06, 0x5078920d, 0x0a0fd964, 0x0406d46f, 0x161dc372, 0x1814ce79, 0x322bed48, 0x3c22e043, 0x2e39f75e, 0x2030fa55, 0xec9ab701, 0xe293ba0a, 0xf088ad17, 0xfe81a01c, 0xd4be832d, 0xdab78e26, 0xc8ac993b, 0xc6a59430, 0x9cd2df59, 0x92dbd252, 0x80c0c54f, 0x8ec9c844, 0xa4f6eb75, 0xaaffe67e, 0xb8e4f163, 0xb6edfc68, 0x0c0a67b1, 0x02036aba, 0x10187da7, 0x1e1170ac, 0x342e539d, 0x3a275e96, 0x283c498b, 0x26354480, 0x7c420fe9, 0x724b02e2, 0x605015ff, 0x6e5918f4, 0x44663bc5, 0x4a6f36ce, 0x587421d3, 0x567d2cd8, 0x37a10c7a, 0x39a80171, 0x2bb3166c, 0x25ba1b67, 0x0f853856, 0x018c355d, 0x13972240, 0x1d9e2f4b, 0x47e96422, 0x49e06929, 0x5bfb7e34, 0x55f2733f, 0x7fcd500e, 0x71c45d05, 0x63df4a18, 0x6dd64713, 0xd731dcca, 0xd938d1c1, 0xcb23c6dc, 0xc52acbd7, 0xef15e8e6, 0xe11ce5ed, 0xf307f2f0, 0xfd0efffb, 0xa779b492, 0xa970b999, 0xbb6bae84, 0xb562a38f, 0x9f5d80be, 0x91548db5, 0x834f9aa8, 0x8d4697a3];\nconst U2 = [0x00000000, 0x0b0e090d, 0x161c121a, 0x1d121b17, 0x2c382434, 0x27362d39, 0x3a24362e, 0x312a3f23, 0x58704868, 0x537e4165, 0x4e6c5a72, 0x4562537f, 0x74486c5c, 0x7f466551, 0x62547e46, 0x695a774b, 0xb0e090d0, 0xbbee99dd, 0xa6fc82ca, 0xadf28bc7, 0x9cd8b4e4, 0x97d6bde9, 0x8ac4a6fe, 0x81caaff3, 0xe890d8b8, 0xe39ed1b5, 0xfe8ccaa2, 0xf582c3af, 0xc4a8fc8c, 0xcfa6f581, 0xd2b4ee96, 0xd9bae79b, 0x7bdb3bbb, 0x70d532b6, 0x6dc729a1, 0x66c920ac, 0x57e31f8f, 0x5ced1682, 0x41ff0d95, 0x4af10498, 0x23ab73d3, 0x28a57ade, 0x35b761c9, 0x3eb968c4, 0x0f9357e7, 0x049d5eea, 0x198f45fd, 0x12814cf0, 0xcb3bab6b, 0xc035a266, 0xdd27b971, 0xd629b07c, 0xe7038f5f, 0xec0d8652, 0xf11f9d45, 0xfa119448, 0x934be303, 0x9845ea0e, 0x8557f119, 0x8e59f814, 0xbf73c737, 0xb47dce3a, 0xa96fd52d, 0xa261dc20, 0xf6ad766d, 0xfda37f60, 0xe0b16477, 0xebbf6d7a, 0xda955259, 0xd19b5b54, 0xcc894043, 0xc787494e, 0xaedd3e05, 0xa5d33708, 0xb8c12c1f, 0xb3cf2512, 0x82e51a31, 0x89eb133c, 0x94f9082b, 0x9ff70126, 0x464de6bd, 0x4d43efb0, 0x5051f4a7, 0x5b5ffdaa, 0x6a75c289, 0x617bcb84, 0x7c69d093, 0x7767d99e, 0x1e3daed5, 0x1533a7d8, 0x0821bccf, 0x032fb5c2, 0x32058ae1, 0x390b83ec, 0x241998fb, 0x2f1791f6, 0x8d764dd6, 0x867844db, 0x9b6a5fcc, 0x906456c1, 0xa14e69e2, 0xaa4060ef, 0xb7527bf8, 0xbc5c72f5, 0xd50605be, 0xde080cb3, 0xc31a17a4, 0xc8141ea9, 0xf93e218a, 0xf2302887, 0xef223390, 0xe42c3a9d, 0x3d96dd06, 0x3698d40b, 0x2b8acf1c, 0x2084c611, 0x11aef932, 0x1aa0f03f, 0x07b2eb28, 0x0cbce225, 0x65e6956e, 0x6ee89c63, 0x73fa8774, 0x78f48e79, 0x49deb15a, 0x42d0b857, 0x5fc2a340, 0x54ccaa4d, 0xf741ecda, 0xfc4fe5d7, 0xe15dfec0, 0xea53f7cd, 0xdb79c8ee, 0xd077c1e3, 0xcd65daf4, 0xc66bd3f9, 0xaf31a4b2, 0xa43fadbf, 0xb92db6a8, 0xb223bfa5, 0x83098086, 0x8807898b, 0x9515929c, 0x9e1b9b91, 0x47a17c0a, 0x4caf7507, 0x51bd6e10, 0x5ab3671d, 0x6b99583e, 0x60975133, 0x7d854a24, 0x768b4329, 0x1fd13462, 0x14df3d6f, 0x09cd2678, 0x02c32f75, 0x33e91056, 0x38e7195b, 0x25f5024c, 0x2efb0b41, 0x8c9ad761, 0x8794de6c, 0x9a86c57b, 0x9188cc76, 0xa0a2f355, 0xabacfa58, 0xb6bee14f, 0xbdb0e842, 0xd4ea9f09, 0xdfe49604, 0xc2f68d13, 0xc9f8841e, 0xf8d2bb3d, 0xf3dcb230, 0xeecea927, 0xe5c0a02a, 0x3c7a47b1, 0x37744ebc, 0x2a6655ab, 0x21685ca6, 0x10426385, 0x1b4c6a88, 0x065e719f, 0x0d507892, 0x640a0fd9, 0x6f0406d4, 0x72161dc3, 0x791814ce, 0x48322bed, 0x433c22e0, 0x5e2e39f7, 0x552030fa, 0x01ec9ab7, 0x0ae293ba, 0x17f088ad, 0x1cfe81a0, 0x2dd4be83, 0x26dab78e, 0x3bc8ac99, 0x30c6a594, 0x599cd2df, 0x5292dbd2, 0x4f80c0c5, 0x448ec9c8, 0x75a4f6eb, 0x7eaaffe6, 0x63b8e4f1, 0x68b6edfc, 0xb10c0a67, 0xba02036a, 0xa710187d, 0xac1e1170, 0x9d342e53, 0x963a275e, 0x8b283c49, 0x80263544, 0xe97c420f, 0xe2724b02, 0xff605015, 0xf46e5918, 0xc544663b, 0xce4a6f36, 0xd3587421, 0xd8567d2c, 0x7a37a10c, 0x7139a801, 0x6c2bb316, 0x6725ba1b, 0x560f8538, 0x5d018c35, 0x40139722, 0x4b1d9e2f, 0x2247e964, 0x2949e069, 0x345bfb7e, 0x3f55f273, 0x0e7fcd50, 0x0571c45d, 0x1863df4a, 0x136dd647, 0xcad731dc, 0xc1d938d1, 0xdccb23c6, 0xd7c52acb, 0xe6ef15e8, 0xede11ce5, 0xf0f307f2, 0xfbfd0eff, 0x92a779b4, 0x99a970b9, 0x84bb6bae, 0x8fb562a3, 0xbe9f5d80, 0xb591548d, 0xa8834f9a, 0xa38d4697];\nconst U3 = [0x00000000, 0x0d0b0e09, 0x1a161c12, 0x171d121b, 0x342c3824, 0x3927362d, 0x2e3a2436, 0x23312a3f, 0x68587048, 0x65537e41, 0x724e6c5a, 0x7f456253, 0x5c74486c, 0x517f4665, 0x4662547e, 0x4b695a77, 0xd0b0e090, 0xddbbee99, 0xcaa6fc82, 0xc7adf28b, 0xe49cd8b4, 0xe997d6bd, 0xfe8ac4a6, 0xf381caaf, 0xb8e890d8, 0xb5e39ed1, 0xa2fe8cca, 0xaff582c3, 0x8cc4a8fc, 0x81cfa6f5, 0x96d2b4ee, 0x9bd9bae7, 0xbb7bdb3b, 0xb670d532, 0xa16dc729, 0xac66c920, 0x8f57e31f, 0x825ced16, 0x9541ff0d, 0x984af104, 0xd323ab73, 0xde28a57a, 0xc935b761, 0xc43eb968, 0xe70f9357, 0xea049d5e, 0xfd198f45, 0xf012814c, 0x6bcb3bab, 0x66c035a2, 0x71dd27b9, 0x7cd629b0, 0x5fe7038f, 0x52ec0d86, 0x45f11f9d, 0x48fa1194, 0x03934be3, 0x0e9845ea, 0x198557f1, 0x148e59f8, 0x37bf73c7, 0x3ab47dce, 0x2da96fd5, 0x20a261dc, 0x6df6ad76, 0x60fda37f, 0x77e0b164, 0x7aebbf6d, 0x59da9552, 0x54d19b5b, 0x43cc8940, 0x4ec78749, 0x05aedd3e, 0x08a5d337, 0x1fb8c12c, 0x12b3cf25, 0x3182e51a, 0x3c89eb13, 0x2b94f908, 0x269ff701, 0xbd464de6, 0xb04d43ef, 0xa75051f4, 0xaa5b5ffd, 0x896a75c2, 0x84617bcb, 0x937c69d0, 0x9e7767d9, 0xd51e3dae, 0xd81533a7, 0xcf0821bc, 0xc2032fb5, 0xe132058a, 0xec390b83, 0xfb241998, 0xf62f1791, 0xd68d764d, 0xdb867844, 0xcc9b6a5f, 0xc1906456, 0xe2a14e69, 0xefaa4060, 0xf8b7527b, 0xf5bc5c72, 0xbed50605, 0xb3de080c, 0xa4c31a17, 0xa9c8141e, 0x8af93e21, 0x87f23028, 0x90ef2233, 0x9de42c3a, 0x063d96dd, 0x0b3698d4, 0x1c2b8acf, 0x112084c6, 0x3211aef9, 0x3f1aa0f0, 0x2807b2eb, 0x250cbce2, 0x6e65e695, 0x636ee89c, 0x7473fa87, 0x7978f48e, 0x5a49deb1, 0x5742d0b8, 0x405fc2a3, 0x4d54ccaa, 0xdaf741ec, 0xd7fc4fe5, 0xc0e15dfe, 0xcdea53f7, 0xeedb79c8, 0xe3d077c1, 0xf4cd65da, 0xf9c66bd3, 0xb2af31a4, 0xbfa43fad, 0xa8b92db6, 0xa5b223bf, 0x86830980, 0x8b880789, 0x9c951592, 0x919e1b9b, 0x0a47a17c, 0x074caf75, 0x1051bd6e, 0x1d5ab367, 0x3e6b9958, 0x33609751, 0x247d854a, 0x29768b43, 0x621fd134, 0x6f14df3d, 0x7809cd26, 0x7502c32f, 0x5633e910, 0x5b38e719, 0x4c25f502, 0x412efb0b, 0x618c9ad7, 0x6c8794de, 0x7b9a86c5, 0x769188cc, 0x55a0a2f3, 0x58abacfa, 0x4fb6bee1, 0x42bdb0e8, 0x09d4ea9f, 0x04dfe496, 0x13c2f68d, 0x1ec9f884, 0x3df8d2bb, 0x30f3dcb2, 0x27eecea9, 0x2ae5c0a0, 0xb13c7a47, 0xbc37744e, 0xab2a6655, 0xa621685c, 0x85104263, 0x881b4c6a, 0x9f065e71, 0x920d5078, 0xd9640a0f, 0xd46f0406, 0xc372161d, 0xce791814, 0xed48322b, 0xe0433c22, 0xf75e2e39, 0xfa552030, 0xb701ec9a, 0xba0ae293, 0xad17f088, 0xa01cfe81, 0x832dd4be, 0x8e26dab7, 0x993bc8ac, 0x9430c6a5, 0xdf599cd2, 0xd25292db, 0xc54f80c0, 0xc8448ec9, 0xeb75a4f6, 0xe67eaaff, 0xf163b8e4, 0xfc68b6ed, 0x67b10c0a, 0x6aba0203, 0x7da71018, 0x70ac1e11, 0x539d342e, 0x5e963a27, 0x498b283c, 0x44802635, 0x0fe97c42, 0x02e2724b, 0x15ff6050, 0x18f46e59, 0x3bc54466, 0x36ce4a6f, 0x21d35874, 0x2cd8567d, 0x0c7a37a1, 0x017139a8, 0x166c2bb3, 0x1b6725ba, 0x38560f85, 0x355d018c, 0x22401397, 0x2f4b1d9e, 0x642247e9, 0x692949e0, 0x7e345bfb, 0x733f55f2, 0x500e7fcd, 0x5d0571c4, 0x4a1863df, 0x47136dd6, 0xdccad731, 0xd1c1d938, 0xc6dccb23, 0xcbd7c52a, 0xe8e6ef15, 0xe5ede11c, 0xf2f0f307, 0xfffbfd0e, 0xb492a779, 0xb999a970, 0xae84bb6b, 0xa38fb562, 0x80be9f5d, 0x8db59154, 0x9aa8834f, 0x97a38d46];\nconst U4 = [0x00000000, 0x090d0b0e, 0x121a161c, 0x1b171d12, 0x24342c38, 0x2d392736, 0x362e3a24, 0x3f23312a, 0x48685870, 0x4165537e, 0x5a724e6c, 0x537f4562, 0x6c5c7448, 0x65517f46, 0x7e466254, 0x774b695a, 0x90d0b0e0, 0x99ddbbee, 0x82caa6fc, 0x8bc7adf2, 0xb4e49cd8, 0xbde997d6, 0xa6fe8ac4, 0xaff381ca, 0xd8b8e890, 0xd1b5e39e, 0xcaa2fe8c, 0xc3aff582, 0xfc8cc4a8, 0xf581cfa6, 0xee96d2b4, 0xe79bd9ba, 0x3bbb7bdb, 0x32b670d5, 0x29a16dc7, 0x20ac66c9, 0x1f8f57e3, 0x16825ced, 0x0d9541ff, 0x04984af1, 0x73d323ab, 0x7ade28a5, 0x61c935b7, 0x68c43eb9, 0x57e70f93, 0x5eea049d, 0x45fd198f, 0x4cf01281, 0xab6bcb3b, 0xa266c035, 0xb971dd27, 0xb07cd629, 0x8f5fe703, 0x8652ec0d, 0x9d45f11f, 0x9448fa11, 0xe303934b, 0xea0e9845, 0xf1198557, 0xf8148e59, 0xc737bf73, 0xce3ab47d, 0xd52da96f, 0xdc20a261, 0x766df6ad, 0x7f60fda3, 0x6477e0b1, 0x6d7aebbf, 0x5259da95, 0x5b54d19b, 0x4043cc89, 0x494ec787, 0x3e05aedd, 0x3708a5d3, 0x2c1fb8c1, 0x2512b3cf, 0x1a3182e5, 0x133c89eb, 0x082b94f9, 0x01269ff7, 0xe6bd464d, 0xefb04d43, 0xf4a75051, 0xfdaa5b5f, 0xc2896a75, 0xcb84617b, 0xd0937c69, 0xd99e7767, 0xaed51e3d, 0xa7d81533, 0xbccf0821, 0xb5c2032f, 0x8ae13205, 0x83ec390b, 0x98fb2419, 0x91f62f17, 0x4dd68d76, 0x44db8678, 0x5fcc9b6a, 0x56c19064, 0x69e2a14e, 0x60efaa40, 0x7bf8b752, 0x72f5bc5c, 0x05bed506, 0x0cb3de08, 0x17a4c31a, 0x1ea9c814, 0x218af93e, 0x2887f230, 0x3390ef22, 0x3a9de42c, 0xdd063d96, 0xd40b3698, 0xcf1c2b8a, 0xc6112084, 0xf93211ae, 0xf03f1aa0, 0xeb2807b2, 0xe2250cbc, 0x956e65e6, 0x9c636ee8, 0x877473fa, 0x8e7978f4, 0xb15a49de, 0xb85742d0, 0xa3405fc2, 0xaa4d54cc, 0xecdaf741, 0xe5d7fc4f, 0xfec0e15d, 0xf7cdea53, 0xc8eedb79, 0xc1e3d077, 0xdaf4cd65, 0xd3f9c66b, 0xa4b2af31, 0xadbfa43f, 0xb6a8b92d, 0xbfa5b223, 0x80868309, 0x898b8807, 0x929c9515, 0x9b919e1b, 0x7c0a47a1, 0x75074caf, 0x6e1051bd, 0x671d5ab3, 0x583e6b99, 0x51336097, 0x4a247d85, 0x4329768b, 0x34621fd1, 0x3d6f14df, 0x267809cd, 0x2f7502c3, 0x105633e9, 0x195b38e7, 0x024c25f5, 0x0b412efb, 0xd7618c9a, 0xde6c8794, 0xc57b9a86, 0xcc769188, 0xf355a0a2, 0xfa58abac, 0xe14fb6be, 0xe842bdb0, 0x9f09d4ea, 0x9604dfe4, 0x8d13c2f6, 0x841ec9f8, 0xbb3df8d2, 0xb230f3dc, 0xa927eece, 0xa02ae5c0, 0x47b13c7a, 0x4ebc3774, 0x55ab2a66, 0x5ca62168, 0x63851042, 0x6a881b4c, 0x719f065e, 0x78920d50, 0x0fd9640a, 0x06d46f04, 0x1dc37216, 0x14ce7918, 0x2bed4832, 0x22e0433c, 0x39f75e2e, 0x30fa5520, 0x9ab701ec, 0x93ba0ae2, 0x88ad17f0, 0x81a01cfe, 0xbe832dd4, 0xb78e26da, 0xac993bc8, 0xa59430c6, 0xd2df599c, 0xdbd25292, 0xc0c54f80, 0xc9c8448e, 0xf6eb75a4, 0xffe67eaa, 0xe4f163b8, 0xedfc68b6, 0x0a67b10c, 0x036aba02, 0x187da710, 0x1170ac1e, 0x2e539d34, 0x275e963a, 0x3c498b28, 0x35448026, 0x420fe97c, 0x4b02e272, 0x5015ff60, 0x5918f46e, 0x663bc544, 0x6f36ce4a, 0x7421d358, 0x7d2cd856, 0xa10c7a37, 0xa8017139, 0xb3166c2b, 0xba1b6725, 0x8538560f, 0x8c355d01, 0x97224013, 0x9e2f4b1d, 0xe9642247, 0xe0692949, 0xfb7e345b, 0xf2733f55, 0xcd500e7f, 0xc45d0571, 0xdf4a1863, 0xd647136d, 0x31dccad7, 0x38d1c1d9, 0x23c6dccb, 0x2acbd7c5, 0x15e8e6ef, 0x1ce5ede1, 0x07f2f0f3, 0x0efffbfd, 0x79b492a7, 0x70b999a9, 0x6bae84bb, 0x62a38fb5, 0x5d80be9f, 0x548db591, 0x4f9aa883, 0x4697a38d];\nfunction convertToInt32(bytes) {\n    const result = [];\n    for (let i = 0; i < bytes.length; i += 4) {\n        result.push((bytes[i] << 24) | (bytes[i + 1] << 16) | (bytes[i + 2] << 8) | bytes[i + 3]);\n    }\n    return result;\n}\nexport class AES {\n    get key() { return __classPrivateFieldGet(this, _AES_key, \"f\").slice(); }\n    constructor(key) {\n        _AES_key.set(this, void 0);\n        _AES_Kd.set(this, void 0);\n        _AES_Ke.set(this, void 0);\n        if (!(this instanceof AES)) {\n            throw Error('AES must be instanitated with `new`');\n        }\n        __classPrivateFieldSet(this, _AES_key, new Uint8Array(key), \"f\");\n        const rounds = numberOfRounds[this.key.length];\n        if (rounds == null) {\n            throw new TypeError('invalid key size (must be 16, 24 or 32 bytes)');\n        }\n        // encryption round keys\n        __classPrivateFieldSet(this, _AES_Ke, [], \"f\");\n        // decryption round keys\n        __classPrivateFieldSet(this, _AES_Kd, [], \"f\");\n        for (let i = 0; i <= rounds; i++) {\n            __classPrivateFieldGet(this, _AES_Ke, \"f\").push([0, 0, 0, 0]);\n            __classPrivateFieldGet(this, _AES_Kd, \"f\").push([0, 0, 0, 0]);\n        }\n        const roundKeyCount = (rounds + 1) * 4;\n        const KC = this.key.length / 4;\n        // convert the key into ints\n        const tk = convertToInt32(this.key);\n        // copy values into round key arrays\n        let index;\n        for (let i = 0; i < KC; i++) {\n            index = i >> 2;\n            __classPrivateFieldGet(this, _AES_Ke, \"f\")[index][i % 4] = tk[i];\n            __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds - index][i % 4] = tk[i];\n        }\n        // key expansion (fips-197 section 5.2)\n        let rconpointer = 0;\n        let t = KC, tt;\n        while (t < roundKeyCount) {\n            tt = tk[KC - 1];\n            tk[0] ^= ((S[(tt >> 16) & 0xFF] << 24) ^\n                (S[(tt >> 8) & 0xFF] << 16) ^\n                (S[tt & 0xFF] << 8) ^\n                S[(tt >> 24) & 0xFF] ^\n                (rcon[rconpointer] << 24));\n            rconpointer += 1;\n            // key expansion (for non-256 bit)\n            if (KC != 8) {\n                for (let i = 1; i < KC; i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n                // key expansion for 256-bit keys is \"slightly different\" (fips-197)\n            }\n            else {\n                for (let i = 1; i < (KC / 2); i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n                tt = tk[(KC / 2) - 1];\n                tk[KC / 2] ^= (S[tt & 0xFF] ^\n                    (S[(tt >> 8) & 0xFF] << 8) ^\n                    (S[(tt >> 16) & 0xFF] << 16) ^\n                    (S[(tt >> 24) & 0xFF] << 24));\n                for (let i = (KC / 2) + 1; i < KC; i++) {\n                    tk[i] ^= tk[i - 1];\n                }\n            }\n            // copy values into round key arrays\n            let i = 0, r, c;\n            while (i < KC && t < roundKeyCount) {\n                r = t >> 2;\n                c = t % 4;\n                __classPrivateFieldGet(this, _AES_Ke, \"f\")[r][c] = tk[i];\n                __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds - r][c] = tk[i++];\n                t++;\n            }\n        }\n        // inverse-cipher-ify the decryption round key (fips-197 section 5.3)\n        for (let r = 1; r < rounds; r++) {\n            for (let c = 0; c < 4; c++) {\n                tt = __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][c];\n                __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][c] = (U1[(tt >> 24) & 0xFF] ^\n                    U2[(tt >> 16) & 0xFF] ^\n                    U3[(tt >> 8) & 0xFF] ^\n                    U4[tt & 0xFF]);\n            }\n        }\n    }\n    encrypt(plaintext) {\n        if (plaintext.length != 16) {\n            throw new TypeError('invalid plaintext size (must be 16 bytes)');\n        }\n        const rounds = __classPrivateFieldGet(this, _AES_Ke, \"f\").length - 1;\n        const a = [0, 0, 0, 0];\n        // convert plaintext to (ints ^ key)\n        let t = convertToInt32(plaintext);\n        for (let i = 0; i < 4; i++) {\n            t[i] ^= __classPrivateFieldGet(this, _AES_Ke, \"f\")[0][i];\n        }\n        // apply round transforms\n        for (let r = 1; r < rounds; r++) {\n            for (let i = 0; i < 4; i++) {\n                a[i] = (T1[(t[i] >> 24) & 0xff] ^\n                    T2[(t[(i + 1) % 4] >> 16) & 0xff] ^\n                    T3[(t[(i + 2) % 4] >> 8) & 0xff] ^\n                    T4[t[(i + 3) % 4] & 0xff] ^\n                    __classPrivateFieldGet(this, _AES_Ke, \"f\")[r][i]);\n            }\n            t = a.slice();\n        }\n        // the last round is special\n        const result = new Uint8Array(16);\n        let tt = 0;\n        for (let i = 0; i < 4; i++) {\n            tt = __classPrivateFieldGet(this, _AES_Ke, \"f\")[rounds][i];\n            result[4 * i] = (S[(t[i] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;\n            result[4 * i + 1] = (S[(t[(i + 1) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;\n            result[4 * i + 2] = (S[(t[(i + 2) % 4] >> 8) & 0xff] ^ (tt >> 8)) & 0xff;\n            result[4 * i + 3] = (S[t[(i + 3) % 4] & 0xff] ^ tt) & 0xff;\n        }\n        return result;\n    }\n    decrypt(ciphertext) {\n        if (ciphertext.length != 16) {\n            throw new TypeError('invalid ciphertext size (must be 16 bytes)');\n        }\n        const rounds = __classPrivateFieldGet(this, _AES_Kd, \"f\").length - 1;\n        const a = [0, 0, 0, 0];\n        // convert plaintext to (ints ^ key)\n        let t = convertToInt32(ciphertext);\n        for (let i = 0; i < 4; i++) {\n            t[i] ^= __classPrivateFieldGet(this, _AES_Kd, \"f\")[0][i];\n        }\n        // apply round transforms\n        for (let r = 1; r < rounds; r++) {\n            for (let i = 0; i < 4; i++) {\n                a[i] = (T5[(t[i] >> 24) & 0xff] ^\n                    T6[(t[(i + 3) % 4] >> 16) & 0xff] ^\n                    T7[(t[(i + 2) % 4] >> 8) & 0xff] ^\n                    T8[t[(i + 1) % 4] & 0xff] ^\n                    __classPrivateFieldGet(this, _AES_Kd, \"f\")[r][i]);\n            }\n            t = a.slice();\n        }\n        // the last round is special\n        const result = new Uint8Array(16);\n        let tt = 0;\n        for (let i = 0; i < 4; i++) {\n            tt = __classPrivateFieldGet(this, _AES_Kd, \"f\")[rounds][i];\n            result[4 * i] = (Si[(t[i] >> 24) & 0xff] ^ (tt >> 24)) & 0xff;\n            result[4 * i + 1] = (Si[(t[(i + 3) % 4] >> 16) & 0xff] ^ (tt >> 16)) & 0xff;\n            result[4 * i + 2] = (Si[(t[(i + 2) % 4] >> 8) & 0xff] ^ (tt >> 8)) & 0xff;\n            result[4 * i + 3] = (Si[t[(i + 1) % 4] & 0xff] ^ tt) & 0xff;\n        }\n        return result;\n    }\n}\n_AES_key = new WeakMap(), _AES_Kd = new WeakMap(), _AES_Ke = new WeakMap();\n//# sourceMappingURL=aes.js.map","import { AES } from \"./aes.js\";\nexport class ModeOfOperation {\n    constructor(name, key, cls) {\n        if (cls && !(this instanceof cls)) {\n            throw new Error(`${name} must be instantiated with \"new\"`);\n        }\n        Object.defineProperties(this, {\n            aes: { enumerable: true, value: new AES(key) },\n            name: { enumerable: true, value: name }\n        });\n    }\n}\n//# sourceMappingURL=mode.js.map","// Cipher Block Chaining\nvar __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _CBC_iv, _CBC_lastBlock;\nimport { ModeOfOperation } from \"./mode.js\";\nexport class CBC extends ModeOfOperation {\n    constructor(key, iv) {\n        super(\"ECC\", key, CBC);\n        _CBC_iv.set(this, void 0);\n        _CBC_lastBlock.set(this, void 0);\n        if (iv) {\n            if (iv.length % 16) {\n                throw new TypeError(\"invalid iv size (must be 16 bytes)\");\n            }\n            __classPrivateFieldSet(this, _CBC_iv, new Uint8Array(iv), \"f\");\n        }\n        else {\n            __classPrivateFieldSet(this, _CBC_iv, new Uint8Array(16), \"f\");\n        }\n        __classPrivateFieldSet(this, _CBC_lastBlock, this.iv, \"f\");\n    }\n    get iv() { return new Uint8Array(__classPrivateFieldGet(this, _CBC_iv, \"f\")); }\n    encrypt(plaintext) {\n        if (plaintext.length % 16) {\n            throw new TypeError(\"invalid plaintext size (must be multiple of 16 bytes)\");\n        }\n        const ciphertext = new Uint8Array(plaintext.length);\n        for (let i = 0; i < plaintext.length; i += 16) {\n            for (let j = 0; j < 16; j++) {\n                __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j] ^= plaintext[i + j];\n            }\n            __classPrivateFieldSet(this, _CBC_lastBlock, this.aes.encrypt(__classPrivateFieldGet(this, _CBC_lastBlock, \"f\")), \"f\");\n            ciphertext.set(__classPrivateFieldGet(this, _CBC_lastBlock, \"f\"), i);\n        }\n        return ciphertext;\n    }\n    decrypt(ciphertext) {\n        if (ciphertext.length % 16) {\n            throw new TypeError(\"invalid ciphertext size (must be multiple of 16 bytes)\");\n        }\n        const plaintext = new Uint8Array(ciphertext.length);\n        for (let i = 0; i < ciphertext.length; i += 16) {\n            const block = this.aes.decrypt(ciphertext.subarray(i, i + 16));\n            for (let j = 0; j < 16; j++) {\n                plaintext[i + j] = block[j] ^ __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j];\n                __classPrivateFieldGet(this, _CBC_lastBlock, \"f\")[j] = ciphertext[i + j];\n            }\n        }\n        return plaintext;\n    }\n}\n_CBC_iv = new WeakMap(), _CBC_lastBlock = new WeakMap();\n//# sourceMappingURL=mode-cbc.js.map","// Counter Mode\nvar __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n};\nvar __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n};\nvar _CTR_remaining, _CTR_remainingIndex, _CTR_counter;\nimport { ModeOfOperation } from \"./mode.js\";\nexport class CTR extends ModeOfOperation {\n    constructor(key, initialValue) {\n        super(\"CTR\", key, CTR);\n        // Remaining bytes for the one-time pad\n        _CTR_remaining.set(this, void 0);\n        _CTR_remainingIndex.set(this, void 0);\n        // The current counter\n        _CTR_counter.set(this, void 0);\n        __classPrivateFieldSet(this, _CTR_counter, new Uint8Array(16), \"f\");\n        __classPrivateFieldGet(this, _CTR_counter, \"f\").fill(0);\n        __classPrivateFieldSet(this, _CTR_remaining, __classPrivateFieldGet(this, _CTR_counter, \"f\"), \"f\"); // This will be discarded immediately\n        __classPrivateFieldSet(this, _CTR_remainingIndex, 16, \"f\");\n        if (initialValue == null) {\n            initialValue = 1;\n        }\n        if (typeof (initialValue) === \"number\") {\n            this.setCounterValue(initialValue);\n        }\n        else {\n            this.setCounterBytes(initialValue);\n        }\n    }\n    get counter() { return new Uint8Array(__classPrivateFieldGet(this, _CTR_counter, \"f\")); }\n    setCounterValue(value) {\n        if (!Number.isInteger(value) || value < 0 || value > Number.MAX_SAFE_INTEGER) {\n            throw new TypeError(\"invalid counter initial integer value\");\n        }\n        for (let index = 15; index >= 0; --index) {\n            __classPrivateFieldGet(this, _CTR_counter, \"f\")[index] = value % 256;\n            value = Math.floor(value / 256);\n        }\n    }\n    setCounterBytes(value) {\n        if (value.length !== 16) {\n            throw new TypeError(\"invalid counter initial Uint8Array value length\");\n        }\n        __classPrivateFieldGet(this, _CTR_counter, \"f\").set(value);\n    }\n    increment() {\n        for (let i = 15; i >= 0; i--) {\n            if (__classPrivateFieldGet(this, _CTR_counter, \"f\")[i] === 255) {\n                __classPrivateFieldGet(this, _CTR_counter, \"f\")[i] = 0;\n            }\n            else {\n                __classPrivateFieldGet(this, _CTR_counter, \"f\")[i]++;\n                break;\n            }\n        }\n    }\n    encrypt(plaintext) {\n        var _a, _b;\n        const crypttext = new Uint8Array(plaintext);\n        for (let i = 0; i < crypttext.length; i++) {\n            if (__classPrivateFieldGet(this, _CTR_remainingIndex, \"f\") === 16) {\n                __classPrivateFieldSet(this, _CTR_remaining, this.aes.encrypt(__classPrivateFieldGet(this, _CTR_counter, \"f\")), \"f\");\n                __classPrivateFieldSet(this, _CTR_remainingIndex, 0, \"f\");\n                this.increment();\n            }\n            crypttext[i] ^= __classPrivateFieldGet(this, _CTR_remaining, \"f\")[__classPrivateFieldSet(this, _CTR_remainingIndex, (_b = __classPrivateFieldGet(this, _CTR_remainingIndex, \"f\"), _a = _b++, _b), \"f\"), _a];\n        }\n        return crypttext;\n    }\n    decrypt(ciphertext) {\n        return this.encrypt(ciphertext);\n    }\n}\n_CTR_remaining = new WeakMap(), _CTR_remainingIndex = new WeakMap(), _CTR_counter = new WeakMap();\n//# sourceMappingURL=mode-ctr.js.map","/**\n *  @_ignore\n */\nimport { getBytesCopy, assertArgument, toUtf8Bytes } from \"../utils/index.js\";\nexport function looseArrayify(hexString) {\n    if (typeof (hexString) === \"string\" && !hexString.startsWith(\"0x\")) {\n        hexString = \"0x\" + hexString;\n    }\n    return getBytesCopy(hexString);\n}\nexport function zpad(value, length) {\n    value = String(value);\n    while (value.length < length) {\n        value = '0' + value;\n    }\n    return value;\n}\nexport function getPassword(password) {\n    if (typeof (password) === 'string') {\n        return toUtf8Bytes(password, \"NFKC\");\n    }\n    return getBytesCopy(password);\n}\nexport function spelunk(object, _path) {\n    const match = _path.match(/^([a-z0-9$_.-]*)(:([a-z]+))?(!)?$/i);\n    assertArgument(match != null, \"invalid path\", \"path\", _path);\n    const path = match[1];\n    const type = match[3];\n    const reqd = (match[4] === \"!\");\n    let cur = object;\n    for (const comp of path.toLowerCase().split('.')) {\n        // Search for a child object with a case-insensitive matching key\n        if (Array.isArray(cur)) {\n            if (!comp.match(/^[0-9]+$/)) {\n                break;\n            }\n            cur = cur[parseInt(comp)];\n        }\n        else if (typeof (cur) === \"object\") {\n            let found = null;\n            for (const key in cur) {\n                if (key.toLowerCase() === comp) {\n                    found = cur[key];\n                    break;\n                }\n            }\n            cur = found;\n        }\n        else {\n            cur = null;\n        }\n        if (cur == null) {\n            break;\n        }\n    }\n    assertArgument(!reqd || cur != null, \"missing required value\", \"path\", path);\n    if (type && cur != null) {\n        if (type === \"int\") {\n            if (typeof (cur) === \"string\" && cur.match(/^-?[0-9]+$/)) {\n                return parseInt(cur);\n            }\n            else if (Number.isSafeInteger(cur)) {\n                return cur;\n            }\n        }\n        if (type === \"number\") {\n            if (typeof (cur) === \"string\" && cur.match(/^-?[0-9.]*$/)) {\n                return parseFloat(cur);\n            }\n        }\n        if (type === \"data\") {\n            if (typeof (cur) === \"string\") {\n                return looseArrayify(cur);\n            }\n        }\n        if (type === \"array\" && Array.isArray(cur)) {\n            return cur;\n        }\n        if (type === typeof (cur)) {\n            return cur;\n        }\n        assertArgument(false, `wrong type found for ${type} `, \"path\", path);\n    }\n    return cur;\n}\n/*\nexport function follow(object: any, path: string): null | string {\n    let currentChild = object;\n\n    for (const comp of path.toLowerCase().split('/')) {\n\n        // Search for a child object with a case-insensitive matching key\n        let matchingChild = null;\n        for (const key in currentChild) {\n             if (key.toLowerCase() === comp) {\n                 matchingChild = currentChild[key];\n                 break;\n             }\n        }\n\n        if (matchingChild === null) { return null; }\n\n        currentChild = matchingChild;\n    }\n\n    return currentChild;\n}\n\n// \"path/to/something:type!\"\nexport function followRequired(data: any, path: string): string {\n    const value = follow(data, path);\n    if (value != null) { return value; }\n    return logger.throwArgumentError(\"invalid value\", `data:${ path }`,\n    JSON.stringify(data));\n}\n*/\n// See: https://www.ietf.org/rfc/rfc4122.txt (Section 4.4)\n/*\nexport function uuidV4(randomBytes: BytesLike): string {\n    const bytes = getBytes(randomBytes, \"randomBytes\");\n\n    // Section: 4.1.3:\n    // - time_hi_and_version[12:16] = 0b0100\n    bytes[6] = (bytes[6] & 0x0f) | 0x40;\n\n    // Section 4.4\n    // - clock_seq_hi_and_reserved[6] = 0b0\n    // - clock_seq_hi_and_reserved[7] = 0b1\n    bytes[8] = (bytes[8] & 0x3f) | 0x80;\n\n    const value = hexlify(bytes);\n\n    return [\n       value.substring(2, 10),\n       value.substring(10, 14),\n       value.substring(14, 18),\n       value.substring(18, 22),\n       value.substring(22, 34),\n    ].join(\"-\");\n}\n*/\n//# sourceMappingURL=utils.js.map","/**\n *  The JSON Wallet formats allow a simple way to store the private\n *  keys needed in Ethereum along with related information and allows\n *  for extensible forms of encryption.\n *\n *  These utilities facilitate decrypting and encrypting the most common\n *  JSON Wallet formats.\n *\n *  @_subsection: api/wallet:JSON Wallets  [json-wallets]\n */\nimport { CTR } from \"aes-js\";\nimport { getAddress } from \"../address/index.js\";\nimport { keccak256, pbkdf2, randomBytes, scrypt, scryptSync } from \"../crypto/index.js\";\nimport { computeAddress } from \"../transaction/index.js\";\nimport { concat, getBytes, hexlify, uuidV4, assert, assertArgument } from \"../utils/index.js\";\nimport { getPassword, spelunk, zpad } from \"./utils.js\";\nimport { version } from \"../_version.js\";\nconst defaultPath = \"m/44'/60'/0'/0/0\";\n/**\n *  Returns true if %%json%% is a valid JSON Keystore Wallet.\n */\nexport function isKeystoreJson(json) {\n    try {\n        const data = JSON.parse(json);\n        const version = ((data.version != null) ? parseInt(data.version) : 0);\n        if (version === 3) {\n            return true;\n        }\n    }\n    catch (error) { }\n    return false;\n}\nfunction decrypt(data, key, ciphertext) {\n    const cipher = spelunk(data, \"crypto.cipher:string\");\n    if (cipher === \"aes-128-ctr\") {\n        const iv = spelunk(data, \"crypto.cipherparams.iv:data!\");\n        const aesCtr = new CTR(key, iv);\n        return hexlify(aesCtr.decrypt(ciphertext));\n    }\n    assert(false, \"unsupported cipher\", \"UNSUPPORTED_OPERATION\", {\n        operation: \"decrypt\"\n    });\n}\nfunction getAccount(data, _key) {\n    const key = getBytes(_key);\n    const ciphertext = spelunk(data, \"crypto.ciphertext:data!\");\n    const computedMAC = hexlify(keccak256(concat([key.slice(16, 32), ciphertext]))).substring(2);\n    assertArgument(computedMAC === spelunk(data, \"crypto.mac:string!\").toLowerCase(), \"incorrect password\", \"password\", \"[ REDACTED ]\");\n    const privateKey = decrypt(data, key.slice(0, 16), ciphertext);\n    const address = computeAddress(privateKey);\n    if (data.address) {\n        let check = data.address.toLowerCase();\n        if (!check.startsWith(\"0x\")) {\n            check = \"0x\" + check;\n        }\n        assertArgument(getAddress(check) === address, \"keystore address/privateKey mismatch\", \"address\", data.address);\n    }\n    const account = { address, privateKey };\n    // Version 0.1 x-ethers metadata must contain an encrypted mnemonic phrase\n    const version = spelunk(data, \"x-ethers.version:string\");\n    if (version === \"0.1\") {\n        const mnemonicKey = key.slice(32, 64);\n        const mnemonicCiphertext = spelunk(data, \"x-ethers.mnemonicCiphertext:data!\");\n        const mnemonicIv = spelunk(data, \"x-ethers.mnemonicCounter:data!\");\n        const mnemonicAesCtr = new CTR(mnemonicKey, mnemonicIv);\n        account.mnemonic = {\n            path: (spelunk(data, \"x-ethers.path:string\") || defaultPath),\n            locale: (spelunk(data, \"x-ethers.locale:string\") || \"en\"),\n            entropy: hexlify(getBytes(mnemonicAesCtr.decrypt(mnemonicCiphertext)))\n        };\n    }\n    return account;\n}\nfunction getDecryptKdfParams(data) {\n    const kdf = spelunk(data, \"crypto.kdf:string\");\n    if (kdf && typeof (kdf) === \"string\") {\n        if (kdf.toLowerCase() === \"scrypt\") {\n            const salt = spelunk(data, \"crypto.kdfparams.salt:data!\");\n            const N = spelunk(data, \"crypto.kdfparams.n:int!\");\n            const r = spelunk(data, \"crypto.kdfparams.r:int!\");\n            const p = spelunk(data, \"crypto.kdfparams.p:int!\");\n            // Make sure N is a power of 2\n            assertArgument(N > 0 && (N & (N - 1)) === 0, \"invalid kdf.N\", \"kdf.N\", N);\n            assertArgument(r > 0 && p > 0, \"invalid kdf\", \"kdf\", kdf);\n            const dkLen = spelunk(data, \"crypto.kdfparams.dklen:int!\");\n            assertArgument(dkLen === 32, \"invalid kdf.dklen\", \"kdf.dflen\", dkLen);\n            return { name: \"scrypt\", salt, N, r, p, dkLen: 64 };\n        }\n        else if (kdf.toLowerCase() === \"pbkdf2\") {\n            const salt = spelunk(data, \"crypto.kdfparams.salt:data!\");\n            const prf = spelunk(data, \"crypto.kdfparams.prf:string!\");\n            const algorithm = prf.split(\"-\").pop();\n            assertArgument(algorithm === \"sha256\" || algorithm === \"sha512\", \"invalid kdf.pdf\", \"kdf.pdf\", prf);\n            const count = spelunk(data, \"crypto.kdfparams.c:int!\");\n            const dkLen = spelunk(data, \"crypto.kdfparams.dklen:int!\");\n            assertArgument(dkLen === 32, \"invalid kdf.dklen\", \"kdf.dklen\", dkLen);\n            return { name: \"pbkdf2\", salt, count, dkLen, algorithm };\n        }\n    }\n    assertArgument(false, \"unsupported key-derivation function\", \"kdf\", kdf);\n}\n/**\n *  Returns the account details for the JSON Keystore Wallet %%json%%\n *  using %%password%%.\n *\n *  It is preferred to use the [async version](decryptKeystoreJson)\n *  instead, which allows a [[ProgressCallback]] to keep the user informed\n *  as to the decryption status.\n *\n *  This method will block the event loop (freezing all UI) until decryption\n *  is complete, which can take quite some time, depending on the wallet\n *  paramters and platform.\n */\nexport function decryptKeystoreJsonSync(json, _password) {\n    const data = JSON.parse(json);\n    const password = getPassword(_password);\n    const params = getDecryptKdfParams(data);\n    if (params.name === \"pbkdf2\") {\n        const { salt, count, dkLen, algorithm } = params;\n        const key = pbkdf2(password, salt, count, dkLen, algorithm);\n        return getAccount(data, key);\n    }\n    assert(params.name === \"scrypt\", \"cannot be reached\", \"UNKNOWN_ERROR\", { params });\n    const { salt, N, r, p, dkLen } = params;\n    const key = scryptSync(password, salt, N, r, p, dkLen);\n    return getAccount(data, key);\n}\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(() => { resolve(); }, duration); });\n}\n/**\n *  Resolves to the decrypted JSON Keystore Wallet %%json%% using the\n *  %%password%%.\n *\n *  If provided, %%progress%% will be called periodically during the\n *  decrpytion to provide feedback, and if the function returns\n *  ``false`` will halt decryption.\n *\n *  The %%progressCallback%% will **always** receive ``0`` before\n *  decryption begins and ``1`` when complete.\n */\nexport async function decryptKeystoreJson(json, _password, progress) {\n    const data = JSON.parse(json);\n    const password = getPassword(_password);\n    const params = getDecryptKdfParams(data);\n    if (params.name === \"pbkdf2\") {\n        if (progress) {\n            progress(0);\n            await stall(0);\n        }\n        const { salt, count, dkLen, algorithm } = params;\n        const key = pbkdf2(password, salt, count, dkLen, algorithm);\n        if (progress) {\n            progress(1);\n            await stall(0);\n        }\n        return getAccount(data, key);\n    }\n    assert(params.name === \"scrypt\", \"cannot be reached\", \"UNKNOWN_ERROR\", { params });\n    const { salt, N, r, p, dkLen } = params;\n    const key = await scrypt(password, salt, N, r, p, dkLen, progress);\n    return getAccount(data, key);\n}\nfunction getEncryptKdfParams(options) {\n    // Check/generate the salt\n    const salt = (options.salt != null) ? getBytes(options.salt, \"options.salt\") : randomBytes(32);\n    // Override the scrypt password-based key derivation function parameters\n    let N = (1 << 17), r = 8, p = 1;\n    if (options.scrypt) {\n        if (options.scrypt.N) {\n            N = options.scrypt.N;\n        }\n        if (options.scrypt.r) {\n            r = options.scrypt.r;\n        }\n        if (options.scrypt.p) {\n            p = options.scrypt.p;\n        }\n    }\n    assertArgument(typeof (N) === \"number\" && N > 0 && Number.isSafeInteger(N) && (BigInt(N) & BigInt(N - 1)) === BigInt(0), \"invalid scrypt N parameter\", \"options.N\", N);\n    assertArgument(typeof (r) === \"number\" && r > 0 && Number.isSafeInteger(r), \"invalid scrypt r parameter\", \"options.r\", r);\n    assertArgument(typeof (p) === \"number\" && p > 0 && Number.isSafeInteger(p), \"invalid scrypt p parameter\", \"options.p\", p);\n    return { name: \"scrypt\", dkLen: 32, salt, N, r, p };\n}\nfunction _encryptKeystore(key, kdf, account, options) {\n    const privateKey = getBytes(account.privateKey, \"privateKey\");\n    // Override initialization vector\n    const iv = (options.iv != null) ? getBytes(options.iv, \"options.iv\") : randomBytes(16);\n    assertArgument(iv.length === 16, \"invalid options.iv length\", \"options.iv\", options.iv);\n    // Override the uuid\n    const uuidRandom = (options.uuid != null) ? getBytes(options.uuid, \"options.uuid\") : randomBytes(16);\n    assertArgument(uuidRandom.length === 16, \"invalid options.uuid length\", \"options.uuid\", options.iv);\n    // This will be used to encrypt the wallet (as per Web3 secret storage)\n    // - 32 bytes   As normal for the Web3 secret storage (derivedKey, macPrefix)\n    // - 32 bytes   AES key to encrypt mnemonic with (required here to be Ethers Wallet)\n    const derivedKey = key.slice(0, 16);\n    const macPrefix = key.slice(16, 32);\n    // Encrypt the private key\n    const aesCtr = new CTR(derivedKey, iv);\n    const ciphertext = getBytes(aesCtr.encrypt(privateKey));\n    // Compute the message authentication code, used to check the password\n    const mac = keccak256(concat([macPrefix, ciphertext]));\n    // See: https://github.com/ethereum/wiki/wiki/Web3-Secret-Storage-Definition\n    const data = {\n        address: account.address.substring(2).toLowerCase(),\n        id: uuidV4(uuidRandom),\n        version: 3,\n        Crypto: {\n            cipher: \"aes-128-ctr\",\n            cipherparams: {\n                iv: hexlify(iv).substring(2),\n            },\n            ciphertext: hexlify(ciphertext).substring(2),\n            kdf: \"scrypt\",\n            kdfparams: {\n                salt: hexlify(kdf.salt).substring(2),\n                n: kdf.N,\n                dklen: 32,\n                p: kdf.p,\n                r: kdf.r\n            },\n            mac: mac.substring(2)\n        }\n    };\n    // If we have a mnemonic, encrypt it into the JSON wallet\n    if (account.mnemonic) {\n        const client = (options.client != null) ? options.client : `ethers/${version}`;\n        const path = account.mnemonic.path || defaultPath;\n        const locale = account.mnemonic.locale || \"en\";\n        const mnemonicKey = key.slice(32, 64);\n        const entropy = getBytes(account.mnemonic.entropy, \"account.mnemonic.entropy\");\n        const mnemonicIv = randomBytes(16);\n        const mnemonicAesCtr = new CTR(mnemonicKey, mnemonicIv);\n        const mnemonicCiphertext = getBytes(mnemonicAesCtr.encrypt(entropy));\n        const now = new Date();\n        const timestamp = (now.getUTCFullYear() + \"-\" +\n            zpad(now.getUTCMonth() + 1, 2) + \"-\" +\n            zpad(now.getUTCDate(), 2) + \"T\" +\n            zpad(now.getUTCHours(), 2) + \"-\" +\n            zpad(now.getUTCMinutes(), 2) + \"-\" +\n            zpad(now.getUTCSeconds(), 2) + \".0Z\");\n        const gethFilename = (\"UTC--\" + timestamp + \"--\" + data.address);\n        data[\"x-ethers\"] = {\n            client, gethFilename, path, locale,\n            mnemonicCounter: hexlify(mnemonicIv).substring(2),\n            mnemonicCiphertext: hexlify(mnemonicCiphertext).substring(2),\n            version: \"0.1\"\n        };\n    }\n    return JSON.stringify(data);\n}\n/**\n *  Return the JSON Keystore Wallet for %%account%% encrypted with\n *  %%password%%.\n *\n *  The %%options%% can be used to tune the password-based key\n *  derivation function parameters, explicitly set the random values\n *  used. Any provided [[ProgressCallback]] is ignord.\n */\nexport function encryptKeystoreJsonSync(account, password, options) {\n    if (options == null) {\n        options = {};\n    }\n    const passwordBytes = getPassword(password);\n    const kdf = getEncryptKdfParams(options);\n    const key = scryptSync(passwordBytes, kdf.salt, kdf.N, kdf.r, kdf.p, 64);\n    return _encryptKeystore(getBytes(key), kdf, account, options);\n}\n/**\n *  Resolved to the JSON Keystore Wallet for %%account%% encrypted\n *  with %%password%%.\n *\n *  The %%options%% can be used to tune the password-based key\n *  derivation function parameters, explicitly set the random values\n *  used and provide a [[ProgressCallback]] to receive periodic updates\n *  on the completion status..\n */\nexport async function encryptKeystoreJson(account, password, options) {\n    if (options == null) {\n        options = {};\n    }\n    const passwordBytes = getPassword(password);\n    const kdf = getEncryptKdfParams(options);\n    const key = await scrypt(passwordBytes, kdf.salt, kdf.N, kdf.r, kdf.p, 64, options.progressCallback);\n    return _encryptKeystore(getBytes(key), kdf, account, options);\n}\n//# sourceMappingURL=json-keystore.js.map","/**\n *  Explain HD Wallets..\n *\n *  @_subsection: api/wallet:HD Wallets  [hd-wallets]\n */\nimport { computeHmac, randomBytes, ripemd160, SigningKey, sha256 } from \"../crypto/index.js\";\nimport { VoidSigner } from \"../providers/index.js\";\nimport { computeAddress } from \"../transaction/index.js\";\nimport { concat, dataSlice, decodeBase58, defineProperties, encodeBase58, getBytes, hexlify, isBytesLike, getNumber, toBeArray, toBigInt, toBeHex, assertPrivate, assert, assertArgument } from \"../utils/index.js\";\nimport { LangEn } from \"../wordlists/lang-en.js\";\nimport { BaseWallet } from \"./base-wallet.js\";\nimport { Mnemonic } from \"./mnemonic.js\";\nimport { encryptKeystoreJson, encryptKeystoreJsonSync, } from \"./json-keystore.js\";\n/**\n *  The default derivation path for Ethereum HD Nodes. (i.e. ``\"m/44'/60'/0'/0/0\"``)\n */\nexport const defaultPath = \"m/44'/60'/0'/0/0\";\n// \"Bitcoin seed\"\nconst MasterSecret = new Uint8Array([66, 105, 116, 99, 111, 105, 110, 32, 115, 101, 101, 100]);\nconst HardenedBit = 0x80000000;\nconst N = BigInt(\"0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141\");\nconst Nibbles = \"0123456789abcdef\";\nfunction zpad(value, length) {\n    let result = \"\";\n    while (value) {\n        result = Nibbles[value % 16] + result;\n        value = Math.trunc(value / 16);\n    }\n    while (result.length < length * 2) {\n        result = \"0\" + result;\n    }\n    return \"0x\" + result;\n}\nfunction encodeBase58Check(_value) {\n    const value = getBytes(_value);\n    const check = dataSlice(sha256(sha256(value)), 0, 4);\n    const bytes = concat([value, check]);\n    return encodeBase58(bytes);\n}\nconst _guard = {};\nfunction ser_I(index, chainCode, publicKey, privateKey) {\n    const data = new Uint8Array(37);\n    if (index & HardenedBit) {\n        assert(privateKey != null, \"cannot derive child of neutered node\", \"UNSUPPORTED_OPERATION\", {\n            operation: \"deriveChild\"\n        });\n        // Data = 0x00 || ser_256(k_par)\n        data.set(getBytes(privateKey), 1);\n    }\n    else {\n        // Data = ser_p(point(k_par))\n        data.set(getBytes(publicKey));\n    }\n    // Data += ser_32(i)\n    for (let i = 24; i >= 0; i -= 8) {\n        data[33 + (i >> 3)] = ((index >> (24 - i)) & 0xff);\n    }\n    const I = getBytes(computeHmac(\"sha512\", chainCode, data));\n    return { IL: I.slice(0, 32), IR: I.slice(32) };\n}\nfunction derivePath(node, path) {\n    const components = path.split(\"/\");\n    assertArgument(components.length > 0, \"invalid path\", \"path\", path);\n    if (components[0] === \"m\") {\n        assertArgument(node.depth === 0, `cannot derive root path (i.e. path starting with \"m/\") for a node at non-zero depth ${node.depth}`, \"path\", path);\n        components.shift();\n    }\n    let result = node;\n    for (let i = 0; i < components.length; i++) {\n        const component = components[i];\n        if (component.match(/^[0-9]+'$/)) {\n            const index = parseInt(component.substring(0, component.length - 1));\n            assertArgument(index < HardenedBit, \"invalid path index\", `path[${i}]`, component);\n            result = result.deriveChild(HardenedBit + index);\n        }\n        else if (component.match(/^[0-9]+$/)) {\n            const index = parseInt(component);\n            assertArgument(index < HardenedBit, \"invalid path index\", `path[${i}]`, component);\n            result = result.deriveChild(index);\n        }\n        else {\n            assertArgument(false, \"invalid path component\", `path[${i}]`, component);\n        }\n    }\n    return result;\n}\n/**\n *  An **HDNodeWallet** is a [[Signer]] backed by the private key derived\n *  from an HD Node using the [[link-bip-32]] stantard.\n *\n *  An HD Node forms a hierarchal structure with each HD Node having a\n *  private key and the ability to derive child HD Nodes, defined by\n *  a path indicating the index of each child.\n */\nexport class HDNodeWallet extends BaseWallet {\n    /**\n     *  The compressed public key.\n     */\n    publicKey;\n    /**\n     *  The fingerprint.\n     *\n     *  A fingerprint allows quick qay to detect parent and child nodes,\n     *  but developers should be prepared to deal with collisions as it\n     *  is only 4 bytes.\n     */\n    fingerprint;\n    /**\n     *  The parent fingerprint.\n     */\n    parentFingerprint;\n    /**\n     *  The mnemonic used to create this HD Node, if available.\n     *\n     *  Sources such as extended keys do not encode the mnemonic, in\n     *  which case this will be ``null``.\n     */\n    mnemonic;\n    /**\n     *  The chaincode, which is effectively a public key used\n     *  to derive children.\n     */\n    chainCode;\n    /**\n     *  The derivation path of this wallet.\n     *\n     *  Since extended keys do not provide full path details, this\n     *  may be ``null``, if instantiated from a source that does not\n     *  encode it.\n     */\n    path;\n    /**\n     *  The child index of this wallet. Values over ``2 *\\* 31`` indicate\n     *  the node is hardened.\n     */\n    index;\n    /**\n     *  The depth of this wallet, which is the number of components\n     *  in its path.\n     */\n    depth;\n    /**\n     *  @private\n     */\n    constructor(guard, signingKey, parentFingerprint, chainCode, path, index, depth, mnemonic, provider) {\n        super(signingKey, provider);\n        assertPrivate(guard, _guard, \"HDNodeWallet\");\n        defineProperties(this, { publicKey: signingKey.compressedPublicKey });\n        const fingerprint = dataSlice(ripemd160(sha256(this.publicKey)), 0, 4);\n        defineProperties(this, {\n            parentFingerprint, fingerprint,\n            chainCode, path, index, depth\n        });\n        defineProperties(this, { mnemonic });\n    }\n    connect(provider) {\n        return new HDNodeWallet(_guard, this.signingKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, this.mnemonic, provider);\n    }\n    #account() {\n        const account = { address: this.address, privateKey: this.privateKey };\n        const m = this.mnemonic;\n        if (this.path && m && m.wordlist.locale === \"en\" && m.password === \"\") {\n            account.mnemonic = {\n                path: this.path,\n                locale: \"en\",\n                entropy: m.entropy\n            };\n        }\n        return account;\n    }\n    /**\n     *  Resolves to a [JSON Keystore Wallet](json-wallets) encrypted with\n     *  %%password%%.\n     *\n     *  If %%progressCallback%% is specified, it will receive periodic\n     *  updates as the encryption process progreses.\n     */\n    async encrypt(password, progressCallback) {\n        return await encryptKeystoreJson(this.#account(), password, { progressCallback });\n    }\n    /**\n     *  Returns a [JSON Keystore Wallet](json-wallets) encryped with\n     *  %%password%%.\n     *\n     *  It is preferred to use the [async version](encrypt) instead,\n     *  which allows a [[ProgressCallback]] to keep the user informed.\n     *\n     *  This method will block the event loop (freezing all UI) until\n     *  it is complete, which may be a non-trivial duration.\n     */\n    encryptSync(password) {\n        return encryptKeystoreJsonSync(this.#account(), password);\n    }\n    /**\n     *  The extended key.\n     *\n     *  This key will begin with the prefix ``xpriv`` and can be used to\n     *  reconstruct this HD Node to derive its children.\n     */\n    get extendedKey() {\n        // We only support the mainnet values for now, but if anyone needs\n        // testnet values, let me know. I believe current sentiment is that\n        // we should always use mainnet, and use BIP-44 to derive the network\n        //   - Mainnet: public=0x0488B21E, private=0x0488ADE4\n        //   - Testnet: public=0x043587CF, private=0x04358394\n        assert(this.depth < 256, \"Depth too deep\", \"UNSUPPORTED_OPERATION\", { operation: \"extendedKey\" });\n        return encodeBase58Check(concat([\n            \"0x0488ADE4\", zpad(this.depth, 1), this.parentFingerprint,\n            zpad(this.index, 4), this.chainCode,\n            concat([\"0x00\", this.privateKey])\n        ]));\n    }\n    /**\n     *  Returns true if this wallet has a path, providing a Type Guard\n     *  that the path is non-null.\n     */\n    hasPath() { return (this.path != null); }\n    /**\n     *  Returns a neutered HD Node, which removes the private details\n     *  of an HD Node.\n     *\n     *  A neutered node has no private key, but can be used to derive\n     *  child addresses and other public data about the HD Node.\n     */\n    neuter() {\n        return new HDNodeVoidWallet(_guard, this.address, this.publicKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, this.provider);\n    }\n    /**\n     *  Return the child for %%index%%.\n     */\n    deriveChild(_index) {\n        const index = getNumber(_index, \"index\");\n        assertArgument(index <= 0xffffffff, \"invalid index\", \"index\", index);\n        // Base path\n        let path = this.path;\n        if (path) {\n            path += \"/\" + (index & ~HardenedBit);\n            if (index & HardenedBit) {\n                path += \"'\";\n            }\n        }\n        const { IR, IL } = ser_I(index, this.chainCode, this.publicKey, this.privateKey);\n        const ki = new SigningKey(toBeHex((toBigInt(IL) + BigInt(this.privateKey)) % N, 32));\n        return new HDNodeWallet(_guard, ki, this.fingerprint, hexlify(IR), path, index, this.depth + 1, this.mnemonic, this.provider);\n    }\n    /**\n     *  Return the HDNode for %%path%% from this node.\n     */\n    derivePath(path) {\n        return derivePath(this, path);\n    }\n    static #fromSeed(_seed, mnemonic) {\n        assertArgument(isBytesLike(_seed), \"invalid seed\", \"seed\", \"[REDACTED]\");\n        const seed = getBytes(_seed, \"seed\");\n        assertArgument(seed.length >= 16 && seed.length <= 64, \"invalid seed\", \"seed\", \"[REDACTED]\");\n        const I = getBytes(computeHmac(\"sha512\", MasterSecret, seed));\n        const signingKey = new SigningKey(hexlify(I.slice(0, 32)));\n        return new HDNodeWallet(_guard, signingKey, \"0x00000000\", hexlify(I.slice(32)), \"m\", 0, 0, mnemonic, null);\n    }\n    /**\n     *  Creates a new HD Node from %%extendedKey%%.\n     *\n     *  If the %%extendedKey%% will either have a prefix or ``xpub`` or\n     *  ``xpriv``, returning a neutered HD Node ([[HDNodeVoidWallet]])\n     *  or full HD Node ([[HDNodeWallet) respectively.\n     */\n    static fromExtendedKey(extendedKey) {\n        const bytes = toBeArray(decodeBase58(extendedKey)); // @TODO: redact\n        assertArgument(bytes.length === 82 || encodeBase58Check(bytes.slice(0, 78)) === extendedKey, \"invalid extended key\", \"extendedKey\", \"[ REDACTED ]\");\n        const depth = bytes[4];\n        const parentFingerprint = hexlify(bytes.slice(5, 9));\n        const index = parseInt(hexlify(bytes.slice(9, 13)).substring(2), 16);\n        const chainCode = hexlify(bytes.slice(13, 45));\n        const key = bytes.slice(45, 78);\n        switch (hexlify(bytes.slice(0, 4))) {\n            // Public Key\n            case \"0x0488b21e\":\n            case \"0x043587cf\": {\n                const publicKey = hexlify(key);\n                return new HDNodeVoidWallet(_guard, computeAddress(publicKey), publicKey, parentFingerprint, chainCode, null, index, depth, null);\n            }\n            // Private Key\n            case \"0x0488ade4\":\n            case \"0x04358394 \":\n                if (key[0] !== 0) {\n                    break;\n                }\n                return new HDNodeWallet(_guard, new SigningKey(key.slice(1)), parentFingerprint, chainCode, null, index, depth, null, null);\n        }\n        assertArgument(false, \"invalid extended key prefix\", \"extendedKey\", \"[ REDACTED ]\");\n    }\n    /**\n     *  Creates a new random HDNode.\n     */\n    static createRandom(password, path, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (path == null) {\n            path = defaultPath;\n        }\n        if (wordlist == null) {\n            wordlist = LangEn.wordlist();\n        }\n        const mnemonic = Mnemonic.fromEntropy(randomBytes(16), password, wordlist);\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Create an HD Node from %%mnemonic%%.\n     */\n    static fromMnemonic(mnemonic, path) {\n        if (!path) {\n            path = defaultPath;\n        }\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Creates an HD Node from a mnemonic %%phrase%%.\n     */\n    static fromPhrase(phrase, password, path, wordlist) {\n        if (password == null) {\n            password = \"\";\n        }\n        if (path == null) {\n            path = defaultPath;\n        }\n        if (wordlist == null) {\n            wordlist = LangEn.wordlist();\n        }\n        const mnemonic = Mnemonic.fromPhrase(phrase, password, wordlist);\n        return HDNodeWallet.#fromSeed(mnemonic.computeSeed(), mnemonic).derivePath(path);\n    }\n    /**\n     *  Creates an HD Node from a %%seed%%.\n     */\n    static fromSeed(seed) {\n        return HDNodeWallet.#fromSeed(seed, null);\n    }\n}\n/**\n *  A **HDNodeVoidWallet** cannot sign, but provides access to\n *  the children nodes of a [[link-bip-32]] HD wallet addresses.\n *\n *  The can be created by using an extended ``xpub`` key to\n *  [[HDNodeWallet_fromExtendedKey]] or by\n *  [nuetering](HDNodeWallet-neuter) a [[HDNodeWallet]].\n */\nexport class HDNodeVoidWallet extends VoidSigner {\n    /**\n     *  The compressed public key.\n     */\n    publicKey;\n    /**\n     *  The fingerprint.\n     *\n     *  A fingerprint allows quick qay to detect parent and child nodes,\n     *  but developers should be prepared to deal with collisions as it\n     *  is only 4 bytes.\n     */\n    fingerprint;\n    /**\n     *  The parent node fingerprint.\n     */\n    parentFingerprint;\n    /**\n     *  The chaincode, which is effectively a public key used\n     *  to derive children.\n     */\n    chainCode;\n    /**\n     *  The derivation path of this wallet.\n     *\n     *  Since extended keys do not provider full path details, this\n     *  may be ``null``, if instantiated from a source that does not\n     *  enocde it.\n     */\n    path;\n    /**\n     *  The child index of this wallet. Values over ``2 *\\* 31`` indicate\n     *  the node is hardened.\n     */\n    index;\n    /**\n     *  The depth of this wallet, which is the number of components\n     *  in its path.\n     */\n    depth;\n    /**\n     *  @private\n     */\n    constructor(guard, address, publicKey, parentFingerprint, chainCode, path, index, depth, provider) {\n        super(address, provider);\n        assertPrivate(guard, _guard, \"HDNodeVoidWallet\");\n        defineProperties(this, { publicKey });\n        const fingerprint = dataSlice(ripemd160(sha256(publicKey)), 0, 4);\n        defineProperties(this, {\n            publicKey, fingerprint, parentFingerprint, chainCode, path, index, depth\n        });\n    }\n    connect(provider) {\n        return new HDNodeVoidWallet(_guard, this.address, this.publicKey, this.parentFingerprint, this.chainCode, this.path, this.index, this.depth, provider);\n    }\n    /**\n     *  The extended key.\n     *\n     *  This key will begin with the prefix ``xpub`` and can be used to\n     *  reconstruct this neutered key to derive its children addresses.\n     */\n    get extendedKey() {\n        // We only support the mainnet values for now, but if anyone needs\n        // testnet values, let me know. I believe current sentiment is that\n        // we should always use mainnet, and use BIP-44 to derive the network\n        //   - Mainnet: public=0x0488B21E, private=0x0488ADE4\n        //   - Testnet: public=0x043587CF, private=0x04358394\n        assert(this.depth < 256, \"Depth too deep\", \"UNSUPPORTED_OPERATION\", { operation: \"extendedKey\" });\n        return encodeBase58Check(concat([\n            \"0x0488B21E\",\n            zpad(this.depth, 1),\n            this.parentFingerprint,\n            zpad(this.index, 4),\n            this.chainCode,\n            this.publicKey,\n        ]));\n    }\n    /**\n     *  Returns true if this wallet has a path, providing a Type Guard\n     *  that the path is non-null.\n     */\n    hasPath() { return (this.path != null); }\n    /**\n     *  Return the child for %%index%%.\n     */\n    deriveChild(_index) {\n        const index = getNumber(_index, \"index\");\n        assertArgument(index <= 0xffffffff, \"invalid index\", \"index\", index);\n        // Base path\n        let path = this.path;\n        if (path) {\n            path += \"/\" + (index & ~HardenedBit);\n            if (index & HardenedBit) {\n                path += \"'\";\n            }\n        }\n        const { IR, IL } = ser_I(index, this.chainCode, this.publicKey, null);\n        const Ki = SigningKey.addPoints(IL, this.publicKey, true);\n        const address = computeAddress(Ki);\n        return new HDNodeVoidWallet(_guard, address, Ki, this.fingerprint, hexlify(IR), path, index, this.depth + 1, this.provider);\n    }\n    /**\n     *  Return the signer for %%path%% from this node.\n     */\n    derivePath(path) {\n        return derivePath(this, path);\n    }\n}\n/*\nexport class HDNodeWalletManager {\n    #root: HDNodeWallet;\n\n    constructor(phrase: string, password?: null | string, path?: null | string, locale?: null | Wordlist) {\n        if (password == null) { password = \"\"; }\n        if (path == null) { path = \"m/44'/60'/0'/0\"; }\n        if (locale == null) { locale = LangEn.wordlist(); }\n        this.#root = HDNodeWallet.fromPhrase(phrase, password, path, locale);\n    }\n\n    getSigner(index?: number): HDNodeWallet {\n        return this.#root.deriveChild((index == null) ? 0: index);\n    }\n}\n*/\n/**\n *  Returns the [[link-bip-32]] path for the account at %%index%%.\n *\n *  This is the pattern used by wallets like Ledger.\n *\n *  There is also an [alternate pattern](getIndexedAccountPath) used by\n *  some software.\n */\nexport function getAccountPath(_index) {\n    const index = getNumber(_index, \"index\");\n    assertArgument(index >= 0 && index < HardenedBit, \"invalid account index\", \"index\", index);\n    return `m/44'/60'/${index}'/0/0`;\n}\n/**\n *  Returns the path using an alternative pattern for deriving accounts,\n *  at %%index%%.\n *\n *  This derivation path uses the //index// component rather than the\n *  //account// component to derive sequential accounts.\n *\n *  This is the pattern used by wallets like MetaMask.\n */\nexport function getIndexedAccountPath(_index) {\n    const index = getNumber(_index, \"index\");\n    assertArgument(index >= 0 && index < HardenedBit, \"invalid account index\", \"index\", index);\n    return `m/44'/60'/0'/0/${index}`;\n}\n//# sourceMappingURL=hdwallet.js.map","/**\n *  @_subsection: api/wallet:JSON Wallets  [json-wallets]\n */\nimport { CBC, pkcs7Strip } from \"aes-js\";\nimport { getAddress } from \"../address/index.js\";\nimport { pbkdf2 } from \"../crypto/index.js\";\nimport { id } from \"../hash/index.js\";\nimport { getBytes, assertArgument } from \"../utils/index.js\";\nimport { getPassword, looseArrayify, spelunk } from \"./utils.js\";\n/**\n *  Returns true if %%json%% is a valid JSON Crowdsale wallet.\n */\nexport function isCrowdsaleJson(json) {\n    try {\n        const data = JSON.parse(json);\n        if (data.encseed) {\n            return true;\n        }\n    }\n    catch (error) { }\n    return false;\n}\n// See: https://github.com/ethereum/pyethsaletool\n/**\n *  Before Ethereum launched, it was necessary to create a wallet\n *  format for backers to use, which would be used to receive ether\n *  as a reward for contributing to the project.\n *\n *  The [[link-crowdsale]] format is now obsolete, but it is still\n *  useful to support and the additional code is fairly trivial as\n *  all the primitives required are used through core portions of\n *  the library.\n */\nexport function decryptCrowdsaleJson(json, _password) {\n    const data = JSON.parse(json);\n    const password = getPassword(_password);\n    // Ethereum Address\n    const address = getAddress(spelunk(data, \"ethaddr:string!\"));\n    // Encrypted Seed\n    const encseed = looseArrayify(spelunk(data, \"encseed:string!\"));\n    assertArgument(encseed && (encseed.length % 16) === 0, \"invalid encseed\", \"json\", json);\n    const key = getBytes(pbkdf2(password, password, 2000, 32, \"sha256\")).slice(0, 16);\n    const iv = encseed.slice(0, 16);\n    const encryptedSeed = encseed.slice(16);\n    // Decrypt the seed\n    const aesCbc = new CBC(key, iv);\n    const seed = pkcs7Strip(getBytes(aesCbc.decrypt(encryptedSeed)));\n    // This wallet format is weird... Convert the binary encoded hex to a string.\n    let seedHex = \"\";\n    for (let i = 0; i < seed.length; i++) {\n        seedHex += String.fromCharCode(seed[i]);\n    }\n    return { address, privateKey: id(seedHex) };\n}\n//# sourceMappingURL=json-crowdsale.js.map","export function pkcs7Pad(data) {\n    const padder = 16 - (data.length % 16);\n    const result = new Uint8Array(data.length + padder);\n    result.set(data);\n    for (let i = data.length; i < result.length; i++) {\n        result[i] = padder;\n    }\n    return result;\n}\nexport function pkcs7Strip(data) {\n    if (data.length < 16) {\n        throw new TypeError('PKCS#7 invalid length');\n    }\n    const padder = data[data.length - 1];\n    if (padder > 16) {\n        throw new TypeError('PKCS#7 padding byte out of range');\n    }\n    const length = data.length - padder;\n    for (let i = 0; i < padder; i++) {\n        if (data[length + i] !== padder) {\n            throw new TypeError('PKCS#7 invalid padding byte');\n        }\n    }\n    return new Uint8Array(data.subarray(0, length));\n}\n//# sourceMappingURL=padding.js.map","import { SigningKey } from \"../crypto/index.js\";\nimport { assertArgument } from \"../utils/index.js\";\nimport { BaseWallet } from \"./base-wallet.js\";\nimport { HDNodeWallet } from \"./hdwallet.js\";\nimport { decryptCrowdsaleJson, isCrowdsaleJson } from \"./json-crowdsale.js\";\nimport { decryptKeystoreJson, decryptKeystoreJsonSync, encryptKeystoreJson, encryptKeystoreJsonSync, isKeystoreJson } from \"./json-keystore.js\";\nimport { Mnemonic } from \"./mnemonic.js\";\nfunction stall(duration) {\n    return new Promise((resolve) => { setTimeout(() => { resolve(); }, duration); });\n}\n/**\n *  A **Wallet** manages a single private key which is used to sign\n *  transactions, messages and other common payloads.\n *\n *  This class is generally the main entry point for developers\n *  that wish to use a private key directly, as it can create\n *  instances from a large variety of common sources, including\n *  raw private key, [[link-bip-39]] mnemonics and encrypte JSON\n *  wallets.\n */\nexport class Wallet extends BaseWallet {\n    /**\n     *  Create a new wallet for the private %%key%%, optionally connected\n     *  to %%provider%%.\n     */\n    constructor(key, provider) {\n        if (typeof (key) === \"string\" && !key.startsWith(\"0x\")) {\n            key = \"0x\" + key;\n        }\n        let signingKey = (typeof (key) === \"string\") ? new SigningKey(key) : key;\n        super(signingKey, provider);\n    }\n    connect(provider) {\n        return new Wallet(this.signingKey, provider);\n    }\n    /**\n     *  Resolves to a [JSON Keystore Wallet](json-wallets) encrypted with\n     *  %%password%%.\n     *\n     *  If %%progressCallback%% is specified, it will receive periodic\n     *  updates as the encryption process progreses.\n     */\n    async encrypt(password, progressCallback) {\n        const account = { address: this.address, privateKey: this.privateKey };\n        return await encryptKeystoreJson(account, password, { progressCallback });\n    }\n    /**\n     *  Returns a [JSON Keystore Wallet](json-wallets) encryped with\n     *  %%password%%.\n     *\n     *  It is preferred to use the [async version](encrypt) instead,\n     *  which allows a [[ProgressCallback]] to keep the user informed.\n     *\n     *  This method will block the event loop (freezing all UI) until\n     *  it is complete, which may be a non-trivial duration.\n     */\n    encryptSync(password) {\n        const account = { address: this.address, privateKey: this.privateKey };\n        return encryptKeystoreJsonSync(account, password);\n    }\n    static #fromAccount(account) {\n        assertArgument(account, \"invalid JSON wallet\", \"json\", \"[ REDACTED ]\");\n        if (\"mnemonic\" in account && account.mnemonic && account.mnemonic.locale === \"en\") {\n            const mnemonic = Mnemonic.fromEntropy(account.mnemonic.entropy);\n            const wallet = HDNodeWallet.fromMnemonic(mnemonic, account.mnemonic.path);\n            if (wallet.address === account.address && wallet.privateKey === account.privateKey) {\n                return wallet;\n            }\n            console.log(\"WARNING: JSON mismatch address/privateKey != mnemonic; fallback onto private key\");\n        }\n        const wallet = new Wallet(account.privateKey);\n        assertArgument(wallet.address === account.address, \"address/privateKey mismatch\", \"json\", \"[ REDACTED ]\");\n        return wallet;\n    }\n    /**\n     *  Creates (asynchronously) a **Wallet** by decrypting the %%json%%\n     *  with %%password%%.\n     *\n     *  If %%progress%% is provided, it is called periodically during\n     *  decryption so that any UI can be updated.\n     */\n    static async fromEncryptedJson(json, password, progress) {\n        let account = null;\n        if (isKeystoreJson(json)) {\n            account = await decryptKeystoreJson(json, password, progress);\n        }\n        else if (isCrowdsaleJson(json)) {\n            if (progress) {\n                progress(0);\n                await stall(0);\n            }\n            account = decryptCrowdsaleJson(json, password);\n            if (progress) {\n                progress(1);\n                await stall(0);\n            }\n        }\n        return Wallet.#fromAccount(account);\n    }\n    /**\n     *  Creates a **Wallet** by decrypting the %%json%% with %%password%%.\n     *\n     *  The [[fromEncryptedJson]] method is preferred, as this method\n     *  will lock up and freeze the UI during decryption, which may take\n     *  some time.\n     */\n    static fromEncryptedJsonSync(json, password) {\n        let account = null;\n        if (isKeystoreJson(json)) {\n            account = decryptKeystoreJsonSync(json, password);\n        }\n        else if (isCrowdsaleJson(json)) {\n            account = decryptCrowdsaleJson(json, password);\n        }\n        else {\n            assertArgument(false, \"invalid JSON wallet\", \"json\", \"[ REDACTED ]\");\n        }\n        return Wallet.#fromAccount(account);\n    }\n    /**\n     *  Creates a new random [[HDNodeWallet]] using the available\n     *  [cryptographic random source](randomBytes).\n     *\n     *  If there is no crytographic random source, this will throw.\n     */\n    static createRandom(provider) {\n        const wallet = HDNodeWallet.createRandom();\n        if (provider) {\n            return wallet.connect(provider);\n        }\n        return wallet;\n    }\n    /**\n     *  Creates a [[HDNodeWallet]] for %%phrase%%.\n     */\n    static fromPhrase(phrase, provider) {\n        const wallet = HDNodeWallet.fromPhrase(phrase);\n        if (provider) {\n            return wallet.connect(provider);\n        }\n        return wallet;\n    }\n}\n//# sourceMappingURL=wallet.js.map","let contractAddresses = {\r\n  PROOF_OF_INTEGRITY_ADDRESS: \"0xe7f1725E7734CE288F8367e1Bb143E90bb3F0512\",\r\n  STEALTH_ANNOUNCER_ADDRESS: \"0x5FbDB2315678afecb367f032d93F642f64180aa3\"\r\n};\r\n\r\nif (typeof window === 'undefined') {\r\n  const { fileURLToPath } = require('url');\r\n  const { dirname } = require('path');\r\n  const { readFileSync } = require('fs');\r\n  const { join } = require('path');\r\n\r\n  try {\r\n    const __filename = fileURLToPath(import.meta.url);\r\n    const __dirname = dirname(__filename);\r\n    const rawdata = readFileSync(join(__dirname, 'contract-address.json'), 'utf8');\r\n    contractAddresses = JSON.parse(rawdata);\r\n    console.log(\"Loaded contract addresses:\", contractAddresses);\r\n  } catch (error) {\r\n    console.warn(\"Warning: contract-address.json not found or invalid\");\r\n  }\r\n}\r\n\r\nexport const LOCAL_CONFIG = {\r\n  CHAIN_ID: 1337,\r\n  PROOF_OF_INTEGRITY_ADDRESS: contractAddresses.PROOF_OF_INTEGRITY_ADDRESS,\r\n  STEALTH_ANNOUNCER_ADDRESS: contractAddresses.STEALTH_ANNOUNCER_ADDRESS,\r\n  RPC_URL: \"http://127.0.0.1:8545\",\r\n  GUN_PEER: \"http://localhost:8765/gun\"\r\n}; ","import { LOCAL_CONFIG } from '../config/local.js';\r\n\r\n// Indirizzi di produzione per diverse chain\r\nexport const CHAIN_CONFIG = {\r\n  optimismSepolia: {\r\n    STEALTH_ANNOUNCER_ADDRESS: \"0xD0F2e9DA59d2DFECFdE67CcF17300BB6093A72f8\",\r\n    PROOF_OF_INTEGRITY_ADDRESS: \"0x...\",\r\n    RPC_URL: \"https://sepolia.optimism.io\",\r\n    CHAIN_ID: 11155420\r\n  },\r\n  arbitrumSepolia: {\r\n    STEALTH_ANNOUNCER_ADDRESS: \"0x...\",\r\n    PROOF_OF_INTEGRITY_ADDRESS: \"0x...\",\r\n    RPC_URL: \"https://sepolia-rollup.arbitrum.io/rpc\",\r\n    CHAIN_ID: 421614\r\n  },\r\n  localhost: {\r\n    RPC_URL: \"http://127.0.0.1:8545\",\r\n    CHAIN_ID: 1337\r\n  }\r\n};\r\n\r\n// Esporta gli indirizzi di default (Optimism Sepolia)\r\nexport const STEALTH_ANNOUNCER_ADDRESS = CHAIN_CONFIG.optimismSepolia.STEALTH_ANNOUNCER_ADDRESS;\r\nexport const PROOF_OF_INTEGRITY_ADDRESS = CHAIN_CONFIG.optimismSepolia.PROOF_OF_INTEGRITY_ADDRESS;\r\n\r\n// Funzione per ottenere gli indirizzi corretti\r\nexport function getAddressesForChain(chainName) {\r\n  let config;\r\n\r\n  // Se è localhost, prova a caricare gli indirizzi locali\r\n  if (chainName === 'localhost') {\r\n    try {\r\n      // Carica gli indirizzi dal file generato dal deploy locale\r\n      const localAddresses = require('../config/contract-address.json');\r\n      config = {\r\n        ...CHAIN_CONFIG.localhost,\r\n        ...localAddresses\r\n      };\r\n      console.log(\"Using local addresses:\", config);\r\n      return config;\r\n    } catch (err) {\r\n      console.warn('No local addresses found');\r\n      throw new Error('No local addresses found. Did you run local deployment?');\r\n    }\r\n  }\r\n\r\n  // Altrimenti usa gli indirizzi di produzione\r\n  config = CHAIN_CONFIG[chainName];\r\n  if (!config) {\r\n    throw new Error(`Chain ${chainName} not supported. Supported chains: ${Object.keys(CHAIN_CONFIG).join(', ')}`);\r\n  }\r\n\r\n  return config;\r\n}\r\n\r\n// Funzione helper per verificare se siamo in ambiente locale\r\nexport function isLocalEnvironment() {\r\n  return process.env.NODE_ENV === 'development' && \r\n         typeof window !== 'undefined' && \r\n         window.location.hostname === 'localhost';\r\n}\r\n\r\nexport const STEALTH_ANNOUNCER_ABI = [\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"_devAddress\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"constructor\"\r\n  },\r\n  {\r\n    \"anonymous\": false,\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"string\",\r\n        \"name\": \"senderPublicKey\",\r\n        \"type\": \"string\"\r\n      },\r\n      {\r\n        \"internalType\": \"string\",\r\n        \"name\": \"spendingPublicKey\",\r\n        \"type\": \"string\"\r\n      },\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"stealthAddress\",\r\n        \"type\": \"address\"\r\n      },\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"timestamp\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"name\": \"StealthPaymentAnnounced\",\r\n    \"type\": \"event\"\r\n  },\r\n  {\r\n    \"anonymous\": false,\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"newAddress\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"name\": \"DevAddressUpdated\",\r\n    \"type\": \"event\"\r\n  },\r\n  {\r\n    \"anonymous\": false,\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"newFee\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"name\": \"DevFeeUpdated\",\r\n    \"type\": \"event\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"string\",\r\n        \"name\": \"senderPublicKey\",\r\n        \"type\": \"string\"\r\n      },\r\n      {\r\n        \"internalType\": \"string\",\r\n        \"name\": \"spendingPublicKey\",\r\n        \"type\": \"string\"\r\n      },\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"stealthAddress\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"name\": \"announcePayment\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"payable\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [],\r\n    \"name\": \"devAddress\",\r\n    \"outputs\": [\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [],\r\n    \"name\": \"devFee\",\r\n    \"outputs\": [\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [],\r\n    \"name\": \"getAnnouncementsCount\",\r\n    \"outputs\": [\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"fromIndex\",\r\n        \"type\": \"uint256\"\r\n      },\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"toIndex\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"name\": \"getAnnouncementsInRange\",\r\n    \"outputs\": [\r\n      {\r\n        \"components\": [\r\n          {\r\n            \"internalType\": \"string\",\r\n            \"name\": \"senderPublicKey\",\r\n            \"type\": \"string\"\r\n          },\r\n          {\r\n            \"internalType\": \"string\",\r\n            \"name\": \"spendingPublicKey\",\r\n            \"type\": \"string\"\r\n          },\r\n          {\r\n            \"internalType\": \"address\",\r\n            \"name\": \"stealthAddress\",\r\n            \"type\": \"address\"\r\n          },\r\n          {\r\n            \"internalType\": \"uint256\",\r\n            \"name\": \"timestamp\",\r\n            \"type\": \"uint256\"\r\n          }\r\n        ],\r\n        \"internalType\": \"struct StealthAnnouncer.StealthAnnouncement[]\",\r\n        \"name\": \"\",\r\n        \"type\": \"tuple[]\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"_newFee\",\r\n        \"type\": \"uint256\"\r\n      }\r\n    ],\r\n    \"name\": \"updateDevFee\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"_newAddress\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"name\": \"updateDevAddress\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [],\r\n    \"name\": \"withdrawStuckETH\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"function\"\r\n  }\r\n];\r\n\r\nexport const PROOF_OF_INTEGRITY_ABI = [\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"bytes[]\",\r\n        \"name\": \"nodeIds\",\r\n        \"type\": \"bytes[]\"\r\n      },\r\n      {\r\n        \"internalType\": \"bytes32[]\",\r\n        \"name\": \"contentHashes\",\r\n        \"type\": \"bytes32[]\"\r\n      }\r\n    ],\r\n    \"name\": \"batchUpdateData\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"anonymous\": false,\r\n    \"inputs\": [\r\n      {\r\n        \"indexed\": true,\r\n        \"internalType\": \"bytes\",\r\n        \"name\": \"nodeId\",\r\n        \"type\": \"bytes\"\r\n      },\r\n      {\r\n        \"indexed\": false,\r\n        \"internalType\": \"bytes32\",\r\n        \"name\": \"contentHash\",\r\n        \"type\": \"bytes32\"\r\n      },\r\n      {\r\n        \"indexed\": false,\r\n        \"internalType\": \"address\",\r\n        \"name\": \"updater\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"name\": \"DataUpdated\",\r\n    \"type\": \"event\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"bytes\",\r\n        \"name\": \"nodeId\",\r\n        \"type\": \"bytes\"\r\n      }\r\n    ],\r\n    \"name\": \"getLatestRecord\",\r\n    \"outputs\": [\r\n      {\r\n        \"internalType\": \"bytes32\",\r\n        \"name\": \"\",\r\n        \"type\": \"bytes32\"\r\n      },\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"\",\r\n        \"type\": \"uint256\"\r\n      },\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"bytes\",\r\n        \"name\": \"nodeId\",\r\n        \"type\": \"bytes\"\r\n      },\r\n      {\r\n        \"internalType\": \"bytes32\",\r\n        \"name\": \"contentHash\",\r\n        \"type\": \"bytes32\"\r\n      }\r\n    ],\r\n    \"name\": \"updateData\",\r\n    \"outputs\": [],\r\n    \"stateMutability\": \"nonpayable\",\r\n    \"type\": \"function\"\r\n  },\r\n  {\r\n    \"inputs\": [\r\n      {\r\n        \"internalType\": \"bytes\",\r\n        \"name\": \"nodeId\",\r\n        \"type\": \"bytes\"\r\n      },\r\n      {\r\n        \"internalType\": \"bytes32\",\r\n        \"name\": \"contentHash\",\r\n        \"type\": \"bytes32\"\r\n      }\r\n    ],\r\n    \"name\": \"verifyData\",\r\n    \"outputs\": [\r\n      {\r\n        \"internalType\": \"bool\",\r\n        \"name\": \"\",\r\n        \"type\": \"bool\"\r\n      },\r\n      {\r\n        \"internalType\": \"uint256\",\r\n        \"name\": \"\",\r\n        \"type\": \"uint256\"\r\n      },\r\n      {\r\n        \"internalType\": \"address\",\r\n        \"name\": \"\",\r\n        \"type\": \"address\"\r\n      }\r\n    ],\r\n    \"stateMutability\": \"view\",\r\n    \"type\": \"function\"\r\n  }\r\n];\r\n\r\n\r\nexport const SHINE_OPTIMISM_SEPOLIA = \"0x43D838b683F772F08f321E5FA265ad3e333BE9C2\";\r\n",";(function(){\n\n  /* UNBUILD */\n  function USE(arg, req){\n    return req? require(arg) : arg.slice? USE[R(arg)] : function(mod, path){\n      arg(mod = {exports: {}});\n      USE[R(path)] = mod.exports;\n    }\n    function R(p){\n      return p.split('/').slice(-1).toString().replace('.js','');\n    }\n  }\n  if(typeof module !== \"undefined\"){ var MODULE = module }\n  /* UNBUILD */\n\n  ;USE(function(module){\n    // Security, Encryption, and Authorization: SEA.js\n    // MANDATORY READING: https://gun.eco/explainers/data/security.html\n    // IT IS IMPLEMENTED IN A POLYFILL/SHIM APPROACH.\n    // THIS IS AN EARLY ALPHA!\n\n    if(typeof self !== \"undefined\"){ module.window = self } // should be safe for at least browser/worker/nodejs, need to check other envs like RN etc.\n    if(typeof window !== \"undefined\"){ module.window = window }\n\n    var tmp = module.window || module, u;\n    var SEA = tmp.SEA || {};\n\n    if(SEA.window = module.window){ SEA.window.SEA = SEA }\n\n    try{ if(u+'' !== typeof MODULE){ MODULE.exports = SEA } }catch(e){}\n    module.exports = SEA;\n  })(USE, './root');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    try{ if(SEA.window){\n      if(location.protocol.indexOf('s') < 0\n      && location.host.indexOf('localhost') < 0\n      && ! /^127\\.\\d+\\.\\d+\\.\\d+$/.test(location.hostname)\n      && location.protocol.indexOf('file:') < 0){\n        console.warn('HTTPS needed for WebCrypto in SEA, redirecting...');\n        location.protocol = 'https:'; // WebCrypto does NOT work without HTTPS!\n      }\n    } }catch(e){}\n  })(USE, './https');\n\n  ;USE(function(module){\n    var u;\n    if(u+''== typeof btoa){\n      if(u+'' == typeof Buffer){\n        try{ global.Buffer = USE(\"buffer\", 1).Buffer }catch(e){ console.log(\"Please `npm install buffer` or add it to your package.json !\") }\n      }\n      global.btoa = function(data){ return Buffer.from(data, \"binary\").toString(\"base64\") };\n      global.atob = function(data){ return Buffer.from(data, \"base64\").toString(\"binary\") };\n    }\n  })(USE, './base64');\n\n  ;USE(function(module){\n    USE('./base64');\n    // This is Array extended to have .toString(['utf8'|'hex'|'base64'])\n    function SeaArray() {}\n    Object.assign(SeaArray, { from: Array.from })\n    SeaArray.prototype = Object.create(Array.prototype)\n    SeaArray.prototype.toString = function(enc, start, end) { enc = enc || 'utf8'; start = start || 0;\n      const length = this.length\n      if (enc === 'hex') {\n        const buf = new Uint8Array(this)\n        return [ ...Array(((end && (end + 1)) || length) - start).keys()]\n        .map((i) => buf[ i + start ].toString(16).padStart(2, '0')).join('')\n      }\n      if (enc === 'utf8') {\n        return Array.from(\n          { length: (end || length) - start },\n          (_, i) => String.fromCharCode(this[ i + start])\n        ).join('')\n      }\n      if (enc === 'base64') {\n        return btoa(this)\n      }\n    }\n    module.exports = SeaArray;\n  })(USE, './array');\n\n  ;USE(function(module){\n    USE('./base64');\n    // This is Buffer implementation used in SEA. Functionality is mostly\n    // compatible with NodeJS 'safe-buffer' and is used for encoding conversions\n    // between binary and 'hex' | 'utf8' | 'base64'\n    // See documentation and validation for safe implementation in:\n    // https://github.com/feross/safe-buffer#update\n    var SeaArray = USE('./array');\n    function SafeBuffer(...props) {\n      console.warn('new SafeBuffer() is depreciated, please use SafeBuffer.from()')\n      return SafeBuffer.from(...props)\n    }\n    SafeBuffer.prototype = Object.create(Array.prototype)\n    Object.assign(SafeBuffer, {\n      // (data, enc) where typeof data === 'string' then enc === 'utf8'|'hex'|'base64'\n      from() {\n        if (!Object.keys(arguments).length || arguments[0]==null) {\n          throw new TypeError('First argument must be a string, Buffer, ArrayBuffer, Array, or array-like object.')\n        }\n        const input = arguments[0]\n        let buf\n        if (typeof input === 'string') {\n          const enc = arguments[1] || 'utf8'\n          if (enc === 'hex') {\n            const bytes = input.match(/([\\da-fA-F]{2})/g)\n            .map((byte) => parseInt(byte, 16))\n            if (!bytes || !bytes.length) {\n              throw new TypeError('Invalid first argument for type \\'hex\\'.')\n            }\n            buf = SeaArray.from(bytes)\n          } else if (enc === 'utf8' || 'binary' === enc) { // EDIT BY MARK: I think this is safe, tested it against a couple \"binary\" strings. This lets SafeBuffer match NodeJS Buffer behavior more where it safely btoas regular strings.\n            const length = input.length\n            const words = new Uint16Array(length)\n            Array.from({ length: length }, (_, i) => words[i] = input.charCodeAt(i))\n            buf = SeaArray.from(words)\n          } else if (enc === 'base64') {\n            const dec = atob(input)\n            const length = dec.length\n            const bytes = new Uint8Array(length)\n            Array.from({ length: length }, (_, i) => bytes[i] = dec.charCodeAt(i))\n            buf = SeaArray.from(bytes)\n          } else if (enc === 'binary') { // deprecated by above comment\n            buf = SeaArray.from(input) // some btoas were mishandled.\n          } else {\n            console.info('SafeBuffer.from unknown encoding: '+enc)\n          }\n          return buf\n        }\n        const byteLength = input.byteLength // what is going on here? FOR MARTTI\n        const length = input.byteLength ? input.byteLength : input.length\n        if (length) {\n          let buf\n          if (input instanceof ArrayBuffer) {\n            buf = new Uint8Array(input)\n          }\n          return SeaArray.from(buf || input)\n        }\n      },\n      // This is 'safe-buffer.alloc' sans encoding support\n      alloc(length, fill = 0 /*, enc*/ ) {\n        return SeaArray.from(new Uint8Array(Array.from({ length: length }, () => fill)))\n      },\n      // This is normal UNSAFE 'buffer.alloc' or 'new Buffer(length)' - don't use!\n      allocUnsafe(length) {\n        return SeaArray.from(new Uint8Array(Array.from({ length : length })))\n      },\n      // This puts together array of array like members\n      concat(arr) { // octet array\n        if (!Array.isArray(arr)) {\n          throw new TypeError('First argument must be Array containing ArrayBuffer or Uint8Array instances.')\n        }\n        return SeaArray.from(arr.reduce((ret, item) => ret.concat(Array.from(item)), []))\n      }\n    })\n    SafeBuffer.prototype.from = SafeBuffer.from\n    SafeBuffer.prototype.toString = SeaArray.prototype.toString\n\n    module.exports = SafeBuffer;\n  })(USE, './buffer');\n\n  ;USE(function(module){\n    const SEA = USE('./root')\n    const api = {Buffer: USE('./buffer')}\n    var o = {}, u;\n\n    // ideally we can move away from JSON entirely? unlikely due to compatibility issues... oh well.\n    JSON.parseAsync = JSON.parseAsync || function(t,cb,r){ var u; try{ cb(u, JSON.parse(t,r)) }catch(e){ cb(e) } }\n    JSON.stringifyAsync = JSON.stringifyAsync || function(v,cb,r,s){ var u; try{ cb(u, JSON.stringify(v,r,s)) }catch(e){ cb(e) } }\n\n    api.parse = function(t,r){ return new Promise(function(res, rej){\n      JSON.parseAsync(t,function(err, raw){ err? rej(err) : res(raw) },r);\n    })}\n    api.stringify = function(v,r,s){ return new Promise(function(res, rej){\n      JSON.stringifyAsync(v,function(err, raw){ err? rej(err) : res(raw) },r,s);\n    })}\n\n    if(SEA.window){\n      api.crypto = SEA.window.crypto || SEA.window.msCrypto\n      api.subtle = (api.crypto||o).subtle || (api.crypto||o).webkitSubtle;\n      api.TextEncoder = SEA.window.TextEncoder;\n      api.TextDecoder = SEA.window.TextDecoder;\n      api.random = (len) => api.Buffer.from(api.crypto.getRandomValues(new Uint8Array(api.Buffer.alloc(len))));\n    }\n    if(!api.TextDecoder)\n    {\n      const { TextEncoder, TextDecoder } = USE((u+'' == typeof MODULE?'.':'')+'./lib/text-encoding', 1);\n      api.TextDecoder = TextDecoder;\n      api.TextEncoder = TextEncoder;\n    }\n    if(!api.crypto)\n    {\n      try\n      {\n      var crypto = USE('crypto', 1);\n      Object.assign(api, {\n        crypto,\n        random: (len) => api.Buffer.from(crypto.randomBytes(len))\n      });      \n      const { Crypto: WebCrypto } = USE('@peculiar/webcrypto', 1);\n      api.ossl = api.subtle = new WebCrypto({directory: 'ossl'}).subtle // ECDH\n    }\n    catch(e){\n      console.log(\"Please `npm install @peculiar/webcrypto` or add it to your package.json !\");\n    }}\n\n    module.exports = api\n  })(USE, './shim');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var s = {};\n    s.pbkdf2 = {hash: {name : 'SHA-256'}, iter: 100000, ks: 64};\n    s.ecdsa = {\n      pair: {name: 'ECDSA', namedCurve: 'P-256'},\n      sign: {name: 'ECDSA', hash: {name: 'SHA-256'}}\n    };\n    s.ecdh = {name: 'ECDH', namedCurve: 'P-256'};\n\n    // This creates Web Cryptography API compliant JWK for sign/verify purposes\n    s.jwk = function(pub, d){  // d === priv\n      pub = pub.split('.');\n      var x = pub[0], y = pub[1];\n      var jwk = {kty: \"EC\", crv: \"P-256\", x: x, y: y, ext: true};\n      jwk.key_ops = d ? ['sign'] : ['verify'];\n      if(d){ jwk.d = d }\n      return jwk;\n    };\n    \n    s.keyToJwk = function(keyBytes) {\n      const keyB64 = keyBytes.toString('base64');\n      const k = keyB64.replace(/\\+/g, '-').replace(/\\//g, '_').replace(/\\=/g, '');\n      return { kty: 'oct', k: k, ext: false, alg: 'A256GCM' };\n    }\n\n    s.recall = {\n      validity: 12 * 60 * 60, // internally in seconds : 12 hours\n      hook: function(props){ return props } // { iat, exp, alias, remember } // or return new Promise((resolve, reject) => resolve(props)\n    };\n\n    s.check = function(t){ return (typeof t == 'string') && ('SEA{' === t.slice(0,4)) }\n    s.parse = async function p(t){ try {\n      var yes = (typeof t == 'string');\n      if(yes && 'SEA{' === t.slice(0,4)){ t = t.slice(3) }\n      return yes ? await shim.parse(t) : t;\n      } catch (e) {}\n      return t;\n    }\n\n    SEA.opt = s;\n    module.exports = s\n  })(USE, './settings');\n\n  ;USE(function(module){\n    var shim = USE('./shim');\n    module.exports = async function(d, o){\n      var t = (typeof d == 'string')? d : await shim.stringify(d);\n      var hash = await shim.subtle.digest({name: o||'SHA-256'}, new shim.TextEncoder().encode(t));\n      return shim.Buffer.from(hash);\n    }\n  })(USE, './sha256');\n\n  ;USE(function(module){\n    // This internal func returns SHA-1 hashed data for KeyID generation\n    const __shim = USE('./shim')\n    const subtle = __shim.subtle\n    const ossl = __shim.ossl ? __shim.ossl : subtle\n    const sha1hash = (b) => ossl.digest({name: 'SHA-1'}, new ArrayBuffer(b))\n    module.exports = sha1hash\n  })(USE, './sha1');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var sha = USE('./sha256');\n    var u;\n\n    SEA.work = SEA.work || (async (data, pair, cb, opt) => { try { // used to be named `proof`\n      var salt = (pair||{}).epub || pair; // epub not recommended, salt should be random!\n      opt = opt || {};\n      if(salt instanceof Function){\n        cb = salt;\n        salt = u;\n      }\n      data = (typeof data == 'string')? data : await shim.stringify(data);\n      if('sha' === (opt.name||'').toLowerCase().slice(0,3)){\n        var rsha = shim.Buffer.from(await sha(data, opt.name), 'binary').toString(opt.encode || 'base64')\n        if(cb){ try{ cb(rsha) }catch(e){console.log(e)} }\n        return rsha;\n      }\n      salt = salt || shim.random(9);\n      var key = await (shim.ossl || shim.subtle).importKey('raw', new shim.TextEncoder().encode(data), {name: opt.name || 'PBKDF2'}, false, ['deriveBits']);\n      var work = await (shim.ossl || shim.subtle).deriveBits({\n        name: opt.name || 'PBKDF2',\n        iterations: opt.iterations || S.pbkdf2.iter,\n        salt: new shim.TextEncoder().encode(opt.salt || salt),\n        hash: opt.hash || S.pbkdf2.hash,\n      }, key, opt.length || (S.pbkdf2.ks * 8))\n      data = shim.random(data.length)  // Erase data in case of passphrase\n      var r = shim.Buffer.from(work, 'binary').toString(opt.encode || 'base64')\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) { \n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.work;\n  })(USE, './work');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n\n    SEA.name = SEA.name || (async (cb, opt) => { try {\n      if(cb){ try{ cb() }catch(e){console.log(e)} }\n      return;\n    } catch(e) {\n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    //SEA.pair = async (data, proof, cb) => { try {\n    SEA.pair = SEA.pair || (async (cb, opt) => { try {\n\n      var ecdhSubtle = shim.ossl || shim.subtle;\n      // First: ECDSA keys for signing/verifying...\n      var sa = await shim.subtle.generateKey({name: 'ECDSA', namedCurve: 'P-256'}, true, [ 'sign', 'verify' ])\n      .then(async (keys) => {\n        // privateKey scope doesn't leak out from here!\n        //const { d: priv } = await shim.subtle.exportKey('jwk', keys.privateKey)\n        var key = {};\n        key.priv = (await shim.subtle.exportKey('jwk', keys.privateKey)).d;\n        var pub = await shim.subtle.exportKey('jwk', keys.publicKey);\n        //const pub = Buff.from([ x, y ].join(':')).toString('base64') // old\n        key.pub = pub.x+'.'+pub.y; // new\n        // x and y are already base64\n        // pub is UTF8 but filename/URL safe (https://www.ietf.org/rfc/rfc3986.txt)\n        // but split on a non-base64 letter.\n        return key;\n      })\n      \n      // To include PGPv4 kind of keyId:\n      // const pubId = await SEA.keyid(keys.pub)\n      // Next: ECDH keys for encryption/decryption...\n\n      try{\n      var dh = await ecdhSubtle.generateKey({name: 'ECDH', namedCurve: 'P-256'}, true, ['deriveKey'])\n      .then(async (keys) => {\n        // privateKey scope doesn't leak out from here!\n        var key = {};\n        key.epriv = (await ecdhSubtle.exportKey('jwk', keys.privateKey)).d;\n        var pub = await ecdhSubtle.exportKey('jwk', keys.publicKey);\n        //const epub = Buff.from([ ex, ey ].join(':')).toString('base64') // old\n        key.epub = pub.x+'.'+pub.y; // new\n        // ex and ey are already base64\n        // epub is UTF8 but filename/URL safe (https://www.ietf.org/rfc/rfc3986.txt)\n        // but split on a non-base64 letter.\n        return key;\n      })\n      }catch(e){\n        if(SEA.window){ throw e }\n        if(e == 'Error: ECDH is not a supported algorithm'){ console.log('Ignoring ECDH...') }\n        else { throw e }\n      } dh = dh || {};\n\n      var r = { pub: sa.pub, priv: sa.priv, /* pubId, */ epub: dh.epub, epriv: dh.epriv }\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) {\n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.pair;\n  })(USE, './pair');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var sha = USE('./sha256');\n    var u;\n\n    SEA.sign = SEA.sign || (async (data, pair, cb, opt) => { try {\n      opt = opt || {};\n      if(!(pair||opt).priv){\n        if(!SEA.I){ throw 'No signing key.' }\n        pair = await SEA.I(null, {what: data, how: 'sign', why: opt.why});\n      }\n      if(u === data){ throw '`undefined` not allowed.' }\n      var json = await S.parse(data);\n      var check = opt.check = opt.check || json;\n      if(SEA.verify && (SEA.opt.check(check) || (check && check.s && check.m))\n      && u !== await SEA.verify(check, pair)){ // don't sign if we already signed it.\n        var r = await S.parse(check);\n        if(!opt.raw){ r = 'SEA' + await shim.stringify(r) }\n        if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n        return r;\n      }\n      var pub = pair.pub;\n      var priv = pair.priv;\n      var jwk = S.jwk(pub, priv);\n      var hash = await sha(json);\n      var sig = await (shim.ossl || shim.subtle).importKey('jwk', jwk, {name: 'ECDSA', namedCurve: 'P-256'}, false, ['sign'])\n      .then((key) => (shim.ossl || shim.subtle).sign({name: 'ECDSA', hash: {name: 'SHA-256'}}, key, new Uint8Array(hash))) // privateKey scope doesn't leak out from here!\n      var r = {m: json, s: shim.Buffer.from(sig, 'binary').toString(opt.encode || 'base64')}\n      if(!opt.raw){ r = 'SEA' + await shim.stringify(r) }\n\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) {\n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.sign;\n  })(USE, './sign');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var sha = USE('./sha256');\n    var u;\n\n    SEA.verify = SEA.verify || (async (data, pair, cb, opt) => { try {\n      var json = await S.parse(data);\n      if(false === pair){ // don't verify!\n        var raw = await S.parse(json.m);\n        if(cb){ try{ cb(raw) }catch(e){console.log(e)} }\n        return raw;\n      }\n      opt = opt || {};\n      // SEA.I // verify is free! Requires no user permission.\n      var pub = pair.pub || pair;\n      var key = SEA.opt.slow_leak? await SEA.opt.slow_leak(pub) : await (shim.ossl || shim.subtle).importKey('jwk', S.jwk(pub), {name: 'ECDSA', namedCurve: 'P-256'}, false, ['verify']);\n      var hash = await sha(json.m);\n      var buf, sig, check, tmp; try{\n        buf = shim.Buffer.from(json.s, opt.encode || 'base64'); // NEW DEFAULT!\n        sig = new Uint8Array(buf);\n        check = await (shim.ossl || shim.subtle).verify({name: 'ECDSA', hash: {name: 'SHA-256'}}, key, sig, new Uint8Array(hash));\n        if(!check){ throw \"Signature did not match.\" }\n      }catch(e){\n        if(SEA.opt.fallback){\n          return await SEA.opt.fall_verify(data, pair, cb, opt);\n        }\n      }\n      var r = check? await S.parse(json.m) : u;\n\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) {\n      console.log(e); // mismatched owner FOR MARTTI\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.verify;\n    // legacy & ossl memory leak mitigation:\n\n    var knownKeys = {};\n    var keyForPair = SEA.opt.slow_leak = pair => {\n      if (knownKeys[pair]) return knownKeys[pair];\n      var jwk = S.jwk(pair);\n      knownKeys[pair] = (shim.ossl || shim.subtle).importKey(\"jwk\", jwk, {name: 'ECDSA', namedCurve: 'P-256'}, false, [\"verify\"]);\n      return knownKeys[pair];\n    };\n\n    var O = SEA.opt;\n    SEA.opt.fall_verify = async function(data, pair, cb, opt, f){\n      if(f === SEA.opt.fallback){ throw \"Signature did not match\" } f = f || 1;\n      var tmp = data||'';\n      data = SEA.opt.unpack(data) || data;\n      var json = await S.parse(data), pub = pair.pub || pair, key = await SEA.opt.slow_leak(pub);\n      var hash = (f <= SEA.opt.fallback)? shim.Buffer.from(await shim.subtle.digest({name: 'SHA-256'}, new shim.TextEncoder().encode(await S.parse(json.m)))) : await sha(json.m); // this line is old bad buggy code but necessary for old compatibility.\n      var buf; var sig; var check; try{\n        buf = shim.Buffer.from(json.s, opt.encode || 'base64') // NEW DEFAULT!\n        sig = new Uint8Array(buf)\n        check = await (shim.ossl || shim.subtle).verify({name: 'ECDSA', hash: {name: 'SHA-256'}}, key, sig, new Uint8Array(hash))\n        if(!check){ throw \"Signature did not match.\" }\n      }catch(e){ try{\n        buf = shim.Buffer.from(json.s, 'utf8') // AUTO BACKWARD OLD UTF8 DATA!\n        sig = new Uint8Array(buf)\n        check = await (shim.ossl || shim.subtle).verify({name: 'ECDSA', hash: {name: 'SHA-256'}}, key, sig, new Uint8Array(hash))\n        }catch(e){\n        if(!check){ throw \"Signature did not match.\" }\n        }\n      }\n      var r = check? await S.parse(json.m) : u;\n      O.fall_soul = tmp['#']; O.fall_key = tmp['.']; O.fall_val = data; O.fall_state = tmp['>'];\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    }\n    SEA.opt.fallback = 2;\n\n  })(USE, './verify');\n\n  ;USE(function(module){\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var sha256hash = USE('./sha256');\n\n    const importGen = async (key, salt, opt) => {\n      //const combo = shim.Buffer.concat([shim.Buffer.from(key, 'utf8'), salt || shim.random(8)]).toString('utf8') // old\n      opt = opt || {};\n      const combo = key + (salt || shim.random(8)).toString('utf8'); // new\n      const hash = shim.Buffer.from(await sha256hash(combo), 'binary')\n      \n      const jwkKey = S.keyToJwk(hash)      \n      return await shim.subtle.importKey('jwk', jwkKey, {name:'AES-GCM'}, false, ['encrypt', 'decrypt'])\n    }\n    module.exports = importGen;\n  })(USE, './aeskey');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var aeskey = USE('./aeskey');\n    var u;\n\n    SEA.encrypt = SEA.encrypt || (async (data, pair, cb, opt) => { try {\n      opt = opt || {};\n      var key = (pair||opt).epriv || pair;\n      if(u === data){ throw '`undefined` not allowed.' }\n      if(!key){\n        if(!SEA.I){ throw 'No encryption key.' }\n        pair = await SEA.I(null, {what: data, how: 'encrypt', why: opt.why});\n        key = pair.epriv || pair;\n      }\n      var msg = (typeof data == 'string')? data : await shim.stringify(data);\n      var rand = {s: shim.random(9), iv: shim.random(15)}; // consider making this 9 and 15 or 18 or 12 to reduce == padding.\n      var ct = await aeskey(key, rand.s, opt).then((aes) => (/*shim.ossl ||*/ shim.subtle).encrypt({ // Keeping the AES key scope as private as possible...\n        name: opt.name || 'AES-GCM', iv: new Uint8Array(rand.iv)\n      }, aes, new shim.TextEncoder().encode(msg)));\n      var r = {\n        ct: shim.Buffer.from(ct, 'binary').toString(opt.encode || 'base64'),\n        iv: rand.iv.toString(opt.encode || 'base64'),\n        s: rand.s.toString(opt.encode || 'base64')\n      }\n      if(!opt.raw){ r = 'SEA' + await shim.stringify(r) }\n\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) { \n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.encrypt;\n  })(USE, './encrypt');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    var aeskey = USE('./aeskey');\n\n    SEA.decrypt = SEA.decrypt || (async (data, pair, cb, opt) => { try {\n      opt = opt || {};\n      var key = (pair||opt).epriv || pair;\n      if(!key){\n        if(!SEA.I){ throw 'No decryption key.' }\n        pair = await SEA.I(null, {what: data, how: 'decrypt', why: opt.why});\n        key = pair.epriv || pair;\n      }\n      var json = await S.parse(data);\n      var buf, bufiv, bufct; try{\n        buf = shim.Buffer.from(json.s, opt.encode || 'base64');\n        bufiv = shim.Buffer.from(json.iv, opt.encode || 'base64');\n        bufct = shim.Buffer.from(json.ct, opt.encode || 'base64');\n        var ct = await aeskey(key, buf, opt).then((aes) => (/*shim.ossl ||*/ shim.subtle).decrypt({  // Keeping aesKey scope as private as possible...\n          name: opt.name || 'AES-GCM', iv: new Uint8Array(bufiv), tagLength: 128\n        }, aes, new Uint8Array(bufct)));\n      }catch(e){\n        if('utf8' === opt.encode){ throw \"Could not decrypt\" }\n        if(SEA.opt.fallback){\n          opt.encode = 'utf8';\n          return await SEA.decrypt(data, pair, cb, opt);\n        }\n      }\n      var r = await S.parse(new shim.TextDecoder('utf8').decode(ct));\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) { \n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.decrypt;\n  })(USE, './decrypt');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    var shim = USE('./shim');\n    var S = USE('./settings');\n    // Derive shared secret from other's pub and my epub/epriv \n    SEA.secret = SEA.secret || (async (key, pair, cb, opt) => { try {\n      opt = opt || {};\n      if(!pair || !pair.epriv || !pair.epub){\n        if(!SEA.I){ throw 'No secret mix.' }\n        pair = await SEA.I(null, {what: key, how: 'secret', why: opt.why});\n      }\n      var pub = key.epub || key;\n      var epub = pair.epub;\n      var epriv = pair.epriv;\n      var ecdhSubtle = shim.ossl || shim.subtle;\n      var pubKeyData = keysToEcdhJwk(pub);\n      var props = Object.assign({ public: await ecdhSubtle.importKey(...pubKeyData, true, []) },{name: 'ECDH', namedCurve: 'P-256'}); // Thanks to @sirpy !\n      var privKeyData = keysToEcdhJwk(epub, epriv);\n      var derived = await ecdhSubtle.importKey(...privKeyData, false, ['deriveBits']).then(async (privKey) => {\n        // privateKey scope doesn't leak out from here!\n        var derivedBits = await ecdhSubtle.deriveBits(props, privKey, 256);\n        var rawBits = new Uint8Array(derivedBits);\n        var derivedKey = await ecdhSubtle.importKey('raw', rawBits,{ name: 'AES-GCM', length: 256 }, true, [ 'encrypt', 'decrypt' ]);\n        return ecdhSubtle.exportKey('jwk', derivedKey).then(({ k }) => k);\n      })\n      var r = derived;\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) {\n      console.log(e);\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    // can this be replaced with settings.jwk?\n    var keysToEcdhJwk = (pub, d) => { // d === priv\n      //var [ x, y ] = shim.Buffer.from(pub, 'base64').toString('utf8').split(':') // old\n      var [ x, y ] = pub.split('.') // new\n      var jwk = d ? { d: d } : {}\n      return [  // Use with spread returned value...\n        'jwk',\n        Object.assign(\n          jwk,\n          { x: x, y: y, kty: 'EC', crv: 'P-256', ext: true }\n        ), // ??? refactor\n        {name: 'ECDH', namedCurve: 'P-256'}\n      ]\n    }\n\n    module.exports = SEA.secret;\n  })(USE, './secret');\n\n  ;USE(function(module){\n    var SEA = USE('./root');\n    // This is to certify that a group of \"certificants\" can \"put\" anything at a group of matched \"paths\" to the certificate authority's graph\n    SEA.certify = SEA.certify || (async (certificants, policy = {}, authority, cb, opt = {}) => { try {\n      /*\n      The Certify Protocol was made out of love by a Vietnamese code enthusiast. Vietnamese people around the world deserve respect!\n      IMPORTANT: A Certificate is like a Signature. No one knows who (authority) created/signed a cert until you put it into their graph.\n      \"certificants\": '*' or a String (Bob.pub) || an Object that contains \"pub\" as a key || an array of [object || string]. These people will have the rights.\n      \"policy\": A string ('inbox'), or a RAD/LEX object {'*': 'inbox'}, or an Array of RAD/LEX objects or strings. RAD/LEX object can contain key \"?\" with indexOf(\"*\") > -1 to force key equals certificant pub. This rule is used to check against soul+'/'+key using Gun.text.match or String.match.\n      \"authority\": Key pair or priv of the certificate authority.\n      \"cb\": A callback function after all things are done.\n      \"opt\": If opt.expiry (a timestamp) is set, SEA won't sync data after opt.expiry. If opt.block is set, SEA will look for block before syncing.\n      */\n      console.log('SEA.certify() is an early experimental community supported method that may change API behavior without warning in any future version.')\n\n      certificants = (() => {\n        var data = []\n        if (certificants) {\n          if ((typeof certificants === 'string' || Array.isArray(certificants)) && certificants.indexOf('*') > -1) return '*'\n          if (typeof certificants === 'string') return certificants\n          if (Array.isArray(certificants)) {\n            if (certificants.length === 1 && certificants[0]) return typeof certificants[0] === 'object' && certificants[0].pub ? certificants[0].pub : typeof certificants[0] === 'string' ? certificants[0] : null\n            certificants.map(certificant => {\n              if (typeof certificant ==='string') data.push(certificant)\n              else if (typeof certificant === 'object' && certificant.pub) data.push(certificant.pub)\n            })\n          }\n\n          if (typeof certificants === 'object' && certificants.pub) return certificants.pub\n          return data.length > 0 ? data : null\n        }\n        return\n      })()\n\n      if (!certificants) return console.log(\"No certificant found.\")\n\n      const expiry = opt.expiry && (typeof opt.expiry === 'number' || typeof opt.expiry === 'string') ? parseFloat(opt.expiry) : null\n      const readPolicy = (policy || {}).read ? policy.read : null\n      const writePolicy = (policy || {}).write ? policy.write : typeof policy === 'string' || Array.isArray(policy) || policy[\"+\"] || policy[\"#\"] || policy[\".\"] || policy[\"=\"] || policy[\"*\"] || policy[\">\"] || policy[\"<\"] ? policy : null\n      // The \"blacklist\" feature is now renamed to \"block\". Why ? BECAUSE BLACK LIVES MATTER!\n      // We can now use 3 keys: block, blacklist, ban\n      const block = (opt || {}).block || (opt || {}).blacklist || (opt || {}).ban || {}\n      const readBlock = block.read && (typeof block.read === 'string' || (block.read || {})['#']) ? block.read : null\n      const writeBlock = typeof block === 'string' ? block : block.write && (typeof block.write === 'string' || block.write['#']) ? block.write : null\n\n      if (!readPolicy && !writePolicy) return console.log(\"No policy found.\")\n\n      // reserved keys: c, e, r, w, rb, wb\n      const data = JSON.stringify({\n        c: certificants,\n        ...(expiry ? {e: expiry} : {}), // inject expiry if possible\n        ...(readPolicy ? {r: readPolicy }  : {}), // \"r\" stands for read, which means read permission.\n        ...(writePolicy ? {w: writePolicy} : {}), // \"w\" stands for write, which means write permission.\n        ...(readBlock ? {rb: readBlock} : {}), // inject READ block if possible\n        ...(writeBlock ? {wb: writeBlock} : {}), // inject WRITE block if possible\n      })\n\n      const certificate = await SEA.sign(data, authority, null, {raw:1})\n\n      var r = certificate\n      if(!opt.raw){ r = 'SEA'+JSON.stringify(r) }\n      if(cb){ try{ cb(r) }catch(e){console.log(e)} }\n      return r;\n    } catch(e) {\n      SEA.err = e;\n      if(SEA.throw){ throw e }\n      if(cb){ cb() }\n      return;\n    }});\n\n    module.exports = SEA.certify;\n  })(USE, './certify');\n\n  ;USE(function(module){\n    var shim = USE('./shim');\n    // Practical examples about usage found in tests.\n    var SEA = USE('./root');\n    SEA.work = USE('./work');\n    SEA.sign = USE('./sign');\n    SEA.verify = USE('./verify');\n    SEA.encrypt = USE('./encrypt');\n    SEA.decrypt = USE('./decrypt');\n    SEA.certify = USE('./certify');\n    //SEA.opt.aeskey = USE('./aeskey'); // not official! // this causes problems in latest WebCrypto.\n\n    SEA.random = SEA.random || shim.random;\n\n    // This is Buffer used in SEA and usable from Gun/SEA application also.\n    // For documentation see https://nodejs.org/api/buffer.html\n    SEA.Buffer = SEA.Buffer || USE('./buffer');\n\n    // These SEA functions support now ony Promises or\n    // async/await (compatible) code, use those like Promises.\n    //\n    // Creates a wrapper library around Web Crypto API\n    // for various AES, ECDSA, PBKDF2 functions we called above.\n    // Calculate public key KeyID aka PGPv4 (result: 8 bytes as hex string)\n    SEA.keyid = SEA.keyid || (async (pub) => {\n      try {\n        // base64('base64(x):base64(y)') => shim.Buffer(xy)\n        const pb = shim.Buffer.concat(\n          pub.replace(/-/g, '+').replace(/_/g, '/').split('.')\n          .map((t) => shim.Buffer.from(t, 'base64'))\n        )\n        // id is PGPv4 compliant raw key\n        const id = shim.Buffer.concat([\n          shim.Buffer.from([0x99, pb.length / 0x100, pb.length % 0x100]), pb\n        ])\n        const sha1 = await sha1hash(id)\n        const hash = shim.Buffer.from(sha1, 'binary')\n        return hash.toString('hex', hash.length - 8)  // 16-bit ID as hex\n      } catch (e) {\n        console.log(e)\n        throw e\n      }\n    });\n    // all done!\n    // Obviously it is missing MANY necessary features. This is only an alpha release.\n    // Please experiment with it, audit what I've done so far, and complain about what needs to be added.\n    // SEA should be a full suite that is easy and seamless to use.\n    // Again, scroll naer the top, where I provide an EXAMPLE of how to create a user and sign in.\n    // Once logged in, the rest of the code you just read handled automatically signing/validating data.\n    // But all other behavior needs to be equally easy, like opinionated ways of\n    // Adding friends (trusted public keys), sending private messages, etc.\n    // Cheers! Tell me what you think.\n    ((SEA.window||{}).GUN||{}).SEA = SEA;\n\n    module.exports = SEA\n    // -------------- END SEA MODULES --------------------\n    // -- BEGIN SEA+GUN MODULES: BUNDLED BY DEFAULT UNTIL OTHERS USE SEA ON OWN -------\n  })(USE, './sea');\n\n  ;USE(function(module){\n    var SEA = USE('./sea'), Gun, u;\n    if(SEA.window){\n      Gun = SEA.window.GUN || {chain:{}};\n    } else {\n      Gun = USE((u+'' == typeof MODULE?'.':'')+'./gun', 1);\n    }\n    SEA.GUN = Gun;\n\n    function User(root){ \n      this._ = {$: this};\n    }\n    User.prototype = (function(){ function F(){}; F.prototype = Gun.chain; return new F() }()) // Object.create polyfill\n    User.prototype.constructor = User;\n\n    // let's extend the gun chain with a `user` function.\n    // only one user can be logged in at a time, per gun instance.\n    Gun.chain.user = function(pub){\n      var gun = this, root = gun.back(-1), user;\n      if(pub){\n        pub = SEA.opt.pub((pub._||'')['#']) || pub;\n        return root.get('~'+pub);\n      }\n      if(user = root.back('user')){ return user }\n      var root = (root._), at = root, uuid = at.opt.uuid || lex;\n      (at = (user = at.user = gun.chain(new User))._).opt = {};\n      at.opt.uuid = function(cb){\n        var id = uuid(), pub = root.user;\n        if(!pub || !(pub = pub.is) || !(pub = pub.pub)){ return id }\n        id = '~' + pub + '/' + id;\n        if(cb && cb.call){ cb(null, id) }\n        return id;\n      }\n      return user;\n    }\n    function lex(){ return Gun.state().toString(36).replace('.','') }\n    Gun.User = User;\n    User.GUN = Gun;\n    User.SEA = Gun.SEA = SEA;\n    module.exports = User;\n  })(USE, './user');\n\n  ;USE(function(module){\n    var u, Gun = (''+u != typeof GUN)? (GUN||{chain:{}}) : USE((''+u === typeof MODULE?'.':'')+'./gun', 1);\n    Gun.chain.then = function(cb, opt){\n      var gun = this, p = (new Promise(function(res, rej){\n        gun.once(res, opt);\n      }));\n      return cb? p.then(cb) : p;\n    }\n  })(USE, './then');\n\n  ;USE(function(module){\n    var User = USE('./user'), SEA = User.SEA, Gun = User.GUN, noop = function(){};\n\n    // Well first we have to actually create a user. That is what this function does.\n    User.prototype.create = function(...args){\n      var pair = typeof args[0] === 'object' && (args[0].pub || args[0].epub) ? args[0] : typeof args[1] === 'object' && (args[1].pub || args[1].epub) ? args[1] : null;\n      var alias = pair && (pair.pub || pair.epub) ? pair.pub : typeof args[0] === 'string' ? args[0] : null;\n      var pass = pair && (pair.pub || pair.epub) ? pair : alias && typeof args[1] === 'string' ? args[1] : null;\n      var cb = args.filter(arg => typeof arg === 'function')[0] || null; // cb now can stand anywhere, after alias/pass or pair\n      var opt = args && args.length > 1 && typeof args[args.length-1] === 'object' ? args[args.length-1] : {}; // opt is always the last parameter which typeof === 'object' and stands after cb\n      \n      var gun = this, cat = (gun._), root = gun.back(-1);\n      cb = cb || noop;\n      opt = opt || {};\n      if(false !== opt.check){\n        var err;\n        if(!alias){ err = \"No user.\" }\n        if((pass||'').length < 8){ err = \"Password too short!\" }\n        if(err){\n          cb({err: Gun.log(err)});\n          return gun;\n        }\n      }\n      if(cat.ing){\n        (cb || noop)({err: Gun.log(\"User is already being created or authenticated!\"), wait: true});\n        return gun;\n      }\n      cat.ing = true;\n      var act = {}, u;\n      act.a = function(pubs){\n        act.pubs = pubs;\n        if(pubs && !opt.already){\n          // If we can enforce that a user name is already taken, it might be nice to try, but this is not guaranteed.\n          var ack = {err: Gun.log('User already created!')};\n          cat.ing = false;\n          (cb || noop)(ack);\n          gun.leave();\n          return;\n        }\n        act.salt = String.random(64); // pseudo-randomly create a salt, then use PBKDF2 function to extend the password with it.\n        SEA.work(pass, act.salt, act.b); // this will take some short amount of time to produce a proof, which slows brute force attacks.\n      }\n      act.b = function(proof){\n        act.proof = proof;\n        pair ? act.c(pair) : SEA.pair(act.c) // generate a brand new key pair or use the existing.\n      }\n      act.c = function(pair){\n        var tmp\n        act.pair = pair || {};\n        if(tmp = cat.root.user){\n          tmp._.sea = pair;\n          tmp.is = {pub: pair.pub, epub: pair.epub, alias: alias};\n        }\n        // the user's public key doesn't need to be signed. But everything else needs to be signed with it! // we have now automated it! clean up these extra steps now!\n        act.data = {pub: pair.pub};\n        act.d();\n      }\n      act.d = function(){\n        act.data.alias = alias;\n        act.e();\n      }\n      act.e = function(){\n        act.data.epub = act.pair.epub; \n        SEA.encrypt({priv: act.pair.priv, epriv: act.pair.epriv}, act.proof, act.f, {raw:1}); // to keep the private key safe, we AES encrypt it with the proof of work!\n      }\n      act.f = function(auth){\n        act.data.auth = JSON.stringify({ek: auth, s: act.salt}); \n        act.g(act.data.auth);\n      }\n      act.g = function(auth){ var tmp;\n        act.data.auth = act.data.auth || auth;\n        root.get(tmp = '~'+act.pair.pub).put(act.data).on(act.h); // awesome, now we can actually save the user with their public key as their ID.\n        var link = {}; link[tmp] = {'#': tmp}; root.get('~@'+alias).put(link).get(tmp).on(act.i); // next up, we want to associate the alias with the public key. So we add it to the alias list.\n      }\n      act.h = function(data, key, msg, eve){\n        eve.off(); act.h.ok = 1; act.i();\n      }\n      act.i = function(data, key, msg, eve){\n        if(eve){ act.i.ok = 1; eve.off() }\n        if(!act.h.ok || !act.i.ok){ return }\n        cat.ing = false;\n        cb({ok: 0, pub: act.pair.pub}); // callback that the user has been created. (Note: ok = 0 because we didn't wait for disk to ack)\n        if(noop === cb){ pair ? gun.auth(pair) : gun.auth(alias, pass) } // if no callback is passed, auto-login after signing up.\n      }\n      root.get('~@'+alias).once(act.a);\n      return gun;\n    }\n    User.prototype.leave = function(opt, cb){\n      var gun = this, user = (gun.back(-1)._).user;\n      if(user){\n        delete user.is;\n        delete user._.is;\n        delete user._.sea;\n      }\n      if(SEA.window){\n        try{var sS = {};\n        sS = SEA.window.sessionStorage;\n        delete sS.recall;\n        delete sS.pair;\n        }catch(e){};\n      }\n      return gun;\n    }\n  })(USE, './create');\n\n  ;USE(function(module){\n    var User = USE('./user'), SEA = User.SEA, Gun = User.GUN, noop = function(){};\n    // now that we have created a user, we want to authenticate them!\n    User.prototype.auth = function(...args){ // TODO: this PR with arguments need to be cleaned up / refactored.\n      var pair = typeof args[0] === 'object' && (args[0].pub || args[0].epub) ? args[0] : typeof args[1] === 'object' && (args[1].pub || args[1].epub) ? args[1] : null;\n      var alias = !pair && typeof args[0] === 'string' ? args[0] : null;\n      var pass = (alias || (pair && !(pair.priv && pair.epriv))) && typeof args[1] === 'string' ? args[1] : null;\n      var cb = args.filter(arg => typeof arg === 'function')[0] || null; // cb now can stand anywhere, after alias/pass or pair\n      var opt = args && args.length > 1 && typeof args[args.length-1] === 'object' ? args[args.length-1] : {}; // opt is always the last parameter which typeof === 'object' and stands after cb\n      \n      var gun = this, cat = (gun._), root = gun.back(-1);\n      \n      if(cat.ing){\n        (cb || noop)({err: Gun.log(\"User is already being created or authenticated!\"), wait: true});\n        return gun;\n      }\n      cat.ing = true;\n      \n      var act = {}, u, tries = 9;\n      act.a = function(data){\n        if(!data){ return act.b() }\n        if(!data.pub){\n          var tmp = []; Object.keys(data).forEach(function(k){ if('_'==k){ return } tmp.push(data[k]) })\n          return act.b(tmp);\n        }\n        if(act.name){ return act.f(data) }\n        act.c((act.data = data).auth);\n      }\n      act.b = function(list){\n        var get = (act.list = (act.list||[]).concat(list||[])).shift();\n        if(u === get){\n          if(act.name){ return act.err('Your user account is not published for dApps to access, please consider syncing it online, or allowing local access by adding your device as a peer.') }\n          if(alias && tries--){\n            root.get('~@'+alias).once(act.a);\n            return;\n          }\n          return act.err('Wrong user or password.') \n        }\n        root.get(get).once(act.a);\n      }\n      act.c = function(auth){\n        if(u === auth){ return act.b() }\n        if('string' == typeof auth){ return act.c(obj_ify(auth)) } // in case of legacy\n        SEA.work(pass, (act.auth = auth).s, act.d, act.enc); // the proof of work is evidence that we've spent some time/effort trying to log in, this slows brute force.\n      }\n      act.d = function(proof){\n        SEA.decrypt(act.auth.ek, proof, act.e, act.enc);\n      }\n      act.e = function(half){\n        if(u === half){\n          if(!act.enc){ // try old format\n            act.enc = {encode: 'utf8'};\n            return act.c(act.auth);\n          } act.enc = null; // end backwards\n          return act.b();\n        }\n        act.half = half;\n        act.f(act.data);\n      }\n      act.f = function(pair){\n        var half = act.half || {}, data = act.data || {};\n        act.g(act.lol = {pub: pair.pub || data.pub, epub: pair.epub || data.epub, priv: pair.priv || half.priv, epriv: pair.epriv || half.epriv});\n      }\n      act.g = function(pair){\n        if(!pair || !pair.pub || !pair.epub){ return act.b() }\n        act.pair = pair;\n        var user = (root._).user, at = (user._);\n        var tmp = at.tag;\n        var upt = at.opt;\n        at = user._ = root.get('~'+pair.pub)._;\n        at.opt = upt;\n        // add our credentials in-memory only to our root user instance\n        user.is = {pub: pair.pub, epub: pair.epub, alias: alias || pair.pub};\n        at.sea = act.pair;\n        cat.ing = false;\n        try{if(pass && u == (obj_ify(cat.root.graph['~'+pair.pub].auth)||'')[':']){ opt.shuffle = opt.change = pass; } }catch(e){} // migrate UTF8 & Shuffle!\n        opt.change? act.z() : (cb || noop)(at);\n        if(SEA.window && ((gun.back('user')._).opt||opt).remember){\n          // TODO: this needs to be modular.\n          try{var sS = {};\n          sS = SEA.window.sessionStorage; // TODO: FIX BUG putting on `.is`!\n          sS.recall = true;\n          sS.pair = JSON.stringify(pair); // auth using pair is more reliable than alias/pass\n          }catch(e){}\n        }\n        try{\n          if(root._.tag.auth){ // auth handle might not be registered yet\n          (root._).on('auth', at) // TODO: Deprecate this, emit on user instead! Update docs when you do.\n          } else { setTimeout(function(){ (root._).on('auth', at) },1) } // if not, hackily add a timeout.\n          //at.on('auth', at) // Arrgh, this doesn't work without event \"merge\" code, but \"merge\" code causes stack overflow and crashes after logging in & trying to write data.\n        }catch(e){\n          Gun.log(\"Your 'auth' callback crashed with:\", e);\n        }\n      }\n      act.h = function(data){\n        if(!data){ return act.b() }\n        alias = data.alias\n        if(!alias)\n          alias = data.alias = \"~\" + pair.pub        \n        if(!data.auth){\n          return act.g(pair);\n        }\n        pair = null;\n        act.c((act.data = data).auth);\n      }\n      act.z = function(){\n        // password update so encrypt private key using new pwd + salt\n        act.salt = String.random(64); // pseudo-random\n        SEA.work(opt.change, act.salt, act.y);\n      }\n      act.y = function(proof){\n        SEA.encrypt({priv: act.pair.priv, epriv: act.pair.epriv}, proof, act.x, {raw:1});\n      }\n      act.x = function(auth){\n        act.w(JSON.stringify({ek: auth, s: act.salt}));\n      }\n      act.w = function(auth){\n        if(opt.shuffle){ // delete in future!\n          console.log('migrate core account from UTF8 & shuffle');\n          var tmp = {}; Object.keys(act.data).forEach(function(k){ tmp[k] = act.data[k] });\n          delete tmp._;\n          tmp.auth = auth;\n          root.get('~'+act.pair.pub).put(tmp);\n        } // end delete\n        root.get('~'+act.pair.pub).get('auth').put(auth, cb || noop);\n      }\n      act.err = function(e){\n        var ack = {err: Gun.log(e || 'User cannot be found!')};\n        cat.ing = false;\n        (cb || noop)(ack);\n      }\n      act.plugin = function(name){\n        if(!(act.name = name)){ return act.err() }\n        var tmp = [name];\n        if('~' !== name[0]){\n          tmp[1] = '~'+name;\n          tmp[2] = '~@'+name;\n        }\n        act.b(tmp);\n      }\n      if(pair){\n        if(pair.priv && pair.epriv)\n          act.g(pair);\n        else\n          root.get('~'+pair.pub).once(act.h);\n      } else\n      if(alias){\n        root.get('~@'+alias).once(act.a);\n      } else\n      if(!alias && !pass){\n        SEA.name(act.plugin);\n      }\n      return gun;\n    }\n    function obj_ify(o){\n      if('string' != typeof o){ return o }\n      try{o = JSON.parse(o);\n      }catch(e){o={}};\n      return o;\n    }\n  })(USE, './auth');\n\n  ;USE(function(module){\n    var User = USE('./user'), SEA = User.SEA, Gun = User.GUN;\n    User.prototype.recall = function(opt, cb){\n      var gun = this, root = gun.back(-1), tmp;\n      opt = opt || {};\n      if(opt && opt.sessionStorage){\n        if(SEA.window){\n          try{\n            var sS = {};\n            sS = SEA.window.sessionStorage; // TODO: FIX BUG putting on `.is`!\n            if(sS){\n              (root._).opt.remember = true;\n              ((gun.back('user')._).opt||opt).remember = true;\n              if(sS.recall || sS.pair) root.user().auth(JSON.parse(sS.pair), cb); // pair is more reliable than alias/pass\n            }\n          }catch(e){}\n        }\n        return gun;\n      }\n      /*\n        TODO: copy mhelander's expiry code back in.\n        Although, we should check with community,\n        should expiry be core or a plugin?\n      */\n      return gun;\n    }\n  })(USE, './recall');\n\n  ;USE(function(module){\n    var User = USE('./user'), SEA = User.SEA, Gun = User.GUN, noop = function(){};\n    User.prototype.pair = function(){\n      var user = this, proxy; // undeprecated, hiding with proxies.\n      try{ proxy = new Proxy({DANGER:'\\u2620'}, {get: function(t,p,r){\n        if(!user.is || !(user._||'').sea){ return }\n        return user._.sea[p];\n      }})}catch(e){}\n      return proxy;\n    }\n    // If authenticated user wants to delete his/her account, let's support it!\n    User.prototype.delete = async function(alias, pass, cb){\n      console.log(\"user.delete() IS DEPRECATED AND WILL BE MOVED TO A MODULE!!!\");\n      var gun = this, root = gun.back(-1), user = gun.back('user');\n      try {\n        user.auth(alias, pass, function(ack){\n          var pub = (user.is||{}).pub;\n          // Delete user data\n          user.map().once(function(){ this.put(null) });\n          // Wipe user data from memory\n          user.leave();\n          (cb || noop)({ok: 0});\n        });\n      } catch (e) {\n        Gun.log('User.delete failed! Error:', e);\n      }\n      return gun;\n    }\n    User.prototype.alive = async function(){\n      console.log(\"user.alive() IS DEPRECATED!!!\");\n      const gunRoot = this.back(-1)\n      try {\n        // All is good. Should we do something more with actual recalled data?\n        await authRecall(gunRoot)\n        return gunRoot._.user._\n      } catch (e) {\n        const err = 'No session!'\n        Gun.log(err)\n        throw { err }\n      }\n    }\n    User.prototype.trust = async function(user){\n      console.log(\"`.trust` API MAY BE DELETED OR CHANGED OR RENAMED, DO NOT USE!\");\n      // TODO: BUG!!! SEA `node` read listener needs to be async, which means core needs to be async too.\n      //gun.get('alice').get('age').trust(bob);\n      if (Gun.is(user)) {\n        user.get('pub').get((ctx, ev) => {\n          console.log(ctx, ev)\n        })\n      }\n      user.get('trust').get(path).put(theirPubkey);\n\n      // do a lookup on this gun chain directly (that gets bob's copy of the data)\n      // do a lookup on the metadata trust table for this path (that gets all the pubkeys allowed to write on this path)\n      // do a lookup on each of those pubKeys ON the path (to get the collab data \"layers\")\n      // THEN you perform Jachen's mix operation\n      // and return the result of that to...\n    }\n    User.prototype.grant = function(to, cb){\n      console.log(\"`.grant` API MAY BE DELETED OR CHANGED OR RENAMED, DO NOT USE!\");\n      var gun = this, user = gun.back(-1).user(), pair = user._.sea, path = '';\n      gun.back(function(at){ if(at.is){ return } path += (at.get||'') });\n      (async function(){\n      var enc, sec = await user.get('grant').get(pair.pub).get(path).then();\n      sec = await SEA.decrypt(sec, pair);\n      if(!sec){\n        sec = SEA.random(16).toString();\n        enc = await SEA.encrypt(sec, pair);\n        user.get('grant').get(pair.pub).get(path).put(enc);\n      }\n      var pub = to.get('pub').then();\n      var epub = to.get('epub').then();\n      pub = await pub; epub = await epub;\n      var dh = await SEA.secret(epub, pair);\n      enc = await SEA.encrypt(sec, dh);\n      user.get('grant').get(pub).get(path).put(enc, cb);\n      }());\n      return gun;\n    }\n    User.prototype.secret = function(data, cb){\n      console.log(\"`.secret` API MAY BE DELETED OR CHANGED OR RENAMED, DO NOT USE!\");\n      var gun = this, user = gun.back(-1).user(), pair = user.pair(), path = '';\n      gun.back(function(at){ if(at.is){ return } path += (at.get||'') });\n      (async function(){\n      var enc, sec = await user.get('trust').get(pair.pub).get(path).then();\n      sec = await SEA.decrypt(sec, pair);\n      if(!sec){\n        sec = SEA.random(16).toString();\n        enc = await SEA.encrypt(sec, pair);\n        user.get('trust').get(pair.pub).get(path).put(enc);\n      }\n      enc = await SEA.encrypt(data, sec);\n      gun.put(enc, cb);\n      }());\n      return gun;\n    }\n\n    /**\n     * returns the decrypted value, encrypted by secret\n     * @returns {Promise<any>}\n     // Mark needs to review 1st before officially supported\n    User.prototype.decrypt = function(cb) {\n      let gun = this,\n        path = ''\n      gun.back(function(at) {\n        if (at.is) {\n          return\n        }\n        path += at.get || ''\n      })\n      return gun\n        .then(async data => {\n          if (data == null) {\n            return\n          }\n          const user = gun.back(-1).user()\n          const pair = user.pair()\n          let sec = await user\n            .get('trust')\n            .get(pair.pub)\n            .get(path)\n          sec = await SEA.decrypt(sec, pair)\n          if (!sec) {\n            return data\n          }\n          let decrypted = await SEA.decrypt(data, sec)\n          return decrypted\n        })\n        .then(res => {\n          cb && cb(res)\n          return res\n        })\n    }\n    */\n    module.exports = User\n  })(USE, './share');\n\n  ;USE(function(module){\n    var SEA = USE('./sea'), S = USE('./settings'), noop = function() {}, u;\n    var Gun = (SEA.window||'').GUN || USE((''+u === typeof MODULE?'.':'')+'./gun', 1);\n    // After we have a GUN extension to make user registration/login easy, we then need to handle everything else.\n\n    // We do this with a GUN adapter, we first listen to when a gun instance is created (and when its options change)\n    Gun.on('opt', function(at){\n      if(!at.sea){ // only add SEA once per instance, on the \"at\" context.\n        at.sea = {own: {}};\n        at.on('put', check, at); // SEA now runs its firewall on HAM diffs, not all i/o.\n      }\n      this.to.next(at); // make sure to call the \"next\" middleware adapter.\n    });\n\n    // Alright, this next adapter gets run at the per node level in the graph database.\n    // correction: 2020 it gets run on each key/value pair in a node upon a HAM diff.\n    // This will let us verify that every property on a node has a value signed by a public key we trust.\n    // If the signature does not match, the data is just `undefined` so it doesn't get passed on.\n    // If it does match, then we transform the in-memory \"view\" of the data into its plain value (without the signature).\n    // Now NOTE! Some data is \"system\" data, not user data. Example: List of public keys, aliases, etc.\n    // This data is self-enforced (the value can only match its ID), but that is handled in the `security` function.\n    // From the self-enforced data, we can see all the edges in the graph that belong to a public key.\n    // Example: ~ASDF is the ID of a node with ASDF as its public key, signed alias and salt, and\n    // its encrypted private key, but it might also have other signed values on it like `profile = <ID>` edge.\n    // Using that directed edge's ID, we can then track (in memory) which IDs belong to which keys.\n    // Here is a problem: Multiple public keys can \"claim\" any node's ID, so this is dangerous!\n    // This means we should ONLY trust our \"friends\" (our key ring) public keys, not any ones.\n    // I have not yet added that to SEA yet in this alpha release. That is coming soon, but beware in the meanwhile!\n\n    function check(msg){ // REVISE / IMPROVE, NO NEED TO PASS MSG/EVE EACH SUB?\n      var eve = this, at = eve.as, put = msg.put, soul = put['#'], key = put['.'], val = put[':'], state = put['>'], id = msg['#'], tmp;\n      if(!soul || !key){ return }\n      if((msg._||'').faith && (at.opt||'').faith && 'function' == typeof msg._){\n        SEA.opt.pack(put, function(raw){\n        SEA.verify(raw, false, function(data){ // this is synchronous if false\n          put['='] = SEA.opt.unpack(data);\n          eve.to.next(msg);\n        })})\n        return \n      }\n      var no = function(why){ at.on('in', {'@': id, err: msg.err = why}) }; // exploit internal relay stun for now, maybe violates spec, but testing for now. // Note: this may be only the sharded message, not original batch.\n      //var no = function(why){ msg.ack(why) };\n      (msg._||'').DBG && ((msg._||'').DBG.c = +new Date);\n      if(0 <= soul.indexOf('<?')){ // special case for \"do not sync data X old\" forget\n        // 'a~pub.key/b<?9'\n        tmp = parseFloat(soul.split('<?')[1]||'');\n        if(tmp && (state < (Gun.state() - (tmp * 1000)))){ // sec to ms\n          (tmp = msg._) && (tmp.stun) && (tmp.stun--); // THIS IS BAD CODE! It assumes GUN internals do something that will probably change in future, but hacking in now.\n          return; // omit!\n        }\n      }\n      \n      if('~@' === soul){  // special case for shared system data, the list of aliases.\n        check.alias(eve, msg, val, key, soul, at, no); return;\n      }\n      if('~@' === soul.slice(0,2)){ // special case for shared system data, the list of public keys for an alias.\n        check.pubs(eve, msg, val, key, soul, at, no); return;\n      }\n      //if('~' === soul.slice(0,1) && 2 === (tmp = soul.slice(1)).split('.').length){ // special case, account data for a public key.\n      if(tmp = SEA.opt.pub(soul)){ // special case, account data for a public key.\n        check.pub(eve, msg, val, key, soul, at, no, at.user||'', tmp); return;\n      }\n      if(0 <= soul.indexOf('#')){ // special case for content addressing immutable hashed data.\n        check.hash(eve, msg, val, key, soul, at, no); return;\n      } \n      check.any(eve, msg, val, key, soul, at, no, at.user||''); return;\n      eve.to.next(msg); // not handled\n    }\n    check.hash = function(eve, msg, val, key, soul, at, no){ // mark unbuilt @i001962 's epic hex contrib!\n      SEA.work(val, null, function(data){\n        function hexToBase64(hexStr) {\n          let base64 = \"\";\n          for(let i = 0; i < hexStr.length; i++) {\n            base64 += !(i - 1 & 1) ? String.fromCharCode(parseInt(hexStr.substring(i - 1, i + 1), 16)) : \"\"}\n          return btoa(base64);}  \n        if(data && data === key.split('#').slice(-1)[0]){ return eve.to.next(msg) }\n          else if (data && data === hexToBase64(key.split('#').slice(-1)[0])){ \n          return eve.to.next(msg) }\n        no(\"Data hash not same as hash!\");\n      }, {name: 'SHA-256'});\n    }\n    check.alias = function(eve, msg, val, key, soul, at, no){ // Example: {_:#~@, ~@alice: {#~@alice}}\n      if(!val){ return no(\"Data must exist!\") } // data MUST exist\n      if('~@'+key === link_is(val)){ return eve.to.next(msg) } // in fact, it must be EXACTLY equal to itself\n      no(\"Alias not same!\"); // if it isn't, reject.\n    };\n    check.pubs = function(eve, msg, val, key, soul, at, no){ // Example: {_:#~@alice, ~asdf: {#~asdf}}\n      if(!val){ return no(\"Alias must exist!\") } // data MUST exist\n      if(key === link_is(val)){ return eve.to.next(msg) } // and the ID must be EXACTLY equal to its property\n      no(\"Alias not same!\"); // that way nobody can tamper with the list of public keys.\n    };\n    check.pub = async function(eve, msg, val, key, soul, at, no, user, pub){ var tmp // Example: {_:#~asdf, hello:'world'~fdsa}}\n      const raw = await S.parse(val) || {}\n      const verify = (certificate, certificant, cb) => {\n        if (certificate.m && certificate.s && certificant && pub)\n          // now verify certificate\n          return SEA.verify(certificate, pub, data => { // check if \"pub\" (of the graph owner) really issued this cert\n            if (u !== data && u !== data.e && msg.put['>'] && msg.put['>'] > parseFloat(data.e)) return no(\"Certificate expired.\") // certificate expired\n            // \"data.c\" = a list of certificants/certified users\n            // \"data.w\" = lex WRITE permission, in the future, there will be \"data.r\" which means lex READ permission\n            if (u !== data && data.c && data.w && (data.c === certificant || data.c.indexOf('*' || certificant) > -1)) {\n              // ok, now \"certificant\" is in the \"certificants\" list, but is \"path\" allowed? Check path\n              let path = soul.indexOf('/') > -1 ? soul.replace(soul.substring(0, soul.indexOf('/') + 1), '') : ''\n              String.match = String.match || Gun.text.match\n              const w = Array.isArray(data.w) ? data.w : typeof data.w === 'object' || typeof data.w === 'string' ? [data.w] : []\n              for (const lex of w) {\n                if ((String.match(path, lex['#']) && String.match(key, lex['.'])) || (!lex['.'] && String.match(path, lex['#'])) || (!lex['#'] && String.match(key, lex['.'])) || String.match((path ? path + '/' + key : key), lex['#'] || lex)) {\n                  // is Certificant forced to present in Path\n                  if (lex['+'] && lex['+'].indexOf('*') > -1 && path && path.indexOf(certificant) == -1 && key.indexOf(certificant) == -1) return no(`Path \"${path}\" or key \"${key}\" must contain string \"${certificant}\".`)\n                  // path is allowed, but is there any WRITE block? Check it out\n                  if (data.wb && (typeof data.wb === 'string' || ((data.wb || {})['#']))) { // \"data.wb\" = path to the WRITE block\n                    var root = eve.as.root.$.back(-1)\n                    if (typeof data.wb === 'string' && '~' !== data.wb.slice(0, 1)) root = root.get('~' + pub)\n                    return root.get(data.wb).get(certificant).once(value => { // TODO: INTENT TO DEPRECATE.\n                      if (value && (value === 1 || value === true)) return no(`Certificant ${certificant} blocked.`)\n                      return cb(data)\n                    })\n                  }\n                  return cb(data)\n                }\n              }\n              return no(\"Certificate verification fail.\")\n            }\n          })\n        return\n      }\n      \n      if ('pub' === key && '~' + pub === soul) {\n        if (val === pub) return eve.to.next(msg) // the account MUST match `pub` property that equals the ID of the public key.\n        return no(\"Account not same!\")\n      }\n\n      if ((tmp = user.is) && tmp.pub && !raw['*'] && !raw['+'] && (pub === tmp.pub || (pub !== tmp.pub && ((msg._.msg || {}).opt || {}).cert))){\n        SEA.opt.pack(msg.put, packed => {\n          SEA.sign(packed, (user._).sea, async function(data) {\n            if (u === data) return no(SEA.err || 'Signature fail.')\n            msg.put[':'] = {':': tmp = SEA.opt.unpack(data.m), '~': data.s}\n            msg.put['='] = tmp\n  \n            // if writing to own graph, just allow it\n            if (pub === user.is.pub) {\n              if (tmp = link_is(val)) (at.sea.own[tmp] = at.sea.own[tmp] || {})[pub] = 1\n              JSON.stringifyAsync(msg.put[':'], function(err,s){\n                if(err){ return no(err || \"Stringify error.\") }\n                msg.put[':'] = s;\n                return eve.to.next(msg);\n              })\n              return\n            }\n  \n            // if writing to other's graph, check if cert exists then try to inject cert into put, also inject self pub so that everyone can verify the put\n            if (pub !== user.is.pub && ((msg._.msg || {}).opt || {}).cert) {\n              const cert = await S.parse(msg._.msg.opt.cert)\n              // even if cert exists, we must verify it\n              if (cert && cert.m && cert.s)\n                verify(cert, user.is.pub, _ => {\n                  msg.put[':']['+'] = cert // '+' is a certificate\n                  msg.put[':']['*'] = user.is.pub // '*' is pub of the user who puts\n                  JSON.stringifyAsync(msg.put[':'], function(err,s){\n                    if(err){ return no(err || \"Stringify error.\") }\n                    msg.put[':'] = s;\n                    return eve.to.next(msg);\n                  })\n                  return\n                })\n            }\n          }, {raw: 1})\n        })\n        return;\n      }\n\n      SEA.opt.pack(msg.put, packed => {\n        SEA.verify(packed, raw['*'] || pub, function(data){ var tmp;\n          data = SEA.opt.unpack(data);\n          if (u === data) return no(\"Unverified data.\") // make sure the signature matches the account it claims to be on. // reject any updates that are signed with a mismatched account.\n          if ((tmp = link_is(data)) && pub === SEA.opt.pub(tmp)) (at.sea.own[tmp] = at.sea.own[tmp] || {})[pub] = 1\n          \n          // check if cert ('+') and putter's pub ('*') exist\n          if (raw['+'] && raw['+']['m'] && raw['+']['s'] && raw['*'])\n            // now verify certificate\n            verify(raw['+'], raw['*'], _ => {\n              msg.put['='] = data;\n              return eve.to.next(msg);\n            })\n          else {\n            msg.put['='] = data;\n            return eve.to.next(msg);\n          }\n        });\n      })\n      return\n    };\n    check.any = function(eve, msg, val, key, soul, at, no, user){ var tmp, pub;\n      if(at.opt.secure){ return no(\"Soul missing public key at '\" + key + \"'.\") }\n      // TODO: Ask community if should auto-sign non user-graph data.\n      at.on('secure', function(msg){ this.off();\n        if(!at.opt.secure){ return eve.to.next(msg) }\n        no(\"Data cannot be changed.\");\n      }).on.on('secure', msg);\n      return;\n    }\n\n    var valid = Gun.valid, link_is = function(d,l){ return 'string' == typeof (l = valid(d)) && l }, state_ify = (Gun.state||'').ify;\n\n    var pubcut = /[^\\w_-]/; // anything not alphanumeric or _ -\n    SEA.opt.pub = function(s){\n      if(!s){ return }\n      s = s.split('~');\n      if(!s || !(s = s[1])){ return }\n      s = s.split(pubcut).slice(0,2);\n      if(!s || 2 != s.length){ return }\n      if('@' === (s[0]||'')[0]){ return }\n      s = s.slice(0,2).join('.');\n      return s;\n    }\n    SEA.opt.stringy = function(t){\n      // TODO: encrypt etc. need to check string primitive. Make as breaking change.\n    }\n    SEA.opt.pack = function(d,cb,k, n,s){ var tmp, f; // pack for verifying\n      if(SEA.opt.check(d)){ return cb(d) }\n      if(d && d['#'] && d['.'] && d['>']){ tmp = d[':']; f = 1 }\n      JSON.parseAsync(f? tmp : d, function(err, meta){\n        var sig = ((u !== (meta||'')[':']) && (meta||'')['~']); // or just ~ check?\n        if(!sig){ cb(d); return }\n        cb({m: {'#':s||d['#'],'.':k||d['.'],':':(meta||'')[':'],'>':d['>']||Gun.state.is(n, k)}, s: sig});\n      });\n    }\n    var O = SEA.opt;\n    SEA.opt.unpack = function(d, k, n){ var tmp;\n      if(u === d){ return }\n      if(d && (u !== (tmp = d[':']))){ return tmp }\n      k = k || O.fall_key; if(!n && O.fall_val){ n = {}; n[k] = O.fall_val }\n      if(!k || !n){ return }\n      if(d === n[k]){ return d }\n      if(!SEA.opt.check(n[k])){ return d }\n      var soul = (n && n._ && n._['#']) || O.fall_soul, s = Gun.state.is(n, k) || O.fall_state;\n      if(d && 4 === d.length && soul === d[0] && k === d[1] && fl(s) === fl(d[3])){\n        return d[2];\n      }\n      if(s < SEA.opt.shuffle_attack){\n        return d;\n      }\n    }\n    SEA.opt.shuffle_attack = 1546329600000; // Jan 1, 2019\n    var fl = Math.floor; // TODO: Still need to fix inconsistent state issue.\n    // TODO: Potential bug? If pub/priv key starts with `-`? IDK how possible.\n\n  })(USE, './index');\n}());\n","import Gun from \"gun\";\r\nimport { ethers } from \"ethers\";\r\nimport {\r\n  PROOF_OF_INTEGRITY_ABI,\r\n  STEALTH_ANNOUNCER_ABI,\r\n  getAddressesForChain,\r\n  isLocalEnvironment,\r\n  CHAIN_CONFIG,\r\n} from \"./abis/abis.js\";\r\nimport { LOCAL_CONFIG } from \"./config/local.js\";\r\n\r\nimport 'gun/sea.js';  // Questo modifica Gun globalmente\r\nconst SEA = Gun.SEA; \r\n\r\nlet PROOF_CONTRACT_ADDRESS;\r\nlet contractAddresses = {\r\n  PROOF_OF_INTEGRITY_ADDRESS:\r\n    CHAIN_CONFIG.optimismSepolia.PROOF_OF_INTEGRITY_ADDRESS,\r\n  STEALTH_ANNOUNCER_ADDRESS:\r\n    CHAIN_CONFIG.optimismSepolia.STEALTH_ANNOUNCER_ADDRESS,\r\n};\r\n\r\n// Funzione di inizializzazione per Node.js\r\nconst initNodeEnvironment = async () => {\r\n  if (typeof window === \"undefined\") {\r\n    try {\r\n      // Importazioni dinamiche\r\n      const { fileURLToPath } = await import(\"url\");\r\n      const { dirname } = await import(\"path\");\r\n      const { readFile } = await import(\"fs/promises\");\r\n      const { join } = await import(\"path\");\r\n\r\n      const __filename = fileURLToPath(import.meta.url);\r\n      const __dirname = dirname(__filename);\r\n\r\n      try {\r\n        const rawdata = await readFile(\r\n          join(__dirname, \"contract-address.json\"),\r\n          \"utf8\"\r\n        );\r\n        contractAddresses = JSON.parse(rawdata);\r\n        console.log(\"Loaded contract addresses:\", contractAddresses);\r\n      } catch (err) {\r\n        console.warn(\"Warning: contract-address.json not found or invalid\");\r\n      }\r\n    } catch (error) {\r\n      console.error(\"Error loading Node.js modules:\", error);\r\n    }\r\n  }\r\n};\r\n\r\n// Inizializza solo in ambiente Node.js\r\nif (typeof window === \"undefined\") {\r\n  initNodeEnvironment();\r\n}\r\n\r\n// ... resto del codice ...\r\n\r\n// Esporta tutto ciò che serve\r\nexport {\r\n  Gun,\r\n  initNodeEnvironment,\r\n  // ... altre esportazioni ...\r\n};\r\n\r\n// Export default\r\nexport default Gun;\r\n\r\n// =============================================\r\n// UTILITY FUNCTIONS\r\n// =============================================\r\n/**\r\n * Generates a random node ID for GunDB\r\n * @returns {string} A random hexadecimal string\r\n */\r\nexport function generateRandomId() {\r\n  const randomBytes = ethers.randomBytes(32);\r\n  return ethers.hexlify(randomBytes).slice(2);\r\n}\r\n\r\n/**\r\n * Generates a password from a signature.\r\n * @param {string} signature - The signature to derive the password from.\r\n * @returns {string|null} The generated password or null if generation fails.\r\n */\r\nexport function generatePassword(signature) {\r\n  try {\r\n    const signatureBytes = ethers.toUtf8Bytes(signature);\r\n    const hash = ethers.keccak256(signatureBytes);\r\n    console.log(\"Generated password:\", hash);\r\n    return hash;\r\n  } catch (error) {\r\n    console.error(\"Error generating password:\", error);\r\n    return null;\r\n  }\r\n}\r\n\r\n/**\r\n * Converts a Gun private key to an Ethereum account.\r\n * @param {string} gunPrivateKey - The Gun private key in base64url format.\r\n * @returns {Object} An object containing the Ethereum account and public key.\r\n */\r\nexport function gunToEthAccount(gunPrivateKey) {\r\n  // Function to convert base64url to hex\r\n  const base64UrlToHex = (base64url) => {\r\n    const padding = \"=\".repeat((4 - (base64url.length % 4)) % 4);\r\n    const base64 = base64url.replace(/-/g, \"+\").replace(/_/g, \"/\") + padding;\r\n    const binary = atob(base64);\r\n    return Array.from(binary, (char) =>\r\n      char.charCodeAt(0).toString(16).padStart(2, \"0\")\r\n    ).join(\"\");\r\n  };\r\n\r\n  // Convert Gun private key to hex format\r\n  const hexPrivateKey = \"0x\" + base64UrlToHex(gunPrivateKey);\r\n\r\n  // Create an Ethereum wallet from the private key\r\n  const wallet = new ethers.Wallet(hexPrivateKey);\r\n\r\n  // Get the public address (public key)\r\n  const publicKey = wallet.address;\r\n\r\n  return {\r\n    account: wallet,\r\n    publicKey: publicKey,\r\n    privateKey: hexPrivateKey,\r\n  };\r\n}\r\n\r\n/**\r\n * Gets an Ethereum signer based on current configuration\r\n * @returns {Promise<ethers.Signer>} The configured signer\r\n * @throws {Error} If no valid provider is found\r\n */\r\nexport const getSigner = async () => {\r\n  if (rpcUrl && privateKey) {\r\n    const provider = new ethers.JsonRpcProvider(rpcUrl, {\r\n      chainId: LOCAL_CONFIG.CHAIN_ID,\r\n      name: \"localhost\",\r\n    });\r\n    return new Wallet(privateKey, provider);\r\n  } else if (\r\n    typeof window !== \"undefined\" &&\r\n    typeof window.ethereum !== \"undefined\"\r\n  ) {\r\n    await window.ethereum.request({ method: \"eth_requestAccounts\" });\r\n    const provider = new ethers.BrowserProvider(window.ethereum);\r\n    return provider.getSigner();\r\n  } else {\r\n    throw new Error(\"No valid Ethereum provider found\");\r\n  }\r\n};\r\n\r\n/**\r\n * Utility function to generate stealth address\r\n * @param {string} sharedSecret - The shared secret\r\n * @param {string} spendingPublicKey - The spending public key\r\n * @returns {Object} The stealth address and private key\r\n */\r\nexport function deriveStealthAddress(sharedSecret, spendingPublicKey) {\r\n  try {\r\n    const sharedSecretBytes = ethers.toUtf8Bytes(sharedSecret);\r\n    const spendingPublicKeyBytes = ethers.toUtf8Bytes(spendingPublicKey);\r\n\r\n    const stealthPrivateKey = ethers.keccak256(\r\n      ethers.concat([sharedSecretBytes, spendingPublicKeyBytes])\r\n    );\r\n\r\n    const stealthWallet = new Wallet(stealthPrivateKey);\r\n\r\n    console.log(\"Debug deriveStealthAddress:\", {\r\n      sharedSecretHex: stealthPrivateKey,\r\n      spendingPublicKey,\r\n      stealthPrivateKey,\r\n      stealthAddress: stealthWallet.address,\r\n    });\r\n\r\n    return {\r\n      stealthPrivateKey,\r\n      stealthAddress: stealthWallet.address,\r\n      wallet: stealthWallet,\r\n    };\r\n  } catch (error) {\r\n    console.error(\"Error in deriveStealthAddress:\", error);\r\n    throw error;\r\n  }\r\n}\r\n\r\n// =============================================\r\n// BASIC GUN-ETH CHAIN METHODS\r\n// =============================================\r\n\r\n// Set the message to sign\r\nGun.chain.MESSAGE_TO_SIGN = MESSAGE_TO_SIGN;\r\n\r\n/**\r\n * Sets standalone configuration for Gun.\r\n * @param {string} newRpcUrl - The new RPC URL.\r\n * @param {string} newPrivateKey - The new private key.\r\n * @returns {Gun} The Gun instance for chaining.\r\n */\r\nGun.chain.setSigner = function (newRpcUrl, newPrivateKey) {\r\n  rpcUrl = newRpcUrl;\r\n  privateKey = newPrivateKey;\r\n  console.log(\"Standalone configuration set\");\r\n  return this;\r\n};\r\n\r\nGun.chain.getSigner = getSigner();\r\n\r\n/**\r\n * Verifies an Ethereum signature.\r\n * @param {string} message - The original message that was signed.\r\n * @param {string} signature - The signature to verify.\r\n * @returns {Promise<string|null>} The recovered address or null if verification fails.\r\n */\r\nGun.chain.verifySignature = async function (message, signature) {\r\n  try {\r\n    const recoveredAddress = ethers.verifyMessage(message, signature);\r\n    return recoveredAddress;\r\n  } catch (error) {\r\n    console.error(\"Error verifying signature:\", error);\r\n    return null;\r\n  }\r\n};\r\n\r\n/**\r\n * Generates a password from a signature.\r\n * @param {string} signature - The signature to derive the password from.\r\n * @returns {string|null} The generated password or null if generation fails.\r\n */\r\nGun.chain.generatePassword = function (signature) {\r\n  return generatePassword(signature);\r\n};\r\n\r\n/**\r\n * Creates an Ethereum signature for a given message.\r\n * @param {string} message - The message to sign.\r\n * @returns {Promise<string|null>} The signature or null if signing fails.\r\n */\r\nGun.chain.createSignature = async function (message) {\r\n  try {\r\n    // Check if message matches MESSAGE_TO_SIGN\r\n    if (message !== MESSAGE_TO_SIGN) {\r\n      throw new Error(\"Invalid message, valid message is: \" + MESSAGE_TO_SIGN);\r\n    }\r\n    const signer = await getSigner();\r\n    const signature = await signer.signMessage(message);\r\n    console.log(\"Signature created:\", signature);\r\n    return signature;\r\n  } catch (error) {\r\n    console.error(\"Error creating signature:\", error);\r\n    return null;\r\n  }\r\n};\r\n\r\n// =============================================\r\n// KEY PAIR MANAGEMENT\r\n// =============================================\r\n/**\r\n * Creates and stores an encrypted key pair for a given address.\r\n * @param {string} address - The Ethereum address to associate with the key pair.\r\n * @param {string} signature - The signature to use for encryption.\r\n * @returns {Promise<void>}\r\n */\r\nGun.chain.createAndStoreEncryptedPair = async function (address, signature) {\r\n  try {\r\n    const gun = this;\r\n    const pair = await SEA.pair();\r\n    const v_pair = await SEA.pair();\r\n    const s_pair = await SEA.pair();\r\n    const password = generatePassword(signature);\r\n\r\n    // Save original SEA pairs\r\n    const encryptedPair = await SEA.encrypt(JSON.stringify(pair), password);\r\n    const encryptedV_pair = await SEA.encrypt(JSON.stringify(v_pair), password);\r\n    const encryptedS_pair = await SEA.encrypt(JSON.stringify(s_pair), password);\r\n\r\n    // Convert only to get Ethereum addresses\r\n    const viewingAccount = gunToEthAccount(v_pair.priv);\r\n    const spendingAccount = gunToEthAccount(s_pair.priv);\r\n\r\n    gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(address)\r\n      .put({\r\n        pair: encryptedPair,\r\n        v_pair: encryptedV_pair,\r\n        s_pair: encryptedS_pair,\r\n        publicKeys: {\r\n          viewingPublicKey: v_pair.epub, // Use SEA encryption public key\r\n          viewingPublicKey: v_pair.epub, // Use SEA encryption public key\r\n          spendingPublicKey: spendingAccount.publicKey, // Use Ethereum address\r\n          ethViewingAddress: viewingAccount.publicKey, // Also save Ethereum address\r\n        },\r\n      });\r\n\r\n    console.log(\"Encrypted pairs and public keys stored for:\", address);\r\n  } catch (error) {\r\n    console.error(\"Error creating and storing encrypted pair:\", error);\r\n    throw error;\r\n  }\r\n};\r\n\r\n/**\r\n * Retrieves and decrypts a stored key pair for a given address.\r\n * @param {string} address - The Ethereum address associated with the key pair.\r\n * @param {string} signature - The signature to use for decryption.\r\n * @returns {Promise<Object|null>} The decrypted key pair or null if retrieval fails.\r\n */\r\nGun.chain.getAndDecryptPair = async function (address, signature) {\r\n  try {\r\n    const gun = this;\r\n    const encryptedData = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(address)\r\n      .get(\"pair\")\r\n      .then();\r\n    if (!encryptedData) {\r\n      throw new Error(\"No encrypted data found for this address\");\r\n    }\r\n    const password = generatePassword(signature);\r\n    const decryptedPair = await SEA.decrypt(encryptedData, password);\r\n    console.log(decryptedPair);\r\n    return decryptedPair;\r\n  } catch (error) {\r\n    console.error(\"Error retrieving and decrypting pair:\", error);\r\n    return null;\r\n  }\r\n};\r\n\r\n// =============================================\r\n// PROOF OF INTEGRITY\r\n// =============================================\r\n/**\r\n * Proof of Integrity\r\n * @param {string} chain - The blockchain to use (e.g., \"optimismSepolia\").\r\n * @param {string} nodeId - The ID of the node to verify or write.\r\n * @param {Object} data - The data to write (if writing).\r\n * @param {Function} callback - Callback function to handle the result.\r\n * @returns {Gun} The Gun instance for chaining.\r\n */\r\nGun.chain.proof = function (chain, nodeId, data, callback) {\r\n  console.log(\"Proof plugin called with:\", { chain, nodeId, data });\r\n\r\n  if (typeof callback !== \"function\") {\r\n    console.error(\"Callback must be a function\");\r\n    return this;\r\n  }\r\n\r\n  try {\r\n    // Se siamo in localhost e in development, usa automaticamente la chain locale\r\n    const targetChain = isLocalEnvironment() ? \"localhost\" : chain;\r\n    const chainConfig = getAddressesForChain(targetChain);\r\n\r\n    console.log(`Using ${targetChain} configuration:`, chainConfig);\r\n\r\n    // Usa gli indirizzi dalla configurazione\r\n    const contract = new ethers.Contract(\r\n      chainConfig.PROOF_OF_INTEGRITY_ADDRESS,\r\n      PROOF_OF_INTEGRITY_ABI,\r\n      signer\r\n    );\r\n\r\n    // Funzione per verificare on-chain\r\n    const verifyOnChain = async (nodeId, contentHash) => {\r\n      console.log(\"Verifying on chain:\", { nodeId, contentHash });\r\n      const signer = await getSigner();\r\n      const contract = new Contract(\r\n        PROOF_CONTRACT_ADDRESS,\r\n        PROOF_OF_INTEGRITY_ABI,\r\n        signer\r\n      );\r\n      const [isValid, timestamp, updater] = await contract.verifyData(\r\n        ethers.toUtf8Bytes(nodeId),\r\n        contentHash\r\n      );\r\n      console.log(\"Verification result:\", { isValid, timestamp, updater });\r\n      return { isValid, timestamp, updater };\r\n    };\r\n\r\n    // Funzione per scrivere on-chain\r\n    const writeOnChain = async (nodeId, contentHash) => {\r\n      console.log(\"Writing on chain:\", { nodeId, contentHash });\r\n      const signer = await getSigner();\r\n      const contract = new Contract(\r\n        PROOF_CONTRACT_ADDRESS,\r\n        PROOF_OF_INTEGRITY_ABI,\r\n        signer\r\n      );\r\n      const tx = await contract.updateData(toUtf8Bytes(nodeId), contentHash);\r\n      console.log(\"Transaction sent:\", tx.hash);\r\n      const receipt = await tx.wait();\r\n      console.log(\"Transaction confirmed:\", receipt);\r\n      return tx;\r\n    };\r\n\r\n    // Funzione per ottenere l'ultimo record\r\n    const getLatestRecord = async (nodeId) => {\r\n      const signer = await getSigner();\r\n      const contract = new Contract(\r\n        PROOF_CONTRACT_ADDRESS,\r\n        PROOF_OF_INTEGRITY_ABI,\r\n        signer\r\n      );\r\n      const [contentHash, timestamp, updater] = await contract.getLatestRecord(\r\n        toUtf8Bytes(nodeId)\r\n      );\r\n      console.log(\"Latest record from blockchain:\", {\r\n        nodeId,\r\n        contentHash,\r\n        timestamp,\r\n        updater,\r\n      });\r\n      return { contentHash, timestamp, updater };\r\n    };\r\n\r\n    if (nodeId && !data) {\r\n      // Case 1: User passes only node\r\n      gun.get(nodeId).once(async (existingData) => {\r\n        if (!existingData) {\r\n          if (callback) callback({ err: \"Node not found in GunDB\" });\r\n          return;\r\n        }\r\n\r\n        console.log(\"existingData\", existingData);\r\n\r\n        // Use stored contentHash instead of recalculating\r\n        const contentHash = existingData._contentHash;\r\n        console.log(\"contentHash\", contentHash);\r\n\r\n        if (!contentHash) {\r\n          if (callback)\r\n            callback({ err: \"No content hash found for this node\" });\r\n          return;\r\n        }\r\n\r\n        try {\r\n          const { isValid, timestamp, updater } = await verifyOnChain(\r\n            nodeId,\r\n            contentHash\r\n          );\r\n          const latestRecord = await getLatestRecord(nodeId);\r\n\r\n          if (isValid) {\r\n            if (callback)\r\n              callback({\r\n                ok: true,\r\n                message: \"Data verified on blockchain\",\r\n                timestamp,\r\n                updater,\r\n                latestRecord,\r\n              });\r\n          } else {\r\n            if (callback)\r\n              callback({\r\n                ok: false,\r\n                message: \"Data not verified on blockchain\",\r\n                latestRecord,\r\n              });\r\n          }\r\n        } catch (error) {\r\n          if (callback) callback({ err: error.message });\r\n        }\r\n      });\r\n    } else if (data && !nodeId) {\r\n      // Case 2: User passes only text (data)\r\n      const newNodeId = generateRandomId();\r\n      const dataString = JSON.stringify(data);\r\n      const contentHash = ethers.keccak256(ethers.toUtf8Bytes(dataString));\r\n\r\n      gun\r\n        .get(newNodeId)\r\n        .put({ ...data, _contentHash: contentHash }, async (ack) => {\r\n          console.log(\"ack\", ack);\r\n          if (ack.err) {\r\n            if (callback) callback({ err: \"Error saving data to GunDB\" });\r\n            return;\r\n          }\r\n\r\n          try {\r\n            const tx = await writeOnChain(newNodeId, contentHash);\r\n            if (callback)\r\n              callback({\r\n                ok: true,\r\n                message: \"Data written to GunDB and blockchain\",\r\n                nodeId: newNodeId,\r\n                txHash: tx.hash,\r\n              });\r\n          } catch (error) {\r\n            if (callback) callback({ err: error.message });\r\n          }\r\n        });\r\n    } else {\r\n      if (callback)\r\n        callback({\r\n          err: \"Invalid input. Provide either nodeId or data, not both.\",\r\n        });\r\n    }\r\n\r\n    return gun;\r\n  } catch (error) {\r\n    callback({ err: error.message });\r\n    return this;\r\n  }\r\n};\r\n\r\n// =============================================\r\n// STEALTH ADDRESS CORE FUNCTIONS\r\n// =============================================\r\n/**\r\n * Converts a Gun private key to an Ethereum account.\r\n * @param {string} gunPrivateKey - The Gun private key in base64url format.\r\n * @returns {Object} An object containing the Ethereum account and public key.\r\n */\r\nGun.chain.gunToEthAccount = function (gunPrivateKey) {\r\n  return gunToEthAccount(gunPrivateKey);\r\n};\r\n\r\n/**\r\n * Generate a stealth key and related key pairs\r\n * @param {string} recipientAddress - The recipient's Ethereum address\r\n * @param {string} signature - The sender's signature to access their keys\r\n * @returns {Promise<Object>} Object containing stealth addresses and keys\r\n */\r\nGun.chain.generateStealthAddress = async function (\r\n  recipientAddress,\r\n  signature\r\n) {\r\n  try {\r\n    const gun = this;\r\n\r\n    // Get recipient's public keys\r\n    const recipientData = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(recipientAddress)\r\n      .get(\"publicKeys\")\r\n      .then();\r\n\r\n    if (\r\n      !recipientData ||\r\n      !recipientData.viewingPublicKey ||\r\n      !recipientData.spendingPublicKey\r\n    ) {\r\n      throw new Error(\"Recipient's public keys not found\");\r\n    }\r\n\r\n    // Get sender's keys\r\n    const senderAddress = await this.verifySignature(\r\n      MESSAGE_TO_SIGN,\r\n      signature\r\n    );\r\n    const password = generatePassword(signature);\r\n\r\n    const senderData = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(senderAddress)\r\n      .then();\r\n\r\n    if (!senderData || !senderData.s_pair) {\r\n      throw new Error(\"Sender's keys not found\");\r\n    }\r\n\r\n    // Decrypt sender's spending pair\r\n    let spendingKeyPair;\r\n    try {\r\n      const decryptedData = await SEA.decrypt(senderData.s_pair, password);\r\n      spendingKeyPair =\r\n        typeof decryptedData === \"string\"\r\n          ? JSON.parse(decryptedData)\r\n          : decryptedData;\r\n    } catch (error) {\r\n      console.error(\"Error decrypting spending pair:\", error);\r\n      throw new Error(\"Unable to decrypt spending pair\");\r\n    }\r\n\r\n    // Generate shared secret using SEA ECDH with encryption public key\r\n    const sharedSecret = await SEA.secret(\r\n      recipientData.viewingPublicKey,\r\n      spendingKeyPair\r\n    );\r\n\r\n    if (!sharedSecret) {\r\n      throw new Error(\"Unable to generate shared secret\");\r\n    }\r\n\r\n    console.log(\"Generate shared secret:\", sharedSecret);\r\n\r\n    const { stealthAddress } = deriveStealthAddress(\r\n      sharedSecret,\r\n      recipientData.spendingPublicKey\r\n    );\r\n\r\n    return {\r\n      stealthAddress,\r\n      senderPublicKey: spendingKeyPair.epub, // Use encryption public key\r\n      spendingPublicKey: recipientData.spendingPublicKey,\r\n    };\r\n  } catch (error) {\r\n    console.error(\"Error generating stealth address:\", error);\r\n    throw error;\r\n  }\r\n};\r\n\r\n/**\r\n * Publish public keys needed to receive stealth payments\r\n * @param {string} signature - The signature to authenticate the user\r\n * @returns {Promise<void>}\r\n */\r\nGun.chain.publishStealthKeys = async function (signature) {\r\n  try {\r\n    const gun = this;\r\n    const address = await this.verifySignature(MESSAGE_TO_SIGN, signature);\r\n    const password = generatePassword(signature);\r\n\r\n    // Get encrypted key pairs\r\n    const encryptedData = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(address)\r\n      .then();\r\n\r\n    if (!encryptedData || !encryptedData.v_pair || !encryptedData.s_pair) {\r\n      throw new Error(\"Keys not found\");\r\n    }\r\n\r\n    // Decrypt viewing and spending pairs\r\n    const viewingKeyPair = JSON.parse(\r\n      await SEA.decrypt(encryptedData.v_pair, password)\r\n    );\r\n    const spendingKeyPair = JSON.parse(\r\n      await SEA.decrypt(encryptedData.s_pair, password)\r\n    );\r\n\r\n    const viewingAccount = gunToEthAccount(viewingKeyPair.priv);\r\n    const spendingAccount = gunToEthAccount(spendingKeyPair.priv);\r\n\r\n    // Publish only public keys\r\n    gun.get(\"gun-eth\").get(\"users\").get(address).get(\"publicKeys\").put({\r\n      viewingPublicKey: viewingAccount.publicKey,\r\n      spendingPublicKey: spendingAccount.publicKey,\r\n    });\r\n\r\n    console.log(\"Stealth public keys published successfully\");\r\n  } catch (error) {\r\n    console.error(\"Error publishing stealth keys:\", error);\r\n    throw error;\r\n  }\r\n};\r\n\r\n// =============================================\r\n// STEALTH PAYMENT FUNCTIONS\r\n// =============================================\r\n/**\r\n * Recover funds from a stealth address\r\n * @param {string} stealthAddress - The stealth address to recover funds from\r\n * @param {string} senderPublicKey - The sender's public key used to generate the address\r\n * @param {string} signature - The signature to decrypt private keys\r\n * @returns {Promise<Object>} Object containing wallet to access funds\r\n */\r\nGun.chain.recoverStealthFunds = async function (\r\n  stealthAddress,\r\n  senderPublicKey,\r\n  signature,\r\n  spendingPublicKey\r\n) {\r\n  try {\r\n    const gun = this;\r\n    const password = generatePassword(signature);\r\n\r\n    // Get own key pairs\r\n    const myAddress = await this.verifySignature(MESSAGE_TO_SIGN, signature);\r\n    const encryptedData = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"users\")\r\n      .get(myAddress)\r\n      .then();\r\n\r\n    if (!encryptedData || !encryptedData.v_pair || !encryptedData.s_pair) {\r\n      throw new Error(\"Keys not found\");\r\n    }\r\n\r\n    // Decrypt viewing and spending pairs\r\n    let viewingKeyPair;\r\n    try {\r\n      const decryptedViewingData = await SEA.decrypt(\r\n        encryptedData.v_pair,\r\n        password\r\n      );\r\n      viewingKeyPair =\r\n        typeof decryptedViewingData === \"string\"\r\n          ? JSON.parse(decryptedViewingData)\r\n          : decryptedViewingData;\r\n    } catch (error) {\r\n      console.error(\"Error decrypting keys:\", error);\r\n      throw new Error(\"Unable to decrypt keys\");\r\n    }\r\n\r\n    // Generate shared secret using SEA ECDH\r\n    const sharedSecret = await SEA.secret(senderPublicKey, viewingKeyPair);\r\n\r\n    if (!sharedSecret) {\r\n      throw new Error(\"Unable to generate shared secret\");\r\n    }\r\n\r\n    console.log(\"Recover shared secret:\", sharedSecret);\r\n\r\n    const { wallet, stealthAddress: recoveredAddress } = deriveStealthAddress(\r\n      sharedSecret,\r\n      spendingPublicKey\r\n    );\r\n\r\n    // Verify address matches\r\n    if (recoveredAddress.toLowerCase() !== stealthAddress.toLowerCase()) {\r\n      console.error(\"Mismatch:\", {\r\n        recovered: recoveredAddress,\r\n        expected: stealthAddress,\r\n        sharedSecret,\r\n      });\r\n      throw new Error(\"Recovered stealth address does not match\");\r\n    }\r\n\r\n    return {\r\n      wallet,\r\n      address: recoveredAddress,\r\n    };\r\n  } catch (error) {\r\n    console.error(\"Error recovering stealth funds:\", error);\r\n    throw error;\r\n  }\r\n};\r\n\r\n/**\r\n * Announce a stealth payment\r\n * @param {string} stealthAddress - The generated stealth address\r\n * @param {string} senderPublicKey - The sender's public key\r\n * @param {string} spendingPublicKey - The spending public key\r\n * @param {string} signature - The sender's signature\r\n * @returns {Promise<void>}\r\n */\r\nGun.chain.announceStealthPayment = async function (\r\n  stealthAddress,\r\n  senderPublicKey,\r\n  spendingPublicKey,\r\n  signature,\r\n  options = { onChain: false, chain: \"optimismSepolia\" }\r\n) {\r\n  try {\r\n    const gun = this;\r\n    const senderAddress = await this.verifySignature(\r\n      MESSAGE_TO_SIGN,\r\n      signature\r\n    );\r\n\r\n    if (options.onChain) {\r\n      // On-chain announcement\r\n      const signer = await getSigner();\r\n      const chainConfig = getAddressesForChain(options.chain);\r\n      const contractAddress = chainConfig.STEALTH_ANNOUNCER_ADDRESS;\r\n\r\n      console.log(\"Using contract address:\", contractAddress);\r\n\r\n      const contract = new Contract(\r\n        contractAddress,\r\n        STEALTH_ANNOUNCER_ABI,\r\n        signer\r\n      );\r\n\r\n      // Get dev fee from contract\r\n      const devFee = await contract.devFee();\r\n      console.log(\"Dev fee:\", devFee.toString());\r\n\r\n      // Call contract\r\n      const tx = await contract.announcePayment(\r\n        senderPublicKey,\r\n        spendingPublicKey,\r\n        stealthAddress,\r\n        { value: devFee }\r\n      );\r\n\r\n      console.log(\"Transaction sent:\", tx.hash);\r\n      const receipt = await tx.wait();\r\n      console.log(\"Transaction confirmed:\", receipt.hash);\r\n\r\n      console.log(\"Stealth payment announced on-chain (dev fee paid)\");\r\n    } else {\r\n      // Off-chain announcement (GunDB)\r\n      gun.get(\"gun-eth\").get(\"stealth-payments\").set({\r\n        stealthAddress,\r\n        senderAddress,\r\n        senderPublicKey,\r\n        spendingPublicKey,\r\n        timestamp: Date.now(),\r\n      });\r\n      console.log(\"Stealth payment announced off-chain\");\r\n    }\r\n  } catch (error) {\r\n    console.error(\"Error announcing stealth payment:\", error);\r\n    console.error(\"Error details:\", error.stack);\r\n    throw error;\r\n  }\r\n};\r\n\r\n/**\r\n * Get all stealth payments for an address\r\n * @param {string} signature - The signature to authenticate the user\r\n * @returns {Promise<Array>} List of stealth payments\r\n */\r\nGun.chain.getStealthPayments = async function (\r\n  signature,\r\n  options = { source: \"both\" }\r\n) {\r\n  try {\r\n    const payments = [];\r\n\r\n    if (options.source === \"onChain\" || options.source === \"both\") {\r\n      const signer = await getSigner();\r\n      const chainConfig = getAddressesForChain(\r\n        options.chain || \"optimismSepolia\"\r\n      );\r\n      const contractAddress = chainConfig.STEALTH_ANNOUNCER_ADDRESS;\r\n\r\n      const contract = new Contract(\r\n        contractAddress,\r\n        STEALTH_ANNOUNCER_ABI,\r\n        signer\r\n      );\r\n\r\n      try {\r\n        // Get total number of announcements\r\n        const totalAnnouncements = await contract.getAnnouncementsCount();\r\n        const totalCount = Number(totalAnnouncements.toString());\r\n        console.log(\"Total on-chain announcements:\", totalCount);\r\n\r\n        if (totalCount > 0) {\r\n          // Get announcements in batches of 100\r\n          const batchSize = 100;\r\n          const lastIndex = totalCount - 1;\r\n\r\n          for (let i = 0; i <= lastIndex; i += batchSize) {\r\n            const toIndex = Math.min(i + batchSize - 1, lastIndex);\r\n            const batch = await contract.getAnnouncementsInRange(i, toIndex);\r\n\r\n            // For each announcement, try to decrypt\r\n            for (const announcement of batch) {\r\n              try {\r\n                // Verify announcement is valid\r\n                if (\r\n                  !announcement ||\r\n                  !announcement.stealthAddress ||\r\n                  !announcement.senderPublicKey ||\r\n                  !announcement.spendingPublicKey\r\n                ) {\r\n                  console.log(\"Invalid announcement:\", announcement);\r\n                  continue;\r\n                }\r\n\r\n                // Try to recover funds to verify if announcement is for us\r\n                const recoveredWallet = await this.recoverStealthFunds(\r\n                  announcement.stealthAddress,\r\n                  announcement.senderPublicKey,\r\n                  signature,\r\n                  announcement.spendingPublicKey\r\n                );\r\n\r\n                // If no errors thrown, announcement is for us\r\n                payments.push({\r\n                  stealthAddress: announcement.stealthAddress,\r\n                  senderPublicKey: announcement.senderPublicKey,\r\n                  spendingPublicKey: announcement.spendingPublicKey,\r\n                  timestamp: Number(announcement.timestamp),\r\n                  source: \"onChain\",\r\n                  wallet: recoveredWallet,\r\n                });\r\n              } catch (e) {\r\n                // Not for us, continue\r\n                console.log(\r\n                  `Announcement not for us: ${announcement.stealthAddress}`\r\n                );\r\n                continue;\r\n              }\r\n            }\r\n          }\r\n        }\r\n      } catch (error) {\r\n        console.error(\"Error retrieving on-chain announcements:\", error);\r\n      }\r\n    }\r\n\r\n    if (options.source === \"offChain\" || options.source === \"both\") {\r\n      // Get off-chain payments\r\n      const gun = this;\r\n      const offChainPayments = await new Promise((resolve) => {\r\n        const p = [];\r\n        gun\r\n          .get(\"gun-eth\")\r\n          .get(\"stealth-payments\")\r\n          .get(recipientAddress)\r\n          .map()\r\n          .once((payment, id) => {\r\n            if (payment?.stealthAddress) {\r\n              p.push({ ...payment, id, source: \"offChain\" });\r\n            }\r\n          });\r\n        setTimeout(() => resolve(p), 2000);\r\n      });\r\n\r\n      payments.push(...offChainPayments);\r\n    }\r\n\r\n    console.log(`Found ${payments.length} stealth payments`);\r\n    return payments;\r\n  } catch (error) {\r\n    console.error(\"Error retrieving stealth payments:\", error);\r\n    throw error;\r\n  }\r\n};\r\n\r\n/**\r\n * Clean up old stealth payments\r\n * @param {string} recipientAddress - The recipient's address\r\n * @returns {Promise<void>}\r\n */\r\nGun.chain.cleanStealthPayments = async function (recipientAddress) {\r\n  try {\r\n    const gun = this;\r\n    const payments = await gun\r\n      .get(\"gun-eth\")\r\n      .get(\"stealth-payments\")\r\n      .get(recipientAddress)\r\n      .map()\r\n      .once()\r\n      .then();\r\n\r\n    // Remove empty or invalid nodes\r\n    if (payments) {\r\n      Object.keys(payments).forEach(async (key) => {\r\n        const payment = payments[key];\r\n        if (\r\n          !payment ||\r\n          !payment.stealthAddress ||\r\n          !payment.senderPublicKey ||\r\n          !payment.spendingPublicKey\r\n        ) {\r\n          await gun\r\n            .get(\"gun-eth\")\r\n            .get(\"stealth-payments\")\r\n            .get(recipientAddress)\r\n            .get(key)\r\n            .put(null);\r\n        }\r\n      });\r\n    }\r\n  } catch (error) {\r\n    console.error(\"Error cleaning stealth payments:\", error);\r\n  }\r\n};\r\n\r\n// =============================================\r\n// EXPORTS\r\n// =============================================\r\n\r\n// Crea una classe GunEth che contiene tutti i metodi e le utility\r\nexport class GunEth {\r\n  // Static utility methods\r\n  static generateRandomId = generateRandomId;\r\n  static generatePassword = generatePassword;\r\n  static gunToEthAccount = gunToEthAccount;\r\n  static getSigner = getSigner;\r\n  static deriveStealthAddress = deriveStealthAddress;\r\n\r\n  // Chain methods\r\n  static chainMethods = {\r\n    setSigner: Gun.chain.setSigner,\r\n    getSigner: Gun.chain.getSigner,\r\n    verifySignature: Gun.chain.verifySignature,\r\n    generatePassword: Gun.chain.generatePassword,\r\n    createSignature: Gun.chain.createSignature,\r\n    createAndStoreEncryptedPair: Gun.chain.createAndStoreEncryptedPair,\r\n    getAndDecryptPair: Gun.chain.getAndDecryptPair,\r\n    proof: Gun.chain.proof,\r\n    gunToEthAccount: Gun.chain.gunToEthAccount,\r\n    generateStealthAddress: Gun.chain.generateStealthAddress,\r\n    publishStealthKeys: Gun.chain.publishStealthKeys,\r\n    recoverStealthFunds: Gun.chain.recoverStealthFunds,\r\n    announceStealthPayment: Gun.chain.announceStealthPayment,\r\n    getStealthPayments: Gun.chain.getStealthPayments,\r\n    cleanStealthPayments: Gun.chain.cleanStealthPayments,\r\n  };\r\n\r\n  // Constants\r\n  static MESSAGE_TO_SIGN = MESSAGE_TO_SIGN;\r\n  static PROOF_CONTRACT_ADDRESS = PROOF_CONTRACT_ADDRESS;\r\n  static LOCAL_CONFIG = LOCAL_CONFIG;\r\n}\r\n"],"names":["USE","arg","req","require","slice","R","mod","path","exports","p","split","toString","replace","MODULE","module","String","random","l","c","s","charAt","Math","floor","length","match","t","o","tmp","u","hash","i","charCodeAt","sT","sI","check","has","Object","prototype","hasOwnProperty","plain","constructor","call","empty","n","k","indexOf","keys","push","setTimeout","setImmediate","f","MessageChannel","port1","onmessage","e","data","q","port2","postMessage","performance","now","Date","hold","poll","turn","T","each","S","L","r","splice","onto","tag","as","to","this","_","next","be","off","the","last","back","on","v","Infinity","State","N","drift","D","NI","is","ify","soul","opt","dup","max","age","id","dt","track","it","was","drop","ed","console","STAT","cb","lack","clearTimeout","err","Gun","$","create","version","chain","toJSON","valid","state","ask","universe","msg","out","at","gun","DBG","text_rand","put","ctx","root","acks","fire","ok","stop","crack","ack","get","uc","ua","nts","NTS","ue","faith","miss","latch","hatch","CT","all","stun","nl","pk","nj","kl","node","states","ni","pop","pd","ERR","cut","key","val","ham","C","graph","vertex","state_is","known","MD","Hf","aid","ph","map","pa","pm","state_ify","end","CF","once","JSON","stringify","window","log","sort","F","gk","go","ram","ga","FOO","g","peers","Array","forEach","url","obj_each","from","uuid","apply","arguments","join","w","GUN","only","yes","link","cat","$$","tat","echo","pass","sat","lex","unlink","change","linked","ev","sub","in","obj_has","via","VIA","seen","$$$","any","lat","rid","cache","jam","eve","super","wait","odd","test","not","a","run","add","v2020","ran","todo","d","ref","walk","name","reverse","up","resolve","noop","eas","act","subs","nix","none","one","neat","set","item","parse","parseAsync","json","sucks","stringifyAsync","mesh","gap","memory","pack","puff","dup_check","dup_track","hear","raw","peer","say","dam","SH","P","m","flush","batch","tail","send","wire","queue","ash","h","hp","leap","yo","near","SI","hd","loop","SMIA","sorta","text","ss","$put","meta","y","way","yh","yr","ps","pl","wr","pid","yp","ST","res","hi","met","bye","time","close","souls","SUBS","Mesh","WebSocket","env","websocket","webkitWebSocket","mozWebSocket","open","doc","document","onclose","reconnect","onerror","onopen","defer","retry","tried","hidden","store","localStorage","setItem","removeItem","getItem","lg","disk","size","prefix","file","DEP","warn","Type","fn","bi","b","Boolean","num","list_is","parseFloat","list","slit","A","B","obj_map","index","obj","boj","del","obj_is","copy","x","ll","lle","ii","getTime","fn_is","Val","text_is","bi_is","num_is","rel","rel_","obj_put","Node","soul_","text_random","obj_del","obj_copy","N_","Graph","nf","obj_empty","arr","shell","concat","prev","invalid","checkType","value","type","types","trim","error","Error","code","argument","async","resolveProperties","Promise","reduce","accum","defineProperties","target","values","defineProperty","enumerable","writable","isArray","Uint8Array","HEX","result","BigInt","isError","isCallException","makeError","message","info","shortMessage","details","TypeError","RangeError","assign","assert","assertArgument","assertArgumentCount","count","expectedCount","_normalizeForms","form","normalize","fromCharCode","assertNormalize","operation","assertPrivate","givenGuard","guard","className","method","_getBytes","offset","parseInt","substring","getBytes","getBytesCopy","isHexString","isBytesLike","HexCharacters","hexlify","bytes","datas","dataLength","dataSlice","start","buffer","zeroPad","left","fill","zeroPadValue","BN_0","BN_1","maxValue","toTwos","_value","_width","getBigInt","width","getNumber","limit","fault","mask","_bits","getUint","bits","Number","isInteger","Nibbles","toBigInt","toBeHex","toBeArray","hex","toQuantity","startsWith","Alphabet","Lookup","getAlpha","letter","BN_58","encodeBase58","EventPayload","filter","emitter","listener","removeListener","ignoreFunc","reason","output","badCodepoint","Utf8ErrorFuncs","freeze","ignore","toUtf8Bytes","str","c2","pair","toUtf8String","onError","codePoints","_bytes","extraLength","overlongMask","j","nextChar","getUtf8CodePoints","codePoint","createGetUrl","options","_signal","cancelled","protocol","toLowerCase","credentials","allowInsecureAuthentication","controller","AbortController","timer","abort","timeout","addListener","init","headers","Headers","body","undefined","signal","resp","fetch","_error","respBody","arrayBuffer","statusCode","status","statusMessage","statusText","defaultGetUrlFunc","reData","RegExp","reIpfs","locked","dataGatewayFunc","FetchResponse","textData","atob","decodeBase64","FetchRequest","getIpfsGatewayFunc","baseUrl","Gateways","ipfs","fetchSignals","WeakMap","FetchCancelSignal","listeners","request","checkSignal","allowInsecure","gzip","bodyType","creds","preflight","process","throttle","getUrlFunc","hasBody","toUpperCase","_data","btoa","encodeBase64","allowGzip","getHeader","setHeader","clearHeaders","Symbol","iterator","done","setCredentials","username","password","preflightFunc","processFunc","retryFunc","slotInterval","maxAttempts","setThrottleParams","params","attempt","expires","delay","_request","_response","makeServerError","clone","scheme","response","assertOk","location","redirect","retryAfter","trunc","pow","stall","cancel","current","lockConfig","getGateway","registerGateway","func","registerGetUrl","getUrl","createGetUrlFunc","createDataGateway","createIpfsGatewayFunc","bodyText","bodyJson","throwThrottleError","requestUrl","responseBody","responseStatus","hexlifyByte","unarrayifyInteger","_decodeChildren","childOffset","decoded","_decode","consumed","checkOffset","lengthLength","decodeRlp","arrayifyInteger","unshift","_encode","object","payload","child","nibbles","encodeRlp","uuidV4","randomBytes","WordSize","Padding","passProperties","_guard","resultNames","getNames","setNames","names","throwError","wrapped","toObject","items","deep","Result","getValue","args","wrap","nameCounts","Map","proxy","Proxy","prop","receiver","Reflect","Function","toArray","_names","callback","thisArg","fromItems","Coder","localName","dynamic","_throwError","Writer","writeData","appendWriter","writer","writeBytes","paddingOffset","writeValue","writeUpdatableValue","Reader","allowLoose","bytesRead","parent","maxInflation","incrementBytesRead","peekBytes","loose","alignedLength","ceil","subReader","reader","readBytes","readValue","readIndex","number","isSafeInteger","lengths","includes","outputLen","blockLen","exists","instance","checkFinished","destroyed","finished","min","crypto","globalThis","u8a","u32","Uint32Array","byteOffset","byteLength","createView","DataView","rotr","word","shift","nextTick","asyncLoop","iters","tick","ts","diff","toBytes","TextEncoder","encode","utf8ToBytes","Hash","_cloneInto","toStr","checkOpts","defaults","opts","wrapConstructor","hashCons","hashC","update","digest","bytesLength","getRandomValues","HMAC","_key","assertHash","iHash","pad","oHash","buf","assertExists","digestInto","assertBytes","destroy","getPrototypeOf","hmac","pbkdf2Init","_password","_salt","_opts","dkLen","asyncTick","assertNumber","salt","DK","PRF","PRFSalt","pbkdf2","prfW","view","ti","pos","Ti","subarray","setInt32","ui","pbkdf2Output","SHA2","padOffset","isLE","len","take","dataView","roundClean","setBigUint64","_32n","_u32_max","wh","wl","setUint32","oview","outLen","Chi","Maj","SHA256_K","IV","SHA256_W","SHA256","E","G","H","getUint32","W15","W2","s0","s1","T1","T2","sha256","U32_MASK64","fromBig","le","lst","Ah","Al","rotlSH","rotlSL","rotlBH","rotlBL","u64$1","toBig","shrSH","_l","shrSL","rotrSH","rotrSL","rotrBH","rotrBL","rotr32H","_h","rotr32L","Bh","Bl","add3L","Cl","add3H","low","Ch","add4L","Dl","add4H","Dh","add5H","Eh","add5L","El","SHA512_Kh","SHA512_Kl","u64","SHA512_W_H","SHA512_W_L","SHA512","Fh","Fl","Gh","Gl","Hh","Hl","W15h","W15l","s0h","s0l","W2h","W2l","s1h","s1l","SUMl","SUMh","sigma1h","sigma1l","CHIh","CHIl","T1ll","T1h","T1l","sigma0h","sigma0l","MAJh","MAJl","All","sha512","anyGlobal","self","global","getGlobal","msCrypto","_computeHmac","algorithm","_algo","algo","createHmac","__computeHmac","computeHmac","lock","register","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","_0n","_1n","_2n","_7n","_256n","_0x71n","round","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlL","Keccak","suffix","enableXOF","rounds","posOut","state32","keccak","idx1","idx0","B0","B1","Th","Tl","curH","curL","PI","keccakP","finish","writeInto","bufferOut","xofInto","xof","keccak_256","gen","_keccak256","__keccak256","keccak256","Rho","Id","idxL","idxR","shifts","shiftsL","idx","shiftsR","Kl","Kr","rotl","group","z","BUF","RIPEMD160","h0","h1","h2","h3","h4","al","ar","bl","br","cl","cr","dl","dr","el","er","rGroup","hbl","hbr","rl","rr","sl","sr","tl","tr","ripemd160","_ripemd160","noble_ripemd160","__ripemd160","_pbkdf2","iterations","keylen","pbkdf2Sync","__pbkdf2","_randomBytes","crypto_random","__randomBytes","XorAndSalsa","pi","input","oi","y00","y01","y02","y03","y04","y05","y06","y07","y08","y09","y10","y11","y12","y13","y14","y15","x00","x01","x02","x03","x04","x05","x06","x07","x08","x09","x10","x11","x12","x13","x14","x15","BlockMix","head","scryptInit","maxmem","onProgress","blockSize","blockSize32","memUsed","B32","V","blockMixCb","totalBlockMix","callbackPer","blockMixCnt","scryptOutput","lockedSync","lockedAsync","_scryptAsync","passwd","Pi","_nobleAsync","_scryptSync","_nobleSync","__scryptAsync","__scryptSync","scrypt","_passwd","progress","scryptSync","_sha256","createHash","__sha256","locked256","hexes","padStart","bytesToHex","numberToHexUnpadded","hexToNumber","hexToBytes","array","hexByte","byte","isNaN","bytesToNumberBE","bytesToNumberLE","numberToBytesBE","numberToBytesLE","ensureBytes","title","expectedLength","concatBytes","arrays","sum","bitMask","u8n","u8fr","createHmacDrbg","hashLen","qByteLen","hmacFn","reset","reseed","seed","pred","validatorFns","bigint","function","boolean","string","stringOrUint8Array","field","Fp","isValid","validateObject","validators","optValidators","checkField","fieldName","isOptional","checkVal","entries","b1","b2","_3n","_4n","_5n","_8n","power","modulo","pow2","invert","FpSqrt","p1div4","eql","sqr","c1","n2","mul","nv","ONE","legendreC","Q","Z","Q1div2","neg","ZERO","t2","ge","tonelliShanks","FIELD_FIELDS","nLength","nBitLength","_nBitLength","nByteLength","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","validateBasic","curve","ORDER","MASK","BYTES","BITS","validateField","Gx","Gy","b2n","h2b","ut","DER","Err","_parseInt","toSig","sBytes","rBytesLeft","hexFromSig","sig","shl","rhl","weierstrassPoints","CURVE","ut.validateObject","allowedPrivateKeyLengths","wrapPrivateKey","isTorsionFree","clearCofactor","allowInfinityPoint","fromBytes","endo","beta","splitScalar","validatePointOpts","_c","point","_isCompressed","toAffine","ut.concatBytes","weierstrassEquation","x2","x3","isWithinCurveOrder","assertGE","normPrivateKeyToScalar","ut.bytesToHex","ut.bytesToNumberBE","mod.mod","pointPrecomputes","assertPrjPoint","other","Point","px","py","pz","fromAffine","is0","normalizeZ","points","toInv","invertBatch","fromHex","assertValidity","fromPrivateKey","privateKey","BASE","multiply","_setWindowSize","windowSize","_WINDOW_SIZE","delete","right","hasEvenY","isOdd","equals","X1","Y1","Z1","X2","Y2","Z2","U1","U2","negate","double","b3","X3","Y3","Z3","t0","t1","t3","t4","t5","subtract","wNAF","wnaf","wNAFCached","comp","multiplyUnsafe","I","unsafeLadder","k1neg","k1","k2neg","k2","k1p","k2p","scalar","fake","f1p","f2p","constTimeNegate","multiplyAndAddUnsafe","iz","inv","ax","ay","zz","cofactor","toRawBytes","isCompressed","toHex","condition","W","windows","elm","precomputeWindow","base","precomputes","maxNumber","shiftBy","wbits","offset1","offset2","abs","cond1","cond2","precomputesMap","transform","ProjectivePoint","weierstrass","curveDef","bits2int","bits2int_modN","lowS","validateOpts","CURVE_ORDER","compressedLen","uncompressedLen","modN","invN","mod.invert","y2","sqrt","numToNByteStr","ut.numberToBytesBE","isBiggerThanHalfOrder","slcNum","Signature","recovery","fromCompact","fromDER","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","u1","u2","hasHighS","normalizeS","toDERRawBytes","ut.hexToBytes","toDERHex","toCompactRawBytes","toCompactHex","utils","isValidPrivateKey","randomPrivateKey","mod.getMinHashLength","fieldLen","minLen","reduced","mod.mapHashToField","precompute","isProbPub","delta","ORDER_MASK","ut.bitMask","int2octets","prepSig","defaultSigOpts","some","prehash","extraEntropy","ent","h1int","seedArgs","k2sig","kBytes","ik","normS","defaultVerOpts","getPublicKey","getSharedSecret","privateA","publicB","sign","privKey","ut.createHmacDrbg","drbg","verify","signature","publicKey","sg","_sig","derError","getHash","msgs","secp256k1P","secp256k1N","divNearest","bitLen","redef","sqrtP","lhs","rhs","FpPow","div","sqrN","addN","subN","mulN","nums","lastMultiplied","acc","inverted","reduceRight","FpInvertBatch","cmov","Field","_6n","_11n","_22n","_23n","_44n","_88n","b6","b9","b11","b22","b44","b88","b176","b220","b223","secp256k1","defHash","createCurve","a1","a2","POW_2_128","ZeroAddress","ZeroHash","BN_2","BN_27","BN_28","BN_35","toUint256","networkV","legacyChainId","getChainId","yParity","yParityAndS","compactSerialized","serialized","for","_type","bv","getChainIdV","chainId","getNormalizedV","assertError","_r","_v","SigningKey","computePublicKey","compressedPublicKey","computeSharedSecret","pubKey","compressed","pub","secpSig","addPoints","p0","p1","pub0","pub1","BN_36","getChecksumAddress","address","chars","expanded","hashed","ibanLookup","Base36","getAddress","block","checksum","ibanChecksum","fromBase36","isAddressable","checkAddress","promise","resolveAddress","resolver","resolveName","_gaurd","signed","Typed","_typedSymbol","gaurd","format","defaultValue","minValue","isBigInt","isData","isString","tupleName","arrayLength","uint8","uint16","uint24","uint32","uint40","uint48","uint56","uint64","uint72","uint80","uint88","uint96","uint104","uint112","uint120","uint128","uint136","uint144","uint152","uint160","uint168","uint176","uint184","uint192","uint200","uint208","uint216","uint224","uint232","uint240","uint248","uint256","uint","int8","int16","int24","int32","int40","int48","int56","int64","int72","int80","int88","int96","int104","int112","int120","int128","int136","int144","int152","int160","int168","int176","int184","int192","int200","int208","int216","int224","int232","int240","int248","int256","int","bytes1","bytes2","bytes3","bytes4","bytes5","bytes6","bytes7","bytes8","bytes9","bytes10","bytes11","bytes12","bytes13","bytes14","bytes15","bytes16","bytes17","bytes18","bytes19","bytes20","bytes21","bytes22","bytes23","bytes24","bytes25","bytes26","bytes27","bytes28","bytes29","bytes30","bytes31","bytes32","bool","tuple","overrides","isTyped","dereference","AddressCoder","decode","AnonymousCoder","coder","coders","arrayValues","unique","staticWriter","dynamicWriter","updateFuncs","dynamicOffset","updateFunc","baseOffset","unpack","baseReader","offsetReader","baseType","ArrayCoder","defaultChild","BooleanCoder","DynamicBytesCoder","BytesCoder","FixedBytesCoder","Empty","NullCoder","BN_MAX_UINT256","NumberCoder","maxUintValue","bounds","fromTwos","StringCoder","TupleCoder","uniqueNames","FENCED","read_compressed_payload","read_payload","u16","symbol_count","total","skip","pos_payload","read_width","read_buffer","read_bit","FULL","HALF","QRTR","symbols","range","mid","decode_arithmetic","lookup","ret","carry","unsafe_atob","read_deltas","read_sorted","read_sorted_arrays","read_array_while","read_mapped","read_linear_table","read_replacement_table","flat","read_transposed","dx","dy","vN","flatMap","ys","j_dy","quote_cp","cp","hex_cp","str_from_cps","cps","fromCodePoint","compare_arrays","S0","L0","V0","T0","T_COUNT","N_COUNT","V_COUNT","unpack_cc","packed","unpack_cp","SHIFTED_RANK","EXCLUSIONS","DECOMP","RECOMP","is_hangul","compose_pair","recomp","decomposed","Set","bucket","init$1","check_order","cc","s_index","v_index","t_index","mapped","prev_cc","nfd","nfc","stack","prev_cp","composed","composed_from_decomposed","STOP_CH","Array_from","group_has_cp","Emoji","is_emoji","MAPPED","IGNORED","CM","NSM","ESCAPE","GROUPS","WHOLE_VALID","WHOLE_MAP","VALID","EMOJI_LIST","EMOJI_ROOT","read_sorted_array","read_sorted_set","set_add_many","chunks","unrestricted","read_chunked","M","wholes","recs","gs","find","union","complement","multi","add_to_union","sorted","expand","saved","read_trie","quoted_cp","should_escape","bidi_qq","safe_str_from_cps","quoter","ens_normalize","flatten","ef","label","codePointAt","explode_cp","tokens","emoji","consume_emoji_reversed","error_disallowed","tokens_from_str","token_count","norm","lastIndexOf","check_leading_underscore","every","check_label_extension","error_placement","check_fenced","groups","error_group_member","determine_group","check_group","maker","shared","whole","check_whole","filter_fe0f","quoted","gg","where","eaten","Zeros","checkComponent","ensNameSplit","ensNormalize","comps","namehash","dnsEncode","_maxLength","accessSetify","addr","storageKeys","storageKey","accessListify","localeCompare","computeAddress","pubkey","recoverAddress","BN_MAX_UINT","BLOB_SIZE","getVersionedHash","versioned","handleAddress","handleAccessList","param","handleNumber","handleUint","formatNumber","formatAccessList","formatHashes","_parseEipSignature","tx","fields","Transaction","nonce","gasLimit","gasPrice","maxPriorityFeePerGas","maxFeePerGas","accessList","maxFeePerBlobGas","blobVersionedHashes","kzg","blobs","typeName","_blobs","versionedHashes","blob","padded","commit","blobToKzgCommitment","proof","computeBlobKzgProof","commitment","getSerialized","unsignedHash","unsignedSerialized","fromPublicKey","isSigned","sidecar","inferType","legacy","_serializeLegacy","_serializeEip2930","_serializeEip1559","_serializeEip4844","inferTypes","hasGasPrice","hasFee","hasAccessList","hasBlob","isLegacy","isBerlin","isLondon","isCancun","_parseLegacy","_parseEip2930","_parseEip1559","fBlobs","fCommits","fProofs","_parseEip4844","hashMessage","padding","BN__1","hexTrue","hexFalse","domainFieldTypes","verifyingContract","domainFieldNames","checkString","domainChecks","getBaseEncoder","boundsUpper","boundsLower","hexPadRight","encodeType","splitArray","TypedDataEncoder","primaryType","fullTypes","encoderCache","_types","links","parents","subtypes","primaryTypes","checkCircular","found","subtype","st","getEncoder","encoder","subEncoder","encodedType","encodeData","hashStruct","_visit","visit","getPrimaryType","hashDomain","domain","domainFields","EIP712Domain","resolveNames","ensCache","getPayload","domainValues","domainTypes","typesWithDomain","setify","KwVisibDeploy","_kwVisib","KwVisib","_kwTypes","KwTypes","_kwModifiers","KwModifiers","Keywords","SimpleTokens","regexWhitespacePrefix","regexNumberPrefix","regexIdPrefix","regexId","regexType","TokenString","subTokenString","linkBack","linkNext","popKeyword","allowed","top","peek","popType","popParen","popParams","peekKeyword","peekType","token","brackets","commas","cur","depth","allowSingle","included","consumeName","keyword","consumeKeywords","keywords","consumeMutability","modifiers","consumeParams","allowIndexed","ParamType","consumeGas","consumeEoi","regexArrayType","verifyBasicType","internal","ParamTypeInternal","ErrorFragmentInternal","EventFragmentInternal","ConstructorFragmentInternal","FallbackFragmentInternal","FunctionFragmentInternal","StructFragmentInternal","indexed","components","arrayChildren","isTuple","isIndexable","_this","walkAsync","promises","setValue","childType","then","isParamType","bracket","arrayMatch","Fragment","inputs","ConstructorFragment","ErrorFragment","EventFragment","FallbackFragment","FunctionFragment","StructFragment","isConstructor","isFragment","isEvent","isFunction","isStruct","NamedFragment","joinParams","selector","anonymous","topicHash","getTopicHash","payable","gas","stateMutability","errorObj","mutability","outputs","constant","getSelector","PanicReasons","paramTypeBytes","paramTypeNumber","defaultCoder","defaultMaxInflation","AbiCoder","getCoder","getDefaultValue","_setDefaultMaxInflation","defaultAbiCoder","getBuiltinCallException","action","abiCoder","revert","transaction","invocation","LogDescription","fragment","topic","TransactionDescription","ErrorDescription","Indexed","_isIndexed","isIndexed","BuiltinErrors","Interface","fragments","deploy","fallback","receive","errors","events","functions","abi","frags","getAbiCoder","minimal","formatJson","getFunction","forceUnique","matching","lastValue","valueLength","allowOptions","lastArg","getFunctionName","hasFunction","forEachFunction","getEvent","eventTopic","getEventName","hasEvent","forEachEvent","getError","forEachError","_decodeParams","_encodeParams","encodeDeploy","decodeErrorResult","encodeErrorResult","decodeFunctionData","encodeFunctionData","decodeFunctionResult","parsed","parseTransaction","encodeFunctionResult","encodeFilterTopics","topics","encodeTopic","encodeEventLog","dataTypes","dataValues","decodeEventLog","nonIndexed","resultIndexed","resultNonIndexed","nonIndexedIndex","indexedIndex","parseCallResult","parseLog","parseError","hexData","toJson","FeeData","copyRequest","bigIntKeys","numberKeys","blockTag","enableCcipRead","customData","Block","provider","timestamp","parentHash","parentBeaconBlockRoot","difficulty","gasUsed","stateRoot","receiptsRoot","blobGasUsed","excessBlobGas","miner","prevRandao","extraData","baseFeePerGas","transactions","TransactionResponse","prefetchedTransactions","txs","date","getTransaction","indexOrHash","getPrefetchedTransaction","isMined","orphanedEvent","orphan","Log","transactionHash","blockHash","blockNumber","removed","transactionIndex","getBlock","getTransactionReceipt","receipt","removedEvent","TransactionReceipt","contractAddress","logsBloom","cumulativeGasUsed","blobGasPrice","logs","effectiveGasPrice","fee","getResult","getTransactionResult","confirmations","getBlockNumber","createRemovedTransactionFilter","reorderedEvent","createReorderedTransactionFilter","startBlock","_confirms","_timeout","confirms","nextScan","stopScanning","checkReplacement","getTransactionCount","mined","replacement","replaceableTransaction","checkReceipt","waiter","reject","cancellers","txListener","replaceListener","EventLog","interface","iface","eventName","eventSignature","UndecodedEventLog","ContractTransactionReceipt","ContractTransactionResponse","ContractUnknownEventPayload","contract","ContractEventPayload","_log","canCall","canEstimate","canResolve","canSend","getResolver","PreparedTopicFilter","runner","getRunner","resolvedArgs","getTopicFilter","feature","getProvider","copyOverrides","_overrides","buildWrappedFallback","populateTransaction","noValue","noData","sendTransaction","_contract","estimateGas","staticCall","buildWrappedMethod","getFragment","_runner","resolveArgs","staticCallResult","configurable","internalValues","getInternal","getSubInfo","event","topicHashify","hasSub","getSub","foundFragment","_foundFragment","emit","starting","started","lastEmit","payloadFunc","resultPromise","passArgs","_emit","BaseContract","filters","_deployTx","addrPromise","deployTx","connect","attach","getDeployedCode","getCode","waitForDeployment","deploymentTransaction","checkCode","buildWrappedEvent","queryTransaction","queryFilter","fromBlock","toBlock","getLogs","listenerCount","removeAllListeners","buildClass","Contract$1","_ContractBase","getIpfsLink","MulticoinProviderPlugin","proivder","supportsCoinType","coinType","encodeAddress","decodeAddress","matcherIpfs","matchers","EnsResolver","supports2544","Contract","supportsWildcard","supportsInterface","funcName","ethCoinType","coinPlugin","plugin","plugins","getText","getContentHash","swarm","getAvatar","_getAvatar","linkage","avatar","owner","tokenId","tokenOwner","ownerOf","balance","balanceOf","metadataUrl","metadata","imageUrl","image","getEnsAddress","network","getNetwork","ensPlugin","getPlugin","ensAddr","fromName","currentName","allowNull","nullValue","arrayOf","altNames","srcKey","altKey","formatData","formatHash","_formatLog","_formatBlock","_formatReceiptLog","_formatTransactionReceipt","formatTransactionResponse","creates","nonceHex","getCreateAddress","NetworkPlugin","GasCostPlugin","effectiveBlock","txBase","txCreate","txDataZero","txDataNonzero","txAccessListStorageKey","txAccessListAddress","costs","props","nullish","EnsPlugin","targetNetwork","FetchUrlFeeDataNetworkPlugin","Networks","Network","matches","attachPlugin","getPlugins","basename","computeIntrinsicGas","injected","registerEth","ensNetwork","getGasStationPlugin","injectCommonNetworks","networkFunc","custom","ensAddress","nameOrChainId","existing","parseUnits","decimals","frac","fetchFeeData","_feeData","standard","maxFee","maxPriorityFee","PollingBlockSubscriber","poller","interval","pollingInterval","_setTimeout","bind","_clearTimeout","pause","dropWhilePaused","resume","OnBlockSubscriber","running","_poll","PollingBlockTagSubscriber","lastBlock","PollingOrphanSubscriber","PollingTransactionSubscriber","PollingEventSubscriber","isPromise","getTag","UnmanagedSubscriber","concisify","getSubscription","_event","addresses","addAddress","defaultOptions","cacheTimeout","AbstractProvider","pausedState","networkPromise","anyNetwork","performCache","lastBlockNumber","nextTimer","timers","disableCcipRead","_network","perform","_perform","ccipReadFetch","calldata","urls","sender","errorMessages","href","errorMessage","_wrapBlock","formatBlock","_wrapLog","formatLog","_wrapTransactionReceipt","formatTransactionReceipt","_wrapTransactionResponse","_detectNetwork","_getAddress","_getBlockTag","_getFilter","_address","_getTransactionRequest","detectNetwork","expected","actual","getFeeData","getFeeDataFunc","_block","priorityFee","feeData","_tx","txSender","ccipArgs","errorArgs","zeros","urlsOffset","urlsLength","urlsData","_parseString","_parseBytes","parseOffchainLookup","ccipResult","encodeBytes","checkNetwork","getAccountValue","_blockTag","getBalance","getStorage","_position","position","broadcastTransaction","signedTx","signedTransaction","includeTransactions","prefetchTxs","_filter","_getProvider","lookupAddress","ensContract","resolverContract","waitForTransaction","waitForBlock","timerId","_func","paused","_forEachSubscriber","subscriber","_getSubscriber","_recoverSubscriber","oldSub","newSub","emitArgs","subscription","addressableMap","nameMap","numPad","bytesPad","byteCount","checkProvider","signer","populate","AbstractSigner","getNonce","populateCall","hasEip1559","txObj","signTransaction","VoidSigner","throwUnsupported","signMessage","signTypedData","FilterIdSubscriber","filterIdPromise","hault","_subscribe","_emitResults","_recover","filterId","teardown","FilterIdEventSubscriber","results","FilterIdPendingSubscriber","Primitive","deepCopy","duration","getLowerCase","isPollable","polling","staticNetwork","batchStallTime","batchMaxSize","batchMaxCount","JsonRpcSigner","sendUncheckedTransaction","_from","_to","hexTx","getRpcTransaction","timeouts","invalids","checkTx","sendTransactionHash","_message","populated","unlock","_legacySignMessage","JsonRpcApiProvider","nextId","payloads","drainTimer","notReady","pendingDetectNetwork","scheduleDrain","stallTime","_getOption","_send","getRpcError","_resolve","getRpcRequest","ready","jsonrpc","_start","_waitUntilReady","dstKey","spelunkData","_spelunkMessage","spelunkMessage","eth_sign","personal_sign","eth_signTypedData_v4","eth_signTransaction","eth_sendTransaction","eth_requestAccounts","wallet_requestAccounts","unsupported","getSigner","accountsPromise","accounts","account","listAccounts","JsonRpcApiPollingProvider","JsonRpcProvider","_getConnection","BrowserProvider","ethereum","_options","hasSigner","BaseWallet","signingKey","btx","signMessageSync","subsChrs","Word","unfold","words","sep","initial","decodeOwl","clumps","leftover","semi","Wordlist","locale","phrase","WordlistOwl","_decodeWords","loadWords","getWord","getWordIndex","wordlist","LangEn","getUpperMask","mnemonicToEntropy","mnemonic","entropy","bit","entropyBits","checksumMask","entropyToMnemonic","indices","remainingBits","checksumBits","Mnemonic","computeSeed","fromPhrase","fromEntropy","_entropy","entropyToPhrase","phraseToEntropy","isValidMnemonic","_AES_key","_AES_Kd","_AES_Ke","__classPrivateFieldGet","kind","__classPrivateFieldSet","numberOfRounds","rcon","Si","T3","T4","T5","T6","T7","T8","U3","U4","convertToInt32","AES","roundKeyCount","KC","tk","tt","rconpointer","encrypt","plaintext","decrypt","ciphertext","ModeOfOperation","cls","aes","_CBC_iv","_CBC_lastBlock","CBC","iv","_CTR_remaining","_CTR_remainingIndex","_CTR_counter","CTR","initialValue","setCounterValue","setCounterBytes","counter","MAX_SAFE_INTEGER","increment","_a","_b","crypttext","looseArrayify","hexString","zpad","getPassword","spelunk","_path","reqd","defaultPath","isKeystoreJson","getAccount","mnemonicKey","mnemonicCiphertext","mnemonicIv","mnemonicAesCtr","getDecryptKdfParams","kdf","prf","getEncryptKdfParams","_encryptKeystore","uuidRandom","derivedKey","macPrefix","mac","Crypto","cipher","cipherparams","kdfparams","dklen","client","gethFilename","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","mnemonicCounter","encryptKeystoreJsonSync","passwordBytes","encryptKeystoreJson","progressCallback","MasterSecret","HardenedBit","encodeBase58Check","ser_I","chainCode","IL","IR","derivePath","component","deriveChild","HDNodeWallet","fingerprint","parentFingerprint","encryptSync","extendedKey","hasPath","neuter","HDNodeVoidWallet","_index","ki","fromSeed","_seed","fromExtendedKey","decodeBase58","createRandom","fromMnemonic","Ki","isCrowdsaleJson","encseed","decryptCrowdsaleJson","encryptedSeed","padder","pkcs7Strip","seedHex","Wallet","fromAccount","wallet","fromEncryptedJson","decryptKeystoreJson","fromEncryptedJsonSync","decryptKeystoreJsonSync","contractAddresses","PROOF_OF_INTEGRITY_ADDRESS","STEALTH_ANNOUNCER_ADDRESS","fileURLToPath","require$$0","dirname","require$$1","readFileSync","require$$2","__filename","rawdata","LOCAL_CONFIG","CHAIN_ID","RPC_URL","GUN_PEER","CHAIN_CONFIG","optimismSepolia","arbitrumSepolia","localhost","getAddressesForChain","chainName","config","STEALTH_ANNOUNCER_ABI","internalType","PROOF_OF_INTEGRITY_ABI","SEA","host","hostname","Buffer","SeaArray","enc","SafeBuffer","Uint16Array","dec","ArrayBuffer","alloc","allocUnsafe","api","rej","subtle","webkitSubtle","TextDecoder","WebCrypto","ossl","directory","shim","iter","ks","namedCurve","jwk","kty","crv","ext","key_ops","keyBytes","alg","validity","hook","__shim","sha","work","epub","rsha","importKey","deriveBits","throw","ecdhSubtle","sa","generateKey","priv","exportKey","dh","epriv","what","how","why","slow_leak","fall_verify","knownKeys","O","fall_soul","fall_key","fall_val","fall_state","sha256hash","combo","jwkKey","keyToJwk","aeskey","rand","ct","bufiv","bufct","tagLength","secret","pubKeyData","keysToEcdhJwk","public","privKeyData","derivedBits","rawBits","certify","certificants","policy","authority","certificant","expiry","readPolicy","read","writePolicy","write","blacklist","ban","readBlock","writeBlock","rb","wb","keyid","pb","sha1","sha1hash","User","user","alias","ing","pubs","already","leave","sea","auth","ek","sS","sessionStorage","recall","obj_ify","tries","half","lol","upt","shuffle","remember","DANGER","alive","gunRoot","authRecall","trust","theirPubkey","grant","sec","no","own","hexStr","base64","hexToBase64","link_is","certificate","cert","secure","pubcut","stringy","fl","shuffle_attack","PROOF_CONTRACT_ADDRESS","initNodeEnvironment","readFile","import","__dirname","generateRandomId","ethers.hexlify","ethers.randomBytes","generatePassword","ethers.keccak256","ethers.toUtf8Bytes","gunToEthAccount","gunPrivateKey","hexPrivateKey","base64url","repeat","binary","char","base64UrlToHex","ethers.Wallet","rpcUrl","ethers.JsonRpcProvider","ethers.BrowserProvider","deriveStealthAddress","sharedSecret","spendingPublicKey","sharedSecretBytes","stealthPrivateKey","ethers.concat","stealthWallet","sharedSecretHex","stealthAddress","MESSAGE_TO_SIGN","setSigner","newRpcUrl","newPrivateKey","verifySignature","recoveredAddress","ethers.verifyMessage","createSignature","createAndStoreEncryptedPair","v_pair","s_pair","encryptedPair","encryptedV_pair","encryptedS_pair","viewingAccount","spendingAccount","publicKeys","viewingPublicKey","ethViewingAddress","getAndDecryptPair","encryptedData","decryptedPair","nodeId","targetChain","NODE_ENV","chainConfig","ethers.Contract","verifyOnChain","contentHash","updater","verifyData","writeOnChain","updateData","getLatestRecord","existingData","_contentHash","latestRecord","newNodeId","txHash","generateStealthAddress","recipientAddress","recipientData","senderAddress","senderData","spendingKeyPair","decryptedData","senderPublicKey","publishStealthKeys","viewingKeyPair","recoverStealthFunds","myAddress","decryptedViewingData","recovered","announceStealthPayment","onChain","devFee","announcePayment","getStealthPayments","source","payments","totalAnnouncements","getAnnouncementsCount","totalCount","batchSize","lastIndex","toIndex","getAnnouncementsInRange","announcement","recoveredWallet","offChainPayments","payment","cleanStealthPayments","GunEth","static"],"mappings":"syBAAE,WAGA,SAASA,EAAIC,EAAKC,GAChB,OAAOA,EAAKC,EAAQF,GAAOA,EAAIG,MAAOJ,EAAIK,EAAEJ,IAAQ,SAASK,EAAKC,GAChEN,EAAIK,EAAM,CAACE,QAAS,CAAA,IACpBR,EAAIK,EAAEE,IAASD,EAAIE,OACzB,EACI,SAASH,EAAEI,GACT,OAAOA,EAAEC,MAAM,KAAKN,OAAO,GAAGO,WAAWC,QAAQ,MAAM,GAC7D,CACA,CACqC,IAAIC,EAASC,EAGhDd,GAAI,SAASc,GAEbC,OAAOC,OAAS,SAASC,EAAGC,GAC3B,IAAIC,EAAI,GAGR,IAFAF,EAAIA,GAAK,GACTC,EAAIA,GAAK,gEACHD,KAAM,GAAIE,GAAKD,EAAEE,OAAOC,KAAKC,MAAMD,KAAKL,SAAWE,EAAEK,SAC3D,OAAOJ,CACV,EACEJ,OAAOS,MAAQ,SAASC,EAAGC,GAAI,IAAIC,EAAKC,EACvC,MAAG,iBAAoBH,IACpB,iBAAmBC,IAAIA,EAAI,CAAC,IAAKA,IAGjCD,KADHE,GADAD,EAAIA,GAAK,IACA,MAAQA,EAAE,MAAQA,EAAE,MAAQA,EAAE,OAEpCE,IAAMF,EAAE,OACXC,EAAOD,EAAE,MAAQA,EAAE,KAChBD,EAAErB,MAAM,GAAIuB,GAAK,IAAIJ,UAAYI,GACjCC,IAAMF,EAAE,OACRE,IAAMF,EAAE,MAAQE,IAAMF,EAAE,KAClBD,GAAKC,EAAE,MAAQD,GAAKC,EAAE,KAE5BE,IAAMF,EAAE,MAAQD,GAAKC,EAAE,MACvBE,IAAMF,EAAE,MAAQD,GAAKC,EAAE,OAE7B,EACEX,OAAOc,KAAO,SAASV,EAAGD,GACzB,GAAgB,iBAANC,EAAV,CAEE,GADAD,EAAIA,GAAK,GACLC,EAAEI,OAAS,OAAOL,EACtB,IAAI,IAAIY,EAAE,EAAEb,EAAEE,EAAEI,OAAUO,EAAEb,IAAKa,EAE/BZ,GAAMA,GAAG,GAAGA,EADRC,EAAEY,WAAWD,GAEjBZ,GAAK,EAEP,OAAOA,CARwB,CASpC,EACE,IAYKU,EAAGI,EAAiBf,EAAOC,EAC7Be,EAIIC,EAjBHC,EAAMC,OAAOC,UAAUC,eAC3BF,OAAOG,MAAQ,SAASb,GAAI,QAAOA,IAAIA,aAAaU,QAAUV,EAAEc,cAAgBJ,QAAgF,WAArEA,OAAOC,UAAU1B,SAAS8B,KAAKf,GAAGF,MAAM,sBAAsB,GAAuB,EAChLY,OAAOM,MAAQ,SAAShB,EAAGiB,GAC1B,IAAI,IAAIC,KAAKlB,EAAI,GAAGS,EAAIM,KAAKf,EAAGkB,MAAQD,IAAM,GAAGA,EAAEE,QAAQD,IAAM,OAAO,EACxE,OAAO,CACV,EACER,OAAOU,KAAOV,OAAOU,MAAQ,SAASpB,GACrC,IAAIT,EAAI,GACR,IAAI,IAAI2B,KAAKlB,EAAOS,EAAIM,KAAKf,EAAGkB,IAAK3B,EAAE8B,KAAKH,GAC5C,OAAO3B,CACV,EAEUe,EAAKgB,WAAY/B,EAAI,EAAGC,EAAI,EACjCe,SAAagB,cAAiB,GAAGrB,GAAKqB,cAAkB,SAAS/B,EAAEgC,GACpE,cAAUC,gBAAkB,GAAGvB,EAAWI,IACzCd,EAAI,IAAIiC,gBAAkBC,MAAMC,UAAY,SAASC,GAAI,IAAIA,EAAEC,MAAQL,GAAG,EACpE,SAASM,GAAIN,EAAEM,EAAEtC,EAAEuC,MAAMC,YAAY,GAAG,EAC/C,CAJyD,GAIpDxB,EAAQF,EAAGE,MAAQF,EAAGE,cAAiByB,aAAgB,GAAG/B,GAAK+B,aAClE,CAACC,IAAK,WAAY,OAAQ,IAAIC,IAAM,GACvC7B,EAAG8B,KAAO9B,EAAG8B,MAAQ,EACrB9B,EAAG+B,KAAO/B,EAAG+B,MAAQ,SAASb,GACzBlB,EAAG8B,MAAS5B,EAAM0B,MAAQ3C,GAAOC,IAAM,KAAOgC,IAClDjB,GAAG,WAAYhB,EAAIiB,EAAM0B,MAAOV,GAAG,GAAGhC,EAAE,EAC5C,EAEI,WACD,IACoCgC,EADhClB,EAAKgB,WAAYvB,EAAIO,EAAGgC,KAAOhC,EAAGgC,MAAQ,SAASd,GAAI,GAAK/B,EAAE4B,KAAKG,IAAMzC,EAAEwD,EAAE,EAC/E9C,EAAIM,EAAEN,EAAI,GAAIV,EAAIuB,EAAG+B,KAAMjC,EAAI,EAAMmC,EAAI,YACvCf,EAAI/B,EAAEW,OAAOoB,IACbpB,GAAKX,EAAEI,QAAU,IAAMO,IACzBX,EAAIM,EAAEN,EAAIA,EAAEf,MAAM0B,GAClBA,EAAI,GAEFX,EAAEI,QAASd,EAAEwD,EACpB,CACA,CAVG,GAWC,WACD,IAAIrC,EAAGI,EAAKgB,WAAYiB,EAAIjC,EAAGgC,MAC9BhC,EAAGkC,KAAOlC,EAAGkC,MAAQ,SAASjD,EAAEiC,EAAEI,EAAEa,GAAIA,EAAIA,GAAK,EAAI,SAAS1C,EAAEN,EAAEiD,EAAEC,GACnE,GAAGD,GAAKjD,GAAKF,GAAG,IAAIqD,OAAO,EAAEH,IAAI5C,OAAO,CACvC,IAAI,IAAIO,EAAI,EAAGA,EAAIsC,GACfxC,KAAOyC,EAAInB,EAAE/B,EAAEW,KADGA,KAGtB,GAAGF,IAAMyC,EAAU,YAANJ,EAAExC,EACrB,CAAO6B,GAAKA,EAAEe,GAN0C,EAOjD,IACP,CAVG,EAWH,GApFErE,CAoFEA,EAAK,UAEPA,GAAI,SAASc,GAEbA,EAAON,QAAU,SAAS+D,EAAKC,EAAKvE,EAAKwE,GACxC,IAAID,EAAM,MAAO,CAACE,GAAIH,GACtB,IAAOrB,EAAI,mBAAqBjD,EAAKuE,GAAOG,KAAKH,MAAQG,KAAKH,IAAM,CAAE,IAAGA,IAAQtB,IAChFyB,KAAKH,IAAIA,GAAO,CAACA,IAAKA,EAAKE,GAAIH,EAAKK,EAAI,CAAEC,KAAM,SAAS5E,GAAM,IAAI0B,GAC/DA,EAAMgD,KAAKD,KAAK/C,EAAIkD,KAAK5E,EAC7B,KACD,GAAGiD,EAAE,CACJ,IAAI4B,EAAK,CACRC,IAAKR,EAAKQ,MACTR,EAAKQ,IAAM,WACX,GAAGJ,KAAKE,OAASN,EAAKK,EAAEC,KAAO,OAAO,EACnCF,OAASA,KAAKK,IAAIC,OACpBN,KAAKK,IAAIC,KAAON,KAAKO,MAEtBP,KAAKD,GAAGQ,KAAOP,KAAKO,KACpBP,KAAKE,KAAON,EAAKK,EAAEC,KACnBF,KAAKO,KAAKR,GAAKC,KAAKD,GACjBC,KAAKK,IAAIC,OAASN,KAAKK,YAClBL,KAAKQ,GAAGX,IAAIG,KAAKK,IAAIR,IAEnC,GACKE,GAAIH,EAAKK,EACTC,KAAM5E,EACN+E,IAAKR,EACLW,GAAIR,KACJF,GAAIA,GAGL,OADCK,EAAGI,KAAOV,EAAIS,MAAQT,GAAKE,GAAKI,EAC1BN,EAAIS,KAAOH,CACtB,CAEG,OADIN,EAAMA,EAAIE,KA5BV9C,YA4BuB3B,GAAMuE,EAAIK,KAAK5E,GACnCuE,EAEV,GAnCExE,CAmCEA,EAAK,UAEPA,GAAI,SAASc,GAKbA,EAAON,QAAU,SAAU4E,GAEzB,OAAa,OAANA,GACR,iBAAoBA,GACpB,kBAAqBA,GAGpB,iBAAoBA,GAAKA,GAAKC,KAAYD,IAAMC,KAAYD,GAAMA,KAChEA,GAAK,iBAAmBA,EAAE,MAAkC,IAA1BhD,OAAOU,KAAKsC,GAAG7D,QAAgB6D,EAAE,IACzE,CACA,GAfEpF,CAeEA,EAAK,WAEPA,GAAI,SAASc,GAEb,SAASwE,IACR,IAAI7D,GAAK,IAAIoC,KACb,OAAGoB,EAAOxD,GACF8D,EAAI,EAAGN,EAAOxD,EAAI6D,EAAME,OAEzBP,EAAOxD,GAAM8D,GAAK,GAAKE,EAAKH,EAAME,KAC5C,CAPExF,EAAI,UAQJsF,EAAME,MAAQ,EACd,IAA+C5D,EAA3C8D,GAAML,IAAUE,EAAI,EAAGE,EAAI,IAAKR,EAAOS,EAC3CJ,EAAMK,GAAK,SAAShD,EAAGC,EAAGlB,GACzB,IAAIC,EAAOiB,GAAKD,GAAKA,EAAEiC,GAAKjC,EAAEiC,EAAE,MAASlD,EACzC,GAAIC,EACJ,MAAQ,iBAAoBA,EAAMA,EAAIiB,IAAMjB,EAAM+D,CACrD,EACEJ,EAAMM,IAAM,SAASjD,EAAGC,EAAGzB,EAAGiE,EAAGS,IAC/BlD,EAAIA,GAAK,CAAE,GAAEiC,EAAIjC,EAAEiC,GAAK,GACtBiB,IAAOlD,EAAEiC,EAAE,KAAOiB,GACrB,IAAIlE,EAAMgB,EAAEiC,EAAE,OAASjC,EAAEiC,EAAE,KAAO,CAAA,GAKlC,OAJGhD,IAAMgB,GAAW,MAANA,IACV,iBAAmBzB,IAAIQ,EAAIiB,GAAKzB,GAChCS,IAAMwD,IAAIzC,EAAEC,GAAKwC,IAEdzC,CACV,EACE7B,EAAON,QAAU8E,CACnB,GA3BEtF,CA2BEA,EAAK,WAEPA,GAAI,SAASc,GACbd,EAAI,UA2BJc,EAAON,QA1BP,SAAasF,GACZ,IAAIC,EAAM,CAAC5E,EAAE,CAAA,GAAKA,EAAI4E,EAAI5E,EAC1B2E,EAAMA,GAAO,CAACE,IAAK,IAAKC,IAAK,KAC7BF,EAAI7D,MAAQ,SAASgE,GACpB,QAAI/E,EAAE+E,IACCC,EAAGD,EACd,EACG,IAAIC,EAAKJ,EAAIK,MAAQ,SAASF,GAC7B,IAAIG,EAAKlF,EAAE+E,KAAQ/E,EAAE+E,GAAM,CAAA,GAI3B,OAHAG,EAAGC,IAAMP,EAAInC,KAAO,IAAIC,KACpBkC,EAAIrB,KAAKqB,EAAIrB,GAAK1B,WAAW+C,EAAIQ,KAAMT,EAAIG,IAAM,IAClDE,EAAGK,IAAKL,EAAGK,GAAGN,GACVG,CACX,EAWG,OAVAN,EAAIQ,KAAO,SAASN,GACnBF,EAAIrB,GAAK,KACTqB,EAAInC,KAAO,IAAIC,KACf,IAAI5C,EAAImB,OAAOU,KAAK3B,GACpBsF,QAAQC,MAAQD,QAAQC,KAAKX,EAAInC,KAAM,IAAIC,KAAOkC,EAAInC,IAAK,iBAC3DZ,WAAWkB,KAAKjD,GAAG,SAASiF,GAAK,IAAIG,EAAKlF,EAAE+E,GACxCG,IAAOJ,GAAOH,EAAIG,KAAQF,EAAInC,IAAMyC,EAAGC,YACnCnF,EAAE+E,EACd,GAAM,EAAE,GACR,EACUH,CACV,CAEA,GA7BE/F,CA6BEA,EAAK,SAEPA,GAAI,SAASc,GAEbd,EAAI,UACJc,EAAON,QAAU,SAAamG,EAAIlC,GACjC,GAAIE,KAAKQ,GAAT,CACA,IAAIyB,GAAQjC,KAAKmB,KAAK,CAAE,GAAEc,MAAQ,IAClC,GAAK,mBAAqBD,EAAI,CAC7B,IAAIA,EAAK,OACT,IAAIT,EAAKS,EAAG,MAAQA,EAAIhF,GAAOgD,KAAKH,KAAK,IAAI0B,GAC7C,IAAIvE,EAAM,OAMV,OALG8C,IACF9C,EAAMgD,KAAKQ,GAAGe,EAAIzB,GAClBoC,aAAalF,EAAImF,KACjBnF,EAAImF,IAAM9D,YAAW,WAAYrB,EAAIoD,KAAK,GAAI6B,KAExC,CACX,CACOV,EAAMzB,GAAMA,EAAG,MAASzD,EAAO,GACnC,IAAI2F,EAAK,OAAOT,EAChB,IAAIxB,EAAKC,KAAKQ,GAAGe,EAAIS,EAAIlC,GAIzB,OAHAC,EAAGoC,IAAMpC,EAAGoC,KAAO9D,YAAW,WAAY0B,EAAGK,MAC5CL,EAAGG,KAAK,CAACiC,IAAK,qBAAsBF,MAAM,GAC1C,GAAEA,GACIV,CAnBa,CAoBvB,EACE,IAAIlF,EAASD,OAAOC,QAAU,WAAY,OAAOK,KAAKL,SAASL,SAAS,IAAIP,MAAM,EAAE,CACtF,GA1BEJ,CA0BEA,EAAK,SAEPA,GAAI,SAASc,GAEb,SAASiG,EAAIrF,GACZ,OAAGA,aAAaqF,GAAcpC,KAAKC,EAAI,CAACoC,EAAGrC,OAAOqC,EAC7CrC,gBAAgBoC,EACdA,EAAIE,OAAOtC,KAAKC,EAAI,CAACoC,EAAGrC,KAAMmB,IAAKpE,IADP,IAAIqF,EAAIrF,EAE9C,CAEEqF,EAAIpB,GAAK,SAASqB,GAAI,OAAQA,aAAaD,GAASC,GAAKA,EAAEpC,GAAMoC,IAAMA,EAAEpC,EAAEoC,IAAO,CAAK,EAEvFD,EAAIG,QAAU,KAEdH,EAAII,MAAQJ,EAAI1E,UAChB0E,EAAII,MAAMC,OAAS,aAEnBpH,EAAI,UACJ+G,EAAIM,MAAQrH,EAAI,WAChB+G,EAAIO,MAAQtH,EAAI,WAChB+G,EAAI5B,GAAKnF,EAAI,UACb+G,EAAIhB,IAAM/F,EAAI,SACd+G,EAAIQ,IAAMvH,EAAI,SAEZ,WAkBD,SAASwH,EAASC,GAGjB,GAAIA,EACJ,GAAGA,EAAIC,MAAQF,EAAf,CACA,IAAyE7F,EAAzD8C,EAANE,KAAeF,GAAIkD,EAAKlD,EAAGkD,IAAMlD,EAAImD,EAAMD,EAAGX,EAAGjB,EAAM4B,EAAG5B,IAAU8B,EAAMJ,EAAII,IAExF,IADClG,EAAM8F,EAAI,QAAU9F,EAAM8F,EAAI,KAAOK,EAAU,KAC7C/B,EAAI7D,MAAMP,GAAb,CAIA,GAJ6BoE,EAAIK,MAAMzE,GACvCA,EAAM8F,EAAI7C,EAAG6C,EAAI7C,EAAK,mBAAqBjD,EAAMA,EAAM,WAAU,EAChE8F,EAAIT,GAAMS,EAAIT,KAAOS,EAAIT,EAAEpC,GAAG,IAAIoC,IAAQS,EAAIT,EAAIY,GAChDH,EAAI,OAASA,EAAIM,KAuHrB,SAAaN,GACR,IAAqBO,EAArB9B,EAAKuB,EAAI,MAAQ,GACrB,KAAKO,EAAM9B,EAAGtB,GAAG,CAChB,IAAImB,GAAOA,EAAM0B,EAAIT,KAAOjB,EAAMA,EAAInB,KAAOmB,EAAMA,EAAIkC,QAAUlC,EAAMA,EAAIA,KAC3E,KAAKA,EAAMA,EAAI7D,MAAMgE,IAAO,OAE5B,YADAuB,EAAI,KAAO1B,EAAI,MAAQ0B,EAAI,KAEhC,CACIO,EAAIE,MAAQF,EAAIE,MAAM,GAAK,GACxBF,EAAIlB,IAAMW,EAAIX,OAChBW,EAAI,KAAOO,EAAI,KACfG,EAAKH,IAENA,EAAII,GAAKX,EAAIW,IAAMJ,EAAII,GACnBJ,EAAIK,MAASL,EAAIM,QAAQN,EAAIM,MAAQN,EAAIxG,OAASwG,EAAIxG,MAAMuB,MAAK,WAAWmC,EAAK8C,EAAI,KACzF9C,EAAK8C,EACT,CAvI8BO,CAAId,IAC1BE,EAAGJ,IAAIE,EAAI,KAAMA,GAAK,CAEzB,GADAI,IAAQA,EAAIjG,GAAK,IAAIiC,MAClB4D,EAAIM,IAAgB,YAAVA,EAAIN,GACdA,EAAIe,KAAMzB,EAAI5B,GAAGqD,IAAIf,EAAKG,EAClC,CACIC,IAAQA,EAAIY,IAAM,IAAI5E,MAXZc,KAYND,GAAGG,KAAK4C,GACZI,IAAQA,EAAIa,IAAM,IAAI7E,MACnB4D,EAAIkB,KAAOlB,EAAImB,MAClBnB,EAAIC,IAAMF,EAAUG,EAAGxC,GAAG,MAAOsC,GACjCI,IAAQA,EAAIgB,IAAM,IAAIhF,MAdI,CAHyB,MAAzBc,KAAKD,GAAGG,KAAK4C,EAkB3C,CACG,SAASM,EAAIN,GACZ,GAAIA,EAAJ,CACA,IAAIO,EAAMP,EAAI7C,GAAG,GAAIqD,EAAOD,EAAIC,OAASD,EAAIhB,EAAIS,EAAIT,GAAG,IAAIpC,GAAG,IAAIqD,KACnE,GAAGR,EAAI,MAAQO,EAAIc,QAAUd,EAAIe,KAGhC,OAFAtB,EAAIC,IAAMF,OACVS,EAAK9C,GAAG,MAAOsC,GAGhBO,EAAIgB,MAAQf,EAAKgB,MAAOjB,EAAIxG,MAAQyG,EAAKgB,MAAQ,GACjD,IAAIlB,EAAMN,EAAIM,IACVF,EAAMG,EAAIH,IAAMJ,EAAII,IAAK1D,GAAK,IAAIN,KACtC,GAD4CqF,EAAKA,GAAM/E,GACpD4D,EAAI,OAAQA,EAAI,KAAnB,CACAF,IAAQA,EAAIpH,EAAI0D,GAChB6D,EAAI,KAAOP,EAAI,KACfO,EAAIP,IAAMA,EACVO,EAAImB,IAAM,EACVnB,EAAIoB,KAAO,EACX,IAAIC,EAAKjH,OAAOU,KAAKiF,GACrBtB,QAAQC,MAAQD,QAAQC,KAAKvC,IAAK0D,GAAKG,GAAKsB,IAAM,IAAIzF,MAAQM,EAAG,YACjE,IAAYoF,EAAIC,EAAI3D,EAAM4D,EAAMC,EAAQ5C,EAAKnF,EAAzCgI,EAAK,GACR,SAASC,EAAIlI,GACb,GAAG6H,GAAMI,EAAG,CACX,GADaJ,EAAKI,IACb9D,EAAOwD,EAAGM,IAGd,OAFAlD,QAAQC,MAAQD,QAAQC,KAAKvC,IAAK0D,GAAKG,GAAK6B,IAAM,IAAIhG,MAAQM,EAAG,YACjEgE,EAAKH,IAGDyB,EAAO1B,EAAIlC,KACXlE,EAAM8H,EAAK7E,GACbiB,IAASlE,EAAI,KAAOmF,EAAMgD,EAAIC,EAAIlE,GAAM,kBACtC6D,EAAS/H,EAAI,QAAQmF,EAAMgD,EAAIC,EAAIlE,GAAM,aAFzBiB,EAAMgD,EAAIC,EAAIlE,GAAM,WADhBiB,EAAMgD,EAAIC,EAAIlE,GAAM,WAI7C2D,EAAKpH,OAAOU,KAAK2G,GAAM,CAAE,EAC/B,CACK,GAAG3C,EAIF,OAHAW,EAAIX,IAAMkB,EAAIlB,IAAMA,OACpBqB,EAAKH,GAIN,IAAWgC,EAAPlI,EAAI,EACR,IADgBJ,EAAIA,GAAK,EACnBA,IAAM,IAAMsI,EAAMR,EAAG1H,OAC1B,GAAG,MAAQkI,EAAX,CACA,IAAIC,EAAMR,EAAKO,GAAM1C,EAAQoC,EAAOM,GACpC,GAAGpI,IAAM0F,EAAM,CAAER,EAAMgD,EAAIC,EAAIC,GAAK,KAAKD,EAAIlE,GAAM,YAAa,KAAK,CACrE,IAAIwB,EAAM4C,GAAK,CAAEnD,EAAMgD,EAAIC,EAAIC,GAAK,KAAKD,EAAIlE,GAAM,cAAeoE,EAAKF,EAAIE,GAAM,KAAK,CAEtFC,EAAID,EAAKD,EAAKnE,EAAMyB,EAAOG,KACzB0C,CANuB,EAQtBX,EAAKA,EAAGpJ,MAAM0B,IAAIP,OAASyC,EAAK4F,MAClCD,EAAIH,EAAK,KAAMI,EAAIlI,GAC1B,CA/BI,EATmE,CAVnD,CAmDhB,CAGD,SAASwI,EAAID,EAAKD,EAAKnE,EAAMyB,EAAOG,GACnC,IAA+D9F,EAA3DqG,EAAMP,EAAI7C,GAAG,GAAIqD,EAAOD,EAAIC,KAAMmC,EAAQnC,EAAKmC,MAC/CC,EAASD,EAAMvE,IAASnD,EAAO4D,EAAMgE,EAASD,EAAQL,EAAK,GAAIO,EAAQF,EAAOL,GAE9EnC,EAAMG,EAAIH,KAAQlG,EAAM8E,QAAQC,QAAW0D,EAAMvE,IAAU0E,IAAQ5I,EAAIQ,KAAOR,EAAIQ,KAAO,GAAK,QAE9FyB,EAAM0B,IACV,GAAGgC,EAAQ1D,EAGV,OAFAZ,YAAW,WAAYkH,EAAID,EAAKD,EAAKnE,EAAMyB,EAAOG,EAAI,IAAK9F,EAAM2F,EAAQ1D,GAAO4G,EAAIA,EAAK7I,QACzF8E,QAAQC,MAAQD,QAAQC,MAAOmB,GAAKG,GAAKyC,IAAM,IAAI5G,KAAOlC,EAAK,WAGhE,KAAG2F,EAAQhB,KACP0B,EAAIc,OACJxB,IAAUhB,KAAQ2D,IAAQM,GAASnG,EAAE6F,IAAQ7F,EAAEmG,KAAiDvC,EAAIe,MADxG,CAGAf,EAAIoB,OACJ,IAAIsB,EAAMjD,EAAI,KAAKO,EAAImB,MAAOjD,EAAK,CAACvF,SAAU,WAAY,OAAO+J,CAAG,EAAI9F,EAAGoD,GAAM9B,EAAGkB,OAASlB,EAAGvF,SAChGsH,EAAKlC,IAAIK,MAAMF,GAAI,KAAOuB,EAAI,KAC9BI,IAAQA,EAAI8C,GAAK9C,EAAI8C,KAAO,IAAI9G,MAChCoE,EAAK9C,GAAG,MAAO,CAAC,IAAKe,EAAI,IAAKuB,EAAI,KAAMM,IAAK,CAAC,IAAKlC,EAAM,IAAKmE,EAAK,IAAKC,EAAK,IAAK3C,GAAQc,GAAIX,EAAIW,GAAIxD,EAAGoD,GAL7G,CAMA,CACG,SAAS4C,EAAInD,GACZ,IAAII,GAAQA,GAAOJ,EAAI7C,GAAG,IAAIiD,OAAMA,EAAIgD,IAAM,IAAIhH,KAAMgE,EAAIiD,GAAKjD,EAAIiD,KAAO,IAAIjH,MACzE,IAA6JlC,EAAjJsG,EAANtD,KAAiBF,GAAI2F,EAAQnC,EAAKmC,MAAOpC,EAAMP,EAAI7C,EAAGmD,EAAMN,EAAIM,IAAKlC,EAAOkC,EAAI,KAAMiC,EAAMjC,EAAI,KAAMkC,EAAMlC,EAAI,KAAMT,EAAQS,EAAI,KAAWN,EAAI,MACvJ9F,EAAMqG,EAAIP,OAAS9F,EAAMA,EAAIoG,OAASpG,EAAMA,EAAIkE,KAASkF,EAAUpJ,EAAKqI,EAAK1C,EAAO2C,EAAKpE,GAEhGuE,EAAMvE,GAAQkF,EAAUX,EAAMvE,GAAOmE,EAAK1C,EAAO2C,EAAKpE,IACnDlE,GAAOsG,EAAKpD,MAAM,IAAIgB,KAGxBlE,EAAIwD,GAAG,KAAMsC,GAEdU,EAAKH,GATQrD,KAUTD,GAAGG,KAAK4C,EAChB,CACG,SAASU,EAAKH,EAAKP,GAAM,IAAIQ,EAC5B,IAAGD,EAAIK,OACHL,EAAIlB,OAAO,IAAMkB,EAAIoB,SACzBpB,EAAIK,KAAO,EACNJ,EAAOD,EAAIC,MAAhB,CACA,IAAItG,EAAMqG,EAAIxG,MAAOG,EAAIqJ,IAAM,EAC5BrJ,IAAQsG,EAAKgB,UAAatH,EAAMqG,EAAIgB,QAAUrH,EAAIqJ,WAAa/C,EAAKgB,MAAehB,EAAKgB,MAAQtH,GACnGqG,EAAIiB,OAASjB,EAAIiB,QACjBjG,WAAWkB,KAAK8D,EAAIxG,OAAO,SAASmF,GAAIA,GAAMA,GAAI,MAC7Cc,EAAMO,EAAIP,MAAQO,EAAIlB,KAAOW,EAAIX,MACtCW,EAAIC,IAAMF,EACVQ,EAAIC,KAAK9C,GAAG,MAAOsC,GAEnBwD,IAT8B,CAUlC,CAkBG,SAAS/F,EAAK8C,GACTA,GAAQA,EAAIC,OACbD,EAAIoB,MAAQpB,EAAIE,OAASF,EAAImB,KAChCnB,EAAIC,KAAK9C,GAAG,KAAM,CAAC,IAAK6C,EAAI,KAAMlB,IAAKkB,EAAIlB,IAAKsB,GAAIJ,EAAIlB,IAAKlF,EAAIoG,EAAII,IAAM,CAAC,GAAG,KACnF,CAvKGrB,EAAIE,OAAS,SAASU,GACrBA,EAAGM,KAAON,EAAGM,MAAQN,EACrBA,EAAGyC,MAAQzC,EAAGyC,OAAS,CAAA,EACvBzC,EAAGxC,GAAKwC,EAAGxC,IAAM4B,EAAI5B,GACrBwC,EAAGJ,IAAMI,EAAGJ,KAAOR,EAAIQ,IACvBI,EAAG5B,IAAM4B,EAAG5B,KAAOgB,EAAIhB,MACvB,IAAI6B,EAAMD,EAAGX,EAAElB,IAAI6B,EAAG7B,KAStB,OARI6B,EAAGuD,OACNvD,EAAGxC,GAAG,KAAMqC,EAAUG,GACtBA,EAAGxC,GAAG,MAAOqC,EAAUG,GACvBA,EAAGxC,GAAG,MAAOyF,EAAKjD,GAClBZ,EAAI5B,GAAG,SAAUwC,GACjBA,EAAGxC,GAAG,SAAUwC,IAEjBA,EAAGuD,KAAO,EACHtD,CACX,EA4EKb,EAAI5B,GAAG4C,IAAMA,EA6Ef,IAGWmB,EAHPY,EAAM,wBACNC,EAAM,SAAS5I,GAAI,MAAO,MAAM,GAAGA,GAAGf,MAAM,EAAE,GAAG,OAAO,EACxDgE,EAAI+G,KAAKC,UAAWZ,EAAK,WAAYlF,EAAQyB,EAAIO,MACjD6C,EAAI,EAAOc,EAAK,WAAcd,EAAE,KAAQA,IAAIjB,GAAMA,GAAM,IAAIrF,OAAO,IAAIkD,EAAIsE,QAAU5E,QAAQ6E,IAAI,uGAAuGL,EAAG,WAAWd,EAAE,CAAC,EAAE,CAElO,CA/KG,GAiLC,WA4CD,SAAS5B,EAAId,EAAKgC,GACjB,IAAItF,GAAK,IAAIN,KAAMmE,EAAMP,EAAI7C,GAAG,CAAE,EAAEiD,EAAMG,EAAIH,IAAMJ,EAAII,IACpDnD,EAAK+C,EAAI,KAAMvB,EAAK4B,EAAU,GAAIhF,EAAOV,OAAOU,KAAK2G,GAAM,IAAI8B,OAAQ1F,IAAS4D,GAAM,IAAI7E,GAAG,IAAI,KAAW9B,EAAKvB,OAAQ,IAAO0G,EAAOR,EAAIT,EAAEpC,EAAEqD,KAAMuD,EAAK/B,IAASxB,EAAKmC,MAAMvE,GAClLY,QAAQC,MAAQD,QAAQC,KAAKvC,IAAK0D,GAAKG,GAAKyD,IAAM,IAAI5H,MAAQM,EAAG,YAEjEsF,GAAS,SAASiC,IACjBvH,GAAK,IAAIN,KAET,IADA,IAAWjB,EAAajB,EAMpBmH,EANAhH,EAAI,EAAMiG,EAAM,CAAA,EACdjG,EAAI,IAAMc,EAAIE,EAAKhB,OACxBiJ,EAAUhD,EAAKnF,EAAG0H,EAASb,EAAM7G,GAAI6G,EAAK7G,GAAIiD,GAE/C/C,EAAOA,EAAK1C,MAAM0B,IACjBH,EAAM,CAAA,GAAIkE,GAAQkC,EAAKA,EAAMpG,EAChB6J,KAAI1C,EAAQ,WAAU,GAAU6C,IAAM7C,EAAMA,OAAQ,GAClEnH,EAAMmB,EAAKvB,OACXkF,QAAQC,MAAQD,QAAQC,KAAKvC,IAAKA,GAAKA,GAAK,IAAIN,OAAQ,mBACxDgE,IAAQA,EAAI+D,IAAM,IAAI/H,MACtBoE,EAAK9C,GAAG,KAAM,CAAC,IAAKT,EAAI,IAAKwB,EAAI6B,IAAKA,EAAK,IAAMpG,EAAMuE,EAAK4B,EAAU,GAAMlG,EAAIoF,EAAGiB,EAAKjB,EAAGpC,EAAGkE,EAAOjB,IAAKA,EAAKgE,IAAK,IACpHpF,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,UAC3CxC,GACJqB,WAAWgB,KAAK0H,EAChB,CAhBG,GAiBAjC,GAAOxB,EAAK9C,GAAG,KAAM,CAAC,IAAKsC,EAAI,MACnC,CAlEDV,EAAI5B,GAAGqD,IAAM,SAASf,EAAKG,GAC1B,IAAIK,EAAOL,EAAIhD,EAAG4D,EAAMf,EAAIe,IAAK3C,EAAO2C,EAAI,KAAMiB,EAAOxB,EAAKmC,MAAMvE,GAAO1D,EAAMqG,EAAI,KAC3Cb,GAA/BM,EAAKpD,OAASoD,EAAKpD,KAAO,CAAE,IAAagB,GAsB/BgC,GAAXJ,EAAI7C,GAAG,CAAE,GAAYiD,IAAMJ,EAAII,IAKzC,GAJAA,IAAQA,EAAIiE,GAAK,IAAIjI,OAIjB4F,EAAO,OAAOxB,EAAK9C,GAAG,MAAOsC,GACjC,GAAGtF,EAAI,CACN,IAAG,iBAAmBA,GAAOP,IAAM6H,EAAKtH,QACjCwF,GAAI,IAAI9C,MAAM,IAAI1C,GAA4B,YAArB8F,EAAK9C,GAAG,MAAOsC,GAE/CgC,EAAOsB,EAAU,GAAI5I,EAAKmI,EAASb,EAAMtH,GAAMsH,EAAKtH,GAAM0D,EAI/D,CAEI4D,GAAQlB,EAAId,EAAKgC,GACjBxB,EAAK9C,GAAG,MAAOsC,EACnB,EAwBKV,EAAI5B,GAAGqD,IAAID,IAAMA,CACtB,CApEG,GAuEAxB,EAAII,MAAMrB,IAAM,SAASA,GACxBA,EAAMA,GAAO,GACb,IAAgB6B,EAANhD,KAAeC,EAAGjD,EAAMmE,EAAIiG,OAASjG,EAoB/C,OAnBI1D,OAAOG,MAAMuD,KAAOA,EAAM,IAC1B1D,OAAOG,MAAMoF,EAAG7B,OAAO6B,EAAG7B,IAAMA,GACjC,iBAAmBnE,IAAMA,EAAM,CAACA,IAC/BS,OAAOG,MAAMoF,EAAG7B,IAAIiG,SAASpE,EAAG7B,IAAIiG,MAAQ,CAAA,GAC7CpK,aAAeqK,QACjBlG,EAAIiG,MAAQ,GACZpK,EAAIsK,SAAQ,SAASC,GACpB,IAAIzL,EAAI,CAAA,EAAIA,EAAEyF,GAAKzF,EAAEyL,IAAMA,EAC3BpG,EAAIiG,MAAMG,GAAOvE,EAAG7B,IAAIiG,MAAMG,GAAOvE,EAAG7B,IAAIiG,MAAMG,IAAQzL,MAG5D0L,EAASrG,GAAK,SAAS5B,EAAKtB,GAAI,IAAIwC,EAAIT,KAAK/B,GACxC+B,MAAQA,KAAKrC,eAAeM,IAAO,iBAAmBwC,GAAKhD,OAAOM,MAAM0C,GAAKT,KAAK/B,GAAKwC,IACxFA,GAAKA,EAAE5C,cAAgBJ,QAAYgD,aAAa4G,QACnDG,EAAS/G,EAAGlB,EACjB,IACIyD,EAAG7B,IAAIsG,KAAOtG,EACdiB,EAAI5B,GAAG,MAAOwC,GACdA,EAAG7B,IAAIuG,KAAO1E,EAAG7B,IAAIuG,MAAQ,SAAcpL,GAAI,OAAO8F,EAAIO,QAAQ3G,SAAS,IAAIC,QAAQ,IAAI,IAAMG,OAAOC,OAAOC,GAAG,GAAG,EAnB3G0D,IAqBd,EAGE,IAAuL/C,EAAeuI,EAAlMgC,EAAW,SAASzK,EAAEwB,GAAId,OAAOU,KAAKpB,GAAGuK,QAAQ/I,EAAExB,EAAE,EAAIoG,EAAY/G,OAAOC,OAAQgD,EAAOhB,WAAWgB,KAAMqD,EAAQN,EAAIM,MAAOiD,EAAWvD,EAAIO,MAAM3B,GAAIoF,EAAYhE,EAAIO,MAAM1B,IAAQlD,EAAQ,CAAE,EAEpMqE,EAAIuE,IAAM,WAAY,OAASvE,EAAIuE,IAAIvG,KAAOoF,EAAEmB,IAAIgB,MAAMnC,EAAGoC,WAAa,GAAGnM,MAAMqC,KAAK8J,WAAWC,KAAK,MACxGzF,EAAIuE,IAAIJ,KAAO,SAASuB,EAAEtL,EAAEO,GAAI,OAAQA,EAAIqF,EAAIuE,IAAIJ,MAAMuB,GAAK/K,EAAE+K,IAAM,EAAG/K,EAAE+K,MAAQ1F,EAAIuE,IAAInK,EAAE,EAEzE,oBAAXkK,UAA0BA,OAAOqB,IAAMrB,OAAOtE,IAAMA,GAAKsE,OAASA,QAC5E,SAA0B,IAAXxK,IAAyBA,EAAOL,QAAUuG,GAAO,MAAMzD,GAAE,CACxExC,EAAON,QAAUuG,GAEhBA,EAAIsE,QAAQ,IAAI5E,SAAWM,EAAIsE,QAAQ,CAAA,GAAI5E,SAAW,CAAC6E,IAAK,WAAY,IACxEnB,EAAI1D,SAASkG,KAAO,SAAS7K,EAAGX,GAAI,OAAQgJ,EAAEwC,KAAK7K,GAAKA,IAAMqI,EAAEwC,KAAK7K,GAAKqI,EAAEwC,KAAK7K,MAASqI,EAAEmB,IAAIgB,MAAMnC,EAAGoC,YAAcpL,EAAE,EAG1H4F,EAAIuE,IAAIJ,KAAK,UAAW,oJAC1B,GAtTElL,CAsTEA,EAAK,UAEPA,GAAI,SAASc,GACHd,EAAI,UACVmH,MAAMjC,KAAO,SAASvC,EAAGmD,GAE5B,IAAI,KADJnD,EAAIA,GAAK,IACM0C,MAAa1C,EAC3B,OAAOgC,KAAKC,EAAEqD,KAAKjB,EAEpB,GAAG,IAAMrE,EACR,OAAQgC,KAAKC,EAAEM,MAAQP,KAAKC,GAAGoC,EAEhC,IAAgBW,EAANhD,KAAeC,EAIzB,GAHgB,iBAANjC,IACTA,EAAIA,EAAEjC,MAAM,MAEViC,aAAaqJ,MAAM,CAErB,IADA,IAAIlK,EAAI,EAAGb,EAAI0B,EAAEpB,OAAQI,EAAMgG,EACxB7F,EAAIb,EAAGa,IACbH,GAAOA,GAAKe,GAAOC,EAAEb,IAEtB,OAAGF,IAAMD,EACDmE,EAVCnB,KAUUhD,GAEfA,EAAMgG,EAAGzC,MACLvD,EAAIqF,EAAE9B,KAAKvC,EAAGmD,QAEtB,CACJ,CACG,GAAG,mBAAqBnD,EAAE,CACzB,IAAIiK,EACJ,IADSjL,EAAM,CAACuD,KAAMyC,IACfhG,EAAMA,EAAIuD,OACdtD,KAAOgL,EAAMjK,EAAEhB,EAAKmE,MACvB,OAAO8G,CACX,CACG,MAAG,iBAAmBjK,GACbgF,EAAGzC,MAAQyC,GAAIX,EAAE9B,KAAKvC,EAAI,GAE5BgC,IACV,EACE,IAAgB/C,EAAZc,EAAQ,CAAE,CAChB,GAvCE1C,CAuCEA,EAAK,UAEPA,GAAI,SAASc,GAIb,IAAIiG,EAAM/G,EAAI,UAuJd,SAAS6M,EAAKpF,EAAKqF,GAClB,GADwBA,EAAMA,GAAOnI,KAAKF,IAAMgD,EAAIT,EAAEpC,IACnD6C,EAAIsF,IAAMpI,OAASoC,EAAI5B,KACtBsC,EAAIM,MAAO+E,EAAIjH,KAAnB,CACA,IAAIkC,EAAMN,EAAIM,KAAK,GAAI8E,EAAO9E,EAAI,MAAMA,EAAI,KACxCE,EAAO6E,EAAI7E,KAAM+E,EAAM/E,EAAKjB,EAAEwB,IAAIT,EAAI,MAAMS,IAAIT,EAAI,MAAMnD,EAC9D,GAAG,iBAAoBiI,EAAOxF,EAAMwF,KAIpC,KAAIG,EAAIC,OAASD,EAAIC,KAAO,KAAKH,EAAI5G,MAC/B+B,EAAKiF,MAAM,IAAIJ,EAAI5G,IADzB,CAEA,GAAGvE,EAAMsG,EAAKiF,KAAK,CAAE,GAAGvL,EAAIkL,EAAKC,EAAI5G,IAAM,OAASvE,EAAIkL,EAAKC,EAAI5G,IAAM,CAAG,EAEzE8G,EAAIC,OAAOD,EAAIC,KAAK,CAAE,IAAGH,EAAI5G,IAAM4G,EAEjCA,EAAI3K,MAAM2K,EAAID,KAAOA,GACxB,IAEIlL,EAFAwL,EAAMlF,EAAKjB,EAAEwB,IAAIwE,EAAIH,KAAOA,GAAMjI,GACrCuI,EAAIF,OAASE,EAAIF,KAAO,CAAE,IAAGD,EAAI9G,IAAM8G,IACpCrL,EAAMmL,EAAIvF,KAAK,IACZ,KAAOuF,EAAIM,MACjBD,EAAIhI,GAAG,MAAO,CAACqD,IAAK,CAAC,IAAKqE,KAE3B7J,WAAWkB,KAAK9B,OAAOU,KAAKnB,IAAM,SAAS6G,EAAK2E,GAC3C3E,IAAS2E,EAAMxL,EAAI6G,KACvB2E,EAAIhI,GAAG,MAAO,CAACqD,IAAK,CAAC,IAAKqE,EAAM,IAAKrE,IACzC,GAAK,EAAE,GAfmC,OAJnC7D,OAASoC,EAAI5B,MAAM6H,EAAIC,OAASD,EAAIC,KAAO,CAAA,IAAKH,EAAI5G,IAAM4G,EAJ5B,CAwBjC,CAEF,SAASO,EAAO5F,EAAKqF,GACpB,IAAwFD,EAAMlL,EAA1FoG,EAAMN,EAAIM,KAAK,GAAIuF,EAAU1L,IAAMmG,EAAI,KAAOA,EAAI,KAAOA,EAAI,KAAME,EAAO6E,EAAI7E,KAClF,GAAGrG,IAAM0L,EAAO,CAGf,GAAGR,EAAIjH,MAAQjE,IAAMkL,EAAI/E,IAAM,OAG/B,GADApG,GAAO8F,EAAIsF,IAAItF,EAAIT,GAAG,IAAIpC,GAAG,GAC1B6C,EAAI,OAAS7F,IAAMD,EAAIoG,KAAOnG,IAAMkL,EAAI/E,KAAO,OAgBlD,OAdG8E,EAAOC,EAAID,MAAQpF,EAAI8F,gBACjBtF,EAAKjB,EAAEwB,IAAIqE,GAAMjI,EAAEqI,MAAM,IAAIH,EAAI5G,IAEvC4G,EAAI3K,MACN2K,EAAID,KAAO,MAEZC,EAAI/E,IAAMnG,OAEVoB,WAAWkB,KAAK9B,OAAOU,KAAKgK,EAAIjI,MAAM,KAAK,SAAS2D,EAAK2E,IACnDA,EAAML,EAAIjI,KAAK2D,MAEjBqE,UAAe5E,EAAKjB,EAAEwB,IAAIqE,GAAMrE,IAAIA,GAAK5D,EAAEqI,MAAM,IAAIE,EAAIjH,IAC5DiH,EAAIhI,GAAG,KAAM,CAACqD,IAAKA,EAAKT,IAAKnG,EAAGoF,EAAGmG,EAAInG,IAC5C,GAAM,EAAE,GAER,CACM8F,EAAIjH,MACJ4B,EAAIsF,KACPF,EAAOxF,EAAMiG,GACb3L,EAAM8F,EAAIT,EAAEpC,GAAG,IACZiI,IAASlL,EAAIkL,QAASC,EAAI3K,KAAQR,EAAIkL,QACpC5E,EAAKiF,MAAM,IAAIJ,EAAI5G,KAAO,iBAAoB2G,YAM3ClL,EAAIsL,MAAM,IAAIH,EAAI5G,IAC1BmH,EAAO,CAAC7E,IAAKsE,EAAItE,IAAKT,IAAKnG,EAAGoF,EAAGS,EAAIT,EAAGuG,OAAQ9F,EAAI8F,OAAS9F,EAAI8F,QAAU5L,EAAIkL,MAAOC,IACrF,CAEF,SAASvE,EAAId,EAAK+F,GAGjB,IAAI/I,EAAKE,KAAKF,GAAIkD,EAAKlD,EAAGuC,EAAEpC,EAAU+C,EAAGM,KAAM,IAAAO,EAAM/D,EAAG+D,KAAK,GAAI7G,GAAO8F,EAAIM,KAAK,IAAIS,EAAI,OAAO,GAChG,IAAIf,EAAIM,KAAQ,iBAAmBS,EAAI,MAAQ5G,IAAMD,EAAI6G,EAAI,MAAO,CACnE,GAAG5G,IAAM+F,EAAGI,IAAM,OAClB,IAAIJ,EAAG9B,OAAS8B,EAAGxF,IAAM,OAYzB,OAXAwF,EAAGY,KAAOZ,EAAGY,KAAO,GAAK,OACzBZ,EAAGxC,GAAG,KAAM,CACXqD,IAAKb,EAAGa,IACRT,IAAKJ,EAAGI,IAAMnG,EACdoF,EAAGW,EAAGX,EACN,IAAKS,EAAI,MAOd,EACIA,EAAI7C,GAAG,IAAImE,KAAO,EACnBhC,EAAI5B,GAAG4C,IAAIN,EAEd,CAlPEV,EAAII,MAAMA,MAAQ,SAASsG,GAC1B,IAAsFxF,EAAlFL,EAAMjD,KAAMgD,EAAKC,EAAIhD,EAAGuC,EAAQ,IAAKsG,GAAO7F,GAAKpF,YAAYoF,GAAMkF,EAAM3F,EAAMvC,EAOnF,OANAkI,EAAI7E,KAAOA,EAAON,EAAGM,KACrB6E,EAAI5G,KAAO+B,EAAKiD,KAChB4B,EAAI5H,KAAO0C,EAAIhD,EACfkI,EAAI3H,GAAK4B,EAAI5B,GACb2H,EAAI3H,GAAG,KAAM4B,EAAI5B,GAAGuI,GAAIZ,GACxBA,EAAI3H,GAAG,MAAO4B,EAAI5B,GAAGuC,IAAKoF,GACnB3F,CACV,EAkFKJ,EAAI5B,GAAGuC,IAhFV,SAAgBD,GACf,IAASe,EAAmD7G,EAA9CgG,EAAKhD,KAAKF,GAAIS,EAAOyC,EAAGzC,KAAM+C,EAAON,EAAGM,KAGtD,GAFIR,EAAIT,IAAIS,EAAIT,EAAIW,EAAGX,GACvBrC,KAAKD,GAAGG,KAAK4C,IACVE,EAAGb,IAAN,CACA,GAAG0B,EAAMf,EAAIe,IAAI,CAOhB,GAFGP,EAAKiF,OAAOjF,EAAKiF,KAAKvF,EAAGzB,IAAMyB,GAC/BA,EAAGyF,KAAMhL,OAAOU,KAAK6E,EAAGyF,KAAKnB,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK+E,EAAGyF,IAAIxK,KAAMjB,EAAM8F,EAAIe,IAAMf,EAAIe,KAAO,CAAE,GACrGA,EAAI,MAAQb,EAAG9B,KAAK,CAKtB,GAJA2C,EAAI,KAAOA,EAAI,MAAQb,EAAG9B,KAE1B4B,EAAI,OAASA,EAAI,KAAOK,EAAU,IAClC5C,EAAQ+C,EAAKjB,EAAEwB,IAAIA,EAAI,MAAO,EACzBA,EAAMA,EAAI,MASf,GAAGmF,EAAQzI,EAAK6C,IAAKS,KACpB7G,EAAMuD,EAAKqC,KAAOrC,EAAKqC,IAAIiB,IAC1BtD,EAAKqC,MAAQrC,EAAKqC,IAAM,CAAA,IAAKiB,GAAOtD,EAAK8B,EAAEwB,IAAIA,GAAK5D,EACrDM,EAAKC,GAAG,KAAM,CAACqD,IAAKA,EAAKT,IAAK,CAAC,IAAK7C,EAAKW,KAAM,IAAK2C,EAAK,IAAKtD,EAAK6C,IAAIS,GAAM,IAAK8B,EAASrC,EAAKmC,MAAMlF,EAAKW,MAAO2C,MAC/G7G,GAAM,WAbW,CAGpB,GAFAA,EAAMuD,EAAKqC,KAAOrC,EAAKqC,IAAI,KAC1BrC,EAAKqC,MAAQrC,EAAKqC,IAAM,CAAA,IAAK,IAAMrC,EACjCtD,IAAMsD,EAAK6C,MACb7C,EAAKC,GAAG,KAAMD,GACXvD,GAAM,OAEV8F,EAAIT,EAAI9B,EAAK8B,CACb,CAmCD,OADAiB,EAAKV,IAAIgB,EAAKd,GACPQ,EAAK9C,GAAG,KAAMsC,EAC1B,CAEI,GAAGe,EAAI,KACN,OAAGb,EAAGa,KACLf,EAAM,CAACe,IAAK,CAAC,IAAKb,EAAGa,KAAMxB,EAAGW,EAAGX,IAChC9B,EAAKqC,MAAQrC,EAAKqC,IAAM,CAAE,IAAGI,EAAGa,KAAOf,EAAIT,EAAEpC,EACvCM,EAAKC,GAAG,MAAOsC,KAEvBA,EAAM,CAACe,IAAKb,EAAGyF,IAAK3F,EAAIe,IAAM,GAAIxB,EAAGW,EAAGX,GACjC9B,EAAKC,GAAG,MAAOsC,IAGvB,IADCE,EAAGJ,MAAQI,EAAGJ,IAAM,CAAA,IAAK,IAAMI,EAC7BA,EAAGa,IAGL,OAFAA,EAAI,KAAOb,EAAGa,KACbtD,EAAKqC,MAAQrC,EAAKqC,IAAM,CAAE,IAAGI,EAAGa,KAAOf,EAAIT,EAAEpC,EACvCM,EAAKC,GAAG,MAAOsC,EAE3B,CACG,OAAOvC,EAAKC,GAAG,MAAOsC,EA3EqC,CAA/CE,EAAGxC,GAAG,KAAM,CAAC4C,IAAKJ,EAAGI,IAAMnG,EAAGoF,EAAGW,EAAGX,GA4E/C,EAyDCD,EAAI5B,GAAGuI,GAvDV,SAAejG,EAAKqF,GACnB,IAAmNK,EAA/MlF,GADqB6E,EAAMA,GAAOnI,KAAKF,IAC5BwD,KAAML,EAAMH,EAAIT,IAAMS,EAAIT,EAAI8F,EAAI9F,GAAIW,GAAMC,GAAK,IAAIhD,GAAKlC,EAAOf,EAAM8F,EAAIM,KAAK,GAAIlC,EAAOlE,EAAI,KAAMqI,EAAMrI,EAAI,KAAM2L,EAAU1L,IAAMD,EAAI,KAAOA,EAAI,KAAOA,EAAI,KAAM2F,EAAQ3F,EAAI,OAAS0D,IACzM,GAAGzD,IAAM6F,EAAIM,MAAQnG,IAAMD,EAAI,MAAQC,IAAMD,EAAI,MAASC,IAAMD,EAAI,MAAQC,IAAMD,EAAI,MAASC,IAAMD,EAAI,MACxG,OAAI0F,EAAM1F,QAQVmL,EAAI3H,GAAG,KAAM,CAAC6B,EAAGW,EAAGzC,KAAK8B,EAAGe,IAAK,CAAC,IAAKlC,EAAO8B,EAAGzC,KAAKW,KAAM,IAAKmE,EAAMrC,EAAGxF,KAAOwF,EAAGa,IAAK,IAAK7G,EAAK,IAAK2I,EAAS3C,EAAGzC,KAAK6C,IAAKiC,IAAO4D,IAAKnG,KAPpI5B,IAASlE,GAAK,IAAIiD,GAAG,IAAI,OAC9BgD,EAAMkF,EAAI7E,KAAKjB,EAAEwB,IAAI3C,GACd7C,WAAWkB,KAAK9B,OAAOU,KAAKnB,GAAK4J,QAAQ,SAAS3I,GACrD,KAAOA,GAAKhB,KAAO0F,EAAQgD,EAAS3I,EAAKiB,KAC5CkK,EAAI3H,GAAG,KAAM,CAAC6B,EAAGY,EAAKG,IAAK,CAAC,IAAKlC,EAAM,IAAKjD,EAAG,IAAKjB,EAAIiB,GAAI,IAAK0E,GAAQuG,IAAKpG,GACpF,UAL2ChB,QAAQ6E,IAAI,8BAA+B3J,EAAK,MAAO8F,EAAKqF,IAUhGrF,EAAIqG,MAAM,IAAIhB,EAAI5G,OAAgBuB,EAAIqG,OAASrG,EAAIqG,KAAO,WAAU,IAAKhB,EAAI5G,IAAM4G,EAEpFA,IAAQnF,IACVvF,OAAOU,KAAK2E,GAAKwE,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK6E,EAAI7E,EAAI,GAAEjB,EAAM,CAAE,GACjEA,EAAI6G,IAAMsE,EAAItE,KAAO7G,EAAI6G,IACrBsE,EAAIjH,MAASiH,EAAI3K,IAGlBwF,EAAG9B,OACLlE,EAAIqF,EAAI8F,EAAI9F,EACZrF,EAAIoL,GAAKpL,EAAIoL,IAAMpF,EAAGX,GAJtBrF,EAAIoM,IAAMpM,EAAIoM,KAAOjB,EAAI9F,EAM1BS,EAAM9F,GAEP0L,EAAO5F,EAAKqF,IAEPA,EAAsC,MAAArF,EAAIsF,KAAOzF,GAASgD,EAASrC,EAAKmC,MAAMvE,GAAOmE,MACxFrI,EAAMsG,EAAKjB,EAAEwB,IAAI3C,GAAMjB,GAAGmD,IAAMgD,EAAUpJ,EAAIoG,IAAKiC,EAAK1C,EAAOgG,EAAQzH,KAErE8B,EAAG9B,MAAgCyB,GAASgD,EAASrC,EAAKmC,MAAMvE,GAAOmE,KAASmD,GAAOlF,EAAKjB,EAAEwB,IAAI3C,GAAMjB,EAAEC,MAAM,IAAImF,MACvHmD,EAAIpF,IAAMuF,EACP,iBAAoB3L,EAAM0F,EAAMiG,MAClCH,EAAIpF,IAAME,EAAKjB,EAAEwB,IAAI7G,GAAKiD,EAAEmD,KAAOuF,IAIrC3I,KAAKD,IAAMC,KAAKD,GAAGG,KAAK4C,GAExBqF,EAAIkB,KAAOhL,WAAWkB,KAAK9B,OAAOU,KAAKgK,EAAIkB,MAAM,SAASA,IAAOA,EAAMlB,EAAIkB,IAAIA,KAASA,EAAIvG,EAAM,GAAC,EAAE,IACrGqF,EAAIG,MAAQjK,WAAWkB,KAAK9B,OAAOU,KAAKgK,EAAIG,OAAO,SAASgB,IAAOA,EAAMnB,EAAIG,KAAKgB,KAASA,EAAI9I,GAAG,KAAMsC,EAAI,GAAG,EAAE,MAE5GA,EAAIsF,IAAI,IAAInI,GAAG+C,GAAI9B,OAEnBsH,EAAML,EAAIjI,QAAUsI,EAAMA,EAAInD,MACjCrI,EAAM,CAAE,EAAES,OAAOU,KAAK2E,GAAKwE,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK6E,EAAI7E,EAAE,IAC/DjB,EAAIqF,GAAKS,EAAIsF,IAAItF,EAAIT,GAAGwB,IAAI7G,EAAI6G,IAAMwB,UAAarI,EAAIoL,UAAWpL,EAAIoM,IACtEZ,EAAIhI,GAAG,KAAMxD,IAIfkL,EAAKpF,EAAKqF,GACT,EA4BC/F,EAAI5B,GAAG0H,KAAOA,EAyCd9F,EAAI5B,GAAGkI,OAASA,EA2BnB,IAAgBzL,EAAZc,EAAQ,CAAA,EAAOoF,EAAY/G,OAAOC,OAAQqG,EAAQN,EAAIM,MAAOsG,EAAU,SAASjM,EAAGkB,GAAI,OAAOlB,GAAKU,OAAOC,UAAUC,eAAeG,KAAKf,EAAGkB,EAAI,EAAE0E,EAAQP,EAAIO,MAAOgD,EAAWhD,EAAM3B,GAAIoF,EAAYzD,EAAM1B,GACjN,GA1PE5F,CA0PEA,EAAK,WAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,UA6Id,SAASkO,EAAIvG,GACZ,IAAImF,EAAMnI,KAAKgD,IAAMhD,KAAKQ,GAC1B,IAAIwC,GAAMmF,EAAIjH,MAAQiH,EAAI3K,IAAM,OAAOwC,KAAKI,MAC5C,GAAK4C,GAAMA,GAAMA,EAAKA,EAAGX,GAAKW,GAAI/C,GAAK+C,GAAIzB,GAA3C,KACwB4H,EAExB,GAFUhB,EAAIlC,KAEJkD,EAAOnJ,KAAKmJ,OAASnJ,KAAKmJ,KAAO,CAAA,IAAKnG,GAAM,OAAO,EAC7DmG,EAAKnG,IAAM,CAJ4C,CAS1D,CAxJEZ,EAAII,MAAMqB,IAAM,SAASwB,EAAKrD,EAAIlC,GACjC,IAAImD,EAAKjG,EACT,GAAkB,iBAARqI,EAAiB,CAC1B,GAAiB,GAAdA,EAAIzI,OAGN,OAFCqG,EAAMjD,KAAKwC,SAASvC,EAAEkC,IAAM,CAACA,IAAKC,EAAIuE,IAAI,gBAAiBtB,IACzDrD,GAAKA,EAAGlE,KAAKmF,EAAKA,EAAIhD,EAAEkC,KACpBc,GAIHA,IAFYkF,EAANnI,KAAiBC,GACbC,MAAQnC,GACPsH,MACfpC,EAAMoC,GA6FT,SAAeA,EAAK9E,GACnB,IAAI4H,EAAM5H,EAAKN,EAAGC,EAAOiI,EAAIjI,KAAM+C,EAAM1C,EAAKiC,QAASQ,EAAKC,EAAIhD,EAC5DC,IAAOA,EAAOiI,EAAIjI,KAAO,CAAA,GAC7BA,EAAK8C,EAAGa,IAAMwB,GAAOrC,EAClBzC,IAAS4H,EAAI7E,KAAKjB,EACpBW,EAAG9B,KAAOmE,GAGR8C,EAAIjH,MAAQiH,EAAI3K,OAClBwF,EAAGxF,IAAM6H,GAKV,OAAOrC,CACV,CA5GkBwG,CAAMnE,EAHTrF,OAKXiD,EAAMA,GAAOA,EAAIZ,CACjB,KACD,IAAG,mBAAqBgD,EAAI,CAC3B,IAAG,IAASrD,EAAK,OAwGnB,SAAciB,EAAKjB,EAAIb,EAAKrB,GAC3B,IAA2B9C,EAAvBmL,EAAMlF,EAAIhD,EAAGsD,EAAO,EACxB,GAAGvG,EAAMmL,EAAIjH,MAAQiH,EAAID,KAAO,OAAOlG,EAAGhF,EAAK8C,EAAIqI,GACnD,GAAGA,EAAIsB,IAAM,OAAOtB,EAAIsB,IAAIrL,KAAK,CAAC4D,EAAIlC,IACtCqI,EAAIsB,IAAM,CAAC,CAACzH,EAAGlC,IACfmD,EAAIY,KAAI,SAAYf,EAAK4G,GACxB,KAAGzM,IAAM6F,EAAIM,MAAQ+E,EAAI7E,KAAKnC,IAAIwI,QAAU3M,EAAMS,OAAOU,KAAKgK,EAAI7E,KAAKnC,IAAIiG,OAAOxK,WAAa2G,GAAQvG,GAAvG,CAGA0M,EAAIH,IAAIzG,GACR,IAA8ChD,EAA1CkD,GAAOA,EAAKF,EAAIT,IAAMW,EAAG/C,GAAM,CAAE,EAAE9C,EAAI,EAG3C,IAFAH,EAAMmL,EAAIsB,WAAYtB,EAAIsB,IAEpB3J,EAAK9C,EAAIG,MAAK,KACf6E,EAAKlC,EAAG,GAAQA,EAAKA,EAAG,GAC5BkC,GAAMA,EAAQgB,EAAGkF,MAAQlF,EAAG9B,MAAQkB,EAAIM,MAAMI,EAAIM,QAAUN,EAAIM,KAAK,CAAE,GAAEnD,GAAG,CAAA,GAAI,KAAMH,EAAIgD,EAAK4G,EAC/F,CARL,CASA,GAAM,CAAC3G,IAAK,CAACc,IAAK,CAAC,KAAI,KAEvB,CA3H4B3C,CAAKlB,KAAMqF,EAAKrD,EAAIlC,GAAKE,KAEjD,IAAkDuB,EAA9C4G,GADJlF,EAAMjD,MACQC,EAAGkB,EAAMa,GAAM,CAAE,EAAEsB,EAAO6E,EAAI7E,KAC5CnC,EAAI6B,GAAKmF,EACThH,EAAIsC,GAAK4B,EACT,IAAIuE,EAAO,CAAA,EAEX,SAASP,EAAIvG,EAAK4G,EAAKnL,GACtB,IAAG8K,EAAI5E,SACHzH,EAAMsG,EAAKiF,OAAUvL,EAAIuE,IAA7B,CACA,IAA4GvE,EAAxGgG,EAAKF,EAAIT,EAAEpC,EAAGuI,GAAO1F,EAAIsF,IAAI,IAAInI,EAAGrB,GAAQ4J,GAAKxF,GAAII,IAAKyG,GAAQ7G,EAAGxF,MAAQwF,EAAG9B,KAAO4I,EAAO,CAAA,EAOlG,IANGD,GAAO5M,IAAM2B,KACfA,EAAQ3B,MAAQD,EAAM8F,EAAIM,MAAM,IAAI,KAAQnG,KAAOD,GAAK,IAAI,KAAOA,EAAMA,EAAI,KAAOA,EAAI,MAE9E,iBAAoBA,EAAMoF,EAAIM,MAAM9D,MAC9CA,EAAQ3B,KAAOD,EAAMsG,EAAKjB,EAAEwB,IAAI7G,GAAKiD,EAAEmD,KAAOjC,EAAI4I,IAAK9M,EAAI2B,EAAO5B,IAEhEmE,EAAI4I,KAAO9M,IAAM2B,EAApB,CACA,GAAG3B,IAAMkE,EAAIsD,KAAK,CACjB,IAAIzH,EAAMsG,EAAKmB,OAASzH,EAAIwD,KAC3B2H,EAAI9F,EAAE9B,MAAK,SAASyJ,GAEnB,GADAhN,EAAIwD,GAAG,GAAGwJ,EAAEzI,GAAIuI,EAAO,CAAA,IACnBA,EAAKG,KAAO,GAAKZ,EAAI9H,GAAK,OAAOuI,CAC7C,KACQA,EAAKG,KAAOjN,EAAIwD,GAAG,GAAGwC,EAAGzB,GAAIuI,EAAO,CAAA,IACpCA,EAAKG,KAAOzB,GAAOxL,EAAIwD,GAAG,GAAGgI,EAAIjH,GAAIuI,EAAO,CAAE,GAC5CT,EAAI9H,GAAKuI,EAAKG,MACZH,EAAKrF,OAAQqF,EAAKrF,KAAK4B,MAC1ByD,EAAKrF,KAAOzH,EAAIwD,GAAG,QACnBsJ,EAAKrF,KAAOqF,EAAKrF,MAAQqF,EAAKrF,KAAKnE,MAEjCwJ,EAAKrF,OAASqF,EAAKrF,KAAK4B,MAI1B,aADCyD,EAAKrF,KAAKyF,MAAQJ,EAAKrF,KAAKyF,IAAM,CAAA,IAAK3I,GAAM,WAAY8H,EAAIvG,EAAI4G,EAAI,EAAI,GAU7E,GALczM,IAAM2B,IAAOL,EAAI,IAK3BvB,EAAMsG,EAAKgB,SAAWtH,EAAIqJ,KAAOpJ,IAAMkE,EAAImD,QAAU/F,EAAE,CAC1D,GAAGqL,EAAK5G,EAAGX,EAAEpC,EAAEsB,IAAM,OAErB,OAF8BqI,EAAK5G,EAAGX,EAAEpC,EAAEsB,IAAM,OAChDvE,EAAIoB,MAAK,WAAWiL,EAAIvG,EAAI4G,EAAI,EAAE,GAEzC,CAASE,EAAO,CAAA,CAChB,CAEK,GAAGtG,EAAKiF,KAAK,CAAE,GAAGjF,EAAKiF,KAAKhH,EAAGyB,EAAGzB,IAAM,OAAS+B,EAAKiF,KAAKhH,EAAGyB,EAAGzB,IAAM,CAAC,CACrEJ,EAAIX,GAAKW,EAAIsC,GAAG3F,KAAKkF,EAAGX,EAAGzD,EAAMoE,EAAGa,IAAKf,EAAK4G,GAAOL,GACrDlI,EAAIgJ,MAAQhJ,EAAIsC,GAAGX,EAAK4G,GAAOL,IAClC5L,OAAOU,KAAK2E,GAAKwE,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK6E,EAAI7E,KAAMjB,EAAM,CAAE,IAAG8F,EAAM9F,GAASoG,IAAMxE,EACzFuC,EAAIsC,GAAG3F,KAAKqD,EAAIrB,GAAIgD,EAAK4G,GAAOL,GAtCC,CARQ,EA0D1C,OAVAA,EAAIrG,GAAKmF,GAERA,EAAIkB,MAAMlB,EAAIkB,IAAI,CAAE,IAAG9H,EAAKnF,OAAOC,OAAO,IAAMgN,EACjDA,EAAIjJ,IAAM,WAAYiJ,EAAI5E,KAAO,EAAO0D,EAAIkB,YAAsBlB,EAAIkB,IAAI9H,EAAG,EAC7E8H,EAAIE,IAAMA,EACVF,EAAI9H,GAAKJ,EAAI8I,OAAS3G,EAAKiD,KAC3BvJ,EAAMsG,EAAKiF,MAAOjF,EAAKiF,KAAO,CAAE,GAAEhH,GAAM,EACxCJ,EAAI4B,IAAM5B,EAAI4B,KAAO,CAACc,IAAK,CAAA,GAC3BsE,EAAI3H,GAAG,MAAOW,EAAI4B,KAClBO,EAAKiF,KAAOvL,EACLiG,CACP,CACD,GAAG,iBAAmBoC,EACrB,OAAOrF,KAAK6D,IAAI,GAAGwB,EAAKrD,EAAIlC,GAE7B,GAAG,iBAAoB9C,EAAM0F,EAAM2C,IAClC,OAAOrF,KAAK6D,IAAI7G,EAAKgF,EAAIlC,IAEvB9C,EAAMgD,KAAK6D,IAAI3D,QACjB+C,EAAMjG,EAAIgD,KAAMqF,GACpB,CACG,OAAIpC,GAKDjB,GAAM,mBAAqBA,GAC7BiB,EAAIY,IAAI7B,EAAIlC,GAENmD,KAPLA,EAAMjD,KAAKwC,SAASvC,EAAEkC,IAAM,CAACA,IAAKC,EAAIuE,IAAI,uBAAwBtB,IAChErD,GAAKA,EAAGlE,KAAKmF,EAAKA,EAAIhD,EAAEkC,KACpBc,EAMX,EAkDE,IAAmChG,EAA/Bc,EAAQ,CAAA,EAAI2E,EAAQN,EAAIM,KAC9B,GA5JErH,CA4JEA,EAAK,SAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,UA6Ed,SAASoJ,EAAK3E,EAAIyB,GACjB,GAAIA,EAAJ,CAAkBA,GAAMA,EAAGtB,GAAG,IAAIsB,IAAIA,EACtC,IAAoEvE,EAAhEiN,EAAMnK,EAAGwD,KAAKmB,OAAS3E,EAAGwD,KAAKmB,KAAO,CAACjE,GAAI4B,EAAI5B,KAAMsJ,EAAO,CAAE,EAClEhK,EAAG2E,OAAS3E,EAAG2E,KAAOwF,EAAIzJ,GAAG,QAAQ,WAAa,MAC/CxD,EAAMiN,EAAIzJ,GAAG,GAAGe,KAAMvE,EAAIqD,IAAIC,KAAKJ,KAAK4J,GACxCA,EAAKG,KAAOnK,EAAGmK,KAClBA,EAAIzJ,GAAG,GAAGe,GAAI,SAASuI,GACtB,GAAGhK,EAAG2E,KAAK4B,IAGV,OAFArG,KAAKI,WACLJ,KAAKD,GAAGG,KAAK4J,GAGdA,EAAKG,IAAMH,EAAKG,KAAOnK,EAAGmK,IAC1BH,EAAKrF,KAAOqF,EAAKrF,MAAQ3E,EAAG2E,IAMhC,GAlBkB,CAmBlB,CAEE,SAAS2F,EAAItK,GACZ,GAAGA,EAAGqC,IAAMiI,EAAI/D,IAAIvG,EAAG2E,KAAM3E,EAAGwD,WAChC,IAAGxD,EAAGuK,KAAKzN,SAAUkD,EAAGuG,KAAQ5I,OAAOM,MAAM+B,EAAG8J,MAAhD,CAAiE9J,EAAGuG,IAAM,EAE1E,IAMsCrJ,EANlCmL,EAAOrI,EAAGuC,EAAE9B,MAAM,GAAI,EAAG+C,EAAO6E,EAAI7E,KAAMV,EAAMuF,EAAIvF,KAAI,SAASgB,GACpEN,EAAK9C,GAAG,MAAOoD,GACZA,EAAIzB,MAAQyB,EAAI3B,MAAOG,EAAIuE,IAAI/C,KAC7BL,GAAQzD,EAAGyD,MAAQ,IAAKvD,KAAKI,MAC9BN,EAAG8D,KACP9D,EAAG8D,IAAIA,EAAK5D,KAChB,GAAMF,EAAGqB,KAAMoC,EAAO,EAAGkB,EAAO3E,EAAG2E,MAC/BzH,EAAM,WACFyH,IACJ2F,EAAI/D,IAAI5B,EAAMnB,GACdjF,WAAWkB,KAAK9B,OAAOU,KAAKsG,EAAOA,EAAKyF,KAAK,KAAK,SAASlI,IAAQA,EAAKyC,EAAKzC,KAAKA,GAAK,IAC3F,GAAMsC,MAAQtH,EAER8C,EAAG8D,MAAQ9D,EAAG2D,KAAK3D,EAAG2D,GAAK3D,EAAGyD,MAAQ,GACxCzD,EAAGmJ,IAAK,EAAEzI,GAAG,MAAO,CAAC4C,IAAKtD,EAAGiD,IAAMjD,EAAG2F,MAAOhC,GAAI3D,EAAG2D,IAAM,CAAC,IAAK3D,EAAG2D,GAAG,GAAItC,IAAKrB,EAAGqB,IAAK,IAAKyB,EAAK3C,EAAGjD,GAhBrC,CAkB/D,CAtHFoF,EAAII,MAAMY,IAAM,SAASxE,EAAMoD,EAAIlC,GAClC,IAAImD,EAAMjD,KAAMgD,EAAKC,EAAIhD,EAAGqD,EAAON,EAAGM,MACtCxD,EAAKA,GAAM,IACRwD,KAAON,EAAGM,KACbxD,EAAGmK,MAAQnK,EAAGmK,IAAM3G,EAAKiD,MACzB9B,EAAK3E,EAAIkD,EAAGzB,IACZzB,EAAG8D,IAAM9D,EAAG8D,KAAO5B,EACnBlC,EAAGmJ,IAAMnJ,EAAGmJ,KAAOhG,EACnBnD,EAAGlB,KAAOkB,EAAGlB,MAAQA,EACrBkB,EAAGoB,OAASpB,EAAGoB,KAAO8B,EAAG9B,MAAS,iBAAmBc,GAAMA,GAC3D,IAAIxF,EAAIsD,EAAG6C,MAAQ7C,EAAG6C,OAASP,EAAIO,QACnC,MAAG,mBAAqB/D,GAAOA,GAAK,SAAS0L,GAAIxK,EAAGlB,KAAO0L,EAAGrH,EAAIG,IAAInG,EAAEA,EAAE6C,MAAemD,GACrFnD,EAAGoB,MACPpB,EAAGuC,EAAIiB,EAAKjB,EAAEwB,IAAI/D,EAAGoB,MACrBpB,EAAGuK,KAAO,CAAC,CAAC3I,GAAI5B,EAAGlB,KAAM2L,IAAKzK,EAAGuC,IACjCvC,EAAGT,KAAOS,EAAGT,MAAQA,EACrBS,EAAGsK,IAAMtK,EAAGsK,KAAOA,EAGlB,SAASI,QACgE/J,EAAGxC,EAAGkK,EAAKnL,EAAKmK,EAArFpH,EAAKD,EAAGuK,KAAMrH,EAAKjD,EAAGkF,MAAOqF,EAAItH,EAAGtB,GAOxC,GAPkDsB,EAAGuH,KAAOvH,EAAGuH,IAAItK,EAAEsB,GACrEkD,EAAK3E,EAAIkD,EAAGuH,MACTvN,EAAMgG,EAAGqH,QACIC,EAAIA,EAAnBrM,EAAIjB,EAAIiI,OACLjI,EAAIJ,QAASmD,EAAG3B,KAAK4E,IAEzB/E,IAAM8B,EAAGnE,OAASmE,EAAGnE,KAAO,KAAKwC,KAAKH,KACjCwC,EAAIiC,EAAM4H,OAASnD,EAAI/E,EAAIpB,GAAGsJ,IAAI,CACtC,IAAI7M,OAAOG,MAAM0M,GAAuK,YAAlKF,EAAIjI,IAAIrC,EAAI,iBAwHrC,SAAewK,EAAGtN,GAAM,OAASsN,IAAMtN,EAAMsN,EAAEzM,cAAgBb,EAAIyN,aAAgBH,CAAE,CAxH9B/M,CAAM+M,GAAI,QAAUxK,EAAGmJ,IAAI1I,MAAK,SAASyC,GAAIA,EAAGa,KAAO7G,EAAIoB,KAAK4E,EAAGa,IAAI,GAAG7G,EAAM,KAAOA,EAAI6K,KAAK,MAAM,KAAK9H,EAAGnE,MAAM,IAAIiM,KAAK,MAEjL,IADA,IAAIsB,EAAOrJ,EAAGqJ,OAASrJ,EAAGqJ,KAAO,IAAKhM,EAAIgM,EAAKvM,OACzCO,KAAM,GAAGmN,KAAOtN,EAAMmM,EAAKhM,IAAIuE,GAAG,CAAEjB,EAAI6J,EAAItN,EAAIkL,KAAM,MACjE,CACI,GAAGjK,GAAKwC,EAAIuC,EAAG8B,KAAOsB,EAAUpD,EAAG8B,KAAM7G,EAAGzB,EAAG8N,OAC1C,CACJ,IAAIxK,EAAGqJ,KAAyE,YAAlEiB,EAAIjI,IAAIrC,EAAI,qDAC1BA,EAAGqJ,KAAK/K,KAAK+J,EAAM,CAACzG,GAAI4I,EAAGpC,KAAM,CAAE,EAAEmC,KAAMlD,EAAG,GAAK1J,OAAOU,KAAKmM,GAAG1D,OAAO8D,UAAW9O,MAAOmE,EAAGnE,MAAM,IAAIH,QAASkP,GAAI3H,IACrHA,EAAG8B,KAAOsB,EAAUpD,EAAG8B,KAAM7G,EAAGzB,EAAG2L,EAAID,OACtCf,GAAKgB,EAAIkC,KAAKzN,QAAUmD,EAAG3B,KAAK+J,GAEjC,IAAI5G,EAAKzB,EAAGqJ,KAAKvM,OAKjB,SAASgO,EAAQ9H,EAAK4G,GACrB,IAAIrD,EAAM8B,EAAID,KAAK,KAChBwB,IAAMA,EAAItJ,MAAOsJ,EAAIH,IAAIzG,IAE5B,IAAI5B,EAAOmF,GAAOvD,EAAI5B,OAASlE,GAAO8F,EAAIsF,IAAItF,EAAIT,GAAGpC,GAAG,IAAIiB,MAAQlE,EAAIkL,QAAUlL,EAAMA,EAAIoG,KAAK,IAAInD,GAAG,IAAI,MAAQjD,EAAI,QAAWA,EAAM8F,EAAIM,KAAK,KAAON,EAAIsF,GAAKpL,EAAI,MAAQA,EAAI,MAAMA,EAAI,MAAM,IAAI,OACrMqJ,GAAO5B,EAAK3E,EAAIgD,EAAIT,GACjBnB,GAAS8B,EAAGkF,KAAK,MAIjBhH,IACHA,EAAO,IACN4B,EAAIsF,IAAItF,EAAIT,GAAG9B,MAAK,SAASyC,GAC7B,GAAGhG,EAAMgG,EAAG9B,MAAQ8B,EAAGkF,KAAO,OAAOhH,EAAK9C,KAAKpB,GAC/CkE,EAAK9C,KAAK4E,EAAGa,IACrB,IACO3C,EAAOA,EAAKwJ,UAAU7C,KAAK,MAE5BM,EAAID,KAAK,KAAOhH,GACfiG,MAAQrH,EAAG2F,QAAU3F,EAAG2F,MAAQ,CAAE,IAAGvE,GAASiH,EAAIrD,OAASqD,EAAIrD,KAAO,CAAC7E,EAAE,CAAE,KAAKA,EAAE,KAAOiB,UACnFpB,EAAG8J,KAAKrI,GACf4G,EAAIyB,MAAQvL,WAAWkB,KAAK4I,EAAIyB,MAAM,SAAS5H,GAAKA,GAAMA,GAAM,IAChElC,EAAGsK,IAAItK,KAfLkD,EAAG4G,OAAS5G,EAAG4G,KAAO,KAAKxL,MAAK,WAAYwM,EAAQ9H,EAAK4G,EAAI,GAiBrE,EA5BM5J,EAAG8J,OAAS9J,EAAG8J,KAAO,CAAA,IAAKrI,GAAM,GAClCvE,GAAOmL,EAAIoC,IAAOpD,EAAGmD,EAAIrM,EAAG+E,EAAGuH,IAAI1G,IAAI5F,GAAK+E,EAAGuH,KAAMtK,GACpDjD,EAAOsN,IAAMA,EAAErK,GAAG,IAAI,MAASjD,EAAIkE,MAAQlE,EAAIkL,MAAO0C,EAAQ,CAAC1J,KAAMlE,IAAQmL,EAAIoC,IAAI1G,IAAI+G,EAAS,CAACX,IAAKnK,EAAGmK,IAAmBE,MAAM,EAAGpH,IAAI,CAACc,IAAI,CAAC,IAAI,OA2B3J,CACI,IAAI9D,EAAGnD,OAAS,OAAOkD,EAAGsK,IAAItK,GAC9BA,EAAGT,KAAKmL,EACZ,CArDG,GAsDOvH,IAsDR,SAAanD,GACZ,IAAmB9C,EAAfgG,EAAKlD,EAAGmJ,IAAIhJ,EAChBH,EAAGmJ,IAAMnJ,EAAGmJ,IAAI1I,MAAK,SAASyC,GAC7B,GAAGA,EAAG9B,OAAS8B,EAAGa,IAAM,OAAOb,EAAGX,EAClCrF,EAAM8C,EAAGlB,MAAOkB,EAAGlB,KAAO,CAAA,GAAIoE,EAAGa,KAAO7G,CAC5C,IACO8C,EAAGmJ,KAAQnJ,EAAGmJ,IAAIhJ,EAAEiB,OACvBpB,EAAGmJ,IAAMjG,EAAGM,KAAKjB,EAAEwB,MAAM/D,EAAGlB,MAAM,IAAIqB,GAAG,IAAI,MAAQ+C,EAAGX,EAAE9B,KAAK,WAAVyC,KAEtDlD,EAAGmJ,IAAI7F,IAAItD,EAAGlB,KAAMkB,EAAG8D,IAAK9D,EAW/B,CAvIwB+D,CAAI/D,GAAKmD,EA8DjC,EA4CKmH,EAAI/D,IAAM,SAAS5B,EAAKnB,GAC1BmB,EAAK4B,IAAMwE,EACRpG,EAAKpE,IAAIN,KAAO0E,GAAQA,IAASA,EAAKpE,IAAIC,aAAcgD,EAAKmB,KAChEA,EAAKrE,KACL,EAAEgK,EAAIjI,IAAM,SAASrC,EAAIqC,IACxBrC,EAAG8D,KAAKiH,GAAM/M,KAAKgC,EAAIA,EAAGiD,IAAM,CAAEZ,IAAKrC,EAAGqC,IAAMC,EAAIuE,IAAIxE,KACzDrC,EAAGsK,IAAItK,EACV,EAyBM,IAAA7C,EAAe4N,EAAO,WAAU,EAAIxL,EAAOhB,WAAWgB,KAAMqD,EAAQN,EAAIM,MAAO0D,EAAYhE,EAAIO,MAAM1B,GAE3G,GA1JE5F,CA0JEA,EAAK,SAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,UACdA,EAAI,WACJA,EAAI,UACJA,EAAI,SACJA,EAAI,SACJc,EAAON,QAAUuG,CACnB,GAPE/G,CAOEA,EAAK,WAEPA,GAAI,SAASc,GACb,IAoIqCc,EApIjCmF,EAAM/G,EAAI,WACd+G,EAAII,MAAMhC,GAAK,SAASX,EAAKvE,EAAKwP,EAAKhL,GACtC,IAA8CiL,EAA1C9H,EAAMjD,KAAMmI,EAAMlF,EAAIhD,EAC1B,GADoCkI,EAAI7E,KACtB,iBAARzD,EACT,OAAIvE,GACJyP,EAAM5C,EAAI3H,GAAGX,EAAKvE,EAAKwP,GAAO3C,EAAKrI,GAChCgL,GAAOA,EAAIzI,IACZyI,EAAIE,OAASF,EAAIE,KAAO,KAAK5M,KAAK2M,GAE7B9H,GALUkF,EAAI3H,GAAGX,GAOzB,IAAIsB,EAAM7F,EAqCV,OApCC6F,GAAO,IAASA,EAAM,CAACwH,QAAQ,GAAQxH,GAAO,CAAE,GAAE4I,IAAM,EAAG5I,EAAIX,GAAK,EAKrEyC,EAAIY,IAAIhE,EAAKsB,GA+BN8B,CACV,EAKEb,EAAII,MAAM+D,KAAO,SAASvE,EAAIb,GAC7B,GADmCA,EAAMA,GAAO,IAC5Ca,EAAK,OA4BV,SAAciB,EAAI9B,EAAIqB,GAIrB,OAHAJ,EAAIuE,IAAIJ,KAAK,UAAW,uJACvB/D,EAAQS,EAAIT,SAASvC,EAAEgL,IAAMhI,EAAIsD,MAAK,SAAS3H,EAAMyG,GAAM7C,EAAMvC,EAAEO,GAAG,KAAMR,KAAKC,EAAE,IACpFuC,EAAMvC,EAAEwI,IAAMxF,EAAIhD,EAAEwI,IACbjG,CACV,CAjCmB0I,CAAKlL,MACjB,IAAAiD,EAAMjD,KAAMmI,EAAMlF,EAAIhD,EAAGqD,EAAO6E,EAAI7E,KAAa6E,EAAI/E,QAAiCpG,EAA5BuE,EAAKnF,OAAOC,OAAO,GAyBjF,OAxBA4G,EAAIY,KAAI,SAASjF,EAAKyG,EAAIvC,EAAI4G,GAC7B,IAAIrH,EAAIrC,KAAMgD,EAAKX,EAAEpC,EAAGkL,EAAOnI,EAAGmI,MAAMnI,EAAGmI,IAAI,CAAA,GAM/C,SAAS5E,EAAKhI,GACTyE,EAAGxF,KAAQwF,EAAG9B,OAAO8B,EAAK,CAACI,IAAKxE,EAAMiF,IAAKwB,IAC5CpI,KAAOD,EAAMgG,EAAGI,OAAOpG,IAAQ8F,EAAIsF,IAAI,IAAInI,GAAG,IAAImD,KAClD,iBAAmBhB,EAAIM,MAAM1F,KAC/BA,EAAMsG,EAAKjB,EAAEwB,IAAI7G,GAAKiD,EAAEmD,OACbnG,GAAMsB,EAMfmL,EAAIjF,MAAmB,KAAO0G,EAAI5J,KAAe4J,EAAI5J,GAAM,IAC3D4G,EAAIjH,MAAQiH,EAAI3K,MAAMkM,EAAItJ,MAC7B4B,EAAGlE,KAAKuE,EAAGrF,EAAKgG,EAAGa,KACnB3B,aAAaiJ,EAAI5J,KARf4J,EAAI5J,GAAMlD,YAAW,WAAYkI,EAAK,KAAMpF,EAAIyI,MAAM,GAU7D,CArBOF,EAAIjF,MAAmB,KAAO0G,EAAI5J,MAClC,KAAUvE,EAAMoF,EAAIM,MAAM9D,IAC1B,iBAAmB5B,IACtBkF,cAAciG,EAAIgD,KAAK,IAAI5J,IAC3BW,aAAaiJ,EAAI5J,IAAM4J,EAAI5J,GAAMlD,WAAWkI,EAAMpF,EAAIyI,MAAM,KAHtBrD,IAoB1C,GAAM,CAAC/F,GAAI,IACDyC,CACV,EAQEb,EAAII,MAAMpC,IAAM,WAEf,IAA4BpD,EAAZgG,EAANhD,KAAeC,EACrBkI,EAAMnF,EAAGzC,KACb,GAAI4H,EAoCJ,OAnCAnF,EAAGY,IAAM,GACN5G,EAAMmL,EAAIjI,OACTlD,EAAIgG,EAAGa,aACF7G,EAAIgG,EAAGa,MAMZ7G,EAAMmL,EAAIkB,cACNlB,EAAIkB,IACXlB,EAAIkB,IAAM,KAERrM,EAAMmL,EAAIvF,aACL5F,EAAIgG,EAAGa,MAEZ7G,EAAMmL,EAAI/E,aACLpG,EAAIgG,EAAGa,MAEZ7G,EAAMgG,EAAG9B,cACJiH,EAAI7E,KAAKmC,MAAMzI,IAEpBA,EAAMgG,EAAGiD,MACXxI,OAAOU,KAAKnB,GAAKsK,SAAQ,SAASnK,EAAE6F,IAAKA,EAAKhG,EAAIG,IAC3C+K,MACLC,EAAI7E,KAAKjB,EAAEwB,IAAIb,EAAGkF,MAAM9H,KAE9B,KAEMpD,EAAMgG,EAAG9C,OACXzC,OAAOU,KAAKnB,GAAKsK,SAAQ,SAASnK,EAAEiO,GAAcpO,EAAIG,GAChDkF,EAAEjC,KACZ,IAEG4C,EAAGxC,GAAG,MAAO,CAAA,GArCHR,IAuCb,CAEA,GAtIE3E,CAsIEA,EAAK,QAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,WAAY6E,EAAOkC,EAAII,MAAMqB,IAAI3D,KAmC/C,SAAS+F,EAAInD,GAAM9C,KAAKD,GAAGG,KAAK4C,GAC/B,IAA2D9F,EAAvDmL,EAAMnI,KAAKF,GAAiBkD,EAAPF,EAAIT,EAAYpC,EAAGmD,EAAMN,EAAIM,KAClDJ,EAAG9B,MAAS4B,EAAIsF,OAChBpL,EAAMmL,EAAIM,OAASrM,OAAOS,MAAMiG,EAAIe,MAAOT,GAAK,IAAI,KAAMpG,EAAI,MAAQA,EAAI,MAAQA,IACtFoF,EAAI5B,GAAG0H,KAAKpF,EAAKqF,GACpB,CAvCE/F,EAAII,MAAMqB,IAAI3D,KAAO,SAAS+C,EAAKwF,GAAM,IAAIzL,EAC5C,OAAIS,OAAOG,MAAM6K,IACdzL,IAAQA,EAAMyL,EAAI,OAAO,IAAI,MAAQzL,GAAaiG,EAAIY,IAAI7G,KAC5DA,EAAMiG,EAAIT,QAAQvC,GAAGwI,IAAMA,EAC5BxF,EAAIzC,GAAG,MAAM,SAASkJ,GAClBtN,OAAOS,MAAM6M,EAAI7F,MAAO6F,EAAItG,KAAK,IAAI,KAAMqF,EAAI,MAAQA,EAAI,MAAQA,IACrEzL,EAAIwD,GAAG,KAAMkJ,GAEd1J,KAAKD,GAAGG,KAAKwJ,EACjB,IACU1M,EAAIqF,IATqBnC,GAAM2K,GAAM5H,EAAKwF,EAUpD,EACErG,EAAII,MAAMyD,IAAM,SAASjE,EAAIb,EAAKrE,GACjC,IAA6B2L,EAAKjG,EAA9BS,EAAMjD,KAAMmI,EAAMlF,EAAIhD,EAE1B,OADGxC,OAAOG,MAAMoE,KAAMyG,EAAMzG,EAAG,KAAMA,EAAK,CAAC,IAAKA,GAAKA,EAAK/E,GACtD+E,GAOJI,EAAIuE,IAAIJ,KAAK,QAAS,yJACtB/D,EAAQS,EAAIT,QACZS,EAAIgD,MAAMzF,IAAG,SAAS5B,EAAMyG,EAAKvC,EAAK4G,GACrC,IAAIxJ,GAAQ8B,GAAI6I,GAAM/M,KAAKkC,KAAMpB,EAAMyG,EAAKvC,EAAK4G,GACjD,GAAGzM,IAAMiD,EAAT,CACA,GAAGtB,IAASsB,EAAO,OAAOsC,EAAMvC,EAAEO,GAAG,KAAMsC,GAC3C,GAAGV,EAAIpB,GAAGd,GAAQ,OAAOsC,EAAMvC,EAAEO,GAAG,KAAMN,EAAKD,GAC/C,IAAIjD,EAAM,CAAA,EAAIS,OAAOU,KAAK2E,EAAIM,KAAKkE,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK6E,EAAIM,IAAInF,EAAI,GAAEjB,GAAMA,EAAI,KAAOkD,EAChGsC,EAAMvC,EAAEO,GAAG,KAAM,CAACqD,IAAKwB,EAAKjC,IAAKpG,GAJX,CAK1B,IACUwF,KAhBHA,EAAQ2F,EAAI5I,SACd4I,EAAI5I,KAAOiD,EAAQS,EAAIT,SAASvC,EAAEwI,IAAMA,GAAOjG,EAAMvC,EAAEwI,KAAON,EAAIM,IACnEjG,EAAMvC,EAAEgL,IAAMhI,EAAI1C,KAAK,OACvB0C,EAAIzC,GAAG,KAAMyF,EAAKzD,EAAMvC,IAHKuC,EAiBjC,MAO4DvF,EAAtD4N,EAAO,WAAY,CACzB,GA3CExP,CA2CEA,EAAK,SAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,WACd+G,EAAII,MAAM6I,IAAM,SAASC,EAAMtJ,EAAIb,GAClC,IAAqCD,EAAMlE,EAAvCiG,EAAMjD,KAAMsD,EAAOL,EAAI1C,MAAM,GAIjC,OAHAyB,EAAKA,GAAM,cACXb,EAAMA,GAAO,CAAA,GAAQmK,KAAOnK,EAAImK,MAAQA,GACrCpK,IAASoK,GAAM,IAAIrL,GAAG,IAAI,SAAQqL,EAAO,CAAE,GAAE,KAAOpK,GACpD,iBAAoBlE,EAAMoF,EAAIM,MAAM4I,IAAgBrI,EAAIY,IAAI3C,EAAOlE,GAAKoG,IAAIkI,EAAMtJ,EAAIb,GACrFiB,EAAIpB,GAAGsK,IAMXrI,EAAIG,KAAI,SAAS2D,GAChBuE,EAAKzH,KAAI,SAAS3C,EAAMnE,EAAG+F,GAC1B,IAAI5B,EAAO,OAAOc,EAAGlE,KAAKmF,EAAK,CAACd,IAAKC,EAAIuE,IAAI,mCAAqC7D,EAAIM,IAAM,SAC3FpG,EAAM,IAAIkE,GAAQ,CAAC,IAAKA,GAAO6F,EAAG/J,EACnC,IAAC,MAEIsO,IAXH7N,OAAOG,MAAM0N,KACfA,EAAOhI,EAAKO,IAAI3C,EAAO+B,EAAI1C,KAAK,WAAT0C,IAAwBG,IAAIkI,IAE7CrI,EAAIY,IAAI3C,GAAQoC,EAAK/C,KAAK,WAAV+C,CAAsB,IAAIF,IAAIkI,EAAMtJ,EAAIb,GASnE,CACA,GAtBE9F,CAsBEA,EAAK,SAEPA,GAAI,SAASc,GACbd,EAAI,UAEJ,IAwV4B4B,EAxVxB4N,EAAO,WAAU,EACjBU,EAAQ/E,KAAKgF,YAAc,SAAS1O,EAAEkF,EAAGtC,GAAI,IAAO4K,GAAK,IAAIpL,KAAM,IAAK8C,EAAvB/E,UAA6BuJ,KAAK+E,MAAMzO,EAAE4C,GAAI+L,EAAKC,OAAO,IAAIxM,KAAOoL,GAAG,CAAE,MAAM3L,GAAIqD,EAAGrD,GAAI,EAC5I8M,EAAOjF,KAAKmF,gBAAkB,SAASlL,EAAEuB,EAAGtC,EAAElD,GAAI,IAAO8N,GAAK,IAAIpL,KAAM,IAAK8C,EAAvB/E,UAA6BuJ,KAAKC,UAAUhG,EAAEf,EAAElD,GAAIiP,EAAKC,OAAO,IAAIxM,KAAOoL,IAAK,MAAM3L,GAAIqD,EAAGrD,GAAI,EAC3J8M,EAAKC,MAAQ,SAASpB,GAAOA,EAAI,KAAKxI,QAAQ6E,IAAI,sEAAuE8E,EAAKC,MAAQb,EAAM,EAuV3I,IAAK1O,EAAON,QArVb,SAAcyH,GACb,IAAIsI,EAAO,aACPzK,EAAMmC,EAAKnC,KAAO,GACtBA,EAAIwF,IAAMxF,EAAIwF,KAAO7E,QAAQ6E,IAC7BxF,EAAI0K,IAAM1K,EAAI0K,KAAO1K,EAAIyI,MAAQ,EACjCzI,EAAIE,IAAMF,EAAIE,KAA4D,IAApDF,EAAI2K,OAAsB,IAAb3K,EAAI2K,OAAe,IAAO,KAC7D3K,EAAI4K,KAAO5K,EAAI4K,MAAmB,IAAV5K,EAAIE,IAAa,IACzCF,EAAI6K,KAAO7K,EAAI6K,MAAQ,EACvB,IAAIA,EAAO3N,WAAWgB,MAAQhB,WAE1B+C,EAAMkC,EAAKlC,IAAK6K,EAAY7K,EAAI7D,MAAO2O,EAAY9K,EAAIK,MAIvD0K,EAAOP,EAAKO,KAAO,SAASC,EAAKC,GACpC,GAAID,EAAJ,CACA,GAAGjL,EAAIE,KAAO+K,EAAIxP,OAAS,OAAOgP,EAAKU,IAAI,CAACC,IAAK,IAAKpK,IAAK,oBAAqBkK,GAC7ET,IAAS5L,OAOXmM,EAAK7B,GAAK8B,EAAIxP,QAAQ,IAAMuP,EAAK5P,GAClC,IACkBuG,EADdtD,EAAI6M,EAAKG,IAAM,IAAItN,KACnBlC,EAAMoP,EAAI,GAEd,MAAG,MAAQpP,GACVuO,EAAMa,GAAK,SAASjK,EAAKW,GACxB,GAAGX,IAAQW,EAAM,OAAO8I,EAAKU,IAAI,CAACC,IAAK,IAAKpK,IAAK,yBAA0BkK,GAC3EvK,QAAQC,MAAQD,QAAQC,MAAM,IAAI7C,KAAM4D,EAAIlG,OAAQ,mBACpD,IAAI6P,EAAItL,EAAI6K,MACX,SAASjF,IAEK,IADd,IACW2F,EADPlN,GAAK,IAAIN,KACT/B,EAAI,EAAYA,EAAIsP,IAAMC,EAAI5J,EAAI3F,OAAQyO,EAAKO,KAAKO,EAAGL,GAC3DvJ,EAAMA,EAAIrH,MAAM0B,GAChB2E,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,aAC/CmN,EAAMN,GACFvJ,EAAIlG,QACRoP,EAAKjF,EAAI,EAChB,CARM,EASN,SACKqF,EAAM,KAGJ,MAAQpP,IAASoP,EAAI,MAAQ3O,OAAOG,MAAMwO,MAAUtJ,EAAMsJ,GACzDtJ,EAAaqJ,EAAKhB,IAAIrI,EAAKuJ,EAAM7M,QACpC+L,EAAMa,GAAK,SAASjK,EAAKW,GACxB,GAAGX,IAAQW,EAAM,OAAO8I,EAAKU,IAAI,CAACC,IAAK,IAAKpK,IAAK,yBAA0BkK,GAC3EF,EAAKhB,IAAIrI,EAAKuJ,EAAM7M,EAC1B,SALI,CA/BgB,CAuCpB,EAgLG,SAASmN,EAAMN,GACV,IAAArP,EAAMqP,EAAKO,MAAO9P,EAAI,iBAAmBE,EAG7C,GAFGF,IAAIE,GAAO,KACdqP,EAAKO,MAAQP,EAAKQ,KAAO,KACrB7P,KACDF,EAAG,EAAIE,EAAIJ,QAAUI,EAAIJ,QAA5B,CACA,IAAIE,EAAG,IAAIE,EAAO,IAAMA,EAAIJ,OAAQI,EAAI,GAAKwJ,KAAKC,UAAUzJ,EAChE,CAAK,MAAM2B,GAAG,OAAOwC,EAAIwF,IAAI,2BAA4BhI,EAAE,CACnD3B,GACJ8P,EAAK9P,EAAKqP,EAJmC,CAKjD,CAEG,SAASS,EAAKV,EAAKC,GAAO,IACzB,IAAIU,EAAOV,EAAKU,KACbV,EAAKC,IACPD,EAAKC,IAAIF,GAEPW,EAAKD,MACPC,EAAKD,KAAKV,GAEXR,EAAKU,IAAIhC,GAAK8B,EAAIxP,QAAQ,IAAKgP,EAAKU,IAAI/P,CACxC,CAAA,MAAMoC,IACL0N,EAAKW,MAAQX,EAAKW,OAAS,IAAI5O,KAAKgO,GACrC,CAoFD,OA1RAD,EAAKhB,IAAM,SAASrI,EAAKuJ,EAAM7M,GAC9B,IAAI+B,EAAIrE,EAAMF,EAAKiQ,EAAK/J,EAKxB,GAJGJ,EAAII,MAAMJ,EAAII,IAAMA,EAAM,CAACA,IAAKJ,EAAII,MACvCA,IAAQA,EAAIgK,EAAI1N,GAChB0D,IAAQA,EAAIiK,IAAM,IAAIjO,OACjBqC,EAAKuB,EAAI,QAAQvB,EAAKuB,EAAI,KAAO1G,OAAOC,OAAO,OACjDW,EAAMiP,EAAU1K,MAEdrE,EAAO4F,EAAI,SACJ9F,EAAM8F,EAAI,MAASA,EAAIe,KAAOtC,IAAQH,EAAI7D,MAAM0P,EAAMjQ,EAAIE,IAAtE,CAIA,IAHC4F,EAAI7C,EAAI,WAAU,GAAIgJ,IAAM2C,EAAKwB,KAAOf,GACrCrP,EAAM8F,EAAI,QAAU,iBAAmB9F,GAAMA,EAAIvB,MAAM,EAAE,IAAIM,MAAM,KAAKuL,SAAQ,SAASrJ,GAAI+B,KAAK/B,GAAK,CAAG,GAAG6E,EAAK,EAAEuK,GAAK,CAAE,GAE5HrQ,EAAM8F,EAAIyJ,IAKZ,OAJGvP,EAAM4O,EAAKO,KAAKnP,KAClBA,EAAI8F,EAAKuJ,EAAM/I,QAEhB4I,EAAU3K,IAGRvE,EAAM8F,EAAIW,MAAKX,EAAI7C,EAAEqN,KAAOtQ,EAAI,MAC/BwC,GAAK,IAAIN,KACbgE,IAAQA,EAAIlC,GAAKxB,GAAI6M,EAAKkB,GAAKhM,EAC/B2K,EAAUrK,GAAK,SAASyI,GACpB/I,IAAO+I,IACV4B,EAAUrK,GAAK,GACVyI,EAAIlJ,EAAI5E,EAAE+E,MACf+I,EAAErB,IAAMoD,EACLvJ,EAAIe,MAAMyG,EAAE5I,GAAKoB,IACzB,EACIQ,EAAK9C,GAAG,KAAMoL,EAAKtL,KAAOwC,GAC1BI,IAAQA,EAAIsK,IAAM,IAAItO,MACtB4C,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAGsD,EAAIe,IAAK,UAAYf,EAAIM,IAAK,UAAY,OACzF8I,EAAU3K,GACP0L,GAAMf,EAAUe,GACnBrB,EAAKwB,KAAOxB,EAAKtL,KAAO,IA1B8D,CA2B1F,EAEG6L,EAAK5P,EAAI4P,EAAK7B,EAAI,EAEhB,WACD,IACImD,EADAC,EAAO,EAeX,SAAS9G,EAAK3I,EAAGwC,GAAI,IAAIzD,EACxB,OAAKyD,aAAahD,QAClBA,OAAOU,KAAKsC,GAAGmG,OAAOU,QAAQqG,EAAO,CAAC5N,GAAI/C,EAAM,CAAA,EAAIwD,GAAIC,IACjDzD,GAF4ByD,CAGnC,CAAC,SAASkN,EAAM1P,GAAI+B,KAAKD,GAAG9B,GAAK+B,KAAKQ,GAAGvC,EAAE,CAjB5C2N,EAAK1O,KAAO,SAAS4F,EAAKuJ,GAAO,IAAIa,EAAG1Q,EAAGM,EACtC0C,GAAK,IAAIN,KACbuM,EAAK3I,EAAIM,KAAK,SAASlG,EAAKiF,EAAKyL,GAChC,IAAIC,GAAMrR,IAAMA,EAAIM,EAAI8Q,GAAM,KAAKnS,MAAM,EAAG,OAC3CyR,EAAI9Q,OAAOc,KAAK2Q,EAAIX,IAAI1Q,EAAIA,EAAEf,MAAM,QAC7BuQ,EAAK9O,EAAM,IACnB4E,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,iBAC9CsD,EAAI7C,EAAE6N,KAAOhR,EACbgG,EAAI,MAAQoK,EACZtB,EAAKU,IAAIxJ,EAAKuJ,UACPvJ,EAAI7C,EAAE6N,KACd,GAAElH,EACR,EAOcgF,EAAKU,IAAM,SAASxJ,EAAKuJ,GAAO,IAAIrP,EAE7C,IADIA,EAAMgD,QAAUhD,EAAMA,EAAI+C,KAAO/C,EAAIkD,MAAOlD,EAAIkD,KAAK4C,IACrDA,EAAM,OAAO,EACjB,IAAIvB,EAAIrE,EAAMkP,EAAKxI,EAAMd,EAAI,KAEzBiL,EAAOjL,EAAI7C,IAAI6C,EAAI7C,EAAE,WAAU,GAC/BiD,EAAMJ,EAAII,IAAK1D,GAAK,IAAIN,KAI5B,GAJkC6O,EAAKC,EAAID,EAAKC,GAAKxO,EAAO6M,GAAOnJ,IAAQA,EAAI8K,EAAIxO,IAC9E+B,EAAKuB,EAAI,QAAQvB,EAAKuB,EAAI,KAAO1G,OAAOC,OAAO,KACnDoR,GAAQvB,EAAU3K,IAEdrE,EAAO4F,EAAI,QAAU7F,IAAM6F,EAAIM,KAAQ2K,EAAK9E,MAAOrF,EAAxD,CAEA,IADIyI,GAAQzI,IAAMyI,GAASrP,EAAMoE,EAAI5E,EAAEoH,MAAU5G,EAAIiM,MAASjM,EAAMA,EAAI0E,MAAQ1E,EAAMA,EAAIiD,IAAMjD,EAAIiM,OAAYjM,EAAM4O,EAAKtL,OAASsD,IAAQ5G,EAAI,MAAQ4O,EAAKwB,OACzJf,GAAQzI,EAAI,CACf,GAAGxC,EAAI5E,EAAEoH,GAAO,OAEhB,OADA9B,QAAQC,MAAQD,QAAQC,MAAM,IAAI7C,OAAQwO,EAAM,4BACzC,CACP,CACD,GAAG9J,IAAQd,EAAIM,MAAQlG,KAAUkE,EAAI5E,EAAEoH,IAAM,IAAIlC,IAAI,IAAI,MAAQ,OAAO,EACxE,IAAI2K,GAAQT,EAAKqC,IAAM,OAAOrC,EAAKqC,IAAInL,GAEvC,GADAI,IAAQA,EAAIgL,IAAM,IAAIhP,MACjBkN,EAAM2B,EAAK3B,IAAhB,CAEA,GADAlJ,IAAQA,EAAIiL,IAAM,IAAIjP,OAClBmN,IAASA,EAAK9K,GAAG,CACpB,IAAI9D,OAAOG,MAAMyO,GAAQlL,EAAIiG,OAAS,OAAO,EACzC5H,GAAK,IAAIN,KACLiC,EAAI6K,KAAI,IAAEoC,EAAKjN,EAAIiG,MAAOiH,EAAK5Q,OAAOU,KAAKkO,GAAQlL,EAAIiG,OAAS,CAAA,GAiBxE,OAhBAtF,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,kBAC7C,SAASuH,IACV,IAAIvH,GAAK,IAAIN,KAEbuO,EAAO,EAAG,IAAIa,EAAKP,EAAK3B,IAAK2B,EAAK3B,IAAMA,EAC1B,IAAd,IAAWtQ,EAAPqB,EAAI,EAAYA,EAAI,IAAMrB,GAAKuS,GAAI,IAAIlR,QACrCrB,EAAIsS,EAAGtS,KAAOuQ,GAAM,IAAIvQ,KAC7B8P,EAAKU,IAAIxJ,EAAKhH,GAEfiS,EAAK3B,IAAMkC,EAAIb,EAAO,EACtBY,EAAKA,EAAG5S,MAAM0B,GACd2E,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,YAC3C6O,EAAGzR,SACPoP,EAAKjF,EAAI,GACTnD,GAAOsI,EAAUtI,GACxB,CAdO,EAgBP,CAGK,IADIyI,EAAKU,MAAQnB,EAAKmB,MAAOnB,EAAKmB,KAAKV,GACpC9K,IAAO8K,EAAK/L,KAAf,CACA,GAD+B+L,EAAK/L,KAAOiB,EACxC8K,IAAS0B,EAAK9E,IAAM,OAAO,EAC9B,IAAIjM,EAAM+Q,EAAKV,MAAQrQ,EAAIqP,EAAK9E,MAAQvK,EAAIqP,EAAKkC,MAAQvR,EAAIqP,EAAK9K,KAAiB,OAAO,EAG1F,GAFAO,QAAQC,MAAQD,QAAQC,KAAKvC,IAAK0D,GAAK6K,GAAMS,IAAM,IAAItP,OAAS6O,EAAKC,GAAKxO,GAAI,aAC7EiO,GAAQ7J,GAAOsI,EAAUtI,GACvByI,EAAKO,MAAM,CAEb,GADAP,EAAKQ,MAAQ7P,EAAMqP,EAAKQ,MAAQ,GAAKT,EAAIxP,OACtCyP,EAAKQ,MAAQ1L,EAAI4K,KAEnB,YADAM,EAAKO,QAAU5P,EAAI,IAAI,IAAIoP,GAG5BO,EAAMN,EACZ,CACKA,EAAKO,MAAQ,IACb,IAAI6B,GAAM,IAAIvP,KACdb,YAAW,WACVyD,QAAQC,MAAQD,QAAQC,KAAK0M,GAAK,IAAIvP,KAAOuP,EAAI,UACjD9B,EAAMN,EACZ,GAAQlL,EAAI0K,KACPiB,EAAKV,EAAKC,GACVvK,QAAQC,MAAS6B,IAAQyI,EAAKkB,IAAOzL,QAAQC,KAAKvC,GAAI,IAAIN,KAAOmN,EAAKG,GAAI,UApB9C,CA1BsB,MAA3BZ,EAAKQ,IAAItJ,EAAKuJ,EAVuD,MAA9BT,EAAK1O,KAAK4F,EAAKuJ,EAyDlF,EACIT,EAAKU,IAAI/P,EAAIqP,EAAKU,IAAIhC,EAAI,EAE1BsB,EAAKQ,IAAM,SAAStJ,EAAKuJ,GACxB,IAAIvJ,EAAM,MAAO,GACjB,IAA0BM,EAAKpG,EAA3B+Q,EAAQjL,EAAK,GAAK,CAAE,EACxB,GAAG9F,EAAM+Q,EAAK3B,IAAM,OAAOpP,EAC3B,GAAG,iBAAmB8F,EAAM,OAAOA,EACnC,IAAI5F,EAAO4F,EAAI,MAAOc,EAAMd,EAAI,KAChC,GAAG5F,GAAQ0G,EAAI,CACd,IAAImK,EAAK9E,KAAOgD,EAAUrI,EAAI1G,GAAQ,OAAO,EAC7C,GAAGF,GAAOoE,EAAI5E,EAAEoH,IAAM,IAAIlC,GAAG,CAC5B,GAAGxE,IAASF,EAAI,MAAQ,OAAO,EAC3BA,EAAI,QAAQA,EAAI,MAAQE,EACnC,CACA,CACK,IAAI4F,EAAIyJ,MAAQzJ,EAAI,KAAK,CACxB,IAAI3F,EAAI,EAAG4C,EAAK,GAChB,IAAI,IAAI9B,KADYjB,EAAMmE,EAAIiG,MACb,CAAE,IAAItL,EAAIkB,EAAIiB,GAE9B,GADA8B,EAAG3B,KAAKtC,EAAEyL,KAAOzL,EAAEyS,KAAOzS,EAAEyF,MACvBpE,EAAI,EAAI,KACpB,CACSA,EAAI,IAAI2F,EAAI,MAAQ/C,EAAG8H,OAChC,CAEK,GADG/E,EAAIM,MAAQpG,EAAM8F,EAAIW,MAAMX,EAAIW,GAAK,CAAC,KAAKzG,EAAI,MAAM,GAAG,EAAG,IAAMA,EAAI,MAAM8F,EAAI7C,EAAEqN,KAAO1B,EAAK0B,KAAOtQ,EAAI,OACxGoG,EAAM2K,EAAKD,KAUb,OATA9Q,EAAM,CAAE,EAAES,OAAOU,KAAK2E,GAAKwE,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK6E,EAAI7E,EAAE,IAC/DjB,EAAIoG,IAAM,cACVqI,EAAKzO,GAAK,SAASmF,EAAKiK,GACvB,IAAGjK,EAAH,CACA,IAAI3C,GAAK,IAAIN,KACblC,EAAMoP,EAAIlO,QAAQ,kBAClBwQ,EAAIzR,EAAGmP,EAAMA,EAAI3Q,MAAM,EAAGuB,EAAI,GAAKoG,EAAMgJ,EAAI3Q,MAAMuB,EAAM,KACzD8E,QAAQC,MAAQD,QAAQC,KAAKvC,GAAI,IAAIN,KAAOM,EAAG,YAJ9B,CAKxB,IAIK,SAASkP,EAAIvM,EAAKiK,GACdjK,IACH4L,EAAK3B,IAAMA,EACXR,EAAKU,IAAIxJ,EAAKuJ,GACpB,CALKZ,EAAK3I,EAAK4L,EAMf,CACA,CArII,GAgKD9C,EAAK0B,KAAO,EACZ1B,EAAK+C,GAAK,SAAStC,GAClB,IAAsBrP,EAAXqP,EAAKU,MAEbV,EAAK9K,GACPJ,EAAIiG,MAAMiF,EAAK9E,KAAO8E,EAAK9K,IAAM8K,GAEjCrP,EAAMqP,EAAK9K,GAAK8K,EAAK9K,IAAM8K,EAAK9E,KAAOnL,OAAOC,OAAO,GACrDuP,EAAKU,IAAI,CAACC,IAAK,IAAKgC,IAAKjL,EAAKnC,IAAIoN,KAAMpN,EAAIiG,MAAMpK,GAAOqP,UAClDjL,EAAI5E,EAAE6P,EAAK/L,OAEf+L,EAAKuC,MACRhD,EAAK0B,OACLjB,EAAKuC,SAAY1P,KACjBoE,EAAK9C,GAAG,KAAM6L,IAGfrP,EAAMqP,EAAKW,MAAOX,EAAKW,MAAQ,GAC/B3O,WAAWkB,KAAKvC,GAAK,IAAG,SAAS8F,GAChCgK,EAAKhK,EAAKuJ,EACf,GAAM,EAAE,IAjBOT,EAAKmB,KAAMV,EAAKzP,QAAU,CAAC2K,IAAK8E,EAAM9K,GAAI8K,IAAUA,EAmBnE,EACGT,EAAKiD,IAAM,SAASxC,GACnBA,EAAKuC,OAAShD,EAAK0B,YACZjB,EAAKuC,IACZtL,EAAK9C,GAAG,MAAO6L,GACf,IAAIrP,GAAM,IAAMkC,KAAOlC,GAAcqP,EAAKuC,KAAK5R,EAC/C4O,EAAKiD,IAAIC,OAASlD,EAAKiD,IAAIC,MAAQ9R,GAAOA,GAAO,CACrD,EACG4O,EAAKO,KAAK,KAAO,SAASrJ,EAAKuJ,GAAOlL,EAAIwF,IAAI,SAAU7D,EAAIX,IAAI,EAChEyJ,EAAKO,KAAK,KAAO,SAASrJ,EAAKuJ,GAC3BvJ,EAAIyL,MACFlC,EAAKkC,MAAMlC,EAAKkC,IAAMzL,EAAIyL,KAC3BzL,EAAI,QAER8I,EAAKU,IAAI,CAACC,IAAK,IAAKgC,IAAKpN,EAAIoN,IAAK,IAAKzL,EAAI,MAAOuJ,UAC3CjL,EAAI5E,EAAE6P,EAAK/L,MACtB,EACGsL,EAAKO,KAAU,IAAI,SAASrJ,EAAKuJ,GAChC,GAAIvJ,EAAIsE,MAAR,CACA,IAAIA,EAAQ3J,OAAOU,KAAK2E,EAAIsE,OAAQ+D,EAAM/D,EAAO1K,KAAKL,SAAS+K,EAAMxK,OAAW,GAC5EuO,IACJS,EAAKiD,IAAIxC,GACTT,EAAK+C,GAAGxD,GAJc,CAK1B,EAEG7H,EAAK9C,GAAG,UAAU,SAAS8C,GAC1BA,EAAKnC,IAAIoN,IAAMjL,EAAKnC,IAAIoN,KAAOnS,OAAOC,OAAO,GAC7C2D,KAAKD,GAAGG,KAAKoD,GACbA,EAAK9C,GAAG,MAAOoL,EAAKU,IACxB,IAEGhJ,EAAK9C,GAAG,OAAO,SAAS6L,EAAMrP,GAC7BqP,EAAOlL,EAAIiG,MAAMiF,EAAK9K,IAAM8K,IAASA,EACrCrM,KAAKD,GAAGG,KAAKmM,GACbA,EAAKwC,IAAKxC,EAAKwC,OAAS7R,EAAMqP,EAAKU,OAAS/P,EAAI+R,OAAS/R,EAAI+R,eACtD5N,EAAIiG,MAAMiF,EAAK9K,IACtB8K,EAAKU,KAAO,IAChB,IAGGzJ,EAAK9C,GAAG,OAAO,SAAS6L,EAAMrP,GAAMgD,KAAKD,GAAGG,KAAKmM,IAC7CrP,EAAM8E,QAAQC,QAAO/E,EAAIoK,MAAQwE,EAAK0B,OACpCtQ,EAAMqP,EAAK9E,MAChBlJ,YAAW,WAA8B,GAAC8C,EAAIc,MAAQ,IAC1D,IACGqB,EAAK9C,GAAG,MAAM,SAAS6L,EAAMrP,GAE5B,GAFkCgD,KAAKD,GAAGG,KAAKmM,IAC5CrP,EAAM8E,QAAQC,QAAO/E,EAAIoK,MAAQwE,EAAK0B,OACtCnM,EAAIwI,MAAP,CACA,IAAIqF,EAAQvR,OAAOU,KAAKmF,EAAKpD,MAAM,IAChC8O,EAAMpS,OAAS,OAASkF,QAAQmN,MAAOnN,QAAQ6E,IAAI7E,QAAQmN,KAAO,4HACrE5Q,WAAWkB,KAAKyP,GAAO,SAAS9N,GAAO,IAAI4D,EAAOxB,EAAKpD,KAAKgB,GACxDC,EAAIwI,QAAU7E,EAAKlC,KAAK,IAAI,IAAMgJ,EAAKU,IAAI,CAACzI,IAAK,CAAC,IAAK3C,IAAQmL,GAClEhO,WAAWkB,KAAK9B,OAAOU,KAAK2G,EAAKlC,KAAK,KAAK,SAASyC,GAAUA,GAE7DuG,EAAKU,IAAI,CAAC,KAAMlQ,OAAOc,MAAMoG,EAAKmC,MAAMvE,IAAO,IAAImE,IAAOxB,IAAK,CAAC,IAAK3C,EAAM,IAAKmE,IAAOgH,KAG7F,GAV2B,CAW3B,IAEUT,CACV,CAG+B,CAAA,MAAMjN,GAAE,CAEvC,GA/VEtD,CA+VEA,EAAK,UAEPA,GAAI,SAASc,GACb,IAAIiG,EAAM/G,EAAI,WACd+G,EAAI8M,KAAO7T,EAAI,UAKf+G,EAAI5B,GAAG,OAAO,SAAS8C,GAEtB,GADAtD,KAAKD,GAAGG,KAAKoD,IACVA,EAAKiD,KAAR,CACA,IAAIpF,EAAMmC,EAAKnC,IACf,IAAG,IAAUA,EAAIgO,UAAjB,CAEA,IAAIC,EAAMhN,EAAIsE,QAAU,GACpB2I,EAAYlO,EAAIgO,WAAaC,EAAID,WAAaC,EAAIE,iBAAmBF,EAAIG,aAC7E,GAAIF,EAAJ,CACAlO,EAAIgO,UAAYE,EAEhB,IAAIzD,EAAOzK,EAAIyK,KAAOzK,EAAIyK,MAAQxJ,EAAI8M,KAAK5L,GAEhCsI,EAAKmB,MAAQ5L,EAAI4L,KAC5BnB,EAAKmB,KAAO5L,EAAI4L,KAAOyC,EAsBvBnR,YAAW,YAAa8C,EAAIwI,OAASrG,EAAK9C,GAAG,MAAO,CAAC+L,IAAI,MAAQ,GAAC,GAElE,IAAI3C,EAAO,KAWP6F,EAAO,GAEaxS,kBAFGyS,UAAaA,QAzClB,CAJa,CAFd,CAarB,SAASF,EAAKnD,GAAO,IACpB,IAAIA,IAASA,EAAK9E,IAAM,OAAOwF,GAAQA,EAAKV,GAC5C,IAAI9E,EAAM8E,EAAK9E,IAAItL,QAAQ,QAAS,MAChC8Q,EAAOV,EAAKU,KAAO,IAAI5L,EAAIgO,UAAU5H,GAezC,OAdAwF,EAAK4C,QAAU,WACdC,EAAUvD,GACVlL,EAAIyK,KAAKiD,IAAIxC,IAEdU,EAAK8C,QAAU,SAAS1N,GACvByN,EAAUvD,IAEXU,EAAK+C,OAAS,WACb3O,EAAIyK,KAAK+C,GAAGtC,EACjB,EACIU,EAAKrO,UAAY,SAASoE,GACrBA,GACJ3B,EAAIyK,KAAKO,KAAKrJ,EAAIlE,MAAQkE,EAAKuJ,IAEzBU,CACX,CAAI,MAAMpO,GAAIwC,EAAIyK,KAAKiD,IAAIxC,GAAO,CAK/B,SAASuD,EAAUvD,GAClBnK,aAAamK,EAAK0D,OACd5O,EAAIiG,MAAMiF,EAAK9E,OAChBkI,GAAOpD,EAAK2D,OAAS,IACxB3D,EAAK2D,OAAS3D,EAAK2D,OAAS7O,EAAI6O,MAAM,GAAK,MAAS3D,EAAK4D,OAAS5D,EAAK4D,OAAS,IAAI/Q,MAAa,EAAL0K,EAAQ,EAAE,GACtGyC,EAAK0D,MAAQ1R,YAAW,SAAS0B,IAChC,GAAG0P,GAAOA,EAAIS,OAAS,OAAO7R,WAAW0B,EAAG6J,GAC5C4F,EAAKnD,EACL,GAAEzC,IACP,CAEA,GAEA,GA3DEvO,CA2DEA,EAAK,eAEPA,GAAI,SAASc,GACb,GAAkB,oBAARiG,IAAV,CAEA,IAAyB+N,EACzB,IAAIA,GAAS/N,IAAIsE,QADN,cACoB0J,YAAY,CAAC,MAAMzR,GAAE,CAChDwR,IACH/N,IAAIuE,IAAI,uDACRwJ,EAAQ,CAACE,QAAS,SAASpS,EAAEwC,GAAGT,KAAK/B,GAAGwC,CAAC,EAAG6P,WAAY,SAASrS,UAAU+B,KAAK/B,EAAE,EAAGsS,QAAS,SAAStS,GAAG,OAAO+B,KAAK/B,EAAE,IAIzH,IAAIwN,EAAOjF,KAAKmF,gBAAkB,SAASlL,EAAEuB,EAAGtC,EAAElD,GAAW,IAAKwF,EAAR/E,UAAcuJ,KAAKC,UAAUhG,EAAEf,EAAElD,GAAK,CAAA,MAAMmC,GAAIqD,EAAGrD,EAAE,CAAE,EAEjHyD,IAAI5B,GAAG,UAAU,SAASgQ,EAAGlN,GAC5BtD,KAAKD,GAAGG,KAAKoD,GACb,IAAInC,EAAMmC,EAAKnC,IAAamC,EAAKmC,MAAO,IAAWgL,EAAM1Q,EAAI2Q,EAAMhN,EAA3BH,EAAO,GAC/C,IAAG,IAAUpC,EAAIiP,aAAjB,CACAjP,EAAIwP,OAASxP,EAAIyP,MAAQ,OACzB,IAAKH,EAAOD,EAAGrP,EAAIwP,QAAUH,EAAGrP,EAAIwP,SAAWnK,KAAK+E,MAAMmF,EAAOP,EAAMI,QAAQpP,EAAIwP,UAAY,EAClG,CAAI,MAAMhS,GAAI8R,EAAOD,EAAGrP,EAAIwP,QAAU,CAAA,CAAG,CACtCD,GAAQA,GAAM,IAAI9T,OAElB0G,EAAK9C,GAAG,OAAO,SAASsC,GACvB9C,KAAKD,GAAGG,KAAK4C,GACb,IAAmB5B,EAAMtC,EAAM5B,EAA3ByL,EAAM3F,EAAIe,IACV4E,IAASvH,EAAOuH,EAAI,SACxB7J,EAAO6R,EAAKvP,IAFwBjE,aAGxBD,EAAMyL,EAAI,QAAUhL,OAAOG,MAAMZ,KAC5C4B,EAAOwD,IAAIO,MAAM1B,IAAI,CAAE,EAAEjE,EAAKoF,IAAIO,MAAM3B,GAAGpC,EAAM5B,GAAM4B,EAAK5B,GAAMkE,IAInEkB,IAAI5B,GAAGqD,IAAID,IAAId,EAAKlE,GAExB,IAEG0E,EAAK9C,GAAG,OAAO,SAASsC,GACvB9C,KAAKD,GAAGG,KAAK4C,OACTM,EAAMN,EAAIM,IAAKlC,EAAOkC,EAAI,KAAMiC,EAAMjC,EAAI,KAAM7B,EAAKuB,EAAI,KAAMW,EAAKX,EAAIW,IAAI,GAChFgN,EAAKvP,GAAQkB,IAAIO,MAAM1B,IAAIwP,EAAKvP,GAAOmE,EAAKjC,EAAI,KAAMA,EAAI,KAAMlC,GAC7DwC,GAAQgN,EAAQ,QAAWpN,EAAK9C,GAAG,KAAM,CAAC,IAAKe,EAAIY,IAAK,uBAEvDW,EAAI,MAAUA,EAAI7C,EAAEgJ,OAAOvM,KAAKL,SAAYoH,EAAG,KAAOA,EAAG,OAASF,EAAKnF,KAAKmD,GAC7ExB,IACHA,EAAK1B,WAAWsO,EAAO,EAAG+D,EAAO,MACrC,GA7ByC,CA8BtC,SAAS/D,IACR,GAAIpJ,EAAK3G,WAAYyB,WAAWgB,MAAM,IAAI7C,GAAG,IAAII,OAAjD,CACA,IAASgH,EAAML,EAAMrB,aAAanC,GAAKA,GAAK,EAAOwD,EAAO,GAC1DkI,EAAKgF,GAAM,SAAStO,EAAKnF,GACxB,KAAKmF,GAAOgO,EAAME,QAAQlP,EAAIwP,OAAQ3T,EACrC,CAAA,MAAM2B,GAAIwD,EAAMuB,EAAO/E,GAAK,sBAAsB,CAChDwD,IACFC,IAAIuE,IAAIxE,EAAM,2GACdmB,EAAK9C,GAAG,qBAAsB,CAAC2B,IAAKA,EAAK0B,IAAK1C,EAAIwP,OAAQvN,IAAKqN,KAEhEC,EAAO1T,EAAIJ,OAGXyB,WAAWkB,KAAKqE,GAAK,SAASrC,GAC7B+B,EAAK9C,GAAG,KAAM,CAAC,IAAKe,EAAIY,IAAKA,EAAKsB,GAAI,GAC5C,GAAO,EAAE,MAdoF,MAA/BpF,WAAWsO,EAAM,GAgB/E,CAEA,GAhEwC,CAiExC,GAlEEtR,CAkEEA,EAAK,iBAET,CAl0DC,GAq0DC,WAED,GAAG,GAAG4B,UAAYmF,IAAlB,CACA,IAAIyO,EAAM,SAAS7S,GAAI8D,QAAQgP,KAAK,mEAAoE9S,EAAE,EAEtG+S,EAAO3O,IAEX2O,EAAKC,GAAKD,EAAKC,IAAM,CAAChQ,GAAI,SAASgQ,GAAgB,OAAXH,EAAI,QAAiBG,GAAM,mBAAqBA,IACxFD,EAAKE,GAAKF,EAAKE,IAAM,CAACjQ,GAAI,SAASkQ,GAAc,OAAVL,EAAI,MAAcK,aAAaC,SAAuB,kBAALD,IACxFH,EAAKK,IAAML,EAAKK,KAAO,CAACpQ,GAAI,SAAShD,GAAgB,OAAZ6S,EAAI,QAAgBQ,EAAQrT,KAAQA,EAAIsT,WAAWtT,GAAK,GAAM,GAAK0C,MAAa1C,IAAM0C,MAAa1C,EAAE,GAC9I+S,EAAKnD,KAAOmD,EAAKnD,MAAQ,CAAC5M,GAAI,SAASlE,GAAiB,OAAb+T,EAAI,QAA6B,iBAAL/T,CAAc,GACrFiU,EAAKnD,KAAK3M,IAAM8P,EAAKnD,KAAK3M,KAAO,SAASnE,GACzC,OAD6C+T,EAAI,YAC9CE,EAAKnD,KAAK5M,GAAGlE,GAAYA,EACT,oBAAT0J,KAA8BA,KAAKC,UAAU3J,GAC/CA,GAAKA,EAAEd,SAAWc,EAAEd,WAAac,CAC3C,EACCiU,EAAKnD,KAAKvR,OAAS0U,EAAKnD,KAAKvR,QAAU,SAASC,EAAGC,GAAIsU,EAAI,eAC1D,IAAIrU,EAAI,GAGR,IAFAF,EAAIA,GAAK,GACTC,EAAIA,GAAK,gEACHD,EAAI,GAAIE,GAAKD,EAAEE,OAAOC,KAAKC,MAAMD,KAAKL,SAAWE,EAAEK,SAAUN,IACnE,OAAOE,CACT,EACCuU,EAAKnD,KAAK/Q,MAAQkU,EAAKnD,KAAK/Q,OAAS,SAASC,EAAGC,GAAI,IAAIC,EAAKC,EAC7D,OADgE4T,EAAI,cACjE,iBAAoB/T,IACpB,iBAAmBC,IAAIA,EAAI,CAAC,IAAKA,IAGjCD,KADHE,GADAD,EAAIA,GAAK,IACA,MAAQA,EAAE,MAAQA,EAAE,MAAQA,EAAE,OAEpCE,IAAMF,EAAE,OACXC,EAAOD,EAAE,MAAQA,EAAE,MAAQA,EAAE,KAC1BD,EAAErB,MAAM,GAAIuB,GAAK,IAAIJ,UAAYI,GACjCC,IAAMF,EAAE,OACRE,IAAMF,EAAE,MAAQE,IAAMF,EAAE,KAClBD,GAAKC,EAAE,MAAQD,GAAKC,EAAE,KAE5BE,IAAMF,EAAE,MAAQD,GAAKC,EAAE,MACvBE,IAAMF,EAAE,MAAQD,GAAKC,EAAE,OAE5B,EACCgU,EAAKnD,KAAK1Q,KAAO6T,EAAKnD,KAAK1Q,MAAQ,SAASV,EAAGD,GAE9C,GADAsU,EAAI,aACY,iBAANrU,EAAV,CAEC,GADAD,EAAIA,GAAK,GACLC,EAAEI,OAAS,OAAOL,EACtB,IAAI,IAAIY,EAAE,EAAEb,EAAEE,EAAEI,OAAUO,EAAEb,IAAKa,EAE/BZ,GAAMA,GAAG,GAAGA,EADRC,EAAEY,WAAWD,GAEjBZ,GAAK,EAEP,OAAOA,CARyB,CASnC,EACCwU,EAAKQ,KAAOR,EAAKQ,MAAQ,CAACvQ,GAAI,SAAS1E,GAAiB,OAAbuU,EAAI,QAAiBvU,aAAa+K,KAAM,GACnF0J,EAAKQ,KAAKC,KAAOT,EAAKQ,KAAKC,MAAQnK,MAAM3J,UAAUjC,MACnDsV,EAAKQ,KAAK3K,KAAOmK,EAAKQ,KAAK3K,MAAQ,SAAS3I,GAE3C,OADA4S,EAAI,aACG,SAASY,EAAEC,GACjB,OAAID,GAAMC,GAAeD,EAAIA,EAAExT,KAAIyT,EAAIA,EAAEzT,KACtB,EAAWwT,EAAIC,EAAW,EAC/B,EAFO,CAGxB,CACA,EACCX,EAAKQ,KAAKtL,IAAM8K,EAAKQ,KAAKtL,KAAO,SAAS3J,EAAGC,EAAG0D,GAAqB,OAAjB4Q,EAAI,YAAoBc,EAAQrV,EAAGC,EAAG0D,EAAE,EAC5F8Q,EAAKQ,KAAKK,MAAQ,EAClBb,EAAKc,IAAMd,EAAKe,KAAO,CAAC9Q,GAAI,SAASjE,GAAgB,OAAZ8T,EAAI,SAAe9T,IAAIA,aAAaU,QAAUV,EAAEc,cAAgBJ,QAAgF,WAArEA,OAAOC,UAAU1B,SAAS8B,KAAKf,GAAGF,MAAM,sBAAsB,GAAuB,GACzMkU,EAAKc,IAAIzO,IAAM2N,EAAKc,IAAIzO,KAAO,SAASrG,EAAGkB,EAAGwC,GAAoB,OAAhBoQ,EAAI,YAAoB9T,GAAG,CAAA,GAAIkB,GAAKwC,EAAG1D,CAAC,EAC1FgU,EAAKc,IAAIrU,IAAMuT,EAAKc,IAAIrU,KAAO,SAAST,EAAGkB,GAAoB,OAAhB4S,EAAI,WAAmB9T,GAAKU,OAAOC,UAAUC,eAAeG,KAAKf,EAAGkB,EAAE,EACrH8S,EAAKc,IAAIE,IAAMhB,EAAKc,IAAIE,KAAO,SAAShV,EAAGkB,GAC1C,GAD8C4S,EAAI,WAC9C9T,EAGJ,OAFAA,EAAEkB,GAAK,YACAlB,EAAEkB,GACFlB,CACT,EACCgU,EAAKc,IAAI/R,GAAKiR,EAAKc,IAAI/R,IAAM,SAAS/C,EAAGkB,EAAGwC,EAAGxD,GAAmB,OAAf4T,EAAI,UAAkB9T,EAAEkB,GAAKlB,EAAEkB,KAAOhB,IAAMwD,EAAG,CAAE,EAAGA,EAAE,EACzGsQ,EAAKc,IAAI5Q,IAAM8P,EAAKc,IAAI5Q,KAAO,SAASlE,GACvC,GAD2C8T,EAAI,WAC5CmB,EAAOjV,GAAK,OAAOA,EACtB,IAAIA,EAAIyJ,KAAK+E,MAAMxO,EAClB,CAAA,MAAM4B,GAAG5B,EAAE,CAAA,CAAE,CACd,OAAOA,CACT,EACG,WACD,SAASkJ,EAAIxF,EAAExC,GACX+K,EAAQhJ,KAAK/B,IAFAhB,YAEY+C,KAAK/B,KACjC+B,KAAK/B,GAAKwC,EACb,CACEsQ,EAAKc,IAAI9R,GAAKgR,EAAKc,IAAI9R,IAAM,SAAS0H,EAAM1H,GAG3C,OAHgD8Q,EAAI,UAEpDc,EAAQlK,EAAMxB,EADdlG,EAAKA,GAAM,IAEJA,CACV,CACA,CAVE,GAWDgR,EAAKc,IAAII,KAAOlB,EAAKc,IAAII,MAAQ,SAASlV,GACzC,OAD6C8T,EAAI,YACzC9T,EAAOyJ,KAAK+E,MAAM/E,KAAKC,UAAU1J,IAA9BA,CACb,EACG,WACD,SAASgB,EAAM0C,EAAEtD,GAAI,IAAIa,EAAIgC,KAAKhC,EACjC,IAAGA,KAAMb,IAAMa,GAAMgU,EAAOhU,IAAMgL,EAAQhL,EAAGb,IAC7C,OAFoCF,YAE3BE,QAAT,CACH,CACE4T,EAAKc,IAAI9T,MAAQgT,EAAKc,IAAI9T,OAAS,SAAShB,EAAGiB,GAC9C,OADkD6S,EAAI,cAClD9T,IACG4U,EAAQ5U,EAAEgB,EAAM,CAACC,EAAEA,GAC7B,CACA,CATE,GAUC,WACD,SAASlB,EAAEmB,EAAEwC,GACZ,GAAG,IAAMmH,UAAUhL,OAGlB,OAFAE,EAAE4C,EAAI5C,EAAE4C,GAAK,CAAA,OACb5C,EAAE4C,EAAEzB,GAAKwC,GAER3D,EAAE4C,EAAI5C,EAAE4C,GAAK,GACf5C,EAAE4C,EAAEtB,KAAKH,GAEV,IAAwBgI,EAApB9H,EAAOV,OAAOU,KAClBV,OAAOU,KAAOV,OAAOU,MAAQ,SAASpB,GAAI,OAAOkJ,EAAIlJ,GAAG,SAAS0D,EAAExC,EAAEnB,GAAGA,EAAEmB,EAAE,GAAE,EAC9E8S,EAAKc,IAAI5L,IAAMA,EAAM8K,EAAKc,IAAI5L,KAAO,SAAS3J,EAAGC,EAAG0D,GAAI4Q,EAAI,WAC3D,IAAI5T,EAAUiV,EAAGxS,EAAGyS,EAAIC,EAAjBjV,EAAI,EAAkBoB,EAAI,mBAAqBhC,EAMtD,GALAO,EAAE4C,EAAIzC,EACHkB,GAAQ6T,EAAO1V,KACjB6V,EAAKhU,EAAK7B,GAAI8V,GAAM,GAErBnS,EAAIA,GAAK,GACNoR,EAAQ/U,IAAM6V,EAEhB,IADAD,GAAKC,GAAM7V,GAAGM,OACTO,EAAI+U,EAAG/U,IAAI,CACf,IAAIkV,EAAMlV,EAAI4T,EAAKQ,KAAKK,MACxB,GAAGrT,GAEF,IADAmB,EAAI0S,EAAK7V,EAAEuB,KAAKmC,EAAG3D,EAAE6V,EAAGhV,IAAKgV,EAAGhV,GAAIL,GAAKP,EAAEuB,KAAKmC,EAAG3D,EAAEa,GAAIkV,EAAIvV,MACpDG,EAAI,OAAOyC,OAGpB,GAAGnD,IAAMD,EAAE8V,EAAKD,EAAGhV,GAAKA,GAAK,OAAOgV,EAAIA,EAAGhV,GAAKkV,CAEtD,MAEI,IAAIlV,KAAKb,EACR,GAAGiC,GACF,GAAGyK,EAAQ1M,EAAEa,KACZuC,EAAIO,EAAG1D,EAAEuB,KAAKmC,EAAG3D,EAAEa,GAAIA,EAAGL,GAAKP,EAAED,EAAEa,GAAIA,EAAGL,MACjCG,EAAI,OAAOyC,OAIrB,GAAGnD,IAAMD,EAAEa,GAAK,OAAOA,EAI1B,OAAOoB,EAAGzB,EAAE4C,EAAIqR,EAAKQ,KAAKK,MAAO,GAAK,CACzC,CACA,CA7CE,GA8CDb,EAAKjC,KAAOiC,EAAKjC,MAAQ,CAAA,EACzBiC,EAAKjC,KAAK9N,GAAK+P,EAAKjC,KAAK9N,IAAM,SAASlE,GAAiB,OAAb+T,EAAI,QAAgB/T,EAAGA,aAAaoC,OAAS,IAAIA,MAAOoT,SAAU,EAE9G,IAAIC,EAAQxB,EAAKC,GAAGhQ,GAChBqQ,EAAUN,EAAKQ,KAAKvQ,GACJgR,GAAhBH,EAAMd,EAAKc,KAAkB7Q,GAAIgI,EAAU6I,EAAIrU,IAAKmU,EAAUE,EAAI5L,IAElEuM,EAAM,CACVA,GAAS,SAAS/R,GACjB,OADqBoQ,EAAI,UACtBpQ,IAAMxD,IACA,OAANwD,GACAA,IAAMC,SACN+R,EAAQhS,IACRiS,EAAMjS,IACNkS,EAAOlS,MAGH+R,EAAItK,KAAKlH,GAAGP,KAAM,IAC3B,GACC+R,EAAItK,KAAOsK,EAAII,IAAM,CAAC3S,EAAG,KACvB,WAWD,SAASgG,EAAIzJ,EAAGyB,GAAI,IAAIlB,EAAIiD,KAC3B,OAAGjD,EAAEwE,GAAYxE,EAAEwE,IAAK,EACrBtD,GAAK4U,GAAQJ,EAAQjW,QACvBO,EAAEwE,GAAK/E,GAEAO,EAAEwE,IAAK,CAElB,CAjBEiR,EAAItK,KAAKlH,GAAK,SAASP,GACtB,GAD0BoQ,EAAI,eAC3BpQ,GAAKA,EAAEoS,KAAUpS,EAAER,GAAK+R,EAAOvR,GAAG,CACpC,IAAI1D,EAAI,CAAA,EAER,GADA4U,EAAQlR,EAAGwF,EAAKlJ,GACbA,EAAEwE,GACJ,OAAOxE,EAAEwE,EAEd,CACG,OAAO,CACV,CASA,CAnBE,GAoBDiR,EAAItK,KAAKjH,IAAM,SAASnE,GAAyB,OAArB+T,EAAI,gBAAwBiC,EAAQ,CAAE,EAAED,EAAM/V,EAAI,EAC9EiU,EAAKc,IAAIrU,IAAIyC,EAAI,IACjB,IAAI4S,EAAOL,EAAItK,KAAKjI,EAChByS,EAAQ3B,EAAKE,GAAGjQ,GAChB2R,EAAS5B,EAAKK,IAAIpQ,GAClByR,EAAU1B,EAAKnD,KAAK5M,GACa8R,GAAjBd,GAAhBH,EAAMd,EAAKc,KAAkB7Q,GAAc6Q,EAAIzO,KAAKuO,EAAUE,EAAI5L,IAEtE8K,EAAKzL,IAAMyL,EAAKzL,KAAOkN,EAEvB,IAAIO,EAAO,CAAC9S,EAAG,IACf8S,KAAY,SAAS/U,EAAGjB,GAAsB,OAAlB8T,EAAI,aAAsB7S,GAAKA,EAAEiC,GAAKjC,EAAEiC,EAAElD,GAAKiW,EAAS,GACpFD,EAAK7R,KAAKD,IAAM,SAASjD,EAAGjB,GAK3B,OAL+B8T,EAAI,iBACnC9T,EAAkB,iBAANA,EAAiB,CAACmE,KAAMnE,GAAKA,GAAK,IAC9CiB,EAAIA,GAAK,IACPiC,EAAIjC,EAAEiC,GAAK,CAAA,EACbjC,EAAEiC,EAAE+S,GAASjW,EAAEmE,MAAQlD,EAAEiC,EAAE+S,IAAUC,IAC9BjV,CACT,EACC+U,EAAK7R,KAAKjB,EAAIuS,EAAItK,KAAKjI,EACrB,WAQD,SAASgG,EAAIxF,EAAGxC,GACf,GAAGA,IAAM8U,EAAK9S,EACd,OAAIuS,EAAIxR,GAAGP,SACRT,KAAKgC,IAAKhC,KAAKgC,GAAGlE,KAAKkC,KAAKF,GAAIW,EAAGxC,EAAG+B,KAAKhC,EAAGgC,KAAKxD,GACzD,CAXEuW,EAAK/R,GAAK,SAAShD,EAAGgE,EAAIlC,GAAqB,IAAItD,EAClD,OAD8BqU,EAAI,aAC9BmB,EAAOhU,QACRxB,EAAIuW,EAAK7R,KAAKlD,MACR2T,EAAQ3T,EAAGiI,EAAK,CAACnG,GAAGA,EAAGkC,GAAGA,EAAGxF,EAAEA,EAAEwB,EAAEA,IAG/C,CAMA,CAbE,GAcC,WAWD,SAASiI,EAAIxF,EAAGxC,GAAI,IAAgBjB,EAAZD,EAAIiD,KAAKjD,EAC7BA,EAAEkJ,IADmChJ,aAEvCD,EAAMD,EAAEkJ,IAAInI,KAAKkC,KAAKF,GAAIW,EAAG,GAAGxC,EAAGlB,EAAE+H,OAEpCoO,EAAQnW,EAAE+H,KAAM7G,GAEdlB,EAAE+H,OAAO/H,EAAE+H,KAAK7G,GAAKjB,GAGtBwV,EAAIxR,GAAGP,KACT1D,EAAE+H,KAAK7G,GAAKwC,EAEhB,CAtBEsS,EAAK9R,IAAM,SAAS4Q,EAAK9U,EAAG+C,GAQ3B,OARgC+Q,EAAI,YAChC9T,EACiB,iBAANA,EAAiBA,EAAI,CAACmE,KAAMnE,GACnC,mBAAqBA,IAAIA,EAAI,CAACkJ,IAAKlJ,IAFnCA,EAAI,GAGTA,EAAEkJ,MAAMlJ,EAAE+H,KAAO/H,EAAEkJ,IAAInI,KAAKgC,EAAI+R,EAAK5U,EAAGF,EAAE+H,MAAQ,CAAE,KACpD/H,EAAE+H,KAAOiO,EAAK7R,KAAKD,IAAIlE,EAAE+H,MAAQ,GAAI/H,KACvC4U,EAAQE,EAAK5L,EAAK,CAAClJ,EAAEA,EAAE+C,GAAGA,IAEpB/C,EAAE+H,IACZ,CAcA,CAxBE,GAyBmBkN,GAAhBH,EAAMd,EAAKc,KAAkB7Q,GAAjC,IAAqCkS,EAAUrB,EAAIE,IAC7BkB,GADkCtB,EAAUE,EAAI5L,IAC3D8K,EAAKnD,KAAyBvR,QACrC2W,EAAQD,EAAK7R,KAAKjB,EAEtB8Q,EAAKjM,KAAOiM,EAAKjM,MAAQiO,EAEzB,IAAIpS,EAAQoQ,EAAKpO,MACjBhC,EAAM8H,IAAM,WAA8B,OAAlBoI,EAAI,aAAqBlQ,IAAQ3E,SAAS,IAAIC,QAAQ,IAAI,GAAG,EACrF0E,EAAMZ,GAAK,SAAS0H,EAAMxJ,EAAG8B,GAAK8Q,EAAI,YACrC,IAAIvL,GAAOmC,GAAM,CAAE,GAAExJ,GAIrB,OAHG+T,EAAO1M,KACTA,EAAM6N,EAAS7N,IAET3E,EAAMM,IAAIlB,EAAI9B,EAAG0C,EAAMK,GAAGyG,EAAMxJ,GAAIqH,EAAKyN,EAAK7R,KAAKuG,GAC5D,EACG,WAsBD,SAASxB,EAAIxF,EAAExC,GACXmV,IAAOnV,GACV0C,EAAMM,IAAIjB,KAAKjD,EAAGkB,EAAG+B,KAAKxD,EAC7B,CAxBEmE,EAAMsF,IAAM,SAASjE,EAAIxF,EAAGsD,GAAuB,IAAI7C,EAAtB4T,EAAI,aACpC,IAAI9T,EAAIiV,EAAOjV,EAAIiF,GAAMxF,GAAIO,EAAI,KAEjC,OADAiF,EAAKuQ,EAAMvQ,EAAKA,GAAMxF,GAAIwF,EAAK,KAC5BjF,IAAMiF,GACRxF,EAAImW,EAAOnW,GAAIA,EAAImE,IACnB5D,EAAEqW,GAAMrW,EAAEqW,IAAO,CAAA,EACjBzB,EAAQ5U,EAAGkJ,EAAK,CAAClJ,EAAEA,EAAEP,EAAEA,IAChBO,IAER+C,EAAKA,GAAMkS,EAAOxV,GAAIA,EAAIS,EAC1BT,EAAImW,EAAOnW,GAAIA,EAAImE,IACZ,SAASF,EAAGxC,EAAGlB,EAAGoE,GACxB,IAAIa,EAEH,OADAiE,EAAInI,KAAK,CAACf,EAAGA,EAAGP,EAAGA,GAAIiE,EAAExC,GAClBwC,EAERuB,EAAGlE,KAAKgC,GAAME,MAAQ,CAAA,EAAIS,EAAGxC,EAAGlB,EAAGoE,GAChC6H,EAAQjM,EAAEkB,IAAMhB,IAAMF,EAAEkB,IAC3BgI,EAAInI,KAAK,CAACf,EAAGA,EAAGP,EAAGA,GAAIiE,EAAExC,EAC7B,EACA,CAKA,CA1BE,IA2BG4T,EAAMd,EAAKc,KAAkB/R,GAAIkJ,EAAU6I,EAAIrU,IAAKwU,EAASH,EAAI7Q,GAAI2Q,EAAUE,EAAI5L,IAAlD,IAAuDkN,EAAWtB,EAAII,KAGvGmB,GAFgBT,EAAV5B,EAAKK,IAAkBpQ,GACfuR,EAATxB,EAAKC,GAAehQ,GACpB+R,EAAK9S,GAEVoT,EAAQ,CAAA,GACV,WAKD,SAASpN,EAAIjI,EAAGxB,GACf,IAAIwB,GAAKxB,IAAMuW,EAAK7R,KAAKlD,KAAO+U,EAAK/R,GAAGhD,EAAGgC,KAAKgR,GAAIhR,KAAKF,IAAM,OAAO,EAClEE,KAAKgC,KACTsR,EAAGtV,EAAIA,EAAGsV,EAAGxT,GAAKE,KAAKF,GACvBE,KAAKgC,GAAGlE,KAAKwV,EAAGxT,GAAI9B,EAAGxB,EAAG8W,GAC7B,CACE,SAASA,EAAGtC,GACRA,GAAK+B,EAAK/R,GAAGsS,EAAGtV,EAAGgT,EAAIsC,EAAGxT,GAChC,CAZEuT,EAAMrS,GAAK,SAASmG,EAAGnF,EAAIgP,EAAIlR,GAC9B,OADmC+Q,EAAI,eACnC1J,IAAM6K,EAAO7K,IAAMoM,EAAUpM,MACzBwK,EAAQxK,EAAGlB,EAAK,CAACjE,GAAGA,EAAGgP,GAAGA,EAAGlR,GAAGA,GAC3C,CAUA,CAdE,GAeC,WA2BD,SAASgF,EAAKsK,EAAKpM,GAAK,IAAIhG,EAC3B,OAAGA,EAkEJ,SAAcoS,EAAKpM,GAClB,IAAoCxF,EAAhCgW,EAAMpE,EAAIjG,KAAMhM,EAAIqW,EAAI5W,OAC5B,KAAMO,KACL,GADWK,EAAMgW,EAAIrW,GAClB6F,EAAG6O,MAAQrU,EAAIqU,IAAM,OAAOrU,EAEhCgW,EAAIpV,KAAK4E,EACZ,CAxEYmG,CAAKiG,EAAKpM,IAAahG,GAChCgG,EAAGoM,IAAMA,EACTpM,EAAG9B,KAAOA,EACP6R,EAAK9R,IAAI+B,EAAG6O,IAAK5L,EAAKjD,KACxBA,EAAGkF,KAAOlF,EAAGkF,MAAQsK,EAAItK,KAAKjH,IAAI8R,EAAK7R,KAAK8B,EAAG8B,OAC5C9B,EAAG6O,MAAQzC,EAAIqE,QACjBrE,EAAI3J,MAAM+M,EAAItK,KAAKlH,GAAGgC,EAAGkF,OAASlF,EAAG8B,OAGhC9B,EACV,CACE,SAASiD,EAAIxF,EAAExC,EAAED,GAChB,IAA6BgD,EAAIhE,EAA7BgG,EAAKhD,KAAMoP,EAAMpM,EAAGoM,IACxB,GAAG2D,EAAK9S,IAAMhC,GAAK+K,EAAQvI,EAAE+R,EAAItK,KAAKjI,GACrC,OAAOjC,EAAEiC,EAEV,GAAKe,EAAK0B,EAAMjC,EAAExC,EAAED,EAAGgF,EAAGoM,GAA1B,CASA,GARInR,IACH+E,EAAG8B,KAAO9B,EAAG8B,MAAQ9G,GAAK,CAAA,EACvBgL,EAAQvI,EAAGsS,EAAK9S,IAAM8S,EAAK7R,KAAKT,KAClCuC,EAAG8B,KAAK7E,EAAIkT,EAAS1S,EAAER,IAExB+C,EAAG8B,KAAOiO,EAAK7R,KAAKD,IAAI+B,EAAG8B,KAAM0N,EAAItK,KAAKlH,GAAGgC,EAAGkF,OAChDlF,EAAGkF,KAAOlF,EAAGkF,MAAQsK,EAAItK,KAAKjH,IAAI8R,EAAK7R,KAAK8B,EAAG8B,SAE7C9H,EAAMoS,EAAInJ,OACZjJ,EAAIc,KAAKsR,EAAItP,IAAM,CAAA,EAAIW,EAAExC,EAAED,EAAGgF,GAC3BgG,EAAQhL,EAAEC,IAAG,CAEf,GADAwC,EAAIzC,EAAEC,GACHhB,IAAMwD,EAER,YADAyS,EAAQlV,EAAGC,GAGZ,KAAK+C,EAAK0B,EAAMjC,EAAExC,EAAED,EAAGgF,EAAGoM,IAAQ,MACvC,CAEG,IAAInR,EAAI,OAAO+E,EAAG8B,KAClB,IAAG,IAAS9D,EACX,OAAOP,EAGR,IADAzD,EAAM8H,EAAKsK,EAAK,CAACyC,IAAKpR,EAAG7E,KAAMoH,EAAGpH,KAAK8X,OAAOzV,MACtC6G,KACR,OAAO9H,EAAIkL,IA1B6B,CA2B3C,CACE,SAAShH,EAAKK,GAAK,IAAIyB,EAAKhD,KACvB2T,EAAOnB,EAAItK,KAAKlH,GAAGgC,EAAGkF,MAAOzC,EAAQzC,EAAGoM,IAAI3J,MAChDzC,EAAGkF,KAAOlF,EAAGkF,MAAQsK,EAAItK,KAAKjH,IAAIM,GAClCyB,EAAGkF,KAAKsK,EAAItK,KAAKjI,GAAKsB,EACnByB,EAAG8B,MAAQ9B,EAAG8B,KAAKiO,EAAK9S,KAC1B+C,EAAG8B,KAAKiO,EAAK9S,GAAGuS,EAAItK,KAAKjI,GAAKsB,GAE5ByH,EAAQvD,EAAOkO,KACjBlO,EAAMlE,GAAMkE,EAAMkO,GAClBT,EAAQzN,EAAOkO,GAEnB,CACE,SAASjR,EAAMjC,EAAExC,EAAED,EAAGgF,EAAGoM,GAAM,IAAIpS,EAClC,QAAGwV,EAAIxR,GAAGP,KACPuR,EAAOvR,GAAY,GACnBzD,EAAMoS,EAAIwE,SAELlR,EADPjC,EAAIzD,EAAIc,KAAKsR,EAAItP,IAAM,CAAA,EAAIW,EAAExC,EAAED,GAChBC,EAAED,EAAGgF,EAAGoM,IAExBA,EAAIjN,IAAM,qBAAuBa,EAAGpH,KAAK8X,OAAOzV,GAAG4J,KAAK,KAAO,UAC5DkJ,EAAKQ,KAAKvQ,GAAGP,KAAK2O,EAAIjN,KAAO,4CACnC,CA5FEkR,EAAMpS,IAAM,SAAS4Q,EAAKzC,EAAKtP,GAAK+Q,EAAI,aACvC,IAAI7N,EAAK,CAACpH,KAAM,GAAIiW,IAAKA,GAuBzB,OAtBIzC,EAGc,iBAARA,EACTA,EAAM,CAAClO,KAAMkO,GAEX,mBAAqBA,IACvBA,EAAInJ,IAAMmJ,GANVA,EAAM,CAAA,EAQU,iBAAPtP,IACTsP,EAAIlO,KAAOkO,EAAIlO,MAAQpB,EACvBA,EAAK7C,GAEHmS,EAAIlO,OACN8B,EAAGkF,KAAOsK,EAAItK,KAAKjH,IAAImO,EAAIlO,OAE5BkO,EAAIqE,OAAS3T,GAAI,CAAA,GAAI2T,MACrBrE,EAAI3J,MAAQ2J,EAAI3J,OAAS,CAAA,EACzB2J,EAAIjG,KAAOiG,EAAIjG,MAAQ,GACvBiG,EAAItP,GAAKsP,EAAItP,IAAMA,EACnBgF,EAAKsK,EAAKpM,GACVoM,EAAI9L,KAAON,EAAG8B,KACPsK,EAAI3J,KACd,CA2EA,CArGE,GAsGD4N,EAAMvO,KAAO,SAASA,GAAO+L,EAAI,cAChC,IAAI3P,EAAO6R,EAAK7R,KAAK4D,GACrB,GAAI5D,EACJ,OAAO4R,EAAQ,CAAA,EAAI5R,EAAM4D,EAC3B,EACG,WAQD,SAASmB,EAAIxF,EAAExC,GAAI,IAAIjB,EAAK6U,EAC3B,GAAGkB,EAAK9S,IAAMhC,GAOTjB,EAAMwV,EAAItK,KAAKlH,GAAGP,KAIpBoR,EAAM7R,KAAKmB,IAAIgI,KAAKnM,IACtBgD,KAAK6R,IAAI5T,GAAK4T,EAGf7R,KAAK6R,IAAI5T,GAAK+B,KAAKmB,IAAIgI,KAAKnM,GAAOqW,EAAMtT,GAAGC,KAAKyF,MAAOzI,EAAKgD,KAAKmB,KAPjEnB,KAAK6R,IAAI5T,GAAKwC,MARf,CACC,GAAG8S,EAAU9S,EAAG+R,EAAItK,KAAKjI,GACxB,OAEDD,KAAK6R,IAAI5T,GAAKkV,EAAS1S,EAE3B,CAUA,CAxBE4S,EAAMtT,GAAK,SAAS0F,EAAOnC,EAAMnC,GAChC,GADsC0P,EAAI,YACtCpL,EAAJ,CACA,IAAIoM,EAAM,CAAA,EAGV,OAFA1Q,EAAMA,GAAO,CAACgI,KAAM,CAAE,GACtBwI,EAAQlM,EAAMnC,GAAO2C,EAAK,CAAC4L,IAAIA,EAAKpM,MAAOA,EAAOtE,IAAKA,IAChD0Q,CAJW,CAKrB,CAmBA,CA1BE,GA2BGU,EAAQxB,EAAKC,GAAGhQ,GACAgR,GAAhBH,EAAMd,EAAKc,KAAkB7Q,GAAIkS,EAAUrB,EAAIE,IAAK/I,EAAU6I,EAAIrU,IADtE,IACIqU,EACA5U,EADuEsW,EAAY1B,EAAI9T,MAAO+U,EAAUjB,EAAIzO,IAAKuO,EAAUE,EAAI5L,IAAKkN,EAAWtB,EAAII,KAEvJlB,EAAKtL,MAAQsL,EAAKtL,OAAS4N,CA/bG,CAgc/B,CAlcC,0BCj0DM,MAAM9Q,EAAU,SCCvB,SAASsR,EAAUC,EAAOC,EAAMtJ,GAC5B,MAAMuJ,EAAQD,EAAKhY,MAAM,KAAKkK,KAAInJ,GAAKA,EAAEmX,SACzC,IAAK,IAAI9W,EAAI,EAAGA,EAAI6W,EAAMpX,OAAQO,IAC9B,OAAQ4W,GACJ,IAAK,MACD,OACJ,IAAK,SACL,IAAK,UACL,IAAK,SACL,IAAK,SACD,UAAY,IAAWA,EACnB,OAIhB,MAAMG,EAAQ,IAAIC,MAAM,0BAA0BJ,KAIlD,MAHAG,EAAME,KAAO,mBACbF,EAAMG,SAAW,SAAS5J,IAC1ByJ,EAAMJ,MAAQA,EACRI,CACV,CAKOI,eAAeC,EAAkBT,GACpC,MAAM3V,EAAOV,OAAOU,KAAK2V,GAEzB,aADsBU,QAAQhQ,IAAIrG,EAAK8H,KAAKhI,GAAMuW,QAAQ5J,QAAQkJ,EAAM7V,QACzDwW,QAAO,CAACC,EAAOjU,EAAGmR,KAC7B8C,EAAMvW,EAAKyT,IAAUnR,EACdiU,IACR,CAAE,EACT,CAMO,SAASC,EAAiBC,EAAQC,EAAQb,GAC7C,IAAK,IAAI3O,KAAOwP,EAAQ,CACpB,IAAIf,EAAQe,EAAOxP,GACnB,MAAM0O,EAAQC,EAAQA,EAAM3O,GAAO,KAC/B0O,GACAF,EAAUC,EAAOC,EAAM1O,GAE3B5H,OAAOqX,eAAeF,EAAQvP,EAAK,CAAE0P,YAAY,EAAMjB,QAAOkB,UAAU,GAC3E,CACL,CCzCA,SAASvO,EAAUqN,GACf,GAAa,MAATA,EACA,MAAO,OAEX,GAAIzM,MAAM4N,QAAQnB,GACd,MAAO,KAAQA,EAAM7N,IAAIQ,GAAYoB,KAAK,MAAQ,KAEtD,GAAIiM,aAAiBoB,WAAY,CAC7B,MAAMC,EAAM,mBACZ,IAAIC,EAAS,KACb,IAAK,IAAIjY,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9BiY,GAAUD,EAAIrB,EAAM3W,IAAM,GAC1BiY,GAAUD,EAAe,GAAXrB,EAAM3W,IAExB,OAAOiY,CACV,CACD,GAAuB,iBAAnB,GAAyD,mBAAlBtB,EAAY,OACnD,OAAOrN,EAAUqN,EAAMrR,UAE3B,cAAgB,GACZ,IAAK,UACL,IAAK,SAIL,IAAK,SACD,OAAO,EAAQzG,WAHnB,IAAK,SACD,OAAOqZ,OAAOvB,GAAO9X,WAGzB,IAAK,SACD,OAAOwK,KAAKC,UAAUqN,GAC1B,IAAK,SAAU,CACX,MAAM3V,EAAOV,OAAOU,KAAK2V,GAEzB,OADA3V,EAAKyI,OACE,KAAOzI,EAAK8H,KAAKhI,GAAM,GAAGwI,EAAUxI,OAAOwI,EAAUqN,EAAM7V,QAAO4J,KAAK,MAAQ,IACzF,EAEL,MAAO,yBACX,CAoBO,SAASyN,EAAQpB,EAAOE,GAC3B,OAAQF,GAASA,EAAME,OAASA,CACpC,CAIO,SAASmB,EAAgBrB,GAC5B,OAAOoB,EAAQpB,EAAO,iBAC1B,CAWO,SAASsB,EAAUC,EAASrB,EAAMsB,GACrC,IA0BIxB,EA1BAyB,EAAeF,EACnB,CACI,MAAMG,EAAU,GAChB,GAAIF,EAAM,CACN,GAAI,YAAaA,GAAQ,SAAUA,GAAQ,SAAUA,EACjD,MAAM,IAAIvB,MAAM,0CAA0C1N,EAAUiP,MAExE,IAAK,MAAMrQ,KAAOqQ,EAAM,CACpB,GAAY,iBAARrQ,EACA,SAEJ,MAAMyO,EAAS4B,EAAKrQ,GAEpBuQ,EAAQxX,KAAKiH,EAAM,IAAMoB,EAAUqN,GAKtC,CACJ,CACD8B,EAAQxX,KAAK,QAAQgW,KACrBwB,EAAQxX,KAAK,WAAWmE,KACpBqT,EAAQhZ,SACR6Y,GAAW,KAAOG,EAAQ/N,KAAK,MAAQ,IAE9C,CAED,OAAQuM,GACJ,IAAK,mBACDF,EAAQ,IAAI2B,UAAUJ,GACtB,MACJ,IAAK,gBACL,IAAK,iBACDvB,EAAQ,IAAI4B,WAAWL,GACvB,MACJ,QACIvB,EAAQ,IAAIC,MAAMsB,GAS1B,OAPAd,EAAiBT,EAAO,CAAEE,SACtBsB,GACAjY,OAAOsY,OAAO7B,EAAOwB,GAEC,MAAtBxB,EAAMyB,cACNhB,EAAiBT,EAAO,CAAEyB,iBAEvBzB,CACX,CAOO,SAAS8B,EAAOzY,EAAOkY,EAASrB,EAAMsB,GACzC,IAAKnY,EACD,MAAMiY,EAAUC,EAASrB,EAAMsB,EAEvC,CAQO,SAASO,EAAe1Y,EAAOkY,EAAShL,EAAMqJ,GACjDkC,EAAOzY,EAAOkY,EAAS,mBAAoB,CAAEpB,SAAU5J,EAAMqJ,MAAOA,GACxE,CACO,SAASoC,EAAoBC,EAAOC,EAAeX,GACvC,MAAXA,IACAA,EAAU,IAEVA,IACAA,EAAU,KAAOA,GAErBO,EAAOG,GAASC,EAAe,mBAAqBX,EAAS,mBAAoB,CAC7EU,MAAOA,EACPC,cAAeA,IAEnBJ,EAAOG,GAASC,EAAe,qBAAuBX,EAAS,sBAAuB,CAClFU,MAAOA,EACPC,cAAeA,GAEvB,CACA,MAAMC,EAAkB,CAAC,MAAO,MAAO,OAAQ,QAAQ5B,QAAO,CAACC,EAAO4B,KAClE,IAGI,GAA+B,SAA3B,OAAOC,UAAUD,GACjB,MAAM,IAAInC,MAAM,OAIpB,GAAa,QAATmC,EAAgB,CAChB,MAAM/Y,EAAQnB,OAAOoa,aAAa,KAAMD,UAAU,OAGlD,GAAIhZ,IAFanB,OAAOoa,aAAa,IAAM,KAGvC,MAAM,IAAIrC,MAAM,SAGvB,CACDO,EAAMtW,KAAKkY,EACd,CACD,MAAOpC,GAAU,CACjB,OAAOQ,CAAK,GACb,IAII,SAAS+B,EAAgBH,GAC5BN,EAAOK,EAAgBnY,QAAQoY,IAAS,EAAG,8CAA+C,wBAAyB,CAC/GI,UAAW,6BAA8BhB,KAAM,CAAEY,SAEzD,CAOO,SAASK,EAAcC,EAAYC,EAAOC,GAI7C,GAHiB,MAAbA,IACAA,EAAY,IAEZF,IAAeC,EAAO,CACtB,IAAIE,EAASD,EAAWJ,EAAY,MAChCI,IACAC,GAAU,IACVL,GAAa,IAAMI,GAEvBd,GAAO,EAAO,4BAA4Be,iBAAuB,wBAAyB,CACtFL,aAEP,CACL,CCvNA,SAASM,EAAUlD,EAAOrJ,EAAMwH,GAC5B,GAAI6B,aAAiBoB,WACjB,OAAIjD,EACO,IAAIiD,WAAWpB,GAEnBA,EAEX,GAAuB,iBAAnB,GAA+BA,EAAMjX,MAAM,8BAA+B,CAC1E,MAAMuY,EAAS,IAAIF,YAAYpB,EAAMlX,OAAS,GAAK,GACnD,IAAIqa,EAAS,EACb,IAAK,IAAI9Z,EAAI,EAAGA,EAAIiY,EAAOxY,OAAQO,IAC/BiY,EAAOjY,GAAK+Z,SAASpD,EAAMqD,UAAUF,EAAQA,EAAS,GAAI,IAC1DA,GAAU,EAEd,OAAO7B,CACX,CACAa,GAAe,EAAO,0BAA2BxL,GAAQ,QAASqJ,EACtE,CAQO,SAASsD,EAAStD,EAAOrJ,GAC5B,OAAOuM,EAAUlD,EAAOrJ,GAAM,EAClC,CAQO,SAAS4M,EAAavD,EAAOrJ,GAChC,OAAOuM,EAAUlD,EAAOrJ,GAAM,EAClC,CAQO,SAAS6M,EAAYxD,EAAOlX,GAC/B,QAAuB,iBAAnB,IAAgCkX,EAAMjX,MAAM,wBAGxB,iBAAZ,GAAwBiX,EAAMlX,SAAW,EAAI,EAAIA,MAG9C,IAAXA,GAAoBkX,EAAMlX,OAAS,GAAO,GAIlD,CAKO,SAAS2a,EAAYzD,GACxB,OAAQwD,EAAYxD,GAAO,IAAUA,aAAiBoB,UAC1D,CACA,MAAMsC,EAAgB,mBAIf,SAASC,EAAQ7Y,GACpB,MAAM8Y,EAAQN,EAASxY,GACvB,IAAIwW,EAAS,KACb,IAAK,IAAIjY,EAAI,EAAGA,EAAIua,EAAM9a,OAAQO,IAAK,CACnC,MAAMsD,EAAIiX,EAAMva,GAChBiY,GAAUoC,GAAmB,IAAJ/W,IAAa,GAAK+W,EAAkB,GAAJ/W,EAC7D,CACA,OAAO2U,CACX,CAKO,SAAS1B,EAAOiE,GACnB,MAAO,KAAOA,EAAM1R,KAAKqE,GAAMmN,EAAQnN,GAAG6M,UAAU,KAAItP,KAAK,GACjE,CAIO,SAAS+P,EAAWhZ,GACvB,OAAI0Y,EAAY1Y,GAAM,IACVA,EAAKhC,OAAS,GAAK,EAExBwa,EAASxY,GAAMhC,MAC1B,CAOO,SAASib,EAAUjZ,EAAMkZ,EAAOzR,GACnC,MAAMqR,EAAQN,EAASxY,GAMvB,OALW,MAAPyH,GAAeA,EAAMqR,EAAM9a,QAC3BoZ,GAAO,EAAO,kCAAmC,iBAAkB,CAC/D+B,OAAQL,EAAO9a,OAAQ8a,EAAM9a,OAAQqa,OAAQ5Q,IAG9CoR,EAAQC,EAAMjc,MAAgB,MAATqc,EAAiB,EAAIA,EAAe,MAAPzR,EAAeqR,EAAM9a,OAASyJ,GAC3F,CAYA,SAAS2R,EAAQpZ,EAAMhC,EAAQqb,GAC3B,MAAMP,EAAQN,EAASxY,GACvBoX,EAAOpZ,GAAU8a,EAAM9a,OAAQ,8BAA+B,iBAAkB,CAC5Emb,OAAQ,IAAI7C,WAAWwC,GACvB9a,OAAQA,EACRqa,OAAQra,EAAS,IAErB,MAAMwY,EAAS,IAAIF,WAAWtY,GAQ9B,OAPAwY,EAAO8C,KAAK,GACRD,EACA7C,EAAO/J,IAAIqM,EAAO9a,EAAS8a,EAAM9a,QAGjCwY,EAAO/J,IAAIqM,EAAO,GAEfD,EAAQrC,EACnB,CAWO,SAAS+C,EAAavZ,EAAMhC,GAC/B,OAAOob,EAAQpZ,EAAMhC,GAAQ,EACjC,CCpJA,MAAMwb,EAAO/C,OAAO,GACdgD,EAAOhD,OAAO,GAGdiD,EAAW,iBA0BV,SAASC,EAAOC,EAAQC,GAC3B,IAAI3E,EAAQ4E,EAAUF,EAAQ,SAC9B,MAAMG,EAAQtD,OAAOuD,EAAUH,EAAQ,UACjCI,EAASR,GAASM,EAAQN,EAChC,GAAIvE,EAAQsE,EAAM,CACdtE,GAASA,EACTkC,EAAOlC,GAAS+E,EAAO,UAAW,gBAAiB,CAC/CnC,UAAW,SAAUoC,MAAO,WAAYhF,MAAO0E,IAGnD,QAAU1E,GADIuE,GAAQM,GAASN,GACJA,CAC9B,CAMD,OAJIrC,EAAOlC,EAAQ+E,EAAO,WAAY,gBAAiB,CAC/CnC,UAAW,SAAUoC,MAAO,WAAYhF,MAAO0E,IAGhD1E,CACX,CAIO,SAASiF,EAAKP,EAAQQ,GACzB,MAAMlF,EAAQmF,EAAQT,EAAQ,SACxBU,EAAO7D,OAAOuD,EAAUI,EAAO,SACrC,OAAOlF,GAAUuE,GAAQa,GAAQb,CACrC,CAKO,SAASK,EAAU5E,EAAOrJ,GAC7B,cAAgB,GACZ,IAAK,SAAU,OAAOqJ,EACtB,IAAK,SAGD,OAFAmC,EAAekD,OAAOC,UAAUtF,GAAQ,YAAarJ,GAAQ,QAASqJ,GACtEmC,EAAenC,IAAUwE,GAAYxE,GAASwE,EAAU,WAAY7N,GAAQ,QAASqJ,GAC9EuB,OAAOvB,GAClB,IAAK,SACD,IACI,GAAc,KAAVA,EACA,MAAM,IAAIK,MAAM,gBAEpB,MAAiB,MAAbL,EAAM,IAA2B,MAAbA,EAAM,IAClBuB,OAAOvB,EAAMqD,UAAU,IAE5B9B,OAAOvB,EACjB,CACD,MAAOnV,GACHsX,GAAe,EAAO,gCAAgCtX,EAAE8W,UAAWhL,GAAQ,QAASqJ,EACvF,EAETmC,GAAe,EAAO,6BAA8BxL,GAAQ,QAASqJ,EACzE,CAKO,SAASmF,EAAQnF,EAAOrJ,GAC3B,MAAM2K,EAASsD,EAAU5E,EAAOrJ,GAIhC,OAHAuL,EAAOZ,GAAUgD,EAAM,oCAAqC,gBAAiB,CACzEU,MAAO,WAAYpC,UAAW,UAAW5C,UAEtCsB,CACX,CACA,MAAMiE,EAAU,mBAKT,SAASC,EAASxF,GACrB,GAAIA,aAAiBoB,WAAY,CAC7B,IAAIE,EAAS,MACb,IAAK,MAAM3U,KAAKqT,EACZsB,GAAUiE,EAAQ5Y,GAAK,GACvB2U,GAAUiE,EAAY,GAAJ5Y,GAEtB,OAAO4U,OAAOD,EACjB,CACD,OAAOsD,EAAU5E,EACrB,CAKO,SAAS8E,EAAU9E,EAAOrJ,GAC7B,cAAgB,GACZ,IAAK,SAED,OADAwL,EAAenC,IAAUwE,GAAYxE,GAASwE,EAAU,WAAY7N,GAAQ,QAASqJ,GAC9EqF,OAAOrF,GAClB,IAAK,SAGD,OAFAmC,EAAekD,OAAOC,UAAUtF,GAAQ,YAAarJ,GAAQ,QAASqJ,GACtEmC,EAAenC,IAAUwE,GAAYxE,GAASwE,EAAU,WAAY7N,GAAQ,QAASqJ,GAC9EA,EACX,IAAK,SACD,IACI,GAAc,KAAVA,EACA,MAAM,IAAIK,MAAM,gBAEpB,OAAOyE,EAAUvD,OAAOvB,GAAQrJ,EACnC,CACD,MAAO9L,GACHsX,GAAe,EAAO,2BAA2BtX,EAAE8W,UAAWhL,GAAQ,QAASqJ,EAClF,EAETmC,GAAe,EAAO,wBAAyBxL,GAAQ,QAASqJ,EACpE,CAYO,SAASyF,EAAQf,EAAQC,GAE5B,IAAIrD,EADU6D,EAAQT,EAAQ,SACXxc,SAAS,IAC5B,GAAc,MAAVyc,EAEIrD,EAAOxY,OAAS,IAChBwY,EAAS,IAAMA,OAGlB,CACD,MAAMuD,EAAQC,EAAUH,EAAQ,SAOhC,IANAzC,EAAe,EAAR2C,GAAavD,EAAOxY,OAAQ,wBAAwB+b,WAAgB,gBAAiB,CACxFjC,UAAW,UACXoC,MAAO,WACPhF,MAAO0E,IAGJpD,EAAOxY,OAAkB,EAAR+b,GACpBvD,EAAS,IAAMA,CAEtB,CACD,MAAO,KAAOA,CAClB,CAIO,SAASoE,EAAUhB,GACtB,MAAM1E,EAAQmF,EAAQT,EAAQ,SAC9B,GAAI1E,IAAUsE,EACV,OAAO,IAAIlD,WAAW,IAE1B,IAAIuE,EAAM3F,EAAM9X,SAAS,IACrByd,EAAI7c,OAAS,IACb6c,EAAM,IAAMA,GAEhB,MAAMrE,EAAS,IAAIF,WAAWuE,EAAI7c,OAAS,GAC3C,IAAK,IAAIO,EAAI,EAAGA,EAAIiY,EAAOxY,OAAQO,IAAK,CACpC,MAAM8Z,EAAa,EAAJ9Z,EACfiY,EAAOjY,GAAK+Z,SAASuC,EAAItC,UAAUF,EAAQA,EAAS,GAAI,GAC3D,CACD,OAAO7B,CACX,CAQO,SAASsE,EAAW5F,GACvB,IAAIsB,EAASqC,EAAQF,EAAYzD,GAASA,EAAQ0F,EAAU1F,IAAQqD,UAAU,GAC9E,KAAO/B,EAAOuE,WAAW,MACrBvE,EAASA,EAAO+B,UAAU,GAK9B,MAHe,KAAX/B,IACAA,EAAS,KAEN,KAAOA,CAClB,CCrMA,MAAMwE,EAAW,6DACjB,IAAIC,EAAS,KACb,SAASC,EAASC,GACd,GAAc,MAAVF,EAAgB,CAChBA,EAAS,CAAA,EACT,IAAK,IAAI1c,EAAI,EAAGA,EAAIyc,GAAiBzc,IACjC0c,EAAOD,EAASzc,IAAMkY,OAAOlY,EAEpC,CACD,MAAMiY,EAASyE,EAAOE,GAEtB,OADA9D,EAAyB,MAAVb,EAAgB,uBAAwB,SAAU2E,GAC1D3E,CACX,CACA,MAAMgD,EAAO/C,OAAO,GACd2E,EAAQ3E,OAAO,IAId,SAAS4E,EAAazB,GACzB,MAAMd,EAAQN,EAASoB,GACvB,IAAI1E,EAAQwF,EAAS5B,GACjBtC,EAAS,GACb,KAAOtB,GACHsB,EAASwE,EAAST,OAAOrF,EAAQkG,IAAU5E,EAC3CtB,GAASkG,EAGb,IAAK,IAAI7c,EAAI,EAAGA,EAAIua,EAAM9a,SAClB8a,EAAMva,GADoBA,IAI9BiY,EAASwE,EAAS,GAAKxE,EAE3B,OAAOA,CACX,CCrCO,MAAM8E,EAITC,OAIAC,QACAC,GAKA,WAAAxc,CAAYuc,EAASC,EAAUF,GAC3Bna,MAAKqa,EAAYA,EACjB1F,EAAiB3U,KAAM,CAAEoa,UAASD,UACrC,CAID,oBAAMG,GACoB,MAAlBta,MAAKqa,SAGHra,KAAKoa,QAAQha,IAAIJ,KAAKma,OAAQna,MAAKqa,EAC5C,EC1BL,SAASE,EAAWC,EAAQvD,EAAQS,EAAO+C,EAAQC,GAE/C,GAAe,eAAXF,GAAsC,wBAAXA,EAAkC,CAC7D,IAAIrd,EAAI,EACR,IAAK,IAAIJ,EAAIka,EAAS,EAAGla,EAAI2a,EAAM9a,QAC3B8a,EAAM3a,IAAM,GAAM,EADiBA,IAIvCI,IAEJ,OAAOA,CACX,CAGA,MAAe,YAAXqd,EACO9C,EAAM9a,OAASqa,EAAS,EAG5B,CACX,CA4BO,MAAM0D,EAAiBld,OAAOmd,OAAO,CACxC1G,MAnDJ,SAAmBsG,EAAQvD,EAAQS,EAAO+C,EAAQC,GAC9CzE,GAAe,EAAO,+BAA+BgB,MAAWuD,IAAU,QAAS9C,EACvF,EAkDImD,OAAQN,EACRte,QA9BJ,SAAqBue,EAAQvD,EAAQS,EAAO+C,EAAQC,GAEhD,MAAe,aAAXF,GACAvE,EAAyC,iBAAlB,EAA4B,yCAA0C,eAAgByE,GAC7GD,EAAOrc,KAAKsc,GACL,IAGXD,EAAOrc,KAAK,OAELmc,EAAWC,EAAQvD,EAAQS,GACtC,IAgHO,SAASoD,EAAYC,EAAKzE,GAC7BL,EAAgC,iBAAT,EAAmB,uBAAwB,MAAO8E,GAC7D,MAARzE,IACAG,EAAgBH,GAChByE,EAAMA,EAAIxE,UAAUD,IAExB,IAAIlB,EAAS,GACb,IAAK,IAAIjY,EAAI,EAAGA,EAAI4d,EAAIne,OAAQO,IAAK,CACjC,MAAMZ,EAAIwe,EAAI3d,WAAWD,GACzB,GAAIZ,EAAI,IACJ6Y,EAAOhX,KAAK7B,QAEX,GAAIA,EAAI,KACT6Y,EAAOhX,KAAM7B,GAAK,EAAK,KACvB6Y,EAAOhX,KAAU,GAAJ7B,EAAY,UAExB,GAAoB,QAAX,MAAJA,GAAuB,CAC7BY,IACA,MAAM6d,EAAKD,EAAI3d,WAAWD,GAC1B8Y,EAAe9Y,EAAI4d,EAAIne,QAA6B,QAAZ,MAALoe,GAA0B,yBAA0B,MAAOD,GAE9F,MAAME,EAAO,QAAgB,KAAJ1e,IAAe,KAAY,KAALye,GAC/C5F,EAAOhX,KAAM6c,GAAQ,GAAM,KAC3B7F,EAAOhX,KAAO6c,GAAQ,GAAM,GAAQ,KACpC7F,EAAOhX,KAAO6c,GAAQ,EAAK,GAAQ,KACnC7F,EAAOhX,KAAa,GAAP6c,EAAe,IAChC,MAEI7F,EAAOhX,KAAM7B,GAAK,GAAM,KACxB6Y,EAAOhX,KAAO7B,GAAK,EAAK,GAAQ,KAChC6Y,EAAOhX,KAAU,GAAJ7B,EAAY,IAEjC,CACA,OAAO,IAAI2Y,WAAWE,EAC1B,CAmBO,SAAS8F,GAAaxD,EAAOyD,GAChC,OAjBmBC,EA/HvB,SAA2BC,EAAQF,GAChB,MAAXA,IACAA,EAAUR,EAAezG,OAE7B,MAAMwD,EAAQN,EAASiE,EAAQ,SACzBjG,EAAS,GACf,IAAIjY,EAAI,EAER,KAAOA,EAAIua,EAAM9a,QAAQ,CACrB,MAAML,EAAImb,EAAMva,KAEhB,KAAIZ,GAAK,GAAS,CACd6Y,EAAOhX,KAAK7B,GACZ,QACJ,CAEA,IAAI+e,EAAc,KACdC,EAAe,KAEnB,GAAmB,MAAV,IAAJhf,GACD+e,EAAc,EACdC,EAAe,SAGd,GAAmB,MAAV,IAAJhf,GACN+e,EAAc,EACdC,EAAe,SAGd,IAAmB,MAAV,IAAJhf,GAIL,CAEGY,GAAKge,EADU,MAAV,IAAJ5e,GACY,sBAGA,aAHuBY,EAAI,EAAGua,EAAOtC,GAKtD,QACJ,CAXIkG,EAAc,EACdC,EAAe,KAUnB,CAEA,GAAIpe,EAAI,EAAIme,GAAe5D,EAAM9a,OAAQ,CACrCO,GAAKge,EAAQ,UAAWhe,EAAI,EAAGua,EAAOtC,GACtC,QACJ,CAEA,IAAI1G,EAAMnS,GAAM,GAAM,EAAI+e,EAAc,GAAM,EAC9C,IAAK,IAAIE,EAAI,EAAGA,EAAIF,EAAaE,IAAK,CAClC,IAAIC,EAAW/D,EAAMva,GAErB,GAAyB,MAAT,IAAXse,GAA0B,CAC3Bte,GAAKge,EAAQ,mBAAoBhe,EAAGua,EAAOtC,GAC3C1G,EAAM,KACN,KACJ,CAEAA,EAAOA,GAAO,EAAiB,GAAX+M,EACpBte,GACJ,CAEY,OAARuR,IAIAA,EAAM,QACNvR,GAAKge,EAAQ,eAAgBhe,EAAI,EAAIme,EAAa5D,EAAOtC,EAAQ1G,GAIjEA,GAAO,OAAUA,GAAO,MACxBvR,GAAKge,EAAQ,kBAAmBhe,EAAI,EAAIme,EAAa5D,EAAOtC,EAAQ1G,GAIpEA,GAAO6M,EACPpe,GAAKge,EAAQ,WAAYhe,EAAI,EAAIme,EAAa5D,EAAOtC,EAAQ1G,GAGjE0G,EAAOhX,KAAKsQ,GAChB,CACA,OAAO0G,CACX,CA6DyBsG,CAAkBhE,EAAOyD,GAhBvCC,EAAWnV,KAAK0V,GACfA,GAAa,MACNvf,OAAOoa,aAAamF,IAE/BA,GAAa,MACNvf,OAAOoa,aAA4C,OAA5BmF,GAAa,GAAM,MAAyC,OAAT,KAAZA,OACtE9T,KAAK,IAPZ,IAAuBuT,CAkBvB,CClNO,SAASQ,GAAaC,GAqDzB,OApDAvH,eAAsB/Y,EAAKugB,GACvB9F,EAAkB,MAAX8F,IAAoBA,EAAQC,UAAW,mCAAoC,aAClF,MAAMC,EAAWzgB,EAAIgM,IAAIxL,MAAM,KAAK,GAAGkgB,cACvCjG,EAAoB,SAAbgG,GAAoC,UAAbA,EAAsB,wBAAwBA,IAAY,wBAAyB,CAC7GtG,KAAM,CAAEsG,YACRtF,UAAW,YAEfV,EAAoB,UAAbgG,IAAyBzgB,EAAI2gB,aAAe3gB,EAAI4gB,4BAA6B,8CAA+C,wBAAyB,CACxJzF,UAAW,YAEf,IAAIxC,EAAQ,KACZ,MAAMkI,EAAa,IAAIC,gBACjBC,EAAQje,YAAW,KACrB6V,EAAQsB,EAAU,kBAAmB,WACrC4G,EAAWG,OAAO,GACnBhhB,EAAIihB,SACHV,GACAA,EAAQW,aAAY,KAChBvI,EAAQsB,EAAU,oBAAqB,aACvC4G,EAAWG,OAAO,IAG1B,MAAMG,EAAO,CACT3F,OAAQxb,EAAIwb,OACZ4F,QAAS,IAAIC,QAAQvV,MAAMI,KAAKlM,IAChCshB,KAAMthB,EAAIshB,WAAQC,EAClBC,OAAQX,EAAWW,QAEvB,IAAIC,EACJ,IACIA,QAAaC,MAAM1hB,EAAIgM,IAAKmV,EAChC,CACA,MAAOQ,GAEH,GADAhb,aAAaoa,GACTpI,EACA,MAAMA,EAEV,MAAMgJ,CACV,CACAhb,aAAaoa,GACb,MAAMK,EAAU,CAAA,EAChBK,EAAKL,QAAQrV,SAAQ,CAACwM,EAAOzO,KACzBsX,EAAQtX,EAAI4W,eAAiBnI,CAAK,IAEtC,MAAMqJ,QAAiBH,EAAKI,cACtBP,EAAoB,MAAZM,EAAoB,KAAO,IAAIjI,WAAWiI,GACxD,MAAO,CACHE,WAAYL,EAAKM,OACjBC,cAAeP,EAAKQ,WACpBb,UAASE,OAEjB,CAEJ,CC3BA,IAAIY,GAAoB7B,KACxB,MAAM8B,GAAS,IAAIC,OAAO,kCAAmC,KACvDC,GAAS,IAAID,OAAO,wBAA0B,KAEpD,IAAIE,IAAS,EAEbvJ,eAAewJ,GAAgBvW,EAAKwV,GAChC,IACI,MAAMlgB,EAAQ0K,EAAI1K,MAAM6gB,IACxB,IAAK7gB,EACD,MAAM,IAAIsX,MAAM,gBAEpB,OAAO,IAAI4J,GAAc,IAAK,KAAM,CAChC,eAAiBlhB,EAAM,IAAM,cAC7BA,EAAM,GCxCX,SAAsBmhB,GACzBA,EAAWC,KAAKD,GAChB,MAAMpf,EAAO,IAAIsW,WAAW8I,EAASphB,QACrC,IAAK,IAAIO,EAAI,EAAGA,EAAI6gB,EAASphB,OAAQO,IACjCyB,EAAKzB,GAAK6gB,EAAS5gB,WAAWD,GAElC,OAAOia,EAASxY,EACpB,CDiCuBsf,CAAarhB,EAAM,IAkyB/Bie,EAlyB+Cje,EAAM,GAkyBnCZ,QAAQ,yBAAyB,CAACuI,EAAK4P,IACrDhY,OAAOoa,aAAaU,SAAS9C,EAAM,QAlyB9C,CACA,MAAOF,GACH,OAAO,IAAI6J,GAAc,IAAK,kCAAmC,CAAA,EAAI,KAAM,IAAII,GAAa5W,GAChG,CACJ,CAKA,SAAS6W,GAAmBC,GAaxB,OAZA/J,eAA2B/M,EAAKwV,GAC5B,IACI,MAAMlgB,EAAQ0K,EAAI1K,MAAM+gB,IACxB,IAAK/gB,EACD,MAAM,IAAIsX,MAAM,gBAEpB,OAAO,IAAIgK,GAAa,GAAGE,IAAUxhB,EAAM,KAC/C,CACA,MAAOqX,GACH,OAAO,IAAI6J,GAAc,IAAK,iCAAkC,CAAA,EAAI,KAAM,IAAII,GAAa5W,GAC/F,CACJ,CAEJ,CACA,MAAM+W,GAAW,CACb1f,KAAQkf,GACRS,KAAQH,GAAmB,kCAEzBI,GAAe,IAAIC,QAIlB,MAAMC,GACTC,GACA5C,GACA,WAAAle,CAAY+gB,GACR5e,MAAK2e,EAAa,GAClB3e,MAAK+b,GAAa,EAClByC,GAAanT,IAAIuT,GAAS,KACtB,IAAI5e,MAAK+b,EAAT,CAGA/b,MAAK+b,GAAa,EAClB,IAAK,MAAM1B,KAAYra,MAAK2e,EACxBtgB,YAAW,KAAQgc,GAAU,GAAK,GAEtCra,MAAK2e,EAAa,EALlB,CAKoB,GAE5B,CACA,WAAAlC,CAAYpC,GACRrE,GAAQhW,MAAK+b,EAAY,2BAA4B,wBAAyB,CAC1ErF,UAAW,wCAEf1W,MAAK2e,EAAWvgB,KAAKic,EACzB,CACA,aAAI0B,GAAc,OAAO/b,MAAK+b,CAAY,CAC1C,WAAA8C,GACI7I,GAAQhW,KAAK+b,UAAW,YAAa,YAAa,CAAA,EACtD,EAGJ,SAAS8C,GAAY9B,GACjB,GAAc,MAAVA,EACA,MAAM,IAAI5I,MAAM,qCAGpB,OADA4I,EAAO8B,cACA9B,CACX,CAeO,MAAMoB,GACTW,GACAC,GACApC,GACA5F,GACAyF,GACAjV,GACAsV,GACAmC,GACAC,GAEAC,GACAC,GACAnP,GACA+M,GACAqC,GACAC,GAIA,OAAI9X,GAAQ,OAAOvH,MAAKuH,CAAM,CAC9B,OAAIA,CAAIA,GACJvH,MAAKuH,EAAOnL,OAAOmL,EACvB,CAoBA,QAAIsV,GACA,OAAkB,MAAd7c,MAAK6c,EACE,KAEJ,IAAI3H,WAAWlV,MAAK6c,EAC/B,CACA,QAAIA,CAAKA,GACL,GAAY,MAARA,EACA7c,MAAK6c,OAAQC,EACb9c,MAAKgf,OAAYlC,OAEhB,GAAsB,iBAAV,EACb9c,MAAK6c,EAAQ/B,EAAY+B,GACzB7c,MAAKgf,EAAY,kBAEhB,GAAInC,aAAgB3H,WACrBlV,MAAK6c,EAAQA,EACb7c,MAAKgf,EAAY,+BAEhB,IAAsB,iBAAV,EAKb,MAAM,IAAI7K,MAAM,gBAJhBnU,MAAK6c,EAAQ/B,EAAYtU,KAAKC,UAAUoW,IACxC7c,MAAKgf,EAAY,kBAIrB,CACJ,CAIA,OAAAM,GACI,OAAsB,MAAdtf,MAAK6c,CACjB,CAMA,UAAI9F,GACA,OAAI/W,MAAK+W,EACE/W,MAAK+W,EAEZ/W,KAAKsf,UACE,OAEJ,KACX,CACA,UAAIvI,CAAOA,GACO,MAAVA,IACAA,EAAS,IAEb/W,MAAK+W,EAAU3a,OAAO2a,GAAQwI,aAClC,CAUA,WAAI5C,GACA,MAAMA,EAAUlf,OAAOsY,OAAO,CAAA,EAAI/V,MAAK2c,GAcvC,OAbI3c,MAAKif,IACLtC,EAAuB,cAAI,SC/NhC,SAAsB6C,GACzB,MAAM5gB,EAAOwY,EAASoI,GACtB,IAAIxB,EAAW,GACf,IAAK,IAAI7gB,EAAI,EAAGA,EAAIyB,EAAKhC,OAAQO,IAC7B6gB,GAAY5hB,OAAOoa,aAAa5X,EAAKzB,IAEzC,OAAOsiB,KAAKzB,EAChB,CDwNgD0B,CAAa5E,EAAY9a,MAAKif,OAGlEjf,KAAK2f,YACLhD,EAAQ,mBAAqB,QAEF,MAA3BA,EAAQ,iBAA2B3c,MAAKgf,IACxCrC,EAAQ,gBAAkB3c,MAAKgf,GAE/Bhf,KAAK6c,OACLF,EAAQ,kBAAoBvgB,OAAO4D,KAAK6c,KAAKjgB,SAE1C+f,CACX,CAIA,SAAAiD,CAAUva,GACN,OAAOrF,KAAK2c,QAAQtX,EAAI4W,cAC5B,CAKA,SAAA4D,CAAUxa,EAAKyO,GACX9T,MAAK2c,EAASvgB,OAAOiJ,GAAK4W,eAAiB7f,OAAO0X,EACtD,CAIA,YAAAgM,GACI9f,MAAK2c,EAAW,EACpB,CACA,CAACoD,OAAOC,YACJ,MAAMrD,EAAU3c,KAAK2c,QACfxe,EAAOV,OAAOU,KAAKwe,GACzB,IAAI/K,EAAQ,EACZ,MAAO,CACH1R,KAAM,KACF,GAAI0R,EAAQzT,EAAKvB,OAAQ,CACrB,MAAMyI,EAAMlH,EAAKyT,KACjB,MAAO,CACHkC,MAAO,CAACzO,EAAKsX,EAAQtX,IAAO4a,MAAM,EAE1C,CACA,MAAO,CAAEnM,WAAOgJ,EAAWmD,MAAM,EAAM,EAGnD,CAMA,eAAI/D,GACA,OAAOlc,MAAKif,GAAU,IAC1B,CAIA,cAAAiB,CAAeC,EAAUC,GACrBnK,GAAgBkK,EAAStjB,MAAM,KAAM,wCAAyC,WAAY,cAC1FmD,MAAKif,EAAS,GAAGkB,KAAYC,GACjC,CAKA,aAAIT,GACA,OAAO3f,MAAK+e,CAChB,CACA,aAAIY,CAAU7L,GACV9T,MAAK+e,IAAUjL,CACnB,CAKA,+BAAIqI,GACA,QAASnc,MAAK8e,CAClB,CACA,+BAAI3C,CAA4BrI,GAC5B9T,MAAK8e,IAAmBhL,CAC5B,CAKA,WAAI0I,GAAY,OAAOxc,MAAKwc,CAAU,CACtC,WAAIA,CAAQA,GACRvG,EAAeuG,GAAW,EAAG,2BAA4B,UAAWA,GACpExc,MAAKwc,EAAWA,CACpB,CAQA,iBAAI6D,GACA,OAAOrgB,MAAKkf,GAAc,IAC9B,CACA,iBAAImB,CAAcnB,GACdlf,MAAKkf,EAAaA,CACtB,CAWA,eAAIoB,GACA,OAAOtgB,MAAKmf,GAAY,IAC5B,CACA,eAAImB,CAAYnB,GACZnf,MAAKmf,EAAWA,CACpB,CAIA,aAAIoB,GACA,OAAOvgB,MAAKgQ,GAAU,IAC1B,CACA,aAAIuQ,CAAUvQ,GACVhQ,MAAKgQ,EAASA,CAClB,CAgBA,cAAIqP,GACA,OAAOrf,MAAKqf,GAAe5B,EAC/B,CACA,cAAI4B,CAAWvL,GACX9T,MAAKqf,EAAcvL,CACvB,CAOA,WAAAjW,CAAY0J,GACRvH,MAAKuH,EAAOnL,OAAOmL,GACnBvH,MAAK8e,GAAiB,EACtB9e,MAAK+e,GAAQ,EACb/e,MAAK2c,EAAW,GAChB3c,MAAK+W,EAAU,GACf/W,MAAKwc,EAAW,IAChBxc,MAAKof,EAAY,CACboB,aArXU,IAsXVC,YAvXS,IAyXbzgB,MAAKqf,EAAc,IACvB,CACA,QAAArjB,GACI,MAAO,wBAAwBwK,KAAKC,UAAUzG,KAAK+W,eAAevQ,KAAKC,UAAUzG,KAAKuH,gBAAgBf,KAAKC,UAAUzG,KAAK2c,iBAAiB3c,MAAK6c,EAAQpF,EAAQzX,MAAK6c,GAAS,SAClL,CAKA,iBAAA6D,CAAkBC,GACa,MAAvBA,EAAOH,eACPxgB,MAAKof,EAAUoB,aAAeG,EAAOH,cAEf,MAAtBG,EAAOF,cACPzgB,MAAKof,EAAUqB,YAAcE,EAAOF,YAE5C,CACA,OAAM3T,CAAM8T,EAASC,EAASC,EAAOC,EAAUC,GAC3C,GAAIJ,GAAW5gB,MAAKof,EAAUqB,YAC1B,OAAOO,EAAUC,gBAAgB,gCAErCjL,EAAO1D,MAAauO,EAAS,UAAW,UAAW,CAC/CnK,UAAW,eAAgB8D,OAAQ,UAAWoE,QAASmC,IAEvDD,EAAQ,SAsapB,SAAcA,GACV,OAAO,IAAItM,SAAS5J,GAAYvM,WAAWuM,EAASkW,IACxD,CAvakBlX,CAAKkX,GAEf,IAAIvlB,EAAMyE,KAAKkhB,QACf,MAAMC,GAAU5lB,EAAIgM,IAAIxL,MAAM,KAAK,IAAM,IAAIkgB,cAE7C,GAAIkF,KAAU7C,GAAU,CACpB,MAAMlJ,QAAekJ,GAAS6C,GAAQ5lB,EAAIgM,IAAKsX,GAAYkC,GAAShE,IACpE,GAAI3H,aAAkB2I,GAAe,CACjC,IAAIqD,EAAWhM,EACf,GAAIpV,KAAKsgB,YAAa,CAClBzB,GAAYkC,GAAShE,GACrB,IACIqE,QAAiBphB,KAAKsgB,YAAY/kB,EAAK6lB,EAC3C,CACA,MAAOlN,GAEmB,MAAlBA,EAAMkL,UAA6C,iBAAjBlL,EAAW,OAC7CkN,EAASH,gBAAgB,oCAAqC/M,GAAOmN,UAG7E,CACJ,CACA,OAAOD,CACX,CACA7lB,EAAM6Z,CACV,CAEIpV,KAAKqgB,gBACL9kB,QAAYyE,KAAKqgB,cAAc9kB,IAEnC,MAAMyhB,QAAahd,KAAKqf,WAAW9jB,EAAKsjB,GAAYkC,GAAShE,IAC7D,IAAIqE,EAAW,IAAIrD,GAAcf,EAAKK,WAAYL,EAAKO,cAAeP,EAAKL,QAASK,EAAKH,KAAMkE,GAC/F,GAA4B,MAAxBK,EAAS/D,YAA8C,MAAxB+D,EAAS/D,WAAoB,CAE5D,IACI,MAAMiE,EAAWF,EAASzE,QAAQ2E,UAAY,GAC9C,OAAO/lB,EAAIgmB,SAASD,IAAUxU,EAAM8T,EAAU,EAAGC,EAAS,EAAGE,EAAUK,EAC3E,CACA,MAAOlN,GAAS,CAEhB,OAAOkN,CACX,CACK,GAA4B,MAAxBA,EAAS/D,aAEQ,MAAlBrd,KAAKugB,iBAA4BvgB,KAAKugB,UAAUhlB,EAAK6lB,EAAUR,IAAW,CAC1E,MAAMY,EAAaJ,EAASzE,QAAQ,eACpC,IAAImE,EAAQ9gB,MAAKof,EAAUoB,aAAe9jB,KAAK+kB,MAAM/kB,KAAKL,SAAWK,KAAKglB,IAAI,EAAGd,IAIjF,MAH4B,iBAAxB,GAAoCY,EAAW3kB,MAAM,mBACrDikB,EAAQ5J,SAASsK,IAEdjmB,EAAI2lB,SAAQpU,EAAM8T,EAAU,EAAGC,EAASC,EAAOC,EAAUK,EACpE,CAEJ,GAAIphB,KAAKsgB,YAAa,CAClBzB,GAAYkC,GAAShE,GACrB,IACIqE,QAAiBphB,KAAKsgB,YAAY/kB,EAAK6lB,EAC3C,CACA,MAAOlN,GAEmB,MAAlBA,EAAMkL,UAA6C,iBAAjBlL,EAAW,OAC7CkN,EAASH,gBAAgB,oCAAqC/M,GAAOmN,WAGzE,IAAIP,EAAQ9gB,MAAKof,EAAUoB,aAAe9jB,KAAK+kB,MAAM/kB,KAAKL,SAAWK,KAAKglB,IAAI,EAAGd,IAKjF,OAHI1M,EAAMyN,OAAS,IACfb,EAAQ5M,EAAMyN,OAEXpmB,EAAI2lB,SAAQpU,EAAM8T,EAAU,EAAGC,EAASC,EAAOC,EAAUK,EACpE,CACJ,CACA,OAAOA,CACX,CAIA,IAAAtU,GAGI,OAFAkJ,EAAuB,MAAhBhW,MAAK+c,EAAiB,uBAAwB,wBAAyB,CAAErG,UAAW,sBAC3F1W,MAAK+c,EAAU,IAAI2B,GAAkB1e,MAC9BA,MAAK8M,EAAM,EAAGwF,KAAYtS,KAAKwc,QAAS,EAAGxc,KAAM,IAAI+d,GAAc,EAAG,GAAI,CAAE,EAAE,KAAM/d,MAC/F,CAKA,MAAA4hB,GACI5L,EAAuB,MAAhBhW,MAAK+c,EAAiB,4BAA6B,wBAAyB,CAAErG,UAAW,wBAChG,MAAMqG,EAASyB,GAAa3a,IAAI7D,MAChC,IAAK+c,EACD,MAAM,IAAI5I,MAAM,qCAEpB4I,GACJ,CAKA,QAAAwE,CAASD,GAEL,MAAMO,EAAU7hB,KAAKuH,IAAIxL,MAAM,KAAK,GAAGkgB,cACjCrH,EAAS0M,EAASvlB,MAAM,KAAK,GAAGkgB,cAKtCjG,EAAuB,QAAhBhW,KAAK+W,SAAiC,UAAZ8K,GAAkC,SAAXjN,IAAsB0M,EAASzkB,MAAM,YAAa,uBAAwB,wBAAyB,CACvJ6Z,UAAW,YAAY1W,KAAK+W,UAAUvQ,KAAKC,UAAUzG,KAAKuH,WAAWf,KAAKC,UAAU6a,QAGxF,MAAM/lB,EAAM,IAAI4iB,GAAamD,GAa7B,OAZA/lB,EAAIwb,OAAS,MACbxb,EAAIokB,UAAY3f,KAAK2f,UACrBpkB,EAAIihB,QAAUxc,KAAKwc,QACnBjhB,GAAIohB,EAAWlf,OAAOsY,OAAO,CAAA,EAAI/V,MAAK2c,GAClC3c,MAAK6c,IACLthB,GAAIshB,EAAQ,IAAI3H,WAAWlV,MAAK6c,IAEpCthB,GAAIyjB,EAAYhf,MAAKgf,EAKdzjB,CACX,CAIA,KAAA2lB,GACI,MAAMA,EAAQ,IAAI/C,GAAane,KAAKuH,KAwBpC,OAtBA2Z,GAAMnK,EAAU/W,MAAK+W,EAEjB/W,MAAK6c,IACLqE,GAAMrE,EAAQ7c,MAAK6c,GAEvBqE,GAAMlC,EAAYhf,MAAKgf,EAEvBkC,GAAMvE,EAAWlf,OAAOsY,OAAO,CAAA,EAAI/V,MAAK2c,GAExCuE,GAAMjC,EAASjf,MAAKif,EAChBjf,KAAK2f,YACLuB,EAAMvB,WAAY,GAEtBuB,EAAM1E,QAAUxc,KAAKwc,QACjBxc,KAAKmc,8BACL+E,EAAM/E,6BAA8B,GAExC+E,GAAMhC,EAAalf,MAAKkf,EACxBgC,GAAM/B,EAAWnf,MAAKmf,EACtB+B,GAAMlR,EAAShQ,MAAKgQ,EACpBkR,GAAM9B,EAAY3hB,OAAOsY,OAAO,CAAA,EAAI/V,MAAKof,GACzC8B,GAAM7B,EAAcrf,MAAKqf,EAClB6B,CACX,CAKA,iBAAOY,GACHjE,IAAS,CACb,CAIA,iBAAOkE,CAAWZ,GACd,OAAO7C,GAAS6C,EAAOlF,gBAAkB,IAC7C,CASA,sBAAO+F,CAAgBb,EAAQc,GAE3B,GAAe,UADfd,EAASA,EAAOlF,gBACoB,UAAXkF,EACrB,MAAM,IAAIhN,MAAM,oBAAoBgN,yBAExC,GAAItD,GACA,MAAM,IAAI1J,MAAM,mBAEpBmK,GAAS6C,GAAUc,CACvB,CASA,qBAAOC,CAAeC,GAClB,GAAItE,GACA,MAAM,IAAI1J,MAAM,mBAEpBsJ,GAAoB0E,CACxB,CAYA,uBAAOC,CAAiBvG,GACpB,OAAOD,IACX,CAUA,wBAAOyG,GACH,OAAOvE,EACX,CAQA,4BAAOwE,CAAsBjE,GACzB,OAAOD,GAAmBC,EAC9B,EAMG,MAAMN,GACTV,GACAE,GACAZ,GACAE,GACA+B,GACA1K,GACA,QAAAlY,GACI,MAAO,yBAAyBgE,KAAKqd,mBAAmBrd,MAAK6c,EAAQpF,EAAQzX,MAAK6c,GAAS,SAC/F,CAIA,cAAIQ,GAAe,OAAOrd,MAAKqd,CAAa,CAI5C,iBAAIE,GAAkB,OAAOvd,MAAKud,CAAgB,CAIlD,WAAIZ,GAAY,OAAOlf,OAAOsY,OAAO,CAAA,EAAI/V,MAAK2c,EAAW,CAIzD,QAAIE,GACA,OAAsB,MAAd7c,MAAK6c,EAAiB,KAAO,IAAI3H,WAAWlV,MAAK6c,EAC7D,CAOA,YAAI0F,GACA,IACI,OAAsB,MAAdviB,MAAK6c,EAAiB,GAAK3B,GAAalb,MAAK6c,EACzD,CACA,MAAO3I,GACH8B,GAAO,EAAO,wCAAyC,wBAAyB,CAC5EU,UAAW,WAAYhB,KAAM,CAAE0L,SAAUphB,OAEjD,CACJ,CAOA,YAAIwiB,GACA,IACI,OAAOhc,KAAK+E,MAAMvL,KAAKuiB,SAC3B,CACA,MAAOrO,GACH8B,GAAO,EAAO,kCAAmC,wBAAyB,CACtEU,UAAW,WAAYhB,KAAM,CAAE0L,SAAUphB,OAEjD,CACJ,CACA,CAAC+f,OAAOC,YACJ,MAAMrD,EAAU3c,KAAK2c,QACfxe,EAAOV,OAAOU,KAAKwe,GACzB,IAAI/K,EAAQ,EACZ,MAAO,CACH1R,KAAM,KACF,GAAI0R,EAAQzT,EAAKvB,OAAQ,CACrB,MAAMyI,EAAMlH,EAAKyT,KACjB,MAAO,CACHkC,MAAO,CAACzO,EAAKsX,EAAQtX,IAAO4a,MAAM,EAE1C,CACA,MAAO,CAAEnM,WAAOgJ,EAAWmD,MAAM,EAAM,EAGnD,CACA,WAAApiB,CAAYwf,EAAYE,EAAeZ,EAASE,EAAM+B,GAClD5e,MAAKqd,EAAcA,EACnBrd,MAAKud,EAAiBA,EACtBvd,MAAK2c,EAAWlf,OAAOU,KAAKwe,GAASlI,QAAO,CAACC,EAAOzW,KAChDyW,EAAMzW,EAAEge,eAAiB7f,OAAOugB,EAAQ1e,IACjCyW,IACR,CAAE,GACL1U,MAAK6c,EAAkB,MAARA,EAAgB,KAAO,IAAI3H,WAAW2H,GACrD7c,MAAK4e,EAAYA,GAAW,KAC5B5e,MAAKkU,EAAS,CAAEuB,QAAS,GAC7B,CAMA,eAAAwL,CAAgBxL,EAASvB,GACrB,IAAIqJ,EAMAA,EALC9H,EAKe,kCAAkCzV,KAAKqd,cAAcrd,KAAKud,kBAAkB9H,KAH5E,kCADhBA,EAAU,GAAGzV,KAAKqd,cAAcrd,KAAKud,mBAMzC,MAAM6D,EAAW,IAAIrD,GAAc,IAAKR,EAAevd,KAAK2c,QAAS3c,KAAK6c,KAAM7c,MAAK4e,QAAY9B,GAEjG,OADAsE,GAASlN,EAAS,CAAEuB,UAASvB,SACtBkN,CACX,CAMA,kBAAAqB,CAAmBhN,EAASkM,GACX,MAATA,EACAA,GAAS,EAGT1L,EAAekD,OAAOC,UAAUuI,IAAUA,GAAS,EAAG,wBAAyB,QAASA,GAE5F,MAAMzN,EAAQ,IAAIC,MAAMsB,GAAW,uBAEnC,MADAd,EAAiBT,EAAO,CAAEyN,QAAOvC,UAAU,IACrClL,CACV,CAIA,SAAA0L,CAAUva,GACN,OAAOrF,KAAK2c,QAAQtX,EAAI4W,cAC5B,CAIA,OAAAqD,GACI,OAAsB,MAAdtf,MAAK6c,CACjB,CAIA,WAAI+B,GAAY,OAAO5e,MAAK4e,CAAU,CAItC,EAAAnb,GACI,MAAgC,KAAxBzD,MAAKkU,EAAOuB,SAAkBzV,KAAKqd,YAAc,KAAOrd,KAAKqd,WAAa,GACtF,CAIA,QAAAgE,GACI,GAAIrhB,KAAKyD,KACL,OAEJ,IAAIgS,QAAEA,EAAOvB,MAAEA,GAAUlU,MAAKkU,EACd,KAAZuB,IACAA,EAAU,mBAAmBzV,KAAKqd,cAAcrd,KAAKud,iBAEzD,IAAImF,EAAa,KACb1iB,KAAK4e,UACL8D,EAAa1iB,KAAK4e,QAAQrX,KAE9B,IAAIob,EAAe,KACnB,IACQ3iB,MAAK6c,IACL8F,EAAezH,GAAalb,MAAK6c,GAEzC,CACA,MAAOle,GAAK,CACZqX,GAAO,EAAOP,EAAS,eAAgB,CACnCmJ,QAAU5e,KAAK4e,SAAW,kBAAoBwC,SAAUphB,KAAMkU,QAC9DwB,KAAM,CACFgN,aAAYC,eACZC,eAAgB,GAAG5iB,KAAKqd,cAAcrd,KAAKud,kBAGvD,EAEJ,SAASjL,KAAY,OAAO,IAAKpT,MAAQoT,SAAW,CEt0BpD,SAASuQ,GAAY/O,GACjB,IAAIsB,EAAStB,EAAM9X,SAAS,IAC5B,KAAOoZ,EAAOxY,OAAS,GACnBwY,EAAS,IAAMA,EAEnB,MAAO,KAAOA,CAClB,CACA,SAAS0N,GAAkBlkB,EAAMqY,EAAQra,GACrC,IAAIwY,EAAS,EACb,IAAK,IAAIjY,EAAI,EAAGA,EAAIP,EAAQO,IACxBiY,EAAmB,IAATA,EAAgBxW,EAAKqY,EAAS9Z,GAE5C,OAAOiY,CACX,CACA,SAAS2N,GAAgBnkB,EAAMqY,EAAQ+L,EAAapmB,GAChD,MAAMwY,EAAS,GACf,KAAO4N,EAAc/L,EAAS,EAAIra,GAAQ,CACtC,MAAMqmB,EAAUC,GAAQtkB,EAAMokB,GAC9B5N,EAAOhX,KAAK6kB,EAAQ7N,QAEpBY,GADAgN,GAAeC,EAAQE,WACDlM,EAAS,EAAIra,EAAQ,uBAAwB,iBAAkB,CACjFmb,OAAQnZ,EAAMhC,SAAQqa,UAE7B,CACD,MAAO,CAAEkM,SAAW,EAAIvmB,EAASwY,OAAQA,EAC7C,CAEA,SAAS8N,GAAQtkB,EAAMqY,GACnBjB,EAAuB,IAAhBpX,EAAKhC,OAAc,iBAAkB,iBAAkB,CAC1Dmb,OAAQnZ,EAAMhC,OAAQ,EAAGqa,OAAQ,IAErC,MAAMmM,EAAenM,IACjBjB,EAAOiB,GAAUrY,EAAKhC,OAAQ,+BAAgC,iBAAkB,CAC5Emb,OAAQnZ,EAAMhC,OAAQgC,EAAKhC,OAAQqa,UACrC,EAGN,GAAIrY,EAAKqY,IAAW,IAAM,CACtB,MAAMoM,EAAezkB,EAAKqY,GAAU,IACpCmM,EAAYnM,EAAS,EAAIoM,GACzB,MAAMzmB,EAASkmB,GAAkBlkB,EAAMqY,EAAS,EAAGoM,GAEnD,OADAD,EAAYnM,EAAS,EAAIoM,EAAezmB,GACjCmmB,GAAgBnkB,EAAMqY,EAAQA,EAAS,EAAIoM,EAAcA,EAAezmB,EAClF,CACI,GAAIgC,EAAKqY,IAAW,IAAM,CAC3B,MAAMra,EAASgC,EAAKqY,GAAU,IAE9B,OADAmM,EAAYnM,EAAS,EAAIra,GAClBmmB,GAAgBnkB,EAAMqY,EAAQA,EAAS,EAAGra,EACpD,CACI,GAAIgC,EAAKqY,IAAW,IAAM,CAC3B,MAAMoM,EAAezkB,EAAKqY,GAAU,IACpCmM,EAAYnM,EAAS,EAAIoM,GACzB,MAAMzmB,EAASkmB,GAAkBlkB,EAAMqY,EAAS,EAAGoM,GACnDD,EAAYnM,EAAS,EAAIoM,EAAezmB,GAExC,MAAO,CAAEumB,SAAW,EAAIE,EAAezmB,EAASwY,OADjCqC,EAAQ7Y,EAAKnD,MAAMwb,EAAS,EAAIoM,EAAcpM,EAAS,EAAIoM,EAAezmB,IAE5F,CACI,GAAIgC,EAAKqY,IAAW,IAAM,CAC3B,MAAMra,EAASgC,EAAKqY,GAAU,IAC9BmM,EAAYnM,EAAS,EAAIra,GAEzB,MAAO,CAAEumB,SAAW,EAAIvmB,EAASwY,OADlBqC,EAAQ7Y,EAAKnD,MAAMwb,EAAS,EAAGA,EAAS,EAAIra,IAE9D,CACD,MAAO,CAAEumB,SAAU,EAAG/N,OAAQyN,GAAYjkB,EAAKqY,IACnD,CAIO,SAASqM,GAAU9D,GACtB,MAAM5gB,EAAOwY,EAASoI,EAAO,QACvByD,EAAUC,GAAQtkB,EAAM,GAE9B,OADAqX,EAAegN,EAAQE,WAAavkB,EAAKhC,OAAQ,oCAAqC,OAAQ4iB,GACvFyD,EAAQ7N,MACnB,CC3EA,SAASmO,GAAgBzP,GACrB,MAAMsB,EAAS,GACf,KAAOtB,GACHsB,EAAOoO,QAAgB,IAAR1P,GACfA,IAAU,EAEd,OAAOsB,CACX,CACA,SAASqO,GAAQC,GACb,GAAIrc,MAAM4N,QAAQyO,GAAS,CACvB,IAAIC,EAAU,GAId,GAHAD,EAAOpc,SAAQ,SAAUsc,GACrBD,EAAUA,EAAQjQ,OAAO+P,GAAQG,GAC7C,IACYD,EAAQ/mB,QAAU,GAElB,OADA+mB,EAAQH,QAAQ,IAAOG,EAAQ/mB,QACxB+mB,EAEX,MAAM/mB,EAAS2mB,GAAgBI,EAAQ/mB,QAEvC,OADAA,EAAO4mB,QAAQ,IAAO5mB,EAAOA,QACtBA,EAAO8W,OAAOiQ,EACxB,CACD,MAAM/kB,EAAOyI,MAAM3J,UAAUjC,MAAMqC,KAAKsZ,EAASsM,EAAQ,WACzD,GAAoB,IAAhB9kB,EAAKhC,QAAgBgC,EAAK,IAAM,IAChC,OAAOA,EAEN,GAAIA,EAAKhC,QAAU,GAEpB,OADAgC,EAAK4kB,QAAQ,IAAO5kB,EAAKhC,QAClBgC,EAEX,MAAMhC,EAAS2mB,GAAgB3kB,EAAKhC,QAEpC,OADAA,EAAO4mB,QAAQ,IAAO5mB,EAAOA,QACtBA,EAAO8W,OAAO9U,EACzB,CACA,MAAMilB,GAAU,mBAIT,SAASC,GAAUJ,GACtB,IAAItO,EAAS,KACb,IAAK,MAAM3U,KAAKgjB,GAAQC,GACpBtO,GAAUyO,GAAQpjB,GAAK,GACvB2U,GAAUyO,GAAY,GAAJpjB,GAEtB,OAAO2U,CACX,CCpCO,SAAS2O,GAAOC,GACnB,MAAMtM,EAAQN,EAAS4M,EAAa,eAGpCtM,EAAM,GAAiB,GAAXA,EAAM,GAAa,GAI/BA,EAAM,GAAiB,GAAXA,EAAM,GAAa,IAC/B,MAAM5D,EAAQ2D,EAAQC,GACtB,MAAO,CACH5D,EAAMqD,UAAU,EAAG,IACnBrD,EAAMqD,UAAU,GAAI,IACpBrD,EAAMqD,UAAU,GAAI,IACpBrD,EAAMqD,UAAU,GAAI,IACpBrD,EAAMqD,UAAU,GAAI,KACtBtP,KAAK,IACX,CCtBO,MAAMoc,GAAW,GAClBC,GAAU,IAAIhP,WAAW+O,IAGzBE,GAAiB,CAAC,QAClBC,GAAS,CAAA,EACTC,GAAc,IAAI5F,QACxB,SAAS6F,GAASlP,GACd,OAAOiP,GAAYxgB,IAAIuR,EAC3B,CACA,SAASmP,GAASnP,EAAQoP,GACtBH,GAAYhZ,IAAI+J,EAAQoP,EAC5B,CACA,SAASC,GAAWha,EAAMyJ,GACtB,MAAMwQ,EAAU,IAAIvQ,MAAM,0DAA0D1J,KAEpF,MADAia,EAAQxQ,MAAQA,EACVwQ,CACV,CACA,SAASC,GAASH,EAAOI,EAAOC,GAC5B,OAAIL,EAAMtmB,QAAQ,OAAS,EAChB0mB,EAAM3e,KAAI,CAACqF,EAAMsG,IAChBtG,aAAgBwZ,GACTH,GAASL,GAAShZ,GAAOA,EAAMuZ,GAEnCvZ,IAGRkZ,EAAM/P,QAAO,CAACC,EAAOjK,EAAMmH,KAC9B,IAAItG,EAAOsZ,EAAMG,SAASta,GAO1B,OANMA,KAAQiK,IACNmQ,GAAQvZ,aAAgBwZ,KACxBxZ,EAAOqZ,GAASL,GAAShZ,GAAOA,EAAMuZ,IAE1CnQ,EAAMjK,GAAQa,GAEXoJ,CAAK,GACb,CAAE,EACT,CAQO,MAAMoQ,WAAezd,MAIxBmd,GAIA,WAAA3mB,IAAemnB,GAOX,MAAMnO,EAAQmO,EAAK,GACnB,IAAIJ,EAAQI,EAAK,GACbR,GAASQ,EAAK,IAAM,IAAIvpB,QACxBwpB,GAAO,EACPpO,IAAUuN,KACVQ,EAAQI,EACRR,EAAQ,GACRS,GAAO,GAIXtb,MAAMib,EAAMhoB,QACZgoB,EAAMtd,SAAQ,CAACgE,EAAMsG,KAAY5R,KAAK4R,GAAStG,CAAI,IAEnD,MAAM4Z,EAAaV,EAAM/P,QAAO,CAACC,EAAOjK,KACd,iBAAV,GACRiK,EAAMrJ,IAAIZ,GAAOiK,EAAM7Q,IAAI4G,IAAS,GAAK,GAEtCiK,IACP,IAAIyQ,KAcR,GAZAZ,GAASvkB,KAAMvC,OAAOmd,OAAOgK,EAAM3e,KAAI,CAACqF,EAAMsG,KAC1C,MAAMnH,EAAO+Z,EAAM5S,GACnB,OAAY,MAARnH,GAAyC,IAAzBya,EAAWrhB,IAAI4G,GACxBA,EAEJ,IAAI,MAGfzK,MAAKwkB,EAAS,GACK,MAAfxkB,MAAKwkB,GACCxkB,MAAW,GAEhBilB,EACD,OAGJxnB,OAAOmd,OAAO5a,MAEd,MAAMolB,EAAQ,IAAIC,MAAMrlB,KAAM,CAC1B6D,IAAK,CAAC+Q,EAAQ0Q,EAAMC,KAChB,GAAsB,iBAAV,EAAoB,CAE5B,GAAID,EAAKzoB,MAAM,YAAa,CACxB,MAAM+U,EAAQgH,EAAU0M,EAAM,UAC9B,GAAI1T,EAAQ,GAAKA,GAAS5R,KAAKpD,OAC3B,MAAM,IAAIkZ,WAAW,uBAEzB,MAAMxK,EAAOsJ,EAAOhD,GAIpB,OAHItG,aAAgB6I,OAChBsQ,GAAW,SAAS7S,IAAStG,GAE1BA,CACV,CAED,GAAI6Y,GAAejmB,QAAQonB,IAAS,EAChC,OAAOE,QAAQ3hB,IAAI+Q,EAAQ0Q,EAAMC,GAErC,MAAMzR,EAAQc,EAAO0Q,GACrB,GAAIxR,aAAiB2R,SAGjB,OAAO,YAAaT,GAChB,OAAOlR,EAAMnM,MAAO3H,OAASulB,EAAY3Q,EAAS5U,KAAMglB,EACpF,EAEyB,KAAMM,KAAQ1Q,GAEf,OAAOA,EAAOmQ,SAASpd,MAAO3H,OAASulB,EAAY3Q,EAAS5U,KAAM,CAACslB,GAE1E,CACD,OAAOE,QAAQ3hB,IAAI+Q,EAAQ0Q,EAAMC,EAAS,IAIlD,OADAhB,GAASa,EAAOd,GAAStkB,OAClBolB,CACV,CAQD,OAAAM,CAAQb,GACJ,MAAMzP,EAAS,GAUf,OATApV,KAAKsH,SAAQ,CAACgE,EAAMsG,KACZtG,aAAgB6I,OAChBsQ,GAAW,SAAS7S,IAAStG,GAE7BuZ,GAAQvZ,aAAgBwZ,KACxBxZ,EAAOA,EAAKoa,QAAQb,IAExBzP,EAAOhX,KAAKkN,EAAK,IAEd8J,CACV,CASD,QAAAuP,CAASE,GACL,MAAML,EAAQF,GAAStkB,MACvB,OAAOwkB,EAAM/P,QAAO,CAACC,EAAOjK,EAAMmH,KAC9BoE,EAAe,MAARvL,EAAc,kBAAkBmH,YAAiB,wBAAyB,CAC7E8E,UAAW,eAERiO,GAASH,EAAOxkB,KAAM6kB,KAC9B,CAAE,EACR,CAID,KAAAppB,CAAMqc,EAAOzR,GACI,MAATyR,IACAA,EAAQ,GAERA,EAAQ,IACRA,GAAS9X,KAAKpD,QACF,IACRkb,EAAQ,GAGL,MAAPzR,IACAA,EAAMrG,KAAKpD,QAEXyJ,EAAM,IACNA,GAAOrG,KAAKpD,QACF,IACNyJ,EAAM,GAGVA,EAAMrG,KAAKpD,SACXyJ,EAAMrG,KAAKpD,QAEf,MAAM+oB,EAASrB,GAAStkB,MAClBoV,EAAS,GAAIoP,EAAQ,GAC3B,IAAK,IAAIrnB,EAAI2a,EAAO3a,EAAIkJ,EAAKlJ,IACzBiY,EAAOhX,KAAK4B,KAAK7C,IACjBqnB,EAAMpmB,KAAKunB,EAAOxoB,IAEtB,OAAO,IAAI2nB,GAAOV,GAAQhP,EAAQoP,EACrC,CAID,MAAArK,CAAOyL,EAAUC,GACb,MAAMF,EAASrB,GAAStkB,MAClBoV,EAAS,GAAIoP,EAAQ,GAC3B,IAAK,IAAIrnB,EAAI,EAAGA,EAAI6C,KAAKpD,OAAQO,IAAK,CAClC,MAAMmO,EAAOtL,KAAK7C,GACdmO,aAAgB6I,OAChBsQ,GAAW,SAAStnB,IAAKmO,GAEzBsa,EAAS9nB,KAAK+nB,EAASva,EAAMnO,EAAG6C,QAChCoV,EAAOhX,KAAKkN,GACZkZ,EAAMpmB,KAAKunB,EAAOxoB,IAEzB,CACD,OAAO,IAAI2nB,GAAOV,GAAQhP,EAAQoP,EACrC,CAID,GAAAve,CAAI2f,EAAUC,GACV,MAAMzQ,EAAS,GACf,IAAK,IAAIjY,EAAI,EAAGA,EAAI6C,KAAKpD,OAAQO,IAAK,CAClC,MAAMmO,EAAOtL,KAAK7C,GACdmO,aAAgB6I,OAChBsQ,GAAW,SAAStnB,IAAKmO,GAE7B8J,EAAOhX,KAAKwnB,EAAS9nB,KAAK+nB,EAASva,EAAMnO,EAAG6C,MAC/C,CACD,OAAOoV,CACV,CASD,QAAA2P,CAASta,GACL,MAAMmH,EAAQ0S,GAAStkB,MAAM9B,QAAQuM,GACrC,IAAe,IAAXmH,EACA,OAEJ,MAAMkC,EAAQ9T,KAAK4R,GAInB,OAHIkC,aAAiBK,OACjBsQ,GAAW,YAAYje,KAAKC,UAAUgE,KAASqJ,EAAMI,OAElDJ,CACV,CAKD,gBAAOgS,CAAUlB,EAAOzmB,GACpB,OAAO,IAAI2mB,GAAOV,GAAQQ,EAAOzmB,EACpC,EAoCL,SAAS4mB,GAASjR,GACd,IAAI4D,EAAQ8B,EAAU1F,GAKtB,OAJAkC,EAAO0B,EAAM9a,QAAUqnB,GAAU,sBAAuB,iBAAkB,CAAElM,OAAQL,EAAO9a,OAAQqnB,GAAUhN,OAAQS,EAAM9a,SACvH8a,EAAM9a,SAAWqnB,KACjBvM,EAAQL,EAAa3D,EAAO,CAACwQ,GAAQzoB,MAAMic,EAAM9a,OAASqnB,IAAWvM,MAElEA,CACX,CAIO,MAAMqO,GAGTtb,KAGAsJ,KAGAiS,UAIAC,QACA,WAAApoB,CAAY4M,EAAMsJ,EAAMiS,EAAWC,GAC/BtR,EAAiB3U,KAAM,CAAEyK,OAAMsJ,OAAMiS,YAAWC,WAAW,CACvDxb,KAAM,SAAUsJ,KAAM,SAAUiS,UAAW,SAAUC,QAAS,WAErE,CACD,WAAAC,CAAYzQ,EAAS3B,GACjBmC,GAAe,EAAOR,EAASzV,KAAKgmB,UAAWlS,EAClD,EAKE,MAAMqS,GAETvnB,GACAgZ,GACA,WAAA/Z,GACImC,MAAKpB,EAAQ,GACboB,MAAK4X,EAAc,CACtB,CACD,QAAIhZ,GACA,OAAO8U,EAAO1T,MAAKpB,EACtB,CACD,UAAIhC,GAAW,OAAOoD,MAAK4X,CAAc,CACzC,EAAAwO,CAAWxnB,GAGP,OAFAoB,MAAKpB,EAAMR,KAAKQ,GAChBoB,MAAK4X,GAAehZ,EAAKhC,OAClBgC,EAAKhC,MACf,CACD,YAAAypB,CAAaC,GACT,OAAOtmB,MAAKomB,EAAW/O,EAAaiP,EAAO1nB,MAC9C,CAED,UAAA2nB,CAAWzS,GACP,IAAI4D,EAAQL,EAAavD,GACzB,MAAM0S,EAAgB9O,EAAM9a,OAASqnB,GAIrC,OAHIuC,IACA9O,EAAQL,EAAa3D,EAAO,CAACgE,EAAOwM,GAAQzoB,MAAM+qB,OAE/CxmB,MAAKomB,EAAW1O,EAC1B,CAED,UAAA+O,CAAW3S,GACP,OAAO9T,MAAKomB,EAAWrB,GAASjR,GACnC,CAGD,mBAAA4S,GACI,MAAMzP,EAASjX,MAAKpB,EAAMhC,OAG1B,OAFAoD,MAAKpB,EAAMR,KAAK8lB,IAChBlkB,MAAK4X,GAAeqM,GACZnQ,IACJ9T,MAAKpB,EAAMqY,GAAU8N,GAASjR,EAAM,CAE3C,EAKE,MAAM6S,GAKTC,WACAhoB,GACAqY,GACA4P,GACAC,GACAC,GACA,WAAAlpB,CAAYe,EAAMgoB,EAAYG,GAC1BpS,EAAiB3U,KAAM,CAAE4mB,aAAcA,IACvC5mB,MAAKpB,EAAQyY,EAAazY,GAC1BoB,MAAK6mB,EAAa,EAClB7mB,MAAK8mB,EAAU,KACf9mB,MAAK+mB,EAAiC,MAAhBA,EAAwBA,EAAe,KAC7D/mB,MAAKiX,EAAU,CAClB,CACD,QAAIrY,GAAS,OAAO6Y,EAAQzX,MAAKpB,EAAS,CAC1C,cAAIgZ,GAAe,OAAO5X,MAAKpB,EAAMhC,MAAS,CAC9C,YAAIumB,GAAa,OAAOnjB,MAAKiX,CAAU,CACvC,SAAIS,GAAU,OAAO,IAAIxC,WAAWlV,MAAKpB,EAAS,CAClD,EAAAooB,CAAoB7Q,GAChB,GAAInW,MAAK8mB,EACL,OAAO9mB,MAAK8mB,GAAQE,EAAoB7Q,GAE5CnW,MAAK6mB,GAAc1Q,EAEnBH,EAAOhW,MAAK+mB,EAAgB,GAAK/mB,MAAK6mB,GAAc7mB,MAAK+mB,EAAgB/mB,KAAK4X,WAAY,kDAAkD5X,MAAK+mB,gEAA8E,iBAAkB,CAC7OhP,OAAQV,EAAarX,MAAKpB,GAAQqY,OAAQjX,MAAKiX,EAC/Cra,OAAQuZ,EAAOT,KAAM,CACjBmR,UAAW7mB,MAAK6mB,EAChBjP,WAAY5X,KAAK4X,aAG5B,CACD,EAAAqP,CAAWhQ,EAAQra,EAAQsqB,GACvB,IAAIC,EAAgBzqB,KAAK0qB,KAAKxqB,EAASqnB,IAAYA,GAanD,OAZIjkB,MAAKiX,EAAUkQ,EAAgBnnB,MAAKpB,EAAMhC,SACtCoD,KAAK4mB,YAAcM,GAASlnB,MAAKiX,EAAUra,GAAUoD,MAAKpB,EAAMhC,OAChEuqB,EAAgBvqB,EAGhBoZ,GAAO,EAAO,qBAAsB,iBAAkB,CAClD+B,OAAQV,EAAarX,MAAKpB,GAC1BhC,OAAQoD,MAAKpB,EAAMhC,OACnBqa,OAAQjX,MAAKiX,EAAUkQ,KAI5BnnB,MAAKpB,EAAMnD,MAAMuE,MAAKiX,EAASjX,MAAKiX,EAAUkQ,EACxD,CAED,SAAAE,CAAUpQ,GACN,MAAMqQ,EAAS,IAAIX,GAAO3mB,MAAKpB,EAAMnD,MAAMuE,MAAKiX,EAAUA,GAASjX,KAAK4mB,WAAY5mB,MAAK+mB,GAEzF,OADAO,GAAOR,EAAU9mB,KACVsnB,CACV,CAED,SAAAC,CAAU3qB,EAAQsqB,GACd,IAAIxP,EAAQ1X,MAAKinB,EAAW,EAAGrqB,IAAUsqB,GAIzC,OAHAlnB,MAAKgnB,EAAoBpqB,GACzBoD,MAAKiX,GAAWS,EAAM9a,OAEf8a,EAAMjc,MAAM,EAAGmB,EACzB,CAED,SAAA4qB,GACI,OAAOlO,EAAStZ,KAAKunB,UAAUtD,IAClC,CACD,SAAAwD,GACI,OVzTG7O,EAAUU,EUyTGtZ,KAAKunB,UAAUtD,KAClC,8GC/cL,SAASyD,GAAO1pB,GACZ,IAAKmb,OAAOwO,cAAc3pB,IAAMA,EAAI,EAChC,MAAM,IAAImW,MAAM,2BAA2BnW,IACnD,CAKA,SAAS0Z,GAAMxG,KAAM0W,GACjB,KAAM1W,aAAagE,YACf,MAAM,IAAIf,MAAM,uBACpB,GAAIyT,EAAQhrB,OAAS,IAAMgrB,EAAQC,SAAS3W,EAAEtU,QAC1C,MAAM,IAAIuX,MAAM,iCAAiCyT,oBAA0B1W,EAAEtU,SACrF,CACA,SAASM,GAAKA,GACV,GAAoB,mBAATA,GAA8C,mBAAhBA,EAAKoF,OAC1C,MAAM,IAAI6R,MAAM,mDACpBuT,GAAOxqB,EAAK4qB,WACZJ,GAAOxqB,EAAK6qB,SAChB,CACA,SAASC,GAAOC,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIhU,MAAM,oCACpB,GAAI+T,GAAiBD,EAASG,SAC1B,MAAM,IAAIjU,MAAM,wCACxB,CACA,SAASsG,GAAO1X,EAAKklB,GACjBvQ,GAAM3U,GACN,MAAMslB,EAAMJ,EAASH,UACrB,GAAI/kB,EAAInG,OAASyrB,EACb,MAAM,IAAIlU,MAAM,yDAAyDkU,IAEjF,CChCO,MAAMC,GAA+B,iBAAfC,YAA2B,WAAYA,WAAaA,WAAWD,YAASxL,ECQ/F0L,GAAOxe,GAAMA,aAAakL,WAGnBuT,GAAOjV,GAAQ,IAAIkV,YAAYlV,EAAIuE,OAAQvE,EAAImV,WAAYjsB,KAAKC,MAAM6W,EAAIoV,WAAa,IAEvFC,GAAcrV,GAAQ,IAAIsV,SAAStV,EAAIuE,OAAQvE,EAAImV,WAAYnV,EAAIoV,YAEnEG,GAAO,CAACC,EAAMC,IAAWD,GAAS,GAAKC,EAAWD,IAASC;sEAIxE,KADgF,KAA5D,IAAI/T,WAAW,IAAIwT,YAAY,CAAC,YAAa3Q,QAAQ,IAErE,MAAM,IAAI5D,MAAM,+CAsCb,MAAM+U,GAAW5U,YAEjBA,eAAe6U,GAAUC,EAAOC,EAAMrnB,GACzC,IAAIsnB,EAAKpqB,KAAKD,MACd,IAAK,IAAI9B,EAAI,EAAGA,EAAIisB,EAAOjsB,IAAK,CAC5B6E,EAAG7E,GAEH,MAAMosB,EAAOrqB,KAAKD,MAAQqqB,EACtBC,GAAQ,GAAKA,EAAOF,UAElBH,KACNI,GAAMC,EACV,CACJ,CAcO,SAASC,GAAQ5qB,GAGpB,GAFoB,iBAATA,IACPA,EAZD,SAAqBmc,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAI5G,MAAM,2CAA2C4G,GAC/D,OAAO,IAAI7F,YAAW,IAAIuU,aAAcC,OAAO3O,GACnD,CAQe4O,CAAY/qB,KAClB4pB,GAAI5pB,GACL,MAAM,IAAIuV,MAAM,mCAAmCvV,GACvD,OAAOA,CACX,CAgBO,MAAMgrB,GAET,KAAA1I,GACI,OAAOlhB,KAAK6pB,YAChB,EAEJ,MAAMC,GAAQ,CAAE,EAAC9tB,SACV,SAAS+tB,GAAUC,EAAUC,GAChC,QAAanN,IAATmN,GAA2C,oBAArBH,GAAMhsB,KAAKmsB,GACjC,MAAM,IAAI9V,MAAM,yCAEpB,OADe1W,OAAOsY,OAAOiU,EAAUC,EAE3C,CACO,SAASC,GAAgBC,GAC5B,MAAMC,EAAStnB,GAAQqnB,IAAWE,OAAOb,GAAQ1mB,IAAMwnB,SACjDttB,EAAMmtB,IAIZ,OAHAC,EAAMtC,UAAY9qB,EAAI8qB,UACtBsC,EAAMrC,SAAW/qB,EAAI+qB,SACrBqC,EAAM9nB,OAAS,IAAM6nB,IACdC,CACX,CAoBO,SAASpG,GAAYuG,EAAc,IACtC,GAAIjC,IAA4C,mBAA3BA,GAAOkC,gBACxB,OAAOlC,GAAOkC,gBAAgB,IAAItV,WAAWqV,IAEjD,MAAM,IAAIpW,MAAM,yCACpB,CCrJO,MAAMsW,WAAab,GACtB,WAAA/rB,CAAYX,EAAMwtB,GACd/gB,QACA3J,KAAKooB,UAAW,EAChBpoB,KAAKmoB,WAAY,EACjBwC,GAAWztB,GACX,MAAMmI,EAAMmkB,GAAQkB,GAEpB,GADA1qB,KAAK4qB,MAAQ1tB,EAAKoF,SACe,mBAAtBtC,KAAK4qB,MAAMP,OAClB,MAAM,IAAIlW,MAAM,uDACpBnU,KAAK+nB,SAAW/nB,KAAK4qB,MAAM7C,SAC3B/nB,KAAK8nB,UAAY9nB,KAAK4qB,MAAM9C,UAC5B,MAAMC,EAAW/nB,KAAK+nB,SAChB8C,EAAM,IAAI3V,WAAW6S,GAE3B8C,EAAIxf,IAAIhG,EAAIzI,OAASmrB,EAAW7qB,EAAKoF,SAAS+nB,OAAOhlB,GAAKilB,SAAWjlB,GACrE,IAAK,IAAIlI,EAAI,EAAGA,EAAI0tB,EAAIjuB,OAAQO,IAC5B0tB,EAAI1tB,IAAM,GACd6C,KAAK4qB,MAAMP,OAAOQ,GAElB7qB,KAAK8qB,MAAQ5tB,EAAKoF,SAElB,IAAK,IAAInF,EAAI,EAAGA,EAAI0tB,EAAIjuB,OAAQO,IAC5B0tB,EAAI1tB,IAAM,IACd6C,KAAK8qB,MAAMT,OAAOQ,GAClBA,EAAI3S,KAAK,EACb,CACA,MAAAmS,CAAOU,GAGH,OAFAC,GAAahrB,MACbA,KAAK4qB,MAAMP,OAAOU,GACX/qB,IACX,CACA,UAAAirB,CAAWloB,GACPioB,GAAahrB,MACbkrB,GAAYnoB,EAAK/C,KAAK8nB,WACtB9nB,KAAKooB,UAAW,EAChBpoB,KAAK4qB,MAAMK,WAAWloB,GACtB/C,KAAK8qB,MAAMT,OAAOtnB,GAClB/C,KAAK8qB,MAAMG,WAAWloB,GACtB/C,KAAKmrB,SACT,CACA,MAAAb,GACI,MAAMvnB,EAAM,IAAImS,WAAWlV,KAAK8qB,MAAMhD,WAEtC,OADA9nB,KAAKirB,WAAWloB,GACTA,CACX,CACA,UAAA8mB,CAAW9pB,GAEPA,IAAOA,EAAKtC,OAAO6E,OAAO7E,OAAO2tB,eAAeprB,MAAO,CAAE,IACzD,MAAM8qB,MAAEA,EAAKF,MAAEA,EAAKxC,SAAEA,EAAQD,UAAEA,EAASJ,SAAEA,EAAQD,UAAEA,GAAc9nB,KAQnE,OANAD,EAAGqoB,SAAWA,EACdroB,EAAGooB,UAAYA,EACfpoB,EAAGgoB,SAAWA,EACdhoB,EAAG+nB,UAAYA,EACf/nB,EAAG+qB,MAAQA,EAAMjB,WAAW9pB,EAAG+qB,OAC/B/qB,EAAG6qB,MAAQA,EAAMf,WAAW9pB,EAAG6qB,OACxB7qB,CACX,CACA,OAAAorB,GACInrB,KAAKmoB,WAAY,EACjBnoB,KAAK8qB,MAAMK,UACXnrB,KAAK4qB,MAAMO,SACf,EAQG,MAAME,GAAO,CAACnuB,EAAMmI,EAAKoQ,IAAY,IAAIgV,GAAKvtB,EAAMmI,GAAKglB,OAAO5U,GAAS6U,SCtEhF,SAASgB,GAAWpuB,EAAMquB,EAAWC,EAAOC,GACxCd,GAAWztB,GACX,MAAM+sB,EAAOF,GAAU,CAAE2B,MAAO,GAAIC,UAAW,IAAMF,IAC/ClvB,EAAEA,EAACmvB,MAAEA,EAAKC,UAAEA,GAAc1B,EAIhC,GAHA2B,GAAarvB,GACbqvB,GAAaF,GACbE,GAAaD,GACTpvB,EAAI,EACJ,MAAM,IAAI4X,MAAM,yCACpB,MAAMiM,EAAWoJ,GAAQ+B,GACnBM,EAAOrC,GAAQgC,GAEfM,EAAK,IAAI5W,WAAWwW,GAEpBK,EAAMV,GAAK/oB,OAAOpF,EAAMkjB,GACxB4L,EAAUD,EAAIlC,aAAaQ,OAAOwB,GACxC,MAAO,CAAEtvB,IAAGmvB,QAAOC,YAAWG,KAAIC,MAAKC,UAC3C,CAgBO,SAASC,GAAO/uB,EAAMkjB,EAAUyL,EAAM5B,GACzC,MAAM1tB,EAAEA,EAACmvB,MAAEA,EAAKI,GAAEA,EAAEC,IAAEA,EAAGC,QAAEA,GAAYV,GAAWpuB,EAAMkjB,EAAUyL,EAAM5B,GACxE,IAAIiC,EACJ,MAAM1Y,EAAM,IAAI0B,WAAW,GACrBiX,EAAOtD,GAAWrV,GAClBvW,EAAI,IAAIiY,WAAW6W,EAAIjE,WAE7B,IAAK,IAAIsE,EAAK,EAAGC,EAAM,EAAGA,EAAMX,EAAOU,IAAMC,GAAON,EAAIjE,UAAW,CAE/D,MAAMwE,EAAKR,EAAGS,SAASF,EAAKA,EAAMN,EAAIjE,WACtCqE,EAAKK,SAAS,EAAGJ,GAAI,IAGpBF,EAAOF,EAAQnC,WAAWqC,IAAO7B,OAAO7W,GAAKyX,WAAWhuB,GACzDqvB,EAAGjhB,IAAIpO,EAAEsvB,SAAS,EAAGD,EAAG1vB,SACxB,IAAK,IAAI6vB,EAAK,EAAGA,EAAKlwB,EAAGkwB,IAAM,CAE3BV,EAAIlC,WAAWqC,GAAM7B,OAAOptB,GAAGguB,WAAWhuB,GAC1C,IAAK,IAAIE,EAAI,EAAGA,EAAImvB,EAAG1vB,OAAQO,IAC3BmvB,EAAGnvB,IAAMF,EAAEE,EAClB,CACJ,CACD,OArCJ,SAAsB4uB,EAAKC,EAASF,EAAII,EAAMjvB,GAM1C,OALA8uB,EAAIZ,UACJa,EAAQb,UACJe,GACAA,EAAKf,UACTluB,EAAEib,KAAK,GACA4T,CACX,CA8BWY,CAAaX,EAAKC,EAASF,EAAII,EAAMjvB,EAChD,CDeAouB,GAAK/oB,OAAS,CAACpF,EAAMmI,IAAQ,IAAIolB,GAAKvtB,EAAMmI,GE3DrC,MAAMsnB,WAAa/C,GACtB,WAAA/rB,CAAYkqB,EAAUD,EAAW8E,EAAWC,GACxCljB,QACA3J,KAAK+nB,SAAWA,EAChB/nB,KAAK8nB,UAAYA,EACjB9nB,KAAK4sB,UAAYA,EACjB5sB,KAAK6sB,KAAOA,EACZ7sB,KAAKooB,UAAW,EAChBpoB,KAAKpD,OAAS,EACdoD,KAAKqsB,IAAM,EACXrsB,KAAKmoB,WAAY,EACjBnoB,KAAK+X,OAAS,IAAI7C,WAAW6S,GAC7B/nB,KAAKmsB,KAAOtD,GAAW7oB,KAAK+X,OAChC,CACA,MAAAsS,CAAOzrB,GACHopB,GAAOhoB,MACP,MAAMmsB,KAAEA,EAAIpU,OAAEA,EAAMgQ,SAAEA,GAAa/nB,KAE7B8sB,GADNluB,EAAO4qB,GAAQ5qB,IACEhC,OACjB,IAAK,IAAIyvB,EAAM,EAAGA,EAAMS,GAAM,CAC1B,MAAMC,EAAOrwB,KAAK2rB,IAAIN,EAAW/nB,KAAKqsB,IAAKS,EAAMT,GAEjD,GAAIU,IAAShF,EAMbhQ,EAAO1M,IAAIzM,EAAK2tB,SAASF,EAAKA,EAAMU,GAAO/sB,KAAKqsB,KAChDrsB,KAAKqsB,KAAOU,EACZV,GAAOU,EACH/sB,KAAKqsB,MAAQtE,IACb/nB,KAAKmf,QAAQgN,EAAM,GACnBnsB,KAAKqsB,IAAM,OAXf,CACI,MAAMW,EAAWnE,GAAWjqB,GAC5B,KAAOmpB,GAAY+E,EAAMT,EAAKA,GAAOtE,EACjC/nB,KAAKmf,QAAQ6N,EAAUX,EAE/B,CAQJ,CAGA,OAFArsB,KAAKpD,QAAUgC,EAAKhC,OACpBoD,KAAKitB,aACEjtB,IACX,CACA,UAAAirB,CAAWloB,GACPilB,GAAOhoB,MACPya,GAAO1X,EAAK/C,MACZA,KAAKooB,UAAW,EAIhB,MAAMrQ,OAAEA,EAAMoU,KAAEA,EAAIpE,SAAEA,EAAQ8E,KAAEA,GAAS7sB,KACzC,IAAIqsB,IAAEA,GAAQrsB,KAEd+X,EAAOsU,KAAS,IAChBrsB,KAAK+X,OAAOwU,SAASF,GAAKnU,KAAK,GAE3BlY,KAAK4sB,UAAY7E,EAAWsE,IAC5BrsB,KAAKmf,QAAQgN,EAAM,GACnBE,EAAM,GAGV,IAAK,IAAIlvB,EAAIkvB,EAAKlvB,EAAI4qB,EAAU5qB,IAC5B4a,EAAO5a,GAAK,GAxExB,SAAsBgvB,EAAMxD,EAAY7U,EAAO+Y,GAC3C,GAAiC,mBAAtBV,EAAKe,aACZ,OAAOf,EAAKe,aAAavE,EAAY7U,EAAO+Y,GAChD,MAAMM,EAAO9X,OAAO,IACd+X,EAAW/X,OAAO,YAClBgY,EAAKlU,OAAQrF,GAASqZ,EAAQC,GAC9BE,EAAKnU,OAAOrF,EAAQsZ,GACpBlgB,EAAI2f,EAAO,EAAI,EACfvwB,EAAIuwB,EAAO,EAAI,EACrBV,EAAKoB,UAAU5E,EAAazb,EAAGmgB,EAAIR,GACnCV,EAAKoB,UAAU5E,EAAarsB,EAAGgxB,EAAIT,EACvC,CAiEQK,CAAaf,EAAMpE,EAAW,EAAG1S,OAAqB,EAAdrV,KAAKpD,QAAaiwB,GAC1D7sB,KAAKmf,QAAQgN,EAAM,GACnB,MAAMqB,EAAQ3E,GAAW9lB,GACnB+pB,EAAM9sB,KAAK8nB,UAEjB,GAAIgF,EAAM,EACN,MAAM,IAAI3Y,MAAM,+CACpB,MAAMsZ,EAASX,EAAM,EACfnqB,EAAQ3C,KAAK6D,MACnB,GAAI4pB,EAAS9qB,EAAM/F,OACf,MAAM,IAAIuX,MAAM,sCACpB,IAAK,IAAIhX,EAAI,EAAGA,EAAIswB,EAAQtwB,IACxBqwB,EAAMD,UAAU,EAAIpwB,EAAGwF,EAAMxF,GAAI0vB,EACzC,CACA,MAAAvC,GACI,MAAMvS,OAAEA,EAAM+P,UAAEA,GAAc9nB,KAC9BA,KAAKirB,WAAWlT,GAChB,MAAMrJ,EAAMqJ,EAAOtc,MAAM,EAAGqsB,GAE5B,OADA9nB,KAAKmrB,UACEzc,CACX,CACA,UAAAmb,CAAW9pB,GACPA,IAAOA,EAAK,IAAIC,KAAKnC,aACrBkC,EAAGsL,OAAOrL,KAAK6D,OACf,MAAMkkB,SAAEA,EAAQhQ,OAAEA,EAAMnb,OAAEA,EAAMwrB,SAAEA,EAAQD,UAAEA,EAASkE,IAAEA,GAAQrsB,KAO/D,OANAD,EAAGnD,OAASA,EACZmD,EAAGssB,IAAMA,EACTtsB,EAAGqoB,SAAWA,EACdroB,EAAGooB,UAAYA,EACXvrB,EAASmrB,GACThoB,EAAGgY,OAAO1M,IAAI0M,GACXhY,CACX,EC1GJ,MAAM2tB,GAAM,CAAC1jB,EAAGkH,EAAG3U,IAAOyN,EAAIkH,GAAOlH,EAAIzN,EAEnCoxB,GAAM,CAAC3jB,EAAGkH,EAAG3U,IAAOyN,EAAIkH,EAAMlH,EAAIzN,EAAM2U,EAAI3U,EAI5CqxB,GAA2B,IAAIlF,YAAY,CAC7C,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WACpF,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UACpF,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UACpF,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WACpF,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,aAIlFmF,GAAqB,IAAInF,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAIlFoF,GAA2B,IAAIpF,YAAY,IACjD,MAAMqF,WAAepB,GACjB,WAAA9uB,GACI8L,MAAM,GAAI,GAAI,GAAG,GAGjB3J,KAAKyR,EAAY,EAARoc,GAAG,GACZ7tB,KAAK0R,EAAY,EAARmc,GAAG,GACZ7tB,KAAKwF,EAAY,EAARqoB,GAAG,GACZ7tB,KAAKc,EAAY,EAAR+sB,GAAG,GACZ7tB,KAAKguB,EAAY,EAARH,GAAG,GACZ7tB,KAAK6G,EAAY,EAARgnB,GAAG,GACZ7tB,KAAKiuB,EAAY,EAARJ,GAAG,GACZ7tB,KAAKkuB,EAAY,EAARL,GAAG,EAChB,CACA,GAAAhqB,GACI,MAAM4N,EAAEA,EAACC,EAAEA,EAAClM,EAAEA,EAAC1E,EAAEA,EAACktB,EAAEA,EAACnnB,EAAEA,EAAConB,EAAEA,EAACC,EAAEA,GAAMluB,KACnC,MAAO,CAACyR,EAAGC,EAAGlM,EAAG1E,EAAGktB,EAAGnnB,EAAGonB,EAAGC,EACjC,CAEA,GAAA7iB,CAAIoG,EAAGC,EAAGlM,EAAG1E,EAAGktB,EAAGnnB,EAAGonB,EAAGC,GACrBluB,KAAKyR,EAAQ,EAAJA,EACTzR,KAAK0R,EAAQ,EAAJA,EACT1R,KAAKwF,EAAQ,EAAJA,EACTxF,KAAKc,EAAQ,EAAJA,EACTd,KAAKguB,EAAQ,EAAJA,EACThuB,KAAK6G,EAAQ,EAAJA,EACT7G,KAAKiuB,EAAQ,EAAJA,EACTjuB,KAAKkuB,EAAQ,EAAJA,CACb,CACA,OAAA/O,CAAQgN,EAAMlV,GAEV,IAAK,IAAI9Z,EAAI,EAAGA,EAAI,GAAIA,IAAK8Z,GAAU,EACnC6W,GAAS3wB,GAAKgvB,EAAKgC,UAAUlX,GAAQ,GACzC,IAAK,IAAI9Z,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMixB,EAAMN,GAAS3wB,EAAI,IACnBkxB,EAAKP,GAAS3wB,EAAI,GAClBmxB,EAAKvF,GAAKqF,EAAK,GAAKrF,GAAKqF,EAAK,IAAOA,IAAQ,EAC7CG,EAAKxF,GAAKsF,EAAI,IAAMtF,GAAKsF,EAAI,IAAOA,IAAO,GACjDP,GAAS3wB,GAAMoxB,EAAKT,GAAS3wB,EAAI,GAAKmxB,EAAKR,GAAS3wB,EAAI,IAAO,CACnE,CAEA,IAAIsU,EAAEA,EAACC,EAAEA,EAAClM,EAAEA,EAAC1E,EAAEA,EAACktB,EAAEA,EAACnnB,EAAEA,EAAConB,EAAEA,EAACC,EAAEA,GAAMluB,KACjC,IAAK,IAAI7C,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACMqxB,EAAMN,GADGnF,GAAKiF,EAAG,GAAKjF,GAAKiF,EAAG,IAAMjF,GAAKiF,EAAG,KACzBN,GAAIM,EAAGnnB,EAAGonB,GAAKL,GAASzwB,GAAK2wB,GAAS3wB,GAAM,EAE/DsxB,GADS1F,GAAKtX,EAAG,GAAKsX,GAAKtX,EAAG,IAAMsX,GAAKtX,EAAG,KAC7Bkc,GAAIlc,EAAGC,EAAGlM,GAAM,EACrC0oB,EAAID,EACJA,EAAIpnB,EACJA,EAAImnB,EACJA,EAAKltB,EAAI0tB,EAAM,EACf1tB,EAAI0E,EACJA,EAAIkM,EACJA,EAAID,EACJA,EAAK+c,EAAKC,EAAM,CACpB,CAEAhd,EAAKA,EAAIzR,KAAKyR,EAAK,EACnBC,EAAKA,EAAI1R,KAAK0R,EAAK,EACnBlM,EAAKA,EAAIxF,KAAKwF,EAAK,EACnB1E,EAAKA,EAAId,KAAKc,EAAK,EACnBktB,EAAKA,EAAIhuB,KAAKguB,EAAK,EACnBnnB,EAAKA,EAAI7G,KAAK6G,EAAK,EACnBonB,EAAKA,EAAIjuB,KAAKiuB,EAAK,EACnBC,EAAKA,EAAIluB,KAAKkuB,EAAK,EACnBluB,KAAKqL,IAAIoG,EAAGC,EAAGlM,EAAG1E,EAAGktB,EAAGnnB,EAAGonB,EAAGC,EAClC,CACA,UAAAjB,GACIa,GAAS5V,KAAK,EAClB,CACA,OAAAiT,GACInrB,KAAKqL,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BrL,KAAK+X,OAAOG,KAAK,EACrB,EAqBG,MAAMwW,GAAyBxE,IAAgB,IAAM,IAAI6D,KC3H1DY,GAA6BtZ,OAAO,GAAK,GAAK,GAC9C8X,GAAuB9X,OAAO,IAEpC,SAASuZ,GAAQ5wB,EAAG6wB,GAAK,GACrB,OAAIA,EACO,CAAE3hB,EAAGiM,OAAOnb,EAAI2wB,IAAaryB,EAAG6c,OAAQnb,GAAKmvB,GAAQwB,KACzD,CAAEzhB,EAAsC,EAAnCiM,OAAQnb,GAAKmvB,GAAQwB,IAAiBryB,EAA4B,EAAzB6c,OAAOnb,EAAI2wB,IACpE,CACA,SAAS5yB,GAAM+yB,EAAKD,GAAK,GACrB,IAAIE,EAAK,IAAIrG,YAAYoG,EAAIlyB,QACzBoyB,EAAK,IAAItG,YAAYoG,EAAIlyB,QAC7B,IAAK,IAAIO,EAAI,EAAGA,EAAI2xB,EAAIlyB,OAAQO,IAAK,CACjC,MAAM+P,EAAEA,EAAC5Q,EAAEA,GAAMsyB,GAAQE,EAAI3xB,GAAI0xB,IAChCE,EAAG5xB,GAAI6xB,EAAG7xB,IAAM,CAAC+P,EAAG5Q,EACxB,CACD,MAAO,CAACyyB,EAAIC,EAChB,CACA,MAcMC,GAAS,CAAC/hB,EAAG5Q,EAAGE,IAAO0Q,GAAK1Q,EAAMF,IAAO,GAAKE,EAC9C0yB,GAAS,CAAChiB,EAAG5Q,EAAGE,IAAOF,GAAKE,EAAM0Q,IAAO,GAAK1Q,EAE9C2yB,GAAS,CAACjiB,EAAG5Q,EAAGE,IAAOF,GAAME,EAAI,GAAQ0Q,IAAO,GAAK1Q,EACrD4yB,GAAS,CAACliB,EAAG5Q,EAAGE,IAAO0Q,GAAM1Q,EAAI,GAAQF,IAAO,GAAKE,EAyB3D,IAAA6yB,GARY,CACRT,WAAO7yB,MAAEA,GAAOuzB,MApCN,CAACpiB,EAAG5Q,IAAO+Y,OAAOnI,IAAM,IAAMigB,GAAQ9X,OAAO/Y,IAAM,GAqC7DizB,MAnCU,CAACriB,EAAGsiB,EAAIhzB,IAAM0Q,IAAM1Q,EAmCvBizB,MAlCG,CAACviB,EAAG5Q,EAAGE,IAAO0Q,GAAM,GAAK1Q,EAAOF,IAAME,EAmChDkzB,OAjCW,CAACxiB,EAAG5Q,EAAGE,IAAO0Q,IAAM1Q,EAAMF,GAAM,GAAKE,EAiCxCmzB,OAhCG,CAACziB,EAAG5Q,EAAGE,IAAO0Q,GAAM,GAAK1Q,EAAOF,IAAME,EAgCjCozB,OA9BL,CAAC1iB,EAAG5Q,EAAGE,IAAO0Q,GAAM,GAAK1Q,EAAOF,IAAOE,EAAI,GA8B9BqzB,OA7Bb,CAAC3iB,EAAG5Q,EAAGE,IAAO0Q,IAAO1Q,EAAI,GAAQF,GAAM,GAAKE,EA8BvDszB,QA5BY,CAACC,EAAIzzB,IAAMA,EA4Bd0zB,QA3BG,CAAC9iB,EAAGsiB,IAAOtiB,EA4BvB+hB,UAAQC,UAAQC,UAAQC,UACxBllB,IApBJ,SAAa6kB,EAAIC,EAAIiB,EAAIC,GACrB,MAAM5zB,GAAK0yB,IAAO,IAAMkB,IAAO,GAC/B,MAAO,CAAEhjB,EAAI6hB,EAAKkB,GAAO3zB,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBS6zB,MAfK,CAACnB,EAAIkB,EAAIE,KAAQpB,IAAO,IAAMkB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAACC,EAAKvB,EAAIkB,EAAIM,IAAQxB,EAAKkB,EAAKM,GAAOD,EAAM,GAAK,GAAM,GAAM,EAcrDE,MAbT,CAACxB,EAAIkB,EAAIE,EAAIK,KAAQzB,IAAO,IAAMkB,IAAO,IAAME,IAAO,IAAMK,IAAO,GAanDC,MAZhB,CAACJ,EAAKvB,EAAIkB,EAAIM,EAAII,IAAQ5B,EAAKkB,EAAKM,EAAKI,GAAOL,EAAM,GAAK,GAAM,GAAM,EAYhDM,MAVvB,CAACN,EAAKvB,EAAIkB,EAAIM,EAAII,EAAIE,IAAQ9B,EAAKkB,EAAKM,EAAKI,EAAKE,GAAOP,EAAM,GAAK,GAAM,GAAM,EAUlDQ,MAX9B,CAAC9B,EAAIkB,EAAIE,EAAIK,EAAIM,KAAQ/B,IAAO,IAAMkB,IAAO,IAAME,IAAO,IAAMK,IAAO,IAAMM,IAAO,IC1ClG,MAAOC,GAAWC,IAA6B,KAAOC,GAAIn1B,MAAM,CAC5D,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,qBAClE,qBAAsB,qBAAsB,qBAAsB,sBACpEkK,KAAIjI,GAAKqX,OAAOrX,MArB6B,GAuBzCmzB,GAA6B,IAAIzI,YAAY,IAC7C0I,GAA6B,IAAI1I,YAAY,IAC5C,MAAM2I,WAAe1E,GACxB,WAAA9uB,GACI8L,MAAM,IAAK,GAAI,IAAI,GAKnB3J,KAAK+uB,GAAK,WACV/uB,KAAKgvB,IAAK,UACVhvB,KAAKiwB,IAAK,WACVjwB,KAAKkwB,IAAK,WACVlwB,KAAKuwB,GAAK,WACVvwB,KAAKowB,IAAK,SACVpwB,KAAK2wB,IAAK,WACV3wB,KAAKywB,GAAK,WACVzwB,KAAK6wB,GAAK,WACV7wB,KAAK+wB,IAAK,WACV/wB,KAAKsxB,IAAK,WACVtxB,KAAKuxB,GAAK,UACVvxB,KAAKwxB,GAAK,UACVxxB,KAAKyxB,IAAK,SACVzxB,KAAK0xB,GAAK,WACV1xB,KAAK2xB,GAAK,SACd,CAEA,GAAA9tB,GACI,MAAMkrB,GAAEA,EAAEC,GAAEA,EAAEiB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEO,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAO3xB,KAC3E,MAAO,CAAC+uB,EAAIC,EAAIiB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAAtmB,CAAI0jB,EAAIC,EAAIiB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5D3xB,KAAK+uB,GAAU,EAALA,EACV/uB,KAAKgvB,GAAU,EAALA,EACVhvB,KAAKiwB,GAAU,EAALA,EACVjwB,KAAKkwB,GAAU,EAALA,EACVlwB,KAAKuwB,GAAU,EAALA,EACVvwB,KAAKowB,GAAU,EAALA,EACVpwB,KAAK2wB,GAAU,EAALA,EACV3wB,KAAKywB,GAAU,EAALA,EACVzwB,KAAK6wB,GAAU,EAALA,EACV7wB,KAAK+wB,GAAU,EAALA,EACV/wB,KAAKsxB,GAAU,EAALA,EACVtxB,KAAKuxB,GAAU,EAALA,EACVvxB,KAAKwxB,GAAU,EAALA,EACVxxB,KAAKyxB,GAAU,EAALA,EACVzxB,KAAK0xB,GAAU,EAALA,EACV1xB,KAAK2xB,GAAU,EAALA,CACd,CACA,OAAAxS,CAAQgN,EAAMlV,GAEV,IAAK,IAAI9Z,EAAI,EAAGA,EAAI,GAAIA,IAAK8Z,GAAU,EACnCka,GAAWh0B,GAAKgvB,EAAKgC,UAAUlX,GAC/Bma,GAAWj0B,GAAKgvB,EAAKgC,UAAWlX,GAAU,GAE9C,IAAK,IAAI9Z,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAMy0B,EAA4B,EAArBT,GAAWh0B,EAAI,IACtB00B,EAA4B,EAArBT,GAAWj0B,EAAI,IACtB20B,EAAMZ,GAAIxB,OAAOkC,EAAMC,EAAM,GAAKX,GAAIxB,OAAOkC,EAAMC,EAAM,GAAKX,GAAI3B,MAAMqC,EAAMC,EAAM,GACpFE,EAAMb,GAAIvB,OAAOiC,EAAMC,EAAM,GAAKX,GAAIvB,OAAOiC,EAAMC,EAAM,GAAKX,GAAIzB,MAAMmC,EAAMC,EAAM,GAEpFG,EAA0B,EAApBb,GAAWh0B,EAAI,GACrB80B,EAA0B,EAApBb,GAAWj0B,EAAI,GACrB+0B,EAAMhB,GAAIxB,OAAOsC,EAAKC,EAAK,IAAMf,GAAItB,OAAOoC,EAAKC,EAAK,IAAMf,GAAI3B,MAAMyC,EAAKC,EAAK,GAChFE,EAAMjB,GAAIvB,OAAOqC,EAAKC,EAAK,IAAMf,GAAIrB,OAAOmC,EAAKC,EAAK,IAAMf,GAAIzB,MAAMuC,EAAKC,EAAK,GAEhFG,EAAOlB,GAAIV,MAAMuB,EAAKI,EAAKf,GAAWj0B,EAAI,GAAIi0B,GAAWj0B,EAAI,KAC7Dk1B,EAAOnB,GAAIR,MAAM0B,EAAMN,EAAKI,EAAKf,GAAWh0B,EAAI,GAAIg0B,GAAWh0B,EAAI,KACzEg0B,GAAWh0B,GAAY,EAAPk1B,EAChBjB,GAAWj0B,GAAY,EAAPi1B,CACpB,CACA,IAAIrD,GAAEA,EAAEC,GAAEA,EAAEiB,GAAEA,EAAEC,GAAEA,EAAEK,GAAEA,EAAEH,GAAEA,EAAEO,GAAEA,EAAEF,GAAEA,EAAEI,GAAEA,EAAEE,GAAEA,EAAEO,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAO3xB,KAEzE,IAAK,IAAI7C,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMm1B,EAAUpB,GAAIxB,OAAOmB,EAAIE,EAAI,IAAMG,GAAIxB,OAAOmB,EAAIE,EAAI,IAAMG,GAAItB,OAAOiB,EAAIE,EAAI,IAC/EwB,EAAUrB,GAAIvB,OAAOkB,EAAIE,EAAI,IAAMG,GAAIvB,OAAOkB,EAAIE,EAAI,IAAMG,GAAIrB,OAAOgB,EAAIE,EAAI,IAE/EyB,EAAQ3B,EAAKS,GAAQT,EAAKW,EAC1BiB,EAAQ1B,EAAKQ,GAAQR,EAAKU,EAG1BiB,EAAOxB,GAAIJ,MAAMa,EAAIY,EAASE,EAAMxB,GAAU9zB,GAAIi0B,GAAWj0B,IAC7Dw1B,EAAMzB,GAAIN,MAAM8B,EAAMhB,EAAIY,EAASE,EAAMxB,GAAU7zB,GAAIg0B,GAAWh0B,IAClEy1B,EAAa,EAAPF,EAENG,EAAU3B,GAAIxB,OAAOX,EAAIC,EAAI,IAAMkC,GAAItB,OAAOb,EAAIC,EAAI,IAAMkC,GAAItB,OAAOb,EAAIC,EAAI,IAC/E8D,EAAU5B,GAAIvB,OAAOZ,EAAIC,EAAI,IAAMkC,GAAIrB,OAAOd,EAAIC,EAAI,IAAMkC,GAAIrB,OAAOd,EAAIC,EAAI,IAC/E+D,EAAQhE,EAAKkB,EAAOlB,EAAKwB,EAAON,EAAKM,EACrCyC,EAAQhE,EAAKkB,EAAOlB,EAAKoB,EAAOF,EAAKE,EAC3CsB,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALF,EACLG,EAAU,EAALF,EACLD,EAAU,EAALT,EACLU,EAAU,EAALR,IACF7jB,EAAG2jB,EAAIv0B,EAAGy0B,GAAOG,GAAIhnB,IAAS,EAALymB,EAAa,EAALF,EAAc,EAANkC,EAAe,EAANC,IACrDjC,EAAU,EAALJ,EACLE,EAAU,EAALL,EACLG,EAAU,EAALN,EACLG,EAAU,EAALF,EACLD,EAAU,EAALlB,EACLmB,EAAU,EAALlB,EACL,MAAMiE,EAAM/B,GAAIf,MAAMyC,EAAKE,EAASE,GACpCjE,EAAKmC,GAAIb,MAAM4C,EAAKN,EAAKE,EAASE,GAClC/D,EAAW,EAANiE,CACT,GAEG/lB,EAAG6hB,EAAIzyB,EAAG0yB,GAAOkC,GAAIhnB,IAAc,EAAVlK,KAAK+uB,GAAkB,EAAV/uB,KAAKgvB,GAAa,EAALD,EAAa,EAALC,MAC3D9hB,EAAG+iB,EAAI3zB,EAAG4zB,GAAOgB,GAAIhnB,IAAc,EAAVlK,KAAKiwB,GAAkB,EAAVjwB,KAAKkwB,GAAa,EAALD,EAAa,EAALC,MAC3DhjB,EAAGqjB,EAAIj0B,EAAG8zB,GAAOc,GAAIhnB,IAAc,EAAVlK,KAAKuwB,GAAkB,EAAVvwB,KAAKowB,GAAa,EAALG,EAAa,EAALH,MAC3DljB,EAAGyjB,EAAIr0B,EAAGm0B,GAAOS,GAAIhnB,IAAc,EAAVlK,KAAK2wB,GAAkB,EAAV3wB,KAAKywB,GAAa,EAALE,EAAa,EAALF,MAC3DvjB,EAAG2jB,EAAIv0B,EAAGy0B,GAAOG,GAAIhnB,IAAc,EAAVlK,KAAK6wB,GAAkB,EAAV7wB,KAAK+wB,GAAa,EAALF,EAAa,EAALE,MAC3D7jB,EAAGokB,EAAIh1B,EAAGi1B,GAAOL,GAAIhnB,IAAc,EAAVlK,KAAKsxB,GAAkB,EAAVtxB,KAAKuxB,GAAa,EAALD,EAAa,EAALC,MAC3DrkB,EAAGskB,EAAIl1B,EAAGm1B,GAAOP,GAAIhnB,IAAc,EAAVlK,KAAKwxB,GAAkB,EAAVxxB,KAAKyxB,GAAa,EAALD,EAAa,EAALC,MAC3DvkB,EAAGwkB,EAAIp1B,EAAGq1B,GAAOT,GAAIhnB,IAAc,EAAVlK,KAAK0xB,GAAkB,EAAV1xB,KAAK2xB,GAAa,EAALD,EAAa,EAALC,IAC9D3xB,KAAKqL,IAAI0jB,EAAIC,EAAIiB,EAAIC,EAAIK,EAAIH,EAAIO,EAAIF,EAAII,EAAIE,EAAIO,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAA1E,GACIkE,GAAWjZ,KAAK,GAChBkZ,GAAWlZ,KAAK,EACpB,CACA,OAAAiT,GACInrB,KAAK+X,OAAOG,KAAK,GACjBlY,KAAKqL,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAuEG,MAAM6nB,GAAyBhJ,IAAgB,IAAM,IAAImH,KC/MhE,MAAM8B,GAbN,WACI,GAAoB,oBAATC,KACP,OAAOA,KAEX,GAAsB,oBAAX1sB,OACP,OAAOA,OAEX,QAAsB,IAAX2sB,GACP,OAAOA,GAEX,MAAM,IAAIlf,MAAM,iCACpB,CAEkBmf,GACZhL,GAAS6K,GAAU7K,QAAU6K,GAAUI,SCV7C,IAAI1V,IAAS,EACb,MAAM2V,GAAe,SAAUC,EAAWpuB,EAAKzG,GAC3C,ODgBG,SAAoB80B,EAAOruB,GAC9B,MAAMsuB,EAAQ,CAAAjF,OAAEA,GAAQwE,WAASQ,GAEjC,OADAzd,EAAuB,MAAR0d,EAAc,yBAA0B,YAAaD,GAC7DrI,GAAK/oB,OAAOqxB,EAAMtuB,EAC7B,CCpBWuuB,CAAWH,EAAWpuB,GAAKglB,OAAOzrB,GAAM0rB,QACnD,EACA,IAAIuJ,GAAgBL,GAkBb,SAASM,GAAYL,EAAW/I,EAAMlL,GACzC,MAAMna,EAAM+R,EAASsT,EAAM,OACrB9rB,EAAOwY,EAASoI,EAAO,QAC7B,OAAO/H,EAAQoc,GAAcJ,EAAWpuB,EAAKzG,GACjD,CACAk1B,GAAY7zB,EAAIuzB,GAChBM,GAAYC,KAAO,WAAclW,IAAS,CAAK,EAC/CiW,GAAYE,SAAW,SAAU/R,GAC7B,GAAIpE,GACA,MAAM,IAAI1J,MAAM,yBAEpB0f,GAAgB5R,CACpB,EACAxkB,OAAOmd,OAAOkZ,ICvCd,MAAOG,GAASC,GAAWC,IAAc,CAAC,GAAI,GAAI,IAC5CC,GAAsB/e,OAAO,GAC7Bgf,GAAsBhf,OAAO,GAC7Bif,GAAsBjf,OAAO,GAC7Bkf,GAAsBlf,OAAO,GAC7Bmf,GAAwBnf,OAAO,KAC/Bof,GAAyBpf,OAAO,KACtC,IAAK,IAAIqf,EAAQ,EAAGh5B,EAAI24B,GAAKniB,EAAI,EAAGlE,EAAI,EAAG0mB,EAAQ,GAAIA,IAAS,EAE3DxiB,EAAGlE,GAAK,CAACA,GAAI,EAAIkE,EAAI,EAAIlE,GAAK,GAC/BimB,GAAQ71B,KAAK,GAAK,EAAI4P,EAAIkE,IAE1BgiB,GAAU91B,MAAQs2B,EAAQ,IAAMA,EAAQ,GAAM,EAAK,IAEnD,IAAI53B,EAAIs3B,GACR,IAAK,IAAI5Y,EAAI,EAAGA,EAAI,EAAGA,IACnB9f,GAAMA,GAAK24B,IAAS34B,GAAK64B,IAAOE,IAAWD,GACvC94B,EAAI44B,KACJx3B,GAAKu3B,KAASA,IAAuBhf,OAAOmG,IAAM6Y,IAE1DF,GAAW/1B,KAAKtB,EACpB,CACA,MAAO63B,GAAaC,IAA+B74B,GAAMo4B,IAAY,GAE/DU,GAAQ,CAAC3nB,EAAG5Q,EAAGE,IAAOA,EAAI,GAAK2yB,GAAOjiB,EAAG5Q,EAAGE,GAAKyyB,GAAO/hB,EAAG5Q,EAAGE,GAC9Ds4B,GAAQ,CAAC5nB,EAAG5Q,EAAGE,IAAOA,EAAI,GAAK4yB,GAAOliB,EAAG5Q,EAAGE,GAAK0yB,GAAOhiB,EAAG5Q,EAAGE,GA+C7D,MAAMu4B,WAAenL,GAExB,WAAA/rB,CAAYkqB,EAAUiN,EAAQlN,EAAWmN,GAAY,EAAOC,EAAS,IAcjE,GAbAvrB,QACA3J,KAAK+nB,SAAWA,EAChB/nB,KAAKg1B,OAASA,EACdh1B,KAAK8nB,UAAYA,EACjB9nB,KAAKi1B,UAAYA,EACjBj1B,KAAKk1B,OAASA,EACdl1B,KAAKqsB,IAAM,EACXrsB,KAAKm1B,OAAS,EACdn1B,KAAKooB,UAAW,EAChBpoB,KAAKmoB,WAAY,EAEjBT,GAAOI,GAEH,GAAK9nB,KAAK+nB,UAAY/nB,KAAK+nB,UAAY,IACvC,MAAM,IAAI5T,MAAM,4CACpBnU,KAAK2C,MAAQ,IAAIuS,WAAW,KAC5BlV,KAAKo1B,QAAU3M,GAAIzoB,KAAK2C,MAC3B,CACD,MAAA0yB,IAlEG,SAAiB74B,EAAG04B,EAAS,IAChC,MAAMxjB,EAAI,IAAIgX,YAAY,IAE1B,IAAK,IAAIgM,EAAQ,GAAKQ,EAAQR,EAAQ,GAAIA,IAAS,CAE/C,IAAK,IAAIxiB,EAAI,EAAGA,EAAI,GAAIA,IACpBR,EAAEQ,GAAK1V,EAAE0V,GAAK1V,EAAE0V,EAAI,IAAM1V,EAAE0V,EAAI,IAAM1V,EAAE0V,EAAI,IAAM1V,EAAE0V,EAAI,IAC5D,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC5B,MAAMojB,GAAQpjB,EAAI,GAAK,GACjBqjB,GAAQrjB,EAAI,GAAK,GACjBsjB,EAAK9jB,EAAE6jB,GACPE,EAAK/jB,EAAE6jB,EAAO,GACdG,EAAKb,GAAMW,EAAIC,EAAI,GAAK/jB,EAAE4jB,GAC1BK,EAAKb,GAAMU,EAAIC,EAAI,GAAK/jB,EAAE4jB,EAAO,GACvC,IAAK,IAAItnB,EAAI,EAAGA,EAAI,GAAIA,GAAK,GACzBxR,EAAE0V,EAAIlE,IAAM0nB,EACZl5B,EAAE0V,EAAIlE,EAAI,IAAM2nB,CAEvB,CAED,IAAIC,EAAOp5B,EAAE,GACTq5B,EAAOr5B,EAAE,GACb,IAAK,IAAIM,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMmsB,EAAQiL,GAAUp3B,GAClB44B,EAAKb,GAAMe,EAAMC,EAAM5M,GACvB0M,EAAKb,GAAMc,EAAMC,EAAM5M,GACvB6M,EAAK7B,GAAQn3B,GACnB84B,EAAOp5B,EAAEs5B,GACTD,EAAOr5B,EAAEs5B,EAAK,GACdt5B,EAAEs5B,GAAMJ,EACRl5B,EAAEs5B,EAAK,GAAKH,CACf,CAED,IAAK,IAAI3nB,EAAI,EAAGA,EAAI,GAAIA,GAAK,GAAI,CAC7B,IAAK,IAAIkE,EAAI,EAAGA,EAAI,GAAIA,IACpBR,EAAEQ,GAAK1V,EAAEwR,EAAIkE,GACjB,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpB1V,EAAEwR,EAAIkE,KAAOR,GAAGQ,EAAI,GAAK,IAAMR,GAAGQ,EAAI,GAAK,GAClD,CAED1V,EAAE,IAAMm4B,GAAYD,GACpBl4B,EAAE,IAAMo4B,GAAYF,EACvB,CACDhjB,EAAEwG,KAAK,EACX,CAuBQ6d,CAAQ/1B,KAAKo1B,QAASp1B,KAAKk1B,QAC3Bl1B,KAAKm1B,OAAS,EACdn1B,KAAKqsB,IAAM,CACd,CACD,MAAAhC,CAAOzrB,GACHopB,GAAOhoB,MACP,MAAM+nB,SAAEA,EAAQplB,MAAEA,GAAU3C,KAEtB8sB,GADNluB,EAAO4qB,GAAQ5qB,IACEhC,OACjB,IAAK,IAAIyvB,EAAM,EAAGA,EAAMS,GAAM,CAC1B,MAAMC,EAAOrwB,KAAK2rB,IAAIN,EAAW/nB,KAAKqsB,IAAKS,EAAMT,GACjD,IAAK,IAAIlvB,EAAI,EAAGA,EAAI4vB,EAAM5vB,IACtBwF,EAAM3C,KAAKqsB,QAAUztB,EAAKytB,KAC1BrsB,KAAKqsB,MAAQtE,GACb/nB,KAAKq1B,QACZ,CACD,OAAOr1B,IACV,CACD,MAAAg2B,GACI,GAAIh2B,KAAKooB,SACL,OACJpoB,KAAKooB,UAAW,EAChB,MAAMzlB,MAAEA,EAAKqyB,OAAEA,EAAM3I,IAAEA,EAAGtE,SAAEA,GAAa/nB,KAEzC2C,EAAM0pB,IAAQ2I,EACA,IAATA,GAAwB3I,IAAQtE,EAAW,GAC5C/nB,KAAKq1B,SACT1yB,EAAMolB,EAAW,IAAM,IACvB/nB,KAAKq1B,QACR,CACD,SAAAY,CAAUlzB,GACNilB,GAAOhoB,MAAM,GACb0X,GAAM3U,GACN/C,KAAKg2B,SACL,MAAME,EAAYl2B,KAAK2C,OACjBolB,SAAEA,GAAa/nB,KACrB,IAAK,IAAIqsB,EAAM,EAAGS,EAAM/pB,EAAInG,OAAQyvB,EAAMS,GAAM,CACxC9sB,KAAKm1B,QAAUpN,GACf/nB,KAAKq1B,SACT,MAAMtI,EAAOrwB,KAAK2rB,IAAIN,EAAW/nB,KAAKm1B,OAAQrI,EAAMT,GACpDtpB,EAAIsI,IAAI6qB,EAAU3J,SAASvsB,KAAKm1B,OAAQn1B,KAAKm1B,OAASpI,GAAOV,GAC7DrsB,KAAKm1B,QAAUpI,EACfV,GAAOU,CACV,CACD,OAAOhqB,CACV,CACD,OAAAozB,CAAQpzB,GAEJ,IAAK/C,KAAKi1B,UACN,MAAM,IAAI9gB,MAAM,yCACpB,OAAOnU,KAAKi2B,UAAUlzB,EACzB,CACD,GAAAqzB,CAAI1e,GAEA,OADAgQ,GAAOhQ,GACA1X,KAAKm2B,QAAQ,IAAIjhB,WAAWwC,GACtC,CACD,UAAAuT,CAAWloB,GAEP,GADA0X,GAAO1X,EAAK/C,MACRA,KAAKooB,SACL,MAAM,IAAIjU,MAAM,+BAGpB,OAFAnU,KAAKi2B,UAAUlzB,GACf/C,KAAKmrB,UACEpoB,CACV,CACD,MAAAunB,GACI,OAAOtqB,KAAKirB,WAAW,IAAI/V,WAAWlV,KAAK8nB,WAC9C,CACD,OAAAqD,GACInrB,KAAKmoB,WAAY,EACjBnoB,KAAK2C,MAAMuV,KAAK,EACnB,CACD,UAAA2R,CAAW9pB,GACP,MAAMgoB,SAAEA,EAAQiN,OAAEA,EAAMlN,UAAEA,EAASoN,OAAEA,EAAMD,UAAEA,GAAcj1B,KAY3D,OAXAD,IAAOA,EAAK,IAAIg1B,GAAOhN,EAAUiN,EAAQlN,EAAWmN,EAAWC,IAC/Dn1B,EAAGq1B,QAAQ/pB,IAAIrL,KAAKo1B,SACpBr1B,EAAGssB,IAAMrsB,KAAKqsB,IACdtsB,EAAGo1B,OAASn1B,KAAKm1B,OACjBp1B,EAAGqoB,SAAWpoB,KAAKooB,SACnBroB,EAAGm1B,OAASA,EAEZn1B,EAAGi1B,OAASA,EACZj1B,EAAG+nB,UAAYA,EACf/nB,EAAGk1B,UAAYA,EACfl1B,EAAGooB,UAAYnoB,KAAKmoB,UACbpoB,CACV,EAEL,MAcas2B,GAdD,EAACrB,EAAQjN,EAAUD,IAAcoC,IAAgB,IAAM,IAAI6K,GAAOhN,EAAUiN,EAAQlN,KActDwO,CAAI,EAAM,IAAK,IClMzD,IAAIzY,IAAS,EACb,MAAM0Y,GAAa,SAAU33B,GACzB,OAAOy3B,GAAWz3B,EACtB,EACA,IAAI43B,GAAcD,GAuBX,SAASE,GAAUjX,GACtB,MAAM5gB,EAAOwY,EAASoI,EAAO,QAC7B,OAAO/H,EAAQ+e,GAAY53B,GAC/B,CACA63B,GAAUx2B,EAAIs2B,GACdE,GAAU1C,KAAO,WAAclW,IAAS,CAAK,EAC7C4Y,GAAUzC,SAAW,SAAU/R,GAC3B,GAAIpE,GACA,MAAM,IAAIhI,UAAU,uBAExB2gB,GAAcvU,CAClB,EACAxkB,OAAOmd,OAAO6b,IC1Cd,MAAMC,GAAsB,IAAIxhB,WAAW,CAAC,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,IACzFyhB,GAAqBzhB,WAAWzN,KAAK,CAAE7K,OAAQ,KAAM,CAACqD,EAAG9C,IAAMA,IAErE,IAAIy5B,GAAO,CAACD,IACRE,GAAO,CAFgBF,GAAG1wB,KAAK9I,IAAO,EAAIA,EAAI,GAAK,MAGvD,IAAK,IAAIA,EAAI,EAAGA,EAAI,EAAGA,IACnB,IAAK,IAAIqe,IAAK,CAACob,GAAMC,IACjBrb,EAAEpd,KAAKod,EAAEre,GAAG8I,KAAKhI,GAAMy4B,GAAIz4B,MACnC,MAAM64B,GAAyB,CAC3B,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GACtD,CAAC,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,IACxD7wB,KAAK9I,GAAM,IAAI+X,WAAW/X,KACtB45B,GAA0BH,GAAK3wB,KAAI,CAAC+wB,EAAK75B,IAAM65B,EAAI/wB,KAAKuV,GAAMsb,GAAO35B,GAAGqe,OACxEyb,GAA0BJ,GAAK5wB,KAAI,CAAC+wB,EAAK75B,IAAM65B,EAAI/wB,KAAKuV,GAAMsb,GAAO35B,GAAGqe,OACxE0b,GAAqB,IAAIxO,YAAY,CACvC,EAAY,WAAY,WAAY,WAAY,aAE9CyO,GAAqB,IAAIzO,YAAY,CACvC,WAAY,WAAY,WAAY,WAAY,IAG9C0O,GAAO,CAACpO,EAAMC,IAAWD,GAAQC,EAAUD,IAAU,GAAKC,EAEhE,SAAS1qB,GAAE84B,EAAOnlB,EAAGlE,EAAGspB,GACpB,OAAc,IAAVD,EACOnlB,EAAIlE,EAAIspB,EACA,IAAVD,EACGnlB,EAAIlE,GAAOkE,EAAIolB,EACR,IAAVD,GACGnlB,GAAKlE,GAAKspB,EACH,IAAVD,EACGnlB,EAAIolB,EAAMtpB,GAAKspB,EAEhBplB,GAAKlE,GAAKspB,EACzB,CAEA,MAAMC,GAAsB,IAAI7O,YAAY,IACrC,MAAM8O,WAAkB7K,GAC3B,WAAA9uB,GACI8L,MAAM,GAAI,GAAI,GAAG,GACjB3J,KAAKy3B,GAAK,WACVz3B,KAAK03B,IAAK,UACV13B,KAAK23B,IAAK,WACV33B,KAAK43B,GAAK,UACV53B,KAAK63B,IAAK,UACd,CACA,GAAAh0B,GACI,MAAM4zB,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,EAAEC,GAAEA,GAAO73B,KAC/B,MAAO,CAACy3B,EAAIC,EAAIC,EAAIC,EAAIC,EAC5B,CACA,GAAAxsB,CAAIosB,EAAIC,EAAIC,EAAIC,EAAIC,GAChB73B,KAAKy3B,GAAU,EAALA,EACVz3B,KAAK03B,GAAU,EAALA,EACV13B,KAAK23B,GAAU,EAALA,EACV33B,KAAK43B,GAAU,EAALA,EACV53B,KAAK63B,GAAU,EAALA,CACd,CACA,OAAA1Y,CAAQgN,EAAMlV,GACV,IAAK,IAAI9Z,EAAI,EAAGA,EAAI,GAAIA,IAAK8Z,GAAU,EACnCsgB,GAAIp6B,GAAKgvB,EAAKgC,UAAUlX,GAAQ,GAEpC,IAAI6gB,EAAe,EAAV93B,KAAKy3B,GAAQM,EAAKD,EAAIE,EAAe,EAAVh4B,KAAK03B,GAAQO,EAAKD,EAAIE,EAAe,EAAVl4B,KAAK23B,GAAQQ,EAAKD,EAAIE,EAAe,EAAVp4B,KAAK43B,GAAQS,EAAKD,EAAIE,EAAe,EAAVt4B,KAAK63B,GAAQU,EAAKD,EAGvI,IAAK,IAAIjB,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMmB,EAAS,EAAInB,EACboB,EAAMvB,GAAGG,GAAQqB,EAAMvB,GAAGE,GAC1BsB,EAAK/B,GAAKS,GAAQuB,EAAK/B,GAAKQ,GAC5BwB,EAAK9B,GAAQM,GAAQyB,EAAK7B,GAAQI,GACxC,IAAK,IAAIl6B,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM47B,EAAM3B,GAAKU,EAAKv5B,GAAE84B,EAAOW,EAAIE,EAAIE,GAAMb,GAAIoB,EAAGx7B,IAAMs7B,EAAKI,EAAG17B,IAAMm7B,EAAM,EAC9ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfhB,GAAKc,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC3D,CAEA,IAAK,IAAI57B,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAM67B,EAAM5B,GAAKW,EAAKx5B,GAAEi6B,EAAQP,EAAIE,EAAIE,GAAMd,GAAIqB,EAAGz7B,IAAMu7B,EAAKI,EAAG37B,IAAMo7B,EAAM,EAC/ER,EAAKQ,EAAIA,EAAKF,EAAIA,EAAoB,EAAfjB,GAAKe,EAAI,IAASA,EAAKF,EAAIA,EAAKe,CAC3D,CACJ,CAEAh5B,KAAKqL,IAAKrL,KAAK03B,GAAKQ,EAAKG,EAAM,EAAIr4B,KAAK23B,GAAKS,EAAKG,EAAM,EAAIv4B,KAAK43B,GAAKU,EAAKP,EAAM,EAAI/3B,KAAK63B,GAAKC,EAAKG,EAAM,EAAIj4B,KAAKy3B,GAAKO,EAAKG,EAAM,EACvI,CACA,UAAAlL,GACIsK,GAAIrf,KAAK,EACb,CACA,OAAAiT,GACInrB,KAAKmoB,WAAY,EACjBnoB,KAAK+X,OAAOG,KAAK,GACjBlY,KAAKqL,IAAI,EAAG,EAAG,EAAG,EAAG,EACzB,EAMG,MAAM4tB,GAA4B/O,IAAgB,IAAM,IAAIsN,KCpGnE,IAAI3Z,IAAS,EACb,MAAMqb,GAAa,SAAUt6B,GACzB,OAAOu6B,GAAgBv6B,EAC3B,EACA,IAAIw6B,GAAcF,GAkBX,SAASD,GAAUzZ,GACtB,MAAM5gB,EAAOwY,EAASoI,EAAO,QAC7B,OAAO/H,EAAQ2hB,GAAYx6B,GAC/B,CACAq6B,GAAUh5B,EAAIi5B,GACdD,GAAUlF,KAAO,WAAclW,IAAS,CAAK,EAC7Cob,GAAUjF,SAAW,SAAU/R,GAC3B,GAAIpE,GACA,MAAM,IAAIhI,UAAU,uBAExBujB,GAAcnX,CAClB,EACAxkB,OAAOmd,OAAOqe,IC3Bd,IAAIpb,IAAS,EACb,MAAMwb,GAAU,SAAUjZ,EAAUyL,EAAMyN,EAAYC,EAAQ5F,GAC1D,ONsBG,SAAoBvT,EAAUyL,EAAMyN,EAAYC,EAAQ7F,GAC3D,MAAMC,EAAQ,CAAAjF,OAAEA,GAAQwE,WAASQ,GAEjC,OADAzd,EAAuB,MAAR0d,EAAc,2BAA4B,YAAaD,GAC/DzH,GAAO0H,EAAMvT,EAAUyL,EAAM,CAAEtvB,EAAG+8B,EAAY5N,MAAO6N,GAChE,CM1BWC,CAAWpZ,EAAUyL,EAAMyN,EAAYC,EAAQ5F,EAC1D,EACA,IAAI8F,GAAWJ,GAqBR,SAASpN,GAAOV,EAAWC,EAAO8N,EAAYC,EAAQ5F,GACzD,MAAMvT,EAAWhJ,EAASmU,EAAW,YAC/BM,EAAOzU,EAASoU,EAAO,QAC7B,OAAO/T,EAAQgiB,GAASrZ,EAAUyL,EAAMyN,EAAYC,EAAQ5F,GAChE,CACA1H,GAAOhsB,EAAIo5B,GACXpN,GAAO8H,KAAO,WAAclW,IAAS,CAAK,EAC1CoO,GAAO+H,SAAW,SAAU/R,GACxB,GAAIpE,GACA,MAAM,IAAI1J,MAAM,oBAEpBslB,GAAWxX,CACf,EACAxkB,OAAOmd,OAAOqR,ICtCd,IAAIpO,IAAS,EACb,MAAM6b,GAAe,SAAU98B,GAC3B,OAAO,IAAIsY,WP2BR,SAAqBtY,GACxBoZ,EAAiB,MAAVsS,GAAgB,kDAAmD,wBAAyB,CAC/F5R,UAAW,gBAEfT,EAAekD,OAAOC,UAAUxc,IAAWA,EAAS,GAAKA,GAAU,KAAM,iBAAkB,SAAUA,GACrG,MAAMwY,EAAS,IAAIF,WAAWtY,GAE9B,OADA0rB,GAAOkC,gBAAgBpV,GAChBA,CACX,COnC0BukB,CAAc/8B,GACxC,EACA,IAAIg9B,GAAgBF,GAQb,SAAS1V,GAAYpnB,GACxB,OAAOg9B,GAAch9B,EACzB,CACAonB,GAAY/jB,EAAIy5B,GAChB1V,GAAY+P,KAAO,WAAclW,IAAS,CAAK,EAC/CmG,GAAYgQ,SAAW,SAAU/R,GAC7B,GAAIpE,GACA,MAAM,IAAI1J,MAAM,yBAEpBylB,GAAgB3X,CACpB,EACAxkB,OAAOmd,OAAOoJ,IC1Bd,MAAMoT,GAAO,CAACptB,EAAGkH,IAAOlH,GAAKkH,EAAMlH,IAAO,GAAKkH,EAI/C,SAAS2oB,GAAYlmB,EAAMmmB,EAAIC,EAAO1nB,EAAItP,EAAKi3B,GAG3C,IAAIC,EAAMtmB,EAAKmmB,KAAQC,EAAM1nB,KAAO6nB,EAAMvmB,EAAKmmB,KAAQC,EAAM1nB,KACzD8nB,EAAMxmB,EAAKmmB,KAAQC,EAAM1nB,KAAO+nB,EAAMzmB,EAAKmmB,KAAQC,EAAM1nB,KACzDgoB,EAAM1mB,EAAKmmB,KAAQC,EAAM1nB,KAAOioB,EAAM3mB,EAAKmmB,KAAQC,EAAM1nB,KACzDkoB,EAAM5mB,EAAKmmB,KAAQC,EAAM1nB,KAAOmoB,EAAM7mB,EAAKmmB,KAAQC,EAAM1nB,KACzDooB,EAAM9mB,EAAKmmB,KAAQC,EAAM1nB,KAAOqoB,EAAM/mB,EAAKmmB,KAAQC,EAAM1nB,KACzDsoB,EAAMhnB,EAAKmmB,KAAQC,EAAM1nB,KAAOuoB,EAAMjnB,EAAKmmB,KAAQC,EAAM1nB,KACzDwoB,EAAMlnB,EAAKmmB,KAAQC,EAAM1nB,KAAOyoB,EAAMnnB,EAAKmmB,KAAQC,EAAM1nB,KACzD0oB,EAAMpnB,EAAKmmB,KAAQC,EAAM1nB,KAAO2oB,EAAMrnB,EAAKmmB,KAAQC,EAAM1nB,KAEzD4oB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAAKiB,EAAMhB,EAE/K,IAAK,IAAI79B,EAAI,EAAGA,EAAI,EAAGA,GAAK,EACxBk+B,GAAOjE,GAAK6D,EAAMY,EAAM,EAAG,GAC3BJ,GAAOrE,GAAKiE,EAAMJ,EAAM,EAAG,GAC3BY,GAAOzE,GAAKqE,EAAMJ,EAAM,EAAG,IAC3BJ,GAAO7D,GAAKyE,EAAMJ,EAAM,EAAG,IAC3BC,GAAOtE,GAAKkE,EAAMJ,EAAM,EAAG,GAC3BY,GAAO1E,GAAKsE,EAAMJ,EAAM,EAAG,GAC3BJ,GAAO9D,GAAK0E,EAAMJ,EAAM,EAAG,IAC3BJ,GAAOlE,GAAK8D,EAAMY,EAAM,EAAG,IAC3BC,GAAO3E,GAAKuE,EAAMJ,EAAM,EAAG,GAC3BJ,GAAO/D,GAAK2E,EAAMJ,EAAM,EAAG,GAC3BJ,GAAOnE,GAAK+D,EAAMY,EAAM,EAAG,IAC3BJ,GAAOvE,GAAKmE,EAAMJ,EAAM,EAAG,IAC3BC,GAAOhE,GAAK4E,EAAMJ,EAAM,EAAG,GAC3BJ,GAAOpE,GAAKgE,EAAMY,EAAM,EAAG,GAC3BJ,GAAOxE,GAAKoE,EAAMJ,EAAM,EAAG,IAC3BY,GAAO5E,GAAKwE,EAAMJ,EAAM,EAAG,IAC3BN,GAAO9D,GAAK6D,EAAMG,EAAM,EAAG,GAC3BD,GAAO/D,GAAK8D,EAAMD,EAAM,EAAG,GAC3BG,GAAOhE,GAAK+D,EAAMD,EAAM,EAAG,IAC3BD,GAAO7D,GAAKgE,EAAMD,EAAM,EAAG,IAC3BI,GAAOnE,GAAKkE,EAAMD,EAAM,EAAG,GAC3BG,GAAOpE,GAAKmE,EAAMD,EAAM,EAAG,GAC3BD,GAAOjE,GAAKoE,EAAMD,EAAM,EAAG,IAC3BD,GAAOlE,GAAKiE,EAAMG,EAAM,EAAG,IAC3BI,GAAOxE,GAAKuE,EAAMD,EAAM,EAAG,GAC3BD,GAAOrE,GAAKwE,EAAMD,EAAM,EAAG,GAC3BD,GAAOtE,GAAKqE,EAAMG,EAAM,EAAG,IAC3BD,GAAOvE,GAAKsE,EAAMD,EAAM,EAAG,IAC3BI,GAAOzE,GAAK4E,EAAMD,EAAM,EAAG,GAC3BD,GAAO1E,GAAKyE,EAAMG,EAAM,EAAG,GAC3BD,GAAO3E,GAAK0E,EAAMD,EAAM,EAAG,IAC3BG,GAAO5E,GAAK2E,EAAMD,EAAM,EAAG,IAG/B/4B,EAAIi3B,KAASC,EAAMgB,EAAO,EAC1Bl4B,EAAIi3B,KAASE,EAAMgB,EAAO,EAC1Bn4B,EAAIi3B,KAASG,EAAMgB,EAAO,EAC1Bp4B,EAAIi3B,KAASI,EAAMgB,EAAO,EAC1Br4B,EAAIi3B,KAASK,EAAMgB,EAAO,EAC1Bt4B,EAAIi3B,KAASM,EAAMgB,EAAO,EAC1Bv4B,EAAIi3B,KAASO,EAAMgB,EAAO,EAC1Bx4B,EAAIi3B,KAASQ,EAAMgB,EAAO,EAC1Bz4B,EAAIi3B,KAASS,EAAMgB,EAAO,EAC1B14B,EAAIi3B,KAASU,EAAMgB,EAAO,EAC1B34B,EAAIi3B,KAASW,EAAMgB,EAAO,EAC1B54B,EAAIi3B,KAASY,EAAMgB,EAAO,EAC1B74B,EAAIi3B,KAASa,EAAMgB,EAAO,EAC1B94B,EAAIi3B,KAASc,EAAMgB,EAAO,EAC1B/4B,EAAIi3B,KAASe,EAAMgB,EAAO,EAC1Bh5B,EAAIi3B,KAASgB,EAAMgB,EAAO,CAC9B,CACA,SAASC,GAASlC,EAAO1nB,EAAItP,EAAKi3B,EAAIt6B,GAElC,IAAIw8B,EAAOlC,EAAK,EACZntB,EAAOmtB,EAAK,GAAKt6B,EACrB,IAAK,IAAIvC,EAAI,EAAGA,EAAI,GAAIA,IACpB4F,EAAI8J,EAAO1P,GAAK48B,EAAM1nB,EAAmB,IAAb,EAAI3S,EAAI,GAAUvC,GAClD,IAAK,IAAIA,EAAI,EAAGA,EAAIuC,EAAGvC,IAAK++B,GAAQ,GAAI7pB,GAAM,GAE1CwnB,GAAY92B,EAAK8J,EAAMktB,EAAO1nB,EAAItP,EAAKm5B,GACnC/+B,EAAI,IACJ0P,GAAQ,IACZgtB,GAAY92B,EAAKm5B,EAAMnC,EAAQ1nB,GAAM,GAAKtP,EAAK8J,EAEvD,CAEA,SAASsvB,GAAW/b,EAAUyL,EAAMJ,GAEhC,MAAMxB,EAAOF,GAAU,CACnB2B,MAAO,GACPC,UAAW,GACXyQ,OAAQ,YACT3Q,IACG7qB,EAAEA,EAAClB,EAAEA,EAAC5D,EAAEA,EAAC4vB,MAAEA,EAAKC,UAAEA,EAASyQ,OAAEA,EAAMC,WAAEA,GAAepS,EAO1D,GANA2B,GAAahrB,GACbgrB,GAAalsB,GACbksB,GAAa9vB,GACb8vB,GAAaF,GACbE,GAAaD,GACbC,GAAawQ,QACMtf,IAAfuf,GAAkD,mBAAfA,EACnC,MAAM,IAAIloB,MAAM,iCACpB,MAAMmoB,EAAY,IAAM58B,EAClB68B,EAAcD,EAAY,EAChC,GAAI17B,GAAK,GAAMA,EAAKA,EAAI,GAAaA,GAAK,IAAM07B,EAAY,IAAM17B,EAAI,GAAK,GAGvE,MAAM,IAAIuT,MAAM,+FAEpB,GAAIrY,EAAI,GAAKA,EAAI,aAAuBwgC,EACpC,MAAM,IAAInoB,MAAM,4FAEpB,GAAIuX,EAAQ,GAAKA,EAAQ,aACrB,MAAM,IAAIvX,MAAM,kFAEpB,MAAMqoB,EAAUF,GAAa17B,EAAI9E,GACjC,GAAI0gC,EAAUJ,EACV,MAAM,IAAIjoB,MAAM,iCAAiCqoB,2BAAiCJ,cAItF,MAAM1qB,EAAIua,GAAOyC,GAAQtO,EAAUyL,EAAM,CAAEtvB,EAAG,EAAGmvB,MAAO4Q,EAAYxgC,IAC9D2gC,EAAMhU,GAAI/W,GAEVgrB,EAAIjU,GAAI,IAAIvT,WAAWonB,EAAY17B,IACnC5D,EAAMyrB,GAAI,IAAIvT,WAAWonB,IAC/B,IAAIK,EAAa,OACjB,GAAIN,EAAY,CACZ,MAAMO,EAAgB,EAAIh8B,EAAI9E,EAGxB+gC,EAAcngC,KAAK2E,IAAI3E,KAAKC,MAAMigC,EAAgB,KAAQ,GAChE,IAAIE,EAAc,EAClBH,EAAa,KACTG,KACIT,GAAiBS,EAAcD,GAAgBC,IAAgBF,GAC/DP,EAAWS,EAAcF,EAAc,CAElD,CACD,MAAO,CAAEh8B,IAAGlB,IAAG5D,IAAG4vB,QAAO6Q,cAAaG,IAAGD,MAAK/qB,IAAG1U,MAAK2/B,aAAYhR,YACtE,CACA,SAASoR,GAAa3c,EAAUsL,EAAOha,EAAGgrB,EAAG1/B,GACzC,MAAM0R,EAAMud,GAAOyC,GAAQtO,EAAU1O,EAAG,CAAEnV,EAAG,EAAGmvB,UAIhD,OAHAha,EAAEwG,KAAK,GACPwkB,EAAExkB,KAAK,GACPlb,EAAIkb,KAAK,GACFxJ,CACX,CCtJA,IAAIsuB,IAAa,EAAOC,IAAc,EACtC,MAAMC,GAAe5oB,eAAgB6oB,EAAQtR,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,EAAO2Q,GAC/D,aD6LG/nB,eAA2B8L,EAAUyL,EAAM5B,GAC9C,MAAMrpB,EAAEA,EAAClB,EAAEA,EAAC5D,EAAEA,EAAC4vB,MAAEA,EAAK6Q,YAAEA,EAAWG,EAAEA,EAACD,IAAEA,EAAG/qB,EAAEA,EAAC1U,IAAEA,EAAG2/B,WAAEA,EAAUhR,UAAEA,GAAcwQ,GAAW/b,EAAUyL,EAAM5B,GAC1G,IAAK,IAAI6P,EAAK,EAAGA,EAAKh+B,EAAGg+B,IAAM,CAC3B,MAAMsD,EAAKb,EAAczC,EACzB,IAAK,IAAI38B,EAAI,EAAGA,EAAIo/B,EAAap/B,IAC7Bu/B,EAAEv/B,GAAKs/B,EAAIW,EAAKjgC,GACpB,IAAIkvB,EAAM,QACJlD,GAAUvoB,EAAI,EAAG+qB,GAAW,KAC9BsQ,GAASS,EAAGrQ,EAAKqQ,EAAIrQ,GAAOkQ,EAAc78B,GAC1Ci9B,GAAY,IAEhBV,GAASS,GAAI97B,EAAI,GAAK27B,EAAaE,EAAKW,EAAI19B,GAC5Ci9B,UACMxT,GAAUvoB,EAAG+qB,GAAW,KAE1B,MAAMnQ,EAAIihB,EAAIW,EAAKb,EAAc,IAAM37B,EACvC,IAAK,IAAI3C,EAAI,EAAGA,EAAIs+B,EAAat+B,IAC7BjB,EAAIiB,GAAKw+B,EAAIW,EAAKn/B,GAAKy+B,EAAElhB,EAAI+gB,EAAct+B,GAC/Cg+B,GAASj/B,EAAK,EAAGy/B,EAAKW,EAAI19B,GAC1Bi9B,GAAY,GAEnB,CACD,OAAOI,GAAa3c,EAAUsL,EAAOha,EAAGgrB,EAAG1/B,EAC/C,CCpNiBqgC,CAAYF,EAAQtR,EAAM,CAAEjrB,IAAGlB,IAAG5D,IAAG4vB,QAAO2Q,cAC7D,EACMiB,GAAc,SAAUH,EAAQtR,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,GACjD,ODgKG,SAAgBtL,EAAUyL,EAAM5B,GACnC,MAAMrpB,EAAEA,EAAClB,EAAEA,EAAC5D,EAAEA,EAAC4vB,MAAEA,EAAK6Q,YAAEA,EAAWG,EAAEA,EAACD,IAAEA,EAAG/qB,EAAEA,EAAC1U,IAAEA,EAAG2/B,WAAEA,GAAeR,GAAW/b,EAAUyL,EAAM5B,GAC/F,IAAK,IAAI6P,EAAK,EAAGA,EAAKh+B,EAAGg+B,IAAM,CAC3B,MAAMsD,EAAKb,EAAczC,EACzB,IAAK,IAAI38B,EAAI,EAAGA,EAAIo/B,EAAap/B,IAC7Bu/B,EAAEv/B,GAAKs/B,EAAIW,EAAKjgC,GACpB,IAAK,IAAIA,EAAI,EAAGkvB,EAAM,EAAGlvB,EAAIyD,EAAI,EAAGzD,IAChC8+B,GAASS,EAAGrQ,EAAKqQ,EAAIrQ,GAAOkQ,EAAc78B,GAC1Ci9B,IAEJV,GAASS,GAAI97B,EAAI,GAAK27B,EAAaE,EAAKW,EAAI19B,GAC5Ci9B,IACA,IAAK,IAAIx/B,EAAI,EAAGA,EAAIyD,EAAGzD,IAAK,CAExB,MAAMqe,EAAIihB,EAAIW,EAAKb,EAAc,IAAM37B,EACvC,IAAK,IAAI3C,EAAI,EAAGA,EAAIs+B,EAAat+B,IAC7BjB,EAAIiB,GAAKw+B,EAAIW,EAAKn/B,GAAKy+B,EAAElhB,EAAI+gB,EAAct+B,GAC/Cg+B,GAASj/B,EAAK,EAAGy/B,EAAKW,EAAI19B,GAC1Bi9B,GACH,CACJ,CACD,OAAOI,GAAa3c,EAAUsL,EAAOha,EAAGgrB,EAAG1/B,EAC/C,CCtLWugC,CAAWJ,EAAQtR,EAAM,CAAEjrB,IAAGlB,IAAG5D,IAAG4vB,SAC/C,EACA,IAAI8R,GAAgBN,GAChBO,GAAeH,GAsCZhpB,eAAeopB,GAAOC,EAASnS,EAAO5qB,EAAGlB,EAAG5D,EAAG4vB,EAAOkS,GACzD,MAAMT,EAAS/lB,EAASumB,EAAS,UAC3B9R,EAAOzU,EAASoU,EAAO,QAC7B,OAAO0C,QAAQsP,GAAcL,EAAQtR,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,EAAOkS,GAC/D,CAgCO,SAASC,GAAWF,EAASnS,EAAO5qB,EAAGlB,EAAG5D,EAAG4vB,GAChD,MAAMyR,EAAS/lB,EAASumB,EAAS,UAC3B9R,EAAOzU,EAASoU,EAAO,QAC7B,OAAO0C,EAAEuP,GAAaN,EAAQtR,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,GACjD,CAnCAgS,GAAOz9B,EAAIi9B,GACXQ,GAAO3J,KAAO,WAAckJ,IAAc,CAAK,EAC/CS,GAAO1J,SAAW,SAAU/R,GACxB,GAAIgb,GACA,MAAM,IAAI9oB,MAAM,oBAEpBqpB,GAAgBvb,CACpB,EACAxkB,OAAOmd,OAAO8iB,IA4BdG,GAAW59B,EAAIq9B,GACfO,GAAW9J,KAAO,WAAciJ,IAAa,CAAK,EAClDa,GAAW7J,SAAW,SAAU/R,GAC5B,GAAI+a,GACA,MAAM,IAAI7oB,MAAM,wBAEpBspB,GAAexb,CACnB,EACAxkB,OAAOmd,OAAOijB,IC/Fd,MAAMC,GAAU,SAAUl/B,GACtB,OVkBG,SAAoB+0B,GACvB,OAAQA,GACJ,IAAK,SAAU,OAAOjF,GAAOpsB,SAC7B,IAAK,SAAU,OAAO4wB,GAAO5wB,SAEjC2T,GAAe,EAAO,iCAAkC,YAAa0d,EACzE,CUxBWoK,CAAW,UAAU1T,OAAOzrB,GAAM0rB,QAC7C,EAIA,IAAI0T,GAAWF,GAEXG,IAAY,EAkBT,SAASvP,GAAOlP,GACnB,MAAM5gB,EAAOwY,EAASoI,EAAO,QAC7B,OAAO/H,EAAQumB,GAASp/B,GAC5B,CACA8vB,GAAOzuB,EAAI69B,GACXpP,GAAOqF,KAAO,WAAckK,IAAY,CAAK,EAC7CvP,GAAOsF,SAAW,SAAU/R,GACxB,GAAIgc,GACA,MAAM,IAAI9pB,MAAM,oBAEpB6pB,GAAW/b,CACf,EACAxkB,OAAOmd,OAAO8T,IA6BdjxB,OAAOmd,OAAO8T;;AChEd,MAAM0F,GAAM/e,OAAO,GACbgf,GAAMhf,OAAO,GACbif,GAAMjf,OAAO,GACbmT,GAAOxe,GAAMA,aAAakL,WAC1BgpB,GAAwB72B,MAAMI,KAAK,CAAE7K,OAAQ,MAAO,CAACqD,EAAG9C,IAAMA,EAAEnB,SAAS,IAAImiC,SAAS,EAAG,OAIxF,SAASC,GAAW1mB,GACvB,IAAK8Q,GAAI9Q,GACL,MAAM,IAAIvD,MAAM,uBAEpB,IAAIsF,EAAM,GACV,IAAK,IAAItc,EAAI,EAAGA,EAAIua,EAAM9a,OAAQO,IAC9Bsc,GAAOykB,GAAMxmB,EAAMva,IAEvB,OAAOsc,CACX,CACO,SAAS4kB,GAAoBjtB,GAChC,MAAMqI,EAAMrI,EAAIpV,SAAS,IACzB,OAAoB,EAAbyd,EAAI7c,OAAa,IAAI6c,IAAQA,CACxC,CACO,SAAS6kB,GAAY7kB,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAItF,MAAM,mCAAqCsF,GAEzD,OAAOpE,OAAe,KAARoE,EAAa,IAAM,KAAKA,IAC1C,CAIO,SAAS8kB,GAAW9kB,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAItF,MAAM,mCAAqCsF,GACzD,MAAMqT,EAAMrT,EAAI7c,OAChB,GAAIkwB,EAAM,EACN,MAAM,IAAI3Y,MAAM,0DAA4D2Y,GAChF,MAAM0R,EAAQ,IAAItpB,WAAW4X,EAAM,GACnC,IAAK,IAAI3vB,EAAI,EAAGA,EAAIqhC,EAAM5hC,OAAQO,IAAK,CACnC,MAAMqe,EAAQ,EAAJre,EACJshC,EAAUhlB,EAAIhe,MAAM+f,EAAGA,EAAI,GAC3BkjB,EAAOvlB,OAAOjC,SAASunB,EAAS,IACtC,GAAItlB,OAAOwlB,MAAMD,IAASA,EAAO,EAC7B,MAAM,IAAIvqB,MAAM,yBACpBqqB,EAAMrhC,GAAKuhC,CACf,CACA,OAAOF,CACX,CAEO,SAASI,GAAgBlnB,GAC5B,OAAO4mB,GAAYF,GAAW1mB,GAClC,CACO,SAASmnB,GAAgBnnB,GAC5B,IAAK8Q,GAAI9Q,GACL,MAAM,IAAIvD,MAAM,uBACpB,OAAOmqB,GAAYF,GAAWlpB,WAAWzN,KAAKiQ,GAAOhN,WACzD,CACO,SAASo0B,GAAgB9gC,EAAG8uB,GAC/B,OAAOyR,GAAWvgC,EAAEhC,SAAS,IAAImiC,SAAe,EAANrR,EAAS,KACvD,CACO,SAASiS,GAAgB/gC,EAAG8uB,GAC/B,OAAOgS,GAAgB9gC,EAAG8uB,GAAKpiB,SACnC,CAcO,SAASs0B,GAAYC,EAAOxlB,EAAKylB,GACpC,IAAIxwB,EACJ,GAAmB,iBAAR+K,EACP,IACI/K,EAAM6vB,GAAW9kB,EACrB,CACA,MAAO9a,GACH,MAAM,IAAIwV,MAAM,GAAG8qB,oCAAwCxlB,cAAgB9a,IAC/E,KAEC,KAAI6pB,GAAI/O,GAMT,MAAM,IAAItF,MAAM,GAAG8qB,sCAHnBvwB,EAAMwG,WAAWzN,KAAKgS,EAI1B,CACA,MAAMqT,EAAMpe,EAAI9R,OAChB,GAA8B,iBAAnBsiC,GAA+BpS,IAAQoS,EAC9C,MAAM,IAAI/qB,MAAM,GAAG8qB,cAAkBC,gBAA6BpS,KACtE,OAAOpe,CACX,CAIO,SAASywB,MAAeC,GAC3B,MAAM1/B,EAAI,IAAIwV,WAAWkqB,EAAO3qB,QAAO,CAAC4qB,EAAKr1B,IAAMq1B,EAAMr1B,EAAEpN,QAAQ,IACnE,IAAIiuB,EAAM,EAOV,OANAuU,EAAO93B,SAAS0C,IACZ,IAAKwe,GAAIxe,GACL,MAAM,IAAImK,MAAM,uBACpBzU,EAAE2L,IAAIrB,EAAG6gB,GACTA,GAAO7gB,EAAEpN,MAAM,IAEZ8C,CACX,CAwCO,MAOM4/B,GAAWthC,IAAOs2B,IAAOjf,OAAOrX,EAAI,IAAMq2B,GAEjDkL,GAAO3gC,GAAS,IAAIsW,WAAWtW,GAC/B4gC,GAAQhsB,GAAQ0B,WAAWzN,KAAK+L,GAQ/B,SAASisB,GAAeC,EAASC,EAAUC,GAC9C,GAAuB,iBAAZF,GAAwBA,EAAU,EACzC,MAAM,IAAIvrB,MAAM,4BACpB,GAAwB,iBAAbwrB,GAAyBA,EAAW,EAC3C,MAAM,IAAIxrB,MAAM,6BACpB,GAAsB,mBAAXyrB,EACP,MAAM,IAAIzrB,MAAM,6BAEpB,IAAI1T,EAAI8+B,GAAIG,GACRzhC,EAAIshC,GAAIG,GACRviC,EAAI,EACR,MAAM0iC,EAAQ,KACVp/B,EAAEyX,KAAK,GACPja,EAAEia,KAAK,GACP/a,EAAI,CAAC,EAEH+P,EAAI,IAAIgE,IAAM0uB,EAAO3hC,EAAGwC,KAAMyQ,GAC9B4uB,EAAS,CAACC,EAAOR,QAEnBthC,EAAIiP,EAAEsyB,GAAK,CAAC,IAAQO,GACpBt/B,EAAIyM,IACgB,IAAhB6yB,EAAKnjC,SAETqB,EAAIiP,EAAEsyB,GAAK,CAAC,IAAQO,GACpBt/B,EAAIyM,IAAG,EAELopB,EAAM,KAER,GAAIn5B,KAAO,IACP,MAAM,IAAIgX,MAAM,2BACpB,IAAI2Y,EAAM,EACV,MAAM/pB,EAAM,GACZ,KAAO+pB,EAAM6S,GAAU,CACnBl/B,EAAIyM,IACJ,MAAM2rB,EAAKp4B,EAAEhF,QACbsH,EAAI3E,KAAKy6B,GACT/L,GAAOrsB,EAAE7D,MACb,CACA,OAAOuiC,MAAep8B,EAAI,EAW9B,MATiB,CAACg9B,EAAMC,KAGpB,IAAItxB,EACJ,IAHAmxB,IACAC,EAAOC,KAEErxB,EAAMsxB,EAAK1J,OAChBwJ,IAEJ,OADAD,IACOnxB,CAAG,CAGlB,CAEA,MAAMuxB,GAAe,CACjBC,OAAS56B,GAAuB,iBAARA,EACxB66B,SAAW76B,GAAuB,mBAARA,EAC1B86B,QAAU96B,GAAuB,kBAARA,EACzB+6B,OAAS/6B,GAAuB,iBAARA,EACxBg7B,mBAAqBh7B,GAAuB,iBAARA,GAAoBA,aAAe4P,WACvEyS,cAAgBriB,GAAQ6T,OAAOwO,cAAcriB,GAC7Ck5B,MAAQl5B,GAAQ+B,MAAM4N,QAAQ3P,GAC9Bi7B,MAAO,CAACj7B,EAAKoe,IAAWA,EAAO8c,GAAGC,QAAQn7B,GAC1CpI,KAAOoI,GAAuB,mBAARA,GAAsB6T,OAAOwO,cAAcriB,EAAIwiB,YAGlE,SAAS4Y,GAAehd,EAAQid,EAAYC,EAAgB,CAAA,GAC/D,MAAMC,EAAa,CAACC,EAAW/sB,EAAMgtB,KACjC,MAAMC,EAAWf,GAAalsB,GAC9B,GAAwB,mBAAbitB,EACP,MAAM,IAAI7sB,MAAM,sBAAsBJ,yBAC1C,MAAMzO,EAAMoe,EAAOod,GACnB,KAAIC,QAAsBjkB,IAARxX,GAEb07B,EAAS17B,EAAKoe,IACf,MAAM,IAAIvP,MAAM,iBAAiB/X,OAAO0kC,MAAcx7B,aAAeA,gBAAkByO,IAC3F,EAEJ,IAAK,MAAO+sB,EAAW/sB,KAAStW,OAAOwjC,QAAQN,GAC3CE,EAAWC,EAAW/sB,GAAM,GAChC,IAAK,MAAO+sB,EAAW/sB,KAAStW,OAAOwjC,QAAQL,GAC3CC,EAAWC,EAAW/sB,GAAM,GAChC,OAAO2P,CACX,6CAzGO,SAAgB1lB,EAAGquB,GACtB,OAAQruB,GAAKqX,OAAOgX,GAAQgI,EAChC,SAbO,SAAgBr2B,GACnB,IAAI8uB,EACJ,IAAKA,EAAM,EAAG9uB,EAAIo2B,GAAKp2B,IAAMq2B,GAAKvH,GAAO,GAEzC,OAAOA,CACX,oBAYsB,CAAC9uB,EAAGquB,EAAKvY,IACpB9V,GAAM8V,EAAQugB,GAAMD,KAAQ/e,OAAOgX,kHAxCvC,SAAoB6U,EAAIC,GAE3B,GAAID,EAAGtkC,SAAWukC,EAAGvkC,OACjB,OAAO,EACX,IAAK,IAAIO,EAAI,EAAGA,EAAI+jC,EAAGtkC,OAAQO,IAC3B,GAAI+jC,EAAG/jC,KAAOgkC,EAAGhkC,GACb,OAAO,EACf,OAAO,CACX,+GAzDO,SAA4Ba,GAC/B,OAAOugC,GAAWF,GAAoBrgC,GAC1C,cA2DO,SAAqB+c,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAI5G,MAAM,2CAA2C4G,GAC/D,OAAO,IAAI7F,YAAW,IAAIuU,aAAcC,OAAO3O,GACnD;sEClIA,MAAMqZ,GAAM/e,OAAO,GAAIgf,GAAMhf,OAAO,GAAIif,GAAMjf,OAAO,GAAI+rB,GAAM/rB,OAAO,GAEhEgsB,GAAMhsB,OAAO,GAAIisB,GAAMjsB,OAAO,GAAIksB,GAAMlsB,OAAO,GAI9C,SAAS1Z,GAAIqO,EAAGkH,GACnB,MAAMkE,EAASpL,EAAIkH,EACnB,OAAOkE,GAAUgf,GAAMhf,EAASlE,EAAIkE,CACxC,CAQO,SAASsM,GAAItQ,EAAKowB,EAAOC,GAC5B,GAAIA,GAAUrN,IAAOoN,EAAQpN,GACzB,MAAM,IAAIjgB,MAAM,6BACpB,GAAIstB,IAAWpN,GACX,OAAOD,GACX,IAAI1lB,EAAM2lB,GACV,KAAOmN,EAAQpN,IACPoN,EAAQnN,KACR3lB,EAAOA,EAAM0C,EAAOqwB,GACxBrwB,EAAOA,EAAMA,EAAOqwB,EACpBD,IAAUnN,GAEd,OAAO3lB,CACX,CAEO,SAASgzB,GAAKxvB,EAAGsvB,EAAOC,GAC3B,IAAI/yB,EAAMwD,EACV,KAAOsvB,KAAUpN,IACb1lB,GAAOA,EACPA,GAAO+yB,EAEX,OAAO/yB,CACX,CAEO,SAASizB,GAAOja,EAAQ+Z,GAC3B,GAAI/Z,IAAW0M,IAAOqN,GAAUrN,GAC5B,MAAM,IAAIjgB,MAAM,6CAA6CuT,SAAc+Z,KAI/E,IAAIz3B,EAAIrO,GAAI+rB,EAAQ+Z,GAChBvwB,EAAIuwB,EAEJvvB,EAAIkiB,GAAcn3B,EAAIo3B,GAC1B,KAAOrqB,IAAMoqB,IAAK,CAEd,MACM10B,EAAIwR,EAAIlH,EACR0C,EAAIwF,EAAIjV,GAFJiU,EAAIlH,GAKdkH,EAAIlH,EAAGA,EAAItK,EAAGwS,EAAIjV,EAAUA,EAAIyP,CACnC,CAED,GADYwE,IACAmjB,GACR,MAAM,IAAIlgB,MAAM,0BACpB,OAAOxY,GAAIuW,EAAGuvB,EAClB,CAiEO,SAASG,GAAOn1B,GAKnB,GAAIA,EAAI40B,KAAQD,GAAK,CAKjB,MAAMS,GAAUp1B,EAAI4nB,IAAOgN,GAC3B,OAAO,SAAmBb,EAAIxiC,GAC1B,MAAMsF,EAAOk9B,EAAG9e,IAAI1jB,EAAG6jC,GAEvB,IAAKrB,EAAGsB,IAAItB,EAAGuB,IAAIz+B,GAAOtF,GACtB,MAAM,IAAImW,MAAM,2BACpB,OAAO7Q,CACnB,CACK,CAED,GAAImJ,EAAI80B,KAAQD,GAAK,CACjB,MAAMU,GAAMv1B,EAAI60B,IAAOC,GACvB,OAAO,SAAmBf,EAAIxiC,GAC1B,MAAMikC,EAAKzB,EAAG0B,IAAIlkC,EAAGs2B,IACf7zB,EAAI+/B,EAAG9e,IAAIugB,EAAID,GACfG,EAAK3B,EAAG0B,IAAIlkC,EAAGyC,GACftD,EAAIqjC,EAAG0B,IAAI1B,EAAG0B,IAAIC,EAAI7N,IAAM7zB,GAC5B6C,EAAOk9B,EAAG0B,IAAIC,EAAI3B,EAAG13B,IAAI3L,EAAGqjC,EAAG4B,MACrC,IAAK5B,EAAGsB,IAAItB,EAAGuB,IAAIz+B,GAAOtF,GACtB,MAAM,IAAImW,MAAM,2BACpB,OAAO7Q,CACnB,CACK,CAwBD,OAhHG,SAAuBmJ,GAM1B,MAAM41B,GAAa51B,EAAI4nB,IAAOC,GAC9B,IAAIgO,EAAG9iC,EAAG+iC,EAGV,IAAKD,EAAI71B,EAAI4nB,GAAK70B,EAAI,EAAG8iC,EAAIhO,KAAQF,GAAKkO,GAAKhO,GAAK90B,KAGpD,IAAK+iC,EAAIjO,GAAKiO,EAAI91B,GAAKiV,GAAI6gB,EAAGF,EAAW51B,KAAOA,EAAI4nB,GAAKkO,KAGzD,GAAU,IAAN/iC,EAAS,CACT,MAAMqiC,GAAUp1B,EAAI4nB,IAAOgN,GAC3B,OAAO,SAAqBb,EAAIxiC,GAC5B,MAAMsF,EAAOk9B,EAAG9e,IAAI1jB,EAAG6jC,GACvB,IAAKrB,EAAGsB,IAAItB,EAAGuB,IAAIz+B,GAAOtF,GACtB,MAAM,IAAImW,MAAM,2BACpB,OAAO7Q,CACnB,CACK,CAED,MAAMk/B,GAAUF,EAAIjO,IAAOC,GAC3B,OAAO,SAAqBkM,EAAIxiC,GAE5B,GAAIwiC,EAAG9e,IAAI1jB,EAAGqkC,KAAe7B,EAAGiC,IAAIjC,EAAG4B,KACnC,MAAM,IAAIjuB,MAAM,2BACpB,IAAIzU,EAAIF,EAEJ2H,EAAIq5B,EAAG9e,IAAI8e,EAAG0B,IAAI1B,EAAG4B,IAAKG,GAAID,GAC9BpwB,EAAIsuB,EAAG9e,IAAI1jB,EAAGwkC,GACdtxB,EAAIsvB,EAAG9e,IAAI1jB,EAAGskC,GAClB,MAAQ9B,EAAGsB,IAAI5wB,EAAGsvB,EAAG4B,MAAM,CACvB,GAAI5B,EAAGsB,IAAI5wB,EAAGsvB,EAAGkC,MACb,OAAOlC,EAAGkC,KAEd,IAAIh2B,EAAI,EACR,IAAK,IAAIi2B,EAAKnC,EAAGuB,IAAI7wB,GAAIxE,EAAIhN,IACrB8gC,EAAGsB,IAAIa,EAAInC,EAAG4B,KADU11B,IAG5Bi2B,EAAKnC,EAAGuB,IAAIY,GAGhB,MAAMC,EAAKpC,EAAG9e,IAAIva,EAAGktB,IAAOhf,OAAO3V,EAAIgN,EAAI,IAC3CvF,EAAIq5B,EAAGuB,IAAIa,GACX1wB,EAAIsuB,EAAG0B,IAAIhwB,EAAG0wB,GACd1xB,EAAIsvB,EAAG0B,IAAIhxB,EAAG/J,GACdzH,EAAIgN,CACP,CACD,OAAOwF,CACf,CACA,CAyDW2wB,CAAcp2B,EACzB,CAtLY4I,OAAO,GAAWA,OAAO,IA0LrC,MAAMytB,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QA2ErB,SAASC,GAAQ/kC,EAAGglC,GAEvB,MAAMC,OAA6BnmB,IAAfkmB,EAA2BA,EAAahlC,EAAEhC,SAAS,GAAGY,OAE1E,MAAO,CAAEomC,WAAYC,EAAaC,YADdxmC,KAAK0qB,KAAK6b,EAAc,GAEhD,CAgGO,SAASE,GAAoBC,GAChC,GAA0B,iBAAfA,EACP,MAAM,IAAIjvB,MAAM,8BACpB,MAAMkvB,EAAYD,EAAWpnC,SAAS,GAAGY,OACzC,OAAOF,KAAK0qB,KAAKic,EAAY,EACjC,CAQO,SAASC,GAAiBF,GAC7B,MAAMxmC,EAASumC,GAAoBC,GACnC,OAAOxmC,EAASF,KAAK0qB,KAAKxqB,EAAS,EACvC;;ACjYA,MAAMw3B,GAAM/e,OAAO,GACbgf,GAAMhf,OAAO,GAoIZ,SAASkuB,GAAcC,GAY1B,ODkDG,SAAuBjD,GAC1B,MAMMtW,EAAO6Y,GAAaruB,QAAO,CAACxO,EAAKX,KACnCW,EAAIX,GAAO,WACJW,IARK,CACZw9B,MAAO,SACPC,KAAM,SACNC,MAAO,gBACPC,KAAM,kBAMHlD,GAAeH,EAAOtW,EACjC,CCzEI4Z,CAAcL,EAAMhD,IACpBE,GAAe8C,EAAO,CAClBxlC,EAAG,SACHkP,EAAG,SACH42B,GAAI,QACJC,GAAI,SACL,CACCf,WAAY,gBACZE,YAAa,kBAGVzlC,OAAOmd,OAAO,IACdmoB,GAAQS,EAAMxlC,EAAGwlC,EAAMR,eACvBQ,EACE1nC,EAAG0nC,EAAMhD,GAAGiD,OAEzB;sECxHA,MAAQ7E,gBAAiBoF,GAAKzF,WAAY0F,IAAQC,GACrCC,GAAM,CAEfC,IAAK,cAAqBjwB,MACtB,WAAAtW,CAAY6O,EAAI,IACZ/C,MAAM+C,EACT,GAEL,SAAA23B,CAAUzlC,GACN,MAAQwlC,IAAKpW,GAAMmW,GACnB,GAAIvlC,EAAKhC,OAAS,GAAiB,IAAZgC,EAAK,GACxB,MAAM,IAAIovB,EAAE,iCAChB,MAAMlB,EAAMluB,EAAK,GACX8P,EAAM9P,EAAK2tB,SAAS,EAAGO,EAAM,GACnC,IAAKA,GAAOpe,EAAI9R,SAAWkwB,EACvB,MAAM,IAAIkB,EAAE,2CAKhB,GAAa,IAATtf,EAAI,GACJ,MAAM,IAAIsf,EAAE,uCAChB,GAAe,IAAXtf,EAAI,MAA0B,IAATA,EAAI,IACzB,MAAM,IAAIsf,EAAE,uDAChB,MAAO,CAAE1jB,EAAG05B,GAAIt1B,GAAMpS,EAAGsC,EAAK2tB,SAASO,EAAM,GAChD,EACD,KAAAwX,CAAM7qB,GAEF,MAAQ2qB,IAAKpW,GAAMmW,GACbvlC,EAAsB,iBAAR6a,EAAmBwqB,GAAIxqB,GAAOA,EAClD,KAAM7a,aAAgBsW,YAClB,MAAM,IAAIf,MAAM,iBACpB,IAAI7X,EAAIsC,EAAKhC,OACb,GAAIN,EAAI,GAAgB,IAAXsC,EAAK,GACd,MAAM,IAAIovB,EAAE,yBAChB,GAAIpvB,EAAK,KAAOtC,EAAI,EAChB,MAAM,IAAI0xB,EAAE,uCAChB,MAAQ1jB,EAAG5K,EAAGpD,EAAGioC,GAAWJ,GAAIE,UAAUzlC,EAAK2tB,SAAS,KAChDjiB,EAAG9N,EAAGF,EAAGkoC,GAAeL,GAAIE,UAAUE,GAC9C,GAAIC,EAAW5nC,OACX,MAAM,IAAIoxB,EAAE,+CAChB,MAAO,CAAEtuB,IAAGlD,IACf,EACD,UAAAioC,CAAWC,GAEP,MAAMjpC,EAASe,GAAmC,EAA5B2c,OAAOjC,SAAS1a,EAAE,GAAI,IAAe,KAAOA,EAAIA,EAChE0Q,EAAKkE,IACP,MAAMqI,EAAMrI,EAAIpV,SAAS,IACzB,OAAoB,EAAbyd,EAAI7c,OAAa,IAAI6c,IAAQA,CAAG,EAErCjd,EAAIf,EAAMyR,EAAEw3B,EAAIloC,IAChBkD,EAAIjE,EAAMyR,EAAEw3B,EAAIhlC,IAChBilC,EAAMnoC,EAAEI,OAAS,EACjBgoC,EAAMllC,EAAE9C,OAAS,EACjBi8B,EAAK3rB,EAAEy3B,GACPhM,EAAKzrB,EAAE03B,GACb,MAAO,KAAK13B,EAAE03B,EAAMD,EAAM,OAAOhM,IAAKj5B,MAAMm5B,IAAKr8B,GACpD,GAIC43B,GAAM/e,OAAO,GAAIgf,GAAMhf,OAAO,GAAUA,OAAO,GAAG,MAAC+rB,GAAM/rB,OAAO,GAC/D,SAASwvB,GAAkB5a,GAC9B,MAAM6a,EA3FV,SAA2BtB,GACvB,MAAMvZ,EAAOsZ,GAAcC,GAC3BuB,GAAkB9a,EAAM,CACpBjgB,EAAG,QACHkH,EAAG,SACJ,CACC8zB,yBAA0B,QAC1BC,eAAgB,UAChBC,cAAe,WACfC,cAAe,WACfC,mBAAoB,UACpBC,UAAW,WACX7b,QAAS,aAEb,MAAM8b,KAAEA,EAAI9E,GAAEA,EAAEx2B,EAAEA,GAAMigB,EACxB,GAAIqb,EAAM,CACN,IAAK9E,EAAGsB,IAAI93B,EAAGw2B,EAAGkC,MACd,MAAM,IAAIvuB,MAAM,qEAEpB,GAAoB,iBAATmxB,GACc,iBAAdA,EAAKC,MACgB,mBAArBD,EAAKE,YACZ,MAAM,IAAIrxB,MAAM,oEAEvB,CACD,OAAO1W,OAAOmd,OAAO,IAAKqP,GAC9B,CAiEkBwb,CAAkBxb,IAC1BuW,GAAEA,GAAOsE,EACTtb,EAAUsb,EAAMtb,SAC1B,EAAUkc,EAAIC,EAAOC,KACT,MAAM57B,EAAI27B,EAAME,WAChB,OAAOC,GAAe5wB,WAAWzN,KAAK,CAAC,IAAQ+4B,EAAGhX,QAAQxf,EAAEkI,GAAIsuB,EAAGhX,QAAQxf,EAAEgE,GAChF,GACCq3B,EAAYP,EAAMO,WACnB,CAAC3tB,IAEE,MAAM7K,EAAO6K,EAAM6U,SAAS,GAI5B,MAAO,CAAEra,EAFCsuB,EAAG6E,UAAUx4B,EAAK0f,SAAS,EAAGiU,EAAGmD,QAE/B31B,EADFwyB,EAAG6E,UAAUx4B,EAAK0f,SAASiU,EAAGmD,MAAO,EAAInD,EAAGmD,QAEzD,GAKL,SAASoC,EAAoB7zB,GACzB,MAAMlI,EAAEA,EAACkH,EAAEA,GAAM4zB,EACXkB,EAAKxF,EAAGuB,IAAI7vB,GACZ+zB,EAAKzF,EAAG0B,IAAI8D,EAAI9zB,GACtB,OAAOsuB,EAAGt2B,IAAIs2B,EAAGt2B,IAAI+7B,EAAIzF,EAAG0B,IAAIhwB,EAAGlI,IAAKkH,EAC3C,CAKD,IAAKsvB,EAAGsB,IAAItB,EAAGuB,IAAI+C,EAAMf,IAAKgC,EAAoBjB,EAAMhB,KACpD,MAAM,IAAI3vB,MAAM,+CAEpB,SAAS+xB,EAAmB90B,GACxB,MAAsB,iBAARA,GAAoBgjB,GAAMhjB,GAAOA,EAAM0zB,EAAM9mC,CAC9D,CACD,SAASmoC,EAAS/0B,GACd,IAAK80B,EAAmB90B,GACpB,MAAM,IAAI+C,MAAM,8CACvB,CAGD,SAASiyB,EAAuB/gC,GAC5B,MAAQ2/B,yBAA0Bpd,EAAOsb,YAAEA,EAAW+B,eAAEA,EAAcjnC,EAAEA,GAAM8mC,EAC9E,GAAIld,GAA0B,iBAARviB,EAAkB,CAIpC,GAHIA,aAAe6P,aACf7P,EAAMghC,GAAchhC,IAEL,iBAARA,IAAqBuiB,EAAQC,SAASxiB,EAAIzI,QACjD,MAAM,IAAIuX,MAAM,eACpB9O,EAAMA,EAAI84B,SAAuB,EAAd+E,EAAiB,IACvC,CACD,IAAI9xB,EACJ,IACIA,EACmB,iBAAR/L,EACDA,EACAihC,GAAmBtH,GAAY,cAAe35B,EAAK69B,GAChE,CACD,MAAOhvB,GACH,MAAM,IAAIC,MAAM,uBAAuB+uB,sCAAgD79B,IAC1F,CAID,OAHI4/B,IACA7zB,EAAMm1B,GAAQn1B,EAAKpT,IACvBmoC,EAAS/0B,GACFA,CACV,CACD,MAAMo1B,EAAmB,IAAIrhB,IAC7B,SAASshB,EAAeC,GACpB,KAAMA,aAAiBC,GACnB,MAAM,IAAIxyB,MAAM,2BACvB,CAMD,MAAMwyB,EACF,WAAA9oC,CAAY+oC,EAAIC,EAAIC,GAIhB,GAHA9mC,KAAK4mC,GAAKA,EACV5mC,KAAK6mC,GAAKA,EACV7mC,KAAK8mC,GAAKA,EACA,MAANF,IAAepG,EAAGC,QAAQmG,GAC1B,MAAM,IAAIzyB,MAAM,cACpB,GAAU,MAAN0yB,IAAerG,EAAGC,QAAQoG,GAC1B,MAAM,IAAI1yB,MAAM,cACpB,GAAU,MAAN2yB,IAAetG,EAAGC,QAAQqG,GAC1B,MAAM,IAAI3yB,MAAM,aACvB,CAGD,iBAAO4yB,CAAWjrC,GACd,MAAMoW,EAAEA,EAAClE,EAAEA,GAAMlS,GAAK,CAAA,EACtB,IAAKA,IAAM0kC,EAAGC,QAAQvuB,KAAOsuB,EAAGC,QAAQzyB,GACpC,MAAM,IAAImG,MAAM,wBACpB,GAAIrY,aAAa6qC,EACb,MAAM,IAAIxyB,MAAM,gCACpB,MAAM6yB,EAAO7pC,GAAMqjC,EAAGsB,IAAI3kC,EAAGqjC,EAAGkC,MAEhC,OAAIsE,EAAI90B,IAAM80B,EAAIh5B,GACP24B,EAAMjE,KACV,IAAIiE,EAAMz0B,EAAGlE,EAAGwyB,EAAG4B,IAC7B,CACD,KAAIlwB,GACA,OAAOlS,KAAK6lC,WAAW3zB,CAC1B,CACD,KAAIlE,GACA,OAAOhO,KAAK6lC,WAAW73B,CAC1B,CAOD,iBAAOi5B,CAAWC,GACd,MAAMC,EAAQ3G,EAAG4G,YAAYF,EAAOjhC,KAAKnK,GAAMA,EAAEgrC,MACjD,OAAOI,EAAOjhC,KAAI,CAACnK,EAAGqB,IAAMrB,EAAE+pC,SAASsB,EAAMhqC,MAAK8I,IAAI0gC,EAAMI,WAC/D,CAKD,cAAOM,CAAQ5tB,GACX,MAAMhN,EAAIk6B,EAAMI,WAAW1B,EAAUrG,GAAY,WAAYvlB,KAE7D,OADAhN,EAAE66B,iBACK76B,CACV,CAED,qBAAO86B,CAAeC,GAClB,OAAOb,EAAMc,KAAKC,SAAStB,EAAuBoB,GACrD,CAED,cAAAG,CAAeC,GACX5nC,KAAK6nC,aAAeD,EACpBpB,EAAiBsB,OAAO9nC,KAC3B,CAED,cAAAsnC,GACI,GAAItnC,KAAKgnC,MAAO,CAIZ,GAAIlC,EAAMM,qBAAuB5E,EAAGwG,IAAIhnC,KAAK6mC,IACzC,OACJ,MAAM,IAAI1yB,MAAM,kBACnB,CAED,MAAMjC,EAAEA,EAAClE,EAAEA,GAAMhO,KAAK6lC,WAEtB,IAAKrF,EAAGC,QAAQvuB,KAAOsuB,EAAGC,QAAQzyB,GAC9B,MAAM,IAAImG,MAAM,4BACpB,MAAM8D,EAAOuoB,EAAGuB,IAAI/zB,GACd+5B,EAAQhC,EAAoB7zB,GAClC,IAAKsuB,EAAGsB,IAAI7pB,EAAM8vB,GACd,MAAM,IAAI5zB,MAAM,qCACpB,IAAKnU,KAAKklC,gBACN,MAAM,IAAI/wB,MAAM,yCACvB,CACD,QAAA6zB,GACI,MAAMh6B,EAAEA,GAAMhO,KAAK6lC,WACnB,GAAIrF,EAAGyH,MACH,OAAQzH,EAAGyH,MAAMj6B,GACrB,MAAM,IAAImG,MAAM,8BACnB,CAID,MAAA+zB,CAAOxB,GACHD,EAAeC,GACf,MAAQE,GAAIuB,EAAItB,GAAIuB,EAAItB,GAAIuB,GAAOroC,MAC3B4mC,GAAI0B,EAAIzB,GAAI0B,EAAIzB,GAAI0B,GAAO9B,EAC7B+B,EAAKjI,EAAGsB,IAAItB,EAAG0B,IAAIiG,EAAIK,GAAKhI,EAAG0B,IAAIoG,EAAID,IACvCK,EAAKlI,EAAGsB,IAAItB,EAAG0B,IAAIkG,EAAII,GAAKhI,EAAG0B,IAAIqG,EAAIF,IAC7C,OAAOI,GAAMC,CAChB,CAID,MAAAC,GACI,OAAO,IAAIhC,EAAM3mC,KAAK4mC,GAAIpG,EAAGiC,IAAIziC,KAAK6mC,IAAK7mC,KAAK8mC,GACnD,CAKD,MAAA8B,GACI,MAAM5+B,EAAEA,EAACkH,EAAEA,GAAM4zB,EACX+D,EAAKrI,EAAG0B,IAAIhxB,EAAGkwB,KACbwF,GAAIuB,EAAItB,GAAIuB,EAAItB,GAAIuB,GAAOroC,KACnC,IAAI8oC,EAAKtI,EAAGkC,KAAMqG,EAAKvI,EAAGkC,KAAMsG,EAAKxI,EAAGkC,KACpCuG,EAAKzI,EAAG0B,IAAIiG,EAAIA,GAChBe,EAAK1I,EAAG0B,IAAIkG,EAAIA,GAChBzF,EAAKnC,EAAG0B,IAAImG,EAAIA,GAChBc,EAAK3I,EAAG0B,IAAIiG,EAAIC,GA4BpB,OA3BAe,EAAK3I,EAAGt2B,IAAIi/B,EAAIA,GAChBH,EAAKxI,EAAG0B,IAAIiG,EAAIE,GAChBW,EAAKxI,EAAGt2B,IAAI8+B,EAAIA,GAChBF,EAAKtI,EAAG0B,IAAIl4B,EAAGg/B,GACfD,EAAKvI,EAAG0B,IAAI2G,EAAIlG,GAChBoG,EAAKvI,EAAGt2B,IAAI4+B,EAAIC,GAChBD,EAAKtI,EAAG13B,IAAIogC,EAAIH,GAChBA,EAAKvI,EAAGt2B,IAAIg/B,EAAIH,GAChBA,EAAKvI,EAAG0B,IAAI4G,EAAIC,GAChBD,EAAKtI,EAAG0B,IAAIiH,EAAIL,GAChBE,EAAKxI,EAAG0B,IAAI2G,EAAIG,GAChBrG,EAAKnC,EAAG0B,IAAIl4B,EAAG24B,GACfwG,EAAK3I,EAAG13B,IAAImgC,EAAItG,GAChBwG,EAAK3I,EAAG0B,IAAIl4B,EAAGm/B,GACfA,EAAK3I,EAAGt2B,IAAIi/B,EAAIH,GAChBA,EAAKxI,EAAGt2B,IAAI++B,EAAIA,GAChBA,EAAKzI,EAAGt2B,IAAI8+B,EAAIC,GAChBA,EAAKzI,EAAGt2B,IAAI++B,EAAItG,GAChBsG,EAAKzI,EAAG0B,IAAI+G,EAAIE,GAChBJ,EAAKvI,EAAGt2B,IAAI6+B,EAAIE,GAChBtG,EAAKnC,EAAG0B,IAAIkG,EAAIC,GAChB1F,EAAKnC,EAAGt2B,IAAIy4B,EAAIA,GAChBsG,EAAKzI,EAAG0B,IAAIS,EAAIwG,GAChBL,EAAKtI,EAAG13B,IAAIggC,EAAIG,GAChBD,EAAKxI,EAAG0B,IAAIS,EAAIuG,GAChBF,EAAKxI,EAAGt2B,IAAI8+B,EAAIA,GAChBA,EAAKxI,EAAGt2B,IAAI8+B,EAAIA,GACT,IAAIrC,EAAMmC,EAAIC,EAAIC,EAC5B,CAKD,GAAA9+B,CAAIw8B,GACAD,EAAeC,GACf,MAAQE,GAAIuB,EAAItB,GAAIuB,EAAItB,GAAIuB,GAAOroC,MAC3B4mC,GAAI0B,EAAIzB,GAAI0B,EAAIzB,GAAI0B,GAAO9B,EACnC,IAAIoC,EAAKtI,EAAGkC,KAAMqG,EAAKvI,EAAGkC,KAAMsG,EAAKxI,EAAGkC,KACxC,MAAM14B,EAAI86B,EAAM96B,EACV6+B,EAAKrI,EAAG0B,IAAI4C,EAAM5zB,EAAGkwB,IAC3B,IAAI6H,EAAKzI,EAAG0B,IAAIiG,EAAIG,GAChBY,EAAK1I,EAAG0B,IAAIkG,EAAIG,GAChB5F,EAAKnC,EAAG0B,IAAImG,EAAIG,GAChBW,EAAK3I,EAAGt2B,IAAIi+B,EAAIC,GAChBgB,EAAK5I,EAAGt2B,IAAIo+B,EAAIC,GACpBY,EAAK3I,EAAG0B,IAAIiH,EAAIC,GAChBA,EAAK5I,EAAGt2B,IAAI++B,EAAIC,GAChBC,EAAK3I,EAAG13B,IAAIqgC,EAAIC,GAChBA,EAAK5I,EAAGt2B,IAAIi+B,EAAIE,GAChB,IAAIgB,EAAK7I,EAAGt2B,IAAIo+B,EAAIE,GA+BpB,OA9BAY,EAAK5I,EAAG0B,IAAIkH,EAAIC,GAChBA,EAAK7I,EAAGt2B,IAAI++B,EAAItG,GAChByG,EAAK5I,EAAG13B,IAAIsgC,EAAIC,GAChBA,EAAK7I,EAAGt2B,IAAIk+B,EAAIC,GAChBS,EAAKtI,EAAGt2B,IAAIq+B,EAAIC,GAChBa,EAAK7I,EAAG0B,IAAImH,EAAIP,GAChBA,EAAKtI,EAAGt2B,IAAIg/B,EAAIvG,GAChB0G,EAAK7I,EAAG13B,IAAIugC,EAAIP,GAChBE,EAAKxI,EAAG0B,IAAIl4B,EAAGo/B,GACfN,EAAKtI,EAAG0B,IAAI2G,EAAIlG,GAChBqG,EAAKxI,EAAGt2B,IAAI4+B,EAAIE,GAChBF,EAAKtI,EAAG13B,IAAIogC,EAAIF,GAChBA,EAAKxI,EAAGt2B,IAAIg/B,EAAIF,GAChBD,EAAKvI,EAAG0B,IAAI4G,EAAIE,GAChBE,EAAK1I,EAAGt2B,IAAI++B,EAAIA,GAChBC,EAAK1I,EAAGt2B,IAAIg/B,EAAID,GAChBtG,EAAKnC,EAAG0B,IAAIl4B,EAAG24B,GACfyG,EAAK5I,EAAG0B,IAAI2G,EAAIO,GAChBF,EAAK1I,EAAGt2B,IAAIg/B,EAAIvG,GAChBA,EAAKnC,EAAG13B,IAAImgC,EAAItG,GAChBA,EAAKnC,EAAG0B,IAAIl4B,EAAG24B,GACfyG,EAAK5I,EAAGt2B,IAAIk/B,EAAIzG,GAChBsG,EAAKzI,EAAG0B,IAAIgH,EAAIE,GAChBL,EAAKvI,EAAGt2B,IAAI6+B,EAAIE,GAChBA,EAAKzI,EAAG0B,IAAImH,EAAID,GAChBN,EAAKtI,EAAG0B,IAAIiH,EAAIL,GAChBA,EAAKtI,EAAG13B,IAAIggC,EAAIG,GAChBA,EAAKzI,EAAG0B,IAAIiH,EAAID,GAChBF,EAAKxI,EAAG0B,IAAImH,EAAIL,GAChBA,EAAKxI,EAAGt2B,IAAI8+B,EAAIC,GACT,IAAItC,EAAMmC,EAAIC,EAAIC,EAC5B,CACD,QAAAM,CAAS5C,GACL,OAAO1mC,KAAKkK,IAAIw8B,EAAMiC,SACzB,CACD,GAAA3B,GACI,OAAOhnC,KAAKkoC,OAAOvB,EAAMjE,KAC5B,CACD,IAAA6G,CAAKvrC,GACD,OAAOwrC,EAAKC,WAAWzpC,KAAMwmC,EAAkBxoC,GAAI0rC,IAC/C,MAAMvC,EAAQ3G,EAAG4G,YAAYsC,EAAKzjC,KAAKnK,GAAMA,EAAEgrC,MAC/C,OAAO4C,EAAKzjC,KAAI,CAACnK,EAAGqB,IAAMrB,EAAE+pC,SAASsB,EAAMhqC,MAAK8I,IAAI0gC,EAAMI,WAAW,GAE5E,CAMD,cAAA4C,CAAe3rC,GACX,MAAM4rC,EAAIjD,EAAMjE,KAChB,GAAI1kC,IAAMo2B,GACN,OAAOwV,EAEX,GADAzD,EAASnoC,GACLA,IAAMq2B,GACN,OAAOr0B,KACX,MAAMslC,KAAEA,GAASR,EACjB,IAAKQ,EACD,OAAOkE,EAAKK,aAAa7pC,KAAMhC,GAEnC,IAAI8rC,MAAEA,EAAKC,GAAEA,EAAEC,MAAEA,EAAKC,GAAEA,GAAO3E,EAAKE,YAAYxnC,GAC5CksC,EAAMN,EACNO,EAAMP,EACNt/B,EAAItK,KACR,KAAO+pC,EAAK3V,IAAO6V,EAAK7V,IAChB2V,EAAK1V,KACL6V,EAAMA,EAAIhgC,IAAII,IACd2/B,EAAK5V,KACL8V,EAAMA,EAAIjgC,IAAII,IAClBA,EAAIA,EAAEs+B,SACNmB,IAAO1V,GACP4V,IAAO5V,GAOX,OALIyV,IACAI,EAAMA,EAAIvB,UACVqB,IACAG,EAAMA,EAAIxB,UACdwB,EAAM,IAAIxD,EAAMnG,EAAG0B,IAAIiI,EAAIvD,GAAItB,EAAKC,MAAO4E,EAAItD,GAAIsD,EAAIrD,IAChDoD,EAAIhgC,IAAIigC,EAClB,CAUD,QAAAzC,CAAS0C,GACLjE,EAASiE,GACT,IACIzE,EAAO0E,EADPrsC,EAAIosC,EAER,MAAM9E,KAAEA,GAASR,EACjB,GAAIQ,EAAM,CACN,MAAMwE,MAAEA,EAAKC,GAAEA,EAAEC,MAAEA,EAAKC,GAAEA,GAAO3E,EAAKE,YAAYxnC,GAClD,IAAMlC,EAAGouC,EAAK3rC,EAAG+rC,GAAQtqC,KAAKupC,KAAKQ,IAC7BjuC,EAAGquC,EAAK5rC,EAAGgsC,GAAQvqC,KAAKupC,KAAKU,GACnCC,EAAMV,EAAKgB,gBAAgBV,EAAOI,GAClCC,EAAMX,EAAKgB,gBAAgBR,EAAOG,GAClCA,EAAM,IAAIxD,EAAMnG,EAAG0B,IAAIiI,EAAIvD,GAAItB,EAAKC,MAAO4E,EAAItD,GAAIsD,EAAIrD,IACvDnB,EAAQuE,EAAIhgC,IAAIigC,GAChBE,EAAOC,EAAIpgC,IAAIqgC,EAClB,KACI,CACD,MAAMzuC,EAAEA,EAACyC,EAAEA,GAAMyB,KAAKupC,KAAKvrC,GAC3B2nC,EAAQ7pC,EACRuuC,EAAO9rC,CACV,CAED,OAAOooC,EAAMM,WAAW,CAACtB,EAAO0E,IAAO,EAC1C,CAOD,oBAAAI,CAAqBnI,EAAGt4B,EAAGkH,GACvB,MAAM+c,EAAI0Y,EAAMc,KACVvF,EAAM,CAACz1B,EAAGzC,IACVA,IAAMoqB,IAAOpqB,IAAMqqB,IAAQ5nB,EAAEy7B,OAAOja,GAA2BxhB,EAAEi7B,SAAS19B,GAAjCyC,EAAEk9B,eAAe3/B,GAC1Dq1B,EAAM6C,EAAIliC,KAAMgK,GAAGE,IAAIg4B,EAAII,EAAGpxB,IACpC,OAAOmuB,EAAI2H,WAAQlqB,EAAYuiB,CAClC,CAID,QAAAwG,CAAS6E,GACL,MAAQ9D,GAAI10B,EAAG20B,GAAI74B,EAAG84B,GAAIxP,GAAMt3B,KAC1BgnC,EAAMhnC,KAAKgnC,MAGP,MAAN0D,IACAA,EAAK1D,EAAMxG,EAAG4B,IAAM5B,EAAGmK,IAAIrT,IAC/B,MAAMsT,EAAKpK,EAAG0B,IAAIhwB,EAAGw4B,GACfG,EAAKrK,EAAG0B,IAAIl0B,EAAG08B,GACfI,EAAKtK,EAAG0B,IAAI5K,EAAGoT,GACrB,GAAI1D,EACA,MAAO,CAAE90B,EAAGsuB,EAAGkC,KAAM10B,EAAGwyB,EAAGkC,MAC/B,IAAKlC,EAAGsB,IAAIgJ,EAAItK,EAAG4B,KACf,MAAM,IAAIjuB,MAAM,oBACpB,MAAO,CAAEjC,EAAG04B,EAAI58B,EAAG68B,EACtB,CACD,aAAA3F,GACI,MAAQh4B,EAAG69B,EAAQ7F,cAAEA,GAAkBJ,EACvC,GAAIiG,IAAa1W,GACb,OAAO,EACX,GAAI6Q,EACA,OAAOA,EAAcyB,EAAO3mC,MAChC,MAAM,IAAImU,MAAM,+DACnB,CACD,aAAAgxB,GACI,MAAQj4B,EAAG69B,EAAQ5F,cAAEA,GAAkBL,EACvC,OAAIiG,IAAa1W,GACNr0B,KACPmlC,EACOA,EAAcwB,EAAO3mC,MACzBA,KAAK2pC,eAAe7E,EAAM53B,EACpC,CACD,UAAA89B,CAAWC,GAAe,GAEtB,OADAjrC,KAAKsnC,iBACE9d,EAAQmd,EAAO3mC,KAAMirC,EAC/B,CACD,KAAAC,CAAMD,GAAe,GACjB,OAAO5E,GAAcrmC,KAAKgrC,WAAWC,GACxC,EAELtE,EAAMc,KAAO,IAAId,EAAM7B,EAAMhB,GAAIgB,EAAMf,GAAIvD,EAAG4B,KAC9CuE,EAAMjE,KAAO,IAAIiE,EAAMnG,EAAGkC,KAAMlC,EAAG4B,IAAK5B,EAAGkC,MAC3C,MAAM1pB,EAAQ8rB,EAAM9B,WACdwG,EDhfH,SAAcjtC,EAAG2c,GACpB,MAAMsxB,EAAkB,CAACW,EAAW7/B,KAChC,MAAMm3B,EAAMn3B,EAAKq9B,SACjB,OAAOwC,EAAY1I,EAAMn3B,CAAI,EAE3B2e,EAAQmhB,IAGH,CAAEC,QAFO3uC,KAAK0qB,KAAKlO,EAAOkyB,GAAK,EAEpBxD,WADC,IAAMwD,EAAI,KAGjC,MAAO,CACHZ,kBAEA,YAAAX,CAAayB,EAAKttC,GACd,IAAIlC,EAAIS,EAAEmmC,KACNp4B,EAAIghC,EACR,KAAOttC,EAAIo2B,IACHp2B,EAAIq2B,KACJv4B,EAAIA,EAAEoO,IAAII,IACdA,EAAIA,EAAEs+B,SACN5qC,IAAMq2B,GAEV,OAAOv4B,CACV,EAWD,gBAAAyvC,CAAiBD,EAAKF,GAClB,MAAMC,QAAEA,EAAOzD,WAAEA,GAAe3d,EAAKmhB,GAC/BlE,EAAS,GACf,IAAIprC,EAAIwvC,EACJE,EAAO1vC,EACX,IAAK,IAAI4K,EAAS,EAAGA,EAAS2kC,EAAS3kC,IAAU,CAC7C8kC,EAAO1vC,EACPorC,EAAO9oC,KAAKotC,GAEZ,IAAK,IAAIruC,EAAI,EAAGA,EAAIyqC,EAAYzqC,IAC5BquC,EAAOA,EAAKthC,IAAIpO,GAChBorC,EAAO9oC,KAAKotC,GAEhB1vC,EAAI0vC,EAAK5C,QACZ,CACD,OAAO1B,CACV,EAQD,IAAAqC,CAAK6B,EAAGK,EAAaztC,GAGjB,MAAMqtC,QAAEA,EAAOzD,WAAEA,GAAe3d,EAAKmhB,GACrC,IAAItvC,EAAIS,EAAEmmC,KACNnkC,EAAIhC,EAAEkrC,KACV,MAAM1uB,EAAO1D,OAAO,GAAK+1B,EAAI,GACvBM,EAAY,GAAKN,EACjBO,EAAUt2B,OAAO+1B,GACvB,IAAK,IAAI1kC,EAAS,EAAGA,EAAS2kC,EAAS3kC,IAAU,CAC7C,MAAMuQ,EAASvQ,EAASkhC,EAExB,IAAIgE,EAAQzyB,OAAOnb,EAAI+a,GAEvB/a,IAAM2tC,EAGFC,EAAQhE,IACRgE,GAASF,EACT1tC,GAAKq2B,IAST,MAAMwX,EAAU50B,EACV60B,EAAU70B,EAASva,KAAKqvC,IAAIH,GAAS,EACrCI,EAAQtlC,EAAS,GAAM,EACvBulC,EAAQL,EAAQ,EACR,IAAVA,EAEArtC,EAAIA,EAAE2L,IAAIsgC,EAAgBwB,EAAOP,EAAYI,KAG7C/vC,EAAIA,EAAEoO,IAAIsgC,EAAgByB,EAAOR,EAAYK,IAEpD,CAMD,MAAO,CAAEhwC,IAAGyC,IACf,EACD,UAAAkrC,CAAWh9B,EAAGy/B,EAAgBluC,EAAGmuC,GAE7B,MAAMf,EAAI3+B,EAAEo7B,cAAgB,EAE5B,IAAI6B,EAAOwC,EAAeroC,IAAI4I,GAO9B,OANKi9B,IACDA,EAAO1pC,KAAKurC,iBAAiB9+B,EAAG2+B,GACtB,IAANA,GACAc,EAAe7gC,IAAIoB,EAAG0/B,EAAUzC,KAGjC1pC,KAAKupC,KAAK6B,EAAG1B,EAAM1rC,EAC7B,EAET,CCyXiBurC,CAAK5C,EAAO7B,EAAMQ,KAAO5oC,KAAK0qB,KAAKpO,EAAQ,GAAKA,GAE7D,MAAO,CACH8rB,QACAsH,gBAAiBzF,EACjBP,yBACAL,sBACAG,qBAER,CAcO,SAASmG,GAAYC,GACxB,MAAMxH,EAdV,SAAsBtB,GAClB,MAAMvZ,EAAOsZ,GAAcC,GAU3B,OATAuB,GAAkB9a,EAAM,CACpB/sB,KAAM,OACNmuB,KAAM,WACNrH,YAAa,YACd,CACCuoB,SAAU,WACVC,cAAe,WACfC,KAAM,YAEHhvC,OAAOmd,OAAO,CAAE6xB,MAAM,KAASxiB,GAC1C,CAEkByiB,CAAaJ,IACrB9L,GAAEA,EAAIxiC,EAAG2uC,GAAgB7H,EACzB8H,EAAgBpM,EAAGmD,MAAQ,EAC3BkJ,EAAkB,EAAIrM,EAAGmD,MAAQ,EAIvC,SAASmJ,EAAK9iC,GACV,OAAOu8B,GAAQv8B,EAAG2iC,EACrB,CACD,SAASI,EAAK/iC,GACV,OAAOgjC,GAAWhjC,EAAG2iC,EACxB,CACD,MAAQP,gBAAiBzF,EAAKP,uBAAEA,EAAsBL,oBAAEA,EAAmBG,mBAAEA,GAAwBrB,GAAkB,IAChHC,EACH,OAAAtb,CAAQkc,EAAIC,EAAOsF,GACf,MAAMjhC,EAAI27B,EAAME,WACV3zB,EAAIsuB,EAAGhX,QAAQxf,EAAEkI,GACjB/J,EAAM29B,GACZ,OAAImF,EACO9iC,EAAI+M,WAAWzN,KAAK,CAACk+B,EAAMqC,WAAa,EAAO,IAAQ91B,GAGvD/J,EAAI+M,WAAWzN,KAAK,CAAC,IAAQyK,EAAGsuB,EAAGhX,QAAQxf,EAAEgE,GAE3D,EACD,SAAAq3B,CAAU3tB,GACN,MAAMoV,EAAMpV,EAAM9a,OACZs/B,EAAOxkB,EAAM,GACb7K,EAAO6K,EAAM6U,SAAS,GAE5B,GAAIO,IAAQ8f,GAA2B,IAAT1Q,GAA0B,IAATA,EAa1C,IAAIpP,IAAQ+f,GAA4B,IAAT3Q,EAAe,CAG/C,MAAO,CAAEhqB,EAFCsuB,EAAG6E,UAAUx4B,EAAK0f,SAAS,EAAGiU,EAAGmD,QAE/B31B,EADFwyB,EAAG6E,UAAUx4B,EAAK0f,SAASiU,EAAGmD,MAAO,EAAInD,EAAGmD,QAEzD,CAEG,MAAM,IAAIxvB,MAAM,mBAAmB2Y,2BAA6B8f,yBAAqCC,uBACxG,CApB8D,CAC3D,MAAM36B,EAAIo0B,GAAmBz5B,GAC7B,KA5BDunB,IADkBhjB,EA6BQc,IA5Bbd,EAAMovB,EAAGiD,OA6BjB,MAAM,IAAItvB,MAAM,yBACpB,MAAM84B,EAAKlH,EAAoB7zB,GAC/B,IAAIlE,EAAIwyB,EAAG0M,KAAKD,GAMhB,QAHiC,GAAd/Q,OAFHluB,EAAIqmB,MAASA,MAIzBrmB,EAAIwyB,EAAGiC,IAAIz0B,IACR,CAAEkE,IAAGlE,IACf,CAvCT,IAA6BoD,CAgDxB,IAEC+7B,EAAiB/7B,GAAQi1B,GAAc+G,GAAmBh8B,EAAK0zB,EAAM5B,cAC3E,SAASmK,EAAsB3lB,GAE3B,OAAOA,EADMilB,GAAetY,EAE/B,CAKD,MAAMiZ,EAAS,CAACp8B,EAAGzJ,EAAM1H,IAAOumC,GAAmBp1B,EAAEzV,MAAMgM,EAAM1H,IAIjE,MAAMwtC,EACF,WAAA1vC,CAAY6B,EAAGlD,EAAGgxC,GACdxtC,KAAKN,EAAIA,EACTM,KAAKxD,EAAIA,EACTwD,KAAKwtC,SAAWA,EAChBxtC,KAAKsnC,gBACR,CAED,kBAAOmG,CAAYh0B,GACf,MAAMnd,EAAIwoC,EAAM5B,YAEhB,OADAzpB,EAAMulB,GAAY,mBAAoBvlB,EAAS,EAAJnd,GACpC,IAAIixC,EAAUD,EAAO7zB,EAAK,EAAGnd,GAAIgxC,EAAO7zB,EAAKnd,EAAG,EAAIA,GAC9D,CAGD,cAAOoxC,CAAQj0B,GACX,MAAM/Z,EAAEA,EAAClD,EAAEA,GAAM2nC,GAAIG,MAAMtF,GAAY,MAAOvlB,IAC9C,OAAO,IAAI8zB,EAAU7tC,EAAGlD,EAC3B,CACD,cAAA8qC,GAEI,IAAKpB,EAAmBlmC,KAAKN,GACzB,MAAM,IAAIyU,MAAM,6BACpB,IAAK+xB,EAAmBlmC,KAAKxD,GACzB,MAAM,IAAI2X,MAAM,4BACvB,CACD,cAAAw5B,CAAeH,GACX,OAAO,IAAID,EAAUvtC,KAAKN,EAAGM,KAAKxD,EAAGgxC,EACxC,CACD,gBAAAI,CAAiBC,GACb,MAAMnuC,EAAEA,EAAClD,EAAEA,EAAGgxC,SAAUM,GAAQ9tC,KAC1BkN,EAAIs/B,EAAcxN,GAAY,UAAW6O,IAC/C,GAAW,MAAPC,IAAgB,CAAC,EAAG,EAAG,EAAG,GAAGjmB,SAASimB,GACtC,MAAM,IAAI35B,MAAM,uBACpB,MAAM45B,EAAe,IAARD,GAAqB,IAARA,EAAYpuC,EAAIolC,EAAM9mC,EAAI0B,EACpD,GAAIquC,GAAQvN,EAAGiD,MACX,MAAM,IAAItvB,MAAM,8BACpB,MAAMxD,EAAgB,EAANm9B,EAAwB,KAAP,KAC3BpyC,EAAIirC,EAAMU,QAAQ12B,EAASw8B,EAAcY,IACzCC,EAAKjB,EAAKgB,GACVE,EAAKnB,GAAM5/B,EAAI8gC,GACfE,EAAKpB,EAAKtwC,EAAIwxC,GACd1L,EAAIqE,EAAMc,KAAKgD,qBAAqB/uC,EAAGuyC,EAAIC,GACjD,IAAK5L,EACD,MAAM,IAAInuB,MAAM,qBAEpB,OADAmuB,EAAEgF,iBACKhF,CACV,CAED,QAAA6L,GACI,OAAOd,EAAsBrtC,KAAKxD,EACrC,CACD,UAAA4xC,GACI,OAAOpuC,KAAKmuC,WAAa,IAAIZ,EAAUvtC,KAAKN,EAAGotC,GAAM9sC,KAAKxD,GAAIwD,KAAKwtC,UAAYxtC,IAClF,CAED,aAAAquC,GACI,OAAOC,GAActuC,KAAKuuC,WAC7B,CACD,QAAAA,GACI,OAAOpK,GAAIM,WAAW,CAAE/kC,EAAGM,KAAKN,EAAGlD,EAAGwD,KAAKxD,GAC9C,CAED,iBAAAgyC,GACI,OAAOF,GAActuC,KAAKyuC,eAC7B,CACD,YAAAA,GACI,OAAOtB,EAAcntC,KAAKN,GAAKytC,EAAcntC,KAAKxD,EACrD,EAEL,MAAMkyC,EAAQ,CACV,iBAAAC,CAAkBnH,GACd,IAEI,OADApB,EAAuBoB,IAChB,CACV,CACD,MAAOtzB,GACH,OAAO,CACV,CACJ,EACDkyB,uBAAwBA,EAKxBwI,iBAAkB,KACd,MAAMhyC,EAASiyC,GAAqB/J,EAAM9mC,GAC1C,OFhSL,SAAwBqH,EAAK+9B,EAAYvW,GAAO,GACnD,MAAMC,EAAMznB,EAAIzI,OACVkyC,EAAW3L,GAAoBC,GAC/B2L,EAASzL,GAAiBF,GAEhC,GAAItW,EAAM,IAAMA,EAAMiiB,GAAUjiB,EAAM,KAClC,MAAM,IAAI3Y,MAAM,YAAY46B,8BAAmCjiB,KACnE,MAEMkiB,EAAUrzC,GAFJkxB,EAAO+R,GAAgBv5B,GAAOw5B,GAAgBx5B,GAEjC+9B,EAAa/O,IAAOA,GAC7C,OAAOxH,EAAOkS,GAAgBiQ,EAASF,GAAYhQ,GAAgBkQ,EAASF,EAChF,CEqRmBG,CAAmBnK,EAAM9gB,YAAYpnB,GAASkoC,EAAM9mC,EAAE,EAUjEkxC,WAAU,CAACtH,EAAa,EAAGjC,EAAQgB,EAAMc,QACrC9B,EAAMgC,eAAeC,GACrBjC,EAAM+B,SAASryB,OAAO,IACfswB,IAef,SAASwJ,EAAU7jC,GACf,MAAMkI,EAAMlI,aAAgB4J,WACtB6F,EAAsB,iBAATzP,EACbwhB,GAAOtZ,GAAOuH,IAAQzP,EAAK1O,OACjC,OAAI4W,EACOsZ,IAAQ8f,GAAiB9f,IAAQ+f,EACxC9xB,EACO+R,IAAQ,EAAI8f,GAAiB9f,IAAQ,EAAI+f,EAChDvhC,aAAgBq7B,CAGvB,CAuBD,MAAM4F,EAAWzH,EAAMyH,UACnB,SAAU70B,GAGN,MAAMtG,EAAMk1B,GAAmB5uB,GACzB03B,EAAuB,EAAf13B,EAAM9a,OAAakoC,EAAM9B,WACvC,OAAOoM,EAAQ,EAAIh+B,GAAOiE,OAAO+5B,GAASh+B,CACtD,EACUo7B,EAAgB1H,EAAM0H,eACxB,SAAU90B,GACN,OAAOo1B,EAAKP,EAAS70B,GACjC,EAEU23B,EAAaC,GAAWxK,EAAM9B,YAIpC,SAASuM,EAAWn+B,GAChB,GAAmB,iBAARA,EACP,MAAM,IAAI+C,MAAM,mBACpB,KAAMigB,IAAOhjB,GAAOA,EAAMi+B,GACtB,MAAM,IAAIl7B,MAAM,uBAAuB2wB,EAAM9B,cAEjD,OAAOoK,GAAmBh8B,EAAK0zB,EAAM5B,YACxC,CAMD,SAASsM,EAAQ3B,EAASrG,EAAYvd,EAAOwlB,GACzC,GAAI,CAAC,YAAa,aAAaC,MAAMzxC,GAAMA,KAAKgsB,IAC5C,MAAM,IAAI9V,MAAM,uCACpB,MAAMjX,KAAEA,EAAI8mB,YAAEA,GAAgB8gB,EAC9B,IAAI2H,KAAEA,EAAIkD,QAAEA,EAASC,aAAcC,GAAQ5lB,EAC/B,MAARwiB,IACAA,GAAO,GACXoB,EAAU7O,GAAY,UAAW6O,GAC7B8B,IACA9B,EAAU7O,GAAY,oBAAqB9hC,EAAK2wC,KAIpD,MAAMiC,EAAQtD,EAAcqB,GACtBvjC,EAAI87B,EAAuBoB,GAC3BuI,EAAW,CAACR,EAAWjlC,GAAIilC,EAAWO,IAE5C,GAAW,MAAPD,EAAa,CAEb,MAAMlxC,GAAY,IAARkxC,EAAe7rB,EAAYwc,EAAGmD,OAASkM,EACjDE,EAAS3xC,KAAK4gC,GAAY,eAAgBrgC,GAC7C,CACD,MAAMohC,EAAO+F,MAAkBiK,GACzBrjC,EAAIojC,EA0BV,MAAO,CAAE/P,OAAMiQ,MAxBf,SAAeC,GAEX,MAAMhyC,EAAIsuC,EAAS0D,GACnB,IAAK/J,EAAmBjoC,GACpB,OACJ,MAAMiyC,EAAKnD,EAAK9uC,GACVY,EAAI8nC,EAAMc,KAAKC,SAASzpC,GAAG4nC,WAC3BnmC,EAAIotC,EAAKjuC,EAAEqT,GACjB,GAAIxS,IAAM00B,GACN,OAIJ,MAAM53B,EAAIswC,EAAKoD,EAAKpD,EAAKpgC,EAAIhN,EAAI4K,IACjC,GAAI9N,IAAM43B,GACN,OACJ,IAAIoZ,GAAY3uC,EAAEqT,IAAMxS,EAAI,EAAI,GAAKyZ,OAAOta,EAAEmP,EAAIqmB,IAC9C8b,EAAQ3zC,EAKZ,OAJIiwC,GAAQY,EAAsB7wC,KAC9B2zC,EAvOZ,SAAoB3zC,GAChB,OAAO6wC,EAAsB7wC,GAAKswC,GAAMtwC,GAAKA,CAChD,CAqOmB4xC,CAAW5xC,GACnBgxC,GAAY,GAET,IAAID,EAAU7tC,EAAGywC,EAAO3C,EAClC,EAEJ,CACD,MAAMiC,EAAiB,CAAEhD,KAAM3H,EAAM2H,KAAMkD,SAAS,GAC9CS,EAAiB,CAAE3D,KAAM3H,EAAM2H,KAAMkD,SAAS,GAuFpD,OAlEAhJ,EAAMc,KAAKE,eAAe,GAkEnB,CACH7C,QACAuL,aAnNJ,SAAsB7I,EAAYyD,GAAe,GAC7C,OAAOtE,EAAMY,eAAeC,GAAYwD,WAAWC,EACtD,EAkNGqF,gBAxLJ,SAAyBC,EAAUC,EAASvF,GAAe,GACvD,GAAIkE,EAAUoB,GACV,MAAM,IAAIp8B,MAAM,iCACpB,IAAKg7B,EAAUqB,GACX,MAAM,IAAIr8B,MAAM,iCAEpB,OADUwyB,EAAMU,QAAQmJ,GACf9I,SAAStB,EAAuBmK,IAAWvF,WAAWC,EAClE,EAkLGwF,KA7EJ,SAAc5C,EAAS6C,EAASzmB,EAAOwlB,GACnC,MAAM1P,KAAEA,EAAIiQ,MAAEA,GAAUR,EAAQ3B,EAAS6C,EAASzmB,GAC5CzkB,EAAIs/B,EAEV,OADa6L,GAAkBnrC,EAAEtI,KAAK4qB,UAAWtiB,EAAE09B,YAAa19B,EAAE6lB,KAC3DulB,CAAK7Q,EAAMiQ,EACrB,EAyEGa,OAxDJ,SAAgBC,EAAWjD,EAASkD,EAAW9mB,EAAOmmB,GAClD,MAAMY,EAAKF,EAGX,GAFAjD,EAAU7O,GAAY,UAAW6O,GACjCkD,EAAY/R,GAAY,YAAa+R,GACjC,WAAY9mB,EACZ,MAAM,IAAI9V,MAAM,sCACpB,MAAMs4B,KAAEA,EAAIkD,QAAEA,GAAY1lB,EAC1B,IAAIgnB,EACAxkC,EACJ,IACI,GAAkB,iBAAPukC,GAAmBA,aAAc97B,WAGxC,IACI+7B,EAAO1D,EAAUG,QAAQsD,EAC5B,CACD,MAAOE,GACH,KAAMA,aAAoB/M,GAAIC,KAC1B,MAAM8M,EACVD,EAAO1D,EAAUE,YAAYuD,EAChC,KAEA,IAAkB,iBAAPA,GAAmC,iBAATA,EAAGtxC,GAAkC,iBAATsxC,EAAGx0C,EAKrE,MAAM,IAAI2X,MAAM,SALqE,CACrF,MAAMzU,EAAEA,EAAClD,EAAEA,GAAMw0C,EACjBC,EAAO,IAAI1D,EAAU7tC,EAAGlD,EAC3B,CAGA,CACDiQ,EAAIk6B,EAAMU,QAAQ0J,EACrB,CACD,MAAO78B,GACH,GAAsB,UAAlBA,EAAMuB,QACN,MAAM,IAAItB,MAAM,kEACpB,OAAO,CACV,CACD,GAAIs4B,GAAQwE,EAAK9C,WACb,OAAO,EACPwB,IACA9B,EAAU/I,EAAM5nC,KAAK2wC,IACzB,MAAMnuC,EAAEA,EAAClD,EAAEA,GAAMy0C,EACX/jC,EAAIs/B,EAAcqB,GAClB7sC,EAAK+rC,EAAKvwC,GACVyxC,EAAKnB,EAAK5/B,EAAIlM,GACdktC,EAAKpB,EAAKptC,EAAIsB,GACdtF,EAAIirC,EAAMc,KAAKgD,qBAAqBh+B,EAAGwhC,EAAIC,IAAKrI,WACtD,QAAKnqC,GAEKoxC,EAAKpxC,EAAEwW,KACJxS,CAChB,EAOG0sC,gBAAiBzF,EACjB4G,YACAmB,QAER;sEC/5BO,SAASyC,GAAQj0C,GACpB,MAAO,CACHA,OACAmuB,KAAM,CAAChmB,KAAQ+rC,IAAS/lB,GAAKnuB,EAAMmI,EtBuFpC,YAAwB+5B,GAC3B,MAAM1/B,EAAI,IAAIwV,WAAWkqB,EAAO3qB,QAAO,CAAC4qB,EAAKr1B,IAAMq1B,EAAMr1B,EAAEpN,QAAQ,IACnE,IAAIiuB,EAAM,EAOV,OANAuU,EAAO93B,SAAS0C,IACZ,IAAKwe,GAAIxe,GACL,MAAM,IAAImK,MAAM,uBACpBzU,EAAE2L,IAAIrB,EAAG6gB,GACTA,GAAO7gB,EAAEpN,MAAM,IAEZ8C,CACX,CsBjGgDy/B,IAAeiS,IAC/DptB,YAAQA,GAER,CDoFgF3O,OAAO;;AEvFvF,MAAMg8B,GAAah8B,OAAO,sEACpBi8B,GAAaj8B,OAAO,sEACpBgf,GAAMhf,OAAO,GACbif,GAAMjf,OAAO,GACbk8B,GAAa,CAACvnC,EAAGkH,KAAOlH,EAAIkH,EAAIojB,IAAOpjB,EA6B7C,MAAMsvB,GJyPC,SAAeiD,EAAO+N,EAAQ3kB,GAAO,EAAO4kB,EAAQ,IACvD,GAAIhO,GAASrP,GACT,MAAM,IAAIjgB,MAAM,iCAAiCsvB,KACrD,MAAQT,WAAYY,EAAMV,YAAaS,GAAUZ,GAAQU,EAAO+N,GAChE,GAAI7N,EAAQ,KACR,MAAM,IAAIxvB,MAAM,mDACpB,MAAMu9B,EAAQ9P,GAAO6B,GACfllC,EAAId,OAAOmd,OAAO,CACpB6oB,QACAG,OACAD,QACAD,KAAMpE,GAAQsE,GACdlB,KAAMtO,GACNgO,IAAK/N,GACL/xB,OAAS8O,GAAQzV,GAAIyV,EAAKqyB,GAC1BhD,QAAUrvB,IACN,GAAmB,iBAARA,EACP,MAAM,IAAI+C,MAAM,sDAAsD/C,GAC1E,OAAOgjB,IAAOhjB,GAAOA,EAAMqyB,CAAK,EAEpCuD,IAAM51B,GAAQA,IAAQgjB,GACtB6T,MAAQ72B,IAASA,EAAMijB,MAASA,GAChCoO,IAAMrxB,GAAQzV,IAAKyV,EAAKqyB,GACxB3B,IAAK,CAAC6P,EAAKC,IAAQD,IAAQC,EAC3B7P,IAAM3wB,GAAQzV,GAAIyV,EAAMA,EAAKqyB,GAC7Bv5B,IAAK,CAACynC,EAAKC,IAAQj2C,GAAIg2C,EAAMC,EAAKnO,GAClC36B,IAAK,CAAC6oC,EAAKC,IAAQj2C,GAAIg2C,EAAMC,EAAKnO,GAClCvB,IAAK,CAACyP,EAAKC,IAAQj2C,GAAIg2C,EAAMC,EAAKnO,GAClC/hB,IAAK,CAACtQ,EAAKowB,IArGZ,SAAejjC,EAAG6S,EAAKowB,GAG1B,GAAIA,EAAQpN,GACR,MAAM,IAAIjgB,MAAM,sBACpB,GAAIqtB,IAAUpN,GACV,OAAO71B,EAAE6jC,IACb,GAAIZ,IAAUnN,GACV,OAAOjjB,EACX,IAAItV,EAAIyC,EAAE6jC,IACN93B,EAAI8G,EACR,KAAOowB,EAAQpN,IACPoN,EAAQnN,KACRv4B,EAAIyC,EAAE2jC,IAAIpmC,EAAGwO,IACjBA,EAAI/L,EAAEwjC,IAAIz3B,GACVk3B,IAAUnN,GAEd,OAAOv4B,CACX,CAmF6B+1C,CAAMtzC,EAAG6S,EAAKowB,GACnCsQ,IAAK,CAACH,EAAKC,IAAQj2C,GAAIg2C,EAAMhQ,GAAOiQ,EAAKnO,GAAQA,GAEjDsO,KAAO3gC,GAAQA,EAAMA,EACrB4gC,KAAM,CAACL,EAAKC,IAAQD,EAAMC,EAC1BK,KAAM,CAACN,EAAKC,IAAQD,EAAMC,EAC1BM,KAAM,CAACP,EAAKC,IAAQD,EAAMC,EAC1BjH,IAAMv5B,GAAQuwB,GAAOvwB,EAAKqyB,GAC1ByJ,KAAMuE,EAAMvE,MAAS,CAAClvC,GAAM0zC,EAAMnzC,EAAGP,IACrCopC,YAActY,GAvFf,SAAuBvwB,EAAG4zC,GAC7B,MAAMn1C,EAAM,IAAIqK,MAAM8qC,EAAKv1C,QAErBw1C,EAAiBD,EAAK19B,QAAO,CAAC49B,EAAKjhC,EAAKjU,IACtCoB,EAAEyoC,IAAI51B,GACCihC,GACXr1C,EAAIG,GAAKk1C,EACF9zC,EAAE2jC,IAAImQ,EAAKjhC,KACnB7S,EAAE6jC,KAECkQ,EAAW/zC,EAAEosC,IAAIyH,GAQvB,OANAD,EAAKI,aAAY,CAACF,EAAKjhC,EAAKjU,IACpBoB,EAAEyoC,IAAI51B,GACCihC,GACXr1C,EAAIG,GAAKoB,EAAE2jC,IAAImQ,EAAKr1C,EAAIG,IACjBoB,EAAE2jC,IAAImQ,EAAKjhC,KACnBkhC,GACIt1C,CACX,CAoE8Bw1C,CAAcj0C,EAAGuwB,GAGvC2jB,KAAM,CAACzoC,EAAGkH,EAAG3U,IAAOA,EAAI2U,EAAIlH,EAC5Bwf,QAAUpY,GAASyb,EAAOkS,GAAgB3tB,EAAKuyB,GAAS7E,GAAgB1tB,EAAKuyB,GAC7E0B,UAAY3tB,IACR,GAAIA,EAAM9a,SAAW+mC,EACjB,MAAM,IAAIxvB,MAAM,0BAA0BwvB,UAAcjsB,EAAM9a,UAClE,OAAOiwB,EAAOgS,GAAgBnnB,GAASknB,GAAgBlnB,EAAM,IAGrE,OAAOja,OAAOmd,OAAOrc,EACzB,CI1SWm0C,CAAMrB,QAAYv0B,OAAWA,EAAW,CAAEowB,KAxBrD,SAAiBl/B,GACb,MAAMvB,EAAI4kC,GAEJjQ,EAAM/rB,OAAO,GAAIs9B,EAAMt9B,OAAO,GAAIu9B,EAAOv9B,OAAO,IAAKw9B,EAAOx9B,OAAO,IAEnEy9B,EAAOz9B,OAAO,IAAK09B,EAAO19B,OAAO,IAAK29B,EAAO39B,OAAO,IACpD8rB,EAAMnzB,EAAIA,EAAIA,EAAKvB,EACnBo8B,EAAM1H,EAAKA,EAAKnzB,EAAKvB,EACrBwmC,EAAMvR,GAAKmH,EAAIzH,EAAK30B,GAAKo8B,EAAMp8B,EAC/BymC,EAAMxR,GAAKuR,EAAI7R,EAAK30B,GAAKo8B,EAAMp8B,EAC/B0mC,EAAOzR,GAAKwR,EAAI5e,GAAK7nB,GAAK00B,EAAM10B,EAChC2mC,EAAO1R,GAAKyR,EAAKP,EAAMnmC,GAAK0mC,EAAO1mC,EACnC4mC,EAAO3R,GAAK0R,EAAKP,EAAMpmC,GAAK2mC,EAAO3mC,EACnC6mC,EAAO5R,GAAK2R,EAAKN,EAAMtmC,GAAK4mC,EAAO5mC,EACnC8mC,EAAQ7R,GAAK4R,EAAKN,EAAMvmC,GAAK6mC,EAAO7mC,EACpC+mC,EAAQ9R,GAAK6R,EAAMR,EAAMtmC,GAAK4mC,EAAO5mC,EACrCgnC,EAAQ/R,GAAK8R,EAAMpS,EAAK30B,GAAKo8B,EAAMp8B,EACnCy8B,EAAMxH,GAAK+R,EAAMX,EAAMrmC,GAAK2mC,EAAO3mC,EACnCk2B,EAAMjB,GAAKwH,EAAIyJ,EAAKlmC,GAAK00B,EAAM10B,EAC/BnJ,EAAOo+B,GAAKiB,EAAIrO,GAAK7nB,GAC3B,IAAK+zB,GAAGsB,IAAItB,GAAGuB,IAAIz+B,GAAO0K,GACtB,MAAM,IAAImG,MAAM,2BACpB,OAAO7Q,CACX,IAEaowC,GD9BN,SAAqBpH,EAAUqH,GAClC,MAAMrxC,EAAUpF,GAASmvC,GAAY,IAAKC,KAAa6E,GAAQj0C,KAC/D,OAAOO,OAAOmd,OAAO,IAAKtY,EAAOqxC,GAAUrxC,UAC/C,CC2ByBsxC,CAAY,CACjC5pC,EAAGqL,OAAO,GACVnE,EAAGmE,OAAO,GACVmrB,MACAxiC,EAAGszC,GAEHxN,GAAIzuB,OAAO,iFACX0uB,GAAI1uB,OAAO,iFACXnI,EAAGmI,OAAO,GACVo3B,MAAM,EAONnH,KAAM,CACFC,KAAMlwB,OAAO,sEACbmwB,YAAcvnC,IACV,MAAMD,EAAIszC,GACJuC,EAAKx+B,OAAO,sCACZ6rB,GAAM7M,GAAMhf,OAAO,sCACnBy+B,EAAKz+B,OAAO,uCACZ8rB,EAAK0S,EACLE,EAAY1+B,OAAO,uCACnB2sB,EAAKuP,GAAWpQ,EAAKljC,EAAGD,GACxBgd,EAAKu2B,IAAYrQ,EAAKjjC,EAAGD,GAC/B,IAAI+rC,EAAKpuC,GAAIsC,EAAI+jC,EAAK6R,EAAK74B,EAAK84B,EAAI91C,GAChCisC,EAAKtuC,IAAKqmC,EAAKd,EAAKlmB,EAAKmmB,EAAInjC,GACjC,MAAM8rC,EAAQC,EAAKgK,EACb/J,EAAQC,EAAK8J,EAKnB,GAJIjK,IACAC,EAAK/rC,EAAI+rC,GACTC,IACAC,EAAKjsC,EAAIisC,GACTF,EAAKgK,GAAa9J,EAAK8J,EACvB,MAAM,IAAI5/B,MAAM,uCAAyClW,GAE7D,MAAO,CAAE6rC,QAAOC,KAAIC,QAAOC,KAAI,IAGxCvb,IAGSrZ,OAAO,GAmBLq+B,GAAUtH,gBCpGjB,MAAM4H,GAAc,6CCAdC,GAAW,qECFlB77B,GAAO/C,OAAO,GACdgD,GAAOhD,OAAO,GACd6+B,GAAO7+B,OAAO,GACd8+B,GAAQ9+B,OAAO,IACf++B,GAAQ/+B,OAAO,IACfg/B,GAAQh/B,OAAO,IACf+O,GAAS,CAAA,EACf,SAASkwB,GAAUxgC,GACf,OAAOqE,EAAaqB,EAAU1F,GAAQ,GAC1C,CAOO,MAAMy5B,GACT7tC,GACAlD,GACAiE,GACA8zC,GAOA,KAAI70C,GAAM,OAAOM,MAAKN,CAAK,CAC3B,KAAIA,CAAEoU,GACFmC,EAAqC,KAAtB2B,EAAW9D,GAAe,YAAa,QAASA,GAC/D9T,MAAKN,EAAK+X,EAAQ3D,EACrB,CAID,KAAItX,GAAM,OAAOwD,MAAKxD,CAAK,CAC3B,KAAIA,CAAEgc,GACFvC,EAAsC,KAAvB2B,EAAWY,GAAgB,YAAa,QAASA,GAChE,MAAM1E,EAAQ2D,EAAQe,GACtBvC,EAAeiB,SAASpD,EAAMqD,UAAU,EAAG,IAAM,EAAG,kBAAmB,QAASrD,GAChF9T,MAAKxD,EAAKsX,CACb,CAWD,KAAIrT,GAAM,OAAOT,MAAKS,CAAK,CAC3B,KAAIA,CAAEqT,GACF,MAAMrT,EAAImY,EAAU9E,EAAO,SAC3BmC,EAAqB,KAANxV,GAAkB,KAANA,EAAU,YAAa,IAAKqT,GACvD9T,MAAKS,EAAKA,CACb,CAKD,YAAI8zC,GAAa,OAAOv0C,MAAKu0C,CAAY,CAKzC,iBAAIC,GACA,MAAM/zC,EAAIT,KAAKu0C,SACf,OAAS,MAAL9zC,EACO,KAEJ8sC,GAAUkH,WAAWh0C,EAC/B,CAMD,WAAIi0C,GACA,OAAmB,KAAX10C,KAAKS,EAAY,EAAI,CAChC,CAKD,eAAIk0C,GAEA,MAAMA,EAAcv9B,EAASpX,KAAKxD,GAIlC,OAHIwD,KAAK00C,UACLC,EAAY,IAAM,KAEfl9B,EAAQk9B,EAClB,CAID,qBAAIC,GACA,OAAOlhC,EAAO,CAAC1T,KAAKN,EAAGM,KAAK20C,aAC/B,CAID,cAAIE,GACA,OAAOnhC,EAAO,CAAC1T,KAAKN,EAAGM,KAAKxD,EAAIwD,KAAK00C,QAAU,OAAS,QAC3D,CAID,WAAA72C,CAAYgZ,EAAOnX,EAAGlD,EAAGiE,GACrBkW,EAAcE,EAAOuN,GAAQ,aAC7BpkB,MAAKN,EAAKA,EACVM,MAAKxD,EAAKA,EACVwD,MAAKS,EAAKA,EACVT,MAAKu0C,EAAY,IACpB,CACD,CAACx0B,OAAO+0B,IAAI,iCACR,MAAO,mBAAmB90C,KAAKN,WAAWM,KAAKxD,gBAAgBwD,KAAK00C,sBAAsB10C,KAAKu0C,YAClG,CAID,KAAArzB,GACI,MAAMA,EAAQ,IAAIqsB,GAAUnpB,GAAQpkB,KAAKN,EAAGM,KAAKxD,EAAGwD,KAAKS,GAIzD,OAHIT,KAAKu0C,WACLrzB,GAAMqzB,EAAYv0C,KAAKu0C,UAEpBrzB,CACV,CAID,MAAAze,GACI,MAAM8xC,EAAWv0C,KAAKu0C,SACtB,MAAO,CACHQ,MAAO,YACPR,SAAwB,MAAZA,EAAoBA,EAASv4C,WAAa,KACtD0D,EAAGM,KAAKN,EAAGlD,EAAGwD,KAAKxD,EAAGiE,EAAGT,KAAKS,EAErC,CAWD,iBAAOg0C,CAAWh0C,GACd,MAAMu0C,EAAKt8B,EAAUjY,EAAG,KAExB,OAAKu0C,GAAMb,IAAWa,GAAMZ,GACjBh8B,IAGXnC,EAAe++B,GAAMX,GAAO,oBAAqB,IAAK5zC,IAC9Cu0C,EAAKX,IAASH,GACzB,CAeD,kBAAOe,CAAYC,EAASz0C,GACxB,OAAQiY,EAAUw8B,GAAWhB,GAAQ7+B,OAAO,GAAK5U,EAAI,GACxD,CAsBD,qBAAO00C,CAAe10C,GAClB,MAAMu0C,EAAKt8B,EAAUjY,GACrB,OAAIu0C,IAAO58B,IAAQ48B,IAAOb,GACf,GAEPa,IAAO38B,IAAQ28B,IAAOZ,GACf,IAEXn+B,EAAe++B,GAAMX,GAAO,YAAa,IAAK5zC,GAEtCu0C,EAAK38B,GAAQ,GAAK,GAC7B,CASD,WAAO5Q,CAAKi9B,GACR,SAAS0Q,EAAY73C,EAAOkY,GACxBQ,EAAe1Y,EAAOkY,EAAS,YAAaivB,EAC/C,CAED,GAAW,MAAPA,EACA,OAAO,IAAI6I,GAAUnpB,GAAQ6vB,GAAUA,GAAU,IAErD,GAAqB,iBAAT,EAAmB,CAC3B,MAAMv8B,EAAQN,EAASstB,EAAK,aAC5B,GAAqB,KAAjBhtB,EAAM9a,OAAe,CACrB,MAAM8C,EAAI+X,EAAQC,EAAMjc,MAAM,EAAG,KAC3Be,EAAIkb,EAAMjc,MAAM,GAAI,IACpBgF,EAAY,IAAPjE,EAAE,GAAa,GAAK,GAE/B,OADAA,EAAE,IAAM,IACD,IAAI+wC,GAAUnpB,GAAQ1kB,EAAG+X,EAAQjb,GAAIiE,EAC/C,CACD,GAAqB,KAAjBiX,EAAM9a,OAAe,CACrB,MAAM8C,EAAI+X,EAAQC,EAAMjc,MAAM,EAAG,KAC3Be,EAAIkb,EAAMjc,MAAM,GAAI,IAC1B25C,IAAoB,IAAP54C,EAAE,IAAkB,mBACjC,MAAMiE,EAAI8sC,GAAU4H,eAAez9B,EAAM,KACzC,OAAO,IAAI61B,GAAUnpB,GAAQ1kB,EAAG+X,EAAQjb,GAAIiE,EAC/C,CACD20C,GAAY,EAAO,+BACtB,CACD,GAAI1Q,aAAe6I,GACf,OAAO7I,EAAIxjB,QAGf,MAAMm0B,EAAK3Q,EAAIhlC,EACf01C,EAAkB,MAANC,EAAY,aACxB,MAAM31C,EAAI40C,GAAUe,GAEd74C,EAAI,SAAWA,EAAGm4C,GACpB,GAAS,MAALn4C,EACA,OAAO83C,GAAU93C,GAErB,GAAmB,MAAfm4C,EAAqB,CACrBS,EAAY99B,EAAYq9B,EAAa,IAAK,uBAC1C,MAAMj9B,EAAQN,EAASu9B,GAEvB,OADAj9B,EAAM,IAAM,IACLD,EAAQC,EAClB,CACD09B,GAAY,EAAO,YACtB,CAXS,CAWP1Q,EAAIloC,EAAGkoC,EAAIiQ,aACdS,IAA8B,IAAjBh+B,EAAS5a,GAAG,IAAiB,mBAE1C,MAAM+3C,SAAEA,EAAQ9zC,EAAEA,GAAM,SAAW60C,EAAIX,EAAaD,GAChD,GAAU,MAANY,EAAY,CACZ,MAAM70C,EAAIiY,EAAU48B,GACpB,MAAO,CACHf,SAAY9zC,GAAK4zC,GAAS5zC,OAAIqc,EAC9Brc,EAAG8sC,GAAU4H,eAAe10C,GAEnC,CACD,GAAmB,MAAfk0C,EAEA,OADAS,EAAY99B,EAAYq9B,EAAa,IAAK,uBACnC,CAAEl0C,EAAgC,IAA3B2W,EAASu9B,GAAa,GAAa,GAAK,IAE1D,GAAe,MAAXD,EAAiB,CACjB,OAAQ97B,EAAU87B,EAAS,gBACvB,KAAK,EAAG,MAAO,CAAEj0C,EAAG,IACpB,KAAK,EAAG,MAAO,CAAEA,EAAG,IAExB20C,GAAY,EAAO,kBACtB,CACDA,GAAY,EAAO,YACtB,CApBuB,CAoBrB1Q,EAAIjkC,EAAGikC,EAAIiQ,YAAajQ,EAAIgQ,SACzBt/B,EAAS,IAAIm4B,GAAUnpB,GAAQ1kB,EAAGlD,EAAGiE,GAO3C,OANI8zC,IACAn/B,GAAOm/B,EAAYA,GAGvBa,EAA2B,MAAf1Q,EAAIgQ,SAAmB97B,EAAU8rB,EAAIgQ,QAAS,iBAAmBt/B,EAAOs/B,QAAS,oBAC7FU,EAA+B,MAAnB1Q,EAAIiQ,aAAuBjQ,EAAIiQ,cAAgBv/B,EAAOu/B,YAAa,wBACxEv/B,CACV,EC9RE,MAAMmgC,GACT/N,GAIA,WAAA3pC,CAAY2pC,GACRvxB,EAA0C,KAA3B2B,EAAW4vB,GAAoB,sBAAuB,aAAc,cACnFxnC,MAAKwnC,EAAc/vB,EAAQ+vB,EAC9B,CAID,cAAIA,GAAe,OAAOxnC,MAAKwnC,CAAc,CAO7C,aAAIuJ,GAAc,OAAOwE,GAAWC,iBAAiBx1C,MAAKwnC,EAAe,CAQzE,uBAAIiO,GAAwB,OAAOF,GAAWC,iBAAiBx1C,MAAKwnC,GAAa,EAAQ,CAIzF,IAAAiJ,CAAKnmB,GACDrU,EAAsC,KAAvB2B,EAAW0S,GAAgB,wBAAyB,SAAUA,GAC7E,MAAMoa,EAAMgP,GAAUjD,KAAKp5B,EAAaiT,GAASjT,EAAarX,MAAKwnC,GAAc,CAC7EiF,MAAM,IAEV,OAAOc,GAAU9lC,KAAK,CAClB/H,EAAG6Z,EAAQmrB,EAAIhlC,EAAG,IAClBlD,EAAG+c,EAAQmrB,EAAIloC,EAAG,IAClBiE,EAAIikC,EAAI8I,SAAW,GAAO,IAEjC,CAuBD,mBAAAkI,CAAoBhP,GAChB,MAAMiP,EAASJ,GAAWC,iBAAiB9O,GAC3C,OAAOjvB,EAAQi8B,GAAUpD,gBAAgBj5B,EAAarX,MAAKwnC,GAAcpwB,EAASu+B,IAAS,GAC9F,CA0BD,uBAAOH,CAAiBnwC,EAAKuwC,GACzB,IAAIl+B,EAAQN,EAAS/R,EAAK,OAE1B,GAAqB,KAAjBqS,EAAM9a,OAAe,CAErB,OAAO6a,EADQi8B,GAAUrD,aAAa34B,IAASk+B,GAElD,CAED,GAAqB,KAAjBl+B,EAAM9a,OAAe,CACrB,MAAMi5C,EAAM,IAAI3gC,WAAW,IAC3B2gC,EAAI,GAAK,EACTA,EAAIxqC,IAAIqM,EAAO,GACfA,EAAQm+B,CACX,CAED,OAAOp+B,EADOi8B,GAAUtH,gBAAgB/E,QAAQ3vB,GAC3BszB,WAAW4K,GACnC,CAmBD,uBAAOhI,CAAiBtjB,EAAQwmB,GAC5B76B,EAAsC,KAAvB2B,EAAW0S,GAAgB,wBAAyB,SAAUA,GAC7E,MAAMoa,EAAM6I,GAAU9lC,KAAKqpC,GAC3B,IAAIgF,EAAUpC,GAAUnG,UAAUE,YAAYp2B,EAAa3D,EAAO,CAACgxB,EAAIhlC,EAAGglC,EAAIloC,MAC9Es5C,EAAUA,EAAQnI,eAAejJ,EAAIgQ,SACrC,MAAMiB,EAASG,EAAQlI,iBAAiBv2B,EAAaiT,IAErD,OADArU,EAAyB,MAAV0/B,EAAgB,+BAAgC,YAAa7E,GACrE,KAAO6E,EAAOzK,OAAM,EAC9B,CAWD,gBAAO6K,CAAUC,EAAIC,EAAIL,GACrB,MAAMM,EAAOxC,GAAUtH,gBAAgB/E,QAAQkO,GAAWC,iBAAiBQ,GAAI7+B,UAAU,IACnFg/B,EAAOzC,GAAUtH,gBAAgB/E,QAAQkO,GAAWC,iBAAiBS,GAAI9+B,UAAU,IACzF,MAAO,KAAO++B,EAAKhsC,IAAIisC,GAAMjL,QAAQ0K,EACxC,ECjKL,MAAMx9B,GAAO/C,OAAO,GACd+gC,GAAQ/gC,OAAO,IACrB,SAASghC,GAAmBC,GAKxB,MAAMC,GADND,EAAUA,EAAQr6B,eACI9E,UAAU,GAAGpb,MAAM,IACnCy6C,EAAW,IAAIthC,WAAW,IAChC,IAAK,IAAI/X,EAAI,EAAGA,EAAI,GAAIA,IACpBq5C,EAASr5C,GAAKo5C,EAAMp5C,GAAGC,WAAW,GAEtC,MAAMq5C,EAASr/B,EAASqf,GAAU+f,IAClC,IAAK,IAAIr5C,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACpBs5C,EAAOt5C,GAAK,IAAM,GAAM,IACzBo5C,EAAMp5C,GAAKo5C,EAAMp5C,GAAGoiB,gBAEF,GAAjBk3B,EAAOt5C,GAAK,KAAc,IAC3Bo5C,EAAMp5C,EAAI,GAAKo5C,EAAMp5C,EAAI,GAAGoiB,eAGpC,MAAO,KAAOg3B,EAAM1uC,KAAK,GAC7B,CAGA,MAAM6uC,GAAa,CAAA,EACnB,IAAK,IAAIv5C,EAAI,EAAGA,EAAI,GAAIA,IACpBu5C,GAAWt6C,OAAOe,IAAMf,OAAOe,GAEnC,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpBu5C,GAAWt6C,OAAOoa,aAAa,GAAKrZ,IAAMf,OAAO,GAAKe,GAqB1D,MAAMw5C,GAAS,WAEX,MAAMvhC,EAAS,CAAA,EACf,IAAK,IAAIjY,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzBiY,EADY,uCAAuCjY,IACrCkY,OAAOlY,EACzB,CACA,OAAOiY,CACV,CARc,GAoDR,SAASwhC,GAAWN,GAEvB,GADArgC,EAAoC,iBAAb,EAAuB,kBAAmB,UAAWqgC,GACxEA,EAAQz5C,MAAM,0BAA2B,CAEpCy5C,EAAQ38B,WAAW,QACpB28B,EAAU,KAAOA,GAErB,MAAMlhC,EAASihC,GAAmBC,GAGlC,OADArgC,GAAgBqgC,EAAQz5C,MAAM,kCAAoCuY,IAAWkhC,EAAS,uBAAwB,UAAWA,GAClHlhC,CACX,CAEA,GAAIkhC,EAAQz5C,MAAM,kCAAmC,CAEjDoZ,EAAeqgC,EAAQn/B,UAAU,EAAG,KAnF5C,SAAsBm/B,GAGlB,IAAIE,GADJF,GADAA,EAAUA,EAAQ/2B,eACApI,UAAU,GAAKm/B,EAAQn/B,UAAU,EAAG,GAAK,MACpCpb,MAAM,IAAIkK,KAAK1J,GAAem6C,GAAWn6C,KAAOsL,KAAK,IAE5E,KAAO2uC,EAAS55C,QAND,IAMuB,CAClC,IAAIi6C,EAAQL,EAASr/B,UAAU,EAPpB,IAQXq/B,EAAWt/B,SAAS2/B,EAAO,IAAM,GAAKL,EAASr/B,UAAU0/B,EAAMj6C,OACnE,CACA,IAAIk6C,EAAW16C,OAAO,GAAM8a,SAASs/B,EAAU,IAAM,IACrD,KAAOM,EAASl6C,OAAS,GACrBk6C,EAAW,IAAMA,EAErB,OAAOA,CACX,CAqEmDC,CAAaT,GAAU,oBAAqB,UAAWA,GAClG,IAAIlhC,EA3DZ,SAAoBtB,GAChBA,EAAQA,EAAMmI,cACd,IAAI7G,EAASgD,GACb,IAAK,IAAIjb,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9BiY,EAASA,EAASghC,GAAQO,GAAO7iC,EAAM3W,IAE3C,OAAOiY,CACX,CAoDqB4hC,CAAWV,EAAQn/B,UAAU,IAAInb,SAAS,IACvD,KAAOoZ,EAAOxY,OAAS,IACnBwY,EAAS,IAAMA,EAEnB,OAAOihC,GAAmB,KAAOjhC,EACrC,CACAa,GAAe,EAAO,kBAAmB,UAAWqgC,EACxD,CChHO,SAASW,GAAcnjC,GAC1B,OAAQA,GAAuC,mBAAtBA,EAAgB,UAC7C,CAkCAQ,eAAe4iC,GAAatiC,EAAQuiC,GAChC,MAAM/hC,QAAe+hC,EAKrB,OAJc,MAAV/hC,GAA6B,+CAAXA,IAClBY,EAA2B,iBAApB,EAA8B,oBAAqB,oBAAqB,CAAElC,MAAOc,IACxFqB,GAAe,EAAO,gEAAiE,SAAUrB,IAE9FgiC,GAAWxhC,EACtB,CAsCO,SAASgiC,GAAexiC,EAAQyiC,GACnC,MAAwB,iBAAZ,EACJziC,EAAO/X,MAAM,qBACN+5C,GAAWhiC,IAEtBoB,EAAmB,MAAZqhC,EAAkB,qCAAsC,wBAAyB,CAAE3gC,UAAW,gBAC9FwgC,GAAatiC,EAAQyiC,EAASC,YAAY1iC,KAE5CqiC,GAAcriC,GACZsiC,GAAatiC,EAAQA,EAAOgiC,cAE9BhiC,GAAmC,mBAAjBA,EAAW,KAC3BsiC,GAAatiC,EAAQA,QAEhCqB,GAAe,EAAO,gCAAiC,SAAUrB,EACrE,CCjGA,MAAM2iC,GAAS,CAAA,EACf,SAASv5C,GAAE8V,EAAO6E,GACd,IAAI6+B,GAAS,EAMb,OALI7+B,EAAQ,IACR6+B,GAAS,EACT7+B,IAAU,GAGP,IAAI8+B,GAAMF,GAAQ,GAAGC,EAAS,GAAK,SAAS7+B,IAAS7E,EAAO,CAAE0jC,SAAQ7+B,SACjF,CACA,SAASzH,GAAE4C,EAAOpD,GAEd,OAAO,IAAI+mC,GAAMF,GAAQ,QAAQ,GAAgB,KAAMzjC,EAAO,CAAEpD,QACpE,CACA,MAAMgnC,GAAe33B,OAAO+0B,IAAI,iBAIzB,MAAM2C,GAIT1jC,KAIAD,MACA+H,GAIA67B,aAIA,WAAA75C,CAAY85C,EAAO5jC,EAAMD,EAAO+H,GACb,MAAXA,IACAA,EAAU,MAEdlF,EAAc4gC,GAAQI,EAAO,SAC7BhjC,EAAiB3U,KAAM,CAAE03C,gBAAc3jC,OAAMD,UAC7C9T,MAAK6b,EAAWA,EAEhB7b,KAAK43C,QACR,CAID,MAAAA,GACI,GAAkB,UAAd53C,KAAK+T,KACL,MAAM,IAAII,MAAM,IAEf,GAAkB,iBAAdnU,KAAK+T,KACV,MAAM,IAAII,MAAM,IAEf,MAAkB,UAAdnU,KAAK+T,KACH,SAAS/T,KAAK8T,MAAM7N,KAAKxF,GAAMA,EAAEm3C,WAAU/vC,KAAK,QAEpD7H,KAAK+T,IACf,CAID,YAAA8jC,GACI,OAAO,CACV,CAID,QAAAC,GACI,OAAO,CACV,CAID,QAAAx/B,GACI,OAAO,CACV,CAID,QAAAy/B,GACI,QAAU/3C,KAAK+T,KAAKlX,MAAM,gBAC7B,CAID,MAAAm7C,GACI,OAAOh4C,KAAK+T,KAAK4F,WAAW,QAC/B,CAID,QAAAs+B,GACI,MAAsB,WAAdj4C,KAAK+T,IAChB,CAID,aAAImkC,GACA,GAAkB,UAAdl4C,KAAK+T,KACL,MAAM8B,UAAU,eAEpB,OAAO7V,MAAK6b,CACf,CAUD,eAAIs8B,GACA,GAAkB,UAAdn4C,KAAK+T,KACL,MAAM8B,UAAU,gBAEpB,OAAsB,IAAlB7V,MAAK6b,GACG,GAEU,IAAlB7b,MAAK6b,EACG7b,KAAU,MAAEpD,OAEjB,IACV,CAID,WAAO6K,CAAKsM,EAAMD,GACd,OAAO,IAAI2jC,GAAMF,GAAQxjC,EAAMD,EAClC,CAID,YAAOskC,CAAM33C,GAAK,OAAOzC,GAAEyC,EAAG,EAAK,CAInC,aAAO43C,CAAO53C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAO63C,CAAO73C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAO83C,CAAO93C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAO+3C,CAAO/3C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOg4C,CAAOh4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOi4C,CAAOj4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOk4C,CAAOl4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOm4C,CAAOn4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOo4C,CAAOp4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOq4C,CAAOr4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,aAAOs4C,CAAOt4C,GAAK,OAAOzC,GAAEyC,EAAG,GAAM,CAIrC,cAAOu4C,CAAQv4C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOw4C,CAAQx4C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOy4C,CAAQz4C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO04C,CAAQ14C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO24C,CAAQ34C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO44C,CAAQ54C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO64C,CAAQ74C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO84C,CAAQ94C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO+4C,CAAQ/4C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOg5C,CAAQh5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOi5C,CAAQj5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOk5C,CAAQl5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOm5C,CAAQn5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOo5C,CAAQp5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOq5C,CAAQr5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOs5C,CAAQt5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOu5C,CAAQv5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOw5C,CAAQx5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAOy5C,CAAQz5C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,cAAO05C,CAAQ15C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIvC,WAAO25C,CAAK35C,GAAK,OAAOzC,GAAEyC,EAAG,IAAO,CAIpC,WAAO45C,CAAK55C,GAAK,OAAOzC,GAAEyC,GAAI,EAAK,CAInC,YAAO65C,CAAM75C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAO85C,CAAM95C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAO+5C,CAAM/5C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOg6C,CAAMh6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOi6C,CAAMj6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOk6C,CAAMl6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOm6C,CAAMn6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOo6C,CAAMp6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOq6C,CAAMr6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOs6C,CAAMt6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,YAAOu6C,CAAMv6C,GAAK,OAAOzC,GAAEyC,GAAI,GAAM,CAIrC,aAAOw6C,CAAOx6C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOy6C,CAAOz6C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO06C,CAAO16C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO26C,CAAO36C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO46C,CAAO56C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO66C,CAAO76C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO86C,CAAO96C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO+6C,CAAO/6C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOg7C,CAAOh7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOi7C,CAAOj7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOk7C,CAAOl7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOm7C,CAAOn7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOo7C,CAAOp7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOq7C,CAAOr7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOs7C,CAAOt7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOu7C,CAAOv7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOw7C,CAAOx7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAOy7C,CAAOz7C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO07C,CAAO17C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,aAAO27C,CAAO37C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIvC,UAAO47C,CAAI57C,GAAK,OAAOzC,GAAEyC,GAAI,IAAO,CAIpC,aAAO67C,CAAO77C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAO87C,CAAO97C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAO+7C,CAAO/7C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOg8C,CAAOh8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOi8C,CAAOj8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOk8C,CAAOl8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOm8C,CAAOn8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOo8C,CAAOp8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,aAAOq8C,CAAOr8C,GAAK,OAAOyQ,GAAEzQ,EAAG,EAAK,CAIpC,cAAOs8C,CAAQt8C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOu8C,CAAQv8C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOw8C,CAAQx8C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOy8C,CAAQz8C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO08C,CAAQ18C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO28C,CAAQ38C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO48C,CAAQ58C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO68C,CAAQ78C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO88C,CAAQ98C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO+8C,CAAQ/8C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOg9C,CAAQh9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOi9C,CAAQj9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOk9C,CAAQl9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOm9C,CAAQn9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOo9C,CAAQp9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOq9C,CAAQr9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOs9C,CAAQt9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOu9C,CAAQv9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOw9C,CAAQx9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAOy9C,CAAQz9C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO09C,CAAQ19C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO29C,CAAQ39C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO49C,CAAQ59C,GAAK,OAAOyQ,GAAEzQ,EAAG,GAAM,CAItC,cAAO61C,CAAQ71C,GAAK,OAAO,IAAIg3C,GAAMF,GAAQ,UAAW92C,EAAK,CAI7D,WAAO69C,CAAK79C,GAAK,OAAO,IAAIg3C,GAAMF,GAAQ,SAAU92C,EAAK,CAIzD,YAAOiX,CAAMjX,GAAK,OAAO,IAAIg3C,GAAMF,GAAQ,QAAS92C,EAAK,CAIzD,aAAO4/B,CAAO5/B,GAAK,OAAO,IAAIg3C,GAAMF,GAAQ,SAAU92C,EAAK,CAI3D,YAAO+9B,CAAM/9B,EAAGwlB,GACZ,MAAM,IAAI9R,MAAM,sBAEnB,CAID,YAAOoqC,CAAM99C,EAAGgK,GACZ,MAAM,IAAI0J,MAAM,sBAEnB,CAID,gBAAOqqC,CAAU/9C,GACb,OAAO,IAAIg3C,GAAMF,GAAQ,YAAa95C,OAAOsY,OAAO,CAAA,EAAItV,GAC3D,CAID,cAAOg+C,CAAQ3qC,GACX,OAAQA,GACkB,iBAAX,GACR,iBAAkBA,GAClBA,EAAM4jC,eAAiBA,EACjC,CAQD,kBAAOgH,CAAY5qC,EAAOC,GACtB,GAAI0jC,GAAMgH,QAAQ3qC,GAAQ,CACtB,GAAIA,EAAMC,OAASA,EACf,MAAM,IAAII,MAAM,0BAA0BJ,UAAaD,EAAMC,QAEjE,OAAOD,EAAMA,KAChB,CACD,OAAOA,CACV,EChlBE,MAAM6qC,WAAqB54B,GAC9B,WAAAloB,CAAYmoB,GACRrc,MAAM,UAAW,UAAWqc,GAAW,EAC1C,CACD,YAAA6xB,GACI,MAAO,4CACV,CACD,MAAAnuB,CAAOpD,EAAQ9N,GACX,IAAI1E,EAAQ2jC,GAAMiH,YAAYlmC,EAAQ,UACtC,IACI1E,EAAQ8iC,GAAW9iC,EACtB,CACD,MAAOI,GACH,OAAOlU,KAAKkmB,YAAYhS,EAAMuB,QAAS+C,EAC1C,CACD,OAAO8N,EAAOG,WAAW3S,EAC5B,CACD,MAAA8qC,CAAOt3B,GACH,OAAOsvB,GAAWr9B,EAAQ+N,EAAOE,YAAa,IACjD,ECpBE,MAAMq3B,WAAuB94B,GAChC+4B,MACA,WAAAjhD,CAAYihD,GACRn1C,MAAMm1C,EAAMr0C,KAAMq0C,EAAM/qC,KAAM,IAAK+qC,EAAM74B,SACzCjmB,KAAK8+C,MAAQA,CAChB,CACD,YAAAjH,GACI,OAAO73C,KAAK8+C,MAAMjH,cACrB,CACD,MAAAnuB,CAAOpD,EAAQxS,GACX,OAAO9T,KAAK8+C,MAAMp1B,OAAOpD,EAAQxS,EACpC,CACD,MAAA8qC,CAAOt3B,GACH,OAAOtnB,KAAK8+C,MAAMF,OAAOt3B,EAC5B,ECbE,SAASvb,GAAKua,EAAQy4B,EAAQlqC,GACjC,IAAImqC,EAAc,GAClB,GAAI33C,MAAM4N,QAAQJ,GACdmqC,EAAcnqC,OAEb,GAAIA,GAA8B,iBAApB,EAA8B,CAC7C,IAAIoqC,EAAS,CAAA,EACbD,EAAcD,EAAO94C,KAAK64C,IACtB,MAAMr0C,EAAOq0C,EAAM94B,UAInB,OAHAhQ,EAAOvL,EAAM,wDAAyD,mBAAoB,CAAE4J,SAAU,SAAUqB,KAAM,CAAEopC,SAAShrC,MAAOe,IACxImB,GAAQipC,EAAOx0C,GAAO,0DAA2D,mBAAoB,CAAE4J,SAAU,SAAUqB,KAAM,CAAEopC,SAAShrC,MAAOe,IACnJoqC,EAAOx0C,IAAQ,EACRoK,EAAOpK,EAAK,GAE1B,MAEGwL,GAAe,EAAO,sBAAuB,QAASpB,GAE1DoB,EAAe8oC,EAAOniD,SAAWoiD,EAAYpiD,OAAQ,8BAA+B,QAASiY,GAC7F,IAAIqqC,EAAe,IAAI/4B,GACnBg5B,EAAgB,IAAIh5B,GACpBi5B,EAAc,GAClBL,EAAOz3C,SAAQ,CAACw3C,EAAOltC,KACnB,IAAIkC,EAAQkrC,EAAYptC,GACxB,GAAIktC,EAAM74B,QAAS,CAEf,IAAIo5B,EAAgBF,EAAcviD,OAElCkiD,EAAMp1B,OAAOy1B,EAAerrC,GAE5B,IAAIwrC,EAAaJ,EAAax4B,sBAC9B04B,EAAYhhD,MAAMmhD,IACdD,EAAWC,EAAaF,EAAc,GAE7C,MAEGP,EAAMp1B,OAAOw1B,EAAcprC,EAC9B,IAGLsrC,EAAY93C,SAAS2a,IAAWA,EAAKi9B,EAAatiD,OAAO,IACzD,IAAIA,EAAS0pB,EAAOD,aAAa64B,GAEjC,OADAtiD,GAAU0pB,EAAOD,aAAa84B,GACvBviD,CACX,CAIO,SAAS4iD,GAAOl4B,EAAQy3B,GAC3B,IAAIlqC,EAAS,GACT1W,EAAO,GAEPshD,EAAan4B,EAAOD,UAAU,GAyClC,OAxCA03B,EAAOz3C,SAASw3C,IACZ,IAAIhrC,EAAQ,KACZ,GAAIgrC,EAAM74B,QAAS,CACf,IAAIhP,EAASqQ,EAAOG,YAChBi4B,EAAeD,EAAWp4B,UAAUpQ,GACxC,IACInD,EAAQgrC,EAAMF,OAAOc,EACxB,CACD,MAAOxrC,GAEH,GAAIoB,EAAQpB,EAAO,kBACf,MAAMA,EAEVJ,EAAQI,EACRJ,EAAM6rC,SAAWb,EAAMr0C,KACvBqJ,EAAMrJ,KAAOq0C,EAAM94B,UACnBlS,EAAMC,KAAO+qC,EAAM/qC,IACtB,CACJ,MAEG,IACID,EAAQgrC,EAAMF,OAAOt3B,EACxB,CACD,MAAOpT,GAEH,GAAIoB,EAAQpB,EAAO,kBACf,MAAMA,EAEVJ,EAAQI,EACRJ,EAAM6rC,SAAWb,EAAMr0C,KACvBqJ,EAAMrJ,KAAOq0C,EAAM94B,UACnBlS,EAAMC,KAAO+qC,EAAM/qC,IACtB,CAEL,GAAa+I,MAAThJ,EACA,MAAM,IAAIK,MAAM,eAEpBU,EAAOzW,KAAK0V,GACZ3V,EAAKC,KAAK0gD,EAAM94B,WAAa,KAAK,IAE/BlB,GAAOgB,UAAUjR,EAAQ1W,EACpC,CAIO,MAAMyhD,WAAmB75B,GAC5B+4B,MACAliD,OACA,WAAAiB,CAAYihD,EAAOliD,EAAQopB,GAGvBrc,MAAM,QAFQm1C,EAAM/qC,KAAO,KAAOnX,GAAU,EAAIA,EAAS,IAAM,IAE1CopB,GADQ,IAAZppB,GAAiBkiD,EAAM74B,SAExCtR,EAAiB3U,KAAM,CAAE8+C,QAAOliD,UACnC,CACD,YAAAi7C,GAEI,MAAMgI,EAAe7/C,KAAK8+C,MAAMjH,eAC1BziC,EAAS,GACf,IAAK,IAAIjY,EAAI,EAAGA,EAAI6C,KAAKpD,OAAQO,IAC7BiY,EAAOhX,KAAKyhD,GAEhB,OAAOzqC,CACV,CACD,MAAAsU,CAAOpD,EAAQ9N,GACX,MAAM1E,EAAQ2jC,GAAMiH,YAAYlmC,EAAQ,SACnCnR,MAAM4N,QAAQnB,IACf9T,KAAKkmB,YAAY,uBAAwBpS,GAE7C,IAAIqC,EAAQnW,KAAKpD,QACF,IAAXuZ,IACAA,EAAQrC,EAAMlX,OACd0pB,EAAOG,WAAW3S,EAAMlX,SAE5BsZ,EAAoBpC,EAAMlX,OAAQuZ,EAAO,eAAiBnW,KAAKgmB,UAAa,IAAMhmB,KAAKgmB,UAAa,KACpG,IAAI+4B,EAAS,GACb,IAAK,IAAI5hD,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9B4hD,EAAO3gD,KAAK4B,KAAK8+C,OAErB,OAAO/yC,GAAKua,EAAQy4B,EAAQjrC,EAC/B,CACD,MAAA8qC,CAAOt3B,GACH,IAAInR,EAAQnW,KAAKpD,QACF,IAAXuZ,IACAA,EAAQmR,EAAOG,YAMfzR,EAAOG,EAAQ8N,IAAYqD,EAAO1P,WAAY,2BAA4B,iBAAkB,CAAEG,OAAQuP,EAAO5P,MAAOT,OAAQd,EAAQ8N,GAAUrnB,OAAQ0qB,EAAO1P,cAEjK,IAAImnC,EAAS,GACb,IAAK,IAAI5hD,EAAI,EAAGA,EAAIgZ,EAAOhZ,IACvB4hD,EAAO3gD,KAAK,IAAIygD,GAAe7+C,KAAK8+C,QAExC,OAAOU,GAAOl4B,EAAQy3B,EACzB,ECvJE,MAAMe,WAAqB/5B,GAC9B,WAAAloB,CAAYmoB,GACRrc,MAAM,OAAQ,OAAQqc,GAAW,EACpC,CACD,YAAA6xB,GACI,OAAO,CACV,CACD,MAAAnuB,CAAOpD,EAAQ9N,GACX,MAAM1E,EAAQ2jC,GAAMiH,YAAYlmC,EAAQ,QACxC,OAAO8N,EAAOG,WAAW3S,EAAQ,EAAI,EACxC,CACD,MAAA8qC,CAAOt3B,GACH,QAASA,EAAOE,WACnB,ECbE,MAAMu4B,WAA0Bh6B,GACnC,WAAAloB,CAAYkW,EAAMiS,GACdrc,MAAMoK,EAAMA,EAAMiS,GAAW,EAChC,CACD,YAAA6xB,GACI,MAAO,IACV,CACD,MAAAnuB,CAAOpD,EAAQxS,GACXA,EAAQuD,EAAavD,GACrB,IAAIlX,EAAS0pB,EAAOG,WAAW3S,EAAMlX,QAErC,OADAA,GAAU0pB,EAAOC,WAAWzS,GACrBlX,CACV,CACD,MAAAgiD,CAAOt3B,GACH,OAAOA,EAAOC,UAAUD,EAAOG,aAAa,EAC/C,EAKE,MAAMu4B,WAAmBD,GAC5B,WAAAliD,CAAYmoB,GACRrc,MAAM,QAASqc,EAClB,CACD,MAAA44B,CAAOt3B,GACH,OAAO7P,EAAQ9N,MAAMi1C,OAAOt3B,GAC/B,ECzBE,MAAM24B,WAAwBl6B,GACjCrV,KACA,WAAA7S,CAAY6S,EAAMsV,GACd,IAAIvb,EAAO,QAAUrO,OAAOsU,GAC5B/G,MAAMc,EAAMA,EAAMub,GAAW,GAC7BrR,EAAiB3U,KAAM,CAAE0Q,QAAQ,CAAEA,KAAM,UAC5C,CACD,YAAAmnC,GACI,MAAO,qEAAuE1gC,UAAU,EAAG,EAAgB,EAAZnX,KAAK0Q,KACvG,CACD,MAAAgZ,CAAOpD,EAAQ9N,GACX,IAAI5Z,EAAOyY,EAAaogC,GAAMiH,YAAYlmC,EAAQxY,KAAK+T,OAIvD,OAHInV,EAAKhC,SAAWoD,KAAK0Q,MACrB1Q,KAAKkmB,YAAY,wBAAyB1N,GAEvC8N,EAAOC,WAAW3nB,EAC5B,CACD,MAAAggD,CAAOt3B,GACH,OAAO7P,EAAQ6P,EAAOC,UAAUvnB,KAAK0Q,MACxC,ECxBL,MAAMwvC,GAAQ,IAAIhrC,WAAW,IAItB,MAAMirC,WAAkBp6B,GAC3B,WAAAloB,CAAYmoB,GACRrc,MAAM,OAAQ,GAAIqc,GAAW,EAChC,CACD,YAAA6xB,GACI,OAAO,IACV,CACD,MAAAnuB,CAAOpD,EAAQxS,GAIX,OAHa,MAATA,GACA9T,KAAKkmB,YAAY,WAAYpS,GAE1BwS,EAAOC,WAAW25B,GAC5B,CACD,MAAAtB,CAAOt3B,GAEH,OADAA,EAAOC,UAAU,GACV,IACV,EClBL,MAAMnP,GAAO/C,OAAO,GACdgD,GAAOhD,OAAO,GACd+qC,GAAiB/qC,OAAO,sEAIvB,MAAMgrC,WAAoBt6B,GAC7BrV,KACA8mC,OACA,WAAA35C,CAAY6S,EAAM8mC,EAAQxxB,GACtB,MAAMvb,GAAS+sC,EAAS,MAAQ,QAAkB,EAAP9mC,EAC3C/G,MAAMc,EAAMA,EAAMub,GAAW,GAC7BrR,EAAiB3U,KAAM,CAAE0Q,OAAM8mC,UAAU,CAAE9mC,KAAM,SAAU8mC,OAAQ,WACtE,CACD,YAAAK,GACI,OAAO,CACV,CACD,MAAAnuB,CAAOpD,EAAQ9N,GACX,IAAI1E,EAAQ4E,EAAU++B,GAAMiH,YAAYlmC,EAAQxY,KAAK+T,OAEjDusC,EAAevnC,EAAKqnC,GAAgBn8B,KACxC,GAAIjkB,KAAKw3C,OAAQ,CACb,IAAI+I,EAASxnC,EAAKunC,EAA2B,EAAZtgD,KAAK0Q,KAAY,IAC9CoD,EAAQysC,GAAUzsC,IAAUysC,EAASloC,MACrCrY,KAAKkmB,YAAY,sBAAuB1N,GAE5C1E,EAAQyE,EAAOzE,EAAO,IACzB,MACQA,EAAQsE,IAAQtE,EAAQiF,EAAKunC,EAA0B,EAAZtgD,KAAK0Q,QACrD1Q,KAAKkmB,YAAY,sBAAuB1N,GAE5C,OAAO8N,EAAOG,WAAW3S,EAC5B,CACD,MAAA8qC,CAAOt3B,GACH,IAAIxT,EAAQiF,EAAKuO,EAAOE,YAAyB,EAAZxnB,KAAK0Q,MAI1C,OAHI1Q,KAAKw3C,SACL1jC,EnDrBL,SAAkB0E,EAAQC,GAC7B,MAAM3E,EAAQmF,EAAQT,EAAQ,SACxBG,EAAQtD,OAAOuD,EAAUH,EAAQ,UAKvC,GAJAzC,EAAQlC,GAAS6E,IAAWP,EAAM,WAAY,gBAAiB,CAC3D1B,UAAW,WAAYoC,MAAO,WAAYhF,MAAO0E,IAGjD1E,GAAU6E,EAAQN,EAElB,UAAYvE,GADEuE,GAAQM,GAASN,GACFA,GAEjC,OAAOvE,CACX,CmDSoB0sC,CAAS1sC,EAAmB,EAAZ9T,KAAK0Q,OAE1BoD,CACV,ECpCE,MAAM2sC,WAAoBV,GAC7B,WAAAliD,CAAYmoB,GACRrc,MAAM,SAAUqc,EACnB,CACD,YAAA6xB,GACI,MAAO,EACV,CACD,MAAAnuB,CAAOpD,EAAQ9N,GACX,OAAO7O,MAAM+f,OAAOpD,EAAQxL,EAAY28B,GAAMiH,YAAYlmC,EAAQ,WACrE,CACD,MAAAomC,CAAOt3B,GACH,OAAOpM,GAAavR,MAAMi1C,OAAOt3B,GACpC,ECXE,MAAMo5B,WAAmB36B,GAC5Bg5B,OACA,WAAAlhD,CAAYkhD,EAAQ/4B,GAChB,IAAIC,GAAU,EACd,MAAMjS,EAAQ,GACd+qC,EAAOz3C,SAASw3C,IACRA,EAAM74B,UACNA,GAAU,GAEdjS,EAAM5V,KAAK0gD,EAAM/qC,KAAK,IAG1BpK,MAAM,QADQ,SAAWqK,EAAMnM,KAAK,KAAO,IACtBme,EAAWC,GAChCtR,EAAiB3U,KAAM,CAAE++C,OAAQthD,OAAOmd,OAAOmkC,EAAOtjD,UACzD,CACD,YAAAo8C,GACI,MAAMhjC,EAAS,GACf7U,KAAK++C,OAAOz3C,SAASw3C,IACjBjqC,EAAOzW,KAAK0gD,EAAMjH,eAAe,IAGrC,MAAM8I,EAAc3gD,KAAK++C,OAAOtqC,QAAO,CAACC,EAAOoqC,KAC3C,MAAMr0C,EAAOq0C,EAAM94B,UAOnB,OANIvb,IACKiK,EAAMjK,KACPiK,EAAMjK,GAAQ,GAElBiK,EAAMjK,MAEHiK,CAAK,GACb,CAAE,GAeL,OAbA1U,KAAK++C,OAAOz3C,SAAQ,CAACw3C,EAAOltC,KACxB,IAAInH,EAAOq0C,EAAM94B,UACZvb,GAA8B,IAAtBk2C,EAAYl2C,KAGZ,WAATA,IACAA,EAAO,WAES,MAAhBoK,EAAOpK,KAGXoK,EAAOpK,GAAQoK,EAAOjD,IAAM,IAEzBnU,OAAOmd,OAAO/F,EACxB,CACD,MAAA6U,CAAOpD,EAAQ9N,GACX,MAAM1E,EAAQ2jC,GAAMiH,YAAYlmC,EAAQ,SACxC,OAAOzM,GAAKua,EAAQtmB,KAAK++C,OAAQjrC,EACpC,CACD,MAAA8qC,CAAOt3B,GACH,OAAOk4B,GAAOl4B,EAAQtnB,KAAK++C,OAC9B,EC/CE,SAASx9C,GAAGuS,GACf,OAAO2iB,GAAU3b,EAAYhH,GACjC,CCTA,MAAM8sC,GAAS,IAAIz7B,IAAI,CAAC,CAAC,KAAK,cAAc,CAAC,KAAK,kBAAkB,CAAC,MAAM,gBA0F3E,SAAS07B,GAAwBrkD,GAChC,OALD,SAAsBiE,GACrB,IAAI4rB,EAAM,EACV,MAAO,IAAM5rB,EAAE4rB,IAChB,CAEQy0B,CAxFR,SAA2BppC,GAC1B,IAAI2U,EAAM,EACV,SAAS00B,IAAQ,OAAQrpC,EAAM2U,MAAU,EAAK3U,EAAM2U,IAAS,CAG7D,IAAI20B,EAAeD,IACfE,EAAQ,EACR5O,EAAM,CAAC,EAAG,GACd,IAAK,IAAIl1C,EAAI,EAAGA,EAAI6jD,EAAc7jD,IACjCk1C,EAAIj0C,KAAK6iD,GAASF,KAInB,IAAIG,EAAOH,IACPI,EAAc90B,EAClBA,GAAO60B,EAEP,IAAIE,EAAa,EACbC,EAAc,EAClB,SAASC,IAOR,OANkB,GAAdF,IAGHC,EAAeA,GAAe,EAAK3pC,EAAM2U,KACzC+0B,EAAa,GAENC,KAAiBD,EAAc,CACvC,CAED,MACMG,EAAO,GADH,GAEJC,EAAOD,IAAS,EAChBE,EAAOD,GAAQ,EACf9d,EAAO6d,EAAO,EAGpB,IAAIvtB,EAAW,EACf,IAAK,IAAI72B,EAAI,EAAGA,EARN,GAQaA,IAAK62B,EAAYA,GAAY,EAAKstB,IAEzD,IAAII,EAAU,GACVpxB,EAAM,EACNqxB,EAAQJ,EACZ,OAAa,CACZ,IAAIztC,EAAQpX,KAAKC,QAASq3B,EAAW1D,EAAM,GAAK2wB,EAAS,GAAKU,GAC1D7pC,EAAQ,EACRzR,EAAM26C,EACV,KAAO36C,EAAMyR,EAAQ,GAAG,CACvB,IAAI8pC,EAAO9pC,EAAQzR,IAAS,EACxByN,EAAQu+B,EAAIuP,GACfv7C,EAAMu7C,EAEN9pC,EAAQ8pC,CAET,CACD,GAAa,GAAT9pC,EAAY,MAChB4pC,EAAQtjD,KAAK0Z,GACb,IAAI9N,EAAIsmB,EAAM5zB,KAAKC,MAAMglD,EAAQtP,EAAIv6B,GAAWmpC,GAC5C/vC,EAAIof,EAAM5zB,KAAKC,MAAMglD,EAAQtP,EAAIv6B,EAAM,GAAKmpC,GAAS,EACzD,QAASj3C,EAAIkH,GAAKswC,IACjBxtB,EAAYA,GAAY,EAAK0P,EAAO4d,IACpCt3C,EAAKA,GAAK,EAAK05B,EACfxyB,EAAKA,GAAK,EAAKwyB,EAAO,EAEvB,KAAO15B,GAAKkH,EAAIuwC,GACfztB,EAAYA,EAAWwtB,EAAUxtB,GAAY,EAAM0P,IAAS,EAAM4d,IAClEt3C,EAAKA,GAAK,EAAKw3C,EACftwC,GAAMA,EAAIswC,IAAS,EAAKA,EAAO,EAEhClxB,EAAMtmB,EACN23C,EAAQ,EAAIzwC,EAAIlH,CAChB,CACD,IAAIiN,EAAS+pC,EAAe,EAC5B,OAAOU,EAAQz7C,KAAIiM,IAClB,OAAQA,EAAI+E,GACX,KAAK,EAAG,OAAOA,EAAS,OAAYS,EAAMypC,MAAkB,GAAOzpC,EAAMypC,MAAkB,EAAKzpC,EAAMypC,MACtG,KAAK,EAAG,OAAOlqC,EAAS,KAAUS,EAAMypC,MAAkB,EAAKzpC,EAAMypC,MACrE,KAAK,EAAG,OAAOlqC,EAASS,EAAMypC,KAC9B,QAAS,OAAOjvC,EAAI,EACpB,GAEH,CAQqB2vC,CAMrB,SAAqBrlD,GACpB,IAAIslD,EAAS,GACb,IAAI,oEAAoEx6C,SAAQ,CAAC/K,EAAGY,IAAM2kD,EAAOvlD,EAAEa,WAAW,IAAMD,IACpH,IAAIa,EAAIxB,EAAEI,OACNmlD,EAAM,IAAI7sC,WAAY,EAAIlX,GAAM,GACpC,IAAK,IAAIb,EAAI,EAAGkvB,EAAM,EAAG1T,EAAQ,EAAGqpC,EAAQ,EAAG7kD,EAAIa,EAAGb,IACrD6kD,EAASA,GAAS,EAAKF,EAAOtlD,EAAEY,WAAWD,IAC3Cwb,GAAS,EACLA,GAAS,IACZopC,EAAI11B,KAAU21B,IAAUrpC,GAAS,IAGnC,OAAOopC,CACR,CAnBuCE,CAAYzlD,IACnD,CAqBA,SAASg7C,GAAOr6C,GACf,OAAY,EAAJA,GAAWA,GAAK,EAAMA,GAAK,CACpC,CAEA,SAAS+kD,GAAYlkD,EAAGkC,GACvB,IAAIO,EAAI4G,MAAMrJ,GACd,IAAK,IAAIb,EAAI,EAAG+U,EAAI,EAAG/U,EAAIa,EAAGb,IAAKsD,EAAEtD,GAAK+U,GAAKslC,GAAOt3C,KACtD,OAAOO,CACR,CAGA,SAAS0hD,GAAYjiD,EAAMyT,EAAO,GACjC,IAAIouC,EAAM,GACV,OAAa,CACZ,IAAI7vC,EAAIhS,IACJlC,EAAIkC,IACR,IAAKlC,EAAG,MACR2V,GAAQzB,EACR,IAAK,IAAI/U,EAAI,EAAGA,EAAIa,EAAGb,IACtB4kD,EAAI3jD,KAAKuV,EAAOxW,GAEjBwW,GAAQ3V,EAAI,CACZ,CACD,OAAO+jD,CACR,CAEA,SAASK,GAAmBliD,GAC3B,OAAOmiD,IAAiB,KACvB,IAAI5hD,EAAI0hD,GAAYjiD,GACpB,GAAIO,EAAE7D,OAAQ,OAAO6D,CAAC,GAExB,CAGA,SAAS6hD,GAAYpiD,GACpB,IAAI6hD,EAAM,GACV,OAAa,CACZ,IAAIj6C,EAAI5H,IACR,GAAS,GAAL4H,EAAQ,MACZi6C,EAAI3jD,KAAKmkD,GAAkBz6C,EAAG5H,GAC9B,CACD,OAAa,CACZ,IAAI4H,EAAI5H,IAAS,EACjB,GAAI4H,EAAI,EAAG,MACXi6C,EAAI3jD,KAAKokD,GAAuB16C,EAAG5H,GACnC,CACD,OAAO6hD,EAAIU,MACZ,CAIA,SAASJ,GAAiBniD,GACzB,IAAIO,EAAI,GACR,OAAa,CACZ,IAAIyR,EAAIhS,EAAKO,EAAE7D,QACf,IAAKsV,EAAG,MACRzR,EAAErC,KAAK8T,EACP,CACD,OAAOzR,CACR,CAIA,SAASiiD,GAAgB1kD,EAAG8J,EAAG5H,GAC9B,IAAIwM,EAAIrF,MAAMrJ,GAAGka,OAAOjS,KAAI,IAAM,KAClC,IAAK,IAAI9I,EAAI,EAAGA,EAAI2K,EAAG3K,IACtB+kD,GAAYlkD,EAAGkC,GAAMoH,SAAQ,CAAC4K,EAAGsJ,IAAM9O,EAAE8O,GAAGpd,KAAK8T,KAElD,OAAOxF,CACR,CAIA,SAAS61C,GAAkBz6C,EAAG5H,GAC7B,IAAIyiD,EAAK,EAAIziD,IACT0iD,EAAK1iD,IACL2iD,EAAKR,GAAiBniD,GAE1B,OADQwiD,GAAgBG,EAAGjmD,OAAQ,EAAEkL,EAAG5H,GAC/B4iD,SAAQ,CAACriD,EAAGtD,KACpB,IAAK+U,KAAM6wC,GAAMtiD,EACjB,OAAO4G,MAAMw7C,EAAG1lD,IAAI+a,OAAOjS,KAAI,CAAChG,EAAGub,KAClC,IAAIwnC,EAAOxnC,EAAIonC,EACf,MAAO,CAAC1wC,EAAIsJ,EAAImnC,EAAII,EAAG98C,KAAI+H,GAAKA,EAAIg1C,IAAM,GACzC,GAEJ,CAIA,SAASR,GAAuB16C,EAAG5H,GAGlC,OADQwiD,GADA,EAAIxiD,IACe,EAAE4H,EAAG5H,GACvB+F,KAAIxF,GAAK,CAACA,EAAE,GAAIA,EAAEhF,MAAM,KAClC,CAgCA,SAASwnD,GAASC,GACjB,MAAO,IALR,SAAgBA,GACf,OAAOA,EAAGlnD,SAAS,IAAIujB,cAAc4e,SAAS,EAAG,IAClD,CAGYglB,CAAOD,KACnB,CAiBA,SAASE,GAAaC,GAErB,IAAIv2B,EAAMu2B,EAAIzmD,OACd,GAAIkwB,EAFU,KAEG,OAAO1wB,OAAOknD,iBAAiBD,GAChD,IAAIt4B,EAAM,GACV,IAAK,IAAI5tB,EAAI,EAAGA,EAAI2vB,GACnB/B,EAAI3sB,KAAKhC,OAAOknD,iBAAiBD,EAAI5nD,MAAM0B,EAAGA,GALjC,QAOd,OAAO4tB,EAAIljB,KAAK,GACjB,CAEA,SAAS07C,GAAev5C,EAAGkH,GAC1B,IAAIlT,EAAIgM,EAAEpN,OACNL,EAAIyB,EAAIkT,EAAEtU,OACd,IAAK,IAAIO,EAAI,EAAQ,GAALZ,GAAUY,EAAIa,EAAGb,IAAKZ,EAAIyN,EAAE7M,GAAK+T,EAAE/T,GACnD,OAAOZ,CACR,CAgBA,MAAMinD,GAAK,MACLC,GAAK,KACLC,GAAK,KACLC,GAAK,KAGLC,GAAU,GACVC,GAAUC,IAOhB,SAASC,GAAUC,GAClB,OAAQA,GAAU,GAAM,GACzB,CACA,SAASC,GAAUD,GAClB,OAAgB,SAATA,CACR,CAEA,IAAIE,GAAcC,GAAYC,GAAQC,GAyBtC,SAASC,GAAUpB,GAClB,OAAOA,GAAMM,IAAMN,EAtCTM,KAuCX,CAEA,SAASe,GAAav6C,EAAGkH,GACxB,GAAIlH,GAAKy5C,IAAMz5C,EAzCLy5C,MAyCevyC,GAAKwyC,IAAMxyC,EAxC1BwyC,KAyCT,OAAOF,IAAMx5C,EAAIy5C,IAAMI,IAAW3yC,EAAIwyC,IAAME,GACtC,GAAIU,GAAUt6C,IAAMkH,EAAIyyC,IAAMzyC,EAzC3ByyC,OAyCsC35C,EAAIw5C,IAAMI,IAAW,EACpE,OAAO55C,GAAKkH,EAAIyyC,IACV,CACN,IAAIa,EAASH,GAAOxgD,IAAImG,GACxB,OAAIw6C,IACHA,EAASA,EAAO3gD,IAAIqN,GAChBszC,GACIA,GAGD,CACR,CACF,CAEA,SAASC,GAAWpB,GACda,IA7CN,WAEC,IAAIxkD,EAAImhD,GAlCQ,+xOAmChBqD,GAAe,IAAI/+B,IAAIi9B,GAAmB1iD,GAAGojD,SAAQ,CAACriD,EAAGtD,IAAMsD,EAAEwF,KAAIiM,GAAK,CAACA,EAAI/U,EAAE,GAAM,SACvFgnD,GAAa,IAAIO,IAAIvC,GAAYziD,IACjC0kD,GAAS,IAAIj/B,IACbk/B,GAAS,IAAIl/B,IACb,IAAK,IAAK+9B,EAAIG,KAAQf,GAAY5iD,GAAI,CACrC,IAAKykD,GAAW3mD,IAAI0lD,IAAqB,GAAdG,EAAIzmD,OAAa,CAC3C,IAAKoN,EAAGkH,GAAKmyC,EACTsB,EAASN,GAAOxgD,IAAImG,GACnB26C,IACJA,EAAS,IAAIx/B,IACbk/B,GAAOh5C,IAAIrB,EAAG26C,IAEfA,EAAOt5C,IAAI6F,EAAGgyC,EACd,CACDkB,GAAO/4C,IAAI63C,EAAIG,EAAI34C,UACnB,CAGF,CAwBoBk6C,GACnB,IAAI7C,EAAM,GACNh3B,EAAM,GACN85B,GAAc,EAClB,SAAS36C,EAAIg5C,GACZ,IAAI4B,EAAKZ,GAAargD,IAAIq/C,GACtB4B,IACHD,GAAc,EACd3B,GAAM4B,GAEP/C,EAAI3jD,KAAK8kD,EACT,CACD,IAAK,IAAIA,KAAMG,EACd,OAAa,CACZ,GAAIH,EAAK,IACRnB,EAAI3jD,KAAK8kD,QACH,GAAIoB,GAAUpB,GAAK,CACzB,IAAI6B,EAAU7B,EAAKM,GAEfwB,EAAWD,EAAUlB,GAAWD,GAAU,EAC1CqB,EAAUF,EAAUnB,GACxB15C,EAAIu5C,IAHUsB,EAAUlB,GAAU,IAIlC35C,EAAIw5C,GAAKsB,GACLC,EAAU,GAAG/6C,EAAIy5C,GAAKsB,EAC9B,KAAU,CACN,IAAIC,EAASd,GAAOvgD,IAAIq/C,GACpBgC,EACHn6B,EAAI3sB,QAAQ8mD,GAEZh7C,EAAIg5C,EAEL,CACD,IAAKn4B,EAAInuB,OAAQ,MACjBsmD,EAAKn4B,EAAI9lB,KACT,CAEF,GAAI4/C,GAAe9C,EAAInlD,OAAS,EAAG,CAClC,IAAIuoD,EAAUpB,GAAUhC,EAAI,IAC5B,IAAK,IAAI5kD,EAAI,EAAGA,EAAI4kD,EAAInlD,OAAQO,IAAK,CACpC,IAAI2nD,EAAKf,GAAUhC,EAAI5kD,IACvB,GAAU,GAAN2nD,GAAWK,GAAWL,EAAI,CAC7BK,EAAUL,EACV,QACA,CACD,IAAItpC,EAAIre,EAAE,EACV,OAAa,CACZ,IAAIH,EAAM+kD,EAAIvmC,EAAE,GAGhB,GAFAumC,EAAIvmC,EAAE,GAAKumC,EAAIvmC,GACfumC,EAAIvmC,GAAKxe,GACJwe,EAAG,MAER,GADA2pC,EAAUpB,GAAUhC,IAAMvmC,IACtB2pC,GAAWL,EAAI,KACnB,CACDK,EAAUpB,GAAUhC,EAAI5kD,GACxB,CACD,CACD,OAAO4kD,CACR,CA6CA,SAASqD,GAAI/B,GACZ,OAAOoB,GAAWpB,GAAKp9C,IAAIg+C,GAC5B,CACA,SAASoB,GAAIhC,GACZ,OA/CD,SAAkC5iD,GACjC,IAAIshD,EAAM,GACNuD,EAAQ,GACRC,GAAW,EACXJ,EAAU,EACd,IAAK,IAAInB,KAAUvjD,EAAG,CACrB,IAAIqkD,EAAKf,GAAUC,GACfd,EAAKe,GAAUD,GACnB,IAAgB,GAAZuB,EACO,GAANT,EACHS,EAAUrC,EAEVnB,EAAI3jD,KAAK8kD,QAEJ,GAAIiC,EAAU,GAAKA,GAAWL,EAC1B,GAANA,GACH/C,EAAI3jD,KAAKmnD,KAAYD,GACrBA,EAAM1oD,OAAS,EACf2oD,EAAUrC,GAEVoC,EAAMlnD,KAAK8kD,GAEZiC,EAAUL,MACJ,CACN,IAAIU,EAAWjB,GAAagB,EAASrC,GACjCsC,GAAY,EACfD,EAAUC,EACW,GAAXL,GAAsB,GAANL,GAC1B/C,EAAI3jD,KAAKmnD,GACTA,EAAUrC,IAEVoC,EAAMlnD,KAAK8kD,GACXiC,EAAUL,EAEX,CACD,CAID,OAHIS,GAAW,GACdxD,EAAI3jD,KAAKmnD,KAAYD,GAEfvD,CACR,CAOQ0D,CAAyBhB,GAAWpB,GAC5C,CAEA,MAEMqC,GAAU,IAKVC,GAAazzC,GAAK7K,MAAMI,KAAKyK,GAEnC,SAAS0zC,GAAaz+C,EAAG+7C,GAExB,OAAO/7C,EAAEsF,EAAEjP,IAAI0lD,IAAO/7C,EAAEm7B,EAAE9kC,IAAI0lD,EAC/B,CAEA,MAAM2C,WAAcx+C,MACnB,YAAIy+C,GAAa,OAAO,CAAO,EAG7B,IAACC,GAAQC,GAASC,GAAIC,GAAKC,GAAmBC,GAAQC,GAAaC,GAAWC,GAAOC,GAAYC,GAEpG,SAAS/pC,KACR,GAAIqpC,GAAQ,OAEZ,IAAIrmD,EAAImhD,GA1eU,gnmBA2elB,MAAM6F,EAAoB,IAAMvE,GAAYziD,GACtCinD,EAAkB,IAAM,IAAIjC,IAAIgC,KAChCE,EAAe,CAACv7C,EAAK5K,IAAMA,EAAE6G,SAAQ4K,GAAK7G,EAAInB,IAAIgI,KAExD6zC,GAAS,IAAI5gC,IAAIm9B,GAAY5iD,IAC7BsmD,GAAUW,IAWVV,GAAKS,IACLR,GAAM,IAAIxB,IAAIgC,IAAoBzgD,KAAI9I,GAAK8oD,GAAG9oD,MAC9C8oD,GAAK,IAAIvB,IAAIuB,IAEbE,GAASQ,IACGA,IAEZ,IAAIE,EAASzE,GAAmB1iD,GAC5BonD,EAAepnD,IAEnB,MAAMqnD,EAAe,KAEpB,IAAI17C,EAAM,IAAIq5C,IAGd,OAFAgC,IAAoBp/C,SAAQnK,GAAKypD,EAAav7C,EAAKw7C,EAAO1pD,MAC1DypD,EAAav7C,EAAKq7C,KACXr7C,CAAG,EAEX+6C,GAAS/D,IAAiBllD,IAGzB,IAAIyD,EAAIyhD,GAAiB3iD,GAAGuG,KAAIiM,GAAKA,EAAE,KACvC,GAAItR,EAAEhE,OAAQ,CACb,IAAIlB,EAAIyB,GAAK2pD,EAoBb,OAnBAlmD,EAAE,IAAM,GACRA,EAAIwiD,GAAaxiD,GACblF,IAAGkF,EAAE,cAAcA,MAiBhB,CAACA,IAAG6L,EAhBHs6C,IAgBMzkB,EAfNykB,IAeSC,GAdRtnD,IAcWhE,IACpB,KAIF2qD,GAAcM,IACdL,GAAY,IAAInhC,IAChB,IAAI8hC,EAASP,IAAoBhzC,OAAOiyC,GAAWU,KAAcz/C,MAAK,CAACoD,EAAGkH,IAAMlH,EAAEkH,IAClF+1C,EAAO3/C,SAAQ,CAAC47C,EAAI/lD,KACnB,IAAImN,EAAI5K,IACJoI,EAAIm/C,EAAO9pD,GAAKmN,EAAI28C,EAAO9pD,EAAEmN,GAAK,CAACoyB,EAAG,GAAIsqB,EAAG,IAAI7hC,KACrDrd,EAAE40B,EAAEt+B,KAAK8kD,GACJmD,GAAY7oD,IAAI0lD,IACpBoD,GAAUj7C,IAAI63C,EAAIp7C,EAClB,IAKF,IAAK,IAAI40B,EAACA,EAACsqB,EAAEA,KAAM,IAAItC,IAAI4B,GAAUzxC,UAAW,CAE/C,IAAIqyC,EAAO,GACX,IAAK,IAAIhE,KAAMxmB,EAAG,CACjB,IAAIyqB,EAAKf,GAAOjsC,QAAOhT,GAAKy+C,GAAaz+C,EAAG+7C,KACxCpV,EAAMoZ,EAAKE,MAAK,EAAEn5B,OAAOk5B,EAAGzX,MAAKvoC,GAAK8mB,EAAEzwB,IAAI2J,OAC3C2mC,IACJA,EAAM,CAAC7f,EAAG,IAAIy2B,IAAOhoB,EAAG,IACxBwqB,EAAK9oD,KAAK0vC,IAEXA,EAAIpR,EAAEt+B,KAAK8kD,GACX0D,EAAa9Y,EAAI7f,EAAGk5B,EACpB,CAED,IAAIE,EAAQH,EAAKpE,SAAQ5wC,GAAKyzC,GAAWzzC,EAAE+b,KAC3C,IAAK,IAAIA,EAACA,EAACyO,EAAEA,KAAMwqB,EAAM,CACxB,IAAII,EAAa,IAAI5C,IAAI2C,EAAMltC,QAAOhT,IAAM8mB,EAAEzwB,IAAI2J,MAClD,IAAK,IAAI+7C,KAAMxmB,EACdsqB,EAAE37C,IAAI63C,EAAIoE,EAEX,CACD,CAIDf,GAAQ,IAAI7B,IACZ,IAAI6C,EAAQ,IAAI7C,IAChB,MAAM8C,EAAetE,GAAMqD,GAAM/oD,IAAI0lD,GAAMqE,EAAMr9C,IAAIg5C,GAAMqD,GAAMr8C,IAAIg5C,GACrE,IAAK,IAAI/7C,KAAKi/C,GAAQ,CACrB,IAAK,IAAIlD,KAAM/7C,EAAEsF,EAAG+6C,EAAatE,GACjC,IAAK,IAAIA,KAAM/7C,EAAEm7B,EAAGklB,EAAatE,EACjC,CAED,IAAK,IAAIA,KAAMqD,GACTD,GAAU9oD,IAAI0lD,IAAQqE,EAAM/pD,IAAI0lD,IACpCoD,GAAUj7C,IAAI63C,EApIC,GAyIjB0D,EAAaL,GAAOnB,GAAImB,KAIxBC,GAlZD,SAAmBtmD,GAClB,IAAI6hD,EAAM,GACN0F,EAAStF,GAAYjiD,GAEzB,OASA,SAASwnD,GAAOloD,EAACA,EAACkS,EAAEA,GAAI2xC,EAAKsE,GAC5B,KAAQ,EAAJnoD,GAASmoD,IAAUtE,EAAIA,EAAIzmD,OAAO,IAAtC,CACQ,EAAJ4C,IAAOmoD,EAAQtE,EAAIA,EAAIzmD,OAAO,IAC1B,EAAJ4C,GAAOuiD,EAAI3jD,KAAKilD,GACpB,IAAK,IAAIprB,KAAMvmB,EACd,IAAK,IAAIwxC,KAAMjrB,EAAGqK,EACjBolB,EAAOzvB,EAAI,IAAIorB,EAAKH,GAAKyE,EALsB,CAQjD,CAnBDD,CAEA,SAAS9I,EAAOtc,GAMf,MAAO,CAAC9iC,EALAU,IAKGwR,EAJH2wC,IAAiB,KACxB,IAAIgB,EAAMlB,GAAYjiD,GAAM+F,KAAI9I,GAAKsqD,EAAOtqD,KAC5C,GAAIkmD,EAAIzmD,OAAQ,OAAOgiD,EAAOyE,EAAI,IAErB/gB,IACd,CATMsc,CAAO,IAAK,IACZmD,CAmBR,CA2Xc6F,CAAUloD,GAAGuG,KAAIxF,GAAKolD,GAAMp+C,KAAKhH,KAAImG,KAAK28C,IACvDkD,GAAa,IAAIthC,IACjB,IAAK,IAAIk+B,KAAOmD,GAAY,CAO3B,IAAI7yC,EAAO,CAAC8yC,IACZ,IAAK,IAAIvD,KAAMG,EAAK,CACnB,IAAInjD,EAAOyT,EAAK1N,KAAInB,IACnB,IAAI8e,EAAQ9e,EAAKjB,IAAIq/C,GAQrB,OAPKt/B,IAIJA,EAAQ,IAAIuB,IACZrgB,EAAKuG,IAAI63C,EAAIt/B,IAEPA,CAAK,IAlKH,QAoKNs/B,EACHvvC,EAAKvV,QAAQ8B,GAEbyT,EAAOzT,CAER,CACD,IAAK,IAAIgS,KAAKyB,EACbzB,EAAEwqB,EAAI2mB,CAEP,CACF,CAIA,SAASwE,GAAU3E,GAClB,OAAQ4E,GAAc5E,GAAM,GAAK,GAAG6E,GAAQC,GAAkB,CAAC9E,SAAYD,GAASC,EACrF,CAMA,SAAS6E,GAAQvrD,GAChB,MAAO,IAAIA,KACZ,CAyCA,SAASwrD,GAAkB3E,EAAKhiD,EAAMX,IAAUunD,EAAShF,IAGxD,IAAIl4B,EAAM,GAsBX,IAA2Bm4B,IArBJG,EAAI,GAsB1B3mC,KACOupC,GAAGzoD,IAAI0lD,IAvBiBn4B,EAAI3sB,KAAK,KACpCilD,EAAIzmD,OAASyE,IAChBA,IAAQ,EACRgiD,EAAM,IAAIA,EAAI5nD,MAAM,EAAG4F,GAAM,QAAWgiD,EAAI5nD,OAAO4F,KAEpD,IAAIsS,EAAO,EACP3V,EAAIqlD,EAAIzmD,OACZ,IAAK,IAAIO,EAAI,EAAGA,EAAIa,EAAGb,IAAK,CAC3B,IAAI+lD,EAAKG,EAAIlmD,GACT2qD,GAAc5E,KACjBn4B,EAAI3sB,KAAKglD,GAAaC,EAAI5nD,MAAMkY,EAAMxW,KACtC4tB,EAAI3sB,KAAK6pD,EAAO/E,IAChBvvC,EAAOxW,EAAI,EAEZ,CAED,OADA4tB,EAAI3sB,KAAKglD,GAAaC,EAAI5nD,MAAMkY,EAAM3V,KAC/B+sB,EAAIljB,KAAK,GACjB,CAQA,SAASigD,GAAc5E,GAEtB,OADAxmC,KACOypC,GAAO3oD,IAAI0lD,EACnB,CAeA,SAASgF,GAAcz9C,GACtB,OAkLD,SAAiB1O,GAChB,OAAOA,EAAMkK,KAAI,EAAE8zB,QAAO7lB,QAAOuG,aAChC,GAAIvG,EAAO,CAEV,IAAIpR,EAAMoR,EAAMuB,QAEhB,MAAM,IAAItB,MAAsB,GAAhBpY,EAAMa,OAAckG,EAAM,iBAAiBilD,GAAQC,GAAkBjuB,EAAO,SAASj3B,IACrG,CACD,OAAOsgD,GAAa3oC,EAAO,IACzB5S,KAAK69C,GACT,CA5LQyC,CAiDR,SAAe19C,EAAM6I,EAAI80C,GACxB,IAAK39C,EAAM,MAAO,GAClBiS,KACA,IAAIzF,EAAS,EAGb,OAAOxM,EAAK1O,MAAM2pD,IAASz/C,KAAIoiD,IAC9B,IAAItuB,EA3iBN,SAAoBv9B,GACnB,IAAI6mD,EAAM,GACV,IAAK,IAAIh3B,EAAM,EAAGS,EAAMtwB,EAAEI,OAAQyvB,EAAMS,GAAO,CAC9C,IAAIo2B,EAAK1mD,EAAE8rD,YAAYj8B,GACvBA,GAAO62B,EAAK,MAAU,EAAI,EAC1BG,EAAIjlD,KAAK8kD,EACT,CACD,OAAOG,CACR,CAmiBckF,CAAWF,GACnB3yC,EAAO,CACVqkB,QACA9iB,UAEDA,GAAU8iB,EAAMn9B,OAAS,EACzB,IAEC,IAEImX,EAFAy0C,EAAS9yC,EAAK8yC,OA2PrB,SAAyBzuB,EAAOzmB,EAAI80C,GACnC,IAAIrG,EAAM,GACNxL,EAAQ,GACZxc,EAAQA,EAAMt+B,QAAQiP,UACtB,KAAOqvB,EAAMn9B,QAAQ,CACpB,IAAI6rD,EAAQC,GAAuB3uB,GACnC,GAAI0uB,EACClS,EAAM35C,SACTmlD,EAAI3jD,KAAKkV,EAAGijC,IACZA,EAAQ,IAETwL,EAAI3jD,KAAKgqD,EAAGK,QACN,CACN,IAAIvF,EAAKnpB,EAAM90B,MACf,GAAIshD,GAAM/oD,IAAI0lD,GACb3M,EAAMn4C,KAAK8kD,OACL,CACN,IAAIG,EAAM0C,GAAOliD,IAAIq/C,GACrB,GAAIG,EACH9M,EAAMn4C,QAAQilD,QACR,IAAK2C,GAAQxoD,IAAI0lD,GAOvB,MAAMyF,GAAiBzF,EAExB,CACD,CACD,CACG3M,EAAM35C,QACTmlD,EAAI3jD,KAAKkV,EAAGijC,IAEb,OAAOwL,CACR,CA/R8B6G,CAAgB7uB,EAAOzmB,EAAI80C,GAClDS,EAAcL,EAAO5rD,OAEzB,IAAKisD,EAKJ,MAAM,IAAI10C,MAAM,eAEjB,IAAI20C,EAAOpzC,EAAK+E,OAAS+tC,EAAO/F,OAGhC,GA/JH,SAAkCY,GAEjC,IAAK,IAAIlmD,EAAIkmD,EAAI0F,YADE,IACuB5rD,EAAI,GAC7C,GAFkB,KAEdkmD,IAAMlmD,GACT,MAAM,IAAIgX,MAAM,mCAGnB,CAsJG60C,CAAyBF,KACbpzC,EAAK+yC,MAAQI,EAAc,GAAKL,EAAO,GAAG1C,WACxCgD,EAAKG,OAAM/F,GAAMA,EAAK,OApKvC,SAA+BG,GAC9B,GAAIA,EAAIzmD,QAAU,GAlMJ,IAkMSymD,EAAI,IAlMb,IAkM6BA,EAAI,GAC9C,MAAM,IAAIlvC,MAAM,6BAA6BivC,GAAaC,EAAI5nD,MAAM,EAAG,OAEzE,CAkKIytD,CAAsBJ,GAKtB/0C,EAAO,YACD,CACN,IAAIwiC,EAAQiS,EAAO1F,SAAQ5wC,GAAKA,EAAE4zC,SAAW,GAAK5zC,IAClD,GAAKqkC,EAAM35C,OAEJ,CAEN,GAAIqpD,GAAGzoD,IAAIsrD,EAAK,IAAK,MAAMK,GAAgB,0BAC3C,IAAK,IAAIhsD,EAAI,EAAGA,EAAI0rD,EAAa1rD,IAAK,CACrC,IAAIkmD,EAAMmF,EAAOrrD,GACjB,IAAKkmD,EAAIyC,UAAYG,GAAGzoD,IAAI6lD,EAAI,IAE/B,MAAM8F,GAAgB,4BAA4B/F,GAAaoF,EAAOrrD,EAAE,SAAS6qD,GAAkB,CAAC3E,EAAI,QAEzG,EA3KN,SAAsBA,GACrB,IAAIH,EAAKG,EAAI,GACT1vC,EAAOitC,GAAO/8C,IAAIq/C,GACtB,GAAIvvC,EAAM,MAAMw1C,GAAgB,WAAWx1C,KAC3C,IAAI3V,EAAIqlD,EAAIzmD,OACR0D,GAAQ,EACZ,IAAK,IAAInD,EAAI,EAAGA,EAAIa,EAAGb,IAAK,CAC3B+lD,EAAKG,EAAIlmD,GACT,IAAIN,EAAQ+jD,GAAO/8C,IAAIq/C,GACvB,GAAIrmD,EAAO,CAEV,GAAIyD,GAAQnD,EAAG,MAAMgsD,GAAgB,GAAGx1C,OAAU9W,KAClDyD,EAAOnD,EAAI,EACXwW,EAAO9W,CACP,CACD,CACD,GAAIyD,GAAQtC,EAAG,MAAMmrD,GAAgB,YAAYx1C,IAClD,CA2JKy1C,CAAaN,GACb,IAAI7J,EAAS0G,GAAW,IAAIjB,IAAInO,KAC3BpvC,GAgDV,SAAyB83C,GACxB,IAAIoK,EAASjD,GACb,IAAK,IAAIlD,KAAMjE,EAAQ,CAGtB,IAAIkI,EAAKkC,EAAOlvC,QAAOhT,GAAKy+C,GAAaz+C,EAAG+7C,KAC5C,IAAKiE,EAAGvqD,OACP,MAAKwpD,GAAO1W,MAAKvoC,GAAKy+C,GAAaz+C,EAAG+7C,KAW/BoG,GAAmBD,EAAO,GAAInG,GAL9ByF,GAAiBzF,GASzB,GADAmG,EAASlC,EACQ,GAAbA,EAAGvqD,OAAa,KACpB,CAED,OAAOysD,CACR,CA1EeE,CAAgBtK,IA4G/B,SAAqB93C,EAAGk8C,GACvB,IAAK,IAAIH,KAAMG,EACd,IAAKuC,GAAaz+C,EAAG+7C,GAWpB,MAAMoG,GAAmBniD,EAAG+7C,GAI9B,GAAI/7C,EAAE6/C,EAAG,CACR,IAAIvC,EAAaW,GAAI/B,GACrB,IAAK,IAAIlmD,EAAI,EAAGwB,EAAI8lD,EAAW7nD,OAAQO,EAAIwB,EAAGxB,IAc7C,GAAI+oD,GAAI1oD,IAAIinD,EAAWtnD,IAAK,CAC3B,IAAIqe,EAAIre,EAAI,EACZ,IAAK,IAAI+lD,EAAI1nC,EAAI7c,GAAKunD,GAAI1oD,IAAI0lD,EAAKuB,EAAWjpC,IAAKA,IAElD,IAAK,IAAIvd,EAAId,EAAGc,EAAIud,EAAGvd,IACtB,GAAIwmD,EAAWxmD,IAAMilD,EACpB,MAAM,IAAI/uC,MAAM,gCAAgC0zC,GAAU3E,MAM7D,GAAI1nC,EAAIre,EAv+BI,EAy+BX,MAAM,IAAIgX,MAAM,gCAAgC4zC,GAAQC,GAAkBvD,EAAWhpD,MAAM0B,EAAE,EAAGqe,SAASA,EAAEre,QAE5GA,EAAIqe,CACJ,CAEF,CA+CF,CA5MKguC,CAAYriD,EAAGovC,GAiBpB,SAAqBlf,EAAO4nB,GAC3B,IAAIwK,EACAC,EAAS,GACb,IAAK,IAAIxG,KAAMjE,EAAQ,CACtB,IAAI0K,EAAQrD,GAAUziD,IAAIq/C,GAC1B,GAlZgB,IAkZZyG,EAAqB,OACzB,GAAIA,EAAO,CACV,IAAIt+C,EAAMs+C,EAAM3C,EAAEnjD,IAAIq/C,GAEtB,GADAuG,EAAQA,EAAQA,EAAMtvC,QAAOhT,GAAKkE,EAAI7N,IAAI2J,KAAMw+C,GAAWt6C,IACtDo+C,EAAM7sD,OAAQ,MACtB,MACG8sD,EAAOtrD,KAAK8kD,EAEb,CACD,GAAIuG,EAIH,IAAK,IAAItiD,KAAKsiD,EACb,GAAIC,EAAOT,OAAM/F,GAAM0C,GAAaz+C,EAAG+7C,KACtC,MAAM,IAAI/uC,MAAM,4BAA4BkjB,EAAMz2B,KAAKuG,EAAEvG,IAI7D,CAxCKgpD,CAAYziD,EAAG83C,GACflrC,EAAO5M,EAAEvG,CAKT,MAvBAmT,EAAO,OAwBR,CACD2B,EAAK3B,KAAOA,CACZ,CAAC,MAAO5R,GACRuT,EAAKxB,MAAQ/R,CACb,CACD,OAAOuT,CAAI,GAEb,CAvHgB3Z,CAAM0O,EAAM46C,GAAKwE,IACjC,CA6LA,SAASlB,GAAiBzF,GAEzB,OAAO,IAAI/uC,MAAM,yBAAyB0zC,GAAU3E,KACrD,CACA,SAASoG,GAAmBniD,EAAG+7C,GAC9B,IAAI4G,EAASjC,GAAU3E,GACnB6G,EAAK3D,GAAOgB,MAAKjgD,GAAKA,EAAEsF,EAAEjP,IAAI0lD,KAIlC,OAHI6G,IACHD,EAAS,GAAGC,EAAGnpD,KAAKkpD,KAEd,IAAI31C,MAAM,oBAAoBhN,EAAEvG,OAAOkpD,IAC/C,CACA,SAASX,GAAgBa,GACxB,OAAO,IAAI71C,MAAM,sBAAsB61C,IACxC,CAqJA,SAASH,GAAYxG,GACpB,OAAOA,EAAIlpC,QAAO+oC,GAvnBN,OAunBYA,GACzB,CAOA,SAASwF,GAAuBrF,EAAK4G,GACpC,IACIxB,EADA3jD,EAAO2hD,GAEPp6B,EAAMg3B,EAAIzmD,OACd,KAAOyvB,IACNvnB,EAAOA,EAAKjB,IAAIw/C,IAAMh3B,IACjBvnB,IAFM,CAGX,IAAI43B,EAACA,GAAK53B,EACN43B,IACH+rB,EAAQ/rB,EACJutB,GAAOA,EAAM7rD,QAAQilD,EAAI5nD,MAAM4wB,GAAK3hB,WACxC24C,EAAIzmD,OAASyvB,EAEd,CACD,OAAOo8B,CACR,CCtmCA,MAAMyB,GAAQ,IAAIh1C,WAAW,IAE7B,SAASi1C,GAAezgB,GAEpB,OADAzzB,EAA+B,IAAhByzB,EAAK9sC,OAAc,oCAAqC,OAAQ8sC,GACxEA,CACX,CACA,SAAS0gB,GAAa3/C,GAClB,MAAMiN,EAAQoD,EAsBX,SAAsBrQ,GACzB,IACI,GAAoB,IAAhBA,EAAK7N,OACL,MAAM,IAAIuX,MAAM,eAEpB,OAAO+zC,GAAcz9C,EACxB,CACD,MAAOyJ,GACH+B,GAAe,EAAO,qBAAqB/B,EAAMuB,WAAY,OAAQhL,EACxE,CACL,CAhC8B4/C,CAAa5/C,IACjC6/C,EAAQ,GACd,GAAoB,IAAhB7/C,EAAK7N,OACL,OAAO0tD,EAEX,IAAIhqD,EAAO,EACX,IAAK,IAAInD,EAAI,EAAGA,EAAIua,EAAM9a,OAAQO,IAAK,CAGzB,KAFAua,EAAMva,KAGZmtD,EAAMlsD,KAAK+rD,GAAezyC,EAAMjc,MAAM6E,EAAMnD,KAC5CmD,EAAOnD,EAAI,EAElB,CAID,OAFA8Y,EAAe3V,EAAOoX,EAAM9a,OAAQ,oCAAqC,OAAQ6N,GACjF6/C,EAAMlsD,KAAK+rD,GAAezyC,EAAMjc,MAAM6E,KAC/BgqD,CACX,CA4BO,SAASC,GAAS9/C,GACrBwL,EAAiC,iBAAV,EAAoB,iCAAkC,OAAQxL,GACrFwL,EAAexL,EAAK7N,OAAQ,iCAAkC,OAAQ6N,GACtE,IAAI2K,EAAS80C,GACb,MAAMI,EAAQF,GAAa3/C,GAC3B,KAAO6/C,EAAM1tD,QACTwY,EAASqhB,GAAU/iB,EAAO,CAAC0B,EAAQqhB,GAAW6zB,EAAMrlD,UAExD,OAAOwS,EAAQrC,EACnB,CAOO,SAASo1C,GAAU//C,EAAMggD,GAC5B,MAAM7tD,EAAwB,MAAd6tD,EAAsBA,EAAa,GAEnD,OADAx0C,EAAerZ,GAAU,IAAK,sCAAuC,SAAUA,GACxE6a,EAAQ/D,EAAO02C,GAAa3/C,GAAMxE,KAAKyjC,IAC1CzzB,EAAeyzB,EAAK9sC,QAAUA,EAAQ,SAAS4J,KAAKC,UAAUgE,cAAiB7N,UAAgB,OAAQ6N,GACvG,MAAMiN,EAAQ,IAAIxC,WAAWw0B,EAAK9sC,OAAS,GAG3C,OAFA8a,EAAMrM,IAAIq+B,EAAM,GAChBhyB,EAAM,GAAKA,EAAM9a,OAAS,EACnB8a,CAAK,MACT,IACX,CChFA,SAASgzC,GAAaC,EAAMC,GACxB,MAAO,CACHtU,QAASM,GAAW+T,GACpBC,YAAaA,EAAY3kD,KAAI,CAAC4kD,EAAYj5C,KACtCqE,EAAeqB,EAAYuzC,EAAY,IAAK,eAAgB,eAAej5C,KAAUi5C,GAC9EA,EAAW5uC,iBAG9B,CAIO,SAAS6uC,GAAch3C,GAC1B,GAAIzM,MAAM4N,QAAQnB,GACd,OAAOA,EAAM7N,KAAI,CAACoF,EAAKuG,IACfvK,MAAM4N,QAAQ5J,IACd4K,EAA8B,IAAf5K,EAAIzO,OAAc,mBAAoB,SAASgV,KAAUvG,GACjEq/C,GAAar/C,EAAI,GAAIA,EAAI,MAEpC4K,EAAsB,MAAP5K,GAAgC,mBAAU,2BAA4B,QAASyI,GACvF42C,GAAar/C,EAAIirC,QAASjrC,EAAIu/C,gBAG7C30C,EAAwB,MAATnC,GAAoC,mBAAU,sBAAuB,QAASA,GAC7F,MAAMsB,EAAS3X,OAAOU,KAAK2V,GAAO7N,KAAK0kD,IACnC,MAAMC,EAAc92C,EAAM62C,GAAMl2C,QAAO,CAACC,EAAOm2C,KAC3Cn2C,EAAMm2C,IAAc,EACbn2C,IACR,CAAE,GACL,OAAOg2C,GAAaC,EAAMltD,OAAOU,KAAKysD,GAAahkD,OAAO,IAG9D,OADAwO,EAAOxO,MAAK,CAACoD,EAAGkH,IAAOlH,EAAEssC,QAAQyU,cAAc75C,EAAEolC,WAC1ClhC,CACX,CC5BO,SAAS41C,GAAe3lD,GAC3B,IAAI4lD,EAOJ,OALIA,EADiB,iBAAT,EACC1V,GAAWC,iBAAiBnwC,GAAK,GAGjCA,EAAI0rC,UAEV6F,GAAWngB,GAAU,KAAOw0B,EAAO9zC,UAAU,IAAIA,UAAU,IACtE,CAKO,SAAS+zC,GAAe5gC,EAAQwmB,GACnC,OAAOka,GAAezV,GAAW3H,iBAAiBtjB,EAAQwmB,GAC9D,CFnBAoZ,GAAMhyC,KAAK,GGEX,MAAME,GAAO/C,OAAO,GACd6+B,GAAO7+B,OAAO,GACd8+B,GAAQ9+B,OAAO,IACf++B,GAAQ/+B,OAAO,IACfg/B,GAAQh/B,OAAO,IACf81C,GAAc91C,OAAO,sEACrB+1C,GAAY,OAClB,SAASC,GAAiB9oD,EAASrF,GAC/B,IAAIouD,EAAY/oD,EAAQvG,SAAS,IACjC,KAAOsvD,EAAU1uD,OAAS,GACtB0uD,EAAY,IAAMA,EAGtB,OADAA,GAAa58B,GAAOxxB,GAAMia,UAAU,GAC7B,KAAOm0C,CAClB,CACA,SAASC,GAAcz3C,GACnB,MAAc,OAAVA,EACO,KAEJ8iC,GAAW9iC,EACtB,CACA,SAAS03C,GAAiB13C,EAAO23C,GAC7B,IACI,OAAOX,GAAch3C,EACzB,CACA,MAAOI,GACH+B,GAAe,EAAO/B,EAAMuB,QAASg2C,EAAO33C,EAChD,CACJ,CACA,SAAS43C,GAAalzC,EAAQizC,GAC1B,MAAe,OAAXjzC,EACO,EAEJI,EAAUJ,EAAQizC,EAC7B,CACA,SAASE,GAAWnzC,EAAQizC,GACxB,GAAe,OAAXjzC,EACA,OAAOJ,GAEX,MAAMtE,EAAQ4E,EAAUF,EAAQizC,GAEhC,OADAx1C,EAAenC,GAASq3C,GAAa,0BAA2BM,EAAO33C,GAChEA,CACX,CACA,SAAS83C,GAAapzC,EAAQ/N,GAC1B,MAAMqJ,EAAQ4E,EAAUF,EAAQ,SAC1BpD,EAASoE,EAAU1F,GAEzB,OADAmC,EAAeb,EAAOxY,QAAU,GAAI,kBAAmB,MAAM6N,IAAQqJ,GAC9DsB,CACX,CACA,SAASy2C,GAAiB/3C,GACtB,OAAOg3C,GAAch3C,GAAO7N,KAAKoF,GAAQ,CAACA,EAAIirC,QAASjrC,EAAIu/C,cAC/D,CACA,SAASkB,GAAah4C,EAAO23C,GACzBx1C,EAAe5O,MAAM4N,QAAQnB,GAAQ,WAAW23C,IAAS,QAAS33C,GAClE,IAAK,IAAI3W,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9B8Y,EAAeqB,EAAYxD,EAAM3W,GAAI,IAAK,0BAA2B,SAASA,KAAM2W,EAAM3W,IAE9F,OAAO2W,CACX,CA8FA,SAASi4C,GAAmBC,EAAIC,GAC5B,IAAIvX,EACJ,IAEI,GADAA,EAAUgX,GAAaO,EAAO,GAAI,WAClB,IAAZvX,GAA6B,IAAZA,EACjB,MAAM,IAAIvgC,MAAM,cAExB,CACA,MAAOD,GACH+B,GAAe,EAAO,kBAAmB,UAAWg2C,EAAO,GAC/D,CACA,MAAMvsD,EAAIyY,EAAa8zC,EAAO,GAAI,IAC5BzvD,EAAI2b,EAAa8zC,EAAO,GAAI,IAC5Bnb,EAAYvD,GAAU9lC,KAAK,CAAE/H,IAAGlD,IAAGk4C,YACzCsX,EAAGlb,UAAYA,CACnB,CA2LO,MAAMob,GACTn4C,GACAhU,GACAnB,GACAutD,GACAC,GACAC,GACAC,GACAC,GACAz4C,GACAohC,GACAxQ,GACA8nB,GACAC,GACAC,GACAC,GACAC,GAOA,QAAI74C,GAAS,OAAO/T,MAAK+T,CAAO,CAChC,QAAIA,CAAKD,GACL,OAAQA,GACJ,KAAK,KACD9T,MAAK+T,EAAQ,KACb,MACJ,KAAK,EACL,IAAK,SACD/T,MAAK+T,EAAQ,EACb,MACJ,KAAK,EACL,IAAK,SACL,IAAK,WACD/T,MAAK+T,EAAQ,EACb,MACJ,KAAK,EACL,IAAK,SACL,IAAK,WACD/T,MAAK+T,EAAQ,EACb,MACJ,KAAK,EACL,IAAK,SACL,IAAK,WACD/T,MAAK+T,EAAQ,EACb,MACJ,QACIkC,GAAe,EAAO,+BAAgC,OAAQnC,GAE1E,CAIA,YAAI+4C,GACA,OAAQ7sD,KAAK+T,MACT,KAAK,EAAG,MAAO,SACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WACf,KAAK,EAAG,MAAO,WAEnB,OAAO,IACX,CAKA,MAAIhU,GACA,MAAM+T,EAAQ9T,MAAKD,EACnB,OAAa,MAAT+T,GAA+B,IAAd9T,KAAK+T,KACfigC,GAEJlgC,CACX,CACA,MAAI/T,CAAG+T,GACH9T,MAAKD,EAAgB,MAAT+T,EAAiB,KAAO8iC,GAAW9iC,EACnD,CAIA,SAAIq4C,GAAU,OAAOnsD,MAAKmsD,CAAQ,CAClC,SAAIA,CAAMr4C,GAAS9T,MAAKmsD,EAASvzC,EAAU9E,EAAO,QAAU,CAI5D,YAAIs4C,GAAa,OAAOpsD,MAAKosD,CAAW,CACxC,YAAIA,CAASt4C,GAAS9T,MAAKosD,EAAY1zC,EAAU5E,EAAQ,CAOzD,YAAIu4C,GACA,MAAMv4C,EAAQ9T,MAAKqsD,EACnB,OAAa,MAATv4C,GAAgC,IAAd9T,KAAK+T,MAA4B,IAAd/T,KAAK+T,KAGvCD,EAFIsE,EAGf,CACA,YAAIi0C,CAASv4C,GACT9T,MAAKqsD,EAAsB,MAATv4C,EAAiB,KAAO4E,EAAU5E,EAAO,WAC/D,CAKA,wBAAIw4C,GACA,MAAMx4C,EAAQ9T,MAAKssD,EACnB,OAAa,MAATx4C,EACkB,IAAd9T,KAAK+T,MAA4B,IAAd/T,KAAK+T,KACjBqE,GAEJ,KAEJtE,CACX,CACA,wBAAIw4C,CAAqBx4C,GACrB9T,MAAKssD,EAAkC,MAATx4C,EAAiB,KAAO4E,EAAU5E,EAAO,uBAC3E,CAKA,gBAAIy4C,GACA,MAAMz4C,EAAQ9T,MAAKusD,EACnB,OAAa,MAATz4C,EACkB,IAAd9T,KAAK+T,MAA4B,IAAd/T,KAAK+T,KACjBqE,GAEJ,KAEJtE,CACX,CACA,gBAAIy4C,CAAaz4C,GACb9T,MAAKusD,EAA0B,MAATz4C,EAAiB,KAAO4E,EAAU5E,EAAO,eACnE,CAKA,QAAIlV,GAAS,OAAOoB,MAAKpB,CAAO,CAChC,QAAIA,CAAKkV,GAAS9T,MAAKpB,EAAQ6Y,EAAQ3D,EAAQ,CAI/C,SAAIA,GAAU,OAAO9T,MAAK8T,CAAQ,CAClC,SAAIA,CAAMA,GACN9T,MAAK8T,EAAS4E,EAAU5E,EAAO,QACnC,CAIA,WAAIohC,GAAY,OAAOl1C,MAAKk1C,CAAU,CACtC,WAAIA,CAAQphC,GAAS9T,MAAKk1C,EAAWx8B,EAAU5E,EAAQ,CAIvD,aAAIg9B,GAAc,OAAO9wC,MAAK0kC,GAAQ,IAAM,CAC5C,aAAIoM,CAAUh9B,GACV9T,MAAK0kC,EAAiB,MAAT5wB,EAAiB,KAAOy5B,GAAU9lC,KAAKqM,EACxD,CAOA,cAAI04C,GACA,MAAM14C,EAAQ9T,MAAKwsD,GAAe,KAClC,OAAa,MAAT14C,EACkB,IAAd9T,KAAK+T,MAA4B,IAAd/T,KAAK+T,MAA4B,IAAd/T,KAAK+T,KAGpC,GAEJ,KAEJD,CACX,CACA,cAAI04C,CAAW14C,GACX9T,MAAKwsD,EAAwB,MAAT14C,EAAiB,KAAOg3C,GAAch3C,EAC9D,CAIA,oBAAI24C,GACA,MAAM34C,EAAQ9T,MAAKysD,EACnB,OAAa,MAAT34C,GAA+B,IAAd9T,KAAK+T,KACfqE,GAEJtE,CACX,CACA,oBAAI24C,CAAiB34C,GACjB9T,MAAKysD,EAA8B,MAAT34C,EAAiB,KAAO4E,EAAU5E,EAAO,mBACvE,CAIA,uBAAI44C,GAGA,IAAI54C,EAAQ9T,MAAK0sD,EACjB,OAAa,MAAT54C,GAA+B,IAAd9T,KAAK+T,KACf,GAEJD,CACX,CACA,uBAAI44C,CAAoB54C,GACpB,GAAa,MAATA,EAAe,CACfmC,EAAe5O,MAAM4N,QAAQnB,GAAQ,uCAAwC,QAASA,GACtFA,EAAQA,EAAMrY,QACd,IAAK,IAAI0B,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9B8Y,EAAeqB,EAAYxD,EAAM3W,GAAI,IAAK,4BAA6B,SAASA,KAAM2W,EAAM3W,GAEpG,CACA6C,MAAK0sD,EAAuB54C,CAChC,CA6BA,SAAI84C,GACA,OAAmB,MAAf5sD,MAAK4sD,EACE,KAEJ5sD,MAAK4sD,EAAO3mD,KAAKiL,GAAMzT,OAAOsY,OAAO,CAAA,EAAI7E,IACpD,CACA,SAAI07C,CAAME,GACN,GAAc,MAAVA,EAEA,YADA9sD,MAAK4sD,EAAS,MAGlB,MAAMA,EAAQ,GACRG,EAAkB,GACxB,IAAK,IAAI5vD,EAAI,EAAGA,EAAI2vD,EAAOlwD,OAAQO,IAAK,CACpC,MAAM6vD,EAAOF,EAAO3vD,GACpB,GAAIoa,EAAYy1C,GAAO,CACnBh3C,EAAOhW,MAAK2sD,EAAM,2CAA4C,wBAAyB,CACnFj2C,UAAW,gBAEf,IAAI9X,EAAOwY,EAAS41C,GAGpB,GAFA/2C,EAAerX,EAAKhC,QAAUwuD,GAAW,oBAAqB,SAASjuD,KAAM6vD,GAEzEpuD,EAAKhC,SAAWwuD,GAAW,CAC3B,MAAM6B,EAAS,IAAI/3C,WAAWk2C,IAC9B6B,EAAO5hD,IAAIzM,GACXA,EAAOquD,CACX,CACA,MAAMC,EAASltD,MAAK2sD,EAAKQ,oBAAoBvuD,GACvCwuD,EAAQ31C,EAAQzX,MAAK2sD,EAAKU,oBAAoBzuD,EAAMsuD,IAC1DN,EAAMxuD,KAAK,CACPQ,KAAM6Y,EAAQ7Y,GACd0uD,WAAY71C,EAAQy1C,GACpBE,UAEJL,EAAgB3uD,KAAKitD,GAAiB,EAAG6B,GAC7C,KACK,CACD,MAAMA,EAASz1C,EAAQu1C,EAAKM,YAC5BV,EAAMxuD,KAAK,CACPQ,KAAM6Y,EAAQu1C,EAAKpuD,MACnB0uD,WAAYJ,EACZE,MAAO31C,EAAQu1C,EAAKI,SAExBL,EAAgB3uD,KAAKitD,GAAiB,EAAG6B,GAC7C,CACJ,CACAltD,MAAK4sD,EAASA,EACd5sD,MAAK0sD,EAAuBK,CAChC,CACA,OAAIJ,GAAQ,OAAO3sD,MAAK2sD,CAAM,CAC9B,OAAIA,CAAIA,GACJ3sD,MAAK2sD,EAAOA,CAChB,CAIA,WAAA9uD,GACImC,MAAK+T,EAAQ,KACb/T,MAAKD,EAAM,KACXC,MAAKmsD,EAAS,EACdnsD,MAAKosD,EAAYh0C,GACjBpY,MAAKqsD,EAAY,KACjBrsD,MAAKssD,EAAwB,KAC7BtsD,MAAKusD,EAAgB,KACrBvsD,MAAKpB,EAAQ,KACboB,MAAK8T,EAASsE,GACdpY,MAAKk1C,EAAW98B,GAChBpY,MAAK0kC,EAAO,KACZ1kC,MAAKwsD,EAAc,KACnBxsD,MAAKysD,EAAoB,KACzBzsD,MAAK0sD,EAAuB,KAC5B1sD,MAAK4sD,EAAS,KACd5sD,MAAK2sD,EAAO,IAChB,CAIA,QAAIzvD,GACA,OAAsB,MAAlB8C,KAAK8wC,UACE,KAEJra,GAAUz2B,MAAKutD,IAAe,GAAM,GAC/C,CAOA,gBAAIC,GACA,OAAO/2B,GAAUz2B,KAAKytD,mBAC1B,CAIA,QAAIhmD,GACA,OAAsB,MAAlBzH,KAAK8wC,UACE,KAEJoa,GAAelrD,KAAKwtD,aAAcxtD,KAAK8wC,UAClD,CAIA,iBAAI4c,GACA,OAAsB,MAAlB1tD,KAAK8wC,UACE,KAEJyE,GAAW3H,iBAAiB5tC,KAAKwtD,aAAcxtD,KAAK8wC,UAC/D,CAOA,QAAA6c,GACI,OAAyB,MAAlB3tD,KAAK8wC,SAChB,CACA,GAAAyc,CAAe/V,EAAQoW,GACnB53C,GAAQwhC,GAA4B,MAAlBx3C,KAAK8wC,UAAmB,6EAA8E,wBAAyB,CAAEp6B,UAAW,gBAC9J,MAAMguB,EAAM8S,EAASx3C,KAAK8wC,UAAY,KACtC,OAAQ9wC,KAAK6tD,aACT,KAAK,EACD,OAhnBhB,SAA0B7B,EAAItnB,GAC1B,MAAMunB,EAAS,CACXL,GAAaI,EAAGG,MAAO,SACvBP,GAAaI,EAAGK,UAAY,EAAG,YAC/BT,GAAaI,EAAGI,SAAU,YACzBJ,EAAGjsD,IAAM,KACV6rD,GAAaI,EAAGl4C,MAAO,SACvBk4C,EAAGptD,MAEP,IAAIs2C,EAAU98B,GACd,GAAI4zC,EAAG9W,SAAW98B,GAEd88B,EAAUx8B,EAAUszC,EAAG9W,QAAS,cAGhCj/B,GAAgByuB,GAAuB,MAAhBA,EAAI6P,UAAoB7P,EAAI8P,gBAAkBU,EAAS,4BAA6B,MAAOxQ,QAEjH,GAAIsnB,EAAGlb,UAAW,CAEnB,MAAMgd,EAAS9B,EAAGlb,UAAU0D,cACd,MAAVsZ,IACA5Y,EAAU4Y,EAElB,CAEA,IAAKppB,EAOD,OALIwQ,IAAY98B,KACZ6zC,EAAO7tD,KAAKob,EAAU07B,IACtB+W,EAAO7tD,KAAK,MACZ6tD,EAAO7tD,KAAK,OAET0lB,GAAUmoC,GAMrB,IAAIxrD,EAAI4U,OAAO,GAAKqvB,EAAIgQ,SAWxB,OAVIQ,IAAY98B,GACZ3X,EAAI8sC,GAAU0H,YAAYC,EAASxQ,EAAIjkC,GAElC4U,OAAOqvB,EAAIjkC,KAAOA,GACvBwV,GAAe,EAAO,4BAA6B,MAAOyuB,GAG9DunB,EAAO7tD,KAAKob,EAAU/Y,IACtBwrD,EAAO7tD,KAAKob,EAAUkrB,EAAIhlC,IAC1BusD,EAAO7tD,KAAKob,EAAUkrB,EAAIloC,IACnBsnB,GAAUmoC,EACrB,CA8jBuB8B,CAAiB/tD,KAAM0kC,GAClC,KAAK,EACD,OA9ehB,SAA2BsnB,EAAItnB,GAC3B,MAAMunB,EAAS,CACXL,GAAaI,EAAG9W,QAAS,WACzB0W,GAAaI,EAAGG,MAAO,SACvBP,GAAaI,EAAGK,UAAY,EAAG,YAC/BT,GAAaI,EAAGI,SAAU,YACzBJ,EAAGjsD,IAAM,KACV6rD,GAAaI,EAAGl4C,MAAO,SACvBk4C,EAAGptD,KACHitD,GAAiBG,EAAGQ,YAAc,KAOtC,OALI9nB,IACAunB,EAAO7tD,KAAKwtD,GAAalnB,EAAIgQ,QAAS,kBACtCuX,EAAO7tD,KAAKob,EAAUkrB,EAAIhlC,IAC1BusD,EAAO7tD,KAAKob,EAAUkrB,EAAIloC,KAEvBkX,EAAO,CAAC,OAAQoQ,GAAUmoC,IACrC,CA6duB+B,CAAkBhuD,KAAM0kC,GACnC,KAAK,EACD,OAzhBhB,SAA2BsnB,EAAItnB,GAC3B,MAAMunB,EAAS,CACXL,GAAaI,EAAG9W,QAAS,WACzB0W,GAAaI,EAAGG,MAAO,SACvBP,GAAaI,EAAGM,sBAAwB,EAAG,wBAC3CV,GAAaI,EAAGO,cAAgB,EAAG,gBACnCX,GAAaI,EAAGI,SAAU,YACzBJ,EAAGjsD,IAAM,KACV6rD,GAAaI,EAAGl4C,MAAO,SACvBk4C,EAAGptD,KACHitD,GAAiBG,EAAGQ,YAAc,KAOtC,OALI9nB,IACAunB,EAAO7tD,KAAKwtD,GAAalnB,EAAIgQ,QAAS,YACtCuX,EAAO7tD,KAAKob,EAAUkrB,EAAIhlC,IAC1BusD,EAAO7tD,KAAKob,EAAUkrB,EAAIloC,KAEvBkX,EAAO,CAAC,OAAQoQ,GAAUmoC,IACrC,CAugBuBgC,CAAkBjuD,KAAM0kC,GACnC,KAAK,EACD,OAvahB,SAA2BsnB,EAAItnB,EAAKkoB,GAChC,MAAMX,EAAS,CACXL,GAAaI,EAAG9W,QAAS,WACzB0W,GAAaI,EAAGG,MAAO,SACvBP,GAAaI,EAAGM,sBAAwB,EAAG,wBAC3CV,GAAaI,EAAGO,cAAgB,EAAG,gBACnCX,GAAaI,EAAGI,SAAU,YACzBJ,EAAGjsD,IAAMi0C,GACV4X,GAAaI,EAAGl4C,MAAO,SACvBk4C,EAAGptD,KACHitD,GAAiBG,EAAGQ,YAAc,IAClCZ,GAAaI,EAAGS,kBAAoB,EAAG,oBACvCX,GAAaE,EAAGU,qBAAuB,GAAI,wBAE/C,OAAIhoB,IACAunB,EAAO7tD,KAAKwtD,GAAalnB,EAAIgQ,QAAS,YACtCuX,EAAO7tD,KAAKob,EAAUkrB,EAAIhlC,IAC1BusD,EAAO7tD,KAAKob,EAAUkrB,EAAIloC,IAEtBowD,GACOl5C,EAAO,CACV,OACAoQ,GAAU,CACNmoC,EACAW,EAAM3mD,KAAKiL,GAAMA,EAAEtS,OACnBguD,EAAM3mD,KAAKiL,GAAMA,EAAEo8C,aACnBV,EAAM3mD,KAAKiL,GAAMA,EAAEk8C,YAK5B15C,EAAO,CAAC,OAAQoQ,GAAUmoC,IACrC,CAuYuBiC,CAAkBluD,KAAM0kC,EAAKkpB,EAAU5tD,KAAK4sD,MAAQ,MAEnE52C,GAAO,EAAO,+BAAgC,wBAAyB,CAAEU,UAAW,eACxF,CAOA,cAAIm+B,GACA,OAAO70C,MAAKutD,IAAe,GAAM,EACrC,CAOA,sBAAIE,GACA,OAAOztD,MAAKutD,IAAe,GAAO,EACtC,CAKA,SAAAM,GACI,MAAM75C,EAAQhU,KAAKmuD,aAEnB,OAAIn6C,EAAM9V,QAAQ,IAAM,EACb,EAGH8V,EAAM/O,KAClB,CAKA,UAAAkpD,GAEI,MAAMC,EAA+B,MAAjBpuD,KAAKqsD,SACnBgC,EAA+B,MAArBruD,KAAKusD,cAAqD,MAA7BvsD,KAAKssD,qBAC5CgC,EAAoC,MAAnBtuD,KAAKwsD,WACtB+B,EAAqC,MAA1BvuD,MAAKysD,GAA6BzsD,MAAK0sD,EAI/B,MAArB1sD,KAAKusD,cAAqD,MAA7BvsD,KAAKssD,sBAClCt2C,EAAOhW,KAAKusD,cAAgBvsD,KAAKssD,qBAAsB,yCAA0C,WAAY,CAAEx4C,MAAO9T,OAK1HgW,GAAQq4C,GAAyB,IAAdruD,KAAK+T,MAA4B,IAAd/T,KAAK+T,KAAa,oEAAqE,WAAY,CAAED,MAAO9T,OAClJgW,EAAqB,IAAdhW,KAAK+T,OAAeu6C,EAAe,4CAA6C,WAAY,CAAEx6C,MAAO9T,OAC5G,MAAMgU,EAAQ,GA8Bd,OA5BiB,MAAbhU,KAAK+T,KACLC,EAAM5V,KAAK4B,KAAK+T,MAGZs6C,EACAr6C,EAAM5V,KAAK,GAENgwD,GACLp6C,EAAM5V,KAAK,GACNkwD,GACDt6C,EAAM5V,KAAK,IAGVkwD,GACLt6C,EAAM5V,KAAK,GACX4V,EAAM5V,KAAK,KAENmwD,GAAWvuD,KAAKD,KAIrBiU,EAAM5V,KAAK,GACX4V,EAAM5V,KAAK,GACX4V,EAAM5V,KAAK,IALX4V,EAAM5V,KAAK,IASnB4V,EAAMpN,OACCoN,CACX,CAQA,QAAAw6C,GACI,OAAsB,IAAdxuD,KAAK+T,IACjB,CAQA,QAAA06C,GACI,OAAsB,IAAdzuD,KAAK+T,IACjB,CAQA,QAAA26C,GACI,OAAsB,IAAd1uD,KAAK+T,IACjB,CAQA,QAAA46C,GACI,OAAsB,IAAd3uD,KAAK+T,IACjB,CAIA,KAAAmN,GACI,OAAOgrC,GAAYzkD,KAAKzH,KAC5B,CAIA,MAAAyC,GACI,MAAMjG,EAAKiE,GACE,MAALA,EACO,KAEJA,EAAEzE,WAEb,MAAO,CACH+X,KAAM/T,KAAK+T,KACXhU,GAAIC,KAAKD,GAETnB,KAAMoB,KAAKpB,KACXutD,MAAOnsD,KAAKmsD,MACZC,SAAU5vD,EAAEwD,KAAKosD,UACjBC,SAAU7vD,EAAEwD,KAAKqsD,UACjBC,qBAAsB9vD,EAAEwD,KAAKssD,sBAC7BC,aAAc/vD,EAAEwD,KAAKusD,cACrBz4C,MAAOtX,EAAEwD,KAAK8T,OACdohC,QAAS14C,EAAEwD,KAAKk1C,SAChBxQ,IAAK1kC,KAAK8wC,UAAY9wC,KAAK8wC,UAAUruC,SAAW,KAChD+pD,WAAYxsD,KAAKwsD,WAEzB,CAKA,WAAO/kD,CAAKukD,GACR,GAAU,MAANA,EACA,OAAO,IAAIE,GAEf,GAAoB,iBAAR,EAAkB,CAC1B,MAAMvoC,EAAUvM,EAAS40C,GACzB,GAAIroC,EAAQ,IAAM,IACd,OAAOuoC,GAAYzkD,KA30BnC,SAAsB7I,GAClB,MAAMqtD,EAAS3oC,GAAU1kB,GACzBqX,EAAe5O,MAAM4N,QAAQg3C,KAA8B,IAAlBA,EAAOrvD,QAAkC,IAAlBqvD,EAAOrvD,QAAe,6CAA8C,OAAQgC,GAC5I,MAAMotD,EAAK,CACPj4C,KAAM,EACNo4C,MAAOT,GAAaO,EAAO,GAAI,SAC/BI,SAAUV,GAAWM,EAAO,GAAI,YAChCG,SAAUT,GAAWM,EAAO,GAAI,YAChClsD,GAAIwrD,GAAcU,EAAO,IACzBn4C,MAAO63C,GAAWM,EAAO,GAAI,SAC7BrtD,KAAM6Y,EAAQw0C,EAAO,IACrB/W,QAAS98B,IAGb,GAAsB,IAAlB6zC,EAAOrvD,OACP,OAAOovD,EAEX,MAAMvrD,EAAIkrD,GAAWM,EAAO,GAAI,KAC1BvsD,EAAIisD,GAAWM,EAAO,GAAI,KAC1BzvD,EAAImvD,GAAWM,EAAO,GAAI,KAChC,GAAIvsD,IAAM0Y,IAAQ5b,IAAM4b,GAEpB4zC,EAAG9W,QAAUz0C,MAEZ,CAED,IAAIy0C,GAAWz0C,EAAI4zC,IAASH,GACxBgB,EAAU98B,KACV88B,EAAU98B,IAEd4zC,EAAG9W,QAAUA,EAEbj/B,EAAei/B,IAAY98B,IAAS3X,IAAM0zC,IAAS1zC,IAAM2zC,GAAQ,yBAA0B,IAAK6X,EAAO,IACvGD,EAAGlb,UAAYvD,GAAU9lC,KAAK,CAC1B/H,EAAGyY,EAAa8zC,EAAO,GAAI,IAC3BzvD,EAAG2b,EAAa8zC,EAAO,GAAI,IAC3BxrD,KAGR,CACA,OAAOurD,CACX,CAkyBwC4C,CAAajrC,IAEzC,OAAQA,EAAQ,IACZ,KAAK,EAAG,OAAOuoC,GAAYzkD,KAtrB3C,SAAuB7I,GACnB,MAAMqtD,EAAS3oC,GAAUlM,EAASxY,GAAMnD,MAAM,IAC9Cwa,EAAe5O,MAAM4N,QAAQg3C,KAA8B,IAAlBA,EAAOrvD,QAAkC,KAAlBqvD,EAAOrvD,QAAgB,8CAA+C,OAAQ6a,EAAQ7Y,IACtJ,MAAMotD,EAAK,CACPj4C,KAAM,EACNmhC,QAASyW,GAAWM,EAAO,GAAI,WAC/BE,MAAOT,GAAaO,EAAO,GAAI,SAC/BI,SAAUV,GAAWM,EAAO,GAAI,YAChCG,SAAUT,GAAWM,EAAO,GAAI,YAChClsD,GAAIwrD,GAAcU,EAAO,IACzBn4C,MAAO63C,GAAWM,EAAO,GAAI,SAC7BrtD,KAAM6Y,EAAQw0C,EAAO,IACrBO,WAAYhB,GAAiBS,EAAO,GAAI,eAG5C,OAAsB,IAAlBA,EAAOrvD,QAIXmvD,GAAmBC,EAAIC,EAAOxwD,MAAM,IAHzBuwD,CAKf,CAiqBgD6C,CAAclrC,IAC9C,KAAK,EAAG,OAAOuoC,GAAYzkD,KAluB3C,SAAuB7I,GACnB,MAAMqtD,EAAS3oC,GAAUlM,EAASxY,GAAMnD,MAAM,IAC9Cwa,EAAe5O,MAAM4N,QAAQg3C,KAA8B,IAAlBA,EAAOrvD,QAAkC,KAAlBqvD,EAAOrvD,QAAgB,8CAA+C,OAAQ6a,EAAQ7Y,IACtJ,MAAMotD,EAAK,CACPj4C,KAAM,EACNmhC,QAASyW,GAAWM,EAAO,GAAI,WAC/BE,MAAOT,GAAaO,EAAO,GAAI,SAC/BK,qBAAsBX,GAAWM,EAAO,GAAI,wBAC5CM,aAAcZ,GAAWM,EAAO,GAAI,gBACpCI,SAAU,KACVD,SAAUT,GAAWM,EAAO,GAAI,YAChClsD,GAAIwrD,GAAcU,EAAO,IACzBn4C,MAAO63C,GAAWM,EAAO,GAAI,SAC7BrtD,KAAM6Y,EAAQw0C,EAAO,IACrBO,WAAYhB,GAAiBS,EAAO,GAAI,eAG5C,OAAsB,IAAlBA,EAAOrvD,QAIXmvD,GAAmBC,EAAIC,EAAOxwD,MAAM,IAHzBuwD,CAKf,CA2sBgD8C,CAAcnrC,IAC9C,KAAK,EAAG,OAAOuoC,GAAYzkD,KAhpB3C,SAAuB7I,GACnB,IAAIqtD,EAAS3oC,GAAUlM,EAASxY,GAAMnD,MAAM,IACxCoxD,EAAW,IACXD,EAAQ,KAEZ,GAAsB,IAAlBX,EAAOrvD,QAAgByK,MAAM4N,QAAQg3C,EAAO,IAAK,CACjDY,EAAW,qBACX,MAAMkC,EAAS9C,EAAO,GAAI+C,EAAW/C,EAAO,GAAIgD,EAAUhD,EAAO,GACjEh2C,EAAe5O,MAAM4N,QAAQ85C,GAAS,6CAA8C,YAAaA,GACjG94C,EAAe5O,MAAM4N,QAAQ+5C,GAAW,mDAAoD,YAAaA,GACzG/4C,EAAe5O,MAAM4N,QAAQg6C,GAAU,8CAA+C,YAAaA,GACnGh5C,EAAe84C,EAAOnyD,SAAWoyD,EAASpyD,OAAQ,4DAA6D,SAAUqvD,GACzHh2C,EAAe84C,EAAOnyD,SAAWqyD,EAAQryD,OAAQ,uDAAwD,SAAUqvD,GACnHW,EAAQ,GACR,IAAK,IAAIzvD,EAAI,EAAGA,EAAI8uD,EAAO,GAAGrvD,OAAQO,IAClCyvD,EAAMxuD,KAAK,CACPQ,KAAMmwD,EAAO5xD,GACbmwD,WAAY0B,EAAS7xD,GACrBiwD,MAAO6B,EAAQ9xD,KAGvB8uD,EAASA,EAAO,EACpB,CACAh2C,EAAe5O,MAAM4N,QAAQg3C,KAA8B,KAAlBA,EAAOrvD,QAAmC,KAAlBqvD,EAAOrvD,QAAgB,6CAA6CiwD,IAAY,OAAQp1C,EAAQ7Y,IACjK,MAAMotD,EAAK,CACPj4C,KAAM,EACNmhC,QAASyW,GAAWM,EAAO,GAAI,WAC/BE,MAAOT,GAAaO,EAAO,GAAI,SAC/BK,qBAAsBX,GAAWM,EAAO,GAAI,wBAC5CM,aAAcZ,GAAWM,EAAO,GAAI,gBACpCI,SAAU,KACVD,SAAUT,GAAWM,EAAO,GAAI,YAChClsD,GAAIwrD,GAAcU,EAAO,IACzBn4C,MAAO63C,GAAWM,EAAO,GAAI,SAC7BrtD,KAAM6Y,EAAQw0C,EAAO,IACrBO,WAAYhB,GAAiBS,EAAO,GAAI,cACxCQ,iBAAkBd,GAAWM,EAAO,GAAI,oBACxCS,oBAAqBT,EAAO,KAE5BW,IACAZ,EAAGY,MAAQA,GAEf32C,EAAwB,MAAT+1C,EAAGjsD,GAAY,yCAAyC8sD,IAAY,OAAQjuD,GAC3FqX,EAAe5O,MAAM4N,QAAQ+2C,EAAGU,qBAAsB,gDAAiD,OAAQ9tD,GAC/G,IAAK,IAAIzB,EAAI,EAAGA,EAAI6uD,EAAGU,oBAAoB9vD,OAAQO,IAC/C8Y,EAAeqB,EAAY00C,EAAGU,oBAAoBvvD,GAAI,IAAK,sCAAsCA,uBAAwB,OAAQyB,GAGrI,OAAsB,KAAlBqtD,EAAOrvD,QAMXmvD,GAAmBC,EAAIC,EAAOxwD,MAAM,KALzBuwD,CAOf,CAwlBgDkD,CAAcvrC,IAElD3N,GAAO,EAAO,+BAAgC,wBAAyB,CAAEU,UAAW,QACxF,CACA,MAAMtB,EAAS,IAAI82C,GA4DnB,OA3De,MAAXF,EAAGj4C,OACHqB,EAAOrB,KAAOi4C,EAAGj4C,MAER,MAATi4C,EAAGjsD,KACHqV,EAAOrV,GAAKisD,EAAGjsD,IAEH,MAAZisD,EAAGG,QACH/2C,EAAO+2C,MAAQH,EAAGG,OAEH,MAAfH,EAAGI,WACHh3C,EAAOg3C,SAAWJ,EAAGI,UAEN,MAAfJ,EAAGK,WACHj3C,EAAOi3C,SAAWL,EAAGK,UAEM,MAA3BL,EAAGM,uBACHl3C,EAAOk3C,qBAAuBN,EAAGM,sBAEd,MAAnBN,EAAGO,eACHn3C,EAAOm3C,aAAeP,EAAGO,cAEF,MAAvBP,EAAGS,mBACHr3C,EAAOq3C,iBAAmBT,EAAGS,kBAElB,MAAXT,EAAGptD,OACHwW,EAAOxW,KAAOotD,EAAGptD,MAEL,MAAZotD,EAAGl4C,QACHsB,EAAOtB,MAAQk4C,EAAGl4C,OAEJ,MAAdk4C,EAAG9W,UACH9/B,EAAO8/B,QAAU8W,EAAG9W,SAEJ,MAAhB8W,EAAGlb,YACH17B,EAAO07B,UAAYvD,GAAU9lC,KAAKukD,EAAGlb,YAEpB,MAAjBkb,EAAGQ,aACHp3C,EAAOo3C,WAAaR,EAAGQ,YAGG,MAA1BR,EAAGU,sBACHt3C,EAAOs3C,oBAAsBV,EAAGU,qBAItB,MAAVV,EAAGW,MACHv3C,EAAOu3C,IAAMX,EAAGW,KAEJ,MAAZX,EAAGY,QACHx3C,EAAOw3C,MAAQZ,EAAGY,OAEP,MAAXZ,EAAG9uD,OACH+Y,EAAeb,EAAOu4C,WAAY,6CAA8C,KAAM3B,GACtF/1C,EAAeb,EAAOlY,OAAS8uD,EAAG9uD,KAAM,gBAAiB,KAAM8uD,IAEpD,MAAXA,EAAGvkD,OACHwO,EAAeb,EAAOu4C,WAAY,6CAA8C,KAAM3B,GACtF/1C,EAAeb,EAAO3N,KAAKwU,iBAAmB+vC,EAAGvkD,MAAQ,IAAIwU,cAAe,gBAAiB,KAAM+vC,IAEhG52C,CACX,ECl7BG,SAAS+5C,GAAY15C,GAIxB,MAHyB,iBAAb,IACRA,EAAUqF,EAAYrF,IAEnBghB,GAAU/iB,EAAO,CACpBoH,ECzBqB,+BD0BrBA,EAAY1e,OAAOqZ,EAAQ7Y,SAC3B6Y,IAER,CEnCA,MAAM25C,GAAU,IAAIl6C,WAAW,IAC/Bk6C,GAAQl3C,KAAK,GACb,MAAMm3C,GAAQh6C,QAAQ,GAChB+C,GAAO/C,OAAO,GACdgD,GAAOhD,OAAO,GACd+qC,GAAiB/qC,OAAO,sEAW9B,MAAMi6C,GAAU/1C,EAAQlB,GAAM,IACxBk3C,GAAWh2C,EAAQnB,GAAM,IACzBo3C,GAAmB,CACrB/kD,KAAM,SACNlI,QAAS,SACT2yC,QAAS,UACTua,kBAAmB,UACnB5jC,KAAM,WAEJ6jC,GAAmB,CACrB,OAAQ,UAAW,UAAW,oBAAqB,QAEvD,SAASC,GAAYtqD,GACjB,OAAO,SAAUyO,GAEb,OADAmC,EAAkC,iBAAX,EAAqB,4BAA4BzP,KAAKC,UAAUpB,KAAQ,UAAUA,IAAOyO,GACzGA,CACf,CACA,CACA,MAAM87C,GAAe,CACjBnlD,KAAMklD,GAAY,QAClBptD,QAASotD,GAAY,WACrBza,QAAS,SAAU18B,GACf,MAAM1E,EAAQ4E,EAAUF,EAAQ,kBAEhC,OADAvC,EAAenC,GAAS,EAAG,mBAAoB,iBAAkB0E,GAC7DW,OAAOwO,cAAc7T,GACdqF,OAAOrF,GAEX4F,EAAW5F,EACrB,EACD27C,kBAAmB,SAAU37C,GACzB,IACI,OAAO8iC,GAAW9iC,GAAOmI,aAC5B,CACD,MAAO/H,GAAU,CACjB+B,GAAe,EAAO,2CAA4C,2BAA4BnC,EACjG,EACD+X,KAAM,SAAU/X,GACZ,MAAM4D,EAAQN,EAAStD,EAAO,eAE9B,OADAmC,EAAgC,KAAjByB,EAAM9a,OAAe,8BAA+B,cAAekX,GAC3E2D,EAAQC,EAClB,GAEL,SAASm4C,GAAe97C,GAEpB,CACI,MAAMlX,EAAQkX,EAAKlX,MAAM,kBACzB,GAAIA,EAAO,CACP,MAAM26C,EAAuB,KAAb36C,EAAM,GAChB8b,EAAQzB,SAASra,EAAM,IAC7BoZ,EAAe0C,EAAQ,GAAM,GAAe,IAAVA,GAAeA,GAAS,KAAO9b,EAAM,KAAOT,OAAOuc,GAAQ,wBAAyB,OAAQ5E,GAC9H,MAAM+7C,EAAc/2C,EAAKqnC,GAAgB5I,EAAU7+B,EAAQ,EAAKA,GAC1Do3C,EAAcvY,GAAWsY,EAAcz3C,IAAQg3C,GAASj3C,GAC9D,OAAO,SAAUI,GACb,MAAM1E,EAAQ4E,EAAUF,EAAQ,SAEhC,OADAvC,EAAenC,GAASi8C,GAAej8C,GAASg8C,EAAa,2BAA2B/7C,IAAQ,QAASD,GAClGyF,EAAQi+B,EAASj/B,EAAOzE,EAAO,KAAOA,EAAO,GACpE,CACS,CACJ,CAED,CACI,MAAMjX,EAAQkX,EAAKlX,MAAM,gBACzB,GAAIA,EAAO,CACP,MAAM8b,EAAQzB,SAASra,EAAM,IAE7B,OADAoZ,EAAyB,IAAV0C,GAAeA,GAAS,IAAM9b,EAAM,KAAOT,OAAOuc,GAAQ,sBAAuB,OAAQ5E,GACjG,SAAUD,GAGb,OADAmC,EADcmB,EAAStD,GACFlX,SAAW+b,EAAO,sBAAsB5E,IAAQ,QAASD,GA3E9F,SAAqBA,GACjB,MAAM4D,EAAQN,EAAStD,GACjB8Y,EAAYlV,EAAM9a,OAAS,GACjC,OAAIgwB,EACOlZ,EAAO,CAACgE,EAAO03C,GAAQ3zD,MAAMmxB,KAEjCnV,EAAQC,EACnB,CAqEuBs4C,CAAYl8C,EACnC,CACS,CACJ,CACD,OAAQC,GACJ,IAAK,UAAW,OAAO,SAAUD,GAC7B,OAAOqE,EAAay+B,GAAW9iC,GAAQ,GACnD,EACQ,IAAK,OAAQ,OAAO,SAAUA,GAC1B,OAAUA,EAAoBw7C,GAAXC,EAC/B,EACQ,IAAK,QAAS,OAAO,SAAUz7C,GAC3B,OAAO2iB,GAAU3iB,EAC7B,EACQ,IAAK,SAAU,OAAO,SAAUA,GAC5B,OAAOvS,GAAGuS,EACtB,EAEI,OAAO,IACX,CACA,SAASm8C,GAAWxlD,EAAMwhD,GACtB,MAAO,GAAGxhD,KAAQwhD,EAAOhmD,KAAI,EAAGwE,OAAMsJ,UAAYA,EAAO,IAAMtJ,IAAO5C,KAAK,OAC/E,CAGA,SAASqoD,GAAWn8C,GAChB,MAAMlX,EAAQkX,EAAKlX,MAAM,+CACzB,OAAIA,EACO,CACH2uC,KAAM3uC,EAAM,GACZ+U,MAAQ/U,EAAM,GAAKA,EAAM,GACzB2hC,MAAO,CACHgN,KAAM3uC,EAAM,GACZ8T,OAAS9T,EAAM,GAAKA,EAAM,GAC1BsZ,MAAQtZ,EAAM,GAAKqa,SAASra,EAAM,KAAO,IAI9C,CAAE2uC,KAAMz3B,EACnB,CASO,MAAMo8C,GASTC,YACAp8C,IAIA,SAAIA,GACA,OAAOxN,KAAK+E,MAAMvL,MAAKgU,GAC1B,CACDq8C,IACAC,IAQA,WAAAzyD,CAAY0yD,GACRvwD,MAAKqwD,GAAa,IAAIlrC,IACtBnlB,MAAKswD,GAAgB,IAAInrC,IAEzB,MAAMqrC,EAAQ,IAAIrrC,IAEZsrC,EAAU,IAAItrC,IAEdurC,EAAW,IAAIvrC,IACfnR,EAAQ,CAAA,EACdvW,OAAOU,KAAKoyD,GAAQjpD,SAASyM,IACzBC,EAAMD,GAAQw8C,EAAOx8C,GAAM9N,KAAI,EAAGwE,OAAMsJ,WAEpC,IAAIy3B,KAAEA,EAAI55B,MAAEA,GAAUs+C,GAAWn8C,GAOjC,MANa,QAATy3B,GAAmB+kB,EAAY,MAC/B/kB,EAAO,UAEE,SAATA,GAAoB+kB,EAAa,OACjC/kB,EAAO,WAEJ,CAAE/gC,OAAMsJ,KAAOy3B,GAAQ55B,GAAS,IAAM,IAEjD4+C,EAAMnlD,IAAI0I,EAAM,IAAI2wC,KACpB+L,EAAQplD,IAAI0I,EAAM,IAClB28C,EAASrlD,IAAI0I,EAAM,IAAI2wC,IAAM,IAEjC1kD,MAAKgU,GAASxN,KAAKC,UAAUuN,GAC7B,IAAK,MAAMvJ,KAAQuJ,EAAO,CACtB,MAAM2sC,EAAc,IAAI+D,IACxB,IAAK,MAAMnkB,KAASvsB,EAAMvJ,GAAO,CAE7BwL,GAAgB0qC,EAAYnjD,IAAI+iC,EAAM91B,MAAO,2BAA2BjE,KAAKC,UAAU85B,EAAM91B,YAAYjE,KAAKC,UAAUgE,KAAS,QAAS8lD,GAC1I5P,EAAYz2C,IAAIq2B,EAAM91B,MAEtB,MAAMk1C,EAAWuQ,GAAW3vB,EAAMxsB,MAAMy3B,KACxCv1B,EAAe0pC,IAAal1C,EAAM,8BAA8BjE,KAAKC,UAAUk5C,KAAa,QAAS4Q,GAErFV,GAAelQ,KAI/B1pC,EAAew6C,EAAQjzD,IAAImiD,GAAW,gBAAgBn5C,KAAKC,UAAUk5C,KAAa,QAAS4Q,GAE3FE,EAAQ5sD,IAAI87C,GAAUvhD,KAAKqM,GAC3B+lD,EAAM3sD,IAAI4G,GAAMP,IAAIy1C,GACvB,CACJ,CAED,MAAMgR,EAAetpD,MAAMI,KAAKgpD,EAAQtyD,QAAQgc,QAAQnc,GAAiC,IAA1ByyD,EAAQ5sD,IAAI7F,GAAGpB,SAC9EqZ,EAAuC,IAAxB06C,EAAa/zD,OAAc,uBAAwB,QAAS2zD,GAC3Et6C,EAAuC,IAAxB06C,EAAa/zD,OAAc,4CAA4C+zD,EAAa1qD,KAAKnJ,GAAO0J,KAAKC,UAAU3J,KAAK+K,KAAK,QAAS,QAAS0oD,GAC1J57C,EAAiB3U,KAAM,CAAEowD,YAAaO,EAAa,KAEnD,SAASC,EAAc78C,EAAM88C,GACzB56C,GAAgB46C,EAAMrzD,IAAIuW,GAAO,8BAA8BvN,KAAKC,UAAUsN,KAAS,QAASw8C,GAChGM,EAAM3mD,IAAI6J,GACV,IAAK,MAAM6P,KAAS4sC,EAAM3sD,IAAIkQ,GAC1B,GAAK08C,EAAQjzD,IAAIomB,GAAjB,CAIAgtC,EAAchtC,EAAOitC,GAErB,IAAK,MAAMC,KAAWD,EAClBH,EAAS7sD,IAAIitD,GAAS5mD,IAAI0Z,EAL7B,CAQLitC,EAAM/oB,OAAO/zB,EAChB,CACD68C,CAAc5wD,KAAKowD,YAAa,IAAI1L,KAEpC,IAAK,MAAOj6C,EAAMY,KAAQqlD,EAAU,CAChC,MAAMK,EAAK1pD,MAAMI,KAAK4D,GACtB0lD,EAAGnqD,OACH5G,MAAKqwD,GAAWhlD,IAAIZ,EAAMwlD,GAAWxlD,EAAMuJ,EAAMvJ,IAASsmD,EAAG9qD,KAAKnJ,GAAMmzD,GAAWnzD,EAAGkX,EAAMlX,MAAK+K,KAAK,IACzG,CACJ,CAID,UAAAmpD,CAAWj9C,GACP,IAAIk9C,EAAUjxD,MAAKswD,GAAczsD,IAAIkQ,GAKrC,OAJKk9C,IACDA,EAAUjxD,MAAKgxD,GAAYj9C,GAC3B/T,MAAKswD,GAAcjlD,IAAI0I,EAAMk9C,IAE1BA,CACV,CACD,GAAAD,CAAYj9C,GAER,CACI,MAAMk9C,EAAUpB,GAAe97C,GAC/B,GAAIk9C,EACA,OAAOA,CAEd,CAED,MAAMzyB,EAAQ0xB,GAAWn8C,GAAMyqB,MAC/B,GAAIA,EAAO,CACP,MAAMsyB,EAAUtyB,EAAM7tB,OAChBugD,EAAalxD,KAAKgxD,WAAWF,GACnC,OAAQh9C,IACJmC,GAAgC,IAAjBuoB,EAAMroB,OAAgBqoB,EAAMroB,QAAUrC,EAAMlX,OAAQ,0CAA0C4hC,EAAMroB,QAAS,QAASrC,GACrI,IAAIsB,EAAStB,EAAM7N,IAAIirD,GAIvB,OAHIlxD,MAAKqwD,GAAW7yD,IAAIszD,KACpB17C,EAASA,EAAOnP,IAAIwwB,KAEjBA,GAAU/iB,EAAO0B,GAAQ,CAEvC,CAED,MAAM62C,EAASjsD,KAAKgU,MAAMD,GAC1B,GAAIk4C,EAAQ,CACR,MAAMkF,EAAc5vD,GAAGvB,MAAKqwD,GAAWxsD,IAAIkQ,IAC3C,OAAQD,IACJ,MAAMe,EAASo3C,EAAOhmD,KAAI,EAAGwE,OAAMsJ,WAC/B,MAAMqB,EAASpV,KAAKgxD,WAAWj9C,EAAhB/T,CAAsB8T,EAAMrJ,IAC3C,OAAIzK,MAAKqwD,GAAW7yD,IAAIuW,GACb0iB,GAAUrhB,GAEdA,CAAM,IAGjB,OADAP,EAAO2O,QAAQ2tC,GACRz9C,EAAOmB,EAAO,CAE5B,CACDoB,GAAe,EAAO,iBAAiBlC,IAAQ,OAAQA,EAC1D,CAID,UAAAk8C,CAAWxlD,GACP,MAAM2K,EAASpV,MAAKqwD,GAAWxsD,IAAI4G,GAEnC,OADAwL,EAAeb,EAAQ,iBAAiB5O,KAAKC,UAAUgE,KAAS,OAAQA,GACjE2K,CACV,CAID,UAAAg8C,CAAWr9C,EAAMD,GACb,OAAO9T,KAAKgxD,WAAWj9C,EAAhB/T,CAAsB8T,EAChC,CAID,UAAAu9C,CAAW5mD,EAAMqJ,GACb,OAAO2iB,GAAUz2B,KAAKoxD,WAAW3mD,EAAMqJ,GAC1C,CAID,MAAA4V,CAAO5V,GACH,OAAO9T,KAAKoxD,WAAWpxD,KAAKowD,YAAat8C,EAC5C,CAID,IAAA5W,CAAK4W,GACD,OAAO9T,KAAKqxD,WAAWrxD,KAAKowD,YAAat8C,EAC5C,CAID,MAAAw9C,CAAOv9C,EAAMD,EAAO8R,GAIZ,GADgBiqC,GAAe97C,GAE3B,OAAO6R,EAAS7R,EAAMD,GAI9B,MAAM0qB,EAAQ0xB,GAAWn8C,GAAMyqB,MAC/B,GAAIA,EAEA,OADAvoB,GAAgC,IAAjBuoB,EAAMroB,OAAgBqoB,EAAMroB,QAAUrC,EAAMlX,OAAQ,0CAA0C4hC,EAAMroB,QAAS,QAASrC,GAC9HA,EAAM7N,KAAKxF,GAAMT,KAAKsxD,OAAO9yB,EAAM7tB,OAAQlQ,EAAGmlB,KAGzD,MAAMqmC,EAASjsD,KAAKgU,MAAMD,GAC1B,GAAIk4C,EACA,OAAOA,EAAOx3C,QAAO,CAACC,GAASjK,OAAMsJ,WACjCW,EAAMjK,GAAQzK,KAAKsxD,OAAOv9C,EAAMD,EAAMrJ,GAAOmb,GACtClR,IACR,CAAE,GAETuB,GAAe,EAAO,iBAAiBlC,IAAQ,OAAQA,EAC1D,CAQD,KAAAw9C,CAAMz9C,EAAO8R,GACT,OAAO5lB,KAAKsxD,OAAOtxD,KAAKowD,YAAat8C,EAAO8R,EAC/C,CAID,WAAOne,CAAKuM,GACR,OAAO,IAAIm8C,GAAiBn8C,EAC/B,CAID,qBAAOw9C,CAAex9C,GAClB,OAAOm8C,GAAiB1oD,KAAKuM,GAAOo8C,WACvC,CAID,iBAAOiB,CAAW5mD,EAAMuJ,EAAOF,GAC3B,OAAOq8C,GAAiB1oD,KAAKuM,GAAOq9C,WAAW5mD,EAAMqJ,EACxD,CAID,iBAAO29C,CAAWC,GACd,MAAMC,EAAe,GACrB,IAAK,MAAMlnD,KAAQinD,EAAQ,CACvB,GAAoB,MAAhBA,EAAOjnD,GACP,SAEJ,MAAMsJ,EAAOy7C,GAAiB/kD,GAC9BwL,EAAelC,EAAM,kCAAkCvN,KAAKC,UAAUgE,KAAS,SAAUinD,GACzFC,EAAavzD,KAAK,CAAEqM,OAAMsJ,QAC7B,CAID,OAHA49C,EAAa/qD,MAAK,CAACoD,EAAGkH,IACXw+C,GAAiBxxD,QAAQ8L,EAAES,MAAQilD,GAAiBxxD,QAAQgT,EAAEzG,QAElE0lD,GAAiBkB,WAAW,eAAgB,CAAEO,aAAcD,GAAgBD,EACtF,CAID,aAAOhoC,CAAOgoC,EAAQ19C,EAAOF,GACzB,OAAOJ,EAAO,CACV,SACAy8C,GAAiBsB,WAAWC,GAC5BvB,GAAiB1oD,KAAKuM,GAAO9W,KAAK4W,IAEzC,CAID,WAAO5W,CAAKw0D,EAAQ19C,EAAOF,GACvB,OAAO2iB,GAAU05B,GAAiBzmC,OAAOgoC,EAAQ19C,EAAOF,GAC3D,CAMD,yBAAa+9C,CAAaH,EAAQ19C,EAAOF,EAAOwjC,GAE5Coa,EAASj0D,OAAOsY,OAAO,CAAE,EAAE27C,GAE3B,IAAK,MAAMrsD,KAAOqsD,EACK,MAAfA,EAAOrsD,WACAqsD,EAAOrsD,GAItB,MAAMysD,EAAW,CAAA,EAEbJ,EAAOjC,oBAAsBn4C,EAAYo6C,EAAOjC,kBAAmB,MACnEqC,EAASJ,EAAOjC,mBAAqB,MAGzC,MAAMwB,EAAUd,GAAiB1oD,KAAKuM,GAEtCi9C,EAAQM,MAAMz9C,GAAO,CAACC,EAAMD,KACX,YAATC,GAAuBuD,EAAYxD,EAAO,MAC1Cg+C,EAASh+C,GAAS,MAEfA,KAGX,IAAK,MAAMrJ,KAAQqnD,EACfA,EAASrnD,SAAc6sC,EAAY7sC,GAavC,OAVIinD,EAAOjC,mBAAqBqC,EAASJ,EAAOjC,qBAC5CiC,EAAOjC,kBAAoBqC,EAASJ,EAAOjC,oBASxC,CAAEiC,SAAQ59C,MANjBA,EAAQm9C,EAAQM,MAAMz9C,GAAO,CAACC,EAAMD,IACnB,YAATC,GAAsB+9C,EAASh+C,GACxBg+C,EAASh+C,GAEbA,IAGd,CAKD,iBAAOi+C,CAAWL,EAAQ19C,EAAOF,GAE7Bq8C,GAAiBsB,WAAWC,GAE5B,MAAMM,EAAe,CAAA,EACfC,EAAc,GACpBvC,GAAiBpoD,SAASmD,IACtB,MAAMqJ,EAAQ49C,EAAOjnD,GACR,MAATqJ,IAGJk+C,EAAavnD,GAAQmlD,GAAanlD,GAAMqJ,GACxCm+C,EAAY7zD,KAAK,CAAEqM,OAAMsJ,KAAMy7C,GAAiB/kD,KAAQ,IAE5D,MAAMwmD,EAAUd,GAAiB1oD,KAAKuM,GAEtCA,EAAQi9C,EAAQj9C,MAChB,MAAMk+C,EAAkBz0D,OAAOsY,OAAO,CAAE,EAAE/B,GAK1C,OAJAiC,EAA+C,MAAhCi8C,EAAgBN,aAAsB,2CAA4C,qBAAsB59C,GACvHk+C,EAAgBN,aAAeK,EAE/BhB,EAAQvnC,OAAO5V,GACR,CACHE,MAAOk+C,EACPR,OAAQM,EACR5B,YAAaa,EAAQb,YACrB36C,QAASw7C,EAAQM,MAAMz9C,GAAO,CAACC,EAAMD,KAEjC,GAAIC,EAAKlX,MAAM,eACX,OAAO4a,EAAQL,EAAStD,IAG5B,GAAIC,EAAKlX,MAAM,UACX,OAAO6b,EAAU5E,GAAO9X,WAE5B,OAAQ+X,GACJ,IAAK,UACD,OAAOD,EAAMmI,cACjB,IAAK,OACD,QAASnI,EACb,IAAK,SAED,OADAmC,EAAkC,iBAAX,EAAqB,iBAAkB,QAASnC,GAChEA,EAEfmC,GAAe,EAAO,mBAAoB,OAAQlC,EAAK,IAGlE,EC/eL,SAASo+C,GAAOvtC,GACZ,MAAMxP,EAAS,IAAIsvC,IAEnB,OADA9/B,EAAMtd,SAASrJ,GAAMmX,EAAOlL,IAAIjM,KACzBR,OAAOmd,OAAOxF,EACzB,CACA,MACMg9C,GAAgBD,GADC,mCACqBp2D,MAAM,MAE5Cs2D,GAAW,uEACXC,GAAUH,GAAOE,GAASt2D,MAAM,MAChCw2D,GAAW,2DACXC,GAAUL,GAAOI,GAASx2D,MAAM,MAChC02D,GAAe,0CACfC,GAAcP,GAAOM,GAAa12D,MAAM,MAIxC42D,GAAWR,GADC,CAACI,GAAUE,GAFZ,gBAEoCJ,IAAUxqD,KAAK,KAClC9L,MAAM,MAElC62D,GAAe,CACjB,IAAK,aAAc,IAAK,cACxB,IAAK,eAAgB,IAAK,gBAC1B,IAAK,QAAS,IAAK,MAGjBC,GAAwB,IAAIl1C,OAAO,WACnCm1C,GAAoB,IAAIn1C,OAAO,aAC/Bo1C,GAAgB,IAAIp1C,OAAO,+BAE3Bq1C,GAAU,IAAIr1C,OAAO,gCACrBs1C,GAAY,IAAIt1C,OAAO,uDAC7B,MAAMu1C,GACFj8C,GACAuxC,IACA,UAAIvxC,GAAW,OAAOjX,MAAKiX,CAAS,CACpC,UAAIra,GAAW,OAAOoD,MAAKwoD,GAAQ5rD,OAASoD,MAAKiX,CAAS,CAC1D,WAAApZ,CAAY2qD,GACRxoD,MAAKiX,EAAU,EACfjX,MAAKwoD,GAAUA,EAAO/sD,OAC1B,CACA,KAAAylB,GAAU,OAAO,IAAIgyC,GAAYlzD,MAAKwoD,GAAU,CAChD,KAAA3oB,GAAU7/B,MAAKiX,EAAU,CAAG,CAC5B,GAAAk8C,CAAgB1rD,EAAO,EAAG1H,EAAK,GAC3B,OAAO,IAAImzD,GAAYlzD,MAAKwoD,GAAQ/sD,MAAMgM,EAAM1H,GAAIkG,KAAKnJ,GAC9CW,OAAOmd,OAAOnd,OAAOsY,OAAO,CAAA,EAAIjZ,EAAG,CACtCD,MAAQC,EAAED,MAAQ4K,EAClB2rD,SAAWt2D,EAAEs2D,SAAW3rD,EACxB4rD,SAAWv2D,EAAEu2D,SAAW5rD,OAGpC,CAEA,UAAA6rD,CAAWC,GACP,MAAMC,EAAMxzD,KAAKyzD,OACjB,GAAiB,YAAbD,EAAIz/C,OAAuBw/C,EAAQ/1D,IAAIg2D,EAAI5lD,MAC3C,MAAM,IAAIuG,MAAM,oBAAoBq/C,EAAI5lD,QAE5C,OAAO5N,KAAKiF,MAAM2I,IACtB,CAEA,OAAA8lD,CAAQ3/C,GACJ,GAAI/T,KAAKyzD,OAAO1/C,OAASA,EAAM,CAC3B,MAAMy/C,EAAMxzD,KAAKyzD,OACjB,MAAM,IAAIt/C,MAAM,YAAYJ,UAAay/C,EAAIz/C,QAAQvN,KAAKC,UAAU+sD,EAAI5lD,QAC5E,CACA,OAAO5N,KAAKiF,MAAM2I,IACtB,CAEA,QAAA+lD,GACI,MAAMH,EAAMxzD,KAAKyzD,OACjB,GAAiB,eAAbD,EAAIz/C,KACJ,MAAM,IAAII,MAAM,aAEpB,MAAMiB,EAASpV,MAAKmzD,GAAgBnzD,MAAKiX,EAAU,EAAGu8C,EAAI32D,MAAQ,GAElE,OADAmD,MAAKiX,EAAUu8C,EAAI32D,MAAQ,EACpBuY,CACX,CAEA,SAAAw+C,GACI,MAAMJ,EAAMxzD,KAAKyzD,OACjB,GAAiB,eAAbD,EAAIz/C,KACJ,MAAM,IAAII,MAAM,aAEpB,MAAMiB,EAAS,GACf,KAAOpV,MAAKiX,EAAUu8C,EAAI32D,MAAQ,GAAG,CACjC,MAAMqL,EAAOlI,KAAKyzD,OAAOJ,SACzBj+C,EAAOhX,KAAK4B,MAAKmzD,GAAgBnzD,MAAKiX,EAAU,EAAG/O,IACnDlI,MAAKiX,EAAU/O,CACnB,CAEA,OADAlI,MAAKiX,EAAUu8C,EAAI32D,MAAQ,EACpBuY,CACX,CAEA,IAAAq+C,GACI,GAAIzzD,MAAKiX,GAAWjX,MAAKwoD,GAAQ5rD,OAC7B,MAAM,IAAIuX,MAAM,iBAEpB,OAAOnU,MAAKwoD,GAAQxoD,MAAKiX,EAC7B,CAEA,WAAA48C,CAAYN,GACR,MAAMC,EAAMxzD,KAAK8zD,SAAS,WAC1B,OAAe,MAAPN,GAAeD,EAAQ/1D,IAAIg2D,GAAQA,EAAM,IACrD,CAEA,QAAAM,CAAS//C,GACL,GAAoB,IAAhB/T,KAAKpD,OACL,OAAO,KAEX,MAAM42D,EAAMxzD,KAAKyzD,OACjB,OAAQD,EAAIz/C,OAASA,EAAQy/C,EAAI5lD,KAAO,IAC5C,CAEA,GAAA3I,GACI,MAAMmQ,EAASpV,KAAKyzD,OAEpB,OADAzzD,MAAKiX,IACE7B,CACX,CACA,QAAApZ,GACI,MAAMwsD,EAAS,GACf,IAAK,IAAIrrD,EAAI6C,MAAKiX,EAAS9Z,EAAI6C,MAAKwoD,GAAQ5rD,OAAQO,IAAK,CACrD,MAAM42D,EAAQ/zD,MAAKwoD,GAAQrrD,GAC3BqrD,EAAOpqD,KAAK,GAAG21D,EAAMhgD,QAAQggD,EAAMnmD,OACvC,CACA,MAAO,gBAAgB46C,EAAO3gD,KAAK,OACvC,EAEJ,SAASY,GAAImF,GACT,MAAM46C,EAAS,GACT/jC,EAAchP,IAChB,MAAMs+C,EAAS98C,EAASrJ,EAAKhR,OAAU4J,KAAKC,UAAUmH,EAAKqJ,IAAW,OACtE,MAAM,IAAI9C,MAAM,iBAAiB4/C,QAAY98C,MAAWxB,IAAU,EAEtE,IAAIu+C,EAAW,GACXC,EAAS,GACTh9C,EAAS,EACb,KAAOA,EAASrJ,EAAKhR,QAAQ,CAEzB,IAAIs3D,EAAMtmD,EAAKuJ,UAAUF,GACrBpa,EAAQq3D,EAAIr3D,MAAMg2D,IAClBh2D,IACAoa,GAAUpa,EAAM,GAAGD,OACnBs3D,EAAMtmD,EAAKuJ,UAAUF,IAEzB,MAAM88C,EAAQ,CAAEI,MAAOH,EAASp3D,OAAQw2D,UAAW,EAAGC,UAAW,EAAGx2D,OAAQ,EAAGkX,KAAM,GAAInG,KAAM,GAAIqJ,SAAQnD,OAAQ,GACnH00C,EAAOpqD,KAAK21D,GACZ,IAAIhgD,EAAQ6+C,GAAasB,EAAI,KAAO,GACpC,GAAIngD,GAIA,GAHAggD,EAAMhgD,KAAOA,EACbggD,EAAMnmD,KAAOsmD,EAAI,GACjBj9C,IACa,eAATlD,EACAigD,EAAS51D,KAAKoqD,EAAO5rD,OAAS,GAC9Bq3D,EAAO71D,KAAKoqD,EAAO5rD,OAAS,QAE3B,GAAY,eAARmX,EACmB,IAApBigD,EAASp3D,QACT6nB,EAAW,4BAEfsvC,EAAMl3D,MAAQm3D,EAAS/uD,MACtBujD,EAAOuL,EAAMl3D,OAAQA,MAAQ2rD,EAAO5rD,OAAS,EAC9Cm3D,EAAMI,QACNJ,EAAMX,SAAWa,EAAOhvD,MACvBujD,EAAOuL,EAAMX,UAAWC,SAAW7K,EAAO5rD,OAAS,OAEnD,GAAa,UAATmX,EACLggD,EAAMX,SAAWa,EAAOhvD,MACvBujD,EAAOuL,EAAMX,UAAWC,SAAW7K,EAAO5rD,OAAS,EACpDq3D,EAAO71D,KAAKoqD,EAAO5rD,OAAS,QAE3B,GAAa,iBAATmX,EACLggD,EAAMhgD,KAAO,eAEZ,GAAa,kBAATA,EAA0B,CAE/B,IAAIihB,EAASwzB,EAAOvjD,MAAM2I,KAC1B,GAAI46C,EAAO5rD,OAAS,GAAwC,WAAnC4rD,EAAOA,EAAO5rD,OAAS,GAAGmX,KAAmB,CAClE,MAAMD,EAAQ00C,EAAOvjD,MAAM2I,KAC3BonB,EAASlhB,EAAQkhB,EAChBwzB,EAAOA,EAAO5rD,OAAS,GAAIkX,MAAQ8E,EAAU9E,EAClD,CACA,GAAsB,IAAlB00C,EAAO5rD,QAAmD,YAAnC4rD,EAAOA,EAAO5rD,OAAS,GAAGmX,KACjD,MAAM,IAAII,MAAM,2BAEnBq0C,EAAOA,EAAO5rD,OAAS,GAAIgR,MAAQonB,CACxC,OAIJ,GADAn4B,EAAQq3D,EAAIr3D,MAAMk2D,IACdl2D,EAAJ,CAGI,GAFAk3D,EAAMnmD,KAAO/Q,EAAM,GACnBoa,GAAU88C,EAAMnmD,KAAKhR,OACjB+1D,GAASn1D,IAAIu2D,EAAMnmD,MAAO,CAC1BmmD,EAAMhgD,KAAO,UACb,QACJ,CACA,GAAIggD,EAAMnmD,KAAK/Q,MAAMo2D,IAAY,CAC7Bc,EAAMhgD,KAAO,OACb,QACJ,CACAggD,EAAMhgD,KAAO,IAEjB,KAbA,CAeA,GADAlX,EAAQq3D,EAAIr3D,MAAMi2D,KACdj2D,EAMJ,MAAM,IAAIsX,MAAM,oBAAoB3N,KAAKC,UAAUytD,EAAI,mBAAmBj9C,KALtE88C,EAAMnmD,KAAO/Q,EAAM,GACnBk3D,EAAMhgD,KAAO,SACbkD,GAAU88C,EAAMnmD,KAAKhR,MALzB,CASJ,CACA,OAAO,IAAIs2D,GAAY1K,EAAOviD,KAAKnJ,GAAMW,OAAOmd,OAAO9d,KAC3D,CAEA,SAASs3D,GAAY/oD,EAAKkoD,GACtB,IAAIc,EAAW,GACf,IAAK,MAAMhvD,KAAOkuD,EAAQp1D,OAClBkN,EAAI7N,IAAI6H,IACRgvD,EAASj2D,KAAKiH,GAGtB,GAAIgvD,EAASz3D,OAAS,EAClB,MAAM,IAAIuX,MAAM,sBAAsBkgD,EAASxsD,KAAK,QAE5D,CAGA,SAASysD,GAAYvgD,EAAMy0C,GACvB,GAAIA,EAAOqL,YAAYrB,IAAU,CAC7B,MAAM+B,EAAU/L,EAAOvjD,MAAM2I,KAC7B,GAAI2mD,IAAYxgD,EACZ,MAAM,IAAII,MAAM,YAAYJ,UAAawgD,IAEjD,CACA,OAAO/L,EAAOkL,QAAQ,KAC1B,CAEA,SAASc,GAAgBhM,EAAQ+K,GAC7B,MAAMkB,EAAW,IAAI/P,IACrB,OAAa,CACT,MAAM6P,EAAU/L,EAAOsL,SAAS,WAChC,GAAe,MAAXS,GAAoBhB,IAAYA,EAAQ/1D,IAAI+2D,GAC5C,MAGJ,GADA/L,EAAOvjD,MACHwvD,EAASj3D,IAAI+2D,GACb,MAAM,IAAIpgD,MAAM,uBAAuB3N,KAAKC,UAAU8tD,MAE1DE,EAASvqD,IAAIqqD,EACjB,CACA,OAAO92D,OAAOmd,OAAO65C,EACzB,CAEA,SAASC,GAAkBlM,GACvB,IAAImM,EAAYH,GAAgBhM,EAAQ8J,IAKxC,OAHA8B,GAAYO,EAAWxC,GAAO,8BAA8Bp2D,MAAM,OAClEq4D,GAAYO,EAAWxC,GAAO,+BAA+Bp2D,MAAM,OAE/D44D,EAAUn3D,IAAI,QACP,OAEPm3D,EAAUn3D,IAAI,QACP,OAEPm3D,EAAUn3D,IAAI,WACP,UAEPm3D,EAAUn3D,IAAI,cACP,aAGPm3D,EAAUn3D,IAAI,YACP,OAEJ,YACX,CAEA,SAASo3D,GAAcpM,EAAQqM,GAC3B,OAAOrM,EAAOoL,YAAY3tD,KAAKnJ,GAAMg4D,GAAUrtD,KAAK3K,EAAG+3D,IAC3D,CAEA,SAASE,GAAWvM,GAChB,GAAIA,EAAOsL,SAAS,MAAO,CAEvB,GADAtL,EAAOvjD,MACHujD,EAAOsL,SAAS,UAChB,OAAOp7C,EAAU8vC,EAAOvjD,MAAM2I,MAElC,MAAM,IAAIuG,MAAM,cACpB,CACA,OAAO,IACX,CACA,SAAS6gD,GAAWxM,GAChB,GAAIA,EAAO5rD,OACP,MAAM,IAAIuX,MAAM,+BAA+Bq0C,EAAOvxC,WAAWuxC,EAAOxsD,aAEhF,CACA,MAAMi5D,GAAiB,IAAIt3C,OAAO,sBAClC,SAASu3C,GAAgBnhD,GACrB,MAAMlX,EAAQkX,EAAKlX,MAAMo2D,IAEzB,GADAh9C,EAAepZ,EAAO,eAAgB,OAAQkX,GACjC,SAATA,EACA,MAAO,UAEX,GAAa,QAATA,EACA,MAAO,SAEX,GAAIlX,EAAM,GAAI,CAEV,MAAMD,EAASsa,SAASra,EAAM,IAC9BoZ,EAA0B,IAAXrZ,GAAgBA,GAAU,GAAI,uBAAwB,OAAQmX,EACjF,MACK,GAAIlX,EAAM,GAAI,CAEf,MAAM6T,EAAOwG,SAASra,EAAM,IAC5BoZ,EAAwB,IAATvF,GAAcA,GAAQ,KAAQA,EAAO,GAAO,EAAG,wBAAyB,OAAQqD,EACnG,CACA,OAAOA,CACX,CAEA,MAAMqQ,GAAS,CAAA,EACT+wC,GAAWp1C,OAAO+0B,IAAI,oBACtBsgB,GAAoB,qBACpBC,GAAwB,iBACxBC,GAAwB,iBACxBC,GAA8B,uBAC9BC,GAA2B,oBAC3BC,GAA2B,oBAC3BC,GAAyB,kBAIxB,MAAMZ,GAITrqD,KAKAsJ,KAIA4rC,SAMAgW,QAMAC,WAMAzd,YAMA0d,cAIA,WAAAh4D,CAAYgZ,EAAOpM,EAAMsJ,EAAM4rC,EAAUgW,EAASC,EAAYzd,EAAa0d,GAMvE,GALAl/C,EAAcE,EAAOuN,GAAQ,aAC7B3mB,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAOshD,KAC3CQ,IACAA,EAAan4D,OAAOmd,OAAOg7C,EAAWn6D,UAEzB,UAAbkkD,GACA,GAAmB,MAAfxH,GAAwC,MAAjB0d,EACvB,MAAM,IAAI1hD,MAAM,SAGnB,GAAmB,MAAfgkC,GAAwC,MAAjB0d,EAC5B,MAAM,IAAI1hD,MAAM,IAEpB,GAAiB,UAAbwrC,GACA,GAAkB,MAAdiW,EACA,MAAM,IAAIzhD,MAAM,SAGnB,GAAkB,MAAdyhD,EACL,MAAM,IAAIzhD,MAAM,IAEpBQ,EAAiB3U,KAAM,CACnByK,OAAMsJ,OAAM4rC,WAAUgW,UAASC,aAAYzd,cAAa0d,iBAEhE,CAYA,MAAAje,CAAOA,GAIH,GAHc,MAAVA,IACAA,EAAS,WAEE,SAAXA,EAAmB,CACnB,MAAMntC,EAAOzK,KAAKyK,MAAQ,GAC1B,GAAIzK,KAAKiV,UAAW,CAChB,MAAMG,EAAS5O,KAAK+E,MAAMvL,KAAK61D,cAAcje,OAAO,SAGpD,OAFAxiC,EAAO3K,KAAOA,EACd2K,EAAOrB,MAAQ,IAAK/T,KAAKm4C,YAAc,EAAI,GAAK/7C,OAAO4D,KAAKm4C,gBACrD3xC,KAAKC,UAAU2O,EAC1B,CACA,MAAMA,EAAS,CACXrB,KAA0B,UAAlB/T,KAAK2/C,SAAwB,QAAU3/C,KAAK+T,KACpDtJ,QAQJ,MAN8B,kBAAlBzK,KAAY,UACpBoV,EAAOugD,QAAU31D,KAAK21D,SAEtB31D,KAAK81D,YACL1gD,EAAOwgD,WAAa51D,KAAK41D,WAAW3vD,KAAK1J,GAAMiK,KAAK+E,MAAMhP,EAAEq7C,OAAOA,OAEhEpxC,KAAKC,UAAU2O,EAC1B,CACA,IAAIA,EAAS,GAsBb,OApBIpV,KAAKiV,WACLG,GAAUpV,KAAK61D,cAAcje,OAAOA,GACpCxiC,GAAU,IAAKpV,KAAKm4C,YAAc,EAAI,GAAK/7C,OAAO4D,KAAKm4C,iBAGnDn4C,KAAK81D,UACL1gD,GAAU,IAAMpV,KAAK41D,WAAW3vD,KAAKyjC,GAASA,EAAKkO,OAAOA,KAAS/vC,KAAiB,SAAX+vC,EAAqB,KAAO,KAAO,IAG5GxiC,GAAUpV,KAAK+T,KAGR,YAAX6jC,KACqB,IAAjB53C,KAAK21D,UACLvgD,GAAU,YAEC,SAAXwiC,GAAqB53C,KAAKyK,OAC1B2K,GAAU,IAAMpV,KAAKyK,OAGtB2K,CACX,CAOA,OAAAH,GACI,MAA0B,UAAlBjV,KAAK2/C,QACjB,CAOA,OAAAmW,GACI,MAA0B,UAAlB91D,KAAK2/C,QACjB,CAOA,WAAAoW,GACI,OAAwB,MAAhB/1D,KAAK21D,OACjB,CAKA,IAAAnrD,CAAKsJ,EAAOqL,GACR,GAAInf,KAAKiV,UAAW,CAChB,IAAK5N,MAAM4N,QAAQnB,GACf,MAAM,IAAIK,MAAM,uBAEpB,IAA0B,IAAtBnU,KAAKm4C,aAAsBrkC,EAAMlX,SAAWoD,KAAKm4C,YACjD,MAAM,IAAIhkC,MAAM,yBAEpB,MAAM6hD,EAAQh2D,KACd,OAAO8T,EAAM7N,KAAKxF,GAAOu1D,EAAMH,cAAcrrD,KAAK/J,EAAG0e,IACzD,CACA,GAAInf,KAAK81D,UAAW,CAChB,IAAKzuD,MAAM4N,QAAQnB,GACf,MAAM,IAAIK,MAAM,uBAEpB,GAAIL,EAAMlX,SAAWoD,KAAK41D,WAAWh5D,OACjC,MAAM,IAAIuX,MAAM,yBAEpB,MAAM6hD,EAAQh2D,KACd,OAAO8T,EAAM7N,KAAI,CAACxF,EAAGtD,IAAO64D,EAAMJ,WAAWz4D,GAAGqN,KAAK/J,EAAG0e,IAC5D,CACA,OAAOA,EAAQnf,KAAK+T,KAAMD,EAC9B,CACA,GAAAmiD,CAAWC,EAAUpiD,EAAOqL,EAASg3C,GACjC,GAAIn2D,KAAKiV,UAAW,CAChB,IAAK5N,MAAM4N,QAAQnB,GACf,MAAM,IAAIK,MAAM,uBAEpB,IAA0B,IAAtBnU,KAAKm4C,aAAsBrkC,EAAMlX,SAAWoD,KAAKm4C,YACjD,MAAM,IAAIhkC,MAAM,yBAEpB,MAAMiiD,EAAYp2D,KAAK61D,cACjBzgD,EAAStB,EAAMrY,QAOrB,OANA2Z,EAAO9N,SAAQ,CAACwM,EAAOlC,KACnBwkD,GAAUH,GAAWC,EAAUpiD,EAAOqL,GAAUrL,IAC5CsB,EAAOxD,GAASkC,CAAK,GACvB,SAENqiD,EAAS/gD,EAEb,CACA,GAAIpV,KAAK81D,UAAW,CAChB,MAAMF,EAAa51D,KAAK41D,WAExB,IAAIxgD,EACJ,GAAI/N,MAAM4N,QAAQnB,GACdsB,EAAStB,EAAMrY,YAEd,CACD,GAAa,MAATqY,GAAoC,mBACpC,MAAM,IAAIK,MAAM,uBAEpBiB,EAASwgD,EAAW3vD,KAAKwlD,IACrB,IAAKA,EAAMhhD,KACP,MAAM,IAAI0J,MAAM,mDAEpB,KAAMs3C,EAAMhhD,QAAQqJ,GAChB,MAAM,IAAIK,MAAM,+BAA+Bs3C,EAAMhhD,QAEzD,OAAOqJ,EAAM23C,EAAMhhD,KAAK,GAEhC,CACA,GAAI2K,EAAOxY,SAAWoD,KAAK41D,WAAWh5D,OAClC,MAAM,IAAIuX,MAAM,yBAQpB,OANAiB,EAAO9N,SAAQ,CAACwM,EAAOlC,KACnBgkD,EAAWhkD,IAAOqkD,GAAWC,EAAUpiD,EAAOqL,GAAUrL,IACpDsB,EAAOxD,GAASkC,CAAK,GACvB,SAENqiD,EAAS/gD,EAEb,CACA,MAAMA,EAAS+J,EAAQnf,KAAK+T,KAAMD,GAC9BsB,EAAOihD,KACPH,EAAS93D,KAAK,iBAAqB+3D,QAAe/gD,EAAU,CAA9C,IAGd+gD,EAAS/gD,EAEjB,CAQA,eAAM6gD,CAAUniD,EAAOqL,GACnB,MAAM+2C,EAAW,GACX9gD,EAAS,CAACtB,GAOhB,OANA9T,MAAKi2D,GAAWC,EAAUpiD,EAAOqL,GAAUrL,IACvCsB,EAAO,GAAKtB,CAAK,IAEjBoiD,EAASt5D,cACH4X,QAAQhQ,IAAI0xD,GAEf9gD,EAAO,EAClB,CAOA,WAAO3N,CAAKoK,EAAKgjD,GACb,GAAIC,GAAUwB,YAAYzkD,GACtB,OAAOA,EAEX,GAAqB,iBAAT,EACR,IACI,OAAOijD,GAAUrtD,KAAKgB,GAAIoJ,GAAMgjD,EACpC,CACA,MAAO3gD,GACH+B,GAAe,EAAO,qBAAsB,MAAOpE,EACvD,MAEC,GAAIA,aAAeqhD,GAAa,CACjC,IAAIn/C,EAAO,GAAI4rC,EAAW,GACtB2K,EAAQ,KACRkK,GAAgB3iD,EAAKsgD,GAAO,CAAC,WAAW30D,IAAI,UAAYqU,EAAIiiD,SAAS,eAErEnU,EAAW,QACX2K,EAAQz4C,EAAI+hD,YAAY3tD,KAAKnJ,GAAMg4D,GAAUrtD,KAAK3K,KAClDiX,EAAO,SAASu2C,EAAMrkD,KAAK1J,GAAMA,EAAEq7C,WAAU/vC,KAAK,UAIlDkM,EAAOmhD,GAAgBrjD,EAAI6hD,QAAQ,SACnC/T,EAAW5rC,GAGf,IAAI8hD,EAAgB,KAChB1d,EAAc,KAClB,KAAOtmC,EAAIjV,QAAUiV,EAAIiiD,SAAS,YAAY,CAC1C,MAAMyC,EAAU1kD,EAAI5M,MACpB4wD,EAAgB,IAAIf,GAAU1wC,GAAQ,GAAIrQ,EAAM4rC,EAAU,KAAM2K,EAAOnS,EAAa0d,GACpF1d,EAAcoe,EAAQziD,MACtBC,GAAQwiD,EAAQ3oD,KAChB+xC,EAAW,QACX2K,EAAQ,IACZ,CACA,IAAIqL,EAAU,KAEd,GADiBnB,GAAgB3iD,EAAK6gD,IACzBl1D,IAAI,WAAY,CACzB,IAAKq3D,EACD,MAAM,IAAI1gD,MAAM,IAEpBwhD,GAAU,CACd,CACA,MAAMlrD,EAAQoH,EAAIiiD,SAAS,MAAQjiD,EAAI5M,MAAM2I,KAAO,GACpD,GAAIiE,EAAIjV,OACJ,MAAM,IAAIuX,MAAM,mBAEpB,OAAO,IAAI2gD,GAAU1wC,GAAQ3Z,EAAMsJ,EAAM4rC,EAAUgW,EAASrL,EAAOnS,EAAa0d,EACpF,CACA,MAAMprD,EAAOoH,EAAIpH,KACjBwL,GAAgBxL,GAA2B,oBAAYA,EAAK5N,MAAMm2D,IAAW,eAAgB,WAAYvoD,GACzG,IAAIkrD,EAAU9jD,EAAI8jD,QACH,MAAXA,IACA1/C,EAAe4+C,EAAc,8BAA+B,cAAehjD,EAAI8jD,SAC/EA,IAAYA,GAEhB,IAAI5hD,EAAOlC,EAAIkC,KACXyiD,EAAaziD,EAAKlX,MAAMo4D,IAC5B,GAAIuB,EAAY,CACZ,MAAMre,EAAcjhC,SAASs/C,EAAW,IAAM,MACxCX,EAAgBf,GAAUrtD,KAAK,CACjCsM,KAAMyiD,EAAW,GACjBZ,WAAY/jD,EAAI+jD,aAEpB,OAAO,IAAId,GAAU1wC,GAAQ3Z,GAAQ,GAAIsJ,EAAM,QAAS4hD,EAAS,KAAMxd,EAAa0d,EACxF,CACA,GAAa,UAAT9hD,GAAoBA,EAAK4F,WAAW,WAA0B5F,EAAK4F,WAAW,KAAmB,CACjG,MAAM2wC,EAA2B,MAAlBz4C,EAAI+jD,WAAsB/jD,EAAI+jD,WAAW3vD,KAAK1J,GAAMu4D,GAAUrtD,KAAKlL,KAAM,KAGxF,OAFc,IAAIu4D,GAAU1wC,GAAQ3Z,GAAQ,GAAIsJ,EAAM,QAAS4hD,EAASrL,EAAO,KAAM,KAGzF,CAEA,OADAv2C,EAAOmhD,GAAgBrjD,EAAIkC,MACpB,IAAI+gD,GAAU1wC,GAAQ3Z,GAAQ,GAAIsJ,EAAMA,EAAM4hD,EAAS,KAAM,KAAM,KAC9E,CAIA,kBAAOW,CAAYxiD,GACf,OAAQA,GAASA,EAAMqhD,MAAcC,EACzC,EAKG,MAAMqB,GAIT1iD,KAIA2iD,OAIA,WAAA74D,CAAYgZ,EAAO9C,EAAM2iD,GACrB//C,EAAcE,EAAOuN,GAAQ,YAE7BzP,EAAiB3U,KAAM,CAAE+T,OAAM2iD,OAD/BA,EAASj5D,OAAOmd,OAAO87C,EAAOj7D,UAElC,CAKA,WAAOgM,CAAKoK,GACR,GAAqB,iBAAT,EAAmB,CAE3B,IACI4kD,GAAShvD,KAAKjB,KAAK+E,MAAMsG,GAC7B,CACA,MAAOlT,GAAK,CAEZ,OAAO83D,GAAShvD,KAAKgB,GAAIoJ,GAC7B,CACA,GAAIA,aAAeqhD,GAAa,CAG5B,OADarhD,EAAIgiD,YAAYrB,KAEzB,IAAK,cAAe,OAAOmE,GAAoBlvD,KAAKoK,GACpD,IAAK,QAAS,OAAO+kD,GAAcnvD,KAAKoK,GACxC,IAAK,QAAS,OAAOglD,GAAcpvD,KAAKoK,GACxC,IAAK,WACL,IAAK,UACD,OAAOilD,GAAiBrvD,KAAKoK,GACjC,IAAK,WAAY,OAAOklD,GAAiBtvD,KAAKoK,GAC9C,IAAK,SAAU,OAAOmlD,GAAevvD,KAAKoK,GAElD,MACK,GAAqB,iBAAT,EAAmB,CAEhC,OAAQA,EAAIkC,MACR,IAAK,cAAe,OAAO4iD,GAAoBlvD,KAAKoK,GACpD,IAAK,QAAS,OAAO+kD,GAAcnvD,KAAKoK,GACxC,IAAK,QAAS,OAAOglD,GAAcpvD,KAAKoK,GACxC,IAAK,WACL,IAAK,UACD,OAAOilD,GAAiBrvD,KAAKoK,GACjC,IAAK,WAAY,OAAOklD,GAAiBtvD,KAAKoK,GAC9C,IAAK,SAAU,OAAOmlD,GAAevvD,KAAKoK,GAE9CmE,GAAO,EAAO,qBAAqBnE,EAAIkC,OAAQ,wBAAyB,CACpE2C,UAAW,iBAEnB,CACAT,GAAe,EAAO,8BAA+B,MAAOpE,EAChE,CAIA,oBAAOolD,CAAcnjD,GACjB,OAAO6iD,GAAoBO,WAAWpjD,EAC1C,CAIA,cAAOwB,CAAQxB,GACX,OAAO8iD,GAAcM,WAAWpjD,EACpC,CAIA,cAAOqjD,CAAQrjD,GACX,OAAO+iD,GAAcK,WAAWpjD,EACpC,CAIA,iBAAOsjD,CAAWtjD,GACd,OAAOijD,GAAiBG,WAAWpjD,EACvC,CAIA,eAAOujD,CAASvjD,GACZ,OAAOkjD,GAAeE,WAAWpjD,EACrC,EAMG,MAAMwjD,WAAsBb,GAI/BhsD,KAIA,WAAA5M,CAAYgZ,EAAO9C,EAAMtJ,EAAMisD,GAC3B/sD,MAAMkN,EAAO9C,EAAM2iD,GACnBzgD,EAAiC,iBAAV,GAAsBxL,EAAK5N,MAAMm2D,IAAU,qBAAsB,OAAQvoD,GAChGisD,EAASj5D,OAAOmd,OAAO87C,EAAOj7D,SAC9BkZ,EAAiB3U,KAAM,CAAEyK,QAC7B,EAEJ,SAAS8sD,GAAW3f,EAAQj3B,GACxB,MAAO,IAAMA,EAAO1a,KAAKnK,GAAMA,EAAE87C,OAAOA,KAAS/vC,KAAiB,SAAX+vC,EAAqB,KAAO,KAAO,GAC9F,CAIO,MAAMgf,WAAsBU,GAI/B,WAAAz5D,CAAYgZ,EAAOpM,EAAMisD,GACrB/sD,MAAMkN,EAAO,QAASpM,EAAMisD,GAC5Bj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAOuhD,IACnD,CAIA,YAAImC,GACA,OAAOj2D,GAAGvB,KAAK43C,OAAO,YAAYzgC,UAAU,EAAG,GACnD,CAIA,MAAAygC,CAAOA,GAIH,GAHc,MAAVA,IACAA,EAAS,WAEE,SAAXA,EACA,OAAOpxC,KAAKC,UAAU,CAClBsN,KAAM,QACNtJ,KAAMzK,KAAKyK,KACXisD,OAAQ12D,KAAK02D,OAAOzwD,KAAK8zB,GAAUvzB,KAAK+E,MAAMwuB,EAAM6d,OAAOA,QAGnE,MAAMxiC,EAAS,GAKf,MAJe,YAAXwiC,GACAxiC,EAAOhX,KAAK,SAEhBgX,EAAOhX,KAAK4B,KAAKyK,KAAO8sD,GAAW3f,EAAQ53C,KAAK02D,SACzCthD,EAAOvN,KAAK,IACvB,CAIA,WAAOJ,CAAKoK,GACR,GAAI+kD,GAAcM,WAAWrlD,GACzB,OAAOA,EAEX,GAAqB,iBAAT,EACR,OAAO+kD,GAAcnvD,KAAKgB,GAAIoJ,IAE7B,GAAIA,aAAeqhD,GAAa,CACjC,MAAMzoD,EAAO6pD,GAAY,QAASziD,GAC5B6kD,EAAS9B,GAAc/iD,GAE7B,OADAmjD,GAAWnjD,GACJ,IAAI+kD,GAAcxyC,GAAQ3Z,EAAMisD,EAC3C,CACA,OAAO,IAAIE,GAAcxyC,GAAQvS,EAAIpH,KAAMoH,EAAI6kD,OAAS7kD,EAAI6kD,OAAOzwD,IAAI6uD,GAAUrtD,MAAQ,GAC7F,CAKA,iBAAOyvD,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcE,EACzC,EAKG,MAAMwB,WAAsBS,GAI/BG,UAIA,WAAA55D,CAAYgZ,EAAOpM,EAAMisD,EAAQe,GAC7B9tD,MAAMkN,EAAO,QAASpM,EAAMisD,GAC5Bj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAOwhD,KAC/C3gD,EAAiB3U,KAAM,CAAEy3D,aAC7B,CAIA,aAAIC,GACA,OAAOn2D,GAAGvB,KAAK43C,OAAO,WAC1B,CAIA,MAAAA,CAAOA,GAIH,GAHc,MAAVA,IACAA,EAAS,WAEE,SAAXA,EACA,OAAOpxC,KAAKC,UAAU,CAClBsN,KAAM,QACN0jD,UAAWz3D,KAAKy3D,UAChBhtD,KAAMzK,KAAKyK,KACXisD,OAAQ12D,KAAK02D,OAAOzwD,KAAK9I,GAAMqJ,KAAK+E,MAAMpO,EAAEy6C,OAAOA,QAG3D,MAAMxiC,EAAS,GAQf,MAPe,YAAXwiC,GACAxiC,EAAOhX,KAAK,SAEhBgX,EAAOhX,KAAK4B,KAAKyK,KAAO8sD,GAAW3f,EAAQ53C,KAAK02D,SACjC,YAAX9e,GAAwB53C,KAAKy3D,WAC7BriD,EAAOhX,KAAK,aAETgX,EAAOvN,KAAK,IACvB,CAIA,mBAAO8vD,CAAaltD,EAAMkW,GACtBA,GAAUA,GAAU,IAAI1a,KAAKnK,GAAMg5D,GAAUrtD,KAAK3L,KAElD,OADiB,IAAI+6D,GAAczyC,GAAQ3Z,EAAMkW,GAAQ,GACzC+2C,SACpB,CAIA,WAAOjwD,CAAKoK,GACR,GAAIglD,GAAcK,WAAWrlD,GACzB,OAAOA,EAEX,GAAqB,iBAAT,EACR,IACI,OAAOglD,GAAcpvD,KAAKgB,GAAIoJ,GAClC,CACA,MAAOqC,GACH+B,GAAe,EAAO,yBAA0B,MAAOpE,EAC3D,MAEC,GAAIA,aAAeqhD,GAAa,CACjC,MAAMzoD,EAAO6pD,GAAY,QAASziD,GAC5B6kD,EAAS9B,GAAc/iD,GAAK,GAC5B4lD,IAAcjD,GAAgB3iD,EAAKsgD,GAAO,CAAC,eAAe30D,IAAI,aAEpE,OADAw3D,GAAWnjD,GACJ,IAAIglD,GAAczyC,GAAQ3Z,EAAMisD,EAAQe,EACnD,CACA,OAAO,IAAIZ,GAAczyC,GAAQvS,EAAIpH,KAAMoH,EAAI6kD,OAAS7kD,EAAI6kD,OAAOzwD,KAAKnK,GAAMg5D,GAAUrtD,KAAK3L,GAAG,KAAS,KAAM+V,EAAI4lD,UACvH,CAKA,iBAAOP,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcG,EACzC,EAKG,MAAMqB,WAA4BF,GAIrCmB,QAIAC,IAIA,WAAAh6D,CAAYgZ,EAAO9C,EAAM2iD,EAAQkB,EAASC,GACtCluD,MAAMkN,EAAO9C,EAAM2iD,GACnBj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAOyhD,KAC/C5gD,EAAiB3U,KAAM,CAAE43D,UAASC,OACtC,CAIA,MAAAjgB,CAAOA,GAEH,GADA5hC,EAAiB,MAAV4hC,GAA6B,YAAXA,EAAsB,0CAA2C,wBAAyB,CAAElhC,UAAW,oBACjH,SAAXkhC,EACA,OAAOpxC,KAAKC,UAAU,CAClBsN,KAAM,cACN+jD,gBAAkB93D,KAAK43D,QAAU,UAAY,YAC7CA,QAAS53D,KAAK43D,QACdC,IAAmB,MAAZ73D,KAAK63D,IAAe73D,KAAK63D,SAAM/6C,EACtC45C,OAAQ12D,KAAK02D,OAAOzwD,KAAK9I,GAAMqJ,KAAK+E,MAAMpO,EAAEy6C,OAAOA,QAG3D,MAAMxiC,EAAS,CAAC,cAAcmiD,GAAW3f,EAAQ53C,KAAK02D,WAOtD,OANI12D,KAAK43D,SACLxiD,EAAOhX,KAAK,WAEA,MAAZ4B,KAAK63D,KACLziD,EAAOhX,KAAK,IAAI4B,KAAK63D,IAAI77D,cAEtBoZ,EAAOvN,KAAK,IACvB,CAIA,WAAOJ,CAAKoK,GACR,GAAI8kD,GAAoBO,WAAWrlD,GAC/B,OAAOA,EAEX,GAAqB,iBAAT,EACR,IACI,OAAO8kD,GAAoBlvD,KAAKgB,GAAIoJ,GACxC,CACA,MAAOqC,GACH+B,GAAe,EAAO,8BAA+B,MAAOpE,EAChE,MAEC,GAAIA,aAAeqhD,GAAa,CACjCsB,GAAgB3iD,EAAKsgD,GAAO,CAAC,iBAC7B,MAAMuE,EAAS9B,GAAc/iD,GACvB+lD,IAAYpD,GAAgB3iD,EAAKugD,IAAe50D,IAAI,WACpDq6D,EAAM9C,GAAWljD,GAEvB,OADAmjD,GAAWnjD,GACJ,IAAI8kD,GAAoBvyC,GAAQ,cAAesyC,EAAQkB,EAASC,EAC3E,CACA,OAAO,IAAIlB,GAAoBvyC,GAAQ,cAAevS,EAAI6kD,OAAS7kD,EAAI6kD,OAAOzwD,IAAI6uD,GAAUrtD,MAAQ,KAAMoK,EAAI+lD,QAAqB,MAAX/lD,EAAIgmD,IAAehmD,EAAIgmD,IAAM,KACzJ,CAKA,iBAAOX,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcI,EACzC,EAKG,MAAMuB,WAAyBL,GAIlCmB,QACA,WAAA/5D,CAAYgZ,EAAO6/C,EAAQkB,GACvBjuD,MAAMkN,EAAO,WAAY6/C,GACzBj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAO0hD,KAC/C7gD,EAAiB3U,KAAM,CAAE43D,WAC7B,CAIA,MAAAhgB,CAAOA,GACH,MAAM7jC,EAAgC,IAAvB/T,KAAK02D,OAAO95D,OAAgB,UAAY,WACvD,GAAe,SAAXg7C,EAAmB,CACnB,MAAMkgB,EAAmB93D,KAAK43D,QAAU,UAAY,aACpD,OAAOpxD,KAAKC,UAAU,CAAEsN,OAAM+jD,mBAClC,CACA,MAAO,GAAG/jD,MAAS/T,KAAK43D,QAAU,WAAa,IACnD,CAIA,WAAOnwD,CAAKoK,GACR,GAAIilD,GAAiBI,WAAWrlD,GAC5B,OAAOA,EAEX,GAAqB,iBAAT,EACR,IACI,OAAOilD,GAAiBrvD,KAAKgB,GAAIoJ,GACrC,CACA,MAAOqC,GACH+B,GAAe,EAAO,4BAA6B,MAAOpE,EAC9D,MAEC,GAAIA,aAAeqhD,GAAa,CACjC,MAAM6E,EAAWlmD,EAAI7V,WAErBia,EADmBpE,EAAIgiD,YAAY1B,GAAO,CAAC,WAAY,aAC5B,mCAAoC,MAAO4F,GAGtE,GAAa,YAFAlmD,EAAIyhD,WAAWnB,GAAO,CAAC,WAAY,aAExB,CACpB,MAAMuE,EAAS9B,GAAc/iD,GAI7B,OAHAoE,EAAiC,IAAlBygD,EAAO95D,OAAc,gCAAiC,aAAc85D,GACnFlC,GAAgB3iD,EAAKsgD,GAAO,CAAC,aAC7B6C,GAAWnjD,GACJ,IAAIilD,GAAiB1yC,GAAQ,IAAI,EAC5C,CAGA,IAAIsyC,EAAS9B,GAAc/iD,GACvB6kD,EAAO95D,OACPqZ,EAAiC,IAAlBygD,EAAO95D,QAAmC,UAAnB85D,EAAO,GAAG3iD,KAAkB,0BAA2B,aAAc2iD,EAAOzwD,KAAK9I,GAAMA,EAAEy6C,OAAO,aAAY/vC,KAAK,OAGvJ6uD,EAAS,CAAC5B,GAAUrtD,KAAK,UAE7B,MAAMuwD,EAAatD,GAAkB7iD,GAErC,GADAoE,EAA8B,eAAf+hD,GAA8C,YAAfA,EAA0B,+BAAgC,sBAAuBA,GAC3HxD,GAAgB3iD,EAAKsgD,GAAO,CAAC,aAAa30D,IAAI,WAAY,CAC1D,MAAMy6D,EAAUrD,GAAc/iD,GAC9BoE,EAAkC,IAAnBgiD,EAAQr7D,QAAoC,UAApBq7D,EAAQ,GAAGlkD,KAAkB,2BAA4B,cAAekkD,EAAQhyD,KAAK9I,GAAMA,EAAEy6C,OAAO,aAAY/vC,KAAK,MAChK,CAEA,OADAmtD,GAAWnjD,GACJ,IAAIilD,GAAiB1yC,GAAQsyC,EAAuB,YAAfsB,EAChD,CACA,GAAiB,YAAbnmD,EAAIkC,KACJ,OAAO,IAAI+iD,GAAiB1yC,GAAQ,IAAI,GAE5C,GAAiB,aAAbvS,EAAIkC,KAAqB,CACzB,MAAM2iD,EAAS,CAAC5B,GAAUrtD,KAAK,UACzBmwD,EAAmC,YAAxB/lD,EAAIimD,gBACrB,OAAO,IAAIhB,GAAiB1yC,GAAQsyC,EAAQkB,EAChD,CACA3hD,GAAe,EAAO,+BAAgC,MAAOpE,EACjE,CAKA,iBAAOqlD,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcK,EACzC,EAKG,MAAMuB,WAAyBO,GAIlCY,SAIAD,QAKAH,gBAIAF,QAIAC,IAIA,WAAAh6D,CAAYgZ,EAAOpM,EAAMqtD,EAAiBpB,EAAQuB,EAASJ,GACvDluD,MAAMkN,EAAO,WAAYpM,EAAMisD,GAC/Bj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAO2hD,KAI/C9gD,EAAiB3U,KAAM,CAAEk4D,SAFa,SAApBJ,GAAkD,SAApBA,EAEbD,MAAKI,QAHxCA,EAAUx6D,OAAOmd,OAAOq9C,EAAQx8D,SAGiBm8D,QADZ,YAApBE,EACyCA,mBAC9D,CAIA,YAAIN,GACA,OAAOj2D,GAAGvB,KAAK43C,OAAO,YAAYzgC,UAAU,EAAG,GACnD,CAIA,MAAAygC,CAAOA,GAIH,GAHc,MAAVA,IACAA,EAAS,WAEE,SAAXA,EACA,OAAOpxC,KAAKC,UAAU,CAClBsN,KAAM,WACNtJ,KAAMzK,KAAKyK,KACXytD,SAAUl4D,KAAKk4D,SACfJ,gBAA4C,eAAzB93D,KAAK83D,gBAAoC93D,KAAK83D,qBAAkBh7C,EACnF86C,QAAS53D,KAAK43D,QACdC,IAAmB,MAAZ73D,KAAK63D,IAAe73D,KAAK63D,SAAM/6C,EACtC45C,OAAQ12D,KAAK02D,OAAOzwD,KAAK9I,GAAMqJ,KAAK+E,MAAMpO,EAAEy6C,OAAOA,MACnDqgB,QAASj4D,KAAKi4D,QAAQhyD,KAAKlJ,GAAMyJ,KAAK+E,MAAMxO,EAAE66C,OAAOA,QAG7D,MAAMxiC,EAAS,GAiBf,MAhBe,YAAXwiC,GACAxiC,EAAOhX,KAAK,YAEhBgX,EAAOhX,KAAK4B,KAAKyK,KAAO8sD,GAAW3f,EAAQ53C,KAAK02D,SACjC,YAAX9e,IAC6B,eAAzB53C,KAAK83D,iBACL1iD,EAAOhX,KAAK4B,KAAK83D,iBAEjB93D,KAAKi4D,SAAWj4D,KAAKi4D,QAAQr7D,SAC7BwY,EAAOhX,KAAK,WACZgX,EAAOhX,KAAKm5D,GAAW3f,EAAQ53C,KAAKi4D,WAExB,MAAZj4D,KAAK63D,KACLziD,EAAOhX,KAAK,IAAI4B,KAAK63D,IAAI77D,eAG1BoZ,EAAOvN,KAAK,IACvB,CAIA,kBAAOswD,CAAY1tD,EAAMkW,GACrBA,GAAUA,GAAU,IAAI1a,KAAKnK,GAAMg5D,GAAUrtD,KAAK3L,KAElD,OADiB,IAAIi7D,GAAiB3yC,GAAQ3Z,EAAM,OAAQkW,EAAQ,GAAI,MACxD62C,QACpB,CAIA,WAAO/vD,CAAKoK,GACR,GAAIklD,GAAiBG,WAAWrlD,GAC5B,OAAOA,EAEX,GAAqB,iBAAT,EACR,IACI,OAAOklD,GAAiBtvD,KAAKgB,GAAIoJ,GACrC,CACA,MAAOqC,GACH+B,GAAe,EAAO,4BAA6B,MAAOpE,EAC9D,MAEC,GAAIA,aAAeqhD,GAAa,CACjC,MAAMzoD,EAAO6pD,GAAY,WAAYziD,GAC/B6kD,EAAS9B,GAAc/iD,GACvBmmD,EAAatD,GAAkB7iD,GACrC,IAAIomD,EAAU,GACVzD,GAAgB3iD,EAAKsgD,GAAO,CAAC,aAAa30D,IAAI,aAC9Cy6D,EAAUrD,GAAc/iD,IAE5B,MAAMgmD,EAAM9C,GAAWljD,GAEvB,OADAmjD,GAAWnjD,GACJ,IAAIklD,GAAiB3yC,GAAQ3Z,EAAMutD,EAAYtB,EAAQuB,EAASJ,EAC3E,CACA,IAAIC,EAAkBjmD,EAAIimD,gBAmB1B,OAjBuB,MAAnBA,IACAA,EAAkB,UACY,kBAAlBjmD,EAAY,UACpBimD,EAAkB,OACbjmD,EAAIqmD,WACLJ,EAAkB,UACW,kBAAjBjmD,EAAW,SAAoBA,EAAI+lD,UAC3CE,EAAkB,gBAII,kBAAjBjmD,EAAW,SAAoBA,EAAI+lD,UAChDE,EAAkB,eAKnB,IAAIf,GAAiB3yC,GAAQvS,EAAIpH,KAAMqtD,EAAiBjmD,EAAI6kD,OAAS7kD,EAAI6kD,OAAOzwD,IAAI6uD,GAAUrtD,MAAQ,GAAIoK,EAAIomD,QAAUpmD,EAAIomD,QAAQhyD,IAAI6uD,GAAUrtD,MAAQ,GAAgB,MAAXoK,EAAIgmD,IAAehmD,EAAIgmD,IAAM,KACvM,CAKA,iBAAOX,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcM,EACzC,EAKG,MAAMuB,WAAuBM,GAIhC,WAAAz5D,CAAYgZ,EAAOpM,EAAMisD,GACrB/sD,MAAMkN,EAAO,SAAUpM,EAAMisD,GAC7Bj5D,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAO4hD,IACnD,CAIA,MAAA9d,GACI,MAAM,IAAIzjC,MAAM,QACpB,CAIA,WAAO1M,CAAKoK,GACR,GAAqB,iBAAT,EACR,IACI,OAAOmlD,GAAevvD,KAAKgB,GAAIoJ,GACnC,CACA,MAAOqC,GACH+B,GAAe,EAAO,0BAA2B,MAAOpE,EAC5D,MAEC,GAAIA,aAAeqhD,GAAa,CACjC,MAAMzoD,EAAO6pD,GAAY,SAAUziD,GAC7B6kD,EAAS9B,GAAc/iD,GAE7B,OADAmjD,GAAWnjD,GACJ,IAAImlD,GAAe5yC,GAAQ3Z,EAAMisD,EAC5C,CACA,OAAO,IAAIM,GAAe5yC,GAAQvS,EAAIpH,KAAMoH,EAAI6kD,OAAS7kD,EAAI6kD,OAAOzwD,IAAI6uD,GAAUrtD,MAAQ,GAC9F,CAMA,iBAAOyvD,CAAWpjD,GACd,OAAQA,GAASA,EAAMqhD,MAAcO,EACzC,ECxwCJ,MAAM0C,GAAe,IAAIjzC,IACzBizC,GAAa/sD,IAAI,EAAM,iBACvB+sD,GAAa/sD,IAAI,EAAM,gBACvB+sD,GAAa/sD,IAAI,GAAM,YACvB+sD,GAAa/sD,IAAI,GAAM,kBACvB+sD,GAAa/sD,IAAI,GAAM,oBACvB+sD,GAAa/sD,IAAI,GAAM,oBACvB+sD,GAAa/sD,IAAI,GAAM,mBACvB+sD,GAAa/sD,IAAI,GAAM,qBACvB+sD,GAAa/sD,IAAI,GAAM,iBACvB+sD,GAAa/sD,IAAI,GAAM,+BACvB,MAAMgtD,GAAiB,IAAI16C,OAAO,mBAC5B26C,GAAkB,IAAI36C,OAAO,qBACnC,IAAI46C,GAAe,KACfC,GAAsB,KAmEnB,MAAMC,GACT,GAAAC,CAAUjN,GACN,GAAIA,EAAMx2C,UACN,OAAO,IAAI2qC,GAAW5/C,MAAK04D,GAAUjN,EAAMoK,eAAgBpK,EAAMtT,YAAasT,EAAMhhD,MAExF,GAAIghD,EAAMqK,UACN,OAAO,IAAIpV,GAAW+K,EAAMmK,WAAW3vD,KAAK1J,GAAMyD,MAAK04D,GAAUn8D,KAAKkvD,EAAMhhD,MAEhF,OAAQghD,EAAM9L,UACV,IAAK,UACD,OAAO,IAAIhB,GAAa8M,EAAMhhD,MAClC,IAAK,OACD,OAAO,IAAIq1C,GAAa2L,EAAMhhD,MAClC,IAAK,SACD,OAAO,IAAIg2C,GAAYgL,EAAMhhD,MACjC,IAAK,QACD,OAAO,IAAIu1C,GAAWyL,EAAMhhD,MAChC,IAAK,GACD,OAAO,IAAI01C,GAAUsL,EAAMhhD,MAGnC,IAAI5N,EAAQ4uD,EAAM13C,KAAKlX,MAAMy7D,IAC7B,GAAIz7D,EAAO,CACP,IAAI6T,EAAOwG,SAASra,EAAM,IAAM,OAEhC,OADAoZ,EAAwB,IAATvF,GAAcA,GAAQ,KAAQA,EAAO,GAAO,EAAG,WAAa7T,EAAM,GAAK,cAAe,QAAS4uD,GACvG,IAAIpL,GAAY3vC,EAAO,EAAiB,QAAb7T,EAAM,GAAe4uD,EAAMhhD,KAChE,CAGD,GADA5N,EAAQ4uD,EAAM13C,KAAKlX,MAAMw7D,IACrBx7D,EAAO,CACP,IAAI6T,EAAOwG,SAASra,EAAM,IAE1B,OADAoZ,EAAwB,IAATvF,GAAcA,GAAQ,GAAI,uBAAwB,QAAS+6C,GACnE,IAAIxL,GAAgBvvC,EAAM+6C,EAAMhhD,KAC1C,CACDwL,GAAe,EAAO,eAAgB,OAAQw1C,EAAM13C,KACvD,CAOD,eAAA4kD,CAAgB3kD,GACZ,MAAM+qC,EAAS/qC,EAAM/N,KAAK8N,GAAS/T,MAAK04D,GAAU5D,GAAUrtD,KAAKsM,MAEjE,OADc,IAAI2sC,GAAW3B,EAAQ,KACxBlH,cAChB,CAMD,MAAAnuB,CAAO1V,EAAOa,GACVqB,EAAoBrB,EAAOjY,OAAQoX,EAAMpX,OAAQ,gCACjD,MAAMmiD,EAAS/qC,EAAM/N,KAAK8N,GAAS/T,MAAK04D,GAAU5D,GAAUrtD,KAAKsM,MAC3D+qC,EAAK,IAAQ4B,GAAW3B,EAAQ,KAChCz4B,EAAS,IAAIH,GAEnB,OADA24B,EAAMp1B,OAAOpD,EAAQzR,GACdyR,EAAO1nB,IACjB,CAQD,MAAAggD,CAAO5qC,EAAOpV,EAAMsoB,GAChB,MAAM63B,EAAS/qC,EAAM/N,KAAK8N,GAAS/T,MAAK04D,GAAU5D,GAAUrtD,KAAKsM,MAEjE,OADc,IAAI2sC,GAAW3B,EAAQ,KACxBH,OAAO,IAAIj4B,GAAO/nB,EAAMsoB,EAAOsxC,IAC/C,CACD,8BAAOI,CAAwB9kD,GAC3BmC,EAAkC,iBAAX,GAAuBkD,OAAOC,UAAUtF,GAAQ,qCAAsC,QAASA,GACtH0kD,GAAsB1kD,CACzB,CAMD,sBAAO+kD,GAIH,OAHoB,MAAhBN,KACAA,GAAe,IAAIE,IAEhBF,EACV,CAMD,8BAAOO,CAAwBC,EAAQ/M,EAAIptD,GACvC,OA/JR,SAAiCm6D,EAAQ/M,EAAIptD,EAAMo6D,GAC/C,IAAIvjD,EAAU,sBACV+E,EAAS,KAETy+C,EAAS,KACb,GAAIr6D,EAAM,CACN6W,EAAU,qBACV,MAAMiC,EAAQN,EAASxY,GAEvB,GADAA,EAAO6Y,EAAQ7Y,GACM,IAAjB8Y,EAAM9a,OACN6Y,GAAW,oDACX+E,EAAS,sBAER,GAAI9C,EAAM9a,OAAS,IAAO,EAC3B6Y,GAAW,uDAEV,GAAmC,eAA/BgC,EAAQC,EAAMjc,MAAM,EAAG,IAE5B,IACI+e,EAASw+C,EAASpa,OAAO,CAAC,UAAWlnC,EAAMjc,MAAM,IAAI,GACrDw9D,EAAS,CACLnoB,UAAW,gBACXrmC,KAAM,QACNua,KAAM,CAACxK,IAEX/E,GAAW,KAAKjP,KAAKC,UAAU+T,IAClC,CACD,MAAOtG,GACHuB,GAAW,iDACd,MAEA,GAAmC,eAA/BgC,EAAQC,EAAMjc,MAAM,EAAG,IAE5B,IACI,MAAM2Y,EAAO+E,OAAO6/C,EAASpa,OAAO,CAAC,WAAYlnC,EAAMjc,MAAM,IAAI,IACjEw9D,EAAS,CACLnoB,UAAW,iBACXrmC,KAAM,QACNua,KAAM,CAAC5Q,IAEXoG,EAAS,gBAAgB49C,GAAav0D,IAAIuQ,IAAS,aAAaA,KAChEqB,GAAW,KAAK+E,GACnB,CACD,MAAOtG,GACHuB,GAAW,gCACd,MAGDA,GAAW,yBAElB,CACD,MAAMyjD,EAAc,CAChBn5D,GAAKisD,EAAGjsD,GAAK62C,GAAWoV,EAAGjsD,IAAM,KACjCnB,KAAOotD,EAAGptD,MAAQ,MAKtB,OAHIotD,EAAGvkD,OACHyxD,EAAYzxD,KAAOmvC,GAAWoV,EAAGvkD,OAE9B+N,EAAUC,EAAS,iBAAkB,CACxCsjD,SAAQn6D,OAAM4b,SAAQ0+C,cAAaC,WAxDpB,KAwDgCF,UAEvD,CAkGeH,CAAwBC,EAAQ/M,EAAIptD,EAAM65D,GAASI,kBAC7D,ECpLE,MAAMO,GAITC,SAIA5uD,KAIAqmC,UAIAwoB,MAIAt0C,KAIA,WAAAnnB,CAAYw7D,EAAUC,EAAOt0C,GACzB,MAAMva,EAAO4uD,EAAS5uD,KAAMqmC,EAAYuoB,EAASzhB,SACjDjjC,EAAiB3U,KAAM,CACnBq5D,WAAU5uD,OAAMqmC,YAAWwoB,QAAOt0C,QAE1C,EAOG,MAAMu0C,GAITF,SAIA5uD,KAIAua,KAIA8rB,UAIA0mB,SAIA1jD,MAIA,WAAAjW,CAAYw7D,EAAU7B,EAAUxyC,EAAMlR,GAClC,MAAMrJ,EAAO4uD,EAAS5uD,KAAMqmC,EAAYuoB,EAASzhB,SACjDjjC,EAAiB3U,KAAM,CACnBq5D,WAAU5uD,OAAMua,OAAM8rB,YAAW0mB,WAAU1jD,SAEnD,EAMG,MAAM0lD,GAITH,SAIA5uD,KAIAua,KAIA8rB,UAIA0mB,SAIA,WAAA35D,CAAYw7D,EAAU7B,EAAUxyC,GAC5B,MAAMva,EAAO4uD,EAAS5uD,KAAMqmC,EAAYuoB,EAASzhB,SACjDjjC,EAAiB3U,KAAM,CACnBq5D,WAAU5uD,OAAMua,OAAM8rB,YAAW0mB,YAEzC,EAQG,MAAMiC,GAITv8D,KAIAw8D,WAMA,gBAAOC,CAAU7lD,GACb,SAAUA,IAASA,EAAM4lD,WAC7B,CAIA,WAAA77D,CAAYX,GACRyX,EAAiB3U,KAAM,CAAE9C,OAAMw8D,YAAY,GAC/C,EAGJ,MAAMtB,GAAe,CACjB,EAAK,gBACL,EAAK,gBACL,GAAM,sBACN,GAAM,6BACN,GAAM,gBACN,GAAM,8CACN,GAAM,wDACN,GAAM,6CACN,GAAM,gBACN,GAAM,0BAEJwB,GAAgB,CAClB,aAAc,CACV9oB,UAAW,gBACXrmC,KAAM,QACNisD,OAAQ,CAAC,UACTl8C,OAAS/E,GACE,+BAA+BjP,KAAKC,UAAUgP,MAG7D,aAAc,CACVq7B,UAAW,iBACXrmC,KAAM,QACNisD,OAAQ,CAAC,WACTl8C,OAASpG,IACL,IAAIoG,EAAS,qBAIb,OAHIpG,GAAQ,GAAKA,GAAQ,KAAQgkD,GAAahkD,EAAKpY,cAC/Cwe,EAAS49C,GAAahkD,EAAKpY,aAExB,8BAA8BoY,EAAKpY,SAAS,QAAQwe,IAAS,IAczE,MAAMq/C,GAITC,UAIAC,OAIAC,SAIAC,QACAC,IACAC,IACAC,IAEApB,IAIA,WAAAn7D,CAAYi8D,GACR,IAAIO,EAAM,GAENA,EADuB,iBAAf,EACF7zD,KAAK+E,MAAMuuD,GAGXA,EAEV95D,MAAKo6D,GAAa,IAAIj1C,IACtBnlB,MAAKk6D,GAAU,IAAI/0C,IACnBnlB,MAAKm6D,GAAU,IAAIh1C,IAEnB,MAAMm1C,EAAQ,GACd,IAAK,MAAMtwD,KAAKqwD,EACZ,IACIC,EAAMl8D,KAAKq4D,GAAShvD,KAAKuC,GAC7B,CACA,MAAOkK,GACHpS,QAAQ6E,IAAI,8BAA8BH,KAAKC,UAAUuD,MAAOkK,EAAMuB,QAC1E,CAEJd,EAAiB3U,KAAM,CACnB85D,UAAWr8D,OAAOmd,OAAO0/C,KAE7B,IAAIN,EAAW,KACXC,GAAU,EACdj6D,MAAKg5D,GAAYh5D,KAAKu6D,cAEtBv6D,KAAK85D,UAAUxyD,SAAQ,CAAC+xD,EAAUznD,KAC9B,IAAI+yC,EACJ,OAAQ0U,EAAStlD,MACb,IAAK,cACD,OAAI/T,KAAK+5D,YACLj4D,QAAQ6E,IAAI,2CAIhBgO,EAAiB3U,KAAM,CAAE+5D,OAAQV,IAErC,IAAK,WASD,YAR+B,IAA3BA,EAAS3C,OAAO95D,OAChBq9D,GAAU,GAGVhkD,GAAgB+jD,GAAYX,EAASzB,UAAYoC,EAASpC,QAAS,iCAAkC,aAAahmD,KAAUynD,GAC5HW,EAAWX,EACXY,EAAUD,EAASpC,UAG3B,IAAK,WAGDjT,EAAS3kD,MAAKo6D,GACd,MACJ,IAAK,QAEDzV,EAAS3kD,MAAKm6D,GACd,MACJ,IAAK,QACDxV,EAAS3kD,MAAKk6D,GACd,MACJ,QACI,OAGR,MAAMppB,EAAYuoB,EAASzhB,SACvB+M,EAAOnnD,IAAIszC,IAGf6T,EAAOt5C,IAAIylC,EAAWuoB,EAAS,IAG9Br5D,KAAK+5D,QACNplD,EAAiB3U,KAAM,CACnB+5D,OAAQpD,GAAoBlvD,KAAK,mBAGzCkN,EAAiB3U,KAAM,CAAEg6D,WAAUC,WACvC,CAMA,MAAAriB,CAAO4iB,GACH,MAAM5iB,EAAU4iB,EAAU,UAAY,OAChCH,EAAMr6D,KAAK85D,UAAU7zD,KAAK1H,GAAMA,EAAEq5C,OAAOA,KAC/C,OAAOyiB,CACX,CAKA,UAAAI,GACI,MAAMJ,EAAMr6D,KAAK85D,UAAU7zD,KAAK1H,GAAMA,EAAEq5C,OAAO,UAE/C,OAAOpxC,KAAKC,UAAU4zD,EAAIp0D,KAAKuV,GAAMhV,KAAK+E,MAAMiQ,KACpD,CAKA,WAAA++C,GACI,OAAO9B,GAASI,iBACpB,CAEA,GAAA6B,CAAar1D,EAAKwP,EAAQ8lD,GAEtB,GAAIrjD,EAAYjS,GAAM,CAClB,MAAMmyD,EAAWnyD,EAAI4W,cACrB,IAAK,MAAMo9C,KAAYr5D,MAAKo6D,GAAWvlD,SACnC,GAAI2iD,IAAa6B,EAAS7B,SACtB,OAAO6B,EAGf,OAAO,IACX,CAEA,IAA0B,IAAtBh0D,EAAInH,QAAQ,KAAa,CACzB,MAAM08D,EAAW,GACjB,IAAK,MAAOnwD,EAAM4uD,KAAar5D,MAAKo6D,GAC5B3vD,EAAK1O,MAAM,KAAiB,KAAOsJ,GACnCu1D,EAASx8D,KAAKi7D,GAGtB,GAAIxkD,EAAQ,CACR,MAAMgmD,EAAahmD,EAAOjY,OAAS,EAAKiY,EAAOA,EAAOjY,OAAS,GAAK,KACpE,IAAIk+D,EAAcjmD,EAAOjY,OACrBm+D,GAAe,EACftjB,GAAMgH,QAAQoc,IAAiC,cAAnBA,EAAU9mD,OACtCgnD,GAAe,EACfD,KAIJ,IAAK,IAAI39D,EAAIy9D,EAASh+D,OAAS,EAAGO,GAAK,EAAGA,IAAK,CAC3C,MAAMu5D,EAASkE,EAASz9D,GAAGu5D,OAAO95D,OAC9B85D,IAAWoE,GAAiBC,GAAgBrE,IAAWoE,EAAc,GACrEF,EAASj7D,OAAOxC,EAAG,EAE3B,CAEA,IAAK,IAAIA,EAAIy9D,EAASh+D,OAAS,EAAGO,GAAK,EAAGA,IAAK,CAC3C,MAAMu5D,EAASkE,EAASz9D,GAAGu5D,OAC3B,IAAK,IAAIl7C,EAAI,EAAGA,EAAI3G,EAAOjY,OAAQ4e,IAE/B,GAAKi8B,GAAMgH,QAAQ5pC,EAAO2G,IAA1B,CAIA,GAAIA,GAAKk7C,EAAO95D,OAAQ,CACpB,GAAuB,cAAnBiY,EAAO2G,GAAGzH,KACV,SAEJ6mD,EAASj7D,OAAOxC,EAAG,GACnB,KACJ,CAEA,GAAI0X,EAAO2G,GAAGzH,OAAS2iD,EAAOl7C,GAAGmkC,SAAU,CACvCib,EAASj7D,OAAOxC,EAAG,GACnB,KACJ,CAbA,CAeR,CACJ,CAGA,GAAwB,IAApBy9D,EAASh+D,QAAgBiY,GAAUA,EAAOjY,SAAWg+D,EAAS,GAAGlE,OAAO95D,OAAQ,CAChF,MAAMo+D,EAAUnmD,EAAOA,EAAOjY,OAAS,IACxB,MAAXo+D,GAAmB3zD,MAAM4N,QAAQ+lD,IAAiC,iBAArB,IAC7CJ,EAASj7D,OAAO,EAAG,EAE3B,CACA,GAAwB,IAApBi7D,EAASh+D,OACT,OAAO,KAEX,GAAIg+D,EAASh+D,OAAS,GAAK+9D,EAAa,CAEpC1kD,GAAe,EAAO,gDADL2kD,EAAS30D,KAAKyG,GAAMlG,KAAKC,UAAUiG,EAAEkrC,YAAW/vC,KAAK,SACa,MAAOxC,EAC9F,CACA,OAAOu1D,EAAS,EACpB,CAEA,MAAMxlD,EAASpV,MAAKo6D,GAAWv2D,IAAIkzD,GAAiBtvD,KAAKpC,GAAKuyC,UAC9D,OAAIxiC,GAGG,IACX,CAKA,eAAA6lD,CAAgB51D,GACZ,MAAMg0D,EAAWr5D,MAAK06D,GAAar1D,EAAK,MAAM,GAE9C,OADA4Q,EAAeojD,EAAU,uBAAwB,MAAOh0D,GACjDg0D,EAAS5uD,IACpB,CAQA,WAAAywD,CAAY71D,GACR,QAASrF,MAAK06D,GAAar1D,EAAK,MAAM,EAC1C,CAWA,WAAAq1D,CAAYr1D,EAAKwP,GACb,OAAO7U,MAAK06D,GAAar1D,EAAKwP,GAAU,MAAM,EAClD,CAIA,eAAAsmD,CAAgBv1C,GACZ,MAAMpB,EAAQnd,MAAMI,KAAKzH,MAAKo6D,GAAWj8D,QACzCqmB,EAAM5d,MAAK,CAACoD,EAAGkH,IAAMlH,EAAE+gD,cAAc75C,KACrC,IAAK,IAAI/T,EAAI,EAAGA,EAAIqnB,EAAM5nB,OAAQO,IAAK,CACnC,MAAMsN,EAAO+Z,EAAMrnB,GACnByoB,EAAU5lB,MAAKo6D,GAAWv2D,IAAI4G,GAAQtN,EAC1C,CACJ,CAEA,GAAAi+D,CAAU/1D,EAAKwP,EAAQ8lD,GAEnB,GAAIrjD,EAAYjS,GAAM,CAClB,MAAMg2D,EAAah2D,EAAI4W,cACvB,IAAK,MAAMo9C,KAAYr5D,MAAKm6D,GAAQtlD,SAChC,GAAIwmD,IAAehC,EAAS3B,UACxB,OAAO2B,EAGf,OAAO,IACX,CAEA,IAA0B,IAAtBh0D,EAAInH,QAAQ,KAAa,CACzB,MAAM08D,EAAW,GACjB,IAAK,MAAOnwD,EAAM4uD,KAAar5D,MAAKm6D,GAC5B1vD,EAAK1O,MAAM,KAAiB,KAAOsJ,GACnCu1D,EAASx8D,KAAKi7D,GAGtB,GAAIxkD,EAAQ,CAER,IAAK,IAAI1X,EAAIy9D,EAASh+D,OAAS,EAAGO,GAAK,EAAGA,IAClCy9D,EAASz9D,GAAGu5D,OAAO95D,OAASiY,EAAOjY,QACnCg+D,EAASj7D,OAAOxC,EAAG,GAI3B,IAAK,IAAIA,EAAIy9D,EAASh+D,OAAS,EAAGO,GAAK,EAAGA,IAAK,CAC3C,MAAMu5D,EAASkE,EAASz9D,GAAGu5D,OAC3B,IAAK,IAAIl7C,EAAI,EAAGA,EAAI3G,EAAOjY,OAAQ4e,IAE/B,GAAKi8B,GAAMgH,QAAQ5pC,EAAO2G,KAItB3G,EAAO2G,GAAGzH,OAAS2iD,EAAOl7C,GAAGmkC,SAAU,CACvCib,EAASj7D,OAAOxC,EAAG,GACnB,KACJ,CAER,CACJ,CACA,GAAwB,IAApBy9D,EAASh+D,OACT,OAAO,KAEX,GAAIg+D,EAASh+D,OAAS,GAAK+9D,EAAa,CAEpC1kD,GAAe,EAAO,6CADL2kD,EAAS30D,KAAKyG,GAAMlG,KAAKC,UAAUiG,EAAEkrC,YAAW/vC,KAAK,SACU,MAAOxC,EAC3F,CACA,OAAOu1D,EAAS,EACpB,CAEA,MAAMxlD,EAASpV,MAAKm6D,GAAQt2D,IAAIgzD,GAAcpvD,KAAKpC,GAAKuyC,UACxD,OAAIxiC,GAGG,IACX,CAKA,YAAAkmD,CAAaj2D,GACT,MAAMg0D,EAAWr5D,MAAKo7D,GAAU/1D,EAAK,MAAM,GAE3C,OADA4Q,EAAeojD,EAAU,oBAAqB,MAAOh0D,GAC9Cg0D,EAAS5uD,IACpB,CAQA,QAAA8wD,CAASl2D,GACL,QAASrF,MAAKo7D,GAAU/1D,EAAK,MAAM,EACvC,CAWA,QAAA+1D,CAAS/1D,EAAKwP,GACV,OAAO7U,MAAKo7D,GAAU/1D,EAAKwP,GAAU,MAAM,EAC/C,CAIA,YAAA2mD,CAAa51C,GACT,MAAMpB,EAAQnd,MAAMI,KAAKzH,MAAKm6D,GAAQh8D,QACtCqmB,EAAM5d,MAAK,CAACoD,EAAGkH,IAAMlH,EAAE+gD,cAAc75C,KACrC,IAAK,IAAI/T,EAAI,EAAGA,EAAIqnB,EAAM5nB,OAAQO,IAAK,CACnC,MAAMsN,EAAO+Z,EAAMrnB,GACnByoB,EAAU5lB,MAAKm6D,GAAQt2D,IAAI4G,GAAQtN,EACvC,CACJ,CAWA,QAAAs+D,CAASp2D,EAAKwP,GACV,GAAIyC,EAAYjS,GAAM,CAClB,MAAMmyD,EAAWnyD,EAAI4W,cACrB,GAAI29C,GAAcpC,GACd,OAAOZ,GAAcnvD,KAAKmyD,GAAcpC,GAAU1mB,WAEtD,IAAK,MAAMuoB,KAAYr5D,MAAKk6D,GAAQrlD,SAChC,GAAI2iD,IAAa6B,EAAS7B,SACtB,OAAO6B,EAGf,OAAO,IACX,CAEA,IAA0B,IAAtBh0D,EAAInH,QAAQ,KAAa,CACzB,MAAM08D,EAAW,GACjB,IAAK,MAAOnwD,EAAM4uD,KAAar5D,MAAKk6D,GAC5BzvD,EAAK1O,MAAM,KAAiB,KAAOsJ,GACnCu1D,EAASx8D,KAAKi7D,GAGtB,GAAwB,IAApBuB,EAASh+D,OACT,MAAY,UAARyI,EACOuxD,GAAcnvD,KAAK,uBAElB,UAARpC,EACOuxD,GAAcnvD,KAAK,wBAEvB,KAEN,GAAImzD,EAASh+D,OAAS,EAAG,CAE1BqZ,GAAe,EAAO,qCADL2kD,EAAS30D,KAAKyG,GAAMlG,KAAKC,UAAUiG,EAAEkrC,YAAW/vC,KAAK,SACE,OAAQxC,EACpF,CACA,OAAOu1D,EAAS,EACpB,CAGA,GAAY,mBADZv1D,EAAMuxD,GAAcnvD,KAAKpC,GAAKuyC,UAE1B,OAAOgf,GAAcnvD,KAAK,uBAE9B,GAAY,mBAARpC,EACA,OAAOuxD,GAAcnvD,KAAK,wBAE9B,MAAM2N,EAASpV,MAAKk6D,GAAQr2D,IAAIwB,GAChC,OAAI+P,GAGG,IACX,CAIA,YAAAsmD,CAAa91C,GACT,MAAMpB,EAAQnd,MAAMI,KAAKzH,MAAKk6D,GAAQ/7D,QACtCqmB,EAAM5d,MAAK,CAACoD,EAAGkH,IAAMlH,EAAE+gD,cAAc75C,KACrC,IAAK,IAAI/T,EAAI,EAAGA,EAAIqnB,EAAM5nB,OAAQO,IAAK,CACnC,MAAMsN,EAAO+Z,EAAMrnB,GACnByoB,EAAU5lB,MAAKk6D,GAAQr2D,IAAI4G,GAAQtN,EACvC,CACJ,CA6BA,aAAAw+D,CAAch7C,EAAQ/hB,GAClB,OAAOoB,MAAKg5D,GAAUpa,OAAOj+B,EAAQ/hB,EACzC,CACA,aAAAg9D,CAAcj7C,EAAQ9L,GAClB,OAAO7U,MAAKg5D,GAAUtvC,OAAO/I,EAAQ9L,EACzC,CAKA,YAAAgnD,CAAahnD,GACT,OAAO7U,KAAK47D,cAAc57D,KAAK+5D,OAAOrD,OAAQ7hD,GAAU,GAC5D,CAUA,iBAAAinD,CAAkBzC,EAAUz6D,GACxB,GAA0B,iBAAd,EAAwB,CAChC,MAAML,EAAIyB,KAAKy7D,SAASpC,GACxBpjD,EAAe1X,EAAG,gBAAiB,WAAY86D,GAC/CA,EAAW96D,CACf,CAEA,OADA0X,EAAe4B,EAAUjZ,EAAM,EAAG,KAAOy6D,EAAS7B,SAAU,uCAAuC6B,EAAS5uD,QAAS,OAAQ7L,GACtHoB,KAAK27D,cAActC,EAAS3C,OAAQ7+C,EAAUjZ,EAAM,GAC/D,CASA,iBAAAm9D,CAAkB1C,EAAUxkD,GACxB,GAA0B,iBAAd,EAAwB,CAChC,MAAMtW,EAAIyB,KAAKy7D,SAASpC,GACxBpjD,EAAe1X,EAAG,gBAAiB,WAAY86D,GAC/CA,EAAW96D,CACf,CACA,OAAOmV,EAAO,CACV2lD,EAAS7B,SACTx3D,KAAK47D,cAAcvC,EAAS3C,OAAQ7hD,GAAU,KAEtD,CASA,kBAAAmnD,CAAmB3C,EAAUz6D,GACzB,GAA0B,iBAAd,EAAwB,CAChC,MAAML,EAAIyB,KAAK06D,YAAYrB,GAC3BpjD,EAAe1X,EAAG,mBAAoB,WAAY86D,GAClDA,EAAW96D,CACf,CAEA,OADA0X,EAAe4B,EAAUjZ,EAAM,EAAG,KAAOy6D,EAAS7B,SAAU,0CAA0C6B,EAAS5uD,QAAS,OAAQ7L,GACzHoB,KAAK27D,cAActC,EAAS3C,OAAQ7+C,EAAUjZ,EAAM,GAC/D,CAMA,kBAAAq9D,CAAmB5C,EAAUxkD,GACzB,GAA0B,iBAAd,EAAwB,CAChC,MAAMtW,EAAIyB,KAAK06D,YAAYrB,GAC3BpjD,EAAe1X,EAAG,mBAAoB,WAAY86D,GAClDA,EAAW96D,CACf,CACA,OAAOmV,EAAO,CACV2lD,EAAS7B,SACTx3D,KAAK47D,cAAcvC,EAAS3C,OAAQ7hD,GAAU,KAEtD,CAUA,oBAAAqnD,CAAqB7C,EAAUz6D,GAC3B,GAA0B,iBAAd,EAAwB,CAChC,MAAML,EAAIyB,KAAK06D,YAAYrB,GAC3BpjD,EAAe1X,EAAG,mBAAoB,WAAY86D,GAClDA,EAAW96D,CACf,CACA,IAAIkX,EAAU,iCACd,MAAMiC,EAAQL,EAAazY,GAC3B,GAAK8Y,EAAM9a,OAAS,IAAQ,EACxB,IACI,OAAOoD,MAAKg5D,GAAUpa,OAAOya,EAASpB,QAASvgD,EACnD,CACA,MAAOxD,GACHuB,EAAU,8BACd,CAGJO,GAAO,EAAOP,EAAS,WAAY,CAC/B3B,MAAO2D,EAAQC,GACfhC,KAAM,CAAEqB,OAAQsiD,EAAS5uD,KAAMqmC,UAAWuoB,EAASzhB,WAE3D,CACA,SAAApiC,CAAUgK,EAAOwsC,GACb,MAAMptD,EAAOwY,EAASoI,EAAO,QACvBtL,EAAQukD,GAASK,wBAAwB,OAAQ9M,EAAIptD,GAG3D,GAAIsV,EAAMuB,QAAQkE,WADG,6CACuB,CACxC,MAAM69C,EAAW//C,EAAQ7Y,EAAKnD,MAAM,EAAG,IACjC2sD,EAAKpoD,KAAKy7D,SAASjE,GACzB,GAAIpP,EACA,IACI,MAAMpjC,EAAOhlB,MAAKg5D,GAAUpa,OAAOwJ,EAAGsO,OAAQ93D,EAAKnD,MAAM,IACzDyY,EAAM+kD,OAAS,CACXxuD,KAAM29C,EAAG39C,KAAMqmC,UAAWsX,EAAGxQ,SAAU5yB,QAE3C9Q,EAAMsG,OAAStG,EAAM+kD,OAAOnoB,UAC5B58B,EAAMuB,QAAU,uBAAuBvB,EAAMsG,QACjD,CACA,MAAO7b,GACHuV,EAAMuB,QAAU,oDACpB,CAER,CAEA,MAAM0mD,EAASn8D,KAAKo8D,iBAAiBpQ,GAQrC,OAPImQ,IACAjoD,EAAMilD,WAAa,CACfpiD,OAAQolD,EAAO1xD,KACfqmC,UAAWqrB,EAAOrrB,UAClB9rB,KAAMm3C,EAAOn3C,OAGd9Q,CACX,CASA,oBAAAmoD,CAAqBhD,EAAUxkD,GAC3B,GAA0B,iBAAd,EAAwB,CAChC,MAAMtW,EAAIyB,KAAK06D,YAAYrB,GAC3BpjD,EAAe1X,EAAG,mBAAoB,WAAY86D,GAClDA,EAAW96D,CACf,CACA,OAAOkZ,EAAQzX,MAAKg5D,GAAUtvC,OAAO2vC,EAASpB,QAASpjD,GAAU,IACrE,CAgCA,kBAAAynD,CAAmBjD,EAAUxkD,GACzB,GAA0B,iBAAd,EAAwB,CAChC,MAAMtW,EAAIyB,KAAKo7D,SAAS/B,GACxBpjD,EAAe1X,EAAG,gBAAiB,gBAAiB86D,GACpDA,EAAW96D,CACf,CACAyX,EAAOnB,EAAOjY,QAAUy8D,EAAS3C,OAAO95D,OAAQ,0BAA0By8D,EAASzhB,WAAY,sBAAuB,CAAEzhC,MAAOtB,EAAOjY,OAAQwZ,cAAeijD,EAAS3C,OAAO95D,SAC7K,MAAM2/D,EAAS,GACVlD,EAAS5B,WACV8E,EAAOn+D,KAAKi7D,EAAS3B,WAGzB,MAAM8E,EAAc,CAAC/Q,EAAO33C,IACL,WAAf23C,EAAM13C,KACCxS,GAAGuS,GAEU,UAAf23C,EAAM13C,KACJ0iB,GAAUhf,EAAQ3D,KAEV,SAAf23C,EAAM13C,MAAsC,kBAAnB,EACzBD,EAASA,EAAQ,OAAS,OAErB23C,EAAM13C,KAAKlX,MAAM,UACtBiX,EAAQyF,EAAQzF,GAEX23C,EAAM13C,KAAKlX,MAAM,UACtBiX,ElE3sBLkE,EkE2sB0BlE,EAAO,IlE3sBX,GkE6sBG,YAAf23C,EAAM13C,MAEX/T,MAAKg5D,GAAUtvC,OAAO,CAAC,WAAY,CAAC5V,IAEjCqE,EAAaV,EAAQ3D,GAAQ,KAsBxC,IApBAe,EAAOvN,SAAQ,CAACwM,EAAOlC,KACnB,MAAM65C,EAAQ4N,EAAS3C,OAAO9kD,GACzB65C,EAAMkK,QAIE,MAAT7hD,EACAyoD,EAAOn+D,KAAK,MAEY,UAAnBqtD,EAAM9L,UAA2C,UAAnB8L,EAAM9L,SACzC1pC,GAAe,EAAO,gDAAkD,YAAcw1C,EAAMhhD,KAAOqJ,GAE9FzM,MAAM4N,QAAQnB,GACnByoD,EAAOn+D,KAAK0V,EAAM7N,KAAK6N,GAAU0oD,EAAY/Q,EAAO33C,MAGpDyoD,EAAOn+D,KAAKo+D,EAAY/Q,EAAO33C,IAb/BmC,EAAwB,MAATnC,EAAe,qDAAuD,YAAc23C,EAAMhhD,KAAOqJ,EAcpH,IAGGyoD,EAAO3/D,QAAwC,OAA9B2/D,EAAOA,EAAO3/D,OAAS,IAC3C2/D,EAAOt3D,MAEX,OAAOs3D,CACX,CACA,cAAAE,CAAepD,EAAUxkD,GACrB,GAA0B,iBAAd,EAAwB,CAChC,MAAMtW,EAAIyB,KAAKo7D,SAAS/B,GACxBpjD,EAAe1X,EAAG,gBAAiB,gBAAiB86D,GACpDA,EAAW96D,CACf,CACA,MAAMg+D,EAAS,GACTG,EAAY,GACZC,EAAa,GA2BnB,OA1BKtD,EAAS5B,WACV8E,EAAOn+D,KAAKi7D,EAAS3B,WAEzBzhD,EAAepB,EAAOjY,SAAWy8D,EAAS3C,OAAO95D,OAAQ,kCAAmC,SAAUiY,GACtGwkD,EAAS3C,OAAOpvD,SAAQ,CAACmkD,EAAO75C,KAC5B,MAAMkC,EAAQe,EAAOjD,GACrB,GAAI65C,EAAMkK,QACN,GAAmB,WAAflK,EAAM13C,KACNwoD,EAAOn+D,KAAKmD,GAAGuS,SAEd,GAAmB,UAAf23C,EAAM13C,KACXwoD,EAAOn+D,KAAKq4B,GAAU3iB,QAErB,IAAuB,UAAnB23C,EAAM9L,UAA2C,UAAnB8L,EAAM9L,SAEzC,MAAM,IAAIxrC,MAAM,mBAGhBooD,EAAOn+D,KAAK4B,MAAKg5D,GAAUtvC,OAAO,CAAC+hC,EAAM13C,MAAO,CAACD,IACrD,MAGA4oD,EAAUt+D,KAAKqtD,GACfkR,EAAWv+D,KAAK0V,EACpB,IAEG,CACHlV,KAAMoB,MAAKg5D,GAAUtvC,OAAOgzC,EAAWC,GACvCJ,OAAQA,EAEhB,CAEA,cAAAK,CAAevD,EAAUz6D,EAAM29D,GAC3B,GAA0B,iBAAd,EAAwB,CAChC,MAAMh+D,EAAIyB,KAAKo7D,SAAS/B,GACxBpjD,EAAe1X,EAAG,gBAAiB,gBAAiB86D,GACpDA,EAAW96D,CACf,CACA,GAAc,MAAVg+D,IAAmBlD,EAAS5B,UAAW,CACvC,MAAM4D,EAAahC,EAAS3B,UAC5BzhD,EAAeqB,EAAYilD,EAAO,GAAI,KAAOA,EAAO,GAAGtgD,gBAAkBo/C,EAAY,0BAA2B,YAAakB,EAAO,IACpIA,EAASA,EAAO9gE,MAAM,EAC1B,CACA,MAAMk6D,EAAU,GACVkH,EAAa,GACb52C,EAAU,GAChBozC,EAAS3C,OAAOpvD,SAAQ,CAACmkD,EAAO75C,KACxB65C,EAAMkK,QACa,WAAflK,EAAM13C,MAAoC,UAAf03C,EAAM13C,MAAuC,UAAnB03C,EAAM9L,UAA2C,UAAnB8L,EAAM9L,UACzFgW,EAAQv3D,KAAK02D,GAAUrtD,KAAK,CAAEsM,KAAM,UAAWtJ,KAAMghD,EAAMhhD,QAC3Dwb,EAAQ7nB,MAAK,KAGbu3D,EAAQv3D,KAAKqtD,GACbxlC,EAAQ7nB,MAAK,KAIjBy+D,EAAWz+D,KAAKqtD,GAChBxlC,EAAQ7nB,MAAK,GACjB,IAEJ,MAAM0+D,EAA2B,MAAVP,EAAkBv8D,MAAKg5D,GAAUpa,OAAO+W,EAASjiD,EAAO6oD,IAAW,KACpFQ,EAAmB/8D,MAAKg5D,GAAUpa,OAAOie,EAAYj+D,GAAM,GAE3DiW,EAAS,GACT1W,EAAO,GACb,IAAI6+D,EAAkB,EAAGC,EAAe,EA8BxC,OA7BA5D,EAAS3C,OAAOpvD,SAAQ,CAACmkD,EAAO75C,KAC5B,IAAIkC,EAAQ,KACZ,GAAI23C,EAAMkK,QACN,GAAqB,MAAjBmH,EACAhpD,EAAQ,IAAI2lD,GAAQ,WAEnB,GAAIxzC,EAAQrU,GACbkC,EAAQ,IAAI2lD,GAAQqD,EAAcG,WAGlC,IACInpD,EAAQgpD,EAAcG,IAC1B,CACA,MAAO/oD,GACHJ,EAAQI,CACZ,MAIJ,IACIJ,EAAQipD,EAAiBC,IAC7B,CACA,MAAO9oD,GACHJ,EAAQI,CACZ,CAEJW,EAAOzW,KAAK0V,GACZ3V,EAAKC,KAAKqtD,EAAMhhD,MAAQ,KAAK,IAE1Bqa,GAAOgB,UAAUjR,EAAQ1W,EACpC,CAOA,gBAAAi+D,CAAiBpQ,GACb,MAAMptD,EAAOwY,EAAS40C,EAAGptD,KAAM,WACzBkV,EAAQ4E,EAAuB,MAAZszC,EAAGl4C,MAAiBk4C,EAAGl4C,MAAQ,EAAG,YACrDulD,EAAWr5D,KAAK06D,YAAYjjD,EAAQ7Y,EAAKnD,MAAM,EAAG,KACxD,IAAK49D,EACD,OAAO,KAEX,MAAMr0C,EAAOhlB,MAAKg5D,GAAUpa,OAAOya,EAAS3C,OAAQ93D,EAAKnD,MAAM,IAC/D,OAAO,IAAI89D,GAAuBF,EAAUA,EAAS7B,SAAUxyC,EAAMlR,EACzE,CACA,eAAAopD,CAAgBt+D,GACZ,MAAM,IAAIuV,MAAM,QACpB,CAOA,QAAAgpD,CAASx2D,GACL,MAAM0yD,EAAWr5D,KAAKo7D,SAASz0D,EAAI41D,OAAO,IAC1C,OAAKlD,GAAYA,EAAS5B,UACf,KAKJ,IAAI2B,GAAeC,EAAUA,EAAS3B,UAAW13D,KAAK48D,eAAevD,EAAU1yD,EAAI/H,KAAM+H,EAAI41D,QACxG,CAOA,UAAAa,CAAWx+D,GACP,MAAMy+D,EAAU5lD,EAAQ7Y,GAClBy6D,EAAWr5D,KAAKy7D,SAAS5jD,EAAUwlD,EAAS,EAAG,IACrD,IAAKhE,EACD,OAAO,KAEX,MAAMr0C,EAAOhlB,MAAKg5D,GAAUpa,OAAOya,EAAS3C,OAAQ7+C,EAAUwlD,EAAS,IACvE,OAAO,IAAI7D,GAAiBH,EAAUA,EAAS7B,SAAUxyC,EAC7D,CAOA,WAAOvd,CAAKqM,GAER,OAAIA,aAAiB+lD,GACV/lD,EAGY,iBAAX,EACD,IAAI+lD,GAAUrzD,KAAK+E,MAAMuI,IAGF,mBAAtBA,EAAgB,WACjB,IAAI+lD,GAAU/lD,EAAM2mD,cAGD,mBAAlB3mD,EAAY,OACb,IAAI+lD,GAAU/lD,EAAM8jC,OAAO,SAG/B,IAAIiiB,GAAU/lD,EACzB,ECvkCJ,MAAMsE,GAAO/C,OAAO,GAEpB,SAAS0P,GAASjR,GACd,OAAa,MAATA,EACO,KAEJA,CACX,CACA,SAASwpD,GAAOxpD,GACZ,OAAa,MAATA,EACO,KAEJA,EAAM9X,UACjB,CAMO,MAAMuhE,GAITlR,SAaAE,aAUAD,qBAKA,WAAAzuD,CAAYwuD,EAAUE,EAAcD,GAChC33C,EAAiB3U,KAAM,CACnBqsD,SAAUtnC,GAASsnC,GACnBE,aAAcxnC,GAASwnC,GACvBD,qBAAsBvnC,GAASunC,IAEvC,CAIA,MAAA7pD,GACI,MAAM4pD,SAAEA,EAAQE,aAAEA,EAAYD,qBAAEA,GAAyBtsD,KACzD,MAAO,CACH+0C,MAAO,UACPsX,SAAUiR,GAAOjR,GACjBE,aAAc+Q,GAAO/Q,GACrBD,qBAAsBgR,GAAOhR,GAErC,EAOG,SAASkR,GAAYjiE,GACxB,MAAM6Z,EAAS,CAAA,EAEX7Z,EAAIwE,KACJqV,EAAOrV,GAAKxE,EAAIwE,IAEhBxE,EAAIkM,OACJ2N,EAAO3N,KAAOlM,EAAIkM,MAElBlM,EAAIqD,OACJwW,EAAOxW,KAAO6Y,EAAQlc,EAAIqD,OAE9B,MAAM6+D,EAAa,qFAAqF1hE,MAAM,KAC9G,IAAK,MAAMsJ,KAAOo4D,EACRp4D,KAAO9J,GAAoB,MAAZA,EAAI8J,KAGzB+P,EAAO/P,GAAOqT,EAAUnd,EAAI8J,GAAM,WAAWA,MAEjD,MAAMq4D,EAAa,aAAa3hE,MAAM,KACtC,IAAK,MAAMsJ,KAAOq4D,EACRr4D,KAAO9J,GAAoB,MAAZA,EAAI8J,KAGzB+P,EAAO/P,GAAOuT,EAAUrd,EAAI8J,GAAM,WAAWA,MA4BjD,OA1BI9J,EAAIixD,aACJp3C,EAAOo3C,WAAa1B,GAAcvvD,EAAIixD,aAEtC,aAAcjxD,IACd6Z,EAAOuoD,SAAWpiE,EAAIoiE,UAEtB,mBAAoBpiE,IACpB6Z,EAAOwoD,iBAAmBriE,EAAIqiE,gBAE9B,eAAgBriE,IAChB6Z,EAAOyoD,WAAatiE,EAAIsiE,YAExB,wBAAyBtiE,GAAOA,EAAImxD,sBACpCt3C,EAAOs3C,oBAAsBnxD,EAAImxD,oBAAoBjxD,SAErD,QAASF,IACT6Z,EAAOu3C,IAAMpxD,EAAIoxD,KAEjB,UAAWpxD,GAAOA,EAAIqxD,QACtBx3C,EAAOw3C,MAAQrxD,EAAIqxD,MAAM3mD,KAAKiL,GACtBqG,EAAYrG,GACLuG,EAAQvG,GAEZzT,OAAOsY,OAAO,CAAE,EAAE7E,MAG1BkE,CACX,CAKO,MAAM0oD,GAKTC,SAKAr2C,OAOAxqB,KAKA8gE,UAIAC,WAKAC,sBAOA/R,MAUAgS,WAIA/R,SAIAgS,QAKAC,UAIAC,aAKAC,YAKAC,cAKAC,MAKAC,WAIAC,UAQAC,cACAC,IAOA,WAAAhhE,CAAYg5C,EAAOknB,GACf/9D,MAAK6+D,GAAgBhoB,EAAMgoB,aAAa54D,KAAK+lD,GACrB,iBAAR,EACD,IAAI8S,GAAoB9S,EAAI+R,GAEhC/R,IAEXr3C,EAAiB3U,KAAM,CACnB+9D,WACA7gE,KAAM6nB,GAAS8xB,EAAM35C,MACrBwqB,OAAQmvB,EAAMnvB,OACds2C,UAAWnnB,EAAMmnB,UACjBC,WAAYpnB,EAAMonB,WAClBC,sBAAuBrnB,EAAMqnB,sBAC7B/R,MAAOtV,EAAMsV,MACbgS,WAAYtnB,EAAMsnB,WAClB/R,SAAUvV,EAAMuV,SAChBgS,QAASvnB,EAAMunB,QACfG,YAAa1nB,EAAM0nB,YACnBC,cAAe3nB,EAAM2nB,cACrBC,MAAO5nB,EAAM4nB,MACbC,WAAY35C,GAAS8xB,EAAM6nB,YAC3BC,UAAW9nB,EAAM8nB,UACjBC,cAAe75C,GAAS8xB,EAAM+nB,eAC9BP,UAAWxnB,EAAMwnB,UACjBC,aAAcznB,EAAMynB,cAE5B,CAKA,gBAAIO,GACA,OAAO7+D,MAAK6+D,GAAc54D,KAAK+lD,GACP,iBAAR,EACDA,EAEJA,EAAG9uD,MAElB,CASA,0BAAI6hE,GACA,MAAMC,EAAMh/D,MAAK6+D,GAAcpjE,QAE/B,OAAmB,IAAfujE,EAAIpiE,OACG,IAGXoZ,EAA2B,iBAAZgpD,EAAI,GAAkB,sDAAuD,wBAAyB,CACjHtoD,UAAW,2BAERsoD,EACX,CAIA,MAAAv8D,GACI,MAAMm8D,cAAEA,EAAaT,WAAEA,EAAUQ,UAAEA,EAASvS,SAAEA,EAAQgS,QAAEA,EAAOlhE,KAAEA,EAAIuhE,MAAEA,EAAKC,WAAEA,EAAUvS,MAAEA,EAAKzkC,OAAEA,EAAMu2C,WAAEA,EAAUC,sBAAEA,EAAqBG,UAAEA,EAASC,aAAEA,EAAYN,UAAEA,EAASa,aAAEA,GAAiB7+D,KACjM,MAAO,CACH+0C,MAAO,QACP6pB,cAAetB,GAAOsB,GACtBT,WAAYb,GAAOa,GACnBQ,YACAvS,SAAUkR,GAAOlR,GACjBgS,QAASd,GAAOc,GAChBG,YAAajB,GAAOt9D,KAAKu+D,aACzBC,cAAelB,GAAOt9D,KAAKw+D,eAC3BthE,OAAMuhE,QAAOC,aAAYvS,QAAOzkC,SAAQu2C,aAAYD,YACpDE,wBAAuBG,YAAWC,eAClCO,eAER,CACA,CAAC9+C,OAAOC,YACJ,IAAIpO,EAAQ,EACZ,MAAMotD,EAAMh/D,KAAK6+D,aACjB,MAAO,CACH3+D,KAAM,IACE0R,EAAQ5R,KAAKpD,OACN,CACHkX,MAAOkrD,EAAIptD,KAAUqO,MAAM,GAG5B,CAAEnM,WAAOgJ,EAAWmD,MAAM,GAG7C,CAIA,UAAIrjB,GAAW,OAAOoD,MAAK6+D,GAAcjiE,MAAQ,CAIjD,QAAIqiE,GACA,OAAsB,MAAlBj/D,KAAKg+D,UACE,KAEJ,IAAI9+D,KAAsB,IAAjBc,KAAKg+D,UACzB,CAIA,oBAAMkB,CAAeC,GAEjB,IAAInT,EACJ,GAA6B,iBAAjB,EACRA,EAAKhsD,MAAK6+D,GAAcM,OAEvB,CACD,MAAMjiE,EAAOiiE,EAAYljD,cACzB,IAAK,MAAMxb,KAAKT,MAAK6+D,GAAe,CAChC,GAAmB,iBAAP,EAAiB,CACzB,GAAIp+D,IAAMvD,EACN,SAEJ8uD,EAAKvrD,EACL,KACJ,CAEI,GAAIA,EAAEvD,OAASA,EAAf,CAGA8uD,EAAKvrD,EACL,KAFA,CAIR,CACJ,CACA,GAAU,MAANurD,EACA,MAAM,IAAI73C,MAAM,cAEpB,MAAoB,iBAAR,QACMnU,KAAK+9D,SAASmB,eAAelT,GAGpCA,CAEf,CAOA,wBAAAoT,CAAyBD,GACrB,MAAMH,EAAMh/D,KAAK++D,uBACjB,GAA6B,iBAAjB,EACR,OAAOC,EAAIG,GAEfA,EAAcA,EAAYljD,cAC1B,IAAK,MAAM+vC,KAAMgT,EACb,GAAIhT,EAAG9uD,OAASiiE,EACZ,OAAOnT,EAGf/1C,GAAe,EAAO,0BAA2B,cAAekpD,EACpE,CAKA,OAAAE,GAAY,QAASr/D,KAAK9C,IAAM,CAIhC,QAAAwxD,GACI,QAAS1uD,KAAK4+D,aAClB,CAIA,aAAAU,GACI,IAAKt/D,KAAKq/D,UACN,MAAM,IAAIlrD,MAAM,IAEpB,MA61BG,CAAEorD,OAAQ,aAAcriE,MADA25C,EA51BM72C,MA61BM9C,KAAMwqB,OAAQmvB,EAAMnvB,QADnE,IAAmCmvB,CA31B/B,EASG,MAAM2oB,GAKTzB,SAKA0B,gBAKAC,UAOAC,YAOAC,QAIAtpB,QAIA13C,KAOA29D,OAMA3qD,MAIAiuD,iBAIA,WAAAhiE,CAAY8I,EAAKo3D,GACb/9D,KAAK+9D,SAAWA,EAChB,MAAMxB,EAAS9+D,OAAOmd,OAAOjU,EAAI41D,OAAO9gE,SACxCkZ,EAAiB3U,KAAM,CACnBy/D,gBAAiB94D,EAAI84D,gBACrBC,UAAW/4D,EAAI+4D,UACfC,YAAah5D,EAAIg5D,YACjBC,QAASj5D,EAAIi5D,QACbtpB,QAAS3vC,EAAI2vC,QACb13C,KAAM+H,EAAI/H,KACV29D,SACA3qD,MAAOjL,EAAIiL,MACXiuD,iBAAkBl5D,EAAIk5D,kBAE9B,CAIA,MAAAp9D,GACI,MAAM6zC,QAAEA,EAAOopB,UAAEA,EAASC,YAAEA,EAAW/gE,KAAEA,EAAIgT,MAAEA,EAAKguD,QAAEA,EAAOrD,OAAEA,EAAMkD,gBAAEA,EAAeI,iBAAEA,GAAqB7/D,KAC7G,MAAO,CACH+0C,MAAO,MACPuB,UAASopB,YAAWC,cAAa/gE,OAAMgT,QACvCguD,UAASrD,SAAQkD,kBAAiBI,mBAE1C,CAIA,cAAMC,GACF,MAAMjpB,QAAc72C,KAAK+9D,SAAS+B,SAAS9/D,KAAK0/D,WAEhD,OADA1pD,IAAS6gC,EAAO,6BAA8B,gBAAiB,CAAE,GAC1DA,CACX,CAIA,oBAAMqoB,GACF,MAAMlT,QAAWhsD,KAAK+9D,SAASmB,eAAel/D,KAAKy/D,iBAEnD,OADAzpD,IAASg2C,EAAI,6BAA8B,gBAAiB,CAAE,GACvDA,CACX,CAKA,2BAAM+T,GACF,MAAMC,QAAgBhgE,KAAK+9D,SAASgC,sBAAsB//D,KAAKy/D,iBAE/D,OADAzpD,IAASgqD,EAAS,qCAAsC,gBAAiB,CAAE,GACpEA,CACX,CAIA,YAAAC,GACI,MA2uBG,CAAEV,OAAQ,WAAY54D,IAAK,CAC1B84D,iBAFoB94D,EA1uBM3G,MA4uBLy/D,gBACrBC,UAAW/4D,EAAI+4D,UACfC,YAAah5D,EAAIg5D,YACjBrpB,QAAS3vC,EAAI2vC,QACb13C,KAAM+H,EAAI/H,KACV29D,OAAQ9+D,OAAOmd,OAAOjU,EAAI41D,OAAO9gE,SACjCmW,MAAOjL,EAAIiL,QARvB,IAAgCjL,CAzuB5B,EAqBG,MAAMu5D,GAKTnC,SAIAh+D,GAIA0H,KAQA04D,gBAIAjjE,KAIA0U,MAIA8tD,UAIAC,YAMAS,UAQAhC,QAIAG,YAQA8B,kBAQAhU,SAIAiU,aAIAvsD,KASAuJ,OAOAha,KACAi9D,IAIA,WAAA1iE,CAAYmuD,EAAI+R,GACZ/9D,MAAKugE,GAAQ9iE,OAAOmd,OAAOoxC,EAAGuU,KAAKt6D,KAAKU,GAC7B,IAAI64D,GAAI74D,EAAKo3D,MAExB,IAAI1R,EAAWj0C,GACa,MAAxB4zC,EAAGwU,kBACHnU,EAAWL,EAAGwU,kBAEM,MAAfxU,EAAGK,WACRA,EAAWL,EAAGK,UAElB13C,EAAiB3U,KAAM,CACnB+9D,WACAh+D,GAAIisD,EAAGjsD,GACP0H,KAAMukD,EAAGvkD,KACT04D,gBAAiBnU,EAAGmU,gBACpBjjE,KAAM8uD,EAAG9uD,KACT0U,MAAOo6C,EAAGp6C,MACV8tD,UAAW1T,EAAG0T,UACdC,YAAa3T,EAAG2T,YAChBS,UAAWpU,EAAGoU,UACdhC,QAASpS,EAAGoS,QACZiC,kBAAmBrU,EAAGqU,kBACtB9B,YAAavS,EAAGuS,YAChBlS,WACAiU,aAActU,EAAGsU,aACjBvsD,KAAMi4C,EAAGj4C,KAETuJ,OAAQ0uC,EAAG1uC,OACXha,KAAM0oD,EAAG1oD,MAEjB,CAIA,QAAIi9D,GAAS,OAAOvgE,MAAKugE,EAAO,CAIhC,MAAA99D,GACI,MAAM1C,GAAEA,EAAE0H,KAAEA,EAAI04D,gBAAEA,EAAejjE,KAAEA,EAAI0U,MAAEA,EAAK8tD,UAAEA,EAASC,YAAEA,EAAWS,UAAEA,EAASG,KAAEA,EAAIjjD,OACvFA,EAAMha,KAAEA,GAAStD,KACjB,MAAO,CACH+0C,MAAO,qBACP2qB,YAAWC,cAEXQ,kBACAE,kBAAmB/C,GAAOt9D,KAAKqgE,mBAC/B54D,OACA4kD,SAAUiR,GAAOt9D,KAAKqsD,UACtBkS,YAAajB,GAAOt9D,KAAKu+D,aACzB+B,aAAchD,GAAOt9D,KAAKsgE,cAC1BlC,QAASd,GAAOt9D,KAAKo+D,SACrBlhE,OAAM0U,QAAO2uD,OAAMH,YAAW98D,OAAMga,SAAQvd,KAEpD,CAIA,UAAInD,GAAW,OAAOoD,KAAKugE,KAAK3jE,MAAQ,CACxC,CAACmjB,OAAOC,YACJ,IAAIpO,EAAQ,EACZ,MAAO,CACH1R,KAAM,IACE0R,EAAQ5R,KAAKpD,OACN,CAAEkX,MAAO9T,KAAKugE,KAAK3uD,KAAUqO,MAAM,GAEvC,CAAEnM,WAAOgJ,EAAWmD,MAAM,GAG7C,CAIA,OAAIwgD,GACA,OAAOzgE,KAAKo+D,QAAUp+D,KAAKqsD,QAC/B,CAIA,cAAMyT,GACF,MAAMjpB,QAAc72C,KAAK+9D,SAAS+B,SAAS9/D,KAAK0/D,WAChD,GAAa,MAAT7oB,EACA,MAAM,IAAI1iC,MAAM,QAEpB,OAAO0iC,CACX,CAIA,oBAAMqoB,GACF,MAAMlT,QAAWhsD,KAAK+9D,SAASmB,eAAel/D,KAAK9C,MACnD,GAAU,MAAN8uD,EACA,MAAM,IAAI73C,MAAM,QAEpB,OAAO63C,CACX,CAOA,eAAM0U,GACF,aAAc1gE,KAAK+9D,SAAS4C,qBAAqB3gE,KAAK9C,KAC1D,CAIA,mBAAM0jE,GACF,aAAc5gE,KAAK+9D,SAAS8C,iBAAoB7gE,KAAK2/D,YAAc,CACvE,CAIA,YAAAM,GACI,OAAOa,GAA+B9gE,KAC1C,CAIA,cAAA+gE,CAAer6B,GAEX,OADA1wB,GAAQ0wB,GAASA,EAAM24B,UAAW,gDAAiD,wBAAyB,CAAE3oD,UAAW,0BAClHsqD,GAAiChhE,KAAM0mC,EAClD,EAWG,MAAMo4B,GAKTf,SAMA4B,YAMAD,UAIA9tD,MAIA1U,KAKA6W,KASAhU,GAMA0H,KASA0kD,MAMAC,SAaAC,SAMAC,qBAKAC,aAIAE,iBAIA7tD,KAKAkV,MAIAohC,QAIApE,UAKA0b,WAIAE,oBACAuU,IAIA,WAAApjE,CAAYmuD,EAAI+R,GACZ/9D,KAAK+9D,SAAWA,EAChB/9D,KAAK2/D,YAAiC,MAAlB3T,EAAG2T,YAAuB3T,EAAG2T,YAAc,KAC/D3/D,KAAK0/D,UAA6B,MAAhB1T,EAAG0T,UAAqB1T,EAAG0T,UAAY,KACzD1/D,KAAK9C,KAAO8uD,EAAG9uD,KACf8C,KAAK4R,MAAQo6C,EAAGp6C,MAChB5R,KAAK+T,KAAOi4C,EAAGj4C,KACf/T,KAAKyH,KAAOukD,EAAGvkD,KACfzH,KAAKD,GAAKisD,EAAGjsD,IAAM,KACnBC,KAAKosD,SAAWJ,EAAGI,SACnBpsD,KAAKmsD,MAAQH,EAAGG,MAChBnsD,KAAKpB,KAAOotD,EAAGptD,KACfoB,KAAK8T,MAAQk4C,EAAGl4C,MAChB9T,KAAKqsD,SAAWL,EAAGK,SACnBrsD,KAAKssD,qBAAmD,MAA3BN,EAAGM,qBAAgCN,EAAGM,qBAAuB,KAC1FtsD,KAAKusD,aAAmC,MAAnBP,EAAGO,aAAwBP,EAAGO,aAAe,KAClEvsD,KAAKysD,iBAA2C,MAAvBT,EAAGS,iBAA4BT,EAAGS,iBAAmB,KAC9EzsD,KAAKk1C,QAAU8W,EAAG9W,QAClBl1C,KAAK8wC,UAAYkb,EAAGlb,UACpB9wC,KAAKwsD,WAA+B,MAAjBR,EAAGQ,WAAsBR,EAAGQ,WAAa,KAC5DxsD,KAAK0sD,oBAAiD,MAA1BV,EAAGU,oBAA+BV,EAAGU,oBAAsB,KACvF1sD,MAAKihE,IAAe,CACxB,CAIA,MAAAx+D,GACI,MAAMk9D,YAAEA,EAAWD,UAAEA,EAAS9tD,MAAEA,EAAK1U,KAAEA,EAAI6W,KAAEA,EAAIhU,GAAEA,EAAE0H,KAAEA,EAAI0kD,MAAEA,EAAKvtD,KAAEA,EAAIkyC,UAAEA,EAAS0b,WAAEA,EAAUE,oBAAEA,GAAwB1sD,KACzH,MAAO,CACH+0C,MAAO,sBACPyX,aAAYmT,cAAaD,YACzBhT,sBACAxX,QAASooB,GAAOt9D,KAAKk1C,SACrBt2C,OAAM6I,OACN2kD,SAAUkR,GAAOt9D,KAAKosD,UACtBC,SAAUiR,GAAOt9D,KAAKqsD,UACtBnvD,OACAqvD,aAAc+Q,GAAOt9D,KAAKusD,cAC1BD,qBAAsBgR,GAAOt9D,KAAKssD,sBAClCG,iBAAkB6Q,GAAOt9D,KAAKysD,kBAC9BN,QAAOrb,YAAW/wC,KAAI6R,QAAOmC,OAC7BD,MAAOwpD,GAAOt9D,KAAK8T,OAE3B,CAMA,cAAMgsD,GACF,IAAIH,EAAc3/D,KAAK2/D,YACvB,GAAmB,MAAfA,EAAqB,CACrB,MAAM3T,QAAWhsD,KAAKk/D,iBAClBlT,IACA2T,EAAc3T,EAAG2T,YAEzB,CACA,GAAmB,MAAfA,EACA,OAAO,KAEX,MAAM9oB,EAAQ72C,KAAK+9D,SAAS+B,SAASH,GACrC,GAAa,MAAT9oB,EACA,MAAM,IAAI1iC,MAAM,QAEpB,OAAO0iC,CACX,CAMA,oBAAMqoB,GACF,OAAOl/D,KAAK+9D,SAASmB,eAAel/D,KAAK9C,KAC7C,CAIA,mBAAM0jE,GACF,GAAwB,MAApB5gE,KAAK2/D,YAAqB,CAC1B,MAAM3T,GAAEA,EAAE2T,YAAEA,SAAsBprD,EAAkB,CAChDy3C,GAAIhsD,KAAKk/D,iBACTS,YAAa3/D,KAAK+9D,SAAS8C,mBAG/B,OAAU,MAAN7U,GAAgC,MAAlBA,EAAG2T,YACV,EAEJA,EAAc3T,EAAG2T,YAAc,CAC1C,CAEA,aAD0B3/D,KAAK+9D,SAAS8C,iBACnB7gE,KAAK2/D,YAAc,CAC5C,CAUA,UAAM/1D,CAAKs3D,EAAWC,GAClB,MAAMC,EAAyB,MAAbF,EAAqB,EAAIA,EACrC1kD,EAAuB,MAAZ2kD,EAAoB,EAAIA,EACzC,IAAIF,EAAajhE,MAAKihE,GAClBI,GAAY,EACZC,GAAgC,IAAhBL,EACpB,MAAMM,EAAmBjtD,UAErB,GAAIgtD,EACA,OAAO,KAEX,MAAM3B,YAAEA,EAAWxT,MAAEA,SAAgB53C,EAAkB,CACnDorD,YAAa3/D,KAAK+9D,SAAS8C,iBAC3B1U,MAAOnsD,KAAK+9D,SAASyD,oBAAoBxhE,KAAKyH,QAIlD,GAAI0kD,EAAQnsD,KAAKmsD,MAEb,YADA8U,EAAatB,GAIjB,GAAI2B,EACA,OAAO,KAEX,MAAMG,QAAczhE,KAAKk/D,iBACzB,IAAIuC,GAA8B,MAArBA,EAAM9B,YAWnB,KANkB,IAAd0B,IACAA,EAAWJ,EAAa,EACpBI,EAAWrhE,MAAKihE,KAChBI,EAAWrhE,MAAKihE,KAGjBI,GAAY1B,GAAa,CAE5B,GAAI2B,EACA,OAAO,KAEX,MAAMzqB,QAAc72C,KAAK+9D,SAAS+B,SAASuB,GAAU,GAErD,GAAa,MAATxqB,EACA,OAGJ,IAAK,MAAM35C,KAAQ25C,EACf,GAAI35C,IAAS8C,KAAK9C,KACd,OAIR,IAAK,IAAIC,EAAI,EAAGA,EAAI05C,EAAMj6C,OAAQO,IAAK,CACnC,MAAM6uD,QAAWnV,EAAMqoB,eAAe/hE,GACtC,GAAI6uD,EAAGvkD,OAASzH,KAAKyH,MAAQukD,EAAGG,QAAUnsD,KAAKmsD,MAAO,CAElD,GAAImV,EACA,OAAO,KAEX,MAAMtB,QAAgBhgE,KAAK+9D,SAASgC,sBAAsB/T,EAAG9uD,MAE7D,GAAe,MAAX8iE,EACA,OAGJ,GAAKL,EAAcK,EAAQL,YAAc,EAAKyB,EAC1C,OAGJ,IAAI5mD,EAAS,WACTwxC,EAAGptD,OAASoB,KAAKpB,MAAQotD,EAAGjsD,KAAOC,KAAKD,IAAMisD,EAAGl4C,QAAU9T,KAAK8T,MAChE0G,EAAS,WAEQ,OAAZwxC,EAAGptD,MAAiBotD,EAAGvkD,OAASukD,EAAGjsD,IAAMisD,EAAGl4C,QAAUsE,KAC3DoC,EAAS,aAEbxE,GAAO,EAAO,2BAA4B,uBAAwB,CAC9D+F,UAAuB,aAAXvB,GAAoC,cAAXA,EACrCA,SACAknD,YAAa1V,EAAG2V,uBAAuBV,GACvC/jE,KAAM8uD,EAAG9uD,KACT8iE,WAER,CACJ,CACAqB,GACJ,CACM,EAEJO,EAAgB5B,IAClB,GAAe,MAAXA,GAAsC,IAAnBA,EAAQ1iD,OAC3B,OAAO0iD,EAEXhqD,GAAO,EAAO,iCAAkC,iBAAkB,CAC9D+iD,OAAQ,kBACRn6D,KAAM,KAAM4b,OAAQ,KAAM2+C,WAAY,KAAMF,OAAQ,KACpDC,YAAa,CACTn5D,GAAIigE,EAAQjgE,GACZ0H,KAAMu4D,EAAQv4D,KACd7I,KAAM,IACPohE,WACL,EAEAA,QAAgBhgE,KAAK+9D,SAASgC,sBAAsB//D,KAAK9C,MAC/D,GAAiB,IAAbkkE,EACA,OAAOQ,EAAa5B,GAExB,GAAIA,GACA,SAAWA,EAAQY,iBAAoBQ,EACnC,OAAOQ,EAAa5B,QAOxB,SAFMuB,IAEW,IAAbH,EACA,OAAO,KAGf,MAAMS,EAAS,IAAIrtD,SAAQ,CAAC5J,EAASk3D,KAEjC,MAAMC,EAAa,GACbngD,EAAS,KAAQmgD,EAAWz6D,SAAS/K,GAAMA,KAAI,EAIrD,GAFAwlE,EAAW3jE,MAAK,KAAQkjE,GAAe,CAAI,IAEvC9kD,EAAU,EAAG,CACb,MAAMF,EAAQje,YAAW,KACrBujB,IACAkgD,EAAOtsD,EAAU,+BAAgC,WAAW,GAC7DgH,GACHulD,EAAW3jE,MAAK,KAAQ8D,aAAaoa,EAAM,GAC/C,CACA,MAAM0lD,EAAa1tD,MAAO0rD,IAEtB,SAAWA,EAAQY,iBAAoBQ,EAAU,CAC7Cx/C,IACA,IACIhX,EAAQg3D,EAAa5B,GACzB,CACA,MAAO9rD,GACH4tD,EAAO5tD,EACX,CACJ,GAKJ,GAHA6tD,EAAW3jE,MAAK,KAAQ4B,KAAK+9D,SAAS39D,IAAIJ,KAAK9C,KAAM8kE,EAAW,IAChEhiE,KAAK+9D,SAASv9D,GAAGR,KAAK9C,KAAM8kE,GAExBf,GAAc,EAAG,CACjB,MAAMgB,EAAkB3tD,UACpB,UAEUitD,GACV,CACA,MAAOrtD,GAEH,GAAIoB,EAAQpB,EAAO,wBAGf,OAFA0N,SACAkgD,EAAO5tD,EAGf,CAEKotD,GACDthE,KAAK+9D,SAASx3D,KAAK,QAAS07D,EAChC,EAEJF,EAAW3jE,MAAK,KAAQ4B,KAAK+9D,SAAS39D,IAAI,QAAS6hE,EAAgB,IACnEjiE,KAAK+9D,SAASx3D,KAAK,QAAS07D,EAChC,KAEJ,aAAaJ,CACjB,CAYA,OAAAxC,GACI,OAA0B,MAAlBr/D,KAAK0/D,SACjB,CAQA,QAAAlR,GACI,OAAsB,IAAdxuD,KAAK+T,IACjB,CAQA,QAAA06C,GACI,OAAsB,IAAdzuD,KAAK+T,IACjB,CAQA,QAAA26C,GACI,OAAsB,IAAd1uD,KAAK+T,IACjB,CAKA,QAAA46C,GACI,OAAsB,IAAd3uD,KAAK+T,IACjB,CAKA,YAAAksD,GAEI,OADAjqD,EAAOhW,KAAKq/D,UAAW,wCAAyC,wBAAyB,CAAE3oD,UAAW,kBAC/FoqD,GAA+B9gE,KAC1C,CAKA,cAAA+gE,CAAer6B,GAGX,OAFA1wB,EAAOhW,KAAKq/D,UAAW,wCAAyC,wBAAyB,CAAE3oD,UAAW,kBACtGV,GAAQ0wB,GAASA,EAAM24B,UAAW,gDAAiD,wBAAyB,CAAE3oD,UAAW,kBAClHsqD,GAAiChhE,KAAM0mC,EAClD,CAUA,sBAAAi7B,CAAuBV,GACnBhrD,EAAekD,OAAOC,UAAU6nD,IAAeA,GAAc,EAAG,qBAAsB,aAAcA,GACpG,MAAMjV,EAAK,IAAI8S,GAAoB9+D,KAAMA,KAAK+9D,UAE9C,OADA/R,GAAGiV,GAAcA,EACVjV,CACX,EAKJ,SAASgV,GAAiChV,EAAItlB,GAC1C,MAAO,CAAE64B,OAAQ,sBAAuBvT,KAAItlB,QAChD,CACA,SAASo6B,GAA+B9U,GACpC,MAAO,CAAEuT,OAAQ,mBAAoBvT,KACzC,CCpwCO,MAAMkW,WAAiB1C,GAI1B2C,UAIA9I,SAIAr0C,KAIA,WAAAnnB,CAAY8I,EAAKy7D,EAAO/I,GACpB1vD,MAAMhD,EAAKA,EAAIo3D,UAEfppD,EAAiB3U,KAAM,CAAEglB,KADZo9C,EAAMxF,eAAevD,EAAU1yD,EAAI/H,KAAM+H,EAAI41D,QAC3BlD,WAAU8I,UAAWC,GACvD,CAID,aAAIC,GAAc,OAAOriE,KAAKq5D,SAAS5uD,IAAO,CAI9C,kBAAI63D,GAAmB,OAAOtiE,KAAKq5D,SAASzhB,QAAW,EAKpD,MAAM2qB,WAA0B/C,GAInCtrD,MAIA,WAAArW,CAAY8I,EAAKuN,GACbvK,MAAMhD,EAAKA,EAAIo3D,UACfppD,EAAiB3U,KAAM,CAAEkU,SAC5B,EAME,MAAMsuD,WAAmCtC,GAC5CkC,IAIA,WAAAvkE,CAAYukE,EAAOrE,EAAU/R,GACzBriD,MAAMqiD,EAAI+R,GACV/9D,MAAKoiE,GAASA,CACjB,CAKD,QAAI7B,GACA,OAAO52D,MAAM42D,KAAKt6D,KAAKU,IACnB,MAAM0yD,EAAW1yD,EAAI41D,OAAO3/D,OAASoD,MAAKoiE,GAAOhH,SAASz0D,EAAI41D,OAAO,IAAM,KAC3E,GAAIlD,EACA,IACI,OAAO,IAAI6I,GAASv7D,EAAK3G,MAAKoiE,GAAQ/I,EACzC,CACD,MAAOnlD,GACH,OAAO,IAAIquD,GAAkB57D,EAAKuN,EACrC,CAEL,OAAOvN,CAAG,GAEjB,EAME,MAAM87D,WAAoC3D,GAC7CsD,IAIA,WAAAvkE,CAAYukE,EAAOrE,EAAU/R,GACzBriD,MAAMqiD,EAAI+R,GACV/9D,MAAKoiE,GAASA,CACjB,CAUD,UAAMx4D,CAAKw3D,EAAU5kD,GACjB,MAAMwjD,QAAgBr2D,MAAMC,KAAKw3D,EAAU5kD,GAC3C,OAAe,MAAXwjD,EACO,KAEJ,IAAIwC,GAA2BxiE,MAAKoiE,GAAQpiE,KAAK+9D,SAAUiC,EACrE,EAME,MAAM0C,WAAoCxoD,EAI7CvT,IAIA,WAAA9I,CAAY8kE,EAAUtoD,EAAUF,EAAQxT,GACpCgD,MAAMg5D,EAAUtoD,EAAUF,GAC1BxF,EAAiB3U,KAAM,CAAE2G,OAC5B,CAID,cAAMm5D,GACF,aAAa9/D,KAAK2G,IAAIm5D,UACzB,CAID,oBAAMZ,GACF,aAAal/D,KAAK2G,IAAIu4D,gBACzB,CAID,2BAAMa,GACF,aAAa//D,KAAK2G,IAAIo5D,uBACzB,EAME,MAAM6C,WAA6BF,GAItC,WAAA7kE,CAAY8kE,EAAUtoD,EAAUF,EAAQk/C,EAAUwJ,GAC9Cl5D,MAAMg5D,EAAUtoD,EAAUF,EAAQ,IAAI+nD,GAASW,EAAMF,EAASR,UAAW9I,IAEzE1kD,EAAiB3U,KAAM,CAAEglB,KADZ29C,EAASR,UAAUvF,eAAevD,EAAUr5D,KAAK2G,IAAI/H,KAAMoB,KAAK2G,IAAI41D,QAClDlD,YAClC,CAID,aAAIgJ,GACA,OAAOriE,KAAKq5D,SAAS5uD,IACxB,CAID,kBAAI63D,GACA,OAAOtiE,KAAKq5D,SAASzhB,QACxB,ECvKL,MAAMx/B,GAAO/C,OAAO,GACpB,SAASytD,GAAQhvD,GACb,OAAQA,GAAiC,mBAAhBA,EAAU,IACvC,CACA,SAASivD,GAAYjvD,GACjB,OAAQA,GAAwC,mBAAvBA,EAAiB,WAC9C,CACA,SAASkvD,GAAWlvD,GAChB,OAAQA,GAAwC,mBAAvBA,EAAiB,WAC9C,CACA,SAASmvD,GAAQnvD,GACb,OAAQA,GAA4C,mBAA3BA,EAAqB,eAClD,CACA,SAASovD,GAAYpvD,GACjB,GAAa,MAATA,EAAe,CACf,GAAIkvD,GAAWlvD,GACX,OAAOA,EAEX,GAAIA,EAAMiqD,SACN,OAAOjqD,EAAMiqD,QAEpB,CAEL,CACA,MAAMoF,GACFhpD,IACAk/C,SACA,WAAAx7D,CAAY8kE,EAAUtJ,EAAUr0C,GAE5B,GADArQ,EAAiB3U,KAAM,CAAEq5D,aACrBA,EAAS3C,OAAO95D,OAASooB,EAAKpoB,OAC9B,MAAM,IAAIuX,MAAM,sBAGpB,MAAMivD,EAASC,GAAUV,EAASS,OAAQ,eACpC/rB,EAAW2rB,GAAWI,GAAUA,EAAS,KAC/CpjE,MAAKma,GAAU,iBACX,MAAMmpD,QAAqB9uD,QAAQhQ,IAAI60D,EAAS3C,OAAOzwD,KAAI,CAACwlD,EAAO75C,IAEpD,MADCoT,EAAKpT,GAEN,KAEJ65C,EAAMwK,UAAUjxC,EAAKpT,IAAQ,CAACmC,EAAMD,IAC1B,YAATC,EACI1M,MAAM4N,QAAQnB,GACPU,QAAQhQ,IAAIsP,EAAM7N,KAAKxF,GAAM22C,GAAe32C,EAAG42C,MAEnDD,GAAetjC,EAAOujC,GAE1BvjC,OAGf,OAAO6uD,EAASR,UAAU7F,mBAAmBjD,EAAUiK,EAC1D,CAjBc,EAkBlB,CACD,cAAAC,GACI,OAAOvjE,MAAKma,EACf,EAQL,SAASkpD,GAAUvvD,EAAO0vD,GACtB,OAAa,MAAT1vD,EACO,KAEqB,mBAApBA,EAAM0vD,GACP1vD,EAEPA,EAAMiqD,UAAiD,mBAA7BjqD,EAAMiqD,SAASyF,GAClC1vD,EAAMiqD,SAEV,IACX,CACA,SAAS0F,GAAY3vD,GACjB,OAAa,MAATA,EACO,KAEJA,EAAMiqD,UAAY,IAC7B,CAIOzpD,eAAeovD,GAAcpoE,EAAKi4D,GAErC,MAAMoQ,EAAalsB,GAAMiH,YAAYpjD,EAAK,aAC1C2a,EAAuC,iBAAhB,EAA0B,8BAA+B,YAAa3a,GAE7F,MAAMkjD,EAAYgf,GAAYmG,GAO9B,OANA1tD,EAA+B,MAAhBuoC,EAAUz+C,KAAewzD,GAAW,IAAIr1D,QAAQ,OAAS,EAAG,qBAAsB,eAAgBsgD,EAAUz+C,IAC3HkW,EAAiC,MAAlBuoC,EAAU5/C,OAAiB20D,GAAW,IAAIr1D,QAAQ,SAAW,EAAG,uBAAwB,iBAAkBsgD,EAAU5/C,MAE/H4/C,EAAU/2C,OACV+2C,EAAU/2C,KAAO+2C,EAAU/2C,MAExB+2C,CACX,CAkBA,SAASolB,GAAqBjB,GAC1B,MAAMkB,EAAsBvvD,eAAgBkqC,GAExC,MAAMwN,QAAY0X,GAAcllB,EAAW,CAAC,SAC5CwN,EAAGjsD,SAAW4iE,EAAS/rB,aACnBoV,EAAGvkD,OACHukD,EAAGvkD,WAAa2vC,GAAe4U,EAAGvkD,KAAMy7D,GAAYP,EAASS,UAEjE,MAAMhB,EAAQO,EAASR,UACjB2B,EAAWprD,EAAWszC,EAAGl4C,OAASsE,GAAO,qBAAuBA,GAChE2rD,EAAgC,QAArB/X,EAAGptD,MAAQ,OACxBwjE,EAAMpI,UAAaoI,EAAMpI,SAASpC,UAAWwK,EAAMnI,SAAY8J,GAAWD,GAC1E7tD,GAAe,EAAO,oEAAqE,YAAauoC,GAE5GvoC,EAAemsD,EAAMpI,UAAY+J,EAAQ,4CAA6C,iBAAkB/X,EAAGptD,MAM3G,OAHAqX,EADgBmsD,EAAMnI,SAAYmI,EAAMpI,UAAYoI,EAAMpI,SAASpC,SACzCkM,EAAS,4CAA6C,kBAAmB9X,EAAGl4C,OAEtGmC,EAAemsD,EAAMpI,UAAY+J,EAAQ,4CAA6C,iBAAkB/X,EAAGptD,MACpGotD,CACf,EAeUl/C,EAAOwH,eAAgBkqC,GACzB,MAAM4kB,EAAST,EAASS,OACxBptD,EAAOitD,GAAQG,GAAS,wDAAyD,wBAAyB,CAAE1sD,UAAW,oBACvH,MAAMs1C,QAAWoX,EAAOY,sBAAsBH,EAAoBrlB,IAC5Duf,EAAW0F,GAAYd,EAASS,QAGtC,OAAO,IAAIX,GAA4BE,EAASR,UAAWpE,EAAU/R,EAC7E,EAMUj1C,EAASzC,MAAOkqC,SACL1xC,EAAK0xC,GAQtB,OANA7pC,EAAiBoC,EAAQ,CACrBktD,UAAWtB,EACXuB,YAVgB5vD,eAAgBkqC,GAChC,MAAM4kB,EAASC,GAAUV,EAASS,OAAQ,eAE1C,OADAptD,EAAO+sD,GAAYK,GAAS,kDAAmD,wBAAyB,CAAE1sD,UAAW,sBACxG0sD,EAAOc,kBAAkBL,EAAoBrlB,GAClE,EAOQqlB,sBACA/2D,OAAMq3D,WAnCS7vD,eAAgBkqC,GAC/B,MAAM4kB,EAASC,GAAUV,EAASS,OAAQ,QAC1CptD,EAAO8sD,GAAQM,GAAS,2CAA4C,wBAAyB,CAAE1sD,UAAW,SAC1G,MAAMs1C,QAAW6X,EAAoBrlB,GACrC,IACI,aAAa4kB,EAAOtlE,KAAKkuD,EAC5B,CACD,MAAO93C,GACH,GAAIqB,EAAgBrB,IAAUA,EAAMtV,KAChC,MAAM+jE,EAASR,UAAU3sD,UAAUtB,EAAMtV,KAAMotD,GAEnD,MAAM93C,CACT,CACT,IAwBW6C,CACX,CACA,SAASqtD,GAAmBzB,EAAUt9D,GAClC,MAAMg/D,EAAc,YAAar/C,GAC7B,MAAMq0C,EAAWsJ,EAASR,UAAUzH,YAAYr1D,EAAK2f,GAKrD,OAJAhP,EAAOqjD,EAAU,uBAAwB,wBAAyB,CAC9D3iD,UAAW,WACXhB,KAAM,CAAErQ,MAAK2f,UAEVq0C,CACf,EACUwK,EAAsBvvD,kBAAmB0Q,GAC3C,MAAMq0C,EAAWgL,KAAer/C,GAEhC,IAAIw5B,EAAY,CAAA,EAOhB,GANI6a,EAAS3C,OAAO95D,OAAS,IAAMooB,EAAKpoB,SACpC4hD,QAAkBklB,GAAc1+C,EAAK/f,OACjCu5C,EAAU/2C,OACV+2C,EAAU/2C,WAAa2vC,GAAeoH,EAAU/2C,KAAMy7D,GAAYP,EAASS,WAG/E/J,EAAS3C,OAAO95D,SAAWooB,EAAKpoB,OAChC,MAAM,IAAIuX,MAAM,8EAEpB,MAAMmvD,QAjGPhvD,eAA2BgwD,EAAS5N,EAAQ1xC,GAE/C,MAAMo+C,EAASC,GAAUiB,EAAS,eAC5BjtB,EAAW2rB,GAAWI,GAAUA,EAAS,KAC/C,aAAa5uD,QAAQhQ,IAAIkyD,EAAOzwD,KAAI,CAACwlD,EAAO75C,IACjC65C,EAAMwK,UAAUjxC,EAAKpT,IAAQ,CAACmC,EAAMD,KACvCA,EAAQ2jC,GAAMiH,YAAY5qC,EAAOC,GACpB,YAATA,EACOqjC,GAAetjC,EAAOujC,GAE1BvjC,OAGnB,CAoFmCywD,CAAY5B,EAASS,OAAQ/J,EAAS3C,OAAQ1xC,GACzE,OAAOvnB,OAAOsY,OAAO,CAAE,EAAEyoC,QAAiBjqC,EAAkB,CACxDxU,GAAI4iE,EAAS/rB,aACbh4C,KAAM+jE,EAASR,UAAUlG,mBAAmB5C,EAAUiK,KAElE,EACUa,EAAa7vD,kBAAmB0Q,GAClC,MAAM5P,QAAeovD,KAAoBx/C,GACzC,OAAsB,IAAlB5P,EAAOxY,OACAwY,EAAO,GAEXA,CACf,EACUtI,EAAOwH,kBAAmB0Q,GAC5B,MAAMo+C,EAAST,EAASS,OACxBptD,EAAOitD,GAAQG,GAAS,wDAAyD,wBAAyB,CAAE1sD,UAAW,oBACvH,MAAMs1C,QAAWoX,EAAOY,sBAAsBH,KAAuB7+C,IAC/D+4C,EAAW0F,GAAYd,EAASS,QAGtC,OAAO,IAAIX,GAA4BE,EAASR,UAAWpE,EAAU/R,EAC7E,EAMUwY,EAAmBlwD,kBAAmB0Q,GACxC,MAAMo+C,EAASC,GAAUV,EAASS,OAAQ,QAC1CptD,EAAO8sD,GAAQM,GAAS,2CAA4C,wBAAyB,CAAE1sD,UAAW,SAC1G,MAAMs1C,QAAW6X,KAAuB7+C,GACxC,IAAI5P,EAAS,KACb,IACIA,QAAeguD,EAAOtlE,KAAKkuD,EAC9B,CACD,MAAO93C,GACH,GAAIqB,EAAgBrB,IAAUA,EAAMtV,KAChC,MAAM+jE,EAASR,UAAU3sD,UAAUtB,EAAMtV,KAAMotD,GAEnD,MAAM93C,CACT,CACD,MAAMmlD,EAAWgL,KAAer/C,GAChC,OAAO29C,EAASR,UAAUjG,qBAAqB7C,EAAUjkD,EACjE,EACU2B,EAASzC,SAAU0Q,IACJq/C,KAAer/C,GACnBkzC,eACIiM,KAAcn/C,SAElBlY,KAAQkY,GAuBzB,OArBArQ,EAAiBoC,EAAQ,CACrBtM,KAAMk4D,EAASR,UAAUlH,gBAAgB51D,GACzC4+D,UAAWtB,EAAUj4C,KAAMrlB,EAC3Bg/D,cACAH,YAjCgB5vD,kBAAmB0Q,GACnC,MAAMo+C,EAASC,GAAUV,EAASS,OAAQ,eAE1C,OADAptD,EAAO+sD,GAAYK,GAAS,kDAAmD,wBAAyB,CAAE1sD,UAAW,sBACxG0sD,EAAOc,kBAAkBL,KAAuB7+C,GACrE,EA8BQ6+C,sBACA/2D,OAAMq3D,aAAYK,qBAGtB/mE,OAAOqX,eAAeiC,EAAQ,WAAY,CACtC0tD,cAAc,EACd1vD,YAAY,EACZlR,IAAK,KACD,MAAMw1D,EAAWsJ,EAASR,UAAUzH,YAAYr1D,GAKhD,OAJA2Q,EAAOqjD,EAAU,uBAAwB,wBAAyB,CAC9D3iD,UAAW,WACXhB,KAAM,CAAErQ,SAELg0D,CAAQ,IAGhBtiD,CACX,CAqCA,MAAMo+C,GAAWp1C,OAAO+0B,IAAI,4BACtB4vB,GAAiB,IAAIjmD,QAI3B,SAASkmD,GAAYhC,GACjB,OAAO+B,GAAe7gE,IAAI8+D,EAASxN,IACvC,CAKA7gD,eAAeswD,GAAWjC,EAAUkC,GAChC,IAAItI,EACAlD,EAAW,KAGf,GAAIhyD,MAAM4N,QAAQ4vD,GAAQ,CACtB,MAAMC,EAAe,SAAUr6D,GAC3B,GAAI6M,EAAY7M,EAAM,IAClB,OAAOA,EAEX,MAAM4uD,EAAWsJ,EAASR,UAAU/G,SAAS3wD,GAE7C,OADAwL,EAAeojD,EAAU,mBAAoB,OAAQ5uD,GAC9C4uD,EAAS3B,SAC5B,EAEQ6E,EAASsI,EAAM5+D,KAAKtH,GACP,MAALA,EACO,KAEP0I,MAAM4N,QAAQtW,GACPA,EAAEsH,IAAI6+D,GAEVA,EAAanmE,IAE3B,KACkB,MAAVkmE,EACLtI,EAAS,CAAC,MAEc,iBAAX,EACTjlD,EAAYutD,EAAO,IAEnBtI,EAAS,CAACsI,IAIVxL,EAAWsJ,EAASR,UAAU/G,SAASyJ,GACvC5uD,EAAeojD,EAAU,mBAAoB,QAASwL,GACtDtI,EAAS,CAAClD,EAAS3B,aAzCX5jD,EA4CI+wD,IA3CgB,iBAAnB,GAAgC,mBAAoB/wD,GAC9B,mBAA1BA,EAAoB,gBAAqBA,EAAMulD,SA4CxDkD,QAAesI,EAAMtB,iBAEhB,aAAcsB,GAEnBxL,EAAWwL,EAAMxL,SACjBkD,EAAS,CAAClD,EAAS3B,YAGnBzhD,GAAe,EAAO,qBAAsB,QAAS4uD,GAtD7D,IAAoB/wD,EAyDhByoD,EAASA,EAAOt2D,KAAKnJ,IACjB,GAAS,MAALA,EACA,OAAO,KAEX,GAAIuK,MAAM4N,QAAQnY,GAAI,CAClB,MAAM8nB,EAAQvd,MAAMI,KAAK,IAAIi9C,IAAI5nD,EAAEmJ,KAAKnJ,GAAMA,EAAEmf,iBAAgBpH,UAChE,OAAqB,IAAjB+P,EAAMhoB,OACCgoB,EAAM,IAEjBA,EAAMhe,OACCge,EACV,CACD,OAAO9nB,EAAEmf,aAAa,IAW1B,MAAO,CAAEo9C,WAAUx5D,IATP08D,EAAOt2D,KAAKnJ,GACX,MAALA,EACO,OAEPuK,MAAM4N,QAAQnY,GACPA,EAAE+K,KAAK,KAEX/K,IACR+K,KAAK,KACgB00D,SAC5B,CACAjoD,eAAeywD,GAAOpC,EAAUkC,GAC5B,MAAM75D,KAAEA,GAAS25D,GAAYhC,GAC7B,OAAO33D,EAAKnH,WAAW+gE,GAAWjC,EAAUkC,IAAQhlE,MAAQ,IAChE,CACAyU,eAAe0wD,GAAOrC,EAAUjsD,EAAWmuD,GAEvC,MAAM9G,EAAW0F,GAAYd,EAASS,QACtCptD,EAAO+nD,EAAU,+CAAgD,wBAAyB,CAAErnD,cAC5F,MAAM2iD,SAAEA,EAAQx5D,IAAEA,EAAG08D,OAAEA,SAAiBqI,GAAWjC,EAAUkC,IACvDla,KAAEA,EAAI3/C,KAAEA,GAAS25D,GAAYhC,GACnC,IAAI75D,EAAMkC,EAAKnH,IAAIhE,GACnB,IAAKiJ,EAAK,CACN,MACMqR,EAAS,CAAEm8B,QADAqU,GAAcgY,EACLpG,UACpBliD,EAAY1T,IACd,IAAIs+D,EAAgB5L,EACpB,GAAqB,MAAjB4L,EACA,IACIA,EAAgBtC,EAASR,UAAU/G,SAASz0D,EAAI41D,OAAO,GAC1D,CACD,MAAOroD,GAAU,CAGrB,GAAI+wD,EAAe,CACf,MAAMC,EAAiBD,EACjBjgD,EAAOq0C,EAAWsJ,EAASR,UAAUvF,eAAevD,EAAU1yD,EAAI/H,KAAM+H,EAAI41D,QAAU,GAC5F4I,GAAKxC,EAAUkC,EAAO7/C,GAAO3K,GAClB,IAAIuoD,GAAqBD,EAAUtoD,EAAUwqD,EAAOK,EAAgBv+D,IAElF,MAEGw+D,GAAKxC,EAAUkC,EAAO,IAAKxqD,GAChB,IAAIqoD,GAA4BC,EAAUtoD,EAAUwqD,EAAOl+D,IAEzE,EAEL,IAAIy+D,EAAW,GAgBft8D,EAAM,CAAEjJ,MAAK8e,UAAW,GAAI7G,MAfd,KACNstD,EAASxoE,QAGbwoE,EAAShnE,KAAK2/D,EAASv9D,GAAG2Z,EAAQE,GAAU,EAWb3W,KATtB4Q,UACT,GAAuB,GAAnB8wD,EAASxoE,OACT,OAEJ,IAAIyoE,EAAUD,EACdA,EAAW,SACL5wD,QAAQhQ,IAAI6gE,GAClBtH,EAAS39D,IAAI+Z,EAAQE,EAAS,GAGlCrP,EAAKK,IAAIxL,EAAKiJ,EACjB,CACD,OAAOA,CACX,CAIA,IAAIw8D,GAAW9wD,QAAQ5J,UAyBvB0J,eAAe6wD,GAAKxC,EAAUkC,EAAO7/C,EAAMugD,GACvC,UACUD,EACT,CACD,MAAOpxD,GAAU,CACjB,MAAMsxD,EA7BVlxD,eAAqBquD,EAAUkC,EAAO7/C,EAAMugD,SAClCD,GACN,MAAMx8D,QAAYi8D,GAAOpC,EAAUkC,GACnC,IAAK/7D,EACD,OAAO,EAEX,MAAMqN,EAAQrN,EAAI6V,UAAU/hB,OAgB5B,OAfAkM,EAAI6V,UAAY7V,EAAI6V,UAAUxE,QAAO,EAAGE,WAAU9T,WAC9C,MAAMk/D,EAAWp+D,MAAMI,KAAKud,GACxBugD,GACAE,EAASrnE,KAAKmnE,EAAYh/D,EAAO,KAAO8T,IAE5C,IACIA,EAASvc,KAAK6kE,KAAa8C,EAC9B,CACD,MAAOvxD,GAAU,CACjB,OAAQ3N,CAAI,IAEa,IAAzBuC,EAAI6V,UAAU/hB,SACdkM,EAAIpF,OACJihE,GAAYhC,GAAU33D,KAAK88B,OAAOh/B,EAAIjJ,MAElCsW,EAAQ,CACpB,CAM0BuvD,CAAM/C,EAAUkC,EAAO7/C,EAAMugD,GAEnD,OADAD,GAAWE,QACEA,CACjB,CACA,MAAMrhD,GAAiB,CAAC,QACjB,MAAMwhD,GAQT/wD,OAIAutD,UAQAiB,OAIAwC,QAIAzQ,CAACA,IAID6E,SAMA,WAAAn8D,CAAY+W,EAAQylD,EAAK+I,EAAQyC,GAC7B5vD,EAAmC,iBAApB,GAAgCghC,GAAcriC,GAAS,oCAAqC,SAAUA,GACvG,MAAVwuD,IACAA,EAAS,MAEb,MAAMhB,EAAQvI,GAAUpyD,KAAK4yD,GAG7B,IAAIyL,EAFJnxD,EAAiB3U,KAAM,CAAE4U,SAAQwuD,SAAQjB,UAAWC,IACpD3kE,OAAOqX,eAAe9U,KAAMm1D,GAAU,CAAErhD,MAAO,CAAE,IAEjD,IAAI62C,EAAO,KACPob,EAAW,KACf,GAAIF,EAAW,CACX,MAAM9H,EAAW0F,GAAYL,GAG7B2C,EAAW,IAAItD,GAA4BziE,KAAKmiE,UAAWpE,EAAU8H,EACxE,CACD,IAAI76D,EAAO,IAAIma,IAEf,GAAwB,iBAAZ,EACR,GAAI7N,EAAY1C,GACZ+1C,EAAO/1C,EACPkxD,EAActxD,QAAQ5J,QAAQgK,OAE7B,CACD,MAAMyiC,EAAWgsB,GAAUD,EAAQ,eACnC,IAAKJ,GAAW3rB,GACZ,MAAM7hC,EAAU,mDAAoD,wBAAyB,CACzFkB,UAAW,gBAGnBovD,EAAczuB,EAASC,YAAY1iC,GAAQyhD,MAAM1L,IAC7C,GAAY,MAARA,EACA,MAAMn1C,EAAU,sEAAuE,oBAAqB,CACxG1B,MAAOc,IAIf,OADA+vD,GAAY3kE,MAAM2qD,KAAOA,EAClBA,CAAI,GAElB,MAGDmb,EAAclxD,EAAOgiC,aAAayf,MAAM1L,IACpC,GAAY,MAARA,EACA,MAAM,IAAIx2C,MAAM,QAGpB,OADAwwD,GAAY3kE,MAAM2qD,KAAOA,EAClBA,CAAI,IA7Q3B,IAAqBgY,EAAU9tD,EAAV8tD,EAiRD3iE,KAjRW6U,EAiRL,CAAEixD,cAAanb,OAAMob,WAAU/6D,QAhRrD05D,GAAer5D,IAAIs3D,EAASxN,IAAWtgD,GAkRnC,MAAM+wD,EAAU,IAAIvgD,MAAM,GAAI,CAC1BxhB,IAAK,CAAC+Q,EAAQ0Q,EAAMC,KAEhB,GAAsB,iBAAlB,GAA8BpB,GAAejmB,QAAQonB,IAAS,EAC9D,OAAOE,QAAQ3hB,IAAI+Q,EAAQ0Q,EAAMC,GAErC,IACI,OAAOvlB,KAAKo7D,SAAS91C,EACxB,CACD,MAAOpR,GACH,IAAKoB,EAAQpB,EAAO,qBAA0C,QAAnBA,EAAMG,SAC7C,MAAMH,CAEb,CACe,EAEpB1W,IAAK,CAACoX,EAAQ0Q,IAENnB,GAAejmB,QAAQonB,IAAS,EACzBE,QAAQhoB,IAAIoX,EAAQ0Q,GAExBE,QAAQhoB,IAAIoX,EAAQ0Q,IAAStlB,KAAKmiE,UAAU5G,SAASn/D,OAAOkpB,MAQ3E,OALA3Q,EAAiB3U,KAAM,CAAE4lE,YACzBjxD,EAAiB3U,KAAM,CACnBg6D,SAAYoI,EAAMnI,SAAWmI,EAAMpI,SAAa4J,GAAqB5jE,MAAS,OAG3E,IAAIqlB,MAAMrlB,KAAM,CACnB6D,IAAK,CAAC+Q,EAAQ0Q,EAAMC,KAChB,GAAsB,iBAAV,GAAsBD,KAAQ1Q,GAAUuP,GAAejmB,QAAQonB,IAAS,EAChF,OAAOE,QAAQ3hB,IAAI+Q,EAAQ0Q,EAAMC,GAGrC,IACI,OAAO3Q,EAAO8lD,YAAYp1C,EAC7B,CACD,MAAOpR,GACH,IAAKoB,EAAQpB,EAAO,qBAA0C,QAAnBA,EAAMG,SAC7C,MAAMH,CAEb,CACe,EAEpB1W,IAAK,CAACoX,EAAQ0Q,IACY,iBAAV,GAAsBA,KAAQ1Q,GAAUuP,GAAejmB,QAAQonB,IAAS,EACzEE,QAAQhoB,IAAIoX,EAAQ0Q,GAExB1Q,EAAOutD,UAAUjH,YAAY51C,IAG/C,CAKD,OAAA0gD,CAAQ5C,GACJ,OAAO,IAAIuC,GAAa3lE,KAAK4U,OAAQ5U,KAAKmiE,UAAWiB,EACxD,CAKD,MAAA6C,CAAOrxD,GACH,OAAO,IAAI+wD,GAAa/wD,EAAQ5U,KAAKmiE,UAAWniE,KAAKojE,OACxD,CAID,gBAAMxsB,GAAe,aAAa+tB,GAAY3kE,MAAM8lE,WAAc,CAIlE,qBAAMI,GACF,MAAMnI,EAAW0F,GAAYzjE,KAAKojE,QAClCptD,EAAO+nD,EAAU,oCAAqC,wBAAyB,CAAErnD,UAAW,oBAC5F,MAAMtC,QAAa2pD,EAASoI,cAAcnmE,KAAK42C,cAC/C,MAAa,OAATxiC,EACO,KAEJA,CACV,CAKD,uBAAMgyD,GAEF,MAAML,EAAW/lE,KAAKqmE,wBACtB,GAAIN,EAEA,aADMA,EAASn8D,OACR5J,KAIX,GAAY,YADOA,KAAKkmE,kBAEpB,OAAOlmE,KAGX,MAAM+9D,EAAW0F,GAAYzjE,KAAKojE,QAElC,OADAptD,EAAmB,MAAZ+nD,EAAkB,6CAA8C,wBAAyB,CAAErnD,UAAW,sBACtG,IAAIlC,SAAQ,CAAC5J,EAASk3D,KACzB,MAAMwE,EAAYhyD,UACd,IAEI,GAAY,YADOtU,KAAKkmE,kBAEpB,OAAOt7D,EAAQ5K,MAEnB+9D,EAASx3D,KAAK,QAAS+/D,EAC1B,CACD,MAAOpyD,GACH4tD,EAAO5tD,EACV,GAELoyD,GAAW,GAElB,CAOD,qBAAAD,GACI,OAAO1B,GAAY3kE,MAAM+lE,QAC5B,CAMD,WAAArL,CAAYr1D,GACa,iBAAT,IACRA,EAAMA,EAAIuyC,UAGd,OADawsB,GAAmBpkE,KAAMqF,EAEzC,CAMD,QAAA+1D,CAAS/1D,GAIL,MAHqB,iBAAT,IACRA,EAAMA,EAAIuyC,UA3ctB,SAA2B+qB,EAAUt9D,GACjC,MAAMg/D,EAAc,YAAar/C,GAC7B,MAAMq0C,EAAWsJ,EAASR,UAAU/G,SAAS/1D,EAAK2f,GAKlD,OAJAhP,EAAOqjD,EAAU,uBAAwB,wBAAyB,CAC9D3iD,UAAW,WACXhB,KAAM,CAAErQ,MAAK2f,UAEVq0C,CACf,EACUtiD,EAAS,YAAaiO,GACxB,OAAO,IAAIm+C,GAAoBR,EAAU0B,KAAer/C,GAAOA,EACvE,EAmBI,OAlBArQ,EAAiBoC,EAAQ,CACrBtM,KAAMk4D,EAASR,UAAU7G,aAAaj2D,GACtC4+D,UAAWtB,EAAUj4C,KAAMrlB,EAC3Bg/D,gBAGJ5mE,OAAOqX,eAAeiC,EAAQ,WAAY,CACtC0tD,cAAc,EACd1vD,YAAY,EACZlR,IAAK,KACD,MAAMw1D,EAAWsJ,EAASR,UAAU/G,SAAS/1D,GAK7C,OAJA2Q,EAAOqjD,EAAU,uBAAwB,wBAAyB,CAC9D3iD,UAAW,WACXhB,KAAM,CAAErQ,SAELg0D,CAAQ,IAGhBtiD,CACX,CA8aewvD,CAAkBvmE,KAAMqF,EAClC,CAID,sBAAMmhE,CAAiBtpE,GACnB,MAAM,IAAIiX,MAAM,QACnB,CAqBD,iBAAMsyD,CAAY5B,EAAO6B,EAAWC,GACf,MAAbD,IACAA,EAAY,GAED,MAAXC,IACAA,EAAU,UAEd,MAAMhc,KAAEA,EAAImb,YAAEA,GAAgBnB,GAAY3kE,MACpCs2C,EAAWqU,SAAqBmb,GAChCzM,SAAEA,EAAQkD,OAAEA,SAAiBqI,GAAW5kE,KAAM6kE,GAC9C1qD,EAAS,CAAEm8B,UAASimB,SAAQmK,YAAWC,WACvC5I,EAAW0F,GAAYzjE,KAAKojE,QAElC,OADAptD,EAAO+nD,EAAU,2CAA4C,wBAAyB,CAAErnD,UAAW,uBACrFqnD,EAAS6I,QAAQzsD,IAASlU,KAAKU,IACzC,IAAIs+D,EAAgB5L,EACpB,GAAqB,MAAjB4L,EACA,IACIA,EAAgBjlE,KAAKmiE,UAAU/G,SAASz0D,EAAI41D,OAAO,GACtD,CACD,MAAOroD,GAAU,CAErB,GAAI+wD,EACA,IACI,OAAO,IAAI/C,GAASv7D,EAAK3G,KAAKmiE,UAAW8C,EAC5C,CACD,MAAO/wD,GACH,OAAO,IAAIquD,GAAkB57D,EAAKuN,EACrC,CAEL,OAAO,IAAIsrD,GAAI74D,EAAKo3D,EAAS,GAEpC,CAID,QAAMv9D,CAAGqkE,EAAOxqD,GACZ,MAAMvR,QAAYk8D,GAAOhlE,KAAM,KAAM6kE,GAGrC,OAFA/7D,EAAI6V,UAAUvgB,KAAK,CAAEic,WAAU9T,MAAM,IACrCuC,EAAIgP,QACG9X,IACV,CAKD,UAAMuG,CAAKs+D,EAAOxqD,GACd,MAAMvR,QAAYk8D,GAAOhlE,KAAM,OAAQ6kE,GAGvC,OAFA/7D,EAAI6V,UAAUvgB,KAAK,CAAEic,WAAU9T,MAAM,IACrCuC,EAAIgP,QACG9X,IACV,CAMD,UAAMmlE,CAAKN,KAAU7/C,GACjB,aAAamgD,GAAKnlE,KAAM6kE,EAAO7/C,EAAM,KACxC,CAKD,mBAAM6hD,CAAchC,GAChB,GAAIA,EAAO,CACP,MAAM/7D,QAAYi8D,GAAO/kE,KAAM6kE,GAC/B,OAAK/7D,EAGEA,EAAI6V,UAAU/hB,OAFV,CAGd,CACD,MAAMoO,KAAEA,GAAS25D,GAAY3kE,MAC7B,IAAIihD,EAAQ,EACZ,IAAK,MAAMtiC,UAAEA,KAAe3T,EAAK6J,SAC7BosC,GAAStiC,EAAU/hB,OAEvB,OAAOqkD,CACV,CAKD,eAAMtiC,CAAUkmD,GACZ,GAAIA,EAAO,CACP,MAAM/7D,QAAYi8D,GAAO/kE,KAAM6kE,GAC/B,OAAK/7D,EAGEA,EAAI6V,UAAU1Y,KAAI,EAAGoU,cAAeA,IAFhC,EAGd,CACD,MAAMrP,KAAEA,GAAS25D,GAAY3kE,MAC7B,IAAIoV,EAAS,GACb,IAAK,MAAMuJ,UAAEA,KAAe3T,EAAK6J,SAC7BO,EAASA,EAAO1B,OAAOiL,EAAU1Y,KAAI,EAAGoU,cAAeA,KAE3D,OAAOjF,CACV,CAKD,SAAMhV,CAAIykE,EAAOxqD,GACb,MAAMvR,QAAYi8D,GAAO/kE,KAAM6kE,GAC/B,IAAK/7D,EACD,OAAO9I,KAEX,GAAIqa,EAAU,CACV,MAAMzI,EAAQ9I,EAAI6V,UAAU1Y,KAAI,EAAGoU,cAAeA,IAAUnc,QAAQmc,GAChEzI,GAAS,GACT9I,EAAI6V,UAAUhf,OAAOiS,EAAO,EAEnC,CAKD,OAJgB,MAAZyI,GAA6C,IAAzBvR,EAAI6V,UAAU/hB,SAClCkM,EAAIpF,OACJihE,GAAY3kE,MAAMgL,KAAK88B,OAAOh/B,EAAIjJ,MAE/BG,IACV,CAKD,wBAAM8mE,CAAmBjC,GACrB,GAAIA,EAAO,CACP,MAAM/7D,QAAYi8D,GAAO/kE,KAAM6kE,GAC/B,IAAK/7D,EACD,OAAO9I,KAEX8I,EAAIpF,OACJihE,GAAY3kE,MAAMgL,KAAK88B,OAAOh/B,EAAIjJ,IACrC,KACI,CACD,MAAMmL,KAAEA,GAAS25D,GAAY3kE,MAC7B,IAAK,MAAMH,IAAEA,EAAG6D,KAAEA,KAAUsH,EAAK6J,SAC7BnR,IACAsH,EAAK88B,OAAOjoC,EAEnB,CACD,OAAOG,IACV,CAID,iBAAMyc,CAAYooD,EAAOxqD,GACrB,aAAara,KAAKQ,GAAGqkE,EAAOxqD,EAC/B,CAID,oBAAMC,CAAeuqD,EAAOxqD,GACxB,aAAara,KAAKI,IAAIykE,EAAOxqD,EAChC,CAID,iBAAO0sD,CAAW1M,GAMd,OALA,cAA6BsL,GACzB,WAAA9nE,CAAYy4C,EAAS8sB,EAAS,MAC1Bz5D,MAAM2sC,EAAS+jB,EAAK+I,EACvB,EAGR,CAKD,WAAO37D,CAAKmN,EAAQylD,EAAK+I,GACP,MAAVA,IACAA,EAAS,MAGb,OADiB,IAAIpjE,KAAK4U,EAAQylD,EAAK+I,EAE1C,EAQE,IAAA4D,GAAA,cANP,WACI,OAAOrB,EACX,CAI8BsB,MCz6B9B,SAASC,GAAYh/D,GAUjB,OATIA,EAAKrL,MAAM,qBACXqL,EAAOA,EAAKiP,UAAU,IAEjBjP,EAAKrL,MAAM,eAChBqL,EAAOA,EAAKiP,UAAU,GAGtBlB,GAAe,EAAO,0BAA2B,OAAQ/N,GAEtD,gCAAiCA,GAC5C,CAMO,MAAMi/D,GAIT18D,KAIA,WAAA5M,CAAY4M,GACRkK,EAAiB3U,KAAM,CAAEyK,QAC7B,CACA,OAAAu7D,CAAQoB,GACJ,OAAOpnE,IACX,CAIA,gBAAAqnE,CAAiBC,GACb,OAAO,CACX,CAIA,mBAAMC,CAAcD,EAAUhxB,GAC1B,MAAM,IAAIniC,MAAM,mBACpB,CAIA,mBAAMqzD,CAAcF,EAAU1oE,GAC1B,MAAM,IAAIuV,MAAM,mBACpB,EAgBJ,MAAMszD,GAAc,IAAI9pD,OAAO,kBAAoB,KAC7C+pD,GAAW,CACb,IAAI/pD,OAAO,mBAAqB,KAChC,IAAIA,OAAO,gBAAiB,KAC5B8pD,GACA,IAAI9pD,OAAO,mCAAoC,MAM5C,MAAMgqD,GAIT5J,SAIAznB,QAIA7rC,KAEAm9D,IACAvwB,IACA,WAAAx5C,CAAYkgE,EAAUznB,EAAS7rC,GAC3BkK,EAAiB3U,KAAM,CAAE+9D,WAAUznB,UAAS7rC,SAC5CzK,MAAK4nE,GAAgB,KACrB5nE,MAAKq3C,GAAY,IAAIwwB,GAASvxB,EAAS,CACnC,yDACA,sDACA,gDACA,oDACA,uDACA,sDACDynB,EACP,CAIA,sBAAM+J,GAkBF,OAjB0B,MAAtB9nE,MAAK4nE,KACL5nE,MAAK4nE,GAAgB,WACjB,IACI,aAAa5nE,MAAKq3C,GAAU0wB,kBAAkB,aAClD,CACA,MAAO7zD,GAGH,GAAIoB,EAAQpB,EAAO,kBACf,OAAO,EAIX,MADAlU,MAAK4nE,GAAgB,KACf1zD,CACV,CACH,EAdoB,UAgBZlU,MAAK4nE,EACtB,CACA,QAAM3qD,CAAO+qD,EAAUrnD,GACnBA,GAAUA,GAAU,IAAIllB,QACxB,MAAM2mE,EAAQpiE,MAAKq3C,GAAU8qB,UAE7BxhD,EAAO6C,QAAQ+mC,GAASvqD,KAAKyK,OAC7B,IAAI4uD,EAAW,WACLr5D,KAAK8nE,qBACXzO,EAAW+I,EAAM1H,YAAYsN,GAC7BhyD,EAAOqjD,EAAU,mBAAoB,gBAAiB,CAClD3jD,KAAM,CAAEsyD,cAEZrnD,EAAS,CACL6pC,GAAUxqD,KAAKyK,KAAM,KACrB23D,EAAMnG,mBAAmB5C,EAAU14C,IAEvCqnD,EAAW,wBAEfrnD,EAAOviB,KAAK,CACRw/D,gBAAgB,IAEpB,IACI,MAAMxoD,QAAepV,MAAKq3C,GAAU2wB,MAAarnD,GACjD,OAAI04C,EACO+I,EAAMlG,qBAAqB7C,EAAUjkD,GAAQ,GAEjDA,CACX,CACA,MAAOlB,GACH,IAAKoB,EAAQpB,EAAO,kBAChB,MAAMA,CAEd,CACA,OAAO,IACX,CAKA,gBAAM0iC,CAAW0wB,GAIb,GAHgB,MAAZA,IACAA,EAAW,IAEE,KAAbA,EACA,IACI,MAAMlyD,QAAepV,MAAKid,GAAO,iBAEjC,OAAc,MAAV7H,GAAkBA,IAAW4+B,GACtB,KAEJ5+B,CACX,CACA,MAAOlB,GACH,GAAIoB,EAAQpB,EAAO,kBACf,OAAO,KAEX,MAAMA,CACV,CAGJ,GAAIozD,GAAY,GAAKA,EAAW,WAAY,CACxC,IAAIW,EAAcX,EAAW,WAC7B,MAAM1oE,QAAaoB,MAAKid,GAAO,qBAAsB,CAACgrD,IACtD,GAAI3wD,EAAY1Y,EAAM,IAClB,OAAOg4C,GAAWh4C,EAE1B,CACA,IAAIspE,EAAa,KACjB,IAAK,MAAMC,KAAUnoE,KAAK+9D,SAASqK,QAC/B,GAAMD,aAAkBhB,IAGpBgB,EAAOd,iBAAiBC,GAAW,CACnCY,EAAaC,EACb,KACJ,CAEJ,GAAkB,MAAdD,EACA,OAAO,KAGX,MAAMtpE,QAAaoB,MAAKid,GAAO,qBAAsB,CAACqqD,IAEtD,GAAY,MAAR1oE,GAAyB,OAATA,EAChB,OAAO,KAGX,MAAM03C,QAAgB4xB,EAAWV,cAAcF,EAAU1oE,GACzD,GAAe,MAAX03C,EACA,OAAOA,EAEXtgC,GAAO,EAAO,oBAAqB,wBAAyB,CACxDU,UAAW,cAAc4wD,KACzB5xD,KAAM,CAAE4xD,WAAU1oE,SAE1B,CAKA,aAAMypE,CAAQhjE,GACV,MAAMzG,QAAaoB,MAAKid,GAAO,uBAAwB,CAAC5X,IACxD,OAAY,MAARzG,GAAyB,OAATA,EACT,KAEJA,CACX,CAIA,oBAAM0pE,GAEF,MAAM1pE,QAAaoB,MAAKid,GAAO,wBAE/B,GAAY,MAARre,GAAyB,OAATA,EAChB,OAAO,KAGX,MAAM2f,EAAO3f,EAAK/B,MAAM,4EACxB,GAAI0hB,EAAM,CACN,MAAM4C,EAAsB,aAAZ5C,EAAK,GAAqB,OAAS,OAC7C3hB,EAASsa,SAASqH,EAAK,GAAI,IACjC,GAAIA,EAAK,GAAG3hB,SAAoB,EAATA,EACnB,MAAO,GAAGukB,OAAalH,EAAa,KAAOsE,EAAK,KAExD,CAEA,MAAMgqD,EAAQ3pE,EAAK/B,MAAM,iCACzB,GAAI0rE,GAA6B,KAApBA,EAAM,GAAG3rE,OAClB,MAAO,SAAU2rE,EAAM,KAE3BvyD,GAAO,EAAO,2CAA4C,wBAAyB,CAC/EU,UAAW,mBACXhB,KAAM,CAAE9W,SAEhB,CASA,eAAM4pE,GAEF,aADqBxoE,KAAKyoE,cACZlhE,GAClB,CASA,gBAAMkhE,GACF,MAAMC,EAAU,CAAC,CAAE30D,KAAM,OAAQD,MAAO9T,KAAKyK,OAC7C,IAGI,MAAMk+D,QAAe3oE,KAAKqoE,QAAQ,UAClC,GAAc,MAAVM,EAEA,OADAD,EAAQtqE,KAAK,CAAE2V,KAAM,UAAWD,MAAO,KAChC,CAAEvM,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,SAAUD,MAAO60D,IACtC,IAAK,IAAIxrE,EAAI,EAAGA,EAAIuqE,GAAS9qE,OAAQO,IAAK,CACtC,MAAMN,EAAQ8rE,EAAO9rE,MAAM6qE,GAASvqE,IACpC,GAAa,MAATN,EACA,SAEJ,MAAMskB,EAAStkB,EAAM,GAAGof,cACxB,OAAQkF,GACJ,IAAK,QACL,IAAK,OAED,OADAunD,EAAQtqE,KAAK,CAAE2V,KAAM,MAAOD,MAAO60D,IAC5B,CAAED,UAASnhE,IAAKohE,GAC3B,IAAK,OAAQ,CACT,MAAMphE,EAAM2/D,GAAYyB,GAGxB,OAFAD,EAAQtqE,KAAK,CAAE2V,KAAM,OAAQD,MAAO60D,IACpCD,EAAQtqE,KAAK,CAAE2V,KAAM,MAAOD,MAAOvM,IAC5B,CAAEmhE,UAASnhE,MACtB,CACA,IAAK,SACL,IAAK,UAAW,CAEZ,MAAMiwD,EAAuB,WAAXr2C,EAAuB,oBAAsB,eAC/DunD,EAAQtqE,KAAK,CAAE2V,KAAMoN,EAAQrN,MAAO60D,IAEpC,MAAMC,QAAc5oE,KAAK42C,aACzB,GAAa,MAATgyB,EAEA,OADAF,EAAQtqE,KAAK,CAAE2V,KAAM,SAAUD,MAAO,KAC/B,CAAEvM,IAAK,KAAMmhE,WAExB,MAAMpe,GAASztD,EAAM,IAAM,IAAId,MAAM,KACrC,GAAqB,IAAjBuuD,EAAM1tD,OAEN,OADA8rE,EAAQtqE,KAAK,CAAE2V,KAAM,IAAIoN,QAAcrN,MAAQjX,EAAM,IAAM,KACpD,CAAE0K,IAAK,KAAMmhE,WAExB,MAAMG,EAAUve,EAAM,GAChBqY,EAAW,IAAIkF,GAASvd,EAAM,GAAI,CAEpC,gDACA,gDAEA,2CACA,4DACDtqD,KAAK+9D,UAER,GAAe,WAAX58C,EAAqB,CACrB,MAAM2nD,QAAmBnG,EAASoG,QAAQF,GAC1C,GAAID,IAAUE,EAEV,OADAJ,EAAQtqE,KAAK,CAAE2V,KAAM,SAAUD,MAAOg1D,IAC/B,CAAEvhE,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,QAASD,MAAOg1D,GACzC,MACK,GAAe,YAAX3nD,EAAsB,CAC3B,MAAM6nD,QAAgBrG,EAASsG,UAAUL,EAAOC,GAChD,IAAKG,EAED,OADAN,EAAQtqE,KAAK,CAAE2V,KAAM,WAAYD,MAAO,MACjC,CAAEvM,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,UAAWD,MAAOk1D,EAAQhtE,YACnD,CAEA,IAAIktE,QAAoBvG,EAASnL,GAAUqR,GAC3C,GAAmB,MAAfK,GAAuC,OAAhBA,EAEvB,OADAR,EAAQtqE,KAAK,CAAE2V,KAAM,gBAAiBD,MAAO,KACtC,CAAEvM,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,oBAAqBD,MAAOo1D,IAElC,YAAX/nD,IACA+nD,EAAcA,EAAYjtE,QAAQ,OAAQsd,EAAQsvD,EAAS,IAAI1xD,UAAU,IACzEuxD,EAAQtqE,KAAK,CAAE2V,KAAM,wBAAyBD,MAAOo1D,KAGrDA,EAAYrsE,MAAM,aAClBqsE,EAAchC,GAAYgC,IAE9BR,EAAQtqE,KAAK,CAAE2V,KAAM,eAAgBD,MAAOo1D,IAE5C,IAAIC,EAAW,CAAA,EACf,MAAM/nD,QAAiB,IAAKjD,GAAa+qD,GAAcp8D,OACvDsU,EAASC,WACT,IACI8nD,EAAW/nD,EAASoB,QACxB,CACA,MAAOtO,GACH,IACIw0D,EAAQtqE,KAAK,CAAE2V,KAAM,YAAaD,MAAOsN,EAASmB,UACtD,CACA,MAAOrO,GACH,MAAMwD,EAAQ0J,EAASvE,KAIvB,OAHInF,GACAgxD,EAAQtqE,KAAK,CAAE2V,KAAM,YAAaD,MAAO2D,EAAQC,KAE9C,CAAEnQ,IAAK,KAAMmhE,UACxB,CACA,MAAO,CAAEnhE,IAAK,KAAMmhE,UACxB,CACA,IAAKS,EAED,OADAT,EAAQtqE,KAAK,CAAE2V,KAAM,YAAaD,MAAO,KAClC,CAAEvM,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,WAAYD,MAAOtN,KAAKC,UAAU0iE,KAEvD,IAAIC,EAAWD,EAASE,MACxB,GAA0B,iBAAd,EAER,OADAX,EAAQtqE,KAAK,CAAE2V,KAAM,YAAaD,MAAO,KAClC,CAAEvM,IAAK,KAAMmhE,WAExB,GAAIU,EAASvsE,MAAM,6BAGd,CAGD,GAAY,MADCusE,EAASvsE,MAAM4qE,IAGxB,OADAiB,EAAQtqE,KAAK,CAAE2V,KAAM,iBAAkBD,MAAOs1D,IACvC,CAAE7hE,IAAK,KAAMmhE,WAExBA,EAAQtqE,KAAK,CAAE2V,KAAM,gBAAiBD,MAAOs1D,IAC7CA,EAAWlC,GAAYkC,EAC3B,CAEA,OADAV,EAAQtqE,KAAK,CAAE2V,KAAM,MAAOD,MAAOs1D,IAC5B,CAAEV,UAASnhE,IAAK6hE,EAC3B,EAER,CACJ,CACA,MAAOl1D,GAAS,CAChB,MAAO,CAAEw0D,UAASnhE,IAAK,KAC3B,CACA,0BAAa+hE,CAAcvL,GACvB,MAAMwL,QAAgBxL,EAASyL,aACzBC,EAAYF,EAAQG,UAAU,kCAKpC,OAHA1zD,EAAOyzD,EAAW,+BAAgC,wBAAyB,CACvE/yD,UAAW,gBAAiBhB,KAAM,CAAE6zD,aAEjCE,EAAUnzB,OACrB,CACA,eAAa4sB,CAAanF,EAAUtzD,GAChC,MAAMk/D,QAAgBhC,GAAY2B,cAAcvL,GAChD,IACI,MAAM4E,EAAW,IAAIkF,GAAS8B,EAAS,CACnC,qDACD5L,GACGpT,QAAagY,EAAStrB,SAASkT,GAAS9/C,GAAO,CACjDmzD,gBAAgB,IAEpB,OAAIjT,IAAS3W,GACF,KAEJ2W,CACX,CACA,MAAOz2C,GAGH,MAAMA,CACV,CACA,OAAO,IACX,CAKA,qBAAa01D,CAAS7L,EAAUtzD,GAC5B,IAAIo/D,EAAcp/D,EAClB,OAAa,CACT,GAAoB,KAAhBo/D,GAAsC,MAAhBA,EACtB,OAAO,KAIX,GAAa,QAATp/D,GAAkC,QAAhBo/D,EAClB,OAAO,KAGX,MAAMlf,QAAagd,IAAYzE,GAAanF,EAAU8L,GAEtD,GAAY,MAARlf,EAAc,CACd,MAAMtT,EAAW,IAAIswB,GAAY5J,EAAUpT,EAAMlgD,GAEjD,OAAIo/D,IAAgBp/D,SAAgB4sC,EAASywB,mBAGtCzwB,EAFI,IAGf,CAEAwyB,EAAcA,EAAY9tE,MAAM,KAAKN,MAAM,GAAGoM,KAAK,IACvD,CACJ,ECteJ,MAAMuQ,GAAO/C,OAAO,GACb,SAASy0D,GAAUlyB,EAAQmyB,GAC9B,OAAA,SAAkBj2D,GACd,OAAa,MAATA,EACOi2D,EAEJnyB,EAAO9jC,EACjB,CACL,CACO,SAASk2D,GAAQpyB,EAAQkyB,GAC5B,OAAStrC,IACL,GAAIsrC,GAAsB,MAATtrC,EACb,OAAO,KAEX,IAAKn3B,MAAM4N,QAAQupB,GACf,MAAM,IAAIrqB,MAAM,gBAEpB,OAAOqqB,EAAMv4B,KAAK9I,GAAMy6C,EAAOz6C,IAClC,CACL,CAIO,SAASumB,GAAOk0B,EAAQqyB,GAC3B,OAASn2D,IACL,MAAMsB,EAAS,CAAA,EACf,IAAK,MAAM/P,KAAOuyC,EAAQ,CACtB,IAAIsyB,EAAS7kE,EACb,GAAI4kE,GAAY5kE,KAAO4kE,KAAcC,KAAUp2D,GAC3C,IAAK,MAAMq2D,KAAUF,EAAS5kE,GAC1B,GAAI8kE,KAAUr2D,EAAO,CACjBo2D,EAASC,EACT,KACH,CAGT,IACI,MAAMhoC,EAAKyV,EAAOvyC,GAAKyO,EAAMo2D,SAClBptD,IAAPqlB,IACA/sB,EAAO/P,GAAO88B,EAErB,CACD,MAAOjuB,GAEH8B,GAAO,EAAO,2BAA2B3Q,MADxB6O,aAAiBC,MAASD,EAAMuB,QAAU,kBACE,WAAY,CAAE3B,SAC9E,CACJ,CACD,OAAOsB,CACV,CACL,CAYO,SAASg1D,GAAWt2D,GAEvB,OADAmC,EAAeqB,EAAYxD,GAAO,GAAO,eAAgB,QAASA,GAC3DA,CACX,CACO,SAASu2D,GAAWv2D,GAEvB,OADAmC,EAAeqB,EAAYxD,EAAO,IAAK,eAAgB,QAASA,GACzDA,CACX,CAOA,MAAMw2D,GAAa5mD,GAAO,CACtB4yB,QAASM,GACT8oB,UAAW2K,GACX1K,YAAa/mD,EACbha,KAAMwrE,GACNx4D,MAAOgH,EACPgnD,QAASkK,IA/BN,SAAuBh2D,GAC1B,OAAQA,GACJ,KAAK,EACL,IAAK,OACD,OAAO,EACX,KAAK,EACL,IAAK,QACD,OAAO,EAEfmC,GAAe,EAAO,oBAAoBzP,KAAKC,UAAUqN,KAAU,QAASA,EAChF,IAqBsC,GAClCyoD,OAAQyN,GAAQK,IAChB5K,gBAAiB4K,GACjBxK,iBAAkBjnD,GACnB,CACChH,MAAO,CAAC,cAKZ,MAAM24D,GAAe7mD,GAAO,CACxBxmB,KAAM4sE,GAAUO,IAChBpM,WAAYoM,GACZnM,sBAAuB4L,GAAUO,GAAY,MAC7C3iD,OAAQ9O,EACRolD,UAAWplD,EACXuzC,MAAO2d,GAAUM,IACjBjM,WAAYzlD,EACZ0zC,SAAU1zC,EACV0lD,QAAS1lD,EACT2lD,UAAWyL,GAAUO,GAAY,MACjC/L,aAAcwL,GAAUO,GAAY,MACpC9L,YAAauL,GAAUpxD,EAAW,MAClC8lD,cAAesL,GAAUpxD,EAAW,MACpC+lD,MAAOqL,GAAUlzB,IACjB8nB,WAAYoL,GAAUO,GAAY,MAClC1L,UAAWyL,GACXxL,cAAekL,GAAUpxD,IAC1B,CACCgmD,WAAY,CAAC,aAYjB,MAAM8L,GAAoB9mD,GAAO,CAC7Bm8C,iBAAkBjnD,EAClB+mD,YAAa/mD,EACb6mD,gBAAiB4K,GACjB/zB,QAASM,GACT2lB,OAAQyN,GAAQK,IAChBzrE,KAAMwrE,GACNx4D,MAAOgH,EACP8mD,UAAW2K,IACZ,CACCz4D,MAAO,CAAC,cAKZ,MAAM64D,GAA4B/mD,GAAO,CACrC3jB,GAAI+pE,GAAUlzB,GAAY,MAC1BnvC,KAAMqiE,GAAUlzB,GAAY,MAC5BupB,gBAAiB2J,GAAUlzB,GAAY,MAEvChlC,MAAOgH,EACPtV,KAAMwmE,GAAUryD,GAChB2mD,QAAS1lD,EACT6lD,YAAauL,GAAUpxD,EAAW,MAClC0nD,UAAW0J,GAAUM,IACrB1K,UAAW2K,GACXntE,KAAMmtE,GACN9J,KAAMyJ,IAfH,SAA0Bl2D,GAC7B,OAAO02D,GAAkB12D,EAC7B,IAcI6rD,YAAa/mD,EAEbynD,kBAAmB3nD,EACnB8nD,kBAAmBsJ,GAAUpxD,GAC7B4nD,aAAcwJ,GAAUpxD,EAAW,MACnC4E,OAAQwsD,GAAUlxD,GAClB7E,KAAM+1D,GAAUlxD,EAAW,IAC5B,CACC4nD,kBAAmB,CAAC,YACpBtjE,KAAM,CAAC,mBACP0U,MAAO,CAAC,sBAKL,SAAS84D,GAA0B52D,GAGlCA,EAAM/T,IAAM2Y,EAAU5E,EAAM/T,MAAQqY,KACpCtE,EAAM/T,GAAK,8CAEf,MAAMqV,EAASsO,GAAO,CAClBxmB,KAAMmtE,GAENz4D,MAAOk4D,GAAUlxD,OAAWkE,GAC5B/I,KAAOD,GACW,OAAVA,GAA2B,MAATA,EACX,EAEJ8E,EAAU9E,GAErB04C,WAAYsd,GAAUhf,GAAe,MACrC4B,oBAAqBod,GAAUE,GAAQK,IAAY,GAAO,MAC1D3K,UAAWoK,GAAUO,GAAY,MACjC1K,YAAamK,GAAUlxD,EAAW,MAClCinD,iBAAkBiK,GAAUlxD,EAAW,MACvCnR,KAAMmvC,GAENyV,SAAUyd,GAAUpxD,GACpB4zC,qBAAsBwd,GAAUpxD,GAChC6zC,aAAcud,GAAUpxD,GACxB+zC,iBAAkBqd,GAAUpxD,EAAW,MACvC0zC,SAAU1zC,EACV3Y,GAAI+pE,GAAUlzB,GAAY,MAC1B9iC,MAAO4E,EACPyzC,MAAOvzC,EACPha,KAAMwrE,GACNO,QAASb,GAAUlzB,GAAY,MAC/B1B,QAAS40B,GAAUpxD,EAAW,OAC/B,CACC9Z,KAAM,CAAC,SACPwtD,SAAU,CAAC,OACXx6C,MAAO,CAAC,qBA/BG8R,CAgCZ5P,GAkBH,GAhBiB,MAAbsB,EAAOrV,IAAgC,MAAlBqV,EAAOu1D,UAC5Bv1D,EAAOu1D,QC/LR,SAA0B3e,GAC7B,MAAMvkD,EAAOmvC,GAAWoV,EAAGvkD,MAE3B,IAAImjE,EADUlyD,EAAUszC,EAAGG,MAAO,YACbnwD,SAAS,IAU9B,OARI4uE,EADa,MAAbA,EACW,KAENA,EAAShuE,OAAS,EACZ,MAAQguE,EAGR,KAAOA,EAEfh0B,GAAW/+B,EAAU4e,GAAU3S,GAAU,CAACrc,EAAMmjE,KAAa,IACxE,CDiLyBC,CAAiBz1D,IAIlB,IAAftB,EAAMC,MAA6B,IAAfD,EAAMC,MAAmC,MAApBD,EAAM04C,aAChDp3C,EAAOo3C,WAAa,IAGpB14C,EAAMg9B,UACN17B,EAAO07B,UAAYvD,GAAU9lC,KAAKqM,EAAMg9B,WAGxC17B,EAAO07B,UAAYvD,GAAU9lC,KAAKqM,GAGhB,MAAlBsB,EAAO8/B,QAAiB,CACxB,MAAMA,EAAU9/B,EAAO07B,UAAU0D,cAClB,MAAXU,IACA9/B,EAAO8/B,QAAUA,EAExB,CAuCD,OAHI9/B,EAAOsqD,WAAahnD,EAAUtD,EAAOsqD,aAAetnD,KACpDhD,EAAOsqD,UAAY,MAEhBtqD,CACX,CE3QO,MAAM01D,GAOTrgE,KAIA,WAAA5M,CAAY4M,GACRkK,EAAiB3U,KAAM,CAAEyK,QAC7B,CAIA,KAAAyW,GACI,OAAO,IAAI4pD,GAAc9qE,KAAKyK,KAClC,EAMG,MAAMsgE,WAAsBD,GAO/BE,eAIAC,OAIAC,SAIAC,WAIAC,cAIAC,uBAIAC,oBAMA,WAAAztE,CAAYmtE,EAAgBO,GACF,MAAlBP,IACAA,EAAiB,GAErBrhE,MAAM,sCAAuCqhE,GAAkB,KAC/D,MAAMQ,EAAQ,CAAER,kBAChB,SAAS3/D,EAAIZ,EAAMghE,GACf,IAAI33D,GAASy3D,GAAS,CAAE,GAAE9gE,GACb,MAATqJ,IACAA,EAAQ23D,GAEZx1D,EAAkC,iBAAnB,EAA6B,qBAAqBxL,IAAQ,QAAS8gE,GAClFC,EAAM/gE,GAAQqJ,CAClB,CACAzI,EAAI,SAAU,MACdA,EAAI,WAAY,MAChBA,EAAI,aAAc,GAClBA,EAAI,gBAAiB,IACrBA,EAAI,yBAA0B,MAC9BA,EAAI,sBAAuB,MAC3BsJ,EAAiB3U,KAAMwrE,EAC3B,CACA,KAAAtqD,GACI,OAAO,IAAI6pD,GAAc/qE,KAAKgrE,eAAgBhrE,KAClD,EAWG,MAAM0rE,WAAkBZ,GAI3Bx0B,QAIAq1B,cAMA,WAAA9tE,CAAYy4C,EAASq1B,GACjBhiE,MAAM,kCACNgL,EAAiB3U,KAAM,CACnBs2C,QAAUA,GAtHH,6CAuHPq1B,cAAkC,MAAjBA,EAAyB,EAAIA,GAEtD,CACA,KAAAzqD,GACI,OAAO,IAAIwqD,GAAU1rE,KAAKs2C,QAASt2C,KAAK2rE,cAC5C,EAkCG,MAAMC,WAAqCd,GAC9CvjE,GACA+Y,IAIA,OAAI/Y,GAAQ,OAAOvH,MAAKuH,CAAM,CAI9B,eAAI+Y,GAAgB,OAAOtgB,MAAKsgB,EAAc,CAK9C,WAAAziB,CAAY0J,EAAK+Y,GACb3W,MAAM,oDACN3J,MAAKuH,EAAOA,EACZvH,MAAKsgB,GAAeA,CACxB,CAEA,KAAAY,GAAU,OAAOlhB,IAAM,EC3J3B,MAAM6rE,GAAW,IAAI1mD,IAKd,MAAM2mD,GACTrhE,IACAyqC,GACAkzB,IAIA,WAAAvqE,CAAY4M,EAAMyqC,GACdl1C,MAAKyK,GAAQA,EACbzK,MAAKk1C,EAAWx8B,EAAUw8B,GAC1Bl1C,MAAKooE,GAAW,IAAIjjD,GACvB,CAID,MAAA1iB,GACI,MAAO,CAAEgI,KAAMzK,KAAKyK,KAAMyqC,QAAS94C,OAAO4D,KAAKk1C,SAClD,CAOD,QAAIzqC,GAAS,OAAOzK,MAAKyK,EAAQ,CACjC,QAAIA,CAAKqJ,GAAS9T,MAAKyK,GAAQqJ,CAAQ,CAIvC,WAAIohC,GAAY,OAAOl1C,MAAKk1C,CAAW,CACvC,WAAIA,CAAQphC,GAAS9T,MAAKk1C,EAAWx8B,EAAU5E,EAAO,UAAa,CAQnE,OAAAi4D,CAAQrlC,GACJ,GAAa,MAATA,EACA,OAAO,EAEX,GAAuB,iBAAX,EAAqB,CAC7B,IACI,OAAQ1mC,KAAKk1C,UAAYx8B,EAAUguB,EACtC,CACD,MAAOxyB,GAAU,CACjB,OAAQlU,KAAKyK,OAASi8B,CACzB,CACD,GAAuB,iBAAnB,GAAkD,iBAAnB,EAA6B,CAC5D,IACI,OAAQ1mC,KAAKk1C,UAAYx8B,EAAUguB,EACtC,CACD,MAAOxyB,GAAU,CACjB,OAAO,CACV,CACD,GAAuB,iBAAX,EAAqB,CAC7B,GAAqB,MAAjBwyB,EAAMwO,QAAiB,CACvB,IACI,OAAQl1C,KAAKk1C,UAAYx8B,EAAUguB,EAAMwO,QAC5C,CACD,MAAOhhC,GAAU,CACjB,OAAO,CACV,CACD,OAAkB,MAAdwyB,EAAMj8B,MACEzK,KAAKyK,OAASi8B,EAAMj8B,IAGnC,CACD,OAAO,CACV,CAID,WAAI29D,GACA,OAAO/gE,MAAMI,KAAKzH,MAAKooE,GAASvzD,SACnC,CAKD,YAAAm3D,CAAa7D,GACT,GAAInoE,MAAKooE,GAASvkE,IAAIskE,EAAO19D,MACzB,MAAM,IAAI0J,MAAM,mCAAmCg0D,EAAO19D,SAG9D,OADAzK,MAAKooE,GAAS/8D,IAAI88D,EAAO19D,KAAM09D,EAAOjnD,SAC/BlhB,IACV,CAMD,SAAA0pE,CAAUj/D,GACN,OAAQzK,MAAKooE,GAASvkE,IAAI4G,IAAU,IACvC,CAKD,UAAAwhE,CAAWC,GACP,OAAQlsE,KAAKooE,QAAQjuD,QAAQre,GAAOA,EAAE2O,KAAK1O,MAAM,KAAK,KAAOmwE,GAChE,CAID,KAAAhrD,GACI,MAAMA,EAAQ,IAAI4qD,GAAQ9rE,KAAKyK,KAAMzK,KAAKk1C,SAI1C,OAHAl1C,KAAKooE,QAAQ9gE,SAAS6gE,IAClBjnD,EAAM8qD,aAAa7D,EAAOjnD,QAAQ,IAE/BA,CACV,CAOD,mBAAAirD,CAAoBngB,GAChB,MAAMuf,EAAQvrE,KAAK0pE,UAAU,uCAA0C,IAAIqB,GAC3E,IAAIlT,EAAM0T,EAAMN,OAIhB,GAHa,MAATjf,EAAGjsD,KACH83D,GAAO0T,EAAML,UAEblf,EAAGptD,KACH,IAAK,IAAIzB,EAAI,EAAGA,EAAI6uD,EAAGptD,KAAKhC,OAAQO,GAAK,EACD,OAAhC6uD,EAAGptD,KAAKuY,UAAUha,EAAGA,EAAI,GACzB06D,GAAO0T,EAAMJ,WAGbtT,GAAO0T,EAAMH,cAIzB,GAAIpf,EAAGQ,WAAY,CACf,MAAMA,EAAa1B,GAAckB,EAAGQ,YACpC,IAAK,MAAM7B,KAAQ6B,EACfqL,GAAO0T,EAAMD,oBAAsBC,EAAMF,uBAAyB7e,EAAW7B,GAAMC,YAAYhuD,MAEtG,CACD,OAAOi7D,CACV,CAID,WAAOpwD,CAAK8hE,GAGR,GA+GR,WACI,GAAI6C,GACA,OAIJ,SAASC,EAAY5hE,EAAMyqC,EAASr5B,GAChC,MAAMoG,EAAO,WACT,MAAMsnD,EAAU,IAAIuC,GAAQrhE,EAAMyqC,GASlC,OAP0B,MAAtBr5B,EAAQywD,YACR/C,EAAQyC,aAAa,IAAIN,GAAU,KAAM7vD,EAAQywD,aAErD/C,EAAQyC,aAAa,IAAIjB,KACxBlvD,EAAQusD,SAAW,IAAI9gE,SAAS6gE,IAC7BoB,EAAQyC,aAAa7D,EAAO,IAEzBoB,CACnB,EAEQuC,GAAQ93C,SAASvpB,EAAMwX,GACvB6pD,GAAQ93C,SAASkhB,EAASjzB,GACtBpG,EAAQouD,UACRpuD,EAAQouD,SAAS3iE,SAASmD,IACtBqhE,GAAQ93C,SAASvpB,EAAMwX,EAAK,GAGvC,CAvBDmqD,IAAW,EAwBXC,EAAY,UAAW,EAAG,CAAEC,WAAY,EAAGrC,SAAU,CAAC,eACtDoC,EAAY,UAAW,EAAG,CAAEC,WAAY,IACxCD,EAAY,UAAW,EAAG,CAAEC,WAAY,IACxCD,EAAY,SAAU,EAAG,CAAEC,WAAY,IACvCD,EAAY,QAAS,GAAI,CAAEC,WAAY,KACvCD,EAAY,UAAW,SAAU,CAAEC,WAAY,WAC/CD,EAAY,UAAW,KAAO,CAAEC,WAAY,OAC5CD,EAAY,UAAW,GAAI,CAAA,GAC3BA,EAAY,eAAgB,EAAG,CAAA,GAC/BA,EAAY,WAAY,MAAO,CAC3BC,WAAY,IAEhBD,EAAY,kBAAmB,OAAQ,CAAA,GACvCA,EAAY,mBAAoB,OAAQ,CAAA,GACxCA,EAAY,OAAQ,KAAM,CAAEC,WAAY,IACxCD,EAAY,cAAe,MAAO,CAAA,GAClCA,EAAY,eAAgB,MAAO,CAAA,GACnCA,EAAY,MAAO,GAAI,CAAEC,WAAY,IACrCD,EAAY,OAAQ,GAAI,CAAA,GACxBA,EAAY,QAAS,MAAO,CAAEC,WAAY,IAC1CD,EAAY,eAAgB,MAAO,CAAA,GACnCA,EAAY,gBAAiB,MAAO,CAAA,GACpCA,EAAY,QAAS,IAAK,CACtBC,WAAY,EACZlE,QAAS,CACLmE,GAAoB,+CAG5BF,EAAY,aAAc,MAAO,CAAA,GACjCA,EAAY,eAAgB,MAAO,CAC/BpC,SAAU,CAAC,cAAe,YAC1B7B,QAAS,CACLmE,GAAoB,uDAG5BF,EAAY,WAAY,GAAI,CACxBC,WAAY,EACZlE,QAAS,KAEbiE,EAAY,kBAAmB,IAAK,CAAA,GACpCA,EAAY,mBAAoB,SAAU,CAAA,GAC1CA,EAAY,OAAQ,IAAK,CAAEC,WAAY,GAC3C,CAvLQE,GAEe,MAAXjD,EACA,OAAOuC,GAAQrkE,KAAK,WAMxB,GAHyB,iBAAb,IACR8hE,EAAUl0D,OAAOk0D,IAEI,iBAArB,GAAsD,iBAArB,EAA+B,CAChE,MAAMkD,EAAcZ,GAAShoE,IAAI0lE,GACjC,GAAIkD,EACA,OAAOA,IAEX,GAAyB,iBAAb,EACR,OAAO,IAAIX,GAAQ,UAAWvC,GAElCtzD,GAAe,EAAO,kBAAmB,UAAWszD,EACvD,CAED,GAA+B,mBAAnBA,EAAa,MAAkB,CAIvC,OAHcA,EAAQroD,OAIzB,CAED,GAAyB,iBAAb,EAAuB,CAC/BjL,EAAyC,iBAAlBszD,EAAY,MAA+C,iBAArBA,EAAe,QAAgB,yCAA0C,UAAWA,GACjJ,MAAMmD,EAAS,IAAIZ,GAASvC,EAAY,KAAIA,EAAe,SAO3D,OANIA,EAAQoD,YAAoC,MAAtBpD,EAAQ+C,aAC9BI,EAAOV,aAAa,IAAIN,GAAUnC,EAAQoD,WAAYpD,EAAQ+C,aAK3DI,CACV,CACDz2D,GAAe,EAAO,kBAAmB,UAAWszD,EACvD,CAKD,eAAOv1C,CAAS44C,EAAeH,GACI,iBAAnB,IACRG,EAAgBv3D,OAAOu3D,IAE3B,MAAMC,EAAWhB,GAAShoE,IAAI+oE,GAC1BC,GACA52D,GAAe,EAAO,2BAA2BzP,KAAKC,UAAUomE,EAASpiE,QAAS,gBAAiBmiE,GAEvGf,GAASxgE,IAAIuhE,EAAeH,EAC/B,EAML,SAASK,GAAWt0D,EAAQu0D,GACxB,MAAMj5D,EAAQ1X,OAAOoc,GACrB,IAAK1E,EAAMjX,MAAM,aACb,MAAM,IAAIsX,MAAM,uBAAuBqE,KAG3C,MAAM8xC,EAAQx2C,EAAM/X,MAAM,KAK1B,GAJqB,IAAjBuuD,EAAM1tD,QACN0tD,EAAMlsD,KAAK,IAGM,IAAjBksD,EAAM1tD,OACN,MAAM,IAAIuX,MAAM,uBAAuBqE,KAG3C,KAAO8xC,EAAM,GAAG1tD,OAASmwE,GACrBziB,EAAM,IAAM,IAGhB,GAAIA,EAAM,GAAG1tD,OAAS,EAAG,CACrB,IAAIowE,EAAO33D,OAAOi1C,EAAM,GAAGnzC,UAAU,EAAG,IACnCmzC,EAAM,GAAGnzC,UAAU,GAAGta,MAAM,SAC7BmwE,IAEJ1iB,EAAM,GAAK0iB,EAAKhxE,UACnB,CACD,OAAOqZ,OAAOi1C,EAAM,GAAKA,EAAM,GACnC,CAEA,SAASiiB,GAAoBhlE,GACzB,OAAO,IAAIqkE,GAA6BrkE,GAAK+M,MAAO24D,EAAclP,EAAUn/C,KAGxE,IAAIwC,EADJxC,EAAQiB,UAAU,aAAc,UAEhC,IACI,MAAOmB,EAAWksD,SAAkB14D,QAAQhQ,IAAI,CAC5Coa,EAAQ9R,OAAQmgE,MAEpB7rD,EAAWJ,EACX,MAAM2C,EAAUvC,EAASoB,SAAS2qD,SAMlC,MALgB,CACZ9gB,SAAU6gB,EAAS7gB,SACnBE,aAAcugB,GAAWnpD,EAAQypD,OAAQ,GACzC9gB,qBAAsBwgB,GAAWnpD,EAAQ0pD,eAAgB,GAGhE,CACD,MAAOn5D,GACH8B,GAAO,EAAO,+CAA+CxP,KAAKC,UAAUmY,EAAQrX,QAAS,eAAgB,CAAEqX,UAASwC,WAAUlN,SACrI,IAET,CAEA,IAAIk4D,IAAW,ECjSf,SAASn6D,GAAKJ,GACV,OAAOrL,KAAK+E,MAAM/E,KAAKC,UAAUoL,GACrC,CAwBO,MAAMy7D,GACTvP,IACAwP,IACAC,IAGA7N,IAIA,WAAA9hE,CAAYkgE,GACR/9D,MAAK+9D,GAAYA,EACjB/9D,MAAKutE,GAAU,KACfvtE,MAAKwtE,GAAY,IACjBxtE,MAAK2/D,IAAgB,CACxB,CAID,mBAAI8N,GAAoB,OAAOztE,MAAKwtE,EAAY,CAChD,mBAAIC,CAAgB35D,GAAS9T,MAAKwtE,GAAY15D,CAAQ,CACtD,QAAM1U,GACF,IACI,MAAMugE,QAAoB3/D,MAAK+9D,GAAU8C,iBAEzC,IAA2B,IAAvB7gE,MAAK2/D,GAEL,YADA3/D,MAAK2/D,GAAeA,GAIxB,GAAIA,IAAgB3/D,MAAK2/D,GAAc,CACnC,IAAK,IAAIzuD,EAAIlR,MAAK2/D,GAAe,EAAGzuD,GAAKyuD,EAAazuD,IAAK,CAEvD,GAAoB,MAAhBlR,MAAKutE,GACL,aAEEvtE,MAAK+9D,GAAUoH,KAAK,QAASj0D,EACtC,CACDlR,MAAK2/D,GAAeA,CACvB,CACJ,CACD,MAAOzrD,GAIN,CAEmB,MAAhBlU,MAAKutE,KAGTvtE,MAAKutE,GAAUvtE,MAAK+9D,GAAU2P,YAAY1tE,MAAKZ,GAAMuuE,KAAK3tE,MAAOA,MAAKwtE,IACzE,CACD,KAAA11D,GACQ9X,MAAKutE,KAGTvtE,MAAKutE,GAAUvtE,MAAK+9D,GAAU2P,YAAY1tE,MAAKZ,GAAMuuE,KAAK3tE,MAAOA,MAAKwtE,IACtExtE,MAAKZ,KACR,CACD,IAAAsE,GACS1D,MAAKutE,KAGVvtE,MAAK+9D,GAAU6P,cAAc5tE,MAAKutE,IAClCvtE,MAAKutE,GAAU,KAClB,CACD,KAAAM,CAAMC,GACF9tE,KAAK0D,OACDoqE,IACA9tE,MAAK2/D,IAAgB,EAE5B,CACD,MAAAoO,GACI/tE,KAAK8X,OACR,EAQE,MAAMk2D,GACTjQ,IACA3+D,IACA6uE,IAIA,WAAApwE,CAAYkgE,GACR/9D,MAAK+9D,GAAYA,EACjB/9D,MAAKiuE,IAAW,EAChBjuE,MAAKZ,GAASugE,IACV3/D,KAAKkuE,MAAMvO,EAAa3/D,MAAK+9D,GAAU,CAE9C,CAID,WAAMmQ,CAAMvO,EAAa5B,GACrB,MAAM,IAAI5pD,MAAM,iCACnB,CACD,KAAA2D,GACQ9X,MAAKiuE,KAGTjuE,MAAKiuE,IAAW,EAChBjuE,MAAKZ,IAAO,GACZY,MAAK+9D,GAAUv9D,GAAG,QAASR,MAAKZ,IACnC,CACD,IAAAsE,GACS1D,MAAKiuE,KAGVjuE,MAAKiuE,IAAW,EAChBjuE,MAAK+9D,GAAU39D,IAAI,QAASJ,MAAKZ,IACpC,CACD,KAAAyuE,CAAMC,GAAmB9tE,KAAK0D,MAAS,CACvC,MAAAqqE,GAAW/tE,KAAK8X,OAAU,EAEvB,MAAMq2D,WAAkCH,GAC3CnuE,IACAuuE,IACA,WAAAvwE,CAAYkgE,EAAUl+D,GAClB8J,MAAMo0D,GACN/9D,MAAKH,GAAOA,EACZG,MAAKouE,IAAc,CACtB,CACD,KAAAP,CAAMC,GACEA,IACA9tE,MAAKouE,IAAc,GAEvBzkE,MAAMkkE,MAAMC,EACf,CACD,WAAMI,CAAMvO,EAAa5B,GACrB,MAAMlnB,QAAcknB,EAAS+B,SAAS9/D,MAAKH,IAC9B,MAATg3C,KAGqB,IAArB72C,MAAKouE,GACLpuE,MAAKouE,GAAav3B,EAAMnvB,OAEnBmvB,EAAMnvB,OAAS1nB,MAAKouE,KACzBrQ,EAASoH,KAAKnlE,MAAKH,GAAMg3C,EAAMnvB,QAC/B1nB,MAAKouE,GAAav3B,EAAMnvB,QAE/B,EAOE,MAAM2mD,WAAgCL,GACzC7zD,IACA,WAAAtc,CAAYkgE,EAAU5jD,GAClBxQ,MAAMo0D,GACN/9D,MAAKma,GAAUlI,GAAKkI,EACvB,CACD,WAAM+zD,CAAMvO,EAAa5B,GACrB,MAAM,IAAI5pD,MAAM,QAEnB,EAQE,MAAMm6D,WAAqCN,GAC9C9wE,IAKA,WAAAW,CAAYkgE,EAAU7gE,GAClByM,MAAMo0D,GACN/9D,MAAK9C,GAAQA,CAChB,CACD,WAAMgxE,CAAMvO,EAAa5B,GACrB,MAAM/R,QAAW+R,EAASgC,sBAAsB//D,MAAK9C,IACjD8uD,GACA+R,EAASoH,KAAKnlE,MAAK9C,GAAO8uD,EAEjC,EAOE,MAAMuiB,GACTxQ,IACA5jD,IACAozD,IACAU,IAGAtO,IAKA,WAAA9hE,CAAYkgE,EAAU5jD,GAClBna,MAAK+9D,GAAYA,EACjB/9D,MAAKma,GAAUlI,GAAKkI,GACpBna,MAAKutE,GAAUvtE,MAAKZ,GAAMuuE,KAAK3tE,MAC/BA,MAAKiuE,IAAW,EAChBjuE,MAAK2/D,IAAgB,CACxB,CACD,QAAMvgE,CAAMugE,GAER,IAA2B,IAAvB3/D,MAAK2/D,GACL,OAEJ,MAAMxlD,EAASlI,GAAKjS,MAAKma,IACzBA,EAAOusD,UAAY1mE,MAAK2/D,GAAe,EACvCxlD,EAAOwsD,QAAUhH,EACjB,MAAMY,QAAavgE,MAAK+9D,GAAU6I,QAAQzsD,GAG1C,GAAoB,IAAhBomD,EAAK3jE,OAMT,IAAK,MAAM+J,KAAO45D,EACdvgE,MAAK+9D,GAAUoH,KAAKnlE,MAAKma,GAASxT,GAIlC3G,MAAK2/D,GAAeh5D,EAAIg5D,iBAVpB3/D,MAAK2/D,GAAeA,EAAc,KAClC3/D,MAAK2/D,GAAeA,EAAc,GAW7C,CACD,KAAA7nD,GACQ9X,MAAKiuE,KAGTjuE,MAAKiuE,IAAW,GACW,IAAvBjuE,MAAK2/D,IACL3/D,MAAK+9D,GAAU8C,iBAAiBxK,MAAMsJ,IAClC3/D,MAAK2/D,GAAeA,CAAW,IAGvC3/D,MAAK+9D,GAAUv9D,GAAG,QAASR,MAAKutE,IACnC,CACD,IAAA7pE,GACS1D,MAAKiuE,KAGVjuE,MAAKiuE,IAAW,EAChBjuE,MAAK+9D,GAAU39D,IAAI,QAASJ,MAAKutE,IACpC,CACD,KAAAM,CAAMC,GACF9tE,KAAK0D,OACDoqE,IACA9tE,MAAK2/D,IAAgB,EAE5B,CACD,MAAAoO,GACI/tE,KAAK8X,OACR,ECxQL,MAAMo8B,GAAO7+B,OAAO,GAEpB,SAASm5D,GAAU16D,GACf,OAAQA,GAAiC,mBAAhBA,EAAU,IACvC,CACA,SAAS26D,GAAO99D,EAAQmD,GACpB,OAAOnD,EAAS,IAAMnK,KAAKC,UAAUqN,GAAO,CAAC7V,EAAGwC,KAC5C,GAAS,MAALA,EACA,MAAO,OAEX,GAAmB,iBAAP,EACR,MAAO,UAAUA,EAAEzE,aAEvB,GAAmB,iBAAP,EACR,OAAOyE,EAAEwb,cAGb,GAAmB,iBAAf,IAA4B5U,MAAM4N,QAAQxU,GAAI,CAC9C,MAAMtC,EAAOV,OAAOU,KAAKsC,GAEzB,OADAtC,EAAKyI,OACEzI,EAAKsW,QAAO,CAACC,EAAOrP,KACvBqP,EAAMrP,GAAO5E,EAAE4E,GACRqP,IACR,CAAE,EACT,CACA,OAAOjU,CAAC,GAEhB,CAMO,MAAMiuE,GAITjkE,KAIA,WAAA5M,CAAY4M,GAAQkK,EAAiB3U,KAAM,CAAEyK,QAAS,CACtD,KAAAqN,GAAU,CACV,IAAApU,GAAS,CACT,KAAAmqE,CAAMC,GAAmB,CACzB,MAAAC,GAAW,EAKf,SAASY,GAAU/pD,GAGf,OAFAA,EAAQvd,MAAMI,KAAK,IAAKi9C,IAAI9/B,GAAQ/P,WAC9BjO,OACCge,CACX,CACAtQ,eAAes6D,GAAgBC,EAAQ9Q,GACnC,GAAc,MAAV8Q,EACA,MAAM,IAAI16D,MAAM,iBAMpB,GAHI9M,MAAM4N,QAAQ45D,KACdA,EAAS,CAAEtS,OAAQsS,IAEC,iBAAZ,EACR,OAAQA,GACJ,IAAK,QACL,IAAK,QACL,IAAK,QACL,IAAK,YACL,IAAK,UACL,IAAK,UACL,IAAK,OACD,MAAO,CAAE96D,KAAM86D,EAAQhvE,IAAKgvE,GAIxC,GAAIv3D,EAAYu3D,EAAQ,IAAK,CACzB,MAAM3xE,EAAO2xE,EAAO5yD,cACpB,MAAO,CAAElI,KAAM,cAAelU,IAAK4uE,GAAO,KAAM,CAAEvxE,SAASA,OAC/D,CACA,GAAI2xE,EAAOtP,OAAQ,CACf,MAAMsF,EAAQgK,EAEd,MAAO,CAAE96D,KAAM,SAAUlU,IAAK4uE,GAAO,SAAU5J,GAAQ1qD,QApCjDrG,EAoC8D+wD,EAnCjEr+D,KAAK+E,MAAM/E,KAAKC,UAAUqN,KAoCjC,CArCJ,IAAcA,EAsCV,GAAK+6D,EAAOv4B,SAAWu4B,EAAOtS,OAAS,CACnC,MAAMsI,EAAQgK,EACR10D,EAAS,CACXoiD,QAAUsI,EAAMtI,QAAU,IAAIt2D,KAAKnJ,GACtB,MAALA,EACO,KAEPuK,MAAM4N,QAAQnY,GACP6xE,GAAU7xE,EAAEmJ,KAAKnJ,GAAMA,EAAEmf,iBAE7Bnf,EAAEmf,iBAGjB,GAAI4oD,EAAMvuB,QAAS,CACf,MAAMw4B,EAAY,GACZ5Y,EAAW,GACX6Y,EAAcpkB,IACZrzC,EAAYqzC,GACZmkB,EAAU1wE,KAAKusD,GAGfuL,EAAS93D,KAAK,WACV0wE,EAAU1wE,WAAWg5C,GAAeuT,EAAMoT,GAC7C,EAFa,GAGlB,EAEA12D,MAAM4N,QAAQ4vD,EAAMvuB,SACpBuuB,EAAMvuB,QAAQhvC,QAAQynE,GAGtBA,EAAWlK,EAAMvuB,SAEjB4f,EAASt5D,cACH4X,QAAQhQ,IAAI0xD,GAEtB/7C,EAAOm8B,QAAUq4B,GAAUG,EAAU7oE,KAAK+D,GAAMA,EAAEiS,gBACtD,CACA,MAAO,CAAE9B,SAAQta,IAAK4uE,GAAO,QAASt0D,GAASpG,KAAM,QACzD,CACAkC,GAAe,EAAO,wBAAyB,QAAS44D,EAC5D,CACA,SAASv8D,KAAY,OAAO,IAAKpT,MAAQoT,SAAW,CACpD,MAAM08D,GAAiB,CACnBC,aAAc,IACdxB,gBAAiB,KAQd,MAAMyB,GACTlkE,IACAo9D,IAEA+G,IACAhnD,IACAinD,IACAC,IACAC,IAEAC,IACAC,IACAC,IACAC,IACA7zD,GAMA,WAAAhe,CAAY8xE,EAAU9zD,GAElB,GADA7b,MAAK6b,EAAWpe,OAAOsY,OAAO,CAAE,EAAEi5D,GAAgBnzD,GAAW,CAAA,GAC5C,QAAb8zD,EACA3vE,MAAKqvE,IAAc,EACnBrvE,MAAKovE,GAAkB,UAEtB,GAAIO,EAAU,CACf,MAAMpG,EAAUuC,GAAQrkE,KAAKkoE,GAC7B3vE,MAAKqvE,IAAc,EACnBrvE,MAAKovE,GAAkB56D,QAAQ5J,QAAQ2+D,GACvClrE,YAAW,KAAQ2B,KAAKmlE,KAAK,UAAWoE,EAAS,KAAK,GAAK,EAC/D,MAEIvpE,MAAKqvE,IAAc,EACnBrvE,MAAKovE,GAAkB,KAE3BpvE,MAAKuvE,IAAoB,EACzBvvE,MAAKsvE,GAAgB,IAAInqD,IACzBnlB,MAAKgL,GAAQ,IAAIma,IACjBnlB,MAAKooE,GAAW,IAAIjjD,IACpBnlB,MAAKmvE,GAAe,KACpBnvE,MAAKmoB,IAAa,EAClBnoB,MAAKwvE,GAAa,EAClBxvE,MAAKyvE,GAAU,IAAItqD,IACnBnlB,MAAK0vE,IAAmB,CAC5B,CACA,mBAAIjC,GAAoB,OAAOztE,MAAK6b,EAAS4xD,eAAiB,CAK9D,YAAI1P,GAAa,OAAO/9D,IAAM,CAI9B,WAAIooE,GACA,OAAO/gE,MAAMI,KAAKzH,MAAKooE,GAASvzD,SACpC,CAIA,YAAAm3D,CAAa7D,GACT,GAAInoE,MAAKooE,GAASvkE,IAAIskE,EAAO19D,MACzB,MAAM,IAAI0J,MAAM,mCAAmCg0D,EAAO19D,SAG9D,OADAzK,MAAKooE,GAAS/8D,IAAI88D,EAAO19D,KAAM09D,EAAOnC,QAAQhmE,OACvCA,IACX,CAIA,SAAA0pE,CAAUj/D,GACN,OAAQzK,MAAKooE,GAASvkE,IAAI4G,IAAU,IACxC,CAKA,mBAAIilE,GAAoB,OAAO1vE,MAAK0vE,EAAkB,CACtD,mBAAIA,CAAgB57D,GAAS9T,MAAK0vE,KAAqB57D,CAAO,CAE9D,QAAM87D,CAASr0E,GACX,MAAMihB,EAAUxc,MAAK6b,EAASozD,aAE9B,GAAIzyD,EAAU,EACV,aAAaxc,KAAK6vE,SAASt0E,GAG/B,MAAMsE,EAAM4uE,GAAOlzE,EAAIwb,OAAQxb,GAC/B,IAAIq0E,EAAU5vE,MAAKsvE,GAAczrE,IAAIhE,GAUrC,OATK+vE,IACDA,EAAU5vE,KAAK6vE,SAASt0E,GACxByE,MAAKsvE,GAAcjkE,IAAIxL,EAAK+vE,GAC5BvxE,YAAW,KACH2B,MAAKsvE,GAAczrE,IAAIhE,KAAS+vE,GAChC5vE,MAAKsvE,GAAcxnC,OAAOjoC,EAC9B,GACD2c,UAEMozD,CACjB,CAIA,mBAAME,CAAc9jB,EAAI+jB,EAAUC,GAC9B,GAAIhwE,KAAK0vE,iBAAmC,IAAhBM,EAAKpzE,QAAyB,MAATovD,EAAGjsD,GAChD,OAAO,KAEX,MAAMkwE,EAASjkB,EAAGjsD,GAAGkc,cACfrd,EAAOmxE,EAAS9zD,cAChBi0D,EAAgB,GACtB,IAAK,IAAI/yE,EAAI,EAAGA,EAAI6yE,EAAKpzE,OAAQO,IAAK,CAClC,MAAMoK,EAAMyoE,EAAK7yE,GAEXgzE,EAAO5oE,EAAItL,QAAQ,WAAYg0E,GAAQh0E,QAAQ,SAAU2C,GAOzDggB,EAAU,IAAIT,GAAagyD,IACF,IAA3B5oE,EAAIrJ,QAAQ,YACZ0gB,EAAQ/B,KAAO,CAAEje,OAAMqxE,WAE3BjwE,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,2BAA4Bn6C,UAAShN,MAAOzU,EAAG6yE,SAC5E,IAEIhzD,EAFAozD,EAAe,gBAGnB,IACIpzD,QAAa4B,EAAQ9R,MACzB,CACA,MAAOoH,GAGHg8D,EAAc9xE,KAAK8V,EAAMuB,SACzBzV,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,4BAA6Bn6C,UAASxJ,OAAQ,CAAElB,WAC7E,QACJ,CACA,IACI,MAAMkB,EAAS4H,EAAKwF,SACpB,GAAIpN,EAAOxW,KAEP,OADAoB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,6BAA8Bn6C,UAASxJ,WAC7DA,EAAOxW,KAEdwW,EAAOK,UACP26D,EAAeh7D,EAAOK,SAE1BzV,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,4BAA6Bn6C,UAASxJ,UACvE,CACA,MAAOlB,GAAS,CAEhB8B,EAAOgH,EAAKK,WAAa,KAAOL,EAAKK,YAAc,IAAK,yCAAyC+yD,IAAgB,iBAAkB,CAAE51D,OAAQ,uBAAwB0+C,YAAalN,EAAIt2C,KAAM,CAAEnO,MAAK6oE,kBAEnMF,EAAc9xE,KAAKgyE,EACvB,CACAp6D,GAAO,EAAO,wCAAwCk6D,EAAcjqE,KAAKyG,GAAMlG,KAAKC,UAAUiG,KAAI7E,KAAK,QAAS,iBAAkB,CAC9H2S,OAAQ,mBACR0+C,YAAalN,EAAIt2C,KAAM,CAAEs6D,OAAME,kBAEvC,CAMA,UAAAG,CAAWv8D,EAAOy1D,GACd,OAAO,IAAIzL,GLnNZ,SAAqBhqD,GACxB,MAAMsB,EAASm1D,GAAaz2D,GAO5B,OANAsB,EAAOypD,aAAe/qD,EAAM+qD,aAAa54D,KAAK+lD,GACtB,iBAAR,EACDA,EAEJ0e,GAA0B1e,KAE9B52C,CACX,CK0MyBk7D,CAAYx8D,GAAQ9T,KACzC,CAMA,QAAAuwE,CAASz8D,EAAOy1D,GACZ,OAAO,IAAI/J,GLnPZ,SAAmB1rD,GACtB,OAAOw2D,GAAWx2D,EACtB,CKiPuB08D,CAAU18D,GAAQ9T,KACrC,CAMA,uBAAAywE,CAAwB38D,EAAOy1D,GAC3B,OAAO,IAAIrJ,GLjLZ,SAAkCpsD,GACrC,OAAO22D,GAA0B32D,EACrC,CK+KsC48D,CAAyB58D,GAAQ9T,KACnE,CAMA,wBAAA2wE,CAAyB3kB,EAAIud,GACzB,OAAO,IAAIzK,GAAoB4L,GAA0B1e,GAAKhsD,KAClE,CAOA,cAAA4wE,GACI56D,GAAO,EAAO,kCAAmC,wBAAyB,CACtEU,UAAW,kBAEnB,CAOA,cAAMm5D,CAASt0E,GACXya,GAAO,EAAO,uBAAuBza,EAAIwb,SAAU,wBAAyB,CACxEL,UAAWnb,EAAIwb,OACfrB,KAAMna,GAEd,CAEA,oBAAMslE,GACF,MAAMlB,EAAc/mD,QAAgB5Y,MAAK4vE,GAAS,CAAE74D,OAAQ,mBAAqB,aAIjF,OAHI/W,MAAKuvE,IAAoB,IACzBvvE,MAAKuvE,GAAmB5P,GAErBA,CACX,CAMA,WAAAkR,CAAYv6B,GACR,OAAOc,GAAed,EAASt2C,KACnC,CAKA,YAAA8wE,CAAanT,GACT,GAAgB,MAAZA,EACA,MAAO,SAEX,OAAQA,GACJ,IAAK,WACD,MAAO,MACX,IAAK,YACL,IAAK,SACL,IAAK,UACL,IAAK,OACD,OAAOA,EAEf,OAAIrmD,EAAYqmD,GACRrmD,EAAYqmD,EAAU,IACfA,EAEJjkD,EAAWikD,IAEI,iBAAd,IACRA,EAAW/kD,EAAU+kD,EAAU,aAET,iBAAd,EACJA,GAAY,EACLjkD,EAAWikD,GAElB39D,MAAKuvE,IAAoB,EAClB71D,EAAW1Z,MAAKuvE,GAAmB5R,GAEvC39D,KAAK6gE,iBAAiBxK,MAAMnlD,GAAMwI,EAAWxI,EAAIysD,UAE5D1nD,GAAe,EAAO,mBAAoB,WAAY0nD,GAC1D,CAMA,UAAAoT,CAAW52D,GAEP,MAAMoiD,GAAUpiD,EAAOoiD,QAAU,IAAIt2D,KAAKnJ,GAC7B,MAALA,EACO,KAEPuK,MAAM4N,QAAQnY,GACP6xE,GAAU7xE,EAAEmJ,KAAKnJ,GAAMA,EAAEmf,iBAE7Bnf,EAAEmf,gBAEPyjD,EAAa,cAAevlD,EAAUA,EAAOulD,eAAY5iD,EACzDlS,EAAU,CAAComE,EAAUtK,EAAWC,KAClC,IAAIrwB,EACJ,OAAQ06B,EAASp0E,QACb,KAAK,EAAG,MACR,KAAK,EACD05C,EAAU06B,EAAS,GACnB,MACJ,QACIA,EAASpqE,OACT0vC,EAAU06B,EAElB,GAAItR,IACiB,MAAbgH,GAAgC,MAAXC,GACrB,MAAM,IAAIxyD,MAAM,kBAGxB,MAAMgG,EAAS,CAAA,EAgBf,OAfIm8B,IACAn8B,EAAOm8B,QAAUA,GAEjBimB,EAAO3/D,SACPud,EAAOoiD,OAASA,GAEhBmK,IACAvsD,EAAOusD,UAAYA,GAEnBC,IACAxsD,EAAOwsD,QAAUA,GAEjBjH,IACAvlD,EAAOulD,UAAYA,GAEhBvlD,CAAM,EAGjB,IAWIusD,EAIAC,EAfArwB,EAAU,GACd,GAAIn8B,EAAOm8B,QACP,GAAIjvC,MAAM4N,QAAQkF,EAAOm8B,SACrB,IAAK,MAAMqU,KAAQxwC,EAAOm8B,QACtBA,EAAQl4C,KAAK4B,KAAK6wE,YAAYlmB,SAIlCrU,EAAQl4C,KAAK4B,KAAK6wE,YAAY12D,EAAOm8B,UAW7C,MAPI,cAAen8B,IACfusD,EAAY1mE,KAAK8wE,aAAa32D,EAAOusD,YAGrC,YAAavsD,IACbwsD,EAAU3mE,KAAK8wE,aAAa32D,EAAOwsD,UAEnCrwB,EAAQn8B,QAAQnQ,GAAsB,iBAAP,IAAkBpN,QACnC,MAAb8pE,GAA4C,oBACjC,MAAXC,GAAwC,iBAArB,EACbnyD,QAAQhQ,IAAI,CAACgQ,QAAQhQ,IAAI8xC,GAAUowB,EAAWC,IAAUtQ,MAAMjhD,GAC1DxK,EAAQwK,EAAO,GAAIA,EAAO,GAAIA,EAAO,MAG7CxK,EAAQ0rC,EAASowB,EAAWC,EACvC,CAMA,sBAAAsK,CAAuBlwD,GACnB,MAAMnC,EAAU4+C,GAAYz8C,GACtBm1C,EAAW,GAajB,GAZA,CAAC,KAAM,QAAQ5uD,SAASjC,IACpB,GAAoB,MAAhBuZ,EAAQvZ,GACR,OAEJ,MAAMslD,EAAOvT,GAAex4B,EAAQvZ,GAAMrF,MACtCwuE,GAAU7jB,GACVuL,EAAS93D,KAAK,iBAAqBwgB,EAAQvZ,SAAaslD,CAAO,CAAjD,IAGd/rC,EAAQvZ,GAAOslD,CACnB,IAEoB,MAApB/rC,EAAQ++C,SAAkB,CAC1B,MAAMA,EAAW39D,KAAK8wE,aAAalyD,EAAQ++C,UACvC6Q,GAAU7Q,GACVzH,EAAS93D,KAAK,iBAAqBwgB,EAAQ++C,eAAiBA,CAAW,CAAzD,IAGd/+C,EAAQ++C,SAAWA,CAE3B,CACA,OAAIzH,EAASt5D,OACF,iBAEH,aADM4X,QAAQhQ,IAAI0xD,GACXt3C,CACV,CAHM,GAKJA,CACX,CACA,gBAAM4qD,GAEF,GAA4B,MAAxBxpE,MAAKovE,GAAyB,CAE9B,MAAM8B,EAAgB,WAClB,IACI,MAAM3H,QAAgBvpE,KAAK4wE,iBAE3B,OADA5wE,KAAKmlE,KAAK,UAAWoE,EAAS,MACvBA,CACX,CACA,MAAOr1D,GAIH,MAHIlU,MAAKovE,KAAoB8B,IACzBlxE,MAAKovE,GAAkB,MAErBl7D,CACV,CACH,EAZqB,GActB,OADAlU,MAAKovE,GAAkB8B,SACTA,GAAehwD,OACjC,CACA,MAAMkuD,EAAiBpvE,MAAKovE,IACrB+B,EAAUC,SAAgB58D,QAAQhQ,IAAI,CACzC4qE,EACApvE,KAAK4wE,mBAkBT,OAhBIO,EAASj8B,UAAYk8B,EAAOl8B,UACxBl1C,MAAKqvE,IAELrvE,KAAKmlE,KAAK,UAAWiM,EAAQD,GAEzBnxE,MAAKovE,KAAoBA,IACzBpvE,MAAKovE,GAAkB56D,QAAQ5J,QAAQwmE,KAK3Cp7D,GAAO,EAAO,oBAAoBm7D,EAASj8B,cAAck8B,EAAOl8B,WAAY,gBAAiB,CACzF2vB,MAAO,aAIZsM,EAASjwD,OACpB,CACA,gBAAMmwD,GACF,MAAM9H,QAAgBvpE,KAAKwpE,aACrB8H,EAAiBh9D,UACnB,MAAMi9D,OAAEA,EAAMllB,SAAEA,EAAQmlB,YAAEA,SAAsBj9D,EAAkB,CAC9Dg9D,OAAQvxE,MAAK8/D,GAAU,UAAU,GACjCzT,SAAW,WACP,IAEI,OAAO3zC,QADa1Y,MAAK4vE,GAAS,CAAE74D,OAAQ,gBACpB,YAC5B,CACA,MAAO7C,GAAS,CAChB,OAAO,IACV,EAPU,GAQXs9D,YAAc,WACV,IAEI,OAAO94D,QADa1Y,MAAK4vE,GAAS,CAAE74D,OAAQ,mBACpB,YAC5B,CACA,MAAO7C,GAAS,CAChB,OAAO,IACV,EAPa,KASlB,IAAIq4C,EAAe,KACfD,EAAuB,KAE3B,MAAMzV,EAAQ72C,KAAKqwE,WAAWkB,EAAQhI,GAKtC,OAJI1yB,GAASA,EAAM+nB,gBACftS,EAAuC,MAAfklB,EAAuBA,EAAcn8D,OAAO,cACpEk3C,EAAgB1V,EAAM+nB,cAAgB1qB,GAAQoY,GAE3C,IAAIiR,GAAQlR,EAAUE,EAAcD,EAAqB,EAG9D6b,EAASoB,EAAQG,UAAU,oDACjC,GAAIvB,EAAQ,CACR,MAAM5sE,EAAM,IAAI4iB,GAAagqD,EAAO5gE,KAC9BkqE,QAAgBtJ,EAAO7nD,YAAYgxD,EAAgBtxE,KAAMzE,GAC/D,OAAO,IAAIgiE,GAAQkU,EAAQplB,SAAUolB,EAAQllB,aAAcklB,EAAQnlB,qBACvE,CACA,aAAaglB,GACjB,CACA,iBAAMpN,CAAYwN,GACd,IAAI1lB,EAAKhsD,KAAKixE,uBAAuBS,GAIrC,OAHIlD,GAAUxiB,KACVA,QAAWA,GAERtzC,QAAgB1Y,MAAK4vE,GAAS,CACjC74D,OAAQ,cAAemiD,YAAalN,IACpC,YACR,CACA,QAAMluD,CAAMkuD,EAAI2R,EAAU/8C,GACtB5K,EAAO4K,EAxmBY,GAwmBkB,0CAA2C,iBAAkB,CAC9FpG,OAAQ,qBACR0+C,YAAaz7D,OAAOsY,OAAO,CAAE,EAAEi2C,EAAI,CAAE2R,WAAUC,gBAAgB,MAGnE,MAAM1E,EAAcsE,GAAYxR,GAChC,IACI,OAAOv0C,QAAczX,KAAK6vE,SAAS,CAAE94D,OAAQ,OAAQmiD,cAAayE,aACtE,CACA,MAAOzpD,GAEH,IAAKlU,KAAK0vE,iBAAmBn6D,EAAgBrB,IAAUA,EAAMtV,MAAQgiB,GAAW,GAAkB,WAAb+8C,GAA2C,MAAlBzE,EAAYn5D,IAA8C,eAAhC8X,EAAU3D,EAAMtV,KAAM,EAAG,GAAqB,CAClL,MAAMA,EAAOsV,EAAMtV,KACb+yE,QAAiBv6B,GAAe8hB,EAAYn5D,GAAIC,MAEtD,IAAI4xE,EACJ,IACIA,EAqqBpB,SAA6BhzE,GACzB,MAAMwW,EAAS,CACX66D,OAAQ,GAAID,KAAM,GAAID,SAAU,GAAIvY,SAAU,GAAImH,UAAW,GAAIkT,UAAW,IAEhF77D,EAAO4B,EAAWhZ,IAAS,IAAQ,mCAAoC,iBAAkB,CACrF4b,OAAQ,qCAEZ,MAAMy1D,EAASp4D,EAAUjZ,EAAM,EAAG,IAClCoX,EAAO6B,EAAUo4D,EAAQ,EAAG,MAAQp4D,EAAUi6D,GAAO,EAAG,IAAK,gCAAiC,iBAAkB,CAC5Gt3D,OAAQ,kCAEZpF,EAAO66D,OAASp4D,EAAUo4D,EAAQ,IAElC,IACI,MAAMD,EAAO,GACP+B,EAAan5D,EAAUf,EAAUjZ,EAAM,GAAI,KAC3CozE,EAAap5D,EAAUf,EAAUjZ,EAAMmzE,EAAYA,EAAa,KAChEE,EAAWp6D,EAAUjZ,EAAMmzE,EAAa,IAC9C,IAAK,IAAI90E,EAAI,EAAGA,EAAI+0E,EAAY/0E,IAAK,CACjC,MAAMsK,EAAM2qE,GAAaD,EAAc,GAAJh1E,GACnC,GAAW,MAAPsK,EACA,MAAM,IAAI4M,MAAM,SAEpB67D,EAAK5xE,KAAKmJ,EACd,CACA6N,EAAO46D,KAAOA,CAClB,CACA,MAAO97D,GACH8B,GAAO,EAAO,8BAA+B,iBAAkB,CAC3DwE,OAAQ,+BAEhB,CAEA,IACI,MAAMu1D,EAAWoC,GAAYvzE,EAAM,IACnC,GAAgB,MAAZmxE,EACA,MAAM,IAAI57D,MAAM,SAEpBiB,EAAO26D,SAAWA,CACtB,CACA,MAAO77D,GACH8B,GAAO,EAAO,kCAAmC,iBAAkB,CAC/DwE,OAAQ,mCAEhB,CAEAxE,EAAO6B,EAAUjZ,EAAM,IAAK,OAASiZ,EAAUi6D,GAAO,EAAG,IAAK,2CAA4C,iBAAkB,CACxHt3D,OAAQ,6CAEZpF,EAAOoiD,SAAW3/C,EAAUjZ,EAAM,GAAI,KAEtC,IACI,MAAM+/D,EAAYwT,GAAYvzE,EAAM,KACpC,GAAiB,MAAb+/D,EACA,MAAM,IAAIxqD,MAAM,SAEpBiB,EAAOupD,UAAYA,CACvB,CACA,MAAOzqD,GACH8B,GAAO,EAAO,mCAAoC,iBAAkB,CAChEwE,OAAQ,oCAEhB,CAEA,OADApF,EAAOy8D,UAAY,0CAA0C91E,MAAM,KAAKkK,KAAKhI,GAAMmX,EAAOnX,KACnFmX,CACX,CAtuB+Bg9D,CAAoBv6D,EAAU3D,EAAMtV,KAAM,GACzD,CACA,MAAOsV,GACH8B,GAAO,EAAO9B,EAAMuB,QAAS,iBAAkB,CAC3C+E,OAAQ,WAAY0+C,cAAaxjD,KAAM,CAAE9W,SAEjD,CAEAoX,EAAO47D,EAAS3B,OAAOh0D,gBAAkB01D,EAAS11D,cAAe,4BAA6B,iBAAkB,CAC5G88C,OAAQ,OACRn6D,OACA4b,OAAQ,iBACR0+C,YAAaA,EACbC,WAAY,KACZF,OAAQ,CACJnoB,UAAW,sDACXrmC,KAAM,iBACNua,KAAM4sD,EAASC,aAGvB,MAAMQ,QAAmBryE,KAAK8vE,cAAc5W,EAAa0Y,EAAS7B,SAAU6B,EAAS5B,MACrFh6D,EAAqB,MAAdq8D,EAAoB,iCAAkC,iBAAkB,CAC3E73D,OAAQ,eAAgB0+C,cAAaxjD,KAAM,CAAE9W,KAAMsV,EAAMtV,KAAMizE,UAAWD,EAASC,aAEvF,MAAM7lB,EAAK,CACPjsD,GAAI4xE,EACJ/yE,KAAM8U,EAAO,CAACk+D,EAASpa,SAAU8a,GAAY,CAACD,EAAYT,EAASjT,eAEvE3+D,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,mBAAoBG,YAAalN,IAC9D,IACI,MAAM52C,QAAepV,MAAKlC,GAAMkuD,EAAI2R,EAAU/8C,EAAU,GAExD,OADA5gB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,4BAA6BG,YAAaz7D,OAAOsY,OAAO,CAAE,EAAEi2C,GAAK52C,WACvFA,CACX,CACA,MAAOlB,GAEH,MADAlU,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,2BAA4BG,YAAaz7D,OAAOsY,OAAO,CAAE,EAAEi2C,GAAK93C,UACvFA,CACV,CACJ,CACA,MAAMA,CACV,CACJ,CACA,QAAMq+D,CAAcp7B,GAChB,MAAMrjC,MAAEA,SAAgBS,EAAkB,CACtCg1D,QAASvpE,KAAKwpE,aACd11D,MAAOqjC,IAEX,OAAOrjC,CACX,CACA,UAAMhW,CAAK4zE,GACP,MAAM1lB,GAAEA,EAAE2R,SAAEA,SAAmBppD,EAAkB,CAC7Cy3C,GAAIhsD,KAAKixE,uBAAuBS,GAChC/T,SAAU39D,KAAK8wE,aAAaY,EAAI/T,YAEpC,aAAa39D,MAAKuyE,GAAcvyE,MAAKlC,GAAMkuD,EAAI2R,EAAU+T,EAAI9T,eAAiB,GAAK,GACvF,CAEA,QAAM4U,CAAiB5zD,EAASoyD,EAAUyB,GACtC,IAAIn8B,EAAUt2C,KAAK6wE,YAAYG,GAC3BrT,EAAW39D,KAAK8wE,aAAa2B,GAIjC,MAHyB,iBAArB,GAAuD,iBAAtB,KAChCn8B,EAASqnB,SAAkBnpD,QAAQhQ,IAAI,CAAC8xC,EAASqnB,WAEzC39D,MAAKuyE,GAAcvyE,MAAK4vE,GAASnyE,OAAOsY,OAAO6I,EAAS,CAAE03B,UAASqnB,cACpF,CACA,gBAAM+U,CAAWp8B,EAASqnB,GACtB,OAAOjlD,QAAgB1Y,MAAKwyE,GAAiB,CAAEz7D,OAAQ,cAAgBu/B,EAASqnB,GAAW,YAC/F,CACA,yBAAM6D,CAAoBlrB,EAASqnB,GAC/B,OAAO/kD,QAAgB5Y,MAAKwyE,GAAiB,CAAEz7D,OAAQ,uBAAyBu/B,EAASqnB,GAAW,YACxG,CACA,aAAMwI,CAAQ7vB,EAASqnB,GACnB,OAAOlmD,QAAczX,MAAKwyE,GAAiB,CAAEz7D,OAAQ,WAAau/B,EAASqnB,GAC/E,CACA,gBAAMgV,CAAWr8B,EAASs8B,EAAWjV,GACjC,MAAMkV,EAAWn6D,EAAUk6D,EAAW,YACtC,OAAOn7D,QAAczX,MAAKwyE,GAAiB,CAAEz7D,OAAQ,aAAc87D,YAAYv8B,EAASqnB,GAC5F,CAEA,0BAAMmV,CAAqBC,GACvB,MAAMpT,YAAEA,EAAWziE,KAAEA,EAAIqsE,QAAEA,SAAkBh1D,EAAkB,CAC3DorD,YAAa3/D,KAAK6gE,iBAClB3jE,KAAM8C,KAAK6vE,SAAS,CAChB94D,OAAQ,uBACRi8D,kBAAmBD,IAEvBxJ,QAASvpE,KAAKwpE,eAEZxd,EAAKE,GAAYzkD,KAAKsrE,GAC5B,GAAI/mB,EAAG9uD,OAASA,EACZ,MAAM,IAAIiX,MAAM,0CAEpB,OAAOnU,KAAK2wE,yBAAyB3kB,EAAIud,GAAS5H,uBAAuBhC,EAC7E,CACA,QAAMG,CAAUjpB,EAAOo8B,GAEnB,GAAI37D,EAAYu/B,EAAO,IACnB,aAAa72C,MAAK4vE,GAAS,CACvB74D,OAAQ,WAAY2oD,UAAW7oB,EAAOo8B,wBAG9C,IAAItV,EAAW39D,KAAK8wE,aAAaj6B,GAIjC,MAH0B,iBAAd,IACR8mB,QAAiBA,SAER39D,MAAK4vE,GAAS,CACvB74D,OAAQ,WAAY4mD,WAAUsV,uBAEtC,CAEA,cAAMnT,CAASjpB,EAAOq8B,GAClB,MAAM3J,QAAEA,EAAO5oD,OAAEA,SAAiBpM,EAAkB,CAChDg1D,QAASvpE,KAAKwpE,aACd7oD,OAAQ3gB,MAAK8/D,GAAUjpB,IAASq8B,KAEpC,OAAc,MAAVvyD,EACO,KAEJ3gB,KAAKqwE,WAAW1vD,EAAQ4oD,EACnC,CACA,oBAAMrK,CAAehiE,GACjB,MAAMqsE,QAAEA,EAAO5oD,OAAEA,SAAiBpM,EAAkB,CAChDg1D,QAASvpE,KAAKwpE,aACd7oD,OAAQ3gB,MAAK4vE,GAAS,CAAE74D,OAAQ,iBAAkB7Z,WAEtD,OAAc,MAAVyjB,EACO,KAEJ3gB,KAAK2wE,yBAAyBhwD,EAAQ4oD,EACjD,CACA,2BAAMxJ,CAAsB7iE,GACxB,MAAMqsE,QAAEA,EAAO5oD,OAAEA,SAAiBpM,EAAkB,CAChDg1D,QAASvpE,KAAKwpE,aACd7oD,OAAQ3gB,MAAK4vE,GAAS,CAAE74D,OAAQ,wBAAyB7Z,WAE7D,GAAc,MAAVyjB,EACA,OAAO,KAIX,GAAuB,MAAnBA,EAAO0rC,UAAgD,MAA5B1rC,EAAO6/C,kBAA2B,CAC7D,MAAMxU,QAAWhsD,MAAK4vE,GAAS,CAAE74D,OAAQ,iBAAkB7Z,SAC3D,GAAU,MAAN8uD,EACA,MAAM,IAAI73C,MAAM,uDAEpBwM,EAAO6/C,kBAAoBxU,EAAGK,QAClC,CACA,OAAOrsD,KAAKywE,wBAAwB9vD,EAAQ4oD,EAChD,CACA,0BAAM5I,CAAqBzjE,GACvB,MAAMkY,OAAEA,SAAiBb,EAAkB,CACvCg1D,QAASvpE,KAAKwpE,aACdp0D,OAAQpV,MAAK4vE,GAAS,CAAE74D,OAAQ,uBAAwB7Z,WAE5D,OAAc,MAAVkY,EACO,KAEJqC,EAAQrC,EACnB,CAEA,aAAMwxD,CAAQuM,GACV,IAAIh5D,EAASna,KAAK+wE,WAAWoC,GACzB3E,GAAUr0D,KACVA,QAAeA,GAEnB,MAAMovD,QAAEA,EAAO5oD,OAAEA,SAAiBpM,EAAkB,CAChDg1D,QAASvpE,KAAKwpE,aACd7oD,OAAQ3gB,MAAK4vE,GAAS,CAAE74D,OAAQ,UAAWoD,aAE/C,OAAOwG,EAAO1a,KAAKnK,GAAMkE,KAAKuwE,SAASz0E,EAAGytE,IAC9C,CAEA,YAAA6J,CAAal+B,GACTl/B,GAAO,EAAO,4CAA6C,wBAAyB,CAChFU,UAAW,kBAEnB,CACA,iBAAMwsD,CAAYz4D,GACd,aAAak9D,GAAYiC,SAAS5pE,KAAMyK,EAC5C,CACA,eAAM+9D,CAAU/9D,GACZ,MAAM4sC,QAAiBr3C,KAAKkjE,YAAYz4D,GACxC,OAAI4sC,QACaA,EAASmxB,YAEnB,IACX,CACA,iBAAMlxB,CAAY7sC,GACd,MAAM4sC,QAAiBr3C,KAAKkjE,YAAYz4D,GACxC,OAAI4sC,QACaA,EAAST,aAEnB,IACX,CACA,mBAAMy8B,CAAc/8B,GAEhB,MAAMxxC,EAAOylD,IADbjU,EAAUM,GAAWN,IACSn/B,UAAU,GAAG8E,cAAgB,iBAC3D,IACI,MAAM0tD,QAAgBhC,GAAY2B,cAActpE,MAC1CszE,EAAc,IAAIzL,GAAS8B,EAAS,CACtC,qDACD3pE,MACGq3C,QAAiBi8B,EAAYj8B,SAASvyC,GAC5C,GAAgB,MAAZuyC,GAAoBA,IAAarD,GACjC,OAAO,KAEX,MAAMu/B,EAAmB,IAAI1L,GAASxwB,EAAU,CAC5C,gDACDr3C,MACGyK,QAAa8oE,EAAiB9oE,KAAK3F,GAGzC,aADoB9E,KAAKs3C,YAAY7sC,KACvB6rC,EACH,KAEJ7rC,CACX,CACA,MAAOyJ,GAEH,GAAIoB,EAAQpB,EAAO,aAA+B,OAAhBA,EAAMJ,MACpC,OAAO,KAGX,GAAIwB,EAAQpB,EAAO,kBACf,OAAO,KAEX,MAAMA,CACV,CACA,OAAO,IACX,CACA,wBAAMs/D,CAAmBt2E,EAAMgkE,EAAW1kD,GACtC,MAAM4kD,EAAyB,MAAbF,EAAqBA,EAAY,EACnD,OAAiB,IAAbE,EACOphE,KAAK+/D,sBAAsB7iE,GAE/B,IAAIsX,SAAQF,MAAO1J,EAASk3D,KAC/B,IAAIxlD,EAAQ,KACZ,MAAMjC,EAAY,MAAOslD,IACrB,IACI,MAAMK,QAAgBhgE,KAAK+/D,sBAAsB7iE,GACjD,GAAe,MAAX8iE,GACIL,EAAcK,EAAQL,YAAc,GAAKyB,EAOzC,OANAx2D,EAAQo1D,QAEJ1jD,IACApa,aAAaoa,GACbA,EAAQ,MAKxB,CACA,MAAOpI,GACHpS,QAAQ6E,IAAI,MAAOuN,EACvB,CACAlU,KAAKuG,KAAK,QAAS8T,EACtB,EACc,MAAXmC,IACAF,EAAQje,YAAW,KACF,MAATie,IAGJA,EAAQ,KACRtc,KAAKI,IAAI,QAASia,GAClBynD,EAAOtsD,EAAU,UAAW,UAAW,CAAEgF,OAAQ,aAAa,GAC/DgC,IAEPnC,QAAera,KAAK6gE,iBAAiB,GAE7C,CACA,kBAAM4S,CAAa9V,GACf3nD,GAAO,EAAO,sBAAuB,kBAAmB,CACpDU,UAAW,gBAEnB,CAIA,aAAAk3D,CAAc8F,GACV,MAAMp3D,EAAQtc,MAAKyvE,GAAQ5rE,IAAI6vE,GAC1Bp3D,IAGDA,EAAMA,OACNpa,aAAaoa,EAAMA,OAEvBtc,MAAKyvE,GAAQ3nC,OAAO4rC,GACxB,CASA,WAAAhG,CAAYiG,EAAOn3D,GACA,MAAXA,IACAA,EAAU,GAEd,MAAMk3D,EAAU1zE,MAAKwvE,KACfvtD,EAAO,KACTjiB,MAAKyvE,GAAQ3nC,OAAO4rC,GACpBC,GAAO,EAEX,GAAI3zE,KAAK4zE,OACL5zE,MAAKyvE,GAAQpkE,IAAIqoE,EAAS,CAAEp3D,MAAO,KAAM2F,OAAMnT,KAAM0N,QAEpD,CACD,MAAMF,EAAQje,WAAW4jB,EAAMzF,GAC/Bxc,MAAKyvE,GAAQpkE,IAAIqoE,EAAS,CAAEp3D,QAAO2F,OAAMnT,KAAMwD,MACnD,CACA,OAAOohE,CACX,CAIA,kBAAAG,CAAmB5xD,GACf,IAAK,MAAMnZ,KAAO9I,MAAKgL,GAAM6J,SACzBoN,EAAKnZ,EAAIgrE,WAEjB,CAKA,cAAAC,CAAejrE,GACX,OAAQA,EAAIiL,MACR,IAAK,QACL,IAAK,QACL,IAAK,UACD,OAAO,IAAI26D,GAAoB5lE,EAAIiL,MACvC,IAAK,QAAS,CACV,MAAM+/D,EAAa,IAAIxG,GAAuBttE,MAE9C,OADA8zE,EAAWrG,gBAAkBztE,KAAKytE,gBAC3BqG,CACX,CACA,IAAK,OACL,IAAK,YACD,OAAO,IAAI3F,GAA0BnuE,KAAM8I,EAAIiL,MACnD,IAAK,QACD,OAAO,IAAIw6D,GAAuBvuE,KAAM8I,EAAIqR,QAChD,IAAK,cACD,OAAO,IAAIm0D,GAA6BtuE,KAAM8I,EAAI5L,MACtD,IAAK,SACD,OAAO,IAAImxE,GAAwBruE,KAAM8I,EAAIqR,QAErD,MAAM,IAAIhG,MAAM,sBAAsBrL,EAAIiL,OAC9C,CAUA,kBAAAigE,CAAmBC,EAAQC,GACvB,IAAK,MAAMprE,KAAO9I,MAAKgL,GAAM6J,SACzB,GAAI/L,EAAIgrE,aAAeG,EAAQ,CACvBnrE,EAAIu8D,SACJv8D,EAAIgrE,WAAWpwE,OAEnBoF,EAAIgrE,WAAaI,EACbprE,EAAIu8D,SACJ6O,EAAOp8D,QAEc,MAArB9X,MAAKmvE,IACL+E,EAAOrG,MAAM7tE,MAAKmvE,IAEtB,KACJ,CAER,CACA,QAAMpK,CAAQF,EAAOsP,GACjB,IAAIrrE,QAAY8lE,GAAgB/J,EAAO7kE,MAMvC,MAHiB,UAAb8I,EAAIiL,MAAoBogE,GAAYA,EAASv3E,OAAS,IAA6B,IAAxBu3E,EAAS,GAAGvU,UACvE92D,QAAY8lE,GAAgB,CAAErP,OAAQ,WAAY54D,IAAKwtE,EAAS,IAAMn0E,OAEnEA,MAAKgL,GAAMnH,IAAIiF,EAAIjJ,MAAQ,IACtC,CACA,QAAMmlE,CAAQH,GACV,MAAMuP,QAAqBxF,GAAgB/J,EAAO7kE,MAE5CH,EAAMu0E,EAAav0E,IACzB,IAAIiJ,EAAM9I,MAAKgL,GAAMnH,IAAIhE,GACzB,IAAKiJ,EAAK,CAINA,EAAM,CAAEgrE,WAHW9zE,KAAK+zE,eAAeK,GAGnBv0E,MAAKw0E,eAFF,IAAI51D,QAEc61D,QADzB,IAAInvD,IAC8BkgD,SAAS,EAAO1mD,UAAW,IAC7E3e,MAAKgL,GAAMK,IAAIxL,EAAKiJ,EACxB,CACA,OAAOA,CACX,CACA,QAAMtI,CAAGqkE,EAAOxqD,GACZ,MAAMvR,QAAY9I,MAAKglE,GAAQH,GAS/B,OARA/7D,EAAI6V,UAAUvgB,KAAK,CAAEic,WAAU9T,MAAM,IAChCuC,EAAIu8D,UACLv8D,EAAIgrE,WAAWh8D,QACfhP,EAAIu8D,SAAU,EACW,MAArBrlE,MAAKmvE,IACLrmE,EAAIgrE,WAAWjG,MAAM7tE,MAAKmvE,KAG3BnvE,IACX,CACA,UAAMuG,CAAKs+D,EAAOxqD,GACd,MAAMvR,QAAY9I,MAAKglE,GAAQH,GAS/B,OARA/7D,EAAI6V,UAAUvgB,KAAK,CAAEic,WAAU9T,MAAM,IAChCuC,EAAIu8D,UACLv8D,EAAIgrE,WAAWh8D,QACfhP,EAAIu8D,SAAU,EACW,MAArBrlE,MAAKmvE,IACLrmE,EAAIgrE,WAAWjG,MAAM7tE,MAAKmvE,KAG3BnvE,IACX,CACA,UAAMmlE,CAAKN,KAAU7/C,GACjB,MAAMlc,QAAY9I,MAAK+kE,GAAQF,EAAO7/C,GAGtC,IAAKlc,GAAgC,IAAzBA,EAAI6V,UAAU/hB,OACtB,OAAO,EAGX,MAAMuZ,EAAQrN,EAAI6V,UAAU/hB,OAe5B,OAdAkM,EAAI6V,UAAY7V,EAAI6V,UAAUxE,QAAO,EAAGE,WAAU9T,WAC9C,MAAMod,EAAU,IAAIzJ,EAAala,KAAOuG,EAAO,KAAO8T,EAAWwqD,GACjE,IACIxqD,EAASvc,KAAKkC,QAASglB,EAAMrB,EACjC,CACA,MAAOzP,GAAS,CAChB,OAAQ3N,CAAI,IAEa,IAAzBuC,EAAI6V,UAAU/hB,SACVkM,EAAIu8D,SACJv8D,EAAIgrE,WAAWpwE,OAEnB1D,MAAKgL,GAAM88B,OAAOh/B,EAAIjJ,MAElBsW,EAAQ,CACpB,CACA,mBAAM0wD,CAAchC,GAChB,GAAIA,EAAO,CACP,MAAM/7D,QAAY9I,MAAK+kE,GAAQF,GAC/B,OAAK/7D,EAGEA,EAAI6V,UAAU/hB,OAFV,CAGf,CACA,IAAIqkD,EAAQ,EACZ,IAAK,MAAMtiC,UAAEA,KAAe3e,MAAKgL,GAAM6J,SACnCosC,GAAStiC,EAAU/hB,OAEvB,OAAOqkD,CACX,CACA,eAAMtiC,CAAUkmD,GACZ,GAAIA,EAAO,CACP,MAAM/7D,QAAY9I,MAAK+kE,GAAQF,GAC/B,OAAK/7D,EAGEA,EAAI6V,UAAU1Y,KAAI,EAAGoU,cAAeA,IAFhC,EAGf,CACA,IAAIjF,EAAS,GACb,IAAK,MAAMuJ,UAAEA,KAAe3e,MAAKgL,GAAM6J,SACnCO,EAASA,EAAO1B,OAAOiL,EAAU1Y,KAAI,EAAGoU,cAAeA,KAE3D,OAAOjF,CACX,CACA,SAAMhV,CAAIykE,EAAOxqD,GACb,MAAMvR,QAAY9I,MAAK+kE,GAAQF,GAC/B,IAAK/7D,EACD,OAAO9I,KAEX,GAAIqa,EAAU,CACV,MAAMzI,EAAQ9I,EAAI6V,UAAU1Y,KAAI,EAAGoU,cAAeA,IAAUnc,QAAQmc,GAChEzI,GAAS,GACT9I,EAAI6V,UAAUhf,OAAOiS,EAAO,EAEpC,CAOA,OANKyI,GAAqC,IAAzBvR,EAAI6V,UAAU/hB,SACvBkM,EAAIu8D,SACJv8D,EAAIgrE,WAAWpwE,OAEnB1D,MAAKgL,GAAM88B,OAAOh/B,EAAIjJ,MAEnBG,IACX,CACA,wBAAM8mE,CAAmBjC,GACrB,GAAIA,EAAO,CACP,MAAMhlE,IAAEA,EAAGwlE,QAAEA,EAAOyO,WAAEA,SAAqB9zE,MAAKglE,GAAQH,GACpDQ,GACAyO,EAAWpwE,OAEf1D,MAAKgL,GAAM88B,OAAOjoC,EACtB,MAEI,IAAK,MAAOA,GAAKwlE,QAAEA,EAAOyO,WAAEA,MAAiB9zE,MAAKgL,GAC1Cq6D,GACAyO,EAAWpwE,OAEf1D,MAAKgL,GAAM88B,OAAOjoC,GAG1B,OAAOG,IACX,CAEA,iBAAMyc,CAAYooD,EAAOxqD,GACrB,aAAara,KAAKQ,GAAGqkE,EAAOxqD,EAChC,CAEA,oBAAMC,CAAeuqD,EAAOxqD,GACxB,OAAOra,KAAKI,IAAIykE,EAAOxqD,EAC3B,CAQA,aAAI8N,GACA,OAAOnoB,MAAKmoB,EAChB,CAOA,OAAAgD,GAEInrB,KAAK8mE,qBAEL,IAAK,MAAM4M,KAAW1zE,MAAKyvE,GAAQtxE,OAC/B6B,KAAK4tE,cAAc8F,GAEvB1zE,MAAKmoB,IAAa,CACtB,CAYA,UAAIyrD,GAAW,OAA6B,MAArB5zE,MAAKmvE,EAAuB,CACnD,UAAIyE,CAAO/F,KACDA,IAAU7tE,KAAK4zE,SAGjB5zE,KAAK4zE,OACL5zE,KAAK+tE,SAGL/tE,KAAK6tE,OAAM,GAEnB,CAMA,KAAAA,CAAMC,GAEF,GADA9tE,MAAKuvE,IAAoB,EACA,MAArBvvE,MAAKmvE,GAAsB,CAC3B,GAAInvE,MAAKmvE,MAAkBrB,EACvB,OAEJ93D,GAAO,EAAO,yCAA0C,wBAAyB,CAC7EU,UAAW,SAEnB,CACA1W,KAAK6zE,oBAAoBr3E,GAAMA,EAAEqxE,MAAMC,KACvC9tE,MAAKmvE,KAAiBrB,EACtB,IAAK,MAAMxxD,KAAStc,MAAKyvE,GAAQ56D,SAEzByH,EAAMA,OACNpa,aAAaoa,EAAMA,OAGvBA,EAAMxN,KAAOwD,KAAYgK,EAAMxN,IAEvC,CAIA,MAAAi/D,GACI,GAAyB,MAArB/tE,MAAKmvE,GAAT,CAGAnvE,KAAK6zE,oBAAoBr3E,GAAMA,EAAEuxE,WACjC/tE,MAAKmvE,GAAe,KACpB,IAAK,MAAM7yD,KAAStc,MAAKyvE,GAAQ56D,SAAU,CAEvC,IAAI2H,EAAUF,EAAMxN,KAChB0N,EAAU,IACVA,EAAU,GAGdF,EAAMxN,KAAOwD,KAEbjU,WAAWie,EAAM2F,KAAMzF,EAC3B,CAbA,CAcJ,EAEJ,SAAS01D,GAAa98D,EAAQ0C,GAC1B,IACI,MAAMJ,EAAQy6D,GAAY/8D,EAAQ0C,GAClC,GAAIJ,EACA,OAAOwD,GAAaxD,EAE5B,CACA,MAAOxD,GAAS,CAChB,OAAO,IACX,CACA,SAASi+D,GAAY/8D,EAAQ0C,GACzB,GAAe,OAAX1C,EACA,OAAO,KAEX,IACI,MAAM6B,EAAS2B,EAAUf,EAAUzC,EAAQ0C,EAAOA,EAAQ,KACpDlb,EAASgc,EAAUf,EAAUzC,EAAQ6B,EAAQA,EAAS,KAC5D,OAAOY,EAAUzC,EAAQ6B,EAAS,GAAIA,EAAS,GAAKra,EACxD,CACA,MAAOsX,GAAS,CAChB,OAAO,IACX,CACA,SAASqgE,GAAOzgE,GACZ,MAAMsB,EAASoE,EAAU1F,GACzB,GAAIsB,EAAOxY,OAAS,GAChB,MAAM,IAAIuX,MAAM,+BAEpB,MAAM84C,EAAS,IAAI/3C,WAAW,IAE9B,OADA+3C,EAAO5hD,IAAI+J,EAAQ,GAAKA,EAAOxY,QACxBqwD,CACX,CACA,SAASunB,GAAS1gE,GACd,GAAKA,EAAMlX,OAAS,IAAQ,EACxB,OAAOkX,EAEX,MAAMsB,EAAS,IAAIF,WAA0C,GAA/BxY,KAAK0qB,KAAKtT,EAAMlX,OAAS,KAEvD,OADAwY,EAAO/J,IAAIyI,GACJsB,CACX,CACA,MAAMrX,GAAQ,IAAImX,WAAW,IAE7B,SAASo9D,GAAY36D,GACjB,MAAMvC,EAAS,GACf,IAAIq/D,EAAY,EAEhB,IAAK,IAAIt3E,EAAI,EAAGA,EAAIwa,EAAM/a,OAAQO,IAC9BiY,EAAOhX,KAAKL,IACZ02E,GAAa,GAEjB,IAAK,IAAIt3E,EAAI,EAAGA,EAAIwa,EAAM/a,OAAQO,IAAK,CACnC,MAAMyB,EAAOwY,EAASO,EAAMxa,IAE5BiY,EAAOjY,GAAKo3E,GAAOE,GAEnBr/D,EAAOhX,KAAKm2E,GAAO31E,EAAKhC,SACxBwY,EAAOhX,KAAKo2E,GAAS51E,IACrB61E,GAAa,GAAmC,GAA9B/3E,KAAK0qB,KAAKxoB,EAAKhC,OAAS,GAC9C,CACA,OAAO8W,EAAO0B,EAClB,CACA,MAAM08D,GAAQ,qEC7yCd,SAAS4C,GAAcC,EAAQj+D,GAC3B,GAAIi+D,EAAO5W,SACP,OAAO4W,EAAO5W,SAElB/nD,GAAO,EAAO,mBAAoB,wBAAyB,CAAEU,aACjE,CACApC,eAAesgE,GAASD,EAAQ3oB,GAC5B,IAAI/mD,EAAMu4D,GAAYxR,GAItB,GAHc,MAAV/mD,EAAIlF,KACJkF,EAAIlF,GAAKq3C,GAAenyC,EAAIlF,GAAI40E,IAEpB,MAAZ1vE,EAAIwC,KAAc,CAClB,MAAMA,EAAOxC,EAAIwC,KACjBxC,EAAIwC,KAAO+M,QAAQhQ,IAAI,CACnBmwE,EAAO/9B,aACPQ,GAAe3vC,EAAMktE,KACtBte,MAAK,EAAE/f,EAAS7uC,MACfwO,EAAeqgC,EAAQr6B,gBAAkBxU,EAAKwU,cAAe,4BAA6B,UAAWxU,GAC9F6uC,IAEd,MAEGrxC,EAAIwC,KAAOktE,EAAO/9B,aAEtB,aAAariC,EAAkBtP,EACnC,CAOO,MAAM4vE,GAIT9W,SAIA,WAAAlgE,CAAYkgE,GACRppD,EAAiB3U,KAAM,CAAE+9D,SAAWA,GAAY,MACnD,CACD,cAAM+W,CAASnX,GACX,OAAO+W,GAAc10E,KAAM,uBAAuBwhE,0BAA0BxhE,KAAK42C,aAAc+mB,EAClG,CACD,kBAAMoX,CAAa/oB,GAEf,aADkB4oB,GAAS50E,KAAMgsD,EAEpC,CACD,yBAAM6X,CAAoB7X,GACtB,MAAM+R,EAAW2W,GAAc10E,KAAM,uBAC/BiF,QAAY2vE,GAAS50E,KAAMgsD,GAChB,MAAb/mD,EAAIknD,QACJlnD,EAAIknD,YAAcnsD,KAAK80E,SAAS,YAEhB,MAAhB7vE,EAAImnD,WACJnnD,EAAImnD,eAAiBpsD,KAAKkkE,YAAYj/D,IAG1C,MAAMskE,QAAiBvpE,KAAa,SAAEwpE,aACtC,GAAmB,MAAfvkE,EAAIiwC,QAAiB,CAErBj/B,EADgByC,EAAUzT,EAAIiwC,WACHq0B,EAAQr0B,QAAS,+BAAgC,aAAc8W,EAAG9W,QAChG,MAEGjwC,EAAIiwC,QAAUq0B,EAAQr0B,QAG1B,MAAM8/B,EAAkC,MAApB/vE,EAAIsnD,cAAoD,MAA5BtnD,EAAIqnD,qBAOpD,GANoB,MAAhBrnD,EAAIonD,UAAkC,IAAbpnD,EAAI8O,OAAcihE,EAGxB,IAAb/vE,EAAI8O,MAA2B,IAAb9O,EAAI8O,OAAeihE,GAC3C/+D,GAAe,EAAO,4EAA6E,KAAM+1C,GAHzG/1C,GAAe,EAAO,+CAAgD,KAAM+1C,GAK9D,IAAb/mD,EAAI8O,MAA0B,MAAZ9O,EAAI8O,MAAsC,MAApB9O,EAAIsnD,cAAoD,MAA5BtnD,EAAIqnD,qBAIxE,GAAiB,IAAbrnD,EAAI8O,MAA2B,IAAb9O,EAAI8O,KAAY,CAGvC,MAAM09D,QAAgB1T,EAASsT,aAC/Br7D,EAA2B,MAApBy7D,EAAQplB,SAAkB,oCAAqC,wBAAyB,CAC3F31C,UAAW,gBAGK,MAAhBzR,EAAIonD,WACJpnD,EAAIonD,SAAWolB,EAAQplB,SAE9B,KACI,CAED,MAAMolB,QAAgB1T,EAASsT,aAC/B,GAAgB,MAAZpsE,EAAI8O,KAEJ,GAA4B,MAAxB09D,EAAQllB,cAAwD,MAAhCklB,EAAQnlB,qBAIxC,GADArnD,EAAI8O,KAAO,EACS,MAAhB9O,EAAIonD,SAAkB,CAGtB,MAAMA,EAAWpnD,EAAIonD,gBACdpnD,EAAIonD,SACXpnD,EAAIsnD,aAAeF,EACnBpnD,EAAIqnD,qBAAuBD,CAC9B,MAG2B,MAApBpnD,EAAIsnD,eACJtnD,EAAIsnD,aAAeklB,EAAQllB,cAEC,MAA5BtnD,EAAIqnD,uBACJrnD,EAAIqnD,qBAAuBmlB,EAAQnlB,2BAIlB,MAApBmlB,EAAQplB,UAGbr2C,GAAQg/D,EAAY,oCAAqC,wBAAyB,CAC9Et+D,UAAW,wBAGK,MAAhBzR,EAAIonD,WACJpnD,EAAIonD,SAAWolB,EAAQplB,UAI3BpnD,EAAI8O,KAAO,GAIXiC,GAAO,EAAO,oCAAqC,wBAAyB,CACxEU,UAAW,2BAID,IAAbzR,EAAI8O,MAA2B,IAAb9O,EAAI8O,OAGH,MAApB9O,EAAIsnD,eACJtnD,EAAIsnD,aAAeklB,EAAQllB,cAEC,MAA5BtnD,EAAIqnD,uBACJrnD,EAAIqnD,qBAAuBmlB,EAAQnlB,sBAG9C,MAxEGrnD,EAAI8O,KAAO,EA2Ef,aAAaQ,EAAkBtP,EAClC,CACD,iBAAMi/D,CAAYlY,GACd,OAAO0oB,GAAc10E,KAAM,eAAekkE,kBAAkBlkE,KAAK+0E,aAAa/oB,GACjF,CACD,UAAMluD,CAAKkuD,GACP,OAAO0oB,GAAc10E,KAAM,QAAQlC,WAAWkC,KAAK+0E,aAAa/oB,GACnE,CACD,iBAAM1U,CAAY7sC,GACd,MAAMszD,EAAW2W,GAAc10E,KAAM,eACrC,aAAa+9D,EAASzmB,YAAY7sC,EACrC,CACD,qBAAMu5D,CAAgBhY,GAClB,MAAM+R,EAAW2W,GAAc10E,KAAM,mBAC/BiF,QAAYjF,KAAK6jE,oBAAoB7X,UACpC/mD,EAAIwC,KACX,MAAMwtE,EAAQ/oB,GAAYzkD,KAAKxC,GAC/B,aAAa84D,EAAS+U,2BAA2B9yE,KAAKk1E,gBAAgBD,GACzE,EAUE,MAAME,WAAmBN,GAI5Bv+B,QAKA,WAAAz4C,CAAYy4C,EAASynB,GACjBp0D,MAAMo0D,GACNppD,EAAiB3U,KAAM,CAAEs2C,WAC5B,CACD,gBAAMM,GAAe,OAAO52C,KAAKs2C,OAAU,CAC3C,OAAA0vB,CAAQjI,GACJ,OAAO,IAAIoX,GAAWn1E,KAAKs2C,QAASynB,EACvC,CACD,GAAAqX,CAAkBpgD,EAAQte,GACtBV,GAAO,EAAO,0BAA0Bgf,IAAU,wBAAyB,CAAEte,aAChF,CACD,qBAAMw+D,CAAgBlpB,GAClBhsD,MAAKo1E,GAAkB,eAAgB,kBAC1C,CACD,iBAAMC,CAAY5/D,GACdzV,MAAKo1E,GAAkB,WAAY,cACtC,CACD,mBAAME,CAAc5jB,EAAQ19C,EAAOF,GAC/B9T,MAAKo1E,GAAkB,aAAc,gBACxC,EC7ME,MAAMG,GACTxX,IACAyX,IACAjI,IACAU,IACA1E,IACAkM,IAMA,WAAA53E,CAAYkgE,GACR/9D,MAAK+9D,GAAYA,EACjB/9D,MAAKw1E,GAAmB,KACxBx1E,MAAKutE,GAAUvtE,MAAKZ,GAAMuuE,KAAK3tE,MAC/BA,MAAKiuE,IAAW,EAChBjuE,MAAKupE,GAAW,KAChBvpE,MAAKy1E,IAAS,CACjB,CAID,UAAAC,CAAW3X,GACP,MAAM,IAAI5pD,MAAM,gCACnB,CAID,YAAAwhE,CAAa5X,EAAU3oD,GACnB,MAAM,IAAIjB,MAAM,gCACnB,CAID,QAAAyhE,CAAS7X,GACL,MAAM,IAAI5pD,MAAM,gCACnB,CACD,QAAM/U,CAAMugE,GACR,IAEiC,MAAzB3/D,MAAKw1E,KACLx1E,MAAKw1E,GAAmBx1E,KAAK01E,WAAW11E,MAAK+9D,KAGjD,IAAI8X,EAAW,KACf,IACIA,QAAiB71E,MAAKw1E,EACzB,CACD,MAAOthE,GACH,IAAKoB,EAAQpB,EAAO,0BAAgD,kBAApBA,EAAMwC,UAClD,MAAMxC,CAEb,CAGD,GAAgB,MAAZ2hE,EAGA,OAFA71E,MAAKw1E,GAAmB,UACxBx1E,MAAK+9D,GAAUiW,mBAAmBh0E,KAAMA,KAAK41E,SAAS51E,MAAK+9D,KAG/D,MAAMwL,QAAgBvpE,MAAK+9D,GAAUyL,aAIrC,GAHKxpE,MAAKupE,KACNvpE,MAAKupE,GAAWA,GAEhBvpE,MAAKupE,GAASr0B,UAAYq0B,EAAQr0B,QAClC,MAAM,IAAI/gC,MAAM,iBAEpB,GAAInU,MAAKy1E,GACL,OAEJ,MAAMrgE,QAAepV,MAAK+9D,GAAUjxD,KAAK,uBAAwB,CAAC+oE,UAC5D71E,KAAK21E,aAAa31E,MAAK+9D,GAAW3oD,EAC3C,CACD,MAAOlB,GACHpS,QAAQ6E,IAAI,QAASuN,EACxB,CACDlU,MAAK+9D,GAAUx3D,KAAK,QAASvG,MAAKutE,GACrC,CACD,GAAAuI,GACI,MAAMN,EAAkBx1E,MAAKw1E,GACzBA,IACAx1E,MAAKw1E,GAAmB,KACxBA,EAAgBnf,MAAMwf,IACd71E,MAAK+9D,GAAU51C,WAGnBnoB,MAAK+9D,GAAUjxD,KAAK,sBAAuB,CAAC+oE,GAAU,IAGjE,CACD,KAAA/9D,GACQ9X,MAAKiuE,KAGTjuE,MAAKiuE,IAAW,EAChBjuE,MAAKZ,IAAO,GACf,CACD,IAAAsE,GACS1D,MAAKiuE,KAGVjuE,MAAKiuE,IAAW,EAChBjuE,MAAKy1E,IAAS,EACdz1E,MAAK81E,KACL91E,MAAK+9D,GAAU39D,IAAI,QAASJ,MAAKutE,IACpC,CACD,KAAAM,CAAMC,GACEA,GACA9tE,MAAK81E,KAET91E,MAAK+9D,GAAU39D,IAAI,QAASJ,MAAKutE,GACpC,CACD,MAAAQ,GAAW/tE,KAAK8X,OAAU,EAOvB,MAAMi+D,WAAgCR,GACzC1Q,IAKA,WAAAhnE,CAAYkgE,EAAU5jD,GA3I1B,IAActI,EA4INlI,MAAMo0D,GACN/9D,MAAK6kE,IA7IChzD,EA6IasI,EA5IhB3T,KAAK+E,MAAM/E,KAAKC,UAAUoL,IA6IhC,CACD,QAAA+jE,CAAS7X,GACL,OAAO,IAAIwQ,GAAuBxQ,EAAU/9D,MAAK6kE,GACpD,CACD,gBAAM6Q,CAAW3X,GAEb,aADuBA,EAASjxD,KAAK,gBAAiB,CAAC9M,MAAK6kE,IAE/D,CACD,kBAAM8Q,CAAa5X,EAAUiY,GACzB,IAAK,MAAM5gE,KAAU4gE,EACjBjY,EAASoH,KAAKnlE,MAAK6kE,GAAQ9G,EAASwS,SAASn7D,EAAQ2oD,EAAS4R,UAErE,EAOE,MAAMsG,WAAkCV,GAC3C,gBAAMG,CAAW3X,GACb,aAAaA,EAASjxD,KAAK,kCAAmC,GACjE,CACD,kBAAM6oE,CAAa5X,EAAUiY,GACzB,IAAK,MAAM5gE,KAAU4gE,EACjBjY,EAASoH,KAAK,UAAW/vD,EAEhC,ECnJL,MAAM8gE,GAAY,+CAA+Cn6E,MAAM,MAEvE,SAASo6E,GAASriE,GACd,GAAa,MAATA,GAAiBoiE,GAAUh4E,mBAA2B,EACtD,OAAO4V,EAGX,GAAkC,mBAAtBA,EAAgB,WACxB,OAAOA,EAEX,GAAIzM,MAAM4N,QAAQnB,GACd,OAAQA,EAAM7N,IAAIkwE,IAEtB,GAAuB,iBAAX,EACR,OAAO14E,OAAOU,KAAK2V,GAAOW,QAAO,CAACC,EAAOrP,KACrCqP,EAAMrP,GAAOyO,EAAMzO,GACZqP,IACR,CAAE,GAET,MAAM,IAAIP,MAAM,sBAAsBL,kBAC1C,CACA,SAAS6N,GAAMy0D,GACX,OAAO,IAAI5hE,SAAS5J,IAAcvM,WAAWuM,EAASwrE,EAAS,GACnE,CACA,SAASC,GAAaviE,GAClB,OAAIA,EACOA,EAAMmI,cAEVnI,CACX,CACA,SAASwiE,GAAWxiE,GAChB,OAAQA,GAA4C,iBAA3BA,EAAqB,eAClD,CACA,MAAMk7D,GAAiB,CACnBuH,SAAS,EACTC,cAAe,KACfC,eAAgB,GAChBC,aAAe,GAAK,GACpBC,cAAe,IACf1H,aAAc,IACdxB,gBAAiB,KAGd,MAAMmJ,WAAsB/B,GAC/Bv+B,QACA,WAAAz4C,CAAYkgE,EAAUznB,GAClB3sC,MAAMo0D,GAENppD,EAAiB3U,KAAM,CAAEs2C,QADzBA,EAAUM,GAAWN,IAEzB,CACA,OAAA0vB,CAAQjI,GACJ/nD,GAAO,EAAO,iCAAkC,wBAAyB,CACrEU,UAAW,kBAEnB,CACA,gBAAMkgC,GACF,OAAO52C,KAAKs2C,OAChB,CAEA,yBAAMutB,CAAoB7X,GACtB,aAAahsD,KAAK+0E,aAAa/oB,EACnC,CAGA,8BAAM6qB,CAAyBnF,GAC3B,MAAM1lB,EAAKmqB,GAASzE,GACdxb,EAAW,GAEjB,GAAIlK,EAAGvkD,KAAM,CACT,MAAMqvE,EAAQ9qB,EAAGvkD,KACjByuD,EAAS93D,KAAK,WACV,MAAMqJ,QAAa2vC,GAAe0/B,EAAO92E,KAAK+9D,UAC9C9nD,EAAuB,MAARxO,GAAgBA,EAAKwU,gBAAkBjc,KAAKs2C,QAAQr6B,cAAe,wBAAyB,cAAey1D,GAC1H1lB,EAAGvkD,KAAOA,CACb,EAJa,GAKlB,MAEIukD,EAAGvkD,KAAOzH,KAAKs2C,QAWnB,GANmB,MAAf0V,EAAGI,UACH8J,EAAS93D,KAAK,WACV4tD,EAAGI,eAAiBpsD,KAAK+9D,SAASmG,YAAY,IAAKlY,EAAIvkD,KAAMzH,KAAKs2C,SACrE,EAFa,IAKL,MAAT0V,EAAGjsD,GAAY,CACf,MAAMg3E,EAAM/qB,EAAGjsD,GACfm2D,EAAS93D,KAAK,WACV4tD,EAAGjsD,SAAWq3C,GAAe2/B,EAAK/2E,KAAK+9D,SAC1C,EAFa,GAGlB,CAEI7H,EAASt5D,cACH4X,QAAQhQ,IAAI0xD,GAEtB,MAAM8gB,EAAQh3E,KAAK+9D,SAASkZ,kBAAkBjrB,GAC9C,OAAOhsD,KAAK+9D,SAASjxD,KAAK,sBAAuB,CAACkqE,GACtD,CACA,qBAAMhT,CAAgBhY,GAElB,MAAM2T,QAAoB3/D,KAAK+9D,SAAS8C,iBAElC3jE,QAAa8C,KAAK62E,yBAAyB7qB,GAIjD,iBAAkBx3C,SAAQ,CAAC5J,EAASk3D,KAChC,MAAMoV,EAAW,CAAC,IAAM,KACxB,IAAIC,EAAW,EACf,MAAMC,EAAU9iE,UACZ,IAEI,MAAM03C,QAAWhsD,KAAK+9D,SAASmB,eAAehiE,GAC9C,GAAU,MAAN8uD,EAEA,YADAphD,EAAQohD,EAAG2V,uBAAuBhC,GAG1C,CACA,MAAOzrD,GAKH,GAAIoB,EAAQpB,EAAO,cAAgBoB,EAAQpB,EAAO,aAC9CoB,EAAQpB,EAAO,kBAAoBoB,EAAQpB,EAAO,yBAMlD,OALkB,MAAdA,EAAMwB,OACNxB,EAAMwB,KAAO,IAEjBxB,EAAMwB,KAAK2hE,oBAAsBn6E,OACjC4kE,EAAO5tD,GAIX,GAAIoB,EAAQpB,EAAO,sBACfijE,IACkB,MAAdjjE,EAAMwB,OACNxB,EAAMwB,KAAO,IAEjBxB,EAAMwB,KAAK2hE,oBAAsBn6E,EAC7Bi6E,EAAW,IAEX,YADArV,EAAO5tD,GAMflU,KAAK+9D,SAASoH,KAAK,QAAS3vD,EAAU,4DAA6D,gBAAiB,CAAEtB,UAC1H,CAEAlU,KAAK+9D,SAAS2P,aAAY,KAAQ0J,GAAS,GAAKF,EAASjyE,OAAS,IAAK,EAE3EmyE,GAAS,GAEjB,CACA,qBAAMlC,CAAgBxD,GAClB,MAAM1lB,EAAKmqB,GAASzE,GAEpB,GAAI1lB,EAAGvkD,KAAM,CACT,MAAMA,QAAa2vC,GAAe4U,EAAGvkD,KAAMzH,KAAK+9D,UAChD9nD,EAAuB,MAARxO,GAAgBA,EAAKwU,gBAAkBjc,KAAKs2C,QAAQr6B,cAAe,wBAAyB,cAAey1D,GAC1H1lB,EAAGvkD,KAAOA,CACd,MAEIukD,EAAGvkD,KAAOzH,KAAKs2C,QAEnB,MAAM0gC,EAAQh3E,KAAK+9D,SAASkZ,kBAAkBjrB,GAC9C,aAAahsD,KAAK+9D,SAASjxD,KAAK,sBAAuB,CAACkqE,GAC5D,CACA,iBAAM3B,CAAYiC,GACd,MAAM7hE,EAAkC,iBAAtB,EAAkCqF,EAAYw8D,GAAYA,EAC5E,aAAat3E,KAAK+9D,SAASjxD,KAAK,gBAAiB,CAC7C2K,EAAQhC,GAAUzV,KAAKs2C,QAAQr6B,eAEvC,CACA,mBAAMq5D,CAAc5jB,EAAQ19C,EAAOwE,GAC/B,MAAM1E,EAAQqiE,GAAS39D,GAEjB++D,QAAkBpnB,GAAiB0B,aAAaH,EAAQ19C,EAAOF,GAAOQ,MAAOR,IAC/E,MAAMwiC,QAAgBc,GAAetjC,GAErC,OADAmC,EAA0B,MAAXqgC,EAAiB,0CAA2C,QAASxiC,GAC7EwiC,CAAO,IAElB,aAAat2C,KAAK+9D,SAASjxD,KAAK,uBAAwB,CACpD9M,KAAKs2C,QAAQr6B,cACbzV,KAAKC,UAAU0pD,GAAiB4B,WAAWwlB,EAAU7lB,OAAQ19C,EAAOujE,EAAUzjE,SAEtF,CACA,YAAM0jE,CAAOp3D,GACT,OAAOpgB,KAAK+9D,SAASjxD,KAAK,yBAA0B,CAChD9M,KAAKs2C,QAAQr6B,cAAemE,EAAU,MAE9C,CAEA,wBAAMq3D,CAAmBH,GACrB,MAAM7hE,EAAkC,iBAAtB,EAAkCqF,EAAYw8D,GAAYA,EAC5E,aAAat3E,KAAK+9D,SAASjxD,KAAK,WAAY,CACxC9M,KAAKs2C,QAAQr6B,cAAexE,EAAQhC,IAE5C,EAYG,MAAMiiE,WAA2BxI,GACpCrzD,GAEA87D,IAEAC,IACAC,IACAC,IACAvO,IACAwO,IACA,GAAAC,GACI,GAAIh4E,MAAK63E,GACL,OAGJ,MAAMI,EAAkD,IAArCj4E,KAAKk4E,WAAW,iBAA0B,EAAIl4E,KAAKk4E,WAAW,kBACjFl4E,MAAK63E,GAAcx5E,YAAW,KAC1B2B,MAAK63E,GAAc,KACnB,MAAMD,EAAW53E,MAAK43E,GAEtB,IADA53E,MAAK43E,GAAY,GACVA,EAASh7E,QAAQ,CAEpB,MAAMgQ,EAAQ,CAAEgrE,EAAS3uD,SACzB,KAAO2uD,EAASh7E,QACRgQ,EAAMhQ,SAAWoD,MAAK6b,EAAS86D,eADf,CAIpB/pE,EAAMxO,KAAMw5E,EAAS3uD,SAErB,GADcziB,KAAKC,UAAUmG,EAAM3G,KAAKnK,GAAMA,EAAE6nB,WACtC/mB,OAASoD,MAAK6b,EAAS66D,aAAc,CAC3CkB,EAASp0D,QAAS5W,EAAM3H,OACxB,KACJ,CACJ,CAEA,WACI,MAAM0e,EAA6B,IAAjB/W,EAAMhQ,OAAgBgQ,EAAM,GAAG+W,QAAU/W,EAAM3G,KAAKnK,GAAMA,EAAE6nB,UAC9E3jB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,iBAAkBp1C,YAC/C,IACI,MAAMvO,QAAepV,KAAKm4E,MAAMx0D,GAChC3jB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,mBAAoB3jD,WAEjD,IAAK,MAAMxK,QAAEA,EAAOk3D,OAAEA,EAAMn+C,QAAEA,KAAa/W,EAAO,CAC9C,GAAI5M,KAAKmoB,UAAW,CAChB25C,EAAOtsD,EAAU,wCAAyC,wBAAyB,CAAEkB,UAAWiN,EAAQ5M,UACxG,QACJ,CAEA,MAAMiG,EAAO5H,EAAO+E,QAAQza,GAAOA,EAAE6B,KAAOoiB,EAAQpiB,KAAK,GAEzD,GAAY,MAARyb,EASA,UAAWA,EACX8kD,EAAO9hE,KAAKo4E,YAAYz0D,EAAS3G,IAIrCpS,EAAQoS,EAAK5H,YAdb,CACI,MAAMlB,EAAQsB,EAAU,+BAAgC,WAAY,CAChE1B,MAAOsB,EAAQM,KAAM,CAAEiO,aAE3B3jB,KAAKmlE,KAAK,QAASjxD,GACnB4tD,EAAO5tD,EAEX,CAQJ,CACJ,CACA,MAAOA,GACHlU,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,kBAAmB7kD,UAChD,IAAK,MAAM4tD,OAAEA,KAAYl1D,EAErBk1D,EAAO5tD,EAEf,CACH,EAvCD,EAwCJ,IACD+jE,EACP,CACA,WAAAp6E,CAAY0rE,EAAS1tD,GACjBlS,MAAM4/D,EAAS1tD,GACf7b,MAAK23E,GAAU,EACf33E,MAAK6b,EAAWpe,OAAOsY,OAAO,CAAE,EAAEi5D,GAAgBnzD,GAAW,CAAA,GAC7D7b,MAAK43E,GAAY,GACjB53E,MAAK63E,GAAc,KACnB73E,MAAKupE,GAAW,KAChBvpE,MAAK+3E,GAAwB,KAC7B,CACI,IAAIntE,EAAU,KACd,MAAMusC,EAAU,IAAI3iC,SAAS6jE,IACzBztE,EAAUytE,CAAQ,IAEtBr4E,MAAK83E,GAAY,CAAE3gC,UAASvsC,UAChC,CACA,MAAM4rE,EAAgBx2E,KAAKk4E,WAAW,iBACP,kBAAnB,GACRjiE,GAAgBugE,GAA6B,QAAZjN,EAAmB,wDAAyD,UAAW1tD,GACpH26D,GAA4B,MAAXjN,IACjBvpE,MAAKupE,GAAWuC,GAAQrkE,KAAK8hE,KAG5BiN,IAELvgE,EAA0B,MAAXszD,GAAmBiN,EAAczK,QAAQxC,GAAU,0CAA2C,UAAW1tD,GACxH7b,MAAKupE,GAAWiN,EAExB,CAMA,UAAA0B,CAAW7yE,GACP,OAAOrF,MAAK6b,EAASxW,EACzB,CAKA,YAAIsqE,GAEA,OADA35D,EAAOhW,MAAKupE,GAAU,+BAAgC,iBAC/CvpE,MAAKupE,EAChB,CAOA,cAAMsG,CAASt0E,GAGX,GAAmB,SAAfA,EAAIwb,QAAoC,gBAAfxb,EAAIwb,OAA0B,CACvD,IAAIi1C,EAAKzwD,EAAI29D,YACb,GAAIlN,GAAiB,MAAXA,EAAGj4C,MAAgB2E,EAAUszC,EAAGj4C,OAEf,MAAnBi4C,EAAGO,cAAmD,MAA3BP,EAAGM,qBAA8B,CAC5D,MAAMmlB,QAAgBzxE,KAAKqxE,aACC,MAAxBI,EAAQllB,cAAwD,MAAhCklB,EAAQnlB,uBAExC/wD,EAAMkC,OAAOsY,OAAO,CAAA,EAAIxa,EAAK,CACzB29D,YAAaz7D,OAAOsY,OAAO,CAAA,EAAIi2C,EAAI,CAAEj4C,UAAM+I,MAGvD,CAER,CACA,MAAM8B,EAAU5e,KAAKs4E,cAAc/8E,GACnC,OAAe,MAAXqjB,QACa5e,KAAK8M,KAAK8R,EAAQ7H,OAAQ6H,EAAQoG,MAE5Crb,MAAMkmE,SAASt0E,EAC1B,CAQA,oBAAMq1E,GACF,MAAMrH,EAAUvpE,KAAKk4E,WAAW,iBAChC,GAAI3O,EAAS,CACT,IAAgB,IAAZA,EAMA,OAAOA,EALP,GAAIvpE,MAAKupE,GACL,OAAOvpE,MAAKupE,EAMxB,CACA,OAAIvpE,MAAK+3E,SACQ/3E,MAAK+3E,GAGlB/3E,KAAKu4E,OACLv4E,MAAK+3E,GAAwB,WACzB,IACI,MAAM3iE,EAAS02D,GAAQrkE,KAAKiR,QAAgB1Y,KAAK8M,KAAK,cAAe,MAErE,OADA9M,MAAK+3E,GAAwB,KACtB3iE,CACX,CACA,MAAOlB,GAEH,MADAlU,MAAK+3E,GAAwB,KACvB7jE,CACV,CACH,EAV4B,SAWhBlU,MAAK+3E,KAGtB/3E,MAAK+3E,GAAwB,WACzB,MAAMp0D,EAAU,CACZpiB,GAAIvB,MAAK23E,KAAW5gE,OAAQ,cAAe4J,OAAQ,GAAI63D,QAAS,OAGpE,IAAIpjE,EADJpV,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,iBAAkBp1C,YAE/C,IACIvO,SAAgBpV,KAAKm4E,MAAMx0D,IAAU,GACrC3jB,MAAK+3E,GAAwB,IACjC,CACA,MAAO7jE,GAGH,MAFAlU,MAAK+3E,GAAwB,KAC7B/3E,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,kBAAmB7kD,UAC1CA,CACV,CAEA,GADAlU,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,mBAAoB3jD,WAC7C,WAAYA,EACZ,OAAO02D,GAAQrkE,KAAKiR,EAAUtD,EAAOA,SAEzC,MAAMpV,KAAKo4E,YAAYz0D,EAASvO,EACnC,EApB4B,SAqBhBpV,MAAK+3E,GACtB,CAQA,MAAAU,GAC0B,MAAlBz4E,MAAK83E,IAA+C,MAA1B93E,MAAK83E,GAAUltE,UAG7C5K,MAAK83E,GAAUltE,UACf5K,MAAK83E,GAAY,KACjB,WAEI,KAAwB,MAAjB93E,MAAKupE,KAAqBvpE,KAAKmoB,WAClC,IACInoB,MAAKupE,SAAiBvpE,KAAK4wE,gBAC/B,CACA,MAAO18D,GACH,GAAIlU,KAAKmoB,UACL,MAEJrmB,QAAQ6E,IAAI,mIACZ3G,KAAKmlE,KAAK,QAAS3vD,EAAU,wCAAyC,gBAAiB,CAAEqvD,MAAO,4BAA6BnvD,KAAM,CAAExB,kBAC/HyN,GAAM,IAChB,CAGJ3hB,MAAKg4E,IACR,EAjBD,GAkBJ,CAMA,qBAAMU,GACF,GAAsB,MAAlB14E,MAAK83E,GAGT,aAAa93E,MAAK83E,GAAU3gC,OAChC,CAOA,cAAA48B,CAAejrE,GAEX,MAAiB,YAAbA,EAAIiL,KACG,IAAIkiE,GAA0Bj2E,MAExB,UAAb8I,EAAIiL,KACA/T,KAAKk4E,WAAW,WACT,IAAI3J,GAAuBvuE,KAAM8I,EAAIqR,QAEzC,IAAI47D,GAAwB/1E,KAAM8I,EAAIqR,QAIhC,WAAbrR,EAAIiL,MAA2C,aAAtBjL,EAAIqR,OAAOolD,OAC7B,IAAImP,GAAoB,UAE5B/kE,MAAMoqE,eAAejrE,EAChC,CAIA,SAAIyvE,GAAU,OAAyB,MAAlBv4E,MAAK83E,EAAmB,CAM7C,iBAAAb,CAAkBjrB,GACd,MAAM52C,EAAS,CAAA,EA+Bf,MA7BA,CAAC,UAAW,WAAY,WAAY,OAAQ,eAAgB,uBAAwB,QAAS,SAAS9N,SAASjC,IAC3G,GAAe,MAAX2mD,EAAG3mD,GACH,OAEJ,IAAIszE,EAAStzE,EACD,aAARA,IACAszE,EAAS,OAEbvjE,EAAOujE,GAAUj/D,EAAWhB,EAAUszC,EAAG3mD,GAAM,MAAMA,KAAO,IAGhE,CAAC,OAAQ,KAAM,QAAQiC,SAASjC,IACb,MAAX2mD,EAAG3mD,KAGP+P,EAAO/P,GAAOoS,EAAQu0C,EAAG3mD,IAAK,IAG9B2mD,EAAGQ,aACHp3C,EAAmB,WAAI01C,GAAckB,EAAGQ,aAExCR,EAAGU,sBAEHt3C,EAA4B,oBAAI42C,EAAGU,oBAAoBzmD,KAAIiH,GAAKA,EAAE+O,iBAM/D7G,CACX,CAKA,aAAAkjE,CAAc/8E,GACV,OAAQA,EAAIwb,QACR,IAAK,UACD,MAAO,CAAEA,OAAQ,cAAeiO,KAAM,IAC1C,IAAK,iBACD,MAAO,CAAEjO,OAAQ,kBAAmBiO,KAAM,IAC9C,IAAK,cACD,MAAO,CAAEjO,OAAQ,eAAgBiO,KAAM,IAC3C,IAAK,iBACD,MAAO,CAAEjO,OAAQ,2BAA4BiO,KAAM,IACvD,IAAK,aACD,MAAO,CACHjO,OAAQ,iBACRiO,KAAM,CAACqxD,GAAa96E,EAAI+6C,SAAU/6C,EAAIoiE,WAE9C,IAAK,sBACD,MAAO,CACH5mD,OAAQ,0BACRiO,KAAM,CAACqxD,GAAa96E,EAAI+6C,SAAU/6C,EAAIoiE,WAE9C,IAAK,UACD,MAAO,CACH5mD,OAAQ,cACRiO,KAAM,CAACqxD,GAAa96E,EAAI+6C,SAAU/6C,EAAIoiE,WAE9C,IAAK,aACD,MAAO,CACH5mD,OAAQ,mBACRiO,KAAM,CACFqxD,GAAa96E,EAAI+6C,SAChB,KAAO/6C,EAAIs3E,SAAS72E,SAAS,IAC9BT,EAAIoiE,WAGhB,IAAK,uBACD,MAAO,CACH5mD,OAAQ,yBACRiO,KAAM,CAACzpB,EAAIy3E,oBAEnB,IAAK,WACD,GAAI,aAAcz3E,EACd,MAAO,CACHwb,OAAQ,uBACRiO,KAAM,CAACzpB,EAAIoiE,WAAYpiE,EAAI03E,sBAG9B,GAAI,cAAe13E,EACpB,MAAO,CACHwb,OAAQ,qBACRiO,KAAM,CAACzpB,EAAImkE,YAAankE,EAAI03E,sBAGpC,MACJ,IAAK,iBACD,MAAO,CACHl8D,OAAQ,2BACRiO,KAAM,CAACzpB,EAAI2B,OAEnB,IAAK,wBACD,MAAO,CACH6Z,OAAQ,4BACRiO,KAAM,CAACzpB,EAAI2B,OAEnB,IAAK,OACD,MAAO,CACH6Z,OAAQ,WACRiO,KAAM,CAAChlB,KAAKi3E,kBAAkB17E,EAAI29D,aAAc39D,EAAIoiE,WAE5D,IAAK,cACD,MAAO,CACH5mD,OAAQ,kBACRiO,KAAM,CAAChlB,KAAKi3E,kBAAkB17E,EAAI29D,eAG1C,IAAK,UASD,OARI39D,EAAI4e,QAAgC,MAAtB5e,EAAI4e,OAAOm8B,UACrBjvC,MAAM4N,QAAQ1Z,EAAI4e,OAAOm8B,SACzB/6C,EAAI4e,OAAOm8B,QAAU/6C,EAAI4e,OAAOm8B,QAAQrwC,IAAIowE,IAG5C96E,EAAI4e,OAAOm8B,QAAU+/B,GAAa96E,EAAI4e,OAAOm8B,UAG9C,CAAEv/B,OAAQ,cAAeiO,KAAM,CAACzpB,EAAI4e,SAEnD,OAAO,IACX,CAOA,WAAAi+D,CAAYz0D,EAASzG,GACjB,MAAMnG,OAAEA,GAAW4M,GACbzP,MAAEA,GAAUgJ,EAClB,GAAe,oBAAXnG,GAAgC7C,EAAMuB,QAAS,CAC/C,MAAM3S,EAAMoR,EAAMuB,QAClB,IAAK3S,EAAIjG,MAAM,YAAciG,EAAIjG,MAAM,uBACnC,OAAO2Y,EAAU,qBAAsB,qBAAsB,CACzD0jD,YAAcv1C,EAAQhD,OAAO,GAC7BjL,KAAM,CAAEiO,UAASzP,UAG7B,CACA,GAAe,aAAX6C,GAAoC,oBAAXA,EAA8B,CACvD,MAAM3B,EAASwjE,GAAY1kE,GACrBvV,EAAI85D,GAASK,wBAAoC,aAAX/hD,EAAyB,OAAS,cAAgB4M,EAAQhD,OAAO,GAAMvL,EAASA,EAAOxW,KAAO,MAE1I,OADAD,EAAE+W,KAAO,CAAExB,QAAOyP,WACXhlB,CACX,CAGA,MAAM8W,EAAUjP,KAAKC,UA+Q7B,SAAwBqN,GACpB,MAAMsB,EAAS,GAEf,OADAyjE,GAAgB/kE,EAAOsB,GAChBA,CACX,CAnRuC0jE,CAAe5kE,IAC9C,GAA+B,iBAAnBA,EAAa,SAAkBA,EAAMuB,QAAQ5Y,MAAM,mCAAoC,CAU/F,OAAO2Y,EAAU,uBAAwB,kBAAmB,CACxDujD,OAVc,CACdggB,SAAU,cACVC,cAAe,cACfC,qBAAsB,gBACtBC,oBAAqB,kBACrBC,oBAAqB,kBACrBC,oBAAqB,gBACrBC,uBAAwB,iBAGLtiE,IAAW,UAC9ByD,OAAQ,WACR9E,KAAM,CAAEiO,UAASzP,UAEzB,CACA,GAAe,2BAAX6C,GAAkD,wBAAXA,EAAkC,CACzE,MAAMmiD,EAAev1C,EAAQhD,OAAO,GACpC,GAAIlL,EAAQ5Y,MAAM,kDACd,OAAO2Y,EAAU,oDAAqD,qBAAsB,CACxF0jD,cAAaxjD,KAAM,CAAExB,WAG7B,GAAIuB,EAAQ5Y,MAAM,WAAa4Y,EAAQ5Y,MAAM,YACzC,OAAO2Y,EAAU,8BAA+B,gBAAiB,CAAE0jD,cAAaxjD,KAAM,CAAExB,WAG5F,GAAIuB,EAAQ5Y,MAAM,6BAA+B4Y,EAAQ5Y,MAAM,gBAC3D,OAAO2Y,EAAU,0BAA2B,0BAA2B,CAAE0jD,cAAaxjD,KAAM,CAAExB,WAElG,GAAIuB,EAAQ5Y,MAAM,0BACd,OAAO2Y,EAAU,gDAAiD,wBAAyB,CACvFkB,UAAWK,EAAQrB,KAAM,CAAEwjD,cAAaxjD,KAAM,CAAExB,WAG5D,CACA,IAAIolE,IAAgB7jE,EAAQ5Y,MAAM,iCAMlC,OALKy8E,GACGplE,GAASA,EAAM0B,SAAW1B,EAAM0B,QAAQ+D,WAAW,0BACnD2/D,GAAc,GAGlBA,EACO9jE,EAAU,wBAAyB,wBAAyB,CAC/DkB,UAAWiN,EAAQ5M,OAAQrB,KAAM,CAAExB,QAAOyP,aAG3CnO,EAAU,2BAA4B,gBAAiB,CAAEtB,QAAOyP,WAC3E,CAcA,IAAA7W,CAAKiK,EAAQ4J,GAGT,GAAI3gB,KAAKmoB,UACL,OAAO3T,QAAQstD,OAAOtsD,EAAU,wCAAyC,wBAAyB,CAAEkB,UAAWK,KAEnH,MAAMxV,EAAKvB,MAAK23E,KACVxgC,EAAU,IAAI3iC,SAAQ,CAAC5J,EAASk3D,KAClC9hE,MAAK43E,GAAUx5E,KAAK,CAChBwM,UAASk3D,SACTn+C,QAAS,CAAE5M,SAAQ4J,SAAQpf,KAAIi3E,QAAS,QAC1C,IAIN,OADAx4E,MAAKg4E,KACE7gC,CACX,CAaA,eAAMoiC,CAAUjjC,GACG,MAAXA,IACAA,EAAU,GAEd,MAAMkjC,EAAkBx5E,KAAK8M,KAAK,eAAgB,IAElD,GAAyB,iBAAb,EAAuB,CAC/B,MAAM2sE,QAAkBD,EACxB,GAAIljC,GAAWmjC,EAAS78E,OACpB,MAAM,IAAIuX,MAAM,mBAEpB,OAAO,IAAIyiE,GAAc52E,KAAMy5E,EAASnjC,GAC5C,CACA,MAAMmjC,SAAEA,SAAmBllE,EAAkB,CACzCg1D,QAASvpE,KAAKwpE,aACdiQ,SAAUD,IAGdljC,EAAUM,GAAWN,GACrB,IAAK,MAAMojC,KAAWD,EAClB,GAAI7iC,GAAW8iC,KAAapjC,EACxB,OAAO,IAAIsgC,GAAc52E,KAAMs2C,GAGvC,MAAM,IAAIniC,MAAM,kBACpB,CACA,kBAAMwlE,GAEF,aADuB35E,KAAK8M,KAAK,eAAgB,KACjC7G,KAAK+D,GAAM,IAAI4sE,GAAc52E,KAAMgK,IACvD,CACA,OAAAmhB,GAEQnrB,MAAK63E,KACL31E,aAAalC,MAAK63E,IAClB73E,MAAK63E,GAAc,MAGvB,IAAK,MAAMl0D,QAAEA,EAAOm+C,OAAEA,KAAY9hE,MAAK43E,GACnC9V,EAAOtsD,EAAU,wCAAyC,wBAAyB,CAAEkB,UAAWiN,EAAQ5M,UAE5G/W,MAAK43E,GAAY,GAEjBjuE,MAAMwhB,SACV,EAQG,MAAMyuD,WAAkClC,GAC3CjK,IACA,WAAA5vE,CAAY0rE,EAAS1tD,GACjBlS,MAAM4/D,EAAS1tD,GACf,IAAI4xD,EAAkBztE,KAAKk4E,WAAW,mBACf,MAAnBzK,IACAA,EAAkBuB,GAAevB,iBAErCztE,MAAKytE,GAAmBA,CAC5B,CACA,cAAAsG,CAAejrE,GACX,MAAMgrE,EAAanqE,MAAMoqE,eAAejrE,GAIxC,OAHIwtE,GAAWxC,KACXA,EAAWrG,gBAAkBztE,MAAKytE,IAE/BqG,CACX,CAIA,mBAAIrG,GAAoB,OAAOztE,MAAKytE,EAAkB,CACtD,mBAAIA,CAAgB35D,GAChB,IAAKqF,OAAOC,UAAUtF,IAAUA,EAAQ,EACpC,MAAM,IAAIK,MAAM,oBAEpBnU,MAAKytE,GAAmB35D,EACxB9T,KAAK6zE,oBAAoB/qE,IACjBwtE,GAAWxtE,KACXA,EAAI2kE,gBAAkBztE,MAAKytE,GAC/B,GAER,EAUG,MAAMoM,WAAwBD,GACjC5T,IACA,WAAAnoE,CAAY0J,EAAKgiE,EAAS1tD,GACX,MAAPtU,IACAA,EAAM,yBAEVoC,MAAM4/D,EAAS1tD,GAEX7b,MAAKgmE,GADY,iBAAT,EACQ,IAAI7nD,GAAa5W,GAGjBA,EAAI2Z,OAE5B,CACA,cAAA44D,GACI,OAAO95E,MAAKgmE,GAAS9kD,OACzB,CACA,UAAMpU,CAAKiK,EAAQ4J,GAKf,aADM3gB,KAAKy4E,eACE9uE,MAAMmD,KAAKiK,EAAQ4J,EACpC,CACA,WAAMw3D,CAAMx0D,GAER,MAAM/E,EAAU5e,KAAK85E,iBACrBl7D,EAAQ/B,KAAOrW,KAAKC,UAAUkd,GAC9B/E,EAAQiB,UAAU,eAAgB,oBAClC,MAAMuB,QAAiBxC,EAAQ9R,OAC/BsU,EAASC,WACT,IAAIrE,EAAOoE,EAASoB,SAIpB,OAHKnb,MAAM4N,QAAQ+H,KACfA,EAAO,CAACA,IAELA,CACX,EAEJ,SAAS47D,GAAY9kE,GACjB,GAAa,MAATA,EACA,OAAO,KAGX,GAA+B,iBAAnBA,EAAa,SAAkBA,EAAM2B,QAAQ5Y,MAAM,YAAcya,EAAYxD,EAAMlV,MAC3F,MAAO,CAAE6W,QAAS3B,EAAM2B,QAAS7W,KAAMkV,EAAMlV,MAGjD,GAAuB,iBAAX,EAAqB,CAC7B,IAAK,MAAMyG,KAAOyO,EAAO,CACrB,MAAMsB,EAASwjE,GAAY9kE,EAAMzO,IACjC,GAAI+P,EACA,OAAOA,CAEf,CACA,OAAO,IACX,CAEA,GAAuB,iBAAX,EACR,IACI,OAAOwjE,GAAYpyE,KAAK+E,MAAMuI,GAClC,CACA,MAAOI,GAAS,CAEpB,OAAO,IACX,CACA,SAAS2kE,GAAgB/kE,EAAOsB,GAC5B,GAAa,MAATtB,EAAJ,CAQA,GAJ+B,iBAAnBA,EAAa,SACrBsB,EAAOhX,KAAK0V,EAAM2B,SAGC,iBAAX,EACR,IAAK,MAAMpQ,KAAOyO,EACd+kE,GAAgB/kE,EAAMzO,GAAM+P,GAIpC,GAAuB,iBAAX,EACR,IACI,OAAOyjE,GAAgBryE,KAAK+E,MAAMuI,GAAQsB,EAC9C,CACA,MAAOlB,GAAS,CAhBpB,CAkBJ,CC36BO,MAAM6lE,WAAwBH,GACjCh7D,GAKA,WAAA/gB,CAAYm8E,EAAUzQ,EAAS0Q,GAE3B,MAAMp+D,EAAUpe,OAAOsY,OAAO,CAAA,EAAkB,MAAZkkE,EAAoBA,EAAW,CAAA,EAAK,CAAEtD,cAAe,IACzF1gE,EAAe+jE,GAAYA,EAASp7D,QAAS,4BAA6B,WAAYo7D,GACtFrwE,MAAM4/D,EAAS1tD,GACf7b,MAAK4e,EAAWtK,MAAOyC,EAAQ4J,KAC3B,MAAMgD,EAAU,CAAE5M,SAAQ4J,UAC1B3gB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,qBAAsBp1C,YACnD,IACI,MAAMvO,QAAe4kE,EAASp7D,QAAQ+E,GAEtC,OADA3jB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,uBAAwB3jD,WAC9CA,CACV,CACD,MAAOzW,GACH,MAAMuV,EAAQ,IAAIC,MAAMxV,EAAE8W,SAK1B,MAJAvB,EAAME,KAAOzV,EAAEyV,KACfF,EAAMtV,KAAOD,EAAEC,KACfsV,EAAMyP,QAAUA,EAChB3jB,KAAKmlE,KAAK,QAAS,CAAEpM,OAAQ,sBAAuB7kD,UAC9CA,CACT,EAER,CACD,UAAMpH,CAAKiK,EAAQ4J,GAEf,aADM3gB,KAAKy4E,eACE9uE,MAAMmD,KAAKiK,EAAQ4J,EACnC,CACD,WAAMw3D,CAAMx0D,GACR1N,GAAgB5O,MAAM4N,QAAQ0O,GAAU,0CAA2C,UAAWA,GAC9F,IACI,MAAMvO,QAAepV,MAAK4e,EAAS+E,EAAQ5M,OAAQ4M,EAAQhD,QAAU,IACrE,MAAO,CAAC,CAAEpf,GAAIoiB,EAAQpiB,GAAI6T,UAC7B,CACD,MAAOzW,GACH,MAAO,CAAC,CACA4C,GAAIoiB,EAAQpiB,GACZ2S,MAAO,CAAEE,KAAMzV,EAAEyV,KAAMxV,KAAMD,EAAEC,KAAM6W,QAAS9W,EAAE8W,UAE3D,CACJ,CACD,WAAA2iE,CAAYz0D,EAASzP,GAIjB,QAHAA,EAAQ1N,KAAK+E,MAAM/E,KAAKC,UAAUyN,KAGpBA,MAAME,OAAS,GACzB,KAAK,KACDF,EAAMA,MAAMuB,QAAU,uBAAuBvB,EAAMA,MAAMuB,UACzD,MACJ,KAAK,KACDvB,EAAMA,MAAMuB,QAAU,uBAAuBvB,EAAMA,MAAMuB,UAGjE,OAAO9L,MAAMyuE,YAAYz0D,EAASzP,EACrC,CAID,eAAMgmE,CAAU5jC,GACG,MAAXA,IACAA,EAAU,GAEd,MAAMmjC,QAAiBz5E,KAAK8M,KAAK,eAAgB,IACjD,MAAyB,iBAAb,EACA2sE,EAAS78E,OAAS05C,GAE9BA,EAAUA,EAAQr6B,cACsD,IAAjEw9D,EAASt/D,QAAQnQ,GAAOA,EAAEiS,gBAAkBq6B,IAAU15C,OAChE,CACD,eAAM28E,CAAUjjC,GAIZ,GAHe,MAAXA,IACAA,EAAU,UAEFt2C,KAAKk6E,UAAU5jC,GACvB,UAEUt2C,MAAK4e,EAAS,sBAAuB,GAE9C,CACD,MAAO1K,GACH,MAAMyP,EAAUzP,EAAMyP,QACtB,MAAM3jB,KAAKo4E,YAAYz0D,EAAS,CAAEpiB,GAAIoiB,EAAQpiB,GAAI2S,SACrD,CAEL,aAAavK,MAAM4vE,UAAUjjC,EAChC,EClFE,MAAM6jC,WAAmBtF,GAI5Bv+B,QACA8jC,IAQA,WAAAv8E,CAAY2pC,EAAYu2B,GACpBp0D,MAAMo0D,GACN9nD,EAAeuxB,GAA2C,mBAArBA,EAAe,KAAkB,sBAAuB,aAAc,gBAC3GxnC,MAAKo6E,GAAc5yC,EAEnB7yB,EAAiB3U,KAAM,CAAEs2C,QADT0U,GAAehrD,KAAKo6E,WAAWrpC,YAElD,CAMD,cAAIqpC,GAAe,OAAOp6E,MAAKo6E,EAAc,CAI7C,cAAI5yC,GAAe,OAAOxnC,KAAKo6E,WAAW5yC,UAAa,CACvD,gBAAMoP,GAAe,OAAO52C,KAAKs2C,OAAU,CAC3C,OAAA0vB,CAAQjI,GACJ,OAAO,IAAIoc,GAAWn6E,MAAKo6E,GAAarc,EAC3C,CACD,qBAAMmX,CAAgBlpB,GAClBA,EAAKwR,GAAYxR,GAEjB,MAAMjsD,GAAEA,EAAE0H,KAAEA,SAAe8M,EAAkB,CACzCxU,GAAKisD,EAAGjsD,GAAKq3C,GAAe4U,EAAGjsD,GAAIC,KAAK+9D,eAAYjhD,EACpDrV,KAAOukD,EAAGvkD,KAAO2vC,GAAe4U,EAAGvkD,KAAMzH,KAAK+9D,eAAYjhD,IAEpD,MAAN/c,IACAisD,EAAGjsD,GAAKA,GAEA,MAAR0H,IACAukD,EAAGvkD,KAAOA,GAEC,MAAXukD,EAAGvkD,OACHwO,EAAe2gC,GAAYoV,EAAO,QAAOhsD,KAAKs2C,QAAS,oCAAqC,UAAW0V,EAAGvkD,aACnGukD,EAAGvkD,MAGd,MAAM4yE,EAAMnuB,GAAYzkD,KAAKukD,GAE7B,OADAquB,EAAIvpC,UAAY9wC,KAAKo6E,WAAW3pC,KAAK4pC,EAAI7sB,cAClC6sB,EAAIxlC,UACd,CACD,iBAAMwgC,CAAY5/D,GACd,OAAOzV,KAAKs6E,gBAAgB7kE,EAC/B,CAMD,eAAA6kE,CAAgB7kE,GACZ,OAAOzV,KAAKo6E,WAAW3pC,KAAK0e,GAAY15C,IAAUo/B,UACrD,CACD,mBAAMygC,CAAc5jB,EAAQ19C,EAAOF,GAE/B,MAAMyjE,QAAkBpnB,GAAiB0B,aAAaH,EAAQ19C,EAAOF,GAAOQ,MAAO7J,IAG/EuL,EAAwB,MAAjBhW,KAAK+9D,SAAkB,8CAA+C,wBAAyB,CAClGrnD,UAAW,cACXhB,KAAM,CAAEjL,UAEZ,MAAM6rC,QAAgBt2C,KAAK+9D,SAASzmB,YAAY7sC,GAIhD,OAHAuL,EAAkB,MAAXsgC,EAAiB,wBAAyB,oBAAqB,CAClExiC,MAAOrJ,IAEJ6rC,CAAO,IAElB,OAAOt2C,KAAKo6E,WAAW3pC,KAAK0f,GAAiBjzD,KAAKq6E,EAAU7lB,OAAQ19C,EAAOujE,EAAUzjE,QAAQ+gC,UAChG,EClGL,MAAM0lC,GAAW,gCACXC,GAAO,YACb,SAASC,GAAOC,EAAOC,GACnB,IAAIC,EAAU,GACd,OAAOF,EAAMjmE,QAAO,CAACC,EAAOsU,KACpBA,IAAS2xD,EACTC,IAEK5xD,EAAKnsB,MAAM29E,IAChB9lE,EAAMtW,KAAKhC,OAAOoa,aAAaokE,GAAW5xD,IAG1C4xD,EAAU,GACVlmE,EAAMtW,KAAK4qB,IAERtU,IACR,GACP,CAgCO,SAASmmE,GAAUj8E,GAEtB,OADAqX,EAA2B,MAAZrX,EAAK,GAAY,wBAAyB,OAAQA,GA7B9D,SAAgBA,EAAMoM,GAEzB,IAAK,IAAI7N,EAAIo9E,GAAqBp9E,GAAK,EAAGA,IACtCyB,EAAOA,EAAK7C,MAAMw+E,GAASp9E,IAAI0K,KAAKmD,EAAKmM,UAAU,EAAIha,EAAG,EAAIA,EAAI,IAGtE,MAAM29E,EAAS,GACTC,EAAWn8E,EAAK3C,QAAQ,8BAA8B,CAACuI,EAAK8G,EAAM0vE,EAAMhyD,KAC1E,GAAIgyD,EACA,IAAK,IAAI79E,EAAI+Z,SAAS8jE,GAAO79E,GAAK,EAAGA,IACjC29E,EAAO18E,KAAK,UAIhB08E,EAAO18E,KAAKkN,EAAK2Q,eAErB,MAAO,EAAE,IAGb,GAAI8+D,EACA,MAAM,IAAI5mE,MAAM,cAAc3N,KAAKC,UAAUs0E,MAGjD,OAAON,GAAOA,GAAOK,EAAQ,KAAM,IACvC,CAMWl8B,CAAOhgD,EAAKuY,UAAU,IAA0BvY,EAAKuY,UAAU,EAAG,IAC7E,CC/CO,MAAM8jE,GACTC,OAWA,WAAAr9E,CAAYq9E,GACRvmE,EAAiB3U,KAAM,CAAEk7E,UAC5B,CAQD,KAAAn/E,CAAMo/E,GACF,OAAOA,EAAOl/D,cAAclgB,MAAM,OACrC,CAOD,IAAA8L,CAAK6yE,GACD,OAAOA,EAAM7yE,KAAK,IACrB,ECrBE,MAAMuzE,WAAoBH,GAC7Br8E,GACAk4C,IAKA,WAAAj5C,CAAYq9E,EAAQt8E,EAAMk4C,GACtBntC,MAAMuxE,GACNl7E,MAAKpB,EAAQA,EACboB,MAAK82C,GAAYA,EACjB92C,MAAK06E,GAAS,IACjB,CAID,SAAIl7D,GAAU,OAAOxf,MAAKpB,CAAQ,CAIlC,YAAAy8E,GACI,OAAOR,GAAU76E,MAAKpB,EACzB,CACD87E,IACA,GAAAY,GACI,GAAmB,MAAft7E,MAAK06E,GAAgB,CACrB,MAAMA,EAAQ16E,KAAKq7E,eAInB,GAFiB95E,GAAGm5E,EAAM7yE,KAAK,MAAQ,QAEtB7H,MAAK82C,GAClB,MAAM,IAAI3iC,MAAM,sBAAsBnU,KAAKk7E,iBAG/Cl7E,MAAK06E,GAASA,CACjB,CACD,OAAO16E,MAAK06E,EACf,CACD,OAAAa,CAAQ3pE,GACJ,MAAM8oE,EAAQ16E,MAAKs7E,KAEnB,OADArlE,EAAerE,GAAS,GAAKA,EAAQ8oE,EAAM99E,OAAQ,uBAAuBgV,IAAS,QAASA,GACrF8oE,EAAM9oE,EAChB,CACD,YAAA4pE,CAAaxyD,GACT,OAAOhpB,MAAKs7E,KAAap9E,QAAQ8qB,EACpC,EC5DL,IAAIyyD,GAAW,KAMR,MAAMC,WAAeN,GASxB,WAAAv9E,GAAgB8L,MAAM,KAjBZ,w3LACG,qEAgBkC,CAK/C,eAAO8xE,GAIH,OAHgB,MAAZA,KACAA,GAAW,IAAIC,IAEZD,EACV,ECxBL,SAASE,GAAaziE,GAClB,OAAS,GAAKA,GAAQ,GAAO,EAAIA,EAAQ,GAC7C,CAKA,SAAS0iE,GAAkBC,EAAUJ,GACjChlE,EAAgB,QACA,MAAZglE,IACAA,EAAWC,GAAOD,YAEtB,MAAMf,EAAQe,EAAS1/E,MAAM8/E,GAC7B5lE,EAAgBykE,EAAM99E,OAAS,GAAO,GAAK89E,EAAM99E,QAAU,IAAM89E,EAAM99E,QAAU,GAAI,0BAA2B,WAAY,gBAC5H,MAAMk/E,EAAU,IAAI5mE,WAAWxY,KAAK0qB,KAAK,GAAKszD,EAAM99E,OAAS,IAC7D,IAAIqa,EAAS,EACb,IAAK,IAAI9Z,EAAI,EAAGA,EAAIu9E,EAAM99E,OAAQO,IAAK,CACnC,IAAIyU,EAAQ6pE,EAASD,aAAad,EAAMv9E,GAAGoZ,UAAU,SACrDN,EAAerE,GAAS,EAAG,kCAAkCzU,IAAK,WAAY,gBAC9E,IAAK,IAAI4+E,EAAM,EAAGA,EAAM,GAAIA,IACpBnqE,EAAS,GAAM,GAAKmqE,IACpBD,EAAQ7kE,GAAU,IAAO,GAAM,EAAKA,EAAS,GAEjDA,GAEP,CACD,MAAM+kE,EAAc,GAAKtB,EAAM99E,OAAS,EAElCq/E,EAAeN,GADAjB,EAAM99E,OAAS,GAIpC,OADAqZ,GADiBmB,EAASsX,GAAOotD,EAAQrgF,MAAM,EAAGugF,EAAc,KAAK,GAAKC,MAC7CH,EAAQA,EAAQl/E,OAAS,GAAKq/E,GAAe,4BAA6B,WAAY,gBAC5GxkE,EAAQqkE,EAAQrgF,MAAM,EAAGugF,EAAc,GAClD,CACA,SAASE,GAAkBJ,EAASL,GAChCxlE,EAAgB6lE,EAAQl/E,OAAS,GAAO,GAAKk/E,EAAQl/E,QAAU,IAAMk/E,EAAQl/E,QAAU,GAAI,uBAAwB,UAAW,gBAC9G,MAAZ6+E,IACAA,EAAWC,GAAOD,YAEtB,MAAMU,EAAU,CAAC,GACjB,IAAIC,EAAgB,GACpB,IAAK,IAAIj/E,EAAI,EAAGA,EAAI2+E,EAAQl/E,OAAQO,IAE5Bi/E,EAAgB,GAChBD,EAAQA,EAAQv/E,OAAS,KAAO,EAChCu/E,EAAQA,EAAQv/E,OAAS,IAAMk/E,EAAQ3+E,GACvCi/E,GAAiB,IAIjBD,EAAQA,EAAQv/E,OAAS,KAAOw/E,EAChCD,EAAQA,EAAQv/E,OAAS,IAAMk/E,EAAQ3+E,IAAO,EAAIi/E,EAElDD,EAAQ/9E,KAAK09E,EAAQ3+E,KA/CpB,GA+CsC,EAAIi/E,GA/C7B,EAAK,MAgDnBA,GAAiB,GAIzB,MAAMC,EAAeP,EAAQl/E,OAAS,EAChCk6C,EAAW5/B,SAASwX,GAAOotD,GAAS3kE,UAAU,EAAG,GAAI,IAAMwkE,GAAaU,GAI9E,OAFAF,EAAQA,EAAQv/E,OAAS,KAAOy/E,EAChCF,EAAQA,EAAQv/E,OAAS,IAAOk6C,GAAa,EAAIulC,EAC1CZ,EAAS5zE,KAAKs0E,EAAQl2E,KAAK2L,GAAU6pE,EAASF,QAAQ3pE,KACjE,CACA,MAAMwS,GAAS,CAAA,EAKR,MAAMk4D,GAMTnB,OAKA/6D,SAIAq7D,SAIAK,QAIA,WAAAj+E,CAAYgZ,EAAOilE,EAASX,EAAQ/6D,EAAUq7D,GAC1B,MAAZr7D,IACAA,EAAW,IAEC,MAAZq7D,IACAA,EAAWC,GAAOD,YAEtB9kE,EAAcE,EAAOuN,GAAQ,YAC7BzP,EAAiB3U,KAAM,CAAEm7E,SAAQ/6D,WAAUq7D,WAAUK,WACxD,CAID,WAAAS,GACI,MAAM1wD,EAAO/Q,EAAY,WAAa9a,KAAKogB,SAAU,QACrD,OAAO6L,GAAOnR,EAAY9a,KAAKm7E,OAAQ,QAAStvD,EAAM,KAAM,GAAI,SACnE,CAOD,iBAAO2wD,CAAWrB,EAAQ/6D,EAAUq7D,GAEhC,MAAMK,EAAUF,GAAkBT,EAAQM,GAE1C,OADAN,EAASe,GAAkB9kE,EAAS0kE,GAAUL,GACvC,IAAIa,GAASl4D,GAAQ03D,EAASX,EAAQ/6D,EAAUq7D,EAC1D,CAOD,kBAAOgB,CAAYC,EAAUt8D,EAAUq7D,GACnC,MAAMK,EAAU1kE,EAASslE,EAAU,WAC7BvB,EAASe,GAAkBJ,EAASL,GAC1C,OAAO,IAAIa,GAASl4D,GAAQ3M,EAAQqkE,GAAUX,EAAQ/6D,EAAUq7D,EACnE,CAID,sBAAOkB,CAAgBD,EAAUjB,GAE7B,OAAOS,GADS9kE,EAASslE,EAAU,WACDjB,EACrC,CAID,sBAAOmB,CAAgBzB,EAAQM,GAC3B,OAAOG,GAAkBT,EAAQM,EACpC,CAOD,sBAAOoB,CAAgB1B,EAAQM,GAC3B,IAEI,OADAG,GAAkBT,EAAQM,IACnB,CACV,CACD,MAAOvnE,GAAU,CACjB,OAAO,CACV;uFCjKL,IAWI4oE,GAAUC,GAASC,GAXnBC,GAAkE,SAAU13D,EAAU5iB,EAAOu6E,EAAM3+E,GACnG,GAAa,MAAT2+E,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,4EACvG,MAAgB,MAATqnE,EAAe3+E,EAAa,MAAT2+E,EAAe3+E,EAAET,KAAKynB,GAAYhnB,EAAIA,EAAEuV,MAAQnR,EAAMkB,IAAI0hB,EACxF,EACI43D,GAAkE,SAAU53D,EAAU5iB,EAAOmR,EAAOopE,EAAM3+E,GAC1G,GAAa,MAAT2+E,EAAc,MAAM,IAAIrnE,UAAU,kCACtC,GAAa,MAATqnE,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,2EACvG,MAAiB,MAATqnE,EAAe3+E,EAAET,KAAKynB,EAAUzR,GAASvV,EAAIA,EAAEuV,MAAQA,EAAQnR,EAAM0I,IAAIka,EAAUzR,GAASA,CACxG,EAGA,MAAMspE,GAAiB,CAAE,GAAI,GAAI,GAAI,GAAI,GAAI,IAEvCC,GAAO,CAAC,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,KAEtL79E,GAAI,CAAC,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,EAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,EAAM,IAAM,GAAM,IAAM,GAAM,IAAM,EAAM,IAAM,EAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,EAAM,IAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,EAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IAAM,EAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,EAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,EAAM,IAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,EAAM,IAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,IAC//C89E,GAAK,CAAC,GAAM,EAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,EAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,EAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,EAAM,IAAM,IAAM,GAAM,EAAM,IAAM,GAAM,GAAM,IAAM,IAAM,GAAM,GAAM,EAAM,IAAM,IAAM,IAAM,EAAM,EAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,IAAM,EAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,GAAM,IAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,GAAM,IAAM,GAAM,GAAM,GAAM,EAAM,IAAM,IAAM,IAAM,IAAM,GAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,KAEhgD9uD,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,EAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAC1/FC,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,EAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,SAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAC1/F8uD,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,SAAY,WAAY,UAAY,WAAY,UAAY,WAAY,SAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,EAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAC1/FC,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,SAAY,WAAY,UAAY,WAAY,UAAY,WAAY,SAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,EAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAE1/FC,GAAK,CAAC,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,SAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,EAAY,UAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/FC,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,EAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,SAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,SAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/FC,GAAK,CAAC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,SAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,EAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/FC,GAAK,CAAC,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,SAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,WAAY,SAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,SAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,EAAY,WAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,UAAY,WAAY,YAE1/Fn1C,GAAK,CAAC,EAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/FC,GAAK,CAAC,EAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,SAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,WAAY,UAAY,SAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/Fm1C,GAAK,CAAC,EAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,UAAY,UAAY,WAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,UAAY,UAAY,WAAY,UAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAC1/FC,GAAK,CAAC,EAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,SAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,SAAY,UAAY,UAAY,UAAY,UAAY,SAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,WAAY,UAAY,UAAY,UAAY,UAAY,SAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,SAAY,UAAY,UAAY,UAAY,UAAY,WAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,UAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,YAChgG,SAASC,GAAermE,GACpB,MAAMtC,EAAS,GACf,IAAK,IAAIjY,EAAI,EAAGA,EAAIua,EAAM9a,OAAQO,GAAK,EACnCiY,EAAOhX,KAAMsZ,EAAMva,IAAM,GAAOua,EAAMva,EAAI,IAAM,GAAOua,EAAMva,EAAI,IAAM,EAAKua,EAAMva,EAAI,IAE1F,OAAOiY,CACX,CACO,MAAM4oE,GACT,OAAI34E,GAAQ,OAAO43E,GAAuBj9E,KAAM88E,GAAU,KAAKrhF,OAAU,CACzE,WAAAoC,CAAYwH,GAIR,GAHAy3E,GAASzxE,IAAIrL,UAAM,GACnB+8E,GAAQ1xE,IAAIrL,UAAM,GAClBg9E,GAAQ3xE,IAAIrL,UAAM,KACZA,gBAAgBg+E,IAClB,MAAM7pE,MAAM,uCAEhBgpE,GAAuBn9E,KAAM88E,GAAU,IAAI5nE,WAAW7P,GAAM,KAC5D,MAAM6vB,EAASkoD,GAAep9E,KAAKqF,IAAIzI,QACvC,GAAc,MAAVs4B,EACA,MAAM,IAAIrf,UAAU,iDAGxBsnE,GAAuBn9E,KAAMg9E,GAAS,GAAI,KAE1CG,GAAuBn9E,KAAM+8E,GAAS,GAAI,KAC1C,IAAK,IAAI5/E,EAAI,EAAGA,GAAK+3B,EAAQ/3B,IACzB8/E,GAAuBj9E,KAAMg9E,GAAS,KAAK5+E,KAAK,CAAC,EAAG,EAAG,EAAG,IAC1D6+E,GAAuBj9E,KAAM+8E,GAAS,KAAK3+E,KAAK,CAAC,EAAG,EAAG,EAAG,IAE9D,MAAM6/E,EAA+B,GAAd/oD,EAAS,GAC1BgpD,EAAKl+E,KAAKqF,IAAIzI,OAAS,EAEvBuhF,EAAKJ,GAAe/9E,KAAKqF,KAE/B,IAAIuM,EACJ,IAAK,IAAIzU,EAAI,EAAGA,EAAI+gF,EAAI/gF,IACpByU,EAAQzU,GAAK,EACb8/E,GAAuBj9E,KAAMg9E,GAAS,KAAKprE,GAAOzU,EAAI,GAAKghF,EAAGhhF,GAC9D8/E,GAAuBj9E,KAAM+8E,GAAS,KAAK7nD,EAAStjB,GAAOzU,EAAI,GAAKghF,EAAGhhF,GAG3E,IACYihF,EADRC,EAAc,EACdvhF,EAAIohF,EACR,KAAOphF,EAAImhF,GAAe,CAStB,GARAG,EAAKD,EAAGD,EAAK,GACbC,EAAG,IAAQ3+E,GAAG4+E,GAAM,GAAM,MAAS,GAC9B5+E,GAAG4+E,GAAM,EAAK,MAAS,GACvB5+E,GAAO,IAAL4+E,IAAc,EACjB5+E,GAAG4+E,GAAM,GAAM,KACdf,GAAKgB,IAAgB,GAC1BA,GAAe,EAEL,GAANH,EACA,IAAK,IAAI/gF,EAAI,EAAGA,EAAI+gF,EAAI/gF,IACpBghF,EAAGhhF,IAAMghF,EAAGhhF,EAAI,OAInB,CACD,IAAK,IAAIA,EAAI,EAAGA,EAAK+gF,EAAK,EAAI/gF,IAC1BghF,EAAGhhF,IAAMghF,EAAGhhF,EAAI,GAEpBihF,EAAKD,EAAID,EAAK,EAAK,GACnBC,EAAGD,EAAK,IAAO1+E,GAAO,IAAL4+E,GACZ5+E,GAAG4+E,GAAM,EAAK,MAAS,EACvB5+E,GAAG4+E,GAAM,GAAM,MAAS,GACxB5+E,GAAG4+E,GAAM,GAAM,MAAS,GAC7B,IAAK,IAAIjhF,EAAK+gF,EAAK,EAAK,EAAG/gF,EAAI+gF,EAAI/gF,IAC/BghF,EAAGhhF,IAAMghF,EAAGhhF,EAAI,EAEvB,CAED,IAAWuC,EAAGnD,EAAVY,EAAI,EACR,KAAOA,EAAI+gF,GAAMphF,EAAImhF,GACjBv+E,EAAI5C,GAAK,EACTP,EAAIO,EAAI,EACRmgF,GAAuBj9E,KAAMg9E,GAAS,KAAKt9E,GAAGnD,GAAK4hF,EAAGhhF,GACtD8/E,GAAuBj9E,KAAM+8E,GAAS,KAAK7nD,EAASx1B,GAAGnD,GAAK4hF,EAAGhhF,KAC/DL,GAEP,CAED,IAAK,IAAI4C,EAAI,EAAGA,EAAIw1B,EAAQx1B,IACxB,IAAK,IAAInD,EAAI,EAAGA,EAAI,EAAGA,IACnB6hF,EAAKnB,GAAuBj9E,KAAM+8E,GAAS,KAAKr9E,GAAGnD,GACnD0gF,GAAuBj9E,KAAM+8E,GAAS,KAAKr9E,GAAGnD,GAAMksC,GAAI21C,GAAM,GAAM,KAChE11C,GAAI01C,GAAM,GAAM,KAChBP,GAAIO,GAAM,EAAK,KACfN,GAAQ,IAALM,EAGlB,CACD,OAAAE,CAAQC,GACJ,GAAwB,IAApBA,EAAU3hF,OACV,MAAM,IAAIiZ,UAAU,6CAExB,MAAMqf,EAAS+nD,GAAuBj9E,KAAMg9E,GAAS,KAAKpgF,OAAS,EAC7DoN,EAAI,CAAC,EAAG,EAAG,EAAG,GAEpB,IAAIlN,EAAIihF,GAAeQ,GACvB,IAAK,IAAIphF,EAAI,EAAGA,EAAI,EAAGA,IACnBL,EAAEK,IAAM8/E,GAAuBj9E,KAAMg9E,GAAS,KAAK,GAAG7/E,GAG1D,IAAK,IAAIuC,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAK,CAC7B,IAAK,IAAIvC,EAAI,EAAGA,EAAI,EAAGA,IACnB6M,EAAE7M,GAAMqxB,GAAI1xB,EAAEK,IAAM,GAAM,KACtBsxB,GAAI3xB,GAAGK,EAAI,GAAK,IAAM,GAAM,KAC5BogF,GAAIzgF,GAAGK,EAAI,GAAK,IAAM,EAAK,KAC3BqgF,GAAoB,IAAjB1gF,GAAGK,EAAI,GAAK,IACf8/E,GAAuBj9E,KAAMg9E,GAAS,KAAKt9E,GAAGvC,GAEtDL,EAAIkN,EAAEvO,OACT,CAED,MAAM2Z,EAAS,IAAIF,WAAW,IAC9B,IAAIkpE,EAAK,EACT,IAAK,IAAIjhF,EAAI,EAAGA,EAAI,EAAGA,IACnBihF,EAAKnB,GAAuBj9E,KAAMg9E,GAAS,KAAK9nD,GAAQ/3B,GACxDiY,EAAO,EAAIjY,GAA6C,KAAvCqC,GAAG1C,EAAEK,IAAM,GAAM,KAASihF,GAAM,IACjDhpE,EAAO,EAAIjY,EAAI,GAAuD,KAAjDqC,GAAG1C,GAAGK,EAAI,GAAK,IAAM,GAAM,KAASihF,GAAM,IAC/DhpE,EAAO,EAAIjY,EAAI,GAAqD,KAA/CqC,GAAG1C,GAAGK,EAAI,GAAK,IAAM,EAAK,KAASihF,GAAM,GAC9DhpE,EAAO,EAAIjY,EAAI,GAAuC,KAAjCqC,GAAmB,IAAjB1C,GAAGK,EAAI,GAAK,IAAaihF,GAEpD,OAAOhpE,CACV,CACD,OAAAopE,CAAQC,GACJ,GAAyB,IAArBA,EAAW7hF,OACX,MAAM,IAAIiZ,UAAU,8CAExB,MAAMqf,EAAS+nD,GAAuBj9E,KAAM+8E,GAAS,KAAKngF,OAAS,EAC7DoN,EAAI,CAAC,EAAG,EAAG,EAAG,GAEpB,IAAIlN,EAAIihF,GAAeU,GACvB,IAAK,IAAIthF,EAAI,EAAGA,EAAI,EAAGA,IACnBL,EAAEK,IAAM8/E,GAAuBj9E,KAAM+8E,GAAS,KAAK,GAAG5/E,GAG1D,IAAK,IAAIuC,EAAI,EAAGA,EAAIw1B,EAAQx1B,IAAK,CAC7B,IAAK,IAAIvC,EAAI,EAAGA,EAAI,EAAGA,IACnB6M,EAAE7M,GAAMsgF,GAAI3gF,EAAEK,IAAM,GAAM,KACtBugF,GAAI5gF,GAAGK,EAAI,GAAK,IAAM,GAAM,KAC5BwgF,GAAI7gF,GAAGK,EAAI,GAAK,IAAM,EAAK,KAC3BygF,GAAoB,IAAjB9gF,GAAGK,EAAI,GAAK,IACf8/E,GAAuBj9E,KAAM+8E,GAAS,KAAKr9E,GAAGvC,GAEtDL,EAAIkN,EAAEvO,OACT,CAED,MAAM2Z,EAAS,IAAIF,WAAW,IAC9B,IAAIkpE,EAAK,EACT,IAAK,IAAIjhF,EAAI,EAAGA,EAAI,EAAGA,IACnBihF,EAAKnB,GAAuBj9E,KAAM+8E,GAAS,KAAK7nD,GAAQ/3B,GACxDiY,EAAO,EAAIjY,GAA8C,KAAxCmgF,GAAIxgF,EAAEK,IAAM,GAAM,KAASihF,GAAM,IAClDhpE,EAAO,EAAIjY,EAAI,GAAwD,KAAlDmgF,GAAIxgF,GAAGK,EAAI,GAAK,IAAM,GAAM,KAASihF,GAAM,IAChEhpE,EAAO,EAAIjY,EAAI,GAAsD,KAAhDmgF,GAAIxgF,GAAGK,EAAI,GAAK,IAAM,EAAK,KAASihF,GAAM,GAC/DhpE,EAAO,EAAIjY,EAAI,GAAwC,KAAlCmgF,GAAoB,IAAjBxgF,GAAGK,EAAI,GAAK,IAAaihF,GAErD,OAAOhpE,CACV,EAEL0nE,GAAW,IAAIr+D,QAAWs+D,GAAU,IAAIt+D,QAAWu+D,GAAU,IAAIv+D,QCnM1D,MAAMigE,GACT,WAAA7gF,CAAY4M,EAAMpF,EAAKs5E,GACnB,GAAIA,KAAS3+E,gBAAgB2+E,GACzB,MAAM,IAAIxqE,MAAM,GAAG1J,qCAEvBhN,OAAOkX,iBAAiB3U,KAAM,CAC1B4+E,IAAK,CAAE7pE,YAAY,EAAMjB,MAAO,IAAIkqE,GAAI34E,IACxCoF,KAAM,CAAEsK,YAAY,EAAMjB,MAAOrJ,IAExC,ECTL,IAWIo0E,GAASC,GAXT3B,GAAkE,SAAU53D,EAAU5iB,EAAOmR,EAAOopE,EAAM3+E,GAC1G,GAAa,MAAT2+E,EAAc,MAAM,IAAIrnE,UAAU,kCACtC,GAAa,MAATqnE,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,2EACvG,MAAiB,MAATqnE,EAAe3+E,EAAET,KAAKynB,EAAUzR,GAASvV,EAAIA,EAAEuV,MAAQA,EAAQnR,EAAM0I,IAAIka,EAAUzR,GAASA,CACxG,EACImpE,GAAkE,SAAU13D,EAAU5iB,EAAOu6E,EAAM3+E,GACnG,GAAa,MAAT2+E,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,4EACvG,MAAgB,MAATqnE,EAAe3+E,EAAa,MAAT2+E,EAAe3+E,EAAET,KAAKynB,GAAYhnB,EAAIA,EAAEuV,MAAQnR,EAAMkB,IAAI0hB,EACxF,EAGO,MAAMw5D,WAAYL,GACrB,WAAA7gF,CAAYwH,EAAK25E,GAIb,GAHAr1E,MAAM,MAAOtE,EAAK05E,IAClBF,GAAQxzE,IAAIrL,UAAM,GAClB8+E,GAAezzE,IAAIrL,UAAM,GACrBg/E,EAAI,CACJ,GAAIA,EAAGpiF,OAAS,GACZ,MAAM,IAAIiZ,UAAU,sCAExBsnE,GAAuBn9E,KAAM6+E,GAAS,IAAI3pE,WAAW8pE,GAAK,IAC7D,MAEG7B,GAAuBn9E,KAAM6+E,GAAS,IAAI3pE,WAAW,IAAK,KAE9DioE,GAAuBn9E,KAAM8+E,GAAgB9+E,KAAKg/E,GAAI,IACzD,CACD,MAAIA,GAAO,OAAO,IAAI9pE,WAAW+nE,GAAuBj9E,KAAM6+E,GAAS,KAAQ,CAC/E,OAAAP,CAAQC,GACJ,GAAIA,EAAU3hF,OAAS,GACnB,MAAM,IAAIiZ,UAAU,yDAExB,MAAM4oE,EAAa,IAAIvpE,WAAWqpE,EAAU3hF,QAC5C,IAAK,IAAIO,EAAI,EAAGA,EAAIohF,EAAU3hF,OAAQO,GAAK,GAAI,CAC3C,IAAK,IAAIqe,EAAI,EAAGA,EAAI,GAAIA,IACpByhE,GAAuBj9E,KAAM8+E,GAAgB,KAAKtjE,IAAM+iE,EAAUphF,EAAIqe,GAE1E2hE,GAAuBn9E,KAAM8+E,GAAgB9+E,KAAK4+E,IAAIN,QAAQrB,GAAuBj9E,KAAM8+E,GAAgB,MAAO,KAClHL,EAAWpzE,IAAI4xE,GAAuBj9E,KAAM8+E,GAAgB,KAAM3hF,EACrE,CACD,OAAOshF,CACV,CACD,OAAAD,CAAQC,GACJ,GAAIA,EAAW7hF,OAAS,GACpB,MAAM,IAAIiZ,UAAU,0DAExB,MAAM0oE,EAAY,IAAIrpE,WAAWupE,EAAW7hF,QAC5C,IAAK,IAAIO,EAAI,EAAGA,EAAIshF,EAAW7hF,OAAQO,GAAK,GAAI,CAC5C,MAAM05C,EAAQ72C,KAAK4+E,IAAIJ,QAAQC,EAAWlyD,SAASpvB,EAAGA,EAAI,KAC1D,IAAK,IAAIqe,EAAI,EAAGA,EAAI,GAAIA,IACpB+iE,EAAUphF,EAAIqe,GAAKq7B,EAAMr7B,GAAKyhE,GAAuBj9E,KAAM8+E,GAAgB,KAAKtjE,GAChFyhE,GAAuBj9E,KAAM8+E,GAAgB,KAAKtjE,GAAKijE,EAAWthF,EAAIqe,EAE7E,CACD,OAAO+iE,CACV,EAELM,GAAU,IAAIpgE,QAAWqgE,GAAiB,IAAIrgE,QC3D9C,IAWIwgE,GAAgBC,GAAqBC,GAXrChC,GAAkE,SAAU53D,EAAU5iB,EAAOmR,EAAOopE,EAAM3+E,GAC1G,GAAa,MAAT2+E,EAAc,MAAM,IAAIrnE,UAAU,kCACtC,GAAa,MAATqnE,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,2EACvG,MAAiB,MAATqnE,EAAe3+E,EAAET,KAAKynB,EAAUzR,GAASvV,EAAIA,EAAEuV,MAAQA,EAAQnR,EAAM0I,IAAIka,EAAUzR,GAASA,CACxG,EACImpE,GAAkE,SAAU13D,EAAU5iB,EAAOu6E,EAAM3+E,GACnG,GAAa,MAAT2+E,IAAiB3+E,EAAG,MAAM,IAAIsX,UAAU,iDAC5C,GAAqB,mBAAVlT,EAAuB4iB,IAAa5iB,IAAUpE,GAAKoE,EAAMnF,IAAI+nB,GAAW,MAAM,IAAI1P,UAAU,4EACvG,MAAgB,MAATqnE,EAAe3+E,EAAa,MAAT2+E,EAAe3+E,EAAET,KAAKynB,GAAYhnB,EAAIA,EAAEuV,MAAQnR,EAAMkB,IAAI0hB,EACxF,EAGO,MAAM65D,WAAYV,GACrB,WAAA7gF,CAAYwH,EAAKg6E,GACb11E,MAAM,MAAOtE,EAAK+5E,IAElBH,GAAe5zE,IAAIrL,UAAM,GACzBk/E,GAAoB7zE,IAAIrL,UAAM,GAE9Bm/E,GAAa9zE,IAAIrL,UAAM,GACvBm9E,GAAuBn9E,KAAMm/E,GAAc,IAAIjqE,WAAW,IAAK,KAC/D+nE,GAAuBj9E,KAAMm/E,GAAc,KAAKjnE,KAAK,GACrDilE,GAAuBn9E,KAAMi/E,GAAgBhC,GAAuBj9E,KAAMm/E,GAAc,KAAM,KAC9FhC,GAAuBn9E,KAAMk/E,GAAqB,GAAI,KAClC,MAAhBG,IACAA,EAAe,GAEW,iBAAlB,EACRr/E,KAAKs/E,gBAAgBD,GAGrBr/E,KAAKu/E,gBAAgBF,EAE5B,CACD,WAAIG,GAAY,OAAO,IAAItqE,WAAW+nE,GAAuBj9E,KAAMm/E,GAAc,KAAQ,CACzF,eAAAG,CAAgBxrE,GACZ,IAAKqF,OAAOC,UAAUtF,IAAUA,EAAQ,GAAKA,EAAQqF,OAAOsmE,iBACxD,MAAM,IAAI5pE,UAAU,yCAExB,IAAK,IAAIjE,EAAQ,GAAIA,GAAS,IAAKA,EAC/BqrE,GAAuBj9E,KAAMm/E,GAAc,KAAKvtE,GAASkC,EAAQ,IACjEA,EAAQpX,KAAKC,MAAMmX,EAAQ,IAElC,CACD,eAAAyrE,CAAgBzrE,GACZ,GAAqB,KAAjBA,EAAMlX,OACN,MAAM,IAAIiZ,UAAU,mDAExBonE,GAAuBj9E,KAAMm/E,GAAc,KAAK9zE,IAAIyI,EACvD,CACD,SAAA4rE,GACI,IAAK,IAAIviF,EAAI,GAAIA,GAAK,EAAGA,IAAK,CAC1B,GAA2D,MAAvD8/E,GAAuBj9E,KAAMm/E,GAAc,KAAKhiF,GAG/C,CACD8/E,GAAuBj9E,KAAMm/E,GAAc,KAAKhiF,KAChD,KACH,CALG8/E,GAAuBj9E,KAAMm/E,GAAc,KAAKhiF,GAAK,CAM5D,CACJ,CACD,OAAAmhF,CAAQC,GACJ,IAAIoB,EAAIC,EACR,MAAMC,EAAY,IAAI3qE,WAAWqpE,GACjC,IAAK,IAAIphF,EAAI,EAAGA,EAAI0iF,EAAUjjF,OAAQO,IAC6B,KAA3D8/E,GAAuBj9E,KAAMk/E,GAAqB,OAClD/B,GAAuBn9E,KAAMi/E,GAAgBj/E,KAAK4+E,IAAIN,QAAQrB,GAAuBj9E,KAAMm/E,GAAc,MAAO,KAChHhC,GAAuBn9E,KAAMk/E,GAAqB,EAAG,KACrDl/E,KAAK0/E,aAETG,EAAU1iF,IAAM8/E,GAAuBj9E,KAAMi/E,GAAgB,MAAK9B,GAAuBn9E,KAAMk/E,IAAsBU,EAAK3C,GAAuBj9E,KAAMk/E,GAAqB,KAAMS,EAAKC,IAAMA,GAAK,KAAMD,IAE5M,OAAOE,CACV,CACD,OAAArB,CAAQC,GACJ,OAAOz+E,KAAKs+E,QAAQG,EACvB,EC1EE,SAASqB,GAAcC,GAI1B,MAH2B,iBAAvB,GAAoCA,EAAUpmE,WAAW,QACzDomE,EAAY,KAAOA,GAEhB1oE,EAAa0oE,EACxB,CACO,SAASC,GAAKlsE,EAAOlX,GAExB,IADAkX,EAAQ1X,OAAO0X,GACRA,EAAMlX,OAASA,GAClBkX,EAAQ,IAAMA,EAElB,OAAOA,CACX,CACO,SAASmsE,GAAY7/D,GACxB,MAA0B,iBAAd,EACDtF,EAAYsF,EAAU,QAE1B/I,EAAa+I,EACxB,CACO,SAAS8/D,GAAQx8D,EAAQy8D,GAC5B,MAAMtjF,EAAQsjF,EAAMtjF,MAAM,sCAC1BoZ,EAAwB,MAATpZ,EAAe,eAAgB,OAAQsjF,GACtD,MAAMvkF,EAAOiB,EAAM,GACbkX,EAAOlX,EAAM,GACbujF,EAAqB,MAAbvjF,EAAM,GACpB,IAAIq3D,EAAMxwC,EACV,IAAK,MAAMgmB,KAAQ9tC,EAAKqgB,cAAclgB,MAAM,KAAM,CAE9C,GAAIsL,MAAM4N,QAAQi/C,GAAM,CACpB,IAAKxqB,EAAK7sC,MAAM,YACZ,MAEJq3D,EAAMA,EAAIh9C,SAASwyB,GACtB,MACI,GAAqB,iBAAT,EAAmB,CAChC,IAAImnB,EAAQ,KACZ,IAAK,MAAMxrD,KAAO6uD,EACd,GAAI7uD,EAAI4W,gBAAkBytB,EAAM,CAC5BmnB,EAAQqD,EAAI7uD,GACZ,KACH,CAEL6uD,EAAMrD,CACT,MAEGqD,EAAM,KAEV,GAAW,MAAPA,EACA,KAEP,CAED,GADAj+C,GAAgBmqE,GAAe,MAAPlsB,EAAa,yBAA0B,OAAQt4D,GACnEmY,GAAe,MAAPmgD,EAAa,CACrB,GAAa,QAATngD,EAAgB,CAChB,GAAqB,iBAAjB,GAA6BmgD,EAAIr3D,MAAM,cACvC,OAAOqa,SAASg9C,GAEf,GAAI/6C,OAAOwO,cAAcusC,GAC1B,OAAOA,CAEd,CACD,GAAa,WAATngD,GACqB,iBAAjB,GAA6BmgD,EAAIr3D,MAAM,eACvC,OAAOyU,WAAW4iD,GAG1B,GAAa,SAATngD,GACqB,iBAAT,EACR,OAAO+rE,GAAc5rB,GAG7B,GAAa,UAATngD,GAAoB1M,MAAM4N,QAAQi/C,GAClC,OAAOA,EAEX,GAAIngD,WAAiB,EACjB,OAAOmgD,EAEXj+C,GAAe,EAAO,wBAAwBlC,KAAS,OAAQnY,EAClE,CACD,OAAOs4D,CACX,CDJA+qB,GAAiB,IAAIxgE,QAAWygE,GAAsB,IAAIzgE,QAAW0gE,GAAe,IAAI1gE,QE/DxF,MAAM4hE,GAAc,mBAIb,SAASC,GAAe70E,GAC3B,IACI,MAAM7M,EAAO4H,KAAK+E,MAAME,GAExB,GAAgB,KADkB,MAAhB7M,EAAK2D,QAAmB2U,SAAStY,EAAK2D,SAAW,GAE/D,OAAO,CAEd,CACD,MAAO2R,GAAU,CACjB,OAAO,CACX,CAYA,SAASqsE,GAAW3hF,EAAM8rB,GACtB,MAAMrlB,EAAM+R,EAASsT,GACf+zD,EAAayB,GAAQthF,EAAM,2BAEjCqX,EADoBwB,EAAQgf,GAAU/iB,EAAO,CAACrO,EAAI5J,MAAM,GAAI,IAAKgjF,MAAetnE,UAAU,KAC3D+oE,GAAQthF,EAAM,sBAAsBqd,cAAe,qBAAsB,WAAY,gBACpH,MAAMurB,EAhBV,SAAiB5oC,EAAMyG,EAAKo5E,GAExB,GAAe,gBADAyB,GAAQthF,EAAM,wBACC,CAC1B,MAAMogF,EAAKkB,GAAQthF,EAAM,gCAEzB,OAAO6Y,EADQ,IAAI2nE,GAAI/5E,EAAK25E,GACNR,QAAQC,GACjC,CACDzoE,GAAO,EAAO,qBAAsB,wBAAyB,CACzDU,UAAW,WAEnB,CAMuB8nE,CAAQ5/E,EAAMyG,EAAI5J,MAAM,EAAG,IAAKgjF,GAC7CnoC,EAAU0U,GAAexjB,GAC/B,GAAI5oC,EAAK03C,QAAS,CACd,IAAI/4C,EAAQqB,EAAK03C,QAAQr6B,cACpB1e,EAAMoc,WAAW,QAClBpc,EAAQ,KAAOA,GAEnB0Y,EAAe2gC,GAAWr5C,KAAW+4C,EAAS,uCAAwC,UAAW13C,EAAK03C,QACzG,CACD,MAAMojC,EAAU,CAAEpjC,UAAS9O,cAG3B,GAAgB,QADA04C,GAAQthF,EAAM,2BACP,CACnB,MAAM4hF,EAAcn7E,EAAI5J,MAAM,GAAI,IAC5BglF,EAAqBP,GAAQthF,EAAM,qCACnC8hF,EAAaR,GAAQthF,EAAM,kCAC3B+hF,EAAiB,IAAIvB,GAAIoB,EAAaE,GAC5ChH,EAAQmC,SAAW,CACfjgF,KAAOskF,GAAQthF,EAAM,yBAA2ByhF,GAChDnF,OAASgF,GAAQthF,EAAM,2BAA6B,KACpDk9E,QAASrkE,EAAQL,EAASupE,EAAenC,QAAQiC,KAExD,CACD,OAAO/G,CACX,CACA,SAASkH,GAAoBhiF,GACzB,MAAMiiF,EAAMX,GAAQthF,EAAM,qBAC1B,GAAIiiF,GAAwB,iBAAjB,EAA2B,CAClC,GAA0B,WAAtBA,EAAI5kE,cAA4B,CAChC,MAAM4P,EAAOq0D,GAAQthF,EAAM,+BACrBgC,EAAIs/E,GAAQthF,EAAM,2BAClBc,EAAIwgF,GAAQthF,EAAM,2BAClB9C,EAAIokF,GAAQthF,EAAM,2BAExBqX,EAAerV,EAAI,KAAMA,EAAKA,EAAI,GAAW,gBAAiB,QAASA,GACvEqV,EAAevW,EAAI,GAAK5D,EAAI,EAAG,cAAe,MAAO+kF,GACrD,MAAMn1D,EAAQw0D,GAAQthF,EAAM,+BAE5B,OADAqX,EAAyB,KAAVyV,EAAc,oBAAqB,YAAaA,GACxD,CAAEjhB,KAAM,SAAUohB,OAAMjrB,IAAGlB,IAAG5D,IAAG4vB,MAAO,GAClD,CACI,GAA0B,WAAtBm1D,EAAI5kE,cAA4B,CACrC,MAAM4P,EAAOq0D,GAAQthF,EAAM,+BACrBkiF,EAAMZ,GAAQthF,EAAM,gCACpB60B,EAAYqtD,EAAI/kF,MAAM,KAAKkJ,MACjCgR,EAA6B,WAAdwd,GAAwC,WAAdA,EAAwB,kBAAmB,UAAWqtD,GAC/F,MAAM3qE,EAAQ+pE,GAAQthF,EAAM,2BACtB8sB,EAAQw0D,GAAQthF,EAAM,+BAE5B,OADAqX,EAAyB,KAAVyV,EAAc,oBAAqB,YAAaA,GACxD,CAAEjhB,KAAM,SAAUohB,OAAM1V,QAAOuV,QAAO+H,YAChD,CACJ,CACDxd,GAAe,EAAO,sCAAuC,MAAO4qE,EACxE,CA2BA,SAASl/D,GAAMy0D,GACX,OAAO,IAAI5hE,SAAS5J,IAAcvM,YAAW,KAAQuM,GAAS,GAAKwrE,EAAS,GAChF,CAkCA,SAAS2K,GAAoBllE,GAEzB,MAAMgQ,EAAwB,MAAhBhQ,EAAQgQ,KAAgBzU,EAASyE,EAAQgQ,KAAM,gBAAkB7H,GAAY,IAE3F,IAAIpjB,EAAK,GAAK,GAAKlB,EAAI,EAAG5D,EAAI,EAe9B,OAdI+f,EAAQ6hB,SACJ7hB,EAAQ6hB,OAAO98B,IACfA,EAAIib,EAAQ6hB,OAAO98B,GAEnBib,EAAQ6hB,OAAOh+B,IACfA,EAAImc,EAAQ6hB,OAAOh+B,GAEnBmc,EAAQ6hB,OAAO5hC,IACfA,EAAI+f,EAAQ6hB,OAAO5hC,IAG3Bma,EAA8B,iBAAf,GAA2BrV,EAAI,GAAKuY,OAAOwO,cAAc/mB,KAAOyU,OAAOzU,GAAKyU,OAAOzU,EAAI,MAAQyU,OAAO,GAAI,6BAA8B,YAAazU,GACpKqV,EAA8B,iBAAf,GAA2BvW,EAAI,GAAKyZ,OAAOwO,cAAcjoB,GAAI,6BAA8B,YAAaA,GACvHuW,EAA8B,iBAAf,GAA2Bna,EAAI,GAAKqd,OAAOwO,cAAc7rB,GAAI,6BAA8B,YAAaA,GAChH,CAAE2O,KAAM,SAAUihB,MAAO,GAAIG,OAAMjrB,IAAGlB,IAAG5D,IACpD,CACA,SAASklF,GAAiB37E,EAAKw7E,EAAKnH,EAAS79D,GACzC,MAAM2rB,EAAapwB,EAASsiE,EAAQlyC,WAAY,cAE1Cw3C,EAAoB,MAAdnjE,EAAQmjE,GAAc5nE,EAASyE,EAAQmjE,GAAI,cAAgBh7D,GAAY,IACnF/N,EAA6B,KAAd+oE,EAAGpiF,OAAe,4BAA6B,aAAcif,EAAQmjE,IAEpF,MAAMiC,EAA8B,MAAhBplE,EAAQnU,KAAgB0P,EAASyE,EAAQnU,KAAM,gBAAkBsc,GAAY,IACjG/N,EAAqC,KAAtBgrE,EAAWrkF,OAAe,8BAA+B,eAAgBif,EAAQmjE,IAIhG,MAAMkC,EAAa77E,EAAI5J,MAAM,EAAG,IAC1B0lF,EAAY97E,EAAI5J,MAAM,GAAI,IAG1BgjF,EAAarnE,EADJ,IAAIgoE,GAAI8B,EAAYlC,GACAV,QAAQ92C,IAErC45C,EAAM3qD,GAAU/iB,EAAO,CAACytE,EAAW1C,KAEnC7/E,EAAO,CACT03C,QAASojC,EAAQpjC,QAAQn/B,UAAU,GAAG8E,cACtC1a,GAAIwiB,GAAOk9D,GACX1+E,QAAS,EACT8+E,OAAQ,CACJC,OAAQ,cACRC,aAAc,CACVvC,GAAIvnE,EAAQunE,GAAI7nE,UAAU,IAE9BsnE,WAAYhnE,EAAQgnE,GAAYtnE,UAAU,GAC1C0pE,IAAK,SACLW,UAAW,CACP31D,KAAMpU,EAAQopE,EAAIh1D,MAAM1U,UAAU,GAClCnZ,EAAG6iF,EAAIjgF,EACP6gF,MAAO,GACP3lF,EAAG+kF,EAAI/kF,EACP4D,EAAGmhF,EAAInhF,GAEX0hF,IAAKA,EAAIjqE,UAAU,KAI3B,GAAIuiE,EAAQmC,SAAU,CAClB,MAAM6F,EAA4B,MAAlB7lE,EAAQ6lE,OAAkB7lE,EAAQ6lE,OAAS,UAAUn/E,IAC/D3G,EAAO89E,EAAQmC,SAASjgF,MAAQykF,GAChCnF,EAASxB,EAAQmC,SAASX,QAAU,KACpCsF,EAAcn7E,EAAI5J,MAAM,GAAI,IAC5BqgF,EAAU1kE,EAASsiE,EAAQmC,SAASC,QAAS,4BAC7C4E,EAAa18D,GAAY,IAEzBy8D,EAAqBrpE,EADJ,IAAIgoE,GAAIoB,EAAaE,GACOpC,QAAQxC,IACrD78E,EAAM,IAAIC,KAOVyiF,EAAgB,SANH1iF,EAAI2iF,iBAAmB,IACtC5B,GAAK/gF,EAAI4iF,cAAgB,EAAG,GAAK,IACjC7B,GAAK/gF,EAAI6iF,aAAc,GAAK,IAC5B9B,GAAK/gF,EAAI8iF,cAAe,GAAK,IAC7B/B,GAAK/gF,EAAI+iF,gBAAiB,GAAK,IAC/BhC,GAAK/gF,EAAIgjF,gBAAiB,GAAK,OACS,KAAOrjF,EAAK03C,QACxD13C,EAAK,YAAc,CACf8iF,SAAQC,eAAc/lF,OAAMs/E,SAC5BgH,gBAAiBzqE,EAAQipE,GAAYvpE,UAAU,GAC/CspE,mBAAoBhpE,EAAQgpE,GAAoBtpE,UAAU,GAC1D5U,QAAS,MAEhB,CACD,OAAOiE,KAAKC,UAAU7H,EAC1B,CASO,SAASujF,GAAwBzI,EAASt5D,EAAUvE,GACxC,MAAXA,IACAA,EAAU,CAAA,GAEd,MAAMumE,EAAgBnC,GAAY7/D,GAC5BygE,EAAME,GAAoBllE,GAEhC,OAAOmlE,GAAiB5pE,EADZymB,GAAWukD,EAAevB,EAAIh1D,KAAMg1D,EAAIjgF,EAAGigF,EAAInhF,EAAGmhF,EAAI/kF,EAAG,KAC9B+kF,EAAKnH,EAAS79D,EACzD,CAUOvH,eAAe+tE,GAAoB3I,EAASt5D,EAAUvE,GAC1C,MAAXA,IACAA,EAAU,CAAA,GAEd,MAAMumE,EAAgBnC,GAAY7/D,GAC5BygE,EAAME,GAAoBllE,GAEhC,OAAOmlE,GAAiB5pE,QADNsmB,GAAO0kD,EAAevB,EAAIh1D,KAAMg1D,EAAIjgF,EAAGigF,EAAInhF,EAAGmhF,EAAI/kF,EAAG,GAAI+f,EAAQymE,mBAC5CzB,EAAKnH,EAAS79D,EACzD,CC7QO,MAAMwkE,GAAc,mBAErBkC,GAAe,IAAIrtE,WAAW,CAAC,GAAI,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,MACnFstE,GAAc,WACd5hF,GAAIyU,OAAO,sEAEjB,SAAS2qE,GAAKlsE,EAAOlX,GACjB,IAAIwY,EAAS,GACb,KAAOtB,GACHsB,EAJQ,mBAIStB,EAAQ,IAAMsB,EAC/BtB,EAAQpX,KAAK+kB,MAAM3N,EAAQ,IAE/B,KAAOsB,EAAOxY,OAAkB,EAATA,GACnBwY,EAAS,IAAMA,EAEnB,MAAO,KAAOA,CAClB,CACA,SAASqtE,GAAkBjqE,GACvB,MAAM1E,EAAQsD,EAASoB,GAGvB,OAAOyB,EADOvG,EAAO,CAACI,EADR+D,EAAU6W,GAAOA,GAAO5a,IAAS,EAAG,KAGtD,CACA,MAAMsQ,GAAS,CAAA,EACf,SAASs+D,GAAM9wE,EAAO+wE,EAAW5xC,EAAWvJ,GACxC,MAAM5oC,EAAO,IAAIsW,WAAW,IACxBtD,EAAQ4wE,IACRxsE,EAAqB,MAAdwxB,EAAoB,uCAAwC,wBAAyB,CACxF9wB,UAAW,gBAGf9X,EAAKyM,IAAI+L,EAASowB,GAAa,IAI/B5oC,EAAKyM,IAAI+L,EAAS25B,IAGtB,IAAK,IAAI5zC,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC1ByB,EAAK,IAAMzB,GAAK,IAAQyU,GAAU,GAAKzU,EAAM,IAEjD,MAAMysC,EAAIxyB,EAAS0c,GAAY,SAAU6uD,EAAW/jF,IACpD,MAAO,CAAEgkF,GAAIh5C,EAAEnuC,MAAM,EAAG,IAAKonF,GAAIj5C,EAAEnuC,MAAM,IAC7C,CACA,SAASqnF,GAAWh+E,EAAMlJ,GACtB,MAAMg6D,EAAah6D,EAAKG,MAAM,KAC9Bka,EAAe2/C,EAAWh5D,OAAS,EAAG,eAAgB,OAAQhB,GACxC,MAAlBg6D,EAAW,KACX3/C,EAA8B,IAAfnR,EAAKqvD,MAAa,uFAAuFrvD,EAAKqvD,QAAS,OAAQv4D,GAC9Ig6D,EAAW3sC,SAEf,IAAI7T,EAAStQ,EACb,IAAK,IAAI3H,EAAI,EAAGA,EAAIy4D,EAAWh5D,OAAQO,IAAK,CACxC,MAAM4lF,EAAYntB,EAAWz4D,GAC7B,GAAI4lF,EAAUlmF,MAAM,aAAc,CAC9B,MAAM+U,EAAQsF,SAAS6rE,EAAU5rE,UAAU,EAAG4rE,EAAUnmF,OAAS,IACjEqZ,EAAerE,EAAQ4wE,GAAa,qBAAsB,QAAQrlF,KAAM4lF,GACxE3tE,EAASA,EAAO4tE,YAAYR,GAAc5wE,EAC9C,MACK,GAAImxE,EAAUlmF,MAAM,YAAa,CAClC,MAAM+U,EAAQsF,SAAS6rE,GACvB9sE,EAAerE,EAAQ4wE,GAAa,qBAAsB,QAAQrlF,KAAM4lF,GACxE3tE,EAASA,EAAO4tE,YAAYpxE,EAChC,MAEIqE,GAAe,EAAO,yBAA0B,QAAQ9Y,KAAM4lF,EAEtE,CACA,OAAO3tE,CACX,CASO,MAAM6tE,WAAqB9I,GAI9BppC,UAQAmyC,YAIAC,kBAOAtH,SAKA8G,UAQA/mF,KAKAgW,MAKAuiD,MAIA,WAAAt2D,CAAYgZ,EAAOujE,EAAY+I,EAAmBR,EAAW/mF,EAAMgW,EAAOuiD,EAAO0nB,EAAU9d,GACvFp0D,MAAMywE,EAAYrc,GAClBpnD,EAAcE,EAAOuN,GAAQ,gBAC7BzP,EAAiB3U,KAAM,CAAE+wC,UAAWqpC,EAAW3kC,sBAE/C9gC,EAAiB3U,KAAM,CACnBmjF,oBAAmBD,YAFHrrE,EAAUohB,GAAUvK,GAAO1uB,KAAK+wC,YAAa,EAAG,GAGhE4xC,YAAW/mF,OAAMgW,QAAOuiD,UAE5Bx/C,EAAiB3U,KAAM,CAAE67E,YAC7B,CACA,OAAA7V,CAAQjI,GACJ,OAAO,IAAIklB,GAAa7+D,GAAQpkB,KAAKo6E,WAAYp6E,KAAKmjF,kBAAmBnjF,KAAK2iF,UAAW3iF,KAAKpE,KAAMoE,KAAK4R,MAAO5R,KAAKm0D,MAAOn0D,KAAK67E,SAAU9d,EAC/I,CACA,GAAA2b,GACI,MAAMA,EAAU,CAAEpjC,QAASt2C,KAAKs2C,QAAS9O,WAAYxnC,KAAKwnC,YACpD96B,EAAI1M,KAAK67E,SAQf,OAPI77E,KAAKpE,MAAQ8Q,GAA2B,OAAtBA,EAAE+uE,SAASP,QAAkC,KAAfxuE,EAAE0T,WAClDs5D,EAAQmC,SAAW,CACfjgF,KAAMoE,KAAKpE,KACXs/E,OAAQ,KACRY,QAASpvE,EAAEovE,UAGZpC,CACX,CAQA,aAAM4E,CAAQl+D,EAAUkiE,GACpB,aAAaD,GAAoBriF,MAAK05E,KAAYt5D,EAAU,CAAEkiE,oBAClE,CAWA,WAAAc,CAAYhjE,GACR,OAAO+hE,GAAwBniF,MAAK05E,KAAYt5D,EACpD,CAOA,eAAIijE,GAOA,OADArtE,EAAOhW,KAAKm0D,MAAQ,IAAK,iBAAkB,wBAAyB,CAAEz9C,UAAW,gBAC1E+rE,GAAkB/uE,EAAO,CAC5B,aAAcssE,GAAKhgF,KAAKm0D,MAAO,GAAIn0D,KAAKmjF,kBACxCnD,GAAKhgF,KAAK4R,MAAO,GAAI5R,KAAK2iF,UAC1BjvE,EAAO,CAAC,OAAQ1T,KAAKwnC,eAE7B,CAKA,OAAA87C,GAAY,OAAqB,MAAbtjF,KAAKpE,IAAe,CAQxC,MAAA2nF,GACI,OAAO,IAAIC,GAAiBp/D,GAAQpkB,KAAKs2C,QAASt2C,KAAK+wC,UAAW/wC,KAAKmjF,kBAAmBnjF,KAAK2iF,UAAW3iF,KAAKpE,KAAMoE,KAAK4R,MAAO5R,KAAKm0D,MAAOn0D,KAAK+9D,SACtJ,CAIA,WAAAilB,CAAYS,GACR,MAAM7xE,EAAQgH,EAAU6qE,EAAQ,SAChCxtE,EAAerE,GAAS,WAAY,gBAAiB,QAASA,GAE9D,IAAIhW,EAAOoE,KAAKpE,KACZA,IACAA,GAAQ,KAAe,WAARgW,GACXA,EAAQ4wE,KACR5mF,GAAQ,MAGhB,MAAMinF,GAAEA,EAAED,GAAEA,GAAOF,GAAM9wE,EAAO5R,KAAK2iF,UAAW3iF,KAAK+wC,UAAW/wC,KAAKwnC,YAC/Dk8C,EAAK,IAAInuC,GAAWh8B,GAASD,EAASspE,GAAMvtE,OAAOrV,KAAKwnC,aAAe5mC,GAAG,KAChF,OAAO,IAAIqiF,GAAa7+D,GAAQs/D,EAAI1jF,KAAKkjF,YAAazrE,EAAQorE,GAAKjnF,EAAMgW,EAAO5R,KAAKm0D,MAAQ,EAAGn0D,KAAK67E,SAAU77E,KAAK+9D,SACxH,CAIA,UAAA+kB,CAAWlnF,GACP,OAAOknF,GAAW9iF,KAAMpE,EAC5B,CACA,SAAO+nF,CAAUC,EAAO/H,GACpB5lE,EAAesB,EAAYqsE,GAAQ,eAAgB,OAAQ,cAC3D,MAAM7jD,EAAO3oB,EAASwsE,EAAO,QAC7B3tE,EAAe8pB,EAAKnjC,QAAU,IAAMmjC,EAAKnjC,QAAU,GAAI,eAAgB,OAAQ,cAC/E,MAAMgtC,EAAIxyB,EAAS0c,GAAY,SAAUyuD,GAAcxiD,IACjDq6C,EAAa,IAAI7kC,GAAW99B,EAAQmyB,EAAEnuC,MAAM,EAAG,MACrD,OAAO,IAAIwnF,GAAa7+D,GAAQg2D,EAAY,aAAc3iE,EAAQmyB,EAAEnuC,MAAM,KAAM,IAAK,EAAG,EAAGogF,EAAU,KACzG,CAQA,sBAAOgI,CAAgBR,GACnB,MAAM3rE,EAAQ8B,E3FrNf,SAAsB1F,GACzB,IAAIsB,EAASgD,EACb,IAAK,IAAIjb,EAAI,EAAGA,EAAI2W,EAAMlX,OAAQO,IAC9BiY,GAAU4E,EACV5E,GAAU0E,EAAShG,EAAM3W,IAE7B,OAAOiY,CACX,C2F8MgC0uE,CAAaT,IACrCptE,EAAgC,KAAjByB,EAAM9a,QAAiB6lF,GAAkB/qE,EAAMjc,MAAM,EAAG,OAAS4nF,EAAa,uBAAwB,cAAe,gBACpI,MAAMlvB,EAAQz8C,EAAM,GACdyrE,EAAoB1rE,EAAQC,EAAMjc,MAAM,EAAG,IAC3CmW,EAAQsF,SAASO,EAAQC,EAAMjc,MAAM,EAAG,KAAK0b,UAAU,GAAI,IAC3DwrE,EAAYlrE,EAAQC,EAAMjc,MAAM,GAAI,KACpC4J,EAAMqS,EAAMjc,MAAM,GAAI,IAC5B,OAAQgc,EAAQC,EAAMjc,MAAM,EAAG,KAE3B,IAAK,aACL,IAAK,aAAc,CACf,MAAMs1C,EAAYt5B,EAAQpS,GAC1B,OAAO,IAAIm+E,GAAiBp/D,GAAQ4mC,GAAeja,GAAYA,EAAWoyC,EAAmBR,EAAW,KAAM/wE,EAAOuiD,EAAO,KAChI,CAEA,IAAK,aACL,IAAK,cACD,GAAe,IAAX9uD,EAAI,GACJ,MAEJ,OAAO,IAAI49E,GAAa7+D,GAAQ,IAAImxB,GAAWlwC,EAAI5J,MAAM,IAAK0nF,EAAmBR,EAAW,KAAM/wE,EAAOuiD,EAAO,KAAM,MAE9Hl+C,GAAe,EAAO,8BAA+B,cAAe,eACxE,CAIA,mBAAO8tE,CAAa3jE,EAAUxkB,EAAM6/E,GAChB,MAAZr7D,IACAA,EAAW,IAEH,MAARxkB,IACAA,EAAOykF,IAEK,MAAZ5E,IACAA,EAAWC,GAAOD,YAEtB,MAAMI,EAAWS,GAASG,YAAYz4D,GAAY,IAAK5D,EAAUq7D,GACjE,OAAOwH,IAAaU,GAAU9H,EAASU,cAAeV,GAAUiH,WAAWlnF,EAC/E,CAIA,mBAAOooF,CAAanI,EAAUjgF,GAI1B,OAHKA,IACDA,EAAOykF,IAEJ4C,IAAaU,GAAU9H,EAASU,cAAeV,GAAUiH,WAAWlnF,EAC/E,CAIA,iBAAO4gF,CAAWrB,EAAQ/6D,EAAUxkB,EAAM6/E,GACtB,MAAZr7D,IACAA,EAAW,IAEH,MAARxkB,IACAA,EAAOykF,IAEK,MAAZ5E,IACAA,EAAWC,GAAOD,YAEtB,MAAMI,EAAWS,GAASE,WAAWrB,EAAQ/6D,EAAUq7D,GACvD,OAAOwH,IAAaU,GAAU9H,EAASU,cAAeV,GAAUiH,WAAWlnF,EAC/E,CAIA,eAAO+nF,CAAS5jD,GACZ,OAAOkjD,IAAaU,GAAU5jD,EAAM,KACxC,EAUG,MAAMyjD,WAAyBrO,GAIlCpkC,UAQAmyC,YAIAC,kBAKAR,UAQA/mF,KAKAgW,MAKAuiD,MAIA,WAAAt2D,CAAYgZ,EAAOy/B,EAASvF,EAAWoyC,EAAmBR,EAAW/mF,EAAMgW,EAAOuiD,EAAO4J,GACrFp0D,MAAM2sC,EAASynB,GACfpnD,EAAcE,EAAOuN,GAAQ,oBAC7BzP,EAAiB3U,KAAM,CAAE+wC,cAEzBp8B,EAAiB3U,KAAM,CACnB+wC,YAAWmyC,YAFKrrE,EAAUohB,GAAUvK,GAAOqiB,IAAa,EAAG,GAEnCoyC,oBAAmBR,YAAW/mF,OAAMgW,QAAOuiD,SAE3E,CACA,OAAA6R,CAAQjI,GACJ,OAAO,IAAIylB,GAAiBp/D,GAAQpkB,KAAKs2C,QAASt2C,KAAK+wC,UAAW/wC,KAAKmjF,kBAAmBnjF,KAAK2iF,UAAW3iF,KAAKpE,KAAMoE,KAAK4R,MAAO5R,KAAKm0D,MAAO4J,EACjJ,CAOA,eAAIslB,GAOA,OADArtE,EAAOhW,KAAKm0D,MAAQ,IAAK,iBAAkB,wBAAyB,CAAEz9C,UAAW,gBAC1E+rE,GAAkB/uE,EAAO,CAC5B,aACAssE,GAAKhgF,KAAKm0D,MAAO,GACjBn0D,KAAKmjF,kBACLnD,GAAKhgF,KAAK4R,MAAO,GACjB5R,KAAK2iF,UACL3iF,KAAK+wC,YAEb,CAKA,OAAAuyC,GAAY,OAAqB,MAAbtjF,KAAKpE,IAAe,CAIxC,WAAAonF,CAAYS,GACR,MAAM7xE,EAAQgH,EAAU6qE,EAAQ,SAChCxtE,EAAerE,GAAS,WAAY,gBAAiB,QAASA,GAE9D,IAAIhW,EAAOoE,KAAKpE,KACZA,IACAA,GAAQ,KAAe,WAARgW,GACXA,EAAQ4wE,KACR5mF,GAAQ,MAGhB,MAAMinF,GAAEA,EAAED,GAAEA,GAAOF,GAAM9wE,EAAO5R,KAAK2iF,UAAW3iF,KAAK+wC,UAAW,MAC1DkzC,EAAK1uC,GAAWQ,UAAU6sC,EAAI5iF,KAAK+wC,WAAW,GAC9CuF,EAAU0U,GAAei5B,GAC/B,OAAO,IAAIT,GAAiBp/D,GAAQkyB,EAAS2tC,EAAIjkF,KAAKkjF,YAAazrE,EAAQorE,GAAKjnF,EAAMgW,EAAO5R,KAAKm0D,MAAQ,EAAGn0D,KAAK+9D,SACtH,CAIA,UAAA+kB,CAAWlnF,GACP,OAAOknF,GAAW9iF,KAAMpE,EAC5B,ECzbG,SAASsoF,GAAgBz4E,GAC5B,IAEI,GADajF,KAAK+E,MAAME,GACf04E,QACL,OAAO,CAEd,CACD,MAAOjwE,GAAU,CACjB,OAAO,CACX,CAYO,SAASkwE,GAAqB34E,EAAM8f,GACvC,MAAM3sB,EAAO4H,KAAK+E,MAAME,GAClB2U,EAAW6/D,GAAY10D,GAEvB+qB,EAAUM,GAAWspC,GAAQthF,EAAM,oBAEnCulF,EAAUrE,GAAcI,GAAQthF,EAAM,oBAC5CqX,EAAekuE,GAAYA,EAAQvnF,OAAS,IAAQ,EAAG,kBAAmB,OAAQ6O,GAClF,MAAMpG,EAAM+R,EAAS6U,GAAO7L,EAAUA,EAAU,IAAM,GAAI,WAAW3kB,MAAM,EAAG,IACxEujF,EAAKmF,EAAQ1oF,MAAM,EAAG,IACtB4oF,EAAgBF,EAAQ1oF,MAAM,IAG9BskC,ECrCH,SAAoBnhC,GACvB,GAAIA,EAAKhC,OAAS,GACd,MAAM,IAAIiZ,UAAU,yBAExB,MAAMyuE,EAAS1lF,EAAKA,EAAKhC,OAAS,GAClC,GAAI0nF,EAAS,GACT,MAAM,IAAIzuE,UAAU,oCAExB,MAAMjZ,EAASgC,EAAKhC,OAAS0nF,EAC7B,IAAK,IAAInnF,EAAI,EAAGA,EAAImnF,EAAQnnF,IACxB,GAAIyB,EAAKhC,EAASO,KAAOmnF,EACrB,MAAM,IAAIzuE,UAAU,+BAG5B,OAAO,IAAIX,WAAWtW,EAAK2tB,SAAS,EAAG3vB,GAC3C,CDsBiB2nF,CAAWntE,EADT,IAAI2nE,GAAI15E,EAAK25E,GACYR,QAAQ6F,KAEhD,IAAIG,EAAU,GACd,IAAK,IAAIrnF,EAAI,EAAGA,EAAI4iC,EAAKnjC,OAAQO,IAC7BqnF,GAAWpoF,OAAOoa,aAAaupB,EAAK5iC,IAExC,MAAO,CAAEm5C,UAAS9O,WAAYjmC,GAAGijF,GACrC,CE9CA,SAAS7iE,GAAMy0D,GACX,OAAO,IAAI5hE,SAAS5J,IAAcvM,YAAW,KAAQuM,GAAS,GAAKwrE,EAAS,GAChF,QAWO,MAAMqO,UAAetK,GAKxB,WAAAt8E,CAAYwH,EAAK04D,GACQ,iBAAjB,GAA8B14D,EAAIsU,WAAW,QAC7CtU,EAAM,KAAOA,GAGjBsE,MADmC,iBAAjB,EAA6B,IAAI4rC,GAAWlwC,GAAOA,EACnD04D,EACtB,CACA,OAAAiI,CAAQjI,GACJ,OAAO,IAAI0mB,EAAOzkF,KAAKo6E,WAAYrc,EACvC,CAQA,aAAMugB,CAAQl+D,EAAUkiE,GACpB,MAAM5I,EAAU,CAAEpjC,QAASt2C,KAAKs2C,QAAS9O,WAAYxnC,KAAKwnC,YAC1D,aAAa66C,GAAoB3I,EAASt5D,EAAU,CAAEkiE,oBAC1D,CAWA,WAAAc,CAAYhjE,GAER,OAAO+hE,GADS,CAAE7rC,QAASt2C,KAAKs2C,QAAS9O,WAAYxnC,KAAKwnC,YAClBpnB,EAC5C,CACA,SAAOskE,CAAahL,GAEhB,GADAzjE,EAAeyjE,EAAS,sBAAuB,OAAQ,gBACnD,aAAcA,GAAWA,EAAQmC,UAAwC,OAA5BnC,EAAQmC,SAASX,OAAiB,CAC/E,MAAMW,EAAWS,GAASG,YAAY/C,EAAQmC,SAASC,SACjD6I,EAAS1B,GAAae,aAAanI,EAAUnC,EAAQmC,SAASjgF,MACpE,GAAI+oF,EAAOruC,UAAYojC,EAAQpjC,SAAWquC,EAAOn9C,aAAekyC,EAAQlyC,WACpE,OAAOm9C,EAEX7iF,QAAQ6E,IAAI,mFAChB,CACA,MAAMg+E,EAAS,IAAIF,EAAO/K,EAAQlyC,YAElC,OADAvxB,EAAe0uE,EAAOruC,UAAYojC,EAAQpjC,QAAS,8BAA+B,OAAQ,gBACnFquC,CACX,CAQA,8BAAaC,CAAkBn5E,EAAM2U,EAAUwd,GAC3C,IAAI87C,EAAU,KAed,OAdI4G,GAAe70E,GACfiuE,QJyDLplE,eAAmC7I,EAAM8f,EAAWqS,GACvD,MAAMh/B,EAAO4H,KAAK+E,MAAME,GAClB2U,EAAW6/D,GAAY10D,GACvB5K,EAASigE,GAAoBhiF,GACnC,GAAoB,WAAhB+hB,EAAOlW,KAAmB,CACtBmzB,IACAA,EAAS,SACHjc,GAAM,IAEhB,MAAMkK,KAAEA,EAAI1V,MAAEA,EAAKuV,MAAEA,EAAK+H,UAAEA,GAAc9S,EACpCtb,EAAM4mB,GAAO7L,EAAUyL,EAAM1V,EAAOuV,EAAO+H,GAKjD,OAJImK,IACAA,EAAS,SACHjc,GAAM,IAET4+D,GAAW3hF,EAAMyG,EAC3B,CACD2Q,EAAuB,WAAhB2K,EAAOlW,KAAmB,oBAAqB,gBAAiB,CAAEkW,WACzE,MAAMkL,KAAEA,EAAIjrB,EAAEA,EAAClB,EAAEA,EAAC5D,EAAEA,EAAC4vB,MAAEA,GAAU/K,EAEjC,OAAO4/D,GAAW3hF,QADA8+B,GAAOtd,EAAUyL,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,EAAOkS,GAE7D,CI9E4BinD,CAAoBp5E,EAAM2U,EAAUwd,GAE/CsmD,GAAgBz4E,KACjBmyB,IACAA,EAAS,SACHjc,GAAM,IAEhB+3D,EAAU0K,GAAqB34E,EAAM2U,GACjCwd,IACAA,EAAS,SACHjc,GAAM,KAGb8iE,GAAOC,GAAahL,EAC/B,CAQA,4BAAOoL,CAAsBr5E,EAAM2U,GAC/B,IAAIs5D,EAAU,KAUd,OATI4G,GAAe70E,GACfiuE,EJIL,SAAiCjuE,EAAM8f,GAC1C,MAAM3sB,EAAO4H,KAAK+E,MAAME,GAClB2U,EAAW6/D,GAAY10D,GACvB5K,EAASigE,GAAoBhiF,GACnC,GAAoB,WAAhB+hB,EAAOlW,KAAmB,CAC1B,MAAMohB,KAAEA,EAAI1V,MAAEA,EAAKuV,MAAEA,EAAK+H,UAAEA,GAAc9S,EAE1C,OAAO4/D,GAAW3hF,EADNqtB,GAAO7L,EAAUyL,EAAM1V,EAAOuV,EAAO+H,GAEpD,CACDzd,EAAuB,WAAhB2K,EAAOlW,KAAmB,oBAAqB,gBAAiB,CAAEkW,WACzE,MAAMkL,KAAEA,EAAIjrB,EAAEA,EAAClB,EAAEA,EAAC5D,EAAEA,EAAC4vB,MAAEA,GAAU/K,EAEjC,OAAO4/D,GAAW3hF,EADNi/B,GAAWzd,EAAUyL,EAAMjrB,EAAGlB,EAAG5D,EAAG4vB,GAEpD,CIjBsBq5D,CAAwBt5E,EAAM2U,GAEnC8jE,GAAgBz4E,GACrBiuE,EAAU0K,GAAqB34E,EAAM2U,GAGrCnK,GAAe,EAAO,sBAAuB,OAAQ,gBAElDwuE,GAAOC,GAAahL,EAC/B,CAOA,mBAAOqK,CAAahmB,GAChB,MAAM4mB,EAAS1B,GAAac,eAC5B,OAAIhmB,EACO4mB,EAAO3e,QAAQjI,GAEnB4mB,CACX,CAIA,iBAAOnI,CAAWrB,EAAQpd,GACtB,MAAM4mB,EAAS1B,GAAazG,WAAWrB,GACvC,OAAIpd,EACO4mB,EAAO3e,QAAQjI,GAEnB4mB,CACX,q+jCC7IJ,IAAIK,GAAoB,CACtBC,2BAA4B,6CAC5BC,0BAA2B,8CAG7B,GAAsB,oBAAXx+E,OAAwB,CACjC,MAAMy+E,cAAEA,GAAkBC,IACpBC,QAAEA,GAAYC,IACdC,aAAEA,GAAiBC,IACnB39E,KAAEA,GAASy9E,GAEjB,IACE,MAAMG,EAAaN,cAA0B59E,KAEvCm+E,EAAUH,EAAa19E,EADXw9E,EAAQI,GACmB,yBAA0B,QACvET,GAAoBx+E,KAAK+E,MAAMm6E,GAC/B5jF,QAAQ6E,IAAI,6BAA8Bq+E,GAC3C,CAAC,MAAO9wE,IACPpS,QAAQgP,KAAK,sDACd,CACH,CAEO,MAAM60E,GAAe,CAC1BC,SAAU,KACVX,2BAA4BD,GAAkBC,2BAC9CC,0BAA2BF,GAAkBE,0BAC7CW,QAAS,wBACTC,SAAU,6BCxBCC,GAAe,CAC1BC,gBAAiB,CACfd,0BAA2B,6CAC3BD,2BAA4B,QAC5BY,QAAS,8BACTD,SAAU,UAEZK,gBAAiB,CACff,0BAA2B,QAC3BD,2BAA4B,QAC5BY,QAAS,yCACTD,SAAU,QAEZM,UAAW,CACTL,QAAS,wBACTD,SAAU,OASP,SAASO,GAAqBC,GACnC,IAAIC,EAGJ,GAAkB,cAAdD,EACF,IAQE,OALAC,EAAS,IACJN,GAAaG,aAFKd,IAKvBtjF,QAAQ6E,IAAI,yBAA0B0/E,GAC/BA,CACR,CAAC,MAAOlkF,GAEP,MADAL,QAAQgP,KAAK,4BACP,IAAIqD,MAAM,0DACjB,CAKH,GADAkyE,EAASN,GAAaK,IACjBC,EACH,MAAM,IAAIlyE,MAAM,SAASiyE,sCAA8C3oF,OAAOU,KAAK4nF,IAAcl+E,KAAK,SAGxG,OAAOw+E,CACT,CA/ByCN,GAAaC,gBAAgBd,0BAC5Ba,GAAaC,gBAAgBf,2BAuChE,MAAMqB,GAAwB,CACnC,CACE5vB,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,cACRsJ,KAAQ,YAGZ+jD,gBAAmB,aACnB/jD,KAAQ,eAEV,CACE0jD,WAAa,EACbf,OAAU,CACR,CACE6vB,aAAgB,SAChB97E,KAAQ,kBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,SAChB97E,KAAQ,oBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,iBACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,YACRsJ,KAAQ,YAGZtJ,KAAQ,0BACRsJ,KAAQ,SAEV,CACE0jD,WAAa,EACbf,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,aACRsJ,KAAQ,YAGZtJ,KAAQ,oBACRsJ,KAAQ,SAEV,CACE0jD,WAAa,EACbf,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,SACRsJ,KAAQ,YAGZtJ,KAAQ,gBACRsJ,KAAQ,SAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,SAChB97E,KAAQ,kBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,SAChB97E,KAAQ,oBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,iBACRsJ,KAAQ,YAGZtJ,KAAQ,kBACRwtD,QAAW,GACXH,gBAAmB,UACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,GACVjsD,KAAQ,aACRwtD,QAAW,CACT,CACEsuB,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,GACVjsD,KAAQ,SACRwtD,QAAW,CACT,CACEsuB,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,GACVjsD,KAAQ,wBACRwtD,QAAW,CACT,CACEsuB,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,YACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,UACRsJ,KAAQ,YAGZtJ,KAAQ,0BACRwtD,QAAW,CACT,CACErC,WAAc,CACZ,CACE2wB,aAAgB,SAChB97E,KAAQ,kBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,SAChB97E,KAAQ,oBACRsJ,KAAQ,UAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,iBACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,YACRsJ,KAAQ,YAGZwyE,aAAgB,gDAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,UACRsJ,KAAQ,YAGZtJ,KAAQ,eACRwtD,QAAW,GACXH,gBAAmB,aACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,cACRsJ,KAAQ,YAGZtJ,KAAQ,mBACRwtD,QAAW,GACXH,gBAAmB,aACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,GACVjsD,KAAQ,mBACRwtD,QAAW,GACXH,gBAAmB,aACnB/jD,KAAQ,aAICyyE,GAAyB,CACpC,CACE9vB,OAAU,CACR,CACE6vB,aAAgB,UAChB97E,KAAQ,UACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,YAChB97E,KAAQ,gBACRsJ,KAAQ,cAGZtJ,KAAQ,kBACRwtD,QAAW,GACXH,gBAAmB,aACnB/jD,KAAQ,YAEV,CACE0jD,WAAa,EACbf,OAAU,CACR,CACEf,SAAW,EACX4wB,aAAgB,QAChB97E,KAAQ,SACRsJ,KAAQ,SAEV,CACE4hD,SAAW,EACX4wB,aAAgB,UAChB97E,KAAQ,cACRsJ,KAAQ,WAEV,CACE4hD,SAAW,EACX4wB,aAAgB,UAChB97E,KAAQ,UACRsJ,KAAQ,YAGZtJ,KAAQ,cACRsJ,KAAQ,SAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,QAChB97E,KAAQ,SACRsJ,KAAQ,UAGZtJ,KAAQ,kBACRwtD,QAAW,CACT,CACEsuB,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,QAChB97E,KAAQ,SACRsJ,KAAQ,SAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,cACRsJ,KAAQ,YAGZtJ,KAAQ,aACRwtD,QAAW,GACXH,gBAAmB,aACnB/jD,KAAQ,YAEV,CACE2iD,OAAU,CACR,CACE6vB,aAAgB,QAChB97E,KAAQ,SACRsJ,KAAQ,SAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,cACRsJ,KAAQ,YAGZtJ,KAAQ,aACRwtD,QAAW,CACT,CACEsuB,aAAgB,OAChB97E,KAAQ,GACRsJ,KAAQ,QAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,WAEV,CACEwyE,aAAgB,UAChB97E,KAAQ,GACRsJ,KAAQ,YAGZ+jD,gBAAmB,OACnB/jD,KAAQ,cCxYV,WAGA,SAAS1Y,EAAIC,EAAKC,GAChB,OAAOA,EAAKC,EAAQF,GAAOA,EAAIG,MAAOJ,EAAIK,EAAEJ,IAAQ,SAASK,EAAKC,GAChEN,EAAIK,EAAM,CAACE,QAAS,CAAA,IACpBR,EAAIK,EAAEE,IAASD,EAAIE,OACzB,EACI,SAASH,EAAEI,GACT,OAAOA,EAAEC,MAAM,KAAKN,OAAO,GAAGO,WAAWC,QAAQ,MAAM,GAC7D,CACA,CACE,GAAqB,oBAAXE,OAAyB,IAAID,EAASC,OAG/Cd,GAAI,SAASc,GAMO,oBAATi3B,OAAuBj3B,EAAOuK,OAAS0sB,MAC5B,oBAAX1sB,SAAyBvK,EAAOuK,OAASA,QAEnD,IACI+/E,GADMtqF,EAAOuK,QAAUvK,GACbsqF,KAAO,IAElBA,EAAI//E,OAASvK,EAAOuK,UAAS+/E,EAAI//E,OAAO+/E,IAAMA,GAEjD,IALmCxpF,UAKzB,WAAcf,IAASA,EAAOL,QAAU4qF,EAAO,CAAA,MAAM9nF,GAAE,CACjExC,EAAON,QAAU4qF,CACrB,GAhBGprF,CAgBEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACd,IAAQorF,EAAI//E,QACP4a,SAAStF,SAAS9d,QAAQ,KAAO,GACjCojB,SAASolE,KAAKxoF,QAAQ,aAAe,IACnC,uBAAuB4L,KAAKwX,SAASqlE,WACvCrlE,SAAStF,SAAS9d,QAAQ,SAAW,IACtC4D,QAAQgP,KAAK,qDACbwQ,SAAStF,SAAW,SAErB,CAAA,MAAMrd,GAAE,CACf,GAXGtD,CAWEA,EAAK,WAEPA,GAAI,SAASc,GACZ,IAAIc,EACDA,EAAE,WAAYwiB,OAIf4T,GAAO5T,KAAO,SAAS7gB,GAAO,OAAOgoF,GAAOn/E,KAAK7I,EAAM,UAAU5C,SAAS,SAAS,EACnFq3B,GAAOpV,KAAO,SAASrf,GAAO,OAAOgoF,GAAOn/E,KAAK7I,EAAM,UAAU5C,SAAS,SAAS,EAEzF,GATGX,CASEA,EAAK,YAEPA,GAAI,SAASc,GAGZ,SAAS0qF,IAAW,CAFpBxrF,EAAI,YAGJoC,OAAOsY,OAAO8wE,EAAU,CAAEp/E,KAAMJ,MAAMI,OACtCo/E,EAASnpF,UAAYD,OAAO6E,OAAO+E,MAAM3J,WACzCmpF,EAASnpF,UAAU1B,SAAW,SAAS8qF,EAAKhvE,EAAOzR,GAAOygF,EAAMA,GAAO,OAAQhvE,EAAQA,GAAS,EAC9F,MAAMlb,EAASoD,KAAKpD,OACpB,GAAY,QAARkqF,EAAe,CACjB,MAAM/7D,EAAM,IAAI7V,WAAWlV,MAC3B,MAAO,IAAKqH,OAAQhB,GAAQA,EAAM,GAAOzJ,GAAUkb,GAAO3Z,QACzD8H,KAAK9I,GAAM4tB,EAAK5tB,EAAI2a,GAAQ9b,SAAS,IAAImiC,SAAS,EAAG,OAAMt2B,KAAK,GACzE,CACM,MAAY,SAARi/E,EACKz/E,MAAMI,KACX,CAAE7K,QAASyJ,GAAOzJ,GAAUkb,IAC5B,CAAC7X,EAAG9C,IAAMf,OAAOoa,aAAaxW,KAAM7C,EAAI2a,MACxCjQ,KAAK,IAEG,WAARi/E,EACKrnE,KAAKzf,WADd,CAGN,EACI7D,EAAON,QAAUgrF,CACrB,GAxBGxrF,CAwBEA,EAAK,WAEPA,GAAI,SAASc,GACZd,EAAI,YAMJ,IAAIwrF,EAAWxrF,EAAI,WACnB,SAAS0rF,KAAcvb,GAErB,OADA1pE,QAAQgP,KAAK,iEACNi2E,EAAWt/E,QAAQ+jE,EAChC,CACIub,EAAWrpF,UAAYD,OAAO6E,OAAO+E,MAAM3J,WAC3CD,OAAOsY,OAAOgxE,EAAY,CAExB,IAAAt/E,GACE,IAAKhK,OAAOU,KAAKyJ,WAAWhL,QAAwB,MAAdgL,UAAU,GAC9C,MAAM,IAAIiO,UAAU,sFAEtB,MAAMkkB,EAAQnyB,UAAU,GACxB,IAAImjB,EACJ,GAAqB,iBAAVgP,EAAoB,CAC7B,MAAM+sD,EAAMl/E,UAAU,IAAM,OAC5B,GAAY,QAARk/E,EAAe,CACjB,MAAMpvE,EAAQqiB,EAAMl9B,MAAM,oBACzBoJ,KAAKy4B,GAASxnB,SAASwnB,EAAM,MAC9B,IAAKhnB,IAAUA,EAAM9a,OACnB,MAAM,IAAIiZ,UAAU,0CAEtBkV,EAAM87D,EAASp/E,KAAKiQ,EACrB,MAAM,GAAY,SAARovE,GAAkB,WAAaA,EAAK,CAC7C,MAAMlqF,EAASm9B,EAAMn9B,OACf89E,EAAQ,IAAIsM,YAAYpqF,GAC9ByK,MAAMI,KAAK,CAAE7K,OAAQA,IAAU,CAACqD,EAAG9C,IAAMu9E,EAAMv9E,GAAK48B,EAAM38B,WAAWD,KACrE4tB,EAAM87D,EAASp/E,KAAKizE,EAChC,MAAiB,GAAY,WAARoM,EAAkB,CAC3B,MAAMG,EAAMhpE,KAAK8b,GACXn9B,EAASqqF,EAAIrqF,OACb8a,EAAQ,IAAIxC,WAAWtY,GAC7ByK,MAAMI,KAAK,CAAE7K,OAAQA,IAAU,CAACqD,EAAG9C,IAAMua,EAAMva,GAAK8pF,EAAI7pF,WAAWD,KACnE4tB,EAAM87D,EAASp/E,KAAKiQ,EAChC,KAA6B,WAARovE,EACT/7D,EAAM87D,EAASp/E,KAAKsyB,GAEpBj4B,QAAQ4T,KAAK,qCAAqCoxE,GAEpD,OAAO/7D,CACjB,CAC2BgP,EAAMnR,WAEzB,GADemR,EAAMnR,WAAamR,EAAMnR,WAAamR,EAAMn9B,OAC/C,CACV,IAAImuB,EAIJ,OAHIgP,aAAiBmtD,cACnBn8D,EAAM,IAAI7V,WAAW6kB,IAEhB8sD,EAASp/E,KAAKsjB,GAAOgP,EACtC,CACO,EAEDotD,MAAK,CAACvqF,EAAQsb,EAAO,IACZ2uE,EAASp/E,KAAK,IAAIyN,WAAW7N,MAAMI,KAAK,CAAE7K,OAAQA,IAAU,IAAMsb,MAG3EkvE,YAAYxqF,GACHiqF,EAASp/E,KAAK,IAAIyN,WAAW7N,MAAMI,KAAK,CAAE7K,OAASA,MAG5D,MAAA8W,CAAOF,GACL,IAAKnM,MAAM4N,QAAQzB,GACjB,MAAM,IAAIqC,UAAU,gFAEtB,OAAOgxE,EAASp/E,KAAK+L,EAAIiB,QAAO,CAACstC,EAAKz2C,IAASy2C,EAAIruC,OAAOrM,MAAMI,KAAK6D,KAAQ,IACrF,IAEIy7E,EAAWrpF,UAAU+J,KAAOs/E,EAAWt/E,KACvCs/E,EAAWrpF,UAAU1B,SAAW6qF,EAASnpF,UAAU1B,SAEnDG,EAAON,QAAUkrF,CACrB,GA9EG1rF,CA8EEA,EAAK,YAEPA,GAAI,SAASc,GACZ,MAAMsqF,EAAMprF,EAAI,UACVgsF,EAAM,CAACT,OAAQvrF,EAAI,aACzB,IAAI0B,EAAI,CAAE,EAoBV,GAjBAyJ,KAAKgF,WAAahF,KAAKgF,YAAc,SAAS1O,EAAEkF,EAAGtC,GAAW,IAAKsC,EAAR/E,UAAcuJ,KAAK+E,MAAMzO,EAAE4C,GAAK,CAAA,MAAMf,GAAIqD,EAAGrD,EAAE,CAAE,EAC5G6H,KAAKmF,eAAiBnF,KAAKmF,gBAAkB,SAASlL,EAAEuB,EAAGtC,EAAElD,GAAW,IAAKwF,EAAR/E,UAAcuJ,KAAKC,UAAUhG,EAAEf,EAAElD,GAAG,CAAE,MAAMmC,GAAIqD,EAAGrD,EAAE,CAAE,EAE5H0oF,EAAI97E,MAAQ,SAASzO,EAAE4C,GAAI,OAAO,IAAI8U,SAAQ,SAAS9F,EAAK44E,GAC1D9gF,KAAKgF,WAAW1O,GAAE,SAASqF,EAAKiK,GAAMjK,EAAKmlF,EAAInlF,GAAOuM,EAAItC,EAAM,GAAC1M,EACvE,GAAM,EACF2nF,EAAI5gF,UAAY,SAAShG,EAAEf,EAAElD,GAAI,OAAO,IAAIgY,SAAQ,SAAS9F,EAAK44E,GAChE9gF,KAAKmF,eAAelL,GAAE,SAAS0B,EAAKiK,GAAMjK,EAAKmlF,EAAInlF,GAAOuM,EAAItC,EAAI,GAAG1M,EAAElD,EAC7E,GAAM,EAECiqF,EAAI//E,SACL2gF,EAAI/+D,OAASm+D,EAAI//E,OAAO4hB,QAAUm+D,EAAI//E,OAAO6sB,SAC7C8zD,EAAIE,QAAUF,EAAI/+D,QAAQvrB,GAAGwqF,SAAWF,EAAI/+D,QAAQvrB,GAAGyqF,aACvDH,EAAI59D,YAAcg9D,EAAI//E,OAAO+iB,YAC7B49D,EAAII,YAAchB,EAAI//E,OAAO+gF,YAC7BJ,EAAIhrF,OAAUywB,GAAQu6D,EAAIT,OAAOn/E,KAAK4/E,EAAI/+D,OAAOkC,gBAAgB,IAAItV,WAAWmyE,EAAIT,OAAOO,MAAMr6D,QAE/Fu6D,EAAII,YACR,CACE,MAAMh+D,YAAEA,EAAWg+D,YAAEA,GAAgBpsF,GAtB3B4B,UAsBkC,WAAaf,EAAO,IAAI,IAAI,sBAAuB,GAC/FmrF,EAAII,YAAcA,EAClBJ,EAAI59D,YAAcA,CACxB,CACI,IAAI49D,EAAI/+D,OAEN,IAEA,IAAIA,EAASjtB,EAAI,SAAU,GAC3BoC,OAAOsY,OAAOsxE,EAAK,CACjB/+D,SACAjsB,OAASywB,GAAQu6D,EAAIT,OAAOn/E,KAAK6gB,EAAOtE,YAAY8I,MAEtD,MAAQu0D,OAAQqG,GAAcrsF,EAAI,sBAAuB,GACzDgsF,EAAIM,KAAON,EAAIE,OAAS,IAAIG,EAAU,CAACE,UAAW,SAASL,MACjE,CACI,MAAM5oF,GACJmD,QAAQ6E,IAAI,4EAClB,CAEIxK,EAAON,QAAUwrF,CACrB,GA9CGhsF,CA8CEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACXmB,EAAI,CACRA,OAAW,CAACU,KAAM,CAACuN,KAAO,WAAYq9E,KAAM,IAAQC,GAAI,IACxDvrF,MAAU,CACRye,KAAM,CAACxQ,KAAM,QAASu9E,WAAY,SAClCv3C,KAAM,CAAChmC,KAAM,QAASvN,KAAM,CAACuN,KAAM,aAErCjO,KAAS,CAACiO,KAAM,OAAQu9E,WAAY,SAGpCxrF,IAAQ,SAASq5C,EAAKvrC,GAEpB,IACI29E,EAAM,CAACC,IAAK,KAAMC,IAAK,QAASj2E,GAFpC2jC,EAAMA,EAAI95C,MAAM,MACJ,GAC8BiS,EADtB6nC,EAAI,GACwBuyC,KAAK,GAGrD,OAFAH,EAAII,QAAU/9E,EAAI,CAAC,QAAU,CAAC,UAC3BA,IAAI29E,EAAI39E,EAAIA,GACR29E,CACb,EAEIzrF,SAAa,SAAS8rF,GAGpB,MAAO,CAAEJ,IAAK,MAAOjqF,EAFNqqF,EAAStsF,SAAS,UAChBC,QAAQ,MAAO,KAAKA,QAAQ,MAAO,KAAKA,QAAQ,MAAO,IAC7CmsF,KAAK,EAAOG,IAAK,UAClD,EAEI/rF,OAAW,CACTgsF,SAAU,MACVC,KAAM,SAASjd,GAAQ,OAAOA,CAAO,GAGvChvE,MAAU,SAASM,GAAI,MAAoB,iBAALA,GAAmB,SAAWA,EAAErB,MAAM,EAAE,EAAG,EACjFe,MAAU8X,eAAiBxX,GAAI,IAC7B,IAAImL,EAAmB,iBAALnL,EAElB,OADGmL,GAAO,SAAWnL,EAAErB,MAAM,EAAE,KAAKqB,EAAIA,EAAErB,MAAM,IACzCwM,QAAY4/E,EAAKt8E,MAAMzO,GAAKA,CACzC,CAAQ,MAAO6B,GAAG,CACZ,OAAO7B,CACb,GAEI2pF,EAAItlF,IAAM3E,EACVL,EAAON,QAAUW,CACrB,GA3CGnB,CA2CEA,EAAK,cAEPA,GAAI,SAASc,GACZ,IAAI0rF,EAAOxsF,EAAI,UACfc,EAAON,QAAUyY,eAAehK,EAAGvN,GACjC,IAAID,EAAiB,iBAALwN,EAAgBA,QAAUu9E,EAAKphF,UAAU6D,GACrDpN,QAAa2qF,EAAKN,OAAOj9D,OAAO,CAAC7f,KAAM1N,GAAG,YAAY,IAAI8qF,EAAKp+D,aAAcC,OAAO5sB,IACxF,OAAO+qF,EAAKjB,OAAOn/E,KAAKvK,EAC9B,CACA,GAPG7B,CAOEA,EAAK,YAEPA,GAAI,SAASc,GAEZ,MAAMusF,EAASrtF,EAAI,UACbksF,EAASmB,EAAOnB,OAChBI,EAAOe,EAAOf,KAAOe,EAAOf,KAAOJ,EAEzCprF,EAAON,QADWqV,GAAMy2E,EAAKr9D,OAAO,CAAC7f,KAAM,SAAU,IAAIy8E,YAAYh2E,GAEzE,GAPG7V,CAOEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACXmE,EAAInE,EAAI,cACRstF,EAAMttF,EAAI,YAGdorF,EAAImC,KAAOnC,EAAImC,MAAS,OAAOhqF,EAAMqc,EAAMjZ,EAAIb,KAAU,IACvD,IAAI0qB,GAAQ5Q,GAAM,CAAA,GAAI4tE,MAAQ5tE,EAO9B,GANA9Z,EAAMA,GAAO,GACV0qB,aAAgBpG,WACjBzjB,EAAK6pB,EACLA,EAPA5uB,WASF2B,EAAuB,iBAARA,EAAmBA,QAAaipF,EAAKphF,UAAU7H,GAC3D,SAAWuC,EAAIsJ,MAAM,IAAIwR,cAAcxgB,MAAM,EAAE,GAAG,CACnD,IAAIqtF,EAAOjB,EAAKjB,OAAOn/E,WAAWkhF,EAAI/pF,EAAMuC,EAAIsJ,MAAO,UAAUzO,SAASmF,EAAIuoB,QAAU,UACxF,GAAG1nB,EAAK,IAAKA,EAAG8mF,EAAK,CAAE,MAAMnqF,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC9C,OAAOmqF,CACf,CACMj9D,EAAOA,GAAQg8D,EAAKxrF,OAAO,GAC3B,IAAIgJ,QAAawiF,EAAKF,MAAQE,EAAKN,QAAQwB,UAAU,OAAO,IAAIlB,EAAKp+D,aAAcC,OAAO9qB,GAAO,CAAC6L,KAAMtJ,EAAIsJ,MAAQ,WAAW,EAAO,CAAC,eACnIm+E,QAAcf,EAAKF,MAAQE,EAAKN,QAAQyB,WAAW,CACrDv+E,KAAMtJ,EAAIsJ,MAAQ,SAClB6uB,WAAYn4B,EAAIm4B,YAAc95B,EAAEysB,OAAO67D,KACvCj8D,MAAM,IAAIg8D,EAAKp+D,aAAcC,OAAOvoB,EAAI0qB,MAAQA,GAChD3uB,KAAMiE,EAAIjE,MAAQsC,EAAEysB,OAAO/uB,MAC1BmI,EAAKlE,EAAIvE,QAAyB,EAAd4C,EAAEysB,OAAO87D,IAChCnpF,EAAOipF,EAAKxrF,OAAOuC,EAAKhC,QACxB,IAAI8C,EAAImoF,EAAKjB,OAAOn/E,KAAKmhF,EAAM,UAAU5sF,SAASmF,EAAIuoB,QAAU,UAChE,GAAG1nB,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAImC,IACzB,GAzCGvtF,CAyCEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACPA,EAAI,cAEZorF,EAAIh8E,KAAOg8E,EAAIh8E,MAAS,OAAOzI,EAAIb,KAAU,IAC3C,GAAGa,EAAK,IAAKA,GAAM,CAAA,MAAMrD,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC1C,MACD,CAAC,MAAMA,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAGFykF,EAAIxrE,KAAOwrE,EAAIxrE,MAAS,OAAOjZ,EAAIb,KAAU,IAE3C,IAAI+nF,EAAarB,EAAKF,MAAQE,EAAKN,OAE/B4B,QAAWtB,EAAKN,OAAO6B,YAAY,CAAC3+E,KAAM,QAASu9E,WAAY,UAAU,EAAM,CAAE,OAAQ,WAC5F3xB,MAAK/hD,MAAOnW,IAGX,IAAIkH,EAAM,CAAA,EACVA,EAAIgkF,YAAcxB,EAAKN,OAAO+B,UAAU,MAAOnrF,EAAKqpC,aAAal9B,EACjE,IAAIurC,QAAYgyC,EAAKN,OAAO+B,UAAU,MAAOnrF,EAAK4yC,WAMlD,OAJA1rC,EAAIwwC,IAAMA,EAAI3jC,EAAE,IAAI2jC,EAAI7nC,EAIjB3I,CAAG,IAOZ,IACA,IAAIkkF,QAAWL,EAAWE,YAAY,CAAC3+E,KAAM,OAAQu9E,WAAY,UAAU,EAAM,CAAC,cACjF3xB,MAAK/hD,MAAOnW,IAEX,IAAIkH,EAAM,CAAA,EACVA,EAAImkF,aAAeN,EAAWI,UAAU,MAAOnrF,EAAKqpC,aAAal9B,EACjE,IAAIurC,QAAYqzC,EAAWI,UAAU,MAAOnrF,EAAK4yC,WAMjD,OAJA1rC,EAAIwjF,KAAOhzC,EAAI3jC,EAAE,IAAI2jC,EAAI7nC,EAIlB3I,CAAG,GAEX,CAAA,MAAM1G,GACL,GAAG8nF,EAAI//E,OAAS,MAAM/H,EACtB,GAAQ,4CAALA,EACI,MAAMA,EADwCmD,QAAQ6E,IAAI,mBAEzE,CAAQ4iF,EAAKA,GAAM,GAEb,IAAI7pF,EAAI,CAAEm2C,IAAKszC,EAAGtzC,IAAKwzC,KAAMF,EAAGE,KAAmBR,KAAMU,EAAGV,KAAMW,MAAOD,EAAGC,OAC5E,GAAGxnF,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAIxrE,IACzB,GAxEG5f,CAwEEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAIIc,EAJAwpF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACXmE,EAAInE,EAAI,cACRstF,EAAMttF,EAAI,YAGdorF,EAAIh2C,KAAOg2C,EAAIh2C,MAAS,OAAO7xC,EAAMqc,EAAMjZ,EAAIb,KAAU,IAEvD,GADAA,EAAMA,GAAO,KACR8Z,GAAM9Z,GAAKkoF,KAAK,CACnB,IAAI5C,EAAI78C,EAAI,KAAM,kBAClB3uB,QAAawrE,EAAI78C,EAAE,KAAM,CAAC6/C,KAAM7qF,EAAM8qF,IAAK,OAAQC,IAAKxoF,EAAIwoF,KACpE,CACM,GAAG1sF,IAAM2B,EAAO,KAAM,2BACtB,IAAI6M,QAAajM,EAAE+L,MAAM3M,GACrBrB,EAAQ4D,EAAI5D,MAAQ4D,EAAI5D,OAASkO,EACrC,GAAGg7E,EAAI51C,SAAW41C,EAAItlF,IAAI5D,MAAMA,IAAWA,GAASA,EAAMf,GAAKe,EAAMmP,IAClEzP,UAAYwpF,EAAI51C,OAAOtzC,EAAO0d,GAAM,CACrC,IAAIvb,QAAUF,EAAE+L,MAAMhO,GAEtB,GADI4D,EAAIiL,MAAM1M,EAAI,YAAcmoF,EAAKphF,UAAU/G,IAC5CsC,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACf,CACM,IAAIm2C,EAAM56B,EAAK46B,IACXwzC,EAAOpuE,EAAKouE,KACZpB,EAAMzoF,EAAEyoF,IAAIpyC,EAAKwzC,GACjBnsF,QAAayrF,EAAIl9E,GACjBi5B,QAAamjD,EAAKF,MAAQE,EAAKN,QAAQwB,UAAU,MAAOd,EAAK,CAACx9E,KAAM,QAASu9E,WAAY,UAAU,EAAO,CAAC,SAC9G3xB,MAAMhxD,IAASwiF,EAAKF,MAAQE,EAAKN,QAAQ92C,KAAK,CAAChmC,KAAM,QAASvN,KAAM,CAACuN,KAAM,YAAapF,EAAK,IAAI6P,WAAWhY,MACzGwC,EAAI,CAACgN,EAAGjB,EAAMjP,EAAGqrF,EAAKjB,OAAOn/E,KAAKi9B,EAAK,UAAU1oC,SAASmF,EAAIuoB,QAAU,WAG5E,GAFIvoB,EAAIiL,MAAM1M,EAAI,YAAcmoF,EAAKphF,UAAU/G,IAE5CsC,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAIh2C,IACzB,GA3CGp1C,CA2CEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAIIc,EAJAwpF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACXmE,EAAInE,EAAI,cACRstF,EAAMttF,EAAI,YAGdorF,EAAI51C,OAAS41C,EAAI51C,QAAW,OAAOjyC,EAAMqc,EAAMjZ,EAAIb,KAAU,IAC3D,IAAIsK,QAAajM,EAAE+L,MAAM3M,GACzB,IAAG,IAAUqc,EAAK,CAChB,IAAI7O,QAAY5M,EAAE+L,MAAME,EAAKiB,GAC7B,GAAG1K,EAAK,IAAKA,EAAGoK,EAAI,CAAE,MAAMzN,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC7C,OAAOyN,CACf,CACMjL,EAAMA,GAAO,GAEb,IAGI4pB,EAAK2Z,EAAKnnC,EAHVs4C,EAAM56B,EAAK46B,KAAO56B,EAClB5V,EAAMohF,EAAItlF,IAAIyoF,gBAAiBnD,EAAItlF,IAAIyoF,UAAU/zC,SAAcgyC,EAAKF,MAAQE,EAAKN,QAAQwB,UAAU,MAAOvpF,EAAEyoF,IAAIpyC,GAAM,CAACprC,KAAM,QAASu9E,WAAY,UAAU,EAAO,CAAC,WACpK9qF,QAAayrF,EAAIl9E,EAAKiB,GACA,IAIxB,GAHAqe,EAAM88D,EAAKjB,OAAOn/E,KAAKgE,EAAKjP,EAAG2E,EAAIuoB,QAAU,UAC7Cgb,EAAM,IAAIxvB,WAAW6V,KACrBxtB,QAAesqF,EAAKF,MAAQE,EAAKN,QAAQ12C,OAAO,CAACpmC,KAAM,QAASvN,KAAM,CAACuN,KAAM,YAAapF,EAAKq/B,EAAK,IAAIxvB,WAAWhY,KACvG,KAAM,0BACnB,CAAA,MAAMyB,GACL,GAAG8nF,EAAItlF,IAAI64D,SACT,aAAaysB,EAAItlF,IAAI0oF,YAAYjrF,EAAMqc,EAAMjZ,EAAIb,EAE3D,CACM,IAAIzB,EAAInC,QAAaiC,EAAE+L,MAAME,EAAKiB,GAAKzP,EAEvC,GAAG+E,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAI51C,OAGrB,IAAIi5C,EAAY,CAAA,EACCrD,EAAItlF,IAAIyoF,UAAY3uE,IACnC,GAAI6uE,EAAU7uE,GAAO,OAAO6uE,EAAU7uE,GACtC,IAAIgtE,EAAMzoF,EAAEyoF,IAAIhtE,GAEhB,OADA6uE,EAAU7uE,IAAS4sE,EAAKF,MAAQE,EAAKN,QAAQwB,UAAU,MAAOd,EAAK,CAACx9E,KAAM,QAASu9E,WAAY,UAAU,EAAO,CAAC,WAC1G8B,EAAU7uE,EAAK,EAGxB,IAAI8uE,EAAItD,EAAItlF,IACZslF,EAAItlF,IAAI0oF,YAAcv1E,eAAe1V,EAAMqc,EAAMjZ,EAAIb,EAAK5C,GACxD,GAAGA,IAAMkoF,EAAItlF,IAAI64D,SAAW,KAAM,0BAA4Bz7D,EAAIA,GAAK,EACvE,IAAIvB,EAAM4B,GAAM,GAChBA,EAAO6nF,EAAItlF,IAAIq+C,OAAO5gD,IAASA,EAC/B,IAEImsB,EAAS2Z,EAASnnC,EAFlBkO,QAAajM,EAAE+L,MAAM3M,GAAOi3C,EAAM56B,EAAK46B,KAAO56B,EAAM5V,QAAYohF,EAAItlF,IAAIyoF,UAAU/zC,GAClF34C,EAAQqB,GAAKkoF,EAAItlF,IAAI64D,SAAW6tB,EAAKjB,OAAOn/E,WAAWogF,EAAKN,OAAOj9D,OAAO,CAAC7f,KAAM,YAAY,IAAIo9E,EAAKp+D,aAAcC,aAAalqB,EAAE+L,MAAME,EAAKiB,YAAci8E,EAAIl9E,EAAKiB,GAC5I,IAI3B,GAHAqe,EAAM88D,EAAKjB,OAAOn/E,KAAKgE,EAAKjP,EAAG2E,EAAIuoB,QAAU,UAC7Cgb,EAAM,IAAIxvB,WAAW6V,KACrBxtB,QAAesqF,EAAKF,MAAQE,EAAKN,QAAQ12C,OAAO,CAACpmC,KAAM,QAASvN,KAAM,CAACuN,KAAM,YAAapF,EAAKq/B,EAAK,IAAIxvB,WAAWhY,KACvG,KAAM,0BAC1B,CAAO,MAAMyB,GAAI,IACTosB,EAAM88D,EAAKjB,OAAOn/E,KAAKgE,EAAKjP,EAAG,QAC/BkoC,EAAM,IAAIxvB,WAAW6V,GACrBxtB,QAAesqF,EAAKF,MAAQE,EAAKN,QAAQ12C,OAAO,CAACpmC,KAAM,QAASvN,KAAM,CAACuN,KAAM,YAAapF,EAAKq/B,EAAK,IAAIxvB,WAAWhY,GAClH,CAAA,MAAMyB,GACP,IAAIpB,EAAQ,KAAM,0BAC1B,CACA,CACM,IAAImC,EAAInC,QAAaiC,EAAE+L,MAAME,EAAKiB,GAAKzP,EAEvC,GADA8sF,EAAEC,UAAYhtF,EAAI,KAAM+sF,EAAEE,SAAWjtF,EAAI,KAAM+sF,EAAEG,SAAWtrF,EAAMmrF,EAAEI,WAAantF,EAAI,KAClFgF,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACb,EACI+mF,EAAItlF,IAAI64D,SAAW,CAEvB,GA/EG3+D,CA+EEA,EAAK,YAEPA,GAAI,SAASc,GACZ,IAAI0rF,EAAOxsF,EAAI,UACXmE,EAAInE,EAAI,cACR+uF,EAAa/uF,EAAI,YAWrBc,EAAON,QATWyY,MAAOjP,EAAKwmB,EAAM1qB,KAGlC,MAAMkpF,EAAQhlF,GAAOwmB,GAAQg8D,EAAKxrF,OAAO,IAAIL,SAAS,QAChDkB,EAAO2qF,EAAKjB,OAAOn/E,WAAW2iF,EAAWC,GAAQ,UAEjDC,EAAS9qF,EAAE+qF,SAASrtF,GAC1B,aAAa2qF,EAAKN,OAAOwB,UAAU,MAAOuB,EAAQ,CAAC7/E,KAAK,YAAY,EAAO,CAAC,UAAW,WAAU,CAGvG,GAfGpP,CAeEA,EAAK,YAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACPA,EAAI,cACZ,IAAImvF,EAASnvF,EAAI,YAGjBorF,EAAInI,QAAUmI,EAAInI,SAAY,OAAO1/E,EAAMqc,EAAMjZ,EAAIb,KAAU,IAC7DA,EAAMA,GAAO,GACb,IAAIkE,GAAO4V,GAAM9Z,GAAKqoF,OAASvuE,EAC/B,GALEhe,YAKO2B,EAAO,KAAM,2BACtB,IAAIyG,EAAI,CACN,IAAIohF,EAAI78C,EAAI,KAAM,qBAElBvkC,GADA4V,QAAawrE,EAAI78C,EAAE,KAAM,CAAC6/C,KAAM7qF,EAAM8qF,IAAK,UAAWC,IAAKxoF,EAAIwoF,OACpDH,OAASvuE,CAC5B,CACM,IAAInY,EAAsB,iBAARlE,EAAmBA,QAAaipF,EAAKphF,UAAU7H,GAC7D6rF,EAAO,CAACjuF,EAAGqrF,EAAKxrF,OAAO,GAAI2iF,GAAI6I,EAAKxrF,OAAO,KAC3CquF,QAAWF,EAAOnlF,EAAKolF,EAAKjuF,EAAG2E,GAAKk1D,MAAMuoB,GAA0BiJ,EAAW,OAAEvJ,QAAQ,CAC3F7zE,KAAMtJ,EAAIsJ,MAAQ,UAAWu0E,GAAI,IAAI9pE,WAAWu1E,EAAKzL,KACpDJ,GAAK,IAAIiJ,EAAKp+D,aAAcC,OAAO5mB,MAClCpD,EAAI,CACNgrF,GAAI7C,EAAKjB,OAAOn/E,KAAKijF,EAAI,UAAU1uF,SAASmF,EAAIuoB,QAAU,UAC1Ds1D,GAAIyL,EAAKzL,GAAGhjF,SAASmF,EAAIuoB,QAAU,UACnCltB,EAAGiuF,EAAKjuF,EAAER,SAASmF,EAAIuoB,QAAU,WAInC,GAFIvoB,EAAIiL,MAAM1M,EAAI,YAAcmoF,EAAKphF,UAAU/G,IAE5CsC,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAInI,OACzB,GAvCGjjF,CAuCEA,EAAK,aAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACXmE,EAAInE,EAAI,cACRmvF,EAASnvF,EAAI,YAEjBorF,EAAIjI,QAAUiI,EAAIjI,SAAY,OAAO5/E,EAAMqc,EAAMjZ,EAAIb,KAAU,IAC7DA,EAAMA,GAAO,GACb,IAAIkE,GAAO4V,GAAM9Z,GAAKqoF,OAASvuE,EAC/B,IAAI5V,EAAI,CACN,IAAIohF,EAAI78C,EAAI,KAAM,qBAElBvkC,GADA4V,QAAawrE,EAAI78C,EAAE,KAAM,CAAC6/C,KAAM7qF,EAAM8qF,IAAK,UAAWC,IAAKxoF,EAAIwoF,OACpDH,OAASvuE,CAC5B,CACM,IACI8P,EAAK4/D,EAAOC,EADZn/E,QAAajM,EAAE+L,MAAM3M,GACF,IACrBmsB,EAAM88D,EAAKjB,OAAOn/E,KAAKgE,EAAKjP,EAAG2E,EAAIuoB,QAAU,UAC7CihE,EAAQ9C,EAAKjB,OAAOn/E,KAAKgE,EAAKuzE,GAAI79E,EAAIuoB,QAAU,UAChDkhE,EAAQ/C,EAAKjB,OAAOn/E,KAAKgE,EAAKi/E,GAAIvpF,EAAIuoB,QAAU,UAChD,IAAIghE,QAAWF,EAAOnlF,EAAK0lB,EAAK5pB,GAAKk1D,MAAMuoB,GAA0BiJ,EAAW,OAAErJ,QAAQ,CACxF/zE,KAAMtJ,EAAIsJ,MAAQ,UAAWu0E,GAAI,IAAI9pE,WAAWy1E,GAAQE,UAAW,KAClEjM,EAAK,IAAI1pE,WAAW01E,KACxB,CAAA,MAAMjsF,GACL,GAAG,SAAWwC,EAAIuoB,OAAS,KAAM,oBACjC,GAAG+8D,EAAItlF,IAAI64D,SAET,OADA74D,EAAIuoB,OAAS,aACA+8D,EAAIjI,QAAQ5/E,EAAMqc,EAAMjZ,EAAIb,EAEnD,CACM,IAAIzB,QAAUF,EAAE+L,MAAM,IAAIs8E,EAAKJ,YAAY,QAAQ7oC,OAAO8rC,IAC1D,GAAG1oF,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAIjI,OACzB,GAzCGnjF,CAyCEA,EAAK,aAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UACVwsF,EAAOxsF,EAAI,UACPA,EAAI,cAEZorF,EAAIqE,OAASrE,EAAIqE,QAAW,OAAOzlF,EAAK4V,EAAMjZ,EAAIb,KAAU,IAE1D,GADAA,EAAMA,GAAO,IACT8Z,IAASA,EAAKuuE,QAAUvuE,EAAK4tE,KAAK,CACpC,IAAIpC,EAAI78C,EAAI,KAAM,iBAClB3uB,QAAawrE,EAAI78C,EAAE,KAAM,CAAC6/C,KAAMpkF,EAAKqkF,IAAK,SAAUC,IAAKxoF,EAAIwoF,KACrE,CACM,IAAI9zC,EAAMxwC,EAAIwjF,MAAQxjF,EAClBwjF,EAAO5tE,EAAK4tE,KACZW,EAAQvuE,EAAKuuE,MACbN,EAAarB,EAAKF,MAAQE,EAAKN,OAC/BwD,EAAaC,EAAcn1C,GAC3B21B,EAAQ/tE,OAAOsY,OAAO,CAAEk1E,aAAc/B,EAAWH,aAAagC,GAAY,EAAM,KAAM,CAACtgF,KAAM,OAAQu9E,WAAY,UACjHkD,EAAcF,EAAcnC,EAAMW,GAQlC9pF,QAPgBwpF,EAAWH,aAAamC,GAAa,EAAO,CAAC,eAAe70B,MAAK/hD,MAAOo8B,IAE1F,IAAIy6C,QAAoBjC,EAAWF,WAAWxd,EAAO96B,EAAS,KAC1D06C,EAAU,IAAIl2E,WAAWi2E,GACzBjK,QAAmBgI,EAAWH,UAAU,MAAOqC,EAAQ,CAAE3gF,KAAM,UAAW7N,OAAQ,MAAO,EAAM,CAAE,UAAW,YAChH,OAAOssF,EAAWI,UAAU,MAAOpI,GAAY7qB,MAAK,EAAGp4D,OAAQA,GAAE,IAGnE,GAAG+D,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAGN,GAFAmD,QAAQ6E,IAAIhI,GACZ8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAGF,IAAIgpF,EAAgB,CAACn1C,EAAKvrC,KAExB,IAAM4H,EAAGlE,GAAM6nC,EAAI95C,MAAM,KACrBksF,EAAM39E,EAAI,CAAEA,EAAGA,GAAM,CAAA,EACzB,MAAO,CACL,MACA7M,OAAOsY,OACLkyE,EACA,CAAE/1E,EAAGA,EAAGlE,EAAGA,EAAGk6E,IAAK,KAAMC,IAAK,QAASC,KAAK,IAE9C,CAAC39E,KAAM,OAAQu9E,WAAY,SACnC,EAGI7rF,EAAON,QAAU4qF,EAAIqE,MACzB,GApDGzvF,CAoDEA,EAAK,YAEPA,GAAI,SAASc,GACZ,IAAIsqF,EAAMprF,EAAI,UAEdorF,EAAI4E,QAAU5E,EAAI4E,SAAO,OAAYC,EAAcC,EAAS,CAAE,EAAEC,EAAWxpF,EAAIb,EAAM,CAAA,KAAS,IA+B5F,GArBAW,QAAQ6E,IAAI,yIAEZ2kF,EAAe,MACb,IAAI1sF,EAAO,GACX,GAAI0sF,EAAc,CAChB,IAA6B,iBAAjBA,GAA6BjkF,MAAM4N,QAAQq2E,KAAkBA,EAAaptF,QAAQ,MAAQ,EAAG,MAAO,IAChH,GAA4B,iBAAjBotF,EAA2B,OAAOA,EAC7C,GAAIjkF,MAAM4N,QAAQq2E,GAAe,CAC/B,GAA4B,IAAxBA,EAAa1uF,QAAgB0uF,EAAa,GAAI,MAAkC,iBAApBA,EAAa,IAAmBA,EAAa,GAAGz1C,IAAMy1C,EAAa,GAAGz1C,IAAiC,iBAApBy1C,EAAa,GAAkBA,EAAa,GAAK,KACpMA,EAAarlF,KAAIwlF,IACW,iBAAfA,EAAyB7sF,EAAKR,KAAKqtF,GACd,iBAAhBA,GAA4BA,EAAY51C,KAAKj3C,EAAKR,KAAKqtF,EAAY51C,IAAG,GAEpG,CAEU,MAA4B,iBAAjBy1C,GAA6BA,EAAaz1C,IAAYy1C,EAAaz1C,IACvEj3C,EAAKhC,OAAS,EAAIgC,EAAO,IAC1C,CAEO,EAjBc,IAmBV0sF,EAAc,OAAOxpF,QAAQ6E,IAAI,yBAEtC,MAAM+kF,GAASvqF,EAAIuqF,QAAiC,iBAAfvqF,EAAIuqF,QAA6C,iBAAfvqF,EAAIuqF,OAAgD,KAAzBp6E,WAAWnQ,EAAIuqF,QAC3GC,GAAcJ,GAAU,CAAA,GAAIK,KAAOL,EAAOK,KAAO,KACjDC,GAAeN,GAAU,CAAE,GAAEO,MAAQP,EAAOO,MAA0B,iBAAXP,GAAuBlkF,MAAM4N,QAAQs2E,IAAWA,EAAO,MAAQA,EAAO,MAAQA,EAAO,MAAQA,EAAO,MAAQA,EAAO,MAAQA,EAAO,MAAQA,EAAO,KAAOA,EAAS,KAG5N10C,GAAS11C,GAAO,CAAE,GAAE01C,QAAU11C,GAAO,CAAE,GAAE4qF,YAAc5qF,GAAO,CAAE,GAAE6qF,KAAO,CAAA,EACzEC,EAAYp1C,EAAM+0C,OAA+B,iBAAf/0C,EAAM+0C,OAAsB/0C,EAAM+0C,MAAQ,CAAA,GAAI,MAAQ/0C,EAAM+0C,KAAO,KACrGM,EAA8B,iBAAVr1C,EAAqBA,EAAQA,EAAMi1C,QAAiC,iBAAhBj1C,EAAMi1C,OAAsBj1C,EAAMi1C,MAAM,MAAQj1C,EAAMi1C,MAAQ,KAE5I,IAAKH,IAAeE,EAAa,OAAO/pF,QAAQ6E,IAAI,oBAGpD,MAAM/H,EAAO4H,KAAKC,UAAU,CAC1BlK,EAAG+uF,KACCI,EAAS,CAAC/sF,EAAG+sF,GAAU,CAAA,KACvBC,EAAa,CAACjsF,EAAGisF,GAAgB,CAAA,KACjCE,EAAc,CAAC/jF,EAAG+jF,GAAe,CAAA,KACjCI,EAAY,CAACE,GAAIF,GAAa,CAAA,KAC9BC,EAAa,CAACE,GAAIF,GAAc,CAAA,IAKtC,IAAIxsF,QAFsB+mF,EAAIh2C,KAAK7xC,EAAM4sF,EAAW,KAAM,CAACp/E,IAAI,IAI/D,GADIjL,EAAIiL,MAAM1M,EAAI,MAAM8G,KAAKC,UAAU/G,IACpCsC,EAAK,IAAKA,EAAGtC,EAAE,CAAE,MAAMf,GAAGmD,QAAQ6E,IAAIhI,EAAE,CAC3C,OAAOe,CACR,CAAC,MAAMf,GAEN,GADA8nF,EAAItkF,IAAMxD,EACP8nF,EAAIwC,MAAQ,MAAMtqF,EAErB,YADGqD,GAAKA,IAET,CAAC,GAEF7F,EAAON,QAAU4qF,EAAI4E,OACzB,GAvEGhwF,CAuEEA,EAAK,aAEPA,GAAI,SAASc,GACZ,IAAI0rF,EAAOxsF,EAAI,UAEXorF,EAAMprF,EAAI,UACdorF,EAAImC,KAAOvtF,EAAI,UACforF,EAAIh2C,KAAOp1C,EAAI,UACforF,EAAI51C,OAASx1C,EAAI,YACjBorF,EAAInI,QAAUjjF,EAAI,aAClBorF,EAAIjI,QAAUnjF,EAAI,aAClBorF,EAAI4E,QAAUhwF,EAAI,aAGlBorF,EAAIpqF,OAASoqF,EAAIpqF,QAAUwrF,EAAKxrF,OAIhCoqF,EAAIG,OAASH,EAAIG,QAAUvrF,EAAI,YAQ/BorF,EAAI4F,MAAQ5F,EAAI4F,OAAK,OAAYx2C,IAC/B,IAEE,MAAMy2C,EAAKzE,EAAKjB,OAAOlzE,OACrBmiC,EAAI55C,QAAQ,KAAM,KAAKA,QAAQ,KAAM,KAAKF,MAAM,KAC/CkK,KAAKnJ,GAAM+qF,EAAKjB,OAAOn/E,KAAK3K,EAAG,aAG5ByE,EAAKsmF,EAAKjB,OAAOlzE,OAAO,CAC5Bm0E,EAAKjB,OAAOn/E,KAAK,CAAC,IAAM6kF,EAAG1vF,OAAS,IAAO0vF,EAAG1vF,OAAS,MAAS0vF,IAE5DC,QAAaC,SAASjrF,GACtBrE,EAAO2qF,EAAKjB,OAAOn/E,KAAK8kF,EAAM,UACpC,OAAOrvF,EAAKlB,SAAS,MAAOkB,EAAKN,OAAS,EAC3C,CAAC,MAAO+B,GAEP,MADAmD,QAAQ6E,IAAIhI,GACNA,CACd,CACK,KAUC8nF,EAAI//E,QAAQ,CAAA,GAAIqB,KAAK,CAAE,GAAE0+E,IAAMA,EAEjCtqF,EAAON,QAAU4qF,CAGrB,GAzDGprF,CAyDEA,EAAK,SAEPA,GAAI,SAASc,GACZ,IAAwBiG,EAApBqkF,EAAMprF,EAAI,SAQd,SAASoxF,EAAKnpF,GACZtD,KAAKC,EAAI,CAACoC,EAAGrC,KACnB,CAwBI,SAASyI,IAAO,OAAOrG,EAAIO,QAAQ3G,SAAS,IAAIC,QAAQ,IAAI,GAAG,CAhC7DmG,EADCqkF,EAAI//E,OACC+/E,EAAI//E,OAAOqB,KAAO,CAACvF,MAAM,CAAA,GAEzBnH,GAJqB4B,UAId,WAAaf,EAAO,IAAI,IAAI,QAAS,GAEpDuqF,EAAI1+E,IAAM3F,EAKVqqF,EAAK/uF,UAAa,WAAY,SAASmJ,IAAM,CAA0B,OAAzBA,EAAEnJ,UAAY0E,EAAII,MAAc,IAAIqE,CAAK,CAArE,GAClB4lF,EAAK/uF,UAAUG,YAAc4uF,EAI7BrqF,EAAII,MAAMkqF,KAAO,SAAS72C,GACxB,IAAqC62C,EAArBppF,EAANtD,KAAiBO,MAAM,GACjC,GAAGs1C,EAED,OADAA,EAAM4wC,EAAItlF,IAAI00C,KAAKA,EAAI51C,GAAG,IAAI,OAAS41C,EAChCvyC,EAAKO,IAAI,IAAIgyC,GAEtB,GAAG62C,EAAOppF,EAAK/C,KAAK,QAAU,OAAOmsF,EACrC,IAAqB1pF,EAAjBM,EAAQA,EAAM,EAAcoE,EAAO1E,EAAG7B,IAAIuG,MAAQe,EAStD,OARCzF,GAAM0pF,EAAO1pF,EAAG0pF,KAPP1sF,KAOkBwC,MAAM,IAAIiqF,IAAOxsF,GAAGkB,IAAM,CAAA,EACtD6B,EAAG7B,IAAIuG,KAAO,SAAS1F,GACrB,IAAIT,EAAKmG,IAAQmuC,EAAMvyC,EAAKopF,KAC5B,OAAI72C,IAASA,EAAMA,EAAI70C,MAAS60C,EAAMA,EAAIA,MAC1Ct0C,EAAK,IAAMs0C,EAAM,IAAMt0C,EACpBS,GAAMA,EAAGlE,MAAOkE,EAAG,KAAMT,GACrBA,GAHiDA,CAIhE,EACamrF,CACb,EAEItqF,EAAIqqF,KAAOA,EACXA,EAAK1kF,IAAM3F,EACXqqF,EAAKhG,IAAMrkF,EAAIqkF,IAAMA,EACrBtqF,EAAON,QAAU4wF,CACrB,GAxCGpxF,CAwCEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIc,GAAU,GAAGA,UAAY8K,IAAOA,KAAK,CAACvF,MAAM,CAAA,GAAOnH,GAAK,GAAG4B,UAAaf,EAAO,IAAI,IAAI,QAAS,IAChGsG,MAAM6zD,KAAO,SAASr0D,EAAIb,GAC5B,IAAI8B,EAAMjD,KAAMlE,EAAC,IAAQ0Y,SAAQ,SAAS9F,EAAK44E,GAC7CrkF,EAAIsD,KAAKmI,EAAKvN,EACf,IACD,OAAOa,EAAIlG,EAAEu6D,KAAKr0D,GAAMlG,CAC9B,CACA,GARGT,CAQEA,EAAK,UAEPA,GAAI,SAASc,GACZ,IAAIswF,EAAOpxF,EAAI,UAAWorF,EAAMgG,EAAKhG,IAAKrkF,EAAMqqF,EAAK1kF,IAAK8C,EAAO,WAAU,EAG3E4hF,EAAK/uF,UAAU4E,OAAS,YAAY0iB,GAClC,IAUM7iB,EAVF8Y,EAA0B,iBAAZ+J,EAAK,KAAoBA,EAAK,GAAG6wB,KAAO7wB,EAAK,GAAG6jE,MAAQ7jE,EAAK,GAAwB,iBAAZA,EAAK,KAAoBA,EAAK,GAAG6wB,KAAO7wB,EAAK,GAAG6jE,MAAQ7jE,EAAK,GAAK,KACzJ2nE,EAAQ1xE,IAASA,EAAK46B,KAAO56B,EAAK4tE,MAAQ5tE,EAAK46B,IAAyB,iBAAZ7wB,EAAK,GAAkBA,EAAK,GAAK,KAC7Fzc,EAAO0S,IAASA,EAAK46B,KAAO56B,EAAK4tE,MAAQ5tE,EAAO0xE,GAA4B,iBAAZ3nE,EAAK,GAAkBA,EAAK,GAAK,KACjGhjB,EAAKgjB,EAAK7K,QAAO7e,GAAsB,mBAARA,IAAoB,IAAM,KACzD6F,EAAM6jB,GAAQA,EAAKpoB,OAAS,GAAoC,iBAAxBooB,EAAKA,EAAKpoB,OAAO,GAAkBooB,EAAKA,EAAKpoB,OAAO,GAAK,GAEjGqG,EAAMjD,KAAMmI,EAAOlF,EAAK,EAAGK,EAAOL,EAAI1C,MAAM,GAGhD,IAFAyB,EAAKA,GAAM6I,GAER,KADH1J,EAAMA,GAAO,IACI5D,SAEXovF,IAAQxqF,EAAM,aACdoG,GAAM,IAAI3L,OAAS,IAAIuF,EAAM,uBAC9BA,GAED,OADAH,EAAG,CAACG,IAAKC,EAAIuE,IAAIxE,KACVc,EAGX,GAAGkF,EAAIykF,IAEL,OADC5qF,GAAM6I,GAAM,CAAC1I,IAAKC,EAAIuE,IAAI,mDAAoDiD,MAAM,IAC9E3G,EAETkF,EAAIykF,KAAM,EACN,IAAA7hF,EAAM,CACVA,EAAQ,SAAS8hF,GAEf,GADA9hF,EAAI8hF,KAAOA,EACRA,IAAS1rF,EAAI2rF,QAAQ,CAEtB,IAAIlpF,EAAM,CAACzB,IAAKC,EAAIuE,IAAI,0BAIxB,OAHAwB,EAAIykF,KAAM,GACT5qF,GAAM6I,GAAMjH,QACbX,EAAI8pF,OAEd,CACQhiF,EAAI8gB,KAAOzvB,OAAOC,OAAO,IACzBoqF,EAAImC,KAAKrgF,EAAMwC,EAAI8gB,KAAM9gB,EAAImG,EACrC,EACMnG,EAAQ,SAASqiD,GACfriD,EAAIqiD,MAAQA,EACZnyC,EAAOlQ,EAAIxO,EAAE0e,GAAQwrE,EAAIxrE,KAAKlQ,EAAIxO,EAC1C,EACMwO,EAAQ,SAASkQ,GACf,IAAIje,EACJ+N,EAAIkQ,KAAOA,GAAQ,IAChBje,EAAMmL,EAAI7E,KAAKopF,QAChB1vF,EAAIiD,EAAE+sF,IAAM/xE,EACZje,EAAIgE,GAAK,CAAC60C,IAAK56B,EAAK46B,IAAKgzC,KAAM5tE,EAAK4tE,KAAM8D,MAAOA,IAGnD5hF,EAAInM,KAAO,CAACi3C,IAAK56B,EAAK46B,KACtB9qC,EAAIT,GACZ,EACMS,EAAQ,WACNA,EAAInM,KAAK+tF,MAAQA,EACjB5hF,EAAIpM,GACZ,EACMoM,EAAQ,WACNA,EAAInM,KAAKiqF,KAAO99E,EAAIkQ,KAAK4tE,KACzBpC,EAAInI,QAAQ,CAAC+K,KAAMt+E,EAAIkQ,KAAKouE,KAAMG,MAAOz+E,EAAIkQ,KAAKuuE,OAAQz+E,EAAIqiD,MAAOriD,EAAIxM,EAAG,CAAC6N,IAAI,GACzF,EACMrB,EAAQ,SAASkiF,GACfliF,EAAInM,KAAKquF,KAAOzmF,KAAKC,UAAU,CAACymF,GAAID,EAAMzwF,EAAGuO,EAAI8gB,OACjD9gB,EAAI5D,EAAE4D,EAAInM,KAAKquF,KACvB,EACMliF,EAAQ,SAASkiF,GAAO,IAAIjwF,EAC1B+N,EAAInM,KAAKquF,KAAOliF,EAAInM,KAAKquF,MAAQA,EACjC3pF,EAAKO,IAAI7G,EAAM,IAAI+N,EAAIkQ,KAAK46B,KAAKzyC,IAAI2H,EAAInM,MAAM4B,GAAGuK,EAAImC,GACtD,IAAIhF,EAAO,GAAIA,EAAKlL,GAAO,CAAC,IAAKA,GAAMsG,EAAKO,IAAI,KAAK8oF,GAAOvpF,IAAI8E,GAAMrE,IAAI7G,GAAKwD,GAAGuK,EAAI5N,EAC9F,EACM4N,EAAQ,SAASnM,EAAMyG,EAAKvC,EAAK4G,GAC/BA,EAAItJ,MAAO2K,EAAImC,EAAEzJ,GAAK,EAAGsH,EAAI5N,GACrC,EACM4N,EAAQ,SAASnM,EAAMyG,EAAKvC,EAAK4G,GAC5BA,IAAMqB,EAAI5N,EAAEsG,GAAK,EAAGiG,EAAItJ,OACvB2K,EAAImC,EAAEzJ,IAAOsH,EAAI5N,EAAEsG,KACvB0E,EAAIykF,KAAM,EACV5qF,EAAG,CAACyB,GAAI,EAAGoyC,IAAK9qC,EAAIkQ,KAAK46B,MACtBhrC,IAAS7I,IAAKiZ,EAAOhY,EAAIgqF,KAAKhyE,GAAQhY,EAAIgqF,KAAKN,EAAOpkF,IACjE,GAEM,OADAjF,EAAKO,IAAI,KAAK8oF,GAAOpmF,KAAKwE,EAAIf,GACvB/G,CACb,EACIwpF,EAAK/uF,UAAUqvF,MAAQ,SAAS5rF,EAAKa,GACnC,IAAgB0qF,EAAN1sF,KAAkBO,MAAM,GAAI,EAAEmsF,KAMxC,GALGA,WACMA,EAAK1rF,UACL0rF,EAAKzsF,EAAEe,UACP0rF,EAAKzsF,EAAE+sF,KAEbvG,EAAI//E,OACL,IAAI,IAAIymF,EAAK,UACbA,EAAK1G,EAAI//E,OAAO0mF,gBACNC,cACHF,EAAGlyE,IAClB,CAAS,MAAMtc,GAAE,CAEX,OAbUqB,IAchB,CACA,GAvGG3E,CAuGEA,EAAK,YAEPA,GAAI,SAASc,GACZ,IAAIswF,EAAOpxF,EAAI,UAAWorF,EAAMgG,EAAKhG,IAAKrkF,EAAMqqF,EAAK1kF,IAAK8C,EAAO,WAAU,EAyJ3E,SAASyiF,EAAQvwF,GACf,GAAG,iBAAmBA,EAAI,OAAOA,EACjC,IAAIA,EAAIyJ,KAAK+E,MAAMxO,EAClB,CAAA,MAAM4B,GAAG5B,EAAE,CAAA,CAAE,CACd,OAAOA,CACb,CA5JI0vF,EAAK/uF,UAAUuvF,KAAO,YAAYjoE,GAChC,IAAI/J,EAA0B,iBAAZ+J,EAAK,KAAoBA,EAAK,GAAG6wB,KAAO7wB,EAAK,GAAG6jE,MAAQ7jE,EAAK,GAAwB,iBAAZA,EAAK,KAAoBA,EAAK,GAAG6wB,KAAO7wB,EAAK,GAAG6jE,MAAQ7jE,EAAK,GAAK,KACzJ2nE,EAAS1xE,GAA2B,iBAAZ+J,EAAK,GAA4B,KAAVA,EAAK,GACpDzc,GAAQokF,KAAU1xE,GAAUA,EAAKouE,MAAQpuE,EAAKuuE,QAA+B,iBAAZxkE,EAAK,GAA4B,KAAVA,EAAK,GAC7FhjB,EAAKgjB,EAAK7K,QAAO7e,GAAsB,mBAARA,IAAoB,IAAM,KACzD6F,EAAM6jB,GAAQA,EAAKpoB,OAAS,GAAoC,iBAAxBooB,EAAKA,EAAKpoB,OAAO,GAAkBooB,EAAKA,EAAKpoB,OAAO,GAAK,GAEjGqG,EAAMjD,KAAMmI,EAAOlF,EAAK,EAAGK,EAAOL,EAAI1C,MAAM,GAEhD,GAAG4H,EAAIykF,IAEL,OADC5qF,GAAM6I,GAAM,CAAC1I,IAAKC,EAAIuE,IAAI,mDAAoDiD,MAAM,IAC9E3G,EAETkF,EAAIykF,KAAM,EAEV,IAAc3vF,EAAV8N,EAAM,CAAE,EAAKwiF,EAAQ,EAsIzB,OArIAxiF,EAAIf,EAAI,SAASpL,GACf,IAAIA,EAAO,OAAOmM,EAAImG,IACtB,IAAItS,EAAKi3C,IAAI,CACX,IAAI74C,EAAM,GACV,OADcS,OAAOU,KAAKS,GAAM0I,SAAQ,SAASrJ,GAAO,KAAKA,GAAajB,EAAIoB,KAAKQ,EAAKX,OACjF8M,EAAImG,EAAElU,EACvB,CACQ,GAAG+N,EAAIN,KAAO,OAAOM,EAAIxM,EAAEK,GAC3BmM,EAAIxO,GAAGwO,EAAInM,KAAOA,GAAMquF,KAChC,EACMliF,EAAImG,EAAI,SAASK,GACf,IAAI1N,GAAOkH,EAAIwG,MAAQxG,EAAIwG,MAAM,IAAImC,OAAOnC,GAAM,KAAK0X,QACvD,GAAGhsB,IAAM4G,EACP,OAAGkH,EAAIN,KAAcM,EAAI5I,IAAI,wJAC1BwqF,GAASY,SACVjqF,EAAKO,IAAI,KAAK8oF,GAAOpmF,KAAKwE,EAAIf,GAGzBe,EAAI5I,IAAI,2BAEjBmB,EAAKO,IAAIA,GAAK0C,KAAKwE,EAAIf,EAC/B,EACMe,EAAIxO,EAAI,SAAS0wF,GACf,OAAGhwF,IAAMgwF,EAAcliF,EAAImG,IACxB,iBAAmB+7E,EAAcliF,EAAIxO,EAAE+wF,EAAQL,SAClDxG,EAAImC,KAAKrgF,GAAOwC,EAAIkiF,KAAOA,GAAMzwF,EAAGuO,EAAIT,EAAGS,EAAI+7E,IACvD,EACM/7E,EAAIT,EAAI,SAAS8iD,GACfq5B,EAAIjI,QAAQzzE,EAAIkiF,KAAKC,GAAI9/B,EAAOriD,EAAIpM,EAAGoM,EAAI+7E,IACnD,EACM/7E,EAAIpM,EAAI,SAAS6uF,GACf,GAAGvwF,IAAMuwF,EACP,OAAIziF,EAAI+7E,KAGN/7E,EAAI+7E,IAAM,KACL/7E,EAAImG,MAHTnG,EAAI+7E,IAAM,CAACp9D,OAAQ,QACZ3e,EAAIxO,EAAEwO,EAAIkiF,OAIrBliF,EAAIyiF,KAAOA,EACXziF,EAAIxM,EAAEwM,EAAInM,KAClB,EACMmM,EAAIxM,EAAI,SAAS0c,GACf,IAAIuyE,EAAOziF,EAAIyiF,MAAQ,CAAA,EAAI5uF,EAAOmM,EAAInM,MAAQ,GAC9CmM,EAAI5D,EAAE4D,EAAI0iF,IAAM,CAAC53C,IAAK56B,EAAK46B,KAAOj3C,EAAKi3C,IAAKgzC,KAAM5tE,EAAK4tE,MAAQjqF,EAAKiqF,KAAMQ,KAAMpuE,EAAKouE,MAAQmE,EAAKnE,KAAMG,MAAOvuE,EAAKuuE,OAASgE,EAAKhE,OAC1I,EACMz+E,EAAI5D,EAAI,SAAS8T,GACf,IAAIA,IAASA,EAAK46B,MAAQ56B,EAAK4tE,KAAO,OAAO99E,EAAImG,IACjDnG,EAAIkQ,KAAOA,EACX,IAAIyxE,EAAQppF,EAAM,EAAEopF,KAAM1pF,EAAM0pF,EAAM,EAC5B1pF,EAAGnD,IACb,IAAI6tF,EAAM1qF,EAAG7B,KACb6B,EAAK0pF,EAAKzsF,EAAIqD,EAAKO,IAAI,IAAIoX,EAAK46B,KAAK51C,GAClCkB,IAAMusF,EAEThB,EAAK1rF,GAAK,CAAC60C,IAAK56B,EAAK46B,IAAKgzC,KAAM5tE,EAAK4tE,KAAM8D,MAAOA,GAAS1xE,EAAK46B,KAChE7yC,EAAGgqF,IAAMjiF,EAAIkQ,KACb9S,EAAIykF,KAAM,EACV,IAAOrkF,GAAQtL,IAAMqwF,EAAQnlF,EAAI7E,KAAKmC,MAAM,IAAIwV,EAAK46B,KAAKo3C,OAAO,IAAI,OAAO9rF,EAAIwsF,QAAUxsF,EAAIwH,OAASJ,EAAS,CAAA,MAAM5J,GAAI,CAE1H,GADAwC,EAAIwH,OAAQoC,EAAIusB,KAAOt1B,GAAM6I,GAAM7H,GAChCyjF,EAAI//E,SAAYzD,EAAI1C,KAAK,QAAS,EAAEY,KAAKA,GAAKysF,SAE/C,IAAI,IAAIT,EAAK,IACbA,EAAK1G,EAAI//E,OAAO0mF,gBACbC,QAAS,EACZF,EAAGlyE,KAAOzU,KAAKC,UAAUwU,EACxB,CAAA,MAAMtc,GAAE,CAEX,IACK2E,EAAKrD,EAAEJ,IAAIotF,KACb3pF,EAAM,EAAE9C,GAAG,OAAQwC,GACX3E,YAAW,WAAaiF,EAAM,EAAE9C,GAAG,OAAQwC,EAAK,GAAC,EAE3D,CAAA,MAAMrE,GACLyD,EAAIuE,IAAI,qCAAsChI,EACxD,CACA,EACMoM,EAAImC,EAAI,SAAStO,GACf,OAAIA,IACJ+tF,EAAQ/tF,EAAK+tF,SAEXA,EAAQ/tF,EAAK+tF,MAAQ,IAAM1xE,EAAK46B,KAC9Bj3C,EAAKquF,MAGThyE,EAAO,UACPlQ,EAAIxO,GAAGwO,EAAInM,KAAOA,GAAMquF,OAHfliF,EAAI5D,EAAE8T,IALGlQ,EAAImG,GAS9B,EACMnG,EAAIusB,EAAI,WAENvsB,EAAI8gB,KAAOzvB,OAAOC,OAAO,IACzBoqF,EAAImC,KAAKznF,EAAIwH,OAAQoC,EAAI8gB,KAAM9gB,EAAIiD,EAC3C,EACMjD,EAAIiD,EAAI,SAASo/C,GACfq5B,EAAInI,QAAQ,CAAC+K,KAAMt+E,EAAIkQ,KAAKouE,KAAMG,MAAOz+E,EAAIkQ,KAAKuuE,OAAQp8B,EAAOriD,EAAImH,EAAG,CAAC9F,IAAI,GACrF,EACMrB,EAAImH,EAAI,SAAS+6E,GACfliF,EAAIjD,EAAEtB,KAAKC,UAAU,CAACymF,GAAID,EAAMzwF,EAAGuO,EAAI8gB,OAC/C,EACM9gB,EAAIjD,EAAI,SAASmlF,GACf,GAAG9rF,EAAIwsF,QAAQ,CACb7rF,QAAQ6E,IAAI,4CACZ,IAAI3J,EAAM,CAAA,EAAIS,OAAOU,KAAK4M,EAAInM,MAAM0I,SAAQ,SAASrJ,GAAIjB,EAAIiB,GAAK8M,EAAInM,KAAKX,EAAE,WACtEjB,EAAIiD,EACXjD,EAAIiwF,KAAOA,EACX3pF,EAAKO,IAAI,IAAIkH,EAAIkQ,KAAK46B,KAAKzyC,IAAIpG,EAChC,CACDsG,EAAKO,IAAI,IAAIkH,EAAIkQ,KAAK46B,KAAKhyC,IAAI,QAAQT,IAAI6pF,EAAMjrF,GAAM6I,EAC/D,EACME,EAAI5I,IAAM,SAASxD,GACjB,IAAIiF,EAAM,CAACzB,IAAKC,EAAIuE,IAAIhI,GAAK,0BAC7BwJ,EAAIykF,KAAM,GACT5qF,GAAM6I,GAAMjH,EACrB,EACMmH,EAAIo9D,OAAS,SAAS19D,GACpB,KAAKM,EAAIN,KAAOA,GAAQ,OAAOM,EAAI5I,MACnC,IAAInF,EAAM,CAACyN,GACR,MAAQA,EAAK,KACdzN,EAAI,GAAK,IAAIyN,EACbzN,EAAI,GAAK,KAAKyN,GAEhBM,EAAImG,EAAElU,EACd,EACSie,EACEA,EAAKouE,MAAQpuE,EAAKuuE,MACnBz+E,EAAI5D,EAAE8T,GAEN3X,EAAKO,IAAI,IAAIoX,EAAK46B,KAAKtvC,KAAKwE,EAAImC,GAEjCy/E,EACDrpF,EAAKO,IAAI,KAAK8oF,GAAOpmF,KAAKwE,EAAIf,GAE5B2iF,GAAUpkF,GACZk+E,EAAIh8E,KAAKM,EAAIo9D,QAERllE,CACb,CAOA,GAhKG5H,CAgKEA,EAAK,UAEPA,GAAI,SAASc,OACRswF,EAAOpxF,EAAI,UAAWorF,EAAMgG,EAAKhG,IAAWgG,EAAK1kF,IACrD0kF,EAAK/uF,UAAU2vF,OAAS,SAASlsF,EAAKa,GAChC,IAAAiB,EAAMjD,KAAMsD,EAAOL,EAAI1C,MAAM,GAEjC,IADAY,EAAMA,GAAO,KACHA,EAAIisF,eAAe,CAC3B,GAAG3G,EAAI//E,OACL,IACE,IAAIymF,GACJA,EAAK1G,EAAI//E,OAAO0mF,kBAEb9pF,EAAM,EAAEnC,IAAIysF,UAAW,GACtB3qF,EAAI1C,KAAK,QAAS,EAAEY,KAAKA,GAAKysF,UAAW,GACxCT,EAAGE,QAAUF,EAAGlyE,OAAM3X,EAAKopF,OAAOO,KAAKzmF,KAAK+E,MAAM4hF,EAAGlyE,MAAOjZ,GAElE,CAAA,MAAMrD,GAAE,CAEX,OAAOsE,CACf,CAMM,OAAOA,CACb,CACA,GA1BG5H,CA0BEA,EAAK,YAEPA,GAAI,SAASc,GACZ,IAAIswF,EAAOpxF,EAAI,UAAWorF,EAAMgG,EAAKhG,IAAKrkF,EAAMqqF,EAAK1kF,IAAK8C,EAAO,WAAU,EAC3E4hF,EAAK/uF,UAAUud,KAAO,WACpB,IAAiBmK,EAAbsnE,EAAO1sF,KACX,IAAKolB,EAAQ,IAAIC,MAAM,CAACwoE,OAAO,KAAW,CAAChqF,IAAK,SAAS/G,EAAEhB,EAAE4D,GAC3D,GAAIgtF,EAAK1rF,KAAQ0rF,EAAKzsF,GAAG,IAAI+sF,IAC7B,OAAON,EAAKzsF,EAAE+sF,IAAIlxF,EAC1B,GAAS,CAAC,MAAM6C,GAAE,CACZ,OAAOymB,CACb,EAEIqnE,EAAK/uF,UAAUoqC,OAASxzB,eAAeq4E,EAAOpkF,EAAMvG,GAClDF,QAAQ6E,IAAI,gEACZ,IAAI1D,EAAMjD,KAAaiD,EAAI1C,MAAM,OAAImsF,EAAOzpF,EAAI1C,KAAK,QACrD,IACEmsF,EAAKO,KAAKN,EAAOpkF,GAAM,SAAS3E,IACnB8oF,EAAK1rF,IAAI,CAAA,GAAI60C,IAExB62C,EAAKzmF,MAAMM,MAAK,WAAYvG,KAAKoD,IAAI,KAAK,IAE1CspF,EAAKK,SACJ/qF,GAAM6I,GAAM,CAACpH,GAAI,GAC5B,GACO,CAAC,MAAO9E,GACPyD,EAAIuE,IAAI,6BAA8BhI,EAC9C,CACM,OAAOsE,CACb,EACIwpF,EAAK/uF,UAAUowF,MAAQx5E,iBACrBxS,QAAQ6E,IAAI,iCACZ,MAAMonF,EAAU/tF,KAAKO,MAAM,GAC3B,IAGE,aADMytF,WAAWD,GACVA,EAAQ9tF,EAAEysF,KAAKzsF,CACvB,CAAC,MAAOtB,GACP,MAAMwD,EAAM,cAEZ,MADAC,EAAIuE,IAAIxE,GACF,CAAEA,MAChB,CACA,EACIsqF,EAAK/uF,UAAUuwF,MAAQ35E,eAAeo4E,GACpC5qF,QAAQ6E,IAAI,kEAGRvE,EAAIpB,GAAG0rF,IACTA,EAAK7oF,IAAI,OAAOA,KAAI,CAACR,EAAKwF,KACxB/G,QAAQ6E,IAAItD,EAAKwF,EAAE,IAGvB6jF,EAAK7oF,IAAI,SAASA,IAAIjI,MAAMwH,IAAI8qF,YAOtC,EACIzB,EAAK/uF,UAAUywF,MAAQ,SAASpuF,EAAIiC,GAClCF,QAAQ6E,IAAI,kEACZ,IAAI1D,EAAMjD,KAAM0sF,EAAOzpF,EAAI1C,MAAM,GAAGmsF,OAAQzxE,EAAOyxE,EAAKzsF,EAAE+sF,IAAKpxF,EAAO,GAiBtE,OAhBAqH,EAAI1C,MAAK,SAASyC,GAAQA,EAAGhC,KAAcpF,GAASoH,EAAGa,KAAK,GAAK,IAChEyQ,iBACD,IAAIwyE,EAAKsH,QAAY1B,EAAK7oF,IAAI,SAASA,IAAIoX,EAAK46B,KAAKhyC,IAAIjI,GAAMy6D,QAC/D+3B,QAAY3H,EAAIjI,QAAQ4P,EAAKnzE,MAE3BmzE,EAAM3H,EAAIpqF,OAAO,IAAIL,WACrB8qF,QAAYL,EAAInI,QAAQ8P,EAAKnzE,GAC7ByxE,EAAK7oF,IAAI,SAASA,IAAIoX,EAAK46B,KAAKhyC,IAAIjI,GAAMwH,IAAI0jF,IAEhD,IAAIjxC,EAAM91C,EAAG8D,IAAI,OAAOwyD,OACpBwyB,EAAO9oF,EAAG8D,IAAI,QAAQwyD,OAC1BxgB,QAAYA,EAAKgzC,QAAaA,EAC9B,IAAIU,QAAW9C,EAAIqE,OAAOjC,EAAM5tE,GAChC6rE,QAAYL,EAAInI,QAAQ8P,EAAK7E,GAC7BmD,EAAK7oF,IAAI,SAASA,IAAIgyC,GAAKhyC,IAAIjI,GAAMwH,IAAI0jF,EAAK9kF,EACpD,CAdM,GAeOiB,CACb,EACIwpF,EAAK/uF,UAAUotF,OAAS,SAASlsF,EAAMoD,GACrCF,QAAQ6E,IAAI,mEACZ,IAAI1D,EAAMjD,KAAM0sF,EAAOzpF,EAAI1C,MAAM,GAAGmsF,OAAQzxE,EAAOyxE,EAAKzxE,OAAQrf,EAAO,GAavE,OAZAqH,EAAI1C,MAAK,SAASyC,GAAQA,EAAGhC,KAAcpF,GAASoH,EAAGa,KAAK,GAAK,IAChEyQ,iBACD,IAAIwyE,EAAKsH,QAAY1B,EAAK7oF,IAAI,SAASA,IAAIoX,EAAK46B,KAAKhyC,IAAIjI,GAAMy6D,QAC/D+3B,QAAY3H,EAAIjI,QAAQ4P,EAAKnzE,MAE3BmzE,EAAM3H,EAAIpqF,OAAO,IAAIL,WACrB8qF,QAAYL,EAAInI,QAAQ8P,EAAKnzE,GAC7ByxE,EAAK7oF,IAAI,SAASA,IAAIoX,EAAK46B,KAAKhyC,IAAIjI,GAAMwH,IAAI0jF,IAEhDA,QAAYL,EAAInI,QAAQ1/E,EAAMwvF,GAC9BnrF,EAAIG,IAAI0jF,EAAK9kF,EACnB,CAVM,GAWOiB,CACb,EAuCI9G,EAAON,QAAU4wF,CACrB,GAvIGpxF,CAuIEA,EAAK,WAEPA,GAAI,SAASc,GACZ,IAAqEc,EAAjEwpF,EAAMprF,EAAI,SAAUmE,EAAInE,EAAI,cAC5B+G,GAAOqkF,EAAI//E,QAAQ,IAAIqB,KAAO1M,GAAK,GAAG4B,UAAaf,EAAO,IAAI,IAAI,QAAS,GA2B/E,SAASqB,EAAMuF,GACb,IAA8H9F,EAA1H0M,EAAM1J,KAAMgD,EAAK0G,EAAI5J,GAAIsD,EAAMN,EAAIM,IAAKlC,EAAOkC,EAAI,KAAMiC,EAAMjC,EAAI,KAAMkC,EAAMlC,EAAI,KAAMT,EAAQS,EAAI,KAAM7B,EAAKuB,EAAI,KACxH,GAAI5B,GAASmE,EACb,IAAIvC,EAAI7C,GAAG,IAAIkE,QAAUnB,EAAG7B,KAAK,IAAIgD,OAAS,mBAAqBrB,EAAI7C,EACrEwmF,EAAItlF,IAAI4K,KAAK3I,GAAK,SAASgJ,GAC3Bq6E,EAAI51C,OAAOzkC,GAAK,GAAO,SAASxN,GAC9BwE,EAAI,KAAOqjF,EAAItlF,IAAIq+C,OAAO5gD,GAC1B8K,EAAI3J,GAAGG,KAAK4C,EACb,GAAC,QALJ,CAQA,IAAIurF,EAAK,SAAS1E,GAAM3mF,EAAGxC,GAAG,KAAM,CAAC,IAAKe,EAAIY,IAAKW,EAAIX,IAAMwnF,GAAK,GAEjE7mF,EAAI7C,GAAG,IAAIiD,OAASJ,EAAI7C,GAAG,IAAIiD,IAAI3G,GAAK,IAAI2C,MAC1C,GAAKgC,EAAKhD,QAAQ,QAEnBlB,EAAMsU,WAAWpQ,EAAKnF,MAAM,MAAM,IAAI,MAC3B4G,EAASP,EAAIO,QAAiB,IAAN3F,GAChCA,EAAM8F,EAAI7C,IAAOjD,EAAQ,MAAMA,EAAIyH,OAKrC,OAASvD,EAGT,OAASA,EAAKzF,MAAM,EAAE,IAItBuB,EAAMypF,EAAItlF,IAAI00C,IAAI30C,IACnB3D,EAAMs4C,IAAInsC,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,EAAIrrF,EAAG0pF,MAAM,GAAI1vF,GAExD,GAAKkE,EAAKhD,QAAQ,KACnBX,EAAML,KAAKwM,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,GAE3C9wF,EAAM8L,IAAIK,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,EAAIrrF,EAAG0pF,MAAM,IATnDnvF,EAAMsvF,KAAKnjF,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,GAHzC9wF,EAAMovF,MAAMjjF,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,EAdlD,CA4BA,CA7DIjsF,EAAI5B,GAAG,OAAO,SAASwC,GACjBA,EAAGgqF,MACLhqF,EAAGgqF,IAAM,CAACsB,IAAK,CAAE,GACjBtrF,EAAGxC,GAAG,MAAOjD,EAAOyF,IAEtBhD,KAAKD,GAAGG,KAAK8C,EACnB,IAwDIzF,EAAML,KAAO,SAASwM,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,GAClD5H,EAAImC,KAAKtjF,EAAK,MAAM,SAAS1G,GAM3B,OAAGA,GAAQA,IAASyG,EAAItJ,MAAM,KAAKN,OAAO,GAAG,IAClCmD,GAAQA,IANnB,SAAqB2vF,GACnB,IAAIC,EAAS,GACb,IAAI,IAAIrxF,EAAI,EAAGA,EAAIoxF,EAAO3xF,OAAQO,IAChCqxF,GAAYrxF,EAAI,EAAI,EAAyE,GAApEf,OAAOoa,aAAaU,SAASq3E,EAAOp3E,UAAUha,EAAI,EAAGA,EAAI,GAAI,KACxF,OAAOsiB,KAAK+uE,EAAQ,CAEMC,CAAYppF,EAAItJ,MAAM,KAAKN,OAAO,GAAG,IADRiO,EAAI3J,GAAGG,KAAK4C,QAGrEurF,EAAG,8BACX,GAAS,CAAC5jF,KAAM,WAChB,EACIlN,EAAMovF,MAAQ,SAASjjF,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,GACnD,OAAI/oF,EACD,KAAKD,IAAQqpF,EAAQppF,GAAcoE,EAAI3J,GAAGG,KAAK4C,QAClDurF,EAAG,mBAFcA,EAAG,mBAG1B,EACI9wF,EAAMsvF,KAAO,SAASnjF,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,GAClD,OAAI/oF,EACDD,IAAQqpF,EAAQppF,GAAcoE,EAAI3J,GAAGG,KAAK4C,QAC7CurF,EAAG,mBAFcA,EAAG,oBAG1B,EACI9wF,EAAMs4C,IAAMvhC,eAAe5K,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,EAAI3B,EAAM72C,GAAM,IAAI74C,EAC3E,MAAMoP,QAAY5M,EAAE+L,MAAMjG,IAAQ,CAAA,EAC5BurC,EAAS,CAAC89C,EAAalD,EAAazpF,KACxC,GAAI2sF,EAAYjiF,GAAKiiF,EAAYnyF,GAAKivF,GAAe51C,EAEnD,OAAO4wC,EAAI51C,OAAO89C,EAAa94C,GAAKj3C,IAClC,GAAI3B,IAAM2B,GAAQ3B,IAAM2B,EAAKD,GAAKmE,EAAIM,IAAI,MAAQN,EAAIM,IAAI,KAAOkO,WAAW1S,EAAKD,GAAI,OAAO0vF,EAAG,wBAG/F,GAAIpxF,IAAM2B,GAAQA,EAAKrC,GAAKqC,EAAKkJ,IAAMlJ,EAAKrC,IAAMkvF,GAAe7sF,EAAKrC,EAAE2B,QAAQ,MAAuB,GAAI,CAEzG,IAAItC,EAAOsF,EAAKhD,QAAQ,MAAQ,EAAIgD,EAAKjF,QAAQiF,EAAKiW,UAAU,EAAGjW,EAAKhD,QAAQ,KAAO,GAAI,IAAM,GACjG9B,OAAOS,MAAQT,OAAOS,OAASuF,EAAIwL,KAAK/Q,MACxC,MAAMiL,EAAIT,MAAM4N,QAAQrW,EAAKkJ,GAAKlJ,EAAKkJ,EAAsB,iBAAXlJ,EAAKkJ,GAAoC,iBAAXlJ,EAAKkJ,EAAiB,CAAClJ,EAAKkJ,GAAK,GACjH,IAAK,MAAMW,KAAOX,EAChB,GAAK1L,OAAOS,MAAMjB,EAAM6M,EAAI,OAASrM,OAAOS,MAAMwI,EAAKoD,EAAI,QAAYA,EAAI,MAAQrM,OAAOS,MAAMjB,EAAM6M,EAAI,QAAYA,EAAI,MAAQrM,OAAOS,MAAMwI,EAAKoD,EAAI,OAAUrM,OAAOS,MAAOjB,EAAOA,EAAO,IAAMyJ,EAAMA,EAAMoD,EAAI,MAAQA,GAAM,CAEhO,GAAIA,EAAI,MAAQA,EAAI,KAAKvK,QAAQ,MAAQ,GAAKtC,IAAsC,GAA9BA,EAAKsC,QAAQutF,KAAmD,GAA7BpmF,EAAInH,QAAQutF,GAAoB,OAAO4C,EAAG,SAASzyF,cAAiByJ,2BAA6BomF,OAE1L,GAAI7sF,EAAKwtF,KAA0B,iBAAZxtF,EAAKwtF,KAAqBxtF,EAAKwtF,IAAM,CAAA,GAAI,MAAQ,CACtE,IAAI9oF,EAAOoG,EAAI5J,GAAGwD,KAAKjB,EAAE9B,MAAM,GAE/B,MADuB,iBAAZ3B,EAAKwtF,IAAmB,MAAQxtF,EAAKwtF,GAAG3wF,MAAM,EAAG,KAAI6H,EAAOA,EAAKO,IAAI,IAAMgyC,IAC/EvyC,EAAKO,IAAIjF,EAAKwtF,IAAIvoF,IAAI4nF,GAAallF,MAAKuN,IACzCA,GAAoB,IAAVA,IAAyB,IAAVA,EACtB9R,EAAGpD,GAD2CyvF,EAAG,eAAe5C,eAG7F,CACkB,OAAOzpF,EAAGpD,EAC5B,CAEc,OAAOyvF,EAAG,iCACxB,IAEQ,EAGF,GAAI,QAAUhpF,GAAO,IAAMwwC,IAAQ30C,EACjC,OAAIoE,IAAQuwC,EAAYnsC,EAAI3J,GAAGG,KAAK4C,GAC7BurF,EAAG,sBAGPrxF,EAAM0vF,EAAK1rF,KAAOhE,EAAI64C,MAAQzpC,EAAI,OAASA,EAAI,OAASypC,IAAQ74C,EAAI64C,KAAQA,IAAQ74C,EAAI64C,OAAS/yC,EAAI7C,EAAE6C,KAAO,CAAA,GAAI3B,KAAO,CAAA,GAAIytF,MAChInI,EAAItlF,IAAI4K,KAAKjJ,EAAIM,KAAK4gD,IACpByiC,EAAIh2C,KAAKuT,EAAS0oC,EAAM,EAAEM,KAAK14E,eAAe1V,GAC5C,GAAI3B,IAAM2B,EAAM,OAAOyvF,EAAG5H,EAAItkF,KAAO,mBAKrC,GAJAW,EAAIM,IAAI,KAAO,CAAC,IAAKpG,EAAMypF,EAAItlF,IAAIq+C,OAAO5gD,EAAK8N,GAAI,IAAK9N,EAAKpC,GAC7DsG,EAAIM,IAAI,KAAOpG,EAGX64C,IAAQ62C,EAAK1rF,GAAG60C,IAOlB,OANI74C,EAAM0xF,EAAQppF,OAAOtC,EAAGgqF,IAAIsB,IAAItxF,GAAOgG,EAAGgqF,IAAIsB,IAAItxF,IAAQ,CAAE,GAAE64C,GAAO,QACzErvC,KAAKmF,eAAe7I,EAAIM,IAAI,MAAM,SAASjB,EAAI3F,GAC7C,OAAG2F,EAAaksF,EAAGlsF,GAAO,qBAC1BW,EAAIM,IAAI,KAAO5G,EACRkN,EAAI3J,GAAGG,KAAK4C,GACnC,IAKY,GAAI+yC,IAAQ62C,EAAK1rF,GAAG60C,OAAS/yC,EAAI7C,EAAE6C,KAAO,CAAE,GAAE3B,KAAO,CAAA,GAAIytF,KAAM,CAC7D,MAAMA,QAAapvF,EAAE+L,MAAMzI,EAAI7C,EAAE6C,IAAI3B,IAAIytF,MAErCA,GAAQA,EAAKliF,GAAKkiF,EAAKpyF,GACzBq0C,EAAO+9C,EAAMlC,EAAK1rF,GAAG60C,KAAK51C,IACxB6C,EAAIM,IAAI,KAAK,KAAOwrF,EACpB9rF,EAAIM,IAAI,KAAK,KAAOspF,EAAK1rF,GAAG60C,IAC5BrvC,KAAKmF,eAAe7I,EAAIM,IAAI,MAAM,SAASjB,EAAI3F,GAC7C,OAAG2F,EAAaksF,EAAGlsF,GAAO,qBAC1BW,EAAIM,IAAI,KAAO5G,EACRkN,EAAI3J,GAAGG,KAAK4C,GACvC,GACkB,GAElB,CACA,GAAa,CAACsJ,IAAK,GAAE,IAKfq6E,EAAItlF,IAAI4K,KAAKjJ,EAAIM,KAAK4gD,IACpByiC,EAAI51C,OAAOmT,EAAQ53C,EAAI,MAAQypC,GAAK,SAASj3C,GAAO,IAAI5B,EAEtD,OADA4B,EAAO6nF,EAAItlF,IAAIq+C,OAAO5gD,GAClB3B,IAAM2B,EAAayvF,EAAG,sBACrBrxF,EAAM0xF,EAAQ9vF,KAAUi3C,IAAQ4wC,EAAItlF,IAAI00C,IAAI74C,MAAOgG,EAAGgqF,IAAIsB,IAAItxF,GAAOgG,EAAGgqF,IAAIsB,IAAItxF,IAAQ,CAAA,GAAI64C,GAAO,GAGpGzpC,EAAI,MAAQA,EAAI,KAAQ,GAAKA,EAAI,KAAQ,GAAKA,EAAI,UAEpDykC,EAAOzkC,EAAI,KAAMA,EAAI,MAAMnM,IACzB6C,EAAIM,IAAI,KAAOxE,EACR8K,EAAI3J,GAAGG,KAAK4C,OAGrBA,EAAIM,IAAI,KAAOxE,EACR8K,EAAI3J,GAAGG,KAAK4C,IAE/B,GAAU,GAGV,EACIvF,EAAM8L,IAAM,SAASK,EAAK5G,EAAKwC,EAAKD,EAAKnE,EAAM8B,EAAIqrF,EAAI3B,GACrD,GAAG1pF,EAAG7B,IAAI0tF,OAAS,OAAOR,EAAG,+BAAiChpF,EAAM,MAEpErC,EAAGxC,GAAG,UAAU,SAASsC,GACvB,GAD6B9C,KAAKI,OAC9B4C,EAAG7B,IAAI0tF,OAAS,OAAOnlF,EAAI3J,GAAGG,KAAK4C,GACvCurF,EAAG,0BACJ,IAAE7tF,GAAGA,GAAG,SAAUsC,EAEzB,MAEQJ,EAAQN,EAAIM,MAAOgsF,EAAU,SAASpkF,EAAEhO,GAAI,MAAO,iBAAoBA,EAAIoG,EAAM4H,KAAOhO,CAAC,GAAiB8F,EAAIO,OAAO,IAAI1B,IAE7H,IAAI6tF,EAAS,UACbrI,EAAItlF,IAAI00C,IAAM,SAASr5C,GACrB,GAAIA,IACJA,EAAIA,EAAET,MAAM,QACDS,EAAIA,EAAE,MACjBA,EAAIA,EAAET,MAAM+yF,GAAQrzF,MAAM,EAAE,KACnB,GAAKe,EAAEI,QACb,OAASJ,EAAE,IAAI,IAAI,GAEtB,OADAA,EAAIA,EAAEf,MAAM,EAAE,GAAGoM,KAAK,IAE5B,EACI4+E,EAAItlF,IAAI4tF,QAAU,SAASjyF,GAE/B,EACI2pF,EAAItlF,IAAI4K,KAAO,SAASzB,EAAEtI,EAAG/D,EAAGD,EAAExB,GAAI,IAAIQ,EAAKuB,EAC7C,GAAGkoF,EAAItlF,IAAI5D,MAAM+M,GAAK,OAAOtI,EAAGsI,GAC7BA,GAAKA,EAAE,MAAQA,EAAE,MAAQA,EAAE,OAAOtN,EAAMsN,EAAE,KAAM/L,EAAI,GACvDiI,KAAKgF,WAAWjN,EAAGvB,EAAMsN,GAAG,SAASnI,EAAK4L,GACxC,IAAI22B,EAAQznC,KAAO8Q,GAAM,IAAI,OAAUA,GAAM,IAAI,KAEjD/L,EADI0iC,EACD,CAACh4B,EAAG,CAAC,IAAIlQ,GAAG8N,EAAE,KAAK,IAAIrM,GAAGqM,EAAE,KAAK,KAAKyD,GAAM,IAAI,KAAK,IAAIzD,EAAE,MAAMlI,EAAIO,MAAM3B,GAAGhD,EAAGC,IAAKzB,EAAGkoC,GAD/Ep6B,EAErB,GACA,EACI,IAAIy/E,EAAItD,EAAItlF,IACZslF,EAAItlF,IAAIq+C,OAAS,SAASl1C,EAAGrM,EAAGD,GAAI,IAAIhB,EACtC,GAAGC,IAAMqN,EAAT,CACA,GAAGA,GAAMrN,KAAOD,EAAMsN,EAAE,MAAS,OAAOtN,EAExC,GADAiB,EAAIA,GAAK8rF,EAAEE,UAAcjsF,GAAK+rF,EAAEG,YAAWlsF,EAAI,CAAA,GAAMC,GAAK8rF,EAAEG,UACxDjsF,GAAMD,EAAV,CACA,GAAGsM,IAAMtM,EAAEC,GAAK,OAAOqM,EACvB,IAAIm8E,EAAItlF,IAAI5D,MAAMS,EAAEC,IAAM,OAAOqM,EACjC,IAAIpJ,EAAQlD,GAAKA,EAAEiC,GAAKjC,EAAEiC,EAAE,MAAS8pF,EAAEC,UAAWxtF,EAAI4F,EAAIO,MAAM3B,GAAGhD,EAAGC,IAAM8rF,EAAEI,WAC9E,OAAG7/E,GAAK,IAAMA,EAAE1N,QAAUsE,IAASoJ,EAAE,IAAMrM,IAAMqM,EAAE,IAAM0kF,EAAGxyF,KAAOwyF,EAAG1kF,EAAE,IAC/DA,EAAE,GAER9N,EAAIiqF,EAAItlF,IAAI8tF,eACN3kF,OADT,CAPoB,CAHD,CAazB,EACIm8E,EAAItlF,IAAI8tF,eAAiB,WACzB,IAAID,EAAKtyF,KAAKC,KAGlB,GAvPGtB,CAuPEA,EAAK,UACV,CAhgDC,GCYD,MAAMorF,GAAMrkF,EAAIqkF,IAEhB,IAAIyI,GACAlK,GAAoB,CACtBC,2BACEc,GAAaC,gBAAgBf,2BAC/BC,0BACEa,GAAaC,gBAAgBd,2BAI5B,MAACiK,GAAsB76E,UAC1B,GAAsB,oBAAX5N,OACT,IAEE,MAAMy+E,cAAEA,SAAwB3wE,iDAC1B6wE,QAAEA,SAAkB7wE,iDACpB46E,SAAEA,SAAmBC,OAAO,gBAC5BxnF,KAAEA,SAAe2M,gDAGjB86E,EAAYjK,EADCF,cAA0B59E,MAG7C,IACE,MAAMm+E,QAAgB0J,EACpBvnF,EAAKynF,EAAW,yBAChB,QAEFtK,GAAoBx+E,KAAK+E,MAAMm6E,GAC/B5jF,QAAQ6E,IAAI,6BAA8Bq+E,GAC3C,CAAC,MAAO7iF,GACPL,QAAQgP,KAAK,sDACd,CACF,CAAC,MAAOoD,GACPpS,QAAQoS,MAAM,iCAAkCA,EACjD,CACF,EA2BI,SAASq7E,KAEd,OAAOC,EADaC,GAAmB,KACJh0F,MAAM,EAC3C,CAOO,SAASi0F,GAAiB5+C,GAC/B,IACE,MACM5zC,EAAOyyF,GADUC,EAAmB9+C,IAG1C,OADAhvC,QAAQ6E,IAAI,sBAAuBzJ,GAC5BA,CACR,CAAC,MAAOgX,GAEP,OADApS,QAAQoS,MAAM,6BAA8BA,GACrC,IACR,CACH,CAOO,SAAS27E,GAAgBC,GAE9B,MAUMC,EAAgB,KAVC,CAACC,IACtB,MAAM5gC,EAAU,IAAI6gC,QAAQ,EAAKD,EAAUpzF,OAAS,GAAM,GACpD4xF,EAASwB,EAAU/zF,QAAQ,KAAM,KAAKA,QAAQ,KAAM,KAAOmzD,EAC3D8gC,EAASjyE,KAAKuwE,GACpB,OAAOnnF,MAAMI,KAAKyoF,GAASC,GACzBA,EAAK/yF,WAAW,GAAGpB,SAAS,IAAImiC,SAAS,EAAG,OAC5Ct2B,KAAK,GAAG,EAIiBuoF,CAAeN,GAGtCnL,EAAS,IAAI0L,GAAcN,GAKjC,MAAO,CACLrW,QAASiL,EACT5zC,UAJgB4zC,EAAOruC,QAKvB9O,WAAYuoD,EAEhB,CA3EsB,oBAAXrpF,QACTyoF,KAiFU,MAAC5V,GAAYjlE,UACvB,GAAIg8E,QAAU9oD,WAAY,CACxB,MAAMu2B,EAAW,IAAIwyB,GAAuBD,OAAQ,CAClDp7C,QAASywC,GAAaC,SACtBn7E,KAAM,cAER,OAAO,IAAIg6E,OAAOj9C,WAAYu2B,EAClC,CAAS,GACa,oBAAXr3D,aACoB,IAApBA,OAAOszE,SACd,OACMtzE,OAAOszE,SAASp7D,QAAQ,CAAE7H,OAAQ,wBAExC,OADiB,IAAIy5E,GAAuB9pF,OAAOszE,UACnCT,WACpB,CACI,MAAM,IAAIplE,MAAM,mCACjB,EASI,SAASs8E,GAAqBC,EAAcC,GACjD,IACE,MAAMC,EAAoBhB,EAAmBc,GAGvCG,EAAoBlB,GACxBmB,EAAc,CAACF,EAHchB,EAAmBe,MAM5CI,EAAgB,IAAItM,OAAOoM,GASjC,OAPA/uF,QAAQ6E,IAAI,8BAA+B,CACzCqqF,gBAAiBH,EACjBF,oBACAE,oBACAI,eAAgBF,EAAcz6C,UAGzB,CACLu6C,oBACAI,eAAgBF,EAAcz6C,QAC9BquC,OAAQoM,EAEX,CAAC,MAAO78E,GAEP,MADApS,QAAQoS,MAAM,iCAAkCA,GAC1CA,CACP,CACH,CAOA9R,EAAII,MAAM0uF,gBAAkBA,gBAQ5B9uF,EAAII,MAAM2uF,UAAY,SAAUC,EAAWC,GAIzC,OAHAf,OAASc,EACT5pD,WAAa6pD,EACbvvF,QAAQ6E,IAAI,gCACL3G,IACT,EAEAoC,EAAII,MAAM+2E,UAAYA,KAQtBn3E,EAAII,MAAM8uF,gBAAkBh9E,eAAgBmB,EAASq7B,GACnD,IACE,MAAMygD,EvC5KH,SAAuB97E,EAASivB,GAEnC,OAAOwmB,GADQiE,GAAY15C,GACGivB,EAClC,CuCyK6B8sD,CAAqB/7E,EAASq7B,GACvD,OAAOygD,CACR,CAAC,MAAOr9E,GAEP,OADApS,QAAQoS,MAAM,6BAA8BA,GACrC,IACR,CACH,EAOA9R,EAAII,MAAMktF,iBAAmB,SAAU5+C,GACrC,OAAO4+C,GAAiB5+C,EAC1B,EAOA1uC,EAAII,MAAMivF,gBAAkBn9E,eAAgBmB,GAC1C,IAEE,GAAIA,IAAYy7E,gBACd,MAAM,IAAI/8E,MAAM,sCAAwC+8E,iBAE1D,MAAMvc,QAAe4E,KACfzoC,QAAkB6jC,EAAOU,YAAY5/D,GAE3C,OADA3T,QAAQ6E,IAAI,qBAAsBmqC,GAC3BA,CACR,CAAC,MAAO58B,GAEP,OADApS,QAAQoS,MAAM,4BAA6BA,GACpC,IACR,CACH,EAWA9R,EAAII,MAAMkvF,4BAA8Bp9E,eAAgBgiC,EAASxF,GAC/D,IACE,MAAM7tC,EAAMjD,KACNib,QAAawrE,GAAIxrE,OACjB02E,QAAelL,GAAIxrE,OACnB22E,QAAenL,GAAIxrE,OACnBmF,EAAWsvE,GAAiB5+C,GAG5B+gD,QAAsBpL,GAAInI,QAAQ93E,KAAKC,UAAUwU,GAAOmF,GACxD0xE,QAAwBrL,GAAInI,QAAQ93E,KAAKC,UAAUkrF,GAASvxE,GAC5D2xE,QAAwBtL,GAAInI,QAAQ93E,KAAKC,UAAUmrF,GAASxxE,GAG5D4xE,EAAiBnC,GAAgB8B,EAAOtI,MACxC4I,EAAkBpC,GAAgB+B,EAAOvI,MAE/CpmF,EACGY,IAAI,WACJA,IAAI,SACJA,IAAIyyC,GACJlzC,IAAI,CACH6X,KAAM42E,EACNF,OAAQG,EACRF,OAAQG,EACRG,WAAY,CACVC,iBAAkBR,EAAO9I,KACzBsJ,iBAAkBR,EAAO9I,KACzB8H,kBAAmBsB,EAAgBlhD,UACnCqhD,kBAAmBJ,EAAejhD,aAIxCjvC,QAAQ6E,IAAI,8CAA+C2vC,EAC5D,CAAC,MAAOpiC,GAEP,MADApS,QAAQoS,MAAM,6CAA8CA,GACtDA,CACP,CACH,EAQA9R,EAAII,MAAM6vF,kBAAoB/9E,eAAgBgiC,EAASxF,GACrD,IACE,MAAM7tC,EAAMjD,KACNsyF,QAAsBrvF,EACzBY,IAAI,WACJA,IAAI,SACJA,IAAIyyC,GACJzyC,IAAI,QACJwyD,OACH,IAAKi8B,EACH,MAAM,IAAIn+E,MAAM,4CAElB,MAAMiM,EAAWsvE,GAAiB5+C,GAC5ByhD,QAAsB9L,GAAIjI,QAAQ8T,EAAelyE,GAEvD,OADAte,QAAQ6E,IAAI4rF,GACLA,CACR,CAAC,MAAOr+E,GAEP,OADApS,QAAQoS,MAAM,wCAAyCA,GAChD,IACR,CACH,EAaA9R,EAAII,MAAM4qD,MAAQ,SAAU5qD,EAAOgwF,EAAQ5zF,EAAMgnB,GAG/C,GAFA9jB,QAAQ6E,IAAI,4BAA6B,CAAEnE,QAAOgwF,SAAQ5zF,SAElC,mBAAbgnB,EAET,OADA9jB,QAAQoS,MAAM,+BACPlU,KAGT,IAEE,MAAMyyF,EFxSwB,gBAAzBtzE,QAAQ/P,IAAIsjF,UACM,oBAAXhsF,QACsB,cAA7BA,OAAO4a,SAASqlE,SEsSsB,YAAcnkF,EACnDmwF,EAAcxM,GAAqBsM,GAEzC3wF,QAAQ6E,IAAI,SAAS8rF,mBAA8BE,GAGlC,IAAIC,GACnBD,EAAY1N,2BACZuB,GACA7R,QAHF,MAOMke,EAAgBv+E,MAAOk+E,EAAQM,KACnChxF,QAAQ6E,IAAI,sBAAuB,CAAE6rF,SAAQM,gBAC7C,MAAMne,QAAe4E,KACf5W,EAAW,IAAIkF,SACnBqnB,GACA1I,GACA7R,IAEKl0C,EAASu9B,EAAW+0B,SAAiBpwB,EAASqwB,WACnDpD,EAAmB4C,GACnBM,GAGF,OADAhxF,QAAQ6E,IAAI,uBAAwB,CAAE85B,UAASu9B,YAAW+0B,YACnD,CAAEtyD,UAASu9B,YAAW+0B,UAAS,EAIlCE,EAAe3+E,MAAOk+E,EAAQM,KAClChxF,QAAQ6E,IAAI,oBAAqB,CAAE6rF,SAAQM,gBAC3C,MAAMne,QAAe4E,KACf5W,EAAW,IAAIkF,SACnBqnB,GACA1I,GACA7R,GAEI3oB,QAAW2W,EAASuwB,WAAWp4E,YAAY03E,GAASM,GAC1DhxF,QAAQ6E,IAAI,oBAAqBqlD,EAAG9uD,MACpC,MAAM8iE,QAAgBhU,EAAGpiD,OAEzB,OADA9H,QAAQ6E,IAAI,yBAA0Bq5D,GAC/BhU,CAAE,EAILmnC,EAAkB7+E,MAAOk+E,IAC7B,MAAM7d,QAAe4E,KACf5W,EAAW,IAAIkF,SACnBqnB,GACA1I,GACA7R,IAEKme,EAAa90B,EAAW+0B,SAAiBpwB,EAASwwB,gBACvDr4E,YAAY03E,IAQd,OANA1wF,QAAQ6E,IAAI,iCAAkC,CAC5C6rF,SACAM,cACA90B,YACA+0B,YAEK,CAAED,cAAa90B,YAAW+0B,UAAS,EAG5C,GAAIP,IAAW5zF,EAEbqE,IAAIY,IAAI2uF,GAAQjsF,MAAK+N,MAAO8+E,IAC1B,IAAKA,EAEH,YADIxtE,GAAUA,EAAS,CAAEzjB,IAAK,6BAIhCL,QAAQ6E,IAAI,eAAgBysF,GAG5B,MAAMN,EAAcM,EAAaC,aAGjC,GAFAvxF,QAAQ6E,IAAI,cAAemsF,GAEtBA,EAML,IACE,MAAMryD,QAAEA,EAAOu9B,UAAEA,EAAS+0B,QAAEA,SAAkBF,EAC5CL,EACAM,GAEIQ,QAAqBH,EAAgBX,GAEvC/xD,EACE7a,GACFA,EAAS,CACPniB,IAAI,EACJgS,QAAS,8BACTuoD,YACA+0B,UACAO,iBAGA1tE,GACFA,EAAS,CACPniB,IAAI,EACJgS,QAAS,kCACT69E,gBAGP,CAAC,MAAOp/E,GACH0R,GAAUA,EAAS,CAAEzjB,IAAK+R,EAAMuB,SACrC,MA/BKmQ,GACFA,EAAS,CAAEzjB,IAAK,uCA8BnB,SAEE,GAAIvD,IAAS4zF,EAAQ,CAE1B,MAAMe,EAAYhE,KAEZuD,EAAcnD,GAAiBC,EADlBppF,KAAKC,UAAU7H,KAGlCqE,IACGY,IAAI0vF,GACJnwF,IAAI,IAAKxE,EAAMy0F,aAAcP,IAAex+E,MAAO1Q,IAElD,GADA9B,QAAQ6E,IAAI,MAAO/C,GACfA,EAAIzB,IACFyjB,GAAUA,EAAS,CAAEzjB,IAAK,oCAIhC,IACE,MAAM6pD,QAAWinC,EAAaM,EAAWT,GACrCltE,GACFA,EAAS,CACPniB,IAAI,EACJgS,QAAS,uCACT+8E,OAAQe,EACRC,OAAQxnC,EAAG9uD,MAEhB,CAAC,MAAOgX,GACH0R,GAAUA,EAAS,CAAEzjB,IAAK+R,EAAMuB,SACrC,IAEX,MACUmQ,GACFA,EAAS,CACPzjB,IAAK,4DAIX,OAAOc,GACR,CAAC,MAAOiR,GAEP,OADA0R,EAAS,CAAEzjB,IAAK+R,EAAMuB,UACfzV,IACR,CACH,EAUAoC,EAAII,MAAMqtF,gBAAkB,SAAUC,GACpC,OAAOD,GAAgBC,EACzB,EAQA1tF,EAAII,MAAMixF,uBAAyBn/E,eACjCo/E,EACA5iD,GAEA,IACE,MAAM7tC,EAAMjD,KAGN2zF,QAAsB1wF,EACzBY,IAAI,WACJA,IAAI,SACJA,IAAI6vF,GACJ7vF,IAAI,cACJwyD,OAEH,IACGs9B,IACAA,EAAcxB,mBACdwB,EAAchD,kBAEf,MAAM,IAAIx8E,MAAM,qCAIlB,MAAMy/E,QAAsB5zF,KAAKsxF,gBAC/BJ,gBACApgD,GAEI1wB,EAAWsvE,GAAiB5+C,GAE5B+iD,QAAmB5wF,EACtBY,IAAI,WACJA,IAAI,SACJA,IAAI+vF,GACJv9B,OAEH,IAAKw9B,IAAeA,EAAWjC,OAC7B,MAAM,IAAIz9E,MAAM,2BAIlB,IAAI2/E,EACJ,IACE,MAAMC,QAAsBtN,GAAIjI,QAAQqV,EAAWjC,OAAQxxE,GAC3D0zE,EAC2B,iBAAlBC,EACHvtF,KAAK+E,MAAMwoF,GACXA,CACP,CAAC,MAAO7/E,GAEP,MADApS,QAAQoS,MAAM,kCAAmCA,GAC3C,IAAIC,MAAM,kCACjB,CAGD,MAAMu8E,QAAqBjK,GAAIqE,OAC7B6I,EAAcxB,iBACd2B,GAGF,IAAKpD,EACH,MAAM,IAAIv8E,MAAM,oCAGlBrS,QAAQ6E,IAAI,0BAA2B+pF,GAEvC,MAAMO,eAAEA,GAAmBR,GACzBC,EACAiD,EAAchD,mBAGhB,MAAO,CACLM,iBACA+C,gBAAiBF,EAAgBjL,KACjC8H,kBAAmBgD,EAAchD,kBAEpC,CAAC,MAAOz8E,GAEP,MADApS,QAAQoS,MAAM,oCAAqCA,GAC7CA,CACP,CACH,EAOA9R,EAAII,MAAMyxF,mBAAqB3/E,eAAgBw8B,GAC7C,IACE,MAAM7tC,EAAMjD,KACNs2C,QAAgBt2C,KAAKsxF,gBAAgBJ,gBAAiBpgD,GACtD1wB,EAAWsvE,GAAiB5+C,GAG5BwhD,QAAsBrvF,EACzBY,IAAI,WACJA,IAAI,SACJA,IAAIyyC,GACJ+f,OAEH,IAAKi8B,IAAkBA,EAAcX,SAAWW,EAAcV,OAC5D,MAAM,IAAIz9E,MAAM,kBAIlB,MAAM+/E,EAAiB1tF,KAAK+E,YACpBk7E,GAAIjI,QAAQ8T,EAAcX,OAAQvxE,IAEpC0zE,EAAkBttF,KAAK+E,YACrBk7E,GAAIjI,QAAQ8T,EAAcV,OAAQxxE,IAGpC4xE,EAAiBnC,GAAgBqE,EAAe7K,MAChD4I,EAAkBpC,GAAgBiE,EAAgBzK,MAGxDpmF,EAAIY,IAAI,WAAWA,IAAI,SAASA,IAAIyyC,GAASzyC,IAAI,cAAcT,IAAI,CACjE+uF,iBAAkBH,EAAejhD,UACjC4/C,kBAAmBsB,EAAgBlhD,YAGrCjvC,QAAQ6E,IAAI,6CACb,CAAC,MAAOuN,GAEP,MADApS,QAAQoS,MAAM,iCAAkCA,GAC1CA,CACP,CACH,EAYA9R,EAAII,MAAM2xF,oBAAsB7/E,eAC9B28E,EACA+C,EACAljD,EACA6/C,GAEA,IACE,MAAM1tF,EAAMjD,KACNogB,EAAWsvE,GAAiB5+C,GAG5BsjD,QAAkBp0F,KAAKsxF,gBAAgBJ,gBAAiBpgD,GACxDwhD,QAAsBrvF,EACzBY,IAAI,WACJA,IAAI,SACJA,IAAIuwF,GACJ/9B,OAEH,IAAKi8B,IAAkBA,EAAcX,SAAWW,EAAcV,OAC5D,MAAM,IAAIz9E,MAAM,kBAIlB,IAAI+/E,EACJ,IACE,MAAMG,QAA6B5N,GAAIjI,QACrC8T,EAAcX,OACdvxE,GAEF8zE,EACkC,iBAAzBG,EACH7tF,KAAK+E,MAAM8oF,GACXA,CACP,CAAC,MAAOngF,GAEP,MADApS,QAAQoS,MAAM,yBAA0BA,GAClC,IAAIC,MAAM,yBACjB,CAGD,MAAMu8E,QAAqBjK,GAAIqE,OAAOkJ,EAAiBE,GAEvD,IAAKxD,EACH,MAAM,IAAIv8E,MAAM,oCAGlBrS,QAAQ6E,IAAI,yBAA0B+pF,GAEtC,MAAM/L,OAAEA,EAAQsM,eAAgBM,GAAqBd,GACnDC,EACAC,GAIF,GAAIY,EAAiBt1E,gBAAkBg1E,EAAeh1E,cAMpD,MALAna,QAAQoS,MAAM,YAAa,CACzBogF,UAAW/C,EACXpgB,SAAU8f,EACVP,iBAEI,IAAIv8E,MAAM,4CAGlB,MAAO,CACLwwE,SACAruC,QAASi7C,EAEZ,CAAC,MAAOr9E,GAEP,MADApS,QAAQoS,MAAM,kCAAmCA,GAC3CA,CACP,CACH,EAUA9R,EAAII,MAAM+xF,uBAAyBjgF,eACjC28E,EACA+C,EACArD,EACA7/C,EACAj1B,EAAU,CAAE24E,SAAS,EAAOhyF,MAAO,oBAEnC,IACE,MAAMS,EAAMjD,KACN4zF,QAAsB5zF,KAAKsxF,gBAC/BJ,gBACApgD,GAGF,GAAIj1B,EAAQ24E,QAAS,CAEnB,MAAM7f,QAAe4E,KAEfpZ,EADcgmB,GAAqBtqE,EAAQrZ,OACb0iF,0BAEpCpjF,QAAQ6E,IAAI,0BAA2Bw5D,GAEvC,MAAMwC,EAAW,IAAIkF,SACnB1H,EACAmmB,GACA3R,GAII8f,QAAe9xB,EAAS8xB,SAC9B3yF,QAAQ6E,IAAI,WAAY8tF,EAAOz4F,YAG/B,MAAMgwD,QAAW2W,EAAS+xB,gBACxBV,EACArD,EACAM,EACA,CAAEn9E,MAAO2gF,IAGX3yF,QAAQ6E,IAAI,oBAAqBqlD,EAAG9uD,MACpC,MAAM8iE,QAAgBhU,EAAGpiD,OACzB9H,QAAQ6E,IAAI,yBAA0Bq5D,EAAQ9iE,MAE9C4E,QAAQ6E,IAAI,oDAClB,MAEM1D,EAAIY,IAAI,WAAWA,IAAI,oBAAoBwH,IAAI,CAC7C4lF,iBACA2C,gBACAI,kBACArD,oBACA3yB,UAAW9+D,KAAKD,QAElB6C,QAAQ6E,IAAI,sCAEf,CAAC,MAAOuN,GAGP,MAFApS,QAAQoS,MAAM,oCAAqCA,GACnDpS,QAAQoS,MAAM,iBAAkBA,EAAMoxC,OAChCpxC,CACP,CACH,EAOA9R,EAAII,MAAMmyF,mBAAqBrgF,eAC7Bw8B,EACAj1B,EAAU,CAAE+4E,OAAQ,SAEpB,IACE,MAAMC,EAAW,GAEjB,GAAuB,YAAnBh5E,EAAQ+4E,QAA2C,SAAnB/4E,EAAQ+4E,OAAmB,CAC7D,MAAMjgB,QAAe4E,KAIfpZ,EAHcgmB,GAClBtqE,EAAQrZ,OAAS,mBAEiB0iF,0BAE9BviB,EAAW,IAAIkF,SACnB1H,EACAmmB,GACA3R,GAGF,IAEE,MAAMmgB,QAA2BnyB,EAASoyB,wBACpCC,EAAa77E,OAAO27E,EAAmB94F,YAG7C,GAFA8F,QAAQ6E,IAAI,gCAAiCquF,GAEzCA,EAAa,EAAG,CAElB,MAAMC,EAAY,IACZC,EAAYF,EAAa,EAE/B,IAAK,IAAI73F,EAAI,EAAGA,GAAK+3F,EAAW/3F,GAAK83F,EAAW,CAC9C,MAAME,EAAUz4F,KAAK2rB,IAAIlrB,EAAI83F,EAAY,EAAGC,GACtCtoF,QAAc+1D,EAASyyB,wBAAwBj4F,EAAGg4F,GAGxD,IAAK,MAAME,KAAgBzoF,EACzB,IAEE,KACGyoF,GACAA,EAAapE,gBACboE,EAAarB,iBACbqB,EAAa1E,mBACd,CACA7uF,QAAQ6E,IAAI,wBAAyB0uF,GACrC,QACD,CAGD,MAAMC,QAAwBt1F,KAAKm0F,oBACjCkB,EAAapE,eACboE,EAAarB,gBACbljD,EACAukD,EAAa1E,mBAIfkE,EAASz2F,KAAK,CACZ6yF,eAAgBoE,EAAapE,eAC7B+C,gBAAiBqB,EAAarB,gBAC9BrD,kBAAmB0E,EAAa1E,kBAChC3yB,UAAW7kD,OAAOk8E,EAAar3B,WAC/B42B,OAAQ,UACRjQ,OAAQ2Q,GAEX,CAAC,MAAO32F,GAEPmD,QAAQ6E,IACN,4BAA4B0uF,EAAapE,kBAE3C,QACD,CAEJ,CACF,CACF,CAAC,MAAO/8E,GACPpS,QAAQoS,MAAM,2CAA4CA,EAC3D,CACF,CAED,GAAuB,aAAnB2H,EAAQ+4E,QAA4C,SAAnB/4E,EAAQ+4E,OAAmB,CAE9D,MAAM3xF,EAAMjD,KACNu1F,QAAyB,IAAI/gF,SAAS5J,IAC1C,MAAM9O,EAAI,GACVmH,EACGY,IAAI,WACJA,IAAI,oBACJA,IAAI6vF,kBACJztF,MACAM,MAAK,CAACivF,EAASj0F,KACVi0F,GAASvE,gBACXn1F,EAAEsC,KAAK,IAAKo3F,EAASj0F,KAAIqzF,OAAQ,YAClC,IAELv2F,YAAW,IAAMuM,EAAQ9O,IAAI,IAAK,IAGpC+4F,EAASz2F,QAAQm3F,EAClB,CAGD,OADAzzF,QAAQ6E,IAAI,SAASkuF,EAASj4F,2BACvBi4F,CACR,CAAC,MAAO3gF,GAEP,MADApS,QAAQoS,MAAM,qCAAsCA,GAC9CA,CACP,CACH,EAOA9R,EAAII,MAAMizF,qBAAuBnhF,eAAgBo/E,GAC/C,IACE,MAAMzwF,EAAMjD,KACN60F,QAAiB5xF,EACpBY,IAAI,WACJA,IAAI,oBACJA,IAAI6vF,GACJztF,MACAM,OACA8vD,OAGCw+B,GACFp3F,OAAOU,KAAK02F,GAAUvtF,SAAQgN,MAAOjP,IACnC,MAAMmwF,EAAUX,EAASxvF,GAEtBmwF,GACAA,EAAQvE,gBACRuE,EAAQxB,iBACRwB,EAAQ7E,yBAEH1tF,EACHY,IAAI,WACJA,IAAI,oBACJA,IAAI6vF,GACJ7vF,IAAIwB,GACJjC,IAAI,KACR,GAGN,CAAC,MAAO8Q,GACPpS,QAAQoS,MAAM,mCAAoCA,EACnD,CACH,EAOO,MAAMwhF,GAEXC,wBAA0BpG,GAC1BoG,wBAA0BjG,GAC1BiG,uBAAyB9F,GACzB8F,iBAAmBpc,GACnBoc,4BAA8BlF,GAG9BkF,oBAAsB,CACpBxE,UAAW/uF,EAAII,MAAM2uF,UACrB5X,UAAWn3E,EAAII,MAAM+2E,UACrB+X,gBAAiBlvF,EAAII,MAAM8uF,gBAC3B5B,iBAAkBttF,EAAII,MAAMktF,iBAC5B+B,gBAAiBrvF,EAAII,MAAMivF,gBAC3BC,4BAA6BtvF,EAAII,MAAMkvF,4BACvCW,kBAAmBjwF,EAAII,MAAM6vF,kBAC7BjlC,MAAOhrD,EAAII,MAAM4qD,MACjByiC,gBAAiBztF,EAAII,MAAMqtF,gBAC3B4D,uBAAwBrxF,EAAII,MAAMixF,uBAClCQ,mBAAoB7xF,EAAII,MAAMyxF,mBAC9BE,oBAAqB/xF,EAAII,MAAM2xF,oBAC/BI,uBAAwBnyF,EAAII,MAAM+xF,uBAClCI,mBAAoBvyF,EAAII,MAAMmyF,mBAC9Bc,qBAAsBrzF,EAAII,MAAMizF,sBAIlCE,uBAAyBzE,gBACzByE,8BAAgCzG,GAChCyG,oBAAsBhQ","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,103]}