@bonfida/spl-name-service 2.0.0-alpha.17 → 2.0.0-alpha.19

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (10) hide show
  1. package/dist/index.cjs +33 -1
  2. package/dist/index.cjs.map +1 -0
  3. package/dist/index.mjs +33 -1
  4. package/dist/index.mjs.map +1 -0
  5. package/dist/nft/index.d.ts +2 -11
  6. package/dist/record.d.ts +8 -0
  7. package/dist/record_v2.d.ts +1 -0
  8. package/dist/resolve.d.ts +0 -8
  9. package/dist/utils.d.ts +11 -0
  10. package/package.json +13 -14
package/dist/index.cjs.map ADDED
@@ -0,0 +1 @@
1
+ {"version":3,"file":"index.cjs","sources":["../node_modules/base64-js/index.js","../node_modules/ieee754/index.js","../node_modules/buffer/index.js","../node_modules/@solana/spl-token/lib/esm/constants.js","../node_modules/@solana/buffer-layout/lib/Layout.js","../node_modules/@solana/buffer-layout-utils/lib/esm/base.mjs","../node_modules/bigint-buffer/dist/browser.js","../node_modules/@solana/buffer-layout-utils/lib/esm/bigint.mjs","../node_modules/@solana/buffer-layout-utils/lib/esm/native.mjs","../node_modules/@solana/buffer-layout-utils/lib/esm/web3.mjs","../node_modules/@solana/spl-token/lib/esm/errors.js","../node_modules/@solana/spl-token/lib/esm/extensions/accountType.js","../node_modules/@solana/spl-token/lib/esm/state/multisig.js","../node_modules/@solana/spl-token/lib/esm/state/account.js","../node_modules/@solana/spl-token/lib/esm/state/mint.js","../node_modules/@solana/spl-token/lib/esm/instructions/associatedTokenAccount.js","../node_modules/bn.js/lib/bn.js","../src/error.ts","../src/int.ts","../node_modules/safe-buffer/index.js","../node_modules/base-x/src/index.js","../node_modules/borsh/node_modules/bs58/index.js","../node_modules/text-encoding-utf-8/lib/encoding.lib.mjs","../node_modules/borsh/lib/index.js","../src/instructions.ts","../src/nft/name-tokenizer.ts","../src/nft/index.ts","../src/state.ts","../node_modules/minimalistic-assert/index.js","../node_modules/inherits/inherits_browser.js","../node_modules/hash.js/lib/hash/utils.js","../node_modules/hash.js/lib/hash/common.js","../node_modules/hash.js/lib/hash/sha/common.js","../node_modules/hash.js/lib/hash/sha/1.js","../node_modules/hash.js/lib/hash/sha/256.js","../node_modules/hash.js/lib/hash/sha/224.js","../node_modules/hash.js/lib/hash/sha/512.js","../node_modules/hash.js/lib/hash/sha/384.js","../node_modules/hash.js/lib/hash/sha.js","../node_modules/hash.js/lib/hash/ripemd.js","../node_modules/hash.js/lib/hash/hmac.js","../node_modules/hash.js/lib/hash.js","../node_modules/@ethersproject/logger/lib.esm/index.js","../node_modules/@ethersproject/logger/lib.esm/_version.js","../node_modules/@ethersproject/bytes/lib.esm/_version.js","../node_modules/@ethersproject/bytes/lib.esm/index.js","../node_modules/@ethersproject/sha2/lib.esm/sha2.js","../node_modules/@ethersproject/sha2/lib.esm/_version.js","../src/constants.ts","../src/deprecated/utils.ts","../node_modules/@pythnetwork/client/lib/readBig.js","../node_modules/@pythnetwork/client/lib/PythConnection.js","../node_modules/@pythnetwork/client/lib/PythHttpClient.js","../node_modules/@coral-xyz/anchor/node_modules/bs58/index.js","../node_modules/camelcase/index.js","../node_modules/buffer-layout/lib/Layout.js","../node_modules/@noble/hashes/esm/_assert.js","../node_modules/@coral-xyz/borsh/dist/index.js","../node_modules/@noble/hashes/esm/utils.js","../node_modules/@noble/hashes/esm/_sha2.js","../node_modules/@noble/hashes/esm/sha256.js","../node_modules/pako/dist/pako.esm.mjs","../node_modules/eventemitter3/index.js","../node_modules/@coral-xyz/anchor/dist/browser/index.js","../node_modules/@pythnetwork/client/lib/anchor/coder/accounts.js","../node_modules/bs58/node_modules/base-x/src/index.js","../node_modules/bs58/index.js","../node_modules/@pythnetwork/client/lib/anchor/coder/instructions.js","../node_modules/@pythnetwork/client/lib/anchor/coder/idl.js","../node_modules/@pythnetwork/client/lib/anchor/coder/index.js","../node_modules/@pythnetwork/client/lib/anchor/coder/events.js","../node_modules/@pythnetwork/client/lib/anchor/coder/state.js","../node_modules/@pythnetwork/client/lib/anchor/coder/types.js","../node_modules/@pythnetwork/client/lib/anchor/index.js","../node_modules/@pythnetwork/client/lib/anchor/program.js","../node_modules/@pythnetwork/client/lib/index.js","../node_modules/@pythnetwork/client/lib/cluster.js","../node_modules/@bonfida/sns-records/dist/index.mjs","../src/types/record.ts","../src/utils.ts","../node_modules/bech32-buffer/lib/bit-converter.js","../node_modules/bech32-buffer/lib/encoding.js","../node_modules/bech32-buffer/lib/index.js","../node_modules/ipaddr.js/lib/ipaddr.js","../node_modules/punycode/punycode.es6.js","../node_modules/tweetnacl/nacl-fast.js","../src/record.ts","../src/resolve.ts","../src/record_v2.ts","../src/bindings.ts","../src/twitter_bindings.ts","../src/favorite-domain.ts","../src/types/custom-bg.ts","../src/custom-bg.ts"],"sourcesContent":["'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * implementation (most compatible, even IE6)\n *\n * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+,\n * Opera 11.6+, iOS 4.2+.\n *\n * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\n\n/**\n * The Buffer constructor returns instances of `Uint8Array` that have their\n * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of\n * `Uint8Array`, so the returned instances will have all the node `Buffer` methods\n * and the `Uint8Array` methods. Square bracket notation works as expected -- it\n * returns a single octet.\n *\n * The `Uint8Array` prototype remains unmodified.\n */\n\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\n\n/**\n * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError\n * if value is a number.\n * Buffer.from(str[, encoding])\n * Buffer.from(array)\n * Buffer.from(buffer)\n * Buffer.from(arrayBuffer[, byteOffset[, length]])\n **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\n }\n if (fill !== undefined) {\n // Only pay attention to encoding if it's a string. This\n // prevents accidentally sending in a number that would\n // be interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.write(string, encoding)\n\n if (actual !== length) {\n // Writing a hex string, for example, that contains invalid characters will\n // cause everything after the first invalid character to be ignored. (e.g.\n // 'abxxcd' will be treated as 'ab')\n buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let i = 0, len = Math.min(x, y); i < len; ++i) {\n if (a[i] !== b[i]) {\n x = a[i]\n y = b[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\nBuffer.isEncoding = function isEncoding (encoding) {\n switch (String(encoding).toLowerCase()) {\n case 'hex':\n case 'utf8':\n case 'utf-8':\n case 'ascii':\n case 'latin1':\n case 'binary':\n case 'base64':\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return true\n default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.isArray(list)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n }\n\n if (list.length === 0) {\n return Buffer.alloc(0)\n }\n\n let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\n // This behaves neither like String nor Uint8Array in that we set start/end\n // to their upper/lower bounds if the value passed is out of range.\n // undefined is handled specially as per ECMA-262 6th Edition,\n // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization.\n if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\n if (start > this.length) {\n return ''\n }\n\n if (end === undefined || end > this.length) {\n end = this.length\n }\n\n if (end <= 0) {\n return ''\n }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\n end >>>= 0\n start >>>= 0\n\n if (end <= start) {\n return ''\n }\n\n if (!encoding) encoding = 'utf8'\n\n while (true) {\n switch (encoding) {\n case 'hex':\n return hexSlice(this, start, end)\n\n case 'utf8':\n case 'utf-8':\n return utf8Slice(this, start, end)\n\n case 'ascii':\n return asciiSlice(this, start, end)\n\n case 'latin1':\n case 'binary':\n return latin1Slice(this, start, end)\n\n case 'base64':\n return base64Slice(this, start, end)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return utf16leSlice(this, start, end)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = (encoding + '').toLowerCase()\n loweredCase = true\n }\n }\n}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let i = 0; i < len; i += 8) {\n swap(this, i, i + 7)\n swap(this, i + 1, i + 6)\n swap(this, i + 2, i + 5)\n swap(this, i + 3, i + 4)\n }\n return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\n if (length === 0) return ''\n if (arguments.length === 0) return utf8Slice(this, 0, length)\n return slowToString.apply(this, arguments)\n}\n\nBuffer.prototype.toLocaleString = Buffer.prototype.toString\n\nBuffer.prototype.equals = function equals (b) {\n if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer')\n if (this === b) return true\n return Buffer.compare(this, b) === 0\n}\n\nBuffer.prototype.inspect = function inspect () {\n let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return '<Buffer ' + str + '>'\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\n }\n if (thisEnd === undefined) {\n thisEnd = this.length\n }\n\n if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) {\n throw new RangeError('out of range index')\n }\n\n if (thisStart >= thisEnd && start >= end) {\n return 0\n }\n if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let i = 0; i < len; ++i) {\n if (thisCopy[i] !== targetCopy[i]) {\n x = thisCopy[i]\n y = targetCopy[i]\n break\n }\n }\n\n if (x < y) return -1\n if (y < x) return 1\n return 0\n}\n\n// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`,\n// OR the last index of `val` in `buffer` at offset <= `byteOffset`.\n//\n// Arguments:\n// - buffer - a Buffer to search\n// - val - a string, Buffer, or number\n// - byteOffset - an index into `buffer`; will be clamped to an int32\n// - encoding - an optional encoding, relevant is val is a string\n// - dir - true for indexOf, false for lastIndexOf\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\n if (typeof byteOffset === 'string') {\n encoding = byteOffset\n byteOffset = 0\n } else if (byteOffset > 0x7fffffff) {\n byteOffset = 0x7fffffff\n } else if (byteOffset < -0x80000000) {\n byteOffset = -0x80000000\n }\n byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\n if (Buffer.isBuffer(val)) {\n // Special case: looking for empty string/buffer always fails\n if (val.length === 0) {\n return -1\n }\n return arrayIndexOf(buffer, val, byteOffset, encoding, dir)\n } else if (typeof val === 'number') {\n val = val & 0xFF // Search for a byte value [0-255]\n if (typeof Uint8Array.prototype.indexOf === 'function') {\n if (dir) {\n return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset)\n } else {\n return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset)\n }\n }\n return arrayIndexOf(buffer, [val], byteOffset, encoding, dir)\n }\n\n throw new TypeError('val must be string, number or Buffer')\n}\n\nfunction arrayIndexOf (arr, val, byteOffset, encoding, dir) {\n let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\n }\n indexSize = 2\n arrLength /= 2\n valLength /= 2\n byteOffset /= 2\n }\n }\n\n function read (buf, i) {\n if (indexSize === 1) {\n return buf[i]\n } else {\n return buf.readUInt16BE(i * indexSize)\n }\n }\n\n let i\n if (dir) {\n let foundIndex = -1\n for (i = byteOffset; i < arrLength; i++) {\n if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) {\n if (foundIndex === -1) foundIndex = i\n if (i - foundIndex + 1 === valLength) return foundIndex * indexSize\n } else {\n if (foundIndex !== -1) i -= i - foundIndex\n foundIndex = -1\n }\n }\n } else {\n if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength\n for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\n }\n }\n if (found) return i\n }\n }\n\n return -1\n}\n\nBuffer.prototype.includes = function includes (val, byteOffset, encoding) {\n return this.indexOf(val, byteOffset, encoding) !== -1\n}\n\nBuffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, true)\n}\n\nBuffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) {\n return bidirectionalIndexOf(this, val, byteOffset, encoding, false)\n}\n\nfunction hexWrite (buf, string, offset, length) {\n offset = Number(offset) || 0\n const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\n }\n return i\n}\n\nfunction utf8Write (buf, string, offset, length) {\n return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nfunction asciiWrite (buf, string, offset, length) {\n return blitBuffer(asciiToBytes(string), buf, offset, length)\n}\n\nfunction base64Write (buf, string, offset, length) {\n return blitBuffer(base64ToBytes(string), buf, offset, length)\n}\n\nfunction ucs2Write (buf, string, offset, length) {\n return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length)\n}\n\nBuffer.prototype.write = function write (string, offset, length, encoding) {\n // Buffer#write(string)\n if (offset === undefined) {\n encoding = 'utf8'\n length = this.length\n offset = 0\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const remaining = this.length - offset\n if (length === undefined || length > remaining) length = remaining\n\n if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) {\n throw new RangeError('Attempt to write outside buffer bounds')\n }\n\n if (!encoding) encoding = 'utf8'\n\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'hex':\n return hexWrite(this, string, offset, length)\n\n case 'utf8':\n case 'utf-8':\n return utf8Write(this, string, offset, length)\n\n case 'ascii':\n case 'latin1':\n case 'binary':\n return asciiWrite(this, string, offset, length)\n\n case 'base64':\n // Warning: maxLength not taken into account in base64Write\n return base64Write(this, string, offset, length)\n\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return ucs2Write(this, string, offset, length)\n\n default:\n if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding)\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\n\nBuffer.prototype.toJSON = function toJSON () {\n return {\n type: 'Buffer',\n data: Array.prototype.slice.call(this._arr || this, 0)\n }\n}\n\nfunction base64Slice (buf, start, end) {\n if (start === 0 && end === buf.length) {\n return base64.fromByteArray(buf)\n } else {\n return base64.fromByteArray(buf.slice(start, end))\n }\n}\n\nfunction utf8Slice (buf, start, end) {\n end = Math.min(buf.length, end)\n const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F)\n if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\n }\n }\n }\n }\n\n if (codePoint === null) {\n // we did not generate a valid codePoint so insert a\n // replacement char (U+FFFD) and advance only 1 byte\n codePoint = 0xFFFD\n bytesPerSequence = 1\n } else if (codePoint > 0xFFFF) {\n // encode to utf16 (surrogate pair dance)\n codePoint -= 0x10000\n res.push(codePoint >>> 10 & 0x3FF | 0xD800)\n codePoint = 0xDC00 | codePoint & 0x3FF\n }\n\n res.push(codePoint)\n i += bytesPerSequence\n }\n\n return decodeCodePointsArray(res)\n}\n\n// Based on http://stackoverflow.com/a/22747272/680742, the browser with\n// the lowest limit is Chrome, with 0x10000 args.\n// We go 1 magnitude less, for safety\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const len = this.length\n start = ~~start\n end = end === undefined ? len : ~~end\n\n if (start < 0) {\n start += len\n if (start < 0) start = 0\n } else if (start > len) {\n start = len\n }\n\n if (end < 0) {\n end += len\n if (end < 0) end = 0\n } else if (end > len) {\n end = len\n }\n\n if (end < start) end = start\n\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\n */\nfunction checkOffset (offset, ext, length) {\n if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint')\n if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length')\n}\n\nBuffer.prototype.readUintLE =\nBuffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\n})\n\nBuffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) checkOffset(offset, byteLength, this.length)\n\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n if (!(this[offset] & 0x80)) return (this[offset])\n return ((0xff - this[offset] + 1) * -1)\n}\n\nBuffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, true, 23, 4)\n}\n\nBuffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n return ieee754.read(this, offset, false, 23, 4)\n}\n\nBuffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, true, 52, 8)\n}\n\nBuffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 8, this.length)\n return ieee754.read(this, offset, false, 52, 8)\n}\n\nfunction checkInt (buf, value, offset, ext, max, min) {\n if (!Buffer.isBuffer(buf)) throw new TypeError('\"buffer\" argument must be a Buffer instance')\n if (value > max || value < min) throw new RangeError('\"value\" argument is out of bounds')\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n}\n\nBuffer.prototype.writeUintLE =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\nBuffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0)\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\nBuffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\nBuffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\nBuffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\nBuffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0)\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\n }\n this[offset + i] = ((value / mul) >> 0) - sub & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80)\n if (value < 0) value = 0xff + value + 1\n this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000)\n this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\n return offset + 4\n}\n\nBuffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000)\n if (value < 0) value = 0xffffffff + value + 1\n this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nfunction checkIEEE754 (buf, value, offset, ext, max, min) {\n if (offset + ext > buf.length) throw new RangeError('Index out of range')\n if (offset < 0) throw new RangeError('Index out of range')\n}\n\nfunction writeFloat (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\n }\n ieee754.write(buf, value, offset, littleEndian, 23, 4)\n return offset + 4\n}\n\nBuffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) {\n return writeFloat(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) {\n return writeFloat(this, value, offset, false, noAssert)\n}\n\nfunction writeDouble (buf, value, offset, littleEndian, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\n }\n ieee754.write(buf, value, offset, littleEndian, 52, 8)\n return offset + 8\n}\n\nBuffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) {\n return writeDouble(this, value, offset, true, noAssert)\n}\n\nBuffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) {\n return writeDouble(this, value, offset, false, noAssert)\n}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\n if (!start) start = 0\n if (!end && end !== 0) end = this.length\n if (targetStart >= target.length) targetStart = target.length\n if (!targetStart) targetStart = 0\n if (end > 0 && end < start) end = start\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\nBuffer.prototype.fill = function fill (val, start, end, encoding) {\n // Handle string cases:\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = this.length\n } else if (typeof end === 'string') {\n encoding = end\n end = this.length\n }\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\n if (start < 0 || this.length < start || this.length < end) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return this\n }\n\n start = start >>> 0\n end = end === undefined ? this.length : end >>> 0\n\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\n if (codePoint > 0xD7FF && codePoint < 0xE000) {\n // last char was a lead\n if (!leadSurrogate) {\n // no lead yet\n if (codePoint > 0xDBFF) {\n // unexpected trail\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n } else if (i + 1 === length) {\n // unpaired lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n continue\n }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\n codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000\n } else if (leadSurrogate) {\n // valid bmp char, but last char was a lead\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n }\n\n leadSurrogate = null\n\n // encode utf8\n if (codePoint < 0x80) {\n if ((units -= 1) < 0) break\n bytes.push(codePoint)\n } else if (codePoint < 0x800) {\n if ((units -= 2) < 0) break\n bytes.push(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n // Node's code seems to be doing this and not & 0x7F..\n byteArray.push(str.charCodeAt(i) & 0xFF)\n }\n return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\n c = str.charCodeAt(i)\n hi = c >> 8\n lo = c % 256\n byteArray.push(lo)\n byteArray.push(hi)\n }\n\n return byteArray\n}\n\nfunction base64ToBytes (str) {\n return base64.toByteArray(base64clean(str))\n}\n\nfunction blitBuffer (src, dst, offset, length) {\n let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","import { PublicKey } from '@solana/web3.js';\n/** Address of the SPL Token program */\nexport const TOKEN_PROGRAM_ID = new PublicKey('TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA');\n/** Address of the SPL Token 2022 program */\nexport const TOKEN_2022_PROGRAM_ID = new PublicKey('TokenzQdBNbLqP5VEhdkAS6EPFLC1PHnBqCXEpPxuEb');\n/** Address of the SPL Associated Token Account program */\nexport const ASSOCIATED_TOKEN_PROGRAM_ID = new PublicKey('ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL');\n/** Address of the special mint for wrapped native SOL in spl-token */\nexport const NATIVE_MINT = new PublicKey('So11111111111111111111111111111111111111112');\n/** Address of the special mint for wrapped native SOL in spl-token-2022 */\nexport const NATIVE_MINT_2022 = new PublicKey('9pan9bMn5HatX4EJdBwg9VgCa7Uz5HL8N1m5D3NdXejP');\n/** Check that the token program provided is not `Tokenkeg...`, useful when using extensions */\nexport function programSupportsExtensions(programId) {\n if (programId === TOKEN_PROGRAM_ID) {\n return false;\n }\n else {\n return true;\n }\n}\n//# sourceMappingURL=constants.js.map","/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n/**\n * Support for translating between Uint8Array instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n * format} with {@link module:Layout.u8|8-bit}, {@link\n * module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n * {@link module:Layout.u32|32-bit}, {@link\n * module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n * representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n * format} with {@link module:Layout.u16be|16-bit}, {@link\n * module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n * {@link module:Layout.u40be|40-bit}, and {@link\n * module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n * format} with {@link module:Layout.s8|8-bit}, {@link\n * module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n * {@link module:Layout.s32|32-bit}, {@link\n * module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n * representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n * with {@link module:Layout.s16be|16-bit}, {@link\n * module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n * {@link module:Layout.s40be|40-bit}, and {@link\n * module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n * less than 2^53) or nearby integral Number in {@link\n * module:Layout.nu64|unsigned little-endian}, {@link\n * module:Layout.nu64be|unsigned big-endian}, {@link\n * module:Layout.ns64|signed little-endian}, and {@link\n * module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n * module:Layout.f32|little-endian} and {@link\n * module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n * module:Layout.f64|little-endian} and {@link\n * module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n * encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n * module:Layout~Layout|Layout}, with JavaScript representation as\n * an Array and constant or data-dependent {@link\n * module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n * heterogeneous sequence of {@link module:Layout~Layout|Layout}\n * instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n * module:Layout~VariantLayout|variant layouts} over a fixed\n * (padded) or variable (not padded) span of bytes, using an\n * unsigned integer at the start of the data or a separate {@link\n * module:Layout.unionLayoutDiscriminator|layout element} to\n * determine which layout to use when interpreting the buffer\n * contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n * of individual {@link\n * module:Layout~BitStructure#addField|BitField}s packed into an 8,\n * 16, 24, or 32-bit unsigned integer starting at the least- or\n * most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n * module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n'use strict';\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.s16 = exports.s8 = exports.nu64be = exports.u48be = exports.u40be = exports.u32be = exports.u24be = exports.u16be = exports.nu64 = exports.u48 = exports.u40 = exports.u32 = exports.u24 = exports.u16 = exports.u8 = exports.offset = exports.greedy = exports.Constant = exports.UTF8 = exports.CString = exports.Blob = exports.Boolean = exports.BitField = exports.BitStructure = exports.VariantLayout = exports.Union = exports.UnionLayoutDiscriminator = exports.UnionDiscriminator = exports.Structure = exports.Sequence = exports.DoubleBE = exports.Double = exports.FloatBE = exports.Float = exports.NearInt64BE = exports.NearInt64 = exports.NearUInt64BE = exports.NearUInt64 = exports.IntBE = exports.Int = exports.UIntBE = exports.UInt = exports.OffsetLayout = exports.GreedyCount = exports.ExternalLayout = exports.bindConstructorLayout = exports.nameWithProperty = exports.Layout = exports.uint8ArrayToBuffer = exports.checkUint8Array = void 0;\nexports.constant = exports.utf8 = exports.cstr = exports.blob = exports.unionLayoutDiscriminator = exports.union = exports.seq = exports.bits = exports.struct = exports.f64be = exports.f64 = exports.f32be = exports.f32 = exports.ns64be = exports.s48be = exports.s40be = exports.s32be = exports.s24be = exports.s16be = exports.ns64 = exports.s48 = exports.s40 = exports.s32 = exports.s24 = void 0;\nconst buffer_1 = require(\"buffer\");\n/* Check if a value is a Uint8Array.\n *\n * @ignore */\nfunction checkUint8Array(b) {\n if (!(b instanceof Uint8Array)) {\n throw new TypeError('b must be a Uint8Array');\n }\n}\nexports.checkUint8Array = checkUint8Array;\n/* Create a Buffer instance from a Uint8Array.\n *\n * @ignore */\nfunction uint8ArrayToBuffer(b) {\n checkUint8Array(b);\n return buffer_1.Buffer.from(b.buffer, b.byteOffset, b.length);\n}\nexports.uint8ArrayToBuffer = uint8ArrayToBuffer;\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}. The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n constructor(span, property) {\n if (!Number.isInteger(span)) {\n throw new TypeError('span must be an integer');\n }\n /** The span of the layout in bytes.\n *\n * Positive values are generally expected.\n *\n * Zero will only appear in {@link Constant}s and in {@link\n * Sequence}s where the {@link Sequence#count|count} is zero.\n *\n * A negative value indicates that the span is value-specific, and\n * must be obtained using {@link Layout#getSpan|getSpan}. */\n this.span = span;\n /** The property name used when this layout is represented in an\n * Object.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances. If left undefined the span of the unnamed layout will\n * be treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n /** Function to create an Object into which decoded properties will\n * be written.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances, which means:\n * * {@link Structure}\n * * {@link Union}\n * * {@link VariantLayout}\n * * {@link BitStructure}\n *\n * If left undefined the JavaScript representation of these layouts\n * will be Object instances.\n *\n * See {@link bindConstructorLayout}.\n */\n makeDestinationObject() {\n return {};\n }\n /**\n * Calculate the span of a specific instance of a layout.\n *\n * @param {Uint8Array} b - the buffer that contains an encoded instance.\n *\n * @param {Number} [offset] - the offset at which the encoded instance\n * starts. If absent a zero offset is inferred.\n *\n * @return {Number} - the number of bytes covered by the layout\n * instance. If this method is not overridden in a subclass the\n * definition-time constant {@link Layout#span|span} will be\n * returned.\n *\n * @throws {RangeError} - if the length of the value cannot be\n * determined.\n */\n getSpan(b, offset) {\n if (0 > this.span) {\n throw new RangeError('indeterminate span');\n }\n return this.span;\n }\n /**\n * Replicate the layout using a new property.\n *\n * This function must be used to get a structurally-equivalent layout\n * with a different name since all {@link Layout} instances are\n * immutable.\n *\n * **NOTE** This is a shallow copy. All fields except {@link\n * Layout#property|property} are strictly equal to the origin layout.\n *\n * @param {String} property - the value for {@link\n * Layout#property|property} in the replica.\n *\n * @returns {Layout} - the copy with {@link Layout#property|property}\n * set to `property`.\n */\n replicate(property) {\n const rv = Object.create(this.constructor.prototype);\n Object.assign(rv, this);\n rv.property = property;\n return rv;\n }\n /**\n * Create an object from layout properties and an array of values.\n *\n * **NOTE** This function returns `undefined` if invoked on a layout\n * that does not return its value as an Object. Objects are\n * returned for things that are a {@link Structure}, which includes\n * {@link VariantLayout|variant layouts} if they are structures, and\n * excludes {@link Union}s. If you want this feature for a union\n * you must use {@link Union.getVariant|getVariant} to select the\n * desired layout.\n *\n * @param {Array} values - an array of values that correspond to the\n * default order for properties. As with {@link Layout#decode|decode}\n * layout elements that have no property name are skipped when\n * iterating over the array values. Only the top-level properties are\n * assigned; arguments are not assigned to properties of contained\n * layouts. Any unused values are ignored.\n *\n * @return {(Object|undefined)}\n */\n fromArray(values) {\n return undefined;\n }\n}\nexports.Layout = Layout;\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n if (lo.property) {\n return name + '[' + lo.property + ']';\n }\n return name;\n}\nexports.nameWithProperty = nameWithProperty;\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n * to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n * property of `layout` is set to a function that returns a `new\n * Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n * delegates to {@link Layout#decode|layout.decode}. The\n * synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n * function that delegates to {@link Layout#encode|layout.encode}\n * with `src` set to `this`. The synthesized function may be\n * captured and extended, but when the extension is invoked `this`\n * must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\n// `Class` must be a constructor Function, but the assignment of a `layout_` property to it makes it difficult to type\n// eslint-disable-next-line @typescript-eslint/explicit-module-boundary-types\nfunction bindConstructorLayout(Class, layout) {\n if ('function' !== typeof Class) {\n throw new TypeError('Class must be constructor');\n }\n if (Object.prototype.hasOwnProperty.call(Class, 'layout_')) {\n throw new Error('Class is already bound to a layout');\n }\n if (!(layout && (layout instanceof Layout))) {\n throw new TypeError('layout must be a Layout');\n }\n if (Object.prototype.hasOwnProperty.call(layout, 'boundConstructor_')) {\n throw new Error('layout is already bound to a constructor');\n }\n Class.layout_ = layout;\n layout.boundConstructor_ = Class;\n layout.makeDestinationObject = (() => new Class());\n Object.defineProperty(Class.prototype, 'encode', {\n value(b, offset) {\n return layout.encode(this, b, offset);\n },\n writable: true,\n });\n Object.defineProperty(Class, 'decode', {\n value(b, offset) {\n return layout.decode(b, offset);\n },\n writable: true,\n });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n /**\n * Return `true` iff the external layout decodes to an unsigned\n * integer layout.\n *\n * In that case it can be used as the source of {@link\n * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n * or as {@link UnionLayoutDiscriminator#layout|external union\n * discriminators}.\n *\n * @abstract\n */\n isCount() {\n throw new Error('ExternalLayout is abstract');\n }\n}\nexports.ExternalLayout = ExternalLayout;\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n constructor(elementSpan = 1, property) {\n if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n throw new TypeError('elementSpan must be a (positive) integer');\n }\n super(-1, property);\n /** The layout for individual elements of the sequence. The value\n * must be a positive integer. If not provided, the value will be\n * 1. */\n this.elementSpan = elementSpan;\n }\n /** @override */\n isCount() {\n return true;\n }\n /** @override */\n decode(b, offset = 0) {\n checkUint8Array(b);\n const rem = b.length - offset;\n return Math.floor(rem / this.elementSpan);\n }\n /** @override */\n encode(src, b, offset) {\n return 0;\n }\n}\nexports.GreedyCount = GreedyCount;\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout. The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}. Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}. If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n constructor(layout, offset = 0, property) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n if (!Number.isInteger(offset)) {\n throw new TypeError('offset must be integer or undefined');\n }\n super(layout.span, property || layout.property);\n /** The subordinated layout. */\n this.layout = layout;\n /** The location of {@link OffsetLayout#layout} relative to the\n * start of another layout.\n *\n * The value may be positive or negative, but an error will thrown\n * if at the point of use it goes outside the span of the Uint8Array\n * being accessed. */\n this.offset = offset;\n }\n /** @override */\n isCount() {\n return ((this.layout instanceof UInt)\n || (this.layout instanceof UIntBE));\n }\n /** @override */\n decode(b, offset = 0) {\n return this.layout.decode(b, offset + this.offset);\n }\n /** @override */\n encode(src, b, offset = 0) {\n return this.layout.encode(src, b, offset + this.offset);\n }\n}\nexports.OffsetLayout = OffsetLayout;\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n * module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n * module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n * module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readUIntLE(offset, this.span);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeUIntLE(src, offset, this.span);\n return this.span;\n }\n}\nexports.UInt = UInt;\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readUIntBE(offset, this.span);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeUIntBE(src, offset, this.span);\n return this.span;\n }\n}\nexports.UIntBE = UIntBE;\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n * module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n * module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n * module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readIntLE(offset, this.span);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeIntLE(src, offset, this.span);\n return this.span;\n }\n}\nexports.Int = Int;\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readIntBE(offset, this.span);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeIntBE(src, offset, this.span);\n return this.span;\n }\n}\nexports.IntBE = IntBE;\nconst V2E32 = Math.pow(2, 32);\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n const hi32 = Math.floor(src / V2E32);\n const lo32 = src - (hi32 * V2E32);\n return { hi32, lo32 };\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n return hi32 * V2E32 + lo32;\n}\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n const buffer = uint8ArrayToBuffer(b);\n const lo32 = buffer.readUInt32LE(offset);\n const hi32 = buffer.readUInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n /** @override */\n encode(src, b, offset = 0) {\n const split = divmodInt64(src);\n const buffer = uint8ArrayToBuffer(b);\n buffer.writeUInt32LE(split.lo32, offset);\n buffer.writeUInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\nexports.NearUInt64 = NearUInt64;\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n const buffer = uint8ArrayToBuffer(b);\n const hi32 = buffer.readUInt32BE(offset);\n const lo32 = buffer.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n /** @override */\n encode(src, b, offset = 0) {\n const split = divmodInt64(src);\n const buffer = uint8ArrayToBuffer(b);\n buffer.writeUInt32BE(split.hi32, offset);\n buffer.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\nexports.NearUInt64BE = NearUInt64BE;\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n const buffer = uint8ArrayToBuffer(b);\n const lo32 = buffer.readUInt32LE(offset);\n const hi32 = buffer.readInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n /** @override */\n encode(src, b, offset = 0) {\n const split = divmodInt64(src);\n const buffer = uint8ArrayToBuffer(b);\n buffer.writeUInt32LE(split.lo32, offset);\n buffer.writeInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\nexports.NearInt64 = NearInt64;\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n const buffer = uint8ArrayToBuffer(b);\n const hi32 = buffer.readInt32BE(offset);\n const lo32 = buffer.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n /** @override */\n encode(src, b, offset = 0) {\n const split = divmodInt64(src);\n const buffer = uint8ArrayToBuffer(b);\n buffer.writeInt32BE(split.hi32, offset);\n buffer.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\nexports.NearInt64BE = NearInt64BE;\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n constructor(property) {\n super(4, property);\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readFloatLE(offset);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeFloatLE(src, offset);\n return 4;\n }\n}\nexports.Float = Float;\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n constructor(property) {\n super(4, property);\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readFloatBE(offset);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeFloatBE(src, offset);\n return 4;\n }\n}\nexports.FloatBE = FloatBE;\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readDoubleLE(offset);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeDoubleLE(src, offset);\n return 8;\n }\n}\nexports.Double = Double;\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n constructor(property) {\n super(8, property);\n }\n /** @override */\n decode(b, offset = 0) {\n return uint8ArrayToBuffer(b).readDoubleBE(offset);\n }\n /** @override */\n encode(src, b, offset = 0) {\n uint8ArrayToBuffer(b).writeDoubleBE(src, offset);\n return 8;\n }\n}\nexports.DoubleBE = DoubleBE;\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}. The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n constructor(elementLayout, count, property) {\n if (!(elementLayout instanceof Layout)) {\n throw new TypeError('elementLayout must be a Layout');\n }\n if (!(((count instanceof ExternalLayout) && count.isCount())\n || (Number.isInteger(count) && (0 <= count)))) {\n throw new TypeError('count must be non-negative integer '\n + 'or an unsigned integer ExternalLayout');\n }\n let span = -1;\n if ((!(count instanceof ExternalLayout))\n && (0 < elementLayout.span)) {\n span = count * elementLayout.span;\n }\n super(span, property);\n /** The layout for individual elements of the sequence. */\n this.elementLayout = elementLayout;\n /** The number of elements in the sequence.\n *\n * This will be either a non-negative integer or an instance of\n * {@link ExternalLayout} for which {@link\n * ExternalLayout#isCount|isCount()} is `true`. */\n this.count = count;\n }\n /** @override */\n getSpan(b, offset = 0) {\n if (0 <= this.span) {\n return this.span;\n }\n let span = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n if (0 < this.elementLayout.span) {\n span = count * this.elementLayout.span;\n }\n else {\n let idx = 0;\n while (idx < count) {\n span += this.elementLayout.getSpan(b, offset + span);\n ++idx;\n }\n }\n return span;\n }\n /** @override */\n decode(b, offset = 0) {\n const rv = [];\n let i = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n while (i < count) {\n rv.push(this.elementLayout.decode(b, offset));\n offset += this.elementLayout.getSpan(b, offset);\n i += 1;\n }\n return rv;\n }\n /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n *\n * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n * the unused space in the buffer is left unchanged. If `src` is\n * longer than {@link Sequence#count|count} the unneeded elements are\n * ignored.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset = 0) {\n const elo = this.elementLayout;\n const span = src.reduce((span, v) => {\n return span + elo.encode(v, b, offset + span);\n }, 0);\n if (this.count instanceof ExternalLayout) {\n this.count.encode(src.length, b, offset);\n }\n return span;\n }\n}\nexports.Sequence = Sequence;\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span. When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage. We can only identify the value\n * for a field when it has a {@link Layout#property|property}. As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}. An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n constructor(fields, property, decodePrefixes) {\n if (!(Array.isArray(fields)\n && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n throw new TypeError('fields must be array of Layout instances');\n }\n if (('boolean' === typeof property)\n && (undefined === decodePrefixes)) {\n decodePrefixes = property;\n property = undefined;\n }\n /* Verify absence of unnamed variable-length fields. */\n for (const fd of fields) {\n if ((0 > fd.span)\n && (undefined === fd.property)) {\n throw new Error('fields cannot contain unnamed variable-length layout');\n }\n }\n let span = -1;\n try {\n span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n }\n catch (e) {\n // ignore error\n }\n super(span, property);\n /** The sequence of {@link Layout} values that comprise the\n * structure.\n *\n * The individual elements need not be the same type, and may be\n * either scalar or aggregate layouts. If a member layout leaves\n * its {@link Layout#property|property} undefined the\n * corresponding region of the buffer associated with the element\n * will not be mutated.\n *\n * @type {Layout[]} */\n this.fields = fields;\n /** Control behavior of {@link Layout#decode|decode()} given short\n * buffers.\n *\n * In some situations a structure many be extended with additional\n * fields over time, with older installations providing only a\n * prefix of the full structure. If this property is `true`\n * decoding will accept those buffers and leave subsequent fields\n * undefined, as long as the buffer ends at a field boundary.\n * Defaults to `false`. */\n this.decodePrefixes = !!decodePrefixes;\n }\n /** @override */\n getSpan(b, offset = 0) {\n if (0 <= this.span) {\n return this.span;\n }\n let span = 0;\n try {\n span = this.fields.reduce((span, fd) => {\n const fsp = fd.getSpan(b, offset);\n offset += fsp;\n return span + fsp;\n }, 0);\n }\n catch (e) {\n throw new RangeError('indeterminate span');\n }\n return span;\n }\n /** @override */\n decode(b, offset = 0) {\n checkUint8Array(b);\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(b, offset);\n }\n offset += fd.getSpan(b, offset);\n if (this.decodePrefixes\n && (b.length === offset)) {\n break;\n }\n }\n return dest;\n }\n /** Implement {@link Layout#encode|encode} for {@link Structure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the buffer is\n * left unmodified. */\n encode(src, b, offset = 0) {\n const firstOffset = offset;\n let lastOffset = 0;\n let lastWrote = 0;\n for (const fd of this.fields) {\n let span = fd.span;\n lastWrote = (0 < span) ? span : 0;\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n lastWrote = fd.encode(fv, b, offset);\n if (0 > span) {\n /* Read the as-encoded span, which is not necessarily the\n * same as what we wrote. */\n span = fd.getSpan(b, offset);\n }\n }\n }\n lastOffset = offset;\n offset += span;\n }\n /* Use (lastOffset + lastWrote) instead of offset because the last\n * item may have had a dynamic length and we don't want to include\n * the padding between it and the end of the space reserved for\n * it. */\n return (lastOffset + lastWrote) - firstOffset;\n }\n /** @override */\n fromArray(values) {\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if ((undefined !== fd.property)\n && (0 < values.length)) {\n dest[fd.property] = values.shift();\n }\n }\n return dest;\n }\n /**\n * Get access to the layout of a given property.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Layout} - the layout associated with `property`, or\n * undefined if there is no such property.\n */\n layoutFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n return undefined;\n }\n /**\n * Get the offset of a structure member.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Number} - the offset in bytes to the start of `property`\n * within the structure, or undefined if `property` is not a field\n * within the structure. If the property is a member but follows a\n * variable-length structure member a negative number will be\n * returned.\n */\n offsetOf(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n let offset = 0;\n for (const fd of this.fields) {\n if (fd.property === property) {\n return offset;\n }\n if (0 > fd.span) {\n offset = -1;\n }\n else if (0 <= offset) {\n offset += fd.span;\n }\n }\n return undefined;\n }\n}\nexports.Structure = Structure;\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n constructor(property) {\n /** The {@link Layout#property|property} to be used when the\n * discriminator is referenced in isolation (generally when {@link\n * Union#decode|Union decode} cannot delegate to a specific\n * variant). */\n this.property = property;\n }\n /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n *\n * The implementation of this method need not reference the buffer if\n * variant information is available through other means. */\n decode(b, offset) {\n throw new Error('UnionDiscriminator is abstract');\n }\n /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n *\n * The implementation of this method need not store the value if\n * variant information is maintained through other means. */\n encode(src, b, offset) {\n throw new Error('UnionDiscriminator is abstract');\n }\n}\nexports.UnionDiscriminator = UnionDiscriminator;\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}. Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n constructor(layout, property) {\n if (!((layout instanceof ExternalLayout)\n && layout.isCount())) {\n throw new TypeError('layout must be an unsigned integer ExternalLayout');\n }\n super(property || layout.property || 'variant');\n /** The {@link ExternalLayout} used to access the discriminator\n * value. */\n this.layout = layout;\n }\n /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n decode(b, offset) {\n return this.layout.decode(b, offset);\n }\n /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n encode(src, b, offset) {\n return this.layout.encode(src, b, offset);\n }\n}\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}. The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}. If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used). The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents. The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}). When a non-external layout element is passed the layout\n * appears at the start of the union. In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}. If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception. A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n constructor(discr, defaultLayout, property) {\n let discriminator;\n if ((discr instanceof UInt)\n || (discr instanceof UIntBE)) {\n discriminator = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n }\n else if ((discr instanceof ExternalLayout)\n && discr.isCount()) {\n discriminator = new UnionLayoutDiscriminator(discr);\n }\n else if (!(discr instanceof UnionDiscriminator)) {\n throw new TypeError('discr must be a UnionDiscriminator '\n + 'or an unsigned integer layout');\n }\n else {\n discriminator = discr;\n }\n if (undefined === defaultLayout) {\n defaultLayout = null;\n }\n if (!((null === defaultLayout)\n || (defaultLayout instanceof Layout))) {\n throw new TypeError('defaultLayout must be null or a Layout');\n }\n if (null !== defaultLayout) {\n if (0 > defaultLayout.span) {\n throw new Error('defaultLayout must have constant span');\n }\n if (undefined === defaultLayout.property) {\n defaultLayout = defaultLayout.replicate('content');\n }\n }\n /* The union span can be estimated only if there's a default\n * layout. The union spans its default layout, plus any prefix\n * variant layout. By construction both layouts, if present, have\n * non-negative span. */\n let span = -1;\n if (defaultLayout) {\n span = defaultLayout.span;\n if ((0 <= span) && ((discr instanceof UInt)\n || (discr instanceof UIntBE))) {\n span += discriminator.layout.span;\n }\n }\n super(span, property);\n /** The interface for the discriminator value in isolation.\n *\n * This a {@link UnionDiscriminator} either passed to the\n * constructor or synthesized from the `discr` constructor\n * argument. {@link\n * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n * `true` iff the `discr` parameter was a non-offset {@link\n * Layout} instance. */\n this.discriminator = discriminator;\n /** `true` if the {@link Union#discriminator|discriminator} is the\n * first field in the union.\n *\n * If `false` the discriminator is obtained from somewhere\n * else. */\n this.usesPrefixDiscriminator = (discr instanceof UInt)\n || (discr instanceof UIntBE);\n /** The layout for non-discriminator content when the value of the\n * discriminator is not recognized.\n *\n * This is the value passed to the constructor. It is\n * structurally equivalent to the second component of {@link\n * Union#layout|layout} but may have a different property\n * name. */\n this.defaultLayout = defaultLayout;\n /** A registry of allowed variants.\n *\n * The keys are unsigned integers which should be compatible with\n * {@link Union.discriminator|discriminator}. The property value\n * is the corresponding {@link VariantLayout} instances assigned\n * to this union by {@link Union#addVariant|addVariant}.\n *\n * **NOTE** The registry remains mutable so that variants can be\n * {@link Union#addVariant|added} at any time. Users should not\n * manipulate the content of this property. */\n this.registry = {};\n /* Private variable used when invoking getSourceVariant */\n let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n /** Function to infer the variant selected by a source object.\n *\n * Defaults to {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n * be overridden using {@link\n * Union#configGetSourceVariant|configGetSourceVariant}.\n *\n * @param {Object} src - as with {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * @returns {(undefined|VariantLayout)} The default variant\n * (`undefined`) or first registered variant that uses a property\n * available in `src`. */\n this.getSourceVariant = function (src) {\n return boundGetSourceVariant(src);\n };\n /** Function to override the implementation of {@link\n * Union#getSourceVariant|getSourceVariant}.\n *\n * Use this if the desired variant cannot be identified using the\n * algorithm of {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * **NOTE** The provided function will be invoked bound to this\n * Union instance, providing local access to {@link\n * Union#registry|registry}.\n *\n * @param {Function} gsv - a function that follows the API of\n * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n this.configGetSourceVariant = function (gsv) {\n boundGetSourceVariant = gsv.bind(this);\n };\n }\n /** @override */\n getSpan(b, offset = 0) {\n if (0 <= this.span) {\n return this.span;\n }\n /* Default layouts always have non-negative span, so we don't have\n * one and we have to recognize the variant which will in turn\n * determine the span. */\n const vlo = this.getVariant(b, offset);\n if (!vlo) {\n throw new Error('unable to determine span for unrecognized variant');\n }\n return vlo.getSpan(b, offset);\n }\n /**\n * Method to infer a registered Union variant compatible with `src`.\n *\n * The first satisfied rule in the following sequence defines the\n * return value:\n * * If `src` has properties matching the Union discriminator and\n * the default layout, `undefined` is returned regardless of the\n * value of the discriminator property (this ensures the default\n * layout will be used);\n * * If `src` has a property matching the Union discriminator, the\n * value of the discriminator identifies a registered variant, and\n * either (a) the variant has no layout, or (b) `src` has the\n * variant's property, then the variant is returned (because the\n * source satisfies the constraints of the variant it identifies);\n * * If `src` does not have a property matching the Union\n * discriminator, but does have a property matching a registered\n * variant, then the variant is returned (because the source\n * matches a variant without an explicit conflict);\n * * An error is thrown (because we either can't identify a variant,\n * or we were explicitly told the variant but can't satisfy it).\n *\n * @param {Object} src - an object presumed to be compatible with\n * the content of the Union.\n *\n * @return {(undefined|VariantLayout)} - as described above.\n *\n * @throws {Error} - if `src` cannot be associated with a default or\n * registered variant.\n */\n defaultGetSourceVariant(src) {\n if (Object.prototype.hasOwnProperty.call(src, this.discriminator.property)) {\n if (this.defaultLayout && this.defaultLayout.property\n && Object.prototype.hasOwnProperty.call(src, this.defaultLayout.property)) {\n return undefined;\n }\n const vlo = this.registry[src[this.discriminator.property]];\n if (vlo\n && ((!vlo.layout)\n || (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)))) {\n return vlo;\n }\n }\n else {\n for (const tag in this.registry) {\n const vlo = this.registry[tag];\n if (vlo.property && Object.prototype.hasOwnProperty.call(src, vlo.property)) {\n return vlo;\n }\n }\n }\n throw new Error('unable to infer src variant');\n }\n /** Implement {@link Layout#decode|decode} for {@link Union}.\n *\n * If the variant is {@link Union#addVariant|registered} the return\n * value is an instance of that variant, with no explicit\n * discriminator. Otherwise the {@link Union#defaultLayout|default\n * layout} is used to decode the content. */\n decode(b, offset = 0) {\n let dest;\n const dlo = this.discriminator;\n const discr = dlo.decode(b, offset);\n const clo = this.registry[discr];\n if (undefined === clo) {\n const defaultLayout = this.defaultLayout;\n let contentOffset = 0;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dest = this.makeDestinationObject();\n dest[dlo.property] = discr;\n // defaultLayout.property can be undefined, but this is allowed by buffer-layout\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n dest[defaultLayout.property] = defaultLayout.decode(b, offset + contentOffset);\n }\n else {\n dest = clo.decode(b, offset);\n }\n return dest;\n }\n /** Implement {@link Layout#encode|encode} for {@link Union}.\n *\n * This API assumes the `src` object is consistent with the union's\n * {@link Union#defaultLayout|default layout}. To encode variants\n * use the appropriate variant-specific {@link VariantLayout#encode}\n * method. */\n encode(src, b, offset = 0) {\n const vlo = this.getSourceVariant(src);\n if (undefined === vlo) {\n const dlo = this.discriminator;\n // this.defaultLayout is not undefined when vlo is undefined\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n const clo = this.defaultLayout;\n let contentOffset = 0;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dlo.encode(src[dlo.property], b, offset);\n // clo.property is not undefined when vlo is undefined\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n return contentOffset + clo.encode(src[clo.property], b, offset + contentOffset);\n }\n return vlo.encode(src, b, offset);\n }\n /** Register a new variant structure within a union. The newly\n * created variant is returned.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} layout - initializer for {@link\n * VariantLayout#layout|layout}.\n *\n * @param {String} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {VariantLayout} */\n addVariant(variant, layout, property) {\n const rv = new VariantLayout(this, variant, layout, property);\n this.registry[variant] = rv;\n return rv;\n }\n /**\n * Get the layout associated with a registered variant.\n *\n * If `vb` does not produce a registered variant the function returns\n * `undefined`.\n *\n * @param {(Number|Uint8Array)} vb - either the variant number, or a\n * buffer from which the discriminator is to be read.\n *\n * @param {Number} offset - offset into `vb` for the start of the\n * union. Used only when `vb` is an instance of {Uint8Array}.\n *\n * @return {({VariantLayout}|undefined)}\n */\n getVariant(vb, offset = 0) {\n let variant;\n if (vb instanceof Uint8Array) {\n variant = this.discriminator.decode(vb, offset);\n }\n else {\n variant = vb;\n }\n return this.registry[variant];\n }\n}\nexports.Union = Union;\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly. Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}. If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}. Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}. The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n constructor(union, variant, layout, property) {\n if (!(union instanceof Union)) {\n throw new TypeError('union must be a Union');\n }\n if ((!Number.isInteger(variant)) || (0 > variant)) {\n throw new TypeError('variant must be a (non-negative) integer');\n }\n if (('string' === typeof layout)\n && (undefined === property)) {\n property = layout;\n layout = null;\n }\n if (layout) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n if ((null !== union.defaultLayout)\n && (0 <= layout.span)\n && (layout.span > union.defaultLayout.span)) {\n throw new Error('variant span exceeds span of containing union');\n }\n if ('string' !== typeof property) {\n throw new TypeError('variant must have a String property');\n }\n }\n let span = union.span;\n if (0 > union.span) {\n span = layout ? layout.span : 0;\n if ((0 <= span) && union.usesPrefixDiscriminator) {\n span += union.discriminator.layout.span;\n }\n }\n super(span, property);\n /** The {@link Union} to which this variant belongs. */\n this.union = union;\n /** The unsigned integral value identifying this variant within\n * the {@link Union#discriminator|discriminator} of the containing\n * union. */\n this.variant = variant;\n /** The {@link Layout} to be used when reading/writing the\n * non-discriminator part of the {@link\n * VariantLayout#union|union}. If `null` the variant carries no\n * data. */\n this.layout = layout || null;\n }\n /** @override */\n getSpan(b, offset = 0) {\n if (0 <= this.span) {\n /* Will be equal to the containing union span if that is not\n * variable. */\n return this.span;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n /* Span is defined solely by the variant (and prefix discriminator) */\n let span = 0;\n if (this.layout) {\n span = this.layout.getSpan(b, offset + contentOffset);\n }\n return contentOffset + span;\n }\n /** @override */\n decode(b, offset = 0) {\n const dest = this.makeDestinationObject();\n if (this !== this.union.getVariant(b, offset)) {\n throw new Error('variant mismatch');\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout) {\n dest[this.property] = this.layout.decode(b, offset + contentOffset);\n }\n else if (this.property) {\n dest[this.property] = true;\n }\n else if (this.union.usesPrefixDiscriminator) {\n dest[this.union.discriminator.property] = this.variant;\n }\n return dest;\n }\n /** @override */\n encode(src, b, offset = 0) {\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout\n && (!Object.prototype.hasOwnProperty.call(src, this.property))) {\n throw new TypeError('variant lacks property ' + this.property);\n }\n this.union.discriminator.encode(this.variant, b, offset);\n let span = contentOffset;\n if (this.layout) {\n this.layout.encode(src[this.property], b, offset + contentOffset);\n span += this.layout.getSpan(b, offset + contentOffset);\n if ((0 <= this.union.span)\n && (span > this.union.span)) {\n throw new Error('encoded variant overruns containing union');\n }\n }\n return span;\n }\n /** Delegate {@link Layout#fromArray|fromArray} to {@link\n * VariantLayout#layout|layout}. */\n fromArray(values) {\n if (this.layout) {\n return this.layout.fromArray(values);\n }\n return undefined;\n }\n}\nexports.VariantLayout = VariantLayout;\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative. For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n if (0 > v) {\n v += 0x100000000;\n }\n return v;\n}\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties. The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}. The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word. If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n constructor(word, msb, property) {\n if (!((word instanceof UInt)\n || (word instanceof UIntBE))) {\n throw new TypeError('word must be a UInt or UIntBE layout');\n }\n if (('string' === typeof msb)\n && (undefined === property)) {\n property = msb;\n msb = false;\n }\n if (4 < word.span) {\n throw new RangeError('word cannot exceed 32 bits');\n }\n super(word.span, property);\n /** The layout used for the packed value. {@link BitField}\n * instances are packed sequentially depending on {@link\n * BitStructure#msb|msb}. */\n this.word = word;\n /** Whether the bit sequences are packed starting at the most\n * significant bit growing down (`true`), or the least significant\n * bit growing up (`false`).\n *\n * **NOTE** Regardless of this value, the least significant bit of\n * any {@link BitField} value is the least significant bit of the\n * corresponding section of the packed value. */\n this.msb = !!msb;\n /** The sequence of {@link BitField} layouts that comprise the\n * packed structure.\n *\n * **NOTE** The array remains mutable to allow fields to be {@link\n * BitStructure#addField|added} after construction. Users should\n * not manipulate the content of this property.*/\n this.fields = [];\n /* Storage for the value. Capture a variable instead of using an\n * instance property because we don't want anything to change the\n * value without going through the mutator. */\n let value = 0;\n this._packedSetValue = function (v) {\n value = fixBitwiseResult(v);\n return this;\n };\n this._packedGetValue = function () {\n return value;\n };\n }\n /** @override */\n decode(b, offset = 0) {\n const dest = this.makeDestinationObject();\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(b);\n }\n }\n return dest;\n }\n /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the packed\n * value is left unmodified. Unused bits are also left unmodified. */\n encode(src, b, offset = 0) {\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n fd.encode(fv);\n }\n }\n }\n return this.word.encode(this._packedGetValue(), b, offset);\n }\n /** Register a new bitfield with a containing bit structure. The\n * resulting bitfield is returned.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {BitField} */\n addField(bits, property) {\n const bf = new BitField(this, bits, property);\n this.fields.push(bf);\n return bf;\n }\n /** As with {@link BitStructure#addField|addField} for single-bit\n * fields with `boolean` value representation.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {Boolean} */\n // `Boolean` conflicts with the native primitive type\n // eslint-disable-next-line @typescript-eslint/ban-types\n addBoolean(property) {\n // This is my Boolean, not the Javascript one.\n const bf = new Boolean(this, property);\n this.fields.push(bf);\n return bf;\n }\n /**\n * Get access to the bit field for a given property.\n *\n * @param {String} property - the bit field of interest.\n *\n * @return {BitField} - the field associated with `property`, or\n * undefined if there is no such property.\n */\n fieldFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n return undefined;\n }\n}\nexports.BitStructure = BitStructure;\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n constructor(container, bits, property) {\n if (!(container instanceof BitStructure)) {\n throw new TypeError('container must be a BitStructure');\n }\n if ((!Number.isInteger(bits)) || (0 >= bits)) {\n throw new TypeError('bits must be positive integer');\n }\n const totalBits = 8 * container.span;\n const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n if ((bits + usedBits) > totalBits) {\n throw new Error('bits too long for span remainder ('\n + (totalBits - usedBits) + ' of '\n + totalBits + ' remain)');\n }\n /** The {@link BitStructure} instance to which this bit field\n * belongs. */\n this.container = container;\n /** The span of this value in bits. */\n this.bits = bits;\n /** A mask of {@link BitField#bits|bits} bits isolating value bits\n * that fit within the field.\n *\n * That is, it masks a value that has not yet been shifted into\n * position within its containing packed integer. */\n this.valueMask = (1 << bits) - 1;\n if (32 === bits) { // shifted value out of range\n this.valueMask = 0xFFFFFFFF;\n }\n /** The offset of the value within the containing packed unsigned\n * integer. The least significant bit of the packed value is at\n * offset zero, regardless of bit ordering used. */\n this.start = usedBits;\n if (this.container.msb) {\n this.start = totalBits - usedBits - bits;\n }\n /** A mask of {@link BitField#bits|bits} isolating the field value\n * within the containing packed unsigned integer. */\n this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n /** The property name used when this bitfield is represented in an\n * Object.\n *\n * Intended to be functionally equivalent to {@link\n * Layout#property}.\n *\n * If left undefined the corresponding span of bits will be\n * treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n /** Store a value into the corresponding subsequence of the containing\n * bit field. */\n decode(b, offset) {\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(word & this.wordMask);\n const value = wordValue >>> this.start;\n return value;\n }\n /** Store a value into the corresponding subsequence of the containing\n * bit field.\n *\n * **NOTE** This is not a specialization of {@link\n * Layout#encode|Layout.encode} and there is no return value. */\n encode(value) {\n if ('number' !== typeof value\n || !Number.isInteger(value)\n || (value !== fixBitwiseResult(value & this.valueMask))) {\n throw new TypeError(nameWithProperty('BitField.encode', this)\n + ' value must be integer not exceeding ' + this.valueMask);\n }\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(value << this.start);\n this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n | wordValue);\n }\n}\nexports.BitField = BitField;\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n constructor(container, property) {\n super(container, 1, property);\n }\n /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n *\n * @returns {boolean} */\n decode(b, offset) {\n return !!super.decode(b, offset);\n }\n /** @override */\n encode(value) {\n if ('boolean' === typeof value) {\n // BitField requires integer values\n value = +value;\n }\n super.encode(value);\n }\n}\nexports.Boolean = Boolean;\n/* eslint-enable no-extend-native */\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Uint8Array.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n constructor(length, property) {\n if (!(((length instanceof ExternalLayout) && length.isCount())\n || (Number.isInteger(length) && (0 <= length)))) {\n throw new TypeError('length must be positive integer '\n + 'or an unsigned integer ExternalLayout');\n }\n let span = -1;\n if (!(length instanceof ExternalLayout)) {\n span = length;\n }\n super(span, property);\n /** The number of bytes in the blob.\n *\n * This may be a non-negative integer, or an instance of {@link\n * ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}. */\n this.length = length;\n }\n /** @override */\n getSpan(b, offset) {\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return span;\n }\n /** @override */\n decode(b, offset = 0) {\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return uint8ArrayToBuffer(b).slice(offset, offset + span);\n }\n /** Implement {@link Layout#encode|encode} for {@link Blob}.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n let span = this.length;\n if (this.length instanceof ExternalLayout) {\n span = src.length;\n }\n if (!(src instanceof Uint8Array && span === src.length)) {\n throw new TypeError(nameWithProperty('Blob.encode', this)\n + ' requires (length ' + span + ') Uint8Array as src');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Uint8Array');\n }\n const srcBuffer = uint8ArrayToBuffer(src);\n uint8ArrayToBuffer(b).write(srcBuffer.toString('hex'), offset, span, 'hex');\n if (this.length instanceof ExternalLayout) {\n this.length.encode(span, b, offset);\n }\n return span;\n }\n}\nexports.Blob = Blob;\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n constructor(property) {\n super(-1, property);\n }\n /** @override */\n getSpan(b, offset = 0) {\n checkUint8Array(b);\n let idx = offset;\n while ((idx < b.length) && (0 !== b[idx])) {\n idx += 1;\n }\n return 1 + idx - offset;\n }\n /** @override */\n decode(b, offset = 0) {\n const span = this.getSpan(b, offset);\n return uint8ArrayToBuffer(b).slice(offset, offset + span - 1).toString('utf-8');\n }\n /** @override */\n encode(src, b, offset = 0) {\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = String(src);\n }\n const srcb = buffer_1.Buffer.from(src, 'utf8');\n const span = srcb.length;\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n const buffer = uint8ArrayToBuffer(b);\n srcb.copy(buffer, offset);\n buffer[offset + span] = 0;\n return span + 1;\n }\n}\nexports.CString = CString;\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content. If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n constructor(maxSpan, property) {\n if (('string' === typeof maxSpan) && (undefined === property)) {\n property = maxSpan;\n maxSpan = undefined;\n }\n if (undefined === maxSpan) {\n maxSpan = -1;\n }\n else if (!Number.isInteger(maxSpan)) {\n throw new TypeError('maxSpan must be an integer');\n }\n super(-1, property);\n /** The maximum span of the layout in bytes.\n *\n * Positive values are generally expected. Zero is abnormal.\n * Attempts to encode or decode a value that exceeds this length\n * will throw a `RangeError`.\n *\n * A negative value indicates that there is no bound on the length\n * of the content. */\n this.maxSpan = maxSpan;\n }\n /** @override */\n getSpan(b, offset = 0) {\n checkUint8Array(b);\n return b.length - offset;\n }\n /** @override */\n decode(b, offset = 0) {\n const span = this.getSpan(b, offset);\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n return uint8ArrayToBuffer(b).slice(offset, offset + span).toString('utf-8');\n }\n /** @override */\n encode(src, b, offset = 0) {\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = String(src);\n }\n const srcb = buffer_1.Buffer.from(src, 'utf8');\n const span = srcb.length;\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n srcb.copy(uint8ArrayToBuffer(b), offset);\n return span;\n }\n}\nexports.UTF8 = UTF8;\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding. An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}. If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n constructor(value, property) {\n super(0, property);\n /** The value produced by this constant when the layout is {@link\n * Constant#decode|decoded}.\n *\n * Any JavaScript value including `null` and `undefined` is\n * permitted.\n *\n * **WARNING** If `value` passed in the constructor was not\n * frozen, it is possible for users of decoded values to change\n * the content of the value. */\n this.value = value;\n }\n /** @override */\n decode(b, offset) {\n return this.value;\n }\n /** @override */\n encode(src, b, offset) {\n /* Constants take no space */\n return 0;\n }\n}\nexports.Constant = Constant;\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = ((property) => new UInt(1, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = ((property) => new UInt(2, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = ((property) => new UInt(3, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = ((property) => new UInt(4, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = ((property) => new UInt(5, property));\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = ((property) => new UInt(6, property));\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = ((property) => new NearUInt64(property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = ((property) => new UIntBE(2, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = ((property) => new UIntBE(3, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = ((property) => new UIntBE(4, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = ((property) => new UIntBE(5, property));\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = ((property) => new UIntBE(6, property));\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = ((property) => new NearUInt64BE(property));\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = ((property) => new Int(1, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = ((property) => new Int(2, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = ((property) => new Int(3, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = ((property) => new Int(4, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = ((property) => new Int(5, property));\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = ((property) => new Int(6, property));\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = ((property) => new NearInt64(property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = ((property) => new IntBE(2, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = ((property) => new IntBE(3, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = ((property) => new IntBE(4, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = ((property) => new IntBE(5, property));\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = ((property) => new IntBE(6, property));\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = ((property) => new NearInt64BE(property));\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = ((property) => new Float(property));\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = ((property) => new FloatBE(property));\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = ((property) => new Double(property));\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = ((property) => new DoubleBE(property));\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n/** Factory for {@link CString} values. */\nexports.cstr = ((property) => new CString(property));\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n/** Factory for {@link Constant} values. */\nexports.constant = ((value, property) => new Constant(value, property));\n//# sourceMappingURL=Layout.js.map","export const encodeDecode = (layout) => {\n const decode = layout.decode.bind(layout);\n const encode = layout.encode.bind(layout);\n return { decode, encode };\n};\n//# sourceMappingURL=base.js.map","'use strict';\n\nObject.defineProperty(exports, \"__esModule\", { value: true });\nlet converter;\n/**\n * Convert a little-endian buffer into a BigInt.\n * @param buf The little-endian buffer to convert\n * @returns A BigInt with the little-endian representation of buf.\n */\nfunction toBigIntLE(buf) {\n {\n const reversed = Buffer.from(buf);\n reversed.reverse();\n const hex = reversed.toString('hex');\n if (hex.length === 0) {\n return BigInt(0);\n }\n return BigInt(`0x${hex}`);\n }\n return converter.toBigInt(buf, false);\n}\nexports.toBigIntLE = toBigIntLE;\n/**\n * Convert a big-endian buffer into a BigInt\n * @param buf The big-endian buffer to convert.\n * @returns A BigInt with the big-endian representation of buf.\n */\nfunction toBigIntBE(buf) {\n {\n const hex = buf.toString('hex');\n if (hex.length === 0) {\n return BigInt(0);\n }\n return BigInt(`0x${hex}`);\n }\n return converter.toBigInt(buf, true);\n}\nexports.toBigIntBE = toBigIntBE;\n/**\n * Convert a BigInt to a little-endian buffer.\n * @param num The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A little-endian buffer representation of num.\n */\nfunction toBufferLE(num, width) {\n {\n const hex = num.toString(16);\n const buffer = Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n buffer.reverse();\n return buffer;\n }\n // Allocation is done here, since it is slower using napi in C\n return converter.fromBigInt(num, Buffer.allocUnsafe(width), false);\n}\nexports.toBufferLE = toBufferLE;\n/**\n * Convert a BigInt to a big-endian buffer.\n * @param num The BigInt to convert.\n * @param width The number of bytes that the resulting buffer should be.\n * @returns A big-endian buffer representation of num.\n */\nfunction toBufferBE(num, width) {\n {\n const hex = num.toString(16);\n return Buffer.from(hex.padStart(width * 2, '0').slice(0, width * 2), 'hex');\n }\n return converter.fromBigInt(num, Buffer.allocUnsafe(width), true);\n}\nexports.toBufferBE = toBufferBE;\n","import { blob } from '@solana/buffer-layout';\nimport { toBigIntBE, toBigIntLE, toBufferBE, toBufferLE } from 'bigint-buffer';\nimport { encodeDecode } from './base.mjs';\nexport const bigInt = (length) => (property) => {\n const layout = blob(length, property);\n const { encode, decode } = encodeDecode(layout);\n const bigIntLayout = layout;\n bigIntLayout.decode = (buffer, offset) => {\n const src = decode(buffer, offset);\n return toBigIntLE(Buffer.from(src));\n };\n bigIntLayout.encode = (bigInt, buffer, offset) => {\n const src = toBufferLE(bigInt, length);\n return encode(src, buffer, offset);\n };\n return bigIntLayout;\n};\nexport const bigIntBE = (length) => (property) => {\n const layout = blob(length, property);\n const { encode, decode } = encodeDecode(layout);\n const bigIntLayout = layout;\n bigIntLayout.decode = (buffer, offset) => {\n const src = decode(buffer, offset);\n return toBigIntBE(Buffer.from(src));\n };\n bigIntLayout.encode = (bigInt, buffer, offset) => {\n const src = toBufferBE(bigInt, length);\n return encode(src, buffer, offset);\n };\n return bigIntLayout;\n};\nexport const u64 = bigInt(8);\nexport const u64be = bigIntBE(8);\nexport const u128 = bigInt(16);\nexport const u128be = bigIntBE(16);\nexport const u192 = bigInt(24);\nexport const u192be = bigIntBE(24);\nexport const u256 = bigInt(32);\nexport const u256be = bigIntBE(32);\n//# sourceMappingURL=bigint.js.map","import { u8 } from '@solana/buffer-layout';\nimport { encodeDecode } from './base.mjs';\nexport const bool = (property) => {\n const layout = u8(property);\n const { encode, decode } = encodeDecode(layout);\n const boolLayout = layout;\n boolLayout.decode = (buffer, offset) => {\n const src = decode(buffer, offset);\n return !!src;\n };\n boolLayout.encode = (bool, buffer, offset) => {\n const src = Number(bool);\n return encode(src, buffer, offset);\n };\n return boolLayout;\n};\n//# sourceMappingURL=native.js.map","import { blob } from '@solana/buffer-layout';\nimport { PublicKey } from '@solana/web3.js';\nimport { encodeDecode } from './base.mjs';\nexport const publicKey = (property) => {\n const layout = blob(32, property);\n const { encode, decode } = encodeDecode(layout);\n const publicKeyLayout = layout;\n publicKeyLayout.decode = (buffer, offset) => {\n const src = decode(buffer, offset);\n return new PublicKey(src);\n };\n publicKeyLayout.encode = (publicKey, buffer, offset) => {\n const src = publicKey.toBuffer();\n return encode(src, buffer, offset);\n };\n return publicKeyLayout;\n};\n//# sourceMappingURL=web3.js.map","/** Base class for errors */\nexport class TokenError extends Error {\n constructor(message) {\n super(message);\n }\n}\n/** Thrown if an account is not found at the expected address */\nexport class TokenAccountNotFoundError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenAccountNotFoundError';\n }\n}\n/** Thrown if a program state account is not a valid Account */\nexport class TokenInvalidAccountError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidAccountError';\n }\n}\n/** Thrown if a program state account is not owned by the expected token program */\nexport class TokenInvalidAccountOwnerError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidAccountOwnerError';\n }\n}\n/** Thrown if the byte length of an program state account doesn't match the expected size */\nexport class TokenInvalidAccountSizeError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidAccountSizeError';\n }\n}\n/** Thrown if the mint of a token account doesn't match the expected mint */\nexport class TokenInvalidMintError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidMintError';\n }\n}\n/** Thrown if the owner of a token account doesn't match the expected owner */\nexport class TokenInvalidOwnerError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidOwnerError';\n }\n}\n/** Thrown if the owner of a token account is a PDA (Program Derived Address) */\nexport class TokenOwnerOffCurveError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenOwnerOffCurveError';\n }\n}\n/** Thrown if an instruction's program is invalid */\nexport class TokenInvalidInstructionProgramError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidInstructionProgramError';\n }\n}\n/** Thrown if an instruction's keys are invalid */\nexport class TokenInvalidInstructionKeysError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidInstructionKeysError';\n }\n}\n/** Thrown if an instruction's data is invalid */\nexport class TokenInvalidInstructionDataError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidInstructionDataError';\n }\n}\n/** Thrown if an instruction's type is invalid */\nexport class TokenInvalidInstructionTypeError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenInvalidInstructionTypeError';\n }\n}\n/** Thrown if the program does not support the desired instruction */\nexport class TokenUnsupportedInstructionError extends TokenError {\n constructor() {\n super(...arguments);\n this.name = 'TokenUnsupportedInstructionError';\n }\n}\n//# sourceMappingURL=errors.js.map","export var AccountType;\n(function (AccountType) {\n AccountType[AccountType[\"Uninitialized\"] = 0] = \"Uninitialized\";\n AccountType[AccountType[\"Mint\"] = 1] = \"Mint\";\n AccountType[AccountType[\"Account\"] = 2] = \"Account\";\n})(AccountType || (AccountType = {}));\nexport const ACCOUNT_TYPE_SIZE = 1;\n//# sourceMappingURL=accountType.js.map","import { struct, u8 } from '@solana/buffer-layout';\nimport { bool, publicKey } from '@solana/buffer-layout-utils';\nimport { TOKEN_PROGRAM_ID } from '../constants.js';\nimport { TokenAccountNotFoundError, TokenInvalidAccountOwnerError, TokenInvalidAccountSizeError } from '../errors.js';\n/** Buffer layout for de/serializing a multisig */\nexport const MultisigLayout = struct([\n u8('m'),\n u8('n'),\n bool('isInitialized'),\n publicKey('signer1'),\n publicKey('signer2'),\n publicKey('signer3'),\n publicKey('signer4'),\n publicKey('signer5'),\n publicKey('signer6'),\n publicKey('signer7'),\n publicKey('signer8'),\n publicKey('signer9'),\n publicKey('signer10'),\n publicKey('signer11'),\n]);\n/** Byte length of a multisig */\nexport const MULTISIG_SIZE = MultisigLayout.span;\n/**\n * Retrieve information about a multisig\n *\n * @param connection Connection to use\n * @param address Multisig account\n * @param commitment Desired level of commitment for querying the state\n * @param programId SPL Token program account\n *\n * @return Multisig information\n */\nexport async function getMultisig(connection, address, commitment, programId = TOKEN_PROGRAM_ID) {\n const info = await connection.getAccountInfo(address, commitment);\n return unpackMultisig(address, info, programId);\n}\n/**\n * Unpack a multisig\n *\n * @param address Multisig account\n * @param info Multisig account data\n * @param programId SPL Token program account\n *\n * @return Unpacked multisig\n */\nexport function unpackMultisig(address, info, programId = TOKEN_PROGRAM_ID) {\n if (!info)\n throw new TokenAccountNotFoundError();\n if (!info.owner.equals(programId))\n throw new TokenInvalidAccountOwnerError();\n if (info.data.length != MULTISIG_SIZE)\n throw new TokenInvalidAccountSizeError();\n const multisig = MultisigLayout.decode(info.data);\n return { address, ...multisig };\n}\n/** Get the minimum lamport balance for a multisig to be rent exempt\n *\n * @param connection Connection to use\n * @param commitment Desired level of commitment for querying the state\n *\n * @return Amount of lamports required\n */\nexport async function getMinimumBalanceForRentExemptMultisig(connection, commitment) {\n return await connection.getMinimumBalanceForRentExemption(MULTISIG_SIZE, commitment);\n}\n//# sourceMappingURL=multisig.js.map","import { struct, u32, u8 } from '@solana/buffer-layout';\nimport { publicKey, u64 } from '@solana/buffer-layout-utils';\nimport { TOKEN_PROGRAM_ID } from '../constants.js';\nimport { TokenAccountNotFoundError, TokenInvalidAccountError, TokenInvalidAccountOwnerError, TokenInvalidAccountSizeError, } from '../errors.js';\nimport { ACCOUNT_TYPE_SIZE, AccountType } from '../extensions/accountType.js';\nimport { getAccountLen } from '../extensions/extensionType.js';\nimport { MULTISIG_SIZE } from './multisig.js';\n/** Token account state as stored by the program */\nexport var AccountState;\n(function (AccountState) {\n AccountState[AccountState[\"Uninitialized\"] = 0] = \"Uninitialized\";\n AccountState[AccountState[\"Initialized\"] = 1] = \"Initialized\";\n AccountState[AccountState[\"Frozen\"] = 2] = \"Frozen\";\n})(AccountState || (AccountState = {}));\n/** Buffer layout for de/serializing a token account */\nexport const AccountLayout = struct([\n publicKey('mint'),\n publicKey('owner'),\n u64('amount'),\n u32('delegateOption'),\n publicKey('delegate'),\n u8('state'),\n u32('isNativeOption'),\n u64('isNative'),\n u64('delegatedAmount'),\n u32('closeAuthorityOption'),\n publicKey('closeAuthority'),\n]);\n/** Byte length of a token account */\nexport const ACCOUNT_SIZE = AccountLayout.span;\n/**\n * Retrieve information about a token account\n *\n * @param connection Connection to use\n * @param address Token account\n * @param commitment Desired level of commitment for querying the state\n * @param programId SPL Token program account\n *\n * @return Token account information\n */\nexport async function getAccount(connection, address, commitment, programId = TOKEN_PROGRAM_ID) {\n const info = await connection.getAccountInfo(address, commitment);\n return unpackAccount(address, info, programId);\n}\n/**\n * Retrieve information about multiple token accounts in a single RPC call\n *\n * @param connection Connection to use\n * @param addresses Token accounts\n * @param commitment Desired level of commitment for querying the state\n * @param programId SPL Token program account\n *\n * @return Token account information\n */\nexport async function getMultipleAccounts(connection, addresses, commitment, programId = TOKEN_PROGRAM_ID) {\n const infos = await connection.getMultipleAccountsInfo(addresses, commitment);\n return addresses.map((address, i) => unpackAccount(address, infos[i], programId));\n}\n/** Get the minimum lamport balance for a base token account to be rent exempt\n *\n * @param connection Connection to use\n * @param commitment Desired level of commitment for querying the state\n *\n * @return Amount of lamports required\n */\nexport async function getMinimumBalanceForRentExemptAccount(connection, commitment) {\n return await getMinimumBalanceForRentExemptAccountWithExtensions(connection, [], commitment);\n}\n/** Get the minimum lamport balance for a rent-exempt token account with extensions\n *\n * @param connection Connection to use\n * @param commitment Desired level of commitment for querying the state\n *\n * @return Amount of lamports required\n */\nexport async function getMinimumBalanceForRentExemptAccountWithExtensions(connection, extensions, commitment) {\n const accountLen = getAccountLen(extensions);\n return await connection.getMinimumBalanceForRentExemption(accountLen, commitment);\n}\n/**\n * Unpack a token account\n *\n * @param address Token account\n * @param info Token account data\n * @param programId SPL Token program account\n *\n * @return Unpacked token account\n */\nexport function unpackAccount(address, info, programId = TOKEN_PROGRAM_ID) {\n if (!info)\n throw new TokenAccountNotFoundError();\n if (!info.owner.equals(programId))\n throw new TokenInvalidAccountOwnerError();\n if (info.data.length < ACCOUNT_SIZE)\n throw new TokenInvalidAccountSizeError();\n const rawAccount = AccountLayout.decode(info.data.slice(0, ACCOUNT_SIZE));\n let tlvData = Buffer.alloc(0);\n if (info.data.length > ACCOUNT_SIZE) {\n if (info.data.length === MULTISIG_SIZE)\n throw new TokenInvalidAccountSizeError();\n if (info.data[ACCOUNT_SIZE] != AccountType.Account)\n throw new TokenInvalidAccountError();\n tlvData = info.data.slice(ACCOUNT_SIZE + ACCOUNT_TYPE_SIZE);\n }\n return {\n address,\n mint: rawAccount.mint,\n owner: rawAccount.owner,\n amount: rawAccount.amount,\n delegate: rawAccount.delegateOption ? rawAccount.delegate : null,\n delegatedAmount: rawAccount.delegatedAmount,\n isInitialized: rawAccount.state !== AccountState.Uninitialized,\n isFrozen: rawAccount.state === AccountState.Frozen,\n isNative: !!rawAccount.isNativeOption,\n rentExemptReserve: rawAccount.isNativeOption ? rawAccount.isNative : null,\n closeAuthority: rawAccount.closeAuthorityOption ? rawAccount.closeAuthority : null,\n tlvData,\n };\n}\n//# sourceMappingURL=account.js.map","import { struct, u32, u8 } from '@solana/buffer-layout';\nimport { bool, publicKey, u64 } from '@solana/buffer-layout-utils';\nimport { PublicKey } from '@solana/web3.js';\nimport { ASSOCIATED_TOKEN_PROGRAM_ID, TOKEN_PROGRAM_ID } from '../constants.js';\nimport { TokenAccountNotFoundError, TokenInvalidAccountOwnerError, TokenInvalidAccountSizeError, TokenInvalidMintError, TokenOwnerOffCurveError, } from '../errors.js';\nimport { ACCOUNT_TYPE_SIZE, AccountType } from '../extensions/accountType.js';\nimport { getMintLen } from '../extensions/extensionType.js';\nimport { ACCOUNT_SIZE } from './account.js';\nimport { MULTISIG_SIZE } from './multisig.js';\n/** Buffer layout for de/serializing a mint */\nexport const MintLayout = struct([\n u32('mintAuthorityOption'),\n publicKey('mintAuthority'),\n u64('supply'),\n u8('decimals'),\n bool('isInitialized'),\n u32('freezeAuthorityOption'),\n publicKey('freezeAuthority'),\n]);\n/** Byte length of a mint */\nexport const MINT_SIZE = MintLayout.span;\n/**\n * Retrieve information about a mint\n *\n * @param connection Connection to use\n * @param address Mint account\n * @param commitment Desired level of commitment for querying the state\n * @param programId SPL Token program account\n *\n * @return Mint information\n */\nexport async function getMint(connection, address, commitment, programId = TOKEN_PROGRAM_ID) {\n const info = await connection.getAccountInfo(address, commitment);\n return unpackMint(address, info, programId);\n}\n/**\n * Unpack a mint\n *\n * @param address Mint account\n * @param info Mint account data\n * @param programId SPL Token program account\n *\n * @return Unpacked mint\n */\nexport function unpackMint(address, info, programId = TOKEN_PROGRAM_ID) {\n if (!info)\n throw new TokenAccountNotFoundError();\n if (!info.owner.equals(programId))\n throw new TokenInvalidAccountOwnerError();\n if (info.data.length < MINT_SIZE)\n throw new TokenInvalidAccountSizeError();\n const rawMint = MintLayout.decode(info.data.slice(0, MINT_SIZE));\n let tlvData = Buffer.alloc(0);\n if (info.data.length > MINT_SIZE) {\n if (info.data.length <= ACCOUNT_SIZE)\n throw new TokenInvalidAccountSizeError();\n if (info.data.length === MULTISIG_SIZE)\n throw new TokenInvalidAccountSizeError();\n if (info.data[ACCOUNT_SIZE] != AccountType.Mint)\n throw new TokenInvalidMintError();\n tlvData = info.data.slice(ACCOUNT_SIZE + ACCOUNT_TYPE_SIZE);\n }\n return {\n address,\n mintAuthority: rawMint.mintAuthorityOption ? rawMint.mintAuthority : null,\n supply: rawMint.supply,\n decimals: rawMint.decimals,\n isInitialized: rawMint.isInitialized,\n freezeAuthority: rawMint.freezeAuthorityOption ? rawMint.freezeAuthority : null,\n tlvData,\n };\n}\n/** Get the minimum lamport balance for a mint to be rent exempt\n *\n * @param connection Connection to use\n * @param commitment Desired level of commitment for querying the state\n *\n * @return Amount of lamports required\n */\nexport async function getMinimumBalanceForRentExemptMint(connection, commitment) {\n return await getMinimumBalanceForRentExemptMintWithExtensions(connection, [], commitment);\n}\n/** Get the minimum lamport balance for a rent-exempt mint with extensions\n *\n * @param connection Connection to use\n * @param extensions Extension types included in the mint\n * @param commitment Desired level of commitment for querying the state\n *\n * @return Amount of lamports required\n */\nexport async function getMinimumBalanceForRentExemptMintWithExtensions(connection, extensions, commitment) {\n const mintLen = getMintLen(extensions);\n return await connection.getMinimumBalanceForRentExemption(mintLen, commitment);\n}\n/**\n * Async version of getAssociatedTokenAddressSync\n * For backwards compatibility\n *\n * @param mint Token mint account\n * @param owner Owner of the new account\n * @param allowOwnerOffCurve Allow the owner account to be a PDA (Program Derived Address)\n * @param programId SPL Token program account\n * @param associatedTokenProgramId SPL Associated Token program account\n *\n * @return Promise containing the address of the associated token account\n */\nexport async function getAssociatedTokenAddress(mint, owner, allowOwnerOffCurve = false, programId = TOKEN_PROGRAM_ID, associatedTokenProgramId = ASSOCIATED_TOKEN_PROGRAM_ID) {\n if (!allowOwnerOffCurve && !PublicKey.isOnCurve(owner.toBuffer()))\n throw new TokenOwnerOffCurveError();\n const [address] = await PublicKey.findProgramAddress([owner.toBuffer(), programId.toBuffer(), mint.toBuffer()], associatedTokenProgramId);\n return address;\n}\n/**\n * Get the address of the associated token account for a given mint and owner\n *\n * @param mint Token mint account\n * @param owner Owner of the new account\n * @param allowOwnerOffCurve Allow the owner account to be a PDA (Program Derived Address)\n * @param programId SPL Token program account\n * @param associatedTokenProgramId SPL Associated Token program account\n *\n * @return Address of the associated token account\n */\nexport function getAssociatedTokenAddressSync(mint, owner, allowOwnerOffCurve = false, programId = TOKEN_PROGRAM_ID, associatedTokenProgramId = ASSOCIATED_TOKEN_PROGRAM_ID) {\n if (!allowOwnerOffCurve && !PublicKey.isOnCurve(owner.toBuffer()))\n throw new TokenOwnerOffCurveError();\n const [address] = PublicKey.findProgramAddressSync([owner.toBuffer(), programId.toBuffer(), mint.toBuffer()], associatedTokenProgramId);\n return address;\n}\n//# sourceMappingURL=mint.js.map","import { SystemProgram, TransactionInstruction } from '@solana/web3.js';\nimport { ASSOCIATED_TOKEN_PROGRAM_ID, TOKEN_PROGRAM_ID } from '../constants.js';\n/**\n * Construct a CreateAssociatedTokenAccount instruction\n *\n * @param payer Payer of the initialization fees\n * @param associatedToken New associated token account\n * @param owner Owner of the new account\n * @param mint Token mint account\n * @param programId SPL Token program account\n * @param associatedTokenProgramId SPL Associated Token program account\n *\n * @return Instruction to add to a transaction\n */\nexport function createAssociatedTokenAccountInstruction(payer, associatedToken, owner, mint, programId = TOKEN_PROGRAM_ID, associatedTokenProgramId = ASSOCIATED_TOKEN_PROGRAM_ID) {\n return buildAssociatedTokenAccountInstruction(payer, associatedToken, owner, mint, Buffer.alloc(0), programId, associatedTokenProgramId);\n}\n/**\n * Construct a CreateAssociatedTokenAccountIdempotent instruction\n *\n * @param payer Payer of the initialization fees\n * @param associatedToken New associated token account\n * @param owner Owner of the new account\n * @param mint Token mint account\n * @param programId SPL Token program account\n * @param associatedTokenProgramId SPL Associated Token program account\n *\n * @return Instruction to add to a transaction\n */\nexport function createAssociatedTokenAccountIdempotentInstruction(payer, associatedToken, owner, mint, programId = TOKEN_PROGRAM_ID, associatedTokenProgramId = ASSOCIATED_TOKEN_PROGRAM_ID) {\n return buildAssociatedTokenAccountInstruction(payer, associatedToken, owner, mint, Buffer.from([1]), programId, associatedTokenProgramId);\n}\nfunction buildAssociatedTokenAccountInstruction(payer, associatedToken, owner, mint, instructionData, programId = TOKEN_PROGRAM_ID, associatedTokenProgramId = ASSOCIATED_TOKEN_PROGRAM_ID) {\n const keys = [\n { pubkey: payer, isSigner: true, isWritable: true },\n { pubkey: associatedToken, isSigner: false, isWritable: true },\n { pubkey: owner, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: false },\n { pubkey: SystemProgram.programId, isSigner: false, isWritable: false },\n { pubkey: programId, isSigner: false, isWritable: false },\n ];\n return new TransactionInstruction({\n keys,\n programId: associatedTokenProgramId,\n data: instructionData,\n });\n}\n//# sourceMappingURL=associatedTokenAccount.js.map","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [0];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this._strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [0];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this._strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this._strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this._strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this._strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this._strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this._strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n function jumboMulTo (self, num, out) {\n // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this._strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) <= num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this._strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this._strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n this._strip();\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is a BN v4 instance\n r.strip();\n } else {\n // r is a BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n move(a, a.umod(this.m)._forceRed(this));\n return a;\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n",null,null,"/*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\n }\n}\nif (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) {\n module.exports = buffer\n} else {\n // Copy properties from require('buffer')\n copyProps(buffer, exports)\n exports.Buffer = SafeBuffer\n}\n\nfunction SafeBuffer (arg, encodingOrOffset, length) {\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\ncopyProps(Buffer, SafeBuffer)\n\nSafeBuffer.from = function (arg, encodingOrOffset, length) {\n if (typeof arg === 'number') {\n throw new TypeError('Argument must not be a number')\n }\n return Buffer(arg, encodingOrOffset, length)\n}\n\nSafeBuffer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n var buf = Buffer(size)\n if (fill !== undefined) {\n if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n } else {\n buf.fill(0)\n }\n return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return Buffer(size)\n}\n\nSafeBuffer.allocUnsafeSlow = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\n }\n return buffer.SlowBuffer(size)\n}\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\n// @ts-ignore\nvar _Buffer = require('safe-buffer').Buffer\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (Array.isArray(source) || source instanceof Uint8Array) { source = _Buffer.from(source) }\n if (!_Buffer.isBuffer(source)) { throw new TypeError('Expected Buffer') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return _Buffer.alloc(0) }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = _Buffer.allocUnsafe(zeroes + (size - it4))\n vch.fill(0x00, 0, zeroes)\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict';\n\n// This is free and unencumbered software released into the public domain.\n// See LICENSE.md for more information.\n\n//\n// Utilities\n//\n\n/**\n * @param {number} a The number to test.\n * @param {number} min The minimum value in the range, inclusive.\n * @param {number} max The maximum value in the range, inclusive.\n * @return {boolean} True if a >= min and a <= max.\n */\nfunction inRange(a, min, max) {\n return min <= a && a <= max;\n}\n\n/**\n * @param {*} o\n * @return {Object}\n */\nfunction ToDictionary(o) {\n if (o === undefined) return {};\n if (o === Object(o)) return o;\n throw TypeError('Could not convert argument to dictionary');\n}\n\n/**\n * @param {string} string Input string of UTF-16 code units.\n * @return {!Array.<number>} Code points.\n */\nfunction stringToCodePoints(string) {\n // https://heycam.github.io/webidl/#dfn-obtain-unicode\n\n // 1. Let S be the DOMString value.\n var s = String(string);\n\n // 2. Let n be the length of S.\n var n = s.length;\n\n // 3. Initialize i to 0.\n var i = 0;\n\n // 4. Initialize U to be an empty sequence of Unicode characters.\n var u = [];\n\n // 5. While i < n:\n while (i < n) {\n\n // 1. Let c be the code unit in S at index i.\n var c = s.charCodeAt(i);\n\n // 2. Depending on the value of c:\n\n // c < 0xD800 or c > 0xDFFF\n if (c < 0xD800 || c > 0xDFFF) {\n // Append to U the Unicode character with code point c.\n u.push(c);\n }\n\n // 0xDC00 ≤ c ≤ 0xDFFF\n else if (0xDC00 <= c && c <= 0xDFFF) {\n // Append to U a U+FFFD REPLACEMENT CHARACTER.\n u.push(0xFFFD);\n }\n\n // 0xD800 ≤ c ≤ 0xDBFF\n else if (0xD800 <= c && c <= 0xDBFF) {\n // 1. If i = n−1, then append to U a U+FFFD REPLACEMENT\n // CHARACTER.\n if (i === n - 1) {\n u.push(0xFFFD);\n }\n // 2. Otherwise, i < n−1:\n else {\n // 1. Let d be the code unit in S at index i+1.\n var d = string.charCodeAt(i + 1);\n\n // 2. If 0xDC00 ≤ d ≤ 0xDFFF, then:\n if (0xDC00 <= d && d <= 0xDFFF) {\n // 1. Let a be c & 0x3FF.\n var a = c & 0x3FF;\n\n // 2. Let b be d & 0x3FF.\n var b = d & 0x3FF;\n\n // 3. Append to U the Unicode character with code point\n // 2^16+2^10*a+b.\n u.push(0x10000 + (a << 10) + b);\n\n // 4. Set i to i+1.\n i += 1;\n }\n\n // 3. Otherwise, d < 0xDC00 or d > 0xDFFF. Append to U a\n // U+FFFD REPLACEMENT CHARACTER.\n else {\n u.push(0xFFFD);\n }\n }\n }\n\n // 3. Set i to i+1.\n i += 1;\n }\n\n // 6. Return U.\n return u;\n}\n\n/**\n * @param {!Array.<number>} code_points Array of code points.\n * @return {string} string String of UTF-16 code units.\n */\nfunction codePointsToString(code_points) {\n var s = '';\n for (var i = 0; i < code_points.length; ++i) {\n var cp = code_points[i];\n if (cp <= 0xFFFF) {\n s += String.fromCharCode(cp);\n } else {\n cp -= 0x10000;\n s += String.fromCharCode((cp >> 10) + 0xD800,\n (cp & 0x3FF) + 0xDC00);\n }\n }\n return s;\n}\n\n\n//\n// Implementation of Encoding specification\n// https://encoding.spec.whatwg.org/\n//\n\n//\n// 3. Terminology\n//\n\n/**\n * End-of-stream is a special token that signifies no more tokens\n * are in the stream.\n * @const\n */ var end_of_stream = -1;\n\n/**\n * A stream represents an ordered sequence of tokens.\n *\n * @constructor\n * @param {!(Array.<number>|Uint8Array)} tokens Array of tokens that provide the\n * stream.\n */\nfunction Stream(tokens) {\n /** @type {!Array.<number>} */\n this.tokens = [].slice.call(tokens);\n}\n\nStream.prototype = {\n /**\n * @return {boolean} True if end-of-stream has been hit.\n */\n endOfStream: function() {\n return !this.tokens.length;\n },\n\n /**\n * When a token is read from a stream, the first token in the\n * stream must be returned and subsequently removed, and\n * end-of-stream must be returned otherwise.\n *\n * @return {number} Get the next token from the stream, or\n * end_of_stream.\n */\n read: function() {\n if (!this.tokens.length)\n return end_of_stream;\n return this.tokens.shift();\n },\n\n /**\n * When one or more tokens are prepended to a stream, those tokens\n * must be inserted, in given order, before the first token in the\n * stream.\n *\n * @param {(number|!Array.<number>)} token The token(s) to prepend to the stream.\n */\n prepend: function(token) {\n if (Array.isArray(token)) {\n var tokens = /**@type {!Array.<number>}*/(token);\n while (tokens.length)\n this.tokens.unshift(tokens.pop());\n } else {\n this.tokens.unshift(token);\n }\n },\n\n /**\n * When one or more tokens are pushed to a stream, those tokens\n * must be inserted, in given order, after the last token in the\n * stream.\n *\n * @param {(number|!Array.<number>)} token The tokens(s) to prepend to the stream.\n */\n push: function(token) {\n if (Array.isArray(token)) {\n var tokens = /**@type {!Array.<number>}*/(token);\n while (tokens.length)\n this.tokens.push(tokens.shift());\n } else {\n this.tokens.push(token);\n }\n }\n};\n\n//\n// 4. Encodings\n//\n\n// 4.1 Encoders and decoders\n\n/** @const */\nvar finished = -1;\n\n/**\n * @param {boolean} fatal If true, decoding errors raise an exception.\n * @param {number=} opt_code_point Override the standard fallback code point.\n * @return {number} The code point to insert on a decoding error.\n */\nfunction decoderError(fatal, opt_code_point) {\n if (fatal)\n throw TypeError('Decoder error');\n return opt_code_point || 0xFFFD;\n}\n\n/** @interface */\nfunction Decoder() {}\nDecoder.prototype = {\n /**\n * @param {Stream} stream The stream of bytes being decoded.\n * @param {number} bite The next byte read from the stream.\n * @return {?(number|!Array.<number>)} The next code point(s)\n * decoded, or null if not enough data exists in the input\n * stream to decode a complete code point, or |finished|.\n */\n handler: function(stream, bite) {}\n};\n\n/** @interface */\nfunction Encoder() {}\nEncoder.prototype = {\n /**\n * @param {Stream} stream The stream of code points being encoded.\n * @param {number} code_point Next code point read from the stream.\n * @return {(number|!Array.<number>)} Byte(s) to emit, or |finished|.\n */\n handler: function(stream, code_point) {}\n};\n\n//\n// 7. API\n//\n\n/** @const */ var DEFAULT_ENCODING = 'utf-8';\n\n// 7.1 Interface TextDecoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n * defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextDecoder(encoding, options) {\n if (!(this instanceof TextDecoder)) {\n return new TextDecoder(encoding, options);\n }\n encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n if (encoding !== DEFAULT_ENCODING) {\n throw new Error('Encoding not supported. Only utf-8 is supported');\n }\n options = ToDictionary(options);\n\n /** @private @type {boolean} */\n this._streaming = false;\n /** @private @type {boolean} */\n this._BOMseen = false;\n /** @private @type {?Decoder} */\n this._decoder = null;\n /** @private @type {boolean} */\n this._fatal = Boolean(options['fatal']);\n /** @private @type {boolean} */\n this._ignoreBOM = Boolean(options['ignoreBOM']);\n\n Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n Object.defineProperty(this, 'fatal', {value: this._fatal});\n Object.defineProperty(this, 'ignoreBOM', {value: this._ignoreBOM});\n}\n\nTextDecoder.prototype = {\n /**\n * @param {ArrayBufferView=} input The buffer of bytes to decode.\n * @param {Object=} options\n * @return {string} The decoded string.\n */\n decode: function decode(input, options) {\n var bytes;\n if (typeof input === 'object' && input instanceof ArrayBuffer) {\n bytes = new Uint8Array(input);\n } else if (typeof input === 'object' && 'buffer' in input &&\n input.buffer instanceof ArrayBuffer) {\n bytes = new Uint8Array(input.buffer,\n input.byteOffset,\n input.byteLength);\n } else {\n bytes = new Uint8Array(0);\n }\n\n options = ToDictionary(options);\n\n if (!this._streaming) {\n this._decoder = new UTF8Decoder({fatal: this._fatal});\n this._BOMseen = false;\n }\n this._streaming = Boolean(options['stream']);\n\n var input_stream = new Stream(bytes);\n\n var code_points = [];\n\n /** @type {?(number|!Array.<number>)} */\n var result;\n\n while (!input_stream.endOfStream()) {\n result = this._decoder.handler(input_stream, input_stream.read());\n if (result === finished)\n break;\n if (result === null)\n continue;\n if (Array.isArray(result))\n code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n else\n code_points.push(result);\n }\n if (!this._streaming) {\n do {\n result = this._decoder.handler(input_stream, input_stream.read());\n if (result === finished)\n break;\n if (result === null)\n continue;\n if (Array.isArray(result))\n code_points.push.apply(code_points, /**@type {!Array.<number>}*/(result));\n else\n code_points.push(result);\n } while (!input_stream.endOfStream());\n this._decoder = null;\n }\n\n if (code_points.length) {\n // If encoding is one of utf-8, utf-16be, and utf-16le, and\n // ignore BOM flag and BOM seen flag are unset, run these\n // subsubsteps:\n if (['utf-8'].indexOf(this.encoding) !== -1 &&\n !this._ignoreBOM && !this._BOMseen) {\n // If token is U+FEFF, set BOM seen flag.\n if (code_points[0] === 0xFEFF) {\n this._BOMseen = true;\n code_points.shift();\n } else {\n // Otherwise, if token is not end-of-stream, set BOM seen\n // flag and append token to output.\n this._BOMseen = true;\n }\n }\n }\n\n return codePointsToString(code_points);\n }\n};\n\n// 7.2 Interface TextEncoder\n\n/**\n * @constructor\n * @param {string=} encoding The label of the encoding;\n * defaults to 'utf-8'.\n * @param {Object=} options\n */\nfunction TextEncoder(encoding, options) {\n if (!(this instanceof TextEncoder))\n return new TextEncoder(encoding, options);\n encoding = encoding !== undefined ? String(encoding).toLowerCase() : DEFAULT_ENCODING;\n if (encoding !== DEFAULT_ENCODING) {\n throw new Error('Encoding not supported. Only utf-8 is supported');\n }\n options = ToDictionary(options);\n\n /** @private @type {boolean} */\n this._streaming = false;\n /** @private @type {?Encoder} */\n this._encoder = null;\n /** @private @type {{fatal: boolean}} */\n this._options = {fatal: Boolean(options['fatal'])};\n\n Object.defineProperty(this, 'encoding', {value: 'utf-8'});\n}\n\nTextEncoder.prototype = {\n /**\n * @param {string=} opt_string The string to encode.\n * @param {Object=} options\n * @return {Uint8Array} Encoded bytes, as a Uint8Array.\n */\n encode: function encode(opt_string, options) {\n opt_string = opt_string ? String(opt_string) : '';\n options = ToDictionary(options);\n\n // NOTE: This option is nonstandard. None of the encodings\n // permitted for encoding (i.e. UTF-8, UTF-16) are stateful,\n // so streaming is not necessary.\n if (!this._streaming)\n this._encoder = new UTF8Encoder(this._options);\n this._streaming = Boolean(options['stream']);\n\n var bytes = [];\n var input_stream = new Stream(stringToCodePoints(opt_string));\n /** @type {?(number|!Array.<number>)} */\n var result;\n while (!input_stream.endOfStream()) {\n result = this._encoder.handler(input_stream, input_stream.read());\n if (result === finished)\n break;\n if (Array.isArray(result))\n bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n else\n bytes.push(result);\n }\n if (!this._streaming) {\n while (true) {\n result = this._encoder.handler(input_stream, input_stream.read());\n if (result === finished)\n break;\n if (Array.isArray(result))\n bytes.push.apply(bytes, /**@type {!Array.<number>}*/(result));\n else\n bytes.push(result);\n }\n this._encoder = null;\n }\n return new Uint8Array(bytes);\n }\n};\n\n//\n// 8. The encoding\n//\n\n// 8.1 utf-8\n\n/**\n * @constructor\n * @implements {Decoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Decoder(options) {\n var fatal = options.fatal;\n\n // utf-8's decoder's has an associated utf-8 code point, utf-8\n // bytes seen, and utf-8 bytes needed (all initially 0), a utf-8\n // lower boundary (initially 0x80), and a utf-8 upper boundary\n // (initially 0xBF).\n var /** @type {number} */ utf8_code_point = 0,\n /** @type {number} */ utf8_bytes_seen = 0,\n /** @type {number} */ utf8_bytes_needed = 0,\n /** @type {number} */ utf8_lower_boundary = 0x80,\n /** @type {number} */ utf8_upper_boundary = 0xBF;\n\n /**\n * @param {Stream} stream The stream of bytes being decoded.\n * @param {number} bite The next byte read from the stream.\n * @return {?(number|!Array.<number>)} The next code point(s)\n * decoded, or null if not enough data exists in the input\n * stream to decode a complete code point.\n */\n this.handler = function(stream, bite) {\n // 1. If byte is end-of-stream and utf-8 bytes needed is not 0,\n // set utf-8 bytes needed to 0 and return error.\n if (bite === end_of_stream && utf8_bytes_needed !== 0) {\n utf8_bytes_needed = 0;\n return decoderError(fatal);\n }\n\n // 2. If byte is end-of-stream, return finished.\n if (bite === end_of_stream)\n return finished;\n\n // 3. If utf-8 bytes needed is 0, based on byte:\n if (utf8_bytes_needed === 0) {\n\n // 0x00 to 0x7F\n if (inRange(bite, 0x00, 0x7F)) {\n // Return a code point whose value is byte.\n return bite;\n }\n\n // 0xC2 to 0xDF\n if (inRange(bite, 0xC2, 0xDF)) {\n // Set utf-8 bytes needed to 1 and utf-8 code point to byte\n // − 0xC0.\n utf8_bytes_needed = 1;\n utf8_code_point = bite - 0xC0;\n }\n\n // 0xE0 to 0xEF\n else if (inRange(bite, 0xE0, 0xEF)) {\n // 1. If byte is 0xE0, set utf-8 lower boundary to 0xA0.\n if (bite === 0xE0)\n utf8_lower_boundary = 0xA0;\n // 2. If byte is 0xED, set utf-8 upper boundary to 0x9F.\n if (bite === 0xED)\n utf8_upper_boundary = 0x9F;\n // 3. Set utf-8 bytes needed to 2 and utf-8 code point to\n // byte − 0xE0.\n utf8_bytes_needed = 2;\n utf8_code_point = bite - 0xE0;\n }\n\n // 0xF0 to 0xF4\n else if (inRange(bite, 0xF0, 0xF4)) {\n // 1. If byte is 0xF0, set utf-8 lower boundary to 0x90.\n if (bite === 0xF0)\n utf8_lower_boundary = 0x90;\n // 2. If byte is 0xF4, set utf-8 upper boundary to 0x8F.\n if (bite === 0xF4)\n utf8_upper_boundary = 0x8F;\n // 3. Set utf-8 bytes needed to 3 and utf-8 code point to\n // byte − 0xF0.\n utf8_bytes_needed = 3;\n utf8_code_point = bite - 0xF0;\n }\n\n // Otherwise\n else {\n // Return error.\n return decoderError(fatal);\n }\n\n // Then (byte is in the range 0xC2 to 0xF4) set utf-8 code\n // point to utf-8 code point << (6 × utf-8 bytes needed) and\n // return continue.\n utf8_code_point = utf8_code_point << (6 * utf8_bytes_needed);\n return null;\n }\n\n // 4. If byte is not in the range utf-8 lower boundary to utf-8\n // upper boundary, run these substeps:\n if (!inRange(bite, utf8_lower_boundary, utf8_upper_boundary)) {\n\n // 1. Set utf-8 code point, utf-8 bytes needed, and utf-8\n // bytes seen to 0, set utf-8 lower boundary to 0x80, and set\n // utf-8 upper boundary to 0xBF.\n utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n utf8_lower_boundary = 0x80;\n utf8_upper_boundary = 0xBF;\n\n // 2. Prepend byte to stream.\n stream.prepend(bite);\n\n // 3. Return error.\n return decoderError(fatal);\n }\n\n // 5. Set utf-8 lower boundary to 0x80 and utf-8 upper boundary\n // to 0xBF.\n utf8_lower_boundary = 0x80;\n utf8_upper_boundary = 0xBF;\n\n // 6. Increase utf-8 bytes seen by one and set utf-8 code point\n // to utf-8 code point + (byte − 0x80) << (6 × (utf-8 bytes\n // needed − utf-8 bytes seen)).\n utf8_bytes_seen += 1;\n utf8_code_point += (bite - 0x80) << (6 * (utf8_bytes_needed - utf8_bytes_seen));\n\n // 7. If utf-8 bytes seen is not equal to utf-8 bytes needed,\n // continue.\n if (utf8_bytes_seen !== utf8_bytes_needed)\n return null;\n\n // 8. Let code point be utf-8 code point.\n var code_point = utf8_code_point;\n\n // 9. Set utf-8 code point, utf-8 bytes needed, and utf-8 bytes\n // seen to 0.\n utf8_code_point = utf8_bytes_needed = utf8_bytes_seen = 0;\n\n // 10. Return a code point whose value is code point.\n return code_point;\n };\n}\n\n/**\n * @constructor\n * @implements {Encoder}\n * @param {{fatal: boolean}} options\n */\nfunction UTF8Encoder(options) {\n var fatal = options.fatal;\n /**\n * @param {Stream} stream Input stream.\n * @param {number} code_point Next code point read from the stream.\n * @return {(number|!Array.<number>)} Byte(s) to emit.\n */\n this.handler = function(stream, code_point) {\n // 1. If code point is end-of-stream, return finished.\n if (code_point === end_of_stream)\n return finished;\n\n // 2. If code point is in the range U+0000 to U+007F, return a\n // byte whose value is code point.\n if (inRange(code_point, 0x0000, 0x007f))\n return code_point;\n\n // 3. Set count and offset based on the range code point is in:\n var count, offset;\n // U+0080 to U+07FF: 1 and 0xC0\n if (inRange(code_point, 0x0080, 0x07FF)) {\n count = 1;\n offset = 0xC0;\n }\n // U+0800 to U+FFFF: 2 and 0xE0\n else if (inRange(code_point, 0x0800, 0xFFFF)) {\n count = 2;\n offset = 0xE0;\n }\n // U+10000 to U+10FFFF: 3 and 0xF0\n else if (inRange(code_point, 0x10000, 0x10FFFF)) {\n count = 3;\n offset = 0xF0;\n }\n\n // 4.Let bytes be a byte sequence whose first byte is (code\n // point >> (6 × count)) + offset.\n var bytes = [(code_point >> (6 * count)) + offset];\n\n // 5. Run these substeps while count is greater than 0:\n while (count > 0) {\n\n // 1. Set temp to code point >> (6 × (count − 1)).\n var temp = code_point >> (6 * (count - 1));\n\n // 2. Append to bytes 0x80 | (temp & 0x3F).\n bytes.push(0x80 | (temp & 0x3F));\n\n // 3. Decrease count by one.\n count -= 1;\n }\n\n // 6. Return bytes bytes, in order.\n return bytes;\n };\n}\n\nexport {TextEncoder, TextDecoder};\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n});\nvar __decorate = (this && this.__decorate) || function (decorators, target, key, desc) {\n var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n return c > 3 && r && Object.defineProperty(target, key, r), r;\n};\nvar __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.deserializeUnchecked = exports.deserialize = exports.serialize = exports.BinaryReader = exports.BinaryWriter = exports.BorshError = exports.baseDecode = exports.baseEncode = void 0;\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nconst bs58_1 = __importDefault(require(\"bs58\"));\n// TODO: Make sure this polyfill not included when not required\nconst encoding = __importStar(require(\"text-encoding-utf-8\"));\nconst ResolvedTextDecoder = typeof TextDecoder !== \"function\" ? encoding.TextDecoder : TextDecoder;\nconst textDecoder = new ResolvedTextDecoder(\"utf-8\", { fatal: true });\nfunction baseEncode(value) {\n if (typeof value === \"string\") {\n value = Buffer.from(value, \"utf8\");\n }\n return bs58_1.default.encode(Buffer.from(value));\n}\nexports.baseEncode = baseEncode;\nfunction baseDecode(value) {\n return Buffer.from(bs58_1.default.decode(value));\n}\nexports.baseDecode = baseDecode;\nconst INITIAL_LENGTH = 1024;\nclass BorshError extends Error {\n constructor(message) {\n super(message);\n this.fieldPath = [];\n this.originalMessage = message;\n }\n addToFieldPath(fieldName) {\n this.fieldPath.splice(0, 0, fieldName);\n // NOTE: Modifying message directly as jest doesn't use .toString()\n this.message = this.originalMessage + \": \" + this.fieldPath.join(\".\");\n }\n}\nexports.BorshError = BorshError;\n/// Binary encoder.\nclass BinaryWriter {\n constructor() {\n this.buf = Buffer.alloc(INITIAL_LENGTH);\n this.length = 0;\n }\n maybeResize() {\n if (this.buf.length < 16 + this.length) {\n this.buf = Buffer.concat([this.buf, Buffer.alloc(INITIAL_LENGTH)]);\n }\n }\n writeU8(value) {\n this.maybeResize();\n this.buf.writeUInt8(value, this.length);\n this.length += 1;\n }\n writeU16(value) {\n this.maybeResize();\n this.buf.writeUInt16LE(value, this.length);\n this.length += 2;\n }\n writeU32(value) {\n this.maybeResize();\n this.buf.writeUInt32LE(value, this.length);\n this.length += 4;\n }\n writeU64(value) {\n this.maybeResize();\n this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 8)));\n }\n writeU128(value) {\n this.maybeResize();\n this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 16)));\n }\n writeU256(value) {\n this.maybeResize();\n this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 32)));\n }\n writeU512(value) {\n this.maybeResize();\n this.writeBuffer(Buffer.from(new bn_js_1.default(value).toArray(\"le\", 64)));\n }\n writeBuffer(buffer) {\n // Buffer.from is needed as this.buf.subarray can return plain Uint8Array in browser\n this.buf = Buffer.concat([\n Buffer.from(this.buf.subarray(0, this.length)),\n buffer,\n Buffer.alloc(INITIAL_LENGTH),\n ]);\n this.length += buffer.length;\n }\n writeString(str) {\n this.maybeResize();\n const b = Buffer.from(str, \"utf8\");\n this.writeU32(b.length);\n this.writeBuffer(b);\n }\n writeFixedArray(array) {\n this.writeBuffer(Buffer.from(array));\n }\n writeArray(array, fn) {\n this.maybeResize();\n this.writeU32(array.length);\n for (const elem of array) {\n this.maybeResize();\n fn(elem);\n }\n }\n toArray() {\n return this.buf.subarray(0, this.length);\n }\n}\nexports.BinaryWriter = BinaryWriter;\nfunction handlingRangeError(target, propertyKey, propertyDescriptor) {\n const originalMethod = propertyDescriptor.value;\n propertyDescriptor.value = function (...args) {\n try {\n return originalMethod.apply(this, args);\n }\n catch (e) {\n if (e instanceof RangeError) {\n const code = e.code;\n if ([\"ERR_BUFFER_OUT_OF_BOUNDS\", \"ERR_OUT_OF_RANGE\"].indexOf(code) >= 0) {\n throw new BorshError(\"Reached the end of buffer when deserializing\");\n }\n }\n throw e;\n }\n };\n}\nclass BinaryReader {\n constructor(buf) {\n this.buf = buf;\n this.offset = 0;\n }\n readU8() {\n const value = this.buf.readUInt8(this.offset);\n this.offset += 1;\n return value;\n }\n readU16() {\n const value = this.buf.readUInt16LE(this.offset);\n this.offset += 2;\n return value;\n }\n readU32() {\n const value = this.buf.readUInt32LE(this.offset);\n this.offset += 4;\n return value;\n }\n readU64() {\n const buf = this.readBuffer(8);\n return new bn_js_1.default(buf, \"le\");\n }\n readU128() {\n const buf = this.readBuffer(16);\n return new bn_js_1.default(buf, \"le\");\n }\n readU256() {\n const buf = this.readBuffer(32);\n return new bn_js_1.default(buf, \"le\");\n }\n readU512() {\n const buf = this.readBuffer(64);\n return new bn_js_1.default(buf, \"le\");\n }\n readBuffer(len) {\n if (this.offset + len > this.buf.length) {\n throw new BorshError(`Expected buffer length ${len} isn't within bounds`);\n }\n const result = this.buf.slice(this.offset, this.offset + len);\n this.offset += len;\n return result;\n }\n readString() {\n const len = this.readU32();\n const buf = this.readBuffer(len);\n try {\n // NOTE: Using TextDecoder to fail on invalid UTF-8\n return textDecoder.decode(buf);\n }\n catch (e) {\n throw new BorshError(`Error decoding UTF-8 string: ${e}`);\n }\n }\n readFixedArray(len) {\n return new Uint8Array(this.readBuffer(len));\n }\n readArray(fn) {\n const len = this.readU32();\n const result = Array();\n for (let i = 0; i < len; ++i) {\n result.push(fn());\n }\n return result;\n }\n}\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU8\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU16\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU32\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU64\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU128\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU256\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readU512\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readString\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readFixedArray\", null);\n__decorate([\n handlingRangeError\n], BinaryReader.prototype, \"readArray\", null);\nexports.BinaryReader = BinaryReader;\nfunction capitalizeFirstLetter(string) {\n return string.charAt(0).toUpperCase() + string.slice(1);\n}\nfunction serializeField(schema, fieldName, value, fieldType, writer) {\n try {\n // TODO: Handle missing values properly (make sure they never result in just skipped write)\n if (typeof fieldType === \"string\") {\n writer[`write${capitalizeFirstLetter(fieldType)}`](value);\n }\n else if (fieldType instanceof Array) {\n if (typeof fieldType[0] === \"number\") {\n if (value.length !== fieldType[0]) {\n throw new BorshError(`Expecting byte array of length ${fieldType[0]}, but got ${value.length} bytes`);\n }\n writer.writeFixedArray(value);\n }\n else if (fieldType.length === 2 && typeof fieldType[1] === \"number\") {\n if (value.length !== fieldType[1]) {\n throw new BorshError(`Expecting byte array of length ${fieldType[1]}, but got ${value.length} bytes`);\n }\n for (let i = 0; i < fieldType[1]; i++) {\n serializeField(schema, null, value[i], fieldType[0], writer);\n }\n }\n else {\n writer.writeArray(value, (item) => {\n serializeField(schema, fieldName, item, fieldType[0], writer);\n });\n }\n }\n else if (fieldType.kind !== undefined) {\n switch (fieldType.kind) {\n case \"option\": {\n if (value === null || value === undefined) {\n writer.writeU8(0);\n }\n else {\n writer.writeU8(1);\n serializeField(schema, fieldName, value, fieldType.type, writer);\n }\n break;\n }\n case \"map\": {\n writer.writeU32(value.size);\n value.forEach((val, key) => {\n serializeField(schema, fieldName, key, fieldType.key, writer);\n serializeField(schema, fieldName, val, fieldType.value, writer);\n });\n break;\n }\n default:\n throw new BorshError(`FieldType ${fieldType} unrecognized`);\n }\n }\n else {\n serializeStruct(schema, value, writer);\n }\n }\n catch (error) {\n if (error instanceof BorshError) {\n error.addToFieldPath(fieldName);\n }\n throw error;\n }\n}\nfunction serializeStruct(schema, obj, writer) {\n if (typeof obj.borshSerialize === \"function\") {\n obj.borshSerialize(writer);\n return;\n }\n const structSchema = schema.get(obj.constructor);\n if (!structSchema) {\n throw new BorshError(`Class ${obj.constructor.name} is missing in schema`);\n }\n if (structSchema.kind === \"struct\") {\n structSchema.fields.map(([fieldName, fieldType]) => {\n serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n });\n }\n else if (structSchema.kind === \"enum\") {\n const name = obj[structSchema.field];\n for (let idx = 0; idx < structSchema.values.length; ++idx) {\n const [fieldName, fieldType] = structSchema.values[idx];\n if (fieldName === name) {\n writer.writeU8(idx);\n serializeField(schema, fieldName, obj[fieldName], fieldType, writer);\n break;\n }\n }\n }\n else {\n throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${obj.constructor.name}`);\n }\n}\n/// Serialize given object using schema of the form:\n/// { class_name -> [ [field_name, field_type], .. ], .. }\nfunction serialize(schema, obj, Writer = BinaryWriter) {\n const writer = new Writer();\n serializeStruct(schema, obj, writer);\n return writer.toArray();\n}\nexports.serialize = serialize;\nfunction deserializeField(schema, fieldName, fieldType, reader) {\n try {\n if (typeof fieldType === \"string\") {\n return reader[`read${capitalizeFirstLetter(fieldType)}`]();\n }\n if (fieldType instanceof Array) {\n if (typeof fieldType[0] === \"number\") {\n return reader.readFixedArray(fieldType[0]);\n }\n else if (typeof fieldType[1] === \"number\") {\n const arr = [];\n for (let i = 0; i < fieldType[1]; i++) {\n arr.push(deserializeField(schema, null, fieldType[0], reader));\n }\n return arr;\n }\n else {\n return reader.readArray(() => deserializeField(schema, fieldName, fieldType[0], reader));\n }\n }\n if (fieldType.kind === \"option\") {\n const option = reader.readU8();\n if (option) {\n return deserializeField(schema, fieldName, fieldType.type, reader);\n }\n return undefined;\n }\n if (fieldType.kind === \"map\") {\n let map = new Map();\n const length = reader.readU32();\n for (let i = 0; i < length; i++) {\n const key = deserializeField(schema, fieldName, fieldType.key, reader);\n const val = deserializeField(schema, fieldName, fieldType.value, reader);\n map.set(key, val);\n }\n return map;\n }\n return deserializeStruct(schema, fieldType, reader);\n }\n catch (error) {\n if (error instanceof BorshError) {\n error.addToFieldPath(fieldName);\n }\n throw error;\n }\n}\nfunction deserializeStruct(schema, classType, reader) {\n if (typeof classType.borshDeserialize === \"function\") {\n return classType.borshDeserialize(reader);\n }\n const structSchema = schema.get(classType);\n if (!structSchema) {\n throw new BorshError(`Class ${classType.name} is missing in schema`);\n }\n if (structSchema.kind === \"struct\") {\n const result = {};\n for (const [fieldName, fieldType] of schema.get(classType).fields) {\n result[fieldName] = deserializeField(schema, fieldName, fieldType, reader);\n }\n return new classType(result);\n }\n if (structSchema.kind === \"enum\") {\n const idx = reader.readU8();\n if (idx >= structSchema.values.length) {\n throw new BorshError(`Enum index: ${idx} is out of range`);\n }\n const [fieldName, fieldType] = structSchema.values[idx];\n const fieldValue = deserializeField(schema, fieldName, fieldType, reader);\n return new classType({ [fieldName]: fieldValue });\n }\n throw new BorshError(`Unexpected schema kind: ${structSchema.kind} for ${classType.constructor.name}`);\n}\n/// Deserializes object from bytes using schema.\nfunction deserialize(schema, classType, buffer, Reader = BinaryReader) {\n const reader = new Reader(buffer);\n const result = deserializeStruct(schema, classType, reader);\n if (reader.offset < buffer.length) {\n throw new BorshError(`Unexpected ${buffer.length - reader.offset} bytes after deserialized data`);\n }\n return result;\n}\nexports.deserialize = deserialize;\n/// Deserializes object from bytes using schema, without checking the length read\nfunction deserializeUnchecked(schema, classType, buffer, Reader = BinaryReader) {\n const reader = new Reader(buffer);\n return deserializeStruct(schema, classType, reader);\n}\nexports.deserializeUnchecked = deserializeUnchecked;\n",null,null,null,null,"module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","if (typeof Object.create === 'function') {\n // implementation from standard node.js 'util' module\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n ctor.prototype = Object.create(superCtor.prototype, {\n constructor: {\n value: ctor,\n enumerable: false,\n writable: true,\n configurable: true\n }\n })\n }\n };\n} else {\n // old school shim for old browsers\n module.exports = function inherits(ctor, superCtor) {\n if (superCtor) {\n ctor.super_ = superCtor\n var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nexports.inherits = inherits;\n\nfunction isSurrogatePair(msg, i) {\n if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) {\n return false;\n }\n if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg === 'string') {\n if (!enc) {\n // Inspired by stringToUtf8ByteArray() in closure-library by Google\n // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143\n // Apache License 2.0\n // https://github.com/google/closure-library/blob/master/LICENSE\n var p = 0;\n for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\n if (c < 128) {\n res[p++] = c;\n } else if (c < 2048) {\n res[p++] = (c >> 6) | 192;\n res[p++] = (c & 63) | 128;\n } else if (isSurrogatePair(msg, i)) {\n c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF);\n res[p++] = (c >> 18) | 240;\n res[p++] = ((c >> 12) & 63) | 128;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n } else {\n res[p++] = (c >> 12) | 224;\n res[p++] = ((c >> 6) & 63) | 128;\n res[p++] = (c & 63) | 128;\n }\n }\n } else if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\n}\nexports.zero8 = zero8;\n\nfunction join32(msg, start, end, endian) {\n var len = end - start;\n assert(len % 4 === 0);\n var res = new Array(len / 4);\n for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\n if (endian === 'big') {\n res[k] = m >>> 24;\n res[k + 1] = (m >>> 16) & 0xff;\n res[k + 2] = (m >>> 8) & 0xff;\n res[k + 3] = m & 0xff;\n } else {\n res[k + 3] = m >>> 24;\n res[k + 2] = (m >>> 16) & 0xff;\n res[k + 1] = (m >>> 8) & 0xff;\n res[k] = m & 0xff;\n }\n }\n return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\n}\nexports.sum32_5 = sum32_5;\n\nfunction sum64(buf, pos, ah, al) {\n var bh = buf[pos];\n var bl = buf[pos + 1];\n\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n buf[pos] = hi >>> 0;\n buf[pos + 1] = lo;\n}\nexports.sum64 = sum64;\n\nfunction sum64_hi(ah, al, bh, bl) {\n var lo = (al + bl) >>> 0;\n var hi = (lo < al ? 1 : 0) + ah + bh;\n return hi >>> 0;\n}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\n}\nexports.sum64_lo = sum64_lo;\n\nfunction sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\n}\nexports.sum64_4_hi = sum64_4_hi;\n\nfunction sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) {\n var lo = al + bl + cl + dl;\n return lo >>> 0;\n}\nexports.sum64_4_lo = sum64_4_lo;\n\nfunction sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var carry = 0;\n var lo = al;\n lo = (lo + bl) >>> 0;\n carry += lo < al ? 1 : 0;\n lo = (lo + cl) >>> 0;\n carry += lo < cl ? 1 : 0;\n lo = (lo + dl) >>> 0;\n carry += lo < dl ? 1 : 0;\n lo = (lo + el) >>> 0;\n carry += lo < el ? 1 : 0;\n\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\n}\nexports.sum64_5_hi = sum64_5_hi;\n\nfunction sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) {\n var lo = al + bl + cl + dl + el;\n\n return lo >>> 0;\n}\nexports.sum64_5_lo = sum64_5_lo;\n\nfunction rotr64_hi(ah, al, num) {\n var r = (al << (32 - num)) | (ah >>> num);\n return r >>> 0;\n}\nexports.rotr64_hi = rotr64_hi;\n\nfunction rotr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\n}\nexports.shr64_hi = shr64_hi;\n\nfunction shr64_lo(ah, al, num) {\n var r = (ah << (32 - num)) | (al >>> num);\n return r >>> 0;\n}\nexports.shr64_lo = shr64_lo;\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n\n for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\nvar assert = require('minimalistic-assert');\n\nvar sum32 = utils.sum32;\nvar sum32_4 = utils.sum32_4;\nvar sum32_5 = utils.sum32_5;\nvar ch32 = shaCommon.ch32;\nvar maj32 = shaCommon.maj32;\nvar s0_256 = shaCommon.s0_256;\nvar s1_256 = shaCommon.s1_256;\nvar g0_256 = shaCommon.g0_256;\nvar g1_256 = shaCommon.g1_256;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n];\n\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\nSHA256.blockSize = 512;\nSHA256.outSize = 256;\nSHA256.hmacStrength = 192;\nSHA256.padLength = 64;\n\nSHA256.prototype._update = function _update(msg, start) {\n var W = this.W;\n\n for (var i = 0; i < 16; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i++)\n W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]);\n\n var a = this.h[0];\n var b = this.h[1];\n var c = this.h[2];\n var d = this.h[3];\n var e = this.h[4];\n var f = this.h[5];\n var g = this.h[6];\n var h = this.h[7];\n\n assert(this.k.length === W.length);\n for (i = 0; i < W.length; i++) {\n var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]);\n var T2 = sum32(s0_256(a), maj32(a, b, c));\n h = g;\n g = f;\n f = e;\n e = sum32(d, T1);\n d = c;\n c = b;\n b = a;\n a = sum32(T1, T2);\n }\n\n this.h[0] = sum32(this.h[0], a);\n this.h[1] = sum32(this.h[1], b);\n this.h[2] = sum32(this.h[2], c);\n this.h[3] = sum32(this.h[3], d);\n this.h[4] = sum32(this.h[4], e);\n this.h[5] = sum32(this.h[5], f);\n this.h[6] = sum32(this.h[6], g);\n this.h[7] = sum32(this.h[7], h);\n};\n\nSHA256.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar assert = require('minimalistic-assert');\n\nvar rotr64_hi = utils.rotr64_hi;\nvar rotr64_lo = utils.rotr64_lo;\nvar shr64_hi = utils.shr64_hi;\nvar shr64_lo = utils.shr64_lo;\nvar sum64 = utils.sum64;\nvar sum64_hi = utils.sum64_hi;\nvar sum64_lo = utils.sum64_lo;\nvar sum64_4_hi = utils.sum64_4_hi;\nvar sum64_4_lo = utils.sum64_4_lo;\nvar sum64_5_hi = utils.sum64_5_hi;\nvar sum64_5_lo = utils.sum64_5_lo;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\nSHA512.blockSize = 1024;\nSHA512.outSize = 512;\nSHA512.hmacStrength = 192;\nSHA512.padLength = 128;\n\nSHA512.prototype._prepareBlock = function _prepareBlock(msg, start) {\n var W = this.W;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n }\n};\n\nSHA512.prototype._update = function _update(msg, start) {\n this._prepareBlock(msg, start);\n\n var W = this.W;\n\n var ah = this.h[0];\n var al = this.h[1];\n var bh = this.h[2];\n var bl = this.h[3];\n var ch = this.h[4];\n var cl = this.h[5];\n var dh = this.h[6];\n var dl = this.h[7];\n var eh = this.h[8];\n var el = this.h[9];\n var fh = this.h[10];\n var fl = this.h[11];\n var gh = this.h[12];\n var gl = this.h[13];\n var hh = this.h[14];\n var hl = this.h[15];\n\n assert(this.k.length === W.length);\n for (var i = 0; i < W.length; i += 2) {\n var c0_hi = hh;\n var c0_lo = hl;\n var c1_hi = s1_512_hi(eh, el);\n var c1_lo = s1_512_lo(eh, el);\n var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl);\n var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl);\n var c3_hi = this.k[i];\n var c3_lo = this.k[i + 1];\n var c4_hi = W[i];\n var c4_lo = W[i + 1];\n\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\n c0_hi = s0_512_hi(ah, al);\n c0_lo = s0_512_lo(ah, al);\n c1_hi = maj64_hi(ah, al, bh, bl, ch, cl);\n c1_lo = maj64_lo(ah, al, bh, bl, ch, cl);\n\n var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo);\n var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo);\n\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\n ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo);\n al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo);\n }\n\n sum64(this.h, 0, ah, al);\n sum64(this.h, 2, bh, bl);\n sum64(this.h, 4, ch, cl);\n sum64(this.h, 6, dh, dl);\n sum64(this.h, 8, eh, el);\n sum64(this.h, 10, fh, fl);\n sum64(this.h, 12, gh, gl);\n sum64(this.h, 14, hh, hl);\n};\n\nSHA512.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n\nfunction ch64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ ((~xh) & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction ch64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ ((~xl) & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_hi(xh, xl, yh, yl, zh) {\n var r = (xh & yh) ^ (xh & zh) ^ (yh & zh);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction maj64_lo(xh, xl, yh, yl, zh, zl) {\n var r = (xl & yl) ^ (xl & zl) ^ (yl & zl);\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 28);\n var c1_hi = rotr64_hi(xl, xh, 2); // 34\n var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 28);\n var c1_lo = rotr64_lo(xl, xh, 2); // 34\n var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 14);\n var c1_hi = rotr64_hi(xh, xl, 18);\n var c2_hi = rotr64_hi(xl, xh, 9); // 41\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction s1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 14);\n var c1_lo = rotr64_lo(xh, xl, 18);\n var c2_lo = rotr64_lo(xl, xh, 9); // 41\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 1);\n var c1_hi = rotr64_hi(xh, xl, 8);\n var c2_hi = shr64_hi(xh, xl, 7);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g0_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 1);\n var c1_lo = rotr64_lo(xh, xl, 8);\n var c2_lo = shr64_lo(xh, xl, 7);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_hi(xh, xl) {\n var c0_hi = rotr64_hi(xh, xl, 19);\n var c1_hi = rotr64_hi(xl, xh, 29); // 61\n var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n\nfunction g1_512_lo(xh, xl) {\n var c0_lo = rotr64_lo(xh, xl, 19);\n var c1_lo = rotr64_lo(xl, xh, 29); // 61\n var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\n var A = this.h[0];\n var B = this.h[1];\n var C = this.h[2];\n var D = this.h[3];\n var E = this.h[4];\n var Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","var hash = exports;\n\nhash.utils = require('./hash/utils');\nhash.common = require('./hash/common');\nhash.sha = require('./hash/sha');\nhash.ripemd = require('./hash/ripemd');\nhash.hmac = require('./hash/hmac');\n\n// Proxy hash functions to the main object\nhash.sha1 = hash.sha.sha1;\nhash.sha256 = hash.sha.sha256;\nhash.sha224 = hash.sha.sha224;\nhash.sha384 = hash.sha.sha384;\nhash.sha512 = hash.sha.sha512;\nhash.ripemd160 = hash.ripemd.ripemd160;\n","\"use strict\";\nlet _permanentCensorErrors = false;\nlet _censorErrors = false;\nconst LogLevels = { debug: 1, \"default\": 2, info: 2, warning: 3, error: 4, off: 5 };\nlet _logLevel = LogLevels[\"default\"];\nimport { version } from \"./_version\";\nlet _globalLogger = null;\nfunction _checkNormalize() {\n try {\n const missing = [];\n // Make sure all forms of normalization are supported\n [\"NFD\", \"NFC\", \"NFKD\", \"NFKC\"].forEach((form) => {\n try {\n if (\"test\".normalize(form) !== \"test\") {\n throw new Error(\"bad normalize\");\n }\n ;\n }\n catch (error) {\n missing.push(form);\n }\n });\n if (missing.length) {\n throw new Error(\"missing \" + missing.join(\", \"));\n }\n if (String.fromCharCode(0xe9).normalize(\"NFD\") !== String.fromCharCode(0x65, 0x0301)) {\n throw new Error(\"broken implementation\");\n }\n }\n catch (error) {\n return error.message;\n }\n return null;\n}\nconst _normalizeError = _checkNormalize();\nexport var LogLevel;\n(function (LogLevel) {\n LogLevel[\"DEBUG\"] = \"DEBUG\";\n LogLevel[\"INFO\"] = \"INFO\";\n LogLevel[\"WARNING\"] = \"WARNING\";\n LogLevel[\"ERROR\"] = \"ERROR\";\n LogLevel[\"OFF\"] = \"OFF\";\n})(LogLevel || (LogLevel = {}));\nexport var ErrorCode;\n(function (ErrorCode) {\n ///////////////////\n // Generic Errors\n // Unknown Error\n ErrorCode[\"UNKNOWN_ERROR\"] = \"UNKNOWN_ERROR\";\n // Not Implemented\n ErrorCode[\"NOT_IMPLEMENTED\"] = \"NOT_IMPLEMENTED\";\n // Unsupported Operation\n // - operation\n ErrorCode[\"UNSUPPORTED_OPERATION\"] = \"UNSUPPORTED_OPERATION\";\n // Network Error (i.e. Ethereum Network, such as an invalid chain ID)\n // - event (\"noNetwork\" is not re-thrown in provider.ready; otherwise thrown)\n ErrorCode[\"NETWORK_ERROR\"] = \"NETWORK_ERROR\";\n // Some sort of bad response from the server\n ErrorCode[\"SERVER_ERROR\"] = \"SERVER_ERROR\";\n // Timeout\n ErrorCode[\"TIMEOUT\"] = \"TIMEOUT\";\n ///////////////////\n // Operational Errors\n // Buffer Overrun\n ErrorCode[\"BUFFER_OVERRUN\"] = \"BUFFER_OVERRUN\";\n // Numeric Fault\n // - operation: the operation being executed\n // - fault: the reason this faulted\n ErrorCode[\"NUMERIC_FAULT\"] = \"NUMERIC_FAULT\";\n ///////////////////\n // Argument Errors\n // Missing new operator to an object\n // - name: The name of the class\n ErrorCode[\"MISSING_NEW\"] = \"MISSING_NEW\";\n // Invalid argument (e.g. value is incompatible with type) to a function:\n // - argument: The argument name that was invalid\n // - value: The value of the argument\n ErrorCode[\"INVALID_ARGUMENT\"] = \"INVALID_ARGUMENT\";\n // Missing argument to a function:\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"MISSING_ARGUMENT\"] = \"MISSING_ARGUMENT\";\n // Too many arguments\n // - count: The number of arguments received\n // - expectedCount: The number of arguments expected\n ErrorCode[\"UNEXPECTED_ARGUMENT\"] = \"UNEXPECTED_ARGUMENT\";\n ///////////////////\n // Blockchain Errors\n // Call exception\n // - transaction: the transaction\n // - address?: the contract address\n // - args?: The arguments passed into the function\n // - method?: The Solidity method signature\n // - errorSignature?: The EIP848 error signature\n // - errorArgs?: The EIP848 error parameters\n // - reason: The reason (only for EIP848 \"Error(string)\")\n ErrorCode[\"CALL_EXCEPTION\"] = \"CALL_EXCEPTION\";\n // Insufficient funds (< value + gasLimit * gasPrice)\n // - transaction: the transaction attempted\n ErrorCode[\"INSUFFICIENT_FUNDS\"] = \"INSUFFICIENT_FUNDS\";\n // Nonce has already been used\n // - transaction: the transaction attempted\n ErrorCode[\"NONCE_EXPIRED\"] = \"NONCE_EXPIRED\";\n // The replacement fee for the transaction is too low\n // - transaction: the transaction attempted\n ErrorCode[\"REPLACEMENT_UNDERPRICED\"] = \"REPLACEMENT_UNDERPRICED\";\n // The gas limit could not be estimated\n // - transaction: the transaction passed to estimateGas\n ErrorCode[\"UNPREDICTABLE_GAS_LIMIT\"] = \"UNPREDICTABLE_GAS_LIMIT\";\n // The transaction was replaced by one with a higher gas price\n // - reason: \"cancelled\", \"replaced\" or \"repriced\"\n // - cancelled: true if reason == \"cancelled\" or reason == \"replaced\")\n // - hash: original transaction hash\n // - replacement: the full TransactionsResponse for the replacement\n // - receipt: the receipt of the replacement\n ErrorCode[\"TRANSACTION_REPLACED\"] = \"TRANSACTION_REPLACED\";\n ///////////////////\n // Interaction Errors\n // The user rejected the action, such as signing a message or sending\n // a transaction\n ErrorCode[\"ACTION_REJECTED\"] = \"ACTION_REJECTED\";\n})(ErrorCode || (ErrorCode = {}));\n;\nconst HEX = \"0123456789abcdef\";\nexport class Logger {\n constructor(version) {\n Object.defineProperty(this, \"version\", {\n enumerable: true,\n value: version,\n writable: false\n });\n }\n _log(logLevel, args) {\n const level = logLevel.toLowerCase();\n if (LogLevels[level] == null) {\n this.throwArgumentError(\"invalid log level name\", \"logLevel\", logLevel);\n }\n if (_logLevel > LogLevels[level]) {\n return;\n }\n console.log.apply(console, args);\n }\n debug(...args) {\n this._log(Logger.levels.DEBUG, args);\n }\n info(...args) {\n this._log(Logger.levels.INFO, args);\n }\n warn(...args) {\n this._log(Logger.levels.WARNING, args);\n }\n makeError(message, code, params) {\n // Errors are being censored\n if (_censorErrors) {\n return this.makeError(\"censored error\", code, {});\n }\n if (!code) {\n code = Logger.errors.UNKNOWN_ERROR;\n }\n if (!params) {\n params = {};\n }\n const messageDetails = [];\n Object.keys(params).forEach((key) => {\n const value = params[key];\n try {\n if (value instanceof Uint8Array) {\n let hex = \"\";\n for (let i = 0; i < value.length; i++) {\n hex += HEX[value[i] >> 4];\n hex += HEX[value[i] & 0x0f];\n }\n messageDetails.push(key + \"=Uint8Array(0x\" + hex + \")\");\n }\n else {\n messageDetails.push(key + \"=\" + JSON.stringify(value));\n }\n }\n catch (error) {\n messageDetails.push(key + \"=\" + JSON.stringify(params[key].toString()));\n }\n });\n messageDetails.push(`code=${code}`);\n messageDetails.push(`version=${this.version}`);\n const reason = message;\n let url = \"\";\n switch (code) {\n case ErrorCode.NUMERIC_FAULT: {\n url = \"NUMERIC_FAULT\";\n const fault = message;\n switch (fault) {\n case \"overflow\":\n case \"underflow\":\n case \"division-by-zero\":\n url += \"-\" + fault;\n break;\n case \"negative-power\":\n case \"negative-width\":\n url += \"-unsupported\";\n break;\n case \"unbound-bitwise-result\":\n url += \"-unbound-result\";\n break;\n }\n break;\n }\n case ErrorCode.CALL_EXCEPTION:\n case ErrorCode.INSUFFICIENT_FUNDS:\n case ErrorCode.MISSING_NEW:\n case ErrorCode.NONCE_EXPIRED:\n case ErrorCode.REPLACEMENT_UNDERPRICED:\n case ErrorCode.TRANSACTION_REPLACED:\n case ErrorCode.UNPREDICTABLE_GAS_LIMIT:\n url = code;\n break;\n }\n if (url) {\n message += \" [ See: https:/\\/links.ethers.org/v5-errors-\" + url + \" ]\";\n }\n if (messageDetails.length) {\n message += \" (\" + messageDetails.join(\", \") + \")\";\n }\n // @TODO: Any??\n const error = new Error(message);\n error.reason = reason;\n error.code = code;\n Object.keys(params).forEach(function (key) {\n error[key] = params[key];\n });\n return error;\n }\n throwError(message, code, params) {\n throw this.makeError(message, code, params);\n }\n throwArgumentError(message, name, value) {\n return this.throwError(message, Logger.errors.INVALID_ARGUMENT, {\n argument: name,\n value: value\n });\n }\n assert(condition, message, code, params) {\n if (!!condition) {\n return;\n }\n this.throwError(message, code, params);\n }\n assertArgument(condition, message, name, value) {\n if (!!condition) {\n return;\n }\n this.throwArgumentError(message, name, value);\n }\n checkNormalize(message) {\n if (message == null) {\n message = \"platform missing String.prototype.normalize\";\n }\n if (_normalizeError) {\n this.throwError(\"platform missing String.prototype.normalize\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"String.prototype.normalize\", form: _normalizeError\n });\n }\n }\n checkSafeUint53(value, message) {\n if (typeof (value) !== \"number\") {\n return;\n }\n if (message == null) {\n message = \"value not safe\";\n }\n if (value < 0 || value >= 0x1fffffffffffff) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"out-of-safe-range\",\n value: value\n });\n }\n if (value % 1) {\n this.throwError(message, Logger.errors.NUMERIC_FAULT, {\n operation: \"checkSafeInteger\",\n fault: \"non-integer\",\n value: value\n });\n }\n }\n checkArgumentCount(count, expectedCount, message) {\n if (message) {\n message = \": \" + message;\n }\n else {\n message = \"\";\n }\n if (count < expectedCount) {\n this.throwError(\"missing argument\" + message, Logger.errors.MISSING_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n if (count > expectedCount) {\n this.throwError(\"too many arguments\" + message, Logger.errors.UNEXPECTED_ARGUMENT, {\n count: count,\n expectedCount: expectedCount\n });\n }\n }\n checkNew(target, kind) {\n if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n checkAbstract(target, kind) {\n if (target === kind) {\n this.throwError(\"cannot instantiate abstract class \" + JSON.stringify(kind.name) + \" directly; use a sub-class\", Logger.errors.UNSUPPORTED_OPERATION, { name: target.name, operation: \"new\" });\n }\n else if (target === Object || target == null) {\n this.throwError(\"missing new\", Logger.errors.MISSING_NEW, { name: kind.name });\n }\n }\n static globalLogger() {\n if (!_globalLogger) {\n _globalLogger = new Logger(version);\n }\n return _globalLogger;\n }\n static setCensorship(censorship, permanent) {\n if (!censorship && permanent) {\n this.globalLogger().throwError(\"cannot permanently disable censorship\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n if (_permanentCensorErrors) {\n if (!censorship) {\n return;\n }\n this.globalLogger().throwError(\"error censorship permanent\", Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"setCensorship\"\n });\n }\n _censorErrors = !!censorship;\n _permanentCensorErrors = !!permanent;\n }\n static setLogLevel(logLevel) {\n const level = LogLevels[logLevel.toLowerCase()];\n if (level == null) {\n Logger.globalLogger().warn(\"invalid log level - \" + logLevel);\n return;\n }\n _logLevel = level;\n }\n static from(version) {\n return new Logger(version);\n }\n}\nLogger.errors = ErrorCode;\nLogger.levels = LogLevel;\n//# sourceMappingURL=index.js.map","export const version = \"logger/5.7.0\";\n//# sourceMappingURL=_version.js.map","export const version = \"bytes/5.7.0\";\n//# sourceMappingURL=_version.js.map","\"use strict\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\n///////////////////////////////\nfunction isHexable(value) {\n return !!(value.toHexString);\n}\nfunction addSlice(array) {\n if (array.slice) {\n return array;\n }\n array.slice = function () {\n const args = Array.prototype.slice.call(arguments);\n return addSlice(new Uint8Array(Array.prototype.slice.apply(array, args)));\n };\n return array;\n}\nexport function isBytesLike(value) {\n return ((isHexString(value) && !(value.length % 2)) || isBytes(value));\n}\nfunction isInteger(value) {\n return (typeof (value) === \"number\" && value == value && (value % 1) === 0);\n}\nexport function isBytes(value) {\n if (value == null) {\n return false;\n }\n if (value.constructor === Uint8Array) {\n return true;\n }\n if (typeof (value) === \"string\") {\n return false;\n }\n if (!isInteger(value.length) || value.length < 0) {\n return false;\n }\n for (let i = 0; i < value.length; i++) {\n const v = value[i];\n if (!isInteger(v) || v < 0 || v >= 256) {\n return false;\n }\n }\n return true;\n}\nexport function arrayify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid arrayify value\");\n const result = [];\n while (value) {\n result.unshift(value & 0xff);\n value = parseInt(String(value / 256));\n }\n if (result.length === 0) {\n result.push(0);\n }\n return addSlice(new Uint8Array(result));\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n value = value.toHexString();\n }\n if (isHexString(value)) {\n let hex = value.substring(2);\n if (hex.length % 2) {\n if (options.hexPad === \"left\") {\n hex = \"0\" + hex;\n }\n else if (options.hexPad === \"right\") {\n hex += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n const result = [];\n for (let i = 0; i < hex.length; i += 2) {\n result.push(parseInt(hex.substring(i, i + 2), 16));\n }\n return addSlice(new Uint8Array(result));\n }\n if (isBytes(value)) {\n return addSlice(new Uint8Array(value));\n }\n return logger.throwArgumentError(\"invalid arrayify value\", \"value\", value);\n}\nexport function concat(items) {\n const objects = items.map(item => arrayify(item));\n const length = objects.reduce((accum, item) => (accum + item.length), 0);\n const result = new Uint8Array(length);\n objects.reduce((offset, object) => {\n result.set(object, offset);\n return offset + object.length;\n }, 0);\n return addSlice(result);\n}\nexport function stripZeros(value) {\n let result = arrayify(value);\n if (result.length === 0) {\n return result;\n }\n // Find the first non-zero entry\n let start = 0;\n while (start < result.length && result[start] === 0) {\n start++;\n }\n // If we started with zeros, strip them\n if (start) {\n result = result.slice(start);\n }\n return result;\n}\nexport function zeroPad(value, length) {\n value = arrayify(value);\n if (value.length > length) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[0]);\n }\n const result = new Uint8Array(length);\n result.set(value, length - value.length);\n return addSlice(result);\n}\nexport function isHexString(value, length) {\n if (typeof (value) !== \"string\" || !value.match(/^0x[0-9A-Fa-f]*$/)) {\n return false;\n }\n if (length && value.length !== 2 + 2 * length) {\n return false;\n }\n return true;\n}\nconst HexCharacters = \"0123456789abcdef\";\nexport function hexlify(value, options) {\n if (!options) {\n options = {};\n }\n if (typeof (value) === \"number\") {\n logger.checkSafeUint53(value, \"invalid hexlify value\");\n let hex = \"\";\n while (value) {\n hex = HexCharacters[value & 0xf] + hex;\n value = Math.floor(value / 16);\n }\n if (hex.length) {\n if (hex.length % 2) {\n hex = \"0\" + hex;\n }\n return \"0x\" + hex;\n }\n return \"0x00\";\n }\n if (typeof (value) === \"bigint\") {\n value = value.toString(16);\n if (value.length % 2) {\n return (\"0x0\" + value);\n }\n return \"0x\" + value;\n }\n if (options.allowMissingPrefix && typeof (value) === \"string\" && value.substring(0, 2) !== \"0x\") {\n value = \"0x\" + value;\n }\n if (isHexable(value)) {\n return value.toHexString();\n }\n if (isHexString(value)) {\n if (value.length % 2) {\n if (options.hexPad === \"left\") {\n value = \"0x0\" + value.substring(2);\n }\n else if (options.hexPad === \"right\") {\n value += \"0\";\n }\n else {\n logger.throwArgumentError(\"hex data is odd-length\", \"value\", value);\n }\n }\n return value.toLowerCase();\n }\n if (isBytes(value)) {\n let result = \"0x\";\n for (let i = 0; i < value.length; i++) {\n let v = value[i];\n result += HexCharacters[(v & 0xf0) >> 4] + HexCharacters[v & 0x0f];\n }\n return result;\n }\n return logger.throwArgumentError(\"invalid hexlify value\", \"value\", value);\n}\n/*\nfunction unoddify(value: BytesLike | Hexable | number): BytesLike | Hexable | number {\n if (typeof(value) === \"string\" && value.length % 2 && value.substring(0, 2) === \"0x\") {\n return \"0x0\" + value.substring(2);\n }\n return value;\n}\n*/\nexport function hexDataLength(data) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n return null;\n }\n return (data.length - 2) / 2;\n}\nexport function hexDataSlice(data, offset, endOffset) {\n if (typeof (data) !== \"string\") {\n data = hexlify(data);\n }\n else if (!isHexString(data) || (data.length % 2)) {\n logger.throwArgumentError(\"invalid hexData\", \"value\", data);\n }\n offset = 2 + 2 * offset;\n if (endOffset != null) {\n return \"0x\" + data.substring(offset, 2 + 2 * endOffset);\n }\n return \"0x\" + data.substring(offset);\n}\nexport function hexConcat(items) {\n let result = \"0x\";\n items.forEach((item) => {\n result += hexlify(item).substring(2);\n });\n return result;\n}\nexport function hexValue(value) {\n const trimmed = hexStripZeros(hexlify(value, { hexPad: \"left\" }));\n if (trimmed === \"0x\") {\n return \"0x0\";\n }\n return trimmed;\n}\nexport function hexStripZeros(value) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n value = value.substring(2);\n let offset = 0;\n while (offset < value.length && value[offset] === \"0\") {\n offset++;\n }\n return \"0x\" + value.substring(offset);\n}\nexport function hexZeroPad(value, length) {\n if (typeof (value) !== \"string\") {\n value = hexlify(value);\n }\n else if (!isHexString(value)) {\n logger.throwArgumentError(\"invalid hex string\", \"value\", value);\n }\n if (value.length > 2 * length + 2) {\n logger.throwArgumentError(\"value out of range\", \"value\", arguments[1]);\n }\n while (value.length < 2 * length + 2) {\n value = \"0x0\" + value.substring(2);\n }\n return value;\n}\nexport function splitSignature(signature) {\n const result = {\n r: \"0x\",\n s: \"0x\",\n _vs: \"0x\",\n recoveryParam: 0,\n v: 0,\n yParityAndS: \"0x\",\n compact: \"0x\"\n };\n if (isBytesLike(signature)) {\n let bytes = arrayify(signature);\n // Get the r, s and v\n if (bytes.length === 64) {\n // EIP-2098; pull the v from the top bit of s and clear it\n result.v = 27 + (bytes[32] >> 7);\n bytes[32] &= 0x7f;\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n }\n else if (bytes.length === 65) {\n result.r = hexlify(bytes.slice(0, 32));\n result.s = hexlify(bytes.slice(32, 64));\n result.v = bytes[64];\n }\n else {\n logger.throwArgumentError(\"invalid signature string\", \"signature\", signature);\n }\n // Allow a recid to be used as the v\n if (result.v < 27) {\n if (result.v === 0 || result.v === 1) {\n result.v += 27;\n }\n else {\n logger.throwArgumentError(\"signature invalid v byte\", \"signature\", signature);\n }\n }\n // Compute recoveryParam from v\n result.recoveryParam = 1 - (result.v % 2);\n // Compute _vs from recoveryParam and s\n if (result.recoveryParam) {\n bytes[32] |= 0x80;\n }\n result._vs = hexlify(bytes.slice(32, 64));\n }\n else {\n result.r = signature.r;\n result.s = signature.s;\n result.v = signature.v;\n result.recoveryParam = signature.recoveryParam;\n result._vs = signature._vs;\n // If the _vs is available, use it to populate missing s, v and recoveryParam\n // and verify non-missing s, v and recoveryParam\n if (result._vs != null) {\n const vs = zeroPad(arrayify(result._vs), 32);\n result._vs = hexlify(vs);\n // Set or check the recid\n const recoveryParam = ((vs[0] >= 128) ? 1 : 0);\n if (result.recoveryParam == null) {\n result.recoveryParam = recoveryParam;\n }\n else if (result.recoveryParam !== recoveryParam) {\n logger.throwArgumentError(\"signature recoveryParam mismatch _vs\", \"signature\", signature);\n }\n // Set or check the s\n vs[0] &= 0x7f;\n const s = hexlify(vs);\n if (result.s == null) {\n result.s = s;\n }\n else if (result.s !== s) {\n logger.throwArgumentError(\"signature v mismatch _vs\", \"signature\", signature);\n }\n }\n // Use recid and v to populate each other\n if (result.recoveryParam == null) {\n if (result.v == null) {\n logger.throwArgumentError(\"signature missing v and recoveryParam\", \"signature\", signature);\n }\n else if (result.v === 0 || result.v === 1) {\n result.recoveryParam = result.v;\n }\n else {\n result.recoveryParam = 1 - (result.v % 2);\n }\n }\n else {\n if (result.v == null) {\n result.v = 27 + result.recoveryParam;\n }\n else {\n const recId = (result.v === 0 || result.v === 1) ? result.v : (1 - (result.v % 2));\n if (result.recoveryParam !== recId) {\n logger.throwArgumentError(\"signature recoveryParam mismatch v\", \"signature\", signature);\n }\n }\n }\n if (result.r == null || !isHexString(result.r)) {\n logger.throwArgumentError(\"signature missing or invalid r\", \"signature\", signature);\n }\n else {\n result.r = hexZeroPad(result.r, 32);\n }\n if (result.s == null || !isHexString(result.s)) {\n logger.throwArgumentError(\"signature missing or invalid s\", \"signature\", signature);\n }\n else {\n result.s = hexZeroPad(result.s, 32);\n }\n const vs = arrayify(result.s);\n if (vs[0] >= 128) {\n logger.throwArgumentError(\"signature s out of range\", \"signature\", signature);\n }\n if (result.recoveryParam) {\n vs[0] |= 0x80;\n }\n const _vs = hexlify(vs);\n if (result._vs) {\n if (!isHexString(result._vs)) {\n logger.throwArgumentError(\"signature invalid _vs\", \"signature\", signature);\n }\n result._vs = hexZeroPad(result._vs, 32);\n }\n // Set or check the _vs\n if (result._vs == null) {\n result._vs = _vs;\n }\n else if (result._vs !== _vs) {\n logger.throwArgumentError(\"signature _vs mismatch v and s\", \"signature\", signature);\n }\n }\n result.yParityAndS = result._vs;\n result.compact = result.r + result.yParityAndS.substring(2);\n return result;\n}\nexport function joinSignature(signature) {\n signature = splitSignature(signature);\n return hexlify(concat([\n signature.r,\n signature.s,\n (signature.recoveryParam ? \"0x1c\" : \"0x1b\")\n ]));\n}\n//# sourceMappingURL=index.js.map","\"use strict\";\nimport hash from \"hash.js\";\n//const _ripemd160 = _hash.ripemd160;\nimport { arrayify } from \"@ethersproject/bytes\";\nimport { SupportedAlgorithm } from \"./types\";\nimport { Logger } from \"@ethersproject/logger\";\nimport { version } from \"./_version\";\nconst logger = new Logger(version);\nexport function ripemd160(data) {\n return \"0x\" + (hash.ripemd160().update(arrayify(data)).digest(\"hex\"));\n}\nexport function sha256(data) {\n return \"0x\" + (hash.sha256().update(arrayify(data)).digest(\"hex\"));\n}\nexport function sha512(data) {\n return \"0x\" + (hash.sha512().update(arrayify(data)).digest(\"hex\"));\n}\nexport function computeHmac(algorithm, key, data) {\n if (!SupportedAlgorithm[algorithm]) {\n logger.throwError(\"unsupported algorithm \" + algorithm, Logger.errors.UNSUPPORTED_OPERATION, {\n operation: \"hmac\",\n algorithm: algorithm\n });\n }\n return \"0x\" + hash.hmac(hash[algorithm], arrayify(key)).update(arrayify(data)).digest(\"hex\");\n}\n//# sourceMappingURL=sha2.js.map","export const version = \"sha2/5.7.0\";\n//# sourceMappingURL=_version.js.map",null,null,"\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.readBigUInt64LE = exports.readBigInt64LE = void 0;\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/errors.js#L758\nvar ERR_BUFFER_OUT_OF_BOUNDS = function () { return new Error('Attempt to access memory outside buffer bounds'); };\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/errors.js#L968\nvar ERR_INVALID_ARG_TYPE = function (name, expected, actual) {\n return new Error(\"The \\\"\" + name + \"\\\" argument must be of type \" + expected + \". Received \" + actual);\n};\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/errors.js#L1262\nvar ERR_OUT_OF_RANGE = function (str, range, received) {\n return new Error(\"The value of \\\"\" + str + \" is out of range. It must be \" + range + \". Received \" + received);\n};\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/validators.js#L127-L130\nfunction validateNumber(value, name) {\n if (typeof value !== 'number')\n throw ERR_INVALID_ARG_TYPE(name, 'number', value);\n}\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/buffer.js#L68-L80\nfunction boundsError(value, length) {\n if (Math.floor(value) !== value) {\n validateNumber(value, 'offset');\n throw ERR_OUT_OF_RANGE('offset', 'an integer', value);\n }\n if (length < 0)\n throw ERR_BUFFER_OUT_OF_BOUNDS();\n throw ERR_OUT_OF_RANGE('offset', \">= 0 and <= \" + length, value);\n}\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/buffer.js#L129-L145\nfunction readBigInt64LE(buffer, offset) {\n if (offset === void 0) { offset = 0; }\n validateNumber(offset, 'offset');\n var first = buffer[offset];\n var last = buffer[offset + 7];\n if (first === undefined || last === undefined)\n boundsError(offset, buffer.length - 8);\n // tslint:disable-next-line:no-bitwise\n var val = buffer[offset + 4] + buffer[offset + 5] * Math.pow(2, 8) + buffer[offset + 6] * Math.pow(2, 16) + (last << 24); // Overflow\n return ((BigInt(val) << BigInt(32)) + // tslint:disable-line:no-bitwise\n BigInt(first + buffer[++offset] * Math.pow(2, 8) + buffer[++offset] * Math.pow(2, 16) + buffer[++offset] * Math.pow(2, 24)));\n}\nexports.readBigInt64LE = readBigInt64LE;\n// https://github.com/nodejs/node/blob/v14.17.0/lib/internal/buffer.js#L89-L107\nfunction readBigUInt64LE(buffer, offset) {\n if (offset === void 0) { offset = 0; }\n validateNumber(offset, 'offset');\n var first = buffer[offset];\n var last = buffer[offset + 7];\n if (first === undefined || last === undefined)\n boundsError(offset, buffer.length - 8);\n var lo = first + buffer[++offset] * Math.pow(2, 8) + buffer[++offset] * Math.pow(2, 16) + buffer[++offset] * Math.pow(2, 24);\n var hi = buffer[++offset] + buffer[++offset] * Math.pow(2, 8) + buffer[++offset] * Math.pow(2, 16) + last * Math.pow(2, 24);\n return BigInt(lo) + (BigInt(hi) << BigInt(32)); // tslint:disable-line:no-bitwise\n}\nexports.readBigUInt64LE = readBigUInt64LE;\n","\"use strict\";\nvar __assign = (this && this.__assign) || function () {\n __assign = Object.assign || function(t) {\n for (var s, i = 1, n = arguments.length; i < n; i++) {\n s = arguments[i];\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))\n t[p] = s[p];\n }\n return t;\n };\n return __assign.apply(this, arguments);\n};\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythConnection = void 0;\nvar index_1 = require(\"./index\");\nvar ONES = '11111111111111111111111111111111';\n/**\n * Reads Pyth price data from a solana web3 connection. This class uses a callback-driven model,\n * similar to the solana web3 methods for tracking updates to accounts.\n */\nvar PythConnection = /** @class */ (function () {\n /** Create a PythConnection that reads its data from an underlying solana web3 connection.\n * pythProgramKey is the public key of the Pyth program running on the chosen solana cluster.\n */\n function PythConnection(connection, pythProgramKey, commitment, feedIds) {\n if (commitment === void 0) { commitment = 'finalized'; }\n this.productAccountKeyToProduct = {};\n this.priceAccountKeyToProductAccountKey = {};\n this.callbacks = [];\n this.connection = connection;\n this.pythProgramKey = pythProgramKey;\n this.commitment = commitment;\n this.feedIds = feedIds;\n }\n PythConnection.prototype.handleProductAccount = function (key, account, slot) {\n var productData = index_1.parseProductData(account.data);\n this.productAccountKeyToProduct[key.toString()] = {\n key: key,\n slot: slot,\n accountInfo: __assign(__assign({}, account), { data: productData }),\n };\n if (productData.priceAccountKey) {\n this.priceAccountKeyToProductAccountKey[productData.priceAccountKey.toString()] = key.toString();\n }\n };\n PythConnection.prototype.handlePriceAccount = function (key, account, slot) {\n var productUpdate = this.productAccountKeyToProduct[this.priceAccountKeyToProductAccountKey[key.toString()]];\n if (productUpdate === undefined) {\n // This shouldn't happen since we're subscribed to all of the program's accounts,\n // but let's be good defensive programmers.\n throw new Error('Got a price update for an unknown product. This is a bug in the library, please report it to the developers.');\n }\n var priceData = index_1.parsePriceData(account.data, slot);\n var priceUpdate = {\n key: key,\n slot: slot,\n accountInfo: __assign(__assign({}, account), { data: priceData }),\n };\n for (var _i = 0, _a = this.callbacks; _i < _a.length; _i++) {\n var callback = _a[_i];\n callback(productUpdate, priceUpdate);\n }\n };\n PythConnection.prototype.handleAccount = function (key, account, productOnly, slot) {\n var base = index_1.parseBaseData(account.data);\n // The pyth program owns accounts that don't contain pyth data, which we can safely ignore.\n if (base) {\n switch (base.type) {\n case index_1.AccountType.Mapping:\n // We can skip these because we're going to get every account owned by this program anyway.\n break;\n case index_1.AccountType.Product:\n this.handleProductAccount(key, account, slot);\n break;\n case index_1.AccountType.Price:\n if (!productOnly) {\n this.handlePriceAccount(key, account, slot);\n }\n break;\n case index_1.AccountType.Test:\n case index_1.AccountType.Permission:\n break;\n default:\n throw new Error(\"Unknown account type: \" + base.type + \". Try upgrading pyth-client.\");\n }\n }\n };\n /** Start receiving price updates. Once this method is called, any registered callbacks will be invoked\n * each time a Pyth price account is updated.\n */\n PythConnection.prototype.start = function () {\n return __awaiter(this, void 0, void 0, function () {\n var accSlotProm, accounts, currentSlot, _i, accounts_1, account, rawIDs_1, _loop_1, this_1, _a, accounts_2, account;\n var _this = this;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0: return [4 /*yield*/, Promise.all([\n this.connection.getProgramAccounts(this.pythProgramKey, this.commitment),\n this.connection.getSlot(this.commitment),\n ])];\n case 1:\n accSlotProm = _b.sent();\n accounts = accSlotProm[0];\n currentSlot = accSlotProm[1];\n // Handle all accounts once since we need to handle product accounts\n // at least once\n for (_i = 0, accounts_1 = accounts; _i < accounts_1.length; _i++) {\n account = accounts_1[_i];\n this.handleAccount(account.pubkey, account.account, true, currentSlot);\n }\n if (this.feedIds) {\n rawIDs_1 = this.feedIds.map(function (feed) { return feed.toString(); });\n accounts = accounts.filter(function (feed) { return rawIDs_1.includes(feed.pubkey.toString()); });\n _loop_1 = function (account) {\n this_1.connection.onAccountChange(account.pubkey, function (accountInfo, context) {\n _this.handleAccount(account.pubkey, accountInfo, false, context.slot);\n }, this_1.commitment);\n };\n this_1 = this;\n for (_a = 0, accounts_2 = accounts; _a < accounts_2.length; _a++) {\n account = accounts_2[_a];\n _loop_1(account);\n }\n }\n else {\n this.connection.onProgramAccountChange(this.pythProgramKey, function (keyedAccountInfo, context) {\n _this.handleAccount(keyedAccountInfo.accountId, keyedAccountInfo.accountInfo, false, context.slot);\n }, this.commitment);\n }\n return [2 /*return*/];\n }\n });\n });\n };\n /** Register callback to receive price updates. */\n PythConnection.prototype.onPriceChange = function (callback) {\n this.callbacks.push(function (product, price) { return callback(product.accountInfo.data.product, price.accountInfo.data); });\n };\n /** Register a verbose callback to receive price updates. */\n PythConnection.prototype.onPriceChangeVerbose = function (callback) {\n this.callbacks.push(callback);\n };\n /** Stop receiving price updates. Note that this also currently deletes all registered callbacks. */\n PythConnection.prototype.stop = function () {\n return __awaiter(this, void 0, void 0, function () {\n return __generator(this, function (_a) {\n // There's no way to actually turn off the solana web3 subscription x_x, but there should be.\n // Leave this method in so we don't have to update our API when solana fixes theirs.\n // In the interim, delete callbacks.\n this.callbacks = [];\n return [2 /*return*/];\n });\n });\n };\n return PythConnection;\n}());\nexports.PythConnection = PythConnection;\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythHttpClient = void 0;\nvar _1 = require(\".\");\n/**\n * Reads Pyth price data from a solana web3 connection. This class uses a single HTTP call.\n * Use the method getData() to get updated prices values.\n */\nvar PythHttpClient = /** @class */ (function () {\n function PythHttpClient(connection, pythProgramKey, commitment) {\n if (commitment === void 0) { commitment = 'finalized'; }\n this.connection = connection;\n this.pythProgramKey = pythProgramKey;\n this.commitment = commitment;\n }\n /*\n * Get Pyth Network account information and return actual price state.\n * The result contains lists of asset types, product symbols and their prices.\n */\n PythHttpClient.prototype.getData = function () {\n return __awaiter(this, void 0, void 0, function () {\n var assetTypes, productSymbols, products, productFromSymbol, productPrice, prices, _a, accountList, currentSlot, priceDataQueue, productAccountKeyToProduct, permissionData, result;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0:\n assetTypes = new Set();\n productSymbols = new Set();\n products = new Set();\n productFromSymbol = new Map();\n productPrice = new Map();\n prices = new Array();\n return [4 /*yield*/, Promise.all([\n this.connection.getProgramAccounts(this.pythProgramKey, this.commitment),\n this.connection.getSlot(this.commitment),\n ])\n // Populate products and prices\n ];\n case 1:\n _a = _b.sent(), accountList = _a[0], currentSlot = _a[1];\n priceDataQueue = new Array();\n productAccountKeyToProduct = new Map();\n accountList.forEach(function (singleAccount) {\n var base = _1.parseBaseData(singleAccount.account.data);\n if (base) {\n switch (base.type) {\n case _1.AccountType.Mapping:\n // We can skip these because we're going to get every account owned by this program anyway.\n break;\n case _1.AccountType.Product:\n var productData = _1.parseProductData(singleAccount.account.data);\n productAccountKeyToProduct.set(singleAccount.pubkey.toBase58(), productData.product);\n assetTypes.add(productData.product.asset_type);\n productSymbols.add(productData.product.symbol);\n products.add(productData.product);\n productFromSymbol.set(productData.product.symbol, productData.product);\n break;\n case _1.AccountType.Price:\n var priceData = _1.parsePriceData(singleAccount.account.data, currentSlot);\n priceDataQueue.push(priceData);\n break;\n case _1.AccountType.Test:\n break;\n case _1.AccountType.Permission:\n permissionData = _1.parsePermissionData(singleAccount.account.data);\n break;\n default:\n throw new Error(\"Unknown account type: \" + base.type + \". Try upgrading pyth-client.\");\n }\n }\n });\n priceDataQueue.forEach(function (priceData) {\n var product = productAccountKeyToProduct.get(priceData.productAccountKey.toBase58());\n if (product) {\n productPrice.set(product.symbol, priceData);\n prices.push(priceData);\n }\n });\n result = {\n assetTypes: Array.from(assetTypes),\n symbols: Array.from(productSymbols),\n products: Array.from(products),\n productFromSymbol: productFromSymbol,\n productPrice: productPrice,\n prices: prices,\n permissionData: permissionData,\n };\n return [2 /*return*/, result];\n }\n });\n });\n };\n /**\n * Get the price state for an array of specified price accounts.\n * The result is the price state for the given assets if they exist, throws if at least one account does not exist.\n */\n PythHttpClient.prototype.getAssetPricesFromAccounts = function (priceAccounts) {\n return __awaiter(this, void 0, void 0, function () {\n var priceDatas, _a, accountInfos, currentSlot, i, accInfo, baseData, priceData;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0:\n priceDatas = [];\n return [4 /*yield*/, Promise.all([\n this.connection.getMultipleAccountsInfo(priceAccounts, this.commitment),\n this.connection.getSlot(this.commitment),\n ])];\n case 1:\n _a = _b.sent(), accountInfos = _a[0], currentSlot = _a[1];\n for (i = 0; i < priceAccounts.length; i++) {\n accInfo = accountInfos[i];\n if (!accInfo) {\n throw new Error('Could not get account info for account ' + priceAccounts[i].toBase58());\n }\n baseData = _1.parseBaseData(accInfo.data);\n if (baseData === undefined || baseData.type !== _1.AccountType.Price) {\n throw new Error('Account ' + priceAccounts[i].toBase58() + ' is not a price account');\n }\n priceData = _1.parsePriceData(accInfo.data, currentSlot);\n priceDatas.push(priceData);\n }\n return [2 /*return*/, priceDatas];\n }\n });\n });\n };\n return PythHttpClient;\n}());\nexports.PythHttpClient = PythHttpClient;\n","var basex = require('base-x')\nvar ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","'use strict';\n\nconst UPPERCASE = /[\\p{Lu}]/u;\nconst LOWERCASE = /[\\p{Ll}]/u;\nconst LEADING_CAPITAL = /^[\\p{Lu}](?![\\p{Lu}])/gu;\nconst IDENTIFIER = /([\\p{Alpha}\\p{N}_]|$)/u;\nconst SEPARATORS = /[_.\\- ]+/;\n\nconst LEADING_SEPARATORS = new RegExp('^' + SEPARATORS.source);\nconst SEPARATORS_AND_IDENTIFIER = new RegExp(SEPARATORS.source + IDENTIFIER.source, 'gu');\nconst NUMBERS_AND_IDENTIFIER = new RegExp('\\\\d+' + IDENTIFIER.source, 'gu');\n\nconst preserveCamelCase = (string, toLowerCase, toUpperCase) => {\n\tlet isLastCharLower = false;\n\tlet isLastCharUpper = false;\n\tlet isLastLastCharUpper = false;\n\n\tfor (let i = 0; i < string.length; i++) {\n\t\tconst character = string[i];\n\n\t\tif (isLastCharLower && UPPERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i) + '-' + string.slice(i);\n\t\t\tisLastCharLower = false;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = true;\n\t\t\ti++;\n\t\t} else if (isLastCharUpper && isLastLastCharUpper && LOWERCASE.test(character)) {\n\t\t\tstring = string.slice(0, i - 1) + '-' + string.slice(i - 1);\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = false;\n\t\t\tisLastCharLower = true;\n\t\t} else {\n\t\t\tisLastCharLower = toLowerCase(character) === character && toUpperCase(character) !== character;\n\t\t\tisLastLastCharUpper = isLastCharUpper;\n\t\t\tisLastCharUpper = toUpperCase(character) === character && toLowerCase(character) !== character;\n\t\t}\n\t}\n\n\treturn string;\n};\n\nconst preserveConsecutiveUppercase = (input, toLowerCase) => {\n\tLEADING_CAPITAL.lastIndex = 0;\n\n\treturn input.replace(LEADING_CAPITAL, m1 => toLowerCase(m1));\n};\n\nconst postProcess = (input, toUpperCase) => {\n\tSEPARATORS_AND_IDENTIFIER.lastIndex = 0;\n\tNUMBERS_AND_IDENTIFIER.lastIndex = 0;\n\n\treturn input.replace(SEPARATORS_AND_IDENTIFIER, (_, identifier) => toUpperCase(identifier))\n\t\t.replace(NUMBERS_AND_IDENTIFIER, m => toUpperCase(m));\n};\n\nconst camelCase = (input, options) => {\n\tif (!(typeof input === 'string' || Array.isArray(input))) {\n\t\tthrow new TypeError('Expected the input to be `string | string[]`');\n\t}\n\n\toptions = {\n\t\tpascalCase: false,\n\t\tpreserveConsecutiveUppercase: false,\n\t\t...options\n\t};\n\n\tif (Array.isArray(input)) {\n\t\tinput = input.map(x => x.trim())\n\t\t\t.filter(x => x.length)\n\t\t\t.join('-');\n\t} else {\n\t\tinput = input.trim();\n\t}\n\n\tif (input.length === 0) {\n\t\treturn '';\n\t}\n\n\tconst toLowerCase = options.locale === false ?\n\t\tstring => string.toLowerCase() :\n\t\tstring => string.toLocaleLowerCase(options.locale);\n\tconst toUpperCase = options.locale === false ?\n\t\tstring => string.toUpperCase() :\n\t\tstring => string.toLocaleUpperCase(options.locale);\n\n\tif (input.length === 1) {\n\t\treturn options.pascalCase ? toUpperCase(input) : toLowerCase(input);\n\t}\n\n\tconst hasUpperCase = input !== toLowerCase(input);\n\n\tif (hasUpperCase) {\n\t\tinput = preserveCamelCase(input, toLowerCase, toUpperCase);\n\t}\n\n\tinput = input.replace(LEADING_SEPARATORS, '');\n\n\tif (options.preserveConsecutiveUppercase) {\n\t\tinput = preserveConsecutiveUppercase(input, toLowerCase);\n\t} else {\n\t\tinput = toLowerCase(input);\n\t}\n\n\tif (options.pascalCase) {\n\t\tinput = toUpperCase(input.charAt(0)) + input.slice(1);\n\t}\n\n\treturn postProcess(input, toUpperCase);\n};\n\nmodule.exports = camelCase;\n// TODO: Remove this for the next major release\nmodule.exports.default = camelCase;\n","/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Support for translating between Buffer instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n * format} with {@link module:Layout.u8|8-bit}, {@link\n * module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n * {@link module:Layout.u32|32-bit}, {@link\n * module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n * representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n * format} with {@link module:Layout.u16be|16-bit}, {@link\n * module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n * {@link module:Layout.u40be|40-bit}, and {@link\n * module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n * format} with {@link module:Layout.s8|8-bit}, {@link\n * module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n * {@link module:Layout.s32|32-bit}, {@link\n * module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n * representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n * with {@link module:Layout.s16be|16-bit}, {@link\n * module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n * {@link module:Layout.s40be|40-bit}, and {@link\n * module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n * less than 2^53) or nearby integral Number in {@link\n * module:Layout.nu64|unsigned little-endian}, {@link\n * module:Layout.nu64be|unsigned big-endian}, {@link\n * module:Layout.ns64|signed little-endian}, and {@link\n * module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n * module:Layout.f32|little-endian} and {@link\n * module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n * module:Layout.f64|little-endian} and {@link\n * module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n * encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n * module:Layout~Layout|Layout}, with JavaScript representation as\n * an Array and constant or data-dependent {@link\n * module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n * heterogeneous sequence of {@link module:Layout~Layout|Layout}\n * instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n * module:Layout~VariantLayout|variant layouts} over a fixed\n * (padded) or variable (not padded) span of bytes, using an\n * unsigned integer at the start of the data or a separate {@link\n * module:Layout.unionLayoutDiscriminator|layout element} to\n * determine which layout to use when interpreting the buffer\n * contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n * of individual {@link\n * module:Layout~BitStructure#addField|BitField}s packed into an 8,\n * 16, 24, or 32-bit unsigned integer starting at the least- or\n * most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n * module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n\n'use strict';\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}. The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n constructor(span, property) {\n if (!Number.isInteger(span)) {\n throw new TypeError('span must be an integer');\n }\n\n /** The span of the layout in bytes.\n *\n * Positive values are generally expected.\n *\n * Zero will only appear in {@link Constant}s and in {@link\n * Sequence}s where the {@link Sequence#count|count} is zero.\n *\n * A negative value indicates that the span is value-specific, and\n * must be obtained using {@link Layout#getSpan|getSpan}. */\n this.span = span;\n\n /** The property name used when this layout is represented in an\n * Object.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances. If left undefined the span of the unnamed layout will\n * be treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n\n /** Function to create an Object into which decoded properties will\n * be written.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances, which means:\n * * {@link Structure}\n * * {@link Union}\n * * {@link VariantLayout}\n * * {@link BitStructure}\n *\n * If left undefined the JavaScript representation of these layouts\n * will be Object instances.\n *\n * See {@link bindConstructorLayout}.\n */\n makeDestinationObject() {\n return {};\n }\n\n /**\n * Decode from a Buffer into an JavaScript value.\n *\n * @param {Buffer} b - the buffer from which encoded data is read.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {(Number|Array|Object)} - the value of the decoded data.\n *\n * @abstract\n */\n decode(b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Encode a JavaScript value into a Buffer.\n *\n * @param {(Number|Array|Object)} src - the value to be encoded into\n * the buffer. The type accepted depends on the (sub-)type of {@link\n * Layout}.\n *\n * @param {Buffer} b - the buffer into which encoded data will be\n * written.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {Number} - the number of bytes encoded, including the\n * space skipped for internal padding, but excluding data such as\n * {@link Sequence#count|lengths} when stored {@link\n * ExternalLayout|externally}. This is the adjustment to `offset`\n * producing the offset where data for the next layout would be\n * written.\n *\n * @abstract\n */\n encode(src, b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Calculate the span of a specific instance of a layout.\n *\n * @param {Buffer} b - the buffer that contains an encoded instance.\n *\n * @param {Number} [offset] - the offset at which the encoded instance\n * starts. If absent a zero offset is inferred.\n *\n * @return {Number} - the number of bytes covered by the layout\n * instance. If this method is not overridden in a subclass the\n * definition-time constant {@link Layout#span|span} will be\n * returned.\n *\n * @throws {RangeError} - if the length of the value cannot be\n * determined.\n */\n getSpan(b, offset) {\n if (0 > this.span) {\n throw new RangeError('indeterminate span');\n }\n return this.span;\n }\n\n /**\n * Replicate the layout using a new property.\n *\n * This function must be used to get a structurally-equivalent layout\n * with a different name since all {@link Layout} instances are\n * immutable.\n *\n * **NOTE** This is a shallow copy. All fields except {@link\n * Layout#property|property} are strictly equal to the origin layout.\n *\n * @param {String} property - the value for {@link\n * Layout#property|property} in the replica.\n *\n * @returns {Layout} - the copy with {@link Layout#property|property}\n * set to `property`.\n */\n replicate(property) {\n const rv = Object.create(this.constructor.prototype);\n Object.assign(rv, this);\n rv.property = property;\n return rv;\n }\n\n /**\n * Create an object from layout properties and an array of values.\n *\n * **NOTE** This function returns `undefined` if invoked on a layout\n * that does not return its value as an Object. Objects are\n * returned for things that are a {@link Structure}, which includes\n * {@link VariantLayout|variant layouts} if they are structures, and\n * excludes {@link Union}s. If you want this feature for a union\n * you must use {@link Union.getVariant|getVariant} to select the\n * desired layout.\n *\n * @param {Array} values - an array of values that correspond to the\n * default order for properties. As with {@link Layout#decode|decode}\n * layout elements that have no property name are skipped when\n * iterating over the array values. Only the top-level properties are\n * assigned; arguments are not assigned to properties of contained\n * layouts. Any unused values are ignored.\n *\n * @return {(Object|undefined)}\n */\n fromArray(values) {\n return undefined;\n }\n}\nexports.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n if (lo.property) {\n return name + '[' + lo.property + ']';\n }\n return name;\n}\nexports.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n * to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n * property of `layout` is set to a function that returns a `new\n * Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n * delegates to {@link Layout#decode|layout.decode}. The\n * synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n * function that delegates to {@link Layout#encode|layout.encode}\n * with `src` set to `this`. The synthesized function may be\n * captured and extended, but when the extension is invoked `this`\n * must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n if ('function' !== typeof Class) {\n throw new TypeError('Class must be constructor');\n }\n if (Class.hasOwnProperty('layout_')) {\n throw new Error('Class is already bound to a layout');\n }\n if (!(layout && (layout instanceof Layout))) {\n throw new TypeError('layout must be a Layout');\n }\n if (layout.hasOwnProperty('boundConstructor_')) {\n throw new Error('layout is already bound to a constructor');\n }\n Class.layout_ = layout;\n layout.boundConstructor_ = Class;\n layout.makeDestinationObject = (() => new Class());\n Object.defineProperty(Class.prototype, 'encode', {\n value: function(b, offset) {\n return layout.encode(this, b, offset);\n },\n writable: true,\n });\n Object.defineProperty(Class, 'decode', {\n value: function(b, offset) {\n return layout.decode(b, offset);\n },\n writable: true,\n });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n /**\n * Return `true` iff the external layout decodes to an unsigned\n * integer layout.\n *\n * In that case it can be used as the source of {@link\n * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n * or as {@link UnionLayoutDiscriminator#layout|external union\n * discriminators}.\n *\n * @abstract\n */\n isCount() {\n throw new Error('ExternalLayout is abstract');\n }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n constructor(elementSpan, property) {\n if (undefined === elementSpan) {\n elementSpan = 1;\n }\n if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n throw new TypeError('elementSpan must be a (positive) integer');\n }\n super(-1, property);\n\n /** The layout for individual elements of the sequence. The value\n * must be a positive integer. If not provided, the value will be\n * 1. */\n this.elementSpan = elementSpan;\n }\n\n /** @override */\n isCount() {\n return true;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const rem = b.length - offset;\n return Math.floor(rem / this.elementSpan);\n }\n\n /** @override */\n encode(src, b, offset) {\n return 0;\n }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout. The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}. Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}. If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n constructor(layout, offset, property) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n\n if (undefined === offset) {\n offset = 0;\n } else if (!Number.isInteger(offset)) {\n throw new TypeError('offset must be integer or undefined');\n }\n\n super(layout.span, property || layout.property);\n\n /** The subordinated layout. */\n this.layout = layout;\n\n /** The location of {@link OffsetLayout#layout} relative to the\n * start of another layout.\n *\n * The value may be positive or negative, but an error will thrown\n * if at the point of use it goes outside the span of the Buffer\n * being accessed. */\n this.offset = offset;\n }\n\n /** @override */\n isCount() {\n return ((this.layout instanceof UInt)\n || (this.layout instanceof UIntBE));\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.decode(b, offset + this.offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.encode(src, b, offset + this.offset);\n }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n * module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n * module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n * module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntLE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntLE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n constructor(span, property) {\n super( span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntBE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntBE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n * module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n * module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n * module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readIntLE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeIntLE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readIntBE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeIntBE(src, offset, this.span);\n return this.span;\n }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n const hi32 = Math.floor(src / V2E32);\n const lo32 = src - (hi32 * V2E32);\n return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readUInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeUInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const hi32 = b.readUInt32BE(offset);\n const lo32 = b.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32BE(split.hi32, offset);\n b.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const hi32 = b.readInt32BE(offset);\n const lo32 = b.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeInt32BE(split.hi32, offset);\n b.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n constructor(property) {\n super(4, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readFloatLE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeFloatLE(src, offset);\n return 4;\n }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n constructor(property) {\n super(4, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readFloatBE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeFloatBE(src, offset);\n return 4;\n }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readDoubleLE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeDoubleLE(src, offset);\n return 8;\n }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readDoubleBE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeDoubleBE(src, offset);\n return 8;\n }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}. The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n constructor(elementLayout, count, property) {\n if (!(elementLayout instanceof Layout)) {\n throw new TypeError('elementLayout must be a Layout');\n }\n if (!(((count instanceof ExternalLayout) && count.isCount())\n || (Number.isInteger(count) && (0 <= count)))) {\n throw new TypeError('count must be non-negative integer '\n + 'or an unsigned integer ExternalLayout');\n }\n let span = -1;\n if ((!(count instanceof ExternalLayout))\n && (0 < elementLayout.span)) {\n span = count * elementLayout.span;\n }\n\n super(span, property);\n\n /** The layout for individual elements of the sequence. */\n this.elementLayout = elementLayout;\n\n /** The number of elements in the sequence.\n *\n * This will be either a non-negative integer or an instance of\n * {@link ExternalLayout} for which {@link\n * ExternalLayout#isCount|isCount()} is `true`. */\n this.count = count;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let span = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n if (0 < this.elementLayout.span) {\n span = count * this.elementLayout.span;\n } else {\n let idx = 0;\n while (idx < count) {\n span += this.elementLayout.getSpan(b, offset + span);\n ++idx;\n }\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const rv = [];\n let i = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n while (i < count) {\n rv.push(this.elementLayout.decode(b, offset));\n offset += this.elementLayout.getSpan(b, offset);\n i += 1;\n }\n return rv;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n *\n * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n * the unused space in the buffer is left unchanged. If `src` is\n * longer than {@link Sequence#count|count} the unneeded elements are\n * ignored.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const elo = this.elementLayout;\n const span = src.reduce((span, v) => {\n return span + elo.encode(v, b, offset + span);\n }, 0);\n if (this.count instanceof ExternalLayout) {\n this.count.encode(src.length, b, offset);\n }\n return span;\n }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span. When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage. We can only identify the value\n * for a field when it has a {@link Layout#property|property}. As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}. An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n constructor(fields, property, decodePrefixes) {\n if (!(Array.isArray(fields)\n && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n throw new TypeError('fields must be array of Layout instances');\n }\n if (('boolean' === typeof property)\n && (undefined === decodePrefixes)) {\n decodePrefixes = property;\n property = undefined;\n }\n\n /* Verify absence of unnamed variable-length fields. */\n for (const fd of fields) {\n if ((0 > fd.span)\n && (undefined === fd.property)) {\n throw new Error('fields cannot contain unnamed variable-length layout');\n }\n }\n\n let span = -1;\n try {\n span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n } catch (e) {\n }\n super(span, property);\n\n /** The sequence of {@link Layout} values that comprise the\n * structure.\n *\n * The individual elements need not be the same type, and may be\n * either scalar or aggregate layouts. If a member layout leaves\n * its {@link Layout#property|property} undefined the\n * corresponding region of the buffer associated with the element\n * will not be mutated.\n *\n * @type {Layout[]} */\n this.fields = fields;\n\n /** Control behavior of {@link Layout#decode|decode()} given short\n * buffers.\n *\n * In some situations a structure many be extended with additional\n * fields over time, with older installations providing only a\n * prefix of the full structure. If this property is `true`\n * decoding will accept those buffers and leave subsequent fields\n * undefined, as long as the buffer ends at a field boundary.\n * Defaults to `false`. */\n this.decodePrefixes = !!decodePrefixes;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let span = 0;\n try {\n span = this.fields.reduce((span, fd) => {\n const fsp = fd.getSpan(b, offset);\n offset += fsp;\n return span + fsp;\n }, 0);\n } catch (e) {\n throw new RangeError('indeterminate span');\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(b, offset);\n }\n offset += fd.getSpan(b, offset);\n if (this.decodePrefixes\n && (b.length === offset)) {\n break;\n }\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Structure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the buffer is\n * left unmodified. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const firstOffset = offset;\n let lastOffset = 0;\n let lastWrote = 0;\n for (const fd of this.fields) {\n let span = fd.span;\n lastWrote = (0 < span) ? span : 0;\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n lastWrote = fd.encode(fv, b, offset);\n if (0 > span) {\n /* Read the as-encoded span, which is not necessarily the\n * same as what we wrote. */\n span = fd.getSpan(b, offset);\n }\n }\n }\n lastOffset = offset;\n offset += span;\n }\n /* Use (lastOffset + lastWrote) instead of offset because the last\n * item may have had a dynamic length and we don't want to include\n * the padding between it and the end of the space reserved for\n * it. */\n return (lastOffset + lastWrote) - firstOffset;\n }\n\n /** @override */\n fromArray(values) {\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if ((undefined !== fd.property)\n && (0 < values.length)) {\n dest[fd.property] = values.shift();\n }\n }\n return dest;\n }\n\n /**\n * Get access to the layout of a given property.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Layout} - the layout associated with `property`, or\n * undefined if there is no such property.\n */\n layoutFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n }\n\n /**\n * Get the offset of a structure member.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Number} - the offset in bytes to the start of `property`\n * within the structure, or undefined if `property` is not a field\n * within the structure. If the property is a member but follows a\n * variable-length structure member a negative number will be\n * returned.\n */\n offsetOf(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n let offset = 0;\n for (const fd of this.fields) {\n if (fd.property === property) {\n return offset;\n }\n if (0 > fd.span) {\n offset = -1;\n } else if (0 <= offset) {\n offset += fd.span;\n }\n }\n }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n constructor(property) {\n /** The {@link Layout#property|property} to be used when the\n * discriminator is referenced in isolation (generally when {@link\n * Union#decode|Union decode} cannot delegate to a specific\n * variant). */\n this.property = property;\n }\n\n /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n *\n * The implementation of this method need not reference the buffer if\n * variant information is available through other means. */\n decode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n\n /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n *\n * The implementation of this method need not store the value if\n * variant information is maintained through other means. */\n encode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}. Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n constructor(layout, property) {\n if (!((layout instanceof ExternalLayout)\n && layout.isCount())) {\n throw new TypeError('layout must be an unsigned integer ExternalLayout');\n }\n\n super(property || layout.property || 'variant');\n\n /** The {@link ExternalLayout} used to access the discriminator\n * value. */\n this.layout = layout;\n }\n\n /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n decode(b, offset) {\n return this.layout.decode(b, offset);\n }\n\n /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n encode(src, b, offset) {\n return this.layout.encode(src, b, offset);\n }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}. The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}. If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used). The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents. The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}). When a non-external layout element is passed the layout\n * appears at the start of the union. In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}. If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception. A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n constructor(discr, defaultLayout, property) {\n const upv = ((discr instanceof UInt)\n || (discr instanceof UIntBE));\n if (upv) {\n discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n } else if ((discr instanceof ExternalLayout)\n && discr.isCount()) {\n discr = new UnionLayoutDiscriminator(discr);\n } else if (!(discr instanceof UnionDiscriminator)) {\n throw new TypeError('discr must be a UnionDiscriminator '\n + 'or an unsigned integer layout');\n }\n if (undefined === defaultLayout) {\n defaultLayout = null;\n }\n if (!((null === defaultLayout)\n || (defaultLayout instanceof Layout))) {\n throw new TypeError('defaultLayout must be null or a Layout');\n }\n if (null !== defaultLayout) {\n if (0 > defaultLayout.span) {\n throw new Error('defaultLayout must have constant span');\n }\n if (undefined === defaultLayout.property) {\n defaultLayout = defaultLayout.replicate('content');\n }\n }\n\n /* The union span can be estimated only if there's a default\n * layout. The union spans its default layout, plus any prefix\n * variant layout. By construction both layouts, if present, have\n * non-negative span. */\n let span = -1;\n if (defaultLayout) {\n span = defaultLayout.span;\n if ((0 <= span) && upv) {\n span += discr.layout.span;\n }\n }\n super(span, property);\n\n /** The interface for the discriminator value in isolation.\n *\n * This a {@link UnionDiscriminator} either passed to the\n * constructor or synthesized from the `discr` constructor\n * argument. {@link\n * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n * `true` iff the `discr` parameter was a non-offset {@link\n * Layout} instance. */\n this.discriminator = discr;\n\n /** `true` if the {@link Union#discriminator|discriminator} is the\n * first field in the union.\n *\n * If `false` the discriminator is obtained from somewhere\n * else. */\n this.usesPrefixDiscriminator = upv;\n\n /** The layout for non-discriminator content when the value of the\n * discriminator is not recognized.\n *\n * This is the value passed to the constructor. It is\n * structurally equivalent to the second component of {@link\n * Union#layout|layout} but may have a different property\n * name. */\n this.defaultLayout = defaultLayout;\n\n /** A registry of allowed variants.\n *\n * The keys are unsigned integers which should be compatible with\n * {@link Union.discriminator|discriminator}. The property value\n * is the corresponding {@link VariantLayout} instances assigned\n * to this union by {@link Union#addVariant|addVariant}.\n *\n * **NOTE** The registry remains mutable so that variants can be\n * {@link Union#addVariant|added} at any time. Users should not\n * manipulate the content of this property. */\n this.registry = {};\n\n /* Private variable used when invoking getSourceVariant */\n let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n /** Function to infer the variant selected by a source object.\n *\n * Defaults to {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n * be overridden using {@link\n * Union#configGetSourceVariant|configGetSourceVariant}.\n *\n * @param {Object} src - as with {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * @returns {(undefined|VariantLayout)} The default variant\n * (`undefined`) or first registered variant that uses a property\n * available in `src`. */\n this.getSourceVariant = function(src) {\n return boundGetSourceVariant(src);\n };\n\n /** Function to override the implementation of {@link\n * Union#getSourceVariant|getSourceVariant}.\n *\n * Use this if the desired variant cannot be identified using the\n * algorithm of {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * **NOTE** The provided function will be invoked bound to this\n * Union instance, providing local access to {@link\n * Union#registry|registry}.\n *\n * @param {Function} gsv - a function that follows the API of\n * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n this.configGetSourceVariant = function(gsv) {\n boundGetSourceVariant = gsv.bind(this);\n };\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n /* Default layouts always have non-negative span, so we don't have\n * one and we have to recognize the variant which will in turn\n * determine the span. */\n const vlo = this.getVariant(b, offset);\n if (!vlo) {\n throw new Error('unable to determine span for unrecognized variant');\n }\n return vlo.getSpan(b, offset);\n }\n\n /**\n * Method to infer a registered Union variant compatible with `src`.\n *\n * The first satisified rule in the following sequence defines the\n * return value:\n * * If `src` has properties matching the Union discriminator and\n * the default layout, `undefined` is returned regardless of the\n * value of the discriminator property (this ensures the default\n * layout will be used);\n * * If `src` has a property matching the Union discriminator, the\n * value of the discriminator identifies a registered variant, and\n * either (a) the variant has no layout, or (b) `src` has the\n * variant's property, then the variant is returned (because the\n * source satisfies the constraints of the variant it identifies);\n * * If `src` does not have a property matching the Union\n * discriminator, but does have a property matching a registered\n * variant, then the variant is returned (because the source\n * matches a variant without an explicit conflict);\n * * An error is thrown (because we either can't identify a variant,\n * or we were explicitly told the variant but can't satisfy it).\n *\n * @param {Object} src - an object presumed to be compatible with\n * the content of the Union.\n *\n * @return {(undefined|VariantLayout)} - as described above.\n *\n * @throws {Error} - if `src` cannot be associated with a default or\n * registered variant.\n */\n defaultGetSourceVariant(src) {\n if (src.hasOwnProperty(this.discriminator.property)) {\n if (this.defaultLayout\n && src.hasOwnProperty(this.defaultLayout.property)) {\n return undefined;\n }\n const vlo = this.registry[src[this.discriminator.property]];\n if (vlo\n && ((!vlo.layout)\n || src.hasOwnProperty(vlo.property))) {\n return vlo;\n }\n } else {\n for (const tag in this.registry) {\n const vlo = this.registry[tag];\n if (src.hasOwnProperty(vlo.property)) {\n return vlo;\n }\n }\n }\n throw new Error('unable to infer src variant');\n }\n\n /** Implement {@link Layout#decode|decode} for {@link Union}.\n *\n * If the variant is {@link Union#addVariant|registered} the return\n * value is an instance of that variant, with no explicit\n * discriminator. Otherwise the {@link Union#defaultLayout|default\n * layout} is used to decode the content. */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let dest;\n const dlo = this.discriminator;\n const discr = dlo.decode(b, offset);\n let clo = this.registry[discr];\n if (undefined === clo) {\n let contentOffset = 0;\n clo = this.defaultLayout;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dest = this.makeDestinationObject();\n dest[dlo.property] = discr;\n dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n } else {\n dest = clo.decode(b, offset);\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Union}.\n *\n * This API assumes the `src` object is consistent with the union's\n * {@link Union#defaultLayout|default layout}. To encode variants\n * use the appropriate variant-specific {@link VariantLayout#encode}\n * method. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const vlo = this.getSourceVariant(src);\n if (undefined === vlo) {\n const dlo = this.discriminator;\n const clo = this.defaultLayout;\n let contentOffset = 0;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dlo.encode(src[dlo.property], b, offset);\n return contentOffset + clo.encode(src[clo.property], b,\n offset + contentOffset);\n }\n return vlo.encode(src, b, offset);\n }\n\n /** Register a new variant structure within a union. The newly\n * created variant is returned.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} layout - initializer for {@link\n * VariantLayout#layout|layout}.\n *\n * @param {String} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {VariantLayout} */\n addVariant(variant, layout, property) {\n const rv = new VariantLayout(this, variant, layout, property);\n this.registry[variant] = rv;\n return rv;\n }\n\n /**\n * Get the layout associated with a registered variant.\n *\n * If `vb` does not produce a registered variant the function returns\n * `undefined`.\n *\n * @param {(Number|Buffer)} vb - either the variant number, or a\n * buffer from which the discriminator is to be read.\n *\n * @param {Number} offset - offset into `vb` for the start of the\n * union. Used only when `vb` is an instance of {Buffer}.\n *\n * @return {({VariantLayout}|undefined)}\n */\n getVariant(vb, offset) {\n let variant = vb;\n if (Buffer.isBuffer(vb)) {\n if (undefined === offset) {\n offset = 0;\n }\n variant = this.discriminator.decode(vb, offset);\n }\n return this.registry[variant];\n }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly. Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}. If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}. Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}. The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n constructor(union, variant, layout, property) {\n if (!(union instanceof Union)) {\n throw new TypeError('union must be a Union');\n }\n if ((!Number.isInteger(variant)) || (0 > variant)) {\n throw new TypeError('variant must be a (non-negative) integer');\n }\n if (('string' === typeof layout)\n && (undefined === property)) {\n property = layout;\n layout = null;\n }\n if (layout) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n if ((null !== union.defaultLayout)\n && (0 <= layout.span)\n && (layout.span > union.defaultLayout.span)) {\n throw new Error('variant span exceeds span of containing union');\n }\n if ('string' !== typeof property) {\n throw new TypeError('variant must have a String property');\n }\n }\n let span = union.span;\n if (0 > union.span) {\n span = layout ? layout.span : 0;\n if ((0 <= span) && union.usesPrefixDiscriminator) {\n span += union.discriminator.layout.span;\n }\n }\n super(span, property);\n\n /** The {@link Union} to which this variant belongs. */\n this.union = union;\n\n /** The unsigned integral value identifying this variant within\n * the {@link Union#discriminator|discriminator} of the containing\n * union. */\n this.variant = variant;\n\n /** The {@link Layout} to be used when reading/writing the\n * non-discriminator part of the {@link\n * VariantLayout#union|union}. If `null` the variant carries no\n * data. */\n this.layout = layout || null;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n /* Will be equal to the containing union span if that is not\n * variable. */\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n /* Span is defined solely by the variant (and prefix discriminator) */\n return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n }\n\n /** @override */\n decode(b, offset) {\n const dest = this.makeDestinationObject();\n if (undefined === offset) {\n offset = 0;\n }\n if (this !== this.union.getVariant(b, offset)) {\n throw new Error('variant mismatch');\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout) {\n dest[this.property] = this.layout.decode(b, offset + contentOffset);\n } else if (this.property) {\n dest[this.property] = true;\n } else if (this.union.usesPrefixDiscriminator) {\n dest[this.union.discriminator.property] = this.variant;\n }\n return dest;\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout\n && (!src.hasOwnProperty(this.property))) {\n throw new TypeError('variant lacks property ' + this.property);\n }\n this.union.discriminator.encode(this.variant, b, offset);\n let span = contentOffset;\n if (this.layout) {\n this.layout.encode(src[this.property], b, offset + contentOffset);\n span += this.layout.getSpan(b, offset + contentOffset);\n if ((0 <= this.union.span)\n && (span > this.union.span)) {\n throw new Error('encoded variant overruns containing union');\n }\n }\n return span;\n }\n\n /** Delegate {@link Layout#fromArray|fromArray} to {@link\n * VariantLayout#layout|layout}. */\n fromArray(values) {\n if (this.layout) {\n return this.layout.fromArray(values);\n }\n }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative. For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n if (0 > v) {\n v += 0x100000000;\n }\n return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties. The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}. The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word. If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n constructor(word, msb, property) {\n if (!((word instanceof UInt)\n || (word instanceof UIntBE))) {\n throw new TypeError('word must be a UInt or UIntBE layout');\n }\n if (('string' === typeof msb)\n && (undefined === property)) {\n property = msb;\n msb = undefined;\n }\n if (4 < word.span) {\n throw new RangeError('word cannot exceed 32 bits');\n }\n super(word.span, property);\n\n /** The layout used for the packed value. {@link BitField}\n * instances are packed sequentially depending on {@link\n * BitStructure#msb|msb}. */\n this.word = word;\n\n /** Whether the bit sequences are packed starting at the most\n * significant bit growing down (`true`), or the least significant\n * bit growing up (`false`).\n *\n * **NOTE** Regardless of this value, the least significant bit of\n * any {@link BitField} value is the least significant bit of the\n * corresponding section of the packed value. */\n this.msb = !!msb;\n\n /** The sequence of {@link BitField} layouts that comprise the\n * packed structure.\n *\n * **NOTE** The array remains mutable to allow fields to be {@link\n * BitStructure#addField|added} after construction. Users should\n * not manipulate the content of this property.*/\n this.fields = [];\n\n /* Storage for the value. Capture a variable instead of using an\n * instance property because we don't want anything to change the\n * value without going through the mutator. */\n let value = 0;\n this._packedSetValue = function(v) {\n value = fixBitwiseResult(v);\n return this;\n };\n this._packedGetValue = function() {\n return value;\n };\n }\n\n /** @override */\n decode(b, offset) {\n const dest = this.makeDestinationObject();\n if (undefined === offset) {\n offset = 0;\n }\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(value);\n }\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the packed\n * value is left unmodified. Unused bits are also left unmodified. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n fd.encode(fv);\n }\n }\n }\n return this.word.encode(this._packedGetValue(), b, offset);\n }\n\n /** Register a new bitfield with a containing bit structure. The\n * resulting bitfield is returned.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {BitField} */\n addField(bits, property) {\n const bf = new BitField(this, bits, property);\n this.fields.push(bf);\n return bf;\n }\n\n /** As with {@link BitStructure#addField|addField} for single-bit\n * fields with `boolean` value representation.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {Boolean} */\n addBoolean(property) {\n // This is my Boolean, not the Javascript one.\n // eslint-disable-next-line no-new-wrappers\n const bf = new Boolean(this, property);\n this.fields.push(bf);\n return bf;\n }\n\n /**\n * Get access to the bit field for a given property.\n *\n * @param {String} property - the bit field of interest.\n *\n * @return {BitField} - the field associated with `property`, or\n * undefined if there is no such property.\n */\n fieldFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n constructor(container, bits, property) {\n if (!(container instanceof BitStructure)) {\n throw new TypeError('container must be a BitStructure');\n }\n if ((!Number.isInteger(bits)) || (0 >= bits)) {\n throw new TypeError('bits must be positive integer');\n }\n const totalBits = 8 * container.span;\n const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n if ((bits + usedBits) > totalBits) {\n throw new Error('bits too long for span remainder ('\n + (totalBits - usedBits) + ' of '\n + totalBits + ' remain)');\n }\n\n /** The {@link BitStructure} instance to which this bit field\n * belongs. */\n this.container = container;\n\n /** The span of this value in bits. */\n this.bits = bits;\n\n /** A mask of {@link BitField#bits|bits} bits isolating value bits\n * that fit within the field.\n *\n * That is, it masks a value that has not yet been shifted into\n * position within its containing packed integer. */\n this.valueMask = (1 << bits) - 1;\n if (32 === bits) { // shifted value out of range\n this.valueMask = 0xFFFFFFFF;\n }\n\n /** The offset of the value within the containing packed unsigned\n * integer. The least significant bit of the packed value is at\n * offset zero, regardless of bit ordering used. */\n this.start = usedBits;\n if (this.container.msb) {\n this.start = totalBits - usedBits - bits;\n }\n\n /** A mask of {@link BitField#bits|bits} isolating the field value\n * within the containing packed unsigned integer. */\n this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n /** The property name used when this bitfield is represented in an\n * Object.\n *\n * Intended to be functionally equivalent to {@link\n * Layout#property}.\n *\n * If left undefined the corresponding span of bits will be\n * treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n\n /** Store a value into the corresponding subsequence of the containing\n * bit field. */\n decode() {\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(word & this.wordMask);\n const value = wordValue >>> this.start;\n return value;\n }\n\n /** Store a value into the corresponding subsequence of the containing\n * bit field.\n *\n * **NOTE** This is not a specialization of {@link\n * Layout#encode|Layout.encode} and there is no return value. */\n encode(value) {\n if ((!Number.isInteger(value))\n || (value !== fixBitwiseResult(value & this.valueMask))) {\n throw new TypeError(nameWithProperty('BitField.encode', this)\n + ' value must be integer not exceeding ' + this.valueMask);\n }\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(value << this.start);\n this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n | wordValue);\n };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n constructor(container, property) {\n super(container, 1, property);\n }\n\n /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n *\n * @returns {boolean} */\n decode(b, offset) {\n return !!BitField.prototype.decode.call(this, b, offset);\n }\n\n /** @override */\n encode(value) {\n if ('boolean' === typeof value) {\n // BitField requires integer values\n value = +value;\n }\n return BitField.prototype.encode.call(this, value);\n }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n constructor(length, property) {\n if (!(((length instanceof ExternalLayout) && length.isCount())\n || (Number.isInteger(length) && (0 <= length)))) {\n throw new TypeError('length must be positive integer '\n + 'or an unsigned integer ExternalLayout');\n }\n\n let span = -1;\n if (!(length instanceof ExternalLayout)) {\n span = length;\n }\n super(span, property);\n\n /** The number of bytes in the blob.\n *\n * This may be a non-negative integer, or an instance of {@link\n * ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}. */\n this.length = length;\n }\n\n /** @override */\n getSpan(b, offset) {\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return b.slice(offset, offset + span);\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Blob}.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n let span = this.length;\n if (this.length instanceof ExternalLayout) {\n span = src.length;\n }\n if (!(Buffer.isBuffer(src)\n && (span === src.length))) {\n throw new TypeError(nameWithProperty('Blob.encode', this)\n + ' requires (length ' + span + ') Buffer as src');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n b.write(src.toString('hex'), offset, span, 'hex');\n if (this.length instanceof ExternalLayout) {\n this.length.encode(span, b, offset);\n }\n return span;\n }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n constructor(property) {\n super(-1, property);\n }\n\n /** @override */\n getSpan(b, offset) {\n if (!Buffer.isBuffer(b)) {\n throw new TypeError('b must be a Buffer');\n }\n if (undefined === offset) {\n offset = 0;\n }\n let idx = offset;\n while ((idx < b.length) && (0 !== b[idx])) {\n idx += 1;\n }\n return 1 + idx - offset;\n }\n\n /** @override */\n decode(b, offset, dest) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.getSpan(b, offset);\n return b.slice(offset, offset + span - 1).toString('utf-8');\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = src.toString();\n }\n const srcb = new Buffer(src, 'utf8');\n const span = srcb.length;\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n srcb.copy(b, offset);\n b[offset + span] = 0;\n return span + 1;\n }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content. If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n constructor(maxSpan, property) {\n if (('string' === typeof maxSpan)\n && (undefined === property)) {\n property = maxSpan;\n maxSpan = undefined;\n }\n if (undefined === maxSpan) {\n maxSpan = -1;\n } else if (!Number.isInteger(maxSpan)) {\n throw new TypeError('maxSpan must be an integer');\n }\n\n super(-1, property);\n\n /** The maximum span of the layout in bytes.\n *\n * Positive values are generally expected. Zero is abnormal.\n * Attempts to encode or decode a value that exceeds this length\n * will throw a `RangeError`.\n *\n * A negative value indicates that there is no bound on the length\n * of the content. */\n this.maxSpan = maxSpan;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (!Buffer.isBuffer(b)) {\n throw new TypeError('b must be a Buffer');\n }\n if (undefined === offset) {\n offset = 0;\n }\n return b.length - offset;\n }\n\n /** @override */\n decode(b, offset, dest) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.getSpan(b, offset);\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n return b.slice(offset, offset + span).toString('utf-8');\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = src.toString();\n }\n const srcb = new Buffer(src, 'utf8');\n const span = srcb.length;\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n srcb.copy(b, offset);\n return span;\n }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding. An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}. If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n constructor(value, property) {\n super(0, property);\n\n /** The value produced by this constant when the layout is {@link\n * Constant#decode|decoded}.\n *\n * Any JavaScript value including `null` and `undefined` is\n * permitted.\n *\n * **WARNING** If `value` passed in the constructor was not\n * frozen, it is possible for users of decoded values to change\n * the content of the value. */\n this.value = value;\n }\n\n /** @override */\n decode(b, offset, dest) {\n return this.value;\n }\n\n /** @override */\n encode(src, b, offset) {\n /* Constants take no space */\n return 0;\n }\n}\n\nexports.ExternalLayout = ExternalLayout;\nexports.GreedyCount = GreedyCount;\nexports.OffsetLayout = OffsetLayout;\nexports.UInt = UInt;\nexports.UIntBE = UIntBE;\nexports.Int = Int;\nexports.IntBE = IntBE;\nexports.Float = Float;\nexports.FloatBE = FloatBE;\nexports.Double = Double;\nexports.DoubleBE = DoubleBE;\nexports.Sequence = Sequence;\nexports.Structure = Structure;\nexports.UnionDiscriminator = UnionDiscriminator;\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nexports.Union = Union;\nexports.VariantLayout = VariantLayout;\nexports.BitStructure = BitStructure;\nexports.BitField = BitField;\nexports.Boolean = Boolean;\nexports.Blob = Blob;\nexports.CString = CString;\nexports.UTF8 = UTF8;\nexports.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nexports.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nexports.const = ((value, property) => new Constant(value, property));\n","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","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n constructor(span, signed, property) {\n super(span, property);\n this.blob = (0, buffer_layout_1.blob)(span);\n this.signed = signed;\n }\n decode(b, offset = 0) {\n const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n if (this.signed) {\n return num.fromTwos(this.span * 8).clone();\n }\n return num;\n }\n encode(src, b, offset = 0) {\n if (this.signed) {\n src = src.toTwos(this.span * 8);\n }\n return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n }\n}\nfunction u64(property) {\n return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n constructor(layout, decoder, encoder, property) {\n super(layout.span, property);\n this.layout = layout;\n this.decoder = decoder;\n this.encoder = encoder;\n }\n decode(b, offset) {\n return this.decoder(this.layout.decode(b, offset));\n }\n encode(src, b, offset) {\n return this.layout.encode(this.encoder(src), b, offset);\n }\n getSpan(b, offset) {\n return this.layout.getSpan(b, offset);\n }\n}\nfunction publicKey(property) {\n return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n constructor(layout, property) {\n super(-1, property);\n this.layout = layout;\n this.discriminator = (0, buffer_layout_1.u8)();\n }\n encode(src, b, offset = 0) {\n if (src === null || src === undefined) {\n return this.discriminator.encode(0, b, offset);\n }\n this.discriminator.encode(1, b, offset);\n return this.layout.encode(src, b, offset + 1) + 1;\n }\n decode(b, offset = 0) {\n const discriminator = this.discriminator.decode(b, offset);\n if (discriminator === 0) {\n return null;\n }\n else if (discriminator === 1) {\n return this.layout.decode(b, offset + 1);\n }\n throw new Error(\"Invalid option \" + this.property);\n }\n getSpan(b, offset = 0) {\n const discriminator = this.discriminator.decode(b, offset);\n if (discriminator === 0) {\n return 1;\n }\n else if (discriminator === 1) {\n return this.layout.getSpan(b, offset + 1) + 1;\n }\n throw new Error(\"Invalid option \" + this.property);\n }\n}\nfunction option(layout, property) {\n return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n if (value === 0) {\n return false;\n }\n else if (value === 1) {\n return true;\n }\n throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n const wrappedLayout = (0, buffer_layout_1.struct)([\n u64(\"tag\"),\n layout.replicate(\"data\"),\n ]);\n function decodeTag({ tag: receivedTag, data }) {\n if (!receivedTag.eq(tag)) {\n throw new Error(\"Invalid tag, expected: \" +\n tag.toString(\"hex\") +\n \", got: \" +\n receivedTag.toString(\"hex\"));\n }\n return data;\n }\n return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n ]);\n return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n const layout = (0, buffer_layout_1.struct)([\n (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n constructor(keyLayout, valueLayout, property) {\n super(keyLayout.span + valueLayout.span, property);\n this.keyLayout = keyLayout;\n this.valueLayout = valueLayout;\n }\n decode(b, offset) {\n offset = offset || 0;\n const key = this.keyLayout.decode(b, offset);\n const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n return [key, value];\n }\n encode(src, b, offset) {\n offset = offset || 0;\n const keyBytes = this.keyLayout.encode(src[0], b, offset);\n const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n return keyBytes + valueBytes;\n }\n getSpan(b, offset) {\n return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n }\n}\nfunction map(keyLayout, valueLayout, property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.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 { 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","\n/*! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) */\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//const Z_FILTERED = 1;\n//const Z_HUFFMAN_ONLY = 2;\n//const Z_RLE = 3;\nconst Z_FIXED$1 = 4;\n//const Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nconst Z_BINARY = 0;\nconst Z_TEXT = 1;\n//const Z_ASCII = 1; // = Z_TEXT\nconst Z_UNKNOWN$1 = 2;\n\n/*============================================================================*/\n\n\nfunction zero$1(buf) { let len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nconst STORED_BLOCK = 0;\nconst STATIC_TREES = 1;\nconst DYN_TREES = 2;\n/* The three kinds of block type */\n\nconst MIN_MATCH$1 = 3;\nconst MAX_MATCH$1 = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nconst LENGTH_CODES$1 = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nconst LITERALS$1 = 256;\n/* number of literal bytes 0..255 */\n\nconst L_CODES$1 = LITERALS$1 + 1 + LENGTH_CODES$1;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nconst D_CODES$1 = 30;\n/* number of distance codes */\n\nconst BL_CODES$1 = 19;\n/* number of codes used to transfer the bit lengths */\n\nconst HEAP_SIZE$1 = 2 * L_CODES$1 + 1;\n/* maximum heap size */\n\nconst MAX_BITS$1 = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nconst MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nconst END_BLOCK = 256;\n/* end of block literal code */\n\nconst REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nconst REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nconst REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nconst extra_lbits = /* extra bits for each length code */\n new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]);\n\nconst extra_dbits = /* extra bits for each distance code */\n new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]);\n\nconst extra_blbits = /* extra bits for each bit length code */\n new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]);\n\nconst bl_order =\n new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\n/* The lengths of the bit length codes are sent in order of decreasing\n * probability, to avoid transmitting the lengths for unused bit length codes.\n */\n\n/* ===========================================================================\n * Local data. These are initialized only once.\n */\n\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nconst DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nconst static_ltree = new Array((L_CODES$1 + 2) * 2);\nzero$1(static_ltree);\n/* The static literal tree. Since the bit lengths are imposed, there is no\n * need for the L_CODES extra codes used during heap construction. However\n * The codes 286 and 287 are needed to build a canonical tree (see _tr_init\n * below).\n */\n\nconst static_dtree = new Array(D_CODES$1 * 2);\nzero$1(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nconst _dist_code = new Array(DIST_CODE_LEN);\nzero$1(_dist_code);\n/* Distance codes. The first 256 values correspond to the distances\n * 3 .. 258, the last 256 values correspond to the top 8 bits of\n * the 15 bit distances.\n */\n\nconst _length_code = new Array(MAX_MATCH$1 - MIN_MATCH$1 + 1);\nzero$1(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nconst base_length = new Array(LENGTH_CODES$1);\nzero$1(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nconst base_dist = new Array(D_CODES$1);\nzero$1(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nlet static_l_desc;\nlet static_d_desc;\nlet static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nconst d_code = (dist) => {\n\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n};\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nconst put_short = (s, w) => {\n// put_byte(s, (uch)((w) & 0xff));\n// put_byte(s, (uch)((ush)(w) >> 8));\n s.pending_buf[s.pending++] = (w) & 0xff;\n s.pending_buf[s.pending++] = (w >>> 8) & 0xff;\n};\n\n\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nconst send_bits = (s, value, length) => {\n\n if (s.bi_valid > (Buf_size - length)) {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n put_short(s, s.bi_buf);\n s.bi_buf = value >> (Buf_size - s.bi_valid);\n s.bi_valid += length - Buf_size;\n } else {\n s.bi_buf |= (value << s.bi_valid) & 0xffff;\n s.bi_valid += length;\n }\n};\n\n\nconst send_code = (s, c, tree) => {\n\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n};\n\n\n/* ===========================================================================\n * Reverse the first len bits of a code, using straightforward code (a faster\n * method would use a table)\n * IN assertion: 1 <= len <= 15\n */\nconst bi_reverse = (code, len) => {\n\n let res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nconst bi_flush = (s) => {\n\n if (s.bi_valid === 16) {\n put_short(s, s.bi_buf);\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n } else if (s.bi_valid >= 8) {\n s.pending_buf[s.pending++] = s.bi_buf & 0xff;\n s.bi_buf >>= 8;\n s.bi_valid -= 8;\n }\n};\n\n\n/* ===========================================================================\n * Compute the optimal bit lengths for a tree and update the total bit length\n * for the current block.\n * IN assertion: the fields freq and dad are set, heap[heap_max] and\n * above are the tree nodes sorted by increasing frequency.\n * OUT assertions: the field len is set to the optimal bit length, the\n * array bl_count contains the frequencies for each bit length.\n * The length opt_len is updated; static_len is also updated if stree is\n * not null.\n */\nconst gen_bitlen = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const max_code = desc.max_code;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const extra = desc.stat_desc.extra_bits;\n const base = desc.stat_desc.extra_base;\n const max_length = desc.stat_desc.max_length;\n let h; /* heap index */\n let n, m; /* iterate over the tree elements */\n let bits; /* bit length */\n let xbits; /* extra bits */\n let f; /* frequency */\n let overflow = 0; /* number of elements with bit length too large */\n\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n s.bl_count[bits] = 0;\n }\n\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */\n\n for (h = s.heap_max + 1; h < HEAP_SIZE$1; h++) {\n n = s.heap[h];\n bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Tracev((stderr,\"\\nbit length overflow\\n\"));\n /* This happens for example on obj2 and pic of the Calgary corpus */\n\n /* Find the first bit length which could increase: */\n do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\n s.bl_count[max_length]--;\n /* The brother of the overflow item also moves one step up,\n * but this does not affect bl_count[max_length]\n */\n overflow -= 2;\n } while (overflow > 0);\n\n /* Now recompute all bit lengths, scanning in increasing frequency.\n * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all\n * lengths instead of fixing only the wrong ones. This idea is taken\n * from 'ar' written by Haruhiko Okumura.)\n */\n for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Tracev((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\n n--;\n }\n }\n};\n\n\n/* ===========================================================================\n * Generate the codes for a given tree and bit counts (which need not be\n * optimal).\n * IN assertion: the array bl_count contains the bit length statistics for\n * the given tree and the field len is set for all tree elements.\n * OUT assertion: the field code is set for all tree elements of non\n * zero code length.\n */\nconst gen_codes = (tree, max_code, bl_count) => {\n// ct_data *tree; /* the tree to decorate */\n// int max_code; /* largest code with non zero frequency */\n// ushf *bl_count; /* number of codes at each bit length */\n\n const next_code = new Array(MAX_BITS$1 + 1); /* next code value for each bit length */\n let code = 0; /* running code value */\n let bits; /* bit index */\n let n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\n */\n for (bits = 1; bits <= MAX_BITS$1; bits++) {\n code = (code + bl_count[bits - 1]) << 1;\n next_code[bits] = code;\n }\n /* Check that the bit counts in bl_count are consistent. The last code\n * must be all ones.\n */\n //Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,\n // \"inconsistent bit counts\");\n //Tracev((stderr,\"\\ngen_codes: max_code %d \", max_code));\n\n for (n = 0; n <= max_code; n++) {\n let len = tree[n * 2 + 1]/*.Len*/;\n if (len === 0) { continue; }\n /* Now reverse the bits */\n tree[n * 2]/*.Code*/ = bi_reverse(next_code[len]++, len);\n\n //Tracecv(tree != static_ltree, (stderr,\"\\nn %3d %c l %2d c %4x (%x) \",\n // n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));\n }\n};\n\n\n/* ===========================================================================\n * Initialize the various 'constant' tables.\n */\nconst tr_static_init = () => {\n\n let n; /* iterates over tree elements */\n let bits; /* bit counter */\n let length; /* length value */\n let code; /* code value */\n let dist; /* distance index */\n const bl_count = new Array(MAX_BITS$1 + 1);\n /* number of codes at each bit length for an optimal tree */\n\n // do check in _tr_init()\n //if (static_init_done) return;\n\n /* For some embedded targets, global variables are not initialized: */\n/*#ifdef NO_INIT_GLOBAL_POINTERS\n static_l_desc.static_tree = static_ltree;\n static_l_desc.extra_bits = extra_lbits;\n static_d_desc.static_tree = static_dtree;\n static_d_desc.extra_bits = extra_dbits;\n static_bl_desc.extra_bits = extra_blbits;\n#endif*/\n\n /* Initialize the mapping length (0..255) -> length code (0..28) */\n length = 0;\n for (code = 0; code < LENGTH_CODES$1 - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\n /* Note that the length 255 (match length 258) can be represented\n * in two different ways: code 284 + 5 bits or code 285, so we\n * overwrite length_code[255] to use the best encoding:\n */\n _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES$1; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS$1; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n /* Codes 286 and 287 do not exist, but we must include them in the\n * tree construction to get a canonical Huffman tree (longest code\n * all ones)\n */\n gen_codes(static_ltree, L_CODES$1 + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES$1; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\n static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS$1 + 1, L_CODES$1, MAX_BITS$1);\n static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES$1, MAX_BITS$1);\n static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES$1, MAX_BL_BITS);\n\n //static_init_done = true;\n};\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nconst init_block = (s) => {\n\n let n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES$1; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES$1; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES$1; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.sym_next = s.matches = 0;\n};\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nconst bi_windup = (s) =>\n{\n if (s.bi_valid > 8) {\n put_short(s, s.bi_buf);\n } else if (s.bi_valid > 0) {\n //put_byte(s, (Byte)s->bi_buf);\n s.pending_buf[s.pending++] = s.bi_buf;\n }\n s.bi_buf = 0;\n s.bi_valid = 0;\n};\n\n/* ===========================================================================\n * Compares to subtrees, using the tree depth as tie breaker when\n * the subtrees have equal frequency. This minimizes the worst case length.\n */\nconst smaller = (tree, n, m, depth) => {\n\n const _n2 = n * 2;\n const _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n};\n\n/* ===========================================================================\n * Restore the heap property by moving down the tree starting at node k,\n * exchanging a node with the smallest of its two sons if necessary, stopping\n * when the heap property is re-established (each father smaller than its\n * two sons).\n */\nconst pqdownheap = (s, tree, k) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to restore */\n// int k; /* node to move down */\n\n const v = s.heap[k];\n let j = k << 1; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n};\n\n\n// inlined manually\n// const SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nconst compress_block = (s, ltree, dtree) => {\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n\n let dist; /* distance of matched string */\n let lc; /* match length or unmatched char (if dist == 0) */\n let sx = 0; /* running index in sym_buf */\n let code; /* the code to send */\n let extra; /* number of extra bits to send */\n\n if (s.sym_next !== 0) {\n do {\n dist = s.pending_buf[s.sym_buf + sx++] & 0xff;\n dist += (s.pending_buf[s.sym_buf + sx++] & 0xff) << 8;\n lc = s.pending_buf[s.sym_buf + sx++];\n if (dist === 0) {\n send_code(s, lc, ltree); /* send a literal byte */\n //Tracecv(isgraph(lc), (stderr,\" '%c' \", lc));\n } else {\n /* Here, lc is the match length - MIN_MATCH */\n code = _length_code[lc];\n send_code(s, code + LITERALS$1 + 1, ltree); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\n }\n } /* literal or match pair ? */\n\n /* Check that the overlay between pending_buf and sym_buf is ok: */\n //Assert(s->pending < s->lit_bufsize + sx, \"pendingBuf overflow\");\n\n } while (sx < s.sym_next);\n }\n\n send_code(s, END_BLOCK, ltree);\n};\n\n\n/* ===========================================================================\n * Construct one Huffman tree and assigns the code bit strings and lengths.\n * Update the total bit length for the current block.\n * IN assertion: the field freq is set for all tree elements.\n * OUT assertions: the fields len and code are set to the optimal bit length\n * and corresponding code. The length opt_len is updated; static_len is\n * also updated if stree is not null. The field max_code is set.\n */\nconst build_tree = (s, desc) => {\n// deflate_state *s;\n// tree_desc *desc; /* the tree descriptor */\n\n const tree = desc.dyn_tree;\n const stree = desc.stat_desc.static_tree;\n const has_stree = desc.stat_desc.has_stree;\n const elems = desc.stat_desc.elems;\n let n, m; /* iterate over heap elements */\n let max_code = -1; /* largest code with non zero frequency */\n let node; /* new node being created */\n\n /* Construct the initial heap, with least frequent element in\n * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].\n * heap[0] is not used.\n */\n s.heap_len = 0;\n s.heap_max = HEAP_SIZE$1;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\n }\n\n /* The pkzip format requires that at least one distance code exists,\n * and that at least one bit should be sent even if there is only one\n * possible code. So to avoid special checks later on we force at least\n * two codes of non zero frequency.\n */\n while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n};\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nconst scan_tree = (s, tree, max_code) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\n } else {\n s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++;\n }\n\n count = 0;\n prevlen = curlen;\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nconst send_tree = (s, tree, max_code) => {\n// deflate_state *s;\n// ct_data *tree; /* the tree to be scanned */\n// int max_code; /* and its largest code of non zero frequency */\n\n let n; /* iterates over all tree elements */\n let prevlen = -1; /* last emitted length */\n let curlen; /* length of current code */\n\n let nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n let count = 0; /* repeat count of the current code */\n let max_count = 7; /* max repeat count */\n let min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\n } else {\n send_code(s, REPZ_11_138, s.bl_tree);\n send_bits(s, count - 11, 7);\n }\n\n count = 0;\n prevlen = curlen;\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n};\n\n\n/* ===========================================================================\n * Construct the Huffman tree for the bit lengths and return the index in\n * bl_order of the last bit length code to send.\n */\nconst build_bl_tree = (s) => {\n\n let max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\n scan_tree(s, s.dyn_ltree, s.l_desc.max_code);\n scan_tree(s, s.dyn_dtree, s.d_desc.max_code);\n\n /* Build the bit length tree: */\n build_tree(s, s.bl_desc);\n /* opt_len now includes the length of the tree representations, except\n * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.\n */\n\n /* Determine the number of bit length codes to send. The pkzip format\n * requires that at least 4 bit length codes be sent. (appnote.txt says\n * 3 but the actual value used is 4.)\n */\n for (max_blindex = BL_CODES$1 - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n};\n\n\n/* ===========================================================================\n * Send the header for a block using dynamic Huffman trees: the counts, the\n * lengths of the bit length codes, the literal tree and the distance tree.\n * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.\n */\nconst send_all_trees = (s, lcodes, dcodes, blcodes) => {\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n\n let rank; /* index in bl_order */\n\n //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, \"not enough codes\");\n //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,\n // \"too many codes\");\n //Tracev((stderr, \"\\nbl counts: \"));\n send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\n for (rank = 0; rank < blcodes; rank++) {\n //Tracev((stderr, \"\\nbl code %2d \", bl_order[rank]));\n send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n};\n\n\n/* ===========================================================================\n * Check if the data type is TEXT or BINARY, using the following algorithm:\n * - TEXT if the two conditions below are satisfied:\n * a) There are no non-portable control characters belonging to the\n * \"block list\" (0..6, 14..25, 28..31).\n * b) There is at least one printable character belonging to the\n * \"allow list\" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255).\n * - BINARY otherwise.\n * - The following partially-portable control characters form a\n * \"gray list\" that is ignored in this detection algorithm:\n * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}).\n * IN assertion: the fields Freq of dyn_ltree are set.\n */\nconst detect_data_type = (s) => {\n /* block_mask is the bit mask of block-listed bytes\n * set bits 0..6, 14..25, and 28..31\n * 0xf3ffc07f = binary 11110011111111111100000001111111\n */\n let block_mask = 0xf3ffc07f;\n let n;\n\n /* Check for non-textual (\"block-listed\") bytes. */\n for (n = 0; n <= 31; n++, block_mask >>>= 1) {\n if ((block_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"allow-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS$1; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n }\n\n /* There are no \"block-listed\" or \"allow-listed\" bytes:\n * this stream either is empty or has tolerated (\"gray-listed\") bytes only.\n */\n return Z_BINARY;\n};\n\n\nlet static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nconst _tr_init$1 = (s) =>\n{\n\n if (!static_init_done) {\n tr_static_init();\n static_init_done = true;\n }\n\n s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc);\n s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc);\n s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc);\n\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n};\n\n\n/* ===========================================================================\n * Send a stored block\n */\nconst _tr_stored_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf; /* input block */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n\n send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */\n bi_windup(s); /* align on byte boundary */\n put_short(s, stored_len);\n put_short(s, ~stored_len);\n if (stored_len) {\n s.pending_buf.set(s.window.subarray(buf, buf + stored_len), s.pending);\n }\n s.pending += stored_len;\n};\n\n\n/* ===========================================================================\n * Send one empty static block to give enough lookahead for inflate.\n * This takes 10 bits, of which 7 may remain in the bit buffer.\n */\nconst _tr_align$1 = (s) => {\n send_bits(s, STATIC_TREES << 1, 3);\n send_code(s, END_BLOCK, static_ltree);\n bi_flush(s);\n};\n\n\n/* ===========================================================================\n * Determine the best encoding for the current block: dynamic trees, static\n * trees or store, and write out the encoded block.\n */\nconst _tr_flush_block$1 = (s, buf, stored_len, last) => {\n//DeflateState *s;\n//charf *buf; /* input block, or NULL if too old */\n//ulg stored_len; /* length of input block */\n//int last; /* one if this is the last block for a file */\n\n let opt_lenb, static_lenb; /* opt_len and static_len in bytes */\n let max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\n /* Check if the file is binary or text */\n if (s.strm.data_type === Z_UNKNOWN$1) {\n s.strm.data_type = detect_data_type(s);\n }\n\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n /* At this point, opt_len and static_len are the total bit lengths of\n * the compressed block data, excluding the tree representations.\n */\n\n /* Build the bit length tree for the above two trees, and get the index\n * in bl_order of the last bit length code to send.\n */\n max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // Tracev((stderr, \"\\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u \",\n // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,\n // s->sym_next / 3));\n\n if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* force a stored block */\n }\n\n if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) {\n /* 4: two words for the lengths */\n\n /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.\n * Otherwise we can't have processed more than WSIZE input bytes since\n * the last block flush, because compression would have been\n * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to\n * transform a block into a stored block.\n */\n _tr_stored_block$1(s, buf, stored_len, last);\n\n } else if (s.strategy === Z_FIXED$1 || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\n } else {\n send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3);\n send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1);\n compress_block(s, s.dyn_ltree, s.dyn_dtree);\n }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\n // Tracev((stderr,\"\\ncomprlen %lu(%lu) \", s->compressed_len>>3,\n // s->compressed_len-7*last));\n};\n\n/* ===========================================================================\n * Save the match info and tally the frequency counts. Return true if\n * the current block must be flushed.\n */\nconst _tr_tally$1 = (s, dist, lc) => {\n// deflate_state *s;\n// unsigned dist; /* distance of matched string */\n// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */\n\n s.pending_buf[s.sym_buf + s.sym_next++] = dist;\n s.pending_buf[s.sym_buf + s.sym_next++] = dist >> 8;\n s.pending_buf[s.sym_buf + s.sym_next++] = lc;\n if (dist === 0) {\n /* lc is the unmatched char */\n s.dyn_ltree[lc * 2]/*.Freq*/++;\n } else {\n s.matches++;\n /* Here, lc is the match length - MIN_MATCH */\n dist--; /* dist = match distance - 1 */\n //Assert((ush)dist < (ush)MAX_DIST(s) &&\n // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&\n // (ush)d_code(dist) < (ush)D_CODES, \"_tr_tally: bad match\");\n\n s.dyn_ltree[(_length_code[lc] + LITERALS$1 + 1) * 2]/*.Freq*/++;\n s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++;\n }\n\n return (s.sym_next === s.sym_end);\n};\n\nvar _tr_init_1 = _tr_init$1;\nvar _tr_stored_block_1 = _tr_stored_block$1;\nvar _tr_flush_block_1 = _tr_flush_block$1;\nvar _tr_tally_1 = _tr_tally$1;\nvar _tr_align_1 = _tr_align$1;\n\nvar trees = {\n\t_tr_init: _tr_init_1,\n\t_tr_stored_block: _tr_stored_block_1,\n\t_tr_flush_block: _tr_flush_block_1,\n\t_tr_tally: _tr_tally_1,\n\t_tr_align: _tr_align_1\n};\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst adler32 = (adler, buf, len, pos) => {\n let s1 = (adler & 0xffff) |0,\n s2 = ((adler >>> 16) & 0xffff) |0,\n n = 0;\n\n while (len !== 0) {\n // Set limit ~ twice less than 5552, to keep\n // s2 in 31-bits, because we force signed ints.\n // in other case %= will fail.\n n = len > 2000 ? 2000 : len;\n len -= n;\n\n do {\n s1 = (s1 + buf[pos++]) |0;\n s2 = (s2 + s1) |0;\n } while (--n);\n\n s1 %= 65521;\n s2 %= 65521;\n }\n\n return (s1 | (s2 << 16)) |0;\n};\n\n\nvar adler32_1 = adler32;\n\n// Note: we can't get significant speed boost here.\n// So write code to minimize size - no pregenerated tables\n// and array tools dependencies.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nconst makeTable = () => {\n let c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n};\n\n// Create table on load. Just 255 signed longs. Not a problem.\nconst crcTable = new Uint32Array(makeTable());\n\n\nconst crc32 = (crc, buf, len, pos) => {\n const t = crcTable;\n const end = pos + len;\n\n crc ^= -1;\n\n for (let i = pos; i < end; i++) {\n crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF];\n }\n\n return (crc ^ (-1)); // >>> 0;\n};\n\n\nvar crc32_1 = crc32;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar messages = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar constants$2 = {\n\n /* Allowed flush values; see deflate() and inflate() below for details */\n Z_NO_FLUSH: 0,\n Z_PARTIAL_FLUSH: 1,\n Z_SYNC_FLUSH: 2,\n Z_FULL_FLUSH: 3,\n Z_FINISH: 4,\n Z_BLOCK: 5,\n Z_TREES: 6,\n\n /* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\n Z_OK: 0,\n Z_STREAM_END: 1,\n Z_NEED_DICT: 2,\n Z_ERRNO: -1,\n Z_STREAM_ERROR: -2,\n Z_DATA_ERROR: -3,\n Z_MEM_ERROR: -4,\n Z_BUF_ERROR: -5,\n //Z_VERSION_ERROR: -6,\n\n /* compression levels */\n Z_NO_COMPRESSION: 0,\n Z_BEST_SPEED: 1,\n Z_BEST_COMPRESSION: 9,\n Z_DEFAULT_COMPRESSION: -1,\n\n\n Z_FILTERED: 1,\n Z_HUFFMAN_ONLY: 2,\n Z_RLE: 3,\n Z_FIXED: 4,\n Z_DEFAULT_STRATEGY: 0,\n\n /* Possible values of the data_type field (though see inflate()) */\n Z_BINARY: 0,\n Z_TEXT: 1,\n //Z_ASCII: 1, // = Z_TEXT (deprecated)\n Z_UNKNOWN: 2,\n\n /* The deflate compression method */\n Z_DEFLATED: 8\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst { _tr_init, _tr_stored_block, _tr_flush_block, _tr_tally, _tr_align } = trees;\n\n\n\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$2, Z_PARTIAL_FLUSH, Z_FULL_FLUSH: Z_FULL_FLUSH$1, Z_FINISH: Z_FINISH$3, Z_BLOCK: Z_BLOCK$1,\n Z_OK: Z_OK$3, Z_STREAM_END: Z_STREAM_END$3, Z_STREAM_ERROR: Z_STREAM_ERROR$2, Z_DATA_ERROR: Z_DATA_ERROR$2, Z_BUF_ERROR: Z_BUF_ERROR$1,\n Z_DEFAULT_COMPRESSION: Z_DEFAULT_COMPRESSION$1,\n Z_FILTERED, Z_HUFFMAN_ONLY, Z_RLE, Z_FIXED, Z_DEFAULT_STRATEGY: Z_DEFAULT_STRATEGY$1,\n Z_UNKNOWN,\n Z_DEFLATED: Z_DEFLATED$2\n} = constants$2;\n\n/*============================================================================*/\n\n\nconst MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nconst MAX_WBITS$1 = 15;\n/* 32K LZ77 window */\nconst DEF_MEM_LEVEL = 8;\n\n\nconst LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nconst LITERALS = 256;\n/* number of literal bytes 0..255 */\nconst L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nconst D_CODES = 30;\n/* number of distance codes */\nconst BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nconst HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nconst MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nconst MIN_MATCH = 3;\nconst MAX_MATCH = 258;\nconst MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nconst PRESET_DICT = 0x20;\n\nconst INIT_STATE = 42; /* zlib header -> BUSY_STATE */\n//#ifdef GZIP\nconst GZIP_STATE = 57; /* gzip header -> BUSY_STATE | EXTRA_STATE */\n//#endif\nconst EXTRA_STATE = 69; /* gzip extra block -> NAME_STATE */\nconst NAME_STATE = 73; /* gzip file name -> COMMENT_STATE */\nconst COMMENT_STATE = 91; /* gzip comment -> HCRC_STATE */\nconst HCRC_STATE = 103; /* gzip header CRC -> BUSY_STATE */\nconst BUSY_STATE = 113; /* deflate -> FINISH_STATE */\nconst FINISH_STATE = 666; /* stream complete */\n\nconst BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nconst BS_BLOCK_DONE = 2; /* block flush performed */\nconst BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nconst BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nconst OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nconst err = (strm, errorCode) => {\n strm.msg = messages[errorCode];\n return errorCode;\n};\n\nconst rank = (f) => {\n return ((f) * 2) - ((f) > 4 ? 9 : 0);\n};\n\nconst zero = (buf) => {\n let len = buf.length; while (--len >= 0) { buf[len] = 0; }\n};\n\n/* ===========================================================================\n * Slide the hash table when sliding the window down (could be avoided with 32\n * bit values at the expense of memory usage). We slide even when level == 0 to\n * keep the hash table consistent if we switch back to level > 0 later.\n */\nconst slide_hash = (s) => {\n let n, m;\n let p;\n let wsize = s.w_size;\n\n n = s.hash_size;\n p = n;\n do {\n m = s.head[--p];\n s.head[p] = (m >= wsize ? m - wsize : 0);\n } while (--n);\n n = wsize;\n//#ifndef FASTEST\n p = n;\n do {\n m = s.prev[--p];\n s.prev[p] = (m >= wsize ? m - wsize : 0);\n /* If n is not on any hash chain, prev[n] is garbage but\n * its value will never be used.\n */\n } while (--n);\n//#endif\n};\n\n/* eslint-disable new-cap */\nlet HASH_ZLIB = (s, prev, data) => ((prev << s.hash_shift) ^ data) & s.hash_mask;\n// This hash causes less collisions, https://github.com/nodeca/pako/issues/135\n// But breaks binary compatibility\n//let HASH_FAST = (s, prev, data) => ((prev << 8) + (prev >> 8) + (data << 4)) & s.hash_mask;\nlet HASH = HASH_ZLIB;\n\n\n/* =========================================================================\n * Flush as much pending output as possible. All deflate() output, except for\n * some deflate_stored() output, goes through this function so some\n * applications may wish to modify it to avoid allocating a large\n * strm->next_out buffer and copying into it. (See also read_buf()).\n */\nconst flush_pending = (strm) => {\n const s = strm.state;\n\n //_tr_flush_bits(s);\n let len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\n\n strm.output.set(s.pending_buf.subarray(s.pending_out, s.pending_out + len), strm.next_out);\n strm.next_out += len;\n s.pending_out += len;\n strm.total_out += len;\n strm.avail_out -= len;\n s.pending -= len;\n if (s.pending === 0) {\n s.pending_out = 0;\n }\n};\n\n\nconst flush_block_only = (s, last) => {\n _tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last);\n s.block_start = s.strstart;\n flush_pending(s.strm);\n};\n\n\nconst put_byte = (s, b) => {\n s.pending_buf[s.pending++] = b;\n};\n\n\n/* =========================================================================\n * Put a short in the pending buffer. The 16-bit value is put in MSB order.\n * IN assertion: the stream state is correct and there is enough room in\n * pending_buf.\n */\nconst putShortMSB = (s, b) => {\n\n // put_byte(s, (Byte)(b >> 8));\n// put_byte(s, (Byte)(b & 0xff));\n s.pending_buf[s.pending++] = (b >>> 8) & 0xff;\n s.pending_buf[s.pending++] = b & 0xff;\n};\n\n\n/* ===========================================================================\n * Read a new buffer from the current input stream, update the adler32\n * and total number of bytes read. All deflate() input goes through\n * this function so some applications may wish to modify it to avoid\n * allocating a large strm->input buffer and copying from it.\n * (See also flush_pending()).\n */\nconst read_buf = (strm, buf, start, size) => {\n\n let len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n buf.set(strm.input.subarray(strm.next_in, strm.next_in + len), start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32_1(strm.adler, buf, len, start);\n }\n\n else if (strm.state.wrap === 2) {\n strm.adler = crc32_1(strm.adler, buf, len, start);\n }\n\n strm.next_in += len;\n strm.total_in += len;\n\n return len;\n};\n\n\n/* ===========================================================================\n * Set match_start to the longest match starting at the given string and\n * return its length. Matches shorter or equal to prev_length are discarded,\n * in which case the result is equal to prev_length and match_start is\n * garbage.\n * IN assertions: cur_match is the head of the hash chain for the current\n * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1\n * OUT assertion: the match length is not greater than s->lookahead.\n */\nconst longest_match = (s, cur_match) => {\n\n let chain_length = s.max_chain_length; /* max hash chain length */\n let scan = s.strstart; /* current string */\n let match; /* matched string */\n let len; /* length of current match */\n let best_len = s.prev_length; /* best match length so far */\n let nice_match = s.nice_match; /* stop if match long enough */\n const limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n const _win = s.window; // shortcut\n\n const wmask = s.w_mask;\n const prev = s.prev;\n\n /* Stop when cur_match becomes <= limit. To simplify the code,\n * we prevent matches with the string of window index 0.\n */\n\n const strend = s.strstart + MAX_MATCH;\n let scan_end1 = _win[scan + best_len - 1];\n let scan_end = _win[scan + best_len];\n\n /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.\n * It is easy to get rid of this optimization if necessary.\n */\n // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, \"Code too clever\");\n\n /* Do not waste too much time if we already have a good match: */\n if (s.prev_length >= s.good_match) {\n chain_length >>= 2;\n }\n /* Do not look for matches beyond the end of the input. This is necessary\n * to make deflate deterministic.\n */\n if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\n /* Skip to next match if the match length cannot increase\n * or if the match length is less than 2. Note that the checks below\n * for insufficient lookahead only occur occasionally for performance\n * reasons. Therefore uninitialized memory will be accessed, and\n * conditional jumps will be made that depend on those values.\n * However the length of the match is limited to the lookahead, so\n * the output of deflate is not affected by the uninitialized values.\n */\n\n if (_win[match + best_len] !== scan_end ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\n\n /* The check at best_len-1 can be removed because it will be made\n * again later. (This heuristic is not always a win.)\n * It is not necessary to compare scan[2] and match[2] since they\n * are always equal when the other bytes match, given that\n * the hash keys are equal and that HASH_BITS >= 8.\n */\n scan += 2;\n match++;\n // Assert(*scan == *match, \"match[2]?\");\n\n /* We check for insufficient lookahead only every 8th comparison;\n * the 256th check will be made at strstart+258.\n */\n do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\n\n len = MAX_MATCH - (strend - scan);\n scan = strend - MAX_MATCH;\n\n if (len > best_len) {\n s.match_start = cur_match;\n best_len = len;\n if (len >= nice_match) {\n break;\n }\n scan_end1 = _win[scan + best_len - 1];\n scan_end = _win[scan + best_len];\n }\n } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0);\n\n if (best_len <= s.lookahead) {\n return best_len;\n }\n return s.lookahead;\n};\n\n\n/* ===========================================================================\n * Fill the window when the lookahead becomes insufficient.\n * Updates strstart and lookahead.\n *\n * IN assertion: lookahead < MIN_LOOKAHEAD\n * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD\n * At least one byte has been read, or avail_in == 0; reads are\n * performed for at least two bytes (required for the zip translate_eol\n * option -- not supported here).\n */\nconst fill_window = (s) => {\n\n const _w_size = s.w_size;\n let n, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\n /* Deal with !@#$% 64K limit: */\n //if (sizeof(int) <= 2) {\n // if (more == 0 && s->strstart == 0 && s->lookahead == 0) {\n // more = wsize;\n //\n // } else if (more == (unsigned)(-1)) {\n // /* Very unlikely, but possible on 16 bit machine if\n // * strstart == 0 && lookahead == 1 (input done a byte at time)\n // */\n // more--;\n // }\n //}\n\n\n /* If the window is almost full and there is insufficient lookahead,\n * move the upper half to the lower one to make room in the upper half.\n */\n if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\n s.window.set(s.window.subarray(_w_size, _w_size + _w_size - more), 0);\n s.match_start -= _w_size;\n s.strstart -= _w_size;\n /* we now have strstart >= MAX_DIST */\n s.block_start -= _w_size;\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n slide_hash(s);\n more += _w_size;\n }\n if (s.strm.avail_in === 0) {\n break;\n }\n\n /* If there was no sliding:\n * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&\n * more == window_size - lookahead - strstart\n * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)\n * => more >= window_size - 2*WSIZE + 2\n * In the BIG_MEM or MMAP case (not yet supported),\n * window_size == input_size + MIN_LOOKAHEAD &&\n * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.\n * Otherwise, window_size == 2*WSIZE so more >= 2.\n * If there was sliding, more >= WSIZE. So in all cases, more >= 2.\n */\n //Assert(more >= 2, \"more < 2\");\n n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + 1]);\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\n while (s.insert) {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = str;\n str++;\n s.insert--;\n if (s.lookahead + s.insert < MIN_MATCH) {\n break;\n }\n }\n }\n /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,\n * but this is not important since only literal bytes will be emitted.\n */\n\n } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0);\n\n /* If the WIN_INIT bytes after the end of the current data have never been\n * written, then zero those bytes in order to avoid memory check reports of\n * the use of uninitialized (or uninitialised as Julian writes) bytes by\n * the longest match routines. Update the high water mark for the next\n * time through here. WIN_INIT is set to MAX_MATCH since the longest match\n * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead.\n */\n// if (s.high_water < s.window_size) {\n// const curr = s.strstart + s.lookahead;\n// let init = 0;\n//\n// if (s.high_water < curr) {\n// /* Previous high water mark below current data -- zero WIN_INIT\n// * bytes or up to end of window, whichever is less.\n// */\n// init = s.window_size - curr;\n// if (init > WIN_INIT)\n// init = WIN_INIT;\n// zmemzero(s->window + curr, (unsigned)init);\n// s->high_water = curr + init;\n// }\n// else if (s->high_water < (ulg)curr + WIN_INIT) {\n// /* High water mark at or above current data, but below current data\n// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up\n// * to end of window, whichever is less.\n// */\n// init = (ulg)curr + WIN_INIT - s->high_water;\n// if (init > s->window_size - s->high_water)\n// init = s->window_size - s->high_water;\n// zmemzero(s->window + s->high_water, (unsigned)init);\n// s->high_water += init;\n// }\n// }\n//\n// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD,\n// \"not enough room for search\");\n};\n\n/* ===========================================================================\n * Copy without compression as much as possible from the input stream, return\n * the current block state.\n *\n * In case deflateParams() is used to later switch to a non-zero compression\n * level, s->matches (otherwise unused when storing) keeps track of the number\n * of hash table slides to perform. If s->matches is 1, then one hash table\n * slide will be done when switching. If s->matches is 2, the maximum value\n * allowed here, then the hash table will be cleared, since two or more slides\n * is the same as a clear.\n *\n * deflate_stored() is written to minimize the number of times an input byte is\n * copied. It is most efficient with large input and output buffers, which\n * maximizes the opportunites to have a single copy from next_in to next_out.\n */\nconst deflate_stored = (s, flush) => {\n\n /* Smallest worthy block size when not flushing or finishing. By default\n * this is 32K. This can be as small as 507 bytes for memLevel == 1. For\n * large input and output buffers, the stored block size will be larger.\n */\n let min_block = s.pending_buf_size - 5 > s.w_size ? s.w_size : s.pending_buf_size - 5;\n\n /* Copy as many min_block or larger stored blocks directly to next_out as\n * possible. If flushing, copy the remaining available input to next_out as\n * stored blocks, if there is enough space.\n */\n let len, left, have, last = 0;\n let used = s.strm.avail_in;\n do {\n /* Set len to the maximum size block that we can copy directly with the\n * available input data and output space. Set left to how much of that\n * would be copied from what's left in the window.\n */\n len = 65535/* MAX_STORED */; /* maximum deflate stored block length */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n if (s.strm.avail_out < have) { /* need room for header */\n break;\n }\n /* maximum stored block length that will fit in avail_out: */\n have = s.strm.avail_out - have;\n left = s.strstart - s.block_start; /* bytes left in window */\n if (len > left + s.strm.avail_in) {\n len = left + s.strm.avail_in; /* limit len to the input */\n }\n if (len > have) {\n len = have; /* limit len to the output */\n }\n\n /* If the stored block would be less than min_block in length, or if\n * unable to copy all of the available input when flushing, then try\n * copying to the window and the pending buffer instead. Also don't\n * write an empty block when flushing -- deflate() does that.\n */\n if (len < min_block && ((len === 0 && flush !== Z_FINISH$3) ||\n flush === Z_NO_FLUSH$2 ||\n len !== left + s.strm.avail_in)) {\n break;\n }\n\n /* Make a dummy stored block in pending to get the header bytes,\n * including any pending bits. This also updates the debugging counts.\n */\n last = flush === Z_FINISH$3 && len === left + s.strm.avail_in ? 1 : 0;\n _tr_stored_block(s, 0, 0, last);\n\n /* Replace the lengths in the dummy stored block with len. */\n s.pending_buf[s.pending - 4] = len;\n s.pending_buf[s.pending - 3] = len >> 8;\n s.pending_buf[s.pending - 2] = ~len;\n s.pending_buf[s.pending - 1] = ~len >> 8;\n\n /* Write the stored block header bytes. */\n flush_pending(s.strm);\n\n//#ifdef ZLIB_DEBUG\n// /* Update debugging counts for the data about to be copied. */\n// s->compressed_len += len << 3;\n// s->bits_sent += len << 3;\n//#endif\n\n /* Copy uncompressed bytes from the window to next_out. */\n if (left) {\n if (left > len) {\n left = len;\n }\n //zmemcpy(s->strm->next_out, s->window + s->block_start, left);\n s.strm.output.set(s.window.subarray(s.block_start, s.block_start + left), s.strm.next_out);\n s.strm.next_out += left;\n s.strm.avail_out -= left;\n s.strm.total_out += left;\n s.block_start += left;\n len -= left;\n }\n\n /* Copy uncompressed bytes directly from next_in to next_out, updating\n * the check value.\n */\n if (len) {\n read_buf(s.strm, s.strm.output, s.strm.next_out, len);\n s.strm.next_out += len;\n s.strm.avail_out -= len;\n s.strm.total_out += len;\n }\n } while (last === 0);\n\n /* Update the sliding window with the last s->w_size bytes of the copied\n * data, or append all of the copied data to the existing window if less\n * than s->w_size bytes were copied. Also update the number of bytes to\n * insert in the hash tables, in the event that deflateParams() switches to\n * a non-zero compression level.\n */\n used -= s.strm.avail_in; /* number of input bytes directly copied */\n if (used) {\n /* If any input was used, then no unused input remains in the window,\n * therefore s->block_start == s->strstart.\n */\n if (used >= s.w_size) { /* supplant the previous history */\n s.matches = 2; /* clear hash */\n //zmemcpy(s->window, s->strm->next_in - s->w_size, s->w_size);\n s.window.set(s.strm.input.subarray(s.strm.next_in - s.w_size, s.strm.next_in), 0);\n s.strstart = s.w_size;\n s.insert = s.strstart;\n }\n else {\n if (s.window_size - s.strstart <= used) {\n /* Slide the window down. */\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n //zmemcpy(s->window + s->strstart, s->strm->next_in - used, used);\n s.window.set(s.strm.input.subarray(s.strm.next_in - used, s.strm.next_in), s.strstart);\n s.strstart += used;\n s.insert += used > s.w_size - s.insert ? s.w_size - s.insert : used;\n }\n s.block_start = s.strstart;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* If the last block was written to next_out, then done. */\n if (last) {\n return BS_FINISH_DONE;\n }\n\n /* If flushing and all input has been consumed, then done. */\n if (flush !== Z_NO_FLUSH$2 && flush !== Z_FINISH$3 &&\n s.strm.avail_in === 0 && s.strstart === s.block_start) {\n return BS_BLOCK_DONE;\n }\n\n /* Fill the window with any remaining input. */\n have = s.window_size - s.strstart;\n if (s.strm.avail_in > have && s.block_start >= s.w_size) {\n /* Slide the window down. */\n s.block_start -= s.w_size;\n s.strstart -= s.w_size;\n //zmemcpy(s->window, s->window + s->w_size, s->strstart);\n s.window.set(s.window.subarray(s.w_size, s.w_size + s.strstart), 0);\n if (s.matches < 2) {\n s.matches++; /* add a pending slide_hash() */\n }\n have += s.w_size; /* more space now */\n if (s.insert > s.strstart) {\n s.insert = s.strstart;\n }\n }\n if (have > s.strm.avail_in) {\n have = s.strm.avail_in;\n }\n if (have) {\n read_buf(s.strm, s.window, s.strstart, have);\n s.strstart += have;\n s.insert += have > s.w_size - s.insert ? s.w_size - s.insert : have;\n }\n if (s.high_water < s.strstart) {\n s.high_water = s.strstart;\n }\n\n /* There was not enough avail_out to write a complete worthy or flushed\n * stored block to next_out. Write a stored block to pending instead, if we\n * have enough input for a worthy block, or if flushing and there is enough\n * room for the remaining input as a stored block in the pending buffer.\n */\n have = (s.bi_valid + 42) >> 3; /* number of header bytes */\n /* maximum stored block length that will fit in pending: */\n have = s.pending_buf_size - have > 65535/* MAX_STORED */ ? 65535/* MAX_STORED */ : s.pending_buf_size - have;\n min_block = have > s.w_size ? s.w_size : have;\n left = s.strstart - s.block_start;\n if (left >= min_block ||\n ((left || flush === Z_FINISH$3) && flush !== Z_NO_FLUSH$2 &&\n s.strm.avail_in === 0 && left <= have)) {\n len = left > have ? have : left;\n last = flush === Z_FINISH$3 && s.strm.avail_in === 0 &&\n len === left ? 1 : 0;\n _tr_stored_block(s, s.block_start, len, last);\n s.block_start += len;\n flush_pending(s.strm);\n }\n\n /* We've done all we can with the available input and output. */\n return last ? BS_FINISH_STARTED : BS_NEED_MORE;\n};\n\n\n/* ===========================================================================\n * Compress as much as possible from the input stream, return the current\n * block state.\n * This function does not perform lazy evaluation of matches and inserts\n * new strings in the dictionary only for unmatched strings or for short\n * matches. It is used only for the fast compression options.\n */\nconst deflate_fast = (s, flush) => {\n\n let hash_head; /* head of the hash chain */\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n }\n if (s.match_length >= MIN_MATCH) {\n // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only\n\n /*** _tr_tally_dist(s, s.strstart - s.match_start,\n s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n\n /* Insert new strings in the hash table only if the match length\n * is not too large. This saves time but degrades compression.\n */\n if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\n s.strstart += s.match_length;\n s.match_length = 0;\n s.ins_h = s.window[s.strstart];\n /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + 1]);\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\n /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not\n * matter since it will be recomputed at next deflate call.\n */\n }\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s.window[s.strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * Same as above, but achieves better compression. We use a lazy\n * evaluation for matches: a match is finally adopted only if there is\n * no better match at the next window position.\n */\nconst deflate_slow = (s, flush) => {\n\n let hash_head; /* head of hash chain */\n let bflush; /* set if current block must be flushed */\n\n let max_insert;\n\n /* Process the input block. */\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the next match, plus MIN_MATCH bytes to insert the\n * string following the next match.\n */\n if (s.lookahead < MIN_LOOKAHEAD) {\n fill_window(s);\n if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* Insert the string window[strstart .. strstart+2] in the\n * dictionary, and set hash_head to the head of the hash chain:\n */\n hash_head = 0/*NIL*/;\n if (s.lookahead >= MIN_MATCH) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n\n /* Find the longest match, discarding those <= prev_length.\n */\n s.prev_length = s.match_length;\n s.prev_match = s.match_start;\n s.match_length = MIN_MATCH - 1;\n\n if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\n /* To simplify the code, we prevent matches with the string\n * of window index 0 (in particular we have to avoid a match\n * of the string with itself at the start of the input file).\n */\n s.match_length = longest_match(s, hash_head);\n /* longest_match() sets match_start */\n\n if (s.match_length <= 5 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) {\n\n /* If prev_match is also MIN_MATCH, match_start is garbage\n * but we will ignore the current match anyway.\n */\n s.match_length = MIN_MATCH - 1;\n }\n }\n /* If there was a match at the previous step and the current\n * match is not better, output the previous match:\n */\n if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) {\n max_insert = s.strstart + s.lookahead - MIN_MATCH;\n /* Do not insert strings in hash table beyond this. */\n\n //check_match(s, s.strstart-1, s.prev_match, s.prev_length);\n\n /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match,\n s.prev_length - MIN_MATCH, bflush);***/\n bflush = _tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH);\n /* Insert in hash table all strings up to the end of the match.\n * strstart-1 and strstart are already inserted. If there is not\n * enough lookahead, the last two strings are not inserted in\n * the hash table.\n */\n s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\n do {\n if (++s.strstart <= max_insert) {\n /*** INSERT_STRING(s, s.strstart, hash_head); ***/\n s.ins_h = HASH(s, s.ins_h, s.window[s.strstart + MIN_MATCH - 1]);\n hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h];\n s.head[s.ins_h] = s.strstart;\n /***/\n }\n } while (--s.prev_length !== 0);\n s.match_available = 0;\n s.match_length = MIN_MATCH - 1;\n s.strstart++;\n\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n } else if (s.match_available) {\n /* If there was no match at the previous position, output a\n * single literal. If there was a match but the current match\n * is longer, truncate the previous match to a single literal.\n */\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n if (bflush) {\n /*** FLUSH_BLOCK_ONLY(s, 0) ***/\n flush_block_only(s, false);\n /***/\n }\n s.strstart++;\n s.lookahead--;\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n } else {\n /* There is no previous match to compare with, wait for\n * the next step to decide.\n */\n s.match_available = 1;\n s.strstart++;\n s.lookahead--;\n }\n }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\n /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart - 1]);\n\n s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n};\n\n\n/* ===========================================================================\n * For Z_RLE, simply look for runs of bytes, generate matches only of distance\n * one. Do not maintain a hash table. (It will be regenerated if this run of\n * deflate switches away from Z_RLE.)\n */\nconst deflate_rle = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n let prev; /* byte at distance one to match */\n let scan, strend; /* scan goes up to strend for length of run */\n\n const _win = s.window;\n\n for (;;) {\n /* Make sure that we always have enough lookahead, except\n * at the end of the input file. We need MAX_MATCH bytes\n * for the longest run, plus one for the unrolled loop.\n */\n if (s.lookahead <= MAX_MATCH) {\n fill_window(s);\n if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\n }\n //Assert(scan <= s->window+(uInt)(s->window_size-1), \"wild scan\");\n }\n\n /* Emit match if have run of MIN_MATCH or longer, else emit literal */\n if (s.match_length >= MIN_MATCH) {\n //check_match(s, s.strstart, s.strstart - 1, s.match_length);\n\n /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/\n bflush = _tr_tally(s, 1, s.match_length - MIN_MATCH);\n\n s.lookahead -= s.match_length;\n s.strstart += s.match_length;\n s.match_length = 0;\n } else {\n /* No match, output a literal byte */\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* ===========================================================================\n * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table.\n * (It will be regenerated if this run of deflate switches away from Huffman.)\n */\nconst deflate_huff = (s, flush) => {\n\n let bflush; /* set if current block must be flushed */\n\n for (;;) {\n /* Make sure that we have a literal to write. */\n if (s.lookahead === 0) {\n fill_window(s);\n if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH$2) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\n /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = _tr_tally(s, 0, s.window[s.strstart]);\n s.lookahead--;\n s.strstart++;\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH$3) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.sym_next) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n};\n\n/* Values for max_lazy_match, good_match and max_chain_length, depending on\n * the desired pack level (0..9). The values given below have been tuned to\n * exclude worst case performance for pathological files. Better values may be\n * found for specific files.\n */\nfunction Config(good_length, max_lazy, nice_length, max_chain, func) {\n\n this.good_length = good_length;\n this.max_lazy = max_lazy;\n this.nice_length = nice_length;\n this.max_chain = max_chain;\n this.func = func;\n}\n\nconst configuration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nconst lm_init = (s) => {\n\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\n */\n s.max_lazy_match = configuration_table[s.level].max_lazy;\n s.good_match = configuration_table[s.level].good_length;\n s.nice_match = configuration_table[s.level].nice_length;\n s.max_chain_length = configuration_table[s.level].max_chain;\n\n s.strstart = 0;\n s.block_start = 0;\n s.lookahead = 0;\n s.insert = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n s.ins_h = 0;\n};\n\n\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED$2; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* w_size - 1 */\n\n this.window = null;\n /* Sliding window. Input bytes are read into the second half of the window,\n * and move to the first half later to keep a dictionary of at least wSize\n * bytes. With this organization, matches are limited to a distance of\n * wSize-MAX_MATCH bytes, but this ensures that IO is always\n * performed with a length multiple of the block size.\n */\n\n this.window_size = 0;\n /* Actual size of window: 2*wSize, except when the user input buffer\n * is directly used as sliding window.\n */\n\n this.prev = null;\n /* Link to older string with same hash index. To limit the size of this\n * array to 64K, this link is maintained only for the last 32K strings.\n * An index in this array is thus a window index modulo 32K.\n */\n\n this.head = null; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* hash_size-1 */\n\n this.hash_shift = 0;\n /* Number of bits by which ins_h must be shifted at each input\n * step. It must be such that after MIN_MATCH steps, the oldest\n * byte no longer takes part in the hash key, that is:\n * hash_shift * MIN_MATCH >= hash_bits\n */\n\n this.block_start = 0;\n /* Window position at the beginning of the current output block. Gets\n * negative when the window is moved backwards.\n */\n\n this.match_length = 0; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* number of valid bytes ahead in window */\n\n this.prev_length = 0;\n /* Length of the best match at previous step. Matches not greater than this\n * are discarded. This is used in the lazy match evaluation.\n */\n\n this.max_chain_length = 0;\n /* To speed up deflation, hash chains are never searched beyond this\n * length. A higher limit improves compression ratio but degrades the\n * speed.\n */\n\n this.max_lazy_match = 0;\n /* Attempt to find a better match only when the current match is strictly\n * smaller than this value. This mechanism is used only for compression\n * levels >= 4.\n */\n // That's alias to max_lazy_match, don't use directly\n //this.max_insert_length = 0;\n /* Insert new strings in the hash table only if the match length is not\n * greater than this length. This saves time but degrades compression.\n * max_insert_length is used only for compression levels <= 3.\n */\n\n this.level = 0; /* compression level (1..9) */\n this.strategy = 0; /* favor or force Huffman coding*/\n\n this.good_match = 0;\n /* Use a faster search when the previous match is longer than this */\n\n this.nice_match = 0; /* Stop searching when current match exceeds this */\n\n /* used by trees.c: */\n\n /* Didn't use ct_data typedef below to suppress compiler warning */\n\n // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */\n // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */\n // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */\n\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\n this.dyn_ltree = new Uint16Array(HEAP_SIZE * 2);\n this.dyn_dtree = new Uint16Array((2 * D_CODES + 1) * 2);\n this.bl_tree = new Uint16Array((2 * BL_CODES + 1) * 2);\n zero(this.dyn_ltree);\n zero(this.dyn_dtree);\n zero(this.bl_tree);\n\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new Uint16Array(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new Uint16Array(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\n /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.\n * The same heap array is used to build all trees.\n */\n\n this.depth = new Uint16Array(2 * L_CODES + 1); //uch depth[2*L_CODES+1];\n zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.sym_buf = 0; /* buffer for distances and literals/lengths */\n\n this.lit_bufsize = 0;\n /* Size of match buffer for literals/lengths. There are 4 reasons for\n * limiting lit_bufsize to 64K:\n * - frequencies can be kept in 16 bit counters\n * - if compression is not successful for the first block, all input\n * data is still in the window so we can still emit a stored block even\n * when input comes from standard input. (This can also be done for\n * all blocks if lit_bufsize is not greater than 32K.)\n * - if compression is not successful for a file smaller than 64K, we can\n * even emit a stored file instead of a stored block (saving 5 bytes).\n * This is applicable only for zip (not gzip or zlib).\n * - creating new Huffman trees less frequently may not provide fast\n * adaptation to changes in the input data statistics. (Take for\n * example a binary file with poorly compressible code followed by\n * a highly compressible string table.) Smaller buffer sizes give\n * fast adaptation but have of course the overhead of transmitting\n * trees more frequently.\n * - I can't count above 4\n */\n\n this.sym_next = 0; /* running index in sym_buf */\n this.sym_end = 0; /* symbol table full when sym_next reaches this */\n\n this.opt_len = 0; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\n */\n this.bi_valid = 0;\n /* Number of valid bits in bi_buf. All bits above the last valid bit\n * are always zero.\n */\n\n // Used for window memory init. We safely ignore it for JS. That makes\n // sense only for pointers and memory check tools.\n //this.high_water = 0;\n /* High water mark offset in window for initialized bytes -- bytes above\n * this are set to zero in order to avoid memory check warnings when\n * longest match routines access bytes past the input. This is then\n * updated to the new high water mark.\n */\n}\n\n\n/* =========================================================================\n * Check for a valid deflate stream state. Return 0 if ok, 1 if not.\n */\nconst deflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const s = strm.state;\n if (!s || s.strm !== strm || (s.status !== INIT_STATE &&\n//#ifdef GZIP\n s.status !== GZIP_STATE &&\n//#endif\n s.status !== EXTRA_STATE &&\n s.status !== NAME_STATE &&\n s.status !== COMMENT_STATE &&\n s.status !== HCRC_STATE &&\n s.status !== BUSY_STATE &&\n s.status !== FINISH_STATE)) {\n return 1;\n }\n return 0;\n};\n\n\nconst deflateResetKeep = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n strm.total_in = strm.total_out = 0;\n strm.data_type = Z_UNKNOWN;\n\n const s = strm.state;\n s.pending = 0;\n s.pending_out = 0;\n\n if (s.wrap < 0) {\n s.wrap = -s.wrap;\n /* was made negative by deflate(..., Z_FINISH); */\n }\n s.status =\n//#ifdef GZIP\n s.wrap === 2 ? GZIP_STATE :\n//#endif\n s.wrap ? INIT_STATE : BUSY_STATE;\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = -2;\n _tr_init(s);\n return Z_OK$3;\n};\n\n\nconst deflateReset = (strm) => {\n\n const ret = deflateResetKeep(strm);\n if (ret === Z_OK$3) {\n lm_init(strm.state);\n }\n return ret;\n};\n\n\nconst deflateSetHeader = (strm, head) => {\n\n if (deflateStateCheck(strm) || strm.state.wrap !== 2) {\n return Z_STREAM_ERROR$2;\n }\n strm.state.gzhead = head;\n return Z_OK$3;\n};\n\n\nconst deflateInit2 = (strm, level, method, windowBits, memLevel, strategy) => {\n\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR$2;\n }\n let wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION$1) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED$2 ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED || (windowBits === 8 && wrap !== 1)) {\n return err(strm, Z_STREAM_ERROR$2);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n const s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n s.status = INIT_STATE; /* to pass state test in deflateReset() */\n\n s.wrap = wrap;\n s.gzhead = null;\n s.w_bits = windowBits;\n s.w_size = 1 << s.w_bits;\n s.w_mask = s.w_size - 1;\n\n s.hash_bits = memLevel + 7;\n s.hash_size = 1 << s.hash_bits;\n s.hash_mask = s.hash_size - 1;\n s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH);\n\n s.window = new Uint8Array(s.w_size * 2);\n s.head = new Uint16Array(s.hash_size);\n s.prev = new Uint16Array(s.w_size);\n\n // Don't need mem init magic for JS.\n //s.high_water = 0; /* nothing written to s->window yet */\n\n s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */\n\n /* We overlay pending_buf and sym_buf. This works since the average size\n * for length/distance pairs over any compressed block is assured to be 31\n * bits or less.\n *\n * Analysis: The longest fixed codes are a length code of 8 bits plus 5\n * extra bits, for lengths 131 to 257. The longest fixed distance codes are\n * 5 bits plus 13 extra bits, for distances 16385 to 32768. The longest\n * possible fixed-codes length/distance pair is then 31 bits total.\n *\n * sym_buf starts one-fourth of the way into pending_buf. So there are\n * three bytes in sym_buf for every four bytes in pending_buf. Each symbol\n * in sym_buf is three bytes -- two for the distance and one for the\n * literal/length. As each symbol is consumed, the pointer to the next\n * sym_buf value to read moves forward three bytes. From that symbol, up to\n * 31 bits are written to pending_buf. The closest the written pending_buf\n * bits gets to the next sym_buf symbol to read is just before the last\n * code is written. At that time, 31*(n-2) bits have been written, just\n * after 24*(n-2) bits have been consumed from sym_buf. sym_buf starts at\n * 8*n bits into pending_buf. (Note that the symbol buffer fills when n-1\n * symbols are written.) The closest the writing gets to what is unread is\n * then n+14 bits. Here n is lit_bufsize, which is 16384 by default, and\n * can range from 128 to 32768.\n *\n * Therefore, at a minimum, there are 142 bits of space between what is\n * written and what is read in the overlain buffers, so the symbols cannot\n * be overwritten by the compressed data. That space is actually 139 bits,\n * due to the three-bit fixed-code block header.\n *\n * That covers the case where either Z_FIXED is specified, forcing fixed\n * codes, or when the use of fixed codes is chosen, because that choice\n * results in a smaller compressed block than dynamic codes. That latter\n * condition then assures that the above analysis also covers all dynamic\n * blocks. A dynamic-code block will only be chosen to be emitted if it has\n * fewer bits than a fixed-code block would for the same set of symbols.\n * Therefore its average symbol length is assured to be less than 31. So\n * the compressed data for a dynamic block also cannot overwrite the\n * symbols from which it is being constructed.\n */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n s.pending_buf = new Uint8Array(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->sym_buf = s->pending_buf + s->lit_bufsize;\n s.sym_buf = s.lit_bufsize;\n\n //s->sym_end = (s->lit_bufsize - 1) * 3;\n s.sym_end = (s.lit_bufsize - 1) * 3;\n /* We avoid equality with lit_bufsize*3 because of wraparound at 64K\n * on 16 bit machines and because stored blocks are restricted to\n * 64K-1 bytes.\n */\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n};\n\nconst deflateInit = (strm, level) => {\n\n return deflateInit2(strm, level, Z_DEFLATED$2, MAX_WBITS$1, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY$1);\n};\n\n\n/* ========================================================================= */\nconst deflate$2 = (strm, flush) => {\n\n if (deflateStateCheck(strm) || flush > Z_BLOCK$1 || flush < 0) {\n return strm ? err(strm, Z_STREAM_ERROR$2) : Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n\n if (!strm.output ||\n (strm.avail_in !== 0 && !strm.input) ||\n (s.status === FINISH_STATE && flush !== Z_FINISH$3)) {\n return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR$1 : Z_STREAM_ERROR$2);\n }\n\n const old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\n if (strm.avail_out === 0) {\n /* Since avail_out is 0, deflate will be called again with\n * more output space, but possibly with both pending and\n * avail_in equal to zero. There won't be anything to do,\n * but this is not an error situation so make sure we\n * return OK instead of BUF_ERROR at next call of deflate:\n */\n s.last_flush = -1;\n return Z_OK$3;\n }\n\n /* Make sure there is something to do and avoid duplicate consecutive\n * flushes. For repeated and useless calls with Z_FINISH, we keep\n * returning Z_STREAM_END instead of Z_BUF_ERROR.\n */\n } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH$3) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR$1);\n }\n\n /* Write the header */\n if (s.status === INIT_STATE && s.wrap === 0) {\n s.status = BUSY_STATE;\n }\n if (s.status === INIT_STATE) {\n /* zlib header */\n let header = (Z_DEFLATED$2 + ((s.w_bits - 8) << 4)) << 8;\n let level_flags = -1;\n\n if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) {\n level_flags = 0;\n } else if (s.level < 6) {\n level_flags = 1;\n } else if (s.level === 6) {\n level_flags = 2;\n } else {\n level_flags = 3;\n }\n header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#ifdef GZIP\n if (s.status === GZIP_STATE) {\n /* gzip header */\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // s->gzhead == Z_NULL\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, 0);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\n put_byte(s, s.gzhead.time & 0xff);\n put_byte(s, (s.gzhead.time >> 8) & 0xff);\n put_byte(s, (s.gzhead.time >> 16) & 0xff);\n put_byte(s, (s.gzhead.time >> 24) & 0xff);\n put_byte(s, s.level === 9 ? 2 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\n if (s.gzhead.extra && s.gzhead.extra.length) {\n put_byte(s, s.gzhead.extra.length & 0xff);\n put_byte(s, (s.gzhead.extra.length >> 8) & 0xff);\n }\n if (s.gzhead.hcrc) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\n }\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let left = (s.gzhead.extra.length & 0xffff) - s.gzindex;\n while (s.pending + left > s.pending_buf_size) {\n let copy = s.pending_buf_size - s.pending;\n // zmemcpy(s.pending_buf + s.pending,\n // s.gzhead.extra + s.gzindex, copy);\n s.pending_buf.set(s.gzhead.extra.subarray(s.gzindex, s.gzindex + copy), s.pending);\n s.pending = s.pending_buf_size;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex += copy;\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n left -= copy;\n }\n // JS specific: s.gzhead.extra may be TypedArray or Array for backward compatibility\n // TypedArray.slice and TypedArray.from don't exist in IE10-IE11\n let gzhead_extra = new Uint8Array(s.gzhead.extra);\n // zmemcpy(s->pending_buf + s->pending,\n // s->gzhead->extra + s->gzindex, left);\n s.pending_buf.set(gzhead_extra.subarray(s.gzindex, s.gzindex + left), s.pending);\n s.pending += left;\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = NAME_STATE;\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n s.gzindex = 0;\n }\n s.status = COMMENT_STATE;\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n let beg = s.pending; /* start of bytes to update crc */\n let val;\n do {\n if (s.pending === s.pending_buf_size) {\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n beg = 0;\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\n }\n put_byte(s, val);\n } while (val !== 0);\n //--- HCRC_UPDATE(beg) ---//\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32_1(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n //---//\n }\n s.status = HCRC_STATE;\n }\n if (s.status === HCRC_STATE) {\n if (s.gzhead.hcrc) {\n if (s.pending + 2 > s.pending_buf_size) {\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n }\n s.status = BUSY_STATE;\n\n /* Compression must start with an empty pending buffer */\n flush_pending(strm);\n if (s.pending !== 0) {\n s.last_flush = -1;\n return Z_OK$3;\n }\n }\n//#endif\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH$2 && s.status !== FINISH_STATE)) {\n let bstate = s.level === 0 ? deflate_stored(s, flush) :\n s.strategy === Z_HUFFMAN_ONLY ? deflate_huff(s, flush) :\n s.strategy === Z_RLE ? deflate_rle(s, flush) :\n configuration_table[s.level].func(s, flush);\n\n if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) {\n s.status = FINISH_STATE;\n }\n if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) {\n if (strm.avail_out === 0) {\n s.last_flush = -1;\n /* avoid BUF_ERROR next call, see above */\n }\n return Z_OK$3;\n /* If flush != Z_NO_FLUSH && avail_out == 0, the next call\n * of deflate should use the same flush parameter to make sure\n * that the flush is complete. So we don't have to output an\n * empty block here, this will be done at next call. This also\n * ensures that for a very small output buffer, we emit at most\n * one empty block.\n */\n }\n if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n _tr_align(s);\n }\n else if (flush !== Z_BLOCK$1) { /* FULL_FLUSH or SYNC_FLUSH */\n\n _tr_stored_block(s, 0, 0, false);\n /* For a full flush, this empty block will be recognized\n * as a special marker by inflate_sync().\n */\n if (flush === Z_FULL_FLUSH$1) {\n /*** CLEAR_HASH(s); ***/ /* forget history */\n zero(s.head); // Fill with NIL (= 0);\n\n if (s.lookahead === 0) {\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n }\n }\n flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK$3;\n }\n }\n }\n\n if (flush !== Z_FINISH$3) { return Z_OK$3; }\n if (s.wrap <= 0) { return Z_STREAM_END$3; }\n\n /* Write the trailer */\n if (s.wrap === 2) {\n put_byte(s, strm.adler & 0xff);\n put_byte(s, (strm.adler >> 8) & 0xff);\n put_byte(s, (strm.adler >> 16) & 0xff);\n put_byte(s, (strm.adler >> 24) & 0xff);\n put_byte(s, strm.total_in & 0xff);\n put_byte(s, (strm.total_in >> 8) & 0xff);\n put_byte(s, (strm.total_in >> 16) & 0xff);\n put_byte(s, (strm.total_in >> 24) & 0xff);\n }\n else\n {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n\n flush_pending(strm);\n /* If avail_out is zero, the application will call deflate again\n * to flush the rest.\n */\n if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK$3 : Z_STREAM_END$3;\n};\n\n\nconst deflateEnd = (strm) => {\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const status = strm.state.status;\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR$2) : Z_OK$3;\n};\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nconst deflateSetDictionary = (strm, dictionary) => {\n\n let dictLength = dictionary.length;\n\n if (deflateStateCheck(strm)) {\n return Z_STREAM_ERROR$2;\n }\n\n const s = strm.state;\n const wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR$2;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32_1(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n let tmpDict = new Uint8Array(s.w_size);\n tmpDict.set(dictionary.subarray(dictLength - s.w_size, dictLength), 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n const avail = strm.avail_in;\n const next = strm.next_in;\n const input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n let str = s.strstart;\n let n = s.lookahead - (MIN_MATCH - 1);\n do {\n /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */\n s.ins_h = HASH(s, s.ins_h, s.window[str + MIN_MATCH - 1]);\n\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK$3;\n};\n\n\nvar deflateInit_1 = deflateInit;\nvar deflateInit2_1 = deflateInit2;\nvar deflateReset_1 = deflateReset;\nvar deflateResetKeep_1 = deflateResetKeep;\nvar deflateSetHeader_1 = deflateSetHeader;\nvar deflate_2$1 = deflate$2;\nvar deflateEnd_1 = deflateEnd;\nvar deflateSetDictionary_1 = deflateSetDictionary;\nvar deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.deflateBound = deflateBound;\nmodule.exports.deflateCopy = deflateCopy;\nmodule.exports.deflateGetDictionary = deflateGetDictionary;\nmodule.exports.deflateParams = deflateParams;\nmodule.exports.deflatePending = deflatePending;\nmodule.exports.deflatePrime = deflatePrime;\nmodule.exports.deflateTune = deflateTune;\n*/\n\nvar deflate_1$2 = {\n\tdeflateInit: deflateInit_1,\n\tdeflateInit2: deflateInit2_1,\n\tdeflateReset: deflateReset_1,\n\tdeflateResetKeep: deflateResetKeep_1,\n\tdeflateSetHeader: deflateSetHeader_1,\n\tdeflate: deflate_2$1,\n\tdeflateEnd: deflateEnd_1,\n\tdeflateSetDictionary: deflateSetDictionary_1,\n\tdeflateInfo: deflateInfo\n};\n\nconst _has = (obj, key) => {\n return Object.prototype.hasOwnProperty.call(obj, key);\n};\n\nvar assign = function (obj /*from1, from2, from3, ...*/) {\n const sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n const source = sources.shift();\n if (!source) { continue; }\n\n if (typeof source !== 'object') {\n throw new TypeError(source + 'must be non-object');\n }\n\n for (const p in source) {\n if (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// Join array of chunks to single array.\nvar flattenChunks = (chunks) => {\n // calculate data length\n let len = 0;\n\n for (let i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n const result = new Uint8Array(len);\n\n for (let i = 0, pos = 0, l = chunks.length; i < l; i++) {\n let chunk = chunks[i];\n result.set(chunk, pos);\n pos += chunk.length;\n }\n\n return result;\n};\n\nvar common = {\n\tassign: assign,\n\tflattenChunks: flattenChunks\n};\n\n// String encode/decode helpers\n\n\n// Quick check if we can use fast array to bin string conversion\n//\n// - apply(Array) can fail on Android 2.2\n// - apply(Uint8Array) can fail on iOS 5.1 Safari\n//\nlet STR_APPLY_UIA_OK = true;\n\ntry { String.fromCharCode.apply(null, new Uint8Array(1)); } catch (__) { STR_APPLY_UIA_OK = false; }\n\n\n// Table with utf8 lengths (calculated by first byte of sequence)\n// Note, that 5 & 6-byte values and some 4-byte values can not be represented in JS,\n// because max possible codepoint is 0x10ffff\nconst _utf8len = new Uint8Array(256);\nfor (let q = 0; q < 256; q++) {\n _utf8len[q] = (q >= 252 ? 6 : q >= 248 ? 5 : q >= 240 ? 4 : q >= 224 ? 3 : q >= 192 ? 2 : 1);\n}\n_utf8len[254] = _utf8len[254] = 1; // Invalid sequence start\n\n\n// convert string to array (typed, when possible)\nvar string2buf = (str) => {\n if (typeof TextEncoder === 'function' && TextEncoder.prototype.encode) {\n return new TextEncoder().encode(str);\n }\n\n let buf, c, c2, m_pos, i, str_len = str.length, buf_len = 0;\n\n // count binary size\n for (m_pos = 0; m_pos < str_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n buf_len += c < 0x80 ? 1 : c < 0x800 ? 2 : c < 0x10000 ? 3 : 4;\n }\n\n // allocate buffer\n buf = new Uint8Array(buf_len);\n\n // convert\n for (i = 0, m_pos = 0; i < buf_len; m_pos++) {\n c = str.charCodeAt(m_pos);\n if ((c & 0xfc00) === 0xd800 && (m_pos + 1 < str_len)) {\n c2 = str.charCodeAt(m_pos + 1);\n if ((c2 & 0xfc00) === 0xdc00) {\n c = 0x10000 + ((c - 0xd800) << 10) + (c2 - 0xdc00);\n m_pos++;\n }\n }\n if (c < 0x80) {\n /* one byte */\n buf[i++] = c;\n } else if (c < 0x800) {\n /* two bytes */\n buf[i++] = 0xC0 | (c >>> 6);\n buf[i++] = 0x80 | (c & 0x3f);\n } else if (c < 0x10000) {\n /* three bytes */\n buf[i++] = 0xE0 | (c >>> 12);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n } else {\n /* four bytes */\n buf[i++] = 0xf0 | (c >>> 18);\n buf[i++] = 0x80 | (c >>> 12 & 0x3f);\n buf[i++] = 0x80 | (c >>> 6 & 0x3f);\n buf[i++] = 0x80 | (c & 0x3f);\n }\n }\n\n return buf;\n};\n\n// Helper\nconst buf2binstring = (buf, len) => {\n // On Chrome, the arguments in a function call that are allowed is `65534`.\n // If the length of the buffer is smaller than that, we can use this optimization,\n // otherwise we will take a slower path.\n if (len < 65534) {\n if (buf.subarray && STR_APPLY_UIA_OK) {\n return String.fromCharCode.apply(null, buf.length === len ? buf : buf.subarray(0, len));\n }\n }\n\n let result = '';\n for (let i = 0; i < len; i++) {\n result += String.fromCharCode(buf[i]);\n }\n return result;\n};\n\n\n// convert array to string\nvar buf2string = (buf, max) => {\n const len = max || buf.length;\n\n if (typeof TextDecoder === 'function' && TextDecoder.prototype.decode) {\n return new TextDecoder().decode(buf.subarray(0, max));\n }\n\n let i, out;\n\n // Reserve max possible length (2 words per char)\n // NB: by unknown reasons, Array is significantly faster for\n // String.fromCharCode.apply than Uint16Array.\n const utf16buf = new Array(len * 2);\n\n for (out = 0, i = 0; i < len;) {\n let c = buf[i++];\n // quick process ascii\n if (c < 0x80) { utf16buf[out++] = c; continue; }\n\n let c_len = _utf8len[c];\n // skip 5 & 6 byte codes\n if (c_len > 4) { utf16buf[out++] = 0xfffd; i += c_len - 1; continue; }\n\n // apply mask on first byte\n c &= c_len === 2 ? 0x1f : c_len === 3 ? 0x0f : 0x07;\n // join the rest\n while (c_len > 1 && i < len) {\n c = (c << 6) | (buf[i++] & 0x3f);\n c_len--;\n }\n\n // terminated by end of string?\n if (c_len > 1) { utf16buf[out++] = 0xfffd; continue; }\n\n if (c < 0x10000) {\n utf16buf[out++] = c;\n } else {\n c -= 0x10000;\n utf16buf[out++] = 0xd800 | ((c >> 10) & 0x3ff);\n utf16buf[out++] = 0xdc00 | (c & 0x3ff);\n }\n }\n\n return buf2binstring(utf16buf, out);\n};\n\n\n// Calculate max possible position in utf8 buffer,\n// that will not break sequence. If that's not possible\n// - (very small limits) return max size as is.\n//\n// buf[] - utf8 bytes array\n// max - length limit (mandatory);\nvar utf8border = (buf, max) => {\n\n max = max || buf.length;\n if (max > buf.length) { max = buf.length; }\n\n // go back from last position, until start of sequence found\n let pos = max - 1;\n while (pos >= 0 && (buf[pos] & 0xC0) === 0x80) { pos--; }\n\n // Very small and broken sequence,\n // return max, because we should return something anyway.\n if (pos < 0) { return max; }\n\n // If we came to start of buffer - that means buffer is too small,\n // return max too.\n if (pos === 0) { return max; }\n\n return (pos + _utf8len[buf[pos]] > max) ? pos : max;\n};\n\nvar strings = {\n\tstring2buf: string2buf,\n\tbuf2string: buf2string,\n\tutf8border: utf8border\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nvar zstream = ZStream;\n\nconst toString$1 = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH: Z_NO_FLUSH$1, Z_SYNC_FLUSH, Z_FULL_FLUSH, Z_FINISH: Z_FINISH$2,\n Z_OK: Z_OK$2, Z_STREAM_END: Z_STREAM_END$2,\n Z_DEFAULT_COMPRESSION,\n Z_DEFAULT_STRATEGY,\n Z_DEFLATED: Z_DEFLATED$1\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Deflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[deflate]],\n * [[deflateRaw]] and [[gzip]].\n **/\n\n/* internal\n * Deflate.chunks -> Array\n *\n * Chunks of output data, if [[Deflate#onData]] not overridden.\n **/\n\n/**\n * Deflate.result -> Uint8Array\n *\n * Compressed result, generated by default [[Deflate#onData]]\n * and [[Deflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Deflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Deflate.err -> Number\n *\n * Error code after deflate finished. 0 (Z_OK) on success.\n * You will not need it in real life, because deflate errors\n * are possible only on wrong options or bad `onData` / `onEnd`\n * custom handlers.\n **/\n\n/**\n * Deflate.msg -> String\n *\n * Error message, if [[Deflate.err]] != 0\n **/\n\n\n/**\n * new Deflate(options)\n * - options (Object): zlib deflate options.\n *\n * Creates new deflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `level`\n * - `windowBits`\n * - `memLevel`\n * - `strategy`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw deflate\n * - `gzip` (Boolean) - create gzip wrapper\n * - `header` (Object) - custom header for gzip\n * - `text` (Boolean) - true if compressed data believed to be text\n * - `time` (Number) - modification time, unix timestamp\n * - `os` (Number) - operation system code\n * - `extra` (Array) - array of bytes with extra data (max 65536)\n * - `name` (String) - file name (binary string)\n * - `comment` (String) - comment (binary string)\n * - `hcrc` (Boolean) - true if header crc should be added\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * , chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * , chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const deflate = new pako.Deflate({ level: 3});\n *\n * deflate.push(chunk1, false);\n * deflate.push(chunk2, true); // true -> last chunk\n *\n * if (deflate.err) { throw new Error(deflate.err); }\n *\n * console.log(deflate.result);\n * ```\n **/\nfunction Deflate$1(options) {\n this.options = common.assign({\n level: Z_DEFAULT_COMPRESSION,\n method: Z_DEFLATED$1,\n chunkSize: 16384,\n windowBits: 15,\n memLevel: 8,\n strategy: Z_DEFAULT_STRATEGY\n }, options || {});\n\n let opt = this.options;\n\n if (opt.raw && (opt.windowBits > 0)) {\n opt.windowBits = -opt.windowBits;\n }\n\n else if (opt.gzip && (opt.windowBits > 0) && (opt.windowBits < 16)) {\n opt.windowBits += 16;\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = deflate_1$2.deflateInit2(\n this.strm,\n opt.level,\n opt.method,\n opt.windowBits,\n opt.memLevel,\n opt.strategy\n );\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n if (opt.header) {\n deflate_1$2.deflateSetHeader(this.strm, opt.header);\n }\n\n if (opt.dictionary) {\n let dict;\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n // If we need to compress text, change encoding to utf8.\n dict = strings.string2buf(opt.dictionary);\n } else if (toString$1.call(opt.dictionary) === '[object ArrayBuffer]') {\n dict = new Uint8Array(opt.dictionary);\n } else {\n dict = opt.dictionary;\n }\n\n status = deflate_1$2.deflateSetDictionary(this.strm, dict);\n\n if (status !== Z_OK$2) {\n throw new Error(messages[status]);\n }\n\n this._dict_set = true;\n }\n}\n\n/**\n * Deflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer|String): input data. Strings will be\n * converted to utf8 byte sequence.\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE modes.\n * See constants. Skipped or `false` means Z_NO_FLUSH, `true` means Z_FINISH.\n *\n * Sends input data to deflate pipe, generating [[Deflate#onData]] calls with\n * new compressed chunks. Returns `true` on success. The last data block must\n * have `flush_mode` Z_FINISH (or `true`). That will flush internal pending\n * buffers and call [[Deflate#onEnd]].\n *\n * On fail call [[Deflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nDeflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n let status, _flush_mode;\n\n if (this.ended) { return false; }\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH$2 : Z_NO_FLUSH$1;\n\n // Convert data if needed\n if (typeof data === 'string') {\n // If we need to compress text, change encoding to utf8.\n strm.input = strings.string2buf(data);\n } else if (toString$1.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n // Make sure avail_out > 6 to avoid repeating markers\n if ((_flush_mode === Z_SYNC_FLUSH || _flush_mode === Z_FULL_FLUSH) && strm.avail_out <= 6) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n status = deflate_1$2.deflate(strm, _flush_mode);\n\n // Ended => flush and finish\n if (status === Z_STREAM_END$2) {\n if (strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n }\n status = deflate_1$2.deflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return status === Z_OK$2;\n }\n\n // Flush if out buffer full\n if (strm.avail_out === 0) {\n this.onData(strm.output);\n continue;\n }\n\n // Flush if requested and has data\n if (_flush_mode > 0 && strm.next_out > 0) {\n this.onData(strm.output.subarray(0, strm.next_out));\n strm.avail_out = 0;\n continue;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Deflate#onData(chunk) -> Void\n * - chunk (Uint8Array): output data.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nDeflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Deflate#onEnd(status) -> Void\n * - status (Number): deflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called once after you tell deflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nDeflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK$2) {\n this.result = common.flattenChunks(this.chunks);\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * deflate(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * Compress `data` with deflate algorithm and `options`.\n *\n * Supported options are:\n *\n * - level\n * - windowBits\n * - memLevel\n * - strategy\n * - dictionary\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const data = new Uint8Array([1,2,3,4,5,6,7,8,9]);\n *\n * console.log(pako.deflate(data));\n * ```\n **/\nfunction deflate$1(input, options) {\n const deflator = new Deflate$1(options);\n\n deflator.push(input, true);\n\n // That will never happens, if you don't cheat with options :)\n if (deflator.err) { throw deflator.msg || messages[deflator.err]; }\n\n return deflator.result;\n}\n\n\n/**\n * deflateRaw(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction deflateRaw$1(input, options) {\n options = options || {};\n options.raw = true;\n return deflate$1(input, options);\n}\n\n\n/**\n * gzip(data[, options]) -> Uint8Array\n * - data (Uint8Array|ArrayBuffer|String): input data to compress.\n * - options (Object): zlib deflate options.\n *\n * The same as [[deflate]], but create gzip wrapper instead of\n * deflate one.\n **/\nfunction gzip$1(input, options) {\n options = options || {};\n options.gzip = true;\n return deflate$1(input, options);\n}\n\n\nvar Deflate_1$1 = Deflate$1;\nvar deflate_2 = deflate$1;\nvar deflateRaw_1$1 = deflateRaw$1;\nvar gzip_1$1 = gzip$1;\nvar constants$1 = constants$2;\n\nvar deflate_1$1 = {\n\tDeflate: Deflate_1$1,\n\tdeflate: deflate_2,\n\tdeflateRaw: deflateRaw_1$1,\n\tgzip: gzip_1$1,\n\tconstants: constants$1\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nconst BAD$1 = 16209; /* got a data error -- remain here until reset */\nconst TYPE$1 = 16191; /* i: waiting for type bits, including last-flag bit */\n\n/*\n Decode literal, length, and distance codes and write out the resulting\n literal and match bytes until either not enough input or output is\n available, an end-of-block is encountered, or a data error is encountered.\n When large enough input and output buffers are supplied to inflate(), for\n example, a 16K input buffer and a 64K output buffer, more than 95% of the\n inflate execution time is spent in this routine.\n\n Entry assumptions:\n\n state.mode === LEN\n strm.avail_in >= 6\n strm.avail_out >= 258\n start >= strm.avail_out\n state.bits < 8\n\n On return, state.mode is one of:\n\n LEN -- ran out of enough output space or enough available input\n TYPE -- reached end of block code, inflate() to interpret next block\n BAD -- error in block data\n\n Notes:\n\n - The maximum input bits used by a length/distance pair is 15 bits for the\n length code, 5 bits for the length extra, 15 bits for the distance code,\n and 13 bits for the distance extra. This totals 48 bits, or six bytes.\n Therefore if strm.avail_in >= 6, then there is enough input to avoid\n checking for available input while decoding.\n\n - The maximum bytes that a single length/distance pair can output is 258\n bytes, which is the maximum length that can be coded. inflate_fast()\n requires strm.avail_out >= 258 for each loop to avoid checking for\n output space.\n */\nvar inffast = function inflate_fast(strm, start) {\n let _in; /* local strm.input */\n let last; /* have enough input while in < last */\n let _out; /* local strm.output */\n let beg; /* inflate()'s initial strm.output */\n let end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n let dmax; /* maximum distance from zlib header */\n//#endif\n let wsize; /* window size or zero if not using window */\n let whave; /* valid bytes in the window */\n let wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n let s_window; /* allocated sliding window, if wsize != 0 */\n let hold; /* local strm.hold */\n let bits; /* local strm.bits */\n let lcode; /* local strm.lencode */\n let dcode; /* local strm.distcode */\n let lmask; /* mask for first level of length codes */\n let dmask; /* mask for first level of distance codes */\n let here; /* retrieved table entry */\n let op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n let len; /* match length, unused bytes */\n let dist; /* match distance */\n let from; /* where to copy match from */\n let from_source;\n\n\n let input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n const state = strm.state;\n //here = state.here;\n _in = strm.next_in;\n input = strm.input;\n last = _in + (strm.avail_in - 5);\n _out = strm.next_out;\n output = strm.output;\n beg = _out - (start - strm.avail_out);\n end = _out + (strm.avail_out - 257);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_window = state.window;\n hold = state.hold;\n bits = state.bits;\n lcode = state.lencode;\n dcode = state.distcode;\n lmask = (1 << state.lenbits) - 1;\n dmask = (1 << state.distbits) - 1;\n\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n do {\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n\n here = lcode[hold & lmask];\n\n dolen:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* literal */\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n output[_out++] = here & 0xffff/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD$1;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// if (len <= op - whave) {\n// do {\n// output[_out++] = 0;\n// } while (--len);\n// continue top;\n// }\n// len -= op - whave;\n// do {\n// output[_out++] = 0;\n// } while (--op > whave);\n// if (op === 0) {\n// from = _out - dist;\n// do {\n// output[_out++] = output[from++];\n// } while (--len);\n// continue top;\n// }\n//#endif\n }\n from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n while (len > 2) {\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n output[_out++] = from_source[from++];\n len -= 3;\n }\n if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* minimum length is three */\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n output[_out++] = output[from++];\n len -= 3;\n } while (len > 2);\n if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\n else {\n strm.msg = 'invalid distance code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE$1;\n break top;\n }\n else {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD$1;\n break top;\n }\n\n break; // need to emulate goto via \"continue\"\n }\n } while (_in < last && _out < end);\n\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\n strm.next_in = _in;\n strm.next_out = _out;\n strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last));\n strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end));\n state.hold = hold;\n state.bits = bits;\n return;\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nconst MAXBITS = 15;\nconst ENOUGH_LENS$1 = 852;\nconst ENOUGH_DISTS$1 = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst CODES$1 = 0;\nconst LENS$1 = 1;\nconst DISTS$1 = 2;\n\nconst lbase = new Uint16Array([ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n]);\n\nconst lext = new Uint8Array([ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n]);\n\nconst dbase = new Uint16Array([ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n]);\n\nconst dext = new Uint8Array([ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n]);\n\nconst inflate_table = (type, lens, lens_index, codes, table, table_index, work, opts) =>\n{\n const bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n let len = 0; /* a code's length in bits */\n let sym = 0; /* index of code symbols */\n let min = 0, max = 0; /* minimum and maximum code lengths */\n let root = 0; /* number of index bits for root table */\n let curr = 0; /* number of index bits for current table */\n let drop = 0; /* code bits to drop for sub-table */\n let left = 0; /* number of prefix codes available */\n let used = 0; /* code entries in table used */\n let huff = 0; /* Huffman code */\n let incr; /* for incrementing code, index */\n let fill; /* index for replicating entries */\n let low; /* low bits for current root entry */\n let mask; /* mask for low root bits */\n let next; /* next available space in table */\n let base = null; /* base value table to use */\n// let shoextra; /* extra bits table to use */\n let match; /* use base and extra for symbol >= match */\n const count = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n const offs = new Uint16Array(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n let extra = null;\n\n let here_bits, here_op, here_val;\n\n /*\n Process a set of code lengths to create a canonical Huffman code. The\n code lengths are lens[0..codes-1]. Each length corresponds to the\n symbols 0..codes-1. The Huffman code is generated by first sorting the\n symbols by length from short to long, and retaining the symbol order\n for codes with equal lengths. Then the code starts with all zero bits\n for the first code of the shortest length, and the codes are integer\n increments for the same length, and zeros are appended as the length\n increases. For the deflate format, these bits are stored backwards\n from their more natural integer increment ordering, and so when the\n decoding tables are built in the large loop below, the integer codes\n are incremented backwards.\n\n This routine assumes, but does not check, that all of the entries in\n lens[] are in the range 0..MAXBITS. The caller must assure this.\n 1..MAXBITS is interpreted as that code length. zero means that that\n symbol does not occur in this code.\n\n The codes are sorted by computing a count of codes for each length,\n creating from that a table of starting indices for each length in the\n sorted table, and then entering the symbols in order in the sorted\n table. The sorted table is work[], with that space being provided by\n the caller.\n\n The length counts are used for other purposes as well, i.e. finding\n the minimum and maximum length codes, determining if there are any\n codes at all, checking for a valid set of lengths, and looking ahead\n at length counts to determine sub-table sizes when building the\n decoding tables.\n */\n\n /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */\n for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* no symbols to code at all */\n //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */\n //table.bits[opts.table_index] = 1; //here.bits = (var char)1;\n //table.val[opts.table_index++] = 0; //here.val = (var short)0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES$1 || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\n for (sym = 0; sym < codes; sym++) {\n if (lens[lens_index + sym] !== 0) {\n work[offs[lens[lens_index + sym]]++] = sym;\n }\n }\n\n /*\n Create and fill in decoding tables. In this loop, the table being\n filled is at next and has curr index bits. The code being used is huff\n with length len. That code is converted to an index by dropping drop\n bits off of the bottom. For codes where len is less than drop + curr,\n those top drop + curr - len bits are incremented through all values to\n fill the table with replicated entries.\n\n root is the number of index bits for the root table. When len exceeds\n root, sub-tables are created pointed to by the root entry with an index\n of the low root bits of huff. This is saved in low to check for when a\n new sub-table should be started. drop is zero when the root table is\n being filled, and drop is root when sub-tables are being filled.\n\n When a new sub-table is needed, it is necessary to look ahead in the\n code lengths to determine what size sub-table is needed. The length\n counts are used for this, and so count[] is decremented as codes are\n entered in the tables.\n\n used keeps track of how many table entries have been allocated from the\n provided *table space. It is checked for LENS and DIST tables against\n the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in\n the initial root table size constants. See the comments in inftrees.h\n for more information.\n\n sym increments through all symbols, and the loop terminates when\n all codes of length max, i.e. all codes, have been processed. This\n routine permits incomplete codes, so another loop after this one fills\n in the rest of the decoding tables with invalid code markers.\n */\n\n /* set up for code type */\n // poor man optimization - use if-else instead of switch,\n // to avoid deopts in old v8\n if (type === CODES$1) {\n base = extra = work; /* dummy value--not used */\n match = 20;\n\n } else if (type === LENS$1) {\n base = lbase;\n extra = lext;\n match = 257;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n match = 0;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] + 1 < match) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] >= match) {\n here_op = extra[work[sym] - match];\n here_val = base[work[sym] - match];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\n do {\n fill -= incr;\n table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0;\n } while (fill !== 0);\n\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS$1 && used > ENOUGH_LENS$1) ||\n (type === DISTS$1 && used > ENOUGH_DISTS$1)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\n }\n\n /* fill in remaining table entry if code is incomplete (guaranteed to have\n at most one remaining entry, since if the code is incomplete, the\n maximum code length that was allowed to get this far is one bit) */\n if (huff !== 0) {\n //table.op[next + huff] = 64; /* invalid code marker */\n //table.bits[next + huff] = len - drop;\n //table.val[next + huff] = 0;\n table[next + huff] = ((len - drop) << 24) | (64 << 16) |0;\n }\n\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n\n\nvar inftrees = inflate_table;\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n\n\n\n\n\nconst CODES = 0;\nconst LENS = 1;\nconst DISTS = 2;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_FINISH: Z_FINISH$1, Z_BLOCK, Z_TREES,\n Z_OK: Z_OK$1, Z_STREAM_END: Z_STREAM_END$1, Z_NEED_DICT: Z_NEED_DICT$1, Z_STREAM_ERROR: Z_STREAM_ERROR$1, Z_DATA_ERROR: Z_DATA_ERROR$1, Z_MEM_ERROR: Z_MEM_ERROR$1, Z_BUF_ERROR,\n Z_DEFLATED\n} = constants$2;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nconst HEAD = 16180; /* i: waiting for magic header */\nconst FLAGS = 16181; /* i: waiting for method and flags (gzip) */\nconst TIME = 16182; /* i: waiting for modification time (gzip) */\nconst OS = 16183; /* i: waiting for extra flags and operating system (gzip) */\nconst EXLEN = 16184; /* i: waiting for extra length (gzip) */\nconst EXTRA = 16185; /* i: waiting for extra bytes (gzip) */\nconst NAME = 16186; /* i: waiting for end of file name (gzip) */\nconst COMMENT = 16187; /* i: waiting for end of comment (gzip) */\nconst HCRC = 16188; /* i: waiting for header crc (gzip) */\nconst DICTID = 16189; /* i: waiting for dictionary check value */\nconst DICT = 16190; /* waiting for inflateSetDictionary() call */\nconst TYPE = 16191; /* i: waiting for type bits, including last-flag bit */\nconst TYPEDO = 16192; /* i: same, but skip check to exit inflate on new block */\nconst STORED = 16193; /* i: waiting for stored size (length and complement) */\nconst COPY_ = 16194; /* i/o: same as COPY below, but only first time in */\nconst COPY = 16195; /* i/o: waiting for input or output to copy stored block */\nconst TABLE = 16196; /* i: waiting for dynamic block table lengths */\nconst LENLENS = 16197; /* i: waiting for code length code lengths */\nconst CODELENS = 16198; /* i: waiting for length/lit and distance code lengths */\nconst LEN_ = 16199; /* i: same as LEN below, but only first time in */\nconst LEN = 16200; /* i: waiting for length/lit/eob code */\nconst LENEXT = 16201; /* i: waiting for length extra bits */\nconst DIST = 16202; /* i: waiting for distance code */\nconst DISTEXT = 16203; /* i: waiting for distance extra bits */\nconst MATCH = 16204; /* o: waiting for output space to copy string */\nconst LIT = 16205; /* o: waiting for output space to write literal */\nconst CHECK = 16206; /* i: waiting for 32-bit check value */\nconst LENGTH = 16207; /* i: waiting for 32-bit length (gzip) */\nconst DONE = 16208; /* finished check, done -- remain here until reset */\nconst BAD = 16209; /* got a data error -- remain here until reset */\nconst MEM = 16210; /* got an inflate() memory error -- remain here until reset */\nconst SYNC = 16211; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nconst ENOUGH_LENS = 852;\nconst ENOUGH_DISTS = 592;\n//const ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nconst MAX_WBITS = 15;\n/* 32K LZ77 window */\nconst DEF_WBITS = MAX_WBITS;\n\n\nconst zswap32 = (q) => {\n\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n};\n\n\nfunction InflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip,\n bit 2 true to validate check value */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib), or\n -1 if raw or no header yet */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new Uint16Array(320); /* temporary storage for code lengths */\n this.work = new Uint16Array(288); /* work area for code table building */\n\n /*\n because we don't have pointers in js, we use lencode and distcode directly\n as buffers so we don't need codes\n */\n //this.codes = new Int32Array(ENOUGH); /* space for code tables */\n this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\n\nconst inflateStateCheck = (strm) => {\n\n if (!strm) {\n return 1;\n }\n const state = strm.state;\n if (!state || state.strm !== strm ||\n state.mode < HEAD || state.mode > SYNC) {\n return 1;\n }\n return 0;\n};\n\n\nconst inflateResetKeep = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.flags = -1;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new Int32Array(ENOUGH_LENS);\n state.distcode = state.distdyn = new Int32Array(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK$1;\n};\n\n\nconst inflateReset = (strm) => {\n\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n};\n\n\nconst inflateReset2 = (strm, windowBits) => {\n let wrap;\n\n /* get the state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 5;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR$1;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n};\n\n\nconst inflateInit2 = (strm, windowBits) => {\n\n if (!strm) { return Z_STREAM_ERROR$1; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n const state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.strm = strm;\n state.window = null/*Z_NULL*/;\n state.mode = HEAD; /* to pass state test in inflateReset2() */\n const ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK$1) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n};\n\n\nconst inflateInit = (strm) => {\n\n return inflateInit2(strm, DEF_WBITS);\n};\n\n\n/*\n Return state with length and distance decoding tables and index sizes set to\n fixed code decoding. Normally this returns fixed tables from inffixed.h.\n If BUILDFIXED is defined, then instead this routine builds the tables the\n first time it's called, and returns those tables the first time and\n thereafter. This reduces the size of the code by about 2K bytes, in\n exchange for a little execution time. However, BUILDFIXED should not be\n used for threaded applications, since the rewriting of the tables and virgin\n may not be thread-safe.\n */\nlet virgin = true;\n\nlet lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\n\nconst fixedtables = (state) => {\n\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n lenfix = new Int32Array(512);\n distfix = new Int32Array(32);\n\n /* literal/length table */\n let sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inftrees(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inftrees(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n};\n\n\n/*\n Update the window with the last wsize (normally 32K) bytes written before\n returning. If window does not exist yet, create it. This is only called\n when a window is already in use, or when output has been written during this\n inflate call, but the end of the deflate stream has not been reached yet.\n It is also called to create a window for dictionary data when a dictionary\n is loaded.\n\n Providing output buffers larger than 32K to inflate() should provide a speed\n advantage, since only the last 32K of output is copied to the sliding window\n upon return from inflate(), and since all distances after the first 32K of\n output will fall in the output data, making match copies simpler and faster.\n The advantage may be dependent on the size of the processor's data caches.\n */\nconst updatewindow = (strm, src, end, copy) => {\n\n let dist;\n const state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new Uint8Array(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\n if (copy >= state.wsize) {\n state.window.set(src.subarray(end - state.wsize, end), 0);\n state.wnext = 0;\n state.whave = state.wsize;\n }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n state.window.set(src.subarray(end - copy, end - copy + dist), state.wnext);\n copy -= dist;\n if (copy) {\n //zmemcpy(state->window, end - copy, copy);\n state.window.set(src.subarray(end - copy, end), 0);\n state.wnext = copy;\n state.whave = state.wsize;\n }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n};\n\n\nconst inflate$2 = (strm, flush) => {\n\n let state;\n let input, output; // input/output buffers\n let next; /* next input INDEX */\n let put; /* next output INDEX */\n let have, left; /* available input and output */\n let hold; /* bit buffer */\n let bits; /* bits in bit buffer */\n let _in, _out; /* save starting available input and output */\n let copy; /* number of stored or match bytes to copy */\n let from; /* where to copy match bytes from */\n let from_source;\n let here = 0; /* current decoding table entry */\n let here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //let last; /* parent table entry */\n let last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n let len; /* length to copy for repeats, bits to drop */\n let ret; /* return code */\n const hbuf = new Uint8Array(4); /* buffer for gzip header crc calculation */\n let opts;\n\n let n; // temporary variable for NEED_BITS\n\n const order = /* permutation of code lengths */\n new Uint8Array([ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]);\n\n\n if (inflateStateCheck(strm) || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR$1;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n _in = have;\n _out = left;\n ret = Z_OK$1;\n\n inf_leave: // goto emulation\n for (;;) {\n switch (state.mode) {\n case HEAD:\n if (state.wrap === 0) {\n state.mode = TYPEDO;\n break;\n }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n if (state.wbits === 0) {\n state.wbits = 15;\n }\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n if (len > 15 || len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n\n // !!! pako patch. Force use `options.windowBits` if passed.\n // Required to always use max window size by default.\n state.dmax = 1 << state.wbits;\n //state.dmax = 1 << len;\n\n state.flags = 0; /* indicate zlib header */\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC4(state.check, hold)\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n hbuf[2] = (hold >>> 16) & 0xff;\n hbuf[3] = (hold >>> 24) & 0xff;\n state.check = crc32_1(state.check, hbuf, 4, 0);\n //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n //=== CRC2(state.check, hold);\n hbuf[0] = hold & 0xff;\n hbuf[1] = (hold >>> 8) & 0xff;\n state.check = crc32_1(state.check, hbuf, 2, 0);\n //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Uint8Array(state.head.extra_len);\n }\n state.head.extra.set(\n input.subarray(\n next,\n // extra field is limited to 65536 bytes\n // - no need for additional size check\n next + copy\n ),\n /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/\n len\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n // TODO: 2 or 1 bytes?\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\n state.head.name += String.fromCharCode(len);\n }\n } while (len && copy < have);\n\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if ((state.flags & 0x0200) && (state.wrap & 4)) {\n state.check = crc32_1(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n if (state.head) {\n state.head.hcrc = ((state.flags >> 9) & 1);\n state.head.done = true;\n }\n strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\n case DICT:\n if (state.havedict === 0) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n return Z_NEED_DICT$1;\n }\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case TYPEDO:\n if (state.last) {\n //--- BYTEBITS() ---//\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n state.mode = CHECK;\n break;\n }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\n output.set(input.subarray(next, next + copy), put);\n //---//\n have -= copy;\n next += copy;\n left -= copy;\n put += copy;\n state.length -= copy;\n break;\n }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\n // We have separate tables & no pointers. 2 commented lines below not needed.\n //state.next = state.codes;\n //state.lencode = state.next;\n // Switch to use dynamic table\n state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\n ret = inftrees(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts);\n state.lenbits = opts.bits;\n\n if (ret) {\n strm.msg = 'invalid code lengths set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_val < 16) {\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.lens[state.have++] = here_val;\n }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n if (state.have === 0) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\n hold >>>= 7;\n bits -= 7;\n //---//\n }\n if (state.have + copy > state.nlen + state.ndist) {\n strm.msg = 'invalid bit length repeat';\n state.mode = BAD;\n break;\n }\n while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\n\n /* build code tables -- note: do not change the lenbits or distbits\n values here (9 and 6) without reading the comments in inftrees.h\n concerning the ENOUGH constants, which depend on those values */\n state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inftrees(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // state.lencode = state.next;\n\n if (ret) {\n strm.msg = 'invalid literal/lengths set';\n state.mode = BAD;\n break;\n }\n\n state.distbits = 6;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inftrees(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\n case LEN:\n if (have >= 6 && left >= 258) {\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n inffast(strm, _out);\n //--- LOAD() ---\n put = strm.next_out;\n output = strm.output;\n left = strm.avail_out;\n next = strm.next_in;\n input = strm.input;\n have = strm.avail_in;\n hold = state.hold;\n bits = state.bits;\n //---\n\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if (here_op && (here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\n if (here_op === 0) {\n //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ?\n // \"inflate: literal '%c'\\n\" :\n // \"inflate: literal 0x%02x\\n\", here.val));\n state.mode = LIT;\n break;\n }\n if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n if ((here_op & 0xf0) === 0) {\n last_bits = here_bits;\n last_op = here_op;\n last_val = here_val;\n for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)];\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((last_bits + here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR\n// Trace((stderr, \"inflate.c too far\\n\"));\n// copy -= state.whave;\n// if (copy > state.length) { copy = state.length; }\n// if (copy > left) { copy = left; }\n// left -= copy;\n// state.length -= copy;\n// do {\n// output[put++] = 0;\n// } while (--copy);\n// if (state.length === 0) { state.mode = LEN; }\n// break;\n//#endif\n }\n if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check =\n /*UPDATE_CHECK(state.check, put - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, put - _out) : adler32_1(state.check, output, _out, put - _out));\n\n }\n _out = left;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.wrap & 4) && (state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 4) && hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END$1;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR$1;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR$1;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR$1;\n }\n }\n\n // inf_leave <- here is real place for \"goto inf_leave\", emulated via \"break inf_leave\"\n\n /*\n Return from inflate(), updating the total counts and the check value.\n If there was no progress during the inflate() call, return a buffer\n error. Call updatewindow() to create and/or update the window state.\n Note: a memory error from inflate() is non-recoverable.\n */\n\n //--- RESTORE() ---\n strm.next_out = put;\n strm.avail_out = left;\n strm.next_in = next;\n strm.avail_in = have;\n state.hold = hold;\n state.bits = bits;\n //---\n\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (state.mode < CHECK || flush !== Z_FINISH$1))) {\n if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) ;\n }\n _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if ((state.wrap & 4) && _out) {\n strm.adler = state.check = /*UPDATE_CHECK(state.check, strm.next_out - _out, _out);*/\n (state.flags ? crc32_1(state.check, output, _out, strm.next_out - _out) : adler32_1(state.check, output, _out, strm.next_out - _out));\n }\n strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH$1) && ret === Z_OK$1) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n};\n\n\nconst inflateEnd = (strm) => {\n\n if (inflateStateCheck(strm)) {\n return Z_STREAM_ERROR$1;\n }\n\n let state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK$1;\n};\n\n\nconst inflateGetHeader = (strm, head) => {\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n const state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR$1; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK$1;\n};\n\n\nconst inflateSetDictionary = (strm, dictionary) => {\n const dictLength = dictionary.length;\n\n let state;\n let dictid;\n let ret;\n\n /* check state */\n if (inflateStateCheck(strm)) { return Z_STREAM_ERROR$1; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR$1;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32_1(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR$1;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR$1;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK$1;\n};\n\n\nvar inflateReset_1 = inflateReset;\nvar inflateReset2_1 = inflateReset2;\nvar inflateResetKeep_1 = inflateResetKeep;\nvar inflateInit_1 = inflateInit;\nvar inflateInit2_1 = inflateInit2;\nvar inflate_2$1 = inflate$2;\nvar inflateEnd_1 = inflateEnd;\nvar inflateGetHeader_1 = inflateGetHeader;\nvar inflateSetDictionary_1 = inflateSetDictionary;\nvar inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nmodule.exports.inflateCodesUsed = inflateCodesUsed;\nmodule.exports.inflateCopy = inflateCopy;\nmodule.exports.inflateGetDictionary = inflateGetDictionary;\nmodule.exports.inflateMark = inflateMark;\nmodule.exports.inflatePrime = inflatePrime;\nmodule.exports.inflateSync = inflateSync;\nmodule.exports.inflateSyncPoint = inflateSyncPoint;\nmodule.exports.inflateUndermine = inflateUndermine;\nmodule.exports.inflateValidate = inflateValidate;\n*/\n\nvar inflate_1$2 = {\n\tinflateReset: inflateReset_1,\n\tinflateReset2: inflateReset2_1,\n\tinflateResetKeep: inflateResetKeep_1,\n\tinflateInit: inflateInit_1,\n\tinflateInit2: inflateInit2_1,\n\tinflate: inflate_2$1,\n\tinflateEnd: inflateEnd_1,\n\tinflateGetHeader: inflateGetHeader_1,\n\tinflateSetDictionary: inflateSetDictionary_1,\n\tinflateInfo: inflateInfo\n};\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction GZheader() {\n /* true if compressed data believed to be text */\n this.text = 0;\n /* modification time */\n this.time = 0;\n /* extra flags (not used when writing a gzip file) */\n this.xflags = 0;\n /* operating system */\n this.os = 0;\n /* pointer to extra field or Z_NULL if none */\n this.extra = null;\n /* extra field length (valid if extra != Z_NULL) */\n this.extra_len = 0; // Actually, we don't need it in JS,\n // but leave for few code modifications\n\n //\n // Setup limits is not necessary because in js we should not preallocate memory\n // for inflate use constant limit in 65536 bytes\n //\n\n /* space at extra (only when reading header) */\n // this.extra_max = 0;\n /* pointer to zero-terminated file name or Z_NULL */\n this.name = '';\n /* space at name (only when reading header) */\n // this.name_max = 0;\n /* pointer to zero-terminated comment or Z_NULL */\n this.comment = '';\n /* space at comment (only when reading header) */\n // this.comm_max = 0;\n /* true if there was or will be a header crc */\n this.hcrc = 0;\n /* true when done reading gzip header (not used when writing a gzip file) */\n this.done = false;\n}\n\nvar gzheader = GZheader;\n\nconst toString = Object.prototype.toString;\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\nconst {\n Z_NO_FLUSH, Z_FINISH,\n Z_OK, Z_STREAM_END, Z_NEED_DICT, Z_STREAM_ERROR, Z_DATA_ERROR, Z_MEM_ERROR\n} = constants$2;\n\n/* ===========================================================================*/\n\n\n/**\n * class Inflate\n *\n * Generic JS-style wrapper for zlib calls. If you don't need\n * streaming behaviour - use more simple functions: [[inflate]]\n * and [[inflateRaw]].\n **/\n\n/* internal\n * inflate.chunks -> Array\n *\n * Chunks of output data, if [[Inflate#onData]] not overridden.\n **/\n\n/**\n * Inflate.result -> Uint8Array|String\n *\n * Uncompressed result, generated by default [[Inflate#onData]]\n * and [[Inflate#onEnd]] handlers. Filled after you push last chunk\n * (call [[Inflate#push]] with `Z_FINISH` / `true` param).\n **/\n\n/**\n * Inflate.err -> Number\n *\n * Error code after inflate finished. 0 (Z_OK) on success.\n * Should be checked if broken data possible.\n **/\n\n/**\n * Inflate.msg -> String\n *\n * Error message, if [[Inflate.err]] != 0\n **/\n\n\n/**\n * new Inflate(options)\n * - options (Object): zlib inflate options.\n *\n * Creates new inflator instance with specified params. Throws exception\n * on bad params. Supported options:\n *\n * - `windowBits`\n * - `dictionary`\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information on these.\n *\n * Additional options, for internal needs:\n *\n * - `chunkSize` - size of generated data chunks (16K by default)\n * - `raw` (Boolean) - do raw inflate\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n * By default, when no options set, autodetect deflate/gzip data format via\n * wrapper header.\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako')\n * const chunk1 = new Uint8Array([1,2,3,4,5,6,7,8,9])\n * const chunk2 = new Uint8Array([10,11,12,13,14,15,16,17,18,19]);\n *\n * const inflate = new pako.Inflate({ level: 3});\n *\n * inflate.push(chunk1, false);\n * inflate.push(chunk2, true); // true -> last chunk\n *\n * if (inflate.err) { throw new Error(inflate.err); }\n *\n * console.log(inflate.result);\n * ```\n **/\nfunction Inflate$1(options) {\n this.options = common.assign({\n chunkSize: 1024 * 64,\n windowBits: 15,\n to: ''\n }, options || {});\n\n const opt = this.options;\n\n // Force window size for `raw` data, if not set directly,\n // because we have no header for autodetect.\n if (opt.raw && (opt.windowBits >= 0) && (opt.windowBits < 16)) {\n opt.windowBits = -opt.windowBits;\n if (opt.windowBits === 0) { opt.windowBits = -15; }\n }\n\n // If `windowBits` not defined (and mode not raw) - set autodetect flag for gzip/deflate\n if ((opt.windowBits >= 0) && (opt.windowBits < 16) &&\n !(options && options.windowBits)) {\n opt.windowBits += 32;\n }\n\n // Gzip header has no info about windows size, we can do autodetect only\n // for deflate. So, if window size not set, force it to max when gzip possible\n if ((opt.windowBits > 15) && (opt.windowBits < 48)) {\n // bit 3 (16) -> gzipped data\n // bit 4 (32) -> autodetect gzip/deflate\n if ((opt.windowBits & 15) === 0) {\n opt.windowBits |= 15;\n }\n }\n\n this.err = 0; // error code, if happens (0 = Z_OK)\n this.msg = ''; // error message\n this.ended = false; // used to avoid multiple onEnd() calls\n this.chunks = []; // chunks of compressed data\n\n this.strm = new zstream();\n this.strm.avail_out = 0;\n\n let status = inflate_1$2.inflateInit2(\n this.strm,\n opt.windowBits\n );\n\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n\n this.header = new gzheader();\n\n inflate_1$2.inflateGetHeader(this.strm, this.header);\n\n // Setup dictionary\n if (opt.dictionary) {\n // Convert data if needed\n if (typeof opt.dictionary === 'string') {\n opt.dictionary = strings.string2buf(opt.dictionary);\n } else if (toString.call(opt.dictionary) === '[object ArrayBuffer]') {\n opt.dictionary = new Uint8Array(opt.dictionary);\n }\n if (opt.raw) { //In raw mode we need to set the dictionary early\n status = inflate_1$2.inflateSetDictionary(this.strm, opt.dictionary);\n if (status !== Z_OK) {\n throw new Error(messages[status]);\n }\n }\n }\n}\n\n/**\n * Inflate#push(data[, flush_mode]) -> Boolean\n * - data (Uint8Array|ArrayBuffer): input data\n * - flush_mode (Number|Boolean): 0..6 for corresponding Z_NO_FLUSH..Z_TREE\n * flush modes. See constants. Skipped or `false` means Z_NO_FLUSH,\n * `true` means Z_FINISH.\n *\n * Sends input data to inflate pipe, generating [[Inflate#onData]] calls with\n * new output chunks. Returns `true` on success. If end of stream detected,\n * [[Inflate#onEnd]] will be called.\n *\n * `flush_mode` is not needed for normal operation, because end of stream\n * detected automatically. You may try to use it for advanced things, but\n * this functionality was not tested.\n *\n * On fail call [[Inflate#onEnd]] with error code and return false.\n *\n * ##### Example\n *\n * ```javascript\n * push(chunk, false); // push one of data chunks\n * ...\n * push(chunk, true); // push last chunk\n * ```\n **/\nInflate$1.prototype.push = function (data, flush_mode) {\n const strm = this.strm;\n const chunkSize = this.options.chunkSize;\n const dictionary = this.options.dictionary;\n let status, _flush_mode, last_avail_out;\n\n if (this.ended) return false;\n\n if (flush_mode === ~~flush_mode) _flush_mode = flush_mode;\n else _flush_mode = flush_mode === true ? Z_FINISH : Z_NO_FLUSH;\n\n // Convert data if needed\n if (toString.call(data) === '[object ArrayBuffer]') {\n strm.input = new Uint8Array(data);\n } else {\n strm.input = data;\n }\n\n strm.next_in = 0;\n strm.avail_in = strm.input.length;\n\n for (;;) {\n if (strm.avail_out === 0) {\n strm.output = new Uint8Array(chunkSize);\n strm.next_out = 0;\n strm.avail_out = chunkSize;\n }\n\n status = inflate_1$2.inflate(strm, _flush_mode);\n\n if (status === Z_NEED_DICT && dictionary) {\n status = inflate_1$2.inflateSetDictionary(strm, dictionary);\n\n if (status === Z_OK) {\n status = inflate_1$2.inflate(strm, _flush_mode);\n } else if (status === Z_DATA_ERROR) {\n // Replace code with more verbose\n status = Z_NEED_DICT;\n }\n }\n\n // Skip snyc markers if more data follows and not raw mode\n while (strm.avail_in > 0 &&\n status === Z_STREAM_END &&\n strm.state.wrap > 0 &&\n data[strm.next_in] !== 0)\n {\n inflate_1$2.inflateReset(strm);\n status = inflate_1$2.inflate(strm, _flush_mode);\n }\n\n switch (status) {\n case Z_STREAM_ERROR:\n case Z_DATA_ERROR:\n case Z_NEED_DICT:\n case Z_MEM_ERROR:\n this.onEnd(status);\n this.ended = true;\n return false;\n }\n\n // Remember real `avail_out` value, because we may patch out buffer content\n // to align utf8 strings boundaries.\n last_avail_out = strm.avail_out;\n\n if (strm.next_out) {\n if (strm.avail_out === 0 || status === Z_STREAM_END) {\n\n if (this.options.to === 'string') {\n\n let next_out_utf8 = strings.utf8border(strm.output, strm.next_out);\n\n let tail = strm.next_out - next_out_utf8;\n let utf8str = strings.buf2string(strm.output, next_out_utf8);\n\n // move tail & realign counters\n strm.next_out = tail;\n strm.avail_out = chunkSize - tail;\n if (tail) strm.output.set(strm.output.subarray(next_out_utf8, next_out_utf8 + tail), 0);\n\n this.onData(utf8str);\n\n } else {\n this.onData(strm.output.length === strm.next_out ? strm.output : strm.output.subarray(0, strm.next_out));\n }\n }\n }\n\n // Must repeat iteration if out buffer is full\n if (status === Z_OK && last_avail_out === 0) continue;\n\n // Finalize if end of stream reached.\n if (status === Z_STREAM_END) {\n status = inflate_1$2.inflateEnd(this.strm);\n this.onEnd(status);\n this.ended = true;\n return true;\n }\n\n if (strm.avail_in === 0) break;\n }\n\n return true;\n};\n\n\n/**\n * Inflate#onData(chunk) -> Void\n * - chunk (Uint8Array|String): output data. When string output requested,\n * each chunk will be string.\n *\n * By default, stores data blocks in `chunks[]` property and glue\n * those in `onEnd`. Override this handler, if you need another behaviour.\n **/\nInflate$1.prototype.onData = function (chunk) {\n this.chunks.push(chunk);\n};\n\n\n/**\n * Inflate#onEnd(status) -> Void\n * - status (Number): inflate status. 0 (Z_OK) on success,\n * other if not.\n *\n * Called either after you tell inflate that the input stream is\n * complete (Z_FINISH). By default - join collected chunks,\n * free memory and fill `results` / `err` properties.\n **/\nInflate$1.prototype.onEnd = function (status) {\n // On success - join\n if (status === Z_OK) {\n if (this.options.to === 'string') {\n this.result = this.chunks.join('');\n } else {\n this.result = common.flattenChunks(this.chunks);\n }\n }\n this.chunks = [];\n this.err = status;\n this.msg = this.strm.msg;\n};\n\n\n/**\n * inflate(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Decompress `data` with inflate/ungzip and `options`. Autodetect\n * format via wrapper header by default. That's why we don't provide\n * separate `ungzip` method.\n *\n * Supported options are:\n *\n * - windowBits\n *\n * [http://zlib.net/manual.html#Advanced](http://zlib.net/manual.html#Advanced)\n * for more information.\n *\n * Sugar (options):\n *\n * - `raw` (Boolean) - say that we work with raw stream, if you don't wish to specify\n * negative windowBits implicitly.\n * - `to` (String) - if equal to 'string', then result will be converted\n * from utf8 to utf16 (javascript) string. When string output requested,\n * chunk length can differ from `chunkSize`, depending on content.\n *\n *\n * ##### Example:\n *\n * ```javascript\n * const pako = require('pako');\n * const input = pako.deflate(new Uint8Array([1,2,3,4,5,6,7,8,9]));\n * let output;\n *\n * try {\n * output = pako.inflate(input);\n * } catch (err) {\n * console.log(err);\n * }\n * ```\n **/\nfunction inflate$1(input, options) {\n const inflator = new Inflate$1(options);\n\n inflator.push(input);\n\n // That will never happens, if you don't cheat with options :)\n if (inflator.err) throw inflator.msg || messages[inflator.err];\n\n return inflator.result;\n}\n\n\n/**\n * inflateRaw(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * The same as [[inflate]], but creates raw data, without wrapper\n * (header and adler32 crc).\n **/\nfunction inflateRaw$1(input, options) {\n options = options || {};\n options.raw = true;\n return inflate$1(input, options);\n}\n\n\n/**\n * ungzip(data[, options]) -> Uint8Array|String\n * - data (Uint8Array|ArrayBuffer): input data to decompress.\n * - options (Object): zlib inflate options.\n *\n * Just shortcut to [[inflate]], because it autodetects format\n * by header.content. Done for convenience.\n **/\n\n\nvar Inflate_1$1 = Inflate$1;\nvar inflate_2 = inflate$1;\nvar inflateRaw_1$1 = inflateRaw$1;\nvar ungzip$1 = inflate$1;\nvar constants = constants$2;\n\nvar inflate_1$1 = {\n\tInflate: Inflate_1$1,\n\tinflate: inflate_2,\n\tinflateRaw: inflateRaw_1$1,\n\tungzip: ungzip$1,\n\tconstants: constants\n};\n\nconst { Deflate, deflate, deflateRaw, gzip } = deflate_1$1;\n\nconst { Inflate, inflate, inflateRaw, ungzip } = inflate_1$1;\n\n\n\nvar Deflate_1 = Deflate;\nvar deflate_1 = deflate;\nvar deflateRaw_1 = deflateRaw;\nvar gzip_1 = gzip;\nvar Inflate_1 = Inflate;\nvar inflate_1 = inflate;\nvar inflateRaw_1 = inflateRaw;\nvar ungzip_1 = ungzip;\nvar constants_1 = constants$2;\n\nvar pako = {\n\tDeflate: Deflate_1,\n\tdeflate: deflate_1,\n\tdeflateRaw: deflateRaw_1,\n\tgzip: gzip_1,\n\tInflate: Inflate_1,\n\tinflate: inflate_1,\n\tinflateRaw: inflateRaw_1,\n\tungzip: ungzip_1,\n\tconstants: constants_1\n};\n\nexport { Deflate_1 as Deflate, Inflate_1 as Inflate, constants_1 as constants, pako as default, deflate_1 as deflate, deflateRaw_1 as deflateRaw, gzip_1 as gzip, inflate_1 as inflate, inflateRaw_1 as inflateRaw, ungzip_1 as ungzip };\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n","import { Buffer as Buffer$1 } from 'buffer';\nimport { PublicKey, Transaction, TransactionInstruction, SendTransactionError, NONCE_ACCOUNT_LENGTH, SystemProgram, SYSVAR_RENT_PUBKEY, SYSVAR_CLOCK_PUBKEY } from '@solana/web3.js';\nimport * as web3_js from '@solana/web3.js';\nexport { web3_js as web3 };\nimport BN from 'bn.js';\nexport { default as BN } from 'bn.js';\nimport bs58$1 from 'bs58';\nimport * as base64$1 from 'base64-js';\nimport camelCase from 'camelcase';\nimport * as borsh from '@coral-xyz/borsh';\nimport { sha256 as sha256$1 } from '@noble/hashes/sha256';\nimport { inflate } from 'pako';\nimport EventEmitter from 'eventemitter3';\n\n/**\n * Splits an array into chunks\n *\n * @param array Array of objects to chunk.\n * @param size The max size of a chunk.\n * @returns A two dimensional array where each T[] length is < the provided size.\n */\nfunction chunks(array, size) {\n return Array.apply(0, new Array(Math.ceil(array.length / size))).map((_, index) => array.slice(index * size, (index + 1) * size));\n}\n/**\n * Check if a transaction object is a VersionedTransaction or not\n *\n * @param tx\n * @returns bool\n */\nconst isVersionedTransaction = (tx) => {\n return \"version\" in tx;\n};\n\nfunction encode$3(data) {\n return data.reduce((str, byte) => str + byte.toString(16).padStart(2, \"0\"), \"0x\");\n}\nfunction decode$3(data) {\n if (data.indexOf(\"0x\") === 0) {\n data = data.substr(2);\n }\n if (data.length % 2 === 1) {\n data = \"0\" + data;\n }\n let key = data.match(/.{2}/g);\n if (key === null) {\n return Buffer$1.from([]);\n }\n return Buffer$1.from(key.map((byte) => parseInt(byte, 16)));\n}\n\nvar hex = /*#__PURE__*/Object.freeze({\n __proto__: null,\n encode: encode$3,\n decode: decode$3\n});\n\nfunction decode$2(array) {\n const decoder = new TextDecoder(\"utf-8\") // Browser https://caniuse.com/textencoder.\n ; // Node.\n return decoder.decode(array);\n}\nfunction encode$2(input) {\n const encoder = new TextEncoder() // Browser.\n ; // Node.\n return encoder.encode(input);\n}\n\nvar utf8 = /*#__PURE__*/Object.freeze({\n __proto__: null,\n decode: decode$2,\n encode: encode$2\n});\n\nfunction encode$1(data) {\n return bs58$1.encode(data);\n}\nfunction decode$1(data) {\n return bs58$1.decode(data);\n}\n\nvar bs58 = /*#__PURE__*/Object.freeze({\n __proto__: null,\n encode: encode$1,\n decode: decode$1\n});\n\nfunction encode(data) {\n return base64$1.fromByteArray(data);\n}\nfunction decode(data) {\n return Buffer$1.from(base64$1.toByteArray(data));\n}\n\nvar base64 = /*#__PURE__*/Object.freeze({\n __proto__: null,\n encode: encode,\n decode: decode\n});\n\nvar index$1 = /*#__PURE__*/Object.freeze({\n __proto__: null,\n hex: hex,\n utf8: utf8,\n bs58: bs58,\n base64: base64\n});\n\nfunction parseIdlErrors(idl) {\n const errors = new Map();\n if (idl.errors) {\n idl.errors.forEach((e) => {\n var _a;\n let msg = (_a = e.msg) !== null && _a !== void 0 ? _a : e.name;\n errors.set(e.code, msg);\n });\n }\n return errors;\n}\n// Allow either IdLInstruction or IdlStateMethod since the types share fields.\nfunction toInstruction(idlIx, ...args) {\n if (idlIx.args.length != args.length) {\n throw new Error(\"Invalid argument length\");\n }\n const ix = {};\n let idx = 0;\n idlIx.args.forEach((ixArg) => {\n ix[ixArg.name] = args[idx];\n idx += 1;\n });\n return ix;\n}\n// Throws error if any account required for the `ix` is not given.\nfunction validateAccounts(ixAccounts, accounts = {}) {\n ixAccounts.forEach((acc) => {\n if (\"accounts\" in acc) {\n validateAccounts(acc.accounts, accounts[acc.name]);\n }\n else {\n if (accounts[acc.name] === undefined) {\n throw new Error(`Invalid arguments: ${acc.name} not provided.`);\n }\n }\n });\n}\n// Translates an address to a Pubkey.\nfunction translateAddress(address) {\n return address instanceof PublicKey ? address : new PublicKey(address);\n}\n\n/**\n * A `StructFailure` represents a single specific failure in validation.\n */\n\n/**\n * `StructError` objects are thrown (or returned) when validation fails.\n *\n * Validation logic is design to exit early for maximum performance. The error\n * represents the first error encountered during validation. For more detail,\n * the `error.failures` property is a generator function that can be run to\n * continue validation and receive all the failures in the data.\n */\nclass StructError extends TypeError {\n constructor(failure, failures) {\n let cached;\n const {\n message,\n ...rest\n } = failure;\n const {\n path\n } = failure;\n const msg = path.length === 0 ? message : \"At path: \" + path.join('.') + \" -- \" + message;\n super(msg);\n this.value = void 0;\n this.key = void 0;\n this.type = void 0;\n this.refinement = void 0;\n this.path = void 0;\n this.branch = void 0;\n this.failures = void 0;\n Object.assign(this, rest);\n this.name = this.constructor.name;\n\n this.failures = () => {\n var _cached;\n\n return (_cached = cached) != null ? _cached : cached = [failure, ...failures()];\n };\n }\n\n}\n\n/**\n * Check if a value is an iterator.\n */\nfunction isIterable(x) {\n return isObject(x) && typeof x[Symbol.iterator] === 'function';\n}\n/**\n * Check if a value is a plain object.\n */\n\n\nfunction isObject(x) {\n return typeof x === 'object' && x != null;\n}\n/**\n * Return a value as a printable string.\n */\n\nfunction print(value) {\n return typeof value === 'string' ? JSON.stringify(value) : \"\" + value;\n}\n/**\n * Shifts (removes and returns) the first value from the `input` iterator.\n * Like `Array.prototype.shift()` but for an `Iterator`.\n */\n\nfunction shiftIterator(input) {\n const {\n done,\n value\n } = input.next();\n return done ? undefined : value;\n}\n/**\n * Convert a single validation result to a failure.\n */\n\nfunction toFailure(result, context, struct, value) {\n if (result === true) {\n return;\n } else if (result === false) {\n result = {};\n } else if (typeof result === 'string') {\n result = {\n message: result\n };\n }\n\n const {\n path,\n branch\n } = context;\n const {\n type\n } = struct;\n const {\n refinement,\n message = \"Expected a value of type `\" + type + \"`\" + (refinement ? \" with refinement `\" + refinement + \"`\" : '') + \", but received: `\" + print(value) + \"`\"\n } = result;\n return {\n value,\n type,\n refinement,\n key: path[path.length - 1],\n path,\n branch,\n ...result,\n message\n };\n}\n/**\n * Convert a validation result to an iterable of failures.\n */\n\nfunction* toFailures(result, context, struct, value) {\n if (!isIterable(result)) {\n result = [result];\n }\n\n for (const r of result) {\n const failure = toFailure(r, context, struct, value);\n\n if (failure) {\n yield failure;\n }\n }\n}\n/**\n * Check a value against a struct, traversing deeply into nested values, and\n * returning an iterator of failures or success.\n */\n\nfunction* run(value, struct, options) {\n if (options === void 0) {\n options = {};\n }\n\n const {\n path = [],\n branch = [value],\n coerce = false,\n mask = false\n } = options;\n const ctx = {\n path,\n branch\n };\n\n if (coerce) {\n value = struct.coercer(value, ctx);\n\n if (mask && struct.type !== 'type' && isObject(struct.schema) && isObject(value) && !Array.isArray(value)) {\n for (const key in value) {\n if (struct.schema[key] === undefined) {\n delete value[key];\n }\n }\n }\n }\n\n let valid = true;\n\n for (const failure of struct.validator(value, ctx)) {\n valid = false;\n yield [failure, undefined];\n }\n\n for (let [k, v, s] of struct.entries(value, ctx)) {\n const ts = run(v, s, {\n path: k === undefined ? path : [...path, k],\n branch: k === undefined ? branch : [...branch, v],\n coerce,\n mask\n });\n\n for (const t of ts) {\n if (t[0]) {\n valid = false;\n yield [t[0], undefined];\n } else if (coerce) {\n v = t[1];\n\n if (k === undefined) {\n value = v;\n } else if (value instanceof Map) {\n value.set(k, v);\n } else if (value instanceof Set) {\n value.add(v);\n } else if (isObject(value)) {\n value[k] = v;\n }\n }\n }\n }\n\n if (valid) {\n for (const failure of struct.refiner(value, ctx)) {\n valid = false;\n yield [failure, undefined];\n }\n }\n\n if (valid) {\n yield [undefined, value];\n }\n}\n\n/**\n * `Struct` objects encapsulate the validation logic for a specific type of\n * values. Once constructed, you use the `assert`, `is` or `validate` helpers to\n * validate unknown input data against the struct.\n */\n\nclass Struct {\n constructor(props) {\n this.TYPE = void 0;\n this.type = void 0;\n this.schema = void 0;\n this.coercer = void 0;\n this.validator = void 0;\n this.refiner = void 0;\n this.entries = void 0;\n const {\n type,\n schema,\n validator,\n refiner,\n coercer = value => value,\n entries = function* () {}\n } = props;\n this.type = type;\n this.schema = schema;\n this.entries = entries;\n this.coercer = coercer;\n\n if (validator) {\n this.validator = (value, context) => {\n const result = validator(value, context);\n return toFailures(result, context, this, value);\n };\n } else {\n this.validator = () => [];\n }\n\n if (refiner) {\n this.refiner = (value, context) => {\n const result = refiner(value, context);\n return toFailures(result, context, this, value);\n };\n } else {\n this.refiner = () => [];\n }\n }\n /**\n * Assert that a value passes the struct's validation, throwing if it doesn't.\n */\n\n\n assert(value) {\n return assert(value, this);\n }\n /**\n * Create a value with the struct's coercion logic, then validate it.\n */\n\n\n create(value) {\n return create(value, this);\n }\n /**\n * Check if a value passes the struct's validation.\n */\n\n\n is(value) {\n return is(value, this);\n }\n /**\n * Mask a value, coercing and validating it, but returning only the subset of\n * properties defined by the struct's schema.\n */\n\n\n mask(value) {\n return mask(value, this);\n }\n /**\n * Validate a value with the struct's validation logic, returning a tuple\n * representing the result.\n *\n * You may optionally pass `true` for the `withCoercion` argument to coerce\n * the value before attempting to validate it. If you do, the result will\n * contain the coerced result when successful.\n */\n\n\n validate(value, options) {\n if (options === void 0) {\n options = {};\n }\n\n return validate(value, this, options);\n }\n\n}\n/**\n * Assert that a value passes a struct, throwing if it doesn't.\n */\n\nfunction assert(value, struct) {\n const result = validate(value, struct);\n\n if (result[0]) {\n throw result[0];\n }\n}\n/**\n * Create a value with the coercion logic of struct and validate it.\n */\n\nfunction create(value, struct) {\n const result = validate(value, struct, {\n coerce: true\n });\n\n if (result[0]) {\n throw result[0];\n } else {\n return result[1];\n }\n}\n/**\n * Mask a value, returning only the subset of properties defined by a struct.\n */\n\nfunction mask(value, struct) {\n const result = validate(value, struct, {\n coerce: true,\n mask: true\n });\n\n if (result[0]) {\n throw result[0];\n } else {\n return result[1];\n }\n}\n/**\n * Check if a value passes a struct.\n */\n\nfunction is(value, struct) {\n const result = validate(value, struct);\n return !result[0];\n}\n/**\n * Validate a value against a struct, returning an error if invalid, or the\n * value (with potential coercion) if valid.\n */\n\nfunction validate(value, struct, options) {\n if (options === void 0) {\n options = {};\n }\n\n const tuples = run(value, struct, options);\n const tuple = shiftIterator(tuples);\n\n if (tuple[0]) {\n const error = new StructError(tuple[0], function* () {\n for (const t of tuples) {\n if (t[0]) {\n yield t[0];\n }\n }\n });\n return [error, undefined];\n } else {\n const v = tuple[1];\n return [undefined, v];\n }\n}\n/**\n * Define a new struct type with a custom validation function.\n */\n\nfunction define(name, validator) {\n return new Struct({\n type: name,\n schema: null,\n validator\n });\n}\n\n/**\n * Ensure that any value passes validation.\n */\n\nfunction any() {\n return define('any', () => true);\n}\nfunction array(Element) {\n return new Struct({\n type: 'array',\n schema: Element,\n\n *entries(value) {\n if (Element && Array.isArray(value)) {\n for (const [i, v] of value.entries()) {\n yield [i, v, Element];\n }\n }\n },\n\n coercer(value) {\n return Array.isArray(value) ? value.slice() : value;\n },\n\n validator(value) {\n return Array.isArray(value) || \"Expected an array value, but received: \" + print(value);\n }\n\n });\n}\n/**\n * Ensure that a value is a boolean.\n */\n\nfunction boolean() {\n return define('boolean', value => {\n return typeof value === 'boolean';\n });\n}\nfunction literal(constant) {\n const description = print(constant);\n const t = typeof constant;\n return new Struct({\n type: 'literal',\n schema: t === 'string' || t === 'number' || t === 'boolean' ? constant : null,\n\n validator(value) {\n return value === constant || \"Expected the literal `\" + description + \"`, but received: \" + print(value);\n }\n\n });\n}\n/**\n * Augment an existing struct to allow `null` values.\n */\n\nfunction nullable(struct) {\n return new Struct({ ...struct,\n validator: (value, ctx) => value === null || struct.validator(value, ctx),\n refiner: (value, ctx) => value === null || struct.refiner(value, ctx)\n });\n}\n/**\n * Ensure that a value is a number.\n */\n\nfunction number() {\n return define('number', value => {\n return typeof value === 'number' && !isNaN(value) || \"Expected a number, but received: \" + print(value);\n });\n}\n/**\n * Augment a struct to allow `undefined` values.\n */\n\nfunction optional(struct) {\n return new Struct({ ...struct,\n validator: (value, ctx) => value === undefined || struct.validator(value, ctx),\n refiner: (value, ctx) => value === undefined || struct.refiner(value, ctx)\n });\n}\n/**\n * Ensure that a value is a string.\n */\n\nfunction string() {\n return define('string', value => {\n return typeof value === 'string' || \"Expected a string, but received: \" + print(value);\n });\n}\n/**\n * Ensure that a value has a set of known properties of specific types.\n *\n * Note: Unrecognized properties are allowed and untouched. This is similar to\n * how TypeScript's structural typing works.\n */\n\nfunction type(schema) {\n const keys = Object.keys(schema);\n return new Struct({\n type: 'type',\n schema,\n\n *entries(value) {\n if (isObject(value)) {\n for (const k of keys) {\n yield [k, value[k], schema[k]];\n }\n }\n },\n\n validator(value) {\n return isObject(value) || \"Expected an object, but received: \" + print(value);\n }\n\n });\n}\n/**\n * Ensure that a value matches one of a set of types.\n */\n\nfunction union$1(Structs) {\n const description = Structs.map(s => s.type).join(' | ');\n return new Struct({\n type: 'union',\n schema: null,\n\n coercer(value, ctx) {\n const firstMatch = Structs.find(s => {\n const [e] = s.validate(value, {\n coerce: true\n });\n return !e;\n }) || unknown();\n return firstMatch.coercer(value, ctx);\n },\n\n validator(value, ctx) {\n const failures = [];\n\n for (const S of Structs) {\n const [...tuples] = run(value, S, ctx);\n const [first] = tuples;\n\n if (!first[0]) {\n return [];\n } else {\n for (const [failure] of tuples) {\n if (failure) {\n failures.push(failure);\n }\n }\n }\n }\n\n return [\"Expected the value to satisfy a union of `\" + description + \"`, but received: \" + print(value), ...failures];\n }\n\n });\n}\n/**\n * Ensure that any value passes validation, without widening its type to `any`.\n */\n\nfunction unknown() {\n return define('unknown', () => true);\n}\n\n/**\n * Augment a `Struct` to add an additional coercion step to its input.\n *\n * This allows you to transform input data before validating it, to increase the\n * likelihood that it passes validation—for example for default values, parsing\n * different formats, etc.\n *\n * Note: You must use `create(value, Struct)` on the value to have the coercion\n * take effect! Using simply `assert()` or `is()` will not use coercion.\n */\n\nfunction coerce(struct, condition, coercer) {\n return new Struct({ ...struct,\n coercer: (value, ctx) => {\n return is(value, condition) ? struct.coercer(coercer(value, ctx), ctx) : struct.coercer(value, ctx);\n }\n });\n}\n\n/**\n * Sends a transaction to a program with the given accounts and instruction\n * data.\n */\nasync function invoke(programId, accounts, data, provider) {\n programId = translateAddress(programId);\n if (!provider) {\n provider = getProvider();\n }\n const tx = new Transaction();\n tx.add(new TransactionInstruction({\n programId,\n keys: accounts !== null && accounts !== void 0 ? accounts : [],\n data,\n }));\n if (provider.sendAndConfirm === undefined) {\n throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n }\n return await provider.sendAndConfirm(tx, []);\n}\nconst GET_MULTIPLE_ACCOUNTS_LIMIT = 99;\nasync function getMultipleAccounts(connection, publicKeys, commitment) {\n const results = await getMultipleAccountsAndContext(connection, publicKeys, commitment);\n return results.map((result) => {\n return result\n ? { publicKey: result.publicKey, account: result.account }\n : null;\n });\n}\nasync function getMultipleAccountsAndContext(connection, publicKeys, commitment) {\n if (publicKeys.length <= GET_MULTIPLE_ACCOUNTS_LIMIT) {\n return await getMultipleAccountsAndContextCore(connection, publicKeys, commitment);\n }\n else {\n const batches = chunks(publicKeys, GET_MULTIPLE_ACCOUNTS_LIMIT);\n const results = await Promise.all(batches.map((batch) => getMultipleAccountsAndContextCore(connection, batch, commitment)));\n return results.flat();\n }\n}\nasync function getMultipleAccountsAndContextCore(connection, publicKeys, commitmentOverride) {\n const commitment = commitmentOverride !== null && commitmentOverride !== void 0 ? commitmentOverride : connection.commitment;\n const { value: accountInfos, context } = await connection.getMultipleAccountsInfoAndContext(publicKeys, commitment);\n const accounts = accountInfos.map((account, idx) => {\n if (account === null) {\n return null;\n }\n return {\n publicKey: publicKeys[idx],\n account,\n context,\n };\n });\n return accounts;\n}\n// copy from @solana/web3.js that has a commitment param\nasync function simulateTransaction(connection, transaction, signers, commitment, includeAccounts) {\n var _a;\n if (signers && signers.length > 0) {\n transaction.sign(...signers);\n }\n // @ts-expect-error\n const message = transaction._compile();\n const signData = message.serialize();\n // @ts-expect-error\n const wireTransaction = transaction._serialize(signData);\n const encodedTransaction = wireTransaction.toString(\"base64\");\n const config = {\n encoding: \"base64\",\n commitment: commitment !== null && commitment !== void 0 ? commitment : connection.commitment,\n };\n if (includeAccounts) {\n const addresses = (Array.isArray(includeAccounts) ? includeAccounts : message.nonProgramIds()).map((key) => key.toBase58());\n config[\"accounts\"] = {\n encoding: \"base64\",\n addresses,\n };\n }\n if (signers) {\n config.sigVerify = true;\n }\n const args = [encodedTransaction, config];\n // @ts-expect-error\n const unsafeRes = await connection._rpcRequest(\"simulateTransaction\", args);\n const res = create(unsafeRes, SimulatedTransactionResponseStruct);\n if (\"error\" in res) {\n let logs;\n if (\"data\" in res.error) {\n logs = (_a = res.error.data) === null || _a === void 0 ? void 0 : _a.logs;\n if (logs && Array.isArray(logs)) {\n const traceIndent = \"\\n \";\n const logTrace = traceIndent + logs.join(traceIndent);\n console.error(res.error.message, logTrace);\n }\n }\n throw new SendTransactionError(\"failed to simulate transaction: \" + res.error.message, logs);\n }\n return res.result;\n}\n// copy from @solana/web3.js\nfunction jsonRpcResult(schema) {\n return coerce(createRpcResult(schema), UnknownRpcResult, (value) => {\n if (\"error\" in value) {\n return value;\n }\n else {\n return {\n ...value,\n result: create(value.result, schema),\n };\n }\n });\n}\n// copy from @solana/web3.js\nconst UnknownRpcResult = createRpcResult(unknown());\n// copy from @solana/web3.js\nfunction createRpcResult(result) {\n return union$1([\n type({\n jsonrpc: literal(\"2.0\"),\n id: string(),\n result,\n }),\n type({\n jsonrpc: literal(\"2.0\"),\n id: string(),\n error: type({\n code: unknown(),\n message: string(),\n data: optional(any()),\n }),\n }),\n ]);\n}\n// copy from @solana/web3.js\nfunction jsonRpcResultAndContext(value) {\n return jsonRpcResult(type({\n context: type({\n slot: number(),\n }),\n value,\n }));\n}\n// copy from @solana/web3.js\nconst SimulatedTransactionResponseStruct = jsonRpcResultAndContext(type({\n err: nullable(union$1([type({}), string()])),\n logs: nullable(array(string())),\n accounts: optional(nullable(array(nullable(type({\n executable: boolean(),\n owner: string(),\n lamports: number(),\n data: array(string()),\n rentEpoch: optional(number()),\n }))))),\n unitsConsumed: optional(number()),\n}));\n\nvar rpc = /*#__PURE__*/Object.freeze({\n __proto__: null,\n invoke: invoke,\n getMultipleAccounts: getMultipleAccounts,\n getMultipleAccountsAndContext: getMultipleAccountsAndContext,\n simulateTransaction: simulateTransaction\n});\n\n/**\n * The network and wallet context used to send transactions paid for and signed\n * by the provider.\n */\nclass AnchorProvider {\n /**\n * @param connection The cluster connection where the program is deployed.\n * @param wallet The wallet used to pay for and sign all transactions.\n * @param opts Transaction confirmation options to use by default.\n */\n constructor(connection, wallet, opts) {\n this.connection = connection;\n this.wallet = wallet;\n this.opts = opts;\n this.publicKey = wallet === null || wallet === void 0 ? void 0 : wallet.publicKey;\n }\n static defaultOptions() {\n return {\n preflightCommitment: \"processed\",\n commitment: \"processed\",\n };\n }\n /**\n * Returns a `Provider` with a wallet read from the local filesystem.\n *\n * @param url The network cluster url.\n * @param opts The default transaction confirmation options.\n *\n * (This api is for Node only.)\n */\n static local(url, opts) {\n {\n throw new Error(`Provider local is not available on browser.`);\n }\n }\n /**\n * Returns a `Provider` read from the `ANCHOR_PROVIDER_URL` environment\n * variable\n *\n * (This api is for Node only.)\n */\n static env() {\n {\n throw new Error(`Provider env is not available on browser.`);\n }\n }\n /**\n * Sends the given transaction, paid for and signed by the provider's wallet.\n *\n * @param tx The transaction to send.\n * @param signers The signers of the transaction.\n * @param opts Transaction confirmation options.\n */\n async sendAndConfirm(tx, signers, opts) {\n var _a, _b, _c, _d;\n if (opts === undefined) {\n opts = this.opts;\n }\n if (isVersionedTransaction(tx)) {\n if (signers) {\n tx.sign(signers);\n }\n }\n else {\n tx.feePayer = (_a = tx.feePayer) !== null && _a !== void 0 ? _a : this.wallet.publicKey;\n tx.recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n if (signers) {\n for (const signer of signers) {\n tx.partialSign(signer);\n }\n }\n }\n tx = await this.wallet.signTransaction(tx);\n const rawTx = tx.serialize();\n try {\n return await sendAndConfirmRawTransaction(this.connection, rawTx, opts);\n }\n catch (err) {\n // thrown if the underlying 'confirmTransaction' encounters a failed tx\n // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n if (err instanceof ConfirmError) {\n // choose the shortest available commitment for 'getTransaction'\n // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n // commitment `sendAndConfirmRawTransaction` used\n const txSig = encode$1(isVersionedTransaction(tx)\n ? ((_b = tx.signatures) === null || _b === void 0 ? void 0 : _b[0]) || new Uint8Array()\n : (_c = tx.signature) !== null && _c !== void 0 ? _c : new Uint8Array());\n const failedTx = await this.connection.getTransaction(txSig, {\n commitment: \"confirmed\",\n });\n if (!failedTx) {\n throw err;\n }\n else {\n const logs = (_d = failedTx.meta) === null || _d === void 0 ? void 0 : _d.logMessages;\n throw !logs ? err : new SendTransactionError(err.message, logs);\n }\n }\n else {\n throw err;\n }\n }\n }\n /**\n * Similar to `send`, but for an array of transactions and signers.\n * All transactions need to be of the same type, it doesn't support a mix of `VersionedTransaction`s and `Transaction`s.\n *\n * @param txWithSigners Array of transactions and signers.\n * @param opts Transaction confirmation options.\n */\n async sendAll(txWithSigners, opts) {\n var _a, _b, _c;\n if (opts === undefined) {\n opts = this.opts;\n }\n const recentBlockhash = (await this.connection.getLatestBlockhash(opts.preflightCommitment)).blockhash;\n let txs = txWithSigners.map((r) => {\n var _a, _b;\n if (isVersionedTransaction(r.tx)) {\n let tx = r.tx;\n if (r.signers) {\n tx.sign(r.signers);\n }\n return tx;\n }\n else {\n let tx = r.tx;\n let signers = (_a = r.signers) !== null && _a !== void 0 ? _a : [];\n tx.feePayer = (_b = tx.feePayer) !== null && _b !== void 0 ? _b : this.wallet.publicKey;\n tx.recentBlockhash = recentBlockhash;\n signers.forEach((kp) => {\n tx.partialSign(kp);\n });\n return tx;\n }\n });\n const signedTxs = await this.wallet.signAllTransactions(txs);\n const sigs = [];\n for (let k = 0; k < txs.length; k += 1) {\n const tx = signedTxs[k];\n const rawTx = tx.serialize();\n try {\n sigs.push(await sendAndConfirmRawTransaction(this.connection, rawTx, opts));\n }\n catch (err) {\n // thrown if the underlying 'confirmTransaction' encounters a failed tx\n // the 'confirmTransaction' error does not return logs so we make another rpc call to get them\n if (err instanceof ConfirmError) {\n // choose the shortest available commitment for 'getTransaction'\n // (the json RPC does not support any shorter than \"confirmed\" for 'getTransaction')\n // because that will see the tx sent with `sendAndConfirmRawTransaction` no matter which\n // commitment `sendAndConfirmRawTransaction` used\n const txSig = encode$1(isVersionedTransaction(tx)\n ? ((_a = tx.signatures) === null || _a === void 0 ? void 0 : _a[0]) || new Uint8Array()\n : (_b = tx.signature) !== null && _b !== void 0 ? _b : new Uint8Array());\n const failedTx = await this.connection.getTransaction(txSig, {\n commitment: \"confirmed\",\n });\n if (!failedTx) {\n throw err;\n }\n else {\n const logs = (_c = failedTx.meta) === null || _c === void 0 ? void 0 : _c.logMessages;\n throw !logs ? err : new SendTransactionError(err.message, logs);\n }\n }\n else {\n throw err;\n }\n }\n }\n return sigs;\n }\n /**\n * Simulates the given transaction, returning emitted logs from execution.\n *\n * @param tx The transaction to send.\n * @param signers The signers of the transaction. If unset, the transaction\n * will be simulated with the \"sigVerify: false\" option. This\n * allows for simulation of transactions without asking the\n * wallet for a signature.\n * @param opts Transaction confirmation options.\n */\n async simulate(tx, signers, commitment, includeAccounts) {\n let recentBlockhash = (await this.connection.getLatestBlockhash(commitment !== null && commitment !== void 0 ? commitment : this.connection.commitment)).blockhash;\n let result;\n if (isVersionedTransaction(tx)) {\n if (signers) {\n tx.sign(signers);\n tx = await this.wallet.signTransaction(tx);\n }\n // Doesn't support includeAccounts which has been changed to something\n // else in later versions of this function.\n result = await this.connection.simulateTransaction(tx, { commitment });\n }\n else {\n tx.feePayer = tx.feePayer || this.wallet.publicKey;\n tx.recentBlockhash = recentBlockhash;\n if (signers) {\n tx = await this.wallet.signTransaction(tx);\n }\n result = await simulateTransaction(this.connection, tx, signers, commitment, includeAccounts);\n }\n if (result.value.err) {\n throw new SimulateError(result.value);\n }\n return result.value;\n }\n}\nclass SimulateError extends Error {\n constructor(simulationResponse, message) {\n super(message);\n this.simulationResponse = simulationResponse;\n }\n}\n// Copy of Connection.sendAndConfirmRawTransaction that throws\n// a better error if 'confirmTransaction` returns an error status\nasync function sendAndConfirmRawTransaction(connection, rawTransaction, options) {\n const sendOptions = options && {\n skipPreflight: options.skipPreflight,\n preflightCommitment: options.preflightCommitment || options.commitment,\n };\n const signature = await connection.sendRawTransaction(rawTransaction, sendOptions);\n const status = (await connection.confirmTransaction(signature, options && options.commitment)).value;\n if (status.err) {\n throw new ConfirmError(`Raw transaction ${signature} failed (${JSON.stringify(status)})`);\n }\n return signature;\n}\nclass ConfirmError extends Error {\n constructor(message) {\n super(message);\n }\n}\n/**\n * Sets the default provider on the client.\n */\nfunction setProvider(provider) {\n _provider = provider;\n}\n/**\n * Returns the default provider being used by the client.\n */\nfunction getProvider() {\n if (_provider === null) {\n return AnchorProvider.local();\n }\n return _provider;\n}\n// Global provider used as the default when a provider is not given.\nlet _provider = null;\n\nconst _AVAILABLE_FEATURES = new Set([\"anchor-deprecated-state\", \"debug-logs\"]);\nconst _FEATURES = new Map();\nfunction set(key) {\n if (!_AVAILABLE_FEATURES.has(key)) {\n throw new Error(\"Invalid feature\");\n }\n _FEATURES.set(key, true);\n}\nfunction isSet(key) {\n return _FEATURES.get(key) !== undefined;\n}\n\nvar features = /*#__PURE__*/Object.freeze({\n __proto__: null,\n set: set,\n isSet: isSet\n});\n\nclass IdlError extends Error {\n constructor(message) {\n super(message);\n this.name = \"IdlError\";\n }\n}\nclass ProgramErrorStack {\n constructor(stack) {\n this.stack = stack;\n }\n static parse(logs) {\n var _a;\n const programKeyRegex = /^Program (\\w*) invoke/;\n const successRegex = /^Program \\w* success/;\n const programStack = [];\n for (let i = 0; i < logs.length; i++) {\n if (successRegex.exec(logs[i])) {\n programStack.pop();\n continue;\n }\n const programKey = (_a = programKeyRegex.exec(logs[i])) === null || _a === void 0 ? void 0 : _a[1];\n if (!programKey) {\n continue;\n }\n programStack.push(new PublicKey(programKey));\n }\n return new ProgramErrorStack(programStack);\n }\n}\nclass AnchorError extends Error {\n constructor(errorCode, errorMessage, errorLogs, logs, origin, comparedValues) {\n super(errorLogs.join(\"\\n\").replace(\"Program log: \", \"\"));\n this.errorLogs = errorLogs;\n this.logs = logs;\n this.error = { errorCode, errorMessage, comparedValues, origin };\n this._programErrorStack = ProgramErrorStack.parse(logs);\n }\n static parse(logs) {\n if (!logs) {\n return null;\n }\n const anchorErrorLogIndex = logs.findIndex((log) => log.startsWith(\"Program log: AnchorError\"));\n if (anchorErrorLogIndex === -1) {\n return null;\n }\n const anchorErrorLog = logs[anchorErrorLogIndex];\n const errorLogs = [anchorErrorLog];\n let comparedValues;\n if (anchorErrorLogIndex + 1 < logs.length) {\n // This catches the comparedValues where the following is logged\n // <AnchorError>\n // Left:\n // <Pubkey>\n // Right:\n // <Pubkey>\n if (logs[anchorErrorLogIndex + 1] === \"Program log: Left:\") {\n const pubkeyRegex = /^Program log: (.*)$/;\n const leftPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 2])[1];\n const rightPubkey = pubkeyRegex.exec(logs[anchorErrorLogIndex + 4])[1];\n comparedValues = [\n new PublicKey(leftPubkey),\n new PublicKey(rightPubkey),\n ];\n errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 5));\n }\n // This catches the comparedValues where the following is logged\n // <AnchorError>\n // Left: <value>\n // Right: <value>\n else if (logs[anchorErrorLogIndex + 1].startsWith(\"Program log: Left:\")) {\n const valueRegex = /^Program log: (Left|Right): (.*)$/;\n const leftValue = valueRegex.exec(logs[anchorErrorLogIndex + 1])[2];\n const rightValue = valueRegex.exec(logs[anchorErrorLogIndex + 2])[2];\n errorLogs.push(...logs.slice(anchorErrorLogIndex + 1, anchorErrorLogIndex + 3));\n comparedValues = [leftValue, rightValue];\n }\n }\n const regexNoInfo = /^Program log: AnchorError occurred\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n const noInfoAnchorErrorLog = regexNoInfo.exec(anchorErrorLog);\n const regexFileLine = /^Program log: AnchorError thrown in (.*):(\\d*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n const fileLineAnchorErrorLog = regexFileLine.exec(anchorErrorLog);\n const regexAccountName = /^Program log: AnchorError caused by account: (.*)\\. Error Code: (.*)\\. Error Number: (\\d*)\\. Error Message: (.*)\\./;\n const accountNameAnchorErrorLog = regexAccountName.exec(anchorErrorLog);\n if (noInfoAnchorErrorLog) {\n const [errorCodeString, errorNumber, errorMessage] = noInfoAnchorErrorLog.slice(1, 4);\n const errorCode = {\n code: errorCodeString,\n number: parseInt(errorNumber),\n };\n return new AnchorError(errorCode, errorMessage, errorLogs, logs, undefined, comparedValues);\n }\n else if (fileLineAnchorErrorLog) {\n const [file, line, errorCodeString, errorNumber, errorMessage] = fileLineAnchorErrorLog.slice(1, 6);\n const errorCode = {\n code: errorCodeString,\n number: parseInt(errorNumber),\n };\n const fileLine = { file, line: parseInt(line) };\n return new AnchorError(errorCode, errorMessage, errorLogs, logs, fileLine, comparedValues);\n }\n else if (accountNameAnchorErrorLog) {\n const [accountName, errorCodeString, errorNumber, errorMessage] = accountNameAnchorErrorLog.slice(1, 5);\n const origin = accountName;\n const errorCode = {\n code: errorCodeString,\n number: parseInt(errorNumber),\n };\n return new AnchorError(errorCode, errorMessage, errorLogs, logs, origin, comparedValues);\n }\n else {\n return null;\n }\n }\n get program() {\n return this._programErrorStack.stack[this._programErrorStack.stack.length - 1];\n }\n get programErrorStack() {\n return this._programErrorStack.stack;\n }\n toString() {\n return this.message;\n }\n}\n// An error from a user defined program.\nclass ProgramError extends Error {\n constructor(code, msg, logs) {\n super();\n this.code = code;\n this.msg = msg;\n this.logs = logs;\n if (logs) {\n this._programErrorStack = ProgramErrorStack.parse(logs);\n }\n }\n static parse(err, idlErrors) {\n const errString = err.toString();\n // TODO: don't rely on the error string. web3.js should preserve the error\n // code information instead of giving us an untyped string.\n let unparsedErrorCode;\n if (errString.includes(\"custom program error:\")) {\n let components = errString.split(\"custom program error: \");\n if (components.length !== 2) {\n return null;\n }\n else {\n unparsedErrorCode = components[1];\n }\n }\n else {\n const matches = errString.match(/\"Custom\":([0-9]+)}/g);\n if (!matches || matches.length > 1) {\n return null;\n }\n unparsedErrorCode = matches[0].match(/([0-9]+)/g)[0];\n }\n let errorCode;\n try {\n errorCode = parseInt(unparsedErrorCode);\n }\n catch (parseErr) {\n return null;\n }\n // Parse user error.\n let errorMsg = idlErrors.get(errorCode);\n if (errorMsg !== undefined) {\n return new ProgramError(errorCode, errorMsg, err.logs);\n }\n // Parse framework internal error.\n errorMsg = LangErrorMessage.get(errorCode);\n if (errorMsg !== undefined) {\n return new ProgramError(errorCode, errorMsg, err.logs);\n }\n // Unable to parse the error. Just return the untranslated error.\n return null;\n }\n get program() {\n var _a;\n return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack[this._programErrorStack.stack.length - 1];\n }\n get programErrorStack() {\n var _a;\n return (_a = this._programErrorStack) === null || _a === void 0 ? void 0 : _a.stack;\n }\n toString() {\n return this.msg;\n }\n}\nfunction translateError(err, idlErrors) {\n if (isSet(\"debug-logs\")) {\n console.log(\"Translating error:\", err);\n }\n const anchorError = AnchorError.parse(err.logs);\n if (anchorError) {\n return anchorError;\n }\n const programError = ProgramError.parse(err, idlErrors);\n if (programError) {\n return programError;\n }\n if (err.logs) {\n const handler = {\n get: function (target, prop) {\n if (prop === \"programErrorStack\") {\n return target.programErrorStack.stack;\n }\n else if (prop === \"program\") {\n return target.programErrorStack.stack[err.programErrorStack.stack.length - 1];\n }\n else {\n // this is the normal way to return all other props\n // without modifying them.\n // @ts-expect-error\n return Reflect.get(...arguments);\n }\n },\n };\n err.programErrorStack = ProgramErrorStack.parse(err.logs);\n return new Proxy(err, handler);\n }\n return err;\n}\nconst LangErrorCode = {\n // Instructions.\n InstructionMissing: 100,\n InstructionFallbackNotFound: 101,\n InstructionDidNotDeserialize: 102,\n InstructionDidNotSerialize: 103,\n // IDL instructions.\n IdlInstructionStub: 1000,\n IdlInstructionInvalidProgram: 1001,\n // Constraints.\n ConstraintMut: 2000,\n ConstraintHasOne: 2001,\n ConstraintSigner: 2002,\n ConstraintRaw: 2003,\n ConstraintOwner: 2004,\n ConstraintRentExempt: 2005,\n ConstraintSeeds: 2006,\n ConstraintExecutable: 2007,\n ConstraintState: 2008,\n ConstraintAssociated: 2009,\n ConstraintAssociatedInit: 2010,\n ConstraintClose: 2011,\n ConstraintAddress: 2012,\n ConstraintZero: 2013,\n ConstraintTokenMint: 2014,\n ConstraintTokenOwner: 2015,\n ConstraintMintMintAuthority: 2016,\n ConstraintMintFreezeAuthority: 2017,\n ConstraintMintDecimals: 2018,\n ConstraintSpace: 2019,\n ConstraintAccountIsNone: 2020,\n // Require.\n RequireViolated: 2500,\n RequireEqViolated: 2501,\n RequireKeysEqViolated: 2502,\n RequireNeqViolated: 2503,\n RequireKeysNeqViolated: 2504,\n RequireGtViolated: 2505,\n RequireGteViolated: 2506,\n // Accounts.\n AccountDiscriminatorAlreadySet: 3000,\n AccountDiscriminatorNotFound: 3001,\n AccountDiscriminatorMismatch: 3002,\n AccountDidNotDeserialize: 3003,\n AccountDidNotSerialize: 3004,\n AccountNotEnoughKeys: 3005,\n AccountNotMutable: 3006,\n AccountOwnedByWrongProgram: 3007,\n InvalidProgramId: 3008,\n InvalidProgramExecutable: 3009,\n AccountNotSigner: 3010,\n AccountNotSystemOwned: 3011,\n AccountNotInitialized: 3012,\n AccountNotProgramData: 3013,\n AccountNotAssociatedTokenAccount: 3014,\n AccountSysvarMismatch: 3015,\n AccountReallocExceedsLimit: 3016,\n AccountDuplicateReallocs: 3017,\n // Miscellaneous\n DeclaredProgramIdMismatch: 4100,\n // Used for APIs that shouldn't be used anymore.\n Deprecated: 5000,\n};\nconst LangErrorMessage = new Map([\n // Instructions.\n [\n LangErrorCode.InstructionMissing,\n \"8 byte instruction identifier not provided\",\n ],\n [\n LangErrorCode.InstructionFallbackNotFound,\n \"Fallback functions are not supported\",\n ],\n [\n LangErrorCode.InstructionDidNotDeserialize,\n \"The program could not deserialize the given instruction\",\n ],\n [\n LangErrorCode.InstructionDidNotSerialize,\n \"The program could not serialize the given instruction\",\n ],\n // Idl instructions.\n [\n LangErrorCode.IdlInstructionStub,\n \"The program was compiled without idl instructions\",\n ],\n [\n LangErrorCode.IdlInstructionInvalidProgram,\n \"The transaction was given an invalid program for the IDL instruction\",\n ],\n // Constraints.\n [LangErrorCode.ConstraintMut, \"A mut constraint was violated\"],\n [LangErrorCode.ConstraintHasOne, \"A has one constraint was violated\"],\n [LangErrorCode.ConstraintSigner, \"A signer constraint was violated\"],\n [LangErrorCode.ConstraintRaw, \"A raw constraint was violated\"],\n [LangErrorCode.ConstraintOwner, \"An owner constraint was violated\"],\n [\n LangErrorCode.ConstraintRentExempt,\n \"A rent exemption constraint was violated\",\n ],\n [LangErrorCode.ConstraintSeeds, \"A seeds constraint was violated\"],\n [LangErrorCode.ConstraintExecutable, \"An executable constraint was violated\"],\n [\n LangErrorCode.ConstraintState,\n \"Deprecated Error, feel free to replace with something else\",\n ],\n [LangErrorCode.ConstraintAssociated, \"An associated constraint was violated\"],\n [\n LangErrorCode.ConstraintAssociatedInit,\n \"An associated init constraint was violated\",\n ],\n [LangErrorCode.ConstraintClose, \"A close constraint was violated\"],\n [LangErrorCode.ConstraintAddress, \"An address constraint was violated\"],\n [LangErrorCode.ConstraintZero, \"Expected zero account discriminant\"],\n [LangErrorCode.ConstraintTokenMint, \"A token mint constraint was violated\"],\n [LangErrorCode.ConstraintTokenOwner, \"A token owner constraint was violated\"],\n [\n LangErrorCode.ConstraintMintMintAuthority,\n \"A mint mint authority constraint was violated\",\n ],\n [\n LangErrorCode.ConstraintMintFreezeAuthority,\n \"A mint freeze authority constraint was violated\",\n ],\n [\n LangErrorCode.ConstraintMintDecimals,\n \"A mint decimals constraint was violated\",\n ],\n [LangErrorCode.ConstraintSpace, \"A space constraint was violated\"],\n [\n LangErrorCode.ConstraintAccountIsNone,\n \"A required account for the constraint is None\",\n ],\n // Require.\n [LangErrorCode.RequireViolated, \"A require expression was violated\"],\n [LangErrorCode.RequireEqViolated, \"A require_eq expression was violated\"],\n [\n LangErrorCode.RequireKeysEqViolated,\n \"A require_keys_eq expression was violated\",\n ],\n [LangErrorCode.RequireNeqViolated, \"A require_neq expression was violated\"],\n [\n LangErrorCode.RequireKeysNeqViolated,\n \"A require_keys_neq expression was violated\",\n ],\n [LangErrorCode.RequireGtViolated, \"A require_gt expression was violated\"],\n [LangErrorCode.RequireGteViolated, \"A require_gte expression was violated\"],\n // Accounts.\n [\n LangErrorCode.AccountDiscriminatorAlreadySet,\n \"The account discriminator was already set on this account\",\n ],\n [\n LangErrorCode.AccountDiscriminatorNotFound,\n \"No 8 byte discriminator was found on the account\",\n ],\n [\n LangErrorCode.AccountDiscriminatorMismatch,\n \"8 byte discriminator did not match what was expected\",\n ],\n [LangErrorCode.AccountDidNotDeserialize, \"Failed to deserialize the account\"],\n [LangErrorCode.AccountDidNotSerialize, \"Failed to serialize the account\"],\n [\n LangErrorCode.AccountNotEnoughKeys,\n \"Not enough account keys given to the instruction\",\n ],\n [LangErrorCode.AccountNotMutable, \"The given account is not mutable\"],\n [\n LangErrorCode.AccountOwnedByWrongProgram,\n \"The given account is owned by a different program than expected\",\n ],\n [LangErrorCode.InvalidProgramId, \"Program ID was not as expected\"],\n [LangErrorCode.InvalidProgramExecutable, \"Program account is not executable\"],\n [LangErrorCode.AccountNotSigner, \"The given account did not sign\"],\n [\n LangErrorCode.AccountNotSystemOwned,\n \"The given account is not owned by the system program\",\n ],\n [\n LangErrorCode.AccountNotInitialized,\n \"The program expected this account to be already initialized\",\n ],\n [\n LangErrorCode.AccountNotProgramData,\n \"The given account is not a program data account\",\n ],\n [\n LangErrorCode.AccountNotAssociatedTokenAccount,\n \"The given account is not the associated token account\",\n ],\n [\n LangErrorCode.AccountSysvarMismatch,\n \"The given public key does not match the required sysvar\",\n ],\n [\n LangErrorCode.AccountReallocExceedsLimit,\n \"The account reallocation exceeds the MAX_PERMITTED_DATA_INCREASE limit\",\n ],\n [\n LangErrorCode.AccountDuplicateReallocs,\n \"The account was duplicated for more than one reallocation\",\n ],\n // Miscellaneous\n [\n LangErrorCode.DeclaredProgramIdMismatch,\n \"The declared program id does not match the actual program id\",\n ],\n // Deprecated\n [\n LangErrorCode.Deprecated,\n \"The API being used is deprecated and should no longer be used\",\n ],\n]);\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign$1 = function() {\r\n __assign$1 = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n return __assign$1.apply(this, arguments);\r\n};\n\n/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n\r\nvar __assign = function() {\r\n __assign = Object.assign || function __assign(t) {\r\n for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n s = arguments[i];\r\n for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n }\r\n return t;\r\n };\r\n return __assign.apply(this, arguments);\r\n};\n\n/**\n * Source: ftp://ftp.unicode.org/Public/UCD/latest/ucd/SpecialCasing.txt\n */\n/**\n * Lower case as a function.\n */\nfunction lowerCase(str) {\n return str.toLowerCase();\n}\n\n// Support camel case (\"camelCase\" -> \"camel Case\" and \"CAMELCase\" -> \"CAMEL Case\").\nvar DEFAULT_SPLIT_REGEXP = [/([a-z0-9])([A-Z])/g, /([A-Z])([A-Z][a-z])/g];\n// Remove all non-word characters.\nvar DEFAULT_STRIP_REGEXP = /[^A-Z0-9]+/gi;\n/**\n * Normalize the string into something other libraries can manipulate easier.\n */\nfunction noCase(input, options) {\n if (options === void 0) { options = {}; }\n var _a = options.splitRegexp, splitRegexp = _a === void 0 ? DEFAULT_SPLIT_REGEXP : _a, _b = options.stripRegexp, stripRegexp = _b === void 0 ? DEFAULT_STRIP_REGEXP : _b, _c = options.transform, transform = _c === void 0 ? lowerCase : _c, _d = options.delimiter, delimiter = _d === void 0 ? \" \" : _d;\n var result = replace(replace(input, splitRegexp, \"$1\\0$2\"), stripRegexp, \"\\0\");\n var start = 0;\n var end = result.length;\n // Trim the delimiter from around the output string.\n while (result.charAt(start) === \"\\0\")\n start++;\n while (result.charAt(end - 1) === \"\\0\")\n end--;\n // Transform each token independently.\n return result.slice(start, end).split(\"\\0\").map(transform).join(delimiter);\n}\n/**\n * Replace `re` in the input string with the replacement value.\n */\nfunction replace(input, re, value) {\n if (re instanceof RegExp)\n return input.replace(re, value);\n return re.reduce(function (input, re) { return input.replace(re, value); }, input);\n}\n\nfunction dotCase(input, options) {\n if (options === void 0) { options = {}; }\n return noCase(input, __assign({ delimiter: \".\" }, options));\n}\n\nfunction snakeCase(input, options) {\n if (options === void 0) { options = {}; }\n return dotCase(input, __assign$1({ delimiter: \"_\" }, options));\n}\n\nclass IdlCoder {\n static fieldLayout(field, types) {\n const fieldName = field.name !== undefined ? camelCase(field.name) : undefined;\n switch (field.type) {\n case \"bool\": {\n return borsh.bool(fieldName);\n }\n case \"u8\": {\n return borsh.u8(fieldName);\n }\n case \"i8\": {\n return borsh.i8(fieldName);\n }\n case \"u16\": {\n return borsh.u16(fieldName);\n }\n case \"i16\": {\n return borsh.i16(fieldName);\n }\n case \"u32\": {\n return borsh.u32(fieldName);\n }\n case \"i32\": {\n return borsh.i32(fieldName);\n }\n case \"f32\": {\n return borsh.f32(fieldName);\n }\n case \"u64\": {\n return borsh.u64(fieldName);\n }\n case \"i64\": {\n return borsh.i64(fieldName);\n }\n case \"f64\": {\n return borsh.f64(fieldName);\n }\n case \"u128\": {\n return borsh.u128(fieldName);\n }\n case \"i128\": {\n return borsh.i128(fieldName);\n }\n case \"u256\": {\n return borsh.u256(fieldName);\n }\n case \"i256\": {\n return borsh.i256(fieldName);\n }\n case \"bytes\": {\n return borsh.vecU8(fieldName);\n }\n case \"string\": {\n return borsh.str(fieldName);\n }\n case \"publicKey\": {\n return borsh.publicKey(fieldName);\n }\n default: {\n if (\"vec\" in field.type) {\n return borsh.vec(IdlCoder.fieldLayout({\n name: undefined,\n type: field.type.vec,\n }, types), fieldName);\n }\n else if (\"option\" in field.type) {\n return borsh.option(IdlCoder.fieldLayout({\n name: undefined,\n type: field.type.option,\n }, types), fieldName);\n }\n else if (\"defined\" in field.type) {\n const defined = field.type.defined;\n // User defined type.\n if (types === undefined) {\n throw new IdlError(\"User defined types not provided\");\n }\n const filtered = types.filter((t) => t.name === defined);\n if (filtered.length !== 1) {\n throw new IdlError(`Type not found: ${JSON.stringify(field)}`);\n }\n return IdlCoder.typeDefLayout(filtered[0], types, fieldName);\n }\n else if (\"array\" in field.type) {\n let arrayTy = field.type.array[0];\n let arrayLen = field.type.array[1];\n let innerLayout = IdlCoder.fieldLayout({\n name: undefined,\n type: arrayTy,\n }, types);\n return borsh.array(innerLayout, arrayLen, fieldName);\n }\n else {\n throw new Error(`Not yet implemented: ${field}`);\n }\n }\n }\n }\n static typeDefLayout(typeDef, types = [], name) {\n if (typeDef.type.kind === \"struct\") {\n const fieldLayouts = typeDef.type.fields.map((field) => {\n const x = IdlCoder.fieldLayout(field, types);\n return x;\n });\n return borsh.struct(fieldLayouts, name);\n }\n else if (typeDef.type.kind === \"enum\") {\n let variants = typeDef.type.variants.map((variant) => {\n const name = camelCase(variant.name);\n if (variant.fields === undefined) {\n return borsh.struct([], name);\n }\n const fieldLayouts = variant.fields.map((f, i) => {\n if (!f.hasOwnProperty(\"name\")) {\n return IdlCoder.fieldLayout({ type: f, name: i.toString() }, types);\n }\n // this typescript conversion is ok\n // because if f were of type IdlType\n // (that does not have a name property)\n // the check before would've errored\n return IdlCoder.fieldLayout(f, types);\n });\n return borsh.struct(fieldLayouts, name);\n });\n if (name !== undefined) {\n // Buffer-layout lib requires the name to be null (on construction)\n // when used as a field.\n return borsh.rustEnum(variants).replicate(name);\n }\n return borsh.rustEnum(variants, name);\n }\n else {\n throw new Error(`Unknown type kint: ${typeDef}`);\n }\n }\n}\n\n/**\n * Namespace for global instruction function signatures (i.e. functions\n * that aren't namespaced by the state or any of its trait implementations).\n */\nconst SIGHASH_GLOBAL_NAMESPACE = \"global\";\n/**\n * Encodes and decodes program instructions.\n */\nclass BorshInstructionCoder {\n constructor(idl) {\n this.idl = idl;\n this.ixLayout = BorshInstructionCoder.parseIxLayout(idl);\n const sighashLayouts = new Map();\n idl.instructions.forEach((ix) => {\n const sh = sighash(SIGHASH_GLOBAL_NAMESPACE, ix.name);\n sighashLayouts.set(bs58$1.encode(sh), {\n layout: this.ixLayout.get(ix.name),\n name: ix.name,\n });\n });\n this.sighashLayouts = sighashLayouts;\n }\n /**\n * Encodes a program instruction.\n */\n encode(ixName, ix) {\n return this._encode(SIGHASH_GLOBAL_NAMESPACE, ixName, ix);\n }\n _encode(nameSpace, ixName, ix) {\n const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n const methodName = camelCase(ixName);\n const layout = this.ixLayout.get(methodName);\n if (!layout) {\n throw new Error(`Unknown method: ${methodName}`);\n }\n const len = layout.encode(ix, buffer);\n const data = buffer.slice(0, len);\n return Buffer$1.concat([sighash(nameSpace, ixName), data]);\n }\n static parseIxLayout(idl) {\n const ixLayouts = idl.instructions.map((ix) => {\n let fieldLayouts = ix.args.map((arg) => {\n var _a, _b;\n return IdlCoder.fieldLayout(arg, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n });\n const name = camelCase(ix.name);\n return [name, borsh.struct(fieldLayouts, name)];\n });\n return new Map(ixLayouts);\n }\n /**\n * Decodes a program instruction.\n */\n decode(ix, encoding = \"hex\") {\n if (typeof ix === \"string\") {\n ix = encoding === \"hex\" ? Buffer$1.from(ix, \"hex\") : bs58$1.decode(ix);\n }\n let sighash = bs58$1.encode(ix.slice(0, 8));\n let data = ix.slice(8);\n const decoder = this.sighashLayouts.get(sighash);\n if (!decoder) {\n return null;\n }\n return {\n data: decoder.layout.decode(data),\n name: decoder.name,\n };\n }\n /**\n * Returns a formatted table of all the fields in the given instruction data.\n */\n format(ix, accountMetas) {\n return InstructionFormatter.format(ix, accountMetas, this.idl);\n }\n}\nclass InstructionFormatter {\n static format(ix, accountMetas, idl) {\n const idlIx = idl.instructions.filter((i) => ix.name === i.name)[0];\n if (idlIx === undefined) {\n console.error(\"Invalid instruction given\");\n return null;\n }\n const args = idlIx.args.map((idlField) => {\n return {\n name: idlField.name,\n type: InstructionFormatter.formatIdlType(idlField.type),\n data: InstructionFormatter.formatIdlData(idlField, ix.data[idlField.name], idl.types),\n };\n });\n const flatIdlAccounts = InstructionFormatter.flattenIdlAccounts(idlIx.accounts);\n const accounts = accountMetas.map((meta, idx) => {\n if (idx < flatIdlAccounts.length) {\n return {\n name: flatIdlAccounts[idx].name,\n ...meta,\n };\n }\n // \"Remaining accounts\" are unnamed in Anchor.\n else {\n return {\n name: undefined,\n ...meta,\n };\n }\n });\n return {\n args,\n accounts,\n };\n }\n static formatIdlType(idlType) {\n if (typeof idlType === \"string\") {\n return idlType;\n }\n if (\"vec\" in idlType) {\n return `Vec<${this.formatIdlType(idlType.vec)}>`;\n }\n if (\"option\" in idlType) {\n return `Option<${this.formatIdlType(idlType.option)}>`;\n }\n if (\"defined\" in idlType) {\n return idlType.defined;\n }\n if (\"array\" in idlType) {\n return `Array<${idlType.array[0]}; ${idlType.array[1]}>`;\n }\n throw new Error(`Unknown IDL type: ${idlType}`);\n }\n static formatIdlData(idlField, data, types) {\n if (typeof idlField.type === \"string\") {\n return data.toString();\n }\n if (idlField.type.hasOwnProperty(\"vec\")) {\n return (\"[\" +\n data\n .map((d) => this.formatIdlData({ name: \"\", type: idlField.type.vec }, d))\n .join(\", \") +\n \"]\");\n }\n if (idlField.type.hasOwnProperty(\"option\")) {\n return data === null\n ? \"null\"\n : this.formatIdlData({ name: \"\", type: idlField.type.option }, data, types);\n }\n if (idlField.type.hasOwnProperty(\"defined\")) {\n if (types === undefined) {\n throw new Error(\"User defined types not provided\");\n }\n const filtered = types.filter((t) => t.name === idlField.type.defined);\n if (filtered.length !== 1) {\n throw new Error(`Type not found: ${idlField.type.defined}`);\n }\n return InstructionFormatter.formatIdlDataDefined(filtered[0], data, types);\n }\n return \"unknown\";\n }\n static formatIdlDataDefined(typeDef, data, types) {\n if (typeDef.type.kind === \"struct\") {\n const struct = typeDef.type;\n const fields = Object.keys(data)\n .map((k) => {\n const f = struct.fields.filter((f) => f.name === k)[0];\n if (f === undefined) {\n throw new Error(\"Unable to find type\");\n }\n return (k + \": \" + InstructionFormatter.formatIdlData(f, data[k], types));\n })\n .join(\", \");\n return \"{ \" + fields + \" }\";\n }\n else {\n if (typeDef.type.variants.length === 0) {\n return \"{}\";\n }\n // Struct enum.\n if (typeDef.type.variants[0].name) {\n const variants = typeDef.type.variants;\n const variant = Object.keys(data)[0];\n const enumType = data[variant];\n const namedFields = Object.keys(enumType)\n .map((f) => {\n var _a;\n const fieldData = enumType[f];\n const idlField = (_a = variants[variant]) === null || _a === void 0 ? void 0 : _a.filter((v) => v.name === f)[0];\n if (idlField === undefined) {\n throw new Error(\"Unable to find variant\");\n }\n return (f +\n \": \" +\n InstructionFormatter.formatIdlData(idlField, fieldData, types));\n })\n .join(\", \");\n const variantName = camelCase(variant, { pascalCase: true });\n if (namedFields.length === 0) {\n return variantName;\n }\n return `${variantName} { ${namedFields} }`;\n }\n // Tuple enum.\n else {\n // TODO.\n return \"Tuple formatting not yet implemented\";\n }\n }\n }\n static flattenIdlAccounts(accounts, prefix) {\n return accounts\n .map((account) => {\n const accName = sentenceCase(account.name);\n if (account.hasOwnProperty(\"accounts\")) {\n const newPrefix = prefix ? `${prefix} > ${accName}` : accName;\n return InstructionFormatter.flattenIdlAccounts(account.accounts, newPrefix);\n }\n else {\n return {\n ...account,\n name: prefix ? `${prefix} > ${accName}` : accName,\n };\n }\n })\n .flat();\n }\n}\nfunction sentenceCase(field) {\n const result = field.replace(/([A-Z])/g, \" $1\");\n return result.charAt(0).toUpperCase() + result.slice(1);\n}\n// Not technically sighash, since we don't include the arguments, as Rust\n// doesn't allow function overloading.\nfunction sighash(nameSpace, ixName) {\n let name = snakeCase(ixName);\n let preimage = `${nameSpace}:${name}`;\n return Buffer$1.from(sha256$1(preimage).slice(0, 8));\n}\n\nfunction accountSize(idl, idlAccount) {\n if (idlAccount.type.kind === \"enum\") {\n const variantSizes = idlAccount.type.variants.map((variant) => {\n if (!variant.fields) {\n return 0;\n }\n return variant.fields\n .map((f) => {\n // Unnamed enum variant\n if (!(typeof f === \"object\" && \"name\" in f)) {\n return typeSize(idl, f);\n }\n // Named enum variant\n return typeSize(idl, f.type);\n })\n .reduce((acc, size) => acc + size, 0);\n });\n return Math.max(...variantSizes) + 1;\n }\n return idlAccount.type.fields\n .map((f) => typeSize(idl, f.type))\n .reduce((acc, size) => acc + size, 0);\n}\n// Returns the size of the type in bytes. For variable length types, just return\n// 1. Users should override this value in such cases.\nfunction typeSize(idl, ty) {\n var _a, _b;\n switch (ty) {\n case \"bool\":\n return 1;\n case \"u8\":\n return 1;\n case \"i8\":\n return 1;\n case \"i16\":\n return 2;\n case \"u16\":\n return 2;\n case \"u32\":\n return 4;\n case \"i32\":\n return 4;\n case \"f32\":\n return 4;\n case \"u64\":\n return 8;\n case \"i64\":\n return 8;\n case \"f64\":\n return 8;\n case \"u128\":\n return 16;\n case \"i128\":\n return 16;\n case \"u256\":\n return 32;\n case \"i256\":\n return 32;\n case \"bytes\":\n return 1;\n case \"string\":\n return 1;\n case \"publicKey\":\n return 32;\n default:\n if (\"vec\" in ty) {\n return 1;\n }\n if (\"option\" in ty) {\n return 1 + typeSize(idl, ty.option);\n }\n if (\"coption\" in ty) {\n return 4 + typeSize(idl, ty.coption);\n }\n if (\"defined\" in ty) {\n const filtered = (_b = (_a = idl.types) === null || _a === void 0 ? void 0 : _a.filter((t) => t.name === ty.defined)) !== null && _b !== void 0 ? _b : [];\n if (filtered.length !== 1) {\n throw new IdlError(`Type not found: ${JSON.stringify(ty)}`);\n }\n let typeDef = filtered[0];\n return accountSize(idl, typeDef);\n }\n if (\"array\" in ty) {\n let arrayTy = ty.array[0];\n let arraySize = ty.array[1];\n return typeSize(idl, arrayTy) * arraySize;\n }\n throw new Error(`Invalid type ${JSON.stringify(ty)}`);\n }\n}\n\n/**\n * Number of bytes in anchor discriminators\n */\nconst DISCRIMINATOR_SIZE = 8;\nfunction discriminator(preimage) {\n return Buffer.from(sha256$1(preimage).slice(0, DISCRIMINATOR_SIZE));\n}\n\n/**\n * Encodes and decodes account objects.\n */\nclass BorshAccountsCoder {\n constructor(idl) {\n if (idl.accounts === undefined) {\n this.accountLayouts = new Map();\n return;\n }\n const layouts = idl.accounts.map((acc) => {\n return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n });\n this.accountLayouts = new Map(layouts);\n this.idl = idl;\n }\n async encode(accountName, account) {\n const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n const layout = this.accountLayouts.get(accountName);\n if (!layout) {\n throw new Error(`Unknown account: ${accountName}`);\n }\n const len = layout.encode(account, buffer);\n let accountData = buffer.slice(0, len);\n let discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n return Buffer$1.concat([discriminator, accountData]);\n }\n decode(accountName, data) {\n // Assert the account discriminator is correct.\n const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n if (discriminator.compare(data.slice(0, 8))) {\n throw new Error(\"Invalid account discriminator\");\n }\n return this.decodeUnchecked(accountName, data);\n }\n decodeAny(data) {\n const accountDescriminator = data.slice(0, 8);\n const accountName = Array.from(this.accountLayouts.keys()).find((key) => BorshAccountsCoder.accountDiscriminator(key).equals(accountDescriminator));\n if (!accountName) {\n throw new Error(\"Account descriminator not found\");\n }\n return this.decodeUnchecked(accountName, data);\n }\n decodeUnchecked(accountName, ix) {\n // Chop off the discriminator before decoding.\n const data = ix.subarray(DISCRIMINATOR_SIZE);\n const layout = this.accountLayouts.get(accountName);\n if (!layout) {\n throw new Error(`Unknown account: ${accountName}`);\n }\n return layout.decode(data);\n }\n memcmp(accountName, appendData) {\n const discriminator = BorshAccountsCoder.accountDiscriminator(accountName);\n return {\n offset: 0,\n bytes: bs58$1.encode(appendData ? Buffer$1.concat([discriminator, appendData]) : discriminator),\n };\n }\n size(idlAccount) {\n var _a;\n return DISCRIMINATOR_SIZE + ((_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0);\n }\n /**\n * Calculates and returns a unique 8 byte discriminator prepended to all anchor accounts.\n *\n * @param name The name of the account to calculate the discriminator.\n */\n static accountDiscriminator(name) {\n const discriminatorPreimage = `account:${camelCase(name, {\n pascalCase: true,\n preserveConsecutiveUppercase: true,\n })}`;\n return discriminator(discriminatorPreimage);\n }\n}\n\nclass BorshEventCoder {\n constructor(idl) {\n if (idl.events === undefined) {\n this.layouts = new Map();\n return;\n }\n const layouts = idl.events.map((event) => {\n let eventTypeDef = {\n name: event.name,\n type: {\n kind: \"struct\",\n fields: event.fields.map((f) => {\n return { name: f.name, type: f.type };\n }),\n },\n };\n return [event.name, IdlCoder.typeDefLayout(eventTypeDef, idl.types)];\n });\n this.layouts = new Map(layouts);\n this.discriminators = new Map(idl.events === undefined\n ? []\n : idl.events.map((e) => [\n base64$1.fromByteArray(eventDiscriminator(e.name)),\n e.name,\n ]));\n }\n decode(log) {\n let logArr;\n // This will throw if log length is not a multiple of 4.\n try {\n logArr = Buffer$1.from(base64$1.toByteArray(log));\n }\n catch (e) {\n return null;\n }\n const disc = base64$1.fromByteArray(logArr.slice(0, 8));\n // Only deserialize if the discriminator implies a proper event.\n const eventName = this.discriminators.get(disc);\n if (eventName === undefined) {\n return null;\n }\n const layout = this.layouts.get(eventName);\n if (!layout) {\n throw new Error(`Unknown event: ${eventName}`);\n }\n const data = layout.decode(logArr.slice(8));\n return { data, name: eventName };\n }\n}\nfunction eventDiscriminator(name) {\n return discriminator(`event:${name}`);\n}\n\n/**\n * Encodes and decodes user-defined types.\n */\nclass BorshTypesCoder {\n constructor(idl) {\n if (idl.types === undefined) {\n this.typeLayouts = new Map();\n return;\n }\n const layouts = idl.types.map((acc) => {\n return [acc.name, IdlCoder.typeDefLayout(acc, idl.types)];\n });\n this.typeLayouts = new Map(layouts);\n this.idl = idl;\n }\n encode(typeName, type) {\n const buffer = Buffer$1.alloc(1000); // TODO: use a tighter buffer.\n const layout = this.typeLayouts.get(typeName);\n if (!layout) {\n throw new Error(`Unknown type: ${typeName}`);\n }\n const len = layout.encode(type, buffer);\n return buffer.slice(0, len);\n }\n decode(typeName, typeData) {\n const layout = this.typeLayouts.get(typeName);\n if (!layout) {\n throw new Error(`Unknown type: ${typeName}`);\n }\n return layout.decode(typeData);\n }\n}\n\n/**\n * BorshCoder is the default Coder for Anchor programs implementing the\n * borsh based serialization interface.\n */\nclass BorshCoder {\n constructor(idl) {\n this.instruction = new BorshInstructionCoder(idl);\n this.accounts = new BorshAccountsCoder(idl);\n this.events = new BorshEventCoder(idl);\n this.types = new BorshTypesCoder(idl);\n }\n}\n\nvar commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};\n\nfunction getDefaultExportFromCjs (x) {\n\treturn x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;\n}\n\n/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}. The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n constructor(span, property) {\n if (!Number.isInteger(span)) {\n throw new TypeError('span must be an integer');\n }\n\n /** The span of the layout in bytes.\n *\n * Positive values are generally expected.\n *\n * Zero will only appear in {@link Constant}s and in {@link\n * Sequence}s where the {@link Sequence#count|count} is zero.\n *\n * A negative value indicates that the span is value-specific, and\n * must be obtained using {@link Layout#getSpan|getSpan}. */\n this.span = span;\n\n /** The property name used when this layout is represented in an\n * Object.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances. If left undefined the span of the unnamed layout will\n * be treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n\n /** Function to create an Object into which decoded properties will\n * be written.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances, which means:\n * * {@link Structure}\n * * {@link Union}\n * * {@link VariantLayout}\n * * {@link BitStructure}\n *\n * If left undefined the JavaScript representation of these layouts\n * will be Object instances.\n *\n * See {@link bindConstructorLayout}.\n */\n makeDestinationObject() {\n return {};\n }\n\n /**\n * Decode from a Buffer into an JavaScript value.\n *\n * @param {Buffer} b - the buffer from which encoded data is read.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {(Number|Array|Object)} - the value of the decoded data.\n *\n * @abstract\n */\n decode(b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Encode a JavaScript value into a Buffer.\n *\n * @param {(Number|Array|Object)} src - the value to be encoded into\n * the buffer. The type accepted depends on the (sub-)type of {@link\n * Layout}.\n *\n * @param {Buffer} b - the buffer into which encoded data will be\n * written.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {Number} - the number of bytes encoded, including the\n * space skipped for internal padding, but excluding data such as\n * {@link Sequence#count|lengths} when stored {@link\n * ExternalLayout|externally}. This is the adjustment to `offset`\n * producing the offset where data for the next layout would be\n * written.\n *\n * @abstract\n */\n encode(src, b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Calculate the span of a specific instance of a layout.\n *\n * @param {Buffer} b - the buffer that contains an encoded instance.\n *\n * @param {Number} [offset] - the offset at which the encoded instance\n * starts. If absent a zero offset is inferred.\n *\n * @return {Number} - the number of bytes covered by the layout\n * instance. If this method is not overridden in a subclass the\n * definition-time constant {@link Layout#span|span} will be\n * returned.\n *\n * @throws {RangeError} - if the length of the value cannot be\n * determined.\n */\n getSpan(b, offset) {\n if (0 > this.span) {\n throw new RangeError('indeterminate span');\n }\n return this.span;\n }\n\n /**\n * Replicate the layout using a new property.\n *\n * This function must be used to get a structurally-equivalent layout\n * with a different name since all {@link Layout} instances are\n * immutable.\n *\n * **NOTE** This is a shallow copy. All fields except {@link\n * Layout#property|property} are strictly equal to the origin layout.\n *\n * @param {String} property - the value for {@link\n * Layout#property|property} in the replica.\n *\n * @returns {Layout} - the copy with {@link Layout#property|property}\n * set to `property`.\n */\n replicate(property) {\n const rv = Object.create(this.constructor.prototype);\n Object.assign(rv, this);\n rv.property = property;\n return rv;\n }\n\n /**\n * Create an object from layout properties and an array of values.\n *\n * **NOTE** This function returns `undefined` if invoked on a layout\n * that does not return its value as an Object. Objects are\n * returned for things that are a {@link Structure}, which includes\n * {@link VariantLayout|variant layouts} if they are structures, and\n * excludes {@link Union}s. If you want this feature for a union\n * you must use {@link Union.getVariant|getVariant} to select the\n * desired layout.\n *\n * @param {Array} values - an array of values that correspond to the\n * default order for properties. As with {@link Layout#decode|decode}\n * layout elements that have no property name are skipped when\n * iterating over the array values. Only the top-level properties are\n * assigned; arguments are not assigned to properties of contained\n * layouts. Any unused values are ignored.\n *\n * @return {(Object|undefined)}\n */\n fromArray(values) {\n return undefined;\n }\n}\nvar Layout_2 = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n if (lo.property) {\n return name + '[' + lo.property + ']';\n }\n return name;\n}\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n /**\n * Return `true` iff the external layout decodes to an unsigned\n * integer layout.\n *\n * In that case it can be used as the source of {@link\n * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n * or as {@link UnionLayoutDiscriminator#layout|external union\n * discriminators}.\n *\n * @abstract\n */\n isCount() {\n throw new Error('ExternalLayout is abstract');\n }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout. The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}. Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}. If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n constructor(layout, offset, property) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n\n if (undefined === offset) {\n offset = 0;\n } else if (!Number.isInteger(offset)) {\n throw new TypeError('offset must be integer or undefined');\n }\n\n super(layout.span, property || layout.property);\n\n /** The subordinated layout. */\n this.layout = layout;\n\n /** The location of {@link OffsetLayout#layout} relative to the\n * start of another layout.\n *\n * The value may be positive or negative, but an error will thrown\n * if at the point of use it goes outside the span of the Buffer\n * being accessed. */\n this.offset = offset;\n }\n\n /** @override */\n isCount() {\n return ((this.layout instanceof UInt)\n || (this.layout instanceof UIntBE));\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.decode(b, offset + this.offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.encode(src, b, offset + this.offset);\n }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n * module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n * module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n * module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntLE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntLE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n constructor(span, property) {\n super( span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntBE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntBE(src, offset, this.span);\n return this.span;\n }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n const hi32 = Math.floor(src / V2E32);\n const lo32 = src - (hi32 * V2E32);\n return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readUInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeUInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span. When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage. We can only identify the value\n * for a field when it has a {@link Layout#property|property}. As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}. An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n constructor(fields, property, decodePrefixes) {\n if (!(Array.isArray(fields)\n && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n throw new TypeError('fields must be array of Layout instances');\n }\n if (('boolean' === typeof property)\n && (undefined === decodePrefixes)) {\n decodePrefixes = property;\n property = undefined;\n }\n\n /* Verify absence of unnamed variable-length fields. */\n for (const fd of fields) {\n if ((0 > fd.span)\n && (undefined === fd.property)) {\n throw new Error('fields cannot contain unnamed variable-length layout');\n }\n }\n\n let span = -1;\n try {\n span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n } catch (e) {\n }\n super(span, property);\n\n /** The sequence of {@link Layout} values that comprise the\n * structure.\n *\n * The individual elements need not be the same type, and may be\n * either scalar or aggregate layouts. If a member layout leaves\n * its {@link Layout#property|property} undefined the\n * corresponding region of the buffer associated with the element\n * will not be mutated.\n *\n * @type {Layout[]} */\n this.fields = fields;\n\n /** Control behavior of {@link Layout#decode|decode()} given short\n * buffers.\n *\n * In some situations a structure many be extended with additional\n * fields over time, with older installations providing only a\n * prefix of the full structure. If this property is `true`\n * decoding will accept those buffers and leave subsequent fields\n * undefined, as long as the buffer ends at a field boundary.\n * Defaults to `false`. */\n this.decodePrefixes = !!decodePrefixes;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let span = 0;\n try {\n span = this.fields.reduce((span, fd) => {\n const fsp = fd.getSpan(b, offset);\n offset += fsp;\n return span + fsp;\n }, 0);\n } catch (e) {\n throw new RangeError('indeterminate span');\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(b, offset);\n }\n offset += fd.getSpan(b, offset);\n if (this.decodePrefixes\n && (b.length === offset)) {\n break;\n }\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Structure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the buffer is\n * left unmodified. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const firstOffset = offset;\n let lastOffset = 0;\n let lastWrote = 0;\n for (const fd of this.fields) {\n let span = fd.span;\n lastWrote = (0 < span) ? span : 0;\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n lastWrote = fd.encode(fv, b, offset);\n if (0 > span) {\n /* Read the as-encoded span, which is not necessarily the\n * same as what we wrote. */\n span = fd.getSpan(b, offset);\n }\n }\n }\n lastOffset = offset;\n offset += span;\n }\n /* Use (lastOffset + lastWrote) instead of offset because the last\n * item may have had a dynamic length and we don't want to include\n * the padding between it and the end of the space reserved for\n * it. */\n return (lastOffset + lastWrote) - firstOffset;\n }\n\n /** @override */\n fromArray(values) {\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if ((undefined !== fd.property)\n && (0 < values.length)) {\n dest[fd.property] = values.shift();\n }\n }\n return dest;\n }\n\n /**\n * Get access to the layout of a given property.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Layout} - the layout associated with `property`, or\n * undefined if there is no such property.\n */\n layoutFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n }\n\n /**\n * Get the offset of a structure member.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Number} - the offset in bytes to the start of `property`\n * within the structure, or undefined if `property` is not a field\n * within the structure. If the property is a member but follows a\n * variable-length structure member a negative number will be\n * returned.\n */\n offsetOf(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n let offset = 0;\n for (const fd of this.fields) {\n if (fd.property === property) {\n return offset;\n }\n if (0 > fd.span) {\n offset = -1;\n } else if (0 <= offset) {\n offset += fd.span;\n }\n }\n }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n constructor(property) {\n /** The {@link Layout#property|property} to be used when the\n * discriminator is referenced in isolation (generally when {@link\n * Union#decode|Union decode} cannot delegate to a specific\n * variant). */\n this.property = property;\n }\n\n /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n *\n * The implementation of this method need not reference the buffer if\n * variant information is available through other means. */\n decode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n\n /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n *\n * The implementation of this method need not store the value if\n * variant information is maintained through other means. */\n encode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}. Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n constructor(layout, property) {\n if (!((layout instanceof ExternalLayout)\n && layout.isCount())) {\n throw new TypeError('layout must be an unsigned integer ExternalLayout');\n }\n\n super(property || layout.property || 'variant');\n\n /** The {@link ExternalLayout} used to access the discriminator\n * value. */\n this.layout = layout;\n }\n\n /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n decode(b, offset) {\n return this.layout.decode(b, offset);\n }\n\n /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n encode(src, b, offset) {\n return this.layout.encode(src, b, offset);\n }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}. The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}. If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used). The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents. The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}). When a non-external layout element is passed the layout\n * appears at the start of the union. In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}. If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception. A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n constructor(discr, defaultLayout, property) {\n const upv = ((discr instanceof UInt)\n || (discr instanceof UIntBE));\n if (upv) {\n discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n } else if ((discr instanceof ExternalLayout)\n && discr.isCount()) {\n discr = new UnionLayoutDiscriminator(discr);\n } else if (!(discr instanceof UnionDiscriminator)) {\n throw new TypeError('discr must be a UnionDiscriminator '\n + 'or an unsigned integer layout');\n }\n if (undefined === defaultLayout) {\n defaultLayout = null;\n }\n if (!((null === defaultLayout)\n || (defaultLayout instanceof Layout))) {\n throw new TypeError('defaultLayout must be null or a Layout');\n }\n if (null !== defaultLayout) {\n if (0 > defaultLayout.span) {\n throw new Error('defaultLayout must have constant span');\n }\n if (undefined === defaultLayout.property) {\n defaultLayout = defaultLayout.replicate('content');\n }\n }\n\n /* The union span can be estimated only if there's a default\n * layout. The union spans its default layout, plus any prefix\n * variant layout. By construction both layouts, if present, have\n * non-negative span. */\n let span = -1;\n if (defaultLayout) {\n span = defaultLayout.span;\n if ((0 <= span) && upv) {\n span += discr.layout.span;\n }\n }\n super(span, property);\n\n /** The interface for the discriminator value in isolation.\n *\n * This a {@link UnionDiscriminator} either passed to the\n * constructor or synthesized from the `discr` constructor\n * argument. {@link\n * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n * `true` iff the `discr` parameter was a non-offset {@link\n * Layout} instance. */\n this.discriminator = discr;\n\n /** `true` if the {@link Union#discriminator|discriminator} is the\n * first field in the union.\n *\n * If `false` the discriminator is obtained from somewhere\n * else. */\n this.usesPrefixDiscriminator = upv;\n\n /** The layout for non-discriminator content when the value of the\n * discriminator is not recognized.\n *\n * This is the value passed to the constructor. It is\n * structurally equivalent to the second component of {@link\n * Union#layout|layout} but may have a different property\n * name. */\n this.defaultLayout = defaultLayout;\n\n /** A registry of allowed variants.\n *\n * The keys are unsigned integers which should be compatible with\n * {@link Union.discriminator|discriminator}. The property value\n * is the corresponding {@link VariantLayout} instances assigned\n * to this union by {@link Union#addVariant|addVariant}.\n *\n * **NOTE** The registry remains mutable so that variants can be\n * {@link Union#addVariant|added} at any time. Users should not\n * manipulate the content of this property. */\n this.registry = {};\n\n /* Private variable used when invoking getSourceVariant */\n let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n /** Function to infer the variant selected by a source object.\n *\n * Defaults to {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n * be overridden using {@link\n * Union#configGetSourceVariant|configGetSourceVariant}.\n *\n * @param {Object} src - as with {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * @returns {(undefined|VariantLayout)} The default variant\n * (`undefined`) or first registered variant that uses a property\n * available in `src`. */\n this.getSourceVariant = function(src) {\n return boundGetSourceVariant(src);\n };\n\n /** Function to override the implementation of {@link\n * Union#getSourceVariant|getSourceVariant}.\n *\n * Use this if the desired variant cannot be identified using the\n * algorithm of {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * **NOTE** The provided function will be invoked bound to this\n * Union instance, providing local access to {@link\n * Union#registry|registry}.\n *\n * @param {Function} gsv - a function that follows the API of\n * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n this.configGetSourceVariant = function(gsv) {\n boundGetSourceVariant = gsv.bind(this);\n };\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n /* Default layouts always have non-negative span, so we don't have\n * one and we have to recognize the variant which will in turn\n * determine the span. */\n const vlo = this.getVariant(b, offset);\n if (!vlo) {\n throw new Error('unable to determine span for unrecognized variant');\n }\n return vlo.getSpan(b, offset);\n }\n\n /**\n * Method to infer a registered Union variant compatible with `src`.\n *\n * The first satisified rule in the following sequence defines the\n * return value:\n * * If `src` has properties matching the Union discriminator and\n * the default layout, `undefined` is returned regardless of the\n * value of the discriminator property (this ensures the default\n * layout will be used);\n * * If `src` has a property matching the Union discriminator, the\n * value of the discriminator identifies a registered variant, and\n * either (a) the variant has no layout, or (b) `src` has the\n * variant's property, then the variant is returned (because the\n * source satisfies the constraints of the variant it identifies);\n * * If `src` does not have a property matching the Union\n * discriminator, but does have a property matching a registered\n * variant, then the variant is returned (because the source\n * matches a variant without an explicit conflict);\n * * An error is thrown (because we either can't identify a variant,\n * or we were explicitly told the variant but can't satisfy it).\n *\n * @param {Object} src - an object presumed to be compatible with\n * the content of the Union.\n *\n * @return {(undefined|VariantLayout)} - as described above.\n *\n * @throws {Error} - if `src` cannot be associated with a default or\n * registered variant.\n */\n defaultGetSourceVariant(src) {\n if (src.hasOwnProperty(this.discriminator.property)) {\n if (this.defaultLayout\n && src.hasOwnProperty(this.defaultLayout.property)) {\n return undefined;\n }\n const vlo = this.registry[src[this.discriminator.property]];\n if (vlo\n && ((!vlo.layout)\n || src.hasOwnProperty(vlo.property))) {\n return vlo;\n }\n } else {\n for (const tag in this.registry) {\n const vlo = this.registry[tag];\n if (src.hasOwnProperty(vlo.property)) {\n return vlo;\n }\n }\n }\n throw new Error('unable to infer src variant');\n }\n\n /** Implement {@link Layout#decode|decode} for {@link Union}.\n *\n * If the variant is {@link Union#addVariant|registered} the return\n * value is an instance of that variant, with no explicit\n * discriminator. Otherwise the {@link Union#defaultLayout|default\n * layout} is used to decode the content. */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let dest;\n const dlo = this.discriminator;\n const discr = dlo.decode(b, offset);\n let clo = this.registry[discr];\n if (undefined === clo) {\n let contentOffset = 0;\n clo = this.defaultLayout;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dest = this.makeDestinationObject();\n dest[dlo.property] = discr;\n dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n } else {\n dest = clo.decode(b, offset);\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Union}.\n *\n * This API assumes the `src` object is consistent with the union's\n * {@link Union#defaultLayout|default layout}. To encode variants\n * use the appropriate variant-specific {@link VariantLayout#encode}\n * method. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const vlo = this.getSourceVariant(src);\n if (undefined === vlo) {\n const dlo = this.discriminator;\n const clo = this.defaultLayout;\n let contentOffset = 0;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dlo.encode(src[dlo.property], b, offset);\n return contentOffset + clo.encode(src[clo.property], b,\n offset + contentOffset);\n }\n return vlo.encode(src, b, offset);\n }\n\n /** Register a new variant structure within a union. The newly\n * created variant is returned.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} layout - initializer for {@link\n * VariantLayout#layout|layout}.\n *\n * @param {String} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {VariantLayout} */\n addVariant(variant, layout, property) {\n const rv = new VariantLayout(this, variant, layout, property);\n this.registry[variant] = rv;\n return rv;\n }\n\n /**\n * Get the layout associated with a registered variant.\n *\n * If `vb` does not produce a registered variant the function returns\n * `undefined`.\n *\n * @param {(Number|Buffer)} vb - either the variant number, or a\n * buffer from which the discriminator is to be read.\n *\n * @param {Number} offset - offset into `vb` for the start of the\n * union. Used only when `vb` is an instance of {Buffer}.\n *\n * @return {({VariantLayout}|undefined)}\n */\n getVariant(vb, offset) {\n let variant = vb;\n if (Buffer.isBuffer(vb)) {\n if (undefined === offset) {\n offset = 0;\n }\n variant = this.discriminator.decode(vb, offset);\n }\n return this.registry[variant];\n }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly. Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}. If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}. Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}. The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n constructor(union, variant, layout, property) {\n if (!(union instanceof Union)) {\n throw new TypeError('union must be a Union');\n }\n if ((!Number.isInteger(variant)) || (0 > variant)) {\n throw new TypeError('variant must be a (non-negative) integer');\n }\n if (('string' === typeof layout)\n && (undefined === property)) {\n property = layout;\n layout = null;\n }\n if (layout) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n if ((null !== union.defaultLayout)\n && (0 <= layout.span)\n && (layout.span > union.defaultLayout.span)) {\n throw new Error('variant span exceeds span of containing union');\n }\n if ('string' !== typeof property) {\n throw new TypeError('variant must have a String property');\n }\n }\n let span = union.span;\n if (0 > union.span) {\n span = layout ? layout.span : 0;\n if ((0 <= span) && union.usesPrefixDiscriminator) {\n span += union.discriminator.layout.span;\n }\n }\n super(span, property);\n\n /** The {@link Union} to which this variant belongs. */\n this.union = union;\n\n /** The unsigned integral value identifying this variant within\n * the {@link Union#discriminator|discriminator} of the containing\n * union. */\n this.variant = variant;\n\n /** The {@link Layout} to be used when reading/writing the\n * non-discriminator part of the {@link\n * VariantLayout#union|union}. If `null` the variant carries no\n * data. */\n this.layout = layout || null;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n /* Will be equal to the containing union span if that is not\n * variable. */\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n /* Span is defined solely by the variant (and prefix discriminator) */\n return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n }\n\n /** @override */\n decode(b, offset) {\n const dest = this.makeDestinationObject();\n if (undefined === offset) {\n offset = 0;\n }\n if (this !== this.union.getVariant(b, offset)) {\n throw new Error('variant mismatch');\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout) {\n dest[this.property] = this.layout.decode(b, offset + contentOffset);\n } else if (this.property) {\n dest[this.property] = true;\n } else if (this.union.usesPrefixDiscriminator) {\n dest[this.union.discriminator.property] = this.variant;\n }\n return dest;\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout\n && (!src.hasOwnProperty(this.property))) {\n throw new TypeError('variant lacks property ' + this.property);\n }\n this.union.discriminator.encode(this.variant, b, offset);\n let span = contentOffset;\n if (this.layout) {\n this.layout.encode(src[this.property], b, offset + contentOffset);\n span += this.layout.getSpan(b, offset + contentOffset);\n if ((0 <= this.union.span)\n && (span > this.union.span)) {\n throw new Error('encoded variant overruns containing union');\n }\n }\n return span;\n }\n\n /** Delegate {@link Layout#fromArray|fromArray} to {@link\n * VariantLayout#layout|layout}. */\n fromArray(values) {\n if (this.layout) {\n return this.layout.fromArray(values);\n }\n }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob$1 extends Layout {\n constructor(length, property) {\n if (!(((length instanceof ExternalLayout) && length.isCount())\n || (Number.isInteger(length) && (0 <= length)))) {\n throw new TypeError('length must be positive integer '\n + 'or an unsigned integer ExternalLayout');\n }\n\n let span = -1;\n if (!(length instanceof ExternalLayout)) {\n span = length;\n }\n super(span, property);\n\n /** The number of bytes in the blob.\n *\n * This may be a non-negative integer, or an instance of {@link\n * ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}. */\n this.length = length;\n }\n\n /** @override */\n getSpan(b, offset) {\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return b.slice(offset, offset + span);\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Blob}.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n let span = this.length;\n if (this.length instanceof ExternalLayout) {\n span = src.length;\n }\n if (!(Buffer.isBuffer(src)\n && (span === src.length))) {\n throw new TypeError(nameWithProperty('Blob.encode', this)\n + ' requires (length ' + span + ') Buffer as src');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n b.write(src.toString('hex'), offset, span, 'hex');\n if (this.length instanceof ExternalLayout) {\n this.length.encode(span, b, offset);\n }\n return span;\n }\n}\n\n/** Factory for {@link OffsetLayout}. */\nvar offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nvar u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nvar u32 = (property => new UInt(4, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nvar nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nvar ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Structure} values. */\nvar struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link Union} values. */\nvar union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link Blob} values. */\nvar blob = ((length, property) => new Blob$1(length, property));\n\nclass SystemInstructionCoder {\n // eslint-disable-next-line @typescript-eslint/no-empty-function\n constructor(_) { }\n encode(ixName, ix) {\n switch (camelCase(ixName)) {\n case \"createAccount\": {\n return encodeCreateAccount(ix);\n }\n case \"assign\": {\n return encodeAssign(ix);\n }\n case \"transfer\": {\n return encodeTransfer(ix);\n }\n case \"createAccountWithSeed\": {\n return encodeCreateAccountWithSeed(ix);\n }\n case \"advanceNonceAccount\": {\n return encodeAdvanceNonceAccount(ix);\n }\n case \"withdrawNonceAccount\": {\n return encodeWithdrawNonceAccount(ix);\n }\n case \"initializeNonceAccount\": {\n return encodeInitializeNonceAccount(ix);\n }\n case \"authorizeNonceAccount\": {\n return encodeAuthorizeNonceAccount(ix);\n }\n case \"allocate\": {\n return encodeAllocate(ix);\n }\n case \"allocateWithSeed\": {\n return encodeAllocateWithSeed(ix);\n }\n case \"assignWithSeed\": {\n return encodeAssignWithSeed(ix);\n }\n case \"transferWithSeed\": {\n return encodeTransferWithSeed(ix);\n }\n default: {\n throw new Error(`Invalid instruction: ${ixName}`);\n }\n }\n }\n encodeState(_ixName, _ix) {\n throw new Error(\"System does not have state\");\n }\n}\nclass RustStringLayout extends Layout_2 {\n constructor(property) {\n super(-1, property);\n this.property = property;\n this.layout = struct([\n u32(\"length\"),\n u32(\"lengthPadding\"),\n blob(offset(u32(), -8), \"chars\"),\n ], this.property);\n }\n encode(src, b, offset = 0) {\n if (src === null || src === undefined) {\n return this.layout.span;\n }\n const data = {\n chars: Buffer.from(src, \"utf8\"),\n };\n return this.layout.encode(data, b, offset);\n }\n decode(b, offset = 0) {\n const data = this.layout.decode(b, offset);\n return data[\"chars\"].toString();\n }\n getSpan(b, offset = 0) {\n return (u32().span +\n u32().span +\n new BN(new Uint8Array(b).slice(offset, offset + 4), 10, \"le\").toNumber());\n }\n}\nfunction rustStringLayout(property) {\n return new RustStringLayout(property);\n}\nfunction publicKey$2(property) {\n return blob(32, property);\n}\nfunction encodeCreateAccount({ lamports, space, owner }) {\n return encodeData({\n createAccount: { lamports, space, owner: owner.toBuffer() },\n });\n}\nfunction encodeAssign({ owner }) {\n return encodeData({\n assign: { owner: owner.toBuffer() },\n });\n}\nfunction encodeTransfer({ lamports }) {\n return encodeData({\n transfer: { lamports },\n });\n}\nfunction encodeCreateAccountWithSeed({ base, seed, lamports, space, owner, }) {\n return encodeData({\n createAccountWithSeed: {\n base: base.toBuffer(),\n seed,\n lamports,\n space,\n owner: owner.toBuffer(),\n },\n }, LAYOUT.getVariant(3).span + seed.length);\n}\nfunction encodeInitializeNonceAccount({ authorized }) {\n return encodeData({\n initializeNonceAccount: { authorized: authorized.toBuffer() },\n });\n}\nfunction encodeAdvanceNonceAccount({ authorized }) {\n return encodeData({\n advanceNonceAccount: { authorized: authorized.toBuffer() },\n });\n}\nfunction encodeWithdrawNonceAccount({ lamports }) {\n return encodeData({\n withdrawNonceAccount: { lamports },\n });\n}\nfunction encodeAuthorizeNonceAccount({ authorized }) {\n return encodeData({\n authorizeNonceAccount: { authorized: authorized.toBuffer() },\n });\n}\nfunction encodeAllocate({ space }) {\n return encodeData({\n allocate: { space },\n });\n}\nfunction encodeAllocateWithSeed({ base, seed, space, owner }) {\n return encodeData({\n allocateWithSeed: {\n base: base.toBuffer(),\n seed,\n space,\n owner: owner.toBuffer(),\n },\n }, LAYOUT.getVariant(9).span + seed.length);\n}\nfunction encodeAssignWithSeed({ base, seed, owner }) {\n return encodeData({\n assignWithSeed: {\n base: base.toBuffer(),\n seed,\n owner: owner.toBuffer(),\n },\n }, LAYOUT.getVariant(10).span + seed.length);\n}\nfunction encodeTransferWithSeed({ lamports, seed, owner }) {\n return encodeData({\n transferWithSeed: {\n lamports,\n seed,\n owner: owner.toBuffer(),\n },\n }, LAYOUT.getVariant(11).span + seed.length);\n}\nconst LAYOUT = union(u32(\"instruction\"));\nLAYOUT.addVariant(0, struct([\n ns64(\"lamports\"),\n ns64(\"space\"),\n publicKey$2(\"owner\"),\n]), \"createAccount\");\nLAYOUT.addVariant(1, struct([publicKey$2(\"owner\")]), \"assign\");\nLAYOUT.addVariant(2, struct([ns64(\"lamports\")]), \"transfer\");\nLAYOUT.addVariant(3, struct([\n publicKey$2(\"base\"),\n rustStringLayout(\"seed\"),\n ns64(\"lamports\"),\n ns64(\"space\"),\n publicKey$2(\"owner\"),\n]), \"createAccountWithSeed\");\nLAYOUT.addVariant(4, struct([publicKey$2(\"authorized\")]), \"advanceNonceAccount\");\nLAYOUT.addVariant(5, struct([ns64(\"lamports\")]), \"withdrawNonceAccount\");\nLAYOUT.addVariant(6, struct([publicKey$2(\"authorized\")]), \"initializeNonceAccount\");\nLAYOUT.addVariant(7, struct([publicKey$2(\"authorized\")]), \"authorizeNonceAccount\");\nLAYOUT.addVariant(8, struct([ns64(\"space\")]), \"allocate\");\nLAYOUT.addVariant(9, struct([\n publicKey$2(\"base\"),\n rustStringLayout(\"seed\"),\n ns64(\"space\"),\n publicKey$2(\"owner\"),\n]), \"allocateWithSeed\");\nLAYOUT.addVariant(10, struct([\n publicKey$2(\"base\"),\n rustStringLayout(\"seed\"),\n publicKey$2(\"owner\"),\n]), \"assignWithSeed\");\nLAYOUT.addVariant(11, struct([\n ns64(\"lamports\"),\n rustStringLayout(\"seed\"),\n publicKey$2(\"owner\"),\n]), \"transferWithSeed\");\nfunction encodeData(instruction, maxSpan) {\n const b = Buffer.alloc(maxSpan !== null && maxSpan !== void 0 ? maxSpan : instructionMaxSpan);\n const span = LAYOUT.encode(instruction, b);\n if (maxSpan === undefined) {\n return b.slice(0, span);\n }\n return b;\n}\nconst instructionMaxSpan = Math.max(...Object.values(LAYOUT.registry).map((r) => r.span));\n\nclass SystemAccountsCoder {\n constructor(idl) {\n this.idl = idl;\n }\n async encode(accountName, account) {\n switch (accountName) {\n case \"nonce\": {\n const buffer = Buffer.alloc(NONCE_ACCOUNT_LENGTH);\n const len = NONCE_ACCOUNT_LAYOUT.encode(account, buffer);\n return buffer.slice(0, len);\n }\n default: {\n throw new Error(`Invalid account name: ${accountName}`);\n }\n }\n }\n decode(accountName, ix) {\n return this.decodeUnchecked(accountName, ix);\n }\n decodeUnchecked(accountName, ix) {\n switch (accountName) {\n case \"nonce\": {\n return decodeNonceAccount(ix);\n }\n default: {\n throw new Error(`Invalid account name: ${accountName}`);\n }\n }\n }\n // TODO: this won't use the appendData.\n memcmp(accountName, _appendData) {\n switch (accountName) {\n case \"nonce\": {\n return {\n dataSize: NONCE_ACCOUNT_LENGTH,\n };\n }\n default: {\n throw new Error(`Invalid account name: ${accountName}`);\n }\n }\n }\n size(idlAccount) {\n var _a;\n return (_a = accountSize(this.idl, idlAccount)) !== null && _a !== void 0 ? _a : 0;\n }\n}\nfunction decodeNonceAccount(ix) {\n return NONCE_ACCOUNT_LAYOUT.decode(ix);\n}\nclass WrappedLayout$1 extends Layout_2 {\n constructor(layout, decoder, encoder, property) {\n super(layout.span, property);\n this.layout = layout;\n this.decoder = decoder;\n this.encoder = encoder;\n }\n decode(b, offset) {\n return this.decoder(this.layout.decode(b, offset));\n }\n encode(src, b, offset) {\n return this.layout.encode(this.encoder(src), b, offset);\n }\n getSpan(b, offset) {\n return this.layout.getSpan(b, offset);\n }\n}\nfunction publicKey$1(property) {\n return new WrappedLayout$1(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nconst NONCE_ACCOUNT_LAYOUT = struct([\n u32(\"version\"),\n u32(\"state\"),\n publicKey$1(\"authorizedPubkey\"),\n publicKey$1(\"nonce\"),\n struct([nu64(\"lamportsPerSignature\")], \"feeCalculator\"),\n]);\n\nclass SystemEventsCoder {\n constructor(_idl) { }\n decode(_log) {\n throw new Error(\"System program does not have events\");\n }\n}\n\nclass SystemTypesCoder {\n constructor(_idl) { }\n encode(_name, _type) {\n throw new Error(\"System does not have user-defined types\");\n }\n decode(_name, _typeData) {\n throw new Error(\"System does not have user-defined types\");\n }\n}\n\n/**\n * Coder for the System program.\n */\nclass SystemCoder {\n constructor(idl) {\n this.instruction = new SystemInstructionCoder(idl);\n this.accounts = new SystemAccountsCoder(idl);\n this.events = new SystemEventsCoder(idl);\n this.types = new SystemTypesCoder(idl);\n }\n}\n\nfunction hash(data) {\n return new TextDecoder().decode(sha256$1(data));\n}\n\nvar sha256 = /*#__PURE__*/Object.freeze({\n __proto__: null,\n hash: hash\n});\n\n// Sync version of web3.PublicKey.createWithSeed.\nfunction createWithSeedSync(fromPublicKey, seed, programId) {\n const buffer = Buffer$1.concat([\n fromPublicKey.toBuffer(),\n Buffer$1.from(seed),\n programId.toBuffer(),\n ]);\n return new PublicKey(sha256$1(buffer));\n}\nfunction associated(programId, ...args) {\n let seeds = [Buffer$1.from([97, 110, 99, 104, 111, 114])]; // b\"anchor\".\n args.forEach((arg) => {\n seeds.push(arg instanceof Buffer$1 ? arg : translateAddress(arg).toBuffer());\n });\n const [assoc] = PublicKey.findProgramAddressSync(seeds, translateAddress(programId));\n return assoc;\n}\n\nvar pubkey = /*#__PURE__*/Object.freeze({\n __proto__: null,\n createWithSeedSync: createWithSeedSync,\n associated: associated\n});\n\nconst TOKEN_PROGRAM_ID = new PublicKey(\"TokenkegQfeZyiNwAJbNbGKPFXCWuBvf9Ss623VQ5DA\");\nconst ASSOCIATED_PROGRAM_ID = new PublicKey(\"ATokenGPvbdGVxr1b2hvZbsiqW5xWH25efTNsLJA8knL\");\nfunction associatedAddress({ mint, owner, }) {\n return PublicKey.findProgramAddressSync([owner.toBuffer(), TOKEN_PROGRAM_ID.toBuffer(), mint.toBuffer()], ASSOCIATED_PROGRAM_ID)[0];\n}\n\nvar token = /*#__PURE__*/Object.freeze({\n __proto__: null,\n TOKEN_PROGRAM_ID: TOKEN_PROGRAM_ID,\n ASSOCIATED_PROGRAM_ID: ASSOCIATED_PROGRAM_ID,\n associatedAddress: associatedAddress\n});\n\nvar browserPonyfill = {exports: {}};\n\n(function (module, exports) {\nvar global = typeof self !== 'undefined' ? self : commonjsGlobal;\nvar __self__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = global.DOMException;\n}\nF.prototype = global;\nreturn new F();\n})();\n(function(self) {\n\n((function (exports) {\n\n var support = {\n searchParams: 'URLSearchParams' in self,\n iterable: 'Symbol' in self && 'iterator' in Symbol,\n blob:\n 'FileReader' in self &&\n 'Blob' in self &&\n (function() {\n try {\n new Blob();\n return true\n } catch (e) {\n return false\n }\n })(),\n formData: 'FormData' in self,\n arrayBuffer: 'ArrayBuffer' in self\n };\n\n function isDataView(obj) {\n return obj && DataView.prototype.isPrototypeOf(obj)\n }\n\n if (support.arrayBuffer) {\n var viewClasses = [\n '[object Int8Array]',\n '[object Uint8Array]',\n '[object Uint8ClampedArray]',\n '[object Int16Array]',\n '[object Uint16Array]',\n '[object Int32Array]',\n '[object Uint32Array]',\n '[object Float32Array]',\n '[object Float64Array]'\n ];\n\n var isArrayBufferView =\n ArrayBuffer.isView ||\n function(obj) {\n return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n };\n }\n\n function normalizeName(name) {\n if (typeof name !== 'string') {\n name = String(name);\n }\n if (/[^a-z0-9\\-#$%&'*+.^_`|~]/i.test(name)) {\n throw new TypeError('Invalid character in header field name')\n }\n return name.toLowerCase()\n }\n\n function normalizeValue(value) {\n if (typeof value !== 'string') {\n value = String(value);\n }\n return value\n }\n\n // Build a destructive iterator for the value list\n function iteratorFor(items) {\n var iterator = {\n next: function() {\n var value = items.shift();\n return {done: value === undefined, value: value}\n }\n };\n\n if (support.iterable) {\n iterator[Symbol.iterator] = function() {\n return iterator\n };\n }\n\n return iterator\n }\n\n function Headers(headers) {\n this.map = {};\n\n if (headers instanceof Headers) {\n headers.forEach(function(value, name) {\n this.append(name, value);\n }, this);\n } else if (Array.isArray(headers)) {\n headers.forEach(function(header) {\n this.append(header[0], header[1]);\n }, this);\n } else if (headers) {\n Object.getOwnPropertyNames(headers).forEach(function(name) {\n this.append(name, headers[name]);\n }, this);\n }\n }\n\n Headers.prototype.append = function(name, value) {\n name = normalizeName(name);\n value = normalizeValue(value);\n var oldValue = this.map[name];\n this.map[name] = oldValue ? oldValue + ', ' + value : value;\n };\n\n Headers.prototype['delete'] = function(name) {\n delete this.map[normalizeName(name)];\n };\n\n Headers.prototype.get = function(name) {\n name = normalizeName(name);\n return this.has(name) ? this.map[name] : null\n };\n\n Headers.prototype.has = function(name) {\n return this.map.hasOwnProperty(normalizeName(name))\n };\n\n Headers.prototype.set = function(name, value) {\n this.map[normalizeName(name)] = normalizeValue(value);\n };\n\n Headers.prototype.forEach = function(callback, thisArg) {\n for (var name in this.map) {\n if (this.map.hasOwnProperty(name)) {\n callback.call(thisArg, this.map[name], name, this);\n }\n }\n };\n\n Headers.prototype.keys = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push(name);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.values = function() {\n var items = [];\n this.forEach(function(value) {\n items.push(value);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.entries = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push([name, value]);\n });\n return iteratorFor(items)\n };\n\n if (support.iterable) {\n Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n }\n\n function consumed(body) {\n if (body.bodyUsed) {\n return Promise.reject(new TypeError('Already read'))\n }\n body.bodyUsed = true;\n }\n\n function fileReaderReady(reader) {\n return new Promise(function(resolve, reject) {\n reader.onload = function() {\n resolve(reader.result);\n };\n reader.onerror = function() {\n reject(reader.error);\n };\n })\n }\n\n function readBlobAsArrayBuffer(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n reader.readAsArrayBuffer(blob);\n return promise\n }\n\n function readBlobAsText(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n reader.readAsText(blob);\n return promise\n }\n\n function readArrayBufferAsText(buf) {\n var view = new Uint8Array(buf);\n var chars = new Array(view.length);\n\n for (var i = 0; i < view.length; i++) {\n chars[i] = String.fromCharCode(view[i]);\n }\n return chars.join('')\n }\n\n function bufferClone(buf) {\n if (buf.slice) {\n return buf.slice(0)\n } else {\n var view = new Uint8Array(buf.byteLength);\n view.set(new Uint8Array(buf));\n return view.buffer\n }\n }\n\n function Body() {\n this.bodyUsed = false;\n\n this._initBody = function(body) {\n this._bodyInit = body;\n if (!body) {\n this._bodyText = '';\n } else if (typeof body === 'string') {\n this._bodyText = body;\n } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n this._bodyBlob = body;\n } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n this._bodyFormData = body;\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this._bodyText = body.toString();\n } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n this._bodyArrayBuffer = bufferClone(body.buffer);\n // IE 10-11 can't handle a DataView body.\n this._bodyInit = new Blob([this._bodyArrayBuffer]);\n } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) || isArrayBufferView(body))) {\n this._bodyArrayBuffer = bufferClone(body);\n } else {\n this._bodyText = body = Object.prototype.toString.call(body);\n }\n\n if (!this.headers.get('content-type')) {\n if (typeof body === 'string') {\n this.headers.set('content-type', 'text/plain;charset=UTF-8');\n } else if (this._bodyBlob && this._bodyBlob.type) {\n this.headers.set('content-type', this._bodyBlob.type);\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n }\n }\n };\n\n if (support.blob) {\n this.blob = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return Promise.resolve(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as blob')\n } else {\n return Promise.resolve(new Blob([this._bodyText]))\n }\n };\n\n this.arrayBuffer = function() {\n if (this._bodyArrayBuffer) {\n return consumed(this) || Promise.resolve(this._bodyArrayBuffer)\n } else {\n return this.blob().then(readBlobAsArrayBuffer)\n }\n };\n }\n\n this.text = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return readBlobAsText(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as text')\n } else {\n return Promise.resolve(this._bodyText)\n }\n };\n\n if (support.formData) {\n this.formData = function() {\n return this.text().then(decode)\n };\n }\n\n this.json = function() {\n return this.text().then(JSON.parse)\n };\n\n return this\n }\n\n // HTTP methods whose capitalization should be normalized\n var methods = ['DELETE', 'GET', 'HEAD', 'OPTIONS', 'POST', 'PUT'];\n\n function normalizeMethod(method) {\n var upcased = method.toUpperCase();\n return methods.indexOf(upcased) > -1 ? upcased : method\n }\n\n function Request(input, options) {\n options = options || {};\n var body = options.body;\n\n if (input instanceof Request) {\n if (input.bodyUsed) {\n throw new TypeError('Already read')\n }\n this.url = input.url;\n this.credentials = input.credentials;\n if (!options.headers) {\n this.headers = new Headers(input.headers);\n }\n this.method = input.method;\n this.mode = input.mode;\n this.signal = input.signal;\n if (!body && input._bodyInit != null) {\n body = input._bodyInit;\n input.bodyUsed = true;\n }\n } else {\n this.url = String(input);\n }\n\n this.credentials = options.credentials || this.credentials || 'same-origin';\n if (options.headers || !this.headers) {\n this.headers = new Headers(options.headers);\n }\n this.method = normalizeMethod(options.method || this.method || 'GET');\n this.mode = options.mode || this.mode || null;\n this.signal = options.signal || this.signal;\n this.referrer = null;\n\n if ((this.method === 'GET' || this.method === 'HEAD') && body) {\n throw new TypeError('Body not allowed for GET or HEAD requests')\n }\n this._initBody(body);\n }\n\n Request.prototype.clone = function() {\n return new Request(this, {body: this._bodyInit})\n };\n\n function decode(body) {\n var form = new FormData();\n body\n .trim()\n .split('&')\n .forEach(function(bytes) {\n if (bytes) {\n var split = bytes.split('=');\n var name = split.shift().replace(/\\+/g, ' ');\n var value = split.join('=').replace(/\\+/g, ' ');\n form.append(decodeURIComponent(name), decodeURIComponent(value));\n }\n });\n return form\n }\n\n function parseHeaders(rawHeaders) {\n var headers = new Headers();\n // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n // https://tools.ietf.org/html/rfc7230#section-3.2\n var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n preProcessedHeaders.split(/\\r?\\n/).forEach(function(line) {\n var parts = line.split(':');\n var key = parts.shift().trim();\n if (key) {\n var value = parts.join(':').trim();\n headers.append(key, value);\n }\n });\n return headers\n }\n\n Body.call(Request.prototype);\n\n function Response(bodyInit, options) {\n if (!options) {\n options = {};\n }\n\n this.type = 'default';\n this.status = options.status === undefined ? 200 : options.status;\n this.ok = this.status >= 200 && this.status < 300;\n this.statusText = 'statusText' in options ? options.statusText : 'OK';\n this.headers = new Headers(options.headers);\n this.url = options.url || '';\n this._initBody(bodyInit);\n }\n\n Body.call(Response.prototype);\n\n Response.prototype.clone = function() {\n return new Response(this._bodyInit, {\n status: this.status,\n statusText: this.statusText,\n headers: new Headers(this.headers),\n url: this.url\n })\n };\n\n Response.error = function() {\n var response = new Response(null, {status: 0, statusText: ''});\n response.type = 'error';\n return response\n };\n\n var redirectStatuses = [301, 302, 303, 307, 308];\n\n Response.redirect = function(url, status) {\n if (redirectStatuses.indexOf(status) === -1) {\n throw new RangeError('Invalid status code')\n }\n\n return new Response(null, {status: status, headers: {location: url}})\n };\n\n exports.DOMException = self.DOMException;\n try {\n new exports.DOMException();\n } catch (err) {\n exports.DOMException = function(message, name) {\n this.message = message;\n this.name = name;\n var error = Error(message);\n this.stack = error.stack;\n };\n exports.DOMException.prototype = Object.create(Error.prototype);\n exports.DOMException.prototype.constructor = exports.DOMException;\n }\n\n function fetch(input, init) {\n return new Promise(function(resolve, reject) {\n var request = new Request(input, init);\n\n if (request.signal && request.signal.aborted) {\n return reject(new exports.DOMException('Aborted', 'AbortError'))\n }\n\n var xhr = new XMLHttpRequest();\n\n function abortXhr() {\n xhr.abort();\n }\n\n xhr.onload = function() {\n var options = {\n status: xhr.status,\n statusText: xhr.statusText,\n headers: parseHeaders(xhr.getAllResponseHeaders() || '')\n };\n options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n var body = 'response' in xhr ? xhr.response : xhr.responseText;\n resolve(new Response(body, options));\n };\n\n xhr.onerror = function() {\n reject(new TypeError('Network request failed'));\n };\n\n xhr.ontimeout = function() {\n reject(new TypeError('Network request failed'));\n };\n\n xhr.onabort = function() {\n reject(new exports.DOMException('Aborted', 'AbortError'));\n };\n\n xhr.open(request.method, request.url, true);\n\n if (request.credentials === 'include') {\n xhr.withCredentials = true;\n } else if (request.credentials === 'omit') {\n xhr.withCredentials = false;\n }\n\n if ('responseType' in xhr && support.blob) {\n xhr.responseType = 'blob';\n }\n\n request.headers.forEach(function(value, name) {\n xhr.setRequestHeader(name, value);\n });\n\n if (request.signal) {\n request.signal.addEventListener('abort', abortXhr);\n\n xhr.onreadystatechange = function() {\n // DONE (success or failure)\n if (xhr.readyState === 4) {\n request.signal.removeEventListener('abort', abortXhr);\n }\n };\n }\n\n xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n })\n }\n\n fetch.polyfill = true;\n\n if (!self.fetch) {\n self.fetch = fetch;\n self.Headers = Headers;\n self.Request = Request;\n self.Response = Response;\n }\n\n exports.Headers = Headers;\n exports.Request = Request;\n exports.Response = Response;\n exports.fetch = fetch;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n return exports;\n\n}))({});\n})(__self__);\n__self__.fetch.ponyfill = true;\n// Remove \"polyfill\" property added by whatwg-fetch\ndelete __self__.fetch.polyfill;\n// Choose between native implementation (global) or custom implementation (__self__)\n// var ctx = global.fetch ? global : __self__;\nvar ctx = __self__; // this line disable service worker support temporarily\nexports = ctx.fetch; // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch; // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch; // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers;\nexports.Request = ctx.Request;\nexports.Response = ctx.Response;\nmodule.exports = exports;\n}(browserPonyfill, browserPonyfill.exports));\n\nvar fetch = /*@__PURE__*/getDefaultExportFromCjs(browserPonyfill.exports);\n\n/**\n * Returns a verified build from the anchor registry. null if no such\n * verified build exists, e.g., if the program has been upgraded since the\n * last verified build.\n */\nasync function verifiedBuild(connection, programId, limit = 5) {\n const url = `https://api.apr.dev/api/v0/program/${programId.toString()}/latest?limit=${limit}`;\n const [programData, latestBuildsResp] = await Promise.all([\n fetchData(connection, programId),\n fetch(url),\n ]);\n // Filter out all non successful builds.\n const latestBuilds = (await latestBuildsResp.json()).filter((b) => !b.aborted && b.state === \"Built\" && b.verified === \"Verified\");\n if (latestBuilds.length === 0) {\n return null;\n }\n // Get the latest build.\n const build = latestBuilds[0];\n // Has the program been upgraded since the last build?\n if (programData.slot.toNumber() !== build.verified_slot) {\n return null;\n }\n // Success.\n return build;\n}\n/**\n * Returns the program data account for this program, containing the\n * metadata for this program, e.g., the upgrade authority.\n */\nasync function fetchData(connection, programId) {\n const accountInfo = await connection.getAccountInfo(programId);\n if (accountInfo === null) {\n throw new Error(\"program account not found\");\n }\n const { program } = decodeUpgradeableLoaderState(accountInfo.data);\n const programdataAccountInfo = await connection.getAccountInfo(program.programdataAddress);\n if (programdataAccountInfo === null) {\n throw new Error(\"program data account not found\");\n }\n const { programData } = decodeUpgradeableLoaderState(programdataAccountInfo.data);\n return programData;\n}\nconst UPGRADEABLE_LOADER_STATE_LAYOUT = borsh.rustEnum([\n borsh.struct([], \"uninitialized\"),\n borsh.struct([borsh.option(borsh.publicKey(), \"authorityAddress\")], \"buffer\"),\n borsh.struct([borsh.publicKey(\"programdataAddress\")], \"program\"),\n borsh.struct([\n borsh.u64(\"slot\"),\n borsh.option(borsh.publicKey(), \"upgradeAuthorityAddress\"),\n ], \"programData\"),\n], undefined, borsh.u32());\nfunction decodeUpgradeableLoaderState(data) {\n return UPGRADEABLE_LOADER_STATE_LAYOUT.decode(data);\n}\n\nvar registry = /*#__PURE__*/Object.freeze({\n __proto__: null,\n verifiedBuild: verifiedBuild,\n fetchData: fetchData,\n decodeUpgradeableLoaderState: decodeUpgradeableLoaderState\n});\n\nvar index = /*#__PURE__*/Object.freeze({\n __proto__: null,\n sha256: sha256,\n rpc: rpc,\n publicKey: pubkey,\n bytes: index$1,\n token: token,\n features: features,\n registry: registry\n});\n\nfunction isIdlAccounts(accountItem) {\n return \"accounts\" in accountItem;\n}\n// Deterministic IDL address as a function of the program id.\nasync function idlAddress(programId) {\n const base = (await PublicKey.findProgramAddress([], programId))[0];\n return await PublicKey.createWithSeed(base, seed(), programId);\n}\n// Seed for generating the idlAddress.\nfunction seed() {\n return \"anchor:idl\";\n}\nconst IDL_ACCOUNT_LAYOUT = borsh.struct([\n borsh.publicKey(\"authority\"),\n borsh.vecU8(\"data\"),\n]);\nfunction decodeIdlAccount(data) {\n return IDL_ACCOUNT_LAYOUT.decode(data);\n}\n\nfunction splitArgsAndCtx(idlIx, args) {\n var _a, _b;\n let options = {};\n const inputLen = idlIx.args ? idlIx.args.length : 0;\n if (args.length > inputLen) {\n if (args.length !== inputLen + 1) {\n throw new Error(`provided too many arguments ${args} to instruction ${idlIx === null || idlIx === void 0 ? void 0 : idlIx.name} expecting: ${(_b = (_a = idlIx.args) === null || _a === void 0 ? void 0 : _a.map((a) => a.name)) !== null && _b !== void 0 ? _b : []}`);\n }\n options = args.pop();\n }\n return [args, options];\n}\n\nclass InstructionNamespaceFactory {\n static build(idlIx, encodeFn, programId) {\n if (idlIx.name === \"_inner\") {\n throw new IdlError(\"the _inner name is reserved\");\n }\n const ix = (...args) => {\n const [ixArgs, ctx] = splitArgsAndCtx(idlIx, [...args]);\n validateAccounts(idlIx.accounts, ctx.accounts);\n validateInstruction(idlIx, ...args);\n const keys = ix.accounts(ctx.accounts);\n if (ctx.remainingAccounts !== undefined) {\n keys.push(...ctx.remainingAccounts);\n }\n if (isSet(\"debug-logs\")) {\n console.log(\"Outgoing account metas:\", keys);\n }\n return new TransactionInstruction({\n keys,\n programId,\n data: encodeFn(idlIx.name, toInstruction(idlIx, ...ixArgs)),\n });\n };\n // Utility fn for ordering the accounts for this instruction.\n ix[\"accounts\"] = (accs) => {\n return InstructionNamespaceFactory.accountsArray(accs, idlIx.accounts, programId, idlIx.name);\n };\n return ix;\n }\n static accountsArray(ctx, accounts, programId, ixName) {\n if (!ctx) {\n return [];\n }\n return accounts\n .map((acc) => {\n // Nested accounts.\n const nestedAccounts = \"accounts\" in acc ? acc.accounts : undefined;\n if (nestedAccounts !== undefined) {\n const rpcAccs = ctx[acc.name];\n return InstructionNamespaceFactory.accountsArray(rpcAccs, acc.accounts, programId, ixName).flat();\n }\n else {\n const account = acc;\n let pubkey;\n try {\n pubkey = translateAddress(ctx[acc.name]);\n }\n catch (err) {\n throw new Error(`Wrong input type for account \"${acc.name}\" in the instruction accounts object${ixName !== undefined ? ' for instruction \"' + ixName + '\"' : \"\"}. Expected PublicKey or string.`);\n }\n const optional = account.isOptional && pubkey.equals(programId);\n const isWritable = account.isMut && !optional;\n const isSigner = account.isSigner && !optional;\n return {\n pubkey,\n isWritable,\n isSigner,\n };\n }\n })\n .flat();\n }\n}\n// Throws error if any argument required for the `ix` is not given.\nfunction validateInstruction(ix, ...args) {\n // todo\n}\n\nclass TransactionFactory {\n static build(idlIx, ixFn) {\n const txFn = (...args) => {\n var _a, _b, _c;\n const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n const tx = new Transaction();\n if (ctx.preInstructions && ctx.instructions) {\n throw new Error(\"instructions is deprecated, use preInstructions\");\n }\n (_a = ctx.preInstructions) === null || _a === void 0 ? void 0 : _a.forEach((ix) => tx.add(ix));\n (_b = ctx.instructions) === null || _b === void 0 ? void 0 : _b.forEach((ix) => tx.add(ix));\n tx.add(ixFn(...args));\n (_c = ctx.postInstructions) === null || _c === void 0 ? void 0 : _c.forEach((ix) => tx.add(ix));\n return tx;\n };\n return txFn;\n }\n}\n\nclass RpcFactory {\n static build(idlIx, txFn, idlErrors, provider) {\n const rpc = async (...args) => {\n var _a;\n const tx = txFn(...args);\n const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n if (provider.sendAndConfirm === undefined) {\n throw new Error(\"This function requires 'Provider.sendAndConfirm' to be implemented.\");\n }\n try {\n return await provider.sendAndConfirm(tx, (_a = ctx.signers) !== null && _a !== void 0 ? _a : [], ctx.options);\n }\n catch (err) {\n throw translateError(err, idlErrors);\n }\n };\n return rpc;\n }\n}\n\nclass AccountFactory {\n static build(idl, coder, programId, provider) {\n var _a;\n const accountFns = {};\n (_a = idl.accounts) === null || _a === void 0 ? void 0 : _a.forEach((idlAccount) => {\n const name = camelCase(idlAccount.name);\n accountFns[name] = new AccountClient(idl, idlAccount, programId, provider, coder);\n });\n return accountFns;\n }\n}\nclass AccountClient {\n /**\n * Returns the number of bytes in this account.\n */\n get size() {\n return this._size;\n }\n /**\n * Returns the program ID owning all accounts.\n */\n get programId() {\n return this._programId;\n }\n /**\n * Returns the client's wallet and network provider.\n */\n get provider() {\n return this._provider;\n }\n /**\n * Returns the coder.\n */\n get coder() {\n return this._coder;\n }\n /**\n * Returns the idl account.\n */\n get idlAccount() {\n return this._idlAccount;\n }\n constructor(idl, idlAccount, programId, provider, coder) {\n this._idlAccount = idlAccount;\n this._programId = programId;\n this._provider = provider !== null && provider !== void 0 ? provider : getProvider();\n this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n this._size = this._coder.accounts.size(idlAccount);\n }\n /**\n * Returns a deserialized account, returning null if it doesn't exist.\n *\n * @param address The address of the account to fetch.\n */\n async fetchNullable(address, commitment) {\n const { data } = await this.fetchNullableAndContext(address, commitment);\n return data;\n }\n /**\n * Returns a deserialized account along with the associated rpc response context, returning null if it doesn't exist.\n *\n * @param address The address of the account to fetch.\n */\n async fetchNullableAndContext(address, commitment) {\n const accountInfo = await this.getAccountInfoAndContext(address, commitment);\n const { value, context } = accountInfo;\n return {\n data: value && value.data.length !== 0\n ? this._coder.accounts.decode(this._idlAccount.name, value.data)\n : null,\n context,\n };\n }\n /**\n * Returns a deserialized account.\n *\n * @param address The address of the account to fetch.\n */\n async fetch(address, commitment) {\n const { data } = await this.fetchNullableAndContext(address, commitment);\n if (data === null) {\n throw new Error(`Account does not exist or has no data ${address.toString()}`);\n }\n return data;\n }\n /**\n * Returns a deserialized account along with the associated rpc response context.\n *\n * @param address The address of the account to fetch.\n */\n async fetchAndContext(address, commitment) {\n const { data, context } = await this.fetchNullableAndContext(address, commitment);\n if (data === null) {\n throw new Error(`Account does not exist ${address.toString()}`);\n }\n return { data, context };\n }\n /**\n * Returns multiple deserialized accounts.\n * Accounts not found or with wrong discriminator are returned as null.\n *\n * @param addresses The addresses of the accounts to fetch.\n */\n async fetchMultiple(addresses, commitment) {\n const accounts = await this.fetchMultipleAndContext(addresses, commitment);\n return accounts.map((account) => (account ? account.data : null));\n }\n /**\n * Returns multiple deserialized accounts.\n * Accounts not found or with wrong discriminator are returned as null.\n *\n * @param addresses The addresses of the accounts to fetch.\n */\n async fetchMultipleAndContext(addresses, commitment) {\n const accounts = await getMultipleAccountsAndContext(this._provider.connection, addresses.map((address) => translateAddress(address)), commitment);\n // Decode accounts where discriminator is correct, null otherwise\n return accounts.map((result) => {\n if (result == null) {\n return null;\n }\n const { account, context } = result;\n return {\n data: this._coder.accounts.decode(this._idlAccount.name, account.data),\n context,\n };\n });\n }\n /**\n * Returns all instances of this account type for the program.\n *\n * @param filters User-provided filters to narrow the results from `connection.getProgramAccounts`.\n *\n * When filters are not defined this method returns all\n * the account instances.\n *\n * When filters are of type `Buffer`, the filters are appended\n * after the discriminator.\n *\n * When filters are of type `GetProgramAccountsFilter[]`,\n * filters are appended after the discriminator filter.\n */\n async all(filters) {\n const filter = this.coder.accounts.memcmp(this._idlAccount.name, filters instanceof Buffer ? filters : undefined);\n const coderFilters = [];\n if ((filter === null || filter === void 0 ? void 0 : filter.offset) != undefined && (filter === null || filter === void 0 ? void 0 : filter.bytes) != undefined) {\n coderFilters.push({\n memcmp: { offset: filter.offset, bytes: filter.bytes },\n });\n }\n if ((filter === null || filter === void 0 ? void 0 : filter.dataSize) != undefined) {\n coderFilters.push({ dataSize: filter.dataSize });\n }\n let resp = await this._provider.connection.getProgramAccounts(this._programId, {\n commitment: this._provider.connection.commitment,\n filters: [...coderFilters, ...(Array.isArray(filters) ? filters : [])],\n });\n return resp.map(({ pubkey, account }) => {\n return {\n publicKey: pubkey,\n account: this._coder.accounts.decode(this._idlAccount.name, account.data),\n };\n });\n }\n /**\n * Returns an `EventEmitter` emitting a \"change\" event whenever the account\n * changes.\n */\n subscribe(address, commitment) {\n const sub = subscriptions.get(address.toString());\n if (sub) {\n return sub.ee;\n }\n const ee = new EventEmitter();\n address = translateAddress(address);\n const listener = this._provider.connection.onAccountChange(address, (acc) => {\n const account = this._coder.accounts.decode(this._idlAccount.name, acc.data);\n ee.emit(\"change\", account);\n }, commitment);\n subscriptions.set(address.toString(), {\n ee,\n listener,\n });\n return ee;\n }\n /**\n * Unsubscribes from the account at the given address.\n */\n async unsubscribe(address) {\n let sub = subscriptions.get(address.toString());\n if (!sub) {\n console.warn(\"Address is not subscribed\");\n return;\n }\n if (subscriptions) {\n await this._provider.connection\n .removeAccountChangeListener(sub.listener)\n .then(() => {\n subscriptions.delete(address.toString());\n })\n .catch(console.error);\n }\n }\n /**\n * Returns an instruction for creating this account.\n */\n async createInstruction(signer, sizeOverride) {\n const size = this.size;\n if (this._provider.publicKey === undefined) {\n throw new Error(\"This function requires the Provider interface implementor to have a 'publicKey' field.\");\n }\n return SystemProgram.createAccount({\n fromPubkey: this._provider.publicKey,\n newAccountPubkey: signer.publicKey,\n space: sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size,\n lamports: await this._provider.connection.getMinimumBalanceForRentExemption(sizeOverride !== null && sizeOverride !== void 0 ? sizeOverride : size),\n programId: this._programId,\n });\n }\n /**\n * @deprecated since version 14.0.\n *\n * Function returning the associated account. Args are keys to associate.\n * Order matters.\n */\n async associated(...args) {\n const addr = await this.associatedAddress(...args);\n return await this.fetch(addr);\n }\n /**\n * @deprecated since version 14.0.\n *\n * Function returning the associated address. Args are keys to associate.\n * Order matters.\n */\n async associatedAddress(...args) {\n return await associated(this._programId, ...args);\n }\n async getAccountInfo(address, commitment) {\n return await this._provider.connection.getAccountInfo(translateAddress(address), commitment);\n }\n async getAccountInfoAndContext(address, commitment) {\n return await this._provider.connection.getAccountInfoAndContext(translateAddress(address), commitment);\n }\n}\n// Tracks all subscriptions.\nconst subscriptions = new Map();\n\nconst PROGRAM_LOG = \"Program log: \";\nconst PROGRAM_DATA = \"Program data: \";\nconst PROGRAM_LOG_START_INDEX = PROGRAM_LOG.length;\nconst PROGRAM_DATA_START_INDEX = PROGRAM_DATA.length;\nclass EventManager {\n constructor(programId, provider, coder) {\n this._programId = programId;\n this._provider = provider;\n this._eventParser = new EventParser(programId, coder);\n this._eventCallbacks = new Map();\n this._eventListeners = new Map();\n this._listenerIdCount = 0;\n }\n addEventListener(eventName, callback) {\n var _a;\n let listener = this._listenerIdCount;\n this._listenerIdCount += 1;\n // Store the listener into the event map.\n if (!this._eventListeners.has(eventName)) {\n this._eventListeners.set(eventName, []);\n }\n this._eventListeners.set(eventName, ((_a = this._eventListeners.get(eventName)) !== null && _a !== void 0 ? _a : []).concat(listener));\n // Store the callback into the listener map.\n this._eventCallbacks.set(listener, [eventName, callback]);\n // Create the subscription singleton, if needed.\n if (this._onLogsSubscriptionId !== undefined) {\n return listener;\n }\n this._onLogsSubscriptionId = this._provider.connection.onLogs(this._programId, (logs, ctx) => {\n if (logs.err) {\n return;\n }\n for (const event of this._eventParser.parseLogs(logs.logs)) {\n const allListeners = this._eventListeners.get(event.name);\n if (allListeners) {\n allListeners.forEach((listener) => {\n const listenerCb = this._eventCallbacks.get(listener);\n if (listenerCb) {\n const [, callback] = listenerCb;\n callback(event.data, ctx.slot, logs.signature);\n }\n });\n }\n }\n });\n return listener;\n }\n async removeEventListener(listener) {\n // Get the callback.\n const callback = this._eventCallbacks.get(listener);\n if (!callback) {\n throw new Error(`Event listener ${listener} doesn't exist!`);\n }\n const [eventName] = callback;\n // Get the listeners.\n let listeners = this._eventListeners.get(eventName);\n if (!listeners) {\n throw new Error(`Event listeners don't exist for ${eventName}!`);\n }\n // Update both maps.\n this._eventCallbacks.delete(listener);\n listeners = listeners.filter((l) => l !== listener);\n this._eventListeners.set(eventName, listeners);\n if (listeners.length === 0) {\n this._eventListeners.delete(eventName);\n }\n // Kill the websocket connection if all listeners have been removed.\n if (this._eventCallbacks.size === 0) {\n if (this._eventListeners.size !== 0) {\n throw new Error(`Expected event listeners size to be 0 but got ${this._eventListeners.size}`);\n }\n if (this._onLogsSubscriptionId !== undefined) {\n await this._provider.connection.removeOnLogsListener(this._onLogsSubscriptionId);\n this._onLogsSubscriptionId = undefined;\n }\n }\n }\n}\nclass EventParser {\n constructor(programId, coder) {\n this.coder = coder;\n this.programId = programId;\n }\n // Each log given, represents an array of messages emitted by\n // a single transaction, which can execute many different programs across\n // CPI boundaries. However, the subscription is only interested in the\n // events emitted by *this* program. In achieving this, we keep track of the\n // program execution context by parsing each log and looking for a CPI\n // `invoke` call. If one exists, we know a new program is executing. So we\n // push the programId onto a stack and switch the program context. This\n // allows us to track, for a given log, which program was executing during\n // its emission, thereby allowing us to know if a given log event was\n // emitted by *this* program. If it was, then we parse the raw string and\n // emit the event if the string matches the event being subscribed to.\n *parseLogs(logs, errorOnDecodeFailure = false) {\n const logScanner = new LogScanner(logs);\n const execution = new ExecutionContext();\n let log = logScanner.next();\n while (log !== null) {\n let [event, newProgram, didPop] = this.handleLog(execution, log, errorOnDecodeFailure);\n if (event) {\n yield event;\n }\n if (newProgram) {\n execution.push(newProgram);\n }\n if (didPop) {\n execution.pop();\n }\n log = logScanner.next();\n }\n }\n // Main log handler. Returns a three element array of the event, the\n // next program that was invoked for CPI, and a boolean indicating if\n // a program has completed execution (and thus should be popped off the\n // execution stack).\n handleLog(execution, log, errorOnDecodeFailure) {\n // Executing program is this program.\n if (execution.stack.length > 0 &&\n execution.program() === this.programId.toString()) {\n return this.handleProgramLog(log, errorOnDecodeFailure);\n }\n // Executing program is not this program.\n else {\n return [null, ...this.handleSystemLog(log)];\n }\n }\n // Handles logs from *this* program.\n handleProgramLog(log, errorOnDecodeFailure) {\n // This is a `msg!` log or a `sol_log_data` log.\n if (log.startsWith(PROGRAM_LOG) || log.startsWith(PROGRAM_DATA)) {\n const logStr = log.startsWith(PROGRAM_LOG)\n ? log.slice(PROGRAM_LOG_START_INDEX)\n : log.slice(PROGRAM_DATA_START_INDEX);\n const event = this.coder.events.decode(logStr);\n if (errorOnDecodeFailure && event === null) {\n throw new Error(`Unable to decode event ${logStr}`);\n }\n return [event, null, false];\n }\n // System log.\n else {\n return [null, ...this.handleSystemLog(log)];\n }\n }\n // Handles logs when the current program being executing is *not* this.\n handleSystemLog(log) {\n // System component.\n const logStart = log.split(\":\")[0];\n // Did the program finish executing?\n if (logStart.match(/^Program (.*) success/g) !== null) {\n return [null, true];\n // Recursive call.\n }\n else if (logStart.startsWith(`Program ${this.programId.toString()} invoke`)) {\n return [this.programId.toString(), false];\n }\n // CPI call.\n else if (logStart.includes(\"invoke\")) {\n return [\"cpi\", false]; // Any string will do.\n }\n else {\n return [null, false];\n }\n }\n}\n// Stack frame execution context, allowing one to track what program is\n// executing for a given log.\nclass ExecutionContext {\n constructor() {\n this.stack = [];\n }\n program() {\n if (!this.stack.length) {\n throw new Error(\"Expected the stack to have elements\");\n }\n return this.stack[this.stack.length - 1];\n }\n push(newProgram) {\n this.stack.push(newProgram);\n }\n pop() {\n if (!this.stack.length) {\n throw new Error(\"Expected the stack to have elements\");\n }\n this.stack.pop();\n }\n}\nclass LogScanner {\n constructor(logs) {\n this.logs = logs;\n }\n next() {\n if (this.logs.length === 0) {\n return null;\n }\n let l = this.logs[0];\n this.logs = this.logs.slice(1);\n return l;\n }\n}\n\nclass SimulateFactory {\n static build(idlIx, txFn, idlErrors, provider, coder, programId, idl) {\n const simulate = async (...args) => {\n var _a;\n const tx = txFn(...args);\n const [, ctx] = splitArgsAndCtx(idlIx, [...args]);\n let resp = undefined;\n if (provider.simulate === undefined) {\n throw new Error(\"This function requires 'Provider.simulate' to be implemented.\");\n }\n try {\n resp = await provider.simulate(tx, ctx.signers, (_a = ctx.options) === null || _a === void 0 ? void 0 : _a.commitment);\n }\n catch (err) {\n throw translateError(err, idlErrors);\n }\n if (resp === undefined) {\n throw new Error(\"Unable to simulate transaction\");\n }\n const logs = resp.logs;\n if (!logs) {\n throw new Error(\"Simulated logs not found\");\n }\n const events = [];\n if (idl.events) {\n let parser = new EventParser(programId, coder);\n for (const event of parser.parseLogs(logs)) {\n events.push(event);\n }\n }\n return { events, raw: logs };\n };\n return simulate;\n }\n}\n\nfunction uint64(property) {\n return new WrappedLayout(blob(8), (b) => u64.fromBuffer(b), (n) => n.toBuffer(), property);\n}\nfunction publicKey(property) {\n return new WrappedLayout(blob(32), (b) => new PublicKey(b), (key) => key.toBuffer(), property);\n}\nfunction coption(layout, property) {\n return new COptionLayout(layout, property);\n}\nclass WrappedLayout extends Layout_2 {\n constructor(layout, decoder, encoder, property) {\n super(layout.span, property);\n this.layout = layout;\n this.decoder = decoder;\n this.encoder = encoder;\n }\n decode(b, offset) {\n return this.decoder(this.layout.decode(b, offset));\n }\n encode(src, b, offset) {\n return this.layout.encode(this.encoder(src), b, offset);\n }\n getSpan(b, offset) {\n return this.layout.getSpan(b, offset);\n }\n}\nclass COptionLayout extends Layout_2 {\n constructor(layout, property) {\n super(-1, property);\n this.layout = layout;\n this.discriminator = u32();\n }\n encode(src, b, offset = 0) {\n if (src === null || src === undefined) {\n return this.layout.span + this.discriminator.encode(0, b, offset);\n }\n this.discriminator.encode(1, b, offset);\n return this.layout.encode(src, b, offset + 4) + 4;\n }\n decode(b, offset = 0) {\n const discriminator = this.discriminator.decode(b, offset);\n if (discriminator === 0) {\n return null;\n }\n else if (discriminator === 1) {\n return this.layout.decode(b, offset + 4);\n }\n throw new Error(\"Invalid coption \" + this.layout.property);\n }\n getSpan(b, offset = 0) {\n return this.layout.getSpan(b, offset + 4) + 4;\n }\n}\nclass u64 extends BN {\n /**\n * Convert to Buffer representation\n */\n toBuffer() {\n const a = super.toArray().reverse();\n const b = Buffer.from(a);\n if (b.length === 8) {\n return b;\n }\n if (b.length >= 8) {\n throw new Error(\"u64 too large\");\n }\n const zeroPad = Buffer.alloc(8);\n b.copy(zeroPad);\n return zeroPad;\n }\n /**\n * Construct a u64 from Buffer representation\n */\n static fromBuffer(buffer) {\n if (buffer.length !== 8) {\n throw new Error(`Invalid buffer length: ${buffer.length}`);\n }\n return new u64([...buffer]\n .reverse()\n .map((i) => `00${i.toString(16)}`.slice(-2))\n .join(\"\"), 16);\n }\n}\nconst TOKEN_ACCOUNT_LAYOUT = struct([\n publicKey(\"mint\"),\n publicKey(\"owner\"),\n uint64(\"amount\"),\n coption(publicKey(), \"delegate\"),\n ((p) => {\n const U = union(u8(\"discriminator\"), null, p);\n U.addVariant(0, struct([]), \"uninitialized\");\n U.addVariant(1, struct([]), \"initialized\");\n U.addVariant(2, struct([]), \"frozen\");\n return U;\n })(\"state\"),\n coption(uint64(), \"isNative\"),\n uint64(\"delegatedAmount\"),\n coption(publicKey(), \"closeAuthority\"),\n]);\nfunction decodeTokenAccount(b) {\n return TOKEN_ACCOUNT_LAYOUT.decode(b);\n}\n\n// Populates a given accounts context with PDAs and common missing accounts.\nclass AccountsResolver {\n constructor(_args, _accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n this._accounts = _accounts;\n this._provider = _provider;\n this._programId = _programId;\n this._idlIx = _idlIx;\n this._idlTypes = _idlTypes;\n this._customResolver = _customResolver;\n this._args = _args;\n this._accountStore = new AccountStore(_provider, _accountNamespace, this._programId);\n }\n args(_args) {\n this._args = _args;\n }\n // Note: We serially resolve PDAs one by one rather than doing them\n // in parallel because there can be dependencies between\n // addresses. That is, one PDA can be used as a seed in another.\n async resolve() {\n await this.resolveConst(this._idlIx.accounts);\n this._resolveEventCpi(this._idlIx.accounts);\n // Auto populate pdas and relations until we stop finding new accounts\n while ((await this.resolvePdas(this._idlIx.accounts)) +\n (await this.resolveRelations(this._idlIx.accounts)) +\n (await this.resolveCustom()) >\n 0) { }\n }\n async resolveCustom() {\n if (this._customResolver) {\n const { accounts, resolved } = await this._customResolver({\n args: this._args,\n accounts: this._accounts,\n provider: this._provider,\n programId: this._programId,\n idlIx: this._idlIx,\n });\n this._accounts = accounts;\n return resolved;\n }\n return 0;\n }\n resolveOptionalsHelper(partialAccounts, accountItems) {\n const nestedAccountsGeneric = {};\n // Looping through accountItem array instead of on partialAccounts, so\n // we only traverse array once\n for (const accountItem of accountItems) {\n const accountName = accountItem.name;\n const partialAccount = partialAccounts[accountName];\n // Skip if the account isn't included (thus would be undefined)\n if (partialAccount === undefined)\n continue;\n if (isPartialAccounts(partialAccount)) {\n // is compound accounts, recurse one level deeper\n if (isIdlAccounts(accountItem)) {\n nestedAccountsGeneric[accountName] = this.resolveOptionalsHelper(partialAccount, accountItem[\"accounts\"]);\n }\n else {\n // Here we try our best to recover gracefully. If there are optionals we can't check, we will fail then.\n nestedAccountsGeneric[accountName] = flattenPartialAccounts(partialAccount, true);\n }\n }\n else {\n // if not compound accounts, do null/optional check and proceed\n if (partialAccount !== null) {\n nestedAccountsGeneric[accountName] = translateAddress(partialAccount);\n }\n else if (accountItem[\"isOptional\"]) {\n nestedAccountsGeneric[accountName] = this._programId;\n }\n }\n }\n return nestedAccountsGeneric;\n }\n resolveOptionals(accounts) {\n Object.assign(this._accounts, this.resolveOptionalsHelper(accounts, this._idlIx.accounts));\n }\n get(path) {\n // Only return if pubkey\n const ret = path.reduce((acc, subPath) => acc && acc[subPath], this._accounts);\n if (ret && ret.toBase58) {\n return ret;\n }\n }\n set(path, value) {\n let curr = this._accounts;\n path.forEach((p, idx) => {\n const isLast = idx == path.length - 1;\n if (isLast) {\n curr[p] = value;\n }\n curr[p] = curr[p] || {};\n curr = curr[p];\n });\n }\n async resolveConst(accounts, path = []) {\n for (let k = 0; k < accounts.length; k += 1) {\n const accountDescOrAccounts = accounts[k];\n const subAccounts = accountDescOrAccounts.accounts;\n if (subAccounts) {\n await this.resolveConst(subAccounts, [\n ...path,\n camelCase(accountDescOrAccounts.name),\n ]);\n }\n const accountDesc = accountDescOrAccounts;\n const accountDescName = camelCase(accountDescOrAccounts.name);\n // Signers default to the provider.\n if (accountDesc.isSigner && !this.get([...path, accountDescName])) {\n // @ts-expect-error\n if (this._provider.wallet === undefined) {\n throw new Error(\"This function requires the Provider interface implementor to have a 'wallet' field.\");\n }\n // @ts-expect-error\n this.set([...path, accountDescName], this._provider.wallet.publicKey);\n }\n // Common accounts are auto populated with magic names by convention.\n if (Reflect.has(AccountsResolver.CONST_ACCOUNTS, accountDescName) &&\n !this.get([...path, accountDescName])) {\n this.set([...path, accountDescName], AccountsResolver.CONST_ACCOUNTS[accountDescName]);\n }\n }\n }\n /**\n * Resolve event CPI accounts `eventAuthority` and `program`.\n *\n * Accounts will only be resolved if they are declared next to each other to\n * reduce the chance of name collision.\n */\n _resolveEventCpi(accounts, path = []) {\n for (const i in accounts) {\n const accountDescOrAccounts = accounts[i];\n const subAccounts = accountDescOrAccounts.accounts;\n if (subAccounts) {\n this._resolveEventCpi(subAccounts, [\n ...path,\n camelCase(accountDescOrAccounts.name),\n ]);\n }\n // Validate next index exists\n const nextIndex = +i + 1;\n if (nextIndex === accounts.length)\n return;\n const currentName = camelCase(accounts[i].name);\n const nextName = camelCase(accounts[nextIndex].name);\n // Populate event CPI accounts if they exist\n if (currentName === \"eventAuthority\" && nextName === \"program\") {\n const currentPath = [...path, currentName];\n const nextPath = [...path, nextName];\n if (!this.get(currentPath)) {\n this.set(currentPath, PublicKey.findProgramAddressSync([Buffer.from(\"__event_authority\")], this._programId)[0]);\n }\n if (!this.get(nextPath)) {\n this.set(nextPath, this._programId);\n }\n return;\n }\n }\n }\n async resolvePdas(accounts, path = []) {\n let found = 0;\n for (let k = 0; k < accounts.length; k += 1) {\n const accountDesc = accounts[k];\n const subAccounts = accountDesc.accounts;\n if (subAccounts) {\n found += await this.resolvePdas(subAccounts, [\n ...path,\n camelCase(accountDesc.name),\n ]);\n }\n const accountDescCasted = accountDesc;\n const accountDescName = camelCase(accountDesc.name);\n // PDA derived from IDL seeds.\n if (accountDescCasted.pda &&\n accountDescCasted.pda.seeds.length > 0 &&\n !this.get([...path, accountDescName])) {\n if (Boolean(await this.autoPopulatePda(accountDescCasted, path))) {\n found += 1;\n }\n }\n }\n return found;\n }\n async resolveRelations(accounts, path = []) {\n let found = 0;\n for (let k = 0; k < accounts.length; k += 1) {\n const accountDesc = accounts[k];\n const subAccounts = accountDesc.accounts;\n if (subAccounts) {\n found += await this.resolveRelations(subAccounts, [\n ...path,\n camelCase(accountDesc.name),\n ]);\n }\n const relations = accountDesc.relations || [];\n const accountDescName = camelCase(accountDesc.name);\n const newPath = [...path, accountDescName];\n // If we have this account and there's some missing accounts that are relations to this account, fetch them\n const accountKey = this.get(newPath);\n if (accountKey) {\n const matching = relations.filter((rel) => !this.get([...path, camelCase(rel)]));\n found += matching.length;\n if (matching.length > 0) {\n const account = await this._accountStore.fetchAccount({\n publicKey: accountKey,\n });\n await Promise.all(matching.map(async (rel) => {\n const relName = camelCase(rel);\n this.set([...path, relName], account[relName]);\n return account[relName];\n }));\n }\n }\n }\n return found;\n }\n async autoPopulatePda(accountDesc, path = []) {\n if (!accountDesc.pda || !accountDesc.pda.seeds)\n throw new Error(\"Must have seeds\");\n const seeds = await Promise.all(accountDesc.pda.seeds.map((seedDesc) => this.toBuffer(seedDesc, path)));\n if (seeds.some((seed) => typeof seed == \"undefined\")) {\n return;\n }\n const programId = await this.parseProgramId(accountDesc, path);\n if (!programId) {\n return;\n }\n const [pubkey] = await PublicKey.findProgramAddress(seeds, programId);\n this.set([...path, camelCase(accountDesc.name)], pubkey);\n }\n async parseProgramId(accountDesc, path = []) {\n var _a;\n if (!((_a = accountDesc.pda) === null || _a === void 0 ? void 0 : _a.programId)) {\n return this._programId;\n }\n switch (accountDesc.pda.programId.kind) {\n case \"const\":\n return new PublicKey(this.toBufferConst(accountDesc.pda.programId.value));\n case \"arg\":\n return this.argValue(accountDesc.pda.programId);\n case \"account\":\n return await this.accountValue(accountDesc.pda.programId, path);\n default:\n throw new Error(`Unexpected program seed kind: ${accountDesc.pda.programId.kind}`);\n }\n }\n async toBuffer(seedDesc, path = []) {\n switch (seedDesc.kind) {\n case \"const\":\n return this.toBufferConst(seedDesc);\n case \"arg\":\n return await this.toBufferArg(seedDesc);\n case \"account\":\n return await this.toBufferAccount(seedDesc, path);\n default:\n throw new Error(`Unexpected seed kind: ${seedDesc.kind}`);\n }\n }\n /**\n * Recursively get the type at some path of either a primitive or a user defined struct.\n */\n getType(type, path = []) {\n if (path.length > 0 && type.defined) {\n const subType = this._idlTypes.find((t) => t.name === type.defined);\n if (!subType) {\n throw new Error(`Cannot find type ${type.defined}`);\n }\n const structType = subType.type; // enum not supported yet\n const field = structType.fields.find((field) => field.name === path[0]);\n return this.getType(field.type, path.slice(1));\n }\n return type;\n }\n toBufferConst(seedDesc) {\n return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), seedDesc.value);\n }\n async toBufferArg(seedDesc) {\n const argValue = this.argValue(seedDesc);\n if (typeof argValue === \"undefined\") {\n return;\n }\n return this.toBufferValue(this.getType(seedDesc.type, (seedDesc.path || \"\").split(\".\").slice(1)), argValue);\n }\n argValue(seedDesc) {\n const split = seedDesc.path.split(\".\");\n const seedArgName = camelCase(split[0]);\n const idlArgPosition = this._idlIx.args.findIndex((argDesc) => argDesc.name === seedArgName);\n if (idlArgPosition === -1) {\n throw new Error(`Unable to find argument for seed: ${seedArgName}`);\n }\n return split\n .slice(1)\n .reduce((curr, path) => (curr || {})[path], this._args[idlArgPosition]);\n }\n async toBufferAccount(seedDesc, path = []) {\n const accountValue = await this.accountValue(seedDesc, path);\n if (!accountValue) {\n return;\n }\n return this.toBufferValue(seedDesc.type, accountValue);\n }\n async accountValue(seedDesc, path = []) {\n const pathComponents = seedDesc.path.split(\".\");\n const fieldName = pathComponents[0];\n const fieldPubkey = this.get([...path, camelCase(fieldName)]);\n if (fieldPubkey === null) {\n throw new Error(`fieldPubkey is null`);\n }\n // The seed is a pubkey of the account.\n if (pathComponents.length === 1) {\n return fieldPubkey;\n }\n // The key is account data.\n //\n // Fetch and deserialize it.\n const account = await this._accountStore.fetchAccount({\n publicKey: fieldPubkey,\n name: seedDesc.account,\n });\n // Dereference all fields in the path to get the field value\n // used in the seed.\n const fieldValue = this.parseAccountValue(account, pathComponents.slice(1));\n return fieldValue;\n }\n parseAccountValue(account, path) {\n let accountField;\n while (path.length > 0) {\n accountField = account[camelCase(path[0])];\n path = path.slice(1);\n }\n return accountField;\n }\n // Converts the given idl valaue into a Buffer. The values here must be\n // primitives. E.g. no structs.\n //\n // TODO: add more types here as needed.\n toBufferValue(type, value) {\n switch (type) {\n case \"u8\":\n return Buffer.from([value]);\n case \"u16\":\n let b = Buffer.alloc(2);\n b.writeUInt16LE(value);\n return b;\n case \"u32\":\n let buf = Buffer.alloc(4);\n buf.writeUInt32LE(value);\n return buf;\n case \"u64\":\n let bU64 = Buffer.alloc(8);\n bU64.writeBigUInt64LE(BigInt(value));\n return bU64;\n case \"string\":\n return Buffer.from(encode$2(value));\n case \"publicKey\":\n return value.toBuffer();\n default:\n if (type.array) {\n return Buffer.from(value);\n }\n throw new Error(`Unexpected seed type: ${type}`);\n }\n }\n}\nAccountsResolver.CONST_ACCOUNTS = {\n associatedTokenProgram: ASSOCIATED_PROGRAM_ID,\n rent: SYSVAR_RENT_PUBKEY,\n systemProgram: SystemProgram.programId,\n tokenProgram: TOKEN_PROGRAM_ID,\n clock: SYSVAR_CLOCK_PUBKEY,\n};\n// TODO: this should be configureable to avoid unnecessary requests.\nclass AccountStore {\n // todo: don't use the progrma use the account namespace.\n constructor(_provider, _accounts, _programId) {\n this._provider = _provider;\n this._programId = _programId;\n this._cache = new Map();\n this._idls = {};\n this._idls[_programId.toBase58()] = _accounts;\n }\n async ensureIdl(programId) {\n if (!this._idls[programId.toBase58()]) {\n const idl = await Program.fetchIdl(programId, this._provider);\n if (idl) {\n const program = new Program(idl, programId, this._provider);\n this._idls[programId.toBase58()] = program.account;\n }\n }\n return this._idls[programId.toBase58()];\n }\n async fetchAccount({ publicKey, name, programId = this._programId, }) {\n const address = publicKey.toString();\n if (!this._cache.has(address)) {\n if (name === \"TokenAccount\") {\n const accountInfo = await this._provider.connection.getAccountInfo(publicKey);\n if (accountInfo === null) {\n throw new Error(`invalid account info for ${address}`);\n }\n const data = decodeTokenAccount(accountInfo.data);\n this._cache.set(address, data);\n }\n else if (name) {\n const accounts = await this.ensureIdl(programId);\n if (accounts) {\n const accountFetcher = accounts[camelCase(name)];\n if (accountFetcher) {\n const account = await accountFetcher.fetch(publicKey);\n this._cache.set(address, account);\n }\n }\n }\n else {\n const account = await this._provider.connection.getAccountInfo(publicKey);\n if (account === null) {\n throw new Error(`invalid account info for ${address}`);\n }\n const data = account.data;\n const accounts = await this.ensureIdl(account.owner);\n if (accounts) {\n const firstAccountLayout = Object.values(accounts)[0];\n if (!firstAccountLayout) {\n throw new Error(\"No accounts for this program\");\n }\n const result = firstAccountLayout.coder.accounts.decodeAny(data);\n this._cache.set(address, result);\n }\n }\n }\n return this._cache.get(address);\n }\n}\n\nclass MethodsBuilderFactory {\n static build(provider, programId, idlIx, ixFn, txFn, rpcFn, simulateFn, viewFn, accountNamespace, idlTypes, customResolver) {\n return (...args) => new MethodsBuilder(args, ixFn, txFn, rpcFn, simulateFn, viewFn, provider, programId, idlIx, accountNamespace, idlTypes, customResolver);\n }\n}\nfunction isPartialAccounts(partialAccount) {\n return (typeof partialAccount === \"object\" &&\n partialAccount !== null &&\n !(\"_bn\" in partialAccount) // Ensures not a pubkey\n );\n}\nfunction flattenPartialAccounts(partialAccounts, throwOnNull) {\n const toReturn = {};\n for (const accountName in partialAccounts) {\n const account = partialAccounts[accountName];\n if (account === null) {\n if (throwOnNull)\n throw new Error(\"Failed to resolve optionals due to IDL type mismatch with input accounts!\");\n continue;\n }\n toReturn[accountName] = isPartialAccounts(account)\n ? flattenPartialAccounts(account, true)\n : translateAddress(account);\n }\n return toReturn;\n}\nclass MethodsBuilder {\n constructor(_args, _ixFn, _txFn, _rpcFn, _simulateFn, _viewFn, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver) {\n this._ixFn = _ixFn;\n this._txFn = _txFn;\n this._rpcFn = _rpcFn;\n this._simulateFn = _simulateFn;\n this._viewFn = _viewFn;\n this._programId = _programId;\n this._accounts = {};\n this._remainingAccounts = [];\n this._signers = [];\n this._preInstructions = [];\n this._postInstructions = [];\n this._autoResolveAccounts = true;\n this._args = _args;\n this._accountsResolver = new AccountsResolver(_args, this._accounts, _provider, _programId, _idlIx, _accountNamespace, _idlTypes, _customResolver);\n }\n args(_args) {\n this._args = _args;\n this._accountsResolver.args(_args);\n }\n async pubkeys() {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n return this._accounts;\n }\n accounts(accounts) {\n this._autoResolveAccounts = true;\n this._accountsResolver.resolveOptionals(accounts);\n return this;\n }\n accountsStrict(accounts) {\n this._autoResolveAccounts = false;\n this._accountsResolver.resolveOptionals(accounts);\n return this;\n }\n signers(signers) {\n this._signers = this._signers.concat(signers);\n return this;\n }\n remainingAccounts(accounts) {\n this._remainingAccounts = this._remainingAccounts.concat(accounts);\n return this;\n }\n preInstructions(ixs) {\n this._preInstructions = this._preInstructions.concat(ixs);\n return this;\n }\n postInstructions(ixs) {\n this._postInstructions = this._postInstructions.concat(ixs);\n return this;\n }\n async rpc(options) {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n // @ts-ignore\n return this._rpcFn(...this._args, {\n accounts: this._accounts,\n signers: this._signers,\n remainingAccounts: this._remainingAccounts,\n preInstructions: this._preInstructions,\n postInstructions: this._postInstructions,\n options: options,\n });\n }\n async rpcAndKeys(options) {\n const pubkeys = await this.pubkeys();\n return {\n pubkeys,\n signature: await this.rpc(options),\n };\n }\n async view(options) {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n if (!this._viewFn) {\n throw new Error(\"Method does not support views\");\n }\n // @ts-ignore\n return this._viewFn(...this._args, {\n accounts: this._accounts,\n signers: this._signers,\n remainingAccounts: this._remainingAccounts,\n preInstructions: this._preInstructions,\n postInstructions: this._postInstructions,\n options: options,\n });\n }\n async simulate(options) {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n // @ts-ignore\n return this._simulateFn(...this._args, {\n accounts: this._accounts,\n signers: this._signers,\n remainingAccounts: this._remainingAccounts,\n preInstructions: this._preInstructions,\n postInstructions: this._postInstructions,\n options: options,\n });\n }\n async instruction() {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n // @ts-ignore\n return this._ixFn(...this._args, {\n accounts: this._accounts,\n signers: this._signers,\n remainingAccounts: this._remainingAccounts,\n preInstructions: this._preInstructions,\n postInstructions: this._postInstructions,\n });\n }\n /**\n * Convenient shortcut to get instructions and pubkeys via\n * const { pubkeys, instructions } = await prepare();\n */\n async prepare() {\n return {\n instruction: await this.instruction(),\n pubkeys: await this.pubkeys(),\n signers: await this._signers,\n };\n }\n async transaction() {\n if (this._autoResolveAccounts) {\n await this._accountsResolver.resolve();\n }\n // @ts-ignore\n return this._txFn(...this._args, {\n accounts: this._accounts,\n signers: this._signers,\n remainingAccounts: this._remainingAccounts,\n preInstructions: this._preInstructions,\n postInstructions: this._postInstructions,\n });\n }\n}\n\nclass ViewFactory {\n static build(programId, idlIx, simulateFn, idl) {\n const isMut = idlIx.accounts.find((a) => a.isMut);\n const hasReturn = !!idlIx.returns;\n if (isMut || !hasReturn)\n return;\n const view = async (...args) => {\n var _a, _b;\n let simulationResult = await simulateFn(...args);\n const returnPrefix = `Program return: ${programId} `;\n let returnLog = simulationResult.raw.find((l) => l.startsWith(returnPrefix));\n if (!returnLog) {\n throw new Error(\"View expected return log\");\n }\n let returnData = decode(returnLog.slice(returnPrefix.length));\n let returnType = idlIx.returns;\n if (!returnType) {\n throw new Error(\"View expected return type\");\n }\n const coder = IdlCoder.fieldLayout({ type: returnType }, Array.from([...((_a = idl.accounts) !== null && _a !== void 0 ? _a : []), ...((_b = idl.types) !== null && _b !== void 0 ? _b : [])]));\n return coder.decode(returnData);\n };\n return view;\n }\n}\n\nclass NamespaceFactory {\n /**\n * Generates all namespaces for a given program.\n */\n static build(idl, coder, programId, provider, getCustomResolver) {\n const rpc = {};\n const instruction = {};\n const transaction = {};\n const simulate = {};\n const methods = {};\n const view = {};\n const idlErrors = parseIdlErrors(idl);\n const account = idl.accounts\n ? AccountFactory.build(idl, coder, programId, provider)\n : {};\n idl.instructions.forEach((idlIx) => {\n const ixItem = InstructionNamespaceFactory.build(idlIx, (ixName, ix) => coder.instruction.encode(ixName, ix), programId);\n const txItem = TransactionFactory.build(idlIx, ixItem);\n const rpcItem = RpcFactory.build(idlIx, txItem, idlErrors, provider);\n const simulateItem = SimulateFactory.build(idlIx, txItem, idlErrors, provider, coder, programId, idl);\n const viewItem = ViewFactory.build(programId, idlIx, simulateItem, idl);\n const methodItem = MethodsBuilderFactory.build(provider, programId, idlIx, ixItem, txItem, rpcItem, simulateItem, viewItem, account, idl.types || [], getCustomResolver && getCustomResolver(idlIx));\n const name = camelCase(idlIx.name);\n instruction[name] = ixItem;\n transaction[name] = txItem;\n rpc[name] = rpcItem;\n simulate[name] = simulateItem;\n methods[name] = methodItem;\n if (viewItem) {\n view[name] = viewItem;\n }\n });\n return [\n rpc,\n instruction,\n transaction,\n account,\n simulate,\n methods,\n view,\n ];\n }\n}\n\n/**\n * ## Program\n *\n * Program provides the IDL deserialized client representation of an Anchor\n * program.\n *\n * This API is the one stop shop for all things related to communicating with\n * on-chain programs. Among other things, one can send transactions, fetch\n * deserialized accounts, decode instruction data, subscribe to account\n * changes, and listen to events.\n *\n * In addition to field accessors and methods, the object provides a set of\n * dynamically generated properties, also known as namespaces, that\n * map one-to-one to program methods and accounts. These namespaces generally\n * can be used as follows:\n *\n * ## Usage\n *\n * ```javascript\n * program.<namespace>.<program-specific-method>\n * ```\n *\n * API specifics are namespace dependent. The examples used in the documentation\n * below will refer to the two counter examples found\n * [here](https://github.com/coral-xyz/anchor#examples).\n */\nclass Program {\n /**\n * Address of the program.\n */\n get programId() {\n return this._programId;\n }\n /**\n * IDL defining the program's interface.\n */\n get idl() {\n return this._idl;\n }\n /**\n * Coder for serializing requests.\n */\n get coder() {\n return this._coder;\n }\n /**\n * Wallet and network provider.\n */\n get provider() {\n return this._provider;\n }\n /**\n * @param idl The interface definition.\n * @param programId The on-chain address of the program.\n * @param provider The network and wallet context to use. If not provided\n * then uses [[getProvider]].\n * @param getCustomResolver A function that returns a custom account resolver\n * for the given instruction. This is useful for resolving\n * public keys of missing accounts when building instructions\n */\n constructor(idl, programId, provider, coder, getCustomResolver) {\n programId = translateAddress(programId);\n if (!provider) {\n provider = getProvider();\n }\n // Fields.\n this._idl = idl;\n this._provider = provider;\n this._programId = programId;\n this._coder = coder !== null && coder !== void 0 ? coder : new BorshCoder(idl);\n this._events = new EventManager(this._programId, provider, this._coder);\n // Dynamic namespaces.\n const [rpc, instruction, transaction, account, simulate, methods, views] = NamespaceFactory.build(idl, this._coder, programId, provider, getCustomResolver !== null && getCustomResolver !== void 0 ? getCustomResolver : (() => undefined));\n this.rpc = rpc;\n this.instruction = instruction;\n this.transaction = transaction;\n this.account = account;\n this.simulate = simulate;\n this.methods = methods;\n this.views = views;\n }\n /**\n * Generates a Program client by fetching the IDL from the network.\n *\n * In order to use this method, an IDL must have been previously initialized\n * via the anchor CLI's `anchor idl init` command.\n *\n * @param programId The on-chain address of the program.\n * @param provider The network and wallet context.\n */\n static async at(address, provider) {\n const programId = translateAddress(address);\n const idl = await Program.fetchIdl(programId, provider);\n if (!idl) {\n throw new Error(`IDL not found for program: ${address.toString()}`);\n }\n return new Program(idl, programId, provider);\n }\n /**\n * Fetches an idl from the blockchain.\n *\n * In order to use this method, an IDL must have been previously initialized\n * via the anchor CLI's `anchor idl init` command.\n *\n * @param programId The on-chain address of the program.\n * @param provider The network and wallet context.\n */\n static async fetchIdl(address, provider) {\n provider = provider !== null && provider !== void 0 ? provider : getProvider();\n const programId = translateAddress(address);\n const idlAddr = await idlAddress(programId);\n const accountInfo = await provider.connection.getAccountInfo(idlAddr);\n if (!accountInfo) {\n return null;\n }\n // Chop off account discriminator.\n let idlAccount = decodeIdlAccount(accountInfo.data.slice(8));\n const inflatedIdl = inflate(idlAccount.data);\n return JSON.parse(decode$2(inflatedIdl));\n }\n /**\n * Invokes the given callback every time the given event is emitted.\n *\n * @param eventName The PascalCase name of the event, provided by the IDL.\n * @param callback The function to invoke whenever the event is emitted from\n * program logs.\n */\n addEventListener(eventName, callback) {\n return this._events.addEventListener(eventName, callback);\n }\n /**\n * Unsubscribes from the given eventName.\n */\n async removeEventListener(listener) {\n return await this._events.removeEventListener(listener);\n }\n}\n\nconst SYSTEM_PROGRAM_ID = new PublicKey(\"11111111111111111111111111111111\");\nfunction program(provider) {\n return new Program(IDL, SYSTEM_PROGRAM_ID, provider, coder());\n}\nfunction coder() {\n return new SystemCoder(IDL);\n}\nconst IDL = {\n version: \"0.1.0\",\n name: \"system_program\",\n instructions: [\n {\n name: \"createAccount\",\n accounts: [\n {\n name: \"from\",\n isMut: true,\n isSigner: true,\n },\n {\n name: \"to\",\n isMut: true,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"lamports\",\n type: \"u64\",\n },\n {\n name: \"space\",\n type: \"u64\",\n },\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"assign\",\n accounts: [\n {\n name: \"pubkey\",\n isMut: true,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"transfer\",\n accounts: [\n {\n name: \"from\",\n isMut: true,\n isSigner: true,\n },\n {\n name: \"to\",\n isMut: true,\n isSigner: false,\n },\n ],\n args: [\n {\n name: \"lamports\",\n type: \"u64\",\n },\n ],\n },\n {\n name: \"createAccountWithSeed\",\n accounts: [\n {\n name: \"from\",\n isMut: true,\n isSigner: true,\n },\n {\n name: \"to\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"base\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"base\",\n type: \"publicKey\",\n },\n {\n name: \"seed\",\n type: \"string\",\n },\n {\n name: \"lamports\",\n type: \"u64\",\n },\n {\n name: \"space\",\n type: \"u64\",\n },\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"advanceNonceAccount\",\n accounts: [\n {\n name: \"nonce\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"recentBlockhashes\",\n isMut: false,\n isSigner: false,\n },\n {\n name: \"authorized\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"authorized\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"withdrawNonceAccount\",\n accounts: [\n {\n name: \"nonce\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"to\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"recentBlockhashes\",\n isMut: false,\n isSigner: false,\n },\n {\n name: \"rent\",\n isMut: false,\n isSigner: false,\n },\n {\n name: \"authorized\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"lamports\",\n type: \"u64\",\n },\n ],\n },\n {\n name: \"initializeNonceAccount\",\n accounts: [\n {\n name: \"nonce\",\n isMut: true,\n isSigner: true,\n },\n {\n name: \"recentBlockhashes\",\n isMut: false,\n isSigner: false,\n },\n {\n name: \"rent\",\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: \"authorized\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"authorizeNonceAccount\",\n accounts: [\n {\n name: \"nonce\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"authorized\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"authorized\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"allocate\",\n accounts: [\n {\n name: \"pubkey\",\n isMut: true,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"space\",\n type: \"u64\",\n },\n ],\n },\n {\n name: \"allocateWithSeed\",\n accounts: [\n {\n name: \"account\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"base\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"base\",\n type: \"publicKey\",\n },\n {\n name: \"seed\",\n type: \"string\",\n },\n {\n name: \"space\",\n type: \"u64\",\n },\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"assignWithSeed\",\n accounts: [\n {\n name: \"account\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"base\",\n isMut: false,\n isSigner: true,\n },\n ],\n args: [\n {\n name: \"base\",\n type: \"publicKey\",\n },\n {\n name: \"seed\",\n type: \"string\",\n },\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n {\n name: \"transferWithSeed\",\n accounts: [\n {\n name: \"from\",\n isMut: true,\n isSigner: false,\n },\n {\n name: \"base\",\n isMut: false,\n isSigner: true,\n },\n {\n name: \"to\",\n isMut: true,\n isSigner: false,\n },\n ],\n args: [\n {\n name: \"lamports\",\n type: \"u64\",\n },\n {\n name: \"seed\",\n type: \"string\",\n },\n {\n name: \"owner\",\n type: \"publicKey\",\n },\n ],\n },\n ],\n accounts: [\n {\n name: \"nonce\",\n type: {\n kind: \"struct\",\n fields: [\n {\n name: \"version\",\n type: \"u32\",\n },\n {\n name: \"state\",\n type: \"u32\",\n },\n {\n name: \"authorizedPubkey\",\n type: \"publicKey\",\n },\n {\n name: \"nonce\",\n type: \"publicKey\",\n },\n {\n name: \"feeCalculator\",\n type: {\n defined: \"FeeCalculator\",\n },\n },\n ],\n },\n },\n ],\n types: [\n {\n name: \"FeeCalculator\",\n type: {\n kind: \"struct\",\n fields: [\n {\n name: \"lamportsPerSignature\",\n type: \"u64\",\n },\n ],\n },\n },\n ],\n};\n\nclass Native {\n static system(provider) {\n return program(provider);\n }\n}\n\nexport { AccountClient, AnchorError, AnchorProvider, BorshAccountsCoder, BorshCoder, BorshEventCoder, BorshInstructionCoder, DISCRIMINATOR_SIZE, EventManager, EventParser, IdlError, LangErrorCode, LangErrorMessage, MethodsBuilderFactory, Native, Program, ProgramError, ProgramErrorStack, SystemCoder, eventDiscriminator, getProvider, parseIdlErrors, setProvider, splitArgsAndCtx, toInstruction, translateAddress, translateError, index as utils, validateAccounts };\n//# sourceMappingURL=index.js.map\n","\"use strict\";\nvar __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {\n function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n return new (P || (P = Promise))(function (resolve, reject) {\n function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n step((generator = generator.apply(thisArg, _arguments || [])).next());\n });\n};\nvar __generator = (this && this.__generator) || function (thisArg, body) {\n var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n function verb(n) { return function (v) { return step([n, v]); }; }\n function step(op) {\n if (f) throw new TypeError(\"Generator is already executing.\");\n while (_) try {\n if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n if (y = 0, t) op = [op[0] & 2, t.value];\n switch (op[0]) {\n case 0: case 1: t = op; break;\n case 4: _.label++; return { value: op[1], done: false };\n case 5: _.label++; y = op[1]; op = [0]; continue;\n case 7: op = _.ops.pop(); _.trys.pop(); continue;\n default:\n if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n if (t[2]) _.ops.pop();\n _.trys.pop(); continue;\n }\n op = body.call(thisArg, _);\n } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n }\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleAccountCoder = void 0;\nvar PythOracleAccountCoder = /** @class */ (function () {\n function PythOracleAccountCoder(idl) {\n this.idl = idl;\n }\n PythOracleAccountCoder.prototype.encode = function (accountName, account) {\n return __awaiter(this, void 0, void 0, function () {\n return __generator(this, function (_a) {\n throw new Error('Not implemented');\n });\n });\n };\n PythOracleAccountCoder.prototype.decode = function (accountName, ix) {\n throw new Error('Not implemented');\n };\n PythOracleAccountCoder.prototype.decodeUnchecked = function (accountName, ix) {\n throw new Error('Not implemented');\n };\n PythOracleAccountCoder.prototype.memcmp = function (accountName, _appendData) {\n throw new Error('Not implemented');\n };\n PythOracleAccountCoder.prototype.size = function (idlAccount) {\n return 0;\n };\n return PythOracleAccountCoder;\n}());\nexports.PythOracleAccountCoder = PythOracleAccountCoder;\n","'use strict'\n// base-x encoding / decoding\n// Copyright (c) 2018 base-x contributors\n// Copyright (c) 2014-2018 The Bitcoin Core developers (base58.cpp)\n// Distributed under the MIT software license, see the accompanying\n// file LICENSE or http://www.opensource.org/licenses/mit-license.php.\nfunction base (ALPHABET) {\n if (ALPHABET.length >= 255) { throw new TypeError('Alphabet too long') }\n var BASE_MAP = new Uint8Array(256)\n for (var j = 0; j < BASE_MAP.length; j++) {\n BASE_MAP[j] = 255\n }\n for (var i = 0; i < ALPHABET.length; i++) {\n var x = ALPHABET.charAt(i)\n var xc = x.charCodeAt(0)\n if (BASE_MAP[xc] !== 255) { throw new TypeError(x + ' is ambiguous') }\n BASE_MAP[xc] = i\n }\n var BASE = ALPHABET.length\n var LEADER = ALPHABET.charAt(0)\n var FACTOR = Math.log(BASE) / Math.log(256) // log(BASE) / log(256), rounded up\n var iFACTOR = Math.log(256) / Math.log(BASE) // log(256) / log(BASE), rounded up\n function encode (source) {\n if (source instanceof Uint8Array) {\n } else if (ArrayBuffer.isView(source)) {\n source = new Uint8Array(source.buffer, source.byteOffset, source.byteLength)\n } else if (Array.isArray(source)) {\n source = Uint8Array.from(source)\n }\n if (!(source instanceof Uint8Array)) { throw new TypeError('Expected Uint8Array') }\n if (source.length === 0) { return '' }\n // Skip & count leading zeroes.\n var zeroes = 0\n var length = 0\n var pbegin = 0\n var pend = source.length\n while (pbegin !== pend && source[pbegin] === 0) {\n pbegin++\n zeroes++\n }\n // Allocate enough space in big-endian base58 representation.\n var size = ((pend - pbegin) * iFACTOR + 1) >>> 0\n var b58 = new Uint8Array(size)\n // Process the bytes.\n while (pbegin !== pend) {\n var carry = source[pbegin]\n // Apply \"b58 = b58 * 256 + ch\".\n var i = 0\n for (var it1 = size - 1; (carry !== 0 || i < length) && (it1 !== -1); it1--, i++) {\n carry += (256 * b58[it1]) >>> 0\n b58[it1] = (carry % BASE) >>> 0\n carry = (carry / BASE) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n pbegin++\n }\n // Skip leading zeroes in base58 result.\n var it2 = size - length\n while (it2 !== size && b58[it2] === 0) {\n it2++\n }\n // Translate the result into a string.\n var str = LEADER.repeat(zeroes)\n for (; it2 < size; ++it2) { str += ALPHABET.charAt(b58[it2]) }\n return str\n }\n function decodeUnsafe (source) {\n if (typeof source !== 'string') { throw new TypeError('Expected String') }\n if (source.length === 0) { return new Uint8Array() }\n var psz = 0\n // Skip and count leading '1's.\n var zeroes = 0\n var length = 0\n while (source[psz] === LEADER) {\n zeroes++\n psz++\n }\n // Allocate enough space in big-endian base256 representation.\n var size = (((source.length - psz) * FACTOR) + 1) >>> 0 // log(58) / log(256), rounded up.\n var b256 = new Uint8Array(size)\n // Process the characters.\n while (source[psz]) {\n // Decode character\n var carry = BASE_MAP[source.charCodeAt(psz)]\n // Invalid character\n if (carry === 255) { return }\n var i = 0\n for (var it3 = size - 1; (carry !== 0 || i < length) && (it3 !== -1); it3--, i++) {\n carry += (BASE * b256[it3]) >>> 0\n b256[it3] = (carry % 256) >>> 0\n carry = (carry / 256) >>> 0\n }\n if (carry !== 0) { throw new Error('Non-zero carry') }\n length = i\n psz++\n }\n // Skip leading zeroes in b256.\n var it4 = size - length\n while (it4 !== size && b256[it4] === 0) {\n it4++\n }\n var vch = new Uint8Array(zeroes + (size - it4))\n var j = zeroes\n while (it4 !== size) {\n vch[j++] = b256[it4++]\n }\n return vch\n }\n function decode (string) {\n var buffer = decodeUnsafe(string)\n if (buffer) { return buffer }\n throw new Error('Non-base' + BASE + ' character')\n }\n return {\n encode: encode,\n decodeUnsafe: decodeUnsafe,\n decode: decode\n }\n}\nmodule.exports = base\n","const basex = require('base-x')\nconst ALPHABET = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'\n\nmodule.exports = basex(ALPHABET)\n","\"use strict\";\n// Borrowed from coral-xyz/anchor\n//\n// https://github.com/coral-xyz/anchor/blob/master/ts/packages/anchor/src/coder/borsh/instruction.ts\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n};\nvar __spreadArray = (this && this.__spreadArray) || function (to, from) {\n for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)\n to[j] = from[i];\n return to;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleInstructionCoder = void 0;\nvar bs58_1 = __importDefault(require(\"bs58\"));\nvar buffer_1 = require(\"buffer\");\nvar camelcase_1 = __importDefault(require(\"camelcase\"));\nvar borsh = __importStar(require(\"@coral-xyz/borsh\"));\nvar idl_1 = require(\"./idl\");\nvar MAX_METADATA_SIZE = 464;\n/**\n * Encodes and decodes program instructions.\n */\nvar PythOracleInstructionCoder = /** @class */ (function () {\n function PythOracleInstructionCoder(idl) {\n var _this = this;\n this.idl = idl;\n this.ixLayout = PythOracleInstructionCoder.parseIxLayout(idl);\n var discriminatorLayouts = new Map();\n var ixDiscriminator = new Map();\n idl.instructions.forEach(function (ix) {\n var pythIx = ix;\n var discriminatorLength;\n if (pythIx.discriminant) {\n discriminatorLayouts.set(bs58_1.default.encode(buffer_1.Buffer.from(pythIx.discriminant.value)), {\n layout: _this.ixLayout.get(pythIx.name),\n name: pythIx.name,\n });\n ixDiscriminator.set(pythIx.name, buffer_1.Buffer.from(pythIx.discriminant.value));\n discriminatorLength = pythIx.discriminant.value.length;\n }\n else {\n throw new Error(\"All instructions must have a discriminator\");\n }\n if (_this.discriminatorLength && _this.discriminatorLength !== discriminatorLength) {\n throw new Error(\"All instructions must have the same discriminator length\");\n }\n else {\n _this.discriminatorLength = discriminatorLength;\n }\n });\n this.discriminatorLayouts = discriminatorLayouts;\n this.ixDiscriminator = ixDiscriminator;\n }\n /**\n * Encodes a program state instruction.\n */\n PythOracleInstructionCoder.prototype.encodeState = function (ixName, ix) {\n return this.encode(ixName, ix);\n };\n /**\n * Encodes a program instruction.\n */\n PythOracleInstructionCoder.prototype.encode = function (ixName, ix) {\n var buffer = buffer_1.Buffer.alloc(1000); // TODO: use a tighter buffer.\n var methodName = camelcase_1.default(ixName);\n var layout = this.ixLayout.get(methodName);\n var discriminator = this.ixDiscriminator.get(methodName);\n if (!layout || !discriminator) {\n throw new Error(\"Unknown method: \" + methodName);\n }\n /// updProduct and addProduct have their own format\n if (methodName === 'updProduct' || methodName === 'addProduct') {\n var offset = 0;\n for (var _i = 0, _a = Object.keys(ix.productMetadata); _i < _a.length; _i++) {\n var key = _a[_i];\n offset += buffer.subarray(offset).writeInt8(key.length);\n offset += buffer.subarray(offset).write(key);\n offset += buffer.subarray(offset).writeInt8(ix.productMetadata[key].length);\n offset += buffer.subarray(offset).write(ix.productMetadata[key]);\n }\n if (offset > MAX_METADATA_SIZE) {\n throw new Error('The metadata is too long');\n }\n var data = buffer.subarray(0, offset);\n return buffer_1.Buffer.concat([discriminator, data]);\n }\n else {\n var len = layout.encode(ix, buffer);\n var data = buffer.subarray(0, len);\n return buffer_1.Buffer.concat([discriminator, data]);\n }\n };\n PythOracleInstructionCoder.parseIxLayout = function (idl) {\n var ixLayouts = idl.instructions.map(function (ix) {\n var fieldLayouts = ix.args.map(function (arg) { var _a, _b; return idl_1.IdlCoder.fieldLayout(arg, Array.from(__spreadArray(__spreadArray([], ((_a = idl.accounts) !== null && _a !== void 0 ? _a : [])), ((_b = idl.types) !== null && _b !== void 0 ? _b : [])))); });\n var name = camelcase_1.default(ix.name);\n return [name, borsh.struct(fieldLayouts, name)];\n });\n return new Map(ixLayouts);\n };\n /**\n * Decodes a program instruction.\n */\n PythOracleInstructionCoder.prototype.decode = function (ix, encoding) {\n if (encoding === void 0) { encoding = 'hex'; }\n if (typeof ix === 'string') {\n ix = encoding === 'hex' ? buffer_1.Buffer.from(ix, 'hex') : buffer_1.Buffer.from(bs58_1.default.decode(ix));\n }\n var discriminator = bs58_1.default.encode(ix.subarray(0, this.discriminatorLength));\n var data = ix.subarray(this.discriminatorLength);\n var decoder = this.discriminatorLayouts.get(discriminator);\n if (!decoder) {\n return null;\n }\n /// updProduct and addProduct have their own format\n if (decoder.name === 'updProduct' || decoder.name === 'addProduct') {\n var product = {};\n var idx = 0;\n while (idx < data.length) {\n var keyLength = data[idx];\n idx++;\n if (keyLength) {\n var key = data.slice(idx, idx + keyLength).toString();\n idx += keyLength;\n var valueLength = data[idx];\n idx++;\n var value = data.slice(idx, idx + valueLength).toString();\n idx += valueLength;\n product[key] = value;\n }\n }\n return {\n data: product,\n name: decoder.name,\n };\n }\n else {\n return {\n data: decoder.layout.decode(data),\n name: decoder.name,\n };\n }\n };\n return PythOracleInstructionCoder;\n}());\nexports.PythOracleInstructionCoder = PythOracleInstructionCoder;\n","\"use strict\";\n// Borrowed from coral-xyz/anchor\n//\n// https://github.com/coral-xyz/anchor/blob/master/ts/packages/anchor/src/coder/borsh/idl.ts\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {\n Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n o[\"default\"] = v;\n});\nvar __importStar = (this && this.__importStar) || function (mod) {\n if (mod && mod.__esModule) return mod;\n var result = {};\n if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n __setModuleDefault(result, mod);\n return result;\n};\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.IdlCoder = void 0;\nvar camelcase_1 = __importDefault(require(\"camelcase\"));\nvar borsh = __importStar(require(\"@coral-xyz/borsh\"));\nvar anchor_1 = require(\"@coral-xyz/anchor\");\nvar IdlCoder = /** @class */ (function () {\n function IdlCoder() {\n }\n IdlCoder.fieldLayout = function (field, types) {\n var fieldName = field.name !== undefined ? camelcase_1.default(field.name) : undefined;\n switch (field.type) {\n case 'bool': {\n return borsh.bool(fieldName);\n }\n case 'u8': {\n return borsh.u8(fieldName);\n }\n case 'i8': {\n return borsh.i8(fieldName);\n }\n case 'u16': {\n return borsh.u16(fieldName);\n }\n case 'i16': {\n return borsh.i16(fieldName);\n }\n case 'u32': {\n return borsh.u32(fieldName);\n }\n case 'i32': {\n return borsh.i32(fieldName);\n }\n case 'f32': {\n return borsh.f32(fieldName);\n }\n case 'u64': {\n return borsh.u64(fieldName);\n }\n case 'i64': {\n return borsh.i64(fieldName);\n }\n case 'f64': {\n return borsh.f64(fieldName);\n }\n case 'u128': {\n return borsh.u128(fieldName);\n }\n case 'i128': {\n return borsh.i128(fieldName);\n }\n case 'u256': {\n return borsh.u256(fieldName);\n }\n case 'i256': {\n return borsh.i256(fieldName);\n }\n case 'bytes': {\n return borsh.vecU8(fieldName);\n }\n case 'string': {\n return borsh.str(fieldName);\n }\n case 'publicKey': {\n return borsh.publicKey(fieldName);\n }\n default: {\n if ('vec' in field.type) {\n return borsh.vec(IdlCoder.fieldLayout({\n name: undefined,\n type: field.type.vec,\n }, types), fieldName);\n }\n else if ('option' in field.type) {\n return borsh.option(IdlCoder.fieldLayout({\n name: undefined,\n type: field.type.option,\n }, types), fieldName);\n }\n else if ('defined' in field.type) {\n var defined_1 = field.type.defined;\n // User defined type.\n if (types === undefined) {\n throw new anchor_1.IdlError('User defined types not provided');\n }\n var filtered = types.filter(function (t) { return t.name === defined_1; });\n if (filtered.length !== 1) {\n throw new anchor_1.IdlError(\"Type not found: \" + JSON.stringify(field));\n }\n return IdlCoder.typeDefLayout(filtered[0], types, fieldName);\n }\n else if ('array' in field.type) {\n var arrayTy = field.type.array[0];\n var arrayLen = field.type.array[1];\n var innerLayout = IdlCoder.fieldLayout({\n name: undefined,\n type: arrayTy,\n }, types);\n return borsh.array(innerLayout, arrayLen, fieldName);\n }\n else {\n throw new Error(\"Not yet implemented: \" + field);\n }\n }\n }\n };\n IdlCoder.typeDefLayout = function (typeDef, types, name) {\n if (types === void 0) { types = []; }\n if (typeDef.type.kind === 'struct') {\n var fieldLayouts = typeDef.type.fields.map(function (field) {\n var x = IdlCoder.fieldLayout(field, types);\n return x;\n });\n return borsh.struct(fieldLayouts, name);\n }\n else if (typeDef.type.kind === 'enum') {\n var variants = typeDef.type.variants.map(function (variant) {\n var variantName = camelcase_1.default(variant.name);\n if (variant.fields === undefined) {\n return borsh.struct([], variantName);\n }\n var fieldLayouts = variant.fields.map(function (f, i) {\n if (!f.hasOwnProperty('name')) {\n return IdlCoder.fieldLayout({ type: f, name: i.toString() }, types);\n }\n // this typescript conversion is ok\n // because if f were of type IdlType\n // (that does not have a name property)\n // the check before would've errored\n return IdlCoder.fieldLayout(f, types);\n });\n return borsh.struct(fieldLayouts, variantName);\n });\n if (name !== undefined) {\n // Buffer-layout lib requires the name to be null (on construction)\n // when used as a field.\n return borsh.rustEnum(variants).replicate(name);\n }\n return borsh.rustEnum(variants, name);\n }\n else {\n throw new Error(\"Unknown type kint: \" + typeDef);\n }\n };\n return IdlCoder;\n}());\nexports.IdlCoder = IdlCoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleCoder = void 0;\nvar events_1 = require(\"./events\");\nvar accounts_1 = require(\"./accounts\");\nvar instructions_1 = require(\"./instructions\");\nvar state_1 = require(\"./state\");\nvar types_1 = require(\"./types\");\n/**\n * Coder for PythOracleCoder\n */\nvar PythOracleCoder = /** @class */ (function () {\n function PythOracleCoder(idl) {\n this.accounts = new accounts_1.PythOracleAccountCoder(idl);\n this.events = new events_1.PythOracleEventCoder();\n this.instruction = new instructions_1.PythOracleInstructionCoder(idl);\n this.state = new state_1.PythOracleStateCoder();\n this.types = new types_1.PythOracleTypesCoder();\n }\n return PythOracleCoder;\n}());\nexports.PythOracleCoder = PythOracleCoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleEventCoder = void 0;\nvar PythOracleEventCoder = /** @class */ (function () {\n function PythOracleEventCoder() {\n }\n PythOracleEventCoder.prototype.decode = function (_log) {\n throw new Error('Pyth oracle program does not have events');\n };\n return PythOracleEventCoder;\n}());\nexports.PythOracleEventCoder = PythOracleEventCoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleStateCoder = void 0;\nvar PythOracleStateCoder = /** @class */ (function () {\n function PythOracleStateCoder() {\n }\n PythOracleStateCoder.prototype.encode = function (_name, _account) {\n throw new Error('Not implemented');\n };\n PythOracleStateCoder.prototype.decode = function (_ix) {\n throw new Error('Not implemented');\n };\n return PythOracleStateCoder;\n}());\nexports.PythOracleStateCoder = PythOracleStateCoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.PythOracleTypesCoder = void 0;\nvar PythOracleTypesCoder = /** @class */ (function () {\n function PythOracleTypesCoder() {\n }\n PythOracleTypesCoder.prototype.encode = function (_name, _type) {\n throw new Error('Not implemented');\n };\n PythOracleTypesCoder.prototype.decode = function (_name, _typeData) {\n throw new Error('Not implemented');\n };\n return PythOracleTypesCoder;\n}());\nexports.PythOracleTypesCoder = PythOracleTypesCoder;\n","\"use strict\";\nvar __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n Object.defineProperty(o, k2, { enumerable: true, get: function() { return m[k]; } });\n}) : (function(o, m, k, k2) {\n if (k2 === undefined) k2 = k;\n o[k2] = m[k];\n}));\nvar __exportStar = (this && this.__exportStar) || function(m, exports) {\n for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\n__exportStar(require(\"./program\"), exports);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pythIdl = exports.pythOracleCoder = exports.pythOracleProgram = void 0;\nvar anchor_1 = require(\"@coral-xyz/anchor\");\nvar coder_1 = require(\"./coder\");\nvar idl_json_1 = __importDefault(require(\"./idl.json\"));\n/** The Pyth program is not fully compatible with Anchor idls.\n * However it can be interacted with from Anchor clients by using PythOracleCoder from this library.\n * It currently only supports instructions. To deserialize accounts one can use the non-Anchor\n * parsing functions from this package.\n */\nfunction pythOracleProgram(programId, provider) {\n return new anchor_1.Program(idl_json_1.default, programId, provider, new coder_1.PythOracleCoder(idl_json_1.default));\n}\nexports.pythOracleProgram = pythOracleProgram;\nfunction pythOracleCoder() {\n return new coder_1.PythOracleCoder(idl_json_1.default);\n}\nexports.pythOracleCoder = pythOracleCoder;\nvar idl_json_2 = require(\"./idl.json\");\nObject.defineProperty(exports, \"pythIdl\", { enumerable: true, get: function () { return __importDefault(idl_json_2).default; } });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.pythIdl = exports.pythOracleCoder = exports.pythOracleProgram = exports.getPythClusterApiUrl = exports.getPythProgramKeyForCluster = exports.PythHttpClient = exports.PythConnection = exports.parsePermissionData = exports.parsePriceData = exports.parseProductData = exports.parseMappingData = exports.parseBaseData = exports.AccountType = exports.DeriveType = exports.PriceType = exports.CorpAction = exports.PriceStatus = exports.MAX_SLOT_DIFFERENCE = exports.Version = exports.Version2 = exports.Magic = void 0;\nvar web3_js_1 = require(\"@solana/web3.js\");\nvar buffer_1 = require(\"buffer\");\nvar readBig_1 = require(\"./readBig\");\n/** Constants. This section must be kept in sync with the on-chain program. */\nexports.Magic = 0xa1b2c3d4;\nexports.Version2 = 2;\nexports.Version = exports.Version2;\n/** Number of slots that can pass before a publisher's price is no longer included in the aggregate. */\nexports.MAX_SLOT_DIFFERENCE = 25;\nvar PriceStatus;\n(function (PriceStatus) {\n PriceStatus[PriceStatus[\"Unknown\"] = 0] = \"Unknown\";\n PriceStatus[PriceStatus[\"Trading\"] = 1] = \"Trading\";\n PriceStatus[PriceStatus[\"Halted\"] = 2] = \"Halted\";\n PriceStatus[PriceStatus[\"Auction\"] = 3] = \"Auction\";\n PriceStatus[PriceStatus[\"Ignored\"] = 4] = \"Ignored\";\n})(PriceStatus = exports.PriceStatus || (exports.PriceStatus = {}));\nvar CorpAction;\n(function (CorpAction) {\n CorpAction[CorpAction[\"NoCorpAct\"] = 0] = \"NoCorpAct\";\n})(CorpAction = exports.CorpAction || (exports.CorpAction = {}));\nvar PriceType;\n(function (PriceType) {\n PriceType[PriceType[\"Unknown\"] = 0] = \"Unknown\";\n PriceType[PriceType[\"Price\"] = 1] = \"Price\";\n})(PriceType = exports.PriceType || (exports.PriceType = {}));\nvar DeriveType;\n(function (DeriveType) {\n DeriveType[DeriveType[\"Unknown\"] = 0] = \"Unknown\";\n DeriveType[DeriveType[\"Volatility\"] = 1] = \"Volatility\";\n})(DeriveType = exports.DeriveType || (exports.DeriveType = {}));\nvar AccountType;\n(function (AccountType) {\n AccountType[AccountType[\"Unknown\"] = 0] = \"Unknown\";\n AccountType[AccountType[\"Mapping\"] = 1] = \"Mapping\";\n AccountType[AccountType[\"Product\"] = 2] = \"Product\";\n AccountType[AccountType[\"Price\"] = 3] = \"Price\";\n AccountType[AccountType[\"Test\"] = 4] = \"Test\";\n AccountType[AccountType[\"Permission\"] = 5] = \"Permission\";\n})(AccountType = exports.AccountType || (exports.AccountType = {}));\nvar empty32Buffer = buffer_1.Buffer.alloc(32);\nvar PKorNull = function (data) { return (data.equals(empty32Buffer) ? null : new web3_js_1.PublicKey(data)); };\n/** Parse data as a generic Pyth account. Use this method if you don't know the account type. */\nfunction parseBaseData(data) {\n // data is too short to have the magic number.\n if (data.byteLength < 4) {\n return undefined;\n }\n var magic = data.readUInt32LE(0);\n if (magic === exports.Magic) {\n // program version\n var version = data.readUInt32LE(4);\n // account type\n var type = data.readUInt32LE(8);\n // account used size\n var size = data.readUInt32LE(12);\n return { magic: magic, version: version, type: type, size: size };\n }\n else {\n return undefined;\n }\n}\nexports.parseBaseData = parseBaseData;\nvar parseMappingData = function (data) {\n // pyth magic number\n var magic = data.readUInt32LE(0);\n // program version\n var version = data.readUInt32LE(4);\n // account type\n var type = data.readUInt32LE(8);\n // account used size\n var size = data.readUInt32LE(12);\n // number of product accounts\n var numProducts = data.readUInt32LE(16);\n // unused\n // const unused = accountInfo.data.readUInt32LE(20)\n // next mapping account (if any)\n var nextMappingAccount = PKorNull(data.slice(24, 56));\n // read each symbol account\n var offset = 56;\n var productAccountKeys = [];\n for (var i = 0; i < numProducts; i++) {\n var productAccountBytes = data.slice(offset, offset + 32);\n var productAccountKey = new web3_js_1.PublicKey(productAccountBytes);\n offset += 32;\n productAccountKeys.push(productAccountKey);\n }\n return {\n magic: magic,\n version: version,\n type: type,\n size: size,\n nextMappingAccount: nextMappingAccount,\n productAccountKeys: productAccountKeys,\n };\n};\nexports.parseMappingData = parseMappingData;\nvar parseProductData = function (data) {\n // pyth magic number\n var magic = data.readUInt32LE(0);\n // program version\n var version = data.readUInt32LE(4);\n // account type\n var type = data.readUInt32LE(8);\n // price account size\n var size = data.readUInt32LE(12);\n // first price account in list\n var priceAccountBytes = data.slice(16, 48);\n var priceAccountKey = PKorNull(priceAccountBytes);\n var product = {};\n if (priceAccountKey)\n product.price_account = priceAccountKey.toBase58();\n var idx = 48;\n while (idx < size) {\n var keyLength = data[idx];\n idx++;\n if (keyLength) {\n var key = data.slice(idx, idx + keyLength).toString();\n idx += keyLength;\n var valueLength = data[idx];\n idx++;\n var value = data.slice(idx, idx + valueLength).toString();\n idx += valueLength;\n product[key] = value;\n }\n }\n return { magic: magic, version: version, type: type, size: size, priceAccountKey: priceAccountKey, product: product };\n};\nexports.parseProductData = parseProductData;\nvar parseEma = function (data, exponent) {\n // current value of ema\n var valueComponent = readBig_1.readBigInt64LE(data, 0);\n var value = Number(valueComponent) * Math.pow(10, exponent);\n // numerator state for next update\n var numerator = readBig_1.readBigInt64LE(data, 8);\n // denominator state for next update\n var denominator = readBig_1.readBigInt64LE(data, 16);\n return { valueComponent: valueComponent, value: value, numerator: numerator, denominator: denominator };\n};\nvar parsePriceInfo = function (data, exponent) {\n // aggregate price\n var priceComponent = readBig_1.readBigInt64LE(data, 0);\n var price = Number(priceComponent) * Math.pow(10, exponent);\n // aggregate confidence\n var confidenceComponent = readBig_1.readBigUInt64LE(data, 8);\n var confidence = Number(confidenceComponent) * Math.pow(10, exponent);\n // aggregate status\n var status = data.readUInt32LE(16);\n // aggregate corporate action\n var corporateAction = data.readUInt32LE(20);\n // aggregate publish slot. It is converted to number to be consistent with Solana's library interface (Slot there is number)\n var publishSlot = Number(readBig_1.readBigUInt64LE(data, 24));\n return {\n priceComponent: priceComponent,\n price: price,\n confidenceComponent: confidenceComponent,\n confidence: confidence,\n status: status,\n corporateAction: corporateAction,\n publishSlot: publishSlot,\n };\n};\n// Provide currentSlot when available to allow status to consider the case when price goes stale. It is optional because\n// it requires an extra request to get it when it is not available which is not always efficient.\nvar parsePriceData = function (data, currentSlot) {\n // pyth magic number\n var magic = data.readUInt32LE(0);\n // program version\n var version = data.readUInt32LE(4);\n // account type\n var type = data.readUInt32LE(8);\n // price account size\n var size = data.readUInt32LE(12);\n // price or calculation type\n var priceType = data.readUInt32LE(16);\n // price exponent\n var exponent = data.readInt32LE(20);\n // number of component prices\n var numComponentPrices = data.readUInt32LE(24);\n // number of quoters that make up aggregate\n var numQuoters = data.readUInt32LE(28);\n // slot of last valid (not unknown) aggregate price\n var lastSlot = readBig_1.readBigUInt64LE(data, 32);\n // valid on-chain slot of aggregate price\n var validSlot = readBig_1.readBigUInt64LE(data, 40);\n // exponential moving average price\n var emaPrice = parseEma(data.slice(48, 72), exponent);\n // exponential moving average confidence interval\n var emaConfidence = parseEma(data.slice(72, 96), exponent);\n // timestamp of the current price\n var timestamp = readBig_1.readBigInt64LE(data, 96);\n // minimum number of publishers for status to be TRADING\n var minPublishers = data.readUInt8(104);\n // space for future derived values\n var drv2 = data.readInt8(105);\n // space for future derived values\n var drv3 = data.readInt16LE(106);\n // space for future derived values\n var drv4 = data.readInt32LE(108);\n // product id / reference account\n var productAccountKey = new web3_js_1.PublicKey(data.slice(112, 144));\n // next price account in list\n var nextPriceAccountKey = PKorNull(data.slice(144, 176));\n // valid slot of previous update\n var previousSlot = readBig_1.readBigUInt64LE(data, 176);\n // aggregate price of previous update\n var previousPriceComponent = readBig_1.readBigInt64LE(data, 184);\n var previousPrice = Number(previousPriceComponent) * Math.pow(10, exponent);\n // confidence interval of previous update\n var previousConfidenceComponent = readBig_1.readBigUInt64LE(data, 192);\n var previousConfidence = Number(previousConfidenceComponent) * Math.pow(10, exponent);\n // space for future derived values\n var previousTimestamp = readBig_1.readBigInt64LE(data, 200);\n var aggregate = parsePriceInfo(data.slice(208, 240), exponent);\n var status = aggregate.status;\n if (currentSlot && status === PriceStatus.Trading) {\n if (currentSlot - aggregate.publishSlot > exports.MAX_SLOT_DIFFERENCE) {\n status = PriceStatus.Unknown;\n }\n }\n var price;\n var confidence;\n if (status === PriceStatus.Trading) {\n price = aggregate.price;\n confidence = aggregate.confidence;\n }\n // price components - up to 32\n var priceComponents = [];\n var offset = 240;\n while (priceComponents.length < numComponentPrices) {\n var publisher = new web3_js_1.PublicKey(data.slice(offset, offset + 32));\n offset += 32;\n var componentAggregate = parsePriceInfo(data.slice(offset, offset + 32), exponent);\n offset += 32;\n var latest = parsePriceInfo(data.slice(offset, offset + 32), exponent);\n offset += 32;\n priceComponents.push({ publisher: publisher, aggregate: componentAggregate, latest: latest });\n }\n return {\n magic: magic,\n version: version,\n type: type,\n size: size,\n priceType: priceType,\n exponent: exponent,\n numComponentPrices: numComponentPrices,\n numQuoters: numQuoters,\n lastSlot: lastSlot,\n validSlot: validSlot,\n emaPrice: emaPrice,\n emaConfidence: emaConfidence,\n timestamp: timestamp,\n minPublishers: minPublishers,\n drv2: drv2,\n drv3: drv3,\n drv4: drv4,\n productAccountKey: productAccountKey,\n nextPriceAccountKey: nextPriceAccountKey,\n previousSlot: previousSlot,\n previousPriceComponent: previousPriceComponent,\n previousPrice: previousPrice,\n previousConfidenceComponent: previousConfidenceComponent,\n previousConfidence: previousConfidence,\n previousTimestamp: previousTimestamp,\n aggregate: aggregate,\n priceComponents: priceComponents,\n price: price,\n confidence: confidence,\n status: status,\n };\n};\nexports.parsePriceData = parsePriceData;\nvar parsePermissionData = function (data) {\n // pyth magic number\n var magic = data.readUInt32LE(0);\n // program version\n var version = data.readUInt32LE(4);\n // account type\n var type = data.readUInt32LE(8);\n // price account size\n var size = data.readUInt32LE(12);\n var masterAuthority = new web3_js_1.PublicKey(data.slice(16, 48));\n var dataCurationAuthority = new web3_js_1.PublicKey(data.slice(48, 80));\n var securityAuthority = new web3_js_1.PublicKey(data.slice(80, 112));\n return {\n magic: magic,\n version: version,\n type: type,\n size: size,\n masterAuthority: masterAuthority,\n dataCurationAuthority: dataCurationAuthority,\n securityAuthority: securityAuthority,\n };\n};\nexports.parsePermissionData = parsePermissionData;\nvar PythConnection_1 = require(\"./PythConnection\");\nObject.defineProperty(exports, \"PythConnection\", { enumerable: true, get: function () { return PythConnection_1.PythConnection; } });\nvar PythHttpClient_1 = require(\"./PythHttpClient\");\nObject.defineProperty(exports, \"PythHttpClient\", { enumerable: true, get: function () { return PythHttpClient_1.PythHttpClient; } });\nvar cluster_1 = require(\"./cluster\");\nObject.defineProperty(exports, \"getPythProgramKeyForCluster\", { enumerable: true, get: function () { return cluster_1.getPythProgramKeyForCluster; } });\nObject.defineProperty(exports, \"getPythClusterApiUrl\", { enumerable: true, get: function () { return cluster_1.getPythClusterApiUrl; } });\nvar anchor_1 = require(\"./anchor\");\nObject.defineProperty(exports, \"pythOracleProgram\", { enumerable: true, get: function () { return anchor_1.pythOracleProgram; } });\nObject.defineProperty(exports, \"pythOracleCoder\", { enumerable: true, get: function () { return anchor_1.pythOracleCoder; } });\nObject.defineProperty(exports, \"pythIdl\", { enumerable: true, get: function () { return anchor_1.pythIdl; } });\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.getPythClusterApiUrl = exports.getPythProgramKeyForCluster = void 0;\nvar web3_js_1 = require(\"@solana/web3.js\");\n/** Mapping from solana clusters to the public key of the pyth program. */\nvar clusterToPythProgramKey = {\n 'mainnet-beta': 'FsJ3A3u2vn5cTVofAjvy6y5kwABJAqYWpe4975bi2epH',\n devnet: 'gSbePebfvPy7tRqimPoVecS2UsBvYv46ynrzWocc92s',\n 'pythtest-crosschain': \"gSbePebfvPy7tRqimPoVecS2UsBvYv46ynrzWocc92s\",\n testnet: '8tfDNiaEyrV6Q1U4DEXrEigs9DoDtkugzFbybENEbCDz',\n 'pythtest-conformance': '8tfDNiaEyrV6Q1U4DEXrEigs9DoDtkugzFbybENEbCDz',\n pythnet: 'FsJ3A3u2vn5cTVofAjvy6y5kwABJAqYWpe4975bi2epH',\n localnet: 'gMYYig2utAxVoXnM9UhtTWrt8e7x2SVBZqsWZJeT5Gw',\n};\n/** Gets the public key of the Pyth program running on the given cluster. */\nfunction getPythProgramKeyForCluster(cluster) {\n if (clusterToPythProgramKey[cluster] !== undefined) {\n return new web3_js_1.PublicKey(clusterToPythProgramKey[cluster]);\n }\n else {\n throw new Error(\"Invalid Solana cluster name: \" + cluster + \". Valid options are: \" + JSON.stringify(Object.keys(clusterToPythProgramKey)));\n }\n}\nexports.getPythProgramKeyForCluster = getPythProgramKeyForCluster;\n/** Retrieves the RPC API URL for the specified Pyth cluster */\nfunction getPythClusterApiUrl(cluster) {\n // TODO: Add pythnet when it's ready\n if (cluster === 'pythtest-conformance' || cluster === 'pythtest-crosschain') {\n return 'https://api.pythtest.pyth.network';\n }\n else if (cluster === 'pythnet') {\n return 'https://pythnet.rpcpool.com';\n }\n else if (cluster === 'localnet') {\n return 'http://localhost:8899';\n }\n else {\n return web3_js_1.clusterApiUrl(cluster);\n }\n}\nexports.getPythClusterApiUrl = getPythClusterApiUrl;\n","var t=\"undefined\"!=typeof globalThis?globalThis:\"undefined\"!=typeof window?window:\"undefined\"!=typeof global?global:\"undefined\"!=typeof self?self:{};function e(t){return t&&t.__esModule&&Object.prototype.hasOwnProperty.call(t,\"default\")?t.default:t}function r(t){if(t.__esModule)return t;var e=t.default;if(\"function\"==typeof e){var r=function t(){return this instanceof t?Reflect.construct(e,arguments,this.constructor):e.apply(this,arguments)};r.prototype=e.prototype}else r={};return Object.defineProperty(r,\"__esModule\",{value:!0}),Object.keys(t).forEach((function(e){var n=Object.getOwnPropertyDescriptor(t,e);Object.defineProperty(r,e,n.get?n:{enumerable:!0,get:function(){return t[e]}})})),r}for(var n={},i={byteLength:function(t){var e=h(t),r=e[0],n=e[1];return 3*(r+n)/4-n},toByteArray:function(t){var e,r,n=h(t),i=n[0],o=n[1],u=new a(function(t,e,r){return 3*(e+r)/4-r}(0,i,o)),c=0,f=o>0?i-4:i;for(r=0;r<f;r+=4)e=s[t.charCodeAt(r)]<<18|s[t.charCodeAt(r+1)]<<12|s[t.charCodeAt(r+2)]<<6|s[t.charCodeAt(r+3)],u[c++]=e>>16&255,u[c++]=e>>8&255,u[c++]=255&e;2===o&&(e=s[t.charCodeAt(r)]<<2|s[t.charCodeAt(r+1)]>>4,u[c++]=255&e);1===o&&(e=s[t.charCodeAt(r)]<<10|s[t.charCodeAt(r+1)]<<4|s[t.charCodeAt(r+2)]>>2,u[c++]=e>>8&255,u[c++]=255&e);return u},fromByteArray:function(t){for(var e,r=t.length,n=r%3,i=[],s=16383,a=0,u=r-n;a<u;a+=s)i.push(f(t,a,a+s>u?u:a+s));1===n?(e=t[r-1],i.push(o[e>>2]+o[e<<4&63]+\"==\")):2===n&&(e=(t[r-2]<<8)+t[r-1],i.push(o[e>>10]+o[e>>4&63]+o[e<<2&63]+\"=\"));return i.join(\"\")}},o=[],s=[],a=\"undefined\"!=typeof Uint8Array?Uint8Array:Array,u=\"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/\",c=0;c<64;++c)o[c]=u[c],s[u.charCodeAt(c)]=c;function h(t){var e=t.length;if(e%4>0)throw new Error(\"Invalid string. Length must be a multiple of 4\");var r=t.indexOf(\"=\");return-1===r&&(r=e),[r,r===e?0:4-r%4]}function f(t,e,r){for(var n,i,s=[],a=e;a<r;a+=3)n=(t[a]<<16&16711680)+(t[a+1]<<8&65280)+(255&t[a+2]),s.push(o[(i=n)>>18&63]+o[i>>12&63]+o[i>>6&63]+o[63&i]);return s.join(\"\")}s[\"-\".charCodeAt(0)]=62,s[\"_\".charCodeAt(0)]=63;var l={};\n/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */function d(t){if(!Number.isSafeInteger(t)||t<0)throw new Error(`Wrong positive integer: ${t}`)}function p(t,...e){if(!(t instanceof Uint8Array))throw new Error(\"Expected Uint8Array\");if(e.length>0&&!e.includes(t.length))throw new Error(`Expected Uint8Array of length ${e}, not of length=${t.length}`)}function y(t,e=!0){if(t.destroyed)throw new Error(\"Hash instance has been destroyed\");if(e&&t.finished)throw new Error(\"Hash#digest() has already been called\")}l.read=function(t,e,r,n,i){var o,s,a=8*i-n-1,u=(1<<a)-1,c=u>>1,h=-7,f=r?i-1:0,l=r?-1:1,d=t[e+f];for(f+=l,o=d&(1<<-h)-1,d>>=-h,h+=a;h>0;o=256*o+t[e+f],f+=l,h-=8);for(s=o&(1<<-h)-1,o>>=-h,h+=n;h>0;s=256*s+t[e+f],f+=l,h-=8);if(0===o)o=1-c;else{if(o===u)return s?NaN:1/0*(d?-1:1);s+=Math.pow(2,n),o-=c}return(d?-1:1)*s*Math.pow(2,o-n)},l.write=function(t,e,r,n,i,o){var s,a,u,c=8*o-i-1,h=(1<<c)-1,f=h>>1,l=23===i?Math.pow(2,-24)-Math.pow(2,-77):0,d=n?0:o-1,p=n?1:-1,y=e<0||0===e&&1/e<0?1:0;for(e=Math.abs(e),isNaN(e)||e===1/0?(a=isNaN(e)?1:0,s=h):(s=Math.floor(Math.log(e)/Math.LN2),e*(u=Math.pow(2,-s))<1&&(s--,u*=2),(e+=s+f>=1?l/u:l*Math.pow(2,1-f))*u>=2&&(s++,u/=2),s+f>=h?(a=0,s=h):s+f>=1?(a=(e*u-1)*Math.pow(2,i),s+=f):(a=e*Math.pow(2,f-1)*Math.pow(2,i),s=0));i>=8;t[r+d]=255&a,d+=p,a/=256,i-=8);for(s=s<<i|a,c+=i;c>0;t[r+d]=255&s,d+=p,s/=256,c-=8);t[r+d-p]|=128*y},\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh <https://feross.org>\n * @license MIT\n */\nfunction(t){const e=i,r=l,n=\"function\"==typeof Symbol&&\"function\"==typeof Symbol.for?Symbol.for(\"nodejs.util.inspect.custom\"):null;t.Buffer=a,t.SlowBuffer=function(t){+t!=t&&(t=0);return a.alloc(+t)},t.INSPECT_MAX_BYTES=50;const o=2147483647;function s(t){if(t>o)throw new RangeError('The value \"'+t+'\" is invalid for option \"size\"');const e=new Uint8Array(t);return Object.setPrototypeOf(e,a.prototype),e}function a(t,e,r){if(\"number\"==typeof t){if(\"string\"==typeof e)throw new TypeError('The \"string\" argument must be of type string. Received type number');return h(t)}return u(t,e,r)}function u(t,e,r){if(\"string\"==typeof t)return function(t,e){\"string\"==typeof e&&\"\"!==e||(e=\"utf8\");if(!a.isEncoding(e))throw new TypeError(\"Unknown encoding: \"+e);const r=0|y(t,e);let n=s(r);const i=n.write(t,e);i!==r&&(n=n.slice(0,i));return n}(t,e);if(ArrayBuffer.isView(t))return function(t){if(G(t,Uint8Array)){const e=new Uint8Array(t);return d(e.buffer,e.byteOffset,e.byteLength)}return f(t)}(t);if(null==t)throw new TypeError(\"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \"+typeof t);if(G(t,ArrayBuffer)||t&&G(t.buffer,ArrayBuffer))return d(t,e,r);if(\"undefined\"!=typeof SharedArrayBuffer&&(G(t,SharedArrayBuffer)||t&&G(t.buffer,SharedArrayBuffer)))return d(t,e,r);if(\"number\"==typeof t)throw new TypeError('The \"value\" argument must not be of type number. Received type number');const n=t.valueOf&&t.valueOf();if(null!=n&&n!==t)return a.from(n,e,r);const i=function(t){if(a.isBuffer(t)){const e=0|p(t.length),r=s(e);return 0===r.length||t.copy(r,0,0,e),r}if(void 0!==t.length)return\"number\"!=typeof t.length||Y(t.length)?s(0):f(t);if(\"Buffer\"===t.type&&Array.isArray(t.data))return f(t.data)}(t);if(i)return i;if(\"undefined\"!=typeof Symbol&&null!=Symbol.toPrimitive&&\"function\"==typeof t[Symbol.toPrimitive])return a.from(t[Symbol.toPrimitive](\"string\"),e,r);throw new TypeError(\"The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type \"+typeof t)}function c(t){if(\"number\"!=typeof t)throw new TypeError('\"size\" argument must be of type number');if(t<0)throw new RangeError('The value \"'+t+'\" is invalid for option \"size\"')}function h(t){return c(t),s(t<0?0:0|p(t))}function f(t){const e=t.length<0?0:0|p(t.length),r=s(e);for(let n=0;n<e;n+=1)r[n]=255&t[n];return r}function d(t,e,r){if(e<0||t.byteLength<e)throw new RangeError('\"offset\" is outside of buffer bounds');if(t.byteLength<e+(r||0))throw new RangeError('\"length\" is outside of buffer bounds');let n;return n=void 0===e&&void 0===r?new Uint8Array(t):void 0===r?new Uint8Array(t,e):new Uint8Array(t,e,r),Object.setPrototypeOf(n,a.prototype),n}function p(t){if(t>=o)throw new RangeError(\"Attempt to allocate Buffer larger than maximum size: 0x\"+o.toString(16)+\" bytes\");return 0|t}function y(t,e){if(a.isBuffer(t))return t.length;if(ArrayBuffer.isView(t)||G(t,ArrayBuffer))return t.byteLength;if(\"string\"!=typeof t)throw new TypeError('The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. Received type '+typeof t);const r=t.length,n=arguments.length>2&&!0===arguments[2];if(!n&&0===r)return 0;let i=!1;for(;;)switch(e){case\"ascii\":case\"latin1\":case\"binary\":return r;case\"utf8\":case\"utf-8\":return K(t).length;case\"ucs2\":case\"ucs-2\":case\"utf16le\":case\"utf-16le\":return 2*r;case\"hex\":return r>>>1;case\"base64\":return $(t).length;default:if(i)return n?-1:K(t).length;e=(\"\"+e).toLowerCase(),i=!0}}function g(t,e,r){let n=!1;if((void 0===e||e<0)&&(e=0),e>this.length)return\"\";if((void 0===r||r>this.length)&&(r=this.length),r<=0)return\"\";if((r>>>=0)<=(e>>>=0))return\"\";for(t||(t=\"utf8\");;)switch(t){case\"hex\":return O(this,e,r);case\"utf8\":case\"utf-8\":return M(this,e,r);case\"ascii\":return _(this,e,r);case\"latin1\":case\"binary\":return A(this,e,r);case\"base64\":return k(this,e,r);case\"ucs2\":case\"ucs-2\":case\"utf16le\":case\"utf-16le\":return U(this,e,r);default:if(n)throw new TypeError(\"Unknown encoding: \"+t);t=(t+\"\").toLowerCase(),n=!0}}function m(t,e,r){const n=t[e];t[e]=t[r],t[r]=n}function w(t,e,r,n,i){if(0===t.length)return-1;if(\"string\"==typeof r?(n=r,r=0):r>2147483647?r=2147483647:r<-2147483648&&(r=-2147483648),Y(r=+r)&&(r=i?0:t.length-1),r<0&&(r=t.length+r),r>=t.length){if(i)return-1;r=t.length-1}else if(r<0){if(!i)return-1;r=0}if(\"string\"==typeof e&&(e=a.from(e,n)),a.isBuffer(e))return 0===e.length?-1:b(t,e,r,n,i);if(\"number\"==typeof e)return e&=255,\"function\"==typeof Uint8Array.prototype.indexOf?i?Uint8Array.prototype.indexOf.call(t,e,r):Uint8Array.prototype.lastIndexOf.call(t,e,r):b(t,[e],r,n,i);throw new TypeError(\"val must be string, number or Buffer\")}function b(t,e,r,n,i){let o,s=1,a=t.length,u=e.length;if(void 0!==n&&(\"ucs2\"===(n=String(n).toLowerCase())||\"ucs-2\"===n||\"utf16le\"===n||\"utf-16le\"===n)){if(t.length<2||e.length<2)return-1;s=2,a/=2,u/=2,r/=2}function c(t,e){return 1===s?t[e]:t.readUInt16BE(e*s)}if(i){let n=-1;for(o=r;o<a;o++)if(c(t,o)===c(e,-1===n?0:o-n)){if(-1===n&&(n=o),o-n+1===u)return n*s}else-1!==n&&(o-=o-n),n=-1}else for(r+u>a&&(r=a-u),o=r;o>=0;o--){let r=!0;for(let n=0;n<u;n++)if(c(t,o+n)!==c(e,n)){r=!1;break}if(r)return o}return-1}function v(t,e,r,n){r=Number(r)||0;const i=t.length-r;n?(n=Number(n))>i&&(n=i):n=i;const o=e.length;let s;for(n>o/2&&(n=o/2),s=0;s<n;++s){const n=parseInt(e.substr(2*s,2),16);if(Y(n))return s;t[r+s]=n}return s}function x(t,e,r,n){return Z(K(e,t.length-r),t,r,n)}function E(t,e,r,n){return Z(function(t){const e=[];for(let r=0;r<t.length;++r)e.push(255&t.charCodeAt(r));return e}(e),t,r,n)}function B(t,e,r,n){return Z($(e),t,r,n)}function S(t,e,r,n){return Z(function(t,e){let r,n,i;const o=[];for(let s=0;s<t.length&&!((e-=2)<0);++s)r=t.charCodeAt(s),n=r>>8,i=r%256,o.push(i),o.push(n);return o}(e,t.length-r),t,r,n)}function k(t,r,n){return 0===r&&n===t.length?e.fromByteArray(t):e.fromByteArray(t.slice(r,n))}function M(t,e,r){r=Math.min(t.length,r);const n=[];let i=e;for(;i<r;){const e=t[i];let o=null,s=e>239?4:e>223?3:e>191?2:1;if(i+s<=r){let r,n,a,u;switch(s){case 1:e<128&&(o=e);break;case 2:r=t[i+1],128==(192&r)&&(u=(31&e)<<6|63&r,u>127&&(o=u));break;case 3:r=t[i+1],n=t[i+2],128==(192&r)&&128==(192&n)&&(u=(15&e)<<12|(63&r)<<6|63&n,u>2047&&(u<55296||u>57343)&&(o=u));break;case 4:r=t[i+1],n=t[i+2],a=t[i+3],128==(192&r)&&128==(192&n)&&128==(192&a)&&(u=(15&e)<<18|(63&r)<<12|(63&n)<<6|63&a,u>65535&&u<1114112&&(o=u))}}null===o?(o=65533,s=1):o>65535&&(o-=65536,n.push(o>>>10&1023|55296),o=56320|1023&o),n.push(o),i+=s}return function(t){const e=t.length;if(e<=I)return String.fromCharCode.apply(String,t);let r=\"\",n=0;for(;n<e;)r+=String.fromCharCode.apply(String,t.slice(n,n+=I));return r}(n)}t.kMaxLength=o,a.TYPED_ARRAY_SUPPORT=function(){try{const t=new Uint8Array(1),e={foo:function(){return 42}};return Object.setPrototypeOf(e,Uint8Array.prototype),Object.setPrototypeOf(t,e),42===t.foo()}catch(t){return!1}}(),a.TYPED_ARRAY_SUPPORT||\"undefined\"==typeof console||\"function\"!=typeof console.error||console.error(\"This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support.\"),Object.defineProperty(a.prototype,\"parent\",{enumerable:!0,get:function(){if(a.isBuffer(this))return this.buffer}}),Object.defineProperty(a.prototype,\"offset\",{enumerable:!0,get:function(){if(a.isBuffer(this))return this.byteOffset}}),a.poolSize=8192,a.from=function(t,e,r){return u(t,e,r)},Object.setPrototypeOf(a.prototype,Uint8Array.prototype),Object.setPrototypeOf(a,Uint8Array),a.alloc=function(t,e,r){return function(t,e,r){return c(t),t<=0?s(t):void 0!==e?\"string\"==typeof r?s(t).fill(e,r):s(t).fill(e):s(t)}(t,e,r)},a.allocUnsafe=function(t){return h(t)},a.allocUnsafeSlow=function(t){return h(t)},a.isBuffer=function(t){return null!=t&&!0===t._isBuffer&&t!==a.prototype},a.compare=function(t,e){if(G(t,Uint8Array)&&(t=a.from(t,t.offset,t.byteLength)),G(e,Uint8Array)&&(e=a.from(e,e.offset,e.byteLength)),!a.isBuffer(t)||!a.isBuffer(e))throw new TypeError('The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array');if(t===e)return 0;let r=t.length,n=e.length;for(let i=0,o=Math.min(r,n);i<o;++i)if(t[i]!==e[i]){r=t[i],n=e[i];break}return r<n?-1:n<r?1:0},a.isEncoding=function(t){switch(String(t).toLowerCase()){case\"hex\":case\"utf8\":case\"utf-8\":case\"ascii\":case\"latin1\":case\"binary\":case\"base64\":case\"ucs2\":case\"ucs-2\":case\"utf16le\":case\"utf-16le\":return!0;default:return!1}},a.concat=function(t,e){if(!Array.isArray(t))throw new TypeError('\"list\" argument must be an Array of Buffers');if(0===t.length)return a.alloc(0);let r;if(void 0===e)for(e=0,r=0;r<t.length;++r)e+=t[r].length;const n=a.allocUnsafe(e);let i=0;for(r=0;r<t.length;++r){let e=t[r];if(G(e,Uint8Array))i+e.length>n.length?(a.isBuffer(e)||(e=a.from(e)),e.copy(n,i)):Uint8Array.prototype.set.call(n,e,i);else{if(!a.isBuffer(e))throw new TypeError('\"list\" argument must be an Array of Buffers');e.copy(n,i)}i+=e.length}return n},a.byteLength=y,a.prototype._isBuffer=!0,a.prototype.swap16=function(){const t=this.length;if(t%2!=0)throw new RangeError(\"Buffer size must be a multiple of 16-bits\");for(let e=0;e<t;e+=2)m(this,e,e+1);return this},a.prototype.swap32=function(){const t=this.length;if(t%4!=0)throw new RangeError(\"Buffer size must be a multiple of 32-bits\");for(let e=0;e<t;e+=4)m(this,e,e+3),m(this,e+1,e+2);return this},a.prototype.swap64=function(){const t=this.length;if(t%8!=0)throw new RangeError(\"Buffer size must be a multiple of 64-bits\");for(let e=0;e<t;e+=8)m(this,e,e+7),m(this,e+1,e+6),m(this,e+2,e+5),m(this,e+3,e+4);return this},a.prototype.toString=function(){const t=this.length;return 0===t?\"\":0===arguments.length?M(this,0,t):g.apply(this,arguments)},a.prototype.toLocaleString=a.prototype.toString,a.prototype.equals=function(t){if(!a.isBuffer(t))throw new TypeError(\"Argument must be a Buffer\");return this===t||0===a.compare(this,t)},a.prototype.inspect=function(){let e=\"\";const r=t.INSPECT_MAX_BYTES;return e=this.toString(\"hex\",0,r).replace(/(.{2})/g,\"$1 \").trim(),this.length>r&&(e+=\" ... \"),\"<Buffer \"+e+\">\"},n&&(a.prototype[n]=a.prototype.inspect),a.prototype.compare=function(t,e,r,n,i){if(G(t,Uint8Array)&&(t=a.from(t,t.offset,t.byteLength)),!a.isBuffer(t))throw new TypeError('The \"target\" argument must be one of type Buffer or Uint8Array. Received type '+typeof t);if(void 0===e&&(e=0),void 0===r&&(r=t?t.length:0),void 0===n&&(n=0),void 0===i&&(i=this.length),e<0||r>t.length||n<0||i>this.length)throw new RangeError(\"out of range index\");if(n>=i&&e>=r)return 0;if(n>=i)return-1;if(e>=r)return 1;if(this===t)return 0;let o=(i>>>=0)-(n>>>=0),s=(r>>>=0)-(e>>>=0);const u=Math.min(o,s),c=this.slice(n,i),h=t.slice(e,r);for(let t=0;t<u;++t)if(c[t]!==h[t]){o=c[t],s=h[t];break}return o<s?-1:s<o?1:0},a.prototype.includes=function(t,e,r){return-1!==this.indexOf(t,e,r)},a.prototype.indexOf=function(t,e,r){return w(this,t,e,r,!0)},a.prototype.lastIndexOf=function(t,e,r){return w(this,t,e,r,!1)},a.prototype.write=function(t,e,r,n){if(void 0===e)n=\"utf8\",r=this.length,e=0;else if(void 0===r&&\"string\"==typeof e)n=e,r=this.length,e=0;else{if(!isFinite(e))throw new Error(\"Buffer.write(string, encoding, offset[, length]) is no longer supported\");e>>>=0,isFinite(r)?(r>>>=0,void 0===n&&(n=\"utf8\")):(n=r,r=void 0)}const i=this.length-e;if((void 0===r||r>i)&&(r=i),t.length>0&&(r<0||e<0)||e>this.length)throw new RangeError(\"Attempt to write outside buffer bounds\");n||(n=\"utf8\");let o=!1;for(;;)switch(n){case\"hex\":return v(this,t,e,r);case\"utf8\":case\"utf-8\":return x(this,t,e,r);case\"ascii\":case\"latin1\":case\"binary\":return E(this,t,e,r);case\"base64\":return B(this,t,e,r);case\"ucs2\":case\"ucs-2\":case\"utf16le\":case\"utf-16le\":return S(this,t,e,r);default:if(o)throw new TypeError(\"Unknown encoding: \"+n);n=(\"\"+n).toLowerCase(),o=!0}},a.prototype.toJSON=function(){return{type:\"Buffer\",data:Array.prototype.slice.call(this._arr||this,0)}};const I=4096;function _(t,e,r){let n=\"\";r=Math.min(t.length,r);for(let i=e;i<r;++i)n+=String.fromCharCode(127&t[i]);return n}function A(t,e,r){let n=\"\";r=Math.min(t.length,r);for(let i=e;i<r;++i)n+=String.fromCharCode(t[i]);return n}function O(t,e,r){const n=t.length;(!e||e<0)&&(e=0),(!r||r<0||r>n)&&(r=n);let i=\"\";for(let n=e;n<r;++n)i+=J[t[n]];return i}function U(t,e,r){const n=t.slice(e,r);let i=\"\";for(let t=0;t<n.length-1;t+=2)i+=String.fromCharCode(n[t]+256*n[t+1]);return i}function L(t,e,r){if(t%1!=0||t<0)throw new RangeError(\"offset is not uint\");if(t+e>r)throw new RangeError(\"Trying to access beyond buffer length\")}function T(t,e,r,n,i,o){if(!a.isBuffer(t))throw new TypeError('\"buffer\" argument must be a Buffer instance');if(e>i||e<o)throw new RangeError('\"value\" argument is out of bounds');if(r+n>t.length)throw new RangeError(\"Index out of range\")}function P(t,e,r,n,i){F(e,n,i,t,r,7);let o=Number(e&BigInt(4294967295));t[r++]=o,o>>=8,t[r++]=o,o>>=8,t[r++]=o,o>>=8,t[r++]=o;let s=Number(e>>BigInt(32)&BigInt(4294967295));return t[r++]=s,s>>=8,t[r++]=s,s>>=8,t[r++]=s,s>>=8,t[r++]=s,r}function R(t,e,r,n,i){F(e,n,i,t,r,7);let o=Number(e&BigInt(4294967295));t[r+7]=o,o>>=8,t[r+6]=o,o>>=8,t[r+5]=o,o>>=8,t[r+4]=o;let s=Number(e>>BigInt(32)&BigInt(4294967295));return t[r+3]=s,s>>=8,t[r+2]=s,s>>=8,t[r+1]=s,s>>=8,t[r]=s,r+8}function j(t,e,r,n,i,o){if(r+n>t.length)throw new RangeError(\"Index out of range\");if(r<0)throw new RangeError(\"Index out of range\")}function N(t,e,n,i,o){return e=+e,n>>>=0,o||j(t,0,n,4),r.write(t,e,n,i,23,4),n+4}function z(t,e,n,i,o){return e=+e,n>>>=0,o||j(t,0,n,8),r.write(t,e,n,i,52,8),n+8}a.prototype.slice=function(t,e){const r=this.length;(t=~~t)<0?(t+=r)<0&&(t=0):t>r&&(t=r),(e=void 0===e?r:~~e)<0?(e+=r)<0&&(e=0):e>r&&(e=r),e<t&&(e=t);const n=this.subarray(t,e);return Object.setPrototypeOf(n,a.prototype),n},a.prototype.readUintLE=a.prototype.readUIntLE=function(t,e,r){t>>>=0,e>>>=0,r||L(t,e,this.length);let n=this[t],i=1,o=0;for(;++o<e&&(i*=256);)n+=this[t+o]*i;return n},a.prototype.readUintBE=a.prototype.readUIntBE=function(t,e,r){t>>>=0,e>>>=0,r||L(t,e,this.length);let n=this[t+--e],i=1;for(;e>0&&(i*=256);)n+=this[t+--e]*i;return n},a.prototype.readUint8=a.prototype.readUInt8=function(t,e){return t>>>=0,e||L(t,1,this.length),this[t]},a.prototype.readUint16LE=a.prototype.readUInt16LE=function(t,e){return t>>>=0,e||L(t,2,this.length),this[t]|this[t+1]<<8},a.prototype.readUint16BE=a.prototype.readUInt16BE=function(t,e){return t>>>=0,e||L(t,2,this.length),this[t]<<8|this[t+1]},a.prototype.readUint32LE=a.prototype.readUInt32LE=function(t,e){return t>>>=0,e||L(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},a.prototype.readUint32BE=a.prototype.readUInt32BE=function(t,e){return t>>>=0,e||L(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},a.prototype.readBigUInt64LE=X((function(t){D(t>>>=0,\"offset\");const e=this[t],r=this[t+7];void 0!==e&&void 0!==r||H(t,this.length-8);const n=e+256*this[++t]+65536*this[++t]+this[++t]*2**24,i=this[++t]+256*this[++t]+65536*this[++t]+r*2**24;return BigInt(n)+(BigInt(i)<<BigInt(32))})),a.prototype.readBigUInt64BE=X((function(t){D(t>>>=0,\"offset\");const e=this[t],r=this[t+7];void 0!==e&&void 0!==r||H(t,this.length-8);const n=e*2**24+65536*this[++t]+256*this[++t]+this[++t],i=this[++t]*2**24+65536*this[++t]+256*this[++t]+r;return(BigInt(n)<<BigInt(32))+BigInt(i)})),a.prototype.readIntLE=function(t,e,r){t>>>=0,e>>>=0,r||L(t,e,this.length);let n=this[t],i=1,o=0;for(;++o<e&&(i*=256);)n+=this[t+o]*i;return i*=128,n>=i&&(n-=Math.pow(2,8*e)),n},a.prototype.readIntBE=function(t,e,r){t>>>=0,e>>>=0,r||L(t,e,this.length);let n=e,i=1,o=this[t+--n];for(;n>0&&(i*=256);)o+=this[t+--n]*i;return i*=128,o>=i&&(o-=Math.pow(2,8*e)),o},a.prototype.readInt8=function(t,e){return t>>>=0,e||L(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},a.prototype.readInt16LE=function(t,e){t>>>=0,e||L(t,2,this.length);const r=this[t]|this[t+1]<<8;return 32768&r?4294901760|r:r},a.prototype.readInt16BE=function(t,e){t>>>=0,e||L(t,2,this.length);const r=this[t+1]|this[t]<<8;return 32768&r?4294901760|r:r},a.prototype.readInt32LE=function(t,e){return t>>>=0,e||L(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},a.prototype.readInt32BE=function(t,e){return t>>>=0,e||L(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},a.prototype.readBigInt64LE=X((function(t){D(t>>>=0,\"offset\");const e=this[t],r=this[t+7];void 0!==e&&void 0!==r||H(t,this.length-8);const n=this[t+4]+256*this[t+5]+65536*this[t+6]+(r<<24);return(BigInt(n)<<BigInt(32))+BigInt(e+256*this[++t]+65536*this[++t]+this[++t]*2**24)})),a.prototype.readBigInt64BE=X((function(t){D(t>>>=0,\"offset\");const e=this[t],r=this[t+7];void 0!==e&&void 0!==r||H(t,this.length-8);const n=(e<<24)+65536*this[++t]+256*this[++t]+this[++t];return(BigInt(n)<<BigInt(32))+BigInt(this[++t]*2**24+65536*this[++t]+256*this[++t]+r)})),a.prototype.readFloatLE=function(t,e){return t>>>=0,e||L(t,4,this.length),r.read(this,t,!0,23,4)},a.prototype.readFloatBE=function(t,e){return t>>>=0,e||L(t,4,this.length),r.read(this,t,!1,23,4)},a.prototype.readDoubleLE=function(t,e){return t>>>=0,e||L(t,8,this.length),r.read(this,t,!0,52,8)},a.prototype.readDoubleBE=function(t,e){return t>>>=0,e||L(t,8,this.length),r.read(this,t,!1,52,8)},a.prototype.writeUintLE=a.prototype.writeUIntLE=function(t,e,r,n){if(t=+t,e>>>=0,r>>>=0,!n){T(this,t,e,r,Math.pow(2,8*r)-1,0)}let i=1,o=0;for(this[e]=255&t;++o<r&&(i*=256);)this[e+o]=t/i&255;return e+r},a.prototype.writeUintBE=a.prototype.writeUIntBE=function(t,e,r,n){if(t=+t,e>>>=0,r>>>=0,!n){T(this,t,e,r,Math.pow(2,8*r)-1,0)}let i=r-1,o=1;for(this[e+i]=255&t;--i>=0&&(o*=256);)this[e+i]=t/o&255;return e+r},a.prototype.writeUint8=a.prototype.writeUInt8=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,1,255,0),this[e]=255&t,e+1},a.prototype.writeUint16LE=a.prototype.writeUInt16LE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,2,65535,0),this[e]=255&t,this[e+1]=t>>>8,e+2},a.prototype.writeUint16BE=a.prototype.writeUInt16BE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,2,65535,0),this[e]=t>>>8,this[e+1]=255&t,e+2},a.prototype.writeUint32LE=a.prototype.writeUInt32LE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,4,4294967295,0),this[e+3]=t>>>24,this[e+2]=t>>>16,this[e+1]=t>>>8,this[e]=255&t,e+4},a.prototype.writeUint32BE=a.prototype.writeUInt32BE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,4,4294967295,0),this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t,e+4},a.prototype.writeBigUInt64LE=X((function(t,e=0){return P(this,t,e,BigInt(0),BigInt(\"0xffffffffffffffff\"))})),a.prototype.writeBigUInt64BE=X((function(t,e=0){return R(this,t,e,BigInt(0),BigInt(\"0xffffffffffffffff\"))})),a.prototype.writeIntLE=function(t,e,r,n){if(t=+t,e>>>=0,!n){const n=Math.pow(2,8*r-1);T(this,t,e,r,n-1,-n)}let i=0,o=1,s=0;for(this[e]=255&t;++i<r&&(o*=256);)t<0&&0===s&&0!==this[e+i-1]&&(s=1),this[e+i]=(t/o>>0)-s&255;return e+r},a.prototype.writeIntBE=function(t,e,r,n){if(t=+t,e>>>=0,!n){const n=Math.pow(2,8*r-1);T(this,t,e,r,n-1,-n)}let i=r-1,o=1,s=0;for(this[e+i]=255&t;--i>=0&&(o*=256);)t<0&&0===s&&0!==this[e+i+1]&&(s=1),this[e+i]=(t/o>>0)-s&255;return e+r},a.prototype.writeInt8=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,1,127,-128),t<0&&(t=255+t+1),this[e]=255&t,e+1},a.prototype.writeInt16LE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,2,32767,-32768),this[e]=255&t,this[e+1]=t>>>8,e+2},a.prototype.writeInt16BE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,2,32767,-32768),this[e]=t>>>8,this[e+1]=255&t,e+2},a.prototype.writeInt32LE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,4,2147483647,-2147483648),this[e]=255&t,this[e+1]=t>>>8,this[e+2]=t>>>16,this[e+3]=t>>>24,e+4},a.prototype.writeInt32BE=function(t,e,r){return t=+t,e>>>=0,r||T(this,t,e,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t,e+4},a.prototype.writeBigInt64LE=X((function(t,e=0){return P(this,t,e,-BigInt(\"0x8000000000000000\"),BigInt(\"0x7fffffffffffffff\"))})),a.prototype.writeBigInt64BE=X((function(t,e=0){return R(this,t,e,-BigInt(\"0x8000000000000000\"),BigInt(\"0x7fffffffffffffff\"))})),a.prototype.writeFloatLE=function(t,e,r){return N(this,t,e,!0,r)},a.prototype.writeFloatBE=function(t,e,r){return N(this,t,e,!1,r)},a.prototype.writeDoubleLE=function(t,e,r){return z(this,t,e,!0,r)},a.prototype.writeDoubleBE=function(t,e,r){return z(this,t,e,!1,r)},a.prototype.copy=function(t,e,r,n){if(!a.isBuffer(t))throw new TypeError(\"argument should be a Buffer\");if(r||(r=0),n||0===n||(n=this.length),e>=t.length&&(e=t.length),e||(e=0),n>0&&n<r&&(n=r),n===r)return 0;if(0===t.length||0===this.length)return 0;if(e<0)throw new RangeError(\"targetStart out of bounds\");if(r<0||r>=this.length)throw new RangeError(\"Index out of range\");if(n<0)throw new RangeError(\"sourceEnd out of bounds\");n>this.length&&(n=this.length),t.length-e<n-r&&(n=t.length-e+r);const i=n-r;return this===t&&\"function\"==typeof Uint8Array.prototype.copyWithin?this.copyWithin(e,r,n):Uint8Array.prototype.set.call(t,this.subarray(r,n),e),i},a.prototype.fill=function(t,e,r,n){if(\"string\"==typeof t){if(\"string\"==typeof e?(n=e,e=0,r=this.length):\"string\"==typeof r&&(n=r,r=this.length),void 0!==n&&\"string\"!=typeof n)throw new TypeError(\"encoding must be a string\");if(\"string\"==typeof n&&!a.isEncoding(n))throw new TypeError(\"Unknown encoding: \"+n);if(1===t.length){const e=t.charCodeAt(0);(\"utf8\"===n&&e<128||\"latin1\"===n)&&(t=e)}}else\"number\"==typeof t?t&=255:\"boolean\"==typeof t&&(t=Number(t));if(e<0||this.length<e||this.length<r)throw new RangeError(\"Out of range index\");if(r<=e)return this;let i;if(e>>>=0,r=void 0===r?this.length:r>>>0,t||(t=0),\"number\"==typeof t)for(i=e;i<r;++i)this[i]=t;else{const o=a.isBuffer(t)?t:a.from(t,n),s=o.length;if(0===s)throw new TypeError('The value \"'+t+'\" is invalid for argument \"value\"');for(i=0;i<r-e;++i)this[i+e]=o[i%s]}return this};const C={};function W(t,e,r){C[t]=class extends r{constructor(){super(),Object.defineProperty(this,\"message\",{value:e.apply(this,arguments),writable:!0,configurable:!0}),this.name=`${this.name} [${t}]`,this.stack,delete this.name}get code(){return t}set code(t){Object.defineProperty(this,\"code\",{configurable:!0,enumerable:!0,value:t,writable:!0})}toString(){return`${this.name} [${t}]: ${this.message}`}}}function q(t){let e=\"\",r=t.length;const n=\"-\"===t[0]?1:0;for(;r>=n+4;r-=3)e=`_${t.slice(r-3,r)}${e}`;return`${t.slice(0,r)}${e}`}function F(t,e,r,n,i,o){if(t>r||t<e){const n=\"bigint\"==typeof e?\"n\":\"\";let i;throw i=o>3?0===e||e===BigInt(0)?`>= 0${n} and < 2${n} ** ${8*(o+1)}${n}`:`>= -(2${n} ** ${8*(o+1)-1}${n}) and < 2 ** ${8*(o+1)-1}${n}`:`>= ${e}${n} and <= ${r}${n}`,new C.ERR_OUT_OF_RANGE(\"value\",i,t)}!function(t,e,r){D(e,\"offset\"),void 0!==t[e]&&void 0!==t[e+r]||H(e,t.length-(r+1))}(n,i,o)}function D(t,e){if(\"number\"!=typeof t)throw new C.ERR_INVALID_ARG_TYPE(e,\"number\",t)}function H(t,e,r){if(Math.floor(t)!==t)throw D(t,r),new C.ERR_OUT_OF_RANGE(r||\"offset\",\"an integer\",t);if(e<0)throw new C.ERR_BUFFER_OUT_OF_BOUNDS;throw new C.ERR_OUT_OF_RANGE(r||\"offset\",`>= ${r?1:0} and <= ${e}`,t)}W(\"ERR_BUFFER_OUT_OF_BOUNDS\",(function(t){return t?`${t} is outside of buffer bounds`:\"Attempt to access memory outside buffer bounds\"}),RangeError),W(\"ERR_INVALID_ARG_TYPE\",(function(t,e){return`The \"${t}\" argument must be of type number. Received type ${typeof e}`}),TypeError),W(\"ERR_OUT_OF_RANGE\",(function(t,e,r){let n=`The value of \"${t}\" is out of range.`,i=r;return Number.isInteger(r)&&Math.abs(r)>2**32?i=q(String(r)):\"bigint\"==typeof r&&(i=String(r),(r>BigInt(2)**BigInt(32)||r<-(BigInt(2)**BigInt(32)))&&(i=q(i)),i+=\"n\"),n+=` It must be ${e}. Received ${i}`,n}),RangeError);const V=/[^+/0-9A-Za-z-_]/g;function K(t,e){let r;e=e||1/0;const n=t.length;let i=null;const o=[];for(let s=0;s<n;++s){if(r=t.charCodeAt(s),r>55295&&r<57344){if(!i){if(r>56319){(e-=3)>-1&&o.push(239,191,189);continue}if(s+1===n){(e-=3)>-1&&o.push(239,191,189);continue}i=r;continue}if(r<56320){(e-=3)>-1&&o.push(239,191,189),i=r;continue}r=65536+(i-55296<<10|r-56320)}else i&&(e-=3)>-1&&o.push(239,191,189);if(i=null,r<128){if((e-=1)<0)break;o.push(r)}else if(r<2048){if((e-=2)<0)break;o.push(r>>6|192,63&r|128)}else if(r<65536){if((e-=3)<0)break;o.push(r>>12|224,r>>6&63|128,63&r|128)}else{if(!(r<1114112))throw new Error(\"Invalid code point\");if((e-=4)<0)break;o.push(r>>18|240,r>>12&63|128,r>>6&63|128,63&r|128)}}return o}function $(t){return e.toByteArray(function(t){if((t=(t=t.split(\"=\")[0]).trim().replace(V,\"\")).length<2)return\"\";for(;t.length%4!=0;)t+=\"=\";return t}(t))}function Z(t,e,r,n){let i;for(i=0;i<n&&!(i+r>=e.length||i>=t.length);++i)e[i+r]=t[i];return i}function G(t,e){return t instanceof e||null!=t&&null!=t.constructor&&null!=t.constructor.name&&t.constructor.name===e.name}function Y(t){return t!=t}const J=function(){const t=\"0123456789abcdef\",e=new Array(256);for(let r=0;r<16;++r){const n=16*r;for(let i=0;i<16;++i)e[n+i]=t[r]+t[i]}return e}();function X(t){return\"undefined\"==typeof BigInt?Q:t}function Q(){throw new Error(\"BigInt not supported\")}}(n);const g=\"object\"==typeof globalThis&&\"crypto\"in globalThis?globalThis.crypto:void 0,m=t=>t instanceof Uint8Array,w=t=>new DataView(t.buffer,t.byteOffset,t.byteLength),b=(t,e)=>t<<32-e|t>>>e;\n/*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */if(!(68===new Uint8Array(new Uint32Array([287454020]).buffer)[0]))throw new Error(\"Non little-endian hardware is not supported\");function v(t){if(\"string\"!=typeof t)throw new Error(\"utf8ToBytes expected string, got \"+typeof t);return new Uint8Array((new TextEncoder).encode(t))}function x(t){if(\"string\"==typeof t&&(t=v(t)),!m(t))throw new Error(\"expected Uint8Array, got \"+typeof t);return t}function E(...t){const e=new Uint8Array(t.reduce(((t,e)=>t+e.length),0));let r=0;return t.forEach((t=>{if(!m(t))throw new Error(\"Uint8Array expected\");e.set(t,r),r+=t.length})),e}class B{clone(){return this._cloneInto()}}function S(t){const e=e=>t().update(x(e)).digest(),r=t();return e.outputLen=r.outputLen,e.blockLen=r.blockLen,e.create=()=>t(),e}function k(t=32){if(g&&\"function\"==typeof g.getRandomValues)return g.getRandomValues(new Uint8Array(t));throw new Error(\"crypto.getRandomValues must be defined\")}class M extends B{constructor(t,e,r,n){super(),this.blockLen=t,this.outputLen=e,this.padOffset=r,this.isLE=n,this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.buffer=new Uint8Array(t),this.view=w(this.buffer)}update(t){y(this);const{view:e,buffer:r,blockLen:n}=this,i=(t=x(t)).length;for(let o=0;o<i;){const s=Math.min(n-this.pos,i-o);if(s!==n)r.set(t.subarray(o,o+s),this.pos),this.pos+=s,o+=s,this.pos===n&&(this.process(e,0),this.pos=0);else{const e=w(t);for(;n<=i-o;o+=n)this.process(e,o)}}return this.length+=t.length,this.roundClean(),this}digestInto(t){y(this),function(t,e){p(t);const r=e.outputLen;if(t.length<r)throw new Error(`digestInto() expects output buffer of length at least ${r}`)}(t,this),this.finished=!0;const{buffer:e,view:r,blockLen:n,isLE:i}=this;let{pos:o}=this;e[o++]=128,this.buffer.subarray(o).fill(0),this.padOffset>n-o&&(this.process(r,0),o=0);for(let t=o;t<n;t++)e[t]=0;!function(t,e,r,n){if(\"function\"==typeof t.setBigUint64)return t.setBigUint64(e,r,n);const i=BigInt(32),o=BigInt(4294967295),s=Number(r>>i&o),a=Number(r&o),u=n?4:0,c=n?0:4;t.setUint32(e+u,s,n),t.setUint32(e+c,a,n)}(r,n-8,BigInt(8*this.length),i),this.process(r,0);const s=w(t),a=this.outputLen;if(a%4)throw new Error(\"_sha2: outputLen should be aligned to 32bit\");const u=a/4,c=this.get();if(u>c.length)throw new Error(\"_sha2: outputLen bigger than state\");for(let t=0;t<u;t++)s.setUint32(4*t,c[t],i)}digest(){const{buffer:t,outputLen:e}=this;this.digestInto(t);const r=t.slice(0,e);return this.destroy(),r}_cloneInto(t){t||(t=new this.constructor),t.set(...this.get());const{blockLen:e,buffer:r,length:n,finished:i,destroyed:o,pos:s}=this;return t.length=n,t.pos=s,t.finished=i,t.destroyed=o,n%e&&t.buffer.set(r),t}}const I=BigInt(2**32-1),_=BigInt(32);function A(t,e=!1){return e?{h:Number(t&I),l:Number(t>>_&I)}:{h:0|Number(t>>_&I),l:0|Number(t&I)}}const O={fromBig:A,split:function(t,e=!1){let r=new Uint32Array(t.length),n=new Uint32Array(t.length);for(let i=0;i<t.length;i++){const{h:o,l:s}=A(t[i],e);[r[i],n[i]]=[o,s]}return[r,n]},toBig:(t,e)=>BigInt(t>>>0)<<_|BigInt(e>>>0),shrSH:(t,e,r)=>t>>>r,shrSL:(t,e,r)=>t<<32-r|e>>>r,rotrSH:(t,e,r)=>t>>>r|e<<32-r,rotrSL:(t,e,r)=>t<<32-r|e>>>r,rotrBH:(t,e,r)=>t<<64-r|e>>>r-32,rotrBL:(t,e,r)=>t>>>r-32|e<<64-r,rotr32H:(t,e)=>e,rotr32L:(t,e)=>t,rotlSH:(t,e,r)=>t<<r|e>>>32-r,rotlSL:(t,e,r)=>e<<r|t>>>32-r,rotlBH:(t,e,r)=>e<<r-32|t>>>64-r,rotlBL:(t,e,r)=>t<<r-32|e>>>64-r,add:function(t,e,r,n){const i=(e>>>0)+(n>>>0);return{h:t+r+(i/2**32|0)|0,l:0|i}},add3L:(t,e,r)=>(t>>>0)+(e>>>0)+(r>>>0),add3H:(t,e,r,n)=>e+r+n+(t/2**32|0)|0,add4L:(t,e,r,n)=>(t>>>0)+(e>>>0)+(r>>>0)+(n>>>0),add4H:(t,e,r,n,i)=>e+r+n+i+(t/2**32|0)|0,add5H:(t,e,r,n,i,o)=>e+r+n+i+o+(t/2**32|0)|0,add5L:(t,e,r,n,i)=>(t>>>0)+(e>>>0)+(r>>>0)+(n>>>0)+(i>>>0)};var U=O;const[L,T]=(()=>U.split([\"0x428a2f98d728ae22\",\"0x7137449123ef65cd\",\"0xb5c0fbcfec4d3b2f\",\"0xe9b5dba58189dbbc\",\"0x3956c25bf348b538\",\"0x59f111f1b605d019\",\"0x923f82a4af194f9b\",\"0xab1c5ed5da6d8118\",\"0xd807aa98a3030242\",\"0x12835b0145706fbe\",\"0x243185be4ee4b28c\",\"0x550c7dc3d5ffb4e2\",\"0x72be5d74f27b896f\",\"0x80deb1fe3b1696b1\",\"0x9bdc06a725c71235\",\"0xc19bf174cf692694\",\"0xe49b69c19ef14ad2\",\"0xefbe4786384f25e3\",\"0x0fc19dc68b8cd5b5\",\"0x240ca1cc77ac9c65\",\"0x2de92c6f592b0275\",\"0x4a7484aa6ea6e483\",\"0x5cb0a9dcbd41fbd4\",\"0x76f988da831153b5\",\"0x983e5152ee66dfab\",\"0xa831c66d2db43210\",\"0xb00327c898fb213f\",\"0xbf597fc7beef0ee4\",\"0xc6e00bf33da88fc2\",\"0xd5a79147930aa725\",\"0x06ca6351e003826f\",\"0x142929670a0e6e70\",\"0x27b70a8546d22ffc\",\"0x2e1b21385c26c926\",\"0x4d2c6dfc5ac42aed\",\"0x53380d139d95b3df\",\"0x650a73548baf63de\",\"0x766a0abb3c77b2a8\",\"0x81c2c92e47edaee6\",\"0x92722c851482353b\",\"0xa2bfe8a14cf10364\",\"0xa81a664bbc423001\",\"0xc24b8b70d0f89791\",\"0xc76c51a30654be30\",\"0xd192e819d6ef5218\",\"0xd69906245565a910\",\"0xf40e35855771202a\",\"0x106aa07032bbd1b8\",\"0x19a4c116b8d2d0c8\",\"0x1e376c085141ab53\",\"0x2748774cdf8eeb99\",\"0x34b0bcb5e19b48a8\",\"0x391c0cb3c5c95a63\",\"0x4ed8aa4ae3418acb\",\"0x5b9cca4f7763e373\",\"0x682e6ff3d6b2b8a3\",\"0x748f82ee5defb2fc\",\"0x78a5636f43172f60\",\"0x84c87814a1f0ab72\",\"0x8cc702081a6439ec\",\"0x90befffa23631e28\",\"0xa4506cebde82bde9\",\"0xbef9a3f7b2c67915\",\"0xc67178f2e372532b\",\"0xca273eceea26619c\",\"0xd186b8c721c0c207\",\"0xeada7dd6cde0eb1e\",\"0xf57d4f7fee6ed178\",\"0x06f067aa72176fba\",\"0x0a637dc5a2c898a6\",\"0x113f9804bef90dae\",\"0x1b710b35131c471b\",\"0x28db77f523047d84\",\"0x32caab7b40c72493\",\"0x3c9ebe0a15c9bebc\",\"0x431d67c49c100d4c\",\"0x4cc5d4becb3e42b6\",\"0x597f299cfc657e2a\",\"0x5fcb6fab3ad6faec\",\"0x6c44198c4a475817\"].map((t=>BigInt(t)))))(),P=new Uint32Array(80),R=new Uint32Array(80);class j extends M{constructor(){super(128,64,16,!1),this.Ah=1779033703,this.Al=-205731576,this.Bh=-1150833019,this.Bl=-2067093701,this.Ch=1013904242,this.Cl=-23791573,this.Dh=-1521486534,this.Dl=1595750129,this.Eh=1359893119,this.El=-1377402159,this.Fh=-1694144372,this.Fl=725511199,this.Gh=528734635,this.Gl=-79577749,this.Hh=1541459225,this.Hl=327033209}get(){const{Ah:t,Al:e,Bh:r,Bl:n,Ch:i,Cl:o,Dh:s,Dl:a,Eh:u,El:c,Fh:h,Fl:f,Gh:l,Gl:d,Hh:p,Hl:y}=this;return[t,e,r,n,i,o,s,a,u,c,h,f,l,d,p,y]}set(t,e,r,n,i,o,s,a,u,c,h,f,l,d,p,y){this.Ah=0|t,this.Al=0|e,this.Bh=0|r,this.Bl=0|n,this.Ch=0|i,this.Cl=0|o,this.Dh=0|s,this.Dl=0|a,this.Eh=0|u,this.El=0|c,this.Fh=0|h,this.Fl=0|f,this.Gh=0|l,this.Gl=0|d,this.Hh=0|p,this.Hl=0|y}process(t,e){for(let r=0;r<16;r++,e+=4)P[r]=t.getUint32(e),R[r]=t.getUint32(e+=4);for(let t=16;t<80;t++){const e=0|P[t-15],r=0|R[t-15],n=U.rotrSH(e,r,1)^U.rotrSH(e,r,8)^U.shrSH(e,r,7),i=U.rotrSL(e,r,1)^U.rotrSL(e,r,8)^U.shrSL(e,r,7),o=0|P[t-2],s=0|R[t-2],a=U.rotrSH(o,s,19)^U.rotrBH(o,s,61)^U.shrSH(o,s,6),u=U.rotrSL(o,s,19)^U.rotrBL(o,s,61)^U.shrSL(o,s,6),c=U.add4L(i,u,R[t-7],R[t-16]),h=U.add4H(c,n,a,P[t-7],P[t-16]);P[t]=0|h,R[t]=0|c}let{Ah:r,Al:n,Bh:i,Bl:o,Ch:s,Cl:a,Dh:u,Dl:c,Eh:h,El:f,Fh:l,Fl:d,Gh:p,Gl:y,Hh:g,Hl:m}=this;for(let t=0;t<80;t++){const e=U.rotrSH(h,f,14)^U.rotrSH(h,f,18)^U.rotrBH(h,f,41),w=U.rotrSL(h,f,14)^U.rotrSL(h,f,18)^U.rotrBL(h,f,41),b=h&l^~h&p,v=f&d^~f&y,x=U.add5L(m,w,v,T[t],R[t]),E=U.add5H(x,g,e,b,L[t],P[t]),B=0|x,S=U.rotrSH(r,n,28)^U.rotrBH(r,n,34)^U.rotrBH(r,n,39),k=U.rotrSL(r,n,28)^U.rotrBL(r,n,34)^U.rotrBL(r,n,39),M=r&i^r&s^i&s,I=n&o^n&a^o&a;g=0|p,m=0|y,p=0|l,y=0|d,l=0|h,d=0|f,({h:h,l:f}=U.add(0|u,0|c,0|E,0|B)),u=0|s,c=0|a,s=0|i,a=0|o,i=0|r,o=0|n;const _=U.add3L(B,k,I);r=U.add3H(_,E,S,M),n=0|_}({h:r,l:n}=U.add(0|this.Ah,0|this.Al,0|r,0|n)),({h:i,l:o}=U.add(0|this.Bh,0|this.Bl,0|i,0|o)),({h:s,l:a}=U.add(0|this.Ch,0|this.Cl,0|s,0|a)),({h:u,l:c}=U.add(0|this.Dh,0|this.Dl,0|u,0|c)),({h:h,l:f}=U.add(0|this.Eh,0|this.El,0|h,0|f)),({h:l,l:d}=U.add(0|this.Fh,0|this.Fl,0|l,0|d)),({h:p,l:y}=U.add(0|this.Gh,0|this.Gl,0|p,0|y)),({h:g,l:m}=U.add(0|this.Hh,0|this.Hl,0|g,0|m)),this.set(r,n,i,o,s,a,u,c,h,f,l,d,p,y,g,m)}roundClean(){P.fill(0),R.fill(0)}destroy(){this.buffer.fill(0),this.set(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0)}}const N=S((()=>new j)),z=BigInt(0),C=BigInt(1),W=BigInt(2),q=t=>t instanceof Uint8Array,F=Array.from({length:256},((t,e)=>e.toString(16).padStart(2,\"0\")));\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */function D(t){if(!q(t))throw new Error(\"Uint8Array expected\");let e=\"\";for(let r=0;r<t.length;r++)e+=F[t[r]];return e}function H(t){const e=t.toString(16);return 1&e.length?`0${e}`:e}function V(t){if(\"string\"!=typeof t)throw new Error(\"hex string expected, got \"+typeof t);return BigInt(\"\"===t?\"0\":`0x${t}`)}function K(t){if(\"string\"!=typeof t)throw new Error(\"hex string expected, got \"+typeof t);const e=t.length;if(e%2)throw new Error(\"padded hex string expected, got unpadded hex of length \"+e);const r=new Uint8Array(e/2);for(let e=0;e<r.length;e++){const n=2*e,i=t.slice(n,n+2),o=Number.parseInt(i,16);if(Number.isNaN(o)||o<0)throw new Error(\"Invalid byte sequence\");r[e]=o}return r}function $(t){return V(D(t))}function Z(t){if(!q(t))throw new Error(\"Uint8Array expected\");return V(D(Uint8Array.from(t).reverse()))}function G(t,e){return K(t.toString(16).padStart(2*e,\"0\"))}function Y(t,e){return G(t,e).reverse()}function J(t,e,r){let n;if(\"string\"==typeof e)try{n=K(e)}catch(r){throw new Error(`${t} must be valid hex string, got \"${e}\". Cause: ${r}`)}else{if(!q(e))throw new Error(`${t} must be hex string or Uint8Array`);n=Uint8Array.from(e)}const i=n.length;if(\"number\"==typeof r&&i!==r)throw new Error(`${t} expected ${r} bytes, got ${i}`);return n}function X(...t){const e=new Uint8Array(t.reduce(((t,e)=>t+e.length),0));let r=0;return t.forEach((t=>{if(!q(t))throw new Error(\"Uint8Array expected\");e.set(t,r),r+=t.length})),e}const Q=t=>(W<<BigInt(t-1))-C,tt=t=>new Uint8Array(t),et=t=>Uint8Array.from(t);function rt(t,e,r){if(\"number\"!=typeof t||t<2)throw new Error(\"hashLen must be a number\");if(\"number\"!=typeof e||e<2)throw new Error(\"qByteLen must be a number\");if(\"function\"!=typeof r)throw new Error(\"hmacFn must be a function\");let n=tt(t),i=tt(t),o=0;const s=()=>{n.fill(1),i.fill(0),o=0},a=(...t)=>r(i,n,...t),u=(t=tt())=>{i=a(et([0]),t),n=a(),0!==t.length&&(i=a(et([1]),t),n=a())},c=()=>{if(o++>=1e3)throw new Error(\"drbg: tried 1000 values\");let t=0;const r=[];for(;t<e;){n=a();const e=n.slice();r.push(e),t+=n.length}return X(...r)};return(t,e)=>{let r;for(s(),u(t);!(r=e(c()));)u();return s(),r}}const nt={bigint:t=>\"bigint\"==typeof t,function:t=>\"function\"==typeof t,boolean:t=>\"boolean\"==typeof t,string:t=>\"string\"==typeof t,stringOrUint8Array:t=>\"string\"==typeof t||t instanceof Uint8Array,isSafeInteger:t=>Number.isSafeInteger(t),array:t=>Array.isArray(t),field:(t,e)=>e.Fp.isValid(t),hash:t=>\"function\"==typeof t&&Number.isSafeInteger(t.outputLen)};function it(t,e,r={}){const n=(e,r,n)=>{const i=nt[r];if(\"function\"!=typeof i)throw new Error(`Invalid validator \"${r}\", expected function`);const o=t[e];if(!(n&&void 0===o||i(o,t)))throw new Error(`Invalid param ${String(e)}=${o} (${typeof o}), expected ${r}`)};for(const[t,r]of Object.entries(e))n(t,r,!1);for(const[t,e]of Object.entries(r))n(t,e,!0);return t}var ot=Object.freeze({__proto__:null,bytesToHex:D,numberToHexUnpadded:H,hexToNumber:V,hexToBytes:K,bytesToNumberBE:$,bytesToNumberLE:Z,numberToBytesBE:G,numberToBytesLE:Y,numberToVarBytesBE:function(t){return K(H(t))},ensureBytes:J,concatBytes:X,equalBytes:function(t,e){if(t.length!==e.length)return!1;for(let r=0;r<t.length;r++)if(t[r]!==e[r])return!1;return!0},utf8ToBytes:function(t){if(\"string\"!=typeof t)throw new Error(\"utf8ToBytes expected string, got \"+typeof t);return new Uint8Array((new TextEncoder).encode(t))},bitLen:function(t){let e;for(e=0;t>z;t>>=C,e+=1);return e},bitGet:function(t,e){return t>>BigInt(e)&C},bitSet:(t,e,r)=>t|(r?C:z)<<BigInt(e),bitMask:Q,createHmacDrbg:rt,validateObject:it});\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const st=BigInt(0),at=BigInt(1),ut=BigInt(2),ct=BigInt(3),ht=BigInt(4),ft=BigInt(5),lt=BigInt(8);function dt(t,e){const r=t%e;return r>=st?r:e+r}function pt(t,e,r){if(r<=st||e<st)throw new Error(\"Expected power/modulo > 0\");if(r===at)return st;let n=at;for(;e>st;)e&at&&(n=n*t%r),t=t*t%r,e>>=at;return n}function yt(t,e,r){let n=t;for(;e-- >st;)n*=n,n%=r;return n}function gt(t,e){if(t===st||e<=st)throw new Error(`invert: expected positive integers, got n=${t} mod=${e}`);let r=dt(t,e),n=e,i=st,o=at;for(;r!==st;){const t=n%r,e=i-o*(n/r);n=r,r=t,i=o,o=e}if(n!==at)throw new Error(\"invert: does not exist\");return dt(i,e)}function mt(t){if(t%ht===ct){const e=(t+at)/ht;return function(t,r){const n=t.pow(r,e);if(!t.eql(t.sqr(n),r))throw new Error(\"Cannot find square root\");return n}}if(t%lt===ft){const e=(t-ft)/lt;return function(t,r){const n=t.mul(r,ut),i=t.pow(n,e),o=t.mul(r,i),s=t.mul(t.mul(o,ut),i),a=t.mul(o,t.sub(s,t.ONE));if(!t.eql(t.sqr(a),r))throw new Error(\"Cannot find square root\");return a}}return function(t){const e=(t-at)/ut;let r,n,i;for(r=t-at,n=0;r%ut===st;r/=ut,n++);for(i=ut;i<t&&pt(i,e,t)!==t-at;i++);if(1===n){const e=(t+at)/ht;return function(t,r){const n=t.pow(r,e);if(!t.eql(t.sqr(n),r))throw new Error(\"Cannot find square root\");return n}}const o=(r+at)/ut;return function(t,s){if(t.pow(s,e)===t.neg(t.ONE))throw new Error(\"Cannot find square root\");let a=n,u=t.pow(t.mul(t.ONE,i),r),c=t.pow(s,o),h=t.pow(s,r);for(;!t.eql(h,t.ONE);){if(t.eql(h,t.ZERO))return t.ZERO;let e=1;for(let r=t.sqr(h);e<a&&!t.eql(r,t.ONE);e++)r=t.sqr(r);const r=t.pow(u,at<<BigInt(a-e-1));u=t.sqr(r),c=t.mul(c,r),h=t.mul(h,u),a=e}return c}}(t)}BigInt(9),BigInt(16);const wt=[\"create\",\"isValid\",\"is0\",\"neg\",\"inv\",\"sqrt\",\"sqr\",\"eql\",\"add\",\"sub\",\"mul\",\"pow\",\"div\",\"addN\",\"subN\",\"mulN\",\"sqrN\"];function bt(t,e){const r=void 0!==e?e:t.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function vt(t,e,r=!1,n={}){if(t<=st)throw new Error(`Expected Field ORDER > 0, got ${t}`);const{nBitLength:i,nByteLength:o}=bt(t,e);if(o>2048)throw new Error(\"Field lengths over 2048 bytes are not supported\");const s=mt(t),a=Object.freeze({ORDER:t,BITS:i,BYTES:o,MASK:Q(i),ZERO:st,ONE:at,create:e=>dt(e,t),isValid:e=>{if(\"bigint\"!=typeof e)throw new Error(\"Invalid field element: expected bigint, got \"+typeof e);return st<=e&&e<t},is0:t=>t===st,isOdd:t=>(t&at)===at,neg:e=>dt(-e,t),eql:(t,e)=>t===e,sqr:e=>dt(e*e,t),add:(e,r)=>dt(e+r,t),sub:(e,r)=>dt(e-r,t),mul:(e,r)=>dt(e*r,t),pow:(t,e)=>function(t,e,r){if(r<st)throw new Error(\"Expected power > 0\");if(r===st)return t.ONE;if(r===at)return e;let n=t.ONE,i=e;for(;r>st;)r&at&&(n=t.mul(n,i)),i=t.sqr(i),r>>=at;return n}(a,t,e),div:(e,r)=>dt(e*gt(r,t),t),sqrN:t=>t*t,addN:(t,e)=>t+e,subN:(t,e)=>t-e,mulN:(t,e)=>t*e,inv:e=>gt(e,t),sqrt:n.sqrt||(t=>s(a,t)),invertBatch:t=>function(t,e){const r=new Array(e.length),n=e.reduce(((e,n,i)=>t.is0(n)?e:(r[i]=e,t.mul(e,n))),t.ONE),i=t.inv(n);return e.reduceRight(((e,n,i)=>t.is0(n)?e:(r[i]=t.mul(e,r[i]),t.mul(e,n))),i),r}(a,t),cmov:(t,e,r)=>r?e:t,toBytes:t=>r?Y(t,o):G(t,o),fromBytes:t=>{if(t.length!==o)throw new Error(`Fp.fromBytes: expected ${o}, got ${t.length}`);return r?Z(t):$(t)}});return Object.freeze(a)}function xt(t){if(\"bigint\"!=typeof t)throw new Error(\"field order must be bigint\");const e=t.toString(2).length;return Math.ceil(e/8)}function Et(t){const e=xt(t);return e+Math.ceil(e/2)}\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nconst Bt=BigInt(0),St=BigInt(1);function kt(t,e){const r=(t,e)=>{const r=e.negate();return t?r:e},n=t=>({windows:Math.ceil(e/t)+1,windowSize:2**(t-1)});return{constTimeNegate:r,unsafeLadder(e,r){let n=t.ZERO,i=e;for(;r>Bt;)r&St&&(n=n.add(i)),i=i.double(),r>>=St;return n},precomputeWindow(t,e){const{windows:r,windowSize:i}=n(e),o=[];let s=t,a=s;for(let t=0;t<r;t++){a=s,o.push(a);for(let t=1;t<i;t++)a=a.add(s),o.push(a);s=a.double()}return o},wNAF(e,i,o){const{windows:s,windowSize:a}=n(e);let u=t.ZERO,c=t.BASE;const h=BigInt(2**e-1),f=2**e,l=BigInt(e);for(let t=0;t<s;t++){const e=t*a;let n=Number(o&h);o>>=l,n>a&&(n-=f,o+=St);const s=e,d=e+Math.abs(n)-1,p=t%2!=0,y=n<0;0===n?c=c.add(r(p,i[s])):u=u.add(r(y,i[d]))}return{p:u,f:c}},wNAFCached(t,e,r,n){const i=t._WINDOW_SIZE||1;let o=e.get(t);return o||(o=this.precomputeWindow(t,i),1!==i&&e.set(t,n(o))),this.wNAF(i,o,r)}}}function Mt(t){return it(t.Fp,wt.reduce(((t,e)=>(t[e]=\"function\",t)),{ORDER:\"bigint\",MASK:\"bigint\",BYTES:\"isSafeInteger\",BITS:\"isSafeInteger\"})),it(t,{n:\"bigint\",h:\"bigint\",Gx:\"field\",Gy:\"field\"},{nBitLength:\"isSafeInteger\",nByteLength:\"isSafeInteger\"}),Object.freeze({...bt(t.n,t.nBitLength),...t,p:t.Fp.ORDER})}\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const It=BigInt(0),_t=BigInt(1),At=BigInt(2),Ot=BigInt(8),Ut={zip215:!0};function Lt(t){const e=function(t){const e=Mt(t);return it(t,{hash:\"function\",a:\"bigint\",d:\"bigint\",randomBytes:\"function\"},{adjustScalarBytes:\"function\",domain:\"function\",uvRatio:\"function\",mapToCurve:\"function\"}),Object.freeze({...e})}(t),{Fp:r,n:n,prehash:i,hash:o,randomBytes:s,nByteLength:a,h:u}=e,c=At<<BigInt(8*a)-_t,h=r.create,f=e.uvRatio||((t,e)=>{try{return{isValid:!0,value:r.sqrt(t*r.inv(e))}}catch(t){return{isValid:!1,value:It}}}),l=e.adjustScalarBytes||(t=>t),d=e.domain||((t,e,r)=>{if(e.length||r)throw new Error(\"Contexts/pre-hash are not supported\");return t}),p=t=>\"bigint\"==typeof t&&It<t,y=(t,e)=>p(t)&&p(e)&&t<e,g=t=>t===It||y(t,c);function m(t,e){if(y(t,e))return t;throw new Error(`Expected valid scalar < ${e}, got ${typeof t} ${t}`)}function w(t){return t===It?t:m(t,n)}const b=new Map;function v(t){if(!(t instanceof x))throw new Error(\"ExtendedPoint expected\")}class x{constructor(t,e,r,n){if(this.ex=t,this.ey=e,this.ez=r,this.et=n,!g(t))throw new Error(\"x required\");if(!g(e))throw new Error(\"y required\");if(!g(r))throw new Error(\"z required\");if(!g(n))throw new Error(\"t required\")}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static fromAffine(t){if(t instanceof x)throw new Error(\"extended point not allowed\");const{x:e,y:r}=t||{};if(!g(e)||!g(r))throw new Error(\"invalid affine point\");return new x(e,r,_t,h(e*r))}static normalizeZ(t){const e=r.invertBatch(t.map((t=>t.ez)));return t.map(((t,r)=>t.toAffine(e[r]))).map(x.fromAffine)}_setWindowSize(t){this._WINDOW_SIZE=t,b.delete(this)}assertValidity(){const{a:t,d:r}=e;if(this.is0())throw new Error(\"bad point: ZERO\");const{ex:n,ey:i,ez:o,et:s}=this,a=h(n*n),u=h(i*i),c=h(o*o),f=h(c*c),l=h(a*t);if(h(c*h(l+u))!==h(f+h(r*h(a*u))))throw new Error(\"bad point: equation left != right (1)\");if(h(n*i)!==h(o*s))throw new Error(\"bad point: equation left != right (2)\")}equals(t){v(t);const{ex:e,ey:r,ez:n}=this,{ex:i,ey:o,ez:s}=t,a=h(e*s),u=h(i*n),c=h(r*s),f=h(o*n);return a===u&&c===f}is0(){return this.equals(x.ZERO)}negate(){return new x(h(-this.ex),this.ey,this.ez,h(-this.et))}double(){const{a:t}=e,{ex:r,ey:n,ez:i}=this,o=h(r*r),s=h(n*n),a=h(At*h(i*i)),u=h(t*o),c=r+n,f=h(h(c*c)-o-s),l=u+s,d=l-a,p=u-s,y=h(f*d),g=h(l*p),m=h(f*p),w=h(d*l);return new x(y,g,w,m)}add(t){v(t);const{a:r,d:n}=e,{ex:i,ey:o,ez:s,et:a}=this,{ex:u,ey:c,ez:f,et:l}=t;if(r===BigInt(-1)){const t=h((o-i)*(c+u)),e=h((o+i)*(c-u)),r=h(e-t);if(r===It)return this.double();const n=h(s*At*l),d=h(a*At*f),p=d+n,y=e+t,g=d-n,m=h(p*r),w=h(y*g),b=h(p*g),v=h(r*y);return new x(m,w,v,b)}const d=h(i*u),p=h(o*c),y=h(a*n*l),g=h(s*f),m=h((i+o)*(u+c)-d-p),w=g-y,b=g+y,E=h(p-r*d),B=h(m*w),S=h(b*E),k=h(m*E),M=h(w*b);return new x(B,S,M,k)}subtract(t){return this.add(t.negate())}wNAF(t){return S.wNAFCached(this,b,t,x.normalizeZ)}multiply(t){const{p:e,f:r}=this.wNAF(m(t,n));return x.normalizeZ([e,r])[0]}multiplyUnsafe(t){let e=w(t);return e===It?B:this.equals(B)||e===_t?this:this.equals(E)?this.wNAF(e).p:S.unsafeLadder(this,e)}isSmallOrder(){return this.multiplyUnsafe(u).is0()}isTorsionFree(){return S.unsafeLadder(this,n).is0()}toAffine(t){const{ex:e,ey:n,ez:i}=this,o=this.is0();null==t&&(t=o?Ot:r.inv(i));const s=h(e*t),a=h(n*t),u=h(i*t);if(o)return{x:It,y:_t};if(u!==_t)throw new Error(\"invZ was invalid\");return{x:s,y:a}}clearCofactor(){const{h:t}=e;return t===_t?this:this.multiplyUnsafe(t)}static fromHex(t,n=!1){const{d:i,a:o}=e,s=r.BYTES,a=(t=J(\"pointHex\",t,s)).slice(),u=t[s-1];a[s-1]=-129&u;const l=Z(a);l===It||m(l,n?c:r.ORDER);const d=h(l*l),p=h(d-_t),y=h(i*d-o);let{isValid:g,value:w}=f(p,y);if(!g)throw new Error(\"Point.fromHex: invalid y coordinate\");const b=(w&_t)===_t,v=0!=(128&u);if(!n&&w===It&&v)throw new Error(\"Point.fromHex: x=0 and x_0=1\");return v!==b&&(w=h(-w)),x.fromAffine({x:w,y:l})}static fromPrivateKey(t){return I(t).point}toRawBytes(){const{x:t,y:e}=this.toAffine(),n=Y(e,r.BYTES);return n[n.length-1]|=t&_t?128:0,n}toHex(){return D(this.toRawBytes())}}x.BASE=new x(e.Gx,e.Gy,_t,h(e.Gx*e.Gy)),x.ZERO=new x(It,_t,_t,It);const{BASE:E,ZERO:B}=x,S=kt(x,8*a);function k(t){return dt(t,n)}function M(t){return k(Z(t))}function I(t){const e=a;t=J(\"private key\",t,e);const r=J(\"hashed private key\",o(t),2*e),n=l(r.slice(0,e)),i=r.slice(e,2*e),s=M(n),u=E.multiply(s),c=u.toRawBytes();return{head:n,prefix:i,scalar:s,point:u,pointBytes:c}}function _(t=new Uint8Array,...e){const r=X(...e);return M(o(d(r,J(\"context\",t),!!i)))}const A=Ut;E._setWindowSize(8);return{CURVE:e,getPublicKey:function(t){return I(t).pointBytes},sign:function(t,e,n={}){t=J(\"message\",t),i&&(t=i(t));const{prefix:o,scalar:s,pointBytes:u}=I(e),c=_(n.context,o,t),h=E.multiply(c).toRawBytes(),f=k(c+_(n.context,h,u,t)*s);return w(f),J(\"result\",X(h,Y(f,r.BYTES)),2*a)},verify:function(t,e,n,o=A){const{context:s,zip215:a}=o,u=r.BYTES;t=J(\"signature\",t,2*u),e=J(\"message\",e),i&&(e=i(e));const c=Z(t.slice(u,2*u));let h,f,l;try{h=x.fromHex(n,a),f=x.fromHex(t.slice(0,u),a),l=E.multiplyUnsafe(c)}catch(t){return!1}if(!a&&h.isSmallOrder())return!1;const d=_(s,f.toRawBytes(),h.toRawBytes(),e);return f.add(h.multiplyUnsafe(d)).subtract(l).clearCofactor().equals(x.ZERO)},ExtendedPoint:x,utils:{getExtendedPublicKey:I,randomPrivateKey:()=>s(r.BYTES),precompute:(t=8,e=x.BASE)=>(e._setWindowSize(t),e.multiply(BigInt(3)),e)}}}\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */const Tt=BigInt(\"57896044618658097711785492504343953926634992332820282019728792003956564819949\"),Pt=BigInt(\"19681161376707505956807079304988542015446066515923890162744021073123829784752\");BigInt(0);const Rt=BigInt(1),jt=BigInt(2),Nt=BigInt(5),zt=BigInt(10),Ct=BigInt(20),Wt=BigInt(40),qt=BigInt(80);const Ft=vt(Tt,void 0,!0),Dt={a:BigInt(-1),d:BigInt(\"37095705934669439343138083508754565189542113879843219016388785533085940283555\"),Fp:Ft,n:BigInt(\"7237005577332262213973186563042994240857116359379907606001950938285454250989\"),h:BigInt(8),Gx:BigInt(\"15112221349535400772501151409588531511454012693041857206046113283949847762202\"),Gy:BigInt(\"46316835694926478169428394003475163141307993866256225615783033603165251855960\"),hash:N,randomBytes:k,adjustScalarBytes:function(t){return t[0]&=248,t[31]&=127,t[31]|=64,t},uvRatio:function(t,e){const r=Tt,n=dt(e*e*e,r),i=function(t){const e=Tt,r=t*t%e*t%e,n=yt(r,jt,e)*r%e,i=yt(n,Rt,e)*t%e,o=yt(i,Nt,e)*i%e,s=yt(o,zt,e)*o%e,a=yt(s,Ct,e)*s%e,u=yt(a,Wt,e)*a%e,c=yt(u,qt,e)*u%e,h=yt(c,qt,e)*u%e,f=yt(h,zt,e)*o%e;return{pow_p_5_8:yt(f,jt,e)*t%e,b2:r}}(t*dt(n*n*e,r)).pow_p_5_8;let o=dt(t*n*i,r);const s=dt(e*o*o,r),a=o,u=dt(o*Pt,r),c=s===t,h=s===dt(-t,r),f=s===dt(-t*Pt,r);return c&&(o=a),(h||f)&&(o=u),(dt(o,r)&at)===at&&(o=dt(-o,r)),{isValid:c||h,value:o}}},Ht=Lt(Dt);const Vt=(Ft.ORDER+BigInt(3))/BigInt(8);Ft.pow(jt,Vt),Ft.sqrt(Ft.neg(Ft.ONE)),Ft.ORDER,BigInt(5),BigInt(8),BigInt(486662),function(t,e){if(!t.isOdd)throw new Error(\"Field doesn't have isOdd\");const r=t.sqrt(e);t.isOdd(r)&&t.neg(r)}(Ft,Ft.neg(BigInt(486664))),BigInt(\"25063068953384623474111414158702152701244531502492656460079210482610430750235\"),BigInt(\"54469307008909316920995813868745141605393597292927456921205312896311721017578\"),BigInt(\"1159843021668779879193775521855586647937357759715417654439879720876111806838\"),BigInt(\"40440834346308536858101042469323190826248399146238708352240133220865137265952\"),BigInt(\"0x7fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff\");var Kt={exports:{}},$t=r(Object.freeze({__proto__:null,default:{}}));!function(t,e){function r(t,e){if(!t)throw new Error(e||\"Assertion failed\")}function n(t,e){t.super_=e;var r=function(){};r.prototype=e.prototype,t.prototype=new r,t.prototype.constructor=t}function i(t,e,r){if(i.isBN(t))return t;this.negative=0,this.words=null,this.length=0,this.red=null,null!==t&&(\"le\"!==e&&\"be\"!==e||(r=e,e=10),this._init(t||0,e||10,r||\"be\"))}var o;\"object\"==typeof t?t.exports=i:e.BN=i,i.BN=i,i.wordSize=26;try{o=\"undefined\"!=typeof window&&void 0!==window.Buffer?window.Buffer:$t.Buffer}catch(t){}function s(t,e){var n=t.charCodeAt(e);return n>=48&&n<=57?n-48:n>=65&&n<=70?n-55:n>=97&&n<=102?n-87:void r(!1,\"Invalid character in \"+t)}function a(t,e,r){var n=s(t,r);return r-1>=e&&(n|=s(t,r-1)<<4),n}function u(t,e,n,i){for(var o=0,s=0,a=Math.min(t.length,n),u=e;u<a;u++){var c=t.charCodeAt(u)-48;o*=i,s=c>=49?c-49+10:c>=17?c-17+10:c,r(c>=0&&s<i,\"Invalid character\"),o+=s}return o}function c(t,e){t.words=e.words,t.length=e.length,t.negative=e.negative,t.red=e.red}if(i.isBN=function(t){return t instanceof i||null!==t&&\"object\"==typeof t&&t.constructor.wordSize===i.wordSize&&Array.isArray(t.words)},i.max=function(t,e){return t.cmp(e)>0?t:e},i.min=function(t,e){return t.cmp(e)<0?t:e},i.prototype._init=function(t,e,n){if(\"number\"==typeof t)return this._initNumber(t,e,n);if(\"object\"==typeof t)return this._initArray(t,e,n);\"hex\"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var i=0;\"-\"===(t=t.toString().replace(/\\s+/g,\"\"))[0]&&(i++,this.negative=1),i<t.length&&(16===e?this._parseHex(t,i,n):(this._parseBase(t,e,i),\"le\"===n&&this._initArray(this.toArray(),e,n)))},i.prototype._initNumber=function(t,e,n){t<0&&(this.negative=1,t=-t),t<67108864?(this.words=[67108863&t],this.length=1):t<4503599627370496?(this.words=[67108863&t,t/67108864&67108863],this.length=2):(r(t<9007199254740992),this.words=[67108863&t,t/67108864&67108863,1],this.length=3),\"le\"===n&&this._initArray(this.toArray(),e,n)},i.prototype._initArray=function(t,e,n){if(r(\"number\"==typeof t.length),t.length<=0)return this.words=[0],this.length=1,this;this.length=Math.ceil(t.length/3),this.words=new Array(this.length);for(var i=0;i<this.length;i++)this.words[i]=0;var o,s,a=0;if(\"be\"===n)for(i=t.length-1,o=0;i>=0;i-=3)s=t[i]|t[i-1]<<8|t[i-2]<<16,this.words[o]|=s<<a&67108863,this.words[o+1]=s>>>26-a&67108863,(a+=24)>=26&&(a-=26,o++);else if(\"le\"===n)for(i=0,o=0;i<t.length;i+=3)s=t[i]|t[i+1]<<8|t[i+2]<<16,this.words[o]|=s<<a&67108863,this.words[o+1]=s>>>26-a&67108863,(a+=24)>=26&&(a-=26,o++);return this._strip()},i.prototype._parseHex=function(t,e,r){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var n=0;n<this.length;n++)this.words[n]=0;var i,o=0,s=0;if(\"be\"===r)for(n=t.length-1;n>=e;n-=2)i=a(t,e,n)<<o,this.words[s]|=67108863&i,o>=18?(o-=18,s+=1,this.words[s]|=i>>>26):o+=8;else for(n=(t.length-e)%2==0?e+1:e;n<t.length;n+=2)i=a(t,e,n)<<o,this.words[s]|=67108863&i,o>=18?(o-=18,s+=1,this.words[s]|=i>>>26):o+=8;this._strip()},i.prototype._parseBase=function(t,e,r){this.words=[0],this.length=1;for(var n=0,i=1;i<=67108863;i*=e)n++;n--,i=i/e|0;for(var o=t.length-r,s=o%n,a=Math.min(o,o-s)+r,c=0,h=r;h<a;h+=n)c=u(t,h,h+n,e),this.imuln(i),this.words[0]+c<67108864?this.words[0]+=c:this._iaddn(c);if(0!==s){var f=1;for(c=u(t,h,t.length,e),h=0;h<s;h++)f*=e;this.imuln(f),this.words[0]+c<67108864?this.words[0]+=c:this._iaddn(c)}this._strip()},i.prototype.copy=function(t){t.words=new Array(this.length);for(var e=0;e<this.length;e++)t.words[e]=this.words[e];t.length=this.length,t.negative=this.negative,t.red=this.red},i.prototype._move=function(t){c(t,this)},i.prototype.clone=function(){var t=new i(null);return this.copy(t),t},i.prototype._expand=function(t){for(;this.length<t;)this.words[this.length++]=0;return this},i.prototype._strip=function(){for(;this.length>1&&0===this.words[this.length-1];)this.length--;return this._normSign()},i.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},\"undefined\"!=typeof Symbol&&\"function\"==typeof Symbol.for)try{i.prototype[Symbol.for(\"nodejs.util.inspect.custom\")]=h}catch(t){i.prototype.inspect=h}else i.prototype.inspect=h;function h(){return(this.red?\"<BN-R: \":\"<BN: \")+this.toString(16)+\">\"}var f=[\"\",\"0\",\"00\",\"000\",\"0000\",\"00000\",\"000000\",\"0000000\",\"00000000\",\"000000000\",\"0000000000\",\"00000000000\",\"000000000000\",\"0000000000000\",\"00000000000000\",\"000000000000000\",\"0000000000000000\",\"00000000000000000\",\"000000000000000000\",\"0000000000000000000\",\"00000000000000000000\",\"000000000000000000000\",\"0000000000000000000000\",\"00000000000000000000000\",\"000000000000000000000000\",\"0000000000000000000000000\"],l=[0,0,25,16,12,11,10,9,8,8,7,7,7,7,6,6,6,6,6,6,6,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function p(t,e,r){r.negative=e.negative^t.negative;var n=t.length+e.length|0;r.length=n,n=n-1|0;var i=0|t.words[0],o=0|e.words[0],s=i*o,a=67108863&s,u=s/67108864|0;r.words[0]=a;for(var c=1;c<n;c++){for(var h=u>>>26,f=67108863&u,l=Math.min(c,e.length-1),d=Math.max(0,c-t.length+1);d<=l;d++){var p=c-d|0;h+=(s=(i=0|t.words[p])*(o=0|e.words[d])+f)/67108864|0,f=67108863&s}r.words[c]=0|f,u=0|h}return 0!==u?r.words[c]=0|u:r.length--,r._strip()}i.prototype.toString=function(t,e){var n;if(e=0|e||1,16===(t=t||10)||\"hex\"===t){n=\"\";for(var i=0,o=0,s=0;s<this.length;s++){var a=this.words[s],u=(16777215&(a<<i|o)).toString(16);o=a>>>24-i&16777215,(i+=2)>=26&&(i-=26,s--),n=0!==o||s!==this.length-1?f[6-u.length]+u+n:u+n}for(0!==o&&(n=o.toString(16)+n);n.length%e!=0;)n=\"0\"+n;return 0!==this.negative&&(n=\"-\"+n),n}if(t===(0|t)&&t>=2&&t<=36){var c=l[t],h=d[t];n=\"\";var p=this.clone();for(p.negative=0;!p.isZero();){var y=p.modrn(h).toString(t);n=(p=p.idivn(h)).isZero()?y+n:f[c-y.length]+y+n}for(this.isZero()&&(n=\"0\"+n);n.length%e!=0;)n=\"0\"+n;return 0!==this.negative&&(n=\"-\"+n),n}r(!1,\"Base should be between 2 and 36\")},i.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,\"Number can only safely store up to 53 bits\"),0!==this.negative?-t:t},i.prototype.toJSON=function(){return this.toString(16,2)},o&&(i.prototype.toBuffer=function(t,e){return this.toArrayLike(o,t,e)}),i.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},i.prototype.toArrayLike=function(t,e,n){this._strip();var i=this.byteLength(),o=n||Math.max(1,i);r(i<=o,\"byte array longer than desired length\"),r(o>0,\"Requested array length <= 0\");var s=function(t,e){return t.allocUnsafe?t.allocUnsafe(e):new t(e)}(t,o);return this[\"_toArrayLike\"+(\"le\"===e?\"LE\":\"BE\")](s,i),s},i.prototype._toArrayLikeLE=function(t,e){for(var r=0,n=0,i=0,o=0;i<this.length;i++){var s=this.words[i]<<o|n;t[r++]=255&s,r<t.length&&(t[r++]=s>>8&255),r<t.length&&(t[r++]=s>>16&255),6===o?(r<t.length&&(t[r++]=s>>24&255),n=0,o=0):(n=s>>>24,o+=2)}if(r<t.length)for(t[r++]=n;r<t.length;)t[r++]=0},i.prototype._toArrayLikeBE=function(t,e){for(var r=t.length-1,n=0,i=0,o=0;i<this.length;i++){var s=this.words[i]<<o|n;t[r--]=255&s,r>=0&&(t[r--]=s>>8&255),r>=0&&(t[r--]=s>>16&255),6===o?(r>=0&&(t[r--]=s>>24&255),n=0,o=0):(n=s>>>24,o+=2)}if(r>=0)for(t[r--]=n;r>=0;)t[r--]=0},Math.clz32?i.prototype._countBits=function(t){return 32-Math.clz32(t)}:i.prototype._countBits=function(t){var e=t,r=0;return e>=4096&&(r+=13,e>>>=13),e>=64&&(r+=7,e>>>=7),e>=8&&(r+=4,e>>>=4),e>=2&&(r+=2,e>>>=2),r+e},i.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,r=0;return 0==(8191&e)&&(r+=13,e>>>=13),0==(127&e)&&(r+=7,e>>>=7),0==(15&e)&&(r+=4,e>>>=4),0==(3&e)&&(r+=2,e>>>=2),0==(1&e)&&r++,r},i.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},i.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;e<this.length;e++){var r=this._zeroBits(this.words[e]);if(t+=r,26!==r)break}return t},i.prototype.byteLength=function(){return Math.ceil(this.bitLength()/8)},i.prototype.toTwos=function(t){return 0!==this.negative?this.abs().inotn(t).iaddn(1):this.clone()},i.prototype.fromTwos=function(t){return this.testn(t-1)?this.notn(t).iaddn(1).ineg():this.clone()},i.prototype.isNeg=function(){return 0!==this.negative},i.prototype.neg=function(){return this.clone().ineg()},i.prototype.ineg=function(){return this.isZero()||(this.negative^=1),this},i.prototype.iuor=function(t){for(;this.length<t.length;)this.words[this.length++]=0;for(var e=0;e<t.length;e++)this.words[e]=this.words[e]|t.words[e];return this._strip()},i.prototype.ior=function(t){return r(0==(this.negative|t.negative)),this.iuor(t)},i.prototype.or=function(t){return this.length>t.length?this.clone().ior(t):t.clone().ior(this)},i.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},i.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var r=0;r<e.length;r++)this.words[r]=this.words[r]&t.words[r];return this.length=e.length,this._strip()},i.prototype.iand=function(t){return r(0==(this.negative|t.negative)),this.iuand(t)},i.prototype.and=function(t){return this.length>t.length?this.clone().iand(t):t.clone().iand(this)},i.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},i.prototype.iuxor=function(t){var e,r;this.length>t.length?(e=this,r=t):(e=t,r=this);for(var n=0;n<r.length;n++)this.words[n]=e.words[n]^r.words[n];if(this!==e)for(;n<e.length;n++)this.words[n]=e.words[n];return this.length=e.length,this._strip()},i.prototype.ixor=function(t){return r(0==(this.negative|t.negative)),this.iuxor(t)},i.prototype.xor=function(t){return this.length>t.length?this.clone().ixor(t):t.clone().ixor(this)},i.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},i.prototype.inotn=function(t){r(\"number\"==typeof t&&t>=0);var e=0|Math.ceil(t/26),n=t%26;this._expand(e),n>0&&e--;for(var i=0;i<e;i++)this.words[i]=67108863&~this.words[i];return n>0&&(this.words[i]=~this.words[i]&67108863>>26-n),this._strip()},i.prototype.notn=function(t){return this.clone().inotn(t)},i.prototype.setn=function(t,e){r(\"number\"==typeof t&&t>=0);var n=t/26|0,i=t%26;return this._expand(n+1),this.words[n]=e?this.words[n]|1<<i:this.words[n]&~(1<<i),this._strip()},i.prototype.iadd=function(t){var e,r,n;if(0!==this.negative&&0===t.negative)return this.negative=0,e=this.isub(t),this.negative^=1,this._normSign();if(0===this.negative&&0!==t.negative)return t.negative=0,e=this.isub(t),t.negative=1,e._normSign();this.length>t.length?(r=this,n=t):(r=t,n=this);for(var i=0,o=0;o<n.length;o++)e=(0|r.words[o])+(0|n.words[o])+i,this.words[o]=67108863&e,i=e>>>26;for(;0!==i&&o<r.length;o++)e=(0|r.words[o])+i,this.words[o]=67108863&e,i=e>>>26;if(this.length=r.length,0!==i)this.words[this.length]=i,this.length++;else if(r!==this)for(;o<r.length;o++)this.words[o]=r.words[o];return this},i.prototype.add=function(t){var e;return 0!==t.negative&&0===this.negative?(t.negative=0,e=this.sub(t),t.negative^=1,e):0===t.negative&&0!==this.negative?(this.negative=0,e=t.sub(this),this.negative=1,e):this.length>t.length?this.clone().iadd(t):t.clone().iadd(this)},i.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var r,n,i=this.cmp(t);if(0===i)return this.negative=0,this.length=1,this.words[0]=0,this;i>0?(r=this,n=t):(r=t,n=this);for(var o=0,s=0;s<n.length;s++)o=(e=(0|r.words[s])-(0|n.words[s])+o)>>26,this.words[s]=67108863&e;for(;0!==o&&s<r.length;s++)o=(e=(0|r.words[s])+o)>>26,this.words[s]=67108863&e;if(0===o&&s<r.length&&r!==this)for(;s<r.length;s++)this.words[s]=r.words[s];return this.length=Math.max(this.length,s),r!==this&&(this.negative=1),this._strip()},i.prototype.sub=function(t){return this.clone().isub(t)};var y=function(t,e,r){var n,i,o,s=t.words,a=e.words,u=r.words,c=0,h=0|s[0],f=8191&h,l=h>>>13,d=0|s[1],p=8191&d,y=d>>>13,g=0|s[2],m=8191&g,w=g>>>13,b=0|s[3],v=8191&b,x=b>>>13,E=0|s[4],B=8191&E,S=E>>>13,k=0|s[5],M=8191&k,I=k>>>13,_=0|s[6],A=8191&_,O=_>>>13,U=0|s[7],L=8191&U,T=U>>>13,P=0|s[8],R=8191&P,j=P>>>13,N=0|s[9],z=8191&N,C=N>>>13,W=0|a[0],q=8191&W,F=W>>>13,D=0|a[1],H=8191&D,V=D>>>13,K=0|a[2],$=8191&K,Z=K>>>13,G=0|a[3],Y=8191&G,J=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],rt=8191&et,nt=et>>>13,it=0|a[6],ot=8191&it,st=it>>>13,at=0|a[7],ut=8191&at,ct=at>>>13,ht=0|a[8],ft=8191&ht,lt=ht>>>13,dt=0|a[9],pt=8191&dt,yt=dt>>>13;r.negative=t.negative^e.negative,r.length=19;var gt=(c+(n=Math.imul(f,q))|0)+((8191&(i=(i=Math.imul(f,F))+Math.imul(l,q)|0))<<13)|0;c=((o=Math.imul(l,F))+(i>>>13)|0)+(gt>>>26)|0,gt&=67108863,n=Math.imul(p,q),i=(i=Math.imul(p,F))+Math.imul(y,q)|0,o=Math.imul(y,F);var mt=(c+(n=n+Math.imul(f,H)|0)|0)+((8191&(i=(i=i+Math.imul(f,V)|0)+Math.imul(l,H)|0))<<13)|0;c=((o=o+Math.imul(l,V)|0)+(i>>>13)|0)+(mt>>>26)|0,mt&=67108863,n=Math.imul(m,q),i=(i=Math.imul(m,F))+Math.imul(w,q)|0,o=Math.imul(w,F),n=n+Math.imul(p,H)|0,i=(i=i+Math.imul(p,V)|0)+Math.imul(y,H)|0,o=o+Math.imul(y,V)|0;var wt=(c+(n=n+Math.imul(f,$)|0)|0)+((8191&(i=(i=i+Math.imul(f,Z)|0)+Math.imul(l,$)|0))<<13)|0;c=((o=o+Math.imul(l,Z)|0)+(i>>>13)|0)+(wt>>>26)|0,wt&=67108863,n=Math.imul(v,q),i=(i=Math.imul(v,F))+Math.imul(x,q)|0,o=Math.imul(x,F),n=n+Math.imul(m,H)|0,i=(i=i+Math.imul(m,V)|0)+Math.imul(w,H)|0,o=o+Math.imul(w,V)|0,n=n+Math.imul(p,$)|0,i=(i=i+Math.imul(p,Z)|0)+Math.imul(y,$)|0,o=o+Math.imul(y,Z)|0;var bt=(c+(n=n+Math.imul(f,Y)|0)|0)+((8191&(i=(i=i+Math.imul(f,J)|0)+Math.imul(l,Y)|0))<<13)|0;c=((o=o+Math.imul(l,J)|0)+(i>>>13)|0)+(bt>>>26)|0,bt&=67108863,n=Math.imul(B,q),i=(i=Math.imul(B,F))+Math.imul(S,q)|0,o=Math.imul(S,F),n=n+Math.imul(v,H)|0,i=(i=i+Math.imul(v,V)|0)+Math.imul(x,H)|0,o=o+Math.imul(x,V)|0,n=n+Math.imul(m,$)|0,i=(i=i+Math.imul(m,Z)|0)+Math.imul(w,$)|0,o=o+Math.imul(w,Z)|0,n=n+Math.imul(p,Y)|0,i=(i=i+Math.imul(p,J)|0)+Math.imul(y,Y)|0,o=o+Math.imul(y,J)|0;var vt=(c+(n=n+Math.imul(f,Q)|0)|0)+((8191&(i=(i=i+Math.imul(f,tt)|0)+Math.imul(l,Q)|0))<<13)|0;c=((o=o+Math.imul(l,tt)|0)+(i>>>13)|0)+(vt>>>26)|0,vt&=67108863,n=Math.imul(M,q),i=(i=Math.imul(M,F))+Math.imul(I,q)|0,o=Math.imul(I,F),n=n+Math.imul(B,H)|0,i=(i=i+Math.imul(B,V)|0)+Math.imul(S,H)|0,o=o+Math.imul(S,V)|0,n=n+Math.imul(v,$)|0,i=(i=i+Math.imul(v,Z)|0)+Math.imul(x,$)|0,o=o+Math.imul(x,Z)|0,n=n+Math.imul(m,Y)|0,i=(i=i+Math.imul(m,J)|0)+Math.imul(w,Y)|0,o=o+Math.imul(w,J)|0,n=n+Math.imul(p,Q)|0,i=(i=i+Math.imul(p,tt)|0)+Math.imul(y,Q)|0,o=o+Math.imul(y,tt)|0;var xt=(c+(n=n+Math.imul(f,rt)|0)|0)+((8191&(i=(i=i+Math.imul(f,nt)|0)+Math.imul(l,rt)|0))<<13)|0;c=((o=o+Math.imul(l,nt)|0)+(i>>>13)|0)+(xt>>>26)|0,xt&=67108863,n=Math.imul(A,q),i=(i=Math.imul(A,F))+Math.imul(O,q)|0,o=Math.imul(O,F),n=n+Math.imul(M,H)|0,i=(i=i+Math.imul(M,V)|0)+Math.imul(I,H)|0,o=o+Math.imul(I,V)|0,n=n+Math.imul(B,$)|0,i=(i=i+Math.imul(B,Z)|0)+Math.imul(S,$)|0,o=o+Math.imul(S,Z)|0,n=n+Math.imul(v,Y)|0,i=(i=i+Math.imul(v,J)|0)+Math.imul(x,Y)|0,o=o+Math.imul(x,J)|0,n=n+Math.imul(m,Q)|0,i=(i=i+Math.imul(m,tt)|0)+Math.imul(w,Q)|0,o=o+Math.imul(w,tt)|0,n=n+Math.imul(p,rt)|0,i=(i=i+Math.imul(p,nt)|0)+Math.imul(y,rt)|0,o=o+Math.imul(y,nt)|0;var Et=(c+(n=n+Math.imul(f,ot)|0)|0)+((8191&(i=(i=i+Math.imul(f,st)|0)+Math.imul(l,ot)|0))<<13)|0;c=((o=o+Math.imul(l,st)|0)+(i>>>13)|0)+(Et>>>26)|0,Et&=67108863,n=Math.imul(L,q),i=(i=Math.imul(L,F))+Math.imul(T,q)|0,o=Math.imul(T,F),n=n+Math.imul(A,H)|0,i=(i=i+Math.imul(A,V)|0)+Math.imul(O,H)|0,o=o+Math.imul(O,V)|0,n=n+Math.imul(M,$)|0,i=(i=i+Math.imul(M,Z)|0)+Math.imul(I,$)|0,o=o+Math.imul(I,Z)|0,n=n+Math.imul(B,Y)|0,i=(i=i+Math.imul(B,J)|0)+Math.imul(S,Y)|0,o=o+Math.imul(S,J)|0,n=n+Math.imul(v,Q)|0,i=(i=i+Math.imul(v,tt)|0)+Math.imul(x,Q)|0,o=o+Math.imul(x,tt)|0,n=n+Math.imul(m,rt)|0,i=(i=i+Math.imul(m,nt)|0)+Math.imul(w,rt)|0,o=o+Math.imul(w,nt)|0,n=n+Math.imul(p,ot)|0,i=(i=i+Math.imul(p,st)|0)+Math.imul(y,ot)|0,o=o+Math.imul(y,st)|0;var Bt=(c+(n=n+Math.imul(f,ut)|0)|0)+((8191&(i=(i=i+Math.imul(f,ct)|0)+Math.imul(l,ut)|0))<<13)|0;c=((o=o+Math.imul(l,ct)|0)+(i>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,n=Math.imul(R,q),i=(i=Math.imul(R,F))+Math.imul(j,q)|0,o=Math.imul(j,F),n=n+Math.imul(L,H)|0,i=(i=i+Math.imul(L,V)|0)+Math.imul(T,H)|0,o=o+Math.imul(T,V)|0,n=n+Math.imul(A,$)|0,i=(i=i+Math.imul(A,Z)|0)+Math.imul(O,$)|0,o=o+Math.imul(O,Z)|0,n=n+Math.imul(M,Y)|0,i=(i=i+Math.imul(M,J)|0)+Math.imul(I,Y)|0,o=o+Math.imul(I,J)|0,n=n+Math.imul(B,Q)|0,i=(i=i+Math.imul(B,tt)|0)+Math.imul(S,Q)|0,o=o+Math.imul(S,tt)|0,n=n+Math.imul(v,rt)|0,i=(i=i+Math.imul(v,nt)|0)+Math.imul(x,rt)|0,o=o+Math.imul(x,nt)|0,n=n+Math.imul(m,ot)|0,i=(i=i+Math.imul(m,st)|0)+Math.imul(w,ot)|0,o=o+Math.imul(w,st)|0,n=n+Math.imul(p,ut)|0,i=(i=i+Math.imul(p,ct)|0)+Math.imul(y,ut)|0,o=o+Math.imul(y,ct)|0;var St=(c+(n=n+Math.imul(f,ft)|0)|0)+((8191&(i=(i=i+Math.imul(f,lt)|0)+Math.imul(l,ft)|0))<<13)|0;c=((o=o+Math.imul(l,lt)|0)+(i>>>13)|0)+(St>>>26)|0,St&=67108863,n=Math.imul(z,q),i=(i=Math.imul(z,F))+Math.imul(C,q)|0,o=Math.imul(C,F),n=n+Math.imul(R,H)|0,i=(i=i+Math.imul(R,V)|0)+Math.imul(j,H)|0,o=o+Math.imul(j,V)|0,n=n+Math.imul(L,$)|0,i=(i=i+Math.imul(L,Z)|0)+Math.imul(T,$)|0,o=o+Math.imul(T,Z)|0,n=n+Math.imul(A,Y)|0,i=(i=i+Math.imul(A,J)|0)+Math.imul(O,Y)|0,o=o+Math.imul(O,J)|0,n=n+Math.imul(M,Q)|0,i=(i=i+Math.imul(M,tt)|0)+Math.imul(I,Q)|0,o=o+Math.imul(I,tt)|0,n=n+Math.imul(B,rt)|0,i=(i=i+Math.imul(B,nt)|0)+Math.imul(S,rt)|0,o=o+Math.imul(S,nt)|0,n=n+Math.imul(v,ot)|0,i=(i=i+Math.imul(v,st)|0)+Math.imul(x,ot)|0,o=o+Math.imul(x,st)|0,n=n+Math.imul(m,ut)|0,i=(i=i+Math.imul(m,ct)|0)+Math.imul(w,ut)|0,o=o+Math.imul(w,ct)|0,n=n+Math.imul(p,ft)|0,i=(i=i+Math.imul(p,lt)|0)+Math.imul(y,ft)|0,o=o+Math.imul(y,lt)|0;var kt=(c+(n=n+Math.imul(f,pt)|0)|0)+((8191&(i=(i=i+Math.imul(f,yt)|0)+Math.imul(l,pt)|0))<<13)|0;c=((o=o+Math.imul(l,yt)|0)+(i>>>13)|0)+(kt>>>26)|0,kt&=67108863,n=Math.imul(z,H),i=(i=Math.imul(z,V))+Math.imul(C,H)|0,o=Math.imul(C,V),n=n+Math.imul(R,$)|0,i=(i=i+Math.imul(R,Z)|0)+Math.imul(j,$)|0,o=o+Math.imul(j,Z)|0,n=n+Math.imul(L,Y)|0,i=(i=i+Math.imul(L,J)|0)+Math.imul(T,Y)|0,o=o+Math.imul(T,J)|0,n=n+Math.imul(A,Q)|0,i=(i=i+Math.imul(A,tt)|0)+Math.imul(O,Q)|0,o=o+Math.imul(O,tt)|0,n=n+Math.imul(M,rt)|0,i=(i=i+Math.imul(M,nt)|0)+Math.imul(I,rt)|0,o=o+Math.imul(I,nt)|0,n=n+Math.imul(B,ot)|0,i=(i=i+Math.imul(B,st)|0)+Math.imul(S,ot)|0,o=o+Math.imul(S,st)|0,n=n+Math.imul(v,ut)|0,i=(i=i+Math.imul(v,ct)|0)+Math.imul(x,ut)|0,o=o+Math.imul(x,ct)|0,n=n+Math.imul(m,ft)|0,i=(i=i+Math.imul(m,lt)|0)+Math.imul(w,ft)|0,o=o+Math.imul(w,lt)|0;var Mt=(c+(n=n+Math.imul(p,pt)|0)|0)+((8191&(i=(i=i+Math.imul(p,yt)|0)+Math.imul(y,pt)|0))<<13)|0;c=((o=o+Math.imul(y,yt)|0)+(i>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,n=Math.imul(z,$),i=(i=Math.imul(z,Z))+Math.imul(C,$)|0,o=Math.imul(C,Z),n=n+Math.imul(R,Y)|0,i=(i=i+Math.imul(R,J)|0)+Math.imul(j,Y)|0,o=o+Math.imul(j,J)|0,n=n+Math.imul(L,Q)|0,i=(i=i+Math.imul(L,tt)|0)+Math.imul(T,Q)|0,o=o+Math.imul(T,tt)|0,n=n+Math.imul(A,rt)|0,i=(i=i+Math.imul(A,nt)|0)+Math.imul(O,rt)|0,o=o+Math.imul(O,nt)|0,n=n+Math.imul(M,ot)|0,i=(i=i+Math.imul(M,st)|0)+Math.imul(I,ot)|0,o=o+Math.imul(I,st)|0,n=n+Math.imul(B,ut)|0,i=(i=i+Math.imul(B,ct)|0)+Math.imul(S,ut)|0,o=o+Math.imul(S,ct)|0,n=n+Math.imul(v,ft)|0,i=(i=i+Math.imul(v,lt)|0)+Math.imul(x,ft)|0,o=o+Math.imul(x,lt)|0;var It=(c+(n=n+Math.imul(m,pt)|0)|0)+((8191&(i=(i=i+Math.imul(m,yt)|0)+Math.imul(w,pt)|0))<<13)|0;c=((o=o+Math.imul(w,yt)|0)+(i>>>13)|0)+(It>>>26)|0,It&=67108863,n=Math.imul(z,Y),i=(i=Math.imul(z,J))+Math.imul(C,Y)|0,o=Math.imul(C,J),n=n+Math.imul(R,Q)|0,i=(i=i+Math.imul(R,tt)|0)+Math.imul(j,Q)|0,o=o+Math.imul(j,tt)|0,n=n+Math.imul(L,rt)|0,i=(i=i+Math.imul(L,nt)|0)+Math.imul(T,rt)|0,o=o+Math.imul(T,nt)|0,n=n+Math.imul(A,ot)|0,i=(i=i+Math.imul(A,st)|0)+Math.imul(O,ot)|0,o=o+Math.imul(O,st)|0,n=n+Math.imul(M,ut)|0,i=(i=i+Math.imul(M,ct)|0)+Math.imul(I,ut)|0,o=o+Math.imul(I,ct)|0,n=n+Math.imul(B,ft)|0,i=(i=i+Math.imul(B,lt)|0)+Math.imul(S,ft)|0,o=o+Math.imul(S,lt)|0;var _t=(c+(n=n+Math.imul(v,pt)|0)|0)+((8191&(i=(i=i+Math.imul(v,yt)|0)+Math.imul(x,pt)|0))<<13)|0;c=((o=o+Math.imul(x,yt)|0)+(i>>>13)|0)+(_t>>>26)|0,_t&=67108863,n=Math.imul(z,Q),i=(i=Math.imul(z,tt))+Math.imul(C,Q)|0,o=Math.imul(C,tt),n=n+Math.imul(R,rt)|0,i=(i=i+Math.imul(R,nt)|0)+Math.imul(j,rt)|0,o=o+Math.imul(j,nt)|0,n=n+Math.imul(L,ot)|0,i=(i=i+Math.imul(L,st)|0)+Math.imul(T,ot)|0,o=o+Math.imul(T,st)|0,n=n+Math.imul(A,ut)|0,i=(i=i+Math.imul(A,ct)|0)+Math.imul(O,ut)|0,o=o+Math.imul(O,ct)|0,n=n+Math.imul(M,ft)|0,i=(i=i+Math.imul(M,lt)|0)+Math.imul(I,ft)|0,o=o+Math.imul(I,lt)|0;var At=(c+(n=n+Math.imul(B,pt)|0)|0)+((8191&(i=(i=i+Math.imul(B,yt)|0)+Math.imul(S,pt)|0))<<13)|0;c=((o=o+Math.imul(S,yt)|0)+(i>>>13)|0)+(At>>>26)|0,At&=67108863,n=Math.imul(z,rt),i=(i=Math.imul(z,nt))+Math.imul(C,rt)|0,o=Math.imul(C,nt),n=n+Math.imul(R,ot)|0,i=(i=i+Math.imul(R,st)|0)+Math.imul(j,ot)|0,o=o+Math.imul(j,st)|0,n=n+Math.imul(L,ut)|0,i=(i=i+Math.imul(L,ct)|0)+Math.imul(T,ut)|0,o=o+Math.imul(T,ct)|0,n=n+Math.imul(A,ft)|0,i=(i=i+Math.imul(A,lt)|0)+Math.imul(O,ft)|0,o=o+Math.imul(O,lt)|0;var Ot=(c+(n=n+Math.imul(M,pt)|0)|0)+((8191&(i=(i=i+Math.imul(M,yt)|0)+Math.imul(I,pt)|0))<<13)|0;c=((o=o+Math.imul(I,yt)|0)+(i>>>13)|0)+(Ot>>>26)|0,Ot&=67108863,n=Math.imul(z,ot),i=(i=Math.imul(z,st))+Math.imul(C,ot)|0,o=Math.imul(C,st),n=n+Math.imul(R,ut)|0,i=(i=i+Math.imul(R,ct)|0)+Math.imul(j,ut)|0,o=o+Math.imul(j,ct)|0,n=n+Math.imul(L,ft)|0,i=(i=i+Math.imul(L,lt)|0)+Math.imul(T,ft)|0,o=o+Math.imul(T,lt)|0;var Ut=(c+(n=n+Math.imul(A,pt)|0)|0)+((8191&(i=(i=i+Math.imul(A,yt)|0)+Math.imul(O,pt)|0))<<13)|0;c=((o=o+Math.imul(O,yt)|0)+(i>>>13)|0)+(Ut>>>26)|0,Ut&=67108863,n=Math.imul(z,ut),i=(i=Math.imul(z,ct))+Math.imul(C,ut)|0,o=Math.imul(C,ct),n=n+Math.imul(R,ft)|0,i=(i=i+Math.imul(R,lt)|0)+Math.imul(j,ft)|0,o=o+Math.imul(j,lt)|0;var Lt=(c+(n=n+Math.imul(L,pt)|0)|0)+((8191&(i=(i=i+Math.imul(L,yt)|0)+Math.imul(T,pt)|0))<<13)|0;c=((o=o+Math.imul(T,yt)|0)+(i>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,n=Math.imul(z,ft),i=(i=Math.imul(z,lt))+Math.imul(C,ft)|0,o=Math.imul(C,lt);var Tt=(c+(n=n+Math.imul(R,pt)|0)|0)+((8191&(i=(i=i+Math.imul(R,yt)|0)+Math.imul(j,pt)|0))<<13)|0;c=((o=o+Math.imul(j,yt)|0)+(i>>>13)|0)+(Tt>>>26)|0,Tt&=67108863;var Pt=(c+(n=Math.imul(z,pt))|0)+((8191&(i=(i=Math.imul(z,yt))+Math.imul(C,pt)|0))<<13)|0;return c=((o=Math.imul(C,yt))+(i>>>13)|0)+(Pt>>>26)|0,Pt&=67108863,u[0]=gt,u[1]=mt,u[2]=wt,u[3]=bt,u[4]=vt,u[5]=xt,u[6]=Et,u[7]=Bt,u[8]=St,u[9]=kt,u[10]=Mt,u[11]=It,u[12]=_t,u[13]=At,u[14]=Ot,u[15]=Ut,u[16]=Lt,u[17]=Tt,u[18]=Pt,0!==c&&(u[19]=c,r.length++),r};function g(t,e,r){r.negative=e.negative^t.negative,r.length=t.length+e.length;for(var n=0,i=0,o=0;o<r.length-1;o++){var s=i;i=0;for(var a=67108863&n,u=Math.min(o,e.length-1),c=Math.max(0,o-t.length+1);c<=u;c++){var h=o-c,f=(0|t.words[h])*(0|e.words[c]),l=67108863&f;a=67108863&(l=l+a|0),i+=(s=(s=s+(f/67108864|0)|0)+(l>>>26)|0)>>>26,s&=67108863}r.words[o]=a,n=s,s=i}return 0!==n?r.words[o]=n:r.length--,r._strip()}function m(t,e,r){return g(t,e,r)}Math.imul||(y=p),i.prototype.mulTo=function(t,e){var r=this.length+t.length;return 10===this.length&&10===t.length?y(this,t,e):r<63?p(this,t,e):r<1024?g(this,t,e):m(this,t,e)},i.prototype.mul=function(t){var e=new i(null);return e.words=new Array(this.length+t.length),this.mulTo(t,e)},i.prototype.mulf=function(t){var e=new i(null);return e.words=new Array(this.length+t.length),m(this,t,e)},i.prototype.imul=function(t){return this.clone().mulTo(t,this)},i.prototype.imuln=function(t){var e=t<0;e&&(t=-t),r(\"number\"==typeof t),r(t<67108864);for(var n=0,i=0;i<this.length;i++){var o=(0|this.words[i])*t,s=(67108863&o)+(67108863&n);n>>=26,n+=o/67108864|0,n+=s>>>26,this.words[i]=67108863&s}return 0!==n&&(this.words[i]=n,this.length++),e?this.ineg():this},i.prototype.muln=function(t){return this.clone().imuln(t)},i.prototype.sqr=function(){return this.mul(this)},i.prototype.isqr=function(){return this.imul(this.clone())},i.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),r=0;r<e.length;r++){var n=r/26|0,i=r%26;e[r]=t.words[n]>>>i&1}return e}(t);if(0===e.length)return new i(1);for(var r=this,n=0;n<e.length&&0===e[n];n++,r=r.sqr());if(++n<e.length)for(var o=r.sqr();n<e.length;n++,o=o.sqr())0!==e[n]&&(r=r.mul(o));return r},i.prototype.iushln=function(t){r(\"number\"==typeof t&&t>=0);var e,n=t%26,i=(t-n)/26,o=67108863>>>26-n<<26-n;if(0!==n){var s=0;for(e=0;e<this.length;e++){var a=this.words[e]&o,u=(0|this.words[e])-a<<n;this.words[e]=u|s,s=a>>>26-n}s&&(this.words[e]=s,this.length++)}if(0!==i){for(e=this.length-1;e>=0;e--)this.words[e+i]=this.words[e];for(e=0;e<i;e++)this.words[e]=0;this.length+=i}return this._strip()},i.prototype.ishln=function(t){return r(0===this.negative),this.iushln(t)},i.prototype.iushrn=function(t,e,n){var i;r(\"number\"==typeof t&&t>=0),i=e?(e-e%26)/26:0;var o=t%26,s=Math.min((t-o)/26,this.length),a=67108863^67108863>>>o<<o,u=n;if(i-=s,i=Math.max(0,i),u){for(var c=0;c<s;c++)u.words[c]=this.words[c];u.length=s}if(0===s);else if(this.length>s)for(this.length-=s,c=0;c<this.length;c++)this.words[c]=this.words[c+s];else this.words[0]=0,this.length=1;var h=0;for(c=this.length-1;c>=0&&(0!==h||c>=i);c--){var f=0|this.words[c];this.words[c]=h<<26-o|f>>>o,h=f&a}return u&&0!==h&&(u.words[u.length++]=h),0===this.length&&(this.words[0]=0,this.length=1),this._strip()},i.prototype.ishrn=function(t,e,n){return r(0===this.negative),this.iushrn(t,e,n)},i.prototype.shln=function(t){return this.clone().ishln(t)},i.prototype.ushln=function(t){return this.clone().iushln(t)},i.prototype.shrn=function(t){return this.clone().ishrn(t)},i.prototype.ushrn=function(t){return this.clone().iushrn(t)},i.prototype.testn=function(t){r(\"number\"==typeof t&&t>=0);var e=t%26,n=(t-e)/26,i=1<<e;return!(this.length<=n||!(this.words[n]&i))},i.prototype.imaskn=function(t){r(\"number\"==typeof t&&t>=0);var e=t%26,n=(t-e)/26;if(r(0===this.negative,\"imaskn works only with positive numbers\"),this.length<=n)return this;if(0!==e&&n++,this.length=Math.min(n,this.length),0!==e){var i=67108863^67108863>>>e<<e;this.words[this.length-1]&=i}return this._strip()},i.prototype.maskn=function(t){return this.clone().imaskn(t)},i.prototype.iaddn=function(t){return r(\"number\"==typeof t),r(t<67108864),t<0?this.isubn(-t):0!==this.negative?1===this.length&&(0|this.words[0])<=t?(this.words[0]=t-(0|this.words[0]),this.negative=0,this):(this.negative=0,this.isubn(t),this.negative=1,this):this._iaddn(t)},i.prototype._iaddn=function(t){this.words[0]+=t;for(var e=0;e<this.length&&this.words[e]>=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},i.prototype.isubn=function(t){if(r(\"number\"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e<this.length&&this.words[e]<0;e++)this.words[e]+=67108864,this.words[e+1]-=1;return this._strip()},i.prototype.addn=function(t){return this.clone().iaddn(t)},i.prototype.subn=function(t){return this.clone().isubn(t)},i.prototype.iabs=function(){return this.negative=0,this},i.prototype.abs=function(){return this.clone().iabs()},i.prototype._ishlnsubmul=function(t,e,n){var i,o,s=t.length+n;this._expand(s);var a=0;for(i=0;i<t.length;i++){o=(0|this.words[i+n])+a;var u=(0|t.words[i])*e;a=((o-=67108863&u)>>26)-(u/67108864|0),this.words[i+n]=67108863&o}for(;i<this.length-n;i++)a=(o=(0|this.words[i+n])+a)>>26,this.words[i+n]=67108863&o;if(0===a)return this._strip();for(r(-1===a),a=0,i=0;i<this.length;i++)a=(o=-(0|this.words[i])+a)>>26,this.words[i]=67108863&o;return this.negative=1,this._strip()},i.prototype._wordDiv=function(t,e){var r=(this.length,t.length),n=this.clone(),o=t,s=0|o.words[o.length-1];0!=(r=26-this._countBits(s))&&(o=o.ushln(r),n.iushln(r),s=0|o.words[o.length-1]);var a,u=n.length-o.length;if(\"mod\"!==e){(a=new i(null)).length=u+1,a.words=new Array(a.length);for(var c=0;c<a.length;c++)a.words[c]=0}var h=n.clone()._ishlnsubmul(o,1,u);0===h.negative&&(n=h,a&&(a.words[u]=1));for(var f=u-1;f>=0;f--){var l=67108864*(0|n.words[o.length+f])+(0|n.words[o.length+f-1]);for(l=Math.min(l/s|0,67108863),n._ishlnsubmul(o,l,f);0!==n.negative;)l--,n.negative=0,n._ishlnsubmul(o,1,f),n.isZero()||(n.negative^=1);a&&(a.words[f]=l)}return a&&a._strip(),n._strip(),\"div\"!==e&&0!==r&&n.iushrn(r),{div:a||null,mod:n}},i.prototype.divmod=function(t,e,n){return r(!t.isZero()),this.isZero()?{div:new i(0),mod:new i(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),\"mod\"!==e&&(o=a.div.neg()),\"div\"!==e&&(s=a.mod.neg(),n&&0!==s.negative&&s.iadd(t)),{div:o,mod:s}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),\"mod\"!==e&&(o=a.div.neg()),{div:o,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),\"div\"!==e&&(s=a.mod.neg(),n&&0!==s.negative&&s.isub(t)),{div:a.div,mod:s}):t.length>this.length||this.cmp(t)<0?{div:new i(0),mod:this}:1===t.length?\"div\"===e?{div:this.divn(t.words[0]),mod:null}:\"mod\"===e?{div:null,mod:new i(this.modrn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new i(this.modrn(t.words[0]))}:this._wordDiv(t,e);var o,s,a},i.prototype.div=function(t){return this.divmod(t,\"div\",!1).div},i.prototype.mod=function(t){return this.divmod(t,\"mod\",!1).mod},i.prototype.umod=function(t){return this.divmod(t,\"mod\",!0).mod},i.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var r=0!==e.div.negative?e.mod.isub(t):e.mod,n=t.ushrn(1),i=t.andln(1),o=r.cmp(n);return o<0||1===i&&0===o?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},i.prototype.modrn=function(t){var e=t<0;e&&(t=-t),r(t<=67108863);for(var n=(1<<26)%t,i=0,o=this.length-1;o>=0;o--)i=(n*i+(0|this.words[o]))%t;return e?-i:i},i.prototype.modn=function(t){return this.modrn(t)},i.prototype.idivn=function(t){var e=t<0;e&&(t=-t),r(t<=67108863);for(var n=0,i=this.length-1;i>=0;i--){var o=(0|this.words[i])+67108864*n;this.words[i]=o/t|0,n=o%t}return this._strip(),e?this.ineg():this},i.prototype.divn=function(t){return this.clone().idivn(t)},i.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,n=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var o=new i(1),s=new i(0),a=new i(0),u=new i(1),c=0;e.isEven()&&n.isEven();)e.iushrn(1),n.iushrn(1),++c;for(var h=n.clone(),f=e.clone();!e.isZero();){for(var l=0,d=1;0==(e.words[0]&d)&&l<26;++l,d<<=1);if(l>0)for(e.iushrn(l);l-- >0;)(o.isOdd()||s.isOdd())&&(o.iadd(h),s.isub(f)),o.iushrn(1),s.iushrn(1);for(var p=0,y=1;0==(n.words[0]&y)&&p<26;++p,y<<=1);if(p>0)for(n.iushrn(p);p-- >0;)(a.isOdd()||u.isOdd())&&(a.iadd(h),u.isub(f)),a.iushrn(1),u.iushrn(1);e.cmp(n)>=0?(e.isub(n),o.isub(a),s.isub(u)):(n.isub(e),a.isub(o),u.isub(s))}return{a:a,b:u,gcd:n.iushln(c)}},i.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,n=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var o,s=new i(1),a=new i(0),u=n.clone();e.cmpn(1)>0&&n.cmpn(1)>0;){for(var c=0,h=1;0==(e.words[0]&h)&&c<26;++c,h<<=1);if(c>0)for(e.iushrn(c);c-- >0;)s.isOdd()&&s.iadd(u),s.iushrn(1);for(var f=0,l=1;0==(n.words[0]&l)&&f<26;++f,l<<=1);if(f>0)for(n.iushrn(f);f-- >0;)a.isOdd()&&a.iadd(u),a.iushrn(1);e.cmp(n)>=0?(e.isub(n),s.isub(a)):(n.isub(e),a.isub(s))}return(o=0===e.cmpn(1)?s:a).cmpn(0)<0&&o.iadd(t),o},i.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),r=t.clone();e.negative=0,r.negative=0;for(var n=0;e.isEven()&&r.isEven();n++)e.iushrn(1),r.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;r.isEven();)r.iushrn(1);var i=e.cmp(r);if(i<0){var o=e;e=r,r=o}else if(0===i||0===r.cmpn(1))break;e.isub(r)}return r.iushln(n)},i.prototype.invm=function(t){return this.egcd(t).a.umod(t)},i.prototype.isEven=function(){return 0==(1&this.words[0])},i.prototype.isOdd=function(){return 1==(1&this.words[0])},i.prototype.andln=function(t){return this.words[0]&t},i.prototype.bincn=function(t){r(\"number\"==typeof t);var e=t%26,n=(t-e)/26,i=1<<e;if(this.length<=n)return this._expand(n+1),this.words[n]|=i,this;for(var o=i,s=n;0!==o&&s<this.length;s++){var a=0|this.words[s];o=(a+=o)>>>26,a&=67108863,this.words[s]=a}return 0!==o&&(this.words[s]=o,this.length++),this},i.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},i.prototype.cmpn=function(t){var e,n=t<0;if(0!==this.negative&&!n)return-1;if(0===this.negative&&n)return 1;if(this._strip(),this.length>1)e=1;else{n&&(t=-t),r(t<=67108863,\"Number is too big\");var i=0|this.words[0];e=i===t?0:i<t?-1:1}return 0!==this.negative?0|-e:e},i.prototype.cmp=function(t){if(0!==this.negative&&0===t.negative)return-1;if(0===this.negative&&0!==t.negative)return 1;var e=this.ucmp(t);return 0!==this.negative?0|-e:e},i.prototype.ucmp=function(t){if(this.length>t.length)return 1;if(this.length<t.length)return-1;for(var e=0,r=this.length-1;r>=0;r--){var n=0|this.words[r],i=0|t.words[r];if(n!==i){n<i?e=-1:n>i&&(e=1);break}}return e},i.prototype.gtn=function(t){return 1===this.cmpn(t)},i.prototype.gt=function(t){return 1===this.cmp(t)},i.prototype.gten=function(t){return this.cmpn(t)>=0},i.prototype.gte=function(t){return this.cmp(t)>=0},i.prototype.ltn=function(t){return-1===this.cmpn(t)},i.prototype.lt=function(t){return-1===this.cmp(t)},i.prototype.lten=function(t){return this.cmpn(t)<=0},i.prototype.lte=function(t){return this.cmp(t)<=0},i.prototype.eqn=function(t){return 0===this.cmpn(t)},i.prototype.eq=function(t){return 0===this.cmp(t)},i.red=function(t){return new S(t)},i.prototype.toRed=function(t){return r(!this.red,\"Already a number in reduction context\"),r(0===this.negative,\"red works only with positives\"),t.convertTo(this)._forceRed(t)},i.prototype.fromRed=function(){return r(this.red,\"fromRed works only with numbers in reduction context\"),this.red.convertFrom(this)},i.prototype._forceRed=function(t){return this.red=t,this},i.prototype.forceRed=function(t){return r(!this.red,\"Already a number in reduction context\"),this._forceRed(t)},i.prototype.redAdd=function(t){return r(this.red,\"redAdd works only with red numbers\"),this.red.add(this,t)},i.prototype.redIAdd=function(t){return r(this.red,\"redIAdd works only with red numbers\"),this.red.iadd(this,t)},i.prototype.redSub=function(t){return r(this.red,\"redSub works only with red numbers\"),this.red.sub(this,t)},i.prototype.redISub=function(t){return r(this.red,\"redISub works only with red numbers\"),this.red.isub(this,t)},i.prototype.redShl=function(t){return r(this.red,\"redShl works only with red numbers\"),this.red.shl(this,t)},i.prototype.redMul=function(t){return r(this.red,\"redMul works only with red numbers\"),this.red._verify2(this,t),this.red.mul(this,t)},i.prototype.redIMul=function(t){return r(this.red,\"redMul works only with red numbers\"),this.red._verify2(this,t),this.red.imul(this,t)},i.prototype.redSqr=function(){return r(this.red,\"redSqr works only with red numbers\"),this.red._verify1(this),this.red.sqr(this)},i.prototype.redISqr=function(){return r(this.red,\"redISqr works only with red numbers\"),this.red._verify1(this),this.red.isqr(this)},i.prototype.redSqrt=function(){return r(this.red,\"redSqrt works only with red numbers\"),this.red._verify1(this),this.red.sqrt(this)},i.prototype.redInvm=function(){return r(this.red,\"redInvm works only with red numbers\"),this.red._verify1(this),this.red.invm(this)},i.prototype.redNeg=function(){return r(this.red,\"redNeg works only with red numbers\"),this.red._verify1(this),this.red.neg(this)},i.prototype.redPow=function(t){return r(this.red&&!t.red,\"redPow(normalNum)\"),this.red._verify1(this),this.red.pow(this,t)};var w={k256:null,p224:null,p192:null,p25519:null};function b(t,e){this.name=t,this.p=new i(e,16),this.n=this.p.bitLength(),this.k=new i(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function v(){b.call(this,\"k256\",\"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f\")}function x(){b.call(this,\"p224\",\"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001\")}function E(){b.call(this,\"p192\",\"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff\")}function B(){b.call(this,\"25519\",\"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed\")}function S(t){if(\"string\"==typeof t){var e=i._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),\"modulus must be greater than 1\"),this.m=t,this.prime=null}function k(t){S.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new i(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}b.prototype._tmp=function(){var t=new i(null);return t.words=new Array(Math.ceil(this.n/13)),t},b.prototype.ireduce=function(t){var e,r=t;do{this.split(r,this.tmp),e=(r=(r=this.imulK(r)).iadd(this.tmp)).bitLength()}while(e>this.n);var n=e<this.n?-1:r.ucmp(this.p);return 0===n?(r.words[0]=0,r.length=1):n>0?r.isub(this.p):void 0!==r.strip?r.strip():r._strip(),r},b.prototype.split=function(t,e){t.iushrn(this.n,0,e)},b.prototype.imulK=function(t){return t.imul(this.k)},n(v,b),v.prototype.split=function(t,e){for(var r=4194303,n=Math.min(t.length,9),i=0;i<n;i++)e.words[i]=t.words[i];if(e.length=n,t.length<=9)return t.words[0]=0,void(t.length=1);var o=t.words[9];for(e.words[e.length++]=o&r,i=10;i<t.length;i++){var s=0|t.words[i];t.words[i-10]=(s&r)<<4|o>>>22,o=s}o>>>=22,t.words[i-10]=o,0===o&&t.length>10?t.length-=10:t.length-=9},v.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,r=0;r<t.length;r++){var n=0|t.words[r];e+=977*n,t.words[r]=67108863&e,e=64*n+(e/67108864|0)}return 0===t.words[t.length-1]&&(t.length--,0===t.words[t.length-1]&&t.length--),t},n(x,b),n(E,b),n(B,b),B.prototype.imulK=function(t){for(var e=0,r=0;r<t.length;r++){var n=19*(0|t.words[r])+e,i=67108863&n;n>>>=26,t.words[r]=i,e=n}return 0!==e&&(t.words[t.length++]=e),t},i._prime=function(t){if(w[t])return w[t];var e;if(\"k256\"===t)e=new v;else if(\"p224\"===t)e=new x;else if(\"p192\"===t)e=new E;else{if(\"p25519\"!==t)throw new Error(\"Unknown prime \"+t);e=new B}return w[t]=e,e},S.prototype._verify1=function(t){r(0===t.negative,\"red works only with positives\"),r(t.red,\"red works only with red numbers\")},S.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),\"red works only with positives\"),r(t.red&&t.red===e.red,\"red works only with red numbers\")},S.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):(c(t,t.umod(this.m)._forceRed(this)),t)},S.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},S.prototype.add=function(t,e){this._verify2(t,e);var r=t.add(e);return r.cmp(this.m)>=0&&r.isub(this.m),r._forceRed(this)},S.prototype.iadd=function(t,e){this._verify2(t,e);var r=t.iadd(e);return r.cmp(this.m)>=0&&r.isub(this.m),r},S.prototype.sub=function(t,e){this._verify2(t,e);var r=t.sub(e);return r.cmpn(0)<0&&r.iadd(this.m),r._forceRed(this)},S.prototype.isub=function(t,e){this._verify2(t,e);var r=t.isub(e);return r.cmpn(0)<0&&r.iadd(this.m),r},S.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},S.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},S.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},S.prototype.isqr=function(t){return this.imul(t,t.clone())},S.prototype.sqr=function(t){return this.mul(t,t)},S.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var n=this.m.add(new i(1)).iushrn(2);return this.pow(t,n)}for(var o=this.m.subn(1),s=0;!o.isZero()&&0===o.andln(1);)s++,o.iushrn(1);r(!o.isZero());var a=new i(1).toRed(this),u=a.redNeg(),c=this.m.subn(1).iushrn(1),h=this.m.bitLength();for(h=new i(2*h*h).toRed(this);0!==this.pow(h,c).cmp(u);)h.redIAdd(u);for(var f=this.pow(h,o),l=this.pow(t,o.addn(1).iushrn(1)),d=this.pow(t,o),p=s;0!==d.cmp(a);){for(var y=d,g=0;0!==y.cmp(a);g++)y=y.redSqr();r(g<p);var m=this.pow(f,new i(1).iushln(p-g-1));l=l.redMul(m),f=m.redSqr(),d=d.redMul(f),p=g}return l},S.prototype.invm=function(t){var e=t._invmp(this.m);return 0!==e.negative?(e.negative=0,this.imod(e).redNeg()):this.imod(e)},S.prototype.pow=function(t,e){if(e.isZero())return new i(1).toRed(this);if(0===e.cmpn(1))return t.clone();var r=new Array(16);r[0]=new i(1).toRed(this),r[1]=t;for(var n=2;n<r.length;n++)r[n]=this.mul(r[n-1],t);var o=r[0],s=0,a=0,u=e.bitLength()%26;for(0===u&&(u=26),n=e.length-1;n>=0;n--){for(var c=e.words[n],h=u-1;h>=0;h--){var f=c>>h&1;o!==r[0]&&(o=this.sqr(o)),0!==f||0!==s?(s<<=1,s|=f,(4==++a||0===n&&0===h)&&(o=this.mul(o,r[s]),a=0,s=0)):a=0}u=26}return o},S.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},S.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},i.mont=function(t){return new k(t)},n(k,S),k.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},k.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},k.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var r=t.imul(e),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),i=r.isub(n).iushrn(this.shift),o=i;return i.cmp(this.m)>=0?o=i.isub(this.m):i.cmpn(0)<0&&(o=i.iadd(this.m)),o._forceRed(this)},k.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new i(0)._forceRed(this);var r=t.mul(e),n=r.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),o=r.isub(n).iushrn(this.shift),s=o;return o.cmp(this.m)>=0?s=o.isub(this.m):o.cmpn(0)<0&&(s=o.iadd(this.m)),s._forceRed(this)},k.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(Kt,t);var Zt=Kt.exports,Gt=e(Zt),Yt={exports:{}};!function(t,e){var r=n,i=r.Buffer;function o(t,e){for(var r in t)e[r]=t[r]}function s(t,e,r){return i(t,e,r)}i.from&&i.alloc&&i.allocUnsafe&&i.allocUnsafeSlow?t.exports=r:(o(r,e),e.Buffer=s),s.prototype=Object.create(i.prototype),o(i,s),s.from=function(t,e,r){if(\"number\"==typeof t)throw new TypeError(\"Argument must not be a number\");return i(t,e,r)},s.alloc=function(t,e,r){if(\"number\"!=typeof t)throw new TypeError(\"Argument must be a number\");var n=i(t);return void 0!==e?\"string\"==typeof r?n.fill(e,r):n.fill(e):n.fill(0),n},s.allocUnsafe=function(t){if(\"number\"!=typeof t)throw new TypeError(\"Argument must be a number\");return i(t)},s.allocUnsafeSlow=function(t){if(\"number\"!=typeof t)throw new TypeError(\"Argument must be a number\");return r.SlowBuffer(t)}}(Yt,Yt.exports);var Jt=Yt.exports.Buffer;var Xt=function(t){if(t.length>=255)throw new TypeError(\"Alphabet too long\");for(var e=new Uint8Array(256),r=0;r<e.length;r++)e[r]=255;for(var n=0;n<t.length;n++){var i=t.charAt(n),o=i.charCodeAt(0);if(255!==e[o])throw new TypeError(i+\" is ambiguous\");e[o]=n}var s=t.length,a=t.charAt(0),u=Math.log(s)/Math.log(256),c=Math.log(256)/Math.log(s);function h(t){if(\"string\"!=typeof t)throw new TypeError(\"Expected String\");if(0===t.length)return Jt.alloc(0);for(var r=0,n=0,i=0;t[r]===a;)n++,r++;for(var o=(t.length-r)*u+1>>>0,c=new Uint8Array(o);t[r];){var h=e[t.charCodeAt(r)];if(255===h)return;for(var f=0,l=o-1;(0!==h||f<i)&&-1!==l;l--,f++)h+=s*c[l]>>>0,c[l]=h%256>>>0,h=h/256>>>0;if(0!==h)throw new Error(\"Non-zero carry\");i=f,r++}for(var d=o-i;d!==o&&0===c[d];)d++;var p=Jt.allocUnsafe(n+(o-d));p.fill(0,0,n);for(var y=n;d!==o;)p[y++]=c[d++];return p}return{encode:function(e){if((Array.isArray(e)||e instanceof Uint8Array)&&(e=Jt.from(e)),!Jt.isBuffer(e))throw new TypeError(\"Expected Buffer\");if(0===e.length)return\"\";for(var r=0,n=0,i=0,o=e.length;i!==o&&0===e[i];)i++,r++;for(var u=(o-i)*c+1>>>0,h=new Uint8Array(u);i!==o;){for(var f=e[i],l=0,d=u-1;(0!==f||l<n)&&-1!==d;d--,l++)f+=256*h[d]>>>0,h[d]=f%s>>>0,f=f/s>>>0;if(0!==f)throw new Error(\"Non-zero carry\");n=l,i++}for(var p=u-n;p!==u&&0===h[p];)p++;for(var y=a.repeat(r);p<u;++p)y+=t.charAt(h[p]);return y},decodeUnsafe:h,decode:function(t){var e=h(t);if(e)return e;throw new Error(\"Non-base\"+s+\" character\")}}},Qt=Xt(\"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz\"),te=e(Qt);const ee=(t,e,r)=>t&e^t&r^e&r,re=new Uint32Array([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),ne=new Uint32Array([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),ie=new Uint32Array(64);class oe extends M{constructor(){super(64,32,8,!1),this.A=0|ne[0],this.B=0|ne[1],this.C=0|ne[2],this.D=0|ne[3],this.E=0|ne[4],this.F=0|ne[5],this.G=0|ne[6],this.H=0|ne[7]}get(){const{A:t,B:e,C:r,D:n,E:i,F:o,G:s,H:a}=this;return[t,e,r,n,i,o,s,a]}set(t,e,r,n,i,o,s,a){this.A=0|t,this.B=0|e,this.C=0|r,this.D=0|n,this.E=0|i,this.F=0|o,this.G=0|s,this.H=0|a}process(t,e){for(let r=0;r<16;r++,e+=4)ie[r]=t.getUint32(e,!1);for(let t=16;t<64;t++){const e=ie[t-15],r=ie[t-2],n=b(e,7)^b(e,18)^e>>>3,i=b(r,17)^b(r,19)^r>>>10;ie[t]=i+ie[t-7]+n+ie[t-16]|0}let{A:r,B:n,C:i,D:o,E:s,F:a,G:u,H:c}=this;for(let t=0;t<64;t++){const e=c+(b(s,6)^b(s,11)^b(s,25))+((h=s)&a^~h&u)+re[t]+ie[t]|0,f=(b(r,2)^b(r,13)^b(r,22))+ee(r,n,i)|0;c=u,u=a,a=s,s=o+e|0,o=i,i=n,n=r,r=e+f|0}var h;r=r+this.A|0,n=n+this.B|0,i=i+this.C|0,o=o+this.D|0,s=s+this.E|0,a=a+this.F|0,u=u+this.G|0,c=c+this.H|0,this.set(r,n,i,o,s,a,u,c)}roundClean(){ie.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const se=S((()=>new oe));var ae={};function ue(t,e,r){return e<=t&&t<=r}function ce(t){if(void 0===t)return{};if(t===Object(t))return t;throw TypeError(\"Could not convert argument to dictionary\")}function he(t){this.tokens=[].slice.call(t)}he.prototype={endOfStream:function(){return!this.tokens.length},read:function(){return this.tokens.length?this.tokens.shift():-1},prepend:function(t){if(Array.isArray(t))for(var e=t;e.length;)this.tokens.unshift(e.pop());else this.tokens.unshift(t)},push:function(t){if(Array.isArray(t))for(var e=t;e.length;)this.tokens.push(e.shift());else this.tokens.push(t)}};var fe=-1;function le(t,e){if(t)throw TypeError(\"Decoder error\");return e||65533}var de=\"utf-8\";function pe(t,e){if(!(this instanceof pe))return new pe(t,e);if((t=void 0!==t?String(t).toLowerCase():de)!==de)throw new Error(\"Encoding not supported. Only utf-8 is supported\");e=ce(e),this._streaming=!1,this._BOMseen=!1,this._decoder=null,this._fatal=Boolean(e.fatal),this._ignoreBOM=Boolean(e.ignoreBOM),Object.defineProperty(this,\"encoding\",{value:\"utf-8\"}),Object.defineProperty(this,\"fatal\",{value:this._fatal}),Object.defineProperty(this,\"ignoreBOM\",{value:this._ignoreBOM})}function ye(t,e){if(!(this instanceof ye))return new ye(t,e);if((t=void 0!==t?String(t).toLowerCase():de)!==de)throw new Error(\"Encoding not supported. Only utf-8 is supported\");e=ce(e),this._streaming=!1,this._encoder=null,this._options={fatal:Boolean(e.fatal)},Object.defineProperty(this,\"encoding\",{value:\"utf-8\"})}function ge(t){var e=t.fatal,r=0,n=0,i=0,o=128,s=191;this.handler=function(t,a){if(-1===a&&0!==i)return i=0,le(e);if(-1===a)return fe;if(0===i){if(ue(a,0,127))return a;if(ue(a,194,223))i=1,r=a-192;else if(ue(a,224,239))224===a&&(o=160),237===a&&(s=159),i=2,r=a-224;else{if(!ue(a,240,244))return le(e);240===a&&(o=144),244===a&&(s=143),i=3,r=a-240}return r<<=6*i,null}if(!ue(a,o,s))return r=i=n=0,o=128,s=191,t.prepend(a),le(e);if(o=128,s=191,r+=a-128<<6*(i-(n+=1)),n!==i)return null;var u=r;return r=i=n=0,u}}function me(t){t.fatal,this.handler=function(t,e){if(-1===e)return fe;if(ue(e,0,127))return e;var r,n;ue(e,128,2047)?(r=1,n=192):ue(e,2048,65535)?(r=2,n=224):ue(e,65536,1114111)&&(r=3,n=240);for(var i=[(e>>6*r)+n];r>0;){var o=e>>6*(r-1);i.push(128|63&o),r-=1}return i}}pe.prototype={decode:function(t,e){var r;r=\"object\"==typeof t&&t instanceof ArrayBuffer?new Uint8Array(t):\"object\"==typeof t&&\"buffer\"in t&&t.buffer instanceof ArrayBuffer?new Uint8Array(t.buffer,t.byteOffset,t.byteLength):new Uint8Array(0),e=ce(e),this._streaming||(this._decoder=new ge({fatal:this._fatal}),this._BOMseen=!1),this._streaming=Boolean(e.stream);for(var n,i=new he(r),o=[];!i.endOfStream()&&(n=this._decoder.handler(i,i.read()))!==fe;)null!==n&&(Array.isArray(n)?o.push.apply(o,n):o.push(n));if(!this._streaming){do{if((n=this._decoder.handler(i,i.read()))===fe)break;null!==n&&(Array.isArray(n)?o.push.apply(o,n):o.push(n))}while(!i.endOfStream());this._decoder=null}return o.length&&(-1===[\"utf-8\"].indexOf(this.encoding)||this._ignoreBOM||this._BOMseen||(65279===o[0]?(this._BOMseen=!0,o.shift()):this._BOMseen=!0)),function(t){for(var e=\"\",r=0;r<t.length;++r){var n=t[r];n<=65535?e+=String.fromCharCode(n):(n-=65536,e+=String.fromCharCode(55296+(n>>10),56320+(1023&n)))}return e}(o)}},ye.prototype={encode:function(t,e){t=t?String(t):\"\",e=ce(e),this._streaming||(this._encoder=new me(this._options)),this._streaming=Boolean(e.stream);for(var r,n=[],i=new he(function(t){for(var e=String(t),r=e.length,n=0,i=[];n<r;){var o=e.charCodeAt(n);if(o<55296||o>57343)i.push(o);else if(56320<=o&&o<=57343)i.push(65533);else if(55296<=o&&o<=56319)if(n===r-1)i.push(65533);else{var s=t.charCodeAt(n+1);if(56320<=s&&s<=57343){var a=1023&o,u=1023&s;i.push(65536+(a<<10)+u),n+=1}else i.push(65533)}n+=1}return i}(t));!i.endOfStream()&&(r=this._encoder.handler(i,i.read()))!==fe;)Array.isArray(r)?n.push.apply(n,r):n.push(r);if(!this._streaming){for(;(r=this._encoder.handler(i,i.read()))!==fe;)Array.isArray(r)?n.push.apply(n,r):n.push(r);this._encoder=null}return new Uint8Array(n)}};var we=r(Object.freeze({__proto__:null,TextEncoder:ye,TextDecoder:pe})),be=t&&t.__createBinding||(Object.create?function(t,e,r,n){void 0===n&&(n=r),Object.defineProperty(t,n,{enumerable:!0,get:function(){return e[r]}})}:function(t,e,r,n){void 0===n&&(n=r),t[n]=e[r]}),ve=t&&t.__setModuleDefault||(Object.create?function(t,e){Object.defineProperty(t,\"default\",{enumerable:!0,value:e})}:function(t,e){t.default=e}),xe=t&&t.__decorate||function(t,e,r,n){var i,o=arguments.length,s=o<3?e:null===n?n=Object.getOwnPropertyDescriptor(e,r):n;if(\"object\"==typeof Reflect&&\"function\"==typeof Reflect.decorate)s=Reflect.decorate(t,e,r,n);else for(var a=t.length-1;a>=0;a--)(i=t[a])&&(s=(o<3?i(s):o>3?i(e,r,s):i(e,r))||s);return o>3&&s&&Object.defineProperty(e,r,s),s},Ee=t&&t.__importStar||function(t){if(t&&t.__esModule)return t;var e={};if(null!=t)for(var r in t)\"default\"!==r&&Object.hasOwnProperty.call(t,r)&&be(e,t,r);return ve(e,t),e},Be=t&&t.__importDefault||function(t){return t&&t.__esModule?t:{default:t}};Object.defineProperty(ae,\"__esModule\",{value:!0});var Se=ae.deserializeUnchecked=We=ae.deserialize=Ne=ae.serialize=ae.BinaryReader=ae.BinaryWriter=ae.BorshError=ae.baseDecode=ae.baseEncode=void 0;const ke=Be(Zt),Me=Be(Qt),Ie=Ee(we),_e=new(\"function\"!=typeof TextDecoder?Ie.TextDecoder:TextDecoder)(\"utf-8\",{fatal:!0});ae.baseEncode=function(t){return\"string\"==typeof t&&(t=Buffer.from(t,\"utf8\")),Me.default.encode(Buffer.from(t))},ae.baseDecode=function(t){return Buffer.from(Me.default.decode(t))};const Ae=1024;class Oe extends Error{constructor(t){super(t),this.fieldPath=[],this.originalMessage=t}addToFieldPath(t){this.fieldPath.splice(0,0,t),this.message=this.originalMessage+\": \"+this.fieldPath.join(\".\")}}ae.BorshError=Oe;class Ue{constructor(){this.buf=Buffer.alloc(Ae),this.length=0}maybeResize(){this.buf.length<16+this.length&&(this.buf=Buffer.concat([this.buf,Buffer.alloc(Ae)]))}writeU8(t){this.maybeResize(),this.buf.writeUInt8(t,this.length),this.length+=1}writeU16(t){this.maybeResize(),this.buf.writeUInt16LE(t,this.length),this.length+=2}writeU32(t){this.maybeResize(),this.buf.writeUInt32LE(t,this.length),this.length+=4}writeU64(t){this.maybeResize(),this.writeBuffer(Buffer.from(new ke.default(t).toArray(\"le\",8)))}writeU128(t){this.maybeResize(),this.writeBuffer(Buffer.from(new ke.default(t).toArray(\"le\",16)))}writeU256(t){this.maybeResize(),this.writeBuffer(Buffer.from(new ke.default(t).toArray(\"le\",32)))}writeU512(t){this.maybeResize(),this.writeBuffer(Buffer.from(new ke.default(t).toArray(\"le\",64)))}writeBuffer(t){this.buf=Buffer.concat([Buffer.from(this.buf.subarray(0,this.length)),t,Buffer.alloc(Ae)]),this.length+=t.length}writeString(t){this.maybeResize();const e=Buffer.from(t,\"utf8\");this.writeU32(e.length),this.writeBuffer(e)}writeFixedArray(t){this.writeBuffer(Buffer.from(t))}writeArray(t,e){this.maybeResize(),this.writeU32(t.length);for(const r of t)this.maybeResize(),e(r)}toArray(){return this.buf.subarray(0,this.length)}}function Le(t,e,r){const n=r.value;r.value=function(...t){try{return n.apply(this,t)}catch(t){if(t instanceof RangeError){const e=t.code;if([\"ERR_BUFFER_OUT_OF_BOUNDS\",\"ERR_OUT_OF_RANGE\"].indexOf(e)>=0)throw new Oe(\"Reached the end of buffer when deserializing\")}throw t}}}ae.BinaryWriter=Ue;class Te{constructor(t){this.buf=t,this.offset=0}readU8(){const t=this.buf.readUInt8(this.offset);return this.offset+=1,t}readU16(){const t=this.buf.readUInt16LE(this.offset);return this.offset+=2,t}readU32(){const t=this.buf.readUInt32LE(this.offset);return this.offset+=4,t}readU64(){const t=this.readBuffer(8);return new ke.default(t,\"le\")}readU128(){const t=this.readBuffer(16);return new ke.default(t,\"le\")}readU256(){const t=this.readBuffer(32);return new ke.default(t,\"le\")}readU512(){const t=this.readBuffer(64);return new ke.default(t,\"le\")}readBuffer(t){if(this.offset+t>this.buf.length)throw new Oe(`Expected buffer length ${t} isn't within bounds`);const e=this.buf.slice(this.offset,this.offset+t);return this.offset+=t,e}readString(){const t=this.readU32(),e=this.readBuffer(t);try{return _e.decode(e)}catch(t){throw new Oe(`Error decoding UTF-8 string: ${t}`)}}readFixedArray(t){return new Uint8Array(this.readBuffer(t))}readArray(t){const e=this.readU32(),r=Array();for(let n=0;n<e;++n)r.push(t());return r}}function Pe(t){return t.charAt(0).toUpperCase()+t.slice(1)}function Re(t,e,r,n,i){try{if(\"string\"==typeof n)i[`write${Pe(n)}`](r);else if(n instanceof Array)if(\"number\"==typeof n[0]){if(r.length!==n[0])throw new Oe(`Expecting byte array of length ${n[0]}, but got ${r.length} bytes`);i.writeFixedArray(r)}else if(2===n.length&&\"number\"==typeof n[1]){if(r.length!==n[1])throw new Oe(`Expecting byte array of length ${n[1]}, but got ${r.length} bytes`);for(let e=0;e<n[1];e++)Re(t,null,r[e],n[0],i)}else i.writeArray(r,(r=>{Re(t,e,r,n[0],i)}));else if(void 0!==n.kind)switch(n.kind){case\"option\":null==r?i.writeU8(0):(i.writeU8(1),Re(t,e,r,n.type,i));break;case\"map\":i.writeU32(r.size),r.forEach(((r,o)=>{Re(t,e,o,n.key,i),Re(t,e,r,n.value,i)}));break;default:throw new Oe(`FieldType ${n} unrecognized`)}else je(t,r,i)}catch(t){throw t instanceof Oe&&t.addToFieldPath(e),t}}function je(t,e,r){if(\"function\"==typeof e.borshSerialize)return void e.borshSerialize(r);const n=t.get(e.constructor);if(!n)throw new Oe(`Class ${e.constructor.name} is missing in schema`);if(\"struct\"===n.kind)n.fields.map((([n,i])=>{Re(t,n,e[n],i,r)}));else{if(\"enum\"!==n.kind)throw new Oe(`Unexpected schema kind: ${n.kind} for ${e.constructor.name}`);{const i=e[n.field];for(let o=0;o<n.values.length;++o){const[s,a]=n.values[o];if(s===i){r.writeU8(o),Re(t,s,e[s],a,r);break}}}}}xe([Le],Te.prototype,\"readU8\",null),xe([Le],Te.prototype,\"readU16\",null),xe([Le],Te.prototype,\"readU32\",null),xe([Le],Te.prototype,\"readU64\",null),xe([Le],Te.prototype,\"readU128\",null),xe([Le],Te.prototype,\"readU256\",null),xe([Le],Te.prototype,\"readU512\",null),xe([Le],Te.prototype,\"readString\",null),xe([Le],Te.prototype,\"readFixedArray\",null),xe([Le],Te.prototype,\"readArray\",null),ae.BinaryReader=Te;var Ne=ae.serialize=function(t,e,r=Ue){const n=new r;return je(t,e,n),n.toArray()};function ze(t,e,r,n){try{if(\"string\"==typeof r)return n[`read${Pe(r)}`]();if(r instanceof Array){if(\"number\"==typeof r[0])return n.readFixedArray(r[0]);if(\"number\"==typeof r[1]){const e=[];for(let i=0;i<r[1];i++)e.push(ze(t,null,r[0],n));return e}return n.readArray((()=>ze(t,e,r[0],n)))}if(\"option\"===r.kind){return n.readU8()?ze(t,e,r.type,n):void 0}if(\"map\"===r.kind){let i=new Map;const o=n.readU32();for(let s=0;s<o;s++){const o=ze(t,e,r.key,n),s=ze(t,e,r.value,n);i.set(o,s)}return i}return Ce(t,r,n)}catch(t){throw t instanceof Oe&&t.addToFieldPath(e),t}}function Ce(t,e,r){if(\"function\"==typeof e.borshDeserialize)return e.borshDeserialize(r);const n=t.get(e);if(!n)throw new Oe(`Class ${e.name} is missing in schema`);if(\"struct\"===n.kind){const n={};for(const[i,o]of t.get(e).fields)n[i]=ze(t,i,o,r);return new e(n)}if(\"enum\"===n.kind){const i=r.readU8();if(i>=n.values.length)throw new Oe(`Enum index: ${i} is out of range`);const[o,s]=n.values[i];return new e({[o]:ze(t,o,s,r)})}throw new Oe(`Unexpected schema kind: ${n.kind} for ${e.constructor.name}`)}var We=ae.deserialize=function(t,e,r,n=Te){const i=new n(r),o=Ce(t,e,i);if(i.offset<r.length)throw new Oe(`Unexpected ${r.length-i.offset} bytes after deserialized data`);return o};Se=ae.deserializeUnchecked=function(t,e,r,n=Te){return Ce(t,e,new n(r))};var qe={};Object.defineProperty(qe,\"__esModule\",{value:!0}),qe.s16=qe.s8=qe.nu64be=qe.u48be=qe.u40be=qe.u32be=qe.u24be=qe.u16be=Ar=qe.nu64=qe.u48=qe.u40=_r=qe.u32=qe.u24=Ir=qe.u16=Mr=qe.u8=kr=qe.offset=qe.greedy=qe.Constant=qe.UTF8=qe.CString=qe.Blob=qe.Boolean=qe.BitField=qe.BitStructure=qe.VariantLayout=qe.Union=qe.UnionLayoutDiscriminator=qe.UnionDiscriminator=qe.Structure=qe.Sequence=qe.DoubleBE=qe.Double=qe.FloatBE=qe.Float=qe.NearInt64BE=qe.NearInt64=qe.NearUInt64BE=qe.NearUInt64=qe.IntBE=qe.Int=qe.UIntBE=qe.UInt=qe.OffsetLayout=qe.GreedyCount=qe.ExternalLayout=qe.bindConstructorLayout=qe.nameWithProperty=qe.Layout=qe.uint8ArrayToBuffer=qe.checkUint8Array=void 0,qe.constant=qe.utf8=qe.cstr=Tr=qe.blob=qe.unionLayoutDiscriminator=qe.union=Lr=qe.seq=qe.bits=Ur=qe.struct=qe.f64be=qe.f64=qe.f32be=qe.f32=qe.ns64be=qe.s48be=qe.s40be=qe.s32be=qe.s24be=qe.s16be=Or=qe.ns64=qe.s48=qe.s40=qe.s32=qe.s24=void 0;const Fe=n;function De(t){if(!(t instanceof Uint8Array))throw new TypeError(\"b must be a Uint8Array\")}function He(t){return De(t),Fe.Buffer.from(t.buffer,t.byteOffset,t.length)}qe.checkUint8Array=De,qe.uint8ArrayToBuffer=He;class Ve{constructor(t,e){if(!Number.isInteger(t))throw new TypeError(\"span must be an integer\");this.span=t,this.property=e}makeDestinationObject(){return{}}getSpan(t,e){if(0>this.span)throw new RangeError(\"indeterminate span\");return this.span}replicate(t){const e=Object.create(this.constructor.prototype);return Object.assign(e,this),e.property=t,e}fromArray(t){}}function Ke(t,e){return e.property?t+\"[\"+e.property+\"]\":t}qe.Layout=Ve,qe.nameWithProperty=Ke,qe.bindConstructorLayout=function(t,e){if(\"function\"!=typeof t)throw new TypeError(\"Class must be constructor\");if(Object.prototype.hasOwnProperty.call(t,\"layout_\"))throw new Error(\"Class is already bound to a layout\");if(!(e&&e instanceof Ve))throw new TypeError(\"layout must be a Layout\");if(Object.prototype.hasOwnProperty.call(e,\"boundConstructor_\"))throw new Error(\"layout is already bound to a constructor\");t.layout_=e,e.boundConstructor_=t,e.makeDestinationObject=()=>new t,Object.defineProperty(t.prototype,\"encode\",{value(t,r){return e.encode(this,t,r)},writable:!0}),Object.defineProperty(t,\"decode\",{value:(t,r)=>e.decode(t,r),writable:!0})};class $e extends Ve{isCount(){throw new Error(\"ExternalLayout is abstract\")}}qe.ExternalLayout=$e;class Ze extends $e{constructor(t=1,e){if(!Number.isInteger(t)||0>=t)throw new TypeError(\"elementSpan must be a (positive) integer\");super(-1,e),this.elementSpan=t}isCount(){return!0}decode(t,e=0){De(t);const r=t.length-e;return Math.floor(r/this.elementSpan)}encode(t,e,r){return 0}}qe.GreedyCount=Ze;class Ge extends $e{constructor(t,e=0,r){if(!(t instanceof Ve))throw new TypeError(\"layout must be a Layout\");if(!Number.isInteger(e))throw new TypeError(\"offset must be integer or undefined\");super(t.span,r||t.property),this.layout=t,this.offset=e}isCount(){return this.layout instanceof Ye||this.layout instanceof Je}decode(t,e=0){return this.layout.decode(t,e+this.offset)}encode(t,e,r=0){return this.layout.encode(t,e,r+this.offset)}}qe.OffsetLayout=Ge;class Ye extends Ve{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e=0){return He(t).readUIntLE(e,this.span)}encode(t,e,r=0){return He(e).writeUIntLE(t,r,this.span),this.span}}qe.UInt=Ye;class Je extends Ve{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e=0){return He(t).readUIntBE(e,this.span)}encode(t,e,r=0){return He(e).writeUIntBE(t,r,this.span),this.span}}qe.UIntBE=Je;class Xe extends Ve{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e=0){return He(t).readIntLE(e,this.span)}encode(t,e,r=0){return He(e).writeIntLE(t,r,this.span),this.span}}qe.Int=Xe;class Qe extends Ve{constructor(t,e){if(super(t,e),6<this.span)throw new RangeError(\"span must not exceed 6 bytes\")}decode(t,e=0){return He(t).readIntBE(e,this.span)}encode(t,e,r=0){return He(e).writeIntBE(t,r,this.span),this.span}}qe.IntBE=Qe;const tr=Math.pow(2,32);function er(t){const e=Math.floor(t/tr);return{hi32:e,lo32:t-e*tr}}function rr(t,e){return t*tr+e}class nr extends Ve{constructor(t){super(8,t)}decode(t,e=0){const r=He(t),n=r.readUInt32LE(e);return rr(r.readUInt32LE(e+4),n)}encode(t,e,r=0){const n=er(t),i=He(e);return i.writeUInt32LE(n.lo32,r),i.writeUInt32LE(n.hi32,r+4),8}}qe.NearUInt64=nr;class ir extends Ve{constructor(t){super(8,t)}decode(t,e=0){const r=He(t);return rr(r.readUInt32BE(e),r.readUInt32BE(e+4))}encode(t,e,r=0){const n=er(t),i=He(e);return i.writeUInt32BE(n.hi32,r),i.writeUInt32BE(n.lo32,r+4),8}}qe.NearUInt64BE=ir;class or extends Ve{constructor(t){super(8,t)}decode(t,e=0){const r=He(t),n=r.readUInt32LE(e);return rr(r.readInt32LE(e+4),n)}encode(t,e,r=0){const n=er(t),i=He(e);return i.writeUInt32LE(n.lo32,r),i.writeInt32LE(n.hi32,r+4),8}}qe.NearInt64=or;class sr extends Ve{constructor(t){super(8,t)}decode(t,e=0){const r=He(t);return rr(r.readInt32BE(e),r.readUInt32BE(e+4))}encode(t,e,r=0){const n=er(t),i=He(e);return i.writeInt32BE(n.hi32,r),i.writeUInt32BE(n.lo32,r+4),8}}qe.NearInt64BE=sr;class ar extends Ve{constructor(t){super(4,t)}decode(t,e=0){return He(t).readFloatLE(e)}encode(t,e,r=0){return He(e).writeFloatLE(t,r),4}}qe.Float=ar;class ur extends Ve{constructor(t){super(4,t)}decode(t,e=0){return He(t).readFloatBE(e)}encode(t,e,r=0){return He(e).writeFloatBE(t,r),4}}qe.FloatBE=ur;class cr extends Ve{constructor(t){super(8,t)}decode(t,e=0){return He(t).readDoubleLE(e)}encode(t,e,r=0){return He(e).writeDoubleLE(t,r),8}}qe.Double=cr;class hr extends Ve{constructor(t){super(8,t)}decode(t,e=0){return He(t).readDoubleBE(e)}encode(t,e,r=0){return He(e).writeDoubleBE(t,r),8}}qe.DoubleBE=hr;class fr extends Ve{constructor(t,e,r){if(!(t instanceof Ve))throw new TypeError(\"elementLayout must be a Layout\");if(!(e instanceof $e&&e.isCount()||Number.isInteger(e)&&0<=e))throw new TypeError(\"count must be non-negative integer or an unsigned integer ExternalLayout\");let n=-1;!(e instanceof $e)&&0<t.span&&(n=e*t.span),super(n,r),this.elementLayout=t,this.count=e}getSpan(t,e=0){if(0<=this.span)return this.span;let r=0,n=this.count;if(n instanceof $e&&(n=n.decode(t,e)),0<this.elementLayout.span)r=n*this.elementLayout.span;else{let i=0;for(;i<n;)r+=this.elementLayout.getSpan(t,e+r),++i}return r}decode(t,e=0){const r=[];let n=0,i=this.count;for(i instanceof $e&&(i=i.decode(t,e));n<i;)r.push(this.elementLayout.decode(t,e)),e+=this.elementLayout.getSpan(t,e),n+=1;return r}encode(t,e,r=0){const n=this.elementLayout,i=t.reduce(((t,i)=>t+n.encode(i,e,r+t)),0);return this.count instanceof $e&&this.count.encode(t.length,e,r),i}}qe.Sequence=fr;class lr extends Ve{constructor(t,e,r){if(!Array.isArray(t)||!t.reduce(((t,e)=>t&&e instanceof Ve),!0))throw new TypeError(\"fields must be array of Layout instances\");\"boolean\"==typeof e&&void 0===r&&(r=e,e=void 0);for(const e of t)if(0>e.span&&void 0===e.property)throw new Error(\"fields cannot contain unnamed variable-length layout\");let n=-1;try{n=t.reduce(((t,e)=>t+e.getSpan()),0)}catch(t){}super(n,e),this.fields=t,this.decodePrefixes=!!r}getSpan(t,e=0){if(0<=this.span)return this.span;let r=0;try{r=this.fields.reduce(((r,n)=>{const i=n.getSpan(t,e);return e+=i,r+i}),0)}catch(t){throw new RangeError(\"indeterminate span\")}return r}decode(t,e=0){De(t);const r=this.makeDestinationObject();for(const n of this.fields)if(void 0!==n.property&&(r[n.property]=n.decode(t,e)),e+=n.getSpan(t,e),this.decodePrefixes&&t.length===e)break;return r}encode(t,e,r=0){const n=r;let i=0,o=0;for(const n of this.fields){let s=n.span;if(o=0<s?s:0,void 0!==n.property){const i=t[n.property];void 0!==i&&(o=n.encode(i,e,r),0>s&&(s=n.getSpan(e,r)))}i=r,r+=s}return i+o-n}fromArray(t){const e=this.makeDestinationObject();for(const r of this.fields)void 0!==r.property&&0<t.length&&(e[r.property]=t.shift());return e}layoutFor(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");for(const e of this.fields)if(e.property===t)return e}offsetOf(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");let e=0;for(const r of this.fields){if(r.property===t)return e;0>r.span?e=-1:0<=e&&(e+=r.span)}}}qe.Structure=lr;class dr{constructor(t){this.property=t}decode(t,e){throw new Error(\"UnionDiscriminator is abstract\")}encode(t,e,r){throw new Error(\"UnionDiscriminator is abstract\")}}qe.UnionDiscriminator=dr;class pr extends dr{constructor(t,e){if(!(t instanceof $e&&t.isCount()))throw new TypeError(\"layout must be an unsigned integer ExternalLayout\");super(e||t.property||\"variant\"),this.layout=t}decode(t,e){return this.layout.decode(t,e)}encode(t,e,r){return this.layout.encode(t,e,r)}}qe.UnionLayoutDiscriminator=pr;class yr extends Ve{constructor(t,e,r){let n;if(t instanceof Ye||t instanceof Je)n=new pr(new Ge(t));else if(t instanceof $e&&t.isCount())n=new pr(t);else{if(!(t instanceof dr))throw new TypeError(\"discr must be a UnionDiscriminator or an unsigned integer layout\");n=t}if(void 0===e&&(e=null),!(null===e||e instanceof Ve))throw new TypeError(\"defaultLayout must be null or a Layout\");if(null!==e){if(0>e.span)throw new Error(\"defaultLayout must have constant span\");void 0===e.property&&(e=e.replicate(\"content\"))}let i=-1;e&&(i=e.span,0<=i&&(t instanceof Ye||t instanceof Je)&&(i+=n.layout.span)),super(i,r),this.discriminator=n,this.usesPrefixDiscriminator=t instanceof Ye||t instanceof Je,this.defaultLayout=e,this.registry={};let o=this.defaultGetSourceVariant.bind(this);this.getSourceVariant=function(t){return o(t)},this.configGetSourceVariant=function(t){o=t.bind(this)}}getSpan(t,e=0){if(0<=this.span)return this.span;const r=this.getVariant(t,e);if(!r)throw new Error(\"unable to determine span for unrecognized variant\");return r.getSpan(t,e)}defaultGetSourceVariant(t){if(Object.prototype.hasOwnProperty.call(t,this.discriminator.property)){if(this.defaultLayout&&this.defaultLayout.property&&Object.prototype.hasOwnProperty.call(t,this.defaultLayout.property))return;const e=this.registry[t[this.discriminator.property]];if(e&&(!e.layout||e.property&&Object.prototype.hasOwnProperty.call(t,e.property)))return e}else for(const e in this.registry){const r=this.registry[e];if(r.property&&Object.prototype.hasOwnProperty.call(t,r.property))return r}throw new Error(\"unable to infer src variant\")}decode(t,e=0){let r;const n=this.discriminator,i=n.decode(t,e),o=this.registry[i];if(void 0===o){const o=this.defaultLayout;let s=0;this.usesPrefixDiscriminator&&(s=n.layout.span),r=this.makeDestinationObject(),r[n.property]=i,r[o.property]=o.decode(t,e+s)}else r=o.decode(t,e);return r}encode(t,e,r=0){const n=this.getSourceVariant(t);if(void 0===n){const n=this.discriminator,i=this.defaultLayout;let o=0;return this.usesPrefixDiscriminator&&(o=n.layout.span),n.encode(t[n.property],e,r),o+i.encode(t[i.property],e,r+o)}return n.encode(t,e,r)}addVariant(t,e,r){const n=new gr(this,t,e,r);return this.registry[t]=n,n}getVariant(t,e=0){let r;return r=t instanceof Uint8Array?this.discriminator.decode(t,e):t,this.registry[r]}}qe.Union=yr;class gr extends Ve{constructor(t,e,r,n){if(!(t instanceof yr))throw new TypeError(\"union must be a Union\");if(!Number.isInteger(e)||0>e)throw new TypeError(\"variant must be a (non-negative) integer\");if(\"string\"==typeof r&&void 0===n&&(n=r,r=null),r){if(!(r instanceof Ve))throw new TypeError(\"layout must be a Layout\");if(null!==t.defaultLayout&&0<=r.span&&r.span>t.defaultLayout.span)throw new Error(\"variant span exceeds span of containing union\");if(\"string\"!=typeof n)throw new TypeError(\"variant must have a String property\")}let i=t.span;0>t.span&&(i=r?r.span:0,0<=i&&t.usesPrefixDiscriminator&&(i+=t.discriminator.layout.span)),super(i,n),this.union=t,this.variant=e,this.layout=r||null}getSpan(t,e=0){if(0<=this.span)return this.span;let r=0;this.union.usesPrefixDiscriminator&&(r=this.union.discriminator.layout.span);let n=0;return this.layout&&(n=this.layout.getSpan(t,e+r)),r+n}decode(t,e=0){const r=this.makeDestinationObject();if(this!==this.union.getVariant(t,e))throw new Error(\"variant mismatch\");let n=0;return this.union.usesPrefixDiscriminator&&(n=this.union.discriminator.layout.span),this.layout?r[this.property]=this.layout.decode(t,e+n):this.property?r[this.property]=!0:this.union.usesPrefixDiscriminator&&(r[this.union.discriminator.property]=this.variant),r}encode(t,e,r=0){let n=0;if(this.union.usesPrefixDiscriminator&&(n=this.union.discriminator.layout.span),this.layout&&!Object.prototype.hasOwnProperty.call(t,this.property))throw new TypeError(\"variant lacks property \"+this.property);this.union.discriminator.encode(this.variant,e,r);let i=n;if(this.layout&&(this.layout.encode(t[this.property],e,r+n),i+=this.layout.getSpan(e,r+n),0<=this.union.span&&i>this.union.span))throw new Error(\"encoded variant overruns containing union\");return i}fromArray(t){if(this.layout)return this.layout.fromArray(t)}}function mr(t){return 0>t&&(t+=4294967296),t}qe.VariantLayout=gr;class wr extends Ve{constructor(t,e,r){if(!(t instanceof Ye||t instanceof Je))throw new TypeError(\"word must be a UInt or UIntBE layout\");if(\"string\"==typeof e&&void 0===r&&(r=e,e=!1),4<t.span)throw new RangeError(\"word cannot exceed 32 bits\");super(t.span,r),this.word=t,this.msb=!!e,this.fields=[];let n=0;this._packedSetValue=function(t){return n=mr(t),this},this._packedGetValue=function(){return n}}decode(t,e=0){const r=this.makeDestinationObject(),n=this.word.decode(t,e);this._packedSetValue(n);for(const e of this.fields)void 0!==e.property&&(r[e.property]=e.decode(t));return r}encode(t,e,r=0){const n=this.word.decode(e,r);this._packedSetValue(n);for(const e of this.fields)if(void 0!==e.property){const r=t[e.property];void 0!==r&&e.encode(r)}return this.word.encode(this._packedGetValue(),e,r)}addField(t,e){const r=new br(this,t,e);return this.fields.push(r),r}addBoolean(t){const e=new vr(this,t);return this.fields.push(e),e}fieldFor(t){if(\"string\"!=typeof t)throw new TypeError(\"property must be string\");for(const e of this.fields)if(e.property===t)return e}}qe.BitStructure=wr;class br{constructor(t,e,r){if(!(t instanceof wr))throw new TypeError(\"container must be a BitStructure\");if(!Number.isInteger(e)||0>=e)throw new TypeError(\"bits must be positive integer\");const n=8*t.span,i=t.fields.reduce(((t,e)=>t+e.bits),0);if(e+i>n)throw new Error(\"bits too long for span remainder (\"+(n-i)+\" of \"+n+\" remain)\");this.container=t,this.bits=e,this.valueMask=(1<<e)-1,32===e&&(this.valueMask=4294967295),this.start=i,this.container.msb&&(this.start=n-i-e),this.wordMask=mr(this.valueMask<<this.start),this.property=r}decode(t,e){return mr(this.container._packedGetValue()&this.wordMask)>>>this.start}encode(t){if(\"number\"!=typeof t||!Number.isInteger(t)||t!==mr(t&this.valueMask))throw new TypeError(Ke(\"BitField.encode\",this)+\" value must be integer not exceeding \"+this.valueMask);const e=this.container._packedGetValue(),r=mr(t<<this.start);this.container._packedSetValue(mr(e&~this.wordMask)|r)}}qe.BitField=br;class vr extends br{constructor(t,e){super(t,1,e)}decode(t,e){return!!super.decode(t,e)}encode(t){\"boolean\"==typeof t&&(t=+t),super.encode(t)}}qe.Boolean=vr;class xr extends Ve{constructor(t,e){if(!(t instanceof $e&&t.isCount()||Number.isInteger(t)&&0<=t))throw new TypeError(\"length must be positive integer or an unsigned integer ExternalLayout\");let r=-1;t instanceof $e||(r=t),super(r,e),this.length=t}getSpan(t,e){let r=this.span;return 0>r&&(r=this.length.decode(t,e)),r}decode(t,e=0){let r=this.span;return 0>r&&(r=this.length.decode(t,e)),He(t).slice(e,e+r)}encode(t,e,r){let n=this.length;if(this.length instanceof $e&&(n=t.length),!(t instanceof Uint8Array&&n===t.length))throw new TypeError(Ke(\"Blob.encode\",this)+\" requires (length \"+n+\") Uint8Array as src\");if(r+n>e.length)throw new RangeError(\"encoding overruns Uint8Array\");const i=He(t);return He(e).write(i.toString(\"hex\"),r,n,\"hex\"),this.length instanceof $e&&this.length.encode(n,e,r),n}}qe.Blob=xr;class Er extends Ve{constructor(t){super(-1,t)}getSpan(t,e=0){De(t);let r=e;for(;r<t.length&&0!==t[r];)r+=1;return 1+r-e}decode(t,e=0){const r=this.getSpan(t,e);return He(t).slice(e,e+r-1).toString(\"utf-8\")}encode(t,e,r=0){\"string\"!=typeof t&&(t=String(t));const n=Fe.Buffer.from(t,\"utf8\"),i=n.length;if(r+i>e.length)throw new RangeError(\"encoding overruns Buffer\");const o=He(e);return n.copy(o,r),o[r+i]=0,i+1}}qe.CString=Er;class Br extends Ve{constructor(t,e){if(\"string\"==typeof t&&void 0===e&&(e=t,t=void 0),void 0===t)t=-1;else if(!Number.isInteger(t))throw new TypeError(\"maxSpan must be an integer\");super(-1,e),this.maxSpan=t}getSpan(t,e=0){return De(t),t.length-e}decode(t,e=0){const r=this.getSpan(t,e);if(0<=this.maxSpan&&this.maxSpan<r)throw new RangeError(\"text length exceeds maxSpan\");return He(t).slice(e,e+r).toString(\"utf-8\")}encode(t,e,r=0){\"string\"!=typeof t&&(t=String(t));const n=Fe.Buffer.from(t,\"utf8\"),i=n.length;if(0<=this.maxSpan&&this.maxSpan<i)throw new RangeError(\"text length exceeds maxSpan\");if(r+i>e.length)throw new RangeError(\"encoding overruns Buffer\");return n.copy(He(e),r),i}}qe.UTF8=Br;class Sr extends Ve{constructor(t,e){super(0,e),this.value=t}decode(t,e){return this.value}encode(t,e,r){return 0}}qe.Constant=Sr,qe.greedy=(t,e)=>new Ze(t,e);var kr=qe.offset=(t,e,r)=>new Ge(t,e,r),Mr=qe.u8=t=>new Ye(1,t),Ir=qe.u16=t=>new Ye(2,t);qe.u24=t=>new Ye(3,t);var _r=qe.u32=t=>new Ye(4,t);qe.u40=t=>new Ye(5,t),qe.u48=t=>new Ye(6,t);var Ar=qe.nu64=t=>new nr(t);qe.u16be=t=>new Je(2,t),qe.u24be=t=>new Je(3,t),qe.u32be=t=>new Je(4,t),qe.u40be=t=>new Je(5,t),qe.u48be=t=>new Je(6,t),qe.nu64be=t=>new ir(t),qe.s8=t=>new Xe(1,t),qe.s16=t=>new Xe(2,t),qe.s24=t=>new Xe(3,t),qe.s32=t=>new Xe(4,t),qe.s40=t=>new Xe(5,t),qe.s48=t=>new Xe(6,t);var Or=qe.ns64=t=>new or(t);qe.s16be=t=>new Qe(2,t),qe.s24be=t=>new Qe(3,t),qe.s32be=t=>new Qe(4,t),qe.s40be=t=>new Qe(5,t),qe.s48be=t=>new Qe(6,t),qe.ns64be=t=>new sr(t),qe.f32=t=>new ar(t),qe.f32be=t=>new ur(t),qe.f64=t=>new cr(t),qe.f64be=t=>new hr(t);var Ur=qe.struct=(t,e,r)=>new lr(t,e,r);qe.bits=(t,e,r)=>new wr(t,e,r);var Lr=qe.seq=(t,e,r)=>new fr(t,e,r);qe.union=(t,e,r)=>new yr(t,e,r),qe.unionLayoutDiscriminator=(t,e)=>new pr(t,e);var Tr=qe.blob=(t,e)=>new xr(t,e);qe.cstr=t=>new Er(t),qe.utf8=(t,e)=>new Br(t,e),qe.constant=(t,e)=>new Sr(t,e);var Pr={};Object.defineProperty(Pr,\"__esModule\",{value:!0});var Rr=Pr.toBigIntLE=function(t){{const e=Buffer.from(t);e.reverse();const r=e.toString(\"hex\");return 0===r.length?BigInt(0):BigInt(`0x${r}`)}};Pr.toBigIntBE=function(t){{const e=t.toString(\"hex\");return 0===e.length?BigInt(0):BigInt(`0x${e}`)}};var jr,Nr=Pr.toBufferLE=function(t,e){{const r=t.toString(16),n=Buffer.from(r.padStart(2*e,\"0\").slice(0,2*e),\"hex\");return n.reverse(),n}};Pr.toBufferBE=function(t,e){{const r=t.toString(16);return Buffer.from(r.padStart(2*e,\"0\").slice(0,2*e),\"hex\")}};class zr extends TypeError{constructor(t,e){let r;const{message:n,...i}=t,{path:o}=t;super(0===o.length?n:\"At path: \"+o.join(\".\")+\" -- \"+n),Object.assign(this,i),this.name=this.constructor.name,this.failures=()=>{var n;return null!=(n=r)?n:r=[t,...e()]}}}function Cr(t){return\"object\"==typeof t&&null!=t}function Wr(t){return\"string\"==typeof t?JSON.stringify(t):\"\"+t}function qr(t,e,r,n){if(!0===t)return;!1===t?t={}:\"string\"==typeof t&&(t={message:t});const{path:i,branch:o}=e,{type:s}=r,{refinement:a,message:u=\"Expected a value of type `\"+s+\"`\"+(a?\" with refinement `\"+a+\"`\":\"\")+\", but received: `\"+Wr(n)+\"`\"}=t;return{value:n,type:s,refinement:a,key:i[i.length-1],path:i,branch:o,...t,message:u}}function*Fr(t,e,r,n){var i;Cr(i=t)&&\"function\"==typeof i[Symbol.iterator]||(t=[t]);for(const i of t){const t=qr(i,e,r,n);t&&(yield t)}}function*Dr(t,e,r={}){const{path:n=[],branch:i=[t],coerce:o=!1,mask:s=!1}=r,a={path:n,branch:i};if(o&&(t=e.coercer(t,a),s&&\"type\"!==e.type&&Cr(e.schema)&&Cr(t)&&!Array.isArray(t)))for(const r in t)void 0===e.schema[r]&&delete t[r];let u=!0;for(const r of e.validator(t,a))u=!1,yield[r,void 0];for(let[r,c,h]of e.entries(t,a)){const e=Dr(c,h,{path:void 0===r?n:[...n,r],branch:void 0===r?i:[...i,c],coerce:o,mask:s});for(const n of e)n[0]?(u=!1,yield[n[0],void 0]):o&&(c=n[1],void 0===r?t=c:t instanceof Map?t.set(r,c):t instanceof Set?t.add(c):Cr(t)&&(t[r]=c))}if(u)for(const r of e.refiner(t,a))u=!1,yield[r,void 0];u&&(yield[void 0,t])}class Hr{constructor(t){const{type:e,schema:r,validator:n,refiner:i,coercer:o=(t=>t),entries:s=function*(){}}=t;this.type=e,this.schema=r,this.entries=s,this.coercer=o,this.validator=n?(t,e)=>Fr(n(t,e),e,this,t):()=>[],this.refiner=i?(t,e)=>Fr(i(t,e),e,this,t):()=>[]}assert(t){return function(t,e){const r=$r(t,e);if(r[0])throw r[0]}(t,this)}create(t){return Vr(t,this)}is(t){return Kr(t,this)}mask(t){return function(t,e){const r=$r(t,e,{coerce:!0,mask:!0});if(r[0])throw r[0];return r[1]}(t,this)}validate(t,e={}){return $r(t,this,e)}}function Vr(t,e){const r=$r(t,e,{coerce:!0});if(r[0])throw r[0];return r[1]}function Kr(t,e){return!$r(t,e)[0]}function $r(t,e,r={}){const n=Dr(t,e,r),i=function(t){const{done:e,value:r}=t.next();return e?void 0:r}(n);if(i[0]){return[new zr(i[0],(function*(){for(const t of n)t[0]&&(yield t[0])})),void 0]}return[void 0,i[1]]}function Zr(t,e){return new Hr({type:t,schema:null,validator:e})}function Gr(t){return new Hr({type:\"array\",schema:t,*entries(e){if(t&&Array.isArray(e))for(const[r,n]of e.entries())yield[r,n,t]},coercer:t=>Array.isArray(t)?t.slice():t,validator:t=>Array.isArray(t)||\"Expected an array value, but received: \"+Wr(t)})}function Yr(){return Zr(\"boolean\",(t=>\"boolean\"==typeof t))}function Jr(t){return Zr(\"instance\",(e=>e instanceof t||\"Expected a `\"+t.name+\"` instance, but received: \"+Wr(e)))}function Xr(t){const e=Wr(t),r=typeof t;return new Hr({type:\"literal\",schema:\"string\"===r||\"number\"===r||\"boolean\"===r?t:null,validator:r=>r===t||\"Expected the literal `\"+e+\"`, but received: \"+Wr(r)})}function Qr(t){return new Hr({...t,validator:(e,r)=>null===e||t.validator(e,r),refiner:(e,r)=>null===e||t.refiner(e,r)})}function tn(){return Zr(\"number\",(t=>\"number\"==typeof t&&!isNaN(t)||\"Expected a number, but received: \"+Wr(t)))}function en(t){return new Hr({...t,validator:(e,r)=>void 0===e||t.validator(e,r),refiner:(e,r)=>void 0===e||t.refiner(e,r)})}function rn(t,e){return new Hr({type:\"record\",schema:null,*entries(r){if(Cr(r))for(const n in r){const i=r[n];yield[n,n,t],yield[n,i,e]}},validator:t=>Cr(t)||\"Expected an object, but received: \"+Wr(t)})}function nn(){return Zr(\"string\",(t=>\"string\"==typeof t||\"Expected a string, but received: \"+Wr(t)))}function on(t){const e=Zr(\"never\",(()=>!1));return new Hr({type:\"tuple\",schema:null,*entries(r){if(Array.isArray(r)){const n=Math.max(t.length,r.length);for(let i=0;i<n;i++)yield[i,r[i],t[i]||e]}},validator:t=>Array.isArray(t)||\"Expected an array, but received: \"+Wr(t)})}function sn(t){const e=Object.keys(t);return new Hr({type:\"type\",schema:t,*entries(r){if(Cr(r))for(const n of e)yield[n,r[n],t[n]]},validator:t=>Cr(t)||\"Expected an object, but received: \"+Wr(t)})}function an(t){const e=t.map((t=>t.type)).join(\" | \");return new Hr({type:\"union\",schema:null,validator(r,n){const i=[];for(const e of t){const[...t]=Dr(r,e,n),[o]=t;if(!o[0])return[];for(const[e]of t)e&&i.push(e)}return[\"Expected the value to satisfy a union of `\"+e+\"`, but received: \"+Wr(r),...i]}})}function un(){return Zr(\"unknown\",(()=>!0))}function cn(t,e,r){return new Hr({...t,coercer:(n,i)=>Kr(n,e)?t.coercer(r(n,i),i):t.coercer(n,i)})}var hn=new Uint8Array(16);function fn(){if(!jr&&!(jr=\"undefined\"!=typeof crypto&&crypto.getRandomValues&&crypto.getRandomValues.bind(crypto)||\"undefined\"!=typeof msCrypto&&\"function\"==typeof msCrypto.getRandomValues&&msCrypto.getRandomValues.bind(msCrypto)))throw new Error(\"crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported\");return jr(hn)}var ln=/^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i;function dn(t){return\"string\"==typeof t&&ln.test(t)}for(var pn,yn,gn=[],mn=0;mn<256;++mn)gn.push((mn+256).toString(16).substr(1));function wn(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:0,r=(gn[t[e+0]]+gn[t[e+1]]+gn[t[e+2]]+gn[t[e+3]]+\"-\"+gn[t[e+4]]+gn[t[e+5]]+\"-\"+gn[t[e+6]]+gn[t[e+7]]+\"-\"+gn[t[e+8]]+gn[t[e+9]]+\"-\"+gn[t[e+10]]+gn[t[e+11]]+gn[t[e+12]]+gn[t[e+13]]+gn[t[e+14]]+gn[t[e+15]]).toLowerCase();if(!dn(r))throw TypeError(\"Stringified UUID is invalid\");return r}var bn=0,vn=0;function xn(t){if(!dn(t))throw TypeError(\"Invalid UUID\");var e,r=new Uint8Array(16);return r[0]=(e=parseInt(t.slice(0,8),16))>>>24,r[1]=e>>>16&255,r[2]=e>>>8&255,r[3]=255&e,r[4]=(e=parseInt(t.slice(9,13),16))>>>8,r[5]=255&e,r[6]=(e=parseInt(t.slice(14,18),16))>>>8,r[7]=255&e,r[8]=(e=parseInt(t.slice(19,23),16))>>>8,r[9]=255&e,r[10]=(e=parseInt(t.slice(24,36),16))/1099511627776&255,r[11]=e/4294967296&255,r[12]=e>>>24&255,r[13]=e>>>16&255,r[14]=e>>>8&255,r[15]=255&e,r}function En(t,e,r){function n(t,n,i,o){if(\"string\"==typeof t&&(t=function(t){t=unescape(encodeURIComponent(t));for(var e=[],r=0;r<t.length;++r)e.push(t.charCodeAt(r));return e}(t)),\"string\"==typeof n&&(n=xn(n)),16!==n.length)throw TypeError(\"Namespace must be array-like (16 iterable integer values, 0-255)\");var s=new Uint8Array(16+t.length);if(s.set(n),s.set(t,n.length),(s=r(s))[6]=15&s[6]|e,s[8]=63&s[8]|128,i){o=o||0;for(var a=0;a<16;++a)i[o+a]=s[a];return i}return wn(s)}try{n.name=t}catch(t){}return n.DNS=\"6ba7b810-9dad-11d1-80b4-00c04fd430c8\",n.URL=\"6ba7b811-9dad-11d1-80b4-00c04fd430c8\",n}function Bn(t){return 14+(t+64>>>9<<4)+1}function Sn(t,e){var r=(65535&t)+(65535&e);return(t>>16)+(e>>16)+(r>>16)<<16|65535&r}function kn(t,e,r,n,i,o){return Sn((s=Sn(Sn(e,t),Sn(n,o)))<<(a=i)|s>>>32-a,r);var s,a}function Mn(t,e,r,n,i,o,s){return kn(e&r|~e&n,t,e,i,o,s)}function In(t,e,r,n,i,o,s){return kn(e&n|r&~n,t,e,i,o,s)}function _n(t,e,r,n,i,o,s){return kn(e^r^n,t,e,i,o,s)}function An(t,e,r,n,i,o,s){return kn(r^(e|~n),t,e,i,o,s)}var On=En(\"v3\",48,(function(t){if(\"string\"==typeof t){var e=unescape(encodeURIComponent(t));t=new Uint8Array(e.length);for(var r=0;r<e.length;++r)t[r]=e.charCodeAt(r)}return function(t){for(var e=[],r=32*t.length,n=\"0123456789abcdef\",i=0;i<r;i+=8){var o=t[i>>5]>>>i%32&255,s=parseInt(n.charAt(o>>>4&15)+n.charAt(15&o),16);e.push(s)}return e}(function(t,e){t[e>>5]|=128<<e%32,t[Bn(e)-1]=e;for(var r=1732584193,n=-271733879,i=-1732584194,o=271733878,s=0;s<t.length;s+=16){var a=r,u=n,c=i,h=o;r=Mn(r,n,i,o,t[s],7,-680876936),o=Mn(o,r,n,i,t[s+1],12,-389564586),i=Mn(i,o,r,n,t[s+2],17,606105819),n=Mn(n,i,o,r,t[s+3],22,-1044525330),r=Mn(r,n,i,o,t[s+4],7,-176418897),o=Mn(o,r,n,i,t[s+5],12,1200080426),i=Mn(i,o,r,n,t[s+6],17,-1473231341),n=Mn(n,i,o,r,t[s+7],22,-45705983),r=Mn(r,n,i,o,t[s+8],7,1770035416),o=Mn(o,r,n,i,t[s+9],12,-1958414417),i=Mn(i,o,r,n,t[s+10],17,-42063),n=Mn(n,i,o,r,t[s+11],22,-1990404162),r=Mn(r,n,i,o,t[s+12],7,1804603682),o=Mn(o,r,n,i,t[s+13],12,-40341101),i=Mn(i,o,r,n,t[s+14],17,-1502002290),r=In(r,n=Mn(n,i,o,r,t[s+15],22,1236535329),i,o,t[s+1],5,-165796510),o=In(o,r,n,i,t[s+6],9,-1069501632),i=In(i,o,r,n,t[s+11],14,643717713),n=In(n,i,o,r,t[s],20,-373897302),r=In(r,n,i,o,t[s+5],5,-701558691),o=In(o,r,n,i,t[s+10],9,38016083),i=In(i,o,r,n,t[s+15],14,-660478335),n=In(n,i,o,r,t[s+4],20,-405537848),r=In(r,n,i,o,t[s+9],5,568446438),o=In(o,r,n,i,t[s+14],9,-1019803690),i=In(i,o,r,n,t[s+3],14,-187363961),n=In(n,i,o,r,t[s+8],20,1163531501),r=In(r,n,i,o,t[s+13],5,-1444681467),o=In(o,r,n,i,t[s+2],9,-51403784),i=In(i,o,r,n,t[s+7],14,1735328473),r=_n(r,n=In(n,i,o,r,t[s+12],20,-1926607734),i,o,t[s+5],4,-378558),o=_n(o,r,n,i,t[s+8],11,-2022574463),i=_n(i,o,r,n,t[s+11],16,1839030562),n=_n(n,i,o,r,t[s+14],23,-35309556),r=_n(r,n,i,o,t[s+1],4,-1530992060),o=_n(o,r,n,i,t[s+4],11,1272893353),i=_n(i,o,r,n,t[s+7],16,-155497632),n=_n(n,i,o,r,t[s+10],23,-1094730640),r=_n(r,n,i,o,t[s+13],4,681279174),o=_n(o,r,n,i,t[s],11,-358537222),i=_n(i,o,r,n,t[s+3],16,-722521979),n=_n(n,i,o,r,t[s+6],23,76029189),r=_n(r,n,i,o,t[s+9],4,-640364487),o=_n(o,r,n,i,t[s+12],11,-421815835),i=_n(i,o,r,n,t[s+15],16,530742520),r=An(r,n=_n(n,i,o,r,t[s+2],23,-995338651),i,o,t[s],6,-198630844),o=An(o,r,n,i,t[s+7],10,1126891415),i=An(i,o,r,n,t[s+14],15,-1416354905),n=An(n,i,o,r,t[s+5],21,-57434055),r=An(r,n,i,o,t[s+12],6,1700485571),o=An(o,r,n,i,t[s+3],10,-1894986606),i=An(i,o,r,n,t[s+10],15,-1051523),n=An(n,i,o,r,t[s+1],21,-2054922799),r=An(r,n,i,o,t[s+8],6,1873313359),o=An(o,r,n,i,t[s+15],10,-30611744),i=An(i,o,r,n,t[s+6],15,-1560198380),n=An(n,i,o,r,t[s+13],21,1309151649),r=An(r,n,i,o,t[s+4],6,-145523070),o=An(o,r,n,i,t[s+11],10,-1120210379),i=An(i,o,r,n,t[s+2],15,718787259),n=An(n,i,o,r,t[s+9],21,-343485551),r=Sn(r,a),n=Sn(n,u),i=Sn(i,c),o=Sn(o,h)}return[r,n,i,o]}(function(t){if(0===t.length)return[];for(var e=8*t.length,r=new Uint32Array(Bn(e)),n=0;n<e;n+=8)r[n>>5]|=(255&t[n/8])<<n%32;return r}(t),8*t.length))})),Un=On;function Ln(t,e,r,n){switch(t){case 0:return e&r^~e&n;case 1:case 3:return e^r^n;case 2:return e&r^e&n^r&n}}function Tn(t,e){return t<<e|t>>>32-e}var Pn=En(\"v5\",80,(function(t){var e=[1518500249,1859775393,2400959708,3395469782],r=[1732584193,4023233417,2562383102,271733878,3285377520];if(\"string\"==typeof t){var n=unescape(encodeURIComponent(t));t=[];for(var i=0;i<n.length;++i)t.push(n.charCodeAt(i))}else Array.isArray(t)||(t=Array.prototype.slice.call(t));t.push(128);for(var o=t.length/4+2,s=Math.ceil(o/16),a=new Array(s),u=0;u<s;++u){for(var c=new Uint32Array(16),h=0;h<16;++h)c[h]=t[64*u+4*h]<<24|t[64*u+4*h+1]<<16|t[64*u+4*h+2]<<8|t[64*u+4*h+3];a[u]=c}a[s-1][14]=8*(t.length-1)/Math.pow(2,32),a[s-1][14]=Math.floor(a[s-1][14]),a[s-1][15]=8*(t.length-1)&4294967295;for(var f=0;f<s;++f){for(var l=new Uint32Array(80),d=0;d<16;++d)l[d]=a[f][d];for(var p=16;p<80;++p)l[p]=Tn(l[p-3]^l[p-8]^l[p-14]^l[p-16],1);for(var y=r[0],g=r[1],m=r[2],w=r[3],b=r[4],v=0;v<80;++v){var x=Math.floor(v/20),E=Tn(y,5)+Ln(x,g,m,w)+b+e[x]+l[v]>>>0;b=w,w=m,m=Tn(g,30)>>>0,g=y,y=E}r[0]=r[0]+y>>>0,r[1]=r[1]+g>>>0,r[2]=r[2]+m>>>0,r[3]=r[3]+w>>>0,r[4]=r[4]+b>>>0}return[r[0]>>24&255,r[0]>>16&255,r[0]>>8&255,255&r[0],r[1]>>24&255,r[1]>>16&255,r[1]>>8&255,255&r[1],r[2]>>24&255,r[2]>>16&255,r[2]>>8&255,255&r[2],r[3]>>24&255,r[3]>>16&255,r[3]>>8&255,255&r[3],r[4]>>24&255,r[4]>>16&255,r[4]>>8&255,255&r[4]]})),Rn=Pn;var jn=Object.freeze({__proto__:null,v1:function(t,e,r){var n=e&&r||0,i=e||new Array(16),o=(t=t||{}).node||pn,s=void 0!==t.clockseq?t.clockseq:yn;if(null==o||null==s){var a=t.random||(t.rng||fn)();null==o&&(o=pn=[1|a[0],a[1],a[2],a[3],a[4],a[5]]),null==s&&(s=yn=16383&(a[6]<<8|a[7]))}var u=void 0!==t.msecs?t.msecs:Date.now(),c=void 0!==t.nsecs?t.nsecs:vn+1,h=u-bn+(c-vn)/1e4;if(h<0&&void 0===t.clockseq&&(s=s+1&16383),(h<0||u>bn)&&void 0===t.nsecs&&(c=0),c>=1e4)throw new Error(\"uuid.v1(): Can't create more than 10M uuids/sec\");bn=u,vn=c,yn=s;var f=(1e4*(268435455&(u+=122192928e5))+c)%4294967296;i[n++]=f>>>24&255,i[n++]=f>>>16&255,i[n++]=f>>>8&255,i[n++]=255&f;var l=u/4294967296*1e4&268435455;i[n++]=l>>>8&255,i[n++]=255&l,i[n++]=l>>>24&15|16,i[n++]=l>>>16&255,i[n++]=s>>>8|128,i[n++]=255&s;for(var d=0;d<6;++d)i[n+d]=o[d];return e||wn(i)},v3:Un,v4:function(t,e,r){var n=(t=t||{}).random||(t.rng||fn)();if(n[6]=15&n[6]|64,n[8]=63&n[8]|128,e){r=r||0;for(var i=0;i<16;++i)e[r+i]=n[i];return e}return wn(n)},v5:Rn,NIL:\"00000000-0000-0000-0000-000000000000\",version:function(t){if(!dn(t))throw TypeError(\"Invalid UUID\");return parseInt(t.substr(14,1),16)},validate:dn,stringify:wn,parse:xn}),Nn=r(jn);const zn=Nn.v4;var Cn=function(t,e,r,n){if(\"string\"!=typeof t)throw new TypeError(t+\" must be a string\");const i=\"number\"==typeof(n=n||{}).version?n.version:2;if(1!==i&&2!==i)throw new TypeError(i+\" must be 1 or 2\");const o={method:t};if(2===i&&(o.jsonrpc=\"2.0\"),e){if(\"object\"!=typeof e&&!Array.isArray(e))throw new TypeError(e+\" must be an object, array or omitted\");o.params=e}if(void 0===r){const t=\"function\"==typeof n.generator?n.generator:function(){return zn()};o.id=t(o,n)}else 2===i&&null===r?n.notificationIdNull&&(o.id=null):o.id=r;return o};const Wn=Nn.v4,qn=Cn,Fn=function(t,e){if(!(this instanceof Fn))return new Fn(t,e);e||(e={}),this.options={reviver:void 0!==e.reviver?e.reviver:null,replacer:void 0!==e.replacer?e.replacer:null,generator:void 0!==e.generator?e.generator:function(){return Wn()},version:void 0!==e.version?e.version:2,notificationIdNull:\"boolean\"==typeof e.notificationIdNull&&e.notificationIdNull},this.callServer=t};Fn.prototype.request=function(t,e,r,n){const i=this;let o=null;const s=Array.isArray(t)&&\"function\"==typeof e;if(1===this.options.version&&s)throw new TypeError(\"JSON-RPC 1.0 does not support batching\");if(s||!s&&t&&\"object\"==typeof t&&\"function\"==typeof e)n=e,o=t;else{\"function\"==typeof r&&(n=r,r=void 0);const i=\"function\"==typeof n;try{o=qn(t,e,r,{generator:this.options.generator,version:this.options.version,notificationIdNull:this.options.notificationIdNull})}catch(t){if(i)return n(t);throw t}if(!i)return o}let a;try{a=JSON.stringify(o,this.options.replacer)}catch(t){return n(t)}return this.callServer(a,(function(t,e){i._parseResponse(t,e,n)})),o},Fn.prototype._parseResponse=function(t,e,r){if(t)return void r(t);if(!e)return r();let n;try{n=JSON.parse(e,this.options.reviver)}catch(t){return r(t)}if(3===r.length){if(Array.isArray(n)){const t=function(t){return void 0!==t.error},e=function(e){return!t(e)};return r(null,n.filter(t),n.filter(e))}return r(null,n.error,n.result)}r(null,n)};var Dn,Hn={exports:{}};(Dn=Hn).exports=function(t){return t&&t.__esModule?t:{default:t}},Dn.exports.__esModule=!0,Dn.exports.default=Dn.exports;var Vn,Kn,$n,Zn,Gn=Hn.exports,Yn={exports:{}},Jn={exports:{}};function Xn(){return Vn||(Vn=1,function(t){function e(r){return t.exports=e=\"function\"==typeof Symbol&&\"symbol\"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&\"function\"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?\"symbol\":typeof t},t.exports.__esModule=!0,t.exports.default=t.exports,e(r)}t.exports=e,t.exports.__esModule=!0,t.exports.default=t.exports}(Jn)),Jn.exports}function Qn(){if(Zn)return $n;Zn=1;var t=(Kn||(Kn=1,function(t){var e=Xn().default;function r(){\n/*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */\nt.exports=r=function(){return i},t.exports.__esModule=!0,t.exports.default=t.exports;var n,i={},o=Object.prototype,s=o.hasOwnProperty,a=Object.defineProperty||function(t,e,r){t[e]=r.value},u=\"function\"==typeof Symbol?Symbol:{},c=u.iterator||\"@@iterator\",h=u.asyncIterator||\"@@asyncIterator\",f=u.toStringTag||\"@@toStringTag\";function l(t,e,r){return Object.defineProperty(t,e,{value:r,enumerable:!0,configurable:!0,writable:!0}),t[e]}try{l({},\"\")}catch(n){l=function(t,e,r){return t[e]=r}}function d(t,e,r,n){var i=e&&e.prototype instanceof v?e:v,o=Object.create(i.prototype),s=new T(n||[]);return a(o,\"_invoke\",{value:A(t,r,s)}),o}function p(t,e,r){try{return{type:\"normal\",arg:t.call(e,r)}}catch(t){return{type:\"throw\",arg:t}}}i.wrap=d;var y=\"suspendedStart\",g=\"suspendedYield\",m=\"executing\",w=\"completed\",b={};function v(){}function x(){}function E(){}var B={};l(B,c,(function(){return this}));var S=Object.getPrototypeOf,k=S&&S(S(P([])));k&&k!==o&&s.call(k,c)&&(B=k);var M=E.prototype=v.prototype=Object.create(B);function I(t){[\"next\",\"throw\",\"return\"].forEach((function(e){l(t,e,(function(t){return this._invoke(e,t)}))}))}function _(t,r){function n(i,o,a,u){var c=p(t[i],t,o);if(\"throw\"!==c.type){var h=c.arg,f=h.value;return f&&\"object\"==e(f)&&s.call(f,\"__await\")?r.resolve(f.__await).then((function(t){n(\"next\",t,a,u)}),(function(t){n(\"throw\",t,a,u)})):r.resolve(f).then((function(t){h.value=t,a(h)}),(function(t){return n(\"throw\",t,a,u)}))}u(c.arg)}var i;a(this,\"_invoke\",{value:function(t,e){function o(){return new r((function(r,i){n(t,e,r,i)}))}return i=i?i.then(o,o):o()}})}function A(t,e,r){var i=y;return function(o,s){if(i===m)throw new Error(\"Generator is already running\");if(i===w){if(\"throw\"===o)throw s;return{value:n,done:!0}}for(r.method=o,r.arg=s;;){var a=r.delegate;if(a){var u=O(a,r);if(u){if(u===b)continue;return u}}if(\"next\"===r.method)r.sent=r._sent=r.arg;else if(\"throw\"===r.method){if(i===y)throw i=w,r.arg;r.dispatchException(r.arg)}else\"return\"===r.method&&r.abrupt(\"return\",r.arg);i=m;var c=p(t,e,r);if(\"normal\"===c.type){if(i=r.done?w:g,c.arg===b)continue;return{value:c.arg,done:r.done}}\"throw\"===c.type&&(i=w,r.method=\"throw\",r.arg=c.arg)}}}function O(t,e){var r=e.method,i=t.iterator[r];if(i===n)return e.delegate=null,\"throw\"===r&&t.iterator.return&&(e.method=\"return\",e.arg=n,O(t,e),\"throw\"===e.method)||\"return\"!==r&&(e.method=\"throw\",e.arg=new TypeError(\"The iterator does not provide a '\"+r+\"' method\")),b;var o=p(i,t.iterator,e.arg);if(\"throw\"===o.type)return e.method=\"throw\",e.arg=o.arg,e.delegate=null,b;var s=o.arg;return s?s.done?(e[t.resultName]=s.value,e.next=t.nextLoc,\"return\"!==e.method&&(e.method=\"next\",e.arg=n),e.delegate=null,b):s:(e.method=\"throw\",e.arg=new TypeError(\"iterator result is not an object\"),e.delegate=null,b)}function U(t){var e={tryLoc:t[0]};1 in t&&(e.catchLoc=t[1]),2 in t&&(e.finallyLoc=t[2],e.afterLoc=t[3]),this.tryEntries.push(e)}function L(t){var e=t.completion||{};e.type=\"normal\",delete e.arg,t.completion=e}function T(t){this.tryEntries=[{tryLoc:\"root\"}],t.forEach(U,this),this.reset(!0)}function P(t){if(t||\"\"===t){var r=t[c];if(r)return r.call(t);if(\"function\"==typeof t.next)return t;if(!isNaN(t.length)){var i=-1,o=function e(){for(;++i<t.length;)if(s.call(t,i))return e.value=t[i],e.done=!1,e;return e.value=n,e.done=!0,e};return o.next=o}}throw new TypeError(e(t)+\" is not iterable\")}return x.prototype=E,a(M,\"constructor\",{value:E,configurable:!0}),a(E,\"constructor\",{value:x,configurable:!0}),x.displayName=l(E,f,\"GeneratorFunction\"),i.isGeneratorFunction=function(t){var e=\"function\"==typeof t&&t.constructor;return!!e&&(e===x||\"GeneratorFunction\"===(e.displayName||e.name))},i.mark=function(t){return Object.setPrototypeOf?Object.setPrototypeOf(t,E):(t.__proto__=E,l(t,f,\"GeneratorFunction\")),t.prototype=Object.create(M),t},i.awrap=function(t){return{__await:t}},I(_.prototype),l(_.prototype,h,(function(){return this})),i.AsyncIterator=_,i.async=function(t,e,r,n,o){void 0===o&&(o=Promise);var s=new _(d(t,e,r,n),o);return i.isGeneratorFunction(e)?s:s.next().then((function(t){return t.done?t.value:s.next()}))},I(M),l(M,f,\"Generator\"),l(M,c,(function(){return this})),l(M,\"toString\",(function(){return\"[object Generator]\"})),i.keys=function(t){var e=Object(t),r=[];for(var n in e)r.push(n);return r.reverse(),function t(){for(;r.length;){var n=r.pop();if(n in e)return t.value=n,t.done=!1,t}return t.done=!0,t}},i.values=P,T.prototype={constructor:T,reset:function(t){if(this.prev=0,this.next=0,this.sent=this._sent=n,this.done=!1,this.delegate=null,this.method=\"next\",this.arg=n,this.tryEntries.forEach(L),!t)for(var e in this)\"t\"===e.charAt(0)&&s.call(this,e)&&!isNaN(+e.slice(1))&&(this[e]=n)},stop:function(){this.done=!0;var t=this.tryEntries[0].completion;if(\"throw\"===t.type)throw t.arg;return this.rval},dispatchException:function(t){if(this.done)throw t;var e=this;function r(r,i){return a.type=\"throw\",a.arg=t,e.next=r,i&&(e.method=\"next\",e.arg=n),!!i}for(var i=this.tryEntries.length-1;i>=0;--i){var o=this.tryEntries[i],a=o.completion;if(\"root\"===o.tryLoc)return r(\"end\");if(o.tryLoc<=this.prev){var u=s.call(o,\"catchLoc\"),c=s.call(o,\"finallyLoc\");if(u&&c){if(this.prev<o.catchLoc)return r(o.catchLoc,!0);if(this.prev<o.finallyLoc)return r(o.finallyLoc)}else if(u){if(this.prev<o.catchLoc)return r(o.catchLoc,!0)}else{if(!c)throw new Error(\"try statement without catch or finally\");if(this.prev<o.finallyLoc)return r(o.finallyLoc)}}}},abrupt:function(t,e){for(var r=this.tryEntries.length-1;r>=0;--r){var n=this.tryEntries[r];if(n.tryLoc<=this.prev&&s.call(n,\"finallyLoc\")&&this.prev<n.finallyLoc){var i=n;break}}i&&(\"break\"===t||\"continue\"===t)&&i.tryLoc<=e&&e<=i.finallyLoc&&(i=null);var o=i?i.completion:{};return o.type=t,o.arg=e,i?(this.method=\"next\",this.next=i.finallyLoc,b):this.complete(o)},complete:function(t,e){if(\"throw\"===t.type)throw t.arg;return\"break\"===t.type||\"continue\"===t.type?this.next=t.arg:\"return\"===t.type?(this.rval=this.arg=t.arg,this.method=\"return\",this.next=\"end\"):\"normal\"===t.type&&e&&(this.next=e),b},finish:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.finallyLoc===t)return this.complete(r.completion,r.afterLoc),L(r),b}},catch:function(t){for(var e=this.tryEntries.length-1;e>=0;--e){var r=this.tryEntries[e];if(r.tryLoc===t){var n=r.completion;if(\"throw\"===n.type){var i=n.arg;L(r)}return i}}throw new Error(\"illegal catch attempt\")},delegateYield:function(t,e,r){return this.delegate={iterator:P(t),resultName:e,nextLoc:r},\"next\"===this.method&&(this.arg=n),b}},i}t.exports=r,t.exports.__esModule=!0,t.exports.default=t.exports}(Yn)),Yn.exports)();$n=t;try{regeneratorRuntime=t}catch(e){\"object\"==typeof globalThis?globalThis.regeneratorRuntime=t:Function(\"r\",\"regeneratorRuntime = r\")(t)}return $n}Jn.exports,Yn.exports;var ti,ei={exports:{}};var ri,ni={exports:{}};function ii(){return ri||(ri=1,function(t){t.exports=function(t,e){if(!(t instanceof e))throw new TypeError(\"Cannot call a class as a function\")},t.exports.__esModule=!0,t.exports.default=t.exports}(ni)),ni.exports}var oi,si,ai,ui={exports:{}},ci={exports:{}},hi={exports:{}};function fi(){return oi||(oi=1,function(t){var e=Xn().default;t.exports=function(t,r){if(\"object\"!==e(t)||null===t)return t;var n=t[Symbol.toPrimitive];if(void 0!==n){var i=n.call(t,r||\"default\");if(\"object\"!==e(i))return i;throw new TypeError(\"@@toPrimitive must return a primitive value.\")}return(\"string\"===r?String:Number)(t)},t.exports.__esModule=!0,t.exports.default=t.exports}(hi)),hi.exports}function li(){return si||(si=1,function(t){var e=Xn().default,r=fi();t.exports=function(t){var n=r(t,\"string\");return\"symbol\"===e(n)?n:String(n)},t.exports.__esModule=!0,t.exports.default=t.exports}(ci)),ci.exports}function di(){return ai||(ai=1,function(t){var e=li();function r(t,r){for(var n=0;n<r.length;n++){var i=r[n];i.enumerable=i.enumerable||!1,i.configurable=!0,\"value\"in i&&(i.writable=!0),Object.defineProperty(t,e(i.key),i)}}t.exports=function(t,e,n){return e&&r(t.prototype,e),n&&r(t,n),Object.defineProperty(t,\"prototype\",{writable:!1}),t},t.exports.__esModule=!0,t.exports.default=t.exports}(ui)),ui.exports}hi.exports,ci.exports;var pi,yi,gi={exports:{}},mi={exports:{}};function wi(){return pi||(pi=1,function(t){function e(r,n){return t.exports=e=Object.setPrototypeOf?Object.setPrototypeOf.bind():function(t,e){return t.__proto__=e,t},t.exports.__esModule=!0,t.exports.default=t.exports,e(r,n)}t.exports=e,t.exports.__esModule=!0,t.exports.default=t.exports}(mi)),mi.exports}function bi(){return yi||(yi=1,function(t){var e=wi();t.exports=function(t,r){if(\"function\"!=typeof r&&null!==r)throw new TypeError(\"Super expression must either be null or a function\");t.prototype=Object.create(r&&r.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),Object.defineProperty(t,\"prototype\",{writable:!1}),r&&e(t,r)},t.exports.__esModule=!0,t.exports.default=t.exports}(gi)),gi.exports}mi.exports;var vi,xi,Ei={exports:{}},Bi={exports:{}};function Si(){return vi||(vi=1,function(t){t.exports=function(t){if(void 0===t)throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\");return t},t.exports.__esModule=!0,t.exports.default=t.exports}(Bi)),Bi.exports}function ki(){return xi||(xi=1,function(t){var e=Xn().default,r=Si();t.exports=function(t,n){if(n&&(\"object\"===e(n)||\"function\"==typeof n))return n;if(void 0!==n)throw new TypeError(\"Derived constructors may only return object or undefined\");return r(t)},t.exports.__esModule=!0,t.exports.default=t.exports}(Ei)),Ei.exports}Bi.exports;var Mi,Ii={exports:{}};function _i(){return Mi||(Mi=1,function(t){function e(r){return t.exports=e=Object.setPrototypeOf?Object.getPrototypeOf.bind():function(t){return t.__proto__||Object.getPrototypeOf(t)},t.exports.__esModule=!0,t.exports.default=t.exports,e(r)}t.exports=e,t.exports.__esModule=!0,t.exports.default=t.exports}(Ii)),Ii.exports}var Ai,Oi={exports:{}};function Ui(){return Ai||(Ai=1,function(t){var e=Object.prototype.hasOwnProperty,r=\"~\";function n(){}function i(t,e,r){this.fn=t,this.context=e,this.once=r||!1}function o(t,e,n,o,s){if(\"function\"!=typeof n)throw new TypeError(\"The listener must be a function\");var a=new i(n,o||t,s),u=r?r+e:e;return t._events[u]?t._events[u].fn?t._events[u]=[t._events[u],a]:t._events[u].push(a):(t._events[u]=a,t._eventsCount++),t}function s(t,e){0==--t._eventsCount?t._events=new n:delete t._events[e]}function a(){this._events=new n,this._eventsCount=0}Object.create&&(n.prototype=Object.create(null),(new n).__proto__||(r=!1)),a.prototype.eventNames=function(){var t,n,i=[];if(0===this._eventsCount)return i;for(n in t=this._events)e.call(t,n)&&i.push(r?n.slice(1):n);return Object.getOwnPropertySymbols?i.concat(Object.getOwnPropertySymbols(t)):i},a.prototype.listeners=function(t){var e=r?r+t:t,n=this._events[e];if(!n)return[];if(n.fn)return[n.fn];for(var i=0,o=n.length,s=new Array(o);i<o;i++)s[i]=n[i].fn;return s},a.prototype.listenerCount=function(t){var e=r?r+t:t,n=this._events[e];return n?n.fn?1:n.length:0},a.prototype.emit=function(t,e,n,i,o,s){var a=r?r+t:t;if(!this._events[a])return!1;var u,c,h=this._events[a],f=arguments.length;if(h.fn){switch(h.once&&this.removeListener(t,h.fn,void 0,!0),f){case 1:return h.fn.call(h.context),!0;case 2:return h.fn.call(h.context,e),!0;case 3:return h.fn.call(h.context,e,n),!0;case 4:return h.fn.call(h.context,e,n,i),!0;case 5:return h.fn.call(h.context,e,n,i,o),!0;case 6:return h.fn.call(h.context,e,n,i,o,s),!0}for(c=1,u=new Array(f-1);c<f;c++)u[c-1]=arguments[c];h.fn.apply(h.context,u)}else{var l,d=h.length;for(c=0;c<d;c++)switch(h[c].once&&this.removeListener(t,h[c].fn,void 0,!0),f){case 1:h[c].fn.call(h[c].context);break;case 2:h[c].fn.call(h[c].context,e);break;case 3:h[c].fn.call(h[c].context,e,n);break;case 4:h[c].fn.call(h[c].context,e,n,i);break;default:if(!u)for(l=1,u=new Array(f-1);l<f;l++)u[l-1]=arguments[l];h[c].fn.apply(h[c].context,u)}}return!0},a.prototype.on=function(t,e,r){return o(this,t,e,r,!1)},a.prototype.once=function(t,e,r){return o(this,t,e,r,!0)},a.prototype.removeListener=function(t,e,n,i){var o=r?r+t:t;if(!this._events[o])return this;if(!e)return s(this,o),this;var a=this._events[o];if(a.fn)a.fn!==e||i&&!a.once||n&&a.context!==n||s(this,o);else{for(var u=0,c=[],h=a.length;u<h;u++)(a[u].fn!==e||i&&!a[u].once||n&&a[u].context!==n)&&c.push(a[u]);c.length?this._events[o]=1===c.length?c[0]:c:s(this,o)}return this},a.prototype.removeAllListeners=function(t){var e;return t?(e=r?r+t:t,this._events[e]&&s(this,e)):(this._events=new n,this._eventsCount=0),this},a.prototype.off=a.prototype.removeListener,a.prototype.addListener=a.prototype.on,a.prefixed=r,a.EventEmitter=a,t.exports=a}(Oi)),Oi.exports}!function(t){var e=Gn;Object.defineProperty(t,\"__esModule\",{value:!0}),t.default=void 0;var r=e(Qn()),n=e((ti||(ti=1,function(t){function e(t,e,r,n,i,o,s){try{var a=t[o](s),u=a.value}catch(t){return void r(t)}a.done?e(u):Promise.resolve(u).then(n,i)}t.exports=function(t){return function(){var r=this,n=arguments;return new Promise((function(i,o){var s=t.apply(r,n);function a(t){e(s,i,o,a,u,\"next\",t)}function u(t){e(s,i,o,a,u,\"throw\",t)}a(void 0)}))}},t.exports.__esModule=!0,t.exports.default=t.exports}(ei)),ei.exports)),i=e(Xn()),o=e(ii()),s=e(di()),a=e(bi()),u=e(ki()),c=e(_i()),h=Ui();function f(t){var e=function(){if(\"undefined\"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if(\"function\"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return!1}}();return function(){var r,n=(0,c.default)(t);if(e){var i=(0,c.default)(this).constructor;r=Reflect.construct(n,arguments,i)}else r=n.apply(this,arguments);return(0,u.default)(this,r)}}var l=function(t){(0,a.default)(d,t);var e,u,c,h,l=f(d);function d(t){var e,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:\"ws://localhost:8080\",n=arguments.length>2&&void 0!==arguments[2]?arguments[2]:{},i=arguments.length>3?arguments[3]:void 0;(0,o.default)(this,d);var s=n.autoconnect,a=void 0===s||s,u=n.reconnect,c=void 0===u||u,h=n.reconnect_interval,f=void 0===h?1e3:h,p=n.max_reconnects,y=void 0===p?5:p,g=function(t,e){var r={};for(var n in t)Object.prototype.hasOwnProperty.call(t,n)&&e.indexOf(n)<0&&(r[n]=t[n]);if(null!=t&&\"function\"==typeof Object.getOwnPropertySymbols){var i=0;for(n=Object.getOwnPropertySymbols(t);i<n.length;i++)e.indexOf(n[i])<0&&Object.prototype.propertyIsEnumerable.call(t,n[i])&&(r[n[i]]=t[n[i]])}return r}(n,[\"autoconnect\",\"reconnect\",\"reconnect_interval\",\"max_reconnects\"]);return(e=l.call(this)).webSocketFactory=t,e.queue={},e.rpc_id=0,e.address=r,e.autoconnect=a,e.ready=!1,e.reconnect=c,e.reconnect_timer_id=void 0,e.reconnect_interval=f,e.max_reconnects=y,e.rest_options=g,e.current_reconnects=0,e.generate_request_id=i||function(){return++e.rpc_id},e.autoconnect&&e._connect(e.address,Object.assign({autoconnect:e.autoconnect,reconnect:e.reconnect,reconnect_interval:e.reconnect_interval,max_reconnects:e.max_reconnects},e.rest_options)),e}return(0,s.default)(d,[{key:\"connect\",value:function(){this.socket||this._connect(this.address,Object.assign({autoconnect:this.autoconnect,reconnect:this.reconnect,reconnect_interval:this.reconnect_interval,max_reconnects:this.max_reconnects},this.rest_options))}},{key:\"call\",value:function(t,e,r,n){var o=this;return n||\"object\"!==(0,i.default)(r)||(n=r,r=null),new Promise((function(i,s){if(!o.ready)return s(new Error(\"socket not ready\"));var a=o.generate_request_id(t,e),u={jsonrpc:\"2.0\",method:t,params:e||null,id:a};o.socket.send(JSON.stringify(u),n,(function(t){if(t)return s(t);o.queue[a]={promise:[i,s]},r&&(o.queue[a].timeout=setTimeout((function(){delete o.queue[a],s(new Error(\"reply timeout\"))}),r))}))}))}},{key:\"login\",value:(h=(0,n.default)(r.default.mark((function t(e){var n;return r.default.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,this.call(\"rpc.login\",e);case 2:if(n=t.sent){t.next=5;break}throw new Error(\"authentication failed\");case 5:return t.abrupt(\"return\",n);case 6:case\"end\":return t.stop()}}),t,this)}))),function(t){return h.apply(this,arguments)})},{key:\"listMethods\",value:(c=(0,n.default)(r.default.mark((function t(){return r.default.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:return t.next=2,this.call(\"__listMethods\");case 2:return t.abrupt(\"return\",t.sent);case 3:case\"end\":return t.stop()}}),t,this)}))),function(){return c.apply(this,arguments)})},{key:\"notify\",value:function(t,e){var r=this;return new Promise((function(n,i){if(!r.ready)return i(new Error(\"socket not ready\"));var o={jsonrpc:\"2.0\",method:t,params:e||null};r.socket.send(JSON.stringify(o),(function(t){if(t)return i(t);n()}))}))}},{key:\"subscribe\",value:(u=(0,n.default)(r.default.mark((function t(e){var n;return r.default.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:return\"string\"==typeof e&&(e=[e]),t.next=3,this.call(\"rpc.on\",e);case 3:if(n=t.sent,\"string\"!=typeof e||\"ok\"===n[e]){t.next=6;break}throw new Error(\"Failed subscribing to an event '\"+e+\"' with: \"+n[e]);case 6:return t.abrupt(\"return\",n);case 7:case\"end\":return t.stop()}}),t,this)}))),function(t){return u.apply(this,arguments)})},{key:\"unsubscribe\",value:(e=(0,n.default)(r.default.mark((function t(e){var n;return r.default.wrap((function(t){for(;;)switch(t.prev=t.next){case 0:return\"string\"==typeof e&&(e=[e]),t.next=3,this.call(\"rpc.off\",e);case 3:if(n=t.sent,\"string\"!=typeof e||\"ok\"===n[e]){t.next=6;break}throw new Error(\"Failed unsubscribing from an event with: \"+n);case 6:return t.abrupt(\"return\",n);case 7:case\"end\":return t.stop()}}),t,this)}))),function(t){return e.apply(this,arguments)})},{key:\"close\",value:function(t,e){this.socket.close(t||1e3,e)}},{key:\"_connect\",value:function(t,e){var r=this;clearTimeout(this.reconnect_timer_id),this.socket=this.webSocketFactory(t,e),this.socket.addEventListener(\"open\",(function(){r.ready=!0,r.emit(\"open\"),r.current_reconnects=0})),this.socket.addEventListener(\"message\",(function(t){var e=t.data;e instanceof ArrayBuffer&&(e=Buffer.from(e).toString());try{e=JSON.parse(e)}catch(t){return}if(e.notification&&r.listeners(e.notification).length){if(!Object.keys(e.params).length)return r.emit(e.notification);var n=[e.notification];if(e.params.constructor===Object)n.push(e.params);else for(var i=0;i<e.params.length;i++)n.push(e.params[i]);return Promise.resolve().then((function(){r.emit.apply(r,n)}))}if(!r.queue[e.id])return e.method&&e.params?Promise.resolve().then((function(){r.emit(e.method,e.params)})):void 0;\"error\"in e==\"result\"in e&&r.queue[e.id].promise[1](new Error('Server response malformed. Response must include either \"result\" or \"error\", but not both.')),r.queue[e.id].timeout&&clearTimeout(r.queue[e.id].timeout),e.error?r.queue[e.id].promise[1](e.error):r.queue[e.id].promise[0](e.result),delete r.queue[e.id]})),this.socket.addEventListener(\"error\",(function(t){return r.emit(\"error\",t)})),this.socket.addEventListener(\"close\",(function(n){var i=n.code,o=n.reason;r.ready&&setTimeout((function(){return r.emit(\"close\",i,o)}),0),r.ready=!1,r.socket=void 0,1e3!==i&&(r.current_reconnects++,r.reconnect&&(r.max_reconnects>r.current_reconnects||0===r.max_reconnects)&&(r.reconnect_timer_id=setTimeout((function(){return r._connect(t,e)}),r.reconnect_interval)))}))}}]),d}(h.EventEmitter);t.default=l}({});!function(t){var e=Gn;Object.defineProperty(t,\"__esModule\",{value:!0}),t.default=function(t,e){return new u(t,e)};var r=e(ii()),n=e(di()),i=e(bi()),o=e(ki()),s=e(_i());function a(t){var e=function(){if(\"undefined\"==typeof Reflect||!Reflect.construct)return!1;if(Reflect.construct.sham)return!1;if(\"function\"==typeof Proxy)return!0;try{return Boolean.prototype.valueOf.call(Reflect.construct(Boolean,[],(function(){}))),!0}catch(t){return!1}}();return function(){var r,n=(0,s.default)(t);if(e){var i=(0,s.default)(this).constructor;r=Reflect.construct(n,arguments,i)}else r=n.apply(this,arguments);return(0,o.default)(this,r)}}var u=function(t){(0,i.default)(o,t);var e=a(o);function o(t,n,i){var s;return(0,r.default)(this,o),(s=e.call(this)).socket=new window.WebSocket(t,i),s.socket.onopen=function(){return s.emit(\"open\")},s.socket.onmessage=function(t){return s.emit(\"message\",t.data)},s.socket.onerror=function(t){return s.emit(\"error\",t)},s.socket.onclose=function(t){s.emit(\"close\",t.code,t.reason)},s}return(0,n.default)(o,[{key:\"send\",value:function(t,e,r){var n=r||e;try{this.socket.send(t),n()}catch(t){n(t)}}},{key:\"close\",value:function(t,e){this.socket.close(t,e)}},{key:\"addEventListener\",value:function(t,e,r){this.socket.addEventListener(t,e,r)}}]),o}(Ui().EventEmitter)}({});const{bytesToNumberBE:Li,hexToBytes:Ti}=ot,Pi={Err:class extends Error{constructor(t=\"\"){super(t)}},_parseInt(t){const{Err:e}=Pi;if(t.length<2||2!==t[0])throw new e(\"Invalid signature integer tag\");const r=t[1],n=t.subarray(2,r+2);if(!r||n.length!==r)throw new e(\"Invalid signature integer: wrong length\");if(128&n[0])throw new e(\"Invalid signature integer: negative\");if(0===n[0]&&!(128&n[1]))throw new e(\"Invalid signature integer: unnecessary leading zero\");return{d:Li(n),l:t.subarray(r+2)}},toSig(t){const{Err:e}=Pi,r=\"string\"==typeof t?Ti(t):t;if(!(r instanceof Uint8Array))throw new Error(\"ui8a expected\");let n=r.length;if(n<2||48!=r[0])throw new e(\"Invalid signature tag\");if(r[1]!==n-2)throw new e(\"Invalid signature: incorrect length\");const{d:i,l:o}=Pi._parseInt(r.subarray(2)),{d:s,l:a}=Pi._parseInt(o);if(a.length)throw new e(\"Invalid signature: left bytes after parsing\");return{r:i,s:s}},hexFromSig(t){const e=t=>8&Number.parseInt(t[0],16)?\"00\"+t:t,r=t=>{const e=t.toString(16);return 1&e.length?`0${e}`:e},n=e(r(t.s)),i=e(r(t.r)),o=n.length/2,s=i.length/2,a=r(o),u=r(s);return`30${r(s+o+4)}02${u}${i}02${a}${n}`}},Ri=BigInt(0),ji=BigInt(1);BigInt(2);const Ni=BigInt(3);function zi(t){const e=\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nfunction(t){const e=Mt(t);it(e,{a:\"field\",b:\"field\"},{allowedPrivateKeyLengths:\"array\",wrapPrivateKey:\"boolean\",isTorsionFree:\"function\",clearCofactor:\"function\",allowInfinityPoint:\"boolean\",fromBytes:\"function\",toBytes:\"function\"});const{endo:r,Fp:n,a:i}=e;if(r){if(!n.eql(i,n.ZERO))throw new Error(\"Endomorphism can only be defined for Koblitz curves that have a=0\");if(\"object\"!=typeof r||\"bigint\"!=typeof r.beta||\"function\"!=typeof r.splitScalar)throw new Error(\"Expected endomorphism with beta: bigint and splitScalar: function\")}return Object.freeze({...e})}(t),{Fp:r}=e,n=e.toBytes||((t,e,n)=>{const i=e.toAffine();return X(Uint8Array.from([4]),r.toBytes(i.x),r.toBytes(i.y))}),i=e.fromBytes||(t=>{const e=t.subarray(1);return{x:r.fromBytes(e.subarray(0,r.BYTES)),y:r.fromBytes(e.subarray(r.BYTES,2*r.BYTES))}});function o(t){const{a:n,b:i}=e,o=r.sqr(t),s=r.mul(o,t);return r.add(r.add(s,r.mul(t,n)),i)}if(!r.eql(r.sqr(e.Gy),o(e.Gx)))throw new Error(\"bad generator point: equation left != right\");function s(t){return\"bigint\"==typeof t&&Ri<t&&t<e.n}function a(t){if(!s(t))throw new Error(\"Expected valid bigint: 0 < bigint < curve.n\")}function u(t){const{allowedPrivateKeyLengths:r,nByteLength:n,wrapPrivateKey:i,n:o}=e;if(r&&\"bigint\"!=typeof t){if(t instanceof Uint8Array&&(t=D(t)),\"string\"!=typeof t||!r.includes(t.length))throw new Error(\"Invalid key\");t=t.padStart(2*n,\"0\")}let s;try{s=\"bigint\"==typeof t?t:$(J(\"private key\",t,n))}catch(e){throw new Error(`private key must be ${n} bytes, hex or bigint, not ${typeof t}`)}return i&&(s=dt(s,o)),a(s),s}const c=new Map;function h(t){if(!(t instanceof f))throw new Error(\"ProjectivePoint expected\")}class f{constructor(t,e,n){if(this.px=t,this.py=e,this.pz=n,null==t||!r.isValid(t))throw new Error(\"x required\");if(null==e||!r.isValid(e))throw new Error(\"y required\");if(null==n||!r.isValid(n))throw new Error(\"z required\")}static fromAffine(t){const{x:e,y:n}=t||{};if(!t||!r.isValid(e)||!r.isValid(n))throw new Error(\"invalid affine point\");if(t instanceof f)throw new Error(\"projective point not allowed\");const i=t=>r.eql(t,r.ZERO);return i(e)&&i(n)?f.ZERO:new f(e,n,r.ONE)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static normalizeZ(t){const e=r.invertBatch(t.map((t=>t.pz)));return t.map(((t,r)=>t.toAffine(e[r]))).map(f.fromAffine)}static fromHex(t){const e=f.fromAffine(i(J(\"pointHex\",t)));return e.assertValidity(),e}static fromPrivateKey(t){return f.BASE.multiply(u(t))}_setWindowSize(t){this._WINDOW_SIZE=t,c.delete(this)}assertValidity(){if(this.is0()){if(e.allowInfinityPoint&&!r.is0(this.py))return;throw new Error(\"bad point: ZERO\")}const{x:t,y:n}=this.toAffine();if(!r.isValid(t)||!r.isValid(n))throw new Error(\"bad point: x or y not FE\");const i=r.sqr(n),s=o(t);if(!r.eql(i,s))throw new Error(\"bad point: equation left != right\");if(!this.isTorsionFree())throw new Error(\"bad point: not in prime-order subgroup\")}hasEvenY(){const{y:t}=this.toAffine();if(r.isOdd)return!r.isOdd(t);throw new Error(\"Field doesn't support isOdd\")}equals(t){h(t);const{px:e,py:n,pz:i}=this,{px:o,py:s,pz:a}=t,u=r.eql(r.mul(e,a),r.mul(o,i)),c=r.eql(r.mul(n,a),r.mul(s,i));return u&&c}negate(){return new f(this.px,r.neg(this.py),this.pz)}double(){const{a:t,b:n}=e,i=r.mul(n,Ni),{px:o,py:s,pz:a}=this;let u=r.ZERO,c=r.ZERO,h=r.ZERO,l=r.mul(o,o),d=r.mul(s,s),p=r.mul(a,a),y=r.mul(o,s);return y=r.add(y,y),h=r.mul(o,a),h=r.add(h,h),u=r.mul(t,h),c=r.mul(i,p),c=r.add(u,c),u=r.sub(d,c),c=r.add(d,c),c=r.mul(u,c),u=r.mul(y,u),h=r.mul(i,h),p=r.mul(t,p),y=r.sub(l,p),y=r.mul(t,y),y=r.add(y,h),h=r.add(l,l),l=r.add(h,l),l=r.add(l,p),l=r.mul(l,y),c=r.add(c,l),p=r.mul(s,a),p=r.add(p,p),l=r.mul(p,y),u=r.sub(u,l),h=r.mul(p,d),h=r.add(h,h),h=r.add(h,h),new f(u,c,h)}add(t){h(t);const{px:n,py:i,pz:o}=this,{px:s,py:a,pz:u}=t;let c=r.ZERO,l=r.ZERO,d=r.ZERO;const p=e.a,y=r.mul(e.b,Ni);let g=r.mul(n,s),m=r.mul(i,a),w=r.mul(o,u),b=r.add(n,i),v=r.add(s,a);b=r.mul(b,v),v=r.add(g,m),b=r.sub(b,v),v=r.add(n,o);let x=r.add(s,u);return v=r.mul(v,x),x=r.add(g,w),v=r.sub(v,x),x=r.add(i,o),c=r.add(a,u),x=r.mul(x,c),c=r.add(m,w),x=r.sub(x,c),d=r.mul(p,v),c=r.mul(y,w),d=r.add(c,d),c=r.sub(m,d),d=r.add(m,d),l=r.mul(c,d),m=r.add(g,g),m=r.add(m,g),w=r.mul(p,w),v=r.mul(y,v),m=r.add(m,w),w=r.sub(g,w),w=r.mul(p,w),v=r.add(v,w),g=r.mul(m,v),l=r.add(l,g),g=r.mul(x,v),c=r.mul(b,c),c=r.sub(c,g),g=r.mul(b,m),d=r.mul(x,d),d=r.add(d,g),new f(c,l,d)}subtract(t){return this.add(t.negate())}is0(){return this.equals(f.ZERO)}wNAF(t){return d.wNAFCached(this,c,t,(t=>{const e=r.invertBatch(t.map((t=>t.pz)));return t.map(((t,r)=>t.toAffine(e[r]))).map(f.fromAffine)}))}multiplyUnsafe(t){const n=f.ZERO;if(t===Ri)return n;if(a(t),t===ji)return this;const{endo:i}=e;if(!i)return d.unsafeLadder(this,t);let{k1neg:o,k1:s,k2neg:u,k2:c}=i.splitScalar(t),h=n,l=n,p=this;for(;s>Ri||c>Ri;)s&ji&&(h=h.add(p)),c&ji&&(l=l.add(p)),p=p.double(),s>>=ji,c>>=ji;return o&&(h=h.negate()),u&&(l=l.negate()),l=new f(r.mul(l.px,i.beta),l.py,l.pz),h.add(l)}multiply(t){a(t);let n,i,o=t;const{endo:s}=e;if(s){const{k1neg:t,k1:e,k2neg:a,k2:u}=s.splitScalar(o);let{p:c,f:h}=this.wNAF(e),{p:l,f:p}=this.wNAF(u);c=d.constTimeNegate(t,c),l=d.constTimeNegate(a,l),l=new f(r.mul(l.px,s.beta),l.py,l.pz),n=c.add(l),i=h.add(p)}else{const{p:t,f:e}=this.wNAF(o);n=t,i=e}return f.normalizeZ([n,i])[0]}multiplyAndAddUnsafe(t,e,r){const n=f.BASE,i=(t,e)=>e!==Ri&&e!==ji&&t.equals(n)?t.multiply(e):t.multiplyUnsafe(e),o=i(this,e).add(i(t,r));return o.is0()?void 0:o}toAffine(t){const{px:e,py:n,pz:i}=this,o=this.is0();null==t&&(t=o?r.ONE:r.inv(i));const s=r.mul(e,t),a=r.mul(n,t),u=r.mul(i,t);if(o)return{x:r.ZERO,y:r.ZERO};if(!r.eql(u,r.ONE))throw new Error(\"invZ was invalid\");return{x:s,y:a}}isTorsionFree(){const{h:t,isTorsionFree:r}=e;if(t===ji)return!0;if(r)return r(f,this);throw new Error(\"isTorsionFree() has not been declared for the elliptic curve\")}clearCofactor(){const{h:t,clearCofactor:r}=e;return t===ji?this:r?r(f,this):this.multiplyUnsafe(e.h)}toRawBytes(t=!0){return this.assertValidity(),n(f,this,t)}toHex(t=!0){return D(this.toRawBytes(t))}}f.BASE=new f(e.Gx,e.Gy,r.ONE),f.ZERO=new f(r.ZERO,r.ONE,r.ZERO);const l=e.nBitLength,d=kt(f,e.endo?Math.ceil(l/2):l);return{CURVE:e,ProjectivePoint:f,normPrivateKeyToScalar:u,weierstrassEquation:o,isWithinCurveOrder:s}}function Ci(t){const e=function(t){const e=Mt(t);return it(e,{hash:\"hash\",hmac:\"function\",randomBytes:\"function\"},{bits2int:\"function\",bits2int_modN:\"function\",lowS:\"boolean\"}),Object.freeze({lowS:!0,...e})}(t),{Fp:r,n:n}=e,i=r.BYTES+1,o=2*r.BYTES+1;function s(t){return dt(t,n)}function a(t){return gt(t,n)}const{ProjectivePoint:u,normPrivateKeyToScalar:c,weierstrassEquation:h,isWithinCurveOrder:f}=zi({...e,toBytes(t,e,n){const i=e.toAffine(),o=r.toBytes(i.x),s=X;return n?s(Uint8Array.from([e.hasEvenY()?2:3]),o):s(Uint8Array.from([4]),o,r.toBytes(i.y))},fromBytes(t){const e=t.length,n=t[0],s=t.subarray(1);if(e!==i||2!==n&&3!==n){if(e===o&&4===n){return{x:r.fromBytes(s.subarray(0,r.BYTES)),y:r.fromBytes(s.subarray(r.BYTES,2*r.BYTES))}}throw new Error(`Point of length ${e} was invalid. Expected ${i} compressed bytes or ${o} uncompressed bytes`)}{const t=$(s);if(!(Ri<(a=t)&&a<r.ORDER))throw new Error(\"Point is not on curve\");const e=h(t);let i=r.sqrt(e);return 1==(1&n)!==((i&ji)===ji)&&(i=r.neg(i)),{x:t,y:i}}var a}}),l=t=>D(G(t,e.nByteLength));function d(t){return t>n>>ji}const p=(t,e,r)=>$(t.slice(e,r));class y{constructor(t,e,r){this.r=t,this.s=e,this.recovery=r,this.assertValidity()}static fromCompact(t){const r=e.nByteLength;return t=J(\"compactSignature\",t,2*r),new y(p(t,0,r),p(t,r,2*r))}static fromDER(t){const{r:e,s:r}=Pi.toSig(J(\"DER\",t));return new y(e,r)}assertValidity(){if(!f(this.r))throw new Error(\"r must be 0 < r < CURVE.n\");if(!f(this.s))throw new Error(\"s must be 0 < s < CURVE.n\")}addRecoveryBit(t){return new y(this.r,this.s,t)}recoverPublicKey(t){const{r:n,s:i,recovery:o}=this,c=b(J(\"msgHash\",t));if(null==o||![0,1,2,3].includes(o))throw new Error(\"recovery id invalid\");const h=2===o||3===o?n+e.n:n;if(h>=r.ORDER)throw new Error(\"recovery id 2 or 3 invalid\");const f=0==(1&o)?\"02\":\"03\",d=u.fromHex(f+l(h)),p=a(h),y=s(-c*p),g=s(i*p),m=u.BASE.multiplyAndAddUnsafe(d,y,g);if(!m)throw new Error(\"point at infinify\");return m.assertValidity(),m}hasHighS(){return d(this.s)}normalizeS(){return this.hasHighS()?new y(this.r,s(-this.s),this.recovery):this}toDERRawBytes(){return K(this.toDERHex())}toDERHex(){return Pi.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return K(this.toCompactHex())}toCompactHex(){return l(this.r)+l(this.s)}}const g={isValidPrivateKey(t){try{return c(t),!0}catch(t){return!1}},normPrivateKeyToScalar:c,randomPrivateKey:()=>{const t=Et(e.n);return function(t,e,r=!1){const n=t.length,i=xt(e),o=Et(e);if(n<16||n<o||n>1024)throw new Error(`expected ${o}-1024 bytes of input, got ${n}`);const s=dt(r?$(t):Z(t),e-at)+at;return r?Y(s,i):G(s,i)}(e.randomBytes(t),e.n)},precompute:(t=8,e=u.BASE)=>(e._setWindowSize(t),e.multiply(BigInt(3)),e)};function m(t){const e=t instanceof Uint8Array,r=\"string\"==typeof t,n=(e||r)&&t.length;return e?n===i||n===o:r?n===2*i||n===2*o:t instanceof u}const w=e.bits2int||function(t){const r=$(t),n=8*t.length-e.nBitLength;return n>0?r>>BigInt(n):r},b=e.bits2int_modN||function(t){return s(w(t))},v=Q(e.nBitLength);function x(t){if(\"bigint\"!=typeof t)throw new Error(\"bigint expected\");if(!(Ri<=t&&t<v))throw new Error(`bigint expected < 2^${e.nBitLength}`);return G(t,e.nByteLength)}function E(t,n,i=B){if([\"recovered\",\"canonical\"].some((t=>t in i)))throw new Error(\"sign() legacy options not supported\");const{hash:o,randomBytes:h}=e;let{lowS:l,prehash:p,extraEntropy:g}=i;null==l&&(l=!0),t=J(\"msgHash\",t),p&&(t=J(\"prehashed msgHash\",o(t)));const m=b(t),v=c(n),E=[x(v),x(m)];if(null!=g){const t=!0===g?h(r.BYTES):g;E.push(J(\"extraEntropy\",t))}const S=X(...E),k=m;return{seed:S,k2sig:function(t){const e=w(t);if(!f(e))return;const r=a(e),n=u.BASE.multiply(e).toAffine(),i=s(n.x);if(i===Ri)return;const o=s(r*s(k+i*v));if(o===Ri)return;let c=(n.x===i?0:2)|Number(n.y&ji),h=o;return l&&d(o)&&(h=function(t){return d(t)?s(-t):t}(o),c^=1),new y(i,h,c)}}}const B={lowS:e.lowS,prehash:!1},S={lowS:e.lowS,prehash:!1};return u.BASE._setWindowSize(8),{CURVE:e,getPublicKey:function(t,e=!0){return u.fromPrivateKey(t).toRawBytes(e)},getSharedSecret:function(t,e,r=!0){if(m(t))throw new Error(\"first arg must be private key\");if(!m(e))throw new Error(\"second arg must be public key\");return u.fromHex(e).multiply(c(t)).toRawBytes(r)},sign:function(t,r,n=B){const{seed:i,k2sig:o}=E(t,r,n),s=e;return rt(s.hash.outputLen,s.nByteLength,s.hmac)(i,o)},verify:function(t,r,n,i=S){const o=t;if(r=J(\"msgHash\",r),n=J(\"publicKey\",n),\"strict\"in i)throw new Error(\"options.strict was renamed to lowS\");const{lowS:c,prehash:h}=i;let f,l;try{if(\"string\"==typeof o||o instanceof Uint8Array)try{f=y.fromDER(o)}catch(t){if(!(t instanceof Pi.Err))throw t;f=y.fromCompact(o)}else{if(\"object\"!=typeof o||\"bigint\"!=typeof o.r||\"bigint\"!=typeof o.s)throw new Error(\"PARSE\");{const{r:t,s:e}=o;f=new y(t,e)}}l=u.fromHex(n)}catch(t){if(\"PARSE\"===t.message)throw new Error(\"signature must be Signature instance, Uint8Array or hex string\");return!1}if(c&&f.hasHighS())return!1;h&&(r=e.hash(r));const{r:d,s:p}=f,g=b(r),m=a(p),w=s(g*m),v=s(d*m),x=u.BASE.multiplyAndAddUnsafe(l,w,v)?.toAffine();return!!x&&s(x.x)===d},ProjectivePoint:u,Signature:y,utils:g}}BigInt(4);class Wi extends B{constructor(t,e){super(),this.finished=!1,this.destroyed=!1,function(t){if(\"function\"!=typeof t||\"function\"!=typeof t.create)throw new Error(\"Hash should be wrapped by utils.wrapConstructor\");d(t.outputLen),d(t.blockLen)}(t);const r=x(e);if(this.iHash=t.create(),\"function\"!=typeof this.iHash.update)throw new Error(\"Expected instance of class which extends utils.Hash\");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const n=this.blockLen,i=new Uint8Array(n);i.set(r.length>n?t.create().update(r).digest():r);for(let t=0;t<i.length;t++)i[t]^=54;this.iHash.update(i),this.oHash=t.create();for(let t=0;t<i.length;t++)i[t]^=106;this.oHash.update(i),i.fill(0)}update(t){return y(this),this.iHash.update(t),this}digestInto(t){y(this),p(t,this.outputLen),this.finished=!0,this.iHash.digestInto(t),this.oHash.update(t),this.oHash.digestInto(t),this.destroy()}digest(){const t=new Uint8Array(this.oHash.outputLen);return this.digestInto(t),t}_cloneInto(t){t||(t=Object.create(Object.getPrototypeOf(this),{}));const{oHash:e,iHash:r,finished:n,destroyed:i,blockLen:o,outputLen:s}=this;return t.finished=n,t.destroyed=i,t.blockLen=o,t.outputLen=s,t.oHash=e._cloneInto(t.oHash),t.iHash=r._cloneInto(t.iHash),t}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}const qi=(t,e,r)=>new Wi(t,e).update(r).digest();\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nfunction Fi(t){return{hash:t,hmac:(e,...r)=>qi(t,e,E(...r)),randomBytes:k}}qi.create=(t,e)=>new Wi(t,e);\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nconst Di=BigInt(\"0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f\"),Hi=BigInt(\"0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141\"),Vi=BigInt(1),Ki=BigInt(2),$i=(t,e)=>(t+e/Ki)/e;const Zi=vt(Di,void 0,void 0,{sqrt:function(t){const e=Di,r=BigInt(3),n=BigInt(6),i=BigInt(11),o=BigInt(22),s=BigInt(23),a=BigInt(44),u=BigInt(88),c=t*t*t%e,h=c*c*t%e,f=yt(h,r,e)*h%e,l=yt(f,r,e)*h%e,d=yt(l,Ki,e)*c%e,p=yt(d,i,e)*d%e,y=yt(p,o,e)*p%e,g=yt(y,a,e)*y%e,m=yt(g,u,e)*g%e,w=yt(m,a,e)*y%e,b=yt(w,r,e)*h%e,v=yt(b,s,e)*p%e,x=yt(v,n,e)*c%e,E=yt(x,Ki,e);if(!Zi.eql(Zi.sqr(E),t))throw new Error(\"Cannot find square root\");return E}}),Gi=function(t,e){const r=e=>Ci({...t,...Fi(e)});return Object.freeze({...r(e),create:r})}({a:BigInt(0),b:BigInt(7),Fp:Zi,n:Hi,Gx:BigInt(\"55066263022277343669578718895168534326250603453777594175500187360389116729240\"),Gy:BigInt(\"32670510020758816978083085130507043184471273380659243275938904335757337482424\"),h:BigInt(1),lowS:!0,endo:{beta:BigInt(\"0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee\"),splitScalar:t=>{const e=Hi,r=BigInt(\"0x3086d221a7d46bcde86c90e49284eb15\"),n=-Vi*BigInt(\"0xe4437ed6010e88286f547fa90abfe4c3\"),i=BigInt(\"0x114ca50f7a8e2f3f657c1108d9d44cfd8\"),o=r,s=BigInt(\"0x100000000000000000000000000000000\"),a=$i(o*t,e),u=$i(-n*t,e);let c=dt(t-a*r-u*i,e),h=dt(-a*n-u*o,e);const f=c>s,l=h>s;if(f&&(c=e-c),l&&(h=e-h),c>s||h>s)throw new Error(\"splitScalar: Endomorphism failed, k=\"+t);return{k1neg:f,k1:c,k2neg:l,k2:h}}}},se);function Yi(t){try{return Ht.ExtendedPoint.fromHex(t),!0}catch{return!1}}BigInt(0),Gi.ProjectivePoint,Ht.utils.randomPrivateKey,Ht.getPublicKey;const Ji=Ht.verify,Xi=t=>n.Buffer.isBuffer(t)?t:t instanceof Uint8Array?n.Buffer.from(t.buffer,t.byteOffset,t.byteLength):n.Buffer.from(t);class Qi{constructor(t){Object.assign(this,t)}encode(){return n.Buffer.from(Ne(to,this))}static decode(t){return We(to,this,t)}static decodeUnchecked(t){return Se(to,this,t)}}const to=new Map;var eo;let ro;const no=32;let io=1;ro=Symbol.toStringTag;class oo extends Qi{constructor(t){if(super({}),this._bn=void 0,function(t){return void 0!==t._bn}(t))this._bn=t._bn;else{if(\"string\"==typeof t){const e=te.decode(t);if(e.length!=no)throw new Error(\"Invalid public key input\");this._bn=new Gt(e)}else this._bn=new Gt(t);if(this._bn.byteLength()>no)throw new Error(\"Invalid public key input\")}}static unique(){const t=new oo(io);return io+=1,new oo(t.toBuffer())}equals(t){return this._bn.eq(t._bn)}toBase58(){return te.encode(this.toBytes())}toJSON(){return this.toBase58()}toBytes(){const t=this.toBuffer();return new Uint8Array(t.buffer,t.byteOffset,t.byteLength)}toBuffer(){const t=this._bn.toArrayLike(n.Buffer);if(t.length===no)return t;const e=n.Buffer.alloc(32);return t.copy(e,32-t.length),e}get[ro](){return`PublicKey(${this.toString()})`}toString(){return this.toBase58()}static async createWithSeed(t,e,r){const i=n.Buffer.concat([t.toBuffer(),n.Buffer.from(e),r.toBuffer()]),o=se(i);return new oo(o)}static createProgramAddressSync(t,e){let r=n.Buffer.alloc(0);t.forEach((function(t){if(t.length>32)throw new TypeError(\"Max seed length exceeded\");r=n.Buffer.concat([r,Xi(t)])})),r=n.Buffer.concat([r,e.toBuffer(),n.Buffer.from(\"ProgramDerivedAddress\")]);const i=se(r);if(Yi(i))throw new Error(\"Invalid seeds, address must fall off the curve\");return new oo(i)}static async createProgramAddress(t,e){return this.createProgramAddressSync(t,e)}static findProgramAddressSync(t,e){let r,i=255;for(;0!=i;){try{const o=t.concat(n.Buffer.from([i]));r=this.createProgramAddressSync(o,e)}catch(t){if(t instanceof TypeError)throw t;i--;continue}return[r,i]}throw new Error(\"Unable to find a viable program address nonce\")}static async findProgramAddress(t,e){return this.findProgramAddressSync(t,e)}static isOnCurve(t){return Yi(new oo(t).toBytes())}}eo=oo,oo.default=new eo(\"11111111111111111111111111111111\"),to.set(oo,{kind:\"struct\",fields:[[\"_bn\",\"u256\"]]}),new oo(\"BPFLoader1111111111111111111111111111111111\");const so=1232;class ao{constructor(t,e){this.staticAccountKeys=void 0,this.accountKeysFromLookups=void 0,this.staticAccountKeys=t,this.accountKeysFromLookups=e}keySegments(){const t=[this.staticAccountKeys];return this.accountKeysFromLookups&&(t.push(this.accountKeysFromLookups.writable),t.push(this.accountKeysFromLookups.readonly)),t}get(t){for(const e of this.keySegments()){if(t<e.length)return e[t];t-=e.length}}get length(){return this.keySegments().flat().length}compileInstructions(t){if(this.length>256)throw new Error(\"Account index overflow encountered during compilation\");const e=new Map;this.keySegments().flat().forEach(((t,r)=>{e.set(t.toBase58(),r)}));const r=t=>{const r=e.get(t.toBase58());if(void 0===r)throw new Error(\"Encountered an unknown instruction account key during compilation\");return r};return t.map((t=>({programIdIndex:r(t.programId),accountKeyIndexes:t.keys.map((t=>r(t.pubkey))),data:t.data})))}}const uo=(t=\"publicKey\")=>Tr(32,t),co=(t=\"string\")=>{const e=Ur([_r(\"length\"),_r(\"lengthPadding\"),Tr(kr(_r(),-8),\"chars\")],t),r=e.decode.bind(e),i=e.encode.bind(e),o=e;return o.decode=(t,e)=>r(t,e).chars.toString(),o.encode=(t,e,r)=>{const o={chars:n.Buffer.from(t,\"utf8\")};return i(o,e,r)},o.alloc=t=>_r().span+_r().span+n.Buffer.from(t,\"utf8\").length,o};function ho(t,e){const r=t=>{if(t.span>=0)return t.span;if(\"function\"==typeof t.alloc)return t.alloc(e[t.property]);if(\"count\"in t&&\"elementLayout\"in t){const n=e[t.property];if(Array.isArray(n))return n.length*r(t.elementLayout)}else if(\"fields\"in t)return ho({layout:t},e[t.property]);return 0};let n=0;return t.layout.fields.forEach((t=>{n+=r(t)})),n}function fo(t){let e=0,r=0;for(;;){let n=t.shift();if(e|=(127&n)<<7*r,r+=1,0==(128&n))break}return e}function lo(t,e){let r=e;for(;;){let e=127&r;if(r>>=7,0==r){t.push(e);break}e|=128,t.push(e)}}function po(t,e){if(!t)throw new Error(e||\"Assertion failed\")}class yo{constructor(t,e){this.payer=void 0,this.keyMetaMap=void 0,this.payer=t,this.keyMetaMap=e}static compile(t,e){const r=new Map,n=t=>{const e=t.toBase58();let n=r.get(e);return void 0===n&&(n={isSigner:!1,isWritable:!1,isInvoked:!1},r.set(e,n)),n},i=n(e);i.isSigner=!0,i.isWritable=!0;for(const e of t){n(e.programId).isInvoked=!0;for(const t of e.keys){const e=n(t.pubkey);e.isSigner||=t.isSigner,e.isWritable||=t.isWritable}}return new yo(e,r)}getMessageComponents(){const t=[...this.keyMetaMap.entries()];po(t.length<=256,\"Max static account keys length exceeded\");const e=t.filter((([,t])=>t.isSigner&&t.isWritable)),r=t.filter((([,t])=>t.isSigner&&!t.isWritable)),n=t.filter((([,t])=>!t.isSigner&&t.isWritable)),i=t.filter((([,t])=>!t.isSigner&&!t.isWritable)),o={numRequiredSignatures:e.length+r.length,numReadonlySignedAccounts:r.length,numReadonlyUnsignedAccounts:i.length};{po(e.length>0,\"Expected at least one writable signer key\");const[t]=e[0];po(t===this.payer.toBase58(),\"Expected first writable signer key to be the fee payer\")}return[o,[...e.map((([t])=>new oo(t))),...r.map((([t])=>new oo(t))),...n.map((([t])=>new oo(t))),...i.map((([t])=>new oo(t)))]]}extractTableLookup(t){const[e,r]=this.drainKeysFoundInLookupTable(t.state.addresses,(t=>!t.isSigner&&!t.isInvoked&&t.isWritable)),[n,i]=this.drainKeysFoundInLookupTable(t.state.addresses,(t=>!t.isSigner&&!t.isInvoked&&!t.isWritable));if(0!==e.length||0!==n.length)return[{accountKey:t.key,writableIndexes:e,readonlyIndexes:n},{writable:r,readonly:i}]}drainKeysFoundInLookupTable(t,e){const r=new Array,n=new Array;for(const[i,o]of this.keyMetaMap.entries())if(e(o)){const e=new oo(i),o=t.findIndex((t=>t.equals(e)));o>=0&&(po(o<256,\"Max lookup table index exceeded\"),r.push(o),n.push(e),this.keyMetaMap.delete(i))}return[r,n]}}class go{constructor(t){this.header=void 0,this.accountKeys=void 0,this.recentBlockhash=void 0,this.instructions=void 0,this.indexToProgramIds=new Map,this.header=t.header,this.accountKeys=t.accountKeys.map((t=>new oo(t))),this.recentBlockhash=t.recentBlockhash,this.instructions=t.instructions,this.instructions.forEach((t=>this.indexToProgramIds.set(t.programIdIndex,this.accountKeys[t.programIdIndex])))}get version(){return\"legacy\"}get staticAccountKeys(){return this.accountKeys}get compiledInstructions(){return this.instructions.map((t=>({programIdIndex:t.programIdIndex,accountKeyIndexes:t.accounts,data:te.decode(t.data)})))}get addressTableLookups(){return[]}getAccountKeys(){return new ao(this.staticAccountKeys)}static compile(t){const e=yo.compile(t.instructions,t.payerKey),[r,n]=e.getMessageComponents(),i=new ao(n).compileInstructions(t.instructions).map((t=>({programIdIndex:t.programIdIndex,accounts:t.accountKeyIndexes,data:te.encode(t.data)})));return new go({header:r,accountKeys:n,recentBlockhash:t.recentBlockhash,instructions:i})}isAccountSigner(t){return t<this.header.numRequiredSignatures}isAccountWritable(t){const e=this.header.numRequiredSignatures;if(t>=this.header.numRequiredSignatures){return t-e<this.accountKeys.length-e-this.header.numReadonlyUnsignedAccounts}return t<e-this.header.numReadonlySignedAccounts}isProgramId(t){return this.indexToProgramIds.has(t)}programIds(){return[...this.indexToProgramIds.values()]}nonProgramIds(){return this.accountKeys.filter(((t,e)=>!this.isProgramId(e)))}serialize(){const t=this.accountKeys.length;let e=[];lo(e,t);const r=this.instructions.map((t=>{const{accounts:e,programIdIndex:r}=t,i=Array.from(te.decode(t.data));let o=[];lo(o,e.length);let s=[];return lo(s,i.length),{programIdIndex:r,keyIndicesCount:n.Buffer.from(o),keyIndices:e,dataLength:n.Buffer.from(s),data:i}}));let i=[];lo(i,r.length);let o=n.Buffer.alloc(so);n.Buffer.from(i).copy(o);let s=i.length;r.forEach((t=>{const e=Ur([Mr(\"programIdIndex\"),Tr(t.keyIndicesCount.length,\"keyIndicesCount\"),Lr(Mr(\"keyIndex\"),t.keyIndices.length,\"keyIndices\"),Tr(t.dataLength.length,\"dataLength\"),Lr(Mr(\"userdatum\"),t.data.length,\"data\")]).encode(t,o,s);s+=e})),o=o.slice(0,s);const a=Ur([Tr(1,\"numRequiredSignatures\"),Tr(1,\"numReadonlySignedAccounts\"),Tr(1,\"numReadonlyUnsignedAccounts\"),Tr(e.length,\"keyCount\"),Lr(uo(\"key\"),t,\"keys\"),uo(\"recentBlockhash\")]),u={numRequiredSignatures:n.Buffer.from([this.header.numRequiredSignatures]),numReadonlySignedAccounts:n.Buffer.from([this.header.numReadonlySignedAccounts]),numReadonlyUnsignedAccounts:n.Buffer.from([this.header.numReadonlyUnsignedAccounts]),keyCount:n.Buffer.from(e),keys:this.accountKeys.map((t=>Xi(t.toBytes()))),recentBlockhash:te.decode(this.recentBlockhash)};let c=n.Buffer.alloc(2048);const h=a.encode(u,c);return o.copy(c,h),c.slice(0,h+o.length)}static from(t){let e=[...t];const r=e.shift();if(r!==(127&r))throw new Error(\"Versioned messages must be deserialized with VersionedMessage.deserialize()\");const i=e.shift(),o=e.shift(),s=fo(e);let a=[];for(let t=0;t<s;t++){const t=e.slice(0,no);e=e.slice(no),a.push(new oo(n.Buffer.from(t)))}const u=e.slice(0,no);e=e.slice(no);const c=fo(e);let h=[];for(let t=0;t<c;t++){const t=e.shift(),r=fo(e),i=e.slice(0,r);e=e.slice(r);const o=fo(e),s=e.slice(0,o),a=te.encode(n.Buffer.from(s));e=e.slice(o),h.push({programIdIndex:t,accounts:i,data:a})}const f={header:{numRequiredSignatures:r,numReadonlySignedAccounts:i,numReadonlyUnsignedAccounts:o},recentBlockhash:te.encode(n.Buffer.from(u)),accountKeys:a,instructions:h};return new go(f)}}const mo=n.Buffer.alloc(64).fill(0);class wo{constructor(t){this.keys=void 0,this.programId=void 0,this.data=n.Buffer.alloc(0),this.programId=t.programId,this.keys=t.keys,t.data&&(this.data=t.data)}toJSON(){return{keys:this.keys.map((({pubkey:t,isSigner:e,isWritable:r})=>({pubkey:t.toJSON(),isSigner:e,isWritable:r}))),programId:this.programId.toJSON(),data:[...this.data]}}}class bo{get signature(){return this.signatures.length>0?this.signatures[0].signature:null}constructor(t){if(this.signatures=[],this.feePayer=void 0,this.instructions=[],this.recentBlockhash=void 0,this.lastValidBlockHeight=void 0,this.nonceInfo=void 0,this.minNonceContextSlot=void 0,this._message=void 0,this._json=void 0,t)if(t.feePayer&&(this.feePayer=t.feePayer),t.signatures&&(this.signatures=t.signatures),Object.prototype.hasOwnProperty.call(t,\"nonceInfo\")){const{minContextSlot:e,nonceInfo:r}=t;this.minNonceContextSlot=e,this.nonceInfo=r}else if(Object.prototype.hasOwnProperty.call(t,\"lastValidBlockHeight\")){const{blockhash:e,lastValidBlockHeight:r}=t;this.recentBlockhash=e,this.lastValidBlockHeight=r}else{const{recentBlockhash:e,nonceInfo:r}=t;r&&(this.nonceInfo=r),this.recentBlockhash=e}}toJSON(){return{recentBlockhash:this.recentBlockhash||null,feePayer:this.feePayer?this.feePayer.toJSON():null,nonceInfo:this.nonceInfo?{nonce:this.nonceInfo.nonce,nonceInstruction:this.nonceInfo.nonceInstruction.toJSON()}:null,instructions:this.instructions.map((t=>t.toJSON())),signers:this.signatures.map((({publicKey:t})=>t.toJSON()))}}add(...t){if(0===t.length)throw new Error(\"No instructions\");return t.forEach((t=>{\"instructions\"in t?this.instructions=this.instructions.concat(t.instructions):\"data\"in t&&\"programId\"in t&&\"keys\"in t?this.instructions.push(t):this.instructions.push(new wo(t))})),this}compileMessage(){if(this._message&&JSON.stringify(this.toJSON())===JSON.stringify(this._json))return this._message;let t,e,r;if(this.nonceInfo?(t=this.nonceInfo.nonce,e=this.instructions[0]!=this.nonceInfo.nonceInstruction?[this.nonceInfo.nonceInstruction,...this.instructions]:this.instructions):(t=this.recentBlockhash,e=this.instructions),!t)throw new Error(\"Transaction recentBlockhash required\");if(e.length<1&&console.warn(\"No instructions provided\"),this.feePayer)r=this.feePayer;else{if(!(this.signatures.length>0&&this.signatures[0].publicKey))throw new Error(\"Transaction fee payer required\");r=this.signatures[0].publicKey}for(let t=0;t<e.length;t++)if(void 0===e[t].programId)throw new Error(`Transaction instruction index ${t} has undefined program id`);const n=[],i=[];e.forEach((t=>{t.keys.forEach((t=>{i.push({...t})}));const e=t.programId.toString();n.includes(e)||n.push(e)})),n.forEach((t=>{i.push({pubkey:new oo(t),isSigner:!1,isWritable:!1})}));const o=[];i.forEach((t=>{const e=t.pubkey.toString(),r=o.findIndex((t=>t.pubkey.toString()===e));r>-1?(o[r].isWritable=o[r].isWritable||t.isWritable,o[r].isSigner=o[r].isSigner||t.isSigner):o.push(t)})),o.sort((function(t,e){if(t.isSigner!==e.isSigner)return t.isSigner?-1:1;if(t.isWritable!==e.isWritable)return t.isWritable?-1:1;return t.pubkey.toBase58().localeCompare(e.pubkey.toBase58(),\"en\",{localeMatcher:\"best fit\",usage:\"sort\",sensitivity:\"variant\",ignorePunctuation:!1,numeric:!1,caseFirst:\"lower\"})}));const s=o.findIndex((t=>t.pubkey.equals(r)));if(s>-1){const[t]=o.splice(s,1);t.isSigner=!0,t.isWritable=!0,o.unshift(t)}else o.unshift({pubkey:r,isSigner:!0,isWritable:!0});for(const t of this.signatures){const e=o.findIndex((e=>e.pubkey.equals(t.publicKey)));if(!(e>-1))throw new Error(`unknown signer: ${t.publicKey.toString()}`);o[e].isSigner||(o[e].isSigner=!0,console.warn(\"Transaction references a signature that is unnecessary, only the fee payer and instruction signer accounts should sign a transaction. This behavior is deprecated and will throw an error in the next major version release.\"))}let a=0,u=0,c=0;const h=[],f=[];o.forEach((({pubkey:t,isSigner:e,isWritable:r})=>{e?(h.push(t.toString()),a+=1,r||(u+=1)):(f.push(t.toString()),r||(c+=1))}));const l=h.concat(f),d=e.map((t=>{const{data:e,programId:r}=t;return{programIdIndex:l.indexOf(r.toString()),accounts:t.keys.map((t=>l.indexOf(t.pubkey.toString()))),data:te.encode(e)}}));return d.forEach((t=>{po(t.programIdIndex>=0),t.accounts.forEach((t=>po(t>=0)))})),new go({header:{numRequiredSignatures:a,numReadonlySignedAccounts:u,numReadonlyUnsignedAccounts:c},accountKeys:l,recentBlockhash:t,instructions:d})}_compile(){const t=this.compileMessage(),e=t.accountKeys.slice(0,t.header.numRequiredSignatures);if(this.signatures.length===e.length){if(this.signatures.every(((t,r)=>e[r].equals(t.publicKey))))return t}return this.signatures=e.map((t=>({signature:null,publicKey:t}))),t}serializeMessage(){return this._compile().serialize()}async getEstimatedFee(t){return(await t.getFeeForMessage(this.compileMessage())).value}setSigners(...t){if(0===t.length)throw new Error(\"No signers\");const e=new Set;this.signatures=t.filter((t=>{const r=t.toString();return!e.has(r)&&(e.add(r),!0)})).map((t=>({signature:null,publicKey:t})))}sign(...t){if(0===t.length)throw new Error(\"No signers\");const e=new Set,r=[];for(const n of t){const t=n.publicKey.toString();e.has(t)||(e.add(t),r.push(n))}this.signatures=r.map((t=>({signature:null,publicKey:t.publicKey})));const n=this._compile();this._partialSign(n,...r)}partialSign(...t){if(0===t.length)throw new Error(\"No signers\");const e=new Set,r=[];for(const n of t){const t=n.publicKey.toString();e.has(t)||(e.add(t),r.push(n))}const n=this._compile();this._partialSign(n,...r)}_partialSign(t,...e){const r=t.serialize();e.forEach((t=>{const e=((t,e)=>Ht.sign(t,e.slice(0,32)))(r,t.secretKey);this._addSignature(t.publicKey,Xi(e))}))}addSignature(t,e){this._compile(),this._addSignature(t,e)}_addSignature(t,e){po(64===e.length);const r=this.signatures.findIndex((e=>t.equals(e.publicKey)));if(r<0)throw new Error(`unknown signer: ${t.toString()}`);this.signatures[r].signature=n.Buffer.from(e)}verifySignatures(t){return this._verifySignatures(this.serializeMessage(),void 0===t||t)}_verifySignatures(t,e){for(const{signature:r,publicKey:n}of this.signatures)if(null===r){if(e)return!1}else if(!Ji(r,t,n.toBytes()))return!1;return!0}serialize(t){const{requireAllSignatures:e,verifySignatures:r}=Object.assign({requireAllSignatures:!0,verifySignatures:!0},t),n=this.serializeMessage();if(r&&!this._verifySignatures(n,e))throw new Error(\"Signature verification failed\");return this._serialize(n)}_serialize(t){const{signatures:e}=this,r=[];lo(r,e.length);const i=r.length+64*e.length+t.length,o=n.Buffer.alloc(i);return po(e.length<256),n.Buffer.from(r).copy(o,0),e.forEach((({signature:t},e)=>{null!==t&&(po(64===t.length,\"signature has invalid length\"),n.Buffer.from(t).copy(o,r.length+64*e))})),t.copy(o,r.length+64*e.length),po(o.length<=so,`Transaction too large: ${o.length} > 1232`),o}get keys(){return po(1===this.instructions.length),this.instructions[0].keys.map((t=>t.pubkey))}get programId(){return po(1===this.instructions.length),this.instructions[0].programId}get data(){return po(1===this.instructions.length),this.instructions[0].data}static from(t){let e=[...t];const r=fo(e);let i=[];for(let t=0;t<r;t++){const t=e.slice(0,64);e=e.slice(64),i.push(te.encode(n.Buffer.from(t)))}return bo.populate(go.from(e),i)}static populate(t,e=[]){const r=new bo;return r.recentBlockhash=t.recentBlockhash,t.header.numRequiredSignatures>0&&(r.feePayer=t.accountKeys[0]),e.forEach(((e,n)=>{const i={signature:e==te.encode(mo)?null:te.decode(e),publicKey:t.accountKeys[n]};r.signatures.push(i)})),t.instructions.forEach((e=>{const n=e.accounts.map((e=>{const n=t.accountKeys[e];return{pubkey:n,isSigner:r.signatures.some((t=>t.publicKey.toString()===n.toString()))||t.isAccountSigner(e),isWritable:t.isAccountWritable(e)}}));r.instructions.push(new wo({keys:n,programId:t.accountKeys[e.programIdIndex],data:te.decode(e.data)}))})),r._message=t,r._json=r.toJSON(),r}}new oo(\"SysvarC1ock11111111111111111111111111111111\"),new oo(\"SysvarEpochSchedu1e111111111111111111111111\"),new oo(\"Sysvar1nstructions1111111111111111111111111\");const vo=new oo(\"SysvarRecentB1ockHashes11111111111111111111\"),xo=new oo(\"SysvarRent111111111111111111111111111111111\");function Eo(t,e){const r=t.layout.span>=0?t.layout.span:ho(t,e),i=n.Buffer.alloc(r),o=Object.assign({instruction:t.index},e);return t.layout.encode(o,i),i}new oo(\"SysvarRewards111111111111111111111111111111\"),new oo(\"SysvarS1otHashes111111111111111111111111111\"),new oo(\"SysvarS1otHistory11111111111111111111111111\"),new oo(\"SysvarStakeHistory1111111111111111111111111\");const Bo=Ar(\"lamportsPerSignature\"),So=Ur([_r(\"version\"),_r(\"state\"),uo(\"authorizedPubkey\"),uo(\"nonce\"),Ur([Bo],\"feeCalculator\")]).span,ko=(Mo=8,t=>{const e=Tr(Mo,t),{encode:r,decode:i}=(t=>({decode:t.decode.bind(t),encode:t.encode.bind(t)}))(e),o=e;return o.decode=(t,e)=>{const r=i(t,e);return Rr(n.Buffer.from(r))},o.encode=(t,e,n)=>{const i=Nr(t,Mo);return r(i,e,n)},o});var Mo;const Io=Object.freeze({Create:{index:0,layout:Ur([_r(\"instruction\"),Or(\"lamports\"),Or(\"space\"),uo(\"programId\")])},Assign:{index:1,layout:Ur([_r(\"instruction\"),uo(\"programId\")])},Transfer:{index:2,layout:Ur([_r(\"instruction\"),ko(\"lamports\")])},CreateWithSeed:{index:3,layout:Ur([_r(\"instruction\"),uo(\"base\"),co(\"seed\"),Or(\"lamports\"),Or(\"space\"),uo(\"programId\")])},AdvanceNonceAccount:{index:4,layout:Ur([_r(\"instruction\")])},WithdrawNonceAccount:{index:5,layout:Ur([_r(\"instruction\"),Or(\"lamports\")])},InitializeNonceAccount:{index:6,layout:Ur([_r(\"instruction\"),uo(\"authorized\")])},AuthorizeNonceAccount:{index:7,layout:Ur([_r(\"instruction\"),uo(\"authorized\")])},Allocate:{index:8,layout:Ur([_r(\"instruction\"),Or(\"space\")])},AllocateWithSeed:{index:9,layout:Ur([_r(\"instruction\"),uo(\"base\"),co(\"seed\"),Or(\"space\"),uo(\"programId\")])},AssignWithSeed:{index:10,layout:Ur([_r(\"instruction\"),uo(\"base\"),co(\"seed\"),uo(\"programId\")])},TransferWithSeed:{index:11,layout:Ur([_r(\"instruction\"),ko(\"lamports\"),co(\"seed\"),uo(\"programId\")])},UpgradeNonceAccount:{index:12,layout:Ur([_r(\"instruction\")])}});class _o{constructor(){}static createAccount(t){const e=Eo(Io.Create,{lamports:t.lamports,space:t.space,programId:Xi(t.programId.toBuffer())});return new wo({keys:[{pubkey:t.fromPubkey,isSigner:!0,isWritable:!0},{pubkey:t.newAccountPubkey,isSigner:!0,isWritable:!0}],programId:this.programId,data:e})}static transfer(t){let e,r;if(\"basePubkey\"in t){e=Eo(Io.TransferWithSeed,{lamports:BigInt(t.lamports),seed:t.seed,programId:Xi(t.programId.toBuffer())}),r=[{pubkey:t.fromPubkey,isSigner:!1,isWritable:!0},{pubkey:t.basePubkey,isSigner:!0,isWritable:!1},{pubkey:t.toPubkey,isSigner:!1,isWritable:!0}]}else{e=Eo(Io.Transfer,{lamports:BigInt(t.lamports)}),r=[{pubkey:t.fromPubkey,isSigner:!0,isWritable:!0},{pubkey:t.toPubkey,isSigner:!1,isWritable:!0}]}return new wo({keys:r,programId:this.programId,data:e})}static assign(t){let e,r;if(\"basePubkey\"in t){e=Eo(Io.AssignWithSeed,{base:Xi(t.basePubkey.toBuffer()),seed:t.seed,programId:Xi(t.programId.toBuffer())}),r=[{pubkey:t.accountPubkey,isSigner:!1,isWritable:!0},{pubkey:t.basePubkey,isSigner:!0,isWritable:!1}]}else{e=Eo(Io.Assign,{programId:Xi(t.programId.toBuffer())}),r=[{pubkey:t.accountPubkey,isSigner:!0,isWritable:!0}]}return new wo({keys:r,programId:this.programId,data:e})}static createAccountWithSeed(t){const e=Eo(Io.CreateWithSeed,{base:Xi(t.basePubkey.toBuffer()),seed:t.seed,lamports:t.lamports,space:t.space,programId:Xi(t.programId.toBuffer())});let r=[{pubkey:t.fromPubkey,isSigner:!0,isWritable:!0},{pubkey:t.newAccountPubkey,isSigner:!1,isWritable:!0}];return t.basePubkey!=t.fromPubkey&&r.push({pubkey:t.basePubkey,isSigner:!0,isWritable:!1}),new wo({keys:r,programId:this.programId,data:e})}static createNonceAccount(t){const e=new bo;\"basePubkey\"in t&&\"seed\"in t?e.add(_o.createAccountWithSeed({fromPubkey:t.fromPubkey,newAccountPubkey:t.noncePubkey,basePubkey:t.basePubkey,seed:t.seed,lamports:t.lamports,space:So,programId:this.programId})):e.add(_o.createAccount({fromPubkey:t.fromPubkey,newAccountPubkey:t.noncePubkey,lamports:t.lamports,space:So,programId:this.programId}));const r={noncePubkey:t.noncePubkey,authorizedPubkey:t.authorizedPubkey};return e.add(this.nonceInitialize(r)),e}static nonceInitialize(t){const e=Eo(Io.InitializeNonceAccount,{authorized:Xi(t.authorizedPubkey.toBuffer())}),r={keys:[{pubkey:t.noncePubkey,isSigner:!1,isWritable:!0},{pubkey:vo,isSigner:!1,isWritable:!1},{pubkey:xo,isSigner:!1,isWritable:!1}],programId:this.programId,data:e};return new wo(r)}static nonceAdvance(t){const e=Eo(Io.AdvanceNonceAccount),r={keys:[{pubkey:t.noncePubkey,isSigner:!1,isWritable:!0},{pubkey:vo,isSigner:!1,isWritable:!1},{pubkey:t.authorizedPubkey,isSigner:!0,isWritable:!1}],programId:this.programId,data:e};return new wo(r)}static nonceWithdraw(t){const e=Eo(Io.WithdrawNonceAccount,{lamports:t.lamports});return new wo({keys:[{pubkey:t.noncePubkey,isSigner:!1,isWritable:!0},{pubkey:t.toPubkey,isSigner:!1,isWritable:!0},{pubkey:vo,isSigner:!1,isWritable:!1},{pubkey:xo,isSigner:!1,isWritable:!1},{pubkey:t.authorizedPubkey,isSigner:!0,isWritable:!1}],programId:this.programId,data:e})}static nonceAuthorize(t){const e=Eo(Io.AuthorizeNonceAccount,{authorized:Xi(t.newAuthorizedPubkey.toBuffer())});return new wo({keys:[{pubkey:t.noncePubkey,isSigner:!1,isWritable:!0},{pubkey:t.authorizedPubkey,isSigner:!0,isWritable:!1}],programId:this.programId,data:e})}static allocate(t){let e,r;if(\"basePubkey\"in t){e=Eo(Io.AllocateWithSeed,{base:Xi(t.basePubkey.toBuffer()),seed:t.seed,space:t.space,programId:Xi(t.programId.toBuffer())}),r=[{pubkey:t.accountPubkey,isSigner:!1,isWritable:!0},{pubkey:t.basePubkey,isSigner:!0,isWritable:!1}]}else{e=Eo(Io.Allocate,{space:t.space}),r=[{pubkey:t.accountPubkey,isSigner:!0,isWritable:!0}]}return new wo({keys:r,programId:this.programId,data:e})}}_o.programId=new oo(\"11111111111111111111111111111111\"),new oo(\"BPFLoader2111111111111111111111111111111111\"),Ur([_r(\"typeIndex\"),ko(\"deactivationSlot\"),Ar(\"lastExtendedSlot\"),Mr(\"lastExtendedStartIndex\"),Mr(),Lr(uo(),kr(Mr(),-1),\"authority\")]);const Ao=cn(Jr(oo),nn(),(t=>new oo(t))),Oo=on([nn(),Xr(\"base64\")]),Uo=cn(Jr(n.Buffer),Oo,(t=>n.Buffer.from(t[0],\"base64\")));function Lo(t){return an([sn({jsonrpc:Xr(\"2.0\"),id:nn(),result:t}),sn({jsonrpc:Xr(\"2.0\"),id:nn(),error:sn({code:un(),message:nn(),data:en(Zr(\"any\",(()=>!0)))})})])}const To=Lo(un());function Po(t){return cn(Lo(t),To,(e=>\"error\"in e?e:{...e,result:Vr(e.result,t)}))}function Ro(t){return Po(sn({context:sn({slot:tn()}),value:t}))}function jo(t){return sn({context:sn({slot:tn()}),value:t})}const No=sn({foundation:tn(),foundationTerm:tn(),initial:tn(),taper:tn(),terminal:tn()});Po(Gr(Qr(sn({epoch:tn(),effectiveSlot:tn(),amount:tn(),postBalance:tn(),commission:en(Qr(tn()))}))));const zo=Gr(sn({slot:tn(),prioritizationFee:tn()})),Co=sn({total:tn(),validator:tn(),foundation:tn(),epoch:tn()}),Wo=sn({epoch:tn(),slotIndex:tn(),slotsInEpoch:tn(),absoluteSlot:tn(),blockHeight:en(tn()),transactionCount:en(tn())}),qo=sn({slotsPerEpoch:tn(),leaderScheduleSlotOffset:tn(),warmup:Yr(),firstNormalEpoch:tn(),firstNormalSlot:tn()}),Fo=rn(nn(),Gr(tn())),Do=Qr(an([sn({}),nn()])),Ho=sn({err:Do}),Vo=Xr(\"receivedSignature\");sn({\"solana-core\":nn(),\"feature-set\":en(tn())}),Ro(sn({err:Qr(an([sn({}),nn()])),logs:Qr(Gr(nn())),accounts:en(Qr(Gr(Qr(sn({executable:Yr(),owner:nn(),lamports:tn(),data:Gr(nn()),rentEpoch:en(tn())}))))),unitsConsumed:en(tn()),returnData:en(Qr(sn({programId:nn(),data:on([nn(),Xr(\"base64\")])})))})),Ro(sn({byIdentity:rn(nn(),Gr(tn())),range:sn({firstSlot:tn(),lastSlot:tn()})})),Po(No),Po(Co),Po(zo),Po(Wo),Po(qo),Po(Fo),Po(tn()),Ro(sn({total:tn(),circulating:tn(),nonCirculating:tn(),nonCirculatingAccounts:Gr(Ao)}));const Ko=sn({amount:nn(),uiAmount:Qr(tn()),decimals:tn(),uiAmountString:en(nn())});Ro(Gr(sn({address:Ao,amount:nn(),uiAmount:Qr(tn()),decimals:tn(),uiAmountString:en(nn())}))),Ro(Gr(sn({pubkey:Ao,account:sn({executable:Yr(),owner:Ao,lamports:tn(),data:Uo,rentEpoch:tn()})})));const $o=sn({program:nn(),parsed:un(),space:tn()});Ro(Gr(sn({pubkey:Ao,account:sn({executable:Yr(),owner:Ao,lamports:tn(),data:$o,rentEpoch:tn()})}))),Ro(Gr(sn({lamports:tn(),address:Ao})));const Zo=sn({executable:Yr(),owner:Ao,lamports:tn(),data:Uo,rentEpoch:tn()});sn({pubkey:Ao,account:Zo});const Go=cn(an([Jr(n.Buffer),$o]),an([Oo,$o]),(t=>Array.isArray(t)?Vr(t,Uo):t)),Yo=sn({executable:Yr(),owner:Ao,lamports:tn(),data:Go,rentEpoch:tn()});sn({pubkey:Ao,account:Yo}),sn({state:an([Xr(\"active\"),Xr(\"inactive\"),Xr(\"activating\"),Xr(\"deactivating\")]),active:tn(),inactive:tn()}),Po(Gr(sn({signature:nn(),slot:tn(),err:Do,memo:Qr(nn()),blockTime:en(Qr(tn()))}))),Po(Gr(sn({signature:nn(),slot:tn(),err:Do,memo:Qr(nn()),blockTime:en(Qr(tn()))}))),sn({subscription:tn(),result:jo(Zo)});const Jo=sn({pubkey:Ao,account:Zo});sn({subscription:tn(),result:jo(Jo)});const Xo=sn({parent:tn(),slot:tn(),root:tn()});sn({subscription:tn(),result:Xo});const Qo=an([sn({type:an([Xr(\"firstShredReceived\"),Xr(\"completed\"),Xr(\"optimisticConfirmation\"),Xr(\"root\")]),slot:tn(),timestamp:tn()}),sn({type:Xr(\"createdBank\"),parent:tn(),slot:tn(),timestamp:tn()}),sn({type:Xr(\"frozen\"),slot:tn(),timestamp:tn(),stats:sn({numTransactionEntries:tn(),numSuccessfulTransactions:tn(),numFailedTransactions:tn(),maxTransactionsPerEntry:tn()})}),sn({type:Xr(\"dead\"),slot:tn(),timestamp:tn(),err:nn()})]);sn({subscription:tn(),result:Qo}),sn({subscription:tn(),result:jo(an([Ho,Vo]))}),sn({subscription:tn(),result:tn()}),sn({pubkey:nn(),gossip:Qr(nn()),tpu:Qr(nn()),rpc:Qr(nn()),version:Qr(nn())});const ts=sn({votePubkey:nn(),nodePubkey:nn(),activatedStake:tn(),epochVoteAccount:Yr(),epochCredits:Gr(on([tn(),tn(),tn()])),commission:tn(),lastVote:tn(),rootSlot:Qr(tn())});Po(sn({current:Gr(ts),delinquent:Gr(ts)}));const es=an([Xr(\"processed\"),Xr(\"confirmed\"),Xr(\"finalized\")]),rs=sn({slot:tn(),confirmations:Qr(tn()),err:Do,confirmationStatus:en(es)});Ro(Gr(Qr(rs))),Po(tn());const ns=sn({accountKey:Ao,writableIndexes:Gr(tn()),readonlyIndexes:Gr(tn())}),is=sn({signatures:Gr(nn()),message:sn({accountKeys:Gr(nn()),header:sn({numRequiredSignatures:tn(),numReadonlySignedAccounts:tn(),numReadonlyUnsignedAccounts:tn()}),instructions:Gr(sn({accounts:Gr(tn()),data:nn(),programIdIndex:tn()})),recentBlockhash:nn(),addressTableLookups:en(Gr(ns))})}),os=sn({pubkey:Ao,signer:Yr(),writable:Yr(),source:en(an([Xr(\"transaction\"),Xr(\"lookupTable\")]))}),ss=sn({accountKeys:Gr(os),signatures:Gr(nn())}),as=sn({parsed:un(),program:nn(),programId:Ao}),us=sn({accounts:Gr(Ao),data:nn(),programId:Ao}),cs=cn(an([us,as]),an([sn({parsed:un(),program:nn(),programId:nn()}),sn({accounts:Gr(nn()),data:nn(),programId:nn()})]),(t=>Vr(t,\"accounts\"in t?us:as))),hs=sn({signatures:Gr(nn()),message:sn({accountKeys:Gr(os),instructions:Gr(cs),recentBlockhash:nn(),addressTableLookups:en(Qr(Gr(ns)))})}),fs=sn({accountIndex:tn(),mint:nn(),owner:en(nn()),uiTokenAmount:Ko}),ls=sn({writable:Gr(Ao),readonly:Gr(Ao)}),ds=sn({err:Do,fee:tn(),innerInstructions:en(Qr(Gr(sn({index:tn(),instructions:Gr(sn({accounts:Gr(tn()),data:nn(),programIdIndex:tn()}))})))),preBalances:Gr(tn()),postBalances:Gr(tn()),logMessages:en(Qr(Gr(nn()))),preTokenBalances:en(Qr(Gr(fs))),postTokenBalances:en(Qr(Gr(fs))),loadedAddresses:en(ls),computeUnitsConsumed:en(tn())}),ps=sn({err:Do,fee:tn(),innerInstructions:en(Qr(Gr(sn({index:tn(),instructions:Gr(cs)})))),preBalances:Gr(tn()),postBalances:Gr(tn()),logMessages:en(Qr(Gr(nn()))),preTokenBalances:en(Qr(Gr(fs))),postTokenBalances:en(Qr(Gr(fs))),loadedAddresses:en(ls),computeUnitsConsumed:en(tn())}),ys=an([Xr(0),Xr(\"legacy\")]),gs=sn({pubkey:nn(),lamports:tn(),postBalance:Qr(tn()),rewardType:Qr(nn()),commission:en(Qr(tn()))});Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),transactions:Gr(sn({transaction:is,meta:Qr(ds),version:en(ys)})),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),transactions:Gr(sn({transaction:ss,meta:Qr(ds),version:en(ys)})),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),transactions:Gr(sn({transaction:hs,meta:Qr(ps),version:en(ys)})),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),transactions:Gr(sn({transaction:ss,meta:Qr(ps),version:en(ys)})),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),rewards:en(Gr(gs)),blockTime:Qr(tn()),blockHeight:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),transactions:Gr(sn({transaction:is,meta:Qr(ds)})),rewards:en(Gr(gs)),blockTime:Qr(tn())}))),Po(Qr(sn({blockhash:nn(),previousBlockhash:nn(),parentSlot:tn(),signatures:Gr(nn()),blockTime:Qr(tn())}))),Po(Qr(sn({slot:tn(),meta:ds,blockTime:en(Qr(tn())),transaction:is,version:en(ys)}))),Po(Qr(sn({slot:tn(),transaction:hs,meta:Qr(ps),blockTime:en(Qr(tn())),version:en(ys)}))),Ro(sn({blockhash:nn(),feeCalculator:sn({lamportsPerSignature:tn()})})),Ro(sn({blockhash:nn(),lastValidBlockHeight:tn()})),Ro(Yr());Po(Gr(sn({slot:tn(),numTransactions:tn(),numSlots:tn(),samplePeriodSecs:tn()}))),Ro(Qr(sn({feeCalculator:sn({lamportsPerSignature:tn()})}))),Po(nn()),Po(nn());const ms=sn({err:Do,logs:Gr(nn()),signature:nn()});var ws;sn({result:jo(ms),subscription:tn()}),Object.freeze({CreateLookupTable:{index:0,layout:Ur([_r(\"instruction\"),ko(\"recentSlot\"),Mr(\"bumpSeed\")])},FreezeLookupTable:{index:1,layout:Ur([_r(\"instruction\")])},ExtendLookupTable:{index:2,layout:Ur([_r(\"instruction\"),ko(),Lr(uo(),kr(_r(),-8),\"addresses\")])},DeactivateLookupTable:{index:3,layout:Ur([_r(\"instruction\")])},CloseLookupTable:{index:4,layout:Ur([_r(\"instruction\")])}}),new oo(\"AddressLookupTab1e1111111111111111111111111\"),Object.freeze({RequestUnits:{index:0,layout:Ur([Mr(\"instruction\"),_r(\"units\"),_r(\"additionalFee\")])},RequestHeapFrame:{index:1,layout:Ur([Mr(\"instruction\"),_r(\"bytes\")])},SetComputeUnitLimit:{index:2,layout:Ur([Mr(\"instruction\"),_r(\"units\")])},SetComputeUnitPrice:{index:3,layout:Ur([Mr(\"instruction\"),ko(\"microLamports\")])}}),new oo(\"ComputeBudget111111111111111111111111111111\"),Ur([Mr(\"numSignatures\"),Mr(\"padding\"),Ir(\"signatureOffset\"),Ir(\"signatureInstructionIndex\"),Ir(\"publicKeyOffset\"),Ir(\"publicKeyInstructionIndex\"),Ir(\"messageDataOffset\"),Ir(\"messageDataSize\"),Ir(\"messageInstructionIndex\")]),new oo(\"Ed25519SigVerify111111111111111111111111111\"),Gi.utils.isValidPrivateKey,Gi.getPublicKey,Ur([Mr(\"numSignatures\"),Ir(\"signatureOffset\"),Mr(\"signatureInstructionIndex\"),Ir(\"ethAddressOffset\"),Mr(\"ethAddressInstructionIndex\"),Ir(\"messageDataOffset\"),Ir(\"messageDataSize\"),Mr(\"messageInstructionIndex\"),Tr(20,\"ethAddress\"),Tr(64,\"signature\"),Mr(\"recoveryId\")]),new oo(\"KeccakSecp256k11111111111111111111111111111\"),new oo(\"StakeConfig11111111111111111111111111111111\");class bs{constructor(t,e,r){this.unixTimestamp=void 0,this.epoch=void 0,this.custodian=void 0,this.unixTimestamp=t,this.epoch=e,this.custodian=r}}ws=bs,bs.default=new ws(0,0,oo.default),Object.freeze({Initialize:{index:0,layout:Ur([_r(\"instruction\"),((t=\"authorized\")=>Ur([uo(\"staker\"),uo(\"withdrawer\")],t))(),((t=\"lockup\")=>Ur([Or(\"unixTimestamp\"),Or(\"epoch\"),uo(\"custodian\")],t))()])},Authorize:{index:1,layout:Ur([_r(\"instruction\"),uo(\"newAuthorized\"),_r(\"stakeAuthorizationType\")])},Delegate:{index:2,layout:Ur([_r(\"instruction\")])},Split:{index:3,layout:Ur([_r(\"instruction\"),Or(\"lamports\")])},Withdraw:{index:4,layout:Ur([_r(\"instruction\"),Or(\"lamports\")])},Deactivate:{index:5,layout:Ur([_r(\"instruction\")])},Merge:{index:7,layout:Ur([_r(\"instruction\")])},AuthorizeWithSeed:{index:8,layout:Ur([_r(\"instruction\"),uo(\"newAuthorized\"),_r(\"stakeAuthorizationType\"),co(\"authoritySeed\"),uo(\"authorityOwner\")])}}),Object.freeze({Staker:{index:0},Withdrawer:{index:1}}),new oo(\"Stake11111111111111111111111111111111111111\"),Object.freeze({InitializeAccount:{index:0,layout:Ur([_r(\"instruction\"),((t=\"voteInit\")=>Ur([uo(\"nodePubkey\"),uo(\"authorizedVoter\"),uo(\"authorizedWithdrawer\"),Mr(\"commission\")],t))()])},Authorize:{index:1,layout:Ur([_r(\"instruction\"),uo(\"newAuthorized\"),_r(\"voteAuthorizationType\")])},Withdraw:{index:3,layout:Ur([_r(\"instruction\"),Or(\"lamports\")])},AuthorizeWithSeed:{index:10,layout:Ur([_r(\"instruction\"),((t=\"voteAuthorizeWithSeedArgs\")=>Ur([_r(\"voteAuthorizationType\"),uo(\"currentAuthorityDerivedKeyOwnerPubkey\"),co(\"currentAuthorityDerivedKeySeed\"),uo(\"newAuthorized\")],t))()])}}),Object.freeze({Voter:{index:0},Withdrawer:{index:1}}),new oo(\"Vote111111111111111111111111111111111111111\"),new oo(\"Va1idator1nfo111111111111111111111111111111\"),sn({name:nn(),website:en(nn()),details:en(nn()),keybaseUsername:en(nn())}),new oo(\"Vote111111111111111111111111111111111111111\"),Ur([uo(\"nodePubkey\"),uo(\"authorizedWithdrawer\"),Mr(\"commission\"),Ar(),Lr(Ur([Ar(\"slot\"),_r(\"confirmationCount\")]),kr(_r(),-8),\"votes\"),Mr(\"rootSlotValid\"),Ar(\"rootSlot\"),Ar(),Lr(Ur([Ar(\"epoch\"),uo(\"authorizedVoter\")]),kr(_r(),-8),\"authorizedVoters\"),Ur([Lr(Ur([uo(\"authorizedPubkey\"),Ar(\"epochOfLastAuthorizedSwitch\"),Ar(\"targetEpoch\")]),32,\"buf\"),Ar(\"idx\"),Mr(\"isEmpty\")],\"priorVoters\"),Ar(),Lr(Ur([Ar(\"epoch\"),Ar(\"credits\"),Ar(\"prevCredits\")]),kr(_r(),-8),\"epochCredits\"),Ur([Ar(\"slot\"),Ar(\"timestamp\")],\"lastTimestamp\")]);var vs,xs=[\"u8\",\"u16\",\"u32\",\"u64\",\"u128\",\"i8\",\"i16\",\"i32\",\"i64\",\"i128\",\"f32\",\"f64\"],Es=function(){function t(){this.offset=0,this.buffer_size=256,this.buffer=new ArrayBuffer(this.buffer_size),this.view=new DataView(this.buffer)}return t.prototype.resize_if_necessary=function(t){if(this.buffer_size-this.offset<t){this.buffer_size=Math.max(2*this.buffer_size,this.buffer_size+t);var e=new ArrayBuffer(this.buffer_size);new Uint8Array(e).set(new Uint8Array(this.buffer)),this.buffer=e,this.view=new DataView(e)}},t.prototype.get_used_buffer=function(){return new Uint8Array(this.buffer).slice(0,this.offset)},t.prototype.store_value=function(t,e){var r=e.substring(1),n=parseInt(r)/8;this.resize_if_necessary(n);var i=\"f\"===e[0]?\"setFloat\".concat(r):\"i\"===e[0]?\"setInt\".concat(r):\"setUint\".concat(r);this.view[i](this.offset,t,!0),this.offset+=n},t.prototype.store_bytes=function(t){this.resize_if_necessary(t.length),new Uint8Array(this.buffer).set(new Uint8Array(t),this.offset),this.offset+=t.length},t}(),Bs=function(){function t(t){this.offset=0,this.buffer_size=t.length,this.buffer=new ArrayBuffer(t.length),new Uint8Array(this.buffer).set(t),this.view=new DataView(this.buffer)}return t.prototype.assert_enough_buffer=function(t){if(this.offset+t>this.buffer.byteLength)throw new Error(\"Error in schema, the buffer is smaller than expected\")},t.prototype.consume_value=function(t){var e=t.substring(1),r=parseInt(e)/8;this.assert_enough_buffer(r);var n=\"f\"===t[0]?\"getFloat\".concat(e):\"i\"===t[0]?\"getInt\".concat(e):\"getUint\".concat(e),i=this.view[n](this.offset,!0);return this.offset+=r,i},t.prototype.consume_bytes=function(t){this.assert_enough_buffer(t);var e=this.buffer.slice(this.offset,this.offset+t);return this.offset+=t,e},t}(),Ss=(vs=function(t,e){return vs=Object.setPrototypeOf||{__proto__:[]}instanceof Array&&function(t,e){t.__proto__=e}||function(t,e){for(var r in e)Object.prototype.hasOwnProperty.call(e,r)&&(t[r]=e[r])},vs(t,e)},function(t,e){if(\"function\"!=typeof e&&null!==e)throw new TypeError(\"Class extends value \"+String(e)+\" is not a constructor or null\");function r(){this.constructor=t}vs(t,e),t.prototype=null===e?Object.create(e):(r.prototype=e.prototype,new r)});function ks(t,e,r){if(typeof t!==e)throw new Error(\"Expected \".concat(e,\" not \").concat(typeof t,\"(\").concat(t,\") at \").concat(r.join(\".\")))}function Ms(t,e,r){if(t!==e)throw new Error(\"Array length \".concat(t,\" does not match schema length \").concat(e,\" at \").concat(r.join(\".\")))}var Is=xs.concat([\"bool\",\"string\"]),_s=[\"option\",\"enum\",\"array\",\"set\",\"map\",\"struct\"],As=function(t){function e(e,r){var n=\"Invalid schema: \".concat(JSON.stringify(e),\" expected \").concat(r);return t.call(this,n)||this}return Ss(e,t),e}(Error);function Os(t){if(\"string\"!=typeof t||!Is.includes(t)){if(t&&\"object\"==typeof t){var e=Object.keys(t);if(1===e.length&&_s.includes(e[0])){var r=e[0];if(\"option\"===r)return Os(t[r]);if(\"enum\"===r)return function(t){if(!Array.isArray(t))throw new As(t,\"Array\");for(var e=0,r=t;e<r.length;e++){var n=r[e];if(\"object\"!=typeof n||!(\"struct\"in n))throw new Error('Missing \"struct\" key in enum schema');if(\"object\"!=typeof n.struct||1!==Object.keys(n.struct).length)throw new Error('The \"struct\" in each enum must have a single key');Os({struct:n.struct})}}(t[r]);if(\"array\"===r)return function(t){if(\"object\"!=typeof t)throw new As(t,\"{ type, len? }\");if(t.len&&\"number\"!=typeof t.len)throw new Error(\"Invalid schema: \".concat(t));if(\"type\"in t)return Os(t.type);throw new As(t,\"{ type, len? }\")}(t[r]);if(\"set\"===r)return Os(t[r]);if(\"map\"===r)return function(t){if(\"object\"!=typeof t||!(\"key\"in t)||!(\"value\"in t))throw new As(t,\"{ key, value }\");Os(t.key),Os(t.value)}(t[r]);if(\"struct\"===r)return function(t){if(\"object\"!=typeof t)throw new As(t,\"object\");for(var e in t)Os(t[e])}(t[r])}}throw new As(t,_s.join(\", \")+\" or \"+Is.join(\", \"))}}var Us=function(){function t(t){this.encoded=new Es,this.fieldPath=[\"value\"],this.checkTypes=t}return t.prototype.encode=function(t,e){return this.encode_value(t,e),this.encoded.get_used_buffer()},t.prototype.encode_value=function(t,e){if(\"string\"==typeof e){if(xs.includes(e))return this.encode_integer(t,e);if(\"string\"===e)return this.encode_string(t);if(\"bool\"===e)return this.encode_boolean(t)}if(\"object\"==typeof e){if(\"option\"in e)return this.encode_option(t,e);if(\"enum\"in e)return this.encode_enum(t,e);if(\"array\"in e)return this.encode_array(t,e);if(\"set\"in e)return this.encode_set(t,e);if(\"map\"in e)return this.encode_map(t,e);if(\"struct\"in e)return this.encode_struct(t,e)}},t.prototype.encode_integer=function(t,e){var r=parseInt(e.substring(1));r<=32||\"f64\"==e?(this.checkTypes&&ks(t,\"number\",this.fieldPath),this.encoded.store_value(t,e)):(this.checkTypes&&function(t,e){if(!([\"number\",\"string\",\"bigint\",\"boolean\"].includes(typeof t)||\"object\"==typeof t&&null!==t&&\"toString\"in t))throw new Error(\"Expected bigint, number, boolean or string not \".concat(typeof t,\"(\").concat(t,\") at \").concat(e.join(\".\")))}(t,this.fieldPath),this.encode_bigint(BigInt(t),r))},t.prototype.encode_bigint=function(t,e){for(var r=e/8,n=new Uint8Array(r),i=0;i<r;i++)n[i]=Number(t&BigInt(255)),t>>=BigInt(8);this.encoded.store_bytes(new Uint8Array(n))},t.prototype.encode_string=function(t){this.checkTypes&&ks(t,\"string\",this.fieldPath);var e=t;this.encoded.store_value(e.length,\"u32\");for(var r=0;r<e.length;r++)this.encoded.store_value(e.charCodeAt(r),\"u8\")},t.prototype.encode_boolean=function(t){this.checkTypes&&ks(t,\"boolean\",this.fieldPath),this.encoded.store_value(t?1:0,\"u8\")},t.prototype.encode_option=function(t,e){null==t?this.encoded.store_value(0,\"u8\"):(this.encoded.store_value(1,\"u8\"),this.encode_value(t,e.option))},t.prototype.encode_enum=function(t,e){this.checkTypes&&function(t,e){if(\"object\"!=typeof t||null===t)throw new Error(\"Expected object not \".concat(typeof t,\"(\").concat(t,\") at \").concat(e.join(\".\")))}(t,this.fieldPath);for(var r=Object.keys(t)[0],n=0;n<e.enum.length;n++){var i=e.enum[n];if(r===Object.keys(i.struct)[0])return this.encoded.store_value(n,\"u8\"),this.encode_struct(t,i)}throw new Error(\"Enum key (\".concat(r,\") not found in enum schema: \").concat(JSON.stringify(e),\" at \").concat(this.fieldPath.join(\".\")))},t.prototype.encode_array=function(t,e){if(function(t){return Array.isArray(t)||!!t&&\"object\"==typeof t&&\"length\"in t&&\"number\"==typeof t.length&&(0===t.length||t.length>0&&t.length-1 in t)}(t))return this.encode_arraylike(t,e);if(t instanceof ArrayBuffer)return this.encode_buffer(t,e);throw new Error(\"Expected Array-like not \".concat(typeof t,\"(\").concat(t,\") at \").concat(this.fieldPath.join(\".\")))},t.prototype.encode_arraylike=function(t,e){e.array.len?Ms(t.length,e.array.len,this.fieldPath):this.encoded.store_value(t.length,\"u32\");for(var r=0;r<t.length;r++)this.encode_value(t[r],e.array.type)},t.prototype.encode_buffer=function(t,e){e.array.len?Ms(t.byteLength,e.array.len,this.fieldPath):this.encoded.store_value(t.byteLength,\"u32\"),this.encoded.store_bytes(new Uint8Array(t))},t.prototype.encode_set=function(t,e){this.checkTypes&&ks(t,\"object\",this.fieldPath);var r=t instanceof Set?Array.from(t.values()):Object.values(t);this.encoded.store_value(r.length,\"u32\");for(var n=0,i=r;n<i.length;n++){var o=i[n];this.encode_value(o,e.set)}},t.prototype.encode_map=function(t,e){this.checkTypes&&ks(t,\"object\",this.fieldPath);var r=t instanceof Map,n=r?Array.from(t.keys()):Object.keys(t);this.encoded.store_value(n.length,\"u32\");for(var i=0,o=n;i<o.length;i++){var s=o[i];this.encode_value(s,e.map.key),this.encode_value(r?t.get(s):t[s],e.map.value)}},t.prototype.encode_struct=function(t,e){this.checkTypes&&ks(t,\"object\",this.fieldPath);for(var r=0,n=Object.keys(e.struct);r<n.length;r++){var i=n[r];this.fieldPath.push(i),this.encode_value(t[i],e.struct[i]),this.fieldPath.pop()}},t}(),Ls=function(){function t(t){this.buffer=new Bs(t)}return t.prototype.decode=function(t){return this.decode_value(t)},t.prototype.decode_value=function(t){if(\"string\"==typeof t){if(xs.includes(t))return this.decode_integer(t);if(\"string\"===t)return this.decode_string();if(\"bool\"===t)return this.decode_boolean()}if(\"object\"==typeof t){if(\"option\"in t)return this.decode_option(t);if(\"enum\"in t)return this.decode_enum(t);if(\"array\"in t)return this.decode_array(t);if(\"set\"in t)return this.decode_set(t);if(\"map\"in t)return this.decode_map(t);if(\"struct\"in t)return this.decode_struct(t)}throw new Error(\"Unsupported type: \".concat(t))},t.prototype.decode_integer=function(t){var e=parseInt(t.substring(1));return e<=32||\"f64\"==t?this.buffer.consume_value(t):this.decode_bigint(e,t.startsWith(\"i\"))},t.prototype.decode_bigint=function(t,e){void 0===e&&(e=!1);var r=t/8,n=new Uint8Array(this.buffer.consume_bytes(r)),i=n.reduceRight((function(t,e){return t+e.toString(16).padStart(2,\"0\")}),\"\");return e&&n[r-1]?BigInt.asIntN(t,BigInt(\"0x\".concat(i))):BigInt(\"0x\".concat(i))},t.prototype.decode_string=function(){var t=this.decode_integer(\"u32\"),e=new Uint8Array(this.buffer.consume_bytes(t));return String.fromCharCode.apply(null,e)},t.prototype.decode_boolean=function(){return this.buffer.consume_value(\"u8\")>0},t.prototype.decode_option=function(t){var e=this.buffer.consume_value(\"u8\");if(1===e)return this.decode_value(t.option);if(0!==e)throw new Error(\"Invalid option \".concat(e));return null},t.prototype.decode_enum=function(t){var e,r=this.buffer.consume_value(\"u8\");if(r>t.enum.length)throw new Error(\"Enum option \".concat(r,\" is not available\"));var n=t.enum[r].struct,i=Object.keys(n)[0];return(e={})[i]=this.decode_value(n[i]),e},t.prototype.decode_array=function(t){for(var e=[],r=t.array.len?t.array.len:this.decode_integer(\"u32\"),n=0;n<r;++n)e.push(this.decode_value(t.array.type));return e},t.prototype.decode_set=function(t){for(var e=this.decode_integer(\"u32\"),r=new Set,n=0;n<e;++n)r.add(this.decode_value(t.set));return r},t.prototype.decode_map=function(t){for(var e=this.decode_integer(\"u32\"),r=new Map,n=0;n<e;++n){var i=this.decode_value(t.map.key),o=this.decode_value(t.map.value);r.set(i,o)}return r},t.prototype.decode_struct=function(t){var e={};for(var r in t.struct)e[r]=this.decode_value(t.struct[r]);return e},t}();function Ts(t,e,r){return void 0===r&&(r=!0),r&&Os(t),new Us(r).encode(e,t)}class Ps{constructor(t){this.tag=1,this.record=t.record,this.content=t.content}serialize(){return Ts(Ps.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}Ps.schema={struct:{tag:\"u8\",record:\"string\",content:{array:{type:\"u8\"}}}};class Rs{constructor(t){this.tag=4,this.validation=t.validation,this.signature=t.signature,this.expectedPubkey=t.expectedPubkey}serialize(){return Ts(Rs.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}Rs.schema={struct:{tag:\"u8\",validation:\"u8\",signature:{array:{type:\"u8\"}},expectedPubkey:{array:{type:\"u8\"}}}};class js{constructor(t){this.tag=0,this.contentLength=t.contentLength,this.record=t.record}serialize(){return Ts(js.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}js.schema={struct:{tag:\"u8\",contentLength:\"u32\",record:\"string\"}};class Ns{constructor(t){this.tag=3,this.staleness=t.staleness}serialize(){return Ts(Ns.schema,this)}getInstruction(t,e,r,n,i,o,s,a,u){const c=Buffer.from(this.serialize());let h=[];return h.push({pubkey:e,isSigner:!1,isWritable:!1}),h.push({pubkey:r,isSigner:!1,isWritable:!1}),h.push({pubkey:n,isSigner:!0,isWritable:!0}),h.push({pubkey:i,isSigner:!1,isWritable:!0}),h.push({pubkey:o,isSigner:!1,isWritable:!0}),h.push({pubkey:s,isSigner:!1,isWritable:!0}),h.push({pubkey:a,isSigner:!1,isWritable:!1}),h.push({pubkey:u,isSigner:!0,isWritable:!0}),new wo({keys:h,programId:t,data:c})}}Ns.schema={struct:{tag:\"u8\",staleness:\"bool\"}};class zs{constructor(t){this.tag=2,this.record=t.record,this.content=t.content}serialize(){return Ts(zs.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}zs.schema={struct:{tag:\"u8\",record:\"string\",content:{array:{type:\"u8\"}}}};class Cs{constructor(){this.tag=5}serialize(){return Ts(Cs.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}Cs.schema={struct:{tag:\"u8\"}};class Ws{constructor(t){this.tag=6,this.roaId=t.roaId}serialize(){return Ts(Ws.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!0,isWritable:!0}),c.push({pubkey:a,isSigner:!1,isWritable:!1}),new wo({keys:c,programId:t,data:u})}}Ws.schema={struct:{tag:\"u8\",roaId:{array:{type:\"u8\"}}}};class qs{constructor(){this.tag=7}serialize(){return Ts(qs.schema,this)}getInstruction(t,e,r,n,i,o,s,a){const u=Buffer.from(this.serialize());let c=[];return c.push({pubkey:e,isSigner:!1,isWritable:!1}),c.push({pubkey:r,isSigner:!1,isWritable:!1}),c.push({pubkey:n,isSigner:!0,isWritable:!0}),c.push({pubkey:i,isSigner:!1,isWritable:!0}),c.push({pubkey:o,isSigner:!1,isWritable:!0}),c.push({pubkey:s,isSigner:!1,isWritable:!1}),c.push({pubkey:a,isSigner:!0,isWritable:!0}),new wo({keys:c,programId:t,data:u})}}qs.schema={struct:{tag:\"u8\"}};const Fs=new oo(\"HP3D4D1ZCmohQGFVms2SS4LCANgJyksBf5s1F77FuFjZ\"),[Ds]=oo.findProgramAddressSync([Fs.toBuffer()],Fs),Hs=(t,e,r,n,i,o,s,a)=>new Ps({record:o,content:Array.from(s)}).getInstruction(a,_o.programId,i,t,e,r,n,Ds),Vs=(t,e,r,n,i,o,s,a)=>new js({contentLength:s,record:o}).getInstruction(a,_o.programId,i,t,e,r,n,Ds),Ks=(t,e,r,n,i,o)=>(new Cs).getInstruction(o,_o.programId,i,t,n,e,r,Ds),$s=(t,e,r,n,i,o,s,a)=>new zs({record:o,content:Array.from(s)}).getInstruction(a,_o.programId,i,t,e,r,n,Ds),Zs=(t,e,r,n,i,o,s,a,u)=>new Rs({validation:o,signature:Array.from(s),expectedPubkey:Array.from(a)}).getInstruction(u,_o.programId,i,t,e,r,n,Ds),Gs=(t,e,r,n,i,o,s,a)=>new Ns({staleness:s}).getInstruction(a,_o.programId,o,t,e,r,n,Ds,i),Ys=(t,e,r,n,i,o,s)=>new Ws({roaId:Array.from(o.toBuffer())}).getInstruction(s,_o.programId,e,t,r,n,i,Ds),Js=(t,e,r,n,i,o)=>(new qs).getInstruction(o,_o.programId,e,t,r,n,Ds,i),Xs=96;var Qs;!function(t){t[t.None=0]=\"None\",t[t.Solana=1]=\"Solana\",t[t.Ethereum=2]=\"Ethereum\",t[t.UnverifiedSolana=3]=\"UnverifiedSolana\"}(Qs||(Qs={}));const ta=t=>{switch(t){case Qs.None:return 0;case Qs.Ethereum:return 20;case Qs.Solana:case Qs.UnverifiedSolana:return 32;default:throw new Error(\"Invalid validation enum\")}};class ea{constructor(t){this.stalenessValidation=t.stalenessValidation,this.rightOfAssociationValidation=t.rightOfAssociationValidation,this.contentLength=t.contentLength}static deserialize(t){return new ea(function(t,e,r){return void 0===r&&(r=!0),r&&Os(t),new Ls(e).decode(t)}(this.schema,t,!0))}static async retrieve(t,e){const r=await t.getAccountInfo(e);if(!r||!r.data)throw new Error(\"Record header account not found\");return this.deserialize(r.data.slice(96,96+this.LEN))}}ea.LEN=8,ea.schema={struct:{stalenessValidation:\"u16\",rightOfAssociationValidation:\"u16\",contentLength:\"u32\"}};class ra{constructor(t,e){this.data=e,this.header=t}static deserialize(t){const e=ea.deserialize(t.slice(96,96+ea.LEN)),r=t.slice(96+ea.LEN);return new ra(e,r)}static async retrieve(t,e){const r=await t.getAccountInfo(e);if(!r||!r.data)throw new Error(\"Record header account not found\");return this.deserialize(r.data)}static async retrieveBatch(t,e){return(await t.getMultipleAccountsInfo(e)).map((t=>{if(null==t?void 0:t.data)return this.deserialize(t.data)}))}getContent(){let t=ta(this.header.stalenessValidation)+ta(this.header.rightOfAssociationValidation);return this.data.slice(t)}getStalenessId(){let t=ta(this.header.stalenessValidation);return this.data.slice(0,t)}getRoAId(){let t=ta(this.header.stalenessValidation),e=t+ta(this.header.rightOfAssociationValidation);return this.data.slice(t,e)}}export{Ds as CENTRAL_STATE_SNS_RECORDS,Xs as NAME_REGISTRY_LEN,ra as Record,ea as RecordHeader,Fs as SNS_RECORDS_ID,Qs as Validation,Hs as allocateAndPostRecord,Ps as allocateAndPostRecordInstruction,Vs as allocateRecord,js as allocateRecordInstruction,Ks as deleteRecord,Cs as deleteRecordInstruction,$s as editRecord,zs as editRecordInstruction,ta as getValidationLength,Js as unverifyRoa,qs as unverifyRoaInstruction,Zs as validateEthSignature,Rs as validateEthereumSignatureInstruction,Gs as validateSolanaSignature,Ns as validateSolanaSignatureInstruction,Ys as writeRoa,Ws as writeRoaInstruction};\n//# sourceMappingURL=index.mjs.map\n",null,null,"\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.createBitArray = createBitArray;\nexports.fromBits = fromBits;\nexports.toBits = toBits;\n\n/* eslint-disable no-unused-vars */\n\n/**\n * Virtual type for bit arrays, i.e., arrays in which each element contains\n * an integer in range `[0, 1 << L)`, where `1 <= L <= 8`.\n */\n\n/* eslint-enable no-unused-vars */\n\n/**\n * Performs unchecked conversion from `Uint8Array` to `BitArray`.\n * This function is translated as the indentity operation by Babel; it's needed purely\n * for Flow type checks.\n *\n * @param {Uint8Array} src\n * array to convert\n * @returns {Uint8Array}\n * `src` interpreted as a `BitArray` with the specified bitness\n *\n * @api private\n */\nfunction toBitArrayUnchecked(src) {\n return src;\n}\n/**\n * Creates a new array with specified bitness.\n *\n * @param {number} len\n * length of the created array\n * @returns {Uint8Array}\n *\n * @api private\n */\n\n\nfunction createBitArray(len) {\n return toBitArrayUnchecked(new Uint8Array(len));\n}\n/**\n * Converts an array from one number of bits per element to another.\n *\n * @api private\n */\n\n\nfunction convert(src, srcBits, dst, dstBits, pad) {\n var mask = (1 << dstBits) - 1;\n var acc = 0;\n var bits = 0;\n var pos = 0;\n src.forEach(function (b) {\n // Pull next bits from the input buffer into accumulator.\n acc = (acc << srcBits) + b;\n bits += srcBits; // Push into the output buffer while there are enough bits in the accumulator.\n\n while (bits >= dstBits) {\n bits -= dstBits;\n dst[pos] = acc >> bits & mask;\n pos += 1;\n }\n });\n\n if (pad) {\n if (bits > 0) {\n // `dstBits - rem.bits` is the number of trailing zero bits needed to be appended\n // to accumulator bits to get the trailing bit group.\n dst[pos] = acc << dstBits - bits & mask;\n }\n } else {\n // Truncate the remaining padding, but make sure that it is zeroed and not\n // overly long first.\n if (bits >= srcBits) {\n throw new Error(\"Excessive padding: \".concat(bits, \" (max \").concat(srcBits - 1, \" allowed)\"));\n }\n\n if (acc % (1 << bits) !== 0) {\n throw new Error('Non-zero padding');\n }\n }\n}\n/**\n * Encodes a `Uint8Array` buffer as an array with a lesser number of bits per element.\n *\n * @api private\n */\n\n\nfunction toBits(src, bits, dst) {\n if (bits > 8 || bits < 1) {\n throw new RangeError('Invalid bits per element; 1 to 8 expected');\n } // `BitArray<8>` is equivalent to `Uint8Array`; unfortunately, Flow\n // has problems expressing this, so the explicit conversion is performed here.\n\n\n convert(toBitArrayUnchecked(src), 8, dst, bits, true);\n return dst;\n}\n\nfunction fromBits(src, bits, dst) {\n if (bits > 8 || bits < 1) {\n throw new RangeError('Invalid bits per element; 1 to 8 expected');\n }\n\n convert(src, bits, toBitArrayUnchecked(dst), 8, false);\n return dst;\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.CHECKSUM_LENGTH = void 0;\nexports.createChecksum = createChecksum;\nexports.decode = decode;\nexports.decodeWithPrefix = decodeWithPrefix;\nexports.detectCase = detectCase;\nexports.encode = encode;\nexports.expandPrefix = expandPrefix;\nexports.verifyChecksum = verifyChecksum;\n\nvar _bitConverter = require(\"./bit-converter\");\n\n// Alphabet for Bech32\nvar CHARSET = 'qpzry9x8gf2tvdw0s3jn54khce6mua7l'; // Checksum constant for Bech32m.\n\nvar BECH32M_CHECKSUM = 0x2bc830a3; // Minimum char code that could be present in the encoded message\n\nvar MIN_CHAR_CODE = 33; // Maximum char code that could be present in the encoded message\n\nvar MAX_CHAR_CODE = 126;\nvar CHECKSUM_LENGTH = 6; // Reverse lookup for characters\n\nexports.CHECKSUM_LENGTH = CHECKSUM_LENGTH;\n\nvar CHAR_LOOKUP = function () {\n var lookup = new Map();\n\n for (var i = 0; i < CHARSET.length; i += 1) {\n lookup.set(CHARSET[i], i);\n }\n\n return lookup;\n}(); // Poly generators\n\n\nvar GEN = [0x3b6a57b2, 0x26508e6d, 0x1ea119fa, 0x3d4233dd, 0x2a1462b3];\n\nfunction polymod(values) {\n return values.reduce(function (checksum, value) {\n var bits = checksum >> 25;\n var newChecksum = (checksum & 0x1ffffff) << 5 ^ value;\n return GEN.reduce(function (chk, gen, i) {\n return (bits >> i & 1) === 0 ? chk : chk ^ gen;\n }, newChecksum);\n },\n /* initial checksum */\n 1);\n}\n/**\n * Expands a prefix into the specified output buffer.\n */\n\n\nfunction expandPrefix(prefix, outBuffer) {\n for (var i = 0; i < prefix.length; i += 1) {\n var code = prefix.charCodeAt(i);\n outBuffer[i] = code >> 5;\n outBuffer[i + prefix.length + 1] = code & 31;\n }\n\n outBuffer[prefix.length] = 0;\n}\n/**\n * Verifies the checksum for a particular buffer.\n */\n\n\nfunction verifyChecksum(buffer) {\n switch (polymod(buffer)) {\n case 1:\n return 'bech32';\n\n case BECH32M_CHECKSUM:\n return 'bech32m';\n\n default:\n return undefined;\n }\n}\n/**\n * Creates a checksum for a buffer and writes it to the last 6 5-bit groups\n * of the buffer.\n */\n\n\nfunction createChecksum(buffer, encoding) {\n var checksumConstant;\n\n switch (encoding) {\n case 'bech32':\n checksumConstant = 1;\n break;\n\n case 'bech32m':\n checksumConstant = BECH32M_CHECKSUM;\n break;\n\n default:\n throw Error(\"Invalid encoding value: \".concat(encoding, \"; expected bech32 or bech32m\"));\n }\n\n var mod = polymod(buffer) ^ checksumConstant;\n\n for (var i = 0; i < CHECKSUM_LENGTH; i += 1) {\n var shift = 5 * (5 - i);\n buffer[buffer.length - CHECKSUM_LENGTH + i] = mod >> shift & 31;\n }\n}\n/**\n * Encodes an array of 5-bit groups into a string.\n *\n * @param {Uint8Array} buffer\n * @returns {string}\n *\n * @api private\n */\n\n\nfunction encode(buffer) {\n return buffer.reduce(function (acc, bits) {\n return acc + CHARSET[bits];\n }, '');\n}\n/**\n * Decodes a string into an array of 5-bit groups.\n *\n * @param {string} message\n * @param {Uint8Array} [dst]\n * Optional array to write the output to. If not specified, the array is created.\n * @returns {Uint8Array}\n * Array with the result of decoding\n *\n * @throws {Error}\n * if there are characters in `message` not present in the encoding alphabet\n *\n * @api private\n */\n\n\nfunction decode(message, dst) {\n var realDst = dst || (0, _bitConverter.createBitArray)(message.length);\n\n for (var i = 0; i < message.length; i += 1) {\n var idx = CHAR_LOOKUP.get(message[i]);\n\n if (idx === undefined) {\n throw new Error(\"Invalid char in message: \".concat(message[i]));\n }\n\n realDst[i] = idx;\n }\n\n return realDst;\n}\n/**\n * Decodes a string and a human-readable prefix into an array of 5-bit groups.\n * The prefix is expanded as specified by Bech32.\n *\n * @param {string} prefix\n * @param {string} message\n * @returns {Uint8Array}\n * Array with the result of decoding\n *\n * @api private\n */\n\n\nfunction decodeWithPrefix(prefix, message) {\n var len = message.length + 2 * prefix.length + 1;\n var dst = (0, _bitConverter.createBitArray)(len);\n expandPrefix(prefix, dst.subarray(0, 2 * prefix.length + 1));\n decode(message, dst.subarray(2 * prefix.length + 1));\n return dst;\n}\n/**\n * Detects the character case used in `message`. If the message doesn't\n * contain either lower-case or upper-case chars, returns `null`.\n *\n * @param {string} message\n * @param {string} messageDescription\n * Human-readable description of the message to put into an error message, should any occur\n * @returns {'lower'|'upper'|null}\n * @throws if the message contains both lowercase and uppercase chars,\n * or contains chars not valid for Bech32(m) encoding\n */\n\n\nfunction detectCase(message) {\n var messageDescription = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 'message';\n var hasLowerCase = false;\n var hasUpperCase = false;\n\n for (var i = 0; i < message.length; i += 1) {\n var ord = message.charCodeAt(i); // 3. Allowed chars in the encoding\n\n if (ord < MIN_CHAR_CODE || ord > MAX_CHAR_CODE) {\n throw new TypeError(\"Invalid char in \".concat(messageDescription, \": \").concat(ord, \"; \") + \"should be in ASCII range \".concat(MIN_CHAR_CODE, \"-\").concat(MAX_CHAR_CODE));\n }\n\n hasUpperCase = hasUpperCase || ord >= 65 && ord <= 90;\n hasLowerCase = hasLowerCase || ord >= 97 && ord <= 122;\n }\n\n if (hasLowerCase && hasUpperCase) {\n throw new TypeError(\"Mixed-case \".concat(messageDescription));\n } else if (hasUpperCase) {\n return 'upper';\n } else if (hasLowerCase) {\n return 'lower';\n } else {\n return null;\n }\n}","\"use strict\";\n\nObject.defineProperty(exports, \"__esModule\", {\n value: true\n});\nexports.BitcoinAddress = void 0;\nexports.decode = decode;\nexports.decodeTo5BitArray = decodeTo5BitArray;\nexports.encode = encode;\nexports.encode5BitArray = encode5BitArray;\nexports.from5BitArray = from5BitArray;\nexports.to5BitArray = to5BitArray;\n\nvar _bitConverter = require(\"./bit-converter\");\n\nvar _encoding = require(\"./encoding\");\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); Object.defineProperty(Constructor, \"prototype\", { writable: false }); return Constructor; }\n\n// Maximum encoded message length\nvar MAX_ENC_LENGTH = 90;\n\n/**\n * Converts a Uint8Array into a Uint8Array variant, in which each element\n * encodes 5 bits of the original byte array.\n *\n * @param {Uint8Array} src\n * Input to convert\n * @param {?Uint8Array} dst\n * Optional output buffer. If specified, the sequence of 5-bit chunks will be written there;\n * if not specified, the output buffer will be created from scratch. The length\n * of `outBuffer` is not checked.\n * @returns {Uint8Array}\n * Output buffer consisting of 5-bit chunks\n *\n * @api public\n */\nfunction to5BitArray(src, dst) {\n var len = Math.ceil(src.length * 8 / 5);\n var realDst = dst || (0, _bitConverter.createBitArray)(len);\n return (0, _bitConverter.toBits)(src, 5, realDst);\n}\n\nfunction from5BitArray(src, dst) {\n var len = Math.floor(src.length * 5 / 8);\n var realDst = dst || new Uint8Array(len);\n return (0, _bitConverter.fromBits)(src, 5, realDst);\n}\n/**\n * Encodes binary data into Bech32 encoding.\n *\n * The case is preserved: if the prefix is uppercase, then the output will be uppercase\n * as well; otherwise, the output will be lowercase (including the case when the prefix does\n * not contain any letters).\n *\n * Ordinarily, you may want to use [`encode`](#encode) because it converts\n * binary data to an array of 5-bit integers automatically.\n *\n * @param {string} prefix\n * Human-readable prefix to place at the beginning of the encoding\n * @param {Uint8Array} data\n * Array of 5-bit integers with data to encode\n * @param {Encoding} encoding\n * Encoding to use; influences the checksum computation. If not specified,\n * Bech32 encoding will be used.\n * @returns {string}\n * Bech32 encoding of data in the form `<prefix>1<base32 of data><checksum>`\n * @throws If the prefix is mixed-case or contains chars that are not eligible for Bech32 encoding\n *\n * @api public\n */\n\n\nfunction encode5BitArray(prefix, data) {\n var _detectCase;\n\n var encoding = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'bech32';\n // 1. Allocate buffer for all operations\n var len = 2 * prefix.length + 1 // expanded prefix\n + data.length // five-bit data encoding\n + _encoding.CHECKSUM_LENGTH; // checksum\n\n if (len - prefix.length > MAX_ENC_LENGTH) {\n throw new Error(\"Message to be produced is too long (max \".concat(MAX_ENC_LENGTH, \" supported)\"));\n }\n\n var prefixCase = (_detectCase = (0, _encoding.detectCase)(prefix, 'prefix')) !== null && _detectCase !== void 0 ? _detectCase : 'lower';\n var buffer = (0, _bitConverter.createBitArray)(len); // 2. Expand the human-readable prefix into the beginning of the buffer\n\n (0, _encoding.expandPrefix)(prefix.toLowerCase(), buffer.subarray(0, 2 * prefix.length + 1)); // 3. Copy `data` into the output\n\n var dataBuffer = buffer.subarray(2 * prefix.length + 1, buffer.length - _encoding.CHECKSUM_LENGTH);\n dataBuffer.set(data); // 4. Create the checksum\n\n (0, _encoding.createChecksum)(buffer, encoding); // 5. Convert into string\n\n var encoded = (0, _encoding.encode)(buffer.subarray(2 * prefix.length + 1));\n\n if (prefixCase === 'upper') {\n encoded = encoded.toUpperCase();\n }\n\n return \"\".concat(prefix, \"1\").concat(encoded);\n}\n/**\n * Encodes binary data into Bech32 encoding.\n *\n * The case is preserved: if the prefix is uppercase, then the output will be uppercase\n * as well; otherwise, the output will be lowercase (including the case when the prefix does\n * not contain any letters).\n *\n * @param {string} prefix\n * Human-readable prefix to place at the beginning of the encoding\n * @param {Uint8Array} data\n * Binary data to encode\n * @param {Encoding} encoding\n * Encoding to use; influences the checksum computation. If not specified,\n * Bech32 encoding will be used.\n * @returns {string}\n * Bech32 encoding of data in the form `<prefix>1<base32 of data><checksum>`\n * @throws If the prefix is mixed-case or contains chars that are not eligible for Bech32 encoding\n *\n * @api public\n */\n\n\nfunction encode(prefix, data) {\n var encoding = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'bech32';\n return encode5BitArray(prefix, to5BitArray(data), encoding);\n}\n/**\n * Decodes data from Bech32 encoding into an array of 5-bit integers.\n *\n * Ordinarily, you may want to use [`decode`](#decode) because it automatically\n * converts the array of 5-bit integers into an ordinary `Uint8Array`.\n *\n * @param {string} message\n * Bech32-encoded message\n * @returns {DecodeResult<FiveBitArray>}\n * Decoded object with `prefix` and `data` fields, which contain the human-readable\n * prefix and the array of 5-bit integers respectively.\n *\n * @api public\n */\n\n\nfunction decodeTo5BitArray(message) {\n // Check preconditions\n // 1. Message length\n if (message.length > MAX_ENC_LENGTH) {\n throw new TypeError(\"Message too long; max \".concat(MAX_ENC_LENGTH, \" expected\"));\n } // 2. Mixed case\n\n\n (0, _encoding.detectCase)(message); // we don't care about the result, only about checks.\n\n var lowerCaseMsg = message.toLowerCase(); // 4. Existence of the separator char\n\n var sepIdx = lowerCaseMsg.lastIndexOf('1');\n\n if (sepIdx < 0) {\n throw new Error('No separator char (\"1\") found');\n } // 5. Placing of the separator char in the message\n\n\n if (sepIdx > message.length - _encoding.CHECKSUM_LENGTH - 1) {\n throw new Error(\"Data part of the message too short (at least \".concat(_encoding.CHECKSUM_LENGTH, \" chars expected)\"));\n }\n\n var prefix = lowerCaseMsg.substring(0, sepIdx); // Checked within `decodeWithPrefix`:\n // 6. Invalid chars in the data part of the message\n\n var bitArray = (0, _encoding.decodeWithPrefix)(prefix, lowerCaseMsg.substring(sepIdx + 1)); // 7. Checksum\n\n var encoding = (0, _encoding.verifyChecksum)(bitArray);\n\n if (encoding === undefined) {\n throw new Error('Invalid checksum');\n }\n\n return {\n prefix: prefix,\n encoding: encoding,\n // Strip off the prefix from the front and the checksum from the end\n data: bitArray.subarray(2 * prefix.length + 1, bitArray.length - _encoding.CHECKSUM_LENGTH)\n };\n}\n/**\n * Decodes data from Bech32 encoding into an array of 5-bit integers.\n *\n * @param {string} message\n * Bech32-encoded message\n * @returns {DecodeResult}\n * Decoded object with `prefix` and `data` fields, which contain the human-readable\n * prefix and the decoded binary data respectively.\n *\n * @api public\n */\n\n\nfunction decode(message) {\n var _decodeTo5BitArray = decodeTo5BitArray(message),\n prefix = _decodeTo5BitArray.prefix,\n encoding = _decodeTo5BitArray.encoding,\n bitArray = _decodeTo5BitArray.data;\n\n return {\n prefix: prefix,\n encoding: encoding,\n data: from5BitArray(bitArray)\n };\n}\n/**\n * Bitcoin address.\n */\n\n\nvar BitcoinAddress = /*#__PURE__*/function () {\n function BitcoinAddress(prefix, scriptVersion, data) {\n _classCallCheck(this, BitcoinAddress);\n\n if (prefix !== 'bc' && prefix !== 'tb') {\n throw new Error('Invalid human-readable prefix, \"bc\" or \"tb\" expected');\n }\n\n if (scriptVersion < 0 || scriptVersion > 16) {\n throw new RangeError('Invalid scriptVersion, value in range [0, 16] expected');\n }\n\n if (data.length < 2 || data.length > 40) {\n throw new RangeError('Invalid script length: expected 2 to 40 bytes');\n }\n\n if (scriptVersion === 0 && data.length !== 20 && data.length !== 32) {\n throw new Error('Invalid v0 script length: expected 20 or 32 bytes');\n }\n\n this.prefix = prefix;\n this.scriptVersion = scriptVersion;\n this.data = data;\n }\n /**\n * Guesses the address type based on its internal structure.\n *\n * @returns {void | 'p2wpkh' | 'p2wsh'}\n */\n\n\n _createClass(BitcoinAddress, [{\n key: \"type\",\n value: function type() {\n if (this.scriptVersion !== 0) {\n return undefined;\n }\n\n switch (this.data.length) {\n case 20:\n return 'p2wpkh';\n\n case 32:\n return 'p2wsh';\n // should be unreachable, but it's JS, so you never know\n\n default:\n return undefined;\n }\n }\n /**\n * Encodes this address in Bech32 or Bech32m format, depending on the script version.\n * Version 0 scripts are encoded using original Bech32 encoding as per BIP 173,\n * while versions 1-16 are encoded using the modified encoding as per BIP 350.\n *\n * @returns {string}\n * Bech32(m)-encoded address\n */\n\n }, {\n key: \"encode\",\n value: function encode() {\n // Bitcoin addresses use Bech32 in a peculiar way - script version is\n // not a part of the serialized binary data, but is rather prepended as 5-bit value\n // before the rest of the script. This necessitates some plumbing here.\n var len = Math.ceil(this.data.length * 8 / 5);\n var converted = (0, _bitConverter.createBitArray)(len + 1);\n converted[0] = this.scriptVersion;\n to5BitArray(this.data, converted.subarray(1));\n var encoding = this.scriptVersion === 0 ? 'bech32' : 'bech32m';\n return encode5BitArray(this.prefix, converted, encoding);\n }\n }], [{\n key: \"decode\",\n value:\n /**\n * Human-readable prefix. Equal to `'bc'` (for mainnet addresses)\n * or `'tb'` (for testnet addresses).\n */\n\n /**\n * Script version. An integer between 0 and 16 (inclusive).\n */\n\n /**\n * Script data. A byte string with length 2 to 40 (inclusive).\n */\n\n /**\n * Decodes a Bitcoin address from a Bech32(m) string.\n * As per BIP 350, the original encoding is expected for version 0 scripts, while\n * other script versions expect the modified encoding.\n *\n * This method does not check whether the address is well-formed;\n * use `type()` method on returned address to find that out.\n *\n * @param {string} message\n * @returns {BitcoinAddress}\n */\n function decode(message) {\n var _decodeTo5BitArray2 = decodeTo5BitArray(message),\n prefix = _decodeTo5BitArray2.prefix,\n data = _decodeTo5BitArray2.data,\n encoding = _decodeTo5BitArray2.encoding; // Extra check to satisfy Flow.\n\n\n if (prefix !== 'bc' && prefix !== 'tb') {\n throw new Error('Invalid human-readable prefix, \"bc\" or \"tb\" expected');\n }\n\n var scriptVersion = data[0];\n\n if (scriptVersion === 0 && encoding !== 'bech32') {\n throw Error(\"Unexpected encoding \".concat(encoding, \" used for version 0 script\"));\n }\n\n if (scriptVersion > 0 && encoding !== 'bech32m') {\n throw Error(\"Unexpected encoding \".concat(encoding, \" used for version \").concat(scriptVersion, \" script\"));\n }\n\n return new this(prefix, scriptVersion, from5BitArray(data.subarray(1)));\n }\n }]);\n\n return BitcoinAddress;\n}();\n\nexports.BitcoinAddress = BitcoinAddress;","(function (root) {\n 'use strict';\n // A list of regular expressions that match arbitrary IPv4 addresses,\n // for which a number of weird notations exist.\n // Note that an address like 0010.0xa5.1.1 is considered legal.\n const ipv4Part = '(0?\\\\d+|0x[a-f0-9]+)';\n const ipv4Regexes = {\n fourOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n threeOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n twoOctet: new RegExp(`^${ipv4Part}\\\\.${ipv4Part}$`, 'i'),\n longValue: new RegExp(`^${ipv4Part}$`, 'i')\n };\n\n // Regular Expression for checking Octal numbers\n const octalRegex = new RegExp(`^0[0-7]+$`, 'i');\n const hexRegex = new RegExp(`^0x[a-f0-9]+$`, 'i');\n\n const zoneIndex = '%[0-9a-z]{1,}';\n\n // IPv6-matching regular expressions.\n // For IPv6, the task is simpler: it is enough to match the colon-delimited\n // hexadecimal IPv6 and a transitional variant with dotted-decimal IPv4 at\n // the end.\n const ipv6Part = '(?:[0-9a-f]+::?)+';\n const ipv6Regexes = {\n zoneIndex: new RegExp(zoneIndex, 'i'),\n 'native': new RegExp(`^(::)?(${ipv6Part})?([0-9a-f]+)?(::)?(${zoneIndex})?$`, 'i'),\n deprecatedTransitional: new RegExp(`^(?:::)(${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}(${zoneIndex})?)$`, 'i'),\n transitional: new RegExp(`^((?:${ipv6Part})|(?:::)(?:${ipv6Part})?)${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}\\\\.${ipv4Part}(${zoneIndex})?$`, 'i')\n };\n\n // Expand :: in an IPv6 address or address part consisting of `parts` groups.\n function expandIPv6 (string, parts) {\n // More than one '::' means invalid adddress\n if (string.indexOf('::') !== string.lastIndexOf('::')) {\n return null;\n }\n\n let colonCount = 0;\n let lastColon = -1;\n let zoneId = (string.match(ipv6Regexes.zoneIndex) || [])[0];\n let replacement, replacementCount;\n\n // Remove zone index and save it for later\n if (zoneId) {\n zoneId = zoneId.substring(1);\n string = string.replace(/%.+$/, '');\n }\n\n // How many parts do we already have?\n while ((lastColon = string.indexOf(':', lastColon + 1)) >= 0) {\n colonCount++;\n }\n\n // 0::0 is two parts more than ::\n if (string.substr(0, 2) === '::') {\n colonCount--;\n }\n\n if (string.substr(-2, 2) === '::') {\n colonCount--;\n }\n\n // The following loop would hang if colonCount > parts\n if (colonCount > parts) {\n return null;\n }\n\n // replacement = ':' + '0:' * (parts - colonCount)\n replacementCount = parts - colonCount;\n replacement = ':';\n while (replacementCount--) {\n replacement += '0:';\n }\n\n // Insert the missing zeroes\n string = string.replace('::', replacement);\n\n // Trim any garbage which may be hanging around if :: was at the edge in\n // the source strin\n if (string[0] === ':') {\n string = string.slice(1);\n }\n\n if (string[string.length - 1] === ':') {\n string = string.slice(0, -1);\n }\n\n parts = (function () {\n const ref = string.split(':');\n const results = [];\n\n for (let i = 0; i < ref.length; i++) {\n results.push(parseInt(ref[i], 16));\n }\n\n return results;\n })();\n\n return {\n parts: parts,\n zoneId: zoneId\n };\n }\n\n // A generic CIDR (Classless Inter-Domain Routing) RFC1518 range matcher.\n function matchCIDR (first, second, partSize, cidrBits) {\n if (first.length !== second.length) {\n throw new Error('ipaddr: cannot match CIDR for objects with different lengths');\n }\n\n let part = 0;\n let shift;\n\n while (cidrBits > 0) {\n shift = partSize - cidrBits;\n if (shift < 0) {\n shift = 0;\n }\n\n if (first[part] >> shift !== second[part] >> shift) {\n return false;\n }\n\n cidrBits -= partSize;\n part += 1;\n }\n\n return true;\n }\n\n function parseIntAuto (string) {\n // Hexadedimal base 16 (0x#)\n if (hexRegex.test(string)) {\n return parseInt(string, 16);\n }\n // While octal representation is discouraged by ECMAScript 3\n // and forbidden by ECMAScript 5, we silently allow it to\n // work only if the rest of the string has numbers less than 8.\n if (string[0] === '0' && !isNaN(parseInt(string[1], 10))) {\n if (octalRegex.test(string)) {\n return parseInt(string, 8);\n }\n throw new Error(`ipaddr: cannot parse ${string} as octal`);\n }\n // Always include the base 10 radix!\n return parseInt(string, 10);\n }\n\n function padPart (part, length) {\n while (part.length < length) {\n part = `0${part}`;\n }\n\n return part;\n }\n\n const ipaddr = {};\n\n // An IPv4 address (RFC791).\n ipaddr.IPv4 = (function () {\n // Constructs a new IPv4 address from an array of four octets\n // in network order (MSB first)\n // Verifies the input.\n function IPv4 (octets) {\n if (octets.length !== 4) {\n throw new Error('ipaddr: ipv4 octet count should be 4');\n }\n\n let i, octet;\n\n for (i = 0; i < octets.length; i++) {\n octet = octets[i];\n if (!((0 <= octet && octet <= 255))) {\n throw new Error('ipaddr: ipv4 octet should fit in 8 bits');\n }\n }\n\n this.octets = octets;\n }\n\n // Special IPv4 address ranges.\n // See also https://en.wikipedia.org/wiki/Reserved_IP_addresses\n IPv4.prototype.SpecialRanges = {\n unspecified: [[new IPv4([0, 0, 0, 0]), 8]],\n broadcast: [[new IPv4([255, 255, 255, 255]), 32]],\n // RFC3171\n multicast: [[new IPv4([224, 0, 0, 0]), 4]],\n // RFC3927\n linkLocal: [[new IPv4([169, 254, 0, 0]), 16]],\n // RFC5735\n loopback: [[new IPv4([127, 0, 0, 0]), 8]],\n // RFC6598\n carrierGradeNat: [[new IPv4([100, 64, 0, 0]), 10]],\n // RFC1918\n 'private': [\n [new IPv4([10, 0, 0, 0]), 8],\n [new IPv4([172, 16, 0, 0]), 12],\n [new IPv4([192, 168, 0, 0]), 16]\n ],\n // Reserved and testing-only ranges; RFCs 5735, 5737, 2544, 1700\n reserved: [\n [new IPv4([192, 0, 0, 0]), 24],\n [new IPv4([192, 0, 2, 0]), 24],\n [new IPv4([192, 88, 99, 0]), 24],\n [new IPv4([198, 18, 0, 0]), 15],\n [new IPv4([198, 51, 100, 0]), 24],\n [new IPv4([203, 0, 113, 0]), 24],\n [new IPv4([240, 0, 0, 0]), 4]\n ]\n };\n\n // The 'kind' method exists on both IPv4 and IPv6 classes.\n IPv4.prototype.kind = function () {\n return 'ipv4';\n };\n\n // Checks if this address matches other one within given CIDR range.\n IPv4.prototype.match = function (other, cidrRange) {\n let ref;\n if (cidrRange === undefined) {\n ref = other;\n other = ref[0];\n cidrRange = ref[1];\n }\n\n if (other.kind() !== 'ipv4') {\n throw new Error('ipaddr: cannot match ipv4 address with non-ipv4 one');\n }\n\n return matchCIDR(this.octets, other.octets, 8, cidrRange);\n };\n\n // returns a number of leading ones in IPv4 address, making sure that\n // the rest is a solid sequence of 0's (valid netmask)\n // returns either the CIDR length or null if mask is not valid\n IPv4.prototype.prefixLengthFromSubnetMask = function () {\n let cidr = 0;\n // non-zero encountered stop scanning for zeroes\n let stop = false;\n // number of zeroes in octet\n const zerotable = {\n 0: 8,\n 128: 7,\n 192: 6,\n 224: 5,\n 240: 4,\n 248: 3,\n 252: 2,\n 254: 1,\n 255: 0\n };\n let i, octet, zeros;\n\n for (i = 3; i >= 0; i -= 1) {\n octet = this.octets[i];\n if (octet in zerotable) {\n zeros = zerotable[octet];\n if (stop && zeros !== 0) {\n return null;\n }\n\n if (zeros !== 8) {\n stop = true;\n }\n\n cidr += zeros;\n } else {\n return null;\n }\n }\n\n return 32 - cidr;\n };\n\n // Checks if the address corresponds to one of the special ranges.\n IPv4.prototype.range = function () {\n return ipaddr.subnetMatch(this, this.SpecialRanges);\n };\n\n // Returns an array of byte-sized values in network order (MSB first)\n IPv4.prototype.toByteArray = function () {\n return this.octets.slice(0);\n };\n\n // Converts this IPv4 address to an IPv4-mapped IPv6 address.\n IPv4.prototype.toIPv4MappedAddress = function () {\n return ipaddr.IPv6.parse(`::ffff:${this.toString()}`);\n };\n\n // Symmetrical method strictly for aligning with the IPv6 methods.\n IPv4.prototype.toNormalizedString = function () {\n return this.toString();\n };\n\n // Returns the address in convenient, decimal-dotted format.\n IPv4.prototype.toString = function () {\n return this.octets.join('.');\n };\n\n return IPv4;\n })();\n\n // A utility function to return broadcast address given the IPv4 interface and prefix length in CIDR notation\n ipaddr.IPv4.broadcastAddressFromCIDR = function (string) {\n\n try {\n const cidr = this.parseCIDR(string);\n const ipInterfaceOctets = cidr[0].toByteArray();\n const subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n const octets = [];\n let i = 0;\n while (i < 4) {\n // Broadcast address is bitwise OR between ip interface and inverted mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) | parseInt(subnetMaskOctets[i], 10) ^ 255);\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error('ipaddr: the address does not have IPv4 CIDR format');\n }\n };\n\n // Checks if a given string is formatted like IPv4 address.\n ipaddr.IPv4.isIPv4 = function (string) {\n return this.parser(string) !== null;\n };\n\n // Checks if a given string is a valid IPv4 address.\n ipaddr.IPv4.isValid = function (string) {\n try {\n new this(this.parser(string));\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // Checks if a given string is a full four-part IPv4 Address.\n ipaddr.IPv4.isValidFourPartDecimal = function (string) {\n if (ipaddr.IPv4.isValid(string) && string.match(/^(0|[1-9]\\d*)(\\.(0|[1-9]\\d*)){3}$/)) {\n return true;\n } else {\n return false;\n }\n };\n\n // A utility function to return network address given the IPv4 interface and prefix length in CIDR notation\n ipaddr.IPv4.networkAddressFromCIDR = function (string) {\n let cidr, i, ipInterfaceOctets, octets, subnetMaskOctets;\n\n try {\n cidr = this.parseCIDR(string);\n ipInterfaceOctets = cidr[0].toByteArray();\n subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n octets = [];\n i = 0;\n while (i < 4) {\n // Network address is bitwise AND between ip interface and mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) & parseInt(subnetMaskOctets[i], 10));\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error('ipaddr: the address does not have IPv4 CIDR format');\n }\n };\n\n // Tries to parse and validate a string with IPv4 address.\n // Throws an error if it fails.\n ipaddr.IPv4.parse = function (string) {\n const parts = this.parser(string);\n\n if (parts === null) {\n throw new Error('ipaddr: string is not formatted like an IPv4 Address');\n }\n\n return new this(parts);\n };\n\n // Parses the string as an IPv4 Address with CIDR Notation.\n ipaddr.IPv4.parseCIDR = function (string) {\n let match;\n\n if ((match = string.match(/^(.+)\\/(\\d+)$/))) {\n const maskLength = parseInt(match[2]);\n if (maskLength >= 0 && maskLength <= 32) {\n const parsed = [this.parse(match[1]), maskLength];\n Object.defineProperty(parsed, 'toString', {\n value: function () {\n return this.join('/');\n }\n });\n return parsed;\n }\n }\n\n throw new Error('ipaddr: string is not formatted like an IPv4 CIDR range');\n };\n\n // Classful variants (like a.b, where a is an octet, and b is a 24-bit\n // value representing last three octets; this corresponds to a class C\n // address) are omitted due to classless nature of modern Internet.\n ipaddr.IPv4.parser = function (string) {\n let match, part, value;\n\n // parseInt recognizes all that octal & hexadecimal weirdness for us\n if ((match = string.match(ipv4Regexes.fourOctet))) {\n return (function () {\n const ref = match.slice(1, 6);\n const results = [];\n\n for (let i = 0; i < ref.length; i++) {\n part = ref[i];\n results.push(parseIntAuto(part));\n }\n\n return results;\n })();\n } else if ((match = string.match(ipv4Regexes.longValue))) {\n value = parseIntAuto(match[1]);\n if (value > 0xffffffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n return ((function () {\n const results = [];\n let shift;\n\n for (shift = 0; shift <= 24; shift += 8) {\n results.push((value >> shift) & 0xff);\n }\n\n return results;\n })()).reverse();\n } else if ((match = string.match(ipv4Regexes.twoOctet))) {\n return (function () {\n const ref = match.slice(1, 4);\n const results = [];\n\n value = parseIntAuto(ref[1]);\n if (value > 0xffffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n results.push(parseIntAuto(ref[0]));\n results.push((value >> 16) & 0xff);\n results.push((value >> 8) & 0xff);\n results.push( value & 0xff);\n\n return results;\n })();\n } else if ((match = string.match(ipv4Regexes.threeOctet))) {\n return (function () {\n const ref = match.slice(1, 5);\n const results = [];\n\n value = parseIntAuto(ref[2]);\n if (value > 0xffff || value < 0) {\n throw new Error('ipaddr: address outside defined range');\n }\n\n results.push(parseIntAuto(ref[0]));\n results.push(parseIntAuto(ref[1]));\n results.push((value >> 8) & 0xff);\n results.push( value & 0xff);\n\n return results;\n })();\n } else {\n return null;\n }\n };\n\n // A utility function to return subnet mask in IPv4 format given the prefix length\n ipaddr.IPv4.subnetMaskFromPrefixLength = function (prefix) {\n prefix = parseInt(prefix);\n if (prefix < 0 || prefix > 32) {\n throw new Error('ipaddr: invalid IPv4 prefix length');\n }\n\n const octets = [0, 0, 0, 0];\n let j = 0;\n const filledOctetCount = Math.floor(prefix / 8);\n\n while (j < filledOctetCount) {\n octets[j] = 255;\n j++;\n }\n\n if (filledOctetCount < 4) {\n octets[filledOctetCount] = Math.pow(2, prefix % 8) - 1 << 8 - (prefix % 8);\n }\n\n return new this(octets);\n };\n\n // An IPv6 address (RFC2460)\n ipaddr.IPv6 = (function () {\n // Constructs an IPv6 address from an array of eight 16 - bit parts\n // or sixteen 8 - bit parts in network order(MSB first).\n // Throws an error if the input is invalid.\n function IPv6 (parts, zoneId) {\n let i, part;\n\n if (parts.length === 16) {\n this.parts = [];\n for (i = 0; i <= 14; i += 2) {\n this.parts.push((parts[i] << 8) | parts[i + 1]);\n }\n } else if (parts.length === 8) {\n this.parts = parts;\n } else {\n throw new Error('ipaddr: ipv6 part count should be 8 or 16');\n }\n\n for (i = 0; i < this.parts.length; i++) {\n part = this.parts[i];\n if (!((0 <= part && part <= 0xffff))) {\n throw new Error('ipaddr: ipv6 part should fit in 16 bits');\n }\n }\n\n if (zoneId) {\n this.zoneId = zoneId;\n }\n }\n\n // Special IPv6 ranges\n IPv6.prototype.SpecialRanges = {\n // RFC4291, here and after\n unspecified: [new IPv6([0, 0, 0, 0, 0, 0, 0, 0]), 128],\n linkLocal: [new IPv6([0xfe80, 0, 0, 0, 0, 0, 0, 0]), 10],\n multicast: [new IPv6([0xff00, 0, 0, 0, 0, 0, 0, 0]), 8],\n loopback: [new IPv6([0, 0, 0, 0, 0, 0, 0, 1]), 128],\n uniqueLocal: [new IPv6([0xfc00, 0, 0, 0, 0, 0, 0, 0]), 7],\n ipv4Mapped: [new IPv6([0, 0, 0, 0, 0, 0xffff, 0, 0]), 96],\n // RFC6145\n rfc6145: [new IPv6([0, 0, 0, 0, 0xffff, 0, 0, 0]), 96],\n // RFC6052\n rfc6052: [new IPv6([0x64, 0xff9b, 0, 0, 0, 0, 0, 0]), 96],\n // RFC3056\n '6to4': [new IPv6([0x2002, 0, 0, 0, 0, 0, 0, 0]), 16],\n // RFC6052, RFC6146\n teredo: [new IPv6([0x2001, 0, 0, 0, 0, 0, 0, 0]), 32],\n // RFC4291\n reserved: [[new IPv6([0x2001, 0xdb8, 0, 0, 0, 0, 0, 0]), 32]],\n benchmarking: [new IPv6([0x2001, 0x2, 0, 0, 0, 0, 0, 0]), 48],\n amt: [new IPv6([0x2001, 0x3, 0, 0, 0, 0, 0, 0]), 32],\n as112v6: [new IPv6([0x2001, 0x4, 0x112, 0, 0, 0, 0, 0]), 48],\n deprecated: [new IPv6([0x2001, 0x10, 0, 0, 0, 0, 0, 0]), 28],\n orchid2: [new IPv6([0x2001, 0x20, 0, 0, 0, 0, 0, 0]), 28]\n };\n\n // Checks if this address is an IPv4-mapped IPv6 address.\n IPv6.prototype.isIPv4MappedAddress = function () {\n return this.range() === 'ipv4Mapped';\n };\n\n // The 'kind' method exists on both IPv4 and IPv6 classes.\n IPv6.prototype.kind = function () {\n return 'ipv6';\n };\n\n // Checks if this address matches other one within given CIDR range.\n IPv6.prototype.match = function (other, cidrRange) {\n let ref;\n\n if (cidrRange === undefined) {\n ref = other;\n other = ref[0];\n cidrRange = ref[1];\n }\n\n if (other.kind() !== 'ipv6') {\n throw new Error('ipaddr: cannot match ipv6 address with non-ipv6 one');\n }\n\n return matchCIDR(this.parts, other.parts, 16, cidrRange);\n };\n\n // returns a number of leading ones in IPv6 address, making sure that\n // the rest is a solid sequence of 0's (valid netmask)\n // returns either the CIDR length or null if mask is not valid\n IPv6.prototype.prefixLengthFromSubnetMask = function () {\n let cidr = 0;\n // non-zero encountered stop scanning for zeroes\n let stop = false;\n // number of zeroes in octet\n const zerotable = {\n 0: 16,\n 32768: 15,\n 49152: 14,\n 57344: 13,\n 61440: 12,\n 63488: 11,\n 64512: 10,\n 65024: 9,\n 65280: 8,\n 65408: 7,\n 65472: 6,\n 65504: 5,\n 65520: 4,\n 65528: 3,\n 65532: 2,\n 65534: 1,\n 65535: 0\n };\n let part, zeros;\n\n for (let i = 7; i >= 0; i -= 1) {\n part = this.parts[i];\n if (part in zerotable) {\n zeros = zerotable[part];\n if (stop && zeros !== 0) {\n return null;\n }\n\n if (zeros !== 16) {\n stop = true;\n }\n\n cidr += zeros;\n } else {\n return null;\n }\n }\n\n return 128 - cidr;\n };\n\n\n // Checks if the address corresponds to one of the special ranges.\n IPv6.prototype.range = function () {\n return ipaddr.subnetMatch(this, this.SpecialRanges);\n };\n\n // Returns an array of byte-sized values in network order (MSB first)\n IPv6.prototype.toByteArray = function () {\n let part;\n const bytes = [];\n const ref = this.parts;\n for (let i = 0; i < ref.length; i++) {\n part = ref[i];\n bytes.push(part >> 8);\n bytes.push(part & 0xff);\n }\n\n return bytes;\n };\n\n // Returns the address in expanded format with all zeroes included, like\n // 2001:0db8:0008:0066:0000:0000:0000:0001\n IPv6.prototype.toFixedLengthString = function () {\n const addr = ((function () {\n const results = [];\n for (let i = 0; i < this.parts.length; i++) {\n results.push(padPart(this.parts[i].toString(16), 4));\n }\n\n return results;\n }).call(this)).join(':');\n\n let suffix = '';\n\n if (this.zoneId) {\n suffix = `%${this.zoneId}`;\n }\n\n return addr + suffix;\n };\n\n // Converts this address to IPv4 address if it is an IPv4-mapped IPv6 address.\n // Throws an error otherwise.\n IPv6.prototype.toIPv4Address = function () {\n if (!this.isIPv4MappedAddress()) {\n throw new Error('ipaddr: trying to convert a generic ipv6 address to ipv4');\n }\n\n const ref = this.parts.slice(-2);\n const high = ref[0];\n const low = ref[1];\n\n return new ipaddr.IPv4([high >> 8, high & 0xff, low >> 8, low & 0xff]);\n };\n\n // Returns the address in expanded format with all zeroes included, like\n // 2001:db8:8:66:0:0:0:1\n //\n // Deprecated: use toFixedLengthString() instead.\n IPv6.prototype.toNormalizedString = function () {\n const addr = ((function () {\n const results = [];\n\n for (let i = 0; i < this.parts.length; i++) {\n results.push(this.parts[i].toString(16));\n }\n\n return results;\n }).call(this)).join(':');\n\n let suffix = '';\n\n if (this.zoneId) {\n suffix = `%${this.zoneId}`;\n }\n\n return addr + suffix;\n };\n\n // Returns the address in compact, human-readable format like\n // 2001:db8:8:66::1\n // in line with RFC 5952 (see https://tools.ietf.org/html/rfc5952#section-4)\n IPv6.prototype.toRFC5952String = function () {\n const regex = /((^|:)(0(:|$)){2,})/g;\n const string = this.toNormalizedString();\n let bestMatchIndex = 0;\n let bestMatchLength = -1;\n let match;\n\n while ((match = regex.exec(string))) {\n if (match[0].length > bestMatchLength) {\n bestMatchIndex = match.index;\n bestMatchLength = match[0].length;\n }\n }\n\n if (bestMatchLength < 0) {\n return string;\n }\n\n return `${string.substring(0, bestMatchIndex)}::${string.substring(bestMatchIndex + bestMatchLength)}`;\n };\n\n // Returns the address in compact, human-readable format like\n // 2001:db8:8:66::1\n // Calls toRFC5952String under the hood.\n IPv6.prototype.toString = function () {\n return this.toRFC5952String();\n };\n\n return IPv6;\n\n })();\n\n // A utility function to return broadcast address given the IPv6 interface and prefix length in CIDR notation\n ipaddr.IPv6.broadcastAddressFromCIDR = function (string) {\n try {\n const cidr = this.parseCIDR(string);\n const ipInterfaceOctets = cidr[0].toByteArray();\n const subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n const octets = [];\n let i = 0;\n while (i < 16) {\n // Broadcast address is bitwise OR between ip interface and inverted mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) | parseInt(subnetMaskOctets[i], 10) ^ 255);\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${e})`);\n }\n };\n\n // Checks if a given string is formatted like IPv6 address.\n ipaddr.IPv6.isIPv6 = function (string) {\n return this.parser(string) !== null;\n };\n\n // Checks to see if string is a valid IPv6 Address\n ipaddr.IPv6.isValid = function (string) {\n\n // Since IPv6.isValid is always called first, this shortcut\n // provides a substantial performance gain.\n if (typeof string === 'string' && string.indexOf(':') === -1) {\n return false;\n }\n\n try {\n const addr = this.parser(string);\n new this(addr.parts, addr.zoneId);\n return true;\n } catch (e) {\n return false;\n }\n };\n\n // A utility function to return network address given the IPv6 interface and prefix length in CIDR notation\n ipaddr.IPv6.networkAddressFromCIDR = function (string) {\n let cidr, i, ipInterfaceOctets, octets, subnetMaskOctets;\n\n try {\n cidr = this.parseCIDR(string);\n ipInterfaceOctets = cidr[0].toByteArray();\n subnetMaskOctets = this.subnetMaskFromPrefixLength(cidr[1]).toByteArray();\n octets = [];\n i = 0;\n while (i < 16) {\n // Network address is bitwise AND between ip interface and mask\n octets.push(parseInt(ipInterfaceOctets[i], 10) & parseInt(subnetMaskOctets[i], 10));\n i++;\n }\n\n return new this(octets);\n } catch (e) {\n throw new Error(`ipaddr: the address does not have IPv6 CIDR format (${e})`);\n }\n };\n\n // Tries to parse and validate a string with IPv6 address.\n // Throws an error if it fails.\n ipaddr.IPv6.parse = function (string) {\n const addr = this.parser(string);\n\n if (addr.parts === null) {\n throw new Error('ipaddr: string is not formatted like an IPv6 Address');\n }\n\n return new this(addr.parts, addr.zoneId);\n };\n\n ipaddr.IPv6.parseCIDR = function (string) {\n let maskLength, match, parsed;\n\n if ((match = string.match(/^(.+)\\/(\\d+)$/))) {\n maskLength = parseInt(match[2]);\n if (maskLength >= 0 && maskLength <= 128) {\n parsed = [this.parse(match[1]), maskLength];\n Object.defineProperty(parsed, 'toString', {\n value: function () {\n return this.join('/');\n }\n });\n return parsed;\n }\n }\n\n throw new Error('ipaddr: string is not formatted like an IPv6 CIDR range');\n };\n\n // Parse an IPv6 address.\n ipaddr.IPv6.parser = function (string) {\n let addr, i, match, octet, octets, zoneId;\n\n if ((match = string.match(ipv6Regexes.deprecatedTransitional))) {\n return this.parser(`::ffff:${match[1]}`);\n }\n if (ipv6Regexes.native.test(string)) {\n return expandIPv6(string, 8);\n }\n if ((match = string.match(ipv6Regexes.transitional))) {\n zoneId = match[6] || '';\n addr = expandIPv6(match[1].slice(0, -1) + zoneId, 6);\n if (addr.parts) {\n octets = [\n parseInt(match[2]),\n parseInt(match[3]),\n parseInt(match[4]),\n parseInt(match[5])\n ];\n for (i = 0; i < octets.length; i++) {\n octet = octets[i];\n if (!((0 <= octet && octet <= 255))) {\n return null;\n }\n }\n\n addr.parts.push(octets[0] << 8 | octets[1]);\n addr.parts.push(octets[2] << 8 | octets[3]);\n return {\n parts: addr.parts,\n zoneId: addr.zoneId\n };\n }\n }\n\n return null;\n };\n\n // A utility function to return subnet mask in IPv6 format given the prefix length\n ipaddr.IPv6.subnetMaskFromPrefixLength = function (prefix) {\n prefix = parseInt(prefix);\n if (prefix < 0 || prefix > 128) {\n throw new Error('ipaddr: invalid IPv6 prefix length');\n }\n\n const octets = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n let j = 0;\n const filledOctetCount = Math.floor(prefix / 8);\n\n while (j < filledOctetCount) {\n octets[j] = 255;\n j++;\n }\n\n if (filledOctetCount < 16) {\n octets[filledOctetCount] = Math.pow(2, prefix % 8) - 1 << 8 - (prefix % 8);\n }\n\n return new this(octets);\n };\n\n // Try to parse an array in network order (MSB first) for IPv4 and IPv6\n ipaddr.fromByteArray = function (bytes) {\n const length = bytes.length;\n\n if (length === 4) {\n return new ipaddr.IPv4(bytes);\n } else if (length === 16) {\n return new ipaddr.IPv6(bytes);\n } else {\n throw new Error('ipaddr: the binary input is neither an IPv6 nor IPv4 address');\n }\n };\n\n // Checks if the address is valid IP address\n ipaddr.isValid = function (string) {\n return ipaddr.IPv6.isValid(string) || ipaddr.IPv4.isValid(string);\n };\n\n\n // Attempts to parse an IP Address, first through IPv6 then IPv4.\n // Throws an error if it could not be parsed.\n ipaddr.parse = function (string) {\n if (ipaddr.IPv6.isValid(string)) {\n return ipaddr.IPv6.parse(string);\n } else if (ipaddr.IPv4.isValid(string)) {\n return ipaddr.IPv4.parse(string);\n } else {\n throw new Error('ipaddr: the address has neither IPv6 nor IPv4 format');\n }\n };\n\n // Attempt to parse CIDR notation, first through IPv6 then IPv4.\n // Throws an error if it could not be parsed.\n ipaddr.parseCIDR = function (string) {\n try {\n return ipaddr.IPv6.parseCIDR(string);\n } catch (e) {\n try {\n return ipaddr.IPv4.parseCIDR(string);\n } catch (e2) {\n throw new Error('ipaddr: the address has neither IPv6 nor IPv4 CIDR format');\n }\n }\n };\n\n // Parse an address and return plain IPv4 address if it is an IPv4-mapped address\n ipaddr.process = function (string) {\n const addr = this.parse(string);\n\n if (addr.kind() === 'ipv6' && addr.isIPv4MappedAddress()) {\n return addr.toIPv4Address();\n } else {\n return addr;\n }\n };\n\n // An utility function to ease named range matching. See examples below.\n // rangeList can contain both IPv4 and IPv6 subnet entries and will not throw errors\n // on matching IPv4 addresses to IPv6 ranges or vice versa.\n ipaddr.subnetMatch = function (address, rangeList, defaultName) {\n let i, rangeName, rangeSubnets, subnet;\n\n if (defaultName === undefined || defaultName === null) {\n defaultName = 'unicast';\n }\n\n for (rangeName in rangeList) {\n if (Object.prototype.hasOwnProperty.call(rangeList, rangeName)) {\n rangeSubnets = rangeList[rangeName];\n // ECMA5 Array.isArray isn't available everywhere\n if (rangeSubnets[0] && !(rangeSubnets[0] instanceof Array)) {\n rangeSubnets = [rangeSubnets];\n }\n\n for (i = 0; i < rangeSubnets.length; i++) {\n subnet = rangeSubnets[i];\n if (address.kind() === subnet[0].kind() && address.match.apply(address, subnet)) {\n return rangeName;\n }\n }\n }\n }\n\n return defaultName;\n };\n\n // Export for both the CommonJS and browser-like environment\n if (typeof module !== 'undefined' && module.exports) {\n module.exports = ipaddr;\n\n } else {\n root.ipaddr = ipaddr;\n }\n\n}(this));\n","'use strict';\n\n/** Highest positive signed 32-bit float value */\nconst maxInt = 2147483647; // aka. 0x7FFFFFFF or 2^31-1\n\n/** Bootstring parameters */\nconst base = 36;\nconst tMin = 1;\nconst tMax = 26;\nconst skew = 38;\nconst damp = 700;\nconst initialBias = 72;\nconst initialN = 128; // 0x80\nconst delimiter = '-'; // '\\x2D'\n\n/** Regular expressions */\nconst regexPunycode = /^xn--/;\nconst regexNonASCII = /[^\\0-\\x7F]/; // Note: U+007F DEL is excluded too.\nconst regexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g; // RFC 3490 separators\n\n/** Error messages */\nconst errors = {\n\t'overflow': 'Overflow: input needs wider integers to process',\n\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t'invalid-input': 'Invalid input'\n};\n\n/** Convenience shortcuts */\nconst baseMinusTMin = base - tMin;\nconst floor = Math.floor;\nconst stringFromCharCode = String.fromCharCode;\n\n/*--------------------------------------------------------------------------*/\n\n/**\n * A generic error utility function.\n * @private\n * @param {String} type The error type.\n * @returns {Error} Throws a `RangeError` with the applicable error message.\n */\nfunction error(type) {\n\tthrow new RangeError(errors[type]);\n}\n\n/**\n * A generic `Array#map` utility function.\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} callback The function that gets called for every array\n * item.\n * @returns {Array} A new array of values returned by the callback function.\n */\nfunction map(array, callback) {\n\tconst result = [];\n\tlet length = array.length;\n\twhile (length--) {\n\t\tresult[length] = callback(array[length]);\n\t}\n\treturn result;\n}\n\n/**\n * A simple `Array#map`-like wrapper to work with domain name strings or email\n * addresses.\n * @private\n * @param {String} domain The domain name or email address.\n * @param {Function} callback The function that gets called for every\n * character.\n * @returns {String} A new string of characters returned by the callback\n * function.\n */\nfunction mapDomain(domain, callback) {\n\tconst parts = domain.split('@');\n\tlet result = '';\n\tif (parts.length > 1) {\n\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t// the local part (i.e. everything up to `@`) intact.\n\t\tresult = parts[0] + '@';\n\t\tdomain = parts[1];\n\t}\n\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\tdomain = domain.replace(regexSeparators, '\\x2E');\n\tconst labels = domain.split('.');\n\tconst encoded = map(labels, callback).join('.');\n\treturn result + encoded;\n}\n\n/**\n * Creates an array containing the numeric code points of each Unicode\n * character in the string. While JavaScript uses UCS-2 internally,\n * this function will convert a pair of surrogate halves (each of which\n * UCS-2 exposes as separate characters) into a single code point,\n * matching UTF-16.\n * @see `punycode.ucs2.encode`\n * @see <https://mathiasbynens.be/notes/javascript-encoding>\n * @memberOf punycode.ucs2\n * @name decode\n * @param {String} string The Unicode input string (UCS-2).\n * @returns {Array} The new array of code points.\n */\nfunction ucs2decode(string) {\n\tconst output = [];\n\tlet counter = 0;\n\tconst length = string.length;\n\twhile (counter < length) {\n\t\tconst value = string.charCodeAt(counter++);\n\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t// It's a high surrogate, and there is a next character.\n\t\t\tconst extra = string.charCodeAt(counter++);\n\t\t\tif ((extra & 0xFC00) == 0xDC00) { // Low surrogate.\n\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t} else {\n\t\t\t\t// It's an unmatched surrogate; only append this code unit, in case the\n\t\t\t\t// next code unit is the high surrogate of a surrogate pair.\n\t\t\t\toutput.push(value);\n\t\t\t\tcounter--;\n\t\t\t}\n\t\t} else {\n\t\t\toutput.push(value);\n\t\t}\n\t}\n\treturn output;\n}\n\n/**\n * Creates a string based on an array of numeric code points.\n * @see `punycode.ucs2.decode`\n * @memberOf punycode.ucs2\n * @name encode\n * @param {Array} codePoints The array of numeric code points.\n * @returns {String} The new Unicode string (UCS-2).\n */\nconst ucs2encode = codePoints => String.fromCodePoint(...codePoints);\n\n/**\n * Converts a basic code point into a digit/integer.\n * @see `digitToBasic()`\n * @private\n * @param {Number} codePoint The basic numeric code point value.\n * @returns {Number} The numeric value of a basic code point (for use in\n * representing integers) in the range `0` to `base - 1`, or `base` if\n * the code point does not represent a value.\n */\nconst basicToDigit = function(codePoint) {\n\tif (codePoint >= 0x30 && codePoint < 0x3A) {\n\t\treturn 26 + (codePoint - 0x30);\n\t}\n\tif (codePoint >= 0x41 && codePoint < 0x5B) {\n\t\treturn codePoint - 0x41;\n\t}\n\tif (codePoint >= 0x61 && codePoint < 0x7B) {\n\t\treturn codePoint - 0x61;\n\t}\n\treturn base;\n};\n\n/**\n * Converts a digit/integer into a basic code point.\n * @see `basicToDigit()`\n * @private\n * @param {Number} digit The numeric value of a basic code point.\n * @returns {Number} The basic code point whose value (when used for\n * representing integers) is `digit`, which needs to be in the range\n * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n * used; else, the lowercase form is used. The behavior is undefined\n * if `flag` is non-zero and `digit` has no uppercase form.\n */\nconst digitToBasic = function(digit, flag) {\n\t// 0..25 map to ASCII a..z or A..Z\n\t// 26..35 map to ASCII 0..9\n\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n};\n\n/**\n * Bias adaptation function as per section 3.4 of RFC 3492.\n * https://tools.ietf.org/html/rfc3492#section-3.4\n * @private\n */\nconst adapt = function(delta, numPoints, firstTime) {\n\tlet k = 0;\n\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\tdelta += floor(delta / numPoints);\n\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\tdelta = floor(delta / baseMinusTMin);\n\t}\n\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n};\n\n/**\n * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n * symbols.\n * @memberOf punycode\n * @param {String} input The Punycode string of ASCII-only symbols.\n * @returns {String} The resulting string of Unicode symbols.\n */\nconst decode = function(input) {\n\t// Don't use UCS-2.\n\tconst output = [];\n\tconst inputLength = input.length;\n\tlet i = 0;\n\tlet n = initialN;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points: let `basic` be the number of input code\n\t// points before the last delimiter, or `0` if there is none, then copy\n\t// the first basic code points to the output.\n\n\tlet basic = input.lastIndexOf(delimiter);\n\tif (basic < 0) {\n\t\tbasic = 0;\n\t}\n\n\tfor (let j = 0; j < basic; ++j) {\n\t\t// if it's not a basic code point\n\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\terror('not-basic');\n\t\t}\n\t\toutput.push(input.charCodeAt(j));\n\t}\n\n\t// Main decoding loop: start just after the last delimiter if any basic code\n\t// points were copied; start at the beginning otherwise.\n\n\tfor (let index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t// `index` is the index of the next character to be consumed.\n\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t// which gets added to `i`. The overflow checking is easier\n\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t// value at the end to obtain `delta`.\n\t\tconst oldi = i;\n\t\tfor (let w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\tif (index >= inputLength) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\n\t\t\tconst digit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\tif (digit >= base) {\n\t\t\t\terror('invalid-input');\n\t\t\t}\n\t\t\tif (digit > floor((maxInt - i) / w)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\ti += digit * w;\n\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\tif (digit < t) {\n\t\t\t\tbreak;\n\t\t\t}\n\n\t\t\tconst baseMinusT = base - t;\n\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tw *= baseMinusT;\n\n\t\t}\n\n\t\tconst out = output.length + 1;\n\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t// incrementing `n` each time, so we'll fix that now:\n\t\tif (floor(i / out) > maxInt - n) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tn += floor(i / out);\n\t\ti %= out;\n\n\t\t// Insert `n` at position `i` of the output.\n\t\toutput.splice(i++, 0, n);\n\n\t}\n\n\treturn String.fromCodePoint(...output);\n};\n\n/**\n * Converts a string of Unicode symbols (e.g. a domain name label) to a\n * Punycode string of ASCII-only symbols.\n * @memberOf punycode\n * @param {String} input The string of Unicode symbols.\n * @returns {String} The resulting Punycode string of ASCII-only symbols.\n */\nconst encode = function(input) {\n\tconst output = [];\n\n\t// Convert the input in UCS-2 to an array of Unicode code points.\n\tinput = ucs2decode(input);\n\n\t// Cache the length.\n\tconst inputLength = input.length;\n\n\t// Initialize the state.\n\tlet n = initialN;\n\tlet delta = 0;\n\tlet bias = initialBias;\n\n\t// Handle the basic code points.\n\tfor (const currentValue of input) {\n\t\tif (currentValue < 0x80) {\n\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t}\n\t}\n\n\tconst basicLength = output.length;\n\tlet handledCPCount = basicLength;\n\n\t// `handledCPCount` is the number of code points that have been handled;\n\t// `basicLength` is the number of basic code points.\n\n\t// Finish the basic string with a delimiter unless it's empty.\n\tif (basicLength) {\n\t\toutput.push(delimiter);\n\t}\n\n\t// Main encoding loop:\n\twhile (handledCPCount < inputLength) {\n\n\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t// larger one:\n\t\tlet m = maxInt;\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\tm = currentValue;\n\t\t\t}\n\t\t}\n\n\t\t// Increase `delta` enough to advance the decoder's <n,i> state to <m,0>,\n\t\t// but guard against overflow.\n\t\tconst handledCPCountPlusOne = handledCPCount + 1;\n\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\terror('overflow');\n\t\t}\n\n\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\tn = m;\n\n\t\tfor (const currentValue of input) {\n\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\t\t\tif (currentValue === n) {\n\t\t\t\t// Represent delta as a generalized variable-length integer.\n\t\t\t\tlet q = delta;\n\t\t\t\tfor (let k = base; /* no condition */; k += base) {\n\t\t\t\t\tconst t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tconst qMinusT = q - t;\n\t\t\t\t\tconst baseMinusT = base - t;\n\t\t\t\t\toutput.push(\n\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t);\n\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t}\n\n\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount === basicLength);\n\t\t\t\tdelta = 0;\n\t\t\t\t++handledCPCount;\n\t\t\t}\n\t\t}\n\n\t\t++delta;\n\t\t++n;\n\n\t}\n\treturn output.join('');\n};\n\n/**\n * Converts a Punycode string representing a domain name or an email address\n * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n * it doesn't matter if you call it on a string that has already been\n * converted to Unicode.\n * @memberOf punycode\n * @param {String} input The Punycoded domain name or email address to\n * convert to Unicode.\n * @returns {String} The Unicode representation of the given Punycode\n * string.\n */\nconst toUnicode = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexPunycode.test(string)\n\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t: string;\n\t});\n};\n\n/**\n * Converts a Unicode string representing a domain name or an email address to\n * Punycode. Only the non-ASCII parts of the domain name will be converted,\n * i.e. it doesn't matter if you call it with a domain that's already in\n * ASCII.\n * @memberOf punycode\n * @param {String} input The domain name or email address to convert, as a\n * Unicode string.\n * @returns {String} The Punycode representation of the given domain name or\n * email address.\n */\nconst toASCII = function(input) {\n\treturn mapDomain(input, function(string) {\n\t\treturn regexNonASCII.test(string)\n\t\t\t? 'xn--' + encode(string)\n\t\t\t: string;\n\t});\n};\n\n/*--------------------------------------------------------------------------*/\n\n/** Define the public API */\nconst punycode = {\n\t/**\n\t * A string representing the current Punycode.js version number.\n\t * @memberOf punycode\n\t * @type String\n\t */\n\t'version': '2.3.1',\n\t/**\n\t * An object of methods to convert from JavaScript's internal character\n\t * representation (UCS-2) to Unicode code points, and back.\n\t * @see <https://mathiasbynens.be/notes/javascript-encoding>\n\t * @memberOf punycode\n\t * @type Object\n\t */\n\t'ucs2': {\n\t\t'decode': ucs2decode,\n\t\t'encode': ucs2encode\n\t},\n\t'decode': decode,\n\t'encode': encode,\n\t'toASCII': toASCII,\n\t'toUnicode': toUnicode\n};\n\nexport { ucs2decode, ucs2encode, decode, encode, toASCII, toUnicode };\nexport default punycode;\n","(function(nacl) {\n'use strict';\n\n// Ported in 2014 by Dmitry Chestnykh and Devi Mandiri.\n// Public domain.\n//\n// Implementation derived from TweetNaCl version 20140427.\n// See for details: http://tweetnacl.cr.yp.to/\n\nvar gf = function(init) {\n var i, r = new Float64Array(16);\n if (init) for (i = 0; i < init.length; i++) r[i] = init[i];\n return r;\n};\n\n// Pluggable, initialized in high-level API below.\nvar randombytes = function(/* x, n */) { throw new Error('no PRNG'); };\n\nvar _0 = new Uint8Array(16);\nvar _9 = new Uint8Array(32); _9[0] = 9;\n\nvar gf0 = gf(),\n gf1 = gf([1]),\n _121665 = gf([0xdb41, 1]),\n D = gf([0x78a3, 0x1359, 0x4dca, 0x75eb, 0xd8ab, 0x4141, 0x0a4d, 0x0070, 0xe898, 0x7779, 0x4079, 0x8cc7, 0xfe73, 0x2b6f, 0x6cee, 0x5203]),\n D2 = gf([0xf159, 0x26b2, 0x9b94, 0xebd6, 0xb156, 0x8283, 0x149a, 0x00e0, 0xd130, 0xeef3, 0x80f2, 0x198e, 0xfce7, 0x56df, 0xd9dc, 0x2406]),\n X = gf([0xd51a, 0x8f25, 0x2d60, 0xc956, 0xa7b2, 0x9525, 0xc760, 0x692c, 0xdc5c, 0xfdd6, 0xe231, 0xc0a4, 0x53fe, 0xcd6e, 0x36d3, 0x2169]),\n Y = gf([0x6658, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666, 0x6666]),\n I = gf([0xa0b0, 0x4a0e, 0x1b27, 0xc4ee, 0xe478, 0xad2f, 0x1806, 0x2f43, 0xd7a7, 0x3dfb, 0x0099, 0x2b4d, 0xdf0b, 0x4fc1, 0x2480, 0x2b83]);\n\nfunction ts64(x, i, h, l) {\n x[i] = (h >> 24) & 0xff;\n x[i+1] = (h >> 16) & 0xff;\n x[i+2] = (h >> 8) & 0xff;\n x[i+3] = h & 0xff;\n x[i+4] = (l >> 24) & 0xff;\n x[i+5] = (l >> 16) & 0xff;\n x[i+6] = (l >> 8) & 0xff;\n x[i+7] = l & 0xff;\n}\n\nfunction vn(x, xi, y, yi, n) {\n var i,d = 0;\n for (i = 0; i < n; i++) d |= x[xi+i]^y[yi+i];\n return (1 & ((d - 1) >>> 8)) - 1;\n}\n\nfunction crypto_verify_16(x, xi, y, yi) {\n return vn(x,xi,y,yi,16);\n}\n\nfunction crypto_verify_32(x, xi, y, yi) {\n return vn(x,xi,y,yi,32);\n}\n\nfunction core_salsa20(o, p, k, c) {\n var j0 = c[ 0] & 0xff | (c[ 1] & 0xff)<<8 | (c[ 2] & 0xff)<<16 | (c[ 3] & 0xff)<<24,\n j1 = k[ 0] & 0xff | (k[ 1] & 0xff)<<8 | (k[ 2] & 0xff)<<16 | (k[ 3] & 0xff)<<24,\n j2 = k[ 4] & 0xff | (k[ 5] & 0xff)<<8 | (k[ 6] & 0xff)<<16 | (k[ 7] & 0xff)<<24,\n j3 = k[ 8] & 0xff | (k[ 9] & 0xff)<<8 | (k[10] & 0xff)<<16 | (k[11] & 0xff)<<24,\n j4 = k[12] & 0xff | (k[13] & 0xff)<<8 | (k[14] & 0xff)<<16 | (k[15] & 0xff)<<24,\n j5 = c[ 4] & 0xff | (c[ 5] & 0xff)<<8 | (c[ 6] & 0xff)<<16 | (c[ 7] & 0xff)<<24,\n j6 = p[ 0] & 0xff | (p[ 1] & 0xff)<<8 | (p[ 2] & 0xff)<<16 | (p[ 3] & 0xff)<<24,\n j7 = p[ 4] & 0xff | (p[ 5] & 0xff)<<8 | (p[ 6] & 0xff)<<16 | (p[ 7] & 0xff)<<24,\n j8 = p[ 8] & 0xff | (p[ 9] & 0xff)<<8 | (p[10] & 0xff)<<16 | (p[11] & 0xff)<<24,\n j9 = p[12] & 0xff | (p[13] & 0xff)<<8 | (p[14] & 0xff)<<16 | (p[15] & 0xff)<<24,\n j10 = c[ 8] & 0xff | (c[ 9] & 0xff)<<8 | (c[10] & 0xff)<<16 | (c[11] & 0xff)<<24,\n j11 = k[16] & 0xff | (k[17] & 0xff)<<8 | (k[18] & 0xff)<<16 | (k[19] & 0xff)<<24,\n j12 = k[20] & 0xff | (k[21] & 0xff)<<8 | (k[22] & 0xff)<<16 | (k[23] & 0xff)<<24,\n j13 = k[24] & 0xff | (k[25] & 0xff)<<8 | (k[26] & 0xff)<<16 | (k[27] & 0xff)<<24,\n j14 = k[28] & 0xff | (k[29] & 0xff)<<8 | (k[30] & 0xff)<<16 | (k[31] & 0xff)<<24,\n j15 = c[12] & 0xff | (c[13] & 0xff)<<8 | (c[14] & 0xff)<<16 | (c[15] & 0xff)<<24;\n\n var x0 = j0, x1 = j1, x2 = j2, x3 = j3, x4 = j4, x5 = j5, x6 = j6, x7 = j7,\n x8 = j8, x9 = j9, x10 = j10, x11 = j11, x12 = j12, x13 = j13, x14 = j14,\n x15 = j15, u;\n\n for (var i = 0; i < 20; i += 2) {\n u = x0 + x12 | 0;\n x4 ^= u<<7 | u>>>(32-7);\n u = x4 + x0 | 0;\n x8 ^= u<<9 | u>>>(32-9);\n u = x8 + x4 | 0;\n x12 ^= u<<13 | u>>>(32-13);\n u = x12 + x8 | 0;\n x0 ^= u<<18 | u>>>(32-18);\n\n u = x5 + x1 | 0;\n x9 ^= u<<7 | u>>>(32-7);\n u = x9 + x5 | 0;\n x13 ^= u<<9 | u>>>(32-9);\n u = x13 + x9 | 0;\n x1 ^= u<<13 | u>>>(32-13);\n u = x1 + x13 | 0;\n x5 ^= u<<18 | u>>>(32-18);\n\n u = x10 + x6 | 0;\n x14 ^= u<<7 | u>>>(32-7);\n u = x14 + x10 | 0;\n x2 ^= u<<9 | u>>>(32-9);\n u = x2 + x14 | 0;\n x6 ^= u<<13 | u>>>(32-13);\n u = x6 + x2 | 0;\n x10 ^= u<<18 | u>>>(32-18);\n\n u = x15 + x11 | 0;\n x3 ^= u<<7 | u>>>(32-7);\n u = x3 + x15 | 0;\n x7 ^= u<<9 | u>>>(32-9);\n u = x7 + x3 | 0;\n x11 ^= u<<13 | u>>>(32-13);\n u = x11 + x7 | 0;\n x15 ^= u<<18 | u>>>(32-18);\n\n u = x0 + x3 | 0;\n x1 ^= u<<7 | u>>>(32-7);\n u = x1 + x0 | 0;\n x2 ^= u<<9 | u>>>(32-9);\n u = x2 + x1 | 0;\n x3 ^= u<<13 | u>>>(32-13);\n u = x3 + x2 | 0;\n x0 ^= u<<18 | u>>>(32-18);\n\n u = x5 + x4 | 0;\n x6 ^= u<<7 | u>>>(32-7);\n u = x6 + x5 | 0;\n x7 ^= u<<9 | u>>>(32-9);\n u = x7 + x6 | 0;\n x4 ^= u<<13 | u>>>(32-13);\n u = x4 + x7 | 0;\n x5 ^= u<<18 | u>>>(32-18);\n\n u = x10 + x9 | 0;\n x11 ^= u<<7 | u>>>(32-7);\n u = x11 + x10 | 0;\n x8 ^= u<<9 | u>>>(32-9);\n u = x8 + x11 | 0;\n x9 ^= u<<13 | u>>>(32-13);\n u = x9 + x8 | 0;\n x10 ^= u<<18 | u>>>(32-18);\n\n u = x15 + x14 | 0;\n x12 ^= u<<7 | u>>>(32-7);\n u = x12 + x15 | 0;\n x13 ^= u<<9 | u>>>(32-9);\n u = x13 + x12 | 0;\n x14 ^= u<<13 | u>>>(32-13);\n u = x14 + x13 | 0;\n x15 ^= u<<18 | u>>>(32-18);\n }\n x0 = x0 + j0 | 0;\n x1 = x1 + j1 | 0;\n x2 = x2 + j2 | 0;\n x3 = x3 + j3 | 0;\n x4 = x4 + j4 | 0;\n x5 = x5 + j5 | 0;\n x6 = x6 + j6 | 0;\n x7 = x7 + j7 | 0;\n x8 = x8 + j8 | 0;\n x9 = x9 + j9 | 0;\n x10 = x10 + j10 | 0;\n x11 = x11 + j11 | 0;\n x12 = x12 + j12 | 0;\n x13 = x13 + j13 | 0;\n x14 = x14 + j14 | 0;\n x15 = x15 + j15 | 0;\n\n o[ 0] = x0 >>> 0 & 0xff;\n o[ 1] = x0 >>> 8 & 0xff;\n o[ 2] = x0 >>> 16 & 0xff;\n o[ 3] = x0 >>> 24 & 0xff;\n\n o[ 4] = x1 >>> 0 & 0xff;\n o[ 5] = x1 >>> 8 & 0xff;\n o[ 6] = x1 >>> 16 & 0xff;\n o[ 7] = x1 >>> 24 & 0xff;\n\n o[ 8] = x2 >>> 0 & 0xff;\n o[ 9] = x2 >>> 8 & 0xff;\n o[10] = x2 >>> 16 & 0xff;\n o[11] = x2 >>> 24 & 0xff;\n\n o[12] = x3 >>> 0 & 0xff;\n o[13] = x3 >>> 8 & 0xff;\n o[14] = x3 >>> 16 & 0xff;\n o[15] = x3 >>> 24 & 0xff;\n\n o[16] = x4 >>> 0 & 0xff;\n o[17] = x4 >>> 8 & 0xff;\n o[18] = x4 >>> 16 & 0xff;\n o[19] = x4 >>> 24 & 0xff;\n\n o[20] = x5 >>> 0 & 0xff;\n o[21] = x5 >>> 8 & 0xff;\n o[22] = x5 >>> 16 & 0xff;\n o[23] = x5 >>> 24 & 0xff;\n\n o[24] = x6 >>> 0 & 0xff;\n o[25] = x6 >>> 8 & 0xff;\n o[26] = x6 >>> 16 & 0xff;\n o[27] = x6 >>> 24 & 0xff;\n\n o[28] = x7 >>> 0 & 0xff;\n o[29] = x7 >>> 8 & 0xff;\n o[30] = x7 >>> 16 & 0xff;\n o[31] = x7 >>> 24 & 0xff;\n\n o[32] = x8 >>> 0 & 0xff;\n o[33] = x8 >>> 8 & 0xff;\n o[34] = x8 >>> 16 & 0xff;\n o[35] = x8 >>> 24 & 0xff;\n\n o[36] = x9 >>> 0 & 0xff;\n o[37] = x9 >>> 8 & 0xff;\n o[38] = x9 >>> 16 & 0xff;\n o[39] = x9 >>> 24 & 0xff;\n\n o[40] = x10 >>> 0 & 0xff;\n o[41] = x10 >>> 8 & 0xff;\n o[42] = x10 >>> 16 & 0xff;\n o[43] = x10 >>> 24 & 0xff;\n\n o[44] = x11 >>> 0 & 0xff;\n o[45] = x11 >>> 8 & 0xff;\n o[46] = x11 >>> 16 & 0xff;\n o[47] = x11 >>> 24 & 0xff;\n\n o[48] = x12 >>> 0 & 0xff;\n o[49] = x12 >>> 8 & 0xff;\n o[50] = x12 >>> 16 & 0xff;\n o[51] = x12 >>> 24 & 0xff;\n\n o[52] = x13 >>> 0 & 0xff;\n o[53] = x13 >>> 8 & 0xff;\n o[54] = x13 >>> 16 & 0xff;\n o[55] = x13 >>> 24 & 0xff;\n\n o[56] = x14 >>> 0 & 0xff;\n o[57] = x14 >>> 8 & 0xff;\n o[58] = x14 >>> 16 & 0xff;\n o[59] = x14 >>> 24 & 0xff;\n\n o[60] = x15 >>> 0 & 0xff;\n o[61] = x15 >>> 8 & 0xff;\n o[62] = x15 >>> 16 & 0xff;\n o[63] = x15 >>> 24 & 0xff;\n}\n\nfunction core_hsalsa20(o,p,k,c) {\n var j0 = c[ 0] & 0xff | (c[ 1] & 0xff)<<8 | (c[ 2] & 0xff)<<16 | (c[ 3] & 0xff)<<24,\n j1 = k[ 0] & 0xff | (k[ 1] & 0xff)<<8 | (k[ 2] & 0xff)<<16 | (k[ 3] & 0xff)<<24,\n j2 = k[ 4] & 0xff | (k[ 5] & 0xff)<<8 | (k[ 6] & 0xff)<<16 | (k[ 7] & 0xff)<<24,\n j3 = k[ 8] & 0xff | (k[ 9] & 0xff)<<8 | (k[10] & 0xff)<<16 | (k[11] & 0xff)<<24,\n j4 = k[12] & 0xff | (k[13] & 0xff)<<8 | (k[14] & 0xff)<<16 | (k[15] & 0xff)<<24,\n j5 = c[ 4] & 0xff | (c[ 5] & 0xff)<<8 | (c[ 6] & 0xff)<<16 | (c[ 7] & 0xff)<<24,\n j6 = p[ 0] & 0xff | (p[ 1] & 0xff)<<8 | (p[ 2] & 0xff)<<16 | (p[ 3] & 0xff)<<24,\n j7 = p[ 4] & 0xff | (p[ 5] & 0xff)<<8 | (p[ 6] & 0xff)<<16 | (p[ 7] & 0xff)<<24,\n j8 = p[ 8] & 0xff | (p[ 9] & 0xff)<<8 | (p[10] & 0xff)<<16 | (p[11] & 0xff)<<24,\n j9 = p[12] & 0xff | (p[13] & 0xff)<<8 | (p[14] & 0xff)<<16 | (p[15] & 0xff)<<24,\n j10 = c[ 8] & 0xff | (c[ 9] & 0xff)<<8 | (c[10] & 0xff)<<16 | (c[11] & 0xff)<<24,\n j11 = k[16] & 0xff | (k[17] & 0xff)<<8 | (k[18] & 0xff)<<16 | (k[19] & 0xff)<<24,\n j12 = k[20] & 0xff | (k[21] & 0xff)<<8 | (k[22] & 0xff)<<16 | (k[23] & 0xff)<<24,\n j13 = k[24] & 0xff | (k[25] & 0xff)<<8 | (k[26] & 0xff)<<16 | (k[27] & 0xff)<<24,\n j14 = k[28] & 0xff | (k[29] & 0xff)<<8 | (k[30] & 0xff)<<16 | (k[31] & 0xff)<<24,\n j15 = c[12] & 0xff | (c[13] & 0xff)<<8 | (c[14] & 0xff)<<16 | (c[15] & 0xff)<<24;\n\n var x0 = j0, x1 = j1, x2 = j2, x3 = j3, x4 = j4, x5 = j5, x6 = j6, x7 = j7,\n x8 = j8, x9 = j9, x10 = j10, x11 = j11, x12 = j12, x13 = j13, x14 = j14,\n x15 = j15, u;\n\n for (var i = 0; i < 20; i += 2) {\n u = x0 + x12 | 0;\n x4 ^= u<<7 | u>>>(32-7);\n u = x4 + x0 | 0;\n x8 ^= u<<9 | u>>>(32-9);\n u = x8 + x4 | 0;\n x12 ^= u<<13 | u>>>(32-13);\n u = x12 + x8 | 0;\n x0 ^= u<<18 | u>>>(32-18);\n\n u = x5 + x1 | 0;\n x9 ^= u<<7 | u>>>(32-7);\n u = x9 + x5 | 0;\n x13 ^= u<<9 | u>>>(32-9);\n u = x13 + x9 | 0;\n x1 ^= u<<13 | u>>>(32-13);\n u = x1 + x13 | 0;\n x5 ^= u<<18 | u>>>(32-18);\n\n u = x10 + x6 | 0;\n x14 ^= u<<7 | u>>>(32-7);\n u = x14 + x10 | 0;\n x2 ^= u<<9 | u>>>(32-9);\n u = x2 + x14 | 0;\n x6 ^= u<<13 | u>>>(32-13);\n u = x6 + x2 | 0;\n x10 ^= u<<18 | u>>>(32-18);\n\n u = x15 + x11 | 0;\n x3 ^= u<<7 | u>>>(32-7);\n u = x3 + x15 | 0;\n x7 ^= u<<9 | u>>>(32-9);\n u = x7 + x3 | 0;\n x11 ^= u<<13 | u>>>(32-13);\n u = x11 + x7 | 0;\n x15 ^= u<<18 | u>>>(32-18);\n\n u = x0 + x3 | 0;\n x1 ^= u<<7 | u>>>(32-7);\n u = x1 + x0 | 0;\n x2 ^= u<<9 | u>>>(32-9);\n u = x2 + x1 | 0;\n x3 ^= u<<13 | u>>>(32-13);\n u = x3 + x2 | 0;\n x0 ^= u<<18 | u>>>(32-18);\n\n u = x5 + x4 | 0;\n x6 ^= u<<7 | u>>>(32-7);\n u = x6 + x5 | 0;\n x7 ^= u<<9 | u>>>(32-9);\n u = x7 + x6 | 0;\n x4 ^= u<<13 | u>>>(32-13);\n u = x4 + x7 | 0;\n x5 ^= u<<18 | u>>>(32-18);\n\n u = x10 + x9 | 0;\n x11 ^= u<<7 | u>>>(32-7);\n u = x11 + x10 | 0;\n x8 ^= u<<9 | u>>>(32-9);\n u = x8 + x11 | 0;\n x9 ^= u<<13 | u>>>(32-13);\n u = x9 + x8 | 0;\n x10 ^= u<<18 | u>>>(32-18);\n\n u = x15 + x14 | 0;\n x12 ^= u<<7 | u>>>(32-7);\n u = x12 + x15 | 0;\n x13 ^= u<<9 | u>>>(32-9);\n u = x13 + x12 | 0;\n x14 ^= u<<13 | u>>>(32-13);\n u = x14 + x13 | 0;\n x15 ^= u<<18 | u>>>(32-18);\n }\n\n o[ 0] = x0 >>> 0 & 0xff;\n o[ 1] = x0 >>> 8 & 0xff;\n o[ 2] = x0 >>> 16 & 0xff;\n o[ 3] = x0 >>> 24 & 0xff;\n\n o[ 4] = x5 >>> 0 & 0xff;\n o[ 5] = x5 >>> 8 & 0xff;\n o[ 6] = x5 >>> 16 & 0xff;\n o[ 7] = x5 >>> 24 & 0xff;\n\n o[ 8] = x10 >>> 0 & 0xff;\n o[ 9] = x10 >>> 8 & 0xff;\n o[10] = x10 >>> 16 & 0xff;\n o[11] = x10 >>> 24 & 0xff;\n\n o[12] = x15 >>> 0 & 0xff;\n o[13] = x15 >>> 8 & 0xff;\n o[14] = x15 >>> 16 & 0xff;\n o[15] = x15 >>> 24 & 0xff;\n\n o[16] = x6 >>> 0 & 0xff;\n o[17] = x6 >>> 8 & 0xff;\n o[18] = x6 >>> 16 & 0xff;\n o[19] = x6 >>> 24 & 0xff;\n\n o[20] = x7 >>> 0 & 0xff;\n o[21] = x7 >>> 8 & 0xff;\n o[22] = x7 >>> 16 & 0xff;\n o[23] = x7 >>> 24 & 0xff;\n\n o[24] = x8 >>> 0 & 0xff;\n o[25] = x8 >>> 8 & 0xff;\n o[26] = x8 >>> 16 & 0xff;\n o[27] = x8 >>> 24 & 0xff;\n\n o[28] = x9 >>> 0 & 0xff;\n o[29] = x9 >>> 8 & 0xff;\n o[30] = x9 >>> 16 & 0xff;\n o[31] = x9 >>> 24 & 0xff;\n}\n\nfunction crypto_core_salsa20(out,inp,k,c) {\n core_salsa20(out,inp,k,c);\n}\n\nfunction crypto_core_hsalsa20(out,inp,k,c) {\n core_hsalsa20(out,inp,k,c);\n}\n\nvar sigma = new Uint8Array([101, 120, 112, 97, 110, 100, 32, 51, 50, 45, 98, 121, 116, 101, 32, 107]);\n // \"expand 32-byte k\"\n\nfunction crypto_stream_salsa20_xor(c,cpos,m,mpos,b,n,k) {\n var z = new Uint8Array(16), x = new Uint8Array(64);\n var u, i;\n for (i = 0; i < 16; i++) z[i] = 0;\n for (i = 0; i < 8; i++) z[i] = n[i];\n while (b >= 64) {\n crypto_core_salsa20(x,z,k,sigma);\n for (i = 0; i < 64; i++) c[cpos+i] = m[mpos+i] ^ x[i];\n u = 1;\n for (i = 8; i < 16; i++) {\n u = u + (z[i] & 0xff) | 0;\n z[i] = u & 0xff;\n u >>>= 8;\n }\n b -= 64;\n cpos += 64;\n mpos += 64;\n }\n if (b > 0) {\n crypto_core_salsa20(x,z,k,sigma);\n for (i = 0; i < b; i++) c[cpos+i] = m[mpos+i] ^ x[i];\n }\n return 0;\n}\n\nfunction crypto_stream_salsa20(c,cpos,b,n,k) {\n var z = new Uint8Array(16), x = new Uint8Array(64);\n var u, i;\n for (i = 0; i < 16; i++) z[i] = 0;\n for (i = 0; i < 8; i++) z[i] = n[i];\n while (b >= 64) {\n crypto_core_salsa20(x,z,k,sigma);\n for (i = 0; i < 64; i++) c[cpos+i] = x[i];\n u = 1;\n for (i = 8; i < 16; i++) {\n u = u + (z[i] & 0xff) | 0;\n z[i] = u & 0xff;\n u >>>= 8;\n }\n b -= 64;\n cpos += 64;\n }\n if (b > 0) {\n crypto_core_salsa20(x,z,k,sigma);\n for (i = 0; i < b; i++) c[cpos+i] = x[i];\n }\n return 0;\n}\n\nfunction crypto_stream(c,cpos,d,n,k) {\n var s = new Uint8Array(32);\n crypto_core_hsalsa20(s,n,k,sigma);\n var sn = new Uint8Array(8);\n for (var i = 0; i < 8; i++) sn[i] = n[i+16];\n return crypto_stream_salsa20(c,cpos,d,sn,s);\n}\n\nfunction crypto_stream_xor(c,cpos,m,mpos,d,n,k) {\n var s = new Uint8Array(32);\n crypto_core_hsalsa20(s,n,k,sigma);\n var sn = new Uint8Array(8);\n for (var i = 0; i < 8; i++) sn[i] = n[i+16];\n return crypto_stream_salsa20_xor(c,cpos,m,mpos,d,sn,s);\n}\n\n/*\n* Port of Andrew Moon's Poly1305-donna-16. Public domain.\n* https://github.com/floodyberry/poly1305-donna\n*/\n\nvar poly1305 = function(key) {\n this.buffer = new Uint8Array(16);\n this.r = new Uint16Array(10);\n this.h = new Uint16Array(10);\n this.pad = new Uint16Array(8);\n this.leftover = 0;\n this.fin = 0;\n\n var t0, t1, t2, t3, t4, t5, t6, t7;\n\n t0 = key[ 0] & 0xff | (key[ 1] & 0xff) << 8; this.r[0] = ( t0 ) & 0x1fff;\n t1 = key[ 2] & 0xff | (key[ 3] & 0xff) << 8; this.r[1] = ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n t2 = key[ 4] & 0xff | (key[ 5] & 0xff) << 8; this.r[2] = ((t1 >>> 10) | (t2 << 6)) & 0x1f03;\n t3 = key[ 6] & 0xff | (key[ 7] & 0xff) << 8; this.r[3] = ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n t4 = key[ 8] & 0xff | (key[ 9] & 0xff) << 8; this.r[4] = ((t3 >>> 4) | (t4 << 12)) & 0x00ff;\n this.r[5] = ((t4 >>> 1)) & 0x1ffe;\n t5 = key[10] & 0xff | (key[11] & 0xff) << 8; this.r[6] = ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n t6 = key[12] & 0xff | (key[13] & 0xff) << 8; this.r[7] = ((t5 >>> 11) | (t6 << 5)) & 0x1f81;\n t7 = key[14] & 0xff | (key[15] & 0xff) << 8; this.r[8] = ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n this.r[9] = ((t7 >>> 5)) & 0x007f;\n\n this.pad[0] = key[16] & 0xff | (key[17] & 0xff) << 8;\n this.pad[1] = key[18] & 0xff | (key[19] & 0xff) << 8;\n this.pad[2] = key[20] & 0xff | (key[21] & 0xff) << 8;\n this.pad[3] = key[22] & 0xff | (key[23] & 0xff) << 8;\n this.pad[4] = key[24] & 0xff | (key[25] & 0xff) << 8;\n this.pad[5] = key[26] & 0xff | (key[27] & 0xff) << 8;\n this.pad[6] = key[28] & 0xff | (key[29] & 0xff) << 8;\n this.pad[7] = key[30] & 0xff | (key[31] & 0xff) << 8;\n};\n\npoly1305.prototype.blocks = function(m, mpos, bytes) {\n var hibit = this.fin ? 0 : (1 << 11);\n var t0, t1, t2, t3, t4, t5, t6, t7, c;\n var d0, d1, d2, d3, d4, d5, d6, d7, d8, d9;\n\n var h0 = this.h[0],\n h1 = this.h[1],\n h2 = this.h[2],\n h3 = this.h[3],\n h4 = this.h[4],\n h5 = this.h[5],\n h6 = this.h[6],\n h7 = this.h[7],\n h8 = this.h[8],\n h9 = this.h[9];\n\n var r0 = this.r[0],\n r1 = this.r[1],\n r2 = this.r[2],\n r3 = this.r[3],\n r4 = this.r[4],\n r5 = this.r[5],\n r6 = this.r[6],\n r7 = this.r[7],\n r8 = this.r[8],\n r9 = this.r[9];\n\n while (bytes >= 16) {\n t0 = m[mpos+ 0] & 0xff | (m[mpos+ 1] & 0xff) << 8; h0 += ( t0 ) & 0x1fff;\n t1 = m[mpos+ 2] & 0xff | (m[mpos+ 3] & 0xff) << 8; h1 += ((t0 >>> 13) | (t1 << 3)) & 0x1fff;\n t2 = m[mpos+ 4] & 0xff | (m[mpos+ 5] & 0xff) << 8; h2 += ((t1 >>> 10) | (t2 << 6)) & 0x1fff;\n t3 = m[mpos+ 6] & 0xff | (m[mpos+ 7] & 0xff) << 8; h3 += ((t2 >>> 7) | (t3 << 9)) & 0x1fff;\n t4 = m[mpos+ 8] & 0xff | (m[mpos+ 9] & 0xff) << 8; h4 += ((t3 >>> 4) | (t4 << 12)) & 0x1fff;\n h5 += ((t4 >>> 1)) & 0x1fff;\n t5 = m[mpos+10] & 0xff | (m[mpos+11] & 0xff) << 8; h6 += ((t4 >>> 14) | (t5 << 2)) & 0x1fff;\n t6 = m[mpos+12] & 0xff | (m[mpos+13] & 0xff) << 8; h7 += ((t5 >>> 11) | (t6 << 5)) & 0x1fff;\n t7 = m[mpos+14] & 0xff | (m[mpos+15] & 0xff) << 8; h8 += ((t6 >>> 8) | (t7 << 8)) & 0x1fff;\n h9 += ((t7 >>> 5)) | hibit;\n\n c = 0;\n\n d0 = c;\n d0 += h0 * r0;\n d0 += h1 * (5 * r9);\n d0 += h2 * (5 * r8);\n d0 += h3 * (5 * r7);\n d0 += h4 * (5 * r6);\n c = (d0 >>> 13); d0 &= 0x1fff;\n d0 += h5 * (5 * r5);\n d0 += h6 * (5 * r4);\n d0 += h7 * (5 * r3);\n d0 += h8 * (5 * r2);\n d0 += h9 * (5 * r1);\n c += (d0 >>> 13); d0 &= 0x1fff;\n\n d1 = c;\n d1 += h0 * r1;\n d1 += h1 * r0;\n d1 += h2 * (5 * r9);\n d1 += h3 * (5 * r8);\n d1 += h4 * (5 * r7);\n c = (d1 >>> 13); d1 &= 0x1fff;\n d1 += h5 * (5 * r6);\n d1 += h6 * (5 * r5);\n d1 += h7 * (5 * r4);\n d1 += h8 * (5 * r3);\n d1 += h9 * (5 * r2);\n c += (d1 >>> 13); d1 &= 0x1fff;\n\n d2 = c;\n d2 += h0 * r2;\n d2 += h1 * r1;\n d2 += h2 * r0;\n d2 += h3 * (5 * r9);\n d2 += h4 * (5 * r8);\n c = (d2 >>> 13); d2 &= 0x1fff;\n d2 += h5 * (5 * r7);\n d2 += h6 * (5 * r6);\n d2 += h7 * (5 * r5);\n d2 += h8 * (5 * r4);\n d2 += h9 * (5 * r3);\n c += (d2 >>> 13); d2 &= 0x1fff;\n\n d3 = c;\n d3 += h0 * r3;\n d3 += h1 * r2;\n d3 += h2 * r1;\n d3 += h3 * r0;\n d3 += h4 * (5 * r9);\n c = (d3 >>> 13); d3 &= 0x1fff;\n d3 += h5 * (5 * r8);\n d3 += h6 * (5 * r7);\n d3 += h7 * (5 * r6);\n d3 += h8 * (5 * r5);\n d3 += h9 * (5 * r4);\n c += (d3 >>> 13); d3 &= 0x1fff;\n\n d4 = c;\n d4 += h0 * r4;\n d4 += h1 * r3;\n d4 += h2 * r2;\n d4 += h3 * r1;\n d4 += h4 * r0;\n c = (d4 >>> 13); d4 &= 0x1fff;\n d4 += h5 * (5 * r9);\n d4 += h6 * (5 * r8);\n d4 += h7 * (5 * r7);\n d4 += h8 * (5 * r6);\n d4 += h9 * (5 * r5);\n c += (d4 >>> 13); d4 &= 0x1fff;\n\n d5 = c;\n d5 += h0 * r5;\n d5 += h1 * r4;\n d5 += h2 * r3;\n d5 += h3 * r2;\n d5 += h4 * r1;\n c = (d5 >>> 13); d5 &= 0x1fff;\n d5 += h5 * r0;\n d5 += h6 * (5 * r9);\n d5 += h7 * (5 * r8);\n d5 += h8 * (5 * r7);\n d5 += h9 * (5 * r6);\n c += (d5 >>> 13); d5 &= 0x1fff;\n\n d6 = c;\n d6 += h0 * r6;\n d6 += h1 * r5;\n d6 += h2 * r4;\n d6 += h3 * r3;\n d6 += h4 * r2;\n c = (d6 >>> 13); d6 &= 0x1fff;\n d6 += h5 * r1;\n d6 += h6 * r0;\n d6 += h7 * (5 * r9);\n d6 += h8 * (5 * r8);\n d6 += h9 * (5 * r7);\n c += (d6 >>> 13); d6 &= 0x1fff;\n\n d7 = c;\n d7 += h0 * r7;\n d7 += h1 * r6;\n d7 += h2 * r5;\n d7 += h3 * r4;\n d7 += h4 * r3;\n c = (d7 >>> 13); d7 &= 0x1fff;\n d7 += h5 * r2;\n d7 += h6 * r1;\n d7 += h7 * r0;\n d7 += h8 * (5 * r9);\n d7 += h9 * (5 * r8);\n c += (d7 >>> 13); d7 &= 0x1fff;\n\n d8 = c;\n d8 += h0 * r8;\n d8 += h1 * r7;\n d8 += h2 * r6;\n d8 += h3 * r5;\n d8 += h4 * r4;\n c = (d8 >>> 13); d8 &= 0x1fff;\n d8 += h5 * r3;\n d8 += h6 * r2;\n d8 += h7 * r1;\n d8 += h8 * r0;\n d8 += h9 * (5 * r9);\n c += (d8 >>> 13); d8 &= 0x1fff;\n\n d9 = c;\n d9 += h0 * r9;\n d9 += h1 * r8;\n d9 += h2 * r7;\n d9 += h3 * r6;\n d9 += h4 * r5;\n c = (d9 >>> 13); d9 &= 0x1fff;\n d9 += h5 * r4;\n d9 += h6 * r3;\n d9 += h7 * r2;\n d9 += h8 * r1;\n d9 += h9 * r0;\n c += (d9 >>> 13); d9 &= 0x1fff;\n\n c = (((c << 2) + c)) | 0;\n c = (c + d0) | 0;\n d0 = c & 0x1fff;\n c = (c >>> 13);\n d1 += c;\n\n h0 = d0;\n h1 = d1;\n h2 = d2;\n h3 = d3;\n h4 = d4;\n h5 = d5;\n h6 = d6;\n h7 = d7;\n h8 = d8;\n h9 = d9;\n\n mpos += 16;\n bytes -= 16;\n }\n this.h[0] = h0;\n this.h[1] = h1;\n this.h[2] = h2;\n this.h[3] = h3;\n this.h[4] = h4;\n this.h[5] = h5;\n this.h[6] = h6;\n this.h[7] = h7;\n this.h[8] = h8;\n this.h[9] = h9;\n};\n\npoly1305.prototype.finish = function(mac, macpos) {\n var g = new Uint16Array(10);\n var c, mask, f, i;\n\n if (this.leftover) {\n i = this.leftover;\n this.buffer[i++] = 1;\n for (; i < 16; i++) this.buffer[i] = 0;\n this.fin = 1;\n this.blocks(this.buffer, 0, 16);\n }\n\n c = this.h[1] >>> 13;\n this.h[1] &= 0x1fff;\n for (i = 2; i < 10; i++) {\n this.h[i] += c;\n c = this.h[i] >>> 13;\n this.h[i] &= 0x1fff;\n }\n this.h[0] += (c * 5);\n c = this.h[0] >>> 13;\n this.h[0] &= 0x1fff;\n this.h[1] += c;\n c = this.h[1] >>> 13;\n this.h[1] &= 0x1fff;\n this.h[2] += c;\n\n g[0] = this.h[0] + 5;\n c = g[0] >>> 13;\n g[0] &= 0x1fff;\n for (i = 1; i < 10; i++) {\n g[i] = this.h[i] + c;\n c = g[i] >>> 13;\n g[i] &= 0x1fff;\n }\n g[9] -= (1 << 13);\n\n mask = (c ^ 1) - 1;\n for (i = 0; i < 10; i++) g[i] &= mask;\n mask = ~mask;\n for (i = 0; i < 10; i++) this.h[i] = (this.h[i] & mask) | g[i];\n\n this.h[0] = ((this.h[0] ) | (this.h[1] << 13) ) & 0xffff;\n this.h[1] = ((this.h[1] >>> 3) | (this.h[2] << 10) ) & 0xffff;\n this.h[2] = ((this.h[2] >>> 6) | (this.h[3] << 7) ) & 0xffff;\n this.h[3] = ((this.h[3] >>> 9) | (this.h[4] << 4) ) & 0xffff;\n this.h[4] = ((this.h[4] >>> 12) | (this.h[5] << 1) | (this.h[6] << 14)) & 0xffff;\n this.h[5] = ((this.h[6] >>> 2) | (this.h[7] << 11) ) & 0xffff;\n this.h[6] = ((this.h[7] >>> 5) | (this.h[8] << 8) ) & 0xffff;\n this.h[7] = ((this.h[8] >>> 8) | (this.h[9] << 5) ) & 0xffff;\n\n f = this.h[0] + this.pad[0];\n this.h[0] = f & 0xffff;\n for (i = 1; i < 8; i++) {\n f = (((this.h[i] + this.pad[i]) | 0) + (f >>> 16)) | 0;\n this.h[i] = f & 0xffff;\n }\n\n mac[macpos+ 0] = (this.h[0] >>> 0) & 0xff;\n mac[macpos+ 1] = (this.h[0] >>> 8) & 0xff;\n mac[macpos+ 2] = (this.h[1] >>> 0) & 0xff;\n mac[macpos+ 3] = (this.h[1] >>> 8) & 0xff;\n mac[macpos+ 4] = (this.h[2] >>> 0) & 0xff;\n mac[macpos+ 5] = (this.h[2] >>> 8) & 0xff;\n mac[macpos+ 6] = (this.h[3] >>> 0) & 0xff;\n mac[macpos+ 7] = (this.h[3] >>> 8) & 0xff;\n mac[macpos+ 8] = (this.h[4] >>> 0) & 0xff;\n mac[macpos+ 9] = (this.h[4] >>> 8) & 0xff;\n mac[macpos+10] = (this.h[5] >>> 0) & 0xff;\n mac[macpos+11] = (this.h[5] >>> 8) & 0xff;\n mac[macpos+12] = (this.h[6] >>> 0) & 0xff;\n mac[macpos+13] = (this.h[6] >>> 8) & 0xff;\n mac[macpos+14] = (this.h[7] >>> 0) & 0xff;\n mac[macpos+15] = (this.h[7] >>> 8) & 0xff;\n};\n\npoly1305.prototype.update = function(m, mpos, bytes) {\n var i, want;\n\n if (this.leftover) {\n want = (16 - this.leftover);\n if (want > bytes)\n want = bytes;\n for (i = 0; i < want; i++)\n this.buffer[this.leftover + i] = m[mpos+i];\n bytes -= want;\n mpos += want;\n this.leftover += want;\n if (this.leftover < 16)\n return;\n this.blocks(this.buffer, 0, 16);\n this.leftover = 0;\n }\n\n if (bytes >= 16) {\n want = bytes - (bytes % 16);\n this.blocks(m, mpos, want);\n mpos += want;\n bytes -= want;\n }\n\n if (bytes) {\n for (i = 0; i < bytes; i++)\n this.buffer[this.leftover + i] = m[mpos+i];\n this.leftover += bytes;\n }\n};\n\nfunction crypto_onetimeauth(out, outpos, m, mpos, n, k) {\n var s = new poly1305(k);\n s.update(m, mpos, n);\n s.finish(out, outpos);\n return 0;\n}\n\nfunction crypto_onetimeauth_verify(h, hpos, m, mpos, n, k) {\n var x = new Uint8Array(16);\n crypto_onetimeauth(x,0,m,mpos,n,k);\n return crypto_verify_16(h,hpos,x,0);\n}\n\nfunction crypto_secretbox(c,m,d,n,k) {\n var i;\n if (d < 32) return -1;\n crypto_stream_xor(c,0,m,0,d,n,k);\n crypto_onetimeauth(c, 16, c, 32, d - 32, c);\n for (i = 0; i < 16; i++) c[i] = 0;\n return 0;\n}\n\nfunction crypto_secretbox_open(m,c,d,n,k) {\n var i;\n var x = new Uint8Array(32);\n if (d < 32) return -1;\n crypto_stream(x,0,32,n,k);\n if (crypto_onetimeauth_verify(c, 16,c, 32,d - 32,x) !== 0) return -1;\n crypto_stream_xor(m,0,c,0,d,n,k);\n for (i = 0; i < 32; i++) m[i] = 0;\n return 0;\n}\n\nfunction set25519(r, a) {\n var i;\n for (i = 0; i < 16; i++) r[i] = a[i]|0;\n}\n\nfunction car25519(o) {\n var i, v, c = 1;\n for (i = 0; i < 16; i++) {\n v = o[i] + c + 65535;\n c = Math.floor(v / 65536);\n o[i] = v - c * 65536;\n }\n o[0] += c-1 + 37 * (c-1);\n}\n\nfunction sel25519(p, q, b) {\n var t, c = ~(b-1);\n for (var i = 0; i < 16; i++) {\n t = c & (p[i] ^ q[i]);\n p[i] ^= t;\n q[i] ^= t;\n }\n}\n\nfunction pack25519(o, n) {\n var i, j, b;\n var m = gf(), t = gf();\n for (i = 0; i < 16; i++) t[i] = n[i];\n car25519(t);\n car25519(t);\n car25519(t);\n for (j = 0; j < 2; j++) {\n m[0] = t[0] - 0xffed;\n for (i = 1; i < 15; i++) {\n m[i] = t[i] - 0xffff - ((m[i-1]>>16) & 1);\n m[i-1] &= 0xffff;\n }\n m[15] = t[15] - 0x7fff - ((m[14]>>16) & 1);\n b = (m[15]>>16) & 1;\n m[14] &= 0xffff;\n sel25519(t, m, 1-b);\n }\n for (i = 0; i < 16; i++) {\n o[2*i] = t[i] & 0xff;\n o[2*i+1] = t[i]>>8;\n }\n}\n\nfunction neq25519(a, b) {\n var c = new Uint8Array(32), d = new Uint8Array(32);\n pack25519(c, a);\n pack25519(d, b);\n return crypto_verify_32(c, 0, d, 0);\n}\n\nfunction par25519(a) {\n var d = new Uint8Array(32);\n pack25519(d, a);\n return d[0] & 1;\n}\n\nfunction unpack25519(o, n) {\n var i;\n for (i = 0; i < 16; i++) o[i] = n[2*i] + (n[2*i+1] << 8);\n o[15] &= 0x7fff;\n}\n\nfunction A(o, a, b) {\n for (var i = 0; i < 16; i++) o[i] = a[i] + b[i];\n}\n\nfunction Z(o, a, b) {\n for (var i = 0; i < 16; i++) o[i] = a[i] - b[i];\n}\n\nfunction M(o, a, b) {\n var v, c,\n t0 = 0, t1 = 0, t2 = 0, t3 = 0, t4 = 0, t5 = 0, t6 = 0, t7 = 0,\n t8 = 0, t9 = 0, t10 = 0, t11 = 0, t12 = 0, t13 = 0, t14 = 0, t15 = 0,\n t16 = 0, t17 = 0, t18 = 0, t19 = 0, t20 = 0, t21 = 0, t22 = 0, t23 = 0,\n t24 = 0, t25 = 0, t26 = 0, t27 = 0, t28 = 0, t29 = 0, t30 = 0,\n b0 = b[0],\n b1 = b[1],\n b2 = b[2],\n b3 = b[3],\n b4 = b[4],\n b5 = b[5],\n b6 = b[6],\n b7 = b[7],\n b8 = b[8],\n b9 = b[9],\n b10 = b[10],\n b11 = b[11],\n b12 = b[12],\n b13 = b[13],\n b14 = b[14],\n b15 = b[15];\n\n v = a[0];\n t0 += v * b0;\n t1 += v * b1;\n t2 += v * b2;\n t3 += v * b3;\n t4 += v * b4;\n t5 += v * b5;\n t6 += v * b6;\n t7 += v * b7;\n t8 += v * b8;\n t9 += v * b9;\n t10 += v * b10;\n t11 += v * b11;\n t12 += v * b12;\n t13 += v * b13;\n t14 += v * b14;\n t15 += v * b15;\n v = a[1];\n t1 += v * b0;\n t2 += v * b1;\n t3 += v * b2;\n t4 += v * b3;\n t5 += v * b4;\n t6 += v * b5;\n t7 += v * b6;\n t8 += v * b7;\n t9 += v * b8;\n t10 += v * b9;\n t11 += v * b10;\n t12 += v * b11;\n t13 += v * b12;\n t14 += v * b13;\n t15 += v * b14;\n t16 += v * b15;\n v = a[2];\n t2 += v * b0;\n t3 += v * b1;\n t4 += v * b2;\n t5 += v * b3;\n t6 += v * b4;\n t7 += v * b5;\n t8 += v * b6;\n t9 += v * b7;\n t10 += v * b8;\n t11 += v * b9;\n t12 += v * b10;\n t13 += v * b11;\n t14 += v * b12;\n t15 += v * b13;\n t16 += v * b14;\n t17 += v * b15;\n v = a[3];\n t3 += v * b0;\n t4 += v * b1;\n t5 += v * b2;\n t6 += v * b3;\n t7 += v * b4;\n t8 += v * b5;\n t9 += v * b6;\n t10 += v * b7;\n t11 += v * b8;\n t12 += v * b9;\n t13 += v * b10;\n t14 += v * b11;\n t15 += v * b12;\n t16 += v * b13;\n t17 += v * b14;\n t18 += v * b15;\n v = a[4];\n t4 += v * b0;\n t5 += v * b1;\n t6 += v * b2;\n t7 += v * b3;\n t8 += v * b4;\n t9 += v * b5;\n t10 += v * b6;\n t11 += v * b7;\n t12 += v * b8;\n t13 += v * b9;\n t14 += v * b10;\n t15 += v * b11;\n t16 += v * b12;\n t17 += v * b13;\n t18 += v * b14;\n t19 += v * b15;\n v = a[5];\n t5 += v * b0;\n t6 += v * b1;\n t7 += v * b2;\n t8 += v * b3;\n t9 += v * b4;\n t10 += v * b5;\n t11 += v * b6;\n t12 += v * b7;\n t13 += v * b8;\n t14 += v * b9;\n t15 += v * b10;\n t16 += v * b11;\n t17 += v * b12;\n t18 += v * b13;\n t19 += v * b14;\n t20 += v * b15;\n v = a[6];\n t6 += v * b0;\n t7 += v * b1;\n t8 += v * b2;\n t9 += v * b3;\n t10 += v * b4;\n t11 += v * b5;\n t12 += v * b6;\n t13 += v * b7;\n t14 += v * b8;\n t15 += v * b9;\n t16 += v * b10;\n t17 += v * b11;\n t18 += v * b12;\n t19 += v * b13;\n t20 += v * b14;\n t21 += v * b15;\n v = a[7];\n t7 += v * b0;\n t8 += v * b1;\n t9 += v * b2;\n t10 += v * b3;\n t11 += v * b4;\n t12 += v * b5;\n t13 += v * b6;\n t14 += v * b7;\n t15 += v * b8;\n t16 += v * b9;\n t17 += v * b10;\n t18 += v * b11;\n t19 += v * b12;\n t20 += v * b13;\n t21 += v * b14;\n t22 += v * b15;\n v = a[8];\n t8 += v * b0;\n t9 += v * b1;\n t10 += v * b2;\n t11 += v * b3;\n t12 += v * b4;\n t13 += v * b5;\n t14 += v * b6;\n t15 += v * b7;\n t16 += v * b8;\n t17 += v * b9;\n t18 += v * b10;\n t19 += v * b11;\n t20 += v * b12;\n t21 += v * b13;\n t22 += v * b14;\n t23 += v * b15;\n v = a[9];\n t9 += v * b0;\n t10 += v * b1;\n t11 += v * b2;\n t12 += v * b3;\n t13 += v * b4;\n t14 += v * b5;\n t15 += v * b6;\n t16 += v * b7;\n t17 += v * b8;\n t18 += v * b9;\n t19 += v * b10;\n t20 += v * b11;\n t21 += v * b12;\n t22 += v * b13;\n t23 += v * b14;\n t24 += v * b15;\n v = a[10];\n t10 += v * b0;\n t11 += v * b1;\n t12 += v * b2;\n t13 += v * b3;\n t14 += v * b4;\n t15 += v * b5;\n t16 += v * b6;\n t17 += v * b7;\n t18 += v * b8;\n t19 += v * b9;\n t20 += v * b10;\n t21 += v * b11;\n t22 += v * b12;\n t23 += v * b13;\n t24 += v * b14;\n t25 += v * b15;\n v = a[11];\n t11 += v * b0;\n t12 += v * b1;\n t13 += v * b2;\n t14 += v * b3;\n t15 += v * b4;\n t16 += v * b5;\n t17 += v * b6;\n t18 += v * b7;\n t19 += v * b8;\n t20 += v * b9;\n t21 += v * b10;\n t22 += v * b11;\n t23 += v * b12;\n t24 += v * b13;\n t25 += v * b14;\n t26 += v * b15;\n v = a[12];\n t12 += v * b0;\n t13 += v * b1;\n t14 += v * b2;\n t15 += v * b3;\n t16 += v * b4;\n t17 += v * b5;\n t18 += v * b6;\n t19 += v * b7;\n t20 += v * b8;\n t21 += v * b9;\n t22 += v * b10;\n t23 += v * b11;\n t24 += v * b12;\n t25 += v * b13;\n t26 += v * b14;\n t27 += v * b15;\n v = a[13];\n t13 += v * b0;\n t14 += v * b1;\n t15 += v * b2;\n t16 += v * b3;\n t17 += v * b4;\n t18 += v * b5;\n t19 += v * b6;\n t20 += v * b7;\n t21 += v * b8;\n t22 += v * b9;\n t23 += v * b10;\n t24 += v * b11;\n t25 += v * b12;\n t26 += v * b13;\n t27 += v * b14;\n t28 += v * b15;\n v = a[14];\n t14 += v * b0;\n t15 += v * b1;\n t16 += v * b2;\n t17 += v * b3;\n t18 += v * b4;\n t19 += v * b5;\n t20 += v * b6;\n t21 += v * b7;\n t22 += v * b8;\n t23 += v * b9;\n t24 += v * b10;\n t25 += v * b11;\n t26 += v * b12;\n t27 += v * b13;\n t28 += v * b14;\n t29 += v * b15;\n v = a[15];\n t15 += v * b0;\n t16 += v * b1;\n t17 += v * b2;\n t18 += v * b3;\n t19 += v * b4;\n t20 += v * b5;\n t21 += v * b6;\n t22 += v * b7;\n t23 += v * b8;\n t24 += v * b9;\n t25 += v * b10;\n t26 += v * b11;\n t27 += v * b12;\n t28 += v * b13;\n t29 += v * b14;\n t30 += v * b15;\n\n t0 += 38 * t16;\n t1 += 38 * t17;\n t2 += 38 * t18;\n t3 += 38 * t19;\n t4 += 38 * t20;\n t5 += 38 * t21;\n t6 += 38 * t22;\n t7 += 38 * t23;\n t8 += 38 * t24;\n t9 += 38 * t25;\n t10 += 38 * t26;\n t11 += 38 * t27;\n t12 += 38 * t28;\n t13 += 38 * t29;\n t14 += 38 * t30;\n // t15 left as is\n\n // first car\n c = 1;\n v = t0 + c + 65535; c = Math.floor(v / 65536); t0 = v - c * 65536;\n v = t1 + c + 65535; c = Math.floor(v / 65536); t1 = v - c * 65536;\n v = t2 + c + 65535; c = Math.floor(v / 65536); t2 = v - c * 65536;\n v = t3 + c + 65535; c = Math.floor(v / 65536); t3 = v - c * 65536;\n v = t4 + c + 65535; c = Math.floor(v / 65536); t4 = v - c * 65536;\n v = t5 + c + 65535; c = Math.floor(v / 65536); t5 = v - c * 65536;\n v = t6 + c + 65535; c = Math.floor(v / 65536); t6 = v - c * 65536;\n v = t7 + c + 65535; c = Math.floor(v / 65536); t7 = v - c * 65536;\n v = t8 + c + 65535; c = Math.floor(v / 65536); t8 = v - c * 65536;\n v = t9 + c + 65535; c = Math.floor(v / 65536); t9 = v - c * 65536;\n v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;\n v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;\n v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;\n v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;\n v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;\n v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;\n t0 += c-1 + 37 * (c-1);\n\n // second car\n c = 1;\n v = t0 + c + 65535; c = Math.floor(v / 65536); t0 = v - c * 65536;\n v = t1 + c + 65535; c = Math.floor(v / 65536); t1 = v - c * 65536;\n v = t2 + c + 65535; c = Math.floor(v / 65536); t2 = v - c * 65536;\n v = t3 + c + 65535; c = Math.floor(v / 65536); t3 = v - c * 65536;\n v = t4 + c + 65535; c = Math.floor(v / 65536); t4 = v - c * 65536;\n v = t5 + c + 65535; c = Math.floor(v / 65536); t5 = v - c * 65536;\n v = t6 + c + 65535; c = Math.floor(v / 65536); t6 = v - c * 65536;\n v = t7 + c + 65535; c = Math.floor(v / 65536); t7 = v - c * 65536;\n v = t8 + c + 65535; c = Math.floor(v / 65536); t8 = v - c * 65536;\n v = t9 + c + 65535; c = Math.floor(v / 65536); t9 = v - c * 65536;\n v = t10 + c + 65535; c = Math.floor(v / 65536); t10 = v - c * 65536;\n v = t11 + c + 65535; c = Math.floor(v / 65536); t11 = v - c * 65536;\n v = t12 + c + 65535; c = Math.floor(v / 65536); t12 = v - c * 65536;\n v = t13 + c + 65535; c = Math.floor(v / 65536); t13 = v - c * 65536;\n v = t14 + c + 65535; c = Math.floor(v / 65536); t14 = v - c * 65536;\n v = t15 + c + 65535; c = Math.floor(v / 65536); t15 = v - c * 65536;\n t0 += c-1 + 37 * (c-1);\n\n o[ 0] = t0;\n o[ 1] = t1;\n o[ 2] = t2;\n o[ 3] = t3;\n o[ 4] = t4;\n o[ 5] = t5;\n o[ 6] = t6;\n o[ 7] = t7;\n o[ 8] = t8;\n o[ 9] = t9;\n o[10] = t10;\n o[11] = t11;\n o[12] = t12;\n o[13] = t13;\n o[14] = t14;\n o[15] = t15;\n}\n\nfunction S(o, a) {\n M(o, a, a);\n}\n\nfunction inv25519(o, i) {\n var c = gf();\n var a;\n for (a = 0; a < 16; a++) c[a] = i[a];\n for (a = 253; a >= 0; a--) {\n S(c, c);\n if(a !== 2 && a !== 4) M(c, c, i);\n }\n for (a = 0; a < 16; a++) o[a] = c[a];\n}\n\nfunction pow2523(o, i) {\n var c = gf();\n var a;\n for (a = 0; a < 16; a++) c[a] = i[a];\n for (a = 250; a >= 0; a--) {\n S(c, c);\n if(a !== 1) M(c, c, i);\n }\n for (a = 0; a < 16; a++) o[a] = c[a];\n}\n\nfunction crypto_scalarmult(q, n, p) {\n var z = new Uint8Array(32);\n var x = new Float64Array(80), r, i;\n var a = gf(), b = gf(), c = gf(),\n d = gf(), e = gf(), f = gf();\n for (i = 0; i < 31; i++) z[i] = n[i];\n z[31]=(n[31]&127)|64;\n z[0]&=248;\n unpack25519(x,p);\n for (i = 0; i < 16; i++) {\n b[i]=x[i];\n d[i]=a[i]=c[i]=0;\n }\n a[0]=d[0]=1;\n for (i=254; i>=0; --i) {\n r=(z[i>>>3]>>>(i&7))&1;\n sel25519(a,b,r);\n sel25519(c,d,r);\n A(e,a,c);\n Z(a,a,c);\n A(c,b,d);\n Z(b,b,d);\n S(d,e);\n S(f,a);\n M(a,c,a);\n M(c,b,e);\n A(e,a,c);\n Z(a,a,c);\n S(b,a);\n Z(c,d,f);\n M(a,c,_121665);\n A(a,a,d);\n M(c,c,a);\n M(a,d,f);\n M(d,b,x);\n S(b,e);\n sel25519(a,b,r);\n sel25519(c,d,r);\n }\n for (i = 0; i < 16; i++) {\n x[i+16]=a[i];\n x[i+32]=c[i];\n x[i+48]=b[i];\n x[i+64]=d[i];\n }\n var x32 = x.subarray(32);\n var x16 = x.subarray(16);\n inv25519(x32,x32);\n M(x16,x16,x32);\n pack25519(q,x16);\n return 0;\n}\n\nfunction crypto_scalarmult_base(q, n) {\n return crypto_scalarmult(q, n, _9);\n}\n\nfunction crypto_box_keypair(y, x) {\n randombytes(x, 32);\n return crypto_scalarmult_base(y, x);\n}\n\nfunction crypto_box_beforenm(k, y, x) {\n var s = new Uint8Array(32);\n crypto_scalarmult(s, x, y);\n return crypto_core_hsalsa20(k, _0, s, sigma);\n}\n\nvar crypto_box_afternm = crypto_secretbox;\nvar crypto_box_open_afternm = crypto_secretbox_open;\n\nfunction crypto_box(c, m, d, n, y, x) {\n var k = new Uint8Array(32);\n crypto_box_beforenm(k, y, x);\n return crypto_box_afternm(c, m, d, n, k);\n}\n\nfunction crypto_box_open(m, c, d, n, y, x) {\n var k = new Uint8Array(32);\n crypto_box_beforenm(k, y, x);\n return crypto_box_open_afternm(m, c, d, n, k);\n}\n\nvar K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction crypto_hashblocks_hl(hh, hl, m, n) {\n var wh = new Int32Array(16), wl = new Int32Array(16),\n bh0, bh1, bh2, bh3, bh4, bh5, bh6, bh7,\n bl0, bl1, bl2, bl3, bl4, bl5, bl6, bl7,\n th, tl, i, j, h, l, a, b, c, d;\n\n var ah0 = hh[0],\n ah1 = hh[1],\n ah2 = hh[2],\n ah3 = hh[3],\n ah4 = hh[4],\n ah5 = hh[5],\n ah6 = hh[6],\n ah7 = hh[7],\n\n al0 = hl[0],\n al1 = hl[1],\n al2 = hl[2],\n al3 = hl[3],\n al4 = hl[4],\n al5 = hl[5],\n al6 = hl[6],\n al7 = hl[7];\n\n var pos = 0;\n while (n >= 128) {\n for (i = 0; i < 16; i++) {\n j = 8 * i + pos;\n wh[i] = (m[j+0] << 24) | (m[j+1] << 16) | (m[j+2] << 8) | m[j+3];\n wl[i] = (m[j+4] << 24) | (m[j+5] << 16) | (m[j+6] << 8) | m[j+7];\n }\n for (i = 0; i < 80; i++) {\n bh0 = ah0;\n bh1 = ah1;\n bh2 = ah2;\n bh3 = ah3;\n bh4 = ah4;\n bh5 = ah5;\n bh6 = ah6;\n bh7 = ah7;\n\n bl0 = al0;\n bl1 = al1;\n bl2 = al2;\n bl3 = al3;\n bl4 = al4;\n bl5 = al5;\n bl6 = al6;\n bl7 = al7;\n\n // add\n h = ah7;\n l = al7;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n // Sigma1\n h = ((ah4 >>> 14) | (al4 << (32-14))) ^ ((ah4 >>> 18) | (al4 << (32-18))) ^ ((al4 >>> (41-32)) | (ah4 << (32-(41-32))));\n l = ((al4 >>> 14) | (ah4 << (32-14))) ^ ((al4 >>> 18) | (ah4 << (32-18))) ^ ((ah4 >>> (41-32)) | (al4 << (32-(41-32))));\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // Ch\n h = (ah4 & ah5) ^ (~ah4 & ah6);\n l = (al4 & al5) ^ (~al4 & al6);\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // K\n h = K[i*2];\n l = K[i*2+1];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // w\n h = wh[i%16];\n l = wl[i%16];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n th = c & 0xffff | d << 16;\n tl = a & 0xffff | b << 16;\n\n // add\n h = th;\n l = tl;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n // Sigma0\n h = ((ah0 >>> 28) | (al0 << (32-28))) ^ ((al0 >>> (34-32)) | (ah0 << (32-(34-32)))) ^ ((al0 >>> (39-32)) | (ah0 << (32-(39-32))));\n l = ((al0 >>> 28) | (ah0 << (32-28))) ^ ((ah0 >>> (34-32)) | (al0 << (32-(34-32)))) ^ ((ah0 >>> (39-32)) | (al0 << (32-(39-32))));\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // Maj\n h = (ah0 & ah1) ^ (ah0 & ah2) ^ (ah1 & ah2);\n l = (al0 & al1) ^ (al0 & al2) ^ (al1 & al2);\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n bh7 = (c & 0xffff) | (d << 16);\n bl7 = (a & 0xffff) | (b << 16);\n\n // add\n h = bh3;\n l = bl3;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = th;\n l = tl;\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n bh3 = (c & 0xffff) | (d << 16);\n bl3 = (a & 0xffff) | (b << 16);\n\n ah1 = bh0;\n ah2 = bh1;\n ah3 = bh2;\n ah4 = bh3;\n ah5 = bh4;\n ah6 = bh5;\n ah7 = bh6;\n ah0 = bh7;\n\n al1 = bl0;\n al2 = bl1;\n al3 = bl2;\n al4 = bl3;\n al5 = bl4;\n al6 = bl5;\n al7 = bl6;\n al0 = bl7;\n\n if (i%16 === 15) {\n for (j = 0; j < 16; j++) {\n // add\n h = wh[j];\n l = wl[j];\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = wh[(j+9)%16];\n l = wl[(j+9)%16];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // sigma0\n th = wh[(j+1)%16];\n tl = wl[(j+1)%16];\n h = ((th >>> 1) | (tl << (32-1))) ^ ((th >>> 8) | (tl << (32-8))) ^ (th >>> 7);\n l = ((tl >>> 1) | (th << (32-1))) ^ ((tl >>> 8) | (th << (32-8))) ^ ((tl >>> 7) | (th << (32-7)));\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n // sigma1\n th = wh[(j+14)%16];\n tl = wl[(j+14)%16];\n h = ((th >>> 19) | (tl << (32-19))) ^ ((tl >>> (61-32)) | (th << (32-(61-32)))) ^ (th >>> 6);\n l = ((tl >>> 19) | (th << (32-19))) ^ ((th >>> (61-32)) | (tl << (32-(61-32)))) ^ ((tl >>> 6) | (th << (32-6)));\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n wh[j] = (c & 0xffff) | (d << 16);\n wl[j] = (a & 0xffff) | (b << 16);\n }\n }\n }\n\n // add\n h = ah0;\n l = al0;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[0];\n l = hl[0];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[0] = ah0 = (c & 0xffff) | (d << 16);\n hl[0] = al0 = (a & 0xffff) | (b << 16);\n\n h = ah1;\n l = al1;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[1];\n l = hl[1];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[1] = ah1 = (c & 0xffff) | (d << 16);\n hl[1] = al1 = (a & 0xffff) | (b << 16);\n\n h = ah2;\n l = al2;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[2];\n l = hl[2];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[2] = ah2 = (c & 0xffff) | (d << 16);\n hl[2] = al2 = (a & 0xffff) | (b << 16);\n\n h = ah3;\n l = al3;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[3];\n l = hl[3];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[3] = ah3 = (c & 0xffff) | (d << 16);\n hl[3] = al3 = (a & 0xffff) | (b << 16);\n\n h = ah4;\n l = al4;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[4];\n l = hl[4];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[4] = ah4 = (c & 0xffff) | (d << 16);\n hl[4] = al4 = (a & 0xffff) | (b << 16);\n\n h = ah5;\n l = al5;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[5];\n l = hl[5];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[5] = ah5 = (c & 0xffff) | (d << 16);\n hl[5] = al5 = (a & 0xffff) | (b << 16);\n\n h = ah6;\n l = al6;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[6];\n l = hl[6];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[6] = ah6 = (c & 0xffff) | (d << 16);\n hl[6] = al6 = (a & 0xffff) | (b << 16);\n\n h = ah7;\n l = al7;\n\n a = l & 0xffff; b = l >>> 16;\n c = h & 0xffff; d = h >>> 16;\n\n h = hh[7];\n l = hl[7];\n\n a += l & 0xffff; b += l >>> 16;\n c += h & 0xffff; d += h >>> 16;\n\n b += a >>> 16;\n c += b >>> 16;\n d += c >>> 16;\n\n hh[7] = ah7 = (c & 0xffff) | (d << 16);\n hl[7] = al7 = (a & 0xffff) | (b << 16);\n\n pos += 128;\n n -= 128;\n }\n\n return n;\n}\n\nfunction crypto_hash(out, m, n) {\n var hh = new Int32Array(8),\n hl = new Int32Array(8),\n x = new Uint8Array(256),\n i, b = n;\n\n hh[0] = 0x6a09e667;\n hh[1] = 0xbb67ae85;\n hh[2] = 0x3c6ef372;\n hh[3] = 0xa54ff53a;\n hh[4] = 0x510e527f;\n hh[5] = 0x9b05688c;\n hh[6] = 0x1f83d9ab;\n hh[7] = 0x5be0cd19;\n\n hl[0] = 0xf3bcc908;\n hl[1] = 0x84caa73b;\n hl[2] = 0xfe94f82b;\n hl[3] = 0x5f1d36f1;\n hl[4] = 0xade682d1;\n hl[5] = 0x2b3e6c1f;\n hl[6] = 0xfb41bd6b;\n hl[7] = 0x137e2179;\n\n crypto_hashblocks_hl(hh, hl, m, n);\n n %= 128;\n\n for (i = 0; i < n; i++) x[i] = m[b-n+i];\n x[n] = 128;\n\n n = 256-128*(n<112?1:0);\n x[n-9] = 0;\n ts64(x, n-8, (b / 0x20000000) | 0, b << 3);\n crypto_hashblocks_hl(hh, hl, x, n);\n\n for (i = 0; i < 8; i++) ts64(out, 8*i, hh[i], hl[i]);\n\n return 0;\n}\n\nfunction add(p, q) {\n var a = gf(), b = gf(), c = gf(),\n d = gf(), e = gf(), f = gf(),\n g = gf(), h = gf(), t = gf();\n\n Z(a, p[1], p[0]);\n Z(t, q[1], q[0]);\n M(a, a, t);\n A(b, p[0], p[1]);\n A(t, q[0], q[1]);\n M(b, b, t);\n M(c, p[3], q[3]);\n M(c, c, D2);\n M(d, p[2], q[2]);\n A(d, d, d);\n Z(e, b, a);\n Z(f, d, c);\n A(g, d, c);\n A(h, b, a);\n\n M(p[0], e, f);\n M(p[1], h, g);\n M(p[2], g, f);\n M(p[3], e, h);\n}\n\nfunction cswap(p, q, b) {\n var i;\n for (i = 0; i < 4; i++) {\n sel25519(p[i], q[i], b);\n }\n}\n\nfunction pack(r, p) {\n var tx = gf(), ty = gf(), zi = gf();\n inv25519(zi, p[2]);\n M(tx, p[0], zi);\n M(ty, p[1], zi);\n pack25519(r, ty);\n r[31] ^= par25519(tx) << 7;\n}\n\nfunction scalarmult(p, q, s) {\n var b, i;\n set25519(p[0], gf0);\n set25519(p[1], gf1);\n set25519(p[2], gf1);\n set25519(p[3], gf0);\n for (i = 255; i >= 0; --i) {\n b = (s[(i/8)|0] >> (i&7)) & 1;\n cswap(p, q, b);\n add(q, p);\n add(p, p);\n cswap(p, q, b);\n }\n}\n\nfunction scalarbase(p, s) {\n var q = [gf(), gf(), gf(), gf()];\n set25519(q[0], X);\n set25519(q[1], Y);\n set25519(q[2], gf1);\n M(q[3], X, Y);\n scalarmult(p, q, s);\n}\n\nfunction crypto_sign_keypair(pk, sk, seeded) {\n var d = new Uint8Array(64);\n var p = [gf(), gf(), gf(), gf()];\n var i;\n\n if (!seeded) randombytes(sk, 32);\n crypto_hash(d, sk, 32);\n d[0] &= 248;\n d[31] &= 127;\n d[31] |= 64;\n\n scalarbase(p, d);\n pack(pk, p);\n\n for (i = 0; i < 32; i++) sk[i+32] = pk[i];\n return 0;\n}\n\nvar L = new Float64Array([0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58, 0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0x10]);\n\nfunction modL(r, x) {\n var carry, i, j, k;\n for (i = 63; i >= 32; --i) {\n carry = 0;\n for (j = i - 32, k = i - 12; j < k; ++j) {\n x[j] += carry - 16 * x[i] * L[j - (i - 32)];\n carry = Math.floor((x[j] + 128) / 256);\n x[j] -= carry * 256;\n }\n x[j] += carry;\n x[i] = 0;\n }\n carry = 0;\n for (j = 0; j < 32; j++) {\n x[j] += carry - (x[31] >> 4) * L[j];\n carry = x[j] >> 8;\n x[j] &= 255;\n }\n for (j = 0; j < 32; j++) x[j] -= carry * L[j];\n for (i = 0; i < 32; i++) {\n x[i+1] += x[i] >> 8;\n r[i] = x[i] & 255;\n }\n}\n\nfunction reduce(r) {\n var x = new Float64Array(64), i;\n for (i = 0; i < 64; i++) x[i] = r[i];\n for (i = 0; i < 64; i++) r[i] = 0;\n modL(r, x);\n}\n\n// Note: difference from C - smlen returned, not passed as argument.\nfunction crypto_sign(sm, m, n, sk) {\n var d = new Uint8Array(64), h = new Uint8Array(64), r = new Uint8Array(64);\n var i, j, x = new Float64Array(64);\n var p = [gf(), gf(), gf(), gf()];\n\n crypto_hash(d, sk, 32);\n d[0] &= 248;\n d[31] &= 127;\n d[31] |= 64;\n\n var smlen = n + 64;\n for (i = 0; i < n; i++) sm[64 + i] = m[i];\n for (i = 0; i < 32; i++) sm[32 + i] = d[32 + i];\n\n crypto_hash(r, sm.subarray(32), n+32);\n reduce(r);\n scalarbase(p, r);\n pack(sm, p);\n\n for (i = 32; i < 64; i++) sm[i] = sk[i];\n crypto_hash(h, sm, n + 64);\n reduce(h);\n\n for (i = 0; i < 64; i++) x[i] = 0;\n for (i = 0; i < 32; i++) x[i] = r[i];\n for (i = 0; i < 32; i++) {\n for (j = 0; j < 32; j++) {\n x[i+j] += h[i] * d[j];\n }\n }\n\n modL(sm.subarray(32), x);\n return smlen;\n}\n\nfunction unpackneg(r, p) {\n var t = gf(), chk = gf(), num = gf(),\n den = gf(), den2 = gf(), den4 = gf(),\n den6 = gf();\n\n set25519(r[2], gf1);\n unpack25519(r[1], p);\n S(num, r[1]);\n M(den, num, D);\n Z(num, num, r[2]);\n A(den, r[2], den);\n\n S(den2, den);\n S(den4, den2);\n M(den6, den4, den2);\n M(t, den6, num);\n M(t, t, den);\n\n pow2523(t, t);\n M(t, t, num);\n M(t, t, den);\n M(t, t, den);\n M(r[0], t, den);\n\n S(chk, r[0]);\n M(chk, chk, den);\n if (neq25519(chk, num)) M(r[0], r[0], I);\n\n S(chk, r[0]);\n M(chk, chk, den);\n if (neq25519(chk, num)) return -1;\n\n if (par25519(r[0]) === (p[31]>>7)) Z(r[0], gf0, r[0]);\n\n M(r[3], r[0], r[1]);\n return 0;\n}\n\nfunction crypto_sign_open(m, sm, n, pk) {\n var i;\n var t = new Uint8Array(32), h = new Uint8Array(64);\n var p = [gf(), gf(), gf(), gf()],\n q = [gf(), gf(), gf(), gf()];\n\n if (n < 64) return -1;\n\n if (unpackneg(q, pk)) return -1;\n\n for (i = 0; i < n; i++) m[i] = sm[i];\n for (i = 0; i < 32; i++) m[i+32] = pk[i];\n crypto_hash(h, m, n);\n reduce(h);\n scalarmult(p, q, h);\n\n scalarbase(q, sm.subarray(32));\n add(p, q);\n pack(t, p);\n\n n -= 64;\n if (crypto_verify_32(sm, 0, t, 0)) {\n for (i = 0; i < n; i++) m[i] = 0;\n return -1;\n }\n\n for (i = 0; i < n; i++) m[i] = sm[i + 64];\n return n;\n}\n\nvar crypto_secretbox_KEYBYTES = 32,\n crypto_secretbox_NONCEBYTES = 24,\n crypto_secretbox_ZEROBYTES = 32,\n crypto_secretbox_BOXZEROBYTES = 16,\n crypto_scalarmult_BYTES = 32,\n crypto_scalarmult_SCALARBYTES = 32,\n crypto_box_PUBLICKEYBYTES = 32,\n crypto_box_SECRETKEYBYTES = 32,\n crypto_box_BEFORENMBYTES = 32,\n crypto_box_NONCEBYTES = crypto_secretbox_NONCEBYTES,\n crypto_box_ZEROBYTES = crypto_secretbox_ZEROBYTES,\n crypto_box_BOXZEROBYTES = crypto_secretbox_BOXZEROBYTES,\n crypto_sign_BYTES = 64,\n crypto_sign_PUBLICKEYBYTES = 32,\n crypto_sign_SECRETKEYBYTES = 64,\n crypto_sign_SEEDBYTES = 32,\n crypto_hash_BYTES = 64;\n\nnacl.lowlevel = {\n crypto_core_hsalsa20: crypto_core_hsalsa20,\n crypto_stream_xor: crypto_stream_xor,\n crypto_stream: crypto_stream,\n crypto_stream_salsa20_xor: crypto_stream_salsa20_xor,\n crypto_stream_salsa20: crypto_stream_salsa20,\n crypto_onetimeauth: crypto_onetimeauth,\n crypto_onetimeauth_verify: crypto_onetimeauth_verify,\n crypto_verify_16: crypto_verify_16,\n crypto_verify_32: crypto_verify_32,\n crypto_secretbox: crypto_secretbox,\n crypto_secretbox_open: crypto_secretbox_open,\n crypto_scalarmult: crypto_scalarmult,\n crypto_scalarmult_base: crypto_scalarmult_base,\n crypto_box_beforenm: crypto_box_beforenm,\n crypto_box_afternm: crypto_box_afternm,\n crypto_box: crypto_box,\n crypto_box_open: crypto_box_open,\n crypto_box_keypair: crypto_box_keypair,\n crypto_hash: crypto_hash,\n crypto_sign: crypto_sign,\n crypto_sign_keypair: crypto_sign_keypair,\n crypto_sign_open: crypto_sign_open,\n\n crypto_secretbox_KEYBYTES: crypto_secretbox_KEYBYTES,\n crypto_secretbox_NONCEBYTES: crypto_secretbox_NONCEBYTES,\n crypto_secretbox_ZEROBYTES: crypto_secretbox_ZEROBYTES,\n crypto_secretbox_BOXZEROBYTES: crypto_secretbox_BOXZEROBYTES,\n crypto_scalarmult_BYTES: crypto_scalarmult_BYTES,\n crypto_scalarmult_SCALARBYTES: crypto_scalarmult_SCALARBYTES,\n crypto_box_PUBLICKEYBYTES: crypto_box_PUBLICKEYBYTES,\n crypto_box_SECRETKEYBYTES: crypto_box_SECRETKEYBYTES,\n crypto_box_BEFORENMBYTES: crypto_box_BEFORENMBYTES,\n crypto_box_NONCEBYTES: crypto_box_NONCEBYTES,\n crypto_box_ZEROBYTES: crypto_box_ZEROBYTES,\n crypto_box_BOXZEROBYTES: crypto_box_BOXZEROBYTES,\n crypto_sign_BYTES: crypto_sign_BYTES,\n crypto_sign_PUBLICKEYBYTES: crypto_sign_PUBLICKEYBYTES,\n crypto_sign_SECRETKEYBYTES: crypto_sign_SECRETKEYBYTES,\n crypto_sign_SEEDBYTES: crypto_sign_SEEDBYTES,\n crypto_hash_BYTES: crypto_hash_BYTES,\n\n gf: gf,\n D: D,\n L: L,\n pack25519: pack25519,\n unpack25519: unpack25519,\n M: M,\n A: A,\n S: S,\n Z: Z,\n pow2523: pow2523,\n add: add,\n set25519: set25519,\n modL: modL,\n scalarmult: scalarmult,\n scalarbase: scalarbase,\n};\n\n/* High-level API */\n\nfunction checkLengths(k, n) {\n if (k.length !== crypto_secretbox_KEYBYTES) throw new Error('bad key size');\n if (n.length !== crypto_secretbox_NONCEBYTES) throw new Error('bad nonce size');\n}\n\nfunction checkBoxLengths(pk, sk) {\n if (pk.length !== crypto_box_PUBLICKEYBYTES) throw new Error('bad public key size');\n if (sk.length !== crypto_box_SECRETKEYBYTES) throw new Error('bad secret key size');\n}\n\nfunction checkArrayTypes() {\n for (var i = 0; i < arguments.length; i++) {\n if (!(arguments[i] instanceof Uint8Array))\n throw new TypeError('unexpected type, use Uint8Array');\n }\n}\n\nfunction cleanup(arr) {\n for (var i = 0; i < arr.length; i++) arr[i] = 0;\n}\n\nnacl.randomBytes = function(n) {\n var b = new Uint8Array(n);\n randombytes(b, n);\n return b;\n};\n\nnacl.secretbox = function(msg, nonce, key) {\n checkArrayTypes(msg, nonce, key);\n checkLengths(key, nonce);\n var m = new Uint8Array(crypto_secretbox_ZEROBYTES + msg.length);\n var c = new Uint8Array(m.length);\n for (var i = 0; i < msg.length; i++) m[i+crypto_secretbox_ZEROBYTES] = msg[i];\n crypto_secretbox(c, m, m.length, nonce, key);\n return c.subarray(crypto_secretbox_BOXZEROBYTES);\n};\n\nnacl.secretbox.open = function(box, nonce, key) {\n checkArrayTypes(box, nonce, key);\n checkLengths(key, nonce);\n var c = new Uint8Array(crypto_secretbox_BOXZEROBYTES + box.length);\n var m = new Uint8Array(c.length);\n for (var i = 0; i < box.length; i++) c[i+crypto_secretbox_BOXZEROBYTES] = box[i];\n if (c.length < 32) return null;\n if (crypto_secretbox_open(m, c, c.length, nonce, key) !== 0) return null;\n return m.subarray(crypto_secretbox_ZEROBYTES);\n};\n\nnacl.secretbox.keyLength = crypto_secretbox_KEYBYTES;\nnacl.secretbox.nonceLength = crypto_secretbox_NONCEBYTES;\nnacl.secretbox.overheadLength = crypto_secretbox_BOXZEROBYTES;\n\nnacl.scalarMult = function(n, p) {\n checkArrayTypes(n, p);\n if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');\n if (p.length !== crypto_scalarmult_BYTES) throw new Error('bad p size');\n var q = new Uint8Array(crypto_scalarmult_BYTES);\n crypto_scalarmult(q, n, p);\n return q;\n};\n\nnacl.scalarMult.base = function(n) {\n checkArrayTypes(n);\n if (n.length !== crypto_scalarmult_SCALARBYTES) throw new Error('bad n size');\n var q = new Uint8Array(crypto_scalarmult_BYTES);\n crypto_scalarmult_base(q, n);\n return q;\n};\n\nnacl.scalarMult.scalarLength = crypto_scalarmult_SCALARBYTES;\nnacl.scalarMult.groupElementLength = crypto_scalarmult_BYTES;\n\nnacl.box = function(msg, nonce, publicKey, secretKey) {\n var k = nacl.box.before(publicKey, secretKey);\n return nacl.secretbox(msg, nonce, k);\n};\n\nnacl.box.before = function(publicKey, secretKey) {\n checkArrayTypes(publicKey, secretKey);\n checkBoxLengths(publicKey, secretKey);\n var k = new Uint8Array(crypto_box_BEFORENMBYTES);\n crypto_box_beforenm(k, publicKey, secretKey);\n return k;\n};\n\nnacl.box.after = nacl.secretbox;\n\nnacl.box.open = function(msg, nonce, publicKey, secretKey) {\n var k = nacl.box.before(publicKey, secretKey);\n return nacl.secretbox.open(msg, nonce, k);\n};\n\nnacl.box.open.after = nacl.secretbox.open;\n\nnacl.box.keyPair = function() {\n var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);\n var sk = new Uint8Array(crypto_box_SECRETKEYBYTES);\n crypto_box_keypair(pk, sk);\n return {publicKey: pk, secretKey: sk};\n};\n\nnacl.box.keyPair.fromSecretKey = function(secretKey) {\n checkArrayTypes(secretKey);\n if (secretKey.length !== crypto_box_SECRETKEYBYTES)\n throw new Error('bad secret key size');\n var pk = new Uint8Array(crypto_box_PUBLICKEYBYTES);\n crypto_scalarmult_base(pk, secretKey);\n return {publicKey: pk, secretKey: new Uint8Array(secretKey)};\n};\n\nnacl.box.publicKeyLength = crypto_box_PUBLICKEYBYTES;\nnacl.box.secretKeyLength = crypto_box_SECRETKEYBYTES;\nnacl.box.sharedKeyLength = crypto_box_BEFORENMBYTES;\nnacl.box.nonceLength = crypto_box_NONCEBYTES;\nnacl.box.overheadLength = nacl.secretbox.overheadLength;\n\nnacl.sign = function(msg, secretKey) {\n checkArrayTypes(msg, secretKey);\n if (secretKey.length !== crypto_sign_SECRETKEYBYTES)\n throw new Error('bad secret key size');\n var signedMsg = new Uint8Array(crypto_sign_BYTES+msg.length);\n crypto_sign(signedMsg, msg, msg.length, secretKey);\n return signedMsg;\n};\n\nnacl.sign.open = function(signedMsg, publicKey) {\n checkArrayTypes(signedMsg, publicKey);\n if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)\n throw new Error('bad public key size');\n var tmp = new Uint8Array(signedMsg.length);\n var mlen = crypto_sign_open(tmp, signedMsg, signedMsg.length, publicKey);\n if (mlen < 0) return null;\n var m = new Uint8Array(mlen);\n for (var i = 0; i < m.length; i++) m[i] = tmp[i];\n return m;\n};\n\nnacl.sign.detached = function(msg, secretKey) {\n var signedMsg = nacl.sign(msg, secretKey);\n var sig = new Uint8Array(crypto_sign_BYTES);\n for (var i = 0; i < sig.length; i++) sig[i] = signedMsg[i];\n return sig;\n};\n\nnacl.sign.detached.verify = function(msg, sig, publicKey) {\n checkArrayTypes(msg, sig, publicKey);\n if (sig.length !== crypto_sign_BYTES)\n throw new Error('bad signature size');\n if (publicKey.length !== crypto_sign_PUBLICKEYBYTES)\n throw new Error('bad public key size');\n var sm = new Uint8Array(crypto_sign_BYTES + msg.length);\n var m = new Uint8Array(crypto_sign_BYTES + msg.length);\n var i;\n for (i = 0; i < crypto_sign_BYTES; i++) sm[i] = sig[i];\n for (i = 0; i < msg.length; i++) sm[i+crypto_sign_BYTES] = msg[i];\n return (crypto_sign_open(m, sm, sm.length, publicKey) >= 0);\n};\n\nnacl.sign.keyPair = function() {\n var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);\n var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);\n crypto_sign_keypair(pk, sk);\n return {publicKey: pk, secretKey: sk};\n};\n\nnacl.sign.keyPair.fromSecretKey = function(secretKey) {\n checkArrayTypes(secretKey);\n if (secretKey.length !== crypto_sign_SECRETKEYBYTES)\n throw new Error('bad secret key size');\n var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);\n for (var i = 0; i < pk.length; i++) pk[i] = secretKey[32+i];\n return {publicKey: pk, secretKey: new Uint8Array(secretKey)};\n};\n\nnacl.sign.keyPair.fromSeed = function(seed) {\n checkArrayTypes(seed);\n if (seed.length !== crypto_sign_SEEDBYTES)\n throw new Error('bad seed size');\n var pk = new Uint8Array(crypto_sign_PUBLICKEYBYTES);\n var sk = new Uint8Array(crypto_sign_SECRETKEYBYTES);\n for (var i = 0; i < 32; i++) sk[i] = seed[i];\n crypto_sign_keypair(pk, sk, true);\n return {publicKey: pk, secretKey: sk};\n};\n\nnacl.sign.publicKeyLength = crypto_sign_PUBLICKEYBYTES;\nnacl.sign.secretKeyLength = crypto_sign_SECRETKEYBYTES;\nnacl.sign.seedLength = crypto_sign_SEEDBYTES;\nnacl.sign.signatureLength = crypto_sign_BYTES;\n\nnacl.hash = function(msg) {\n checkArrayTypes(msg);\n var h = new Uint8Array(crypto_hash_BYTES);\n crypto_hash(h, msg, msg.length);\n return h;\n};\n\nnacl.hash.hashLength = crypto_hash_BYTES;\n\nnacl.verify = function(x, y) {\n checkArrayTypes(x, y);\n // Zero length arguments are considered not equal.\n if (x.length === 0 || y.length === 0) return false;\n if (x.length !== y.length) return false;\n return (vn(x, 0, y, 0, x.length) === 0) ? true : false;\n};\n\nnacl.setPRNG = function(fn) {\n randombytes = fn;\n};\n\n(function() {\n // Initialize PRNG if environment provides CSPRNG.\n // If not, methods calling randombytes will throw.\n var crypto = typeof self !== 'undefined' ? (self.crypto || self.msCrypto) : null;\n if (crypto && crypto.getRandomValues) {\n // Browsers.\n var QUOTA = 65536;\n nacl.setPRNG(function(x, n) {\n var i, v = new Uint8Array(n);\n for (i = 0; i < n; i += QUOTA) {\n crypto.getRandomValues(v.subarray(i, i + Math.min(n - i, QUOTA)));\n }\n for (i = 0; i < n; i++) x[i] = v[i];\n cleanup(v);\n });\n } else if (typeof require !== 'undefined') {\n // Node.js.\n crypto = require('crypto');\n if (crypto && crypto.randomBytes) {\n nacl.setPRNG(function(x, n) {\n var i, v = crypto.randomBytes(n);\n for (i = 0; i < n; i++) x[i] = v[i];\n cleanup(v);\n });\n }\n }\n})();\n\n})(typeof module !== 'undefined' && module.exports ? module.exports : (self.nacl = self.nacl || {}));\n",null,null,null,null,null,null,null,null],"names":["base64Js","b64","lens","getLens","validLen","placeHoldersLen","toByteArray_1","toByteArray","tmp","i","arr","Arr","_byteLength","curByte","len","revLookup","charCodeAt","fromByteArray_1","fromByteArray","uint8","length","extraBytes","parts","maxChunkLength","len2","push","encodeChunk","lookup","join","Uint8Array","Array","code","Error","indexOf","start","end","num","output","ieee754","buffer","offset","isLE","mLen","nBytes","e","m","eLen","eMax","eBias","nBits","d","s","NaN","Infinity","Math","pow","value","c","rt","abs","isNaN","floor","log","LN2","base64","require$$0","require$$1","customInspectSymbol","Symbol","exports","Buffer","SlowBuffer","alloc","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","RangeError","buf","Object","setPrototypeOf","prototype","arg","encodingOrOffset","TypeError","allocUnsafe","from","string","encoding","isEncoding","byteLength","actual","write","slice","fromString","ArrayBuffer","isView","arrayView","isInstance","copy","fromArrayBuffer","byteOffset","fromArrayLike","fromArrayView","SharedArrayBuffer","valueOf","b","obj","isBuffer","checked","undefined","numberIsNaN","type","isArray","data","fromObject","toPrimitive","assertSize","size","array","toString","mustMatch","arguments","loweredCase","utf8ToBytes","base64ToBytes","toLowerCase","slowToString","this","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","n","bidirectionalIndexOf","val","dir","arrayIndexOf","call","lastIndexOf","indexSize","arrLength","valLength","String","read","readUInt16BE","foundIndex","found","j","hexWrite","Number","remaining","strLen","parsed","parseInt","substr","utf8Write","blitBuffer","asciiWrite","str","byteArray","asciiToBytes","base64Write","ucs2Write","units","hi","lo","utf16leToBytes","min","res","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","codePoints","MAX_ARGUMENTS_LENGTH","fromCharCode","apply","decodeCodePointsArray","kMaxLength","TYPED_ARRAY_SUPPORT","proto","foo","typedArraySupport","console","error","defineProperty","enumerable","get","poolSize","fill","allocUnsafeSlow","_isBuffer","compare","a","x","y","concat","list","pos","set","swap16","swap32","swap64","toLocaleString","equals","inspect","max","replace","trim","target","thisStart","thisEnd","thisCopy","targetCopy","includes","isFinite","toJSON","_arr","ret","out","hexSliceLookupTable","bytes","checkOffset","ext","checkInt","wrtBigUInt64LE","checkIntBI","BigInt","wrtBigUInt64BE","checkIEEE754","writeFloat","littleEndian","noAssert","writeDouble","newBuf","subarray","readUintLE","readUIntLE","mul","readUintBE","readUIntBE","readUint8","readUInt8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readUInt32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","first","last","boundsError","readBigUInt64BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readBigInt64LE","readBigInt64BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUintLE","writeUIntLE","writeUintBE","writeUIntBE","writeUint8","writeUInt8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUInt16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeUInt32BE","writeBigUInt64LE","writeBigUInt64BE","writeIntLE","limit","sub","writeIntBE","writeInt8","writeInt16LE","writeInt16BE","writeInt32LE","writeInt32BE","writeBigInt64LE","writeBigInt64BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","errors","E","sym","getMessage","Base","constructor","super","writable","configurable","name","stack","message","addNumericalSeparator","range","ERR_OUT_OF_RANGE","checkBounds","ERR_INVALID_ARG_TYPE","ERR_BUFFER_OUT_OF_BOUNDS","input","msg","received","isInteger","INVALID_BASE64_RE","leadSurrogate","split","base64clean","src","dst","alphabet","table","i16","fn","BufferBigIntNotDefined","TOKEN_PROGRAM_ID","PublicKey","ASSOCIATED_TOKEN_PROGRAM_ID","Layout_1","constant","utf8","cstr","blob","unionLayoutDiscriminator","union","seq","bits","struct","f64be","f64","f32be","f32","ns64be","s48be","s40be","s32be","s24be","s16be","ns64","s48","s40","s32","s24","buffer_1","checkUint8Array","uint8ArrayToBuffer","Layout","span","property","replicate","rv","create","assign","fromArray","values","nameWithProperty","bindConstructorLayout","Class","layout","hasOwnProperty","layout_","boundConstructor_","makeDestinationObject","encode","decode","isCount","GreedyCount","ExternalLayout","elementSpan","rem","OffsetLayout","UInt","UIntBE","IntBE","V2E32","divmodInt64","hi32","lo32","NearUInt64","roundedInt64","NearUInt64BE","NearInt64","NearInt64BE","Float","FloatBE","Double","DoubleBE","Sequence","elementLayout","count","idx","getSpan","elo","reduce","v","Structure","fields","decodePrefixes","acc","fd","fsp","dest","firstOffset","lastOffset","lastWrote","fv","shift","layoutFor","offsetOf","UnionLayoutDiscriminator","UnionDiscriminator","discr","defaultLayout","discriminator","configGetSourceVariant","gsv","boundGetSourceVariant","bind","vlo","getVariant","defaultGetSourceVariant","registry","tag","dlo","clo","usesPrefixDiscriminator","contentOffset","getSourceVariant","addVariant","variant","VariantLayout","vb","Union","fixBitwiseResult","BitStructure","word","msb","_packedSetValue","_packedGetValue","addField","bf","BitField","addBoolean","Boolean","fieldFor","container","usedBits","sum","totalBits","valueMask","wordMask","wordValue","srcBuffer","CString","srcb","maxSpan","encodeDecode","browser","toBigIntLE_1","toBigIntLE","reversed","reverse","hex","toBigIntBE","toBufferLE_1","toBufferLE","width","padStart","toBufferBE","u64","bigIntLayout","bigInt","bool","u8","boolLayout","publicKey","publicKeyLayout","toBuffer","TokenError","TokenAccountNotFoundError","TokenInvalidAccountOwnerError","TokenInvalidAccountSizeError","TokenInvalidMintError","TokenOwnerOffCurveError","AccountType","ACCOUNT_TYPE_SIZE","MULTISIG_SIZE","AccountState","AccountLayout","u32","ACCOUNT_SIZE","MintLayout","MINT_SIZE","async","getMint","connection","address","commitment","programId","info","owner","rawMint","tlvData","Mint","mintAuthority","mintAuthorityOption","supply","decimals","isInitialized","freezeAuthority","freezeAuthorityOption","unpackMint","getAccountInfo","getAssociatedTokenAddressSync","mint","allowOwnerOffCurve","associatedTokenProgramId","isOnCurve","findProgramAddressSync","createAssociatedTokenAccountInstruction","payer","associatedToken","instructionData","keys","pubkey","isSigner","isWritable","SystemProgram","TransactionInstruction","buildAssociatedTokenAccountInstruction","module","assert","inherits","ctor","superCtor","super_","TempCtor","BN","number","base","endian","isBN","negative","words","red","_init","wordSize","window","parseHex4Bits","index","parseHexByte","lowerBound","r","parseBase","move","left","right","cmp","_initNumber","_initArray","_parseHex","_parseBase","toArray","ceil","w","off","_strip","limbLen","limbPow","total","mod","imuln","_iaddn","_move","clone","_expand","_normSign","for","zeros","groupSizes","groupBases","smallMulTo","self","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modrn","idivn","toNumber","toArrayLike","ArrayType","reqLength","allocate","_toArrayLikeLE","position","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","zeroBits","toTwos","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","mulTo","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","p","modn","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","strip","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","ErrorType","SNSError","captureStackTrace","Numberu32","U32Overflow","zeroPad","fromBuffer","InvalidBufferLength","map","Numberu64","U64Overflow","copyProps","key","SafeBuffer","_Buffer","ALPHABET","BASE_MAP","charAt","xc","BASE","LEADER","FACTOR","iFACTOR","decodeUnsafe","source","psz","zeroes","b256","it3","it4","vch","pbegin","pend","b58","it1","it2","repeat","bs58","inRange","ToDictionary","Stream","tokens","endOfStream","prepend","token","unshift","pop","finished","decoderError","fatal","opt_code_point","DEFAULT_ENCODING","TextDecoder","options","_streaming","_BOMseen","_decoder","_fatal","_ignoreBOM","TextEncoder","_encoder","_options","UTF8Decoder","utf8_code_point","utf8_bytes_seen","utf8_bytes_needed","utf8_lower_boundary","utf8_upper_boundary","handler","stream","bite","code_point","UTF8Encoder","temp","result","input_stream","code_points","cp","codePointsToString","opt_string","stringToCodePoints","__createBinding","k2","__setModuleDefault","__decorate","decorators","desc","getOwnPropertyDescriptor","Reflect","decorate","__importStar","__esModule","__importDefault","default","lib","deserializeUnchecked_1","deserializeUnchecked","deserialize_1","deserialize","serialize_1","serialize","BinaryWriter","BorshError","baseDecode","bn_js_1","bs58_1","require$$2","textDecoder","baseEncode","INITIAL_LENGTH","fieldPath","originalMessage","addToFieldPath","fieldName","splice","maybeResize","writeU8","writeU16","writeU32","writeU64","writeBuffer","writeU128","writeU256","writeU512","writeString","writeFixedArray","writeArray","elem","handlingRangeError","propertyKey","propertyDescriptor","originalMethod","args","BinaryReader","readU8","readU16","readU32","readU64","readBuffer","readU128","readU256","readU512","readString","readFixedArray","readArray","capitalizeFirstLetter","toUpperCase","serializeField","schema","fieldType","writer","item","kind","forEach","serializeStruct","borshSerialize","structSchema","field","Writer","deserializeField","reader","Map","deserializeStruct","classType","borshDeserialize","Reader","createInstruction","nameProgramId","systemProgramId","nameKey","nameOwnerKey","payerKey","hashed_name","lamports","space","nameClassKey","nameParent","nameParentOwner","buffers","Int8Array","updateInstruction","nameAccountKey","input_data","nameUpdateSigner","transferInstruction","newOwnerKey","currentNameOwnerKey","parentOwner","deleteInstruction","refundTargetKey","createV2Instruction","getInstruction","rentSysvarAccount","rootDomain","nameAccount","reverseLookupAccount","centralState","buyer","buyerTokenAccount","usdcVault","state","createReverseInstruction","namingServiceProgram","reverseLookup","systemProgram","feePayer","rentSysvar","parentName","parentNameOwner","createInstructionV3","referrerIdxOpt","buyerTokenSource","pythMappingAcc","pythProductAcc","pythPriceAcc","vault","splTokenProgram","referrerAccountOpt","createWithNftInstruction","nftSource","nftMetadata","nftMint","masterEdition","collection","mplTokenMetadata","burnInstruction","nameServiceId","domain","resellingState","NAME_TOKENIZER_ID","MINT_PREFIX","Tag","NftRecord","nonce","retrieve","accountInfo","findKey","findProgramAddress","retrieveNftOwner","filters","memcmp","toBase58","dataSize","getProgramAccounts","account","getFilter","closure","record","getRecordFromMint","retrieveRecords","tokenAccs","promises","Promise","all","filter","NameRegistryState","class","AccountDoesNotExist","_a","HEADER_LEN","nftOwner","_retrieveBatch","nameAccountKeys","nameAccounts","getMultipleAccountsInfo","retrieveBatch","minimalisticAssert","equal","l","inherits_browserModule","isSurrogatePair","htonl","zero2","zero8","utils","enc","toHex","toHex32","join32","split32","rotr32","rotl32","sum32","sum32_3","sum32_4","sum32_5","sum64","ah","al","bh","sum64_hi","bl","sum64_lo","sum64_4_hi","ch","cl","dh","dl","sum64_4_lo","sum64_5_hi","eh","el","sum64_5_lo","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","BlockHash","pending","pendingTotal","blockSize","outSize","hmacStrength","padLength","_delta8","_delta32","common","update","_update","digest","_pad","_digest","ch32","maj32","p32","ft_1","s0_256","s1_256","g0_256","g1_256","shaCommon","sha1_K","SHA1","W","_1","require$$3","sha256_K","SHA256","_256","f","T1","T2","SHA224","_224","sha512_K","SHA512","_512","ch64_hi","xh","xl","yh","yl","zh","ch64_lo","zl","maj64_hi","maj64_lo","s0_512_hi","s0_512_lo","s1_512_hi","s1_512_lo","g0_512_hi","g0_512_lo","g1_512_hi","g1_512_lo","_prepareBlock","c0_hi","c0_lo","c1_hi","c1_lo","c2_hi","c2_lo","c3_hi","c3_lo","fh","fl","gh","gl","hh","hl","c4_hi","c4_lo","T1_hi","T1_lo","T2_hi","T2_lo","SHA384","_384","sha","sha1","sha224","sha256","sha384","sha512","require$$4","RIPEMD160","K","Kh","ripemd","ripemd160","Ah","Bh","Ch","Dh","Eh","T","rh","sh","Hmac","hash","Hash","inner","outer","hmac","_permanentCensorErrors","_censorErrors","LogLevels","debug","warning","_logLevel","_globalLogger","_normalizeError","missing","form","normalize","_checkNormalize","LogLevel","ErrorCode","HEX","Logger","version","_log","logLevel","level","throwArgumentError","levels","DEBUG","INFO","warn","WARNING","makeError","params","UNKNOWN_ERROR","messageDetails","JSON","stringify","reason","url","NUMERIC_FAULT","fault","CALL_EXCEPTION","INSUFFICIENT_FUNDS","MISSING_NEW","NONCE_EXPIRED","REPLACEMENT_UNDERPRICED","TRANSACTION_REPLACED","UNPREDICTABLE_GAS_LIMIT","throwError","INVALID_ARGUMENT","argument","condition","assertArgument","checkNormalize","UNSUPPORTED_OPERATION","operation","checkSafeUint53","checkArgumentCount","expectedCount","MISSING_ARGUMENT","UNEXPECTED_ARGUMENT","checkNew","checkAbstract","globalLogger","setCensorship","censorship","permanent","setLogLevel","logger","addSlice","arrayify","allowMissingPrefix","substring","toHexString","isHexable","match","isHexString","hexPad","isBytes","NAME_PROGRAM_ID","HASH_PREFIX","ROOT_DOMAIN_ACCOUNT","REGISTER_PROGRAM_ID","PYTH_FIDA_PRICE_ACC","BONFIDA_FIDA_BNB","REVERSE_LOOKUP_CLASS","TWITTER_VERIFICATION_AUTHORITY","TWITTER_ROOT_PARENT_REGISTRY_KEY","BONFIDA_USDC_BNB","USDC_MINT","REFERRERS","TOKENS_SYM_MINT","PYTH_MAPPING_ACC","VAULT_OWNER","CUSTOM_BG_TLD","WOLVES_COLLECTION_METADATA","METAPLEX_ID","getNameOwner","getHashedName","getNameAccountKey","nameClass","seeds","_derive","parent","hashed","getDomainKey","endsWith","splitted","parentKey","isSub","subKey","recordPrefix","isSubRecord","InvalidInput","readBig","expected","__assign","__awaiter","thisArg","_arguments","P","generator","resolve","reject","fulfilled","step","rejected","done","then","__generator","body","_","label","sent","trys","ops","verb","throw","return","iterator","op","PythConnection_1","PythConnection","index_1","pythProgramKey","feedIds","productAccountKeyToProduct","priceAccountKeyToProductAccountKey","callbacks","handleProductAccount","slot","productData","parseProductData","priceAccountKey","handlePriceAccount","productUpdate","priceData","parsePriceData","priceUpdate","_i","callback","handleAccount","productOnly","parseBaseData","Mapping","Product","Price","Test","Permission","accSlotProm","accounts","currentSlot","accounts_1","rawIDs_1","_loop_1","this_1","accounts_2","_this","_b","getSlot","feed","onAccountChange","context","onProgramAccountChange","keyedAccountInfo","accountId","onPriceChange","product","price","onPriceChangeVerbose","stop","PythHttpClient_1","PythHttpClient","getData","assetTypes","productSymbols","products","productFromSymbol","productPrice","prices","accountList","priceDataQueue","permissionData","Set","singleAccount","asset_type","symbol","parsePermissionData","productAccountKey","symbols","getAssetPricesFromAccounts","priceAccounts","priceDatas","accountInfos","accInfo","baseData","UPPERCASE","LOWERCASE","LEADING_CAPITAL","IDENTIFIER","SEPARATORS","LEADING_SEPARATORS","RegExp","SEPARATORS_AND_IDENTIFIER","NUMBERS_AND_IDENTIFIER","camelCase","pascalCase","preserveConsecutiveUppercase","locale","toLocaleLowerCase","toLocaleUpperCase","preserveCamelCase","isLastCharLower","isLastCharUpper","isLastLastCharUpper","character","test","lastIndex","m1","postProcess","identifier","camelcaseModule","Int","upv","Blob","UTF8","Constant","exists","instance","checkFinished","destroyed","lengths","outputLen","greedy","u16","u24","u40","u48","nu64","u16be","u24be","u32be","u40be","u48be","nu64be","s8","s16","const","commonjsHelpers","rustEnum","vecU8","tagged","vec","option","i256","u256","i128","u128","i64","i32","i8","buffer_layout_1","web3_js_1","buffer_layout_2","signed","BNLayout","WrappedLayout","decoder","encoder","decodeBool","encodeBool","OptionLayout","u8a","createView","DataView","rotr","Uint32Array","toBytes","_cloneInto","wrapConstructor","hashCons","hashC","blockLen","SHA2","padOffset","view","take","process","dataView","roundClean","digestInto","setBigUint64","_32n","_u32_max","wh","wl","setUint32","oview","destroy","to","Chi","Maj","SHA256_K","IV","SHA256_W","F","G","H","getUint32","W15","W2","s0","s1","zero$1","LITERALS$1","L_CODES$1","D_CODES$1","MAX_BITS$1","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","_dist_code","_length_code","MAX_MATCH$1","base_length","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","static_l_desc","static_d_desc","static_bl_desc","TreeDesc","dyn_tree","stat_desc","max_code","d_code","dist","put_short","pending_buf","send_bits","bi_valid","bi_buf","send_code","tree","bi_reverse","gen_codes","bl_count","next_code","init_block","dyn_ltree","dyn_dtree","bl_tree","END_BLOCK","opt_len","static_len","sym_next","matches","bi_windup","smaller","depth","_n2","_m2","pqdownheap","heap","heap_len","compress_block","ltree","dtree","lc","extra","sx","sym_buf","build_tree","stree","node","heap_max","gen_bitlen","xbits","overflow","scan_tree","curlen","prevlen","nextlen","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","_tr_stored_block$1","stored_len","_tr_init_1","tr_static_init","LENGTH_CODES$1","l_desc","d_desc","bl_desc","_tr_flush_block_1","_tr_flush_block$1","opt_lenb","static_lenb","max_blindex","strm","data_type","block_mask","detect_data_type","BL_CODES$1","build_bl_tree","strategy","send_all_trees","lcodes","dcodes","blcodes","rank","_tr_tally_1","_tr_tally$1","sym_end","_tr_align_1","STATIC_TREES","bi_flush","trees","_tr_init","_tr_stored_block","_tr_flush_block","_tr_tally","_tr_align","adler32_1","adler32","adler","s2","crcTable","makeTable","crc32_1","crc32","crc","messages","constants$2","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","Z_TREES","Z_OK","Z_STREAM_END","Z_NEED_DICT","Z_ERRNO","Z_STREAM_ERROR","Z_DATA_ERROR","Z_MEM_ERROR","Z_BUF_ERROR","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_DEFAULT_COMPRESSION","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","Z_BINARY","Z_TEXT","Z_UNKNOWN","Z_DEFLATED","Z_NO_FLUSH$2","Z_FULL_FLUSH$1","Z_FINISH$3","Z_BLOCK$1","Z_OK$3","Z_STREAM_END$3","Z_STREAM_ERROR$2","Z_DATA_ERROR$2","Z_BUF_ERROR$1","Z_DEFAULT_COMPRESSION$1","Z_DEFAULT_STRATEGY$1","Z_DEFLATED$2","MAX_MATCH","MIN_LOOKAHEAD","INIT_STATE","BUSY_STATE","FINISH_STATE","err","errorCode","zero","slide_hash","wsize","w_size","hash_size","head","HASH","HASH_ZLIB","hash_shift","hash_mask","flush_pending","avail_out","pending_out","next_out","total_out","flush_block_only","block_start","strstart","put_byte","putShortMSB","read_buf","avail_in","next_in","wrap","total_in","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","_w_size","more","window_size","insert","ins_h","deflate_stored","flush","have","min_block","pending_buf_size","used","high_water","deflate_fast","hash_head","bflush","match_length","max_lazy_match","MIN_MATCH","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","func","configuration_table","DeflateState","status","gzhead","gzindex","method","last_flush","w_bits","hash_bits","Uint16Array","HEAP_SIZE","MAX_BITS","lit_bufsize","deflateStateCheck","deflateResetKeep","deflateReset","lm_init","deflateInit2","windowBits","memLevel","deflate_2$1","deflate$2","old_flush","header","level_flags","text","hcrc","comment","time","os","beg","gzhead_extra","bstate","deflate_huff","deflate_rle","deflateSetDictionary_1","deflateSetDictionary","dictionary","dictLength","tmpDict","avail","deflate_1$2","deflateInit","deflateSetHeader","deflate","deflateEnd","deflateInfo","_has","sources","flattenChunks","chunks","chunk","STR_APPLY_UIA_OK","__","_utf8len","strings","string2buf","c2","m_pos","str_len","buf_len","buf2string","utf16buf","c_len","buf2binstring","utf8border","zstream","toString$1","Z_NO_FLUSH$1","Z_FINISH$2","Z_OK$2","Z_STREAM_END$2","Z_DEFLATED$1","Deflate$1","chunkSize","opt","raw","gzip","ended","dict","_dict_set","flush_mode","_flush_mode","onData","onEnd","BAD$1","inffast","_in","_out","dmax","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","from_source","lencode","distcode","lenbits","distbits","top","dolen","dodist","sane","MAXBITS","lbase","lext","dbase","dext","inftrees","inflate_table","lens_index","codes","table_index","work","opts","incr","low","root","curr","drop","huff","offs","here_bits","here_op","here_val","Z_FINISH$1","Z_OK$1","Z_STREAM_END$1","Z_NEED_DICT$1","Z_STREAM_ERROR$1","Z_DATA_ERROR$1","Z_MEM_ERROR$1","HEAD","DICT","TYPE","TYPEDO","COPY_","LEN_","LEN","CHECK","BAD","zswap32","InflateState","havedict","flags","check","wbits","ncode","nlen","ndist","lendyn","distdyn","back","was","inflateStateCheck","inflateResetKeep","Int32Array","inflateReset","inflateReset2","inflateInit2","lenfix","distfix","virgin","fixedtables","updatewindow","inflate_2$1","inflate$2","put","last_bits","last_op","last_val","hbuf","order","inf_leave","xflags","extra_len","inflateEnd_1","inflateGetHeader_1","inflateGetHeader","inflateSetDictionary_1","inflateSetDictionary","dictid","inflate_1$2","inflateInit","inflate","inflateEnd","inflateInfo","gzheader","Inflate$1","inflate$1","inflator","last_avail_out","next_out_utf8","tail","utf8str","inflate_1$1","Inflate","inflateRaw","ungzip","constants","inflate_1","has","prefix","Events","EE","once","addListener","emitter","event","listener","evt","_events","_eventsCount","clearEvent","EventEmitter","__proto__","eventNames","events","names","getOwnPropertySymbols","listeners","handlers","ee","listenerCount","emit","removeListener","on","removeAllListeners","prefixed","isVersionedTransaction","tx","adopt","PythOracleAccountCoder","idl","accountName","ix","decodeUnchecked","_appendData","idlAccount","__spreadArray","il","instructions","PythOracleInstructionCoder","camelcase_1","borsh","idl_1","IdlCoder","anchor_1","fieldLayout","types","defined_1","defined","IdlError","filtered","typeDefLayout","arrayTy","arrayLen","innerLayout","typeDef","fieldLayouts","variants","variantName","ixLayout","parseIxLayout","discriminatorLayouts","ixDiscriminator","discriminatorLength","pythIx","discriminant","encodeState","ixName","methodName","productMetadata","ixLayouts","keyLength","valueLength","coder","PythOracleCoder","events_1","PythOracleEventCoder","instructions_1","state_1","PythOracleStateCoder","_name","_account","_ix","types_1","PythOracleTypesCoder","_type","_typeData","instruction","__exportStar","pythIdl","pythOracleCoder","pythOracleProgram","coder_1","idl_json_1","provider","Program","idl_json_2","getPythClusterApiUrl","getPythProgramKeyForCluster","parseMappingData","DeriveType","PriceType","PriceStatus","MAX_SLOT_DIFFERENCE","Version2","Magic","CorpAction","readBig_1","Version","empty32Buffer","PKorNull","magic","numProducts","nextMappingAccount","productAccountKeys","productAccountBytes","priceAccountBytes","price_account","parseEma","exponent","valueComponent","numerator","denominator","parsePriceInfo","priceComponent","confidenceComponent","confidence","corporateAction","publishSlot","priceType","numComponentPrices","numQuoters","lastSlot","validSlot","emaPrice","emaConfidence","timestamp","minPublishers","drv2","drv3","drv4","nextPriceAccountKey","previousSlot","previousPriceComponent","previousPrice","previousConfidenceComponent","previousConfidence","previousTimestamp","aggregate","Trading","Unknown","priceComponents","publisher","componentAggregate","latest","masterAuthority","dataCurationAuthority","securityAuthority","cluster_1","cluster","clusterToPythProgramKey","devnet","testnet","pythnet","localnet","clusterApiUrl","require$$5","require$$6","Record","RECORD_V1_SIZE","SOL","ETH","BSC","Injective","AAAA","Background","RecordVersion","getHashedNameSync","getNameAccountKeySync","hashedReverseLookup","NoAccountData","nameLength","reverseLookupBatch","reverseLookupAccounts","_deriveSync","classKey","getDomainKeySync","V2","CENTRAL_STATE_SNS_RECORDS","getReverseKeySync","errorType","convert","srcBits","dstBits","pad","bitConverter","createBitArray","fromBits","toBits","CHECKSUM_LENGTH","createChecksum","checksumConstant","BECH32M_CHECKSUM","polymod","decodeWithPrefix","_bitConverter","expandPrefix","detectCase","messageDescription","hasLowerCase","hasUpperCase","ord","MIN_CHAR_CODE","MAX_CHAR_CODE","CHARSET","verifyChecksum","CHAR_LOOKUP","GEN","checksum","newChecksum","chk","gen","outBuffer","realDst","BitcoinAddress","decode_1","_decodeTo5BitArray","decodeTo5BitArray","bitArray","from5BitArray","encode_1","encode5BitArray","to5BitArray","_encoding","_defineProperties","props","descriptor","MAX_ENC_LENGTH","_detectCase","prefixCase","encoded","lowerCaseMsg","sepIdx","scriptVersion","Constructor","_classCallCheck","protoProps","staticProps","converted","_decodeTo5BitArray2","ipv4Part","ipv4Regexes","fourOctet","threeOctet","twoOctet","longValue","octalRegex","hexRegex","zoneIndex","ipv6Part","ipv6Regexes","native","deprecatedTransitional","transitional","expandIPv6","replacement","replacementCount","colonCount","lastColon","zoneId","ref","results","matchCIDR","second","partSize","cidrBits","part","parseIntAuto","padPart","ipaddr","IPv4","octets","octet","SpecialRanges","unspecified","broadcast","multicast","linkLocal","loopback","carrierGradeNat","private","reserved","other","cidrRange","prefixLengthFromSubnetMask","cidr","zerotable","subnetMatch","toIPv4MappedAddress","IPv6","parse","toNormalizedString","broadcastAddressFromCIDR","parseCIDR","ipInterfaceOctets","subnetMaskOctets","subnetMaskFromPrefixLength","isIPv4","parser","isValid","isValidFourPartDecimal","networkAddressFromCIDR","maskLength","filledOctetCount","uniqueLocal","ipv4Mapped","rfc6145","rfc6052","teredo","benchmarking","amt","as112v6","deprecated","orchid2","isIPv4MappedAddress","toFixedLengthString","addr","suffix","toIPv4Address","high","toRFC5952String","regex","bestMatchIndex","bestMatchLength","exec","isIPv6","e2","rangeList","defaultName","rangeName","rangeSubnets","subnet","maxInt","stringFromCharCode","digitToBasic","digit","flag","adapt","numPoints","firstTime","baseMinusTMin","counter","ucs2decode","inputLength","bias","currentValue","basicLength","handledCPCount","handledCPCountPlusOne","qMinusT","baseMinusT","nacl","gf","init","Float64Array","randombytes","_0","_9","gf0","gf1","_121665","D2","X","Y","I","ts64","vn","xi","yi","crypto_verify_16","crypto_verify_32","crypto_core_salsa20","inp","j0","j1","j2","j3","j4","j5","j6","j7","j8","j9","j10","j11","j12","j13","j14","j15","x0","x3","x4","x5","x6","x7","x8","x9","x10","x11","x12","x13","x14","x15","core_salsa20","crypto_core_hsalsa20","core_hsalsa20","sigma","crypto_stream_salsa20_xor","cpos","mpos","crypto_stream_salsa20","crypto_stream","sn","crypto_stream_xor","poly1305","t0","t1","t2","t3","t4","t5","t6","t7","leftover","fin","crypto_onetimeauth","outpos","finish","crypto_onetimeauth_verify","hpos","crypto_secretbox","crypto_secretbox_open","set25519","car25519","sel25519","pack25519","neq25519","par25519","unpack25519","Z","M","t8","t9","t10","t11","t12","t13","t14","t15","t16","t17","t18","t19","t20","t21","t22","t23","t24","t25","t26","t27","t28","t29","t30","b10","b11","b12","b13","b14","b15","S","inv25519","pow2523","crypto_scalarmult","x32","x16","crypto_scalarmult_base","crypto_box_keypair","crypto_box_beforenm","blocks","d0","d1","d2","d3","d4","d5","d6","d7","d8","d9","hibit","h0","h1","h2","h3","h4","h5","h6","h7","h8","h9","r0","r1","r3","r4","r5","r6","r7","r8","r9","mac","macpos","want","crypto_box_afternm","crypto_box_open_afternm","crypto_hashblocks_hl","th","tl","crypto_hash","cswap","pack","ty","zi","scalarmult","scalarbase","crypto_sign_keypair","pk","sk","seeded","L","modL","crypto_sign","sm","smlen","crypto_sign_open","den","den2","den4","den6","unpackneg","crypto_secretbox_BOXZEROBYTES","crypto_sign_BYTES","crypto_sign_PUBLICKEYBYTES","crypto_sign_SECRETKEYBYTES","checkLengths","checkArrayTypes","cleanup","lowlevel","crypto_box","crypto_box_open","crypto_secretbox_KEYBYTES","crypto_secretbox_NONCEBYTES","crypto_secretbox_ZEROBYTES","crypto_scalarmult_BYTES","crypto_scalarmult_SCALARBYTES","crypto_box_PUBLICKEYBYTES","crypto_box_SECRETKEYBYTES","crypto_box_BEFORENMBYTES","crypto_box_NONCEBYTES","crypto_box_ZEROBYTES","crypto_box_BOXZEROBYTES","crypto_sign_SEEDBYTES","crypto_hash_BYTES","randomBytes","secretbox","open","box","nonceLength","overheadLength","scalarMult","scalarLength","groupElementLength","secretKey","before","checkBoxLengths","after","keyPair","fromSecretKey","publicKeyLength","secretKeyLength","sharedKeyLength","sign","signedMsg","mlen","detached","sig","verify","fromSeed","seed","seedLength","signatureLength","hashLength","setPRNG","crypto","msCrypto","getRandomValues","require","checkSolRecord","signedRecord","tweetnacl.sign","getRecordKeySync","V1","getRecord","NoRecordData","deserializeRecord","recordSize","getSolRecord","recordKey","findIndex","byte","trimNullPaddingIdx","expectedBuffer","base58","decoded","InvalidRecordData","serializeRecord","CNAME","TXT","encodePunycode","UnsupportedRecord","InvalidEvmAddress","InvalidInjectiveAddress","InvalidARecord","InvalidAAAARecord","InvalidRecordInput","serializeSolRecord","content","signer","signature","encodedMessage","valid","InvalidSignature","solRecord","GUARDIANS","Backpack","Url","IPFS","ETH_ROA_RECORDS","UTF8_ENCODED","ARWV","LTC","DOGE","Email","Discord","Github","Reddit","Twitter","Telegram","Pic","SHDW","POINT","BTC","SELF_SIGNED","serializeRecordV2Content","getRecordV2Key","createNameRegistry","nameOwner","balance","getMinimumBalanceForRentExemption","parentAccount","deleteNameRegistry","createReverseName","SYSVAR_RENT_PUBKEY","createRecordInstruction","createSolRecordInstruction","ReverseTwitterRegistryState","twitterRegistryKey","twitterHandle","reverseTwitterAccountKey","reverseTwitterAccount","InvalidReverseTwitter","createReverseTwitterRegistry","verifiedPubkey","hashedVerifiedPubkey","reverseRegistryKey","reverseTwitterRegistryStateBuff","NAME_OFFERS_ID","FavouriteDomain","FavouriteDomainNotFound","getKey","getKeySync","CustomBg","DEGEN_POET_KEY","hashedTwitterHandle","twitterHandleRegistryKey","currentVerifiedPubkey","newVerifiedPubkey","currentHashedVerifiedPubkey","allocateAndPostRecord","SNS_RECORDS_ID","subdomain","ixs","InvalidSubdomain","ix_create","reverseKey","ix_reverse","deleteRecord","basic","oldi","fromCodePoint","decodePunnycode","expectedPubkey","validateEthSignature","Validation","Ethereum","filtersReverse","subs","subsAcc","wallet","dataSlice","bg","DegenPoet1","InvalidCustomBg","customBg","hashedBg","hashedDomain","domainKey","bgKey","favKey","favorite","reverseRegistryState","records","pubkeys","registries","nftRecords","filteredAccounts","twitter_handle","MultipleRegistries","referrerKey","InvalidDomain","cs","derived_state","refIdx","refTokenAccount","pythConnection","SymbolNotFound","newOwner","curentNameOwner","isParentOwnerSigner","serialized","editRecord","staleness","verifier","validateSolanaSignature","recordObj","SnsRecord","roaId","getRoAId","validation","Solana","rightOfAssociationValidation","stalenessId","getStalenessId","stalenessValidation","writeRoa"],"mappings":"qpCAWA,gBATAA,WAuCA,SAAqBC,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,CAClD,GA3CAC,EAAAN,EAAAO,YAiDA,SAAsBN,GACpB,IAAIO,EAcAC,EAbAP,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBQ,EAAM,IAAIC,EAVhB,SAAsBV,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,CAClD,CAQoBO,CAAYX,EAAKG,EAAUC,IAEzCQ,EAAU,EAGVC,EAAMT,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAKK,EAAI,EAAGA,EAAIK,EAAKL,GAAK,EACxBD,EACGO,EAAUd,EAAIe,WAAWP,KAAO,GAChCM,EAAUd,EAAIe,WAAWP,EAAI,KAAO,GACpCM,EAAUd,EAAIe,WAAWP,EAAI,KAAO,EACrCM,EAAUd,EAAIe,WAAWP,EAAI,IAC/BC,EAAIG,KAAcL,GAAO,GAAM,IAC/BE,EAAIG,KAAcL,GAAO,EAAK,IAC9BE,EAAIG,KAAmB,IAANL,EAGK,IAApBH,IACFG,EACGO,EAAUd,EAAIe,WAAWP,KAAO,EAChCM,EAAUd,EAAIe,WAAWP,EAAI,KAAO,EACvCC,EAAIG,KAAmB,IAANL,GAGK,IAApBH,IACFG,EACGO,EAAUd,EAAIe,WAAWP,KAAO,GAChCM,EAAUd,EAAIe,WAAWP,EAAI,KAAO,EACpCM,EAAUd,EAAIe,WAAWP,EAAI,KAAO,EACvCC,EAAIG,KAAcL,GAAO,EAAK,IAC9BE,EAAIG,KAAmB,IAANL,GAGnB,OAAOE,CACT,EA5FAO,EAAAjB,EAAAkB,cAkHA,SAAwBC,GAQtB,IAPA,IAAIX,EACAM,EAAMK,EAAMC,OACZC,EAAaP,EAAM,EACnBQ,EAAQ,GACRC,EAAiB,MAGZd,EAAI,EAAGe,EAAOV,EAAMO,EAAYZ,EAAIe,EAAMf,GAAKc,EACtDD,EAAMG,KAAKC,EAAYP,EAAOV,EAAIA,EAAIc,EAAkBC,EAAOA,EAAQf,EAAIc,IAI1D,IAAfF,GACFb,EAAMW,EAAML,EAAM,GAClBQ,EAAMG,KACJE,EAAOnB,GAAO,GACdmB,EAAQnB,GAAO,EAAK,IACpB,OAEsB,IAAfa,IACTb,GAAOW,EAAML,EAAM,IAAM,GAAKK,EAAML,EAAM,GAC1CQ,EAAMG,KACJE,EAAOnB,GAAO,IACdmB,EAAQnB,GAAO,EAAK,IACpBmB,EAAQnB,GAAO,EAAK,IACpB,MAIJ,OAAOc,EAAMM,KAAK,GACpB,EA/IID,EAAS,GACTZ,EAAY,GACZJ,EAA4B,oBAAfkB,WAA6BA,WAAaC,MAEvDC,EAAO,mEACFtB,EAAI,EAAsBA,EAAbsB,KAAwBtB,EAC5CkB,EAAOlB,GAAKsB,EAAKtB,GACjBM,EAAUgB,EAAKf,WAAWP,IAAMA,EAQlC,SAASN,EAASF,GAChB,IAAIa,EAAMb,EAAImB,OAEd,GAAIN,EAAM,EAAI,EACZ,MAAM,IAAIkB,MAAM,kDAKlB,IAAI5B,EAAWH,EAAIgC,QAAQ,KAO3B,OANkB,IAAd7B,IAAiBA,EAAWU,GAMzB,CAACV,EAJcA,IAAaU,EAC/B,EACA,EAAKV,EAAW,EAGtB,CAmEA,SAASsB,EAAaP,EAAOe,EAAOC,GAGlC,IAFA,IAAI3B,EARoB4B,EASpBC,EAAS,GACJ5B,EAAIyB,EAAOzB,EAAI0B,EAAK1B,GAAK,EAChCD,GACIW,EAAMV,IAAM,GAAM,WAClBU,EAAMV,EAAI,IAAM,EAAK,QACP,IAAfU,EAAMV,EAAI,IACb4B,EAAOZ,KAdFE,GADiBS,EAeM5B,IAdT,GAAK,IACxBmB,EAAOS,GAAO,GAAK,IACnBT,EAAOS,GAAO,EAAI,IAClBT,EAAa,GAANS,IAaT,OAAOC,EAAOT,KAAK,GACrB,CAlGAb,EAAU,IAAIC,WAAW,IAAM,GAC/BD,EAAU,IAAIC,WAAW,IAAM;;AClBnBsB,KAAG,SAAUC,EAAQC,EAAQC,EAAMC,EAAMC,GACnD,IAAIC,EAAGC,EACHC,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTxC,EAAIgC,EAAQE,EAAS,EAAK,EAC1BO,EAAIT,GAAQ,EAAI,EAChBU,EAAIZ,EAAOC,EAAS/B,GAOxB,IALAA,GAAKyC,EAELN,EAAIO,GAAM,IAAOF,GAAU,EAC3BE,KAAQF,EACRA,GAASH,EACFG,EAAQ,EAAGL,EAAS,IAAJA,EAAWL,EAAOC,EAAS/B,GAAIA,GAAKyC,EAAGD,GAAS,GAKvE,IAHAJ,EAAID,GAAM,IAAOK,GAAU,EAC3BL,KAAQK,EACRA,GAASP,EACFO,EAAQ,EAAGJ,EAAS,IAAJA,EAAWN,EAAOC,EAAS/B,GAAIA,GAAKyC,EAAGD,GAAS,GAEvE,GAAU,IAANL,EACFA,EAAI,EAAII,MACH,IAAIJ,IAAMG,EACf,OAAOF,EAAIO,IAAsBC,KAAdF,GAAK,EAAI,GAE5BN,GAAQS,KAAKC,IAAI,EAAGb,GACpBE,GAAQI,CACT,CACD,OAAQG,GAAK,EAAI,GAAKN,EAAIS,KAAKC,IAAI,EAAGX,EAAIF,EAC5C,EAEAJ,MAAgB,SAAUC,EAAQiB,EAAOhB,EAAQC,EAAMC,EAAMC,GAC3D,IAAIC,EAAGC,EAAGY,EACNX,EAAiB,EAATH,EAAcD,EAAO,EAC7BK,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBW,EAAe,KAAThB,EAAcY,KAAKC,IAAI,GAAI,IAAMD,KAAKC,IAAI,GAAI,IAAM,EAC1D9C,EAAIgC,EAAO,EAAKE,EAAS,EACzBO,EAAIT,EAAO,GAAK,EAChBU,EAAIK,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQF,KAAKK,IAAIH,GAEbI,MAAMJ,IAAUA,IAAUH,KAC5BR,EAAIe,MAAMJ,GAAS,EAAI,EACvBZ,EAAIG,IAEJH,EAAIU,KAAKO,MAAMP,KAAKQ,IAAIN,GAASF,KAAKS,KAClCP,GAASC,EAAIH,KAAKC,IAAI,GAAIX,IAAM,IAClCA,IACAa,GAAK,IAGLD,GADEZ,EAAII,GAAS,EACNU,EAAKD,EAELC,EAAKJ,KAAKC,IAAI,EAAG,EAAIP,IAEpBS,GAAK,IACfb,IACAa,GAAK,GAGHb,EAAII,GAASD,GACfF,EAAI,EACJD,EAAIG,GACKH,EAAII,GAAS,GACtBH,GAAMW,EAAQC,EAAK,GAAKH,KAAKC,IAAI,EAAGb,GACpCE,GAAQI,IAERH,EAAIW,EAAQF,KAAKC,IAAI,EAAGP,EAAQ,GAAKM,KAAKC,IAAI,EAAGb,GACjDE,EAAI,IAIDF,GAAQ,EAAGH,EAAOC,EAAS/B,GAAS,IAAJoC,EAAUpC,GAAKyC,EAAGL,GAAK,IAAKH,GAAQ,GAI3E,IAFAE,EAAKA,GAAKF,EAAQG,EAClBC,GAAQJ,EACDI,EAAO,EAAGP,EAAOC,EAAS/B,GAAS,IAAJmC,EAAUnC,GAAKyC,EAAGN,GAAK,IAAKE,GAAQ,GAE1EP,EAAOC,EAAS/B,EAAIyC,IAAU,IAAJC,CAC5B;;;;;;;aC1EA,MAAMa,EAASC,EACT3B,EAAU4B,EACVC,EACe,mBAAXC,QAAkD,mBAAlBA,OAAY,IAChDA,OAAY,IAAE,8BACd,KAENC,EAAAC,OAAiBA,EACjBD,EAAAE,WAyTA,SAAqBnD,IACdA,GAAUA,IACbA,EAAS,GAEX,OAAOkD,EAAOE,OAAOpD,EACvB,EA7TAiD,EAAAI,kBAA4B,GAE5B,MAAMC,EAAe,WAwDrB,SAASC,EAAcvD,GACrB,GAAIA,EAASsD,EACX,MAAM,IAAIE,WAAW,cAAgBxD,EAAS,kCAGhD,MAAMyD,EAAM,IAAIhD,WAAWT,GAE3B,OADA0D,OAAOC,eAAeF,EAAKP,EAAOU,WAC3BH,CACT,CAYA,SAASP,EAAQW,EAAKC,EAAkB9D,GAEtC,GAAmB,iBAAR6D,EAAkB,CAC3B,GAAgC,iBAArBC,EACT,MAAM,IAAIC,UACR,sEAGJ,OAAOC,EAAYH,EACpB,CACD,OAAOI,EAAKJ,EAAKC,EAAkB9D,EACrC,CAIA,SAASiE,EAAM7B,EAAO0B,EAAkB9D,GACtC,GAAqB,iBAAVoC,EACT,OAqHJ,SAAqB8B,EAAQC,GACH,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,QAGb,IAAKjB,EAAOkB,WAAWD,GACrB,MAAM,IAAIJ,UAAU,qBAAuBI,GAG7C,MAAMnE,EAAwC,EAA/BqE,EAAWH,EAAQC,GAClC,IAAIV,EAAMF,EAAavD,GAEvB,MAAMsE,EAASb,EAAIc,MAAML,EAAQC,GAE7BG,IAAWtE,IAIbyD,EAAMA,EAAIe,MAAM,EAAGF,IAGrB,OAAOb,CACT,CA3IWgB,CAAWrC,EAAO0B,GAG3B,GAAIY,YAAYC,OAAOvC,GACrB,OAkJJ,SAAwBwC,GACtB,GAAIC,EAAWD,EAAWnE,YAAa,CACrC,MAAMqE,EAAO,IAAIrE,WAAWmE,GAC5B,OAAOG,EAAgBD,EAAK3D,OAAQ2D,EAAKE,WAAYF,EAAKT,WAC3D,CACD,OAAOY,EAAcL,EACvB,CAxJWM,CAAc9C,GAGvB,GAAa,MAATA,EACF,MAAM,IAAI2B,UACR,yHACiD3B,GAIrD,GAAIyC,EAAWzC,EAAOsC,cACjBtC,GAASyC,EAAWzC,EAAMjB,OAAQuD,aACrC,OAAOK,EAAgB3C,EAAO0B,EAAkB9D,GAGlD,GAAiC,oBAAtBmF,oBACNN,EAAWzC,EAAO+C,oBAClB/C,GAASyC,EAAWzC,EAAMjB,OAAQgE,oBACrC,OAAOJ,EAAgB3C,EAAO0B,EAAkB9D,GAGlD,GAAqB,iBAAVoC,EACT,MAAM,IAAI2B,UACR,yEAIJ,MAAMqB,EAAUhD,EAAMgD,SAAWhD,EAAMgD,UACvC,GAAe,MAAXA,GAAmBA,IAAYhD,EACjC,OAAOc,EAAOe,KAAKmB,EAAStB,EAAkB9D,GAGhD,MAAMqF,EAkJR,SAAqBC,GACnB,GAAIpC,EAAOqC,SAASD,GAAM,CACxB,MAAM5F,EAA4B,EAAtB8F,EAAQF,EAAItF,QAClByD,EAAMF,EAAa7D,GAEzB,OAAmB,IAAf+D,EAAIzD,QAIRsF,EAAIR,KAAKrB,EAAK,EAAG,EAAG/D,GAHX+D,CAKV,CAED,QAAmBgC,IAAfH,EAAItF,OACN,MAA0B,iBAAfsF,EAAItF,QAAuB0F,EAAYJ,EAAItF,QAC7CuD,EAAa,GAEf0B,EAAcK,GAGvB,GAAiB,WAAbA,EAAIK,MAAqBjF,MAAMkF,QAAQN,EAAIO,MAC7C,OAAOZ,EAAcK,EAAIO,KAE7B,CAzKYC,CAAW1D,GACrB,GAAIiD,EAAG,OAAOA,EAEd,GAAsB,oBAAXrC,QAAgD,MAAtBA,OAAO+C,aACH,mBAA9B3D,EAAMY,OAAO+C,aACtB,OAAO7C,EAAOe,KAAK7B,EAAMY,OAAO+C,aAAa,UAAWjC,EAAkB9D,GAG5E,MAAM,IAAI+D,UACR,yHACiD3B,EAErD,CAmBA,SAAS4D,EAAYC,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAIlC,UAAU,0CACf,GAAIkC,EAAO,EAChB,MAAM,IAAIzC,WAAW,cAAgByC,EAAO,iCAEhD,CA0BA,SAASjC,EAAaiC,GAEpB,OADAD,EAAWC,GACJ1C,EAAa0C,EAAO,EAAI,EAAoB,EAAhBT,EAAQS,GAC7C,CAuCA,SAAShB,EAAeiB,GACtB,MAAMlG,EAASkG,EAAMlG,OAAS,EAAI,EAA4B,EAAxBwF,EAAQU,EAAMlG,QAC9CyD,EAAMF,EAAavD,GACzB,IAAK,IAAIX,EAAI,EAAGA,EAAIW,EAAQX,GAAK,EAC/BoE,EAAIpE,GAAgB,IAAX6G,EAAM7G,GAEjB,OAAOoE,CACT,CAUA,SAASsB,EAAiBmB,EAAOlB,EAAYhF,GAC3C,GAAIgF,EAAa,GAAKkB,EAAM7B,WAAaW,EACvC,MAAM,IAAIxB,WAAW,wCAGvB,GAAI0C,EAAM7B,WAAaW,GAAchF,GAAU,GAC7C,MAAM,IAAIwD,WAAW,wCAGvB,IAAIC,EAYJ,OAVEA,OADiBgC,IAAfT,QAAuCS,IAAXzF,EACxB,IAAIS,WAAWyF,QACDT,IAAXzF,EACH,IAAIS,WAAWyF,EAAOlB,GAEtB,IAAIvE,WAAWyF,EAAOlB,EAAYhF,GAI1C0D,OAAOC,eAAeF,EAAKP,EAAOU,WAE3BH,CACT,CA2BA,SAAS+B,EAASxF,GAGhB,GAAIA,GAAUsD,EACZ,MAAM,IAAIE,WAAW,0DACaF,EAAa6C,SAAS,IAAM,UAEhE,OAAgB,EAATnG,CACT,CAsGA,SAASqE,EAAYH,EAAQC,GAC3B,GAAIjB,EAAOqC,SAASrB,GAClB,OAAOA,EAAOlE,OAEhB,GAAI0E,YAAYC,OAAOT,IAAWW,EAAWX,EAAQQ,aACnD,OAAOR,EAAOG,WAEhB,GAAsB,iBAAXH,EACT,MAAM,IAAIH,UACR,kGAC0BG,GAI9B,MAAMxE,EAAMwE,EAAOlE,OACboG,EAAaC,UAAUrG,OAAS,IAAsB,IAAjBqG,UAAU,GACrD,IAAKD,GAAqB,IAAR1G,EAAW,OAAO,EAGpC,IAAI4G,GAAc,EAClB,OACE,OAAQnC,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOzE,EACT,IAAK,OACL,IAAK,QACH,OAAO6G,EAAYrC,GAAQlE,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAANN,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAO8G,EAActC,GAAQlE,OAC/B,QACE,GAAIsG,EACF,OAAOF,GAAa,EAAIG,EAAYrC,GAAQlE,OAE9CmE,GAAY,GAAKA,GAAUsC,cAC3BH,GAAc,EAGtB,CAGA,SAASI,EAAcvC,EAAUrD,EAAOC,GACtC,IAAIuF,GAAc,EAclB,SALcb,IAAV3E,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQ6F,KAAK3G,OACf,MAAO,GAOT,SAJYyF,IAAR1E,GAAqBA,EAAM4F,KAAK3G,UAClCe,EAAM4F,KAAK3G,QAGTe,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACTD,KAAW,GAGT,MAAO,GAKT,IAFKqD,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOyC,EAASD,KAAM7F,EAAOC,GAE/B,IAAK,OACL,IAAK,QACH,OAAO8F,EAAUF,KAAM7F,EAAOC,GAEhC,IAAK,QACH,OAAO+F,EAAWH,KAAM7F,EAAOC,GAEjC,IAAK,SACL,IAAK,SACH,OAAOgG,EAAYJ,KAAM7F,EAAOC,GAElC,IAAK,SACH,OAAOiG,EAAYL,KAAM7F,EAAOC,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOkG,EAAaN,KAAM7F,EAAOC,GAEnC,QACE,GAAIuF,EAAa,MAAM,IAAIvC,UAAU,qBAAuBI,GAC5DA,GAAYA,EAAW,IAAIsC,cAC3BH,GAAc,EAGtB,CAUA,SAASY,EAAM7B,EAAG8B,EAAG1F,GACnB,MAAMpC,EAAIgG,EAAE8B,GACZ9B,EAAE8B,GAAK9B,EAAE5D,GACT4D,EAAE5D,GAAKpC,CACT,CA2IA,SAAS+H,EAAsBjG,EAAQkG,EAAKrC,EAAYb,EAAUmD,GAEhE,GAAsB,IAAlBnG,EAAOnB,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAfgF,GACTb,EAAWa,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZU,EADJV,GAAcA,KAGZA,EAAasC,EAAM,EAAKnG,EAAOnB,OAAS,GAItCgF,EAAa,IAAGA,EAAa7D,EAAOnB,OAASgF,GAC7CA,GAAc7D,EAAOnB,OAAQ,CAC/B,GAAIsH,EAAK,OAAQ,EACZtC,EAAa7D,EAAOnB,OAAS,CACtC,MAAS,GAAIgF,EAAa,EAAG,CACzB,IAAIsC,EACC,OAAQ,EADJtC,EAAa,CAEvB,CAQD,GALmB,iBAARqC,IACTA,EAAMnE,EAAOe,KAAKoD,EAAKlD,IAIrBjB,EAAOqC,SAAS8B,GAElB,OAAmB,IAAfA,EAAIrH,QACE,EAEHuH,EAAapG,EAAQkG,EAAKrC,EAAYb,EAAUmD,GAClD,GAAmB,iBAARD,EAEhB,OADAA,GAAY,IACgC,mBAAjC5G,WAAWmD,UAAU/C,QAC1ByG,EACK7G,WAAWmD,UAAU/C,QAAQ2G,KAAKrG,EAAQkG,EAAKrC,GAE/CvE,WAAWmD,UAAU6D,YAAYD,KAAKrG,EAAQkG,EAAKrC,GAGvDuC,EAAapG,EAAQ,CAACkG,GAAMrC,EAAYb,EAAUmD,GAG3D,MAAM,IAAIvD,UAAU,uCACtB,CAEA,SAASwD,EAAcjI,EAAK+H,EAAKrC,EAAYb,EAAUmD,GACrD,IA0BIjI,EA1BAqI,EAAY,EACZC,EAAYrI,EAAIU,OAChB4H,EAAYP,EAAIrH,OAEpB,QAAiByF,IAAbtB,IAEe,UADjBA,EAAW0D,OAAO1D,GAAUsC,gBACY,UAAbtC,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAI7E,EAAIU,OAAS,GAAKqH,EAAIrH,OAAS,EACjC,OAAQ,EAEV0H,EAAY,EACZC,GAAa,EACbC,GAAa,EACb5C,GAAc,CACf,CAGH,SAAS8C,EAAMrE,EAAKpE,GAClB,OAAkB,IAAdqI,EACKjE,EAAIpE,GAEJoE,EAAIsE,aAAa1I,EAAIqI,EAE/B,CAGD,GAAIJ,EAAK,CACP,IAAIU,GAAc,EAClB,IAAK3I,EAAI2F,EAAY3F,EAAIsI,EAAWtI,IAClC,GAAIyI,EAAKxI,EAAKD,KAAOyI,EAAKT,GAAqB,IAAhBW,EAAoB,EAAI3I,EAAI2I,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa3I,GAChCA,EAAI2I,EAAa,IAAMJ,EAAW,OAAOI,EAAaN,OAEtC,IAAhBM,IAAmB3I,GAAKA,EAAI2I,GAChCA,GAAc,CAGtB,MAEI,IADIhD,EAAa4C,EAAYD,IAAW3C,EAAa2C,EAAYC,GAC5DvI,EAAI2F,EAAY3F,GAAK,EAAGA,IAAK,CAChC,IAAI4I,GAAQ,EACZ,IAAK,IAAIC,EAAI,EAAGA,EAAIN,EAAWM,IAC7B,GAAIJ,EAAKxI,EAAKD,EAAI6I,KAAOJ,EAAKT,EAAKa,GAAI,CACrCD,GAAQ,EACR,KACD,CAEH,GAAIA,EAAO,OAAO5I,CACnB,CAGH,OAAQ,CACV,CAcA,SAAS8I,EAAU1E,EAAKS,EAAQ9C,EAAQpB,GACtCoB,EAASgH,OAAOhH,IAAW,EAC3B,MAAMiH,EAAY5E,EAAIzD,OAASoB,EAC1BpB,GAGHA,EAASoI,OAAOpI,IACHqI,IACXrI,EAASqI,GAJXrI,EAASqI,EAQX,MAAMC,EAASpE,EAAOlE,OAKtB,IAAIX,EACJ,IAJIW,EAASsI,EAAS,IACpBtI,EAASsI,EAAS,GAGfjJ,EAAI,EAAGA,EAAIW,IAAUX,EAAG,CAC3B,MAAMkJ,EAASC,SAAStE,EAAOuE,OAAW,EAAJpJ,EAAO,GAAI,IACjD,GAAIqG,EAAY6C,GAAS,OAAOlJ,EAChCoE,EAAIrC,EAAS/B,GAAKkJ,CACnB,CACD,OAAOlJ,CACT,CAEA,SAASqJ,EAAWjF,EAAKS,EAAQ9C,EAAQpB,GACvC,OAAO2I,EAAWpC,EAAYrC,EAAQT,EAAIzD,OAASoB,GAASqC,EAAKrC,EAAQpB,EAC3E,CAEA,SAAS4I,EAAYnF,EAAKS,EAAQ9C,EAAQpB,GACxC,OAAO2I,EAypCT,SAAuBE,GACrB,MAAMC,EAAY,GAClB,IAAK,IAAIzJ,EAAI,EAAGA,EAAIwJ,EAAI7I,SAAUX,EAEhCyJ,EAAUzI,KAAyB,IAApBwI,EAAIjJ,WAAWP,IAEhC,OAAOyJ,CACT,CAhqCoBC,CAAa7E,GAAST,EAAKrC,EAAQpB,EACvD,CAEA,SAASgJ,EAAavF,EAAKS,EAAQ9C,EAAQpB,GACzC,OAAO2I,EAAWnC,EAActC,GAAST,EAAKrC,EAAQpB,EACxD,CAEA,SAASiJ,EAAWxF,EAAKS,EAAQ9C,EAAQpB,GACvC,OAAO2I,EA0pCT,SAAyBE,EAAKK,GAC5B,IAAI7G,EAAG8G,EAAIC,EACX,MAAMN,EAAY,GAClB,IAAK,IAAIzJ,EAAI,EAAGA,EAAIwJ,EAAI7I,WACjBkJ,GAAS,GAAK,KADa7J,EAGhCgD,EAAIwG,EAAIjJ,WAAWP,GACnB8J,EAAK9G,GAAK,EACV+G,EAAK/G,EAAI,IACTyG,EAAUzI,KAAK+I,GACfN,EAAUzI,KAAK8I,GAGjB,OAAOL,CACT,CAxqCoBO,CAAenF,EAAQT,EAAIzD,OAASoB,GAASqC,EAAKrC,EAAQpB,EAC9E,CA8EA,SAASgH,EAAavD,EAAK3C,EAAOC,GAChC,OAAc,IAAVD,GAAeC,IAAQ0C,EAAIzD,OACtB4C,EAAO9C,cAAc2D,GAErBb,EAAO9C,cAAc2D,EAAIe,MAAM1D,EAAOC,GAEjD,CAEA,SAAS8F,EAAWpD,EAAK3C,EAAOC,GAC9BA,EAAMmB,KAAKoH,IAAI7F,EAAIzD,OAAQe,GAC3B,MAAMwI,EAAM,GAEZ,IAAIlK,EAAIyB,EACR,KAAOzB,EAAI0B,GAAK,CACd,MAAMyI,EAAY/F,EAAIpE,GACtB,IAAIoK,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,EAEZ,GAAInK,EAAIqK,GAAoB3I,EAAK,CAC/B,IAAI4I,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EACHG,EAAalG,EAAIpE,EAAI,GACO,MAAV,IAAbsK,KACHG,GAA6B,GAAZN,IAAqB,EAAoB,GAAbG,EACzCG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAalG,EAAIpE,EAAI,GACrBuK,EAAYnG,EAAIpE,EAAI,GACQ,MAAV,IAAbsK,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZN,IAAoB,IAAoB,GAAbG,IAAsB,EAAmB,GAAZC,EACrEE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAalG,EAAIpE,EAAI,GACrBuK,EAAYnG,EAAIpE,EAAI,GACpBwK,EAAapG,EAAIpE,EAAI,GACO,MAAV,IAAbsK,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZN,IAAoB,IAAqB,GAAbG,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,EAClGC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,IAIrB,CAEiB,OAAdL,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACbF,EAAIlJ,KAAKoJ,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvBF,EAAIlJ,KAAKoJ,GACTpK,GAAKqK,CACN,CAED,OAQF,SAAgCK,GAC9B,MAAMrK,EAAMqK,EAAW/J,OACvB,GAAIN,GAAOsK,EACT,OAAOnC,OAAOoC,aAAaC,MAAMrC,OAAQkC,GAI3C,IAAIR,EAAM,GACNlK,EAAI,EACR,KAAOA,EAAIK,GACT6J,GAAO1B,OAAOoC,aAAaC,MACzBrC,OACAkC,EAAWvF,MAAMnF,EAAGA,GAAK2K,IAG7B,OAAOT,CACT,CAxBSY,CAAsBZ,EAC/B,CA3+BAtG,EAAAmH,WAAqB9G,EAgBrBJ,EAAOmH,oBAUP,WAEE,IACE,MAAM/K,EAAM,IAAImB,WAAW,GACrB6J,EAAQ,CAAEC,IAAK,WAAc,OAAO,EAAE,GAG5C,OAFA7G,OAAOC,eAAe2G,EAAO7J,WAAWmD,WACxCF,OAAOC,eAAerE,EAAKgL,GACN,KAAdhL,EAAIiL,KACZ,CAAC,MAAO/I,GACP,OAAO,CACR,CACH,CArB6BgJ,GAExBtH,EAAOmH,qBAA0C,oBAAZI,SACb,mBAAlBA,QAAQC,OACjBD,QAAQC,MACN,iJAkBJhH,OAAOiH,eAAezH,EAAOU,UAAW,SAAU,CAChDgH,YAAY,EACZC,IAAK,WACH,GAAK3H,EAAOqC,SAASoB,MACrB,OAAOA,KAAKxF,MACb,IAGHuC,OAAOiH,eAAezH,EAAOU,UAAW,SAAU,CAChDgH,YAAY,EACZC,IAAK,WACH,GAAK3H,EAAOqC,SAASoB,MACrB,OAAOA,KAAK3B,UACb,IAoCH9B,EAAO4H,SAAW,KA8DlB5H,EAAOe,KAAO,SAAU7B,EAAO0B,EAAkB9D,GAC/C,OAAOiE,EAAK7B,EAAO0B,EAAkB9D,IAKvC0D,OAAOC,eAAeT,EAAOU,UAAWnD,WAAWmD,WACnDF,OAAOC,eAAeT,EAAQzC,YA8B9ByC,EAAOE,MAAQ,SAAU6C,EAAM8E,EAAM5G,GACnC,OArBF,SAAgB8B,EAAM8E,EAAM5G,GAE1B,OADA6B,EAAWC,GACPA,GAAQ,EACH1C,EAAa0C,QAETR,IAATsF,EAIyB,iBAAb5G,EACVZ,EAAa0C,GAAM8E,KAAKA,EAAM5G,GAC9BZ,EAAa0C,GAAM8E,KAAKA,GAEvBxH,EAAa0C,EACtB,CAOS7C,CAAM6C,EAAM8E,EAAM5G,IAW3BjB,EAAOc,YAAc,SAAUiC,GAC7B,OAAOjC,EAAYiC,IAKrB/C,EAAO8H,gBAAkB,SAAU/E,GACjC,OAAOjC,EAAYiC,IA8GrB/C,EAAOqC,SAAW,SAAmBF,GACnC,OAAY,MAALA,IAA6B,IAAhBA,EAAE4F,WACpB5F,IAAMnC,EAAOU,WAGjBV,EAAOgI,QAAU,SAAkBC,EAAG9F,GAGpC,GAFIR,EAAWsG,EAAG1K,cAAa0K,EAAIjI,EAAOe,KAAKkH,EAAGA,EAAE/J,OAAQ+J,EAAE9G,aAC1DQ,EAAWQ,EAAG5E,cAAa4E,EAAInC,EAAOe,KAAKoB,EAAGA,EAAEjE,OAAQiE,EAAEhB,cACzDnB,EAAOqC,SAAS4F,KAAOjI,EAAOqC,SAASF,GAC1C,MAAM,IAAItB,UACR,yEAIJ,GAAIoH,IAAM9F,EAAG,OAAO,EAEpB,IAAI+F,EAAID,EAAEnL,OACNqL,EAAIhG,EAAErF,OAEV,IAAK,IAAIX,EAAI,EAAGK,EAAMwC,KAAKoH,IAAI8B,EAAGC,GAAIhM,EAAIK,IAAOL,EAC/C,GAAI8L,EAAE9L,KAAOgG,EAAEhG,GAAI,CACjB+L,EAAID,EAAE9L,GACNgM,EAAIhG,EAAEhG,GACN,KACD,CAGH,OAAI+L,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GAGTlI,EAAOkB,WAAa,SAAqBD,GACvC,OAAQ0D,OAAO1D,GAAUsC,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,IAIbvD,EAAOoI,OAAS,SAAiBC,EAAMvL,GACrC,IAAKU,MAAMkF,QAAQ2F,GACjB,MAAM,IAAIxH,UAAU,+CAGtB,GAAoB,IAAhBwH,EAAKvL,OACP,OAAOkD,EAAOE,MAAM,GAGtB,IAAI/D,EACJ,QAAeoG,IAAXzF,EAEF,IADAA,EAAS,EACJX,EAAI,EAAGA,EAAIkM,EAAKvL,SAAUX,EAC7BW,GAAUuL,EAAKlM,GAAGW,OAItB,MAAMmB,EAAS+B,EAAOc,YAAYhE,GAClC,IAAIwL,EAAM,EACV,IAAKnM,EAAI,EAAGA,EAAIkM,EAAKvL,SAAUX,EAAG,CAChC,IAAIoE,EAAM8H,EAAKlM,GACf,GAAIwF,EAAWpB,EAAKhD,YACd+K,EAAM/H,EAAIzD,OAASmB,EAAOnB,QACvBkD,EAAOqC,SAAS9B,KAAMA,EAAMP,EAAOe,KAAKR,IAC7CA,EAAIqB,KAAK3D,EAAQqK,IAEjB/K,WAAWmD,UAAU6H,IAAIjE,KACvBrG,EACAsC,EACA+H,OAGC,KAAKtI,EAAOqC,SAAS9B,GAC1B,MAAM,IAAIM,UAAU,+CAEpBN,EAAIqB,KAAK3D,EAAQqK,EAClB,CACDA,GAAO/H,EAAIzD,MACZ,CACD,OAAOmB,GAkDT+B,EAAOmB,WAAaA,EA8EpBnB,EAAOU,UAAUqH,WAAY,EAQ7B/H,EAAOU,UAAU8H,OAAS,WACxB,MAAMhM,EAAMiH,KAAK3G,OACjB,GAAIN,EAAM,GAAM,EACd,MAAM,IAAI8D,WAAW,6CAEvB,IAAK,IAAInE,EAAI,EAAGA,EAAIK,EAAKL,GAAK,EAC5B6H,EAAKP,KAAMtH,EAAGA,EAAI,GAEpB,OAAOsH,MAGTzD,EAAOU,UAAU+H,OAAS,WACxB,MAAMjM,EAAMiH,KAAK3G,OACjB,GAAIN,EAAM,GAAM,EACd,MAAM,IAAI8D,WAAW,6CAEvB,IAAK,IAAInE,EAAI,EAAGA,EAAIK,EAAKL,GAAK,EAC5B6H,EAAKP,KAAMtH,EAAGA,EAAI,GAClB6H,EAAKP,KAAMtH,EAAI,EAAGA,EAAI,GAExB,OAAOsH,MAGTzD,EAAOU,UAAUgI,OAAS,WACxB,MAAMlM,EAAMiH,KAAK3G,OACjB,GAAIN,EAAM,GAAM,EACd,MAAM,IAAI8D,WAAW,6CAEvB,IAAK,IAAInE,EAAI,EAAGA,EAAIK,EAAKL,GAAK,EAC5B6H,EAAKP,KAAMtH,EAAGA,EAAI,GAClB6H,EAAKP,KAAMtH,EAAI,EAAGA,EAAI,GACtB6H,EAAKP,KAAMtH,EAAI,EAAGA,EAAI,GACtB6H,EAAKP,KAAMtH,EAAI,EAAGA,EAAI,GAExB,OAAOsH,MAGTzD,EAAOU,UAAUuC,SAAW,WAC1B,MAAMnG,EAAS2G,KAAK3G,OACpB,OAAe,IAAXA,EAAqB,GACA,IAArBqG,UAAUrG,OAAqB6G,EAAUF,KAAM,EAAG3G,GAC/C0G,EAAawD,MAAMvD,KAAMN,YAGlCnD,EAAOU,UAAUiI,eAAiB3I,EAAOU,UAAUuC,SAEnDjD,EAAOU,UAAUkI,OAAS,SAAiBzG,GACzC,IAAKnC,EAAOqC,SAASF,GAAI,MAAM,IAAItB,UAAU,6BAC7C,OAAI4C,OAAStB,GACsB,IAA5BnC,EAAOgI,QAAQvE,KAAMtB,IAG9BnC,EAAOU,UAAUmI,QAAU,WACzB,IAAIlD,EAAM,GACV,MAAMmD,EAAM/I,EAAQI,kBAGpB,OAFAwF,EAAMlC,KAAKR,SAAS,MAAO,EAAG6F,GAAKC,QAAQ,UAAW,OAAOC,OACzDvF,KAAK3G,OAASgM,IAAKnD,GAAO,SACvB,WAAaA,EAAM,KAExB9F,IACFG,EAAOU,UAAUb,GAAuBG,EAAOU,UAAUmI,SAG3D7I,EAAOU,UAAUsH,QAAU,SAAkBiB,EAAQrL,EAAOC,EAAKqL,EAAWC,GAI1E,GAHIxH,EAAWsH,EAAQ1L,cACrB0L,EAASjJ,EAAOe,KAAKkI,EAAQA,EAAO/K,OAAQ+K,EAAO9H,cAEhDnB,EAAOqC,SAAS4G,GACnB,MAAM,IAAIpI,UACR,wFAC2BoI,GAiB/B,QAbc1G,IAAV3E,IACFA,EAAQ,QAEE2E,IAAR1E,IACFA,EAAMoL,EAASA,EAAOnM,OAAS,QAEfyF,IAAd2G,IACFA,EAAY,QAEE3G,IAAZ4G,IACFA,EAAU1F,KAAK3G,QAGbc,EAAQ,GAAKC,EAAMoL,EAAOnM,QAAUoM,EAAY,GAAKC,EAAU1F,KAAK3G,OACtE,MAAM,IAAIwD,WAAW,sBAGvB,GAAI4I,GAAaC,GAAWvL,GAASC,EACnC,OAAO,EAET,GAAIqL,GAAaC,EACf,OAAQ,EAEV,GAAIvL,GAASC,EACX,OAAO,EAQT,GAAI4F,OAASwF,EAAQ,OAAO,EAE5B,IAAIf,GAJJiB,KAAa,IADbD,KAAe,GAMXf,GAPJtK,KAAS,IADTD,KAAW,GASX,MAAMpB,EAAMwC,KAAKoH,IAAI8B,EAAGC,GAElBiB,EAAW3F,KAAKnC,MAAM4H,EAAWC,GACjCE,EAAaJ,EAAO3H,MAAM1D,EAAOC,GAEvC,IAAK,IAAI1B,EAAI,EAAGA,EAAIK,IAAOL,EACzB,GAAIiN,EAASjN,KAAOkN,EAAWlN,GAAI,CACjC+L,EAAIkB,EAASjN,GACbgM,EAAIkB,EAAWlN,GACf,KACD,CAGH,OAAI+L,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GA4HTlI,EAAOU,UAAU4I,SAAW,SAAmBnF,EAAKrC,EAAYb,GAC9D,OAAoD,IAA7CwC,KAAK9F,QAAQwG,EAAKrC,EAAYb,IAGvCjB,EAAOU,UAAU/C,QAAU,SAAkBwG,EAAKrC,EAAYb,GAC5D,OAAOiD,EAAqBT,KAAMU,EAAKrC,EAAYb,GAAU,IAG/DjB,EAAOU,UAAU6D,YAAc,SAAsBJ,EAAKrC,EAAYb,GACpE,OAAOiD,EAAqBT,KAAMU,EAAKrC,EAAYb,GAAU,IA6C/DjB,EAAOU,UAAUW,MAAQ,SAAgBL,EAAQ9C,EAAQpB,EAAQmE,GAE/D,QAAesB,IAAXrE,EACF+C,EAAW,OACXnE,EAAS2G,KAAK3G,OACdoB,EAAS,OAEJ,QAAeqE,IAAXzF,GAA0C,iBAAXoB,EACxC+C,EAAW/C,EACXpB,EAAS2G,KAAK3G,OACdoB,EAAS,MAEJ,KAAIqL,SAASrL,GAUlB,MAAM,IAAIR,MACR,2EAVFQ,KAAoB,EAChBqL,SAASzM,IACXA,KAAoB,OACHyF,IAAbtB,IAAwBA,EAAW,UAEvCA,EAAWnE,EACXA,OAASyF,EAMZ,CAED,MAAM4C,EAAY1B,KAAK3G,OAASoB,EAGhC,SAFeqE,IAAXzF,GAAwBA,EAASqI,KAAWrI,EAASqI,GAEpDnE,EAAOlE,OAAS,IAAMA,EAAS,GAAKoB,EAAS,IAAOA,EAASuF,KAAK3G,OACrE,MAAM,IAAIwD,WAAW,0CAGlBW,IAAUA,EAAW,QAE1B,IAAImC,GAAc,EAClB,OACE,OAAQnC,GACN,IAAK,MACH,OAAOgE,EAASxB,KAAMzC,EAAQ9C,EAAQpB,GAExC,IAAK,OACL,IAAK,QACH,OAAO0I,EAAU/B,KAAMzC,EAAQ9C,EAAQpB,GAEzC,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO4I,EAAWjC,KAAMzC,EAAQ9C,EAAQpB,GAE1C,IAAK,SAEH,OAAOgJ,EAAYrC,KAAMzC,EAAQ9C,EAAQpB,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOiJ,EAAUtC,KAAMzC,EAAQ9C,EAAQpB,GAEzC,QACE,GAAIsG,EAAa,MAAM,IAAIvC,UAAU,qBAAuBI,GAC5DA,GAAY,GAAKA,GAAUsC,cAC3BH,GAAc,IAKtBpD,EAAOU,UAAU8I,OAAS,WACxB,MAAO,CACL/G,KAAM,SACNE,KAAMnF,MAAMkD,UAAUY,MAAMgD,KAAKb,KAAKgG,MAAQhG,KAAM,KA2FxD,MAAMqD,EAAuB,KAoB7B,SAASlD,EAAYrD,EAAK3C,EAAOC,GAC/B,IAAI6L,EAAM,GACV7L,EAAMmB,KAAKoH,IAAI7F,EAAIzD,OAAQe,GAE3B,IAAK,IAAI1B,EAAIyB,EAAOzB,EAAI0B,IAAO1B,EAC7BuN,GAAO/E,OAAOoC,aAAsB,IAATxG,EAAIpE,IAEjC,OAAOuN,CACT,CAEA,SAAS7F,EAAatD,EAAK3C,EAAOC,GAChC,IAAI6L,EAAM,GACV7L,EAAMmB,KAAKoH,IAAI7F,EAAIzD,OAAQe,GAE3B,IAAK,IAAI1B,EAAIyB,EAAOzB,EAAI0B,IAAO1B,EAC7BuN,GAAO/E,OAAOoC,aAAaxG,EAAIpE,IAEjC,OAAOuN,CACT,CAEA,SAAShG,EAAUnD,EAAK3C,EAAOC,GAC7B,MAAMrB,EAAM+D,EAAIzD,SAEXc,GAASA,EAAQ,KAAGA,EAAQ,KAC5BC,GAAOA,EAAM,GAAKA,EAAMrB,KAAKqB,EAAMrB,GAExC,IAAImN,EAAM,GACV,IAAK,IAAIxN,EAAIyB,EAAOzB,EAAI0B,IAAO1B,EAC7BwN,GAAOC,EAAoBrJ,EAAIpE,IAEjC,OAAOwN,CACT,CAEA,SAAS5F,EAAcxD,EAAK3C,EAAOC,GACjC,MAAMgM,EAAQtJ,EAAIe,MAAM1D,EAAOC,GAC/B,IAAIwI,EAAM,GAEV,IAAK,IAAIlK,EAAI,EAAGA,EAAI0N,EAAM/M,OAAS,EAAGX,GAAK,EACzCkK,GAAO1B,OAAOoC,aAAa8C,EAAM1N,GAAqB,IAAf0N,EAAM1N,EAAI,IAEnD,OAAOkK,CACT,CAiCA,SAASyD,EAAa5L,EAAQ6L,EAAKjN,GACjC,GAAKoB,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAIoC,WAAW,sBAC3D,GAAIpC,EAAS6L,EAAMjN,EAAQ,MAAM,IAAIwD,WAAW,wCAClD,CAyQA,SAAS0J,EAAUzJ,EAAKrB,EAAOhB,EAAQ6L,EAAKjB,EAAK1C,GAC/C,IAAKpG,EAAOqC,SAAS9B,GAAM,MAAM,IAAIM,UAAU,+CAC/C,GAAI3B,EAAQ4J,GAAO5J,EAAQkH,EAAK,MAAM,IAAI9F,WAAW,qCACrD,GAAIpC,EAAS6L,EAAMxJ,EAAIzD,OAAQ,MAAM,IAAIwD,WAAW,qBACtD,CA+FA,SAAS2J,EAAgB1J,EAAKrB,EAAOhB,EAAQkI,EAAK0C,GAChDoB,EAAWhL,EAAOkH,EAAK0C,EAAKvI,EAAKrC,EAAQ,GAEzC,IAAIgI,EAAKhB,OAAOhG,EAAQiL,OAAO,aAC/B5J,EAAIrC,KAAYgI,EAChBA,IAAW,EACX3F,EAAIrC,KAAYgI,EAChBA,IAAW,EACX3F,EAAIrC,KAAYgI,EAChBA,IAAW,EACX3F,EAAIrC,KAAYgI,EAChB,IAAID,EAAKf,OAAOhG,GAASiL,OAAO,IAAMA,OAAO,aAQ7C,OAPA5J,EAAIrC,KAAY+H,EAChBA,IAAW,EACX1F,EAAIrC,KAAY+H,EAChBA,IAAW,EACX1F,EAAIrC,KAAY+H,EAChBA,IAAW,EACX1F,EAAIrC,KAAY+H,EACT/H,CACT,CAEA,SAASkM,EAAgB7J,EAAKrB,EAAOhB,EAAQkI,EAAK0C,GAChDoB,EAAWhL,EAAOkH,EAAK0C,EAAKvI,EAAKrC,EAAQ,GAEzC,IAAIgI,EAAKhB,OAAOhG,EAAQiL,OAAO,aAC/B5J,EAAIrC,EAAS,GAAKgI,EAClBA,IAAW,EACX3F,EAAIrC,EAAS,GAAKgI,EAClBA,IAAW,EACX3F,EAAIrC,EAAS,GAAKgI,EAClBA,IAAW,EACX3F,EAAIrC,EAAS,GAAKgI,EAClB,IAAID,EAAKf,OAAOhG,GAASiL,OAAO,IAAMA,OAAO,aAQ7C,OAPA5J,EAAIrC,EAAS,GAAK+H,EAClBA,IAAW,EACX1F,EAAIrC,EAAS,GAAK+H,EAClBA,IAAW,EACX1F,EAAIrC,EAAS,GAAK+H,EAClBA,IAAW,EACX1F,EAAIrC,GAAU+H,EACP/H,EAAS,CAClB,CAkHA,SAASmM,EAAc9J,EAAKrB,EAAOhB,EAAQ6L,EAAKjB,EAAK1C,GACnD,GAAIlI,EAAS6L,EAAMxJ,EAAIzD,OAAQ,MAAM,IAAIwD,WAAW,sBACpD,GAAIpC,EAAS,EAAG,MAAM,IAAIoC,WAAW,qBACvC,CAEA,SAASgK,EAAY/J,EAAKrB,EAAOhB,EAAQqM,EAAcC,GAOrD,OANAtL,GAASA,EACThB,KAAoB,EACfsM,GACHH,EAAa9J,EAAKrB,EAAOhB,EAAQ,GAEnCF,EAAQqD,MAAMd,EAAKrB,EAAOhB,EAAQqM,EAAc,GAAI,GAC7CrM,EAAS,CAClB,CAUA,SAASuM,EAAalK,EAAKrB,EAAOhB,EAAQqM,EAAcC,GAOtD,OANAtL,GAASA,EACThB,KAAoB,EACfsM,GACHH,EAAa9J,EAAKrB,EAAOhB,EAAQ,GAEnCF,EAAQqD,MAAMd,EAAKrB,EAAOhB,EAAQqM,EAAc,GAAI,GAC7CrM,EAAS,CAClB,CAzkBA8B,EAAOU,UAAUY,MAAQ,SAAgB1D,EAAOC,GAC9C,MAAMrB,EAAMiH,KAAK3G,QACjBc,IAAUA,GAGE,GACVA,GAASpB,GACG,IAAGoB,EAAQ,GACdA,EAAQpB,IACjBoB,EAAQpB,IANVqB,OAAc0E,IAAR1E,EAAoBrB,IAAQqB,GASxB,GACRA,GAAOrB,GACG,IAAGqB,EAAM,GACVA,EAAMrB,IACfqB,EAAMrB,GAGJqB,EAAMD,IAAOC,EAAMD,GAEvB,MAAM8M,EAASjH,KAAKkH,SAAS/M,EAAOC,GAIpC,OAFA2C,OAAOC,eAAeiK,EAAQ1K,EAAOU,WAE9BgK,GAWT1K,EAAOU,UAAUkK,WACjB5K,EAAOU,UAAUmK,WAAa,SAAqB3M,EAAQiD,EAAYqJ,GACrEtM,KAAoB,EACpBiD,KAA4B,EACvBqJ,GAAUV,EAAY5L,EAAQiD,EAAYsC,KAAK3G,QAEpD,IAAIqH,EAAMV,KAAKvF,GACX4M,EAAM,EACN3O,EAAI,EACR,OAASA,EAAIgF,IAAe2J,GAAO,MACjC3G,GAAOV,KAAKvF,EAAS/B,GAAK2O,EAG5B,OAAO3G,GAGTnE,EAAOU,UAAUqK,WACjB/K,EAAOU,UAAUsK,WAAa,SAAqB9M,EAAQiD,EAAYqJ,GACrEtM,KAAoB,EACpBiD,KAA4B,EACvBqJ,GACHV,EAAY5L,EAAQiD,EAAYsC,KAAK3G,QAGvC,IAAIqH,EAAMV,KAAKvF,IAAWiD,GACtB2J,EAAM,EACV,KAAO3J,EAAa,IAAM2J,GAAO,MAC/B3G,GAAOV,KAAKvF,IAAWiD,GAAc2J,EAGvC,OAAO3G,GAGTnE,EAAOU,UAAUuK,UACjBjL,EAAOU,UAAUwK,UAAY,SAAoBhN,EAAQsM,GAGvD,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpC2G,KAAKvF,IAGd8B,EAAOU,UAAUyK,aACjBnL,EAAOU,UAAU0K,aAAe,SAAuBlN,EAAQsM,GAG7D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpC2G,KAAKvF,GAAWuF,KAAKvF,EAAS,IAAM,GAG7C8B,EAAOU,UAAU2K,aACjBrL,EAAOU,UAAUmE,aAAe,SAAuB3G,EAAQsM,GAG7D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACnC2G,KAAKvF,IAAW,EAAKuF,KAAKvF,EAAS,IAG7C8B,EAAOU,UAAU4K,aACjBtL,EAAOU,UAAU6K,aAAe,SAAuBrN,EAAQsM,GAI7D,OAHAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,SAElC2G,KAAKvF,GACTuF,KAAKvF,EAAS,IAAM,EACpBuF,KAAKvF,EAAS,IAAM,IACD,SAAnBuF,KAAKvF,EAAS,IAGrB8B,EAAOU,UAAU8K,aACjBxL,EAAOU,UAAU+K,aAAe,SAAuBvN,EAAQsM,GAI7D,OAHAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QAEpB,SAAf2G,KAAKvF,IACTuF,KAAKvF,EAAS,IAAM,GACrBuF,KAAKvF,EAAS,IAAM,EACrBuF,KAAKvF,EAAS,KAGlB8B,EAAOU,UAAUgL,gBAAkBC,GAAmB,SAA0BzN,GAE9E0N,EADA1N,KAAoB,EACG,UACvB,MAAM2N,EAAQpI,KAAKvF,GACb4N,EAAOrI,KAAKvF,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACzBC,EAAY7N,EAAQuF,KAAK3G,OAAS,GAGpC,MAAMoJ,EAAK2F,EACQ,IAAjBpI,OAAOvF,GACU,MAAjBuF,OAAOvF,GACPuF,OAAOvF,GAAU,GAAK,GAElB+H,EAAKxC,OAAOvF,GACC,IAAjBuF,OAAOvF,GACU,MAAjBuF,OAAOvF,GACP4N,EAAO,GAAK,GAEd,OAAO3B,OAAOjE,IAAOiE,OAAOlE,IAAOkE,OAAO,IAC5C,IAEAnK,EAAOU,UAAUsL,gBAAkBL,GAAmB,SAA0BzN,GAE9E0N,EADA1N,KAAoB,EACG,UACvB,MAAM2N,EAAQpI,KAAKvF,GACb4N,EAAOrI,KAAKvF,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACzBC,EAAY7N,EAAQuF,KAAK3G,OAAS,GAGpC,MAAMmJ,EAAK4F,EAAQ,GAAK,GACL,MAAjBpI,OAAOvF,GACU,IAAjBuF,OAAOvF,GACPuF,OAAOvF,GAEHgI,EAAKzC,OAAOvF,GAAU,GAAK,GACd,MAAjBuF,OAAOvF,GACU,IAAjBuF,OAAOvF,GACP4N,EAEF,OAAQ3B,OAAOlE,IAAOkE,OAAO,KAAOA,OAAOjE,EAC7C,IAEAlG,EAAOU,UAAUuL,UAAY,SAAoB/N,EAAQiD,EAAYqJ,GACnEtM,KAAoB,EACpBiD,KAA4B,EACvBqJ,GAAUV,EAAY5L,EAAQiD,EAAYsC,KAAK3G,QAEpD,IAAIqH,EAAMV,KAAKvF,GACX4M,EAAM,EACN3O,EAAI,EACR,OAASA,EAAIgF,IAAe2J,GAAO,MACjC3G,GAAOV,KAAKvF,EAAS/B,GAAK2O,EAM5B,OAJAA,GAAO,IAEH3G,GAAO2G,IAAK3G,GAAOnF,KAAKC,IAAI,EAAG,EAAIkC,IAEhCgD,GAGTnE,EAAOU,UAAUwL,UAAY,SAAoBhO,EAAQiD,EAAYqJ,GACnEtM,KAAoB,EACpBiD,KAA4B,EACvBqJ,GAAUV,EAAY5L,EAAQiD,EAAYsC,KAAK3G,QAEpD,IAAIX,EAAIgF,EACJ2J,EAAM,EACN3G,EAAMV,KAAKvF,IAAW/B,GAC1B,KAAOA,EAAI,IAAM2O,GAAO,MACtB3G,GAAOV,KAAKvF,IAAW/B,GAAK2O,EAM9B,OAJAA,GAAO,IAEH3G,GAAO2G,IAAK3G,GAAOnF,KAAKC,IAAI,EAAG,EAAIkC,IAEhCgD,GAGTnE,EAAOU,UAAUyL,SAAW,SAAmBjO,EAAQsM,GAGrD,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACtB,IAAf2G,KAAKvF,IAC0B,GAA5B,IAAOuF,KAAKvF,GAAU,GADKuF,KAAKvF,IAI3C8B,EAAOU,UAAU0L,YAAc,SAAsBlO,EAAQsM,GAC3DtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QAC3C,MAAMqH,EAAMV,KAAKvF,GAAWuF,KAAKvF,EAAS,IAAM,EAChD,OAAc,MAANiG,EAAsB,WAANA,EAAmBA,GAG7CnE,EAAOU,UAAU2L,YAAc,SAAsBnO,EAAQsM,GAC3DtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QAC3C,MAAMqH,EAAMV,KAAKvF,EAAS,GAAMuF,KAAKvF,IAAW,EAChD,OAAc,MAANiG,EAAsB,WAANA,EAAmBA,GAG7CnE,EAAOU,UAAU4L,YAAc,SAAsBpO,EAAQsM,GAI3D,OAHAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QAEnC2G,KAAKvF,GACVuF,KAAKvF,EAAS,IAAM,EACpBuF,KAAKvF,EAAS,IAAM,GACpBuF,KAAKvF,EAAS,IAAM,IAGzB8B,EAAOU,UAAU6L,YAAc,SAAsBrO,EAAQsM,GAI3D,OAHAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QAEnC2G,KAAKvF,IAAW,GACrBuF,KAAKvF,EAAS,IAAM,GACpBuF,KAAKvF,EAAS,IAAM,EACpBuF,KAAKvF,EAAS,IAGnB8B,EAAOU,UAAU8L,eAAiBb,GAAmB,SAAyBzN,GAE5E0N,EADA1N,KAAoB,EACG,UACvB,MAAM2N,EAAQpI,KAAKvF,GACb4N,EAAOrI,KAAKvF,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACzBC,EAAY7N,EAAQuF,KAAK3G,OAAS,GAGpC,MAAMqH,EAAMV,KAAKvF,EAAS,GACL,IAAnBuF,KAAKvF,EAAS,GACK,MAAnBuF,KAAKvF,EAAS,IACb4N,GAAQ,IAEX,OAAQ3B,OAAOhG,IAAQgG,OAAO,KAC5BA,OAAO0B,EACU,IAAjBpI,OAAOvF,GACU,MAAjBuF,OAAOvF,GACPuF,OAAOvF,GAAU,GAAK,GAC1B,IAEA8B,EAAOU,UAAU+L,eAAiBd,GAAmB,SAAyBzN,GAE5E0N,EADA1N,KAAoB,EACG,UACvB,MAAM2N,EAAQpI,KAAKvF,GACb4N,EAAOrI,KAAKvF,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACzBC,EAAY7N,EAAQuF,KAAK3G,OAAS,GAGpC,MAAMqH,GAAO0H,GAAS,IACH,MAAjBpI,OAAOvF,GACU,IAAjBuF,OAAOvF,GACPuF,OAAOvF,GAET,OAAQiM,OAAOhG,IAAQgG,OAAO,KAC5BA,OAAO1G,OAAOvF,GAAU,GAAK,GACZ,MAAjBuF,OAAOvF,GACU,IAAjBuF,OAAOvF,GACP4N,EACJ,IAEA9L,EAAOU,UAAUgM,YAAc,SAAsBxO,EAAQsM,GAG3D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpCkB,EAAQ4G,KAAKnB,KAAMvF,GAAQ,EAAM,GAAI,IAG9C8B,EAAOU,UAAUiM,YAAc,SAAsBzO,EAAQsM,GAG3D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpCkB,EAAQ4G,KAAKnB,KAAMvF,GAAQ,EAAO,GAAI,IAG/C8B,EAAOU,UAAUkM,aAAe,SAAuB1O,EAAQsM,GAG7D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpCkB,EAAQ4G,KAAKnB,KAAMvF,GAAQ,EAAM,GAAI,IAG9C8B,EAAOU,UAAUmM,aAAe,SAAuB3O,EAAQsM,GAG7D,OAFAtM,KAAoB,EACfsM,GAAUV,EAAY5L,EAAQ,EAAGuF,KAAK3G,QACpCkB,EAAQ4G,KAAKnB,KAAMvF,GAAQ,EAAO,GAAI,IAS/C8B,EAAOU,UAAUoM,YACjB9M,EAAOU,UAAUqM,YAAc,SAAsB7N,EAAOhB,EAAQiD,EAAYqJ,GAI9E,GAHAtL,GAASA,EACThB,KAAoB,EACpBiD,KAA4B,GACvBqJ,EAAU,CAEbR,EAASvG,KAAMvE,EAAOhB,EAAQiD,EADbnC,KAAKC,IAAI,EAAG,EAAIkC,GAAc,EACK,EACrD,CAED,IAAI2J,EAAM,EACN3O,EAAI,EAER,IADAsH,KAAKvF,GAAkB,IAARgB,IACN/C,EAAIgF,IAAe2J,GAAO,MACjCrH,KAAKvF,EAAS/B,GAAM+C,EAAQ4L,EAAO,IAGrC,OAAO5M,EAASiD,GAGlBnB,EAAOU,UAAUsM,YACjBhN,EAAOU,UAAUuM,YAAc,SAAsB/N,EAAOhB,EAAQiD,EAAYqJ,GAI9E,GAHAtL,GAASA,EACThB,KAAoB,EACpBiD,KAA4B,GACvBqJ,EAAU,CAEbR,EAASvG,KAAMvE,EAAOhB,EAAQiD,EADbnC,KAAKC,IAAI,EAAG,EAAIkC,GAAc,EACK,EACrD,CAED,IAAIhF,EAAIgF,EAAa,EACjB2J,EAAM,EAEV,IADArH,KAAKvF,EAAS/B,GAAa,IAAR+C,IACV/C,GAAK,IAAM2O,GAAO,MACzBrH,KAAKvF,EAAS/B,GAAM+C,EAAQ4L,EAAO,IAGrC,OAAO5M,EAASiD,GAGlBnB,EAAOU,UAAUwM,WACjBlN,EAAOU,UAAUyM,WAAa,SAAqBjO,EAAOhB,EAAQsM,GAKhE,OAJAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,IAAM,GACtDuF,KAAKvF,GAAmB,IAARgB,EACThB,EAAS,GAGlB8B,EAAOU,UAAU0M,cACjBpN,EAAOU,UAAU2M,cAAgB,SAAwBnO,EAAOhB,EAAQsM,GAMtE,OALAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,MAAQ,GACxDuF,KAAKvF,GAAmB,IAARgB,EAChBuE,KAAKvF,EAAS,GAAMgB,IAAU,EACvBhB,EAAS,GAGlB8B,EAAOU,UAAU4M,cACjBtN,EAAOU,UAAU6M,cAAgB,SAAwBrO,EAAOhB,EAAQsM,GAMtE,OALAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,MAAQ,GACxDuF,KAAKvF,GAAWgB,IAAU,EAC1BuE,KAAKvF,EAAS,GAAc,IAARgB,EACbhB,EAAS,GAGlB8B,EAAOU,UAAU8M,cACjBxN,EAAOU,UAAU+M,cAAgB,SAAwBvO,EAAOhB,EAAQsM,GAQtE,OAPAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,WAAY,GAC5DuF,KAAKvF,EAAS,GAAMgB,IAAU,GAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,GAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,EAC9BuE,KAAKvF,GAAmB,IAARgB,EACThB,EAAS,GAGlB8B,EAAOU,UAAUgN,cACjB1N,EAAOU,UAAUiN,cAAgB,SAAwBzO,EAAOhB,EAAQsM,GAQtE,OAPAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,WAAY,GAC5DuF,KAAKvF,GAAWgB,IAAU,GAC1BuE,KAAKvF,EAAS,GAAMgB,IAAU,GAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,EAC9BuE,KAAKvF,EAAS,GAAc,IAARgB,EACbhB,EAAS,GA+ClB8B,EAAOU,UAAUkN,iBAAmBjC,GAAmB,SAA2BzM,EAAOhB,EAAS,GAChG,OAAO+L,EAAexG,KAAMvE,EAAOhB,EAAQiM,OAAO,GAAIA,OAAO,sBAC/D,IAEAnK,EAAOU,UAAUmN,iBAAmBlC,GAAmB,SAA2BzM,EAAOhB,EAAS,GAChG,OAAOkM,EAAe3G,KAAMvE,EAAOhB,EAAQiM,OAAO,GAAIA,OAAO,sBAC/D,IAEAnK,EAAOU,UAAUoN,WAAa,SAAqB5O,EAAOhB,EAAQiD,EAAYqJ,GAG5E,GAFAtL,GAASA,EACThB,KAAoB,GACfsM,EAAU,CACb,MAAMuD,EAAQ/O,KAAKC,IAAI,EAAI,EAAIkC,EAAc,GAE7C6I,EAASvG,KAAMvE,EAAOhB,EAAQiD,EAAY4M,EAAQ,GAAIA,EACvD,CAED,IAAI5R,EAAI,EACJ2O,EAAM,EACNkD,EAAM,EAEV,IADAvK,KAAKvF,GAAkB,IAARgB,IACN/C,EAAIgF,IAAe2J,GAAO,MAC7B5L,EAAQ,GAAa,IAAR8O,GAAsC,IAAzBvK,KAAKvF,EAAS/B,EAAI,KAC9C6R,EAAM,GAERvK,KAAKvF,EAAS/B,IAAO+C,EAAQ4L,GAAQ,GAAKkD,EAAM,IAGlD,OAAO9P,EAASiD,GAGlBnB,EAAOU,UAAUuN,WAAa,SAAqB/O,EAAOhB,EAAQiD,EAAYqJ,GAG5E,GAFAtL,GAASA,EACThB,KAAoB,GACfsM,EAAU,CACb,MAAMuD,EAAQ/O,KAAKC,IAAI,EAAI,EAAIkC,EAAc,GAE7C6I,EAASvG,KAAMvE,EAAOhB,EAAQiD,EAAY4M,EAAQ,GAAIA,EACvD,CAED,IAAI5R,EAAIgF,EAAa,EACjB2J,EAAM,EACNkD,EAAM,EAEV,IADAvK,KAAKvF,EAAS/B,GAAa,IAAR+C,IACV/C,GAAK,IAAM2O,GAAO,MACrB5L,EAAQ,GAAa,IAAR8O,GAAsC,IAAzBvK,KAAKvF,EAAS/B,EAAI,KAC9C6R,EAAM,GAERvK,KAAKvF,EAAS/B,IAAO+C,EAAQ4L,GAAQ,GAAKkD,EAAM,IAGlD,OAAO9P,EAASiD,GAGlBnB,EAAOU,UAAUwN,UAAY,SAAoBhP,EAAOhB,EAAQsM,GAM9D,OALAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,KAAO,KACnDgB,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCuE,KAAKvF,GAAmB,IAARgB,EACThB,EAAS,GAGlB8B,EAAOU,UAAUyN,aAAe,SAAuBjP,EAAOhB,EAAQsM,GAMpE,OALAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,OAAS,OACzDuF,KAAKvF,GAAmB,IAARgB,EAChBuE,KAAKvF,EAAS,GAAMgB,IAAU,EACvBhB,EAAS,GAGlB8B,EAAOU,UAAU0N,aAAe,SAAuBlP,EAAOhB,EAAQsM,GAMpE,OALAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,OAAS,OACzDuF,KAAKvF,GAAWgB,IAAU,EAC1BuE,KAAKvF,EAAS,GAAc,IAARgB,EACbhB,EAAS,GAGlB8B,EAAOU,UAAU2N,aAAe,SAAuBnP,EAAOhB,EAAQsM,GAQpE,OAPAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,YAAa,YAC7DuF,KAAKvF,GAAmB,IAARgB,EAChBuE,KAAKvF,EAAS,GAAMgB,IAAU,EAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,GAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,GACvBhB,EAAS,GAGlB8B,EAAOU,UAAU4N,aAAe,SAAuBpP,EAAOhB,EAAQsM,GASpE,OARAtL,GAASA,EACThB,KAAoB,EACfsM,GAAUR,EAASvG,KAAMvE,EAAOhB,EAAQ,EAAG,YAAa,YACzDgB,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5CuE,KAAKvF,GAAWgB,IAAU,GAC1BuE,KAAKvF,EAAS,GAAMgB,IAAU,GAC9BuE,KAAKvF,EAAS,GAAMgB,IAAU,EAC9BuE,KAAKvF,EAAS,GAAc,IAARgB,EACbhB,EAAS,GAGlB8B,EAAOU,UAAU6N,gBAAkB5C,GAAmB,SAA0BzM,EAAOhB,EAAS,GAC9F,OAAO+L,EAAexG,KAAMvE,EAAOhB,GAASiM,OAAO,sBAAuBA,OAAO,sBACnF,IAEAnK,EAAOU,UAAU8N,gBAAkB7C,GAAmB,SAA0BzM,EAAOhB,EAAS,GAC9F,OAAOkM,EAAe3G,KAAMvE,EAAOhB,GAASiM,OAAO,sBAAuBA,OAAO,sBACnF,IAiBAnK,EAAOU,UAAU+N,aAAe,SAAuBvP,EAAOhB,EAAQsM,GACpE,OAAOF,EAAW7G,KAAMvE,EAAOhB,GAAQ,EAAMsM,IAG/CxK,EAAOU,UAAUgO,aAAe,SAAuBxP,EAAOhB,EAAQsM,GACpE,OAAOF,EAAW7G,KAAMvE,EAAOhB,GAAQ,EAAOsM,IAahDxK,EAAOU,UAAUiO,cAAgB,SAAwBzP,EAAOhB,EAAQsM,GACtE,OAAOC,EAAYhH,KAAMvE,EAAOhB,GAAQ,EAAMsM,IAGhDxK,EAAOU,UAAUkO,cAAgB,SAAwB1P,EAAOhB,EAAQsM,GACtE,OAAOC,EAAYhH,KAAMvE,EAAOhB,GAAQ,EAAOsM,IAIjDxK,EAAOU,UAAUkB,KAAO,SAAeqH,EAAQ4F,EAAajR,EAAOC,GACjE,IAAKmC,EAAOqC,SAAS4G,GAAS,MAAM,IAAIpI,UAAU,+BAQlD,GAPKjD,IAAOA,EAAQ,GACfC,GAAe,IAARA,IAAWA,EAAM4F,KAAK3G,QAC9B+R,GAAe5F,EAAOnM,SAAQ+R,EAAc5F,EAAOnM,QAClD+R,IAAaA,EAAc,GAC5BhR,EAAM,GAAKA,EAAMD,IAAOC,EAAMD,GAG9BC,IAAQD,EAAO,OAAO,EAC1B,GAAsB,IAAlBqL,EAAOnM,QAAgC,IAAhB2G,KAAK3G,OAAc,OAAO,EAGrD,GAAI+R,EAAc,EAChB,MAAM,IAAIvO,WAAW,6BAEvB,GAAI1C,EAAQ,GAAKA,GAAS6F,KAAK3G,OAAQ,MAAM,IAAIwD,WAAW,sBAC5D,GAAIzC,EAAM,EAAG,MAAM,IAAIyC,WAAW,2BAG9BzC,EAAM4F,KAAK3G,SAAQe,EAAM4F,KAAK3G,QAC9BmM,EAAOnM,OAAS+R,EAAchR,EAAMD,IACtCC,EAAMoL,EAAOnM,OAAS+R,EAAcjR,GAGtC,MAAMpB,EAAMqB,EAAMD,EAalB,OAXI6F,OAASwF,GAAqD,mBAApC1L,WAAWmD,UAAUoO,WAEjDrL,KAAKqL,WAAWD,EAAajR,EAAOC,GAEpCN,WAAWmD,UAAU6H,IAAIjE,KACvB2E,EACAxF,KAAKkH,SAAS/M,EAAOC,GACrBgR,GAIGrS,GAOTwD,EAAOU,UAAUmH,KAAO,SAAe1D,EAAKvG,EAAOC,EAAKoD,GAEtD,GAAmB,iBAARkD,EAAkB,CAS3B,GARqB,iBAAVvG,GACTqD,EAAWrD,EACXA,EAAQ,EACRC,EAAM4F,KAAK3G,QACa,iBAARe,IAChBoD,EAAWpD,EACXA,EAAM4F,KAAK3G,aAEIyF,IAAbtB,GAA8C,iBAAbA,EACnC,MAAM,IAAIJ,UAAU,6BAEtB,GAAwB,iBAAbI,IAA0BjB,EAAOkB,WAAWD,GACrD,MAAM,IAAIJ,UAAU,qBAAuBI,GAE7C,GAAmB,IAAfkD,EAAIrH,OAAc,CACpB,MAAMW,EAAO0G,EAAIzH,WAAW,IACV,SAAbuE,GAAuBxD,EAAO,KAClB,WAAbwD,KAEFkD,EAAM1G,EAET,CACL,KAA4B,iBAAR0G,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAMe,OAAOf,IAIf,GAAIvG,EAAQ,GAAK6F,KAAK3G,OAASc,GAAS6F,KAAK3G,OAASe,EACpD,MAAM,IAAIyC,WAAW,sBAGvB,GAAIzC,GAAOD,EACT,OAAO6F,KAQT,IAAItH,EACJ,GANAyB,KAAkB,EAClBC,OAAc0E,IAAR1E,EAAoB4F,KAAK3G,OAASe,IAAQ,EAE3CsG,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAKhI,EAAIyB,EAAOzB,EAAI0B,IAAO1B,EACzBsH,KAAKtH,GAAKgI,MAEP,CACL,MAAM0F,EAAQ7J,EAAOqC,SAAS8B,GAC1BA,EACAnE,EAAOe,KAAKoD,EAAKlD,GACfzE,EAAMqN,EAAM/M,OAClB,GAAY,IAARN,EACF,MAAM,IAAIqE,UAAU,cAAgBsD,EAClC,qCAEJ,IAAKhI,EAAI,EAAGA,EAAI0B,EAAMD,IAASzB,EAC7BsH,KAAKtH,EAAIyB,GAASiM,EAAM1N,EAAIK,EAE/B,CAED,OAAOiH,MAOT,MAAMsL,EAAS,CAAA,EACf,SAASC,EAAGC,EAAKC,EAAYC,GAC3BJ,EAAOE,GAAO,cAAwBE,EACpCC,WAAAA,GACEC,QAEA7O,OAAOiH,eAAehE,KAAM,UAAW,CACrCvE,MAAOgQ,EAAWlI,MAAMvD,KAAMN,WAC9BmM,UAAU,EACVC,cAAc,IAIhB9L,KAAK+L,KAAQ,GAAE/L,KAAK+L,SAASP,KAG7BxL,KAAKgM,aAEEhM,KAAK+L,IACb,CAED,QAAI/R,GACF,OAAOwR,CACR,CAED,QAAIxR,CAAMyB,GACRsB,OAAOiH,eAAehE,KAAM,OAAQ,CAClC8L,cAAc,EACd7H,YAAY,EACZxI,QACAoQ,UAAU,GAEb,CAEDrM,QAAAA,GACE,MAAQ,GAAEQ,KAAK+L,SAASP,OAASxL,KAAKiM,SACvC,EAEL,CA+BA,SAASC,EAAuBxL,GAC9B,IAAIkC,EAAM,GACNlK,EAAIgI,EAAIrH,OACZ,MAAMc,EAAmB,MAAXuG,EAAI,GAAa,EAAI,EACnC,KAAOhI,GAAKyB,EAAQ,EAAGzB,GAAK,EAC1BkK,EAAO,IAAGlC,EAAI7C,MAAMnF,EAAI,EAAGA,KAAKkK,IAElC,MAAQ,GAAElC,EAAI7C,MAAM,EAAGnF,KAAKkK,GAC9B,CAYA,SAAS6D,EAAYhL,EAAOkH,EAAK0C,EAAKvI,EAAKrC,EAAQiD,GACjD,GAAIjC,EAAQ4J,GAAO5J,EAAQkH,EAAK,CAC9B,MAAMnC,EAAmB,iBAARmC,EAAmB,IAAM,GAC1C,IAAIwJ,EAWJ,MARIA,EAFAzO,EAAa,EACH,IAARiF,GAAaA,IAAQ+D,OAAO,GACrB,OAAMlG,YAAYA,QAA2B,GAAlB9C,EAAa,KAAS8C,IAEjD,SAAQA,QAA2B,GAAlB9C,EAAa,GAAS,IAAI8C,iBACtB,GAAlB9C,EAAa,GAAS,IAAI8C,IAG/B,MAAKmC,IAAMnC,YAAY6E,IAAM7E,IAElC,IAAI8K,EAAOc,iBAAiB,QAASD,EAAO1Q,EACnD,EAtBH,SAAsBqB,EAAKrC,EAAQiD,GACjCyK,EAAe1N,EAAQ,eACHqE,IAAhBhC,EAAIrC,SAAsDqE,IAA7BhC,EAAIrC,EAASiD,IAC5C4K,EAAY7N,EAAQqC,EAAIzD,QAAUqE,EAAa,GAEnD,CAkBE2O,CAAYvP,EAAKrC,EAAQiD,EAC3B,CAEA,SAASyK,EAAgB1M,EAAOsQ,GAC9B,GAAqB,iBAAVtQ,EACT,MAAM,IAAI6P,EAAOgB,qBAAqBP,EAAM,SAAUtQ,EAE1D,CAEA,SAAS6M,EAAa7M,EAAOpC,EAAQ2F,GACnC,GAAIzD,KAAKO,MAAML,KAAWA,EAExB,MADA0M,EAAe1M,EAAOuD,GAChB,IAAIsM,EAAOc,iBAAiBpN,GAAQ,SAAU,aAAcvD,GAGpE,GAAIpC,EAAS,EACX,MAAM,IAAIiS,EAAOiB,yBAGnB,MAAM,IAAIjB,EAAOc,iBAAiBpN,GAAQ,SACP,MAAKA,EAAO,EAAI,YAAY3F,IAC7BoC,EACpC,CAvFA8P,EAAE,4BACA,SAAUQ,GACR,OAAIA,EACM,GAAEA,gCAGL,gDACR,GAAElP,YACL0O,EAAE,wBACA,SAAUQ,EAAMpO,GACd,MAAQ,QAAOoO,4DAA+DpO,GAC/E,GAAEP,WACLmO,EAAE,oBACA,SAAUrJ,EAAKiK,EAAOK,GACpB,IAAIC,EAAO,iBAAgBvK,sBACvBwK,EAAWF,EAWf,OAVI/K,OAAOkL,UAAUH,IAAUjR,KAAKK,IAAI4Q,GAAS,GAAK,GACpDE,EAAWR,EAAsBhL,OAAOsL,IACd,iBAAVA,IAChBE,EAAWxL,OAAOsL,IACdA,EAAQ9F,OAAO,IAAMA,OAAO,KAAO8F,IAAU9F,OAAO,IAAMA,OAAO,QACnEgG,EAAWR,EAAsBQ,IAEnCA,GAAY,KAEdD,GAAQ,eAAcN,eAAmBO,IAClCD,CACR,GAAE5P,YAiEL,MAAM+P,EAAoB,oBAgB1B,SAAShN,EAAarC,EAAQgF,GAE5B,IAAIO,EADJP,EAAQA,GAASjH,IAEjB,MAAMjC,EAASkE,EAAOlE,OACtB,IAAIwT,EAAgB,KACpB,MAAMzG,EAAQ,GAEd,IAAK,IAAI1N,EAAI,EAAGA,EAAIW,IAAUX,EAAG,CAI/B,GAHAoK,EAAYvF,EAAOtE,WAAWP,GAG1BoK,EAAY,OAAUA,EAAY,MAAQ,CAE5C,IAAK+J,EAAe,CAElB,GAAI/J,EAAY,MAAQ,EAEjBP,GAAS,IAAM,GAAG6D,EAAM1M,KAAK,IAAM,IAAM,KAC9C,QACV,CAAe,GAAIhB,EAAI,IAAMW,EAAQ,EAEtBkJ,GAAS,IAAM,GAAG6D,EAAM1M,KAAK,IAAM,IAAM,KAC9C,QACD,CAGDmT,EAAgB/J,EAEhB,QACD,CAGD,GAAIA,EAAY,MAAQ,EACjBP,GAAS,IAAM,GAAG6D,EAAM1M,KAAK,IAAM,IAAM,KAC9CmT,EAAgB/J,EAChB,QACD,CAGDA,EAAkE,OAArD+J,EAAgB,OAAU,GAAK/J,EAAY,MACzD,MAAU+J,IAEJtK,GAAS,IAAM,GAAG6D,EAAM1M,KAAK,IAAM,IAAM,KAMhD,GAHAmT,EAAgB,KAGZ/J,EAAY,IAAM,CACpB,IAAKP,GAAS,GAAK,EAAG,MACtB6D,EAAM1M,KAAKoJ,EACjB,MAAW,GAAIA,EAAY,KAAO,CAC5B,IAAKP,GAAS,GAAK,EAAG,MACtB6D,EAAM1M,KACJoJ,GAAa,EAAM,IACP,GAAZA,EAAmB,IAE3B,MAAW,GAAIA,EAAY,MAAS,CAC9B,IAAKP,GAAS,GAAK,EAAG,MACtB6D,EAAM1M,KACJoJ,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAE3B,KAAW,MAAIA,EAAY,SASrB,MAAM,IAAI7I,MAAM,sBARhB,IAAKsI,GAAS,GAAK,EAAG,MACtB6D,EAAM1M,KACJoJ,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,IAItB,CACF,CAED,OAAOsD,CACT,CA2BA,SAASvG,EAAeqC,GACtB,OAAOjG,EAAOzD,YAxHhB,SAAsB0J,GAMpB,IAFAA,GAFAA,EAAMA,EAAI4K,MAAM,KAAK,IAEXvH,OAAOD,QAAQsH,EAAmB,KAEpCvT,OAAS,EAAG,MAAO,GAE3B,KAAO6I,EAAI7I,OAAS,GAAM,GACxB6I,GAAY,IAEd,OAAOA,CACT,CA4G4B6K,CAAY7K,GACxC,CAEA,SAASF,EAAYgL,EAAKC,EAAKxS,EAAQpB,GACrC,IAAIX,EACJ,IAAKA,EAAI,EAAGA,EAAIW,KACTX,EAAI+B,GAAUwS,EAAI5T,QAAYX,GAAKsU,EAAI3T,UADpBX,EAExBuU,EAAIvU,EAAI+B,GAAUuS,EAAItU,GAExB,OAAOA,CACT,CAKA,SAASwF,EAAYS,EAAKK,GACxB,OAAOL,aAAeK,GACZ,MAAPL,GAAkC,MAAnBA,EAAIgN,aAA+C,MAAxBhN,EAAIgN,YAAYI,MACzDpN,EAAIgN,YAAYI,OAAS/M,EAAK+M,IACpC,CACA,SAAShN,EAAaJ,GAEpB,OAAOA,GAAQA,CACjB,CAIA,MAAMwH,EAAuB,WAC3B,MAAM+G,EAAW,mBACXC,EAAQ,IAAIpT,MAAM,KACxB,IAAK,IAAIrB,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,MAAM0U,EAAU,GAAJ1U,EACZ,IAAK,IAAI6I,EAAI,EAAGA,EAAI,KAAMA,EACxB4L,EAAMC,EAAM7L,GAAK2L,EAASxU,GAAKwU,EAAS3L,EAE3C,CACD,OAAO4L,CACT,CAV6B,GAa7B,SAASjF,EAAoBmF,GAC3B,MAAyB,oBAAX3G,OAAyB4G,EAAyBD,CAClE,CAEA,SAASC,IACP,MAAM,IAAIrT,MAAM,uBAClB,MCtjEO,MAAMsT,EAAmB,IAAIC,YAAU,+CAGT,IAAIA,EAAAA,UAAU,+CAG5C,MAAMC,EAA8B,IAAID,YAAU,gDAG9B,IAAIA,EAAAA,UAAU,+CAGT,IAAIA,EAAAA,UAAU,yDC4H9CzQ,OAAAiH,eAAA0J,EAAA,aAAA,CAAAjS,OAAA,kjBAEKiS,EAAAC,SAAAD,EAAAE,KAAAF,EAAAG,KAAAC,GAAAJ,EAAAI,KAAAJ,EAAAK,yBAAAL,EAAAM,MAAAN,EAAAO,IAAAP,EAAAQ,KAAAC,GAAAT,EAAAS,OAAAT,EAAAU,MAAAV,EAAAW,IAAAX,EAAAY,MAAAZ,EAAAa,IAAAb,EAAAc,OAAAd,EAAAe,MAAAf,EAAAgB,MAAAhB,EAAAiB,MAAAjB,EAAAkB,MAAAlB,EAAAmB,MAAAnB,EAAAoB,KAAApB,EAAAqB,IAAArB,EAAAsB,IAAAtB,EAAAuB,IAAAvB,EAAAwB,SAAA,EACL,MAAAC,EAACjT,EAID,SAAAkT,EAAA1Q,GAJA,KAAAA,aAAA5E,YAMA,MAAA,IAAAsD,UAAA,0BAGA,SAAAiS,EAAA3Q,UAKA0Q,EAAA1Q,iDAL0BgP,EAAA0B,gBAAAA,yBA6B1B,MAAAE,cAEAC,EAAAC,+IAmGA9Q,EAAAjE,GACA,GAAA,EAAAuF,KAAAuP,KAEA,MAAA,IAAA1S,WAAA,uCAoBA4S,SAAAA,CAAAD,GACA,MAAAE,EAAA3S,OAAA4S,OAAAhE,KAAAA,YAAA1O,kBAEAF,OAAA6S,OAAAF,EAAA1P,qBAvIA6P,SAAAA,CAAAC,cAyKQC,EAAAhE,EAAAtJ,GACR,OAAAA,EAAA+M,SALAzD,EAAA,IAAAtJ,EAAA+M,SAKA,8DAmCAQ,SAAAC,EAAAC,MACA,mBAAAD,EACA,MAAA,IAAA7S,UAAA,gCAEAL,OAAAE,UAAAkT,eAAAtP,KAAAoP,EAAA,WACA,MAAA,IAAAhW,MAAA,sCAEI,KAAAiW,GAAUA,aAAAZ,GACd,MAAA,IAAAlS,UAAA,2BAEC,GAAAL,OAAAE,UAAAkT,eAAAtP,KAAAqP,EAAA,qBACqB,MAAA,IAAAjW,oDAEtBmW,QAAAF,EACAA,EAAAG,kBAAAJ,IACAK,8BAAAL,EACAlT,OAAAiH,eAAAiM,EAAAhT,UAAA,SAAA,CACAxB,KAAAA,CAAAiD,EAAAjE,GACA,OAAAyV,EAAAK,OAAAvQ,KAAAtB,EAAAjE,EACA,EACAoR,UAAA,WAEA7H,eAAAiM,EAAA,SAAA,CACAxU,MAAAiD,CAAAA,EAAAjE,IACAyV,EAAAM,OAAA9R,EAAAjE,GAEAoR,UAAA,uBAqBA4E,OAAAA,GAiBA,MAAA,IAAAxW,MAAA,kDAqBA,MAAAyW,UAAAC,cACAC,EAAA,EAAApB,GAEA,IAAA/N,OAAAkL,UAAAiE,OAAAA,kEAGAhF,OAAY,EAAA4D,GAKZxP,KAAA4Q,YAAgBA,CACX,CAGLH,OAAAA,GACK,OAAA,EAGLD,MAAAA,CAAA9R,EAAAjE,EAAA,GAEC2U,EAAA1Q,GACmB,MAAAmS,EAAAnS,EAAArF,SACpB,OAAAkC,KAAAO,MAAA+U,OAAAD,YACA,CA9BAL,MAAAA,CAAAvD,EAAAtO,EAAAjE,GAiCA,OAAA,mBA0BA,MAAAqW,UAAAH,EAEChF,WAAAA,CAAAuE,EAAAzV,EAAA,EAAA+U,QACWU,aAAAZ,GACZ,MAAA,IAAAlS,UAAA,2BAIA,IAAAqE,OAAAkL,UAAAlS,GACA,MAAA,IAAA2C,UAAA,iFAaA4C,KAAAvF,OAAkBA,EAIbgW,OAAAA,GACL,OAAAzQ,KAAAkQ,kBAAAa,GACW/Q,KAASkQ,kBAAMc,CAC1B,CAGIR,MAAAA,CAAA9R,EAAejE,EAAY,GAC/B,OAA0BuF,KAAAkQ,OAAAM,OAAI9R,EAAWjE,EAAIuF,KAAEvF,OAC/C,CAxCA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GA2CA,OAAAyV,KAAAA,OAAAK,OAAAvD,EAAAtO,EAAAjE,EAAAuF,KAAAvF,0CAoBY6U,cACZC,EAAAC,GAGA,GAFS5D,MAAA2D,EAAAC,GAET,EAAAxP,KAAAuP,KACoB,MAAI,IAAE1S,WAAA,+BAErB,CAGL2T,MAAAA,CAA0B9R,EAAAjE,EAAkB,GAC5C,OAAA4U,EAAyB3Q,GAAA0I,WAAA3M,EAAAuF,KAAAuP,MAGdgB,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEX,OApBA4U,EAkBW3Q,GAAA4K,YAAA0D,EAAAvS,EAAAuF,KAAAuP,MAEXvP,KAAAuP,eAoBS,MAAAyB,UAAA1B,cACJC,EAAAC,GAGL,GAFA5D,MAAA2D,EAAAC,GAEA,EAAAxP,KAAeuP,KACV,MAAA,IAAA1S,WAAA,+BAED,CAGC2T,MAAAA,CAAA9R,EAAAjE,EAAA,GACJ,OAAA4U,EAAA3Q,GAAA6I,WAAA9M,EAAAuF,KAAAuP,MAGDgB,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEA,OApBA4U,EAkBA3Q,GAAA8K,YAAAwD,EAAAvS,EAAAuF,KAAAuP,MAEAvP,KAAAuP,iCAoBMD,cACFC,EAAAC,GAGJ,GAFA5D,MAAA2D,EAAAC,GAEA,EAAAxP,KAAAuP,KACoB,MAAI,IAAE1S,WAAA,+BAElB,CAGH2T,MAAAA,CAAA9R,EAAAjE,EAAA,GACL,OAAA4U,EAAA3Q,GAAA8J,UAAA/N,EAAAuF,KAAAuP,MAGAgB,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEA,OApBA4U,EAkBA3Q,GAAA2L,WAAA2C,EAAAvS,EAAAuF,KAAAuP,MAEAvP,KAAAuP,8BAoBAD,mBAIQ,GAFR1D,MAAA2D,EAAAC,GAEQ,EAAAxP,KAAUuP,KACS,MAAA,eAAO,+BAElC,CAGAiB,MAAAA,GAAoB/V,EAAuB,GACnC,OAAA4U,EAAO3Q,GAAA+J,UAAgChO,EAAEuF,KAAAuP,MAG5CgB,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEe,OApBpB4U,EAkBK3Q,GAAA8L,WAAAwC,EAAAvS,EAAAuF,KAAAuP,MAEevP,KAAAuP,IAEpB,EAEA7B,EAAAuD,MAAAA,EACAC,MAAAA,EAAA3V,KAAAC,IAAA,EAAA,IAGA,SAAA2V,EAAAnE,GACA,MAAAoE,EAAA7V,KAAAO,MAAAkR,EAAAkE,GAEA,MAAA,CAAAE,OAAAC,KADArE,EAAAoE,EAAAF,EAEA,8BAkBKI,MAAAA,UAAAhC,EACJ3D,WAAAA,CAAA6D,GACgB5D,MAAA,EAAA4D,UAGjB9Q,EAAAjE,EAAA,GACA,MAAAD,EAAA6U,EAAA3Q,GAEA2S,EAAA7W,EAAAsN,aAAArN,GAEA,OAAA8W,EADA/W,EAAAsN,aAAArN,EAAA,GACA4W,GAGAd,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GACM,MAAAqS,EAAAqE,EAAAnE,GACFxS,EAAA6U,EAAA3Q,GAGJ,OAFAlE,EAAAwP,cAAA8C,EAAAuE,KAAA5W,GArBAD,EAAAwP,cAAA8C,EAqBAsE,KAAA3W,EAAA,GAEA,kBAgBmB+W,MAAAA,UAAAlC,EACnB3D,WAAAA,CAAA6D,GACA5D,MAAA,EAAA4D,UAGA9Q,EAAAjE,EAAA,GACA,MAAAD,EAAA6U,EAAA3Q,GAIA,OAAA6S,EAFA/W,EAAAwN,aAAAvN,GACAD,EAAAwN,aAAAvN,EAAA,IAIA8V,MAAAA,CAAAvD,MAAiB,GACZ,MAAAF,EAAAqE,EAAAnE,GACLxS,EAAA6U,EAAA3Q,GAGA,OAFAlE,EAAA0P,cAAA4C,EAAAsE,KAAA3W,GArBAD,EAAA0P,cAAA4C,EAAAuE,KAqBA5W,EAAA,GAEA,oBAgBAgX,MAAAA,UAAAnC,EACA3D,WAAAA,CAAA6D,GACM5D,MAAA,EAAA4D,UAGD9Q,EAAAjE,EAAA,GACL,MAAAD,EAAA6U,EAAA3Q,GAEQ2S,EAAyB7W,EAAAsN,aAAArN,GAEjC,OAAA8W,EADK/W,EAAAqO,YAAApO,EAAA,GACL4W,GAGQd,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAS,GACZ,MAAAqS,EAAAqE,EAAAnE,GACJxS,EAAA6U,EAAA3Q,GAGD,OAFelE,EAAAwP,cAAA8C,EAAAuE,KAAA5W,GArBfD,EAAAoQ,aAAAkC,EAqBesE,KAAA3W,EAAA,GAEf,iBAgBKiX,MAAAA,UAAApC,EACL3D,WAAAA,CAAA6D,GACI5D,MAAM,EAAA4D,UAGL9Q,EAAAjE,EAAA,GACJ,MAAAD,EAAA6U,EAAA3Q,GAID,OAAA6S,EAFA/W,EAAAsO,YAAArO,GACAD,EAAAwN,aAAAvN,EAAA,IAIA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GACA,MAAAqS,EAAAqE,EAAAnE,GACAxS,EAAA6U,EAAA3Q,GAGA,OAFAlE,EAAAqQ,aAAAiC,EAAAsE,KAAA3W,GArBAD,EAAA0P,cAAA4C,EAqBAuE,KAAA5W,EAAA,GAEA,mBAeAkX,MAAAA,UAAArC,EACA3D,WAAAA,CAAA6D,GACA5D,MAAA,EAAA4D,EACA,CAGAgB,MAAAA,CAAA9R,EAAAjE,EAAA,GACA,OAAA4U,EAAA3Q,GAAAuK,YAAAxO,GAGA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEA,OAjBA4U,EAeA3Q,GAAAsM,aAAAgC,EAAAvS,GAEA,aAeAmX,MAAAA,UAAmBtC,EACnB3D,WAAAA,CAAoB6D,GACpB5D,MAAA,EAAA4D,EACA,CAGAgB,MAAAA,CAAA9R,EAAAjE,EAAA,GACA,OAAA4U,EAA0B3Q,GAAAwK,YAAiBzO,GAG3C8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEA,OAjBA4U,EAeA3Q,GAAAuM,aAAA+B,EAAAvS,GAEA,eAeSoX,MAAAA,UAAAvC,EACI3D,WAAAA,CAAA6D,GACb5D,MAAA,EAAA4D,EACA,CAGagB,MAAAA,CAAA9R,EAAAjE,EAAA,GACJ,OAAA4U,EAAA3Q,GAAAyK,aAAA1O,GAGT8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAEA,OAjBA4U,EAeA3Q,GAAAwM,cAAA8B,EAAAvS,GAEA,cAeAqX,MAAAA,UAAAxC,EACA3D,WAAAA,CAAA6D,GACA5D,MAAA,EAAA4D,EACA,CAGAgB,MAAAA,CAAA9R,EAAAjE,EAAA,GACA,OAAA4U,EAAA3Q,GAAA0K,aAAA3O,GAGQ8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAER,OAjBA4U,EAAA3Q,GAeQyM,cAAA6B,EAAAvS,GAER,gBAwBA,MAAAsX,UAAAzC,EACA3D,WAAAA,CAAAqG,EAAAC,EAAAzC,GACA,KAAAwC,aAAA1C,GACA,MAAA,IAAAlS,UAAA,kCAEA,KAAA6U,aAAAtB,GAAAsB,EAAAxB,WACAhP,OAAAkL,UAAAsF,OAAAA,GACA,MAAA,IAAA7U,UAAA,gFAGAmS,GAAA,IAEA0C,aAAAtB,IAEA,EAAAqB,EAAAzC,OACAA,EAAA0C,EAAAD,EAAAzC,sCAYAvP,KAAAiS,MAAAA,UAGAvT,EAAAjE,EAAA,GACA,GAAA,GAAAuF,KAAgBuP,KACH,OAAAvP,KAAAuP,SAEbA,EAAA,EACQ0C,EAAIjS,KAAAiS,MAGJ,GAFIA,aAAatB,IAChBsB,EAAAA,EAAAzB,OAAA9R,EAAAjE,IACD,EAAAuF,KAAAgS,cAAUzC,KAClBA,EAAA0C,EAAAjS,KAAAgS,cAAAzC,cAGA2C,EAAA,EACA,KAAAA,EAAAD,GACA1C,GAAAvP,KAAAgS,cAAAG,QAAAzT,EAAAjE,EAAA8U,KACA2C,CAGA,CACA,OAAA3C,SAGA7Q,EAAQjE,EAAK,GACbiV,MAAAA,EAAA,OACAhX,EAAA,EACAuZ,EAAAjS,KAAAiS,MAIAvZ,IAHAuZ,aAAAtB,IACAsB,EAAAA,EAAAzB,OAAA9R,EAAAjE,IAEA/B,EAAAuZ,GACAvC,EAAAhW,KAAAsY,KAAAA,cAAAxB,OAAA9R,EAAAjE,IACAA,QAAAuX,cAAAG,QAAAzT,EAAAjE,GAEK/B,GAAA,WAcG6X,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GACR,MAAA2X,EAAkBpS,KAAAgS,cACTzC,EAAAvC,EAAAqF,SAAA9C,EAAA+C,IACD/C,EAAA6C,EAAA7B,OAAA+B,EAAA5T,EAAAjE,EAAA8U,IACH,GAIL,OAHA0C,KAAAA,iBAAAtB,GACA3Q,KAAAiS,MAAA1B,OAAAvD,EAAA3T,OAAAqF,EAAAjE,GAEA8U,gBAuCA,MAAAgD,UAAAjD,EACA3D,WAAAA,CAAA6G,EAAAhD,EAAAiD,GACA,IAAA1Y,MAAAkF,QAAAuT,KACAA,EAAAH,QAAAK,CAAAA,EAAAJ,IAAAI,GAAAJ,aAAAhD,IAAA,GACA,MAAA,IAAAlS,UAAsC,4CAEtC,kBAAAoS,QAEA1Q,IAAA2T,IACAA,EAAqBjD,EACrBA,OAAiB1Q,OAGJ,MAAA6T,KAAAH,EACJ,GAAAG,EAAAA,EAAApD,WAEJzQ,IAAA6T,EAAAnD,SACL,MAAA,IAAAvV,MAAA,wDAEA,IAAAsV,GAAA,EACA,IACAA,EAAAiD,EAAAH,QAAA9C,CAAAA,EAAAoD,IAAApD,EAAAoD,EAAAR,WAAA,EACA,CAEA,MAAAtX,6BA0BSmF,KAAAyS,iBAAAA,UAGT/T,EAAAjE,EAAkB,GACF,GAAA,QAAA8U,KACH,OAAAvP,KAAAuP,KAEb,IAAAA,EAAA,MAEAA,EAAAvP,KAAAwS,OAAAH,QAAA9C,CAAAA,EAAAoD,KACA,MAAAC,EAAAD,EAAAR,QAAAzT,EAAAjE,GACa,OADbA,GAAgBmY,EACHrD,EAAAqD,CAAA,GACJ,EACD,CACH,MAAA/X,GAEY,MAAA,IAAAgC,WAAA,qBACjB,CACA,OAAA0S,EAGA,MAAAiB,CAAA9R,EAAAjE,EAAA,GACA2U,EAAA1Q,GACAmU,MAAAA,OAAAvC,4BACA,MAAAqC,KAAA3S,KAAAwS,OAKA,QAJA1T,IAAA6T,EAAAnD,aACAmD,EAAAnD,UAAAmD,EAAAnC,OAAA9R,EAAAjE,IAEAA,GAAAkY,EAAAR,QAAAzT,EAAAjE,GACAuF,KAAAyS,gBACA/T,EAAArF,SAAAoB,EACA,eAWA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,KACUqY,MAAAA,EAAUrY,EACpBsY,IAAAA,EAAkB,EACbC,EAAA,YACLL,KAAA3S,KAAAwS,OAAA,KACAjD,EAAAoD,EAAApD,UACAA,EAAAA,EAAAA,EAAA,WACAoD,EAAAnD,SAAA,CACW,MAAAyD,EAAAjG,EAAA2F,EAAAnD,yBAENmD,EAAApC,OAAA0C,EAAAvU,EAAAjE,GACJ,EAAA8U,IAGDA,EAAAoD,EAAAR,QAAAzT,EAAAjE,IAGA,UASA,OAAAsY,EAAAC,EAAAF,uBAIM9S,KAAAsQ,4BACS,MAAAqC,UAAAH,YACf1T,IAAA6T,EAAAnD,UACqB,EAAAM,EAAAzW,SACrBwZ,EAAAF,EAAAnD,UAAAM,EAAAoD,kBAcKC,SAAAA,CAAA3D,MACJ,iBAAAA,EAC+B,MAAA,IAAApS,UAAA,+BAEhC,MAAAuV,UAAAH,OACA,GAAAG,EAAAnD,WAAAA,EACA,OAAAmD,EAiBAS,QAAAA,CAAA5D,GACA,GAAA,iBAAAA,EACA,MAAA,IAAApS,UAAA,2BAEA,IAAA3C,EAAA,EACA,IAAA,MAAAkY,KAAA3S,KAAAwS,OAAA,IACAG,EAAAnD,WAAAA,EACA,OAAA/U,EACA,EAAAkY,EAAApD,KACA9U,GAAA,KAEAA,IACAA,GAAAkY,EAAApD,KAtLA,yBA6MA,WAAA5D,CAAA6D,iFANAe,MAAAA,CAAAvD,EAAAtO,EAAAjE,GA2BA,MAAA,IAAAR,MAAA,0DAsBgB,MAAAoZ,UAAgBC,cACpBpD,EAAAV,GAEZ,KAAAU,aAAwBS,GAEfT,EAAAO,qBACKrT,UAAA,qDAEdwO,MAAA4D,GAAAU,EAAAV,UAAA,WAIAxP,KAAAkQ,OAAAA,CACA,CAGAM,MAAAA,CAAA9R,EAAAjE,GACA,OAAAuF,KAAAkQ,OAAAM,OAAA9R,EAAAjE,EACA,CAvBA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,GA0BA,OAAAyV,KAAAA,OAAAK,OAAAvD,EAAAtO,EAAAjE,iDA8EA6U,EACA3D,WAAAA,CAAA4H,EAAAC,EAAAhE,OACAiE,EAAAF,GAAAA,aAAAxC,GACAwC,aAAAvC,EACAyC,EAAA,IAAAJ,EAAA,IAAAvC,EAAAyC,SACA,GAAAA,aAAA5C,GACA4C,EAAA9C,YACA4C,IAAAA,EAAAE,OACA,MAAAA,aAAAD,GACA,MAAAlW,IAAAA,8EAIAqW,EAAAF,CACA,CAIA,QAHAzU,IAAA0U,IACAA,EAAA,eAEAA,GACAA,aAAAlE,SACA,IAAAlS,UAAA,0CAEA,GAAA,SAA4B,IAChB,EAAAoW,EAASjE,KACrB,MAAA,IAAAtV,MAAA,8CAGA6E,IAAA0U,EAAAhE,8CASgBgE,MAChBA,EAAAjE,KACoBA,GAAAA,IAAAgE,aAAAxC,GACHwC,aAAAvC,KAERzB,GAAAkE,EAAAvD,OAAAX,sOA6ETvP,KAAA0T,gCAAAC,GACAC,EAAAD,EAAAE,KAAA7T,KACA,UAGAtB,EAAAjE,EAAA,oCAOA,MAAAqZ,EAA0B9T,KAAA+T,WAAArV,EAAAjE,GAC1B,IAAAqZ,EAEa,MAAA,IAAA7Z,MAAA,2EAiCb+Z,uBAAAA,CAAAhH,aACA/P,UAAAkT,eAAAtP,KAAAmM,EAAAhN,KAAAyT,cAAAjE,UAAA,CACA,GAAAxP,KAAAwT,eAAAxT,KAAAwT,cAAAhE,UACMzS,OAAAE,UAAAkT,eAAAtP,KAAAmM,EAAAhN,KAAAwT,cAAAhE,uBAGNsE,OAAsBG,SAAAjH,EAAAhN,KAAAyT,cAAAjE,cACbsE,KACTA,EAAA5D,QAAY4D,EAAAtE,UAAAzS,OAAAE,UAAAkT,eAAAtP,KAAAmM,EAAA8G,EAAAtE,WACZ,kBAIY,MAAA0E,UAAAD,SAAA,CACA,MAAAH,EAAA9T,KAAAiU,SAAAC,GACH,GAAAJ,EAAAtE,UAAAzS,OAAAE,UAAAkT,eAAAtP,KAAAmM,EAAA8G,EAAAtE,iBACWsE,CAGP,gDAUbtD,MAAAA,CAAA9R,IAAgB,GAChB,IAAQmU,QACIsB,EAAAnU,KAAAyT,cACAF,EAAAY,EAAA3D,OAAmB9R,EAAAjE,GACf2Z,EAAApU,KAAAiU,SAAAV,GACH,QAAAzU,IAAAsV,EAAA,CACJZ,MAAAA,OAAAA,cACT,MAAkB,EAClBxT,KAAAqU,0BACAC,EAAAH,EAAAjE,OAAAX,MAEAsD,EAAA7S,KAAAsQ,wBACAuC,EAAAsB,EAAA3E,UAAA+D,EAEAV,EAAAW,EAAAhE,UAAAgE,EAAAhD,OAAA9R,EAAAjE,EAAA6Z,QAIAzB,EAAAuB,EAAA5D,OAAA9R,EAAAjE,qBAUAiE,EAAAjE,EAAA,SACYqZ,EAAA9T,KAAAuU,iBAAAvH,GACHlO,QAAAA,IAAAgV,EAAA,CACT,MAAAK,OAAAV,cAGAW,OAAAZ,cACS,IAAAc,EAAA,EAQA,OAPTtU,KAAAqU,0BACKC,EAAAH,EAAAjE,OAAAX,kCAMI+E,EAAAF,EAAA7D,OAAAvD,EAAAoH,EAAA5E,UAAA9Q,EAAAjE,EAAA6Z,0BAiBLE,UAAAA,CAAAC,EAAAvE,EAAAV,GAEJ,MAAAE,MAAAgF,EAAA1U,KAAAyU,EAAAvE,EAAAV,0CAkBKmF,EAAAla,EAAA,GAAA,IAAAga,EAOL,OALAA,EADAE,aAAA7a,gBACA2Z,cAAAjD,OAAAmE,EAAAla,GAGYka,EAEZV,KAAAA,SAAAQ,cAuCA,MAAAC,UAAApF,EACA3D,WAAAA,CAAAqC,EAAAyG,EAAAvE,EAAAV,QACAxB,aAAA4G,GACA,MAAA,IAAAxX,UAAA,yBAEA,IAAAqE,OAAAkL,UAAA8H,IAAA,EAAAA,EACA,MAAA,IAAArX,UAAA,+CAEM,iBAAA8S,YACUV,IAChBA,EAAYU,IACZ,MAESA,EAAA,CACY,KAAAA,gBACrB,MAAA,IAAyB9S,UAAgB,2BAE7B,GAAA,OAAA4Q,EAAAwF,eACH,GAAAtD,EAAAX,MACDW,EAAYX,KAAAvB,EAAOwF,cAAAjE,KAC3B,MAAA,IAAAtV,MAAA,iDAEQ,GAAA,iBAAiBuV,EACzB,MAAA,IAAApS,UAAA,6CAGQ4Q,EAASuB,OACjBvB,EAAAuB,OACAA,EAAAW,EAAAA,EAAAX,KAAA,EACA,GAAAA,GAAAvB,EAAAqG,0BAEA9E,GAAAvB,EAAAyF,cAAAvD,OAAAX,kBAMAvP,KAAAgO,MAAAA,EAKAhO,KAAAyU,QAAAA,EAMYzU,KAAAkQ,OAAAA,GAAY,aAGZxR,EAAAjE,EAAA,GACZ,GAAA,GAAAuF,KAAAuP,sBAKA,IAAA+E,EAAA,EACQtU,KAAIgO,MAACqG,0BACLC,OAAatG,MAAAyF,cAAAvD,OAAAX,MAGR,IAAAA,EAAA,EAKb,OAJSvP,KAAAkQ,SAEJX,EAAAvP,KAAAkQ,OAAAiC,QAAAzT,EAAAjE,EAAA6Z,IAELA,EAAA/E,SAGA7Q,EAAAjE,EAAA,GACI,MAAAoY,EAAe7S,KAAAsQ,wBACnB,GAAQtQ,OAAMA,KAAKgO,MAAA+F,WAAArV,EAAuBjE,GAC1C,MAAAR,IAAAA,MAAa,oBAEb,IAAAqa,EAAyB,EAYzB,OAXgBtU,KAAAgO,MAAAqG,0BAChBC,OAAAtG,MAAAyF,cAAAvD,OAAAX,MACAvP,KAAAkQ,OACiB2C,EAAA7S,KAAAwP,UAAAxP,KAAAkQ,OAAAM,OAAA9R,EAAAjE,EAAA6Z,GACJtU,KAAAwP,SACJqD,OAAArD,WAAA,EAEJxP,KAAAgO,MAAAqG,0BAELxB,EAAA7S,KAAAgO,MAAAyF,cAAAjE,eAAAiF,SAEA5B,EAGAtC,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GACA,IAAA6Z,EAAA,EAIQ,QAHRtG,MAAAqG,0BACYC,EAAKtU,gCAAYuP,MAErBvP,KAAAkQ,SACAnT,OAAOE,UAAGkT,eAAAtP,KAAAmM,OAAAwC,UACb,MAAA,IAAApS,UAAA,0BAAA4C,KAAAwP,UAELxP,KAAAgO,MAAAyF,cAAAlD,OAAAvQ,KAAAyU,QAAA/V,EAAAjE,GACA8U,IAAAA,EAAA+E,mBAEAtU,KAAAkQ,OAAAK,OAAAvD,EAAAhN,KAAAwP,UAAA9Q,EAAAjE,EAAA6Z,MACApE,KAAAA,OAAAiC,QAAAzT,EAAAjE,EAAA6Z,GACAtG,GAAAA,KAAAA,MAAAuB,MACAA,EAAAvB,KAAAA,MAAAuB,MACA,MAAA,IAAAtV,MAAA,6CAIQ,OAAIsV,EAIZM,SAAAA,CAAAC,GACA,GAAA9P,KAAAkQ,OACA,OAAAlQ,KAAAkQ,OAAAL,UAAAC,IAYa+E,SAAAA,EAAAvC,UACJ,EAAAA,IAETA,GAAA,gCA0CY,MAAAwC,UAAKxF,EACjB3D,WAAAA,CAAAoJ,EAAAC,EAAAxF,GACA,KAAAuF,aAAAhE,GACAgE,aAAA/D,GACA,MAAA,IAAA5T,UAAA,wCAQA,GANQ,iBAAA4X,QACIlW,IAAW0Q,IACvBA,EAAgBwF,EACPA,GAAA,GAGTD,EAAAA,EAAAxF,wDAGY3D,MAAAmJ,EAAAxF,KAAUC,4BAsBdxP,KAAAwS,UAIR,IAAA/W,EAAA,EACAuE,KAAAiV,gBAAA,SAAA3C,GAEA,OADA7W,EAAAoZ,EAAAvC,GACAtS,IACI,EAEJA,KAAAkV,gBAAsB,WACI,OAAAzZ,CACd,EAGJ+U,MAAAA,CAAA9R,EAAAjE,WACAoY,EAAA7S,KAAesQ,0BACVtQ,KAAS+U,iBACRE,KAAAA,gBAAAxZ,OACT,MAAAkX,UAAAH,YACJ1T,IAAA6T,EAAAnD,WACeqD,EAAAF,EAAAnD,UAAAmD,EAAAnC,OAAA9R,sBAWhBA,EAAAjE,EAAA,WACAuF,KAAA+U,KAAAvE,OAAA9R,EAAAjE,GACAuF,KAAAiV,gBAAAxZ,kBACAuE,KAAAwS,mBACAG,EAAAnD,SAAA,CACA,MAAAyD,EAAAjG,EAAA2F,EAAAnD,eACA1Q,IAAAmU,GACsBN,EAAApC,OAAA0C,EAGjB,qDAaLkC,QAAAA,CAAAjH,EAAAsB,GAEC,MAAA4F,EAAAC,IAAAA,GAAAnH,KAAAA,EAAAsB,gCAaD8F,UAAAA,CAAA9F,GAGA,MAAA4F,EAAA,IAAAG,GAAAvV,KAAAwP,gCAYAgG,QAAAA,OACA,iBAAAhG,EACA,MAAA,IAAApS,UAAA,+BAEA,MAAAuV,UAAAH,OACA,GAAAG,EAAAnD,WAAAA,EACA,OAAAmD,oBAiCA,MAAA0C,GACS1J,WAAAA,CAAA8J,EAAAvH,EAAAsB,QACTiG,aAA0BX,GAClB,MAAA,IAAA1X,UAAA,oCAER,IAAAqE,OAAAkL,UAAuBuB,IAAe,GAAAA,EAC7B,MAAA,IAAA9Q,UAAA,yCAEJqY,EAAAA,EAAAlG,KACJmG,EAAAD,EAAAjD,OAAAH,QAAAsD,CAAAA,EAAAhD,IAAAgD,EAAAhD,EAAAzE,MAAA,MACWA,EAAAwH,EAAAE,EAEZ,MAAA,IAAA3b,8CACAyb,GAAA,OACAE,EAAA,yCAeI5V,KAAA6V,cAAA3H,GAAA,sCAQJlO,KAAA7F,MAAAub,uBAEQ1V,KAAA7F,MAAUyb,EAAAF,EAAyBxH,+CAiBnClO,cAA0BwP,SAIjC9Q,EAAAjE,UAGDoa,EAFe7U,KAAAyV,UAAAP,uBAEfY,iCAUA,GAAA,iBAAAra,IACAgG,OAAAkL,UAAAlR,IACAA,IAAAoZ,EAAApZ,EAAAuE,KAAA6V,WACA,MAAA,IAAAzY,UAAA2S,EAAA,wBACA,wCAAA/P,KAAA6V,WAEA,MAAAd,EAAA/U,KAAAyV,UAAAP,kBACAa,EAAAlB,EAAApZ,QAAAtB,OA1FA6F,KAAAyV,UAAAR,gBA0FAJ,EAAAE,GAAA/U,KAAA8V,UAEAC,kBAsBAR,MAAAA,WAAAF,8BAE0B7F,EAC1B,CAKAgB,MAAAA,MACA,qBAAqB9R,EAAUjE,GAG/B8V,MAAAA,CAAA9U,GACK,kBAAAA,IAEDA,GAAAA,GACJmQ,MAAA2E,OAAA9U,EAEA,gCAmBA6T,EACA,WAAA3D,CAAAtS,EAAAmW,GACA,KAAAnW,aAAAsX,GAAAtX,EAAAoX,WAEAhP,OAAAkL,UAAAtT,OAAAA,GACA,MAAA,IAAA+D,UAAA,yEAGA,IAAAmS,GAAA,EAEAlW,aAAAsX,oBAUA3Q,KAAQ3G,OAAOA,UAGfqF,EAAAjE,GACA,IAAA8U,EAAAvP,KAAAuP,KAKA,OAJA,EAAAA,IAEAA,EAAAvP,KAAA3G,OAAAmX,OAAA9R,EAAAjE,IAEA8U,SAGA7Q,EAAAjE,EAAA,GACI,IAAA8U,OAAOA,YACX,EAAAA,IAEAA,OAAAlW,OAAAmX,OAAA9R,EAAAjE,sBASA8V,MAAAA,CAAAvD,EAAAtO,EAAAjE,GACA,IAAA8U,EAAAvP,KAAA3G,OAIA,GAHA2G,KAAA3G,kBAAAsX,IACA3D,EAAAA,EAAA3T,UAEA2T,aAAAlT,YAAAyV,IAAAvC,EAAA3T,QACA,MAAA,IAAA+D,UAAA2S,gBAAA/P,MACA,qBAAAuP,EAAA,uBAEA,GAAA9U,EAAA8U,EAAA7Q,EAAArF,OACA,MAAA,IAAAwD,WAAiC,sCAEjCmZ,EAAA3G,EAAArC,GAKA,OAJAqC,EAAA3Q,GAAAd,MAAAoY,EAAAxW,SAAA,OAAA/E,EAAA8U,EAAA,OACAlW,KAAAA,kBAAAsX,GACA3Q,KAAA3G,OAAAkX,OAAAhB,EAAA7Q,EAAAjE,GAEA8U,aAkBA0G,MAAAA,WAAA3G,EACA3D,WAAAA,CAAA6D,GACA5D,OAAA,EAAA4D,GAGc9Q,OAAAA,CAAAA,EAAAjE,EAAA,GACd2U,EAAA1Q,GACA,IAAAwT,EAAAzX,EACA,KAAAyX,EAAAxT,EAAArF,QAAAqF,IAAAA,EAAAwT,IAEAA,GAAA,EAEA,OAAA,EAAAA,EAAAzX,EAIA+V,MAAAA,CAAA9R,EAAAjE,EAAA,GACA,MAAA8U,EAAwBvP,KAASmS,QAAGzT,EAAAjE,GACpC,OAAA4U,EAAA3Q,GAAAb,MAAApD,EAAAA,EAAA8U,EAAA,GAAA/P,SAAA,SAGA+Q,MAAAA,CAAAvD,EAAAtO,EAAAjE,EAAA,GAIA,iBAAAuS,IACYA,EAAA9L,OAAA8L,IAEZkJ,MAAAA,EAAA/G,EAAA5S,OAAAe,KAAA0P,EAAA,QACAuC,EAAA2G,EAAA7c,OACA,GAAAoB,EAAA8U,EAAA7Q,EAAArF,OACA,MAAA,IAAAwD,WAAA,4BAEA,MAAArC,EAAA6U,EAAA3Q,GAGA,OAFAwX,EAAA/X,KAAA3D,EAAAC,GAvCAD,EAAAC,EAAA8U,GAuCA,EAEAA,EAAA,iCAwBAD,cACA6G,EAAA3G,GAIA1Q,GAHA,iBAAAqX,QAAArX,IAAA0Q,IACAA,EAAA2G,EACAA,OAAArX,QACAA,IAAAqX,EACYA,GAAA,OAIZ,IAAA1U,OAAAkL,UAAAwJ,4hBAfAD,EAAA/X,KAAAkR,0lCC9zEO,MAAM+G,GAAmBlG,IAGrB,CAAEM,OAFMN,EAAOM,OAAOqD,KAAK3D,GAEjBK,OADFL,EAAOK,OAAOsD,KAAK3D,eCPtCnT,OAAOiH,eAAeqS,GAAS,aAAc,CAAE5a,OAAO,IAmBtD,IAAkB6a,GAAAD,GAAAE,WAZlB,SAAoBzZ,GAChB,CACI,MAAM0Z,EAAWja,OAAOe,KAAKR,GAC7B0Z,EAASC,UACT,MAAMC,EAAMF,EAAShX,SAAS,OAC9B,OAAmB,IAAfkX,EAAIrd,OACGqN,OAAO,GAEXA,OAAQ,KAAIgQ,IACtB,CAEL,EAiBkBL,GAAAM,WAVlB,SAAoB7Z,GAChB,CACI,MAAM4Z,EAAM5Z,EAAI0C,SAAS,OACzB,OAAmB,IAAfkX,EAAIrd,OACGqN,OAAO,GAEXA,OAAQ,KAAIgQ,IACtB,CAEL,EAkBA,IAAkBE,GAAAP,GAAAQ,WAVlB,SAAoBxc,EAAKyc,GACrB,CACI,MAAMJ,EAAMrc,EAAImF,SAAS,IACnBhF,EAAS+B,OAAOe,KAAKoZ,EAAIK,SAAiB,EAARD,EAAW,KAAKjZ,MAAM,EAAW,EAARiZ,GAAY,OAE7E,OADAtc,EAAOic,UACAjc,CACV,CAGL,EAeA6b,GAAAW,WAPA,SAAoB3c,EAAKyc,GACrB,CACI,MAAMJ,EAAMrc,EAAImF,SAAS,IACzB,OAAOjD,OAAOe,KAAKoZ,EAAIK,SAAiB,EAARD,EAAW,KAAKjZ,MAAM,EAAW,EAARiZ,GAAY,MACxE,CAEL,EC/DO,MA0CMG,IAzCR5d,GAyCqB,EAxCrBmW,IACG,MAAMU,EAASpC,GAAKzU,GAAQmW,IACtBe,OAAEA,EAAMC,OAAEA,GAAW4F,GAAalG,GAElCgH,EAAehH,EAYrB,OAVAgH,EAAa1G,OAAS,CAAChW,EAAgBC,KACnC,MAAMuS,EAAMwD,EAAOhW,EAAQC,GAC3B,OAAO8b,GAAWha,OAAOe,KAAK0P,GAAK,EAGvCkK,EAAa3G,OAAS,CAAC4G,EAAgB3c,EAAgBC,KACnD,MAAMuS,EAAM6J,GAAWM,EAAQ9d,IAC/B,OAAOkX,EAAOvD,EAAKxS,EAAQC,EAAO,EAG/Byc,CAAY,GAjBtB7d,OCFE,MAAM+d,GAAQ5H,IACjB,MAAMU,EAASmH,GAAG7H,IACZe,OAAEA,EAAMC,OAAEA,GAAW4F,GAAalG,GAElCoH,EAAapH,EAYnB,OAVAoH,EAAW9G,OAAS,CAAChW,EAAgBC,MACrB+V,EAAOhW,EAAQC,GAI/B6c,EAAW/G,OAAS,CAAC6G,EAAe5c,EAAgBC,KAChD,MAAMuS,EAAMvL,OAAO2V,GACnB,OAAO7G,EAAOvD,EAAKxS,EAAQC,EAAO,EAG/B6c,CAAU,ECfRC,GAAa/H,IACtB,MAAMU,EAASpC,GAAK,GAAI0B,IAClBe,OAAEA,EAAMC,OAAEA,GAAW4F,GAAalG,GAElCsH,EAAkBtH,EAYxB,OAVAsH,EAAgBhH,OAAS,CAAChW,EAAgBC,KACtC,MAAMuS,EAAMwD,EAAOhW,EAAQC,GAC3B,OAAO,IAAI+S,EAAAA,UAAUR,EAAI,EAG7BwK,EAAgBjH,OAAS,CAACgH,EAAsB/c,EAAgBC,KAC5D,MAAMuS,EAAMuK,EAAUE,WACtB,OAAOlH,EAAOvD,EAAKxS,EAAQC,EAAO,EAG/B+c,CAAe,ECnBpB,MAAgBE,WAAmBzd,MACrC0R,WAAAA,CAAYM,GACRL,MAAMK,EACV,EAIE,MAAO0L,WAAkCD,GAA/C/L,WAAAA,uBACI3L,KAAA+L,KAAO,2BACX,EAQM,MAAO6L,WAAsCF,GAAnD/L,WAAAA,uBACI3L,KAAA+L,KAAO,+BACX,EAGM,MAAO8L,WAAqCH,GAAlD/L,WAAAA,uBACI3L,KAAA+L,KAAO,8BACX,EAGM,MAAO+L,WAA8BJ,GAA3C/L,WAAAA,uBACI3L,KAAA+L,KAAO,uBACX,EAQM,MAAOgM,WAAgCL,GAA7C/L,WAAAA,uBACI3L,KAAA+L,KAAO,yBACX,ECxCA,IAAYiM,IAAZ,SAAYA,GACRA,EAAAA,EAAa,cAAA,GAAA,gBACbA,EAAAA,EAAI,KAAA,GAAA,OACJA,EAAAA,EAAO,QAAA,GAAA,SACV,CAJD,CAAYA,KAAAA,GAAW,CAAA,IAKhB,MAAMC,GAAoB,EC+CpBC,GAlBiB/J,GAAoB,CAC9CkJ,GAAG,KACHA,GAAG,KACHD,GAAK,iBACLG,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,WACVA,GAAU,YACVA,GAAU,cAI8BhI,KCN5C,IAAY4I,IAAZ,SAAYA,GACRA,EAAAA,EAAiB,cAAA,GAAA,gBACjBA,EAAAA,EAAe,YAAA,GAAA,cACfA,EAAAA,EAAU,OAAA,GAAA,QACb,CAJD,CAAYA,KAAAA,GAAY,CAAA,IAsBjB,MAAMC,GAAgBjK,GAAmB,CAC5CoJ,GAAU,QACVA,GAAU,SACVN,GAAI,UACJoB,GAAI,kBACJd,GAAU,YACVF,GAAG,SACHgB,GAAI,kBACJpB,GAAI,YACJA,GAAI,mBACJoB,GAAI,wBACJd,GAAU,oBAIDe,GAAeF,GAAc7I,KChC7BgJ,GAAapK,GAAgB,CACtCkK,GAAI,uBACJd,GAAU,iBACVN,GAAI,UACJI,GAAG,YACHD,GAAK,iBACLiB,GAAI,yBACJd,GAAU,qBAIDiB,GAAYD,GAAWhJ,KAY7BkJ,eAAeC,GAClBC,EACAC,EACAC,EACAC,EAAYvL,GAGZ,OAYE,SAAqBqL,EAAoBG,EAAkCD,EAAYvL,GACzF,IAAKwL,EAAM,MAAM,IAAIpB,GACrB,IAAKoB,EAAKC,MAAM7T,OAAO2T,GAAY,MAAM,IAAIlB,GAC7C,GAAImB,EAAK7Z,KAAK7F,OAASmf,GAAW,MAAM,IAAIX,GAE5C,MAAMoB,EAAUV,GAAW/H,OAAOuI,EAAK7Z,KAAKrB,MAAM,EAAG2a,KACrD,IAAIU,EAAU3c,OAAOE,MAAM,GAC3B,GAAIsc,EAAK7Z,KAAK7F,OAASmf,GAAW,CAC9B,GAAIO,EAAK7Z,KAAK7F,QAAUif,GAAc,MAAM,IAAIT,GAChD,GAAIkB,EAAK7Z,KAAK7F,SAAW6e,GAAe,MAAM,IAAIL,GAClD,GAAIkB,EAAK7Z,KAAKoZ,KAAiBN,GAAYmB,KAAM,MAAM,IAAIrB,GAC3DoB,EAAUH,EAAK7Z,KAAKrB,MAAMya,GAAeL,IAG7C,MAAO,CACHW,UACAQ,cAAeH,EAAQI,oBAAsBJ,EAAQG,cAAgB,KACrEE,OAAQL,EAAQK,OAChBC,SAAUN,EAAQM,SAClBC,cAAeP,EAAQO,cACvBC,gBAAiBR,EAAQS,sBAAwBT,EAAQQ,gBAAkB,KAC3EP,UAER,CAnCWS,CAAWf,QADCD,EAAWiB,eAAehB,EAASC,GACrBC,EACrC,CA2GM,SAAUe,GACZC,EACAd,EACAe,GAAqB,EACrBjB,EAAYvL,EACZyM,EAA2BvM,GAE3B,IAAKsM,IAAuBvM,EAAAA,UAAUyM,UAAUjB,EAAMvB,YAAa,MAAM,IAAIM,GAE7E,MAAOa,GAAWpL,EAAAA,UAAU0M,uBACxB,CAAClB,EAAMvB,WAAYqB,EAAUrB,WAAYqC,EAAKrC,YAC9CuC,GAGJ,OAAOpB,CACX,CC5LM,SAAUuB,GACZC,EACAC,EACArB,EACAc,EACAhB,EAAYvL,EACZyM,EAA2BvM,GAE3B,OA0CJ,SACI2M,EACAC,EACArB,EACAc,EACAQ,EACAxB,EAAYvL,EACZyM,EAA2BvM,GAE3B,MAAM8M,EAAO,CACT,CAAEC,OAAQJ,EAAOK,UAAU,EAAMC,YAAY,GAC7C,CAAEF,OAAQH,EAAiBI,UAAU,EAAOC,YAAY,GACxD,CAAEF,OAAQxB,EAAOyB,UAAU,EAAOC,YAAY,GAC9C,CAAEF,OAAQV,EAAMW,UAAU,EAAOC,YAAY,GAC7C,CAAEF,OAAQG,EAAaA,cAAC7B,UAAW2B,UAAU,EAAOC,YAAY,GAChE,CAAEF,OAAQ1B,EAAW2B,UAAU,EAAOC,YAAY,IAGtD,OAAO,IAAIE,EAAAA,uBAAuB,CAC9BL,OACAzB,UAAWkB,EACX9a,KAAMob,GAEd,CAjEWO,CACHT,EACAC,EACArB,EACAc,EACAvd,OAAOE,MAAM,GACbqc,EACAkB,EAER,uECjCA,SAAWc,EAAQxe,GAIjB,SAASye,EAAQra,EAAK+L,GACpB,IAAK/L,EAAK,MAAM,IAAIzG,MAAMwS,GAAO,mBAClC,CAID,SAASuO,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASne,UAAYie,EAAUje,UAC/Bge,EAAKhe,UAAY,IAAIme,EACrBH,EAAKhe,UAAU0O,YAAcsP,CAC9B,CAID,SAASI,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGTtb,KAAK0b,SAAW,EAChB1b,KAAK2b,MAAQ,KACb3b,KAAK3G,OAAS,EAGd2G,KAAK4b,IAAM,KAEI,OAAXN,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGTvb,KAAK6b,MAAMP,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAEjD,CAUD,IAAIjf,EATkB,iBAAXue,EACTA,EAAOxe,QAAU+e,EAEjB/e,EAAQ+e,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGS,SAAW,GAGd,IAEIvf,EADoB,oBAAXwf,aAAmD,IAAlBA,OAAOxf,OACxCwf,OAAOxf,OAEPL,GAAkBK,MAE9B,CAAC,MAAO1B,GACR,CA+HD,SAASmhB,EAAeze,EAAQ0e,GAC9B,IAAIvgB,EAAI6B,EAAOtE,WAAWgjB,GAE1B,OAAIvgB,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXqf,GAAO,EAAO,wBAA0Bxd,EAE3C,CAED,SAAS2e,EAAc3e,EAAQ4e,EAAYF,GACzC,IAAIG,EAAIJ,EAAcze,EAAQ0e,GAI9B,OAHIA,EAAQ,GAAKE,IACfC,GAAKJ,EAAcze,EAAQ0e,EAAQ,IAAM,GAEpCG,CACR,CA6CD,SAASC,EAAWna,EAAK/H,EAAOC,EAAKiN,GAInC,IAHA,IAAI+U,EAAI,EACJ1d,EAAI,EACJ3F,EAAMwC,KAAKoH,IAAIT,EAAI7I,OAAQe,GACtB1B,EAAIyB,EAAOzB,EAAIK,EAAKL,IAAK,CAChC,IAAIgD,EAAIwG,EAAIjJ,WAAWP,GAAK,GAE5B0jB,GAAK/U,EAIH3I,EADEhD,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENqf,EAAOrf,GAAK,GAAKgD,EAAI2I,EAAK,qBAC1B+U,GAAK1d,CACN,CACD,OAAO0d,CACR,CA2DD,SAASE,EAAMzJ,EAAM7F,GACnB6F,EAAK8I,MAAQ3O,EAAI2O,MACjB9I,EAAKxZ,OAAS2T,EAAI3T,OAClBwZ,EAAK6I,SAAW1O,EAAI0O,SACpB7I,EAAK+I,IAAM5O,EAAI4O,GAChB,CAqCD,GA9TAP,EAAGI,KAAO,SAAephB,GACvB,OAAIA,aAAeghB,GAIJ,OAARhhB,GAA+B,iBAARA,GAC5BA,EAAIsR,YAAYmQ,WAAaT,EAAGS,UAAY/hB,MAAMkF,QAAQ5E,EAAIshB,QAGlEN,EAAGhW,IAAM,SAAckX,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTnB,EAAG1Y,IAAM,SAAc4Z,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTnB,EAAGpe,UAAU4e,MAAQ,SAAeP,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAOtb,KAAK0c,YAAYpB,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAOtb,KAAK2c,WAAWrB,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETR,EAAOQ,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIphB,EAAQ,EACM,OAFlBmhB,EAASA,EAAO9b,WAAW8F,QAAQ,OAAQ,KAEhC,KACTnL,IACA6F,KAAK0b,SAAW,GAGdvhB,EAAQmhB,EAAOjiB,SACJ,KAATkiB,EACFvb,KAAK4c,UAAUtB,EAAQnhB,EAAOqhB,IAE9Bxb,KAAK6c,WAAWvB,EAAQC,EAAMphB,GACf,OAAXqhB,GACFxb,KAAK2c,WAAW3c,KAAK8c,UAAWvB,EAAMC,MAM9CH,EAAGpe,UAAUyf,YAAc,SAAsBpB,EAAQC,EAAMC,GACzDF,EAAS,IACXtb,KAAK0b,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACXtb,KAAK2b,MAAQ,CAAU,SAATL,GACdtb,KAAK3G,OAAS,GACLiiB,EAAS,kBAClBtb,KAAK2b,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzBtb,KAAK3G,OAAS,IAEd0hB,EAAOO,EAAS,kBAChBtb,KAAK2b,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEFtb,KAAK3G,OAAS,GAGD,OAAXmiB,GAGJxb,KAAK2c,WAAW3c,KAAK8c,UAAWvB,EAAMC,IAGxCH,EAAGpe,UAAU0f,WAAa,SAAqBrB,EAAQC,EAAMC,GAG3D,GADAT,EAAgC,iBAAlBO,EAAOjiB,QACjBiiB,EAAOjiB,QAAU,EAGnB,OAFA2G,KAAK2b,MAAQ,CAAC,GACd3b,KAAK3G,OAAS,EACP2G,KAGTA,KAAK3G,OAASkC,KAAKwhB,KAAKzB,EAAOjiB,OAAS,GACxC2G,KAAK2b,MAAQ,IAAI5hB,MAAMiG,KAAK3G,QAC5B,IAAK,IAAIX,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAC/BsH,KAAK2b,MAAMjjB,GAAK,EAGlB,IAAI6I,EAAGyb,EACHC,EAAM,EACV,GAAe,OAAXzB,EACF,IAAK9iB,EAAI4iB,EAAOjiB,OAAS,EAAGkI,EAAI,EAAG7I,GAAK,EAAGA,GAAK,EAC9CskB,EAAI1B,EAAO5iB,GAAM4iB,EAAO5iB,EAAI,IAAM,EAAM4iB,EAAO5iB,EAAI,IAAM,GACzDsH,KAAK2b,MAAMpa,IAAOyb,GAAKC,EAAO,SAC9Bjd,KAAK2b,MAAMpa,EAAI,GAAMyb,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACP1b,UAGC,GAAe,OAAXia,EACT,IAAK9iB,EAAI,EAAG6I,EAAI,EAAG7I,EAAI4iB,EAAOjiB,OAAQX,GAAK,EACzCskB,EAAI1B,EAAO5iB,GAAM4iB,EAAO5iB,EAAI,IAAM,EAAM4iB,EAAO5iB,EAAI,IAAM,GACzDsH,KAAK2b,MAAMpa,IAAOyb,GAAKC,EAAO,SAC9Bjd,KAAK2b,MAAMpa,EAAI,GAAMyb,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACP1b,KAIN,OAAOvB,KAAKkd,UA2Bd7B,EAAGpe,UAAU2f,UAAY,SAAoBtB,EAAQnhB,EAAOqhB,GAE1Dxb,KAAK3G,OAASkC,KAAKwhB,MAAMzB,EAAOjiB,OAASc,GAAS,GAClD6F,KAAK2b,MAAQ,IAAI5hB,MAAMiG,KAAK3G,QAC5B,IAAK,IAAIX,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAC/BsH,KAAK2b,MAAMjjB,GAAK,EAIlB,IAGIskB,EAHAC,EAAM,EACN1b,EAAI,EAGR,GAAe,OAAXia,EACF,IAAK9iB,EAAI4iB,EAAOjiB,OAAS,EAAGX,GAAKyB,EAAOzB,GAAK,EAC3CskB,EAAId,EAAaZ,EAAQnhB,EAAOzB,IAAMukB,EACtCjd,KAAK2b,MAAMpa,IAAU,SAAJyb,EACbC,GAAO,IACTA,GAAO,GACP1b,GAAK,EACLvB,KAAK2b,MAAMpa,IAAMyb,IAAM,IAEvBC,GAAO,OAKX,IAAKvkB,GADa4iB,EAAOjiB,OAASc,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOzB,EAAI4iB,EAAOjiB,OAAQX,GAAK,EAC1EskB,EAAId,EAAaZ,EAAQnhB,EAAOzB,IAAMukB,EACtCjd,KAAK2b,MAAMpa,IAAU,SAAJyb,EACbC,GAAO,IACTA,GAAO,GACP1b,GAAK,EACLvB,KAAK2b,MAAMpa,IAAMyb,IAAM,IAEvBC,GAAO,EAKbjd,KAAKkd,UA8BP7B,EAAGpe,UAAU4f,WAAa,SAAqBvB,EAAQC,EAAMphB,GAE3D6F,KAAK2b,MAAQ,CAAC,GACd3b,KAAK3G,OAAS,EAGd,IAAK,IAAI8jB,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAW7B,EAClE4B,IAEFA,IACAC,EAAWA,EAAU7B,EAAQ,EAO7B,IALA,IAAI8B,EAAQ/B,EAAOjiB,OAASc,EACxBmjB,EAAMD,EAAQF,EACd/iB,EAAMmB,KAAKoH,IAAI0a,EAAOA,EAAQC,GAAOnjB,EAErC4a,EAAO,EACFrc,EAAIyB,EAAOzB,EAAI0B,EAAK1B,GAAKykB,EAChCpI,EAAOsH,EAAUf,EAAQ5iB,EAAGA,EAAIykB,EAAS5B,GAEzCvb,KAAKud,MAAMH,GACPpd,KAAK2b,MAAM,GAAK5G,EAAO,SACzB/U,KAAK2b,MAAM,IAAM5G,EAEjB/U,KAAKwd,OAAOzI,GAIhB,GAAY,IAARuI,EAAW,CACb,IAAI9hB,EAAM,EAGV,IAFAuZ,EAAOsH,EAAUf,EAAQ5iB,EAAG4iB,EAAOjiB,OAAQkiB,GAEtC7iB,EAAI,EAAGA,EAAI4kB,EAAK5kB,IACnB8C,GAAO+f,EAGTvb,KAAKud,MAAM/hB,GACPwE,KAAK2b,MAAM,GAAK5G,EAAO,SACzB/U,KAAK2b,MAAM,IAAM5G,EAEjB/U,KAAKwd,OAAOzI,EAEf,CAED/U,KAAKkd,UAGP7B,EAAGpe,UAAUkB,KAAO,SAAe0U,GACjCA,EAAK8I,MAAQ,IAAI5hB,MAAMiG,KAAK3G,QAC5B,IAAK,IAAIX,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAC/Bma,EAAK8I,MAAMjjB,GAAKsH,KAAK2b,MAAMjjB,GAE7Bma,EAAKxZ,OAAS2G,KAAK3G,OACnBwZ,EAAK6I,SAAW1b,KAAK0b,SACrB7I,EAAK+I,IAAM5b,KAAK4b,KAUlBP,EAAGpe,UAAUwgB,MAAQ,SAAgB5K,GACnCyJ,EAAKzJ,EAAM7S,OAGbqb,EAAGpe,UAAUygB,MAAQ,WACnB,IAAItB,EAAI,IAAIf,EAAG,MAEf,OADArb,KAAK7B,KAAKie,GACHA,GAGTf,EAAGpe,UAAU0gB,QAAU,SAAkBre,GACvC,KAAOU,KAAK3G,OAASiG,GACnBU,KAAK2b,MAAM3b,KAAK3G,UAAY,EAE9B,OAAO2G,MAITqb,EAAGpe,UAAUigB,OAAS,WACpB,KAAOld,KAAK3G,OAAS,GAAqC,IAAhC2G,KAAK2b,MAAM3b,KAAK3G,OAAS,IACjD2G,KAAK3G,SAEP,OAAO2G,KAAK4d,aAGdvC,EAAGpe,UAAU2gB,UAAY,WAKvB,OAHoB,IAAhB5d,KAAK3G,QAAkC,IAAlB2G,KAAK2b,MAAM,KAClC3b,KAAK0b,SAAW,GAEX1b,MAKa,oBAAX3D,QAAgD,mBAAfA,OAAOwhB,IACjD,IACExC,EAAGpe,UAAUZ,OAAOwhB,IAAI,+BAAiCzY,CAC1D,CAAC,MAAOvK,GACPwgB,EAAGpe,UAAUmI,QAAUA,CACxB,MAEDiW,EAAGpe,UAAUmI,QAAUA,EAGzB,SAASA,IACP,OAAQpF,KAAK4b,IAAM,UAAY,SAAW5b,KAAKR,SAAS,IAAM,GAC/D,CAgCD,IAAIse,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAM7jB,EAAK6L,GAC9BA,EAAIwV,SAAWrhB,EAAIqhB,SAAWwC,EAAKxC,SACnC,IAAI3iB,EAAOmlB,EAAK7kB,OAASgB,EAAIhB,OAAU,EACvC6M,EAAI7M,OAASN,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIyL,EAAoB,EAAhB0Z,EAAKvC,MAAM,GACfjd,EAAmB,EAAfrE,EAAIshB,MAAM,GACdS,EAAI5X,EAAI9F,EAER+D,EAAS,SAAJ2Z,EACL+B,EAAS/B,EAAI,SAAa,EAC9BlW,EAAIyV,MAAM,GAAKlZ,EAEf,IAAK,IAAI2b,EAAI,EAAGA,EAAIrlB,EAAKqlB,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOhjB,KAAKoH,IAAIyb,EAAG/jB,EAAIhB,OAAS,GAC3BkI,EAAIhG,KAAK8J,IAAI,EAAG+Y,EAAIF,EAAK7kB,OAAS,GAAIkI,GAAKgd,EAAMhd,IAAK,CAC7D,IAAI7I,EAAK0lB,EAAI7c,EAAK,EAIlB8c,IADAjC,GAFA5X,EAAoB,EAAhB0Z,EAAKvC,MAAMjjB,KACfgG,EAAmB,EAAfrE,EAAIshB,MAAMpa,IACF+c,GACG,SAAa,EAC5BA,EAAY,SAAJlC,CACT,CACDlW,EAAIyV,MAAMyC,GAAa,EAARE,EACfH,EAAiB,EAATE,CACT,CAOD,OANc,IAAVF,EACFjY,EAAIyV,MAAMyC,GAAa,EAARD,EAEfjY,EAAI7M,SAGC6M,EAAIgX,QACZ,CAhpBD7B,EAAGpe,UAAUuC,SAAW,SAAmB+b,EAAMiD,GAI/C,IAAItY,EACJ,GAHAsY,EAAoB,EAAVA,GAAe,EAGZ,MAJbjD,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCrV,EAAM,GAGN,IAFA,IAAI+W,EAAM,EACNkB,EAAQ,EACHzlB,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAAK,CACpC,IAAIskB,EAAIhd,KAAK2b,MAAMjjB,GACfqc,GAA+B,UAArBiI,GAAKC,EAAOkB,IAAmB3e,SAAS,IACtD2e,EAASnB,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPvkB,KAGAwN,EADY,IAAViY,GAAezlB,IAAMsH,KAAK3G,OAAS,EAC/BykB,EAAM,EAAI/I,EAAK1b,QAAU0b,EAAO7O,EAEhC6O,EAAO7O,CAEhB,CAID,IAHc,IAAViY,IACFjY,EAAMiY,EAAM3e,SAAS,IAAM0G,GAEtBA,EAAI7M,OAASmlB,GAAY,GAC9BtY,EAAM,IAAMA,EAKd,OAHsB,IAAlBlG,KAAK0b,WACPxV,EAAM,IAAMA,GAEPA,CACR,CAED,GAAIqV,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAIkD,EAAYV,EAAWxC,GAEvBmD,EAAYV,EAAWzC,GAC3BrV,EAAM,GACN,IAAIxK,EAAIsE,KAAK0d,QAEb,IADAhiB,EAAEggB,SAAW,GACLhgB,EAAEijB,UAAU,CAClB,IAAIvC,EAAI1gB,EAAEkjB,MAAMF,GAAWlf,SAAS+b,GAMlCrV,GALFxK,EAAIA,EAAEmjB,MAAMH,IAELC,SAGCvC,EAAIlW,EAFJ4X,EAAMW,EAAYrC,EAAE/iB,QAAU+iB,EAAIlW,CAI3C,CAID,IAHIlG,KAAK2e,WACPzY,EAAM,IAAMA,GAEPA,EAAI7M,OAASmlB,GAAY,GAC9BtY,EAAM,IAAMA,EAKd,OAHsB,IAAlBlG,KAAK0b,WACPxV,EAAM,IAAMA,GAEPA,CACR,CAED6U,GAAO,EAAO,oCAGhBM,EAAGpe,UAAU6hB,SAAW,WACtB,IAAI7Y,EAAMjG,KAAK2b,MAAM,GASrB,OARoB,IAAhB3b,KAAK3G,OACP4M,GAAuB,SAAhBjG,KAAK2b,MAAM,GACO,IAAhB3b,KAAK3G,QAAkC,IAAlB2G,KAAK2b,MAAM,GAEzC1V,GAAO,iBAAoC,SAAhBjG,KAAK2b,MAAM,GAC7B3b,KAAK3G,OAAS,GACvB0hB,GAAO,EAAO,8CAEU,IAAlB/a,KAAK0b,UAAmBzV,EAAMA,GAGxCoV,EAAGpe,UAAU8I,OAAS,WACpB,OAAO/F,KAAKR,SAAS,GAAI,IAGvBjD,IACF8e,EAAGpe,UAAUwa,SAAW,SAAmB+D,EAAQniB,GACjD,OAAO2G,KAAK+e,YAAYxiB,EAAQif,EAAQniB,KAI5CgiB,EAAGpe,UAAU6f,QAAU,SAAkBtB,EAAQniB,GAC/C,OAAO2G,KAAK+e,YAAYhlB,MAAOyhB,EAAQniB,IAUzCgiB,EAAGpe,UAAU8hB,YAAc,SAAsBC,EAAWxD,EAAQniB,GAClE2G,KAAKkd,SAEL,IAAIxf,EAAasC,KAAKtC,aAClBuhB,EAAY5lB,GAAUkC,KAAK8J,IAAI,EAAG3H,GACtCqd,EAAOrd,GAAcuhB,EAAW,yCAChClE,EAAOkE,EAAY,EAAG,+BAEtB,IAAIrc,EAfS,SAAmBoc,EAAW1f,GAC3C,OAAI0f,EAAU3hB,YACL2hB,EAAU3hB,YAAYiC,GAExB,IAAI0f,EAAU1f,GAWX4f,CAASF,EAAWC,GAG9B,OADAjf,KAAK,gBADoB,OAAXwb,EAAkB,KAAO,OACR5Y,EAAKlF,GAC7BkF,GAGTyY,EAAGpe,UAAUkiB,eAAiB,SAAyBvc,EAAKlF,GAI1D,IAHA,IAAI0hB,EAAW,EACXjB,EAAQ,EAEHzlB,EAAI,EAAGwa,EAAQ,EAAGxa,EAAIsH,KAAK3G,OAAQX,IAAK,CAC/C,IAAIqc,EAAQ/U,KAAK2b,MAAMjjB,IAAMwa,EAASiL,EAEtCvb,EAAIwc,KAAqB,IAAPrK,EACdqK,EAAWxc,EAAIvJ,SACjBuJ,EAAIwc,KAAerK,GAAQ,EAAK,KAE9BqK,EAAWxc,EAAIvJ,SACjBuJ,EAAIwc,KAAerK,GAAQ,GAAM,KAGrB,IAAV7B,GACEkM,EAAWxc,EAAIvJ,SACjBuJ,EAAIwc,KAAerK,GAAQ,GAAM,KAEnCoJ,EAAQ,EACRjL,EAAQ,IAERiL,EAAQpJ,IAAS,GACjB7B,GAAS,EAEZ,CAED,GAAIkM,EAAWxc,EAAIvJ,OAGjB,IAFAuJ,EAAIwc,KAAcjB,EAEXiB,EAAWxc,EAAIvJ,QACpBuJ,EAAIwc,KAAc,GAKxB/D,EAAGpe,UAAUoiB,eAAiB,SAAyBzc,EAAKlF,GAI1D,IAHA,IAAI0hB,EAAWxc,EAAIvJ,OAAS,EACxB8kB,EAAQ,EAEHzlB,EAAI,EAAGwa,EAAQ,EAAGxa,EAAIsH,KAAK3G,OAAQX,IAAK,CAC/C,IAAIqc,EAAQ/U,KAAK2b,MAAMjjB,IAAMwa,EAASiL,EAEtCvb,EAAIwc,KAAqB,IAAPrK,EACdqK,GAAY,IACdxc,EAAIwc,KAAerK,GAAQ,EAAK,KAE9BqK,GAAY,IACdxc,EAAIwc,KAAerK,GAAQ,GAAM,KAGrB,IAAV7B,GACEkM,GAAY,IACdxc,EAAIwc,KAAerK,GAAQ,GAAM,KAEnCoJ,EAAQ,EACRjL,EAAQ,IAERiL,EAAQpJ,IAAS,GACjB7B,GAAS,EAEZ,CAED,GAAIkM,GAAY,EAGd,IAFAxc,EAAIwc,KAAcjB,EAEXiB,GAAY,GACjBxc,EAAIwc,KAAc,GAKpB7jB,KAAK+jB,MACPjE,EAAGpe,UAAUsiB,WAAa,SAAqBvC,GAC7C,OAAO,GAAKzhB,KAAK+jB,MAAMtC,IAGzB3B,EAAGpe,UAAUsiB,WAAa,SAAqBvC,GAC7C,IAAIwC,EAAIxC,EACJZ,EAAI,EAiBR,OAhBIoD,GAAK,OACPpD,GAAK,GACLoD,KAAO,IAELA,GAAK,KACPpD,GAAK,EACLoD,KAAO,GAELA,GAAK,IACPpD,GAAK,EACLoD,KAAO,GAELA,GAAK,IACPpD,GAAK,EACLoD,KAAO,GAEFpD,EAAIoD,GAIfnE,EAAGpe,UAAUwiB,UAAY,SAAoBzC,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIwC,EAAIxC,EACJZ,EAAI,EAoBR,OAnBqB,IAAZ,KAAJoD,KACHpD,GAAK,GACLoD,KAAO,IAEU,IAAV,IAAJA,KACHpD,GAAK,EACLoD,KAAO,GAES,IAAT,GAAJA,KACHpD,GAAK,EACLoD,KAAO,GAES,IAAT,EAAJA,KACHpD,GAAK,EACLoD,KAAO,GAES,IAAT,EAAJA,IACHpD,IAEKA,GAITf,EAAGpe,UAAUyiB,UAAY,WACvB,IAAI1C,EAAIhd,KAAK2b,MAAM3b,KAAK3G,OAAS,GAC7BmJ,EAAKxC,KAAKuf,WAAWvC,GACzB,OAA2B,IAAnBhd,KAAK3G,OAAS,GAAUmJ,GAiBlC6Y,EAAGpe,UAAU0iB,SAAW,WACtB,GAAI3f,KAAK2e,SAAU,OAAO,EAG1B,IADA,IAAIvC,EAAI,EACC1jB,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAAK,CACpC,IAAIgG,EAAIsB,KAAKyf,UAAUzf,KAAK2b,MAAMjjB,IAElC,GADA0jB,GAAK1d,EACK,KAANA,EAAU,KACf,CACD,OAAO0d,GAGTf,EAAGpe,UAAUS,WAAa,WACxB,OAAOnC,KAAKwhB,KAAK/c,KAAK0f,YAAc,IAGtCrE,EAAGpe,UAAU2iB,OAAS,SAAiB9I,GACrC,OAAsB,IAAlB9W,KAAK0b,SACA1b,KAAKpE,MAAMikB,MAAM/I,GAAOgJ,MAAM,GAEhC9f,KAAK0d,SAGdrC,EAAGpe,UAAU8iB,SAAW,SAAmBjJ,GACzC,OAAI9W,KAAKggB,MAAMlJ,EAAQ,GACd9W,KAAKigB,KAAKnJ,GAAOgJ,MAAM,GAAGI,OAE5BlgB,KAAK0d,SAGdrC,EAAGpe,UAAUkjB,MAAQ,WACnB,OAAyB,IAAlBngB,KAAK0b,UAIdL,EAAGpe,UAAUmjB,IAAM,WACjB,OAAOpgB,KAAK0d,QAAQwC,QAGtB7E,EAAGpe,UAAUijB,KAAO,WAKlB,OAJKlgB,KAAK2e,WACR3e,KAAK0b,UAAY,GAGZ1b,MAITqb,EAAGpe,UAAUojB,KAAO,SAAehmB,GACjC,KAAO2F,KAAK3G,OAASgB,EAAIhB,QACvB2G,KAAK2b,MAAM3b,KAAK3G,UAAY,EAG9B,IAAK,IAAIX,EAAI,EAAGA,EAAI2B,EAAIhB,OAAQX,IAC9BsH,KAAK2b,MAAMjjB,GAAKsH,KAAK2b,MAAMjjB,GAAK2B,EAAIshB,MAAMjjB,GAG5C,OAAOsH,KAAKkd,UAGd7B,EAAGpe,UAAUqjB,IAAM,SAAcjmB,GAE/B,OADA0gB,EAA0C,IAAlC/a,KAAK0b,SAAWrhB,EAAIqhB,WACrB1b,KAAKqgB,KAAKhmB,IAInBghB,EAAGpe,UAAUsjB,GAAK,SAAalmB,GAC7B,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQ4C,IAAIjmB,GAC/CA,EAAIqjB,QAAQ4C,IAAItgB,OAGzBqb,EAAGpe,UAAUujB,IAAM,SAAcnmB,GAC/B,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQ2C,KAAKhmB,GAChDA,EAAIqjB,QAAQ2C,KAAKrgB,OAI1Bqb,EAAGpe,UAAUwjB,MAAQ,SAAgBpmB,GAEnC,IAAIqE,EAEFA,EADEsB,KAAK3G,OAASgB,EAAIhB,OAChBgB,EAEA2F,KAGN,IAAK,IAAItH,EAAI,EAAGA,EAAIgG,EAAErF,OAAQX,IAC5BsH,KAAK2b,MAAMjjB,GAAKsH,KAAK2b,MAAMjjB,GAAK2B,EAAIshB,MAAMjjB,GAK5C,OAFAsH,KAAK3G,OAASqF,EAAErF,OAET2G,KAAKkd,UAGd7B,EAAGpe,UAAUyjB,KAAO,SAAermB,GAEjC,OADA0gB,EAA0C,IAAlC/a,KAAK0b,SAAWrhB,EAAIqhB,WACrB1b,KAAKygB,MAAMpmB,IAIpBghB,EAAGpe,UAAU0jB,IAAM,SAActmB,GAC/B,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQgD,KAAKrmB,GAChDA,EAAIqjB,QAAQgD,KAAK1gB,OAG1Bqb,EAAGpe,UAAU2jB,KAAO,SAAevmB,GACjC,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQ+C,MAAMpmB,GACjDA,EAAIqjB,QAAQ+C,MAAMzgB,OAI3Bqb,EAAGpe,UAAU4jB,MAAQ,SAAgBxmB,GAEnC,IAAImK,EACA9F,EACAsB,KAAK3G,OAASgB,EAAIhB,QACpBmL,EAAIxE,KACJtB,EAAIrE,IAEJmK,EAAInK,EACJqE,EAAIsB,MAGN,IAAK,IAAItH,EAAI,EAAGA,EAAIgG,EAAErF,OAAQX,IAC5BsH,KAAK2b,MAAMjjB,GAAK8L,EAAEmX,MAAMjjB,GAAKgG,EAAEid,MAAMjjB,GAGvC,GAAIsH,OAASwE,EACX,KAAO9L,EAAI8L,EAAEnL,OAAQX,IACnBsH,KAAK2b,MAAMjjB,GAAK8L,EAAEmX,MAAMjjB,GAM5B,OAFAsH,KAAK3G,OAASmL,EAAEnL,OAET2G,KAAKkd,UAGd7B,EAAGpe,UAAU6jB,KAAO,SAAezmB,GAEjC,OADA0gB,EAA0C,IAAlC/a,KAAK0b,SAAWrhB,EAAIqhB,WACrB1b,KAAK6gB,MAAMxmB,IAIpBghB,EAAGpe,UAAU8jB,IAAM,SAAc1mB,GAC/B,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQoD,KAAKzmB,GAChDA,EAAIqjB,QAAQoD,KAAK9gB,OAG1Bqb,EAAGpe,UAAU+jB,KAAO,SAAe3mB,GACjC,OAAI2F,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQmD,MAAMxmB,GACjDA,EAAIqjB,QAAQmD,MAAM7gB,OAI3Bqb,EAAGpe,UAAU4iB,MAAQ,SAAgB/I,GACnCiE,EAAwB,iBAAVjE,GAAsBA,GAAS,GAE7C,IAAImK,EAAsC,EAAxB1lB,KAAKwhB,KAAKjG,EAAQ,IAChCoK,EAAWpK,EAAQ,GAGvB9W,KAAK2d,QAAQsD,GAETC,EAAW,GACbD,IAIF,IAAK,IAAIvoB,EAAI,EAAGA,EAAIuoB,EAAavoB,IAC/BsH,KAAK2b,MAAMjjB,GAAsB,UAAhBsH,KAAK2b,MAAMjjB,GAS9B,OALIwoB,EAAW,IACblhB,KAAK2b,MAAMjjB,IAAMsH,KAAK2b,MAAMjjB,GAAM,UAAc,GAAKwoB,GAIhDlhB,KAAKkd,UAGd7B,EAAGpe,UAAUgjB,KAAO,SAAenJ,GACjC,OAAO9W,KAAK0d,QAAQmC,MAAM/I,IAI5BuE,EAAGpe,UAAUkkB,KAAO,SAAeC,EAAK1gB,GACtCqa,EAAsB,iBAARqG,GAAoBA,GAAO,GAEzC,IAAInE,EAAOmE,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAphB,KAAK2d,QAAQV,EAAM,GAGjBjd,KAAK2b,MAAMsB,GADTvc,EACgBV,KAAK2b,MAAMsB,GAAQ,GAAKoE,EAExBrhB,KAAK2b,MAAMsB,KAAS,GAAKoE,GAGtCrhB,KAAKkd,UAId7B,EAAGpe,UAAUqkB,KAAO,SAAejnB,GACjC,IAAI+hB,EAkBA5X,EAAG9F,EAfP,GAAsB,IAAlBsB,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,SAI7B,OAHA1b,KAAK0b,SAAW,EAChBU,EAAIpc,KAAKuhB,KAAKlnB,GACd2F,KAAK0b,UAAY,EACV1b,KAAK4d,YAGP,GAAsB,IAAlB5d,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,SAIpC,OAHArhB,EAAIqhB,SAAW,EACfU,EAAIpc,KAAKuhB,KAAKlnB,GACdA,EAAIqhB,SAAW,EACRU,EAAEwB,YAKP5d,KAAK3G,OAASgB,EAAIhB,QACpBmL,EAAIxE,KACJtB,EAAIrE,IAEJmK,EAAInK,EACJqE,EAAIsB,MAIN,IADA,IAAIme,EAAQ,EACHzlB,EAAI,EAAGA,EAAIgG,EAAErF,OAAQX,IAC5B0jB,GAAkB,EAAb5X,EAAEmX,MAAMjjB,KAAwB,EAAbgG,EAAEid,MAAMjjB,IAAUylB,EAC1Cne,KAAK2b,MAAMjjB,GAAS,SAAJ0jB,EAChB+B,EAAQ/B,IAAM,GAEhB,KAAiB,IAAV+B,GAAezlB,EAAI8L,EAAEnL,OAAQX,IAClC0jB,GAAkB,EAAb5X,EAAEmX,MAAMjjB,IAAUylB,EACvBne,KAAK2b,MAAMjjB,GAAS,SAAJ0jB,EAChB+B,EAAQ/B,IAAM,GAIhB,GADApc,KAAK3G,OAASmL,EAAEnL,OACF,IAAV8kB,EACFne,KAAK2b,MAAM3b,KAAK3G,QAAU8kB,EAC1Bne,KAAK3G,cAEA,GAAImL,IAAMxE,KACf,KAAOtH,EAAI8L,EAAEnL,OAAQX,IACnBsH,KAAK2b,MAAMjjB,GAAK8L,EAAEmX,MAAMjjB,GAI5B,OAAOsH,MAITqb,EAAGpe,UAAUukB,IAAM,SAAcnnB,GAC/B,IAAIuI,EACJ,OAAqB,IAAjBvI,EAAIqhB,UAAoC,IAAlB1b,KAAK0b,UAC7BrhB,EAAIqhB,SAAW,EACf9Y,EAAM5C,KAAKuK,IAAIlQ,GACfA,EAAIqhB,UAAY,EACT9Y,GACmB,IAAjBvI,EAAIqhB,UAAoC,IAAlB1b,KAAK0b,UACpC1b,KAAK0b,SAAW,EAChB9Y,EAAMvI,EAAIkQ,IAAIvK,MACdA,KAAK0b,SAAW,EACT9Y,GAGL5C,KAAK3G,OAASgB,EAAIhB,OAAe2G,KAAK0d,QAAQ4D,KAAKjnB,GAEhDA,EAAIqjB,QAAQ4D,KAAKthB,OAI1Bqb,EAAGpe,UAAUskB,KAAO,SAAelnB,GAEjC,GAAqB,IAAjBA,EAAIqhB,SAAgB,CACtBrhB,EAAIqhB,SAAW,EACf,IAAIU,EAAIpc,KAAKshB,KAAKjnB,GAElB,OADAA,EAAIqhB,SAAW,EACRU,EAAEwB,WAGf,CAAW,GAAsB,IAAlB5d,KAAK0b,SAId,OAHA1b,KAAK0b,SAAW,EAChB1b,KAAKshB,KAAKjnB,GACV2F,KAAK0b,SAAW,EACT1b,KAAK4d,YAId,IAWIpZ,EAAG9F,EAXH+d,EAAMzc,KAAKyc,IAAIpiB,GAGnB,GAAY,IAARoiB,EAIF,OAHAzc,KAAK0b,SAAW,EAChB1b,KAAK3G,OAAS,EACd2G,KAAK2b,MAAM,GAAK,EACT3b,KAKLyc,EAAM,GACRjY,EAAIxE,KACJtB,EAAIrE,IAEJmK,EAAInK,EACJqE,EAAIsB,MAIN,IADA,IAAIme,EAAQ,EACHzlB,EAAI,EAAGA,EAAIgG,EAAErF,OAAQX,IAE5BylB,GADA/B,GAAkB,EAAb5X,EAAEmX,MAAMjjB,KAAwB,EAAbgG,EAAEid,MAAMjjB,IAAUylB,IAC7B,GACbne,KAAK2b,MAAMjjB,GAAS,SAAJ0jB,EAElB,KAAiB,IAAV+B,GAAezlB,EAAI8L,EAAEnL,OAAQX,IAElCylB,GADA/B,GAAkB,EAAb5X,EAAEmX,MAAMjjB,IAAUylB,IACV,GACbne,KAAK2b,MAAMjjB,GAAS,SAAJ0jB,EAIlB,GAAc,IAAV+B,GAAezlB,EAAI8L,EAAEnL,QAAUmL,IAAMxE,KACvC,KAAOtH,EAAI8L,EAAEnL,OAAQX,IACnBsH,KAAK2b,MAAMjjB,GAAK8L,EAAEmX,MAAMjjB,GAU5B,OANAsH,KAAK3G,OAASkC,KAAK8J,IAAIrF,KAAK3G,OAAQX,GAEhC8L,IAAMxE,OACRA,KAAK0b,SAAW,GAGX1b,KAAKkd,UAId7B,EAAGpe,UAAUsN,IAAM,SAAclQ,GAC/B,OAAO2F,KAAK0d,QAAQ6D,KAAKlnB,IA+C3B,IAAIonB,EAAc,SAAsBvD,EAAM7jB,EAAK6L,GACjD,IAIIzD,EACAif,EACAlf,EANAgC,EAAI0Z,EAAKvC,MACTjd,EAAIrE,EAAIshB,MACRgG,EAAIzb,EAAIyV,MACRjgB,EAAI,EAIJkmB,EAAY,EAAPpd,EAAE,GACPqd,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvd,EAAE,GACPwd,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1d,EAAE,GACP2d,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP7d,EAAE,GACP8d,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhe,EAAE,GACPie,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPne,EAAE,GACPoe,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPte,EAAE,GACPue,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPze,EAAE,GACP0e,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5e,EAAE,GACP6e,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/e,EAAE,GACPgf,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhlB,EAAE,GACPilB,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnlB,EAAE,GACPolB,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtlB,EAAE,GACPulB,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzlB,EAAE,GACP0lB,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5lB,EAAE,GACP6lB,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/lB,EAAE,GACPgmB,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlmB,EAAE,GACPmmB,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrmB,EAAE,GACPsmB,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxmB,EAAE,GACPymB,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3mB,EAAE,GACP4mB,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjBnf,EAAIwV,SAAWwC,EAAKxC,SAAWrhB,EAAIqhB,SACnCxV,EAAI7M,OAAS,GAMb,IAAImsB,IAAQ9pB,GAJZ+G,EAAKlH,KAAKkqB,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAMnmB,KAAKkqB,KAAK5D,EAAK+B,IACRroB,KAAKkqB,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDjoB,IAFA8G,EAAKjH,KAAKkqB,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN/iB,EAAKlH,KAAKkqB,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKzD,EAAK4B,IACRroB,KAAKkqB,KAAKxD,EAAK0B,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQhqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKkC,GAAQ,GACvBxoB,KAAKkqB,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDpoB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENjjB,EAAKlH,KAAKkqB,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKtD,EAAKyB,IACRroB,KAAKkqB,KAAKrD,EAAKuB,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKrD,EAAKwB,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAK+B,GAAQ,GACvBxoB,KAAKkqB,KAAKxD,EAAK6B,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQjqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKqC,GAAQ,GACvB3oB,KAAKkqB,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDvoB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENljB,EAAKlH,KAAKkqB,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKnD,EAAKsB,IACRroB,KAAKkqB,KAAKlD,EAAKoB,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKlD,EAAKqB,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAK4B,GAAQ,GACvBxoB,KAAKkqB,KAAKrD,EAAK0B,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAK2B,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKkC,GAAQ,GACvB3oB,KAAKkqB,KAAKxD,EAAKgC,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQlqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKwC,GAAQ,GACvB9oB,KAAKkqB,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD1oB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENnjB,EAAKlH,KAAKkqB,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKhD,EAAKmB,IACRroB,KAAKkqB,KAAK/C,EAAKiB,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAK/C,EAAKkB,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAKyB,GAAQ,GACvBxoB,KAAKkqB,KAAKlD,EAAKuB,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAKwB,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAK+B,GAAQ,GACvB3oB,KAAKkqB,KAAKrD,EAAK6B,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAK8B,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKqC,GAAQ,GACvB9oB,KAAKkqB,KAAKxD,EAAKmC,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQnqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAK2C,IAAQ,GACvBjpB,KAAKkqB,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrD7oB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENpjB,EAAKlH,KAAKkqB,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAK7C,EAAKgB,IACRroB,KAAKkqB,KAAK5C,EAAKc,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAK5C,EAAKe,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAKsB,GAAQ,GACvBxoB,KAAKkqB,KAAK/C,EAAKoB,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAKqB,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAK4B,GAAQ,GACvB3oB,KAAKkqB,KAAKlD,EAAK0B,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAK2B,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAKkC,GAAQ,GACvB9oB,KAAKkqB,KAAKrD,EAAKgC,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAKiC,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKwC,IAAQ,GACvBjpB,KAAKkqB,KAAKxD,EAAKsC,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQpqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAK8C,IAAQ,GACvBppB,KAAKkqB,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDhpB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENrjB,EAAKlH,KAAKkqB,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAK1C,EAAKa,IACRroB,KAAKkqB,KAAKzC,EAAKW,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKzC,EAAKY,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKmB,GAAQ,GACvBxoB,KAAKkqB,KAAK5C,EAAKiB,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKkB,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAKyB,GAAQ,GACvB3oB,KAAKkqB,KAAK/C,EAAKuB,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAKwB,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAK+B,GAAQ,GACvB9oB,KAAKkqB,KAAKlD,EAAK6B,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAK8B,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAKqC,IAAQ,GACvBjpB,KAAKkqB,KAAKrD,EAAKmC,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAKoC,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAK2C,IAAQ,GACvBppB,KAAKkqB,KAAKxD,EAAKyC,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQrqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKiD,IAAQ,GACvBvpB,KAAKkqB,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDnpB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENtjB,EAAKlH,KAAKkqB,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKvC,EAAKU,IACRroB,KAAKkqB,KAAKtC,EAAKQ,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKtC,EAAKS,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKgB,GAAQ,GACvBxoB,KAAKkqB,KAAKzC,EAAKc,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKe,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKsB,GAAQ,GACvB3oB,KAAKkqB,KAAK5C,EAAKoB,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKqB,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAK4B,GAAQ,GACvB9oB,KAAKkqB,KAAK/C,EAAK0B,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAK2B,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAKkC,IAAQ,GACvBjpB,KAAKkqB,KAAKlD,EAAKgC,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAKiC,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAKwC,IAAQ,GACvBppB,KAAKkqB,KAAKrD,EAAKsC,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAKuC,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAK8C,IAAQ,GACvBvpB,KAAKkqB,KAAKxD,EAAK4C,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQtqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKoD,IAAQ,GACvB1pB,KAAKkqB,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrDtpB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENvjB,EAAKlH,KAAKkqB,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKpC,EAAKO,IACRroB,KAAKkqB,KAAKnC,EAAKK,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKnC,EAAKM,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKa,GAAQ,GACvBxoB,KAAKkqB,KAAKtC,EAAKW,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKY,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKmB,GAAQ,GACvB3oB,KAAKkqB,KAAKzC,EAAKiB,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKkB,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKyB,GAAQ,GACvB9oB,KAAKkqB,KAAK5C,EAAKuB,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKwB,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAK+B,IAAQ,GACvBjpB,KAAKkqB,KAAK/C,EAAK6B,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAK8B,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAKqC,IAAQ,GACvBppB,KAAKkqB,KAAKlD,EAAKmC,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAKoC,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAK2C,IAAQ,GACvBvpB,KAAKkqB,KAAKrD,EAAKyC,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAK0C,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKiD,IAAQ,GACvB1pB,KAAKkqB,KAAKxD,EAAK+C,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQvqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAKuD,IAAQ,GACvB7pB,KAAKkqB,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDzpB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENxjB,EAAKlH,KAAKkqB,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKI,IACRroB,KAAKkqB,KAAKhC,EAAKE,GAAQ,EACpCnhB,EAAKjH,KAAKkqB,KAAKhC,EAAKG,GACpBnhB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKU,GAAQ,GACvBxoB,KAAKkqB,KAAKnC,EAAKQ,GAAQ,EACpCthB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKS,GAAQ,EAClCthB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKgB,GAAQ,GACvB3oB,KAAKkqB,KAAKtC,EAAKc,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKe,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKsB,GAAQ,GACvB9oB,KAAKkqB,KAAKzC,EAAKoB,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKqB,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAK4B,IAAQ,GACvBjpB,KAAKkqB,KAAK5C,EAAK0B,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAK2B,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAKkC,IAAQ,GACvBppB,KAAKkqB,KAAK/C,EAAKgC,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAKiC,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAKwC,IAAQ,GACvBvpB,KAAKkqB,KAAKlD,EAAKsC,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAKuC,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAK8C,IAAQ,GACvB1pB,KAAKkqB,KAAKrD,EAAK4C,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAK6C,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKoD,IAAQ,GACvB7pB,KAAKkqB,KAAKxD,EAAKkD,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQxqB,GAJZ+G,EAAMA,EAAKlH,KAAKkqB,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK5D,EAAK0D,IAAQ,GACvBhqB,KAAKkqB,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENzjB,EAAKlH,KAAKkqB,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKO,IACRxoB,KAAKkqB,KAAKhC,EAAKK,GAAQ,EACpCthB,EAAKjH,KAAKkqB,KAAKhC,EAAKM,GACpBthB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKa,GAAQ,GACvB3oB,KAAKkqB,KAAKnC,EAAKW,GAAQ,EACpCzhB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKY,GAAQ,EAClCzhB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKmB,GAAQ,GACvB9oB,KAAKkqB,KAAKtC,EAAKiB,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKkB,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKyB,IAAQ,GACvBjpB,KAAKkqB,KAAKzC,EAAKuB,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKwB,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAK+B,IAAQ,GACvBppB,KAAKkqB,KAAK5C,EAAK6B,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAK8B,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAKqC,IAAQ,GACvBvpB,KAAKkqB,KAAK/C,EAAKmC,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAKoC,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAK2C,IAAQ,GACvB1pB,KAAKkqB,KAAKlD,EAAKyC,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAK0C,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAKiD,IAAQ,GACvB7pB,KAAKkqB,KAAKrD,EAAK+C,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASzqB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKzD,EAAKuD,IAAQ,GACvBhqB,KAAKkqB,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP1jB,EAAKlH,KAAKkqB,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKU,IACR3oB,KAAKkqB,KAAKhC,EAAKQ,GAAQ,EACpCzhB,EAAKjH,KAAKkqB,KAAKhC,EAAKS,GACpBzhB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKgB,GAAQ,GACvB9oB,KAAKkqB,KAAKnC,EAAKc,GAAQ,EACpC5hB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKe,GAAQ,EAClC5hB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKsB,IAAQ,GACvBjpB,KAAKkqB,KAAKtC,EAAKoB,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKqB,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAK4B,IAAQ,GACvBppB,KAAKkqB,KAAKzC,EAAK0B,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAK2B,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKkC,IAAQ,GACvBvpB,KAAKkqB,KAAK5C,EAAKgC,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKiC,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAKwC,IAAQ,GACvB1pB,KAAKkqB,KAAK/C,EAAKsC,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAKuC,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAK8C,IAAQ,GACvB7pB,KAAKkqB,KAAKlD,EAAK4C,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS1qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKtD,EAAKoD,IAAQ,GACvBhqB,KAAKkqB,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP3jB,EAAKlH,KAAKkqB,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKa,IACR9oB,KAAKkqB,KAAKhC,EAAKW,GAAQ,EACpC5hB,EAAKjH,KAAKkqB,KAAKhC,EAAKY,GACpB5hB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKmB,IAAQ,GACvBjpB,KAAKkqB,KAAKnC,EAAKiB,GAAQ,EACpC/hB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKkB,IAAQ,EAClC/hB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKyB,IAAQ,GACvBppB,KAAKkqB,KAAKtC,EAAKuB,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKwB,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAK+B,IAAQ,GACvBvpB,KAAKkqB,KAAKzC,EAAK6B,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAK8B,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKqC,IAAQ,GACvB1pB,KAAKkqB,KAAK5C,EAAKmC,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKoC,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAK2C,IAAQ,GACvB7pB,KAAKkqB,KAAK/C,EAAKyC,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAS3qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKnD,EAAKiD,IAAQ,GACvBhqB,KAAKkqB,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP5jB,EAAKlH,KAAKkqB,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKgB,KACRjpB,KAAKkqB,KAAKhC,EAAKc,GAAQ,EACpC/hB,EAAKjH,KAAKkqB,KAAKhC,EAAKe,IACpB/hB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKsB,IAAQ,GACvBppB,KAAKkqB,KAAKnC,EAAKoB,IAAQ,EACpCliB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKqB,IAAQ,EAClCliB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAK4B,IAAQ,GACvBvpB,KAAKkqB,KAAKtC,EAAK0B,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAK2B,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKkC,IAAQ,GACvB1pB,KAAKkqB,KAAKzC,EAAKgC,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKiC,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAKwC,IAAQ,GACvB7pB,KAAKkqB,KAAK5C,EAAKsC,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAAS5qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKhD,EAAK8C,IAAQ,GACvBhqB,KAAKkqB,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP7jB,EAAKlH,KAAKkqB,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKmB,KACRppB,KAAKkqB,KAAKhC,EAAKiB,IAAQ,EACpCliB,EAAKjH,KAAKkqB,KAAKhC,EAAKkB,IACpBliB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKyB,IAAQ,GACvBvpB,KAAKkqB,KAAKnC,EAAKuB,IAAQ,EACpCriB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKwB,IAAQ,EAClCriB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAK+B,IAAQ,GACvB1pB,KAAKkqB,KAAKtC,EAAK6B,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAK8B,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKqC,IAAQ,GACvB7pB,KAAKkqB,KAAKzC,EAAKmC,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAS7qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK7C,EAAK2C,IAAQ,GACvBhqB,KAAKkqB,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP9jB,EAAKlH,KAAKkqB,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKsB,KACRvpB,KAAKkqB,KAAKhC,EAAKoB,IAAQ,EACpCriB,EAAKjH,KAAKkqB,KAAKhC,EAAKqB,IACpBriB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAK4B,IAAQ,GACvB1pB,KAAKkqB,KAAKnC,EAAK0B,IAAQ,EACpCxiB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAK2B,IAAQ,EAClCxiB,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKkC,IAAQ,GACvB7pB,KAAKkqB,KAAKtC,EAAKgC,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAAS9qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAK1C,EAAKwC,IAAQ,GACvBhqB,KAAKkqB,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP/jB,EAAKlH,KAAKkqB,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAKyB,KACR1pB,KAAKkqB,KAAKhC,EAAKuB,IAAQ,EACpCxiB,EAAKjH,KAAKkqB,KAAKhC,EAAKwB,IACpBxiB,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAK+B,IAAQ,GACvB7pB,KAAKkqB,KAAKnC,EAAK6B,IAAQ,EACpC3iB,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAAS/qB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKvC,EAAKqC,IAAQ,GACvBhqB,KAAKkqB,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPhkB,EAAKlH,KAAKkqB,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAK4B,KACR7pB,KAAKkqB,KAAKhC,EAAK0B,IAAQ,EACpC3iB,EAAKjH,KAAKkqB,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAAShrB,GAJb+G,EAAMA,EAAKlH,KAAKkqB,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAMnmB,KAAKkqB,KAAKpC,EAAKkC,IAAQ,GACvBhqB,KAAKkqB,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtD5pB,IAFA8G,EAAMA,EAAKjH,KAAKkqB,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAASjrB,GAJb+G,EAAKlH,KAAKkqB,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAMnmB,KAAKkqB,KAAKjC,EAAK+B,KACRhqB,KAAKkqB,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBA5pB,IAFA8G,EAAKjH,KAAKkqB,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANjrB,IACFimB,EAAE,IAAMjmB,EACRwK,EAAI7M,UAEC6M,GAQT,SAAS0gB,EAAU1I,EAAM7jB,EAAK6L,GAC5BA,EAAIwV,SAAWrhB,EAAIqhB,SAAWwC,EAAKxC,SACnCxV,EAAI7M,OAAS6kB,EAAK7kB,OAASgB,EAAIhB,OAI/B,IAFA,IAAI8kB,EAAQ,EACR0I,EAAU,EACLzI,EAAI,EAAGA,EAAIlY,EAAI7M,OAAS,EAAG+kB,IAAK,CAGvC,IAAIC,EAASwI,EACbA,EAAU,EAGV,IAFA,IAAIvI,EAAgB,SAARH,EACRI,EAAOhjB,KAAKoH,IAAIyb,EAAG/jB,EAAIhB,OAAS,GAC3BkI,EAAIhG,KAAK8J,IAAI,EAAG+Y,EAAIF,EAAK7kB,OAAS,GAAIkI,GAAKgd,EAAMhd,IAAK,CAC7D,IAAI7I,EAAI0lB,EAAI7c,EAGR6a,GAFoB,EAAhB8B,EAAKvC,MAAMjjB,KACI,EAAf2B,EAAIshB,MAAMpa,IAGdkB,EAAS,SAAJ2Z,EAGTkC,EAAa,UADb7b,EAAMA,EAAK6b,EAAS,GAIpBuI,IAFAxI,GAHAA,EAAUA,GAAWjC,EAAI,SAAa,GAAM,IAGxB3Z,IAAO,IAAO,KAEZ,GACtB4b,GAAU,QACX,CACDnY,EAAIyV,MAAMyC,GAAKE,EACfH,EAAQE,EACRA,EAASwI,CACV,CAOD,OANc,IAAV1I,EACFjY,EAAIyV,MAAMyC,GAAKD,EAEfjY,EAAI7M,SAGC6M,EAAIgX,QACZ,CAED,SAAS4J,EAAY5I,EAAM7jB,EAAK6L,GAI9B,OAAO0gB,EAAS1I,EAAM7jB,EAAK6L,EAC5B,CAlDI3K,KAAKkqB,OACRhE,EAAcxD,GAmDhB5C,EAAGpe,UAAU8pB,MAAQ,SAAgB1sB,EAAK6L,GACxC,IACInN,EAAMiH,KAAK3G,OAASgB,EAAIhB,OAW5B,OAVoB,KAAhB2G,KAAK3G,QAAgC,KAAfgB,EAAIhB,OACtBooB,EAAYzhB,KAAM3F,EAAK6L,GACpBnN,EAAM,GACTklB,EAAWje,KAAM3F,EAAK6L,GACnBnN,EAAM,KACT6tB,EAAS5mB,KAAM3F,EAAK6L,GAEpB4gB,EAAW9mB,KAAM3F,EAAK6L,IA2MhCmV,EAAGpe,UAAUoK,IAAM,SAAchN,GAC/B,IAAI6L,EAAM,IAAImV,EAAG,MAEjB,OADAnV,EAAIyV,MAAQ,IAAI5hB,MAAMiG,KAAK3G,OAASgB,EAAIhB,QACjC2G,KAAK+mB,MAAM1sB,EAAK6L,IAIzBmV,EAAGpe,UAAU+pB,KAAO,SAAe3sB,GACjC,IAAI6L,EAAM,IAAImV,EAAG,MAEjB,OADAnV,EAAIyV,MAAQ,IAAI5hB,MAAMiG,KAAK3G,OAASgB,EAAIhB,QACjCytB,EAAW9mB,KAAM3F,EAAK6L,IAI/BmV,EAAGpe,UAAUwoB,KAAO,SAAeprB,GACjC,OAAO2F,KAAK0d,QAAQqJ,MAAM1sB,EAAK2F,OAGjCqb,EAAGpe,UAAUsgB,MAAQ,SAAgBljB,GACnC,IAAI4sB,EAAW5sB,EAAM,EACjB4sB,IAAU5sB,GAAOA,GAErB0gB,EAAsB,iBAAR1gB,GACd0gB,EAAO1gB,EAAM,UAIb,IADA,IAAI8jB,EAAQ,EACHzlB,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAAK,CACpC,IAAIskB,GAAqB,EAAhBhd,KAAK2b,MAAMjjB,IAAU2B,EAC1BoI,GAAU,SAAJua,IAA0B,SAARmB,GAC5BA,IAAU,GACVA,GAAUnB,EAAI,SAAa,EAE3BmB,GAAS1b,IAAO,GAChBzC,KAAK2b,MAAMjjB,GAAU,SAAL+J,CACjB,CAOD,OALc,IAAV0b,IACFne,KAAK2b,MAAMjjB,GAAKylB,EAChBne,KAAK3G,UAGA4tB,EAAWjnB,KAAKkgB,OAASlgB,MAGlCqb,EAAGpe,UAAUiqB,KAAO,SAAe7sB,GACjC,OAAO2F,KAAK0d,QAAQH,MAAMljB,IAI5BghB,EAAGpe,UAAUkqB,IAAM,WACjB,OAAOnnB,KAAKqH,IAAIrH,OAIlBqb,EAAGpe,UAAUmqB,KAAO,WAClB,OAAOpnB,KAAKylB,KAAKzlB,KAAK0d,UAIxBrC,EAAGpe,UAAUzB,IAAM,SAAcnB,GAC/B,IAAI2iB,EA7xCN,SAAqB3iB,GAGnB,IAFA,IAAI2iB,EAAI,IAAIjjB,MAAMM,EAAIqlB,aAEb0B,EAAM,EAAGA,EAAMpE,EAAE3jB,OAAQ+nB,IAAO,CACvC,IAAInE,EAAOmE,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjBpE,EAAEoE,GAAQ/mB,EAAIshB,MAAMsB,KAASoE,EAAQ,CACtC,CAED,OAAOrE,CACR,CAkxCSqK,CAAWhtB,GACnB,GAAiB,IAAb2iB,EAAE3jB,OAAc,OAAO,IAAIgiB,EAAG,GAIlC,IADA,IAAIzY,EAAM5C,KACDtH,EAAI,EAAGA,EAAIskB,EAAE3jB,QACP,IAAT2jB,EAAEtkB,GADsBA,IAAKkK,EAAMA,EAAIukB,OAI7C,KAAMzuB,EAAIskB,EAAE3jB,OACV,IAAK,IAAIiuB,EAAI1kB,EAAIukB,MAAOzuB,EAAIskB,EAAE3jB,OAAQX,IAAK4uB,EAAIA,EAAEH,MAClC,IAATnK,EAAEtkB,KAENkK,EAAMA,EAAIyE,IAAIigB,IAIlB,OAAO1kB,GAITyY,EAAGpe,UAAUsqB,OAAS,SAAiBrZ,GACrC6M,EAAuB,iBAAT7M,GAAqBA,GAAQ,GAC3C,IAGIxV,EAHA0jB,EAAIlO,EAAO,GACX9S,GAAK8S,EAAOkO,GAAK,GACjBoL,EAAa,WAAe,GAAKpL,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAI+B,EAAQ,EAEZ,IAAKzlB,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAAK,CAChC,IAAI+uB,EAAWznB,KAAK2b,MAAMjjB,GAAK8uB,EAC3B9rB,GAAsB,EAAhBsE,KAAK2b,MAAMjjB,IAAU+uB,GAAarL,EAC5Cpc,KAAK2b,MAAMjjB,GAAKgD,EAAIyiB,EACpBA,EAAQsJ,IAAc,GAAKrL,CAC5B,CAEG+B,IACFne,KAAK2b,MAAMjjB,GAAKylB,EAChBne,KAAK3G,SAER,CAED,GAAU,IAAN+B,EAAS,CACX,IAAK1C,EAAIsH,KAAK3G,OAAS,EAAGX,GAAK,EAAGA,IAChCsH,KAAK2b,MAAMjjB,EAAI0C,GAAK4E,KAAK2b,MAAMjjB,GAGjC,IAAKA,EAAI,EAAGA,EAAI0C,EAAG1C,IACjBsH,KAAK2b,MAAMjjB,GAAK,EAGlBsH,KAAK3G,QAAU+B,CAChB,CAED,OAAO4E,KAAKkd,UAGd7B,EAAGpe,UAAUyqB,MAAQ,SAAgBxZ,GAGnC,OADA6M,EAAyB,IAAlB/a,KAAK0b,UACL1b,KAAKunB,OAAOrZ,IAMrBmN,EAAGpe,UAAU0qB,OAAS,SAAiBzZ,EAAM0Z,EAAMC,GAEjD,IAAIC,EADJ/M,EAAuB,iBAAT7M,GAAqBA,GAAQ,GAGzC4Z,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIxL,EAAIlO,EAAO,GACX9S,EAAIG,KAAKoH,KAAKuL,EAAOkO,GAAK,GAAIpc,KAAK3G,QACnC0uB,EAAO,SAAc,WAAc3L,GAAMA,EACzC4L,EAAcH,EAMlB,GAJAC,GAAK1sB,EACL0sB,EAAIvsB,KAAK8J,IAAI,EAAGyiB,GAGZE,EAAa,CACf,IAAK,IAAItvB,EAAI,EAAGA,EAAI0C,EAAG1C,IACrBsvB,EAAYrM,MAAMjjB,GAAKsH,KAAK2b,MAAMjjB,GAEpCsvB,EAAY3uB,OAAS+B,CACtB,CAED,GAAU,IAANA,QAEG,GAAI4E,KAAK3G,OAAS+B,EAEvB,IADA4E,KAAK3G,QAAU+B,EACV1C,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAC3BsH,KAAK2b,MAAMjjB,GAAKsH,KAAK2b,MAAMjjB,EAAI0C,QAGjC4E,KAAK2b,MAAM,GAAK,EAChB3b,KAAK3G,OAAS,EAGhB,IAAI8kB,EAAQ,EACZ,IAAKzlB,EAAIsH,KAAK3G,OAAS,EAAGX,GAAK,IAAgB,IAAVylB,GAAezlB,GAAKovB,GAAIpvB,IAAK,CAChE,IAAIqc,EAAuB,EAAhB/U,KAAK2b,MAAMjjB,GACtBsH,KAAK2b,MAAMjjB,GAAMylB,GAAU,GAAK/B,EAAOrH,IAASqH,EAChD+B,EAAQpJ,EAAOgT,CAChB,CAYD,OATIC,GAAyB,IAAV7J,IACjB6J,EAAYrM,MAAMqM,EAAY3uB,UAAY8kB,GAGxB,IAAhBne,KAAK3G,SACP2G,KAAK2b,MAAM,GAAK,EAChB3b,KAAK3G,OAAS,GAGT2G,KAAKkd,UAGd7B,EAAGpe,UAAUgrB,MAAQ,SAAgB/Z,EAAM0Z,EAAMC,GAG/C,OADA9M,EAAyB,IAAlB/a,KAAK0b,UACL1b,KAAK2nB,OAAOzZ,EAAM0Z,EAAMC,IAIjCxM,EAAGpe,UAAUirB,KAAO,SAAeha,GACjC,OAAOlO,KAAK0d,QAAQgK,MAAMxZ,IAG5BmN,EAAGpe,UAAUkrB,MAAQ,SAAgBja,GACnC,OAAOlO,KAAK0d,QAAQ6J,OAAOrZ,IAI7BmN,EAAGpe,UAAUmrB,KAAO,SAAela,GACjC,OAAOlO,KAAK0d,QAAQuK,MAAM/Z,IAG5BmN,EAAGpe,UAAUorB,MAAQ,SAAgBna,GACnC,OAAOlO,KAAK0d,QAAQiK,OAAOzZ,IAI7BmN,EAAGpe,UAAU+iB,MAAQ,SAAgBoB,GACnCrG,EAAsB,iBAARqG,GAAoBA,GAAO,GACzC,IAAIhF,EAAIgF,EAAM,GACVhmB,GAAKgmB,EAAMhF,GAAK,GAChBkL,EAAI,GAAKlL,EAGb,QAAIpc,KAAK3G,QAAU+B,KAGX4E,KAAK2b,MAAMvgB,GAELksB,KAIhBjM,EAAGpe,UAAUqrB,OAAS,SAAiBpa,GACrC6M,EAAuB,iBAAT7M,GAAqBA,GAAQ,GAC3C,IAAIkO,EAAIlO,EAAO,GACX9S,GAAK8S,EAAOkO,GAAK,GAIrB,GAFArB,EAAyB,IAAlB/a,KAAK0b,SAAgB,2CAExB1b,KAAK3G,QAAU+B,EACjB,OAAO4E,KAQT,GALU,IAANoc,GACFhhB,IAEF4E,KAAK3G,OAASkC,KAAKoH,IAAIvH,EAAG4E,KAAK3G,QAErB,IAAN+iB,EAAS,CACX,IAAI2L,EAAO,SAAc,WAAc3L,GAAMA,EAC7Cpc,KAAK2b,MAAM3b,KAAK3G,OAAS,IAAM0uB,CAChC,CAED,OAAO/nB,KAAKkd,UAId7B,EAAGpe,UAAUsrB,MAAQ,SAAgBra,GACnC,OAAOlO,KAAK0d,QAAQ4K,OAAOpa,IAI7BmN,EAAGpe,UAAU6iB,MAAQ,SAAgBzlB,GAGnC,OAFA0gB,EAAsB,iBAAR1gB,GACd0gB,EAAO1gB,EAAM,UACTA,EAAM,EAAU2F,KAAKwoB,OAAOnuB,GAGV,IAAlB2F,KAAK0b,SACa,IAAhB1b,KAAK3G,SAAiC,EAAhB2G,KAAK2b,MAAM,KAAWthB,GAC9C2F,KAAK2b,MAAM,GAAKthB,GAAuB,EAAhB2F,KAAK2b,MAAM,IAClC3b,KAAK0b,SAAW,EACT1b,OAGTA,KAAK0b,SAAW,EAChB1b,KAAKwoB,MAAMnuB,GACX2F,KAAK0b,SAAW,EACT1b,MAIFA,KAAKwd,OAAOnjB,IAGrBghB,EAAGpe,UAAUugB,OAAS,SAAiBnjB,GACrC2F,KAAK2b,MAAM,IAAMthB,EAGjB,IAAK,IAAI3B,EAAI,EAAGA,EAAIsH,KAAK3G,QAAU2G,KAAK2b,MAAMjjB,IAAM,SAAWA,IAC7DsH,KAAK2b,MAAMjjB,IAAM,SACbA,IAAMsH,KAAK3G,OAAS,EACtB2G,KAAK2b,MAAMjjB,EAAI,GAAK,EAEpBsH,KAAK2b,MAAMjjB,EAAI,KAKnB,OAFAsH,KAAK3G,OAASkC,KAAK8J,IAAIrF,KAAK3G,OAAQX,EAAI,GAEjCsH,MAITqb,EAAGpe,UAAUurB,MAAQ,SAAgBnuB,GAGnC,GAFA0gB,EAAsB,iBAAR1gB,GACd0gB,EAAO1gB,EAAM,UACTA,EAAM,EAAG,OAAO2F,KAAK8f,OAAOzlB,GAEhC,GAAsB,IAAlB2F,KAAK0b,SAIP,OAHA1b,KAAK0b,SAAW,EAChB1b,KAAK8f,MAAMzlB,GACX2F,KAAK0b,SAAW,EACT1b,KAKT,GAFAA,KAAK2b,MAAM,IAAMthB,EAEG,IAAhB2F,KAAK3G,QAAgB2G,KAAK2b,MAAM,GAAK,EACvC3b,KAAK2b,MAAM,IAAM3b,KAAK2b,MAAM,GAC5B3b,KAAK0b,SAAW,OAGhB,IAAK,IAAIhjB,EAAI,EAAGA,EAAIsH,KAAK3G,QAAU2G,KAAK2b,MAAMjjB,GAAK,EAAGA,IACpDsH,KAAK2b,MAAMjjB,IAAM,SACjBsH,KAAK2b,MAAMjjB,EAAI,IAAM,EAIzB,OAAOsH,KAAKkd,UAGd7B,EAAGpe,UAAUwrB,KAAO,SAAepuB,GACjC,OAAO2F,KAAK0d,QAAQoC,MAAMzlB,IAG5BghB,EAAGpe,UAAUyrB,KAAO,SAAeruB,GACjC,OAAO2F,KAAK0d,QAAQ8K,MAAMnuB,IAG5BghB,EAAGpe,UAAU0rB,KAAO,WAGlB,OAFA3oB,KAAK0b,SAAW,EAET1b,MAGTqb,EAAGpe,UAAUrB,IAAM,WACjB,OAAOoE,KAAK0d,QAAQiL,QAGtBtN,EAAGpe,UAAU2rB,aAAe,SAAuBvuB,EAAKgN,EAAK6L,GAC3D,IACIxa,EAIAskB,EALAjkB,EAAMsB,EAAIhB,OAAS6Z,EAGvBlT,KAAK2d,QAAQ5kB,GAGb,IAAIolB,EAAQ,EACZ,IAAKzlB,EAAI,EAAGA,EAAI2B,EAAIhB,OAAQX,IAAK,CAC/BskB,GAA6B,EAAxBhd,KAAK2b,MAAMjjB,EAAIwa,IAAciL,EAClC,IAAI3B,GAAwB,EAAfniB,EAAIshB,MAAMjjB,IAAU2O,EAEjC8W,IADAnB,GAAa,SAARR,IACS,KAAQA,EAAQ,SAAa,GAC3Cxc,KAAK2b,MAAMjjB,EAAIwa,GAAa,SAAJ8J,CACzB,CACD,KAAOtkB,EAAIsH,KAAK3G,OAAS6Z,EAAOxa,IAE9BylB,GADAnB,GAA6B,EAAxBhd,KAAK2b,MAAMjjB,EAAIwa,IAAciL,IACrB,GACbne,KAAK2b,MAAMjjB,EAAIwa,GAAa,SAAJ8J,EAG1B,GAAc,IAAVmB,EAAa,OAAOne,KAAKkd,SAK7B,IAFAnC,GAAkB,IAAXoD,GACPA,EAAQ,EACHzlB,EAAI,EAAGA,EAAIsH,KAAK3G,OAAQX,IAE3BylB,GADAnB,IAAsB,EAAhBhd,KAAK2b,MAAMjjB,IAAUylB,IACd,GACbne,KAAK2b,MAAMjjB,GAAS,SAAJskB,EAIlB,OAFAhd,KAAK0b,SAAW,EAET1b,KAAKkd,UAGd7B,EAAGpe,UAAU4rB,SAAW,SAAmBxuB,EAAKyuB,GAC9C,IAAI5V,GAAQlT,KAAK3G,OAASgB,EAAIhB,QAE1BmL,EAAIxE,KAAK0d,QACThf,EAAIrE,EAGJ0uB,EAA8B,EAAxBrqB,EAAEid,MAAMjd,EAAErF,OAAS,GAGf,IADd6Z,EAAQ,GADMlT,KAAKuf,WAAWwJ,MAG5BrqB,EAAIA,EAAEypB,MAAMjV,GACZ1O,EAAE+iB,OAAOrU,GACT6V,EAA8B,EAAxBrqB,EAAEid,MAAMjd,EAAErF,OAAS,IAI3B,IACIiuB,EADAxsB,EAAI0J,EAAEnL,OAASqF,EAAErF,OAGrB,GAAa,QAATyvB,EAAgB,EAClBxB,EAAI,IAAIjM,EAAG,OACThiB,OAASyB,EAAI,EACfwsB,EAAE3L,MAAQ,IAAI5hB,MAAMutB,EAAEjuB,QACtB,IAAK,IAAIX,EAAI,EAAGA,EAAI4uB,EAAEjuB,OAAQX,IAC5B4uB,EAAE3L,MAAMjjB,GAAK,CAEhB,CAED,IAAIswB,EAAOxkB,EAAEkZ,QAAQkL,aAAalqB,EAAG,EAAG5D,GAClB,IAAlBkuB,EAAKtN,WACPlX,EAAIwkB,EACA1B,IACFA,EAAE3L,MAAM7gB,GAAK,IAIjB,IAAK,IAAIyG,EAAIzG,EAAI,EAAGyG,GAAK,EAAGA,IAAK,CAC/B,IAAI0nB,EAAmC,UAAL,EAAxBzkB,EAAEmX,MAAMjd,EAAErF,OAASkI,KACE,EAA5BiD,EAAEmX,MAAMjd,EAAErF,OAASkI,EAAI,IAO1B,IAHA0nB,EAAK1tB,KAAKoH,IAAKsmB,EAAKF,EAAO,EAAG,UAE9BvkB,EAAEokB,aAAalqB,EAAGuqB,EAAI1nB,GACA,IAAfiD,EAAEkX,UACPuN,IACAzkB,EAAEkX,SAAW,EACblX,EAAEokB,aAAalqB,EAAG,EAAG6C,GAChBiD,EAAEma,WACLna,EAAEkX,UAAY,GAGd4L,IACFA,EAAE3L,MAAMpa,GAAK0nB,EAEhB,CAWD,OAVI3B,GACFA,EAAEpK,SAEJ1Y,EAAE0Y,SAGW,QAAT4L,GAA4B,IAAV5V,GACpB1O,EAAEmjB,OAAOzU,GAGJ,CACLgW,IAAK5B,GAAK,KACVhK,IAAK9Y,IAQT6W,EAAGpe,UAAUksB,OAAS,SAAiB9uB,EAAKyuB,EAAMM,GAGhD,OAFArO,GAAQ1gB,EAAIskB,UAER3e,KAAK2e,SACA,CACLuK,IAAK,IAAI7N,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlBrb,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,UAC7B9Y,EAAM5C,KAAKogB,MAAM+I,OAAO9uB,EAAKyuB,GAEhB,QAATA,IACFI,EAAMtmB,EAAIsmB,IAAI9I,OAGH,QAAT0I,IACFxL,EAAM1a,EAAI0a,IAAI8C,MACVgJ,GAA6B,IAAjB9L,EAAI5B,UAClB4B,EAAIgE,KAAKjnB,IAIN,CACL6uB,IAAKA,EACL5L,IAAKA,IAIa,IAAlBtd,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,UAC7B9Y,EAAM5C,KAAKmpB,OAAO9uB,EAAI+lB,MAAO0I,GAEhB,QAATA,IACFI,EAAMtmB,EAAIsmB,IAAI9I,OAGT,CACL8I,IAAKA,EACL5L,IAAK1a,EAAI0a,MAI0B,IAAlCtd,KAAK0b,SAAWrhB,EAAIqhB,WACvB9Y,EAAM5C,KAAKogB,MAAM+I,OAAO9uB,EAAI+lB,MAAO0I,GAEtB,QAATA,IACFxL,EAAM1a,EAAI0a,IAAI8C,MACVgJ,GAA6B,IAAjB9L,EAAI5B,UAClB4B,EAAIiE,KAAKlnB,IAIN,CACL6uB,IAAKtmB,EAAIsmB,IACT5L,IAAKA,IAOLjjB,EAAIhB,OAAS2G,KAAK3G,QAAU2G,KAAKyc,IAAIpiB,GAAO,EACvC,CACL6uB,IAAK,IAAI7N,EAAG,GACZiC,IAAKtd,MAKU,IAAf3F,EAAIhB,OACO,QAATyvB,EACK,CACLI,IAAKlpB,KAAKqpB,KAAKhvB,EAAIshB,MAAM,IACzB2B,IAAK,MAII,QAATwL,EACK,CACLI,IAAK,KACL5L,IAAK,IAAIjC,EAAGrb,KAAK4e,MAAMvkB,EAAIshB,MAAM,MAI9B,CACLuN,IAAKlpB,KAAKqpB,KAAKhvB,EAAIshB,MAAM,IACzB2B,IAAK,IAAIjC,EAAGrb,KAAK4e,MAAMvkB,EAAIshB,MAAM,MAI9B3b,KAAK6oB,SAASxuB,EAAKyuB,GAlF1B,IAAII,EAAK5L,EAAK1a,GAsFhByY,EAAGpe,UAAUisB,IAAM,SAAc7uB,GAC/B,OAAO2F,KAAKmpB,OAAO9uB,EAAK,OAAO,GAAO6uB,KAIxC7N,EAAGpe,UAAUqgB,IAAM,SAAcjjB,GAC/B,OAAO2F,KAAKmpB,OAAO9uB,EAAK,OAAO,GAAOijB,KAGxCjC,EAAGpe,UAAUqsB,KAAO,SAAejvB,GACjC,OAAO2F,KAAKmpB,OAAO9uB,EAAK,OAAO,GAAMijB,KAIvCjC,EAAGpe,UAAUssB,SAAW,SAAmBlvB,GACzC,IAAImvB,EAAKxpB,KAAKmpB,OAAO9uB,GAGrB,GAAImvB,EAAGlM,IAAIqB,SAAU,OAAO6K,EAAGN,IAE/B,IAAI5L,EAA0B,IAApBkM,EAAGN,IAAIxN,SAAiB8N,EAAGlM,IAAIiE,KAAKlnB,GAAOmvB,EAAGlM,IAEpDmM,EAAOpvB,EAAIguB,MAAM,GACjBqB,EAAKrvB,EAAIsvB,MAAM,GACflN,EAAMa,EAAIb,IAAIgN,GAGlB,OAAIhN,EAAM,GAAa,IAAPiN,GAAoB,IAARjN,EAAmB+M,EAAGN,IAGvB,IAApBM,EAAGN,IAAIxN,SAAiB8N,EAAGN,IAAIV,MAAM,GAAKgB,EAAGN,IAAIpJ,MAAM,IAGhEzE,EAAGpe,UAAU2hB,MAAQ,SAAgBvkB,GACnC,IAAI4sB,EAAW5sB,EAAM,EACjB4sB,IAAU5sB,GAAOA,GAErB0gB,EAAO1gB,GAAO,UAId,IAHA,IAAIuvB,GAAK,GAAK,IAAMvvB,EAEhBqY,EAAM,EACDha,EAAIsH,KAAK3G,OAAS,EAAGX,GAAK,EAAGA,IACpCga,GAAOkX,EAAIlX,GAAuB,EAAhB1S,KAAK2b,MAAMjjB,KAAW2B,EAG1C,OAAO4sB,GAAYvU,EAAMA,GAI3B2I,EAAGpe,UAAU4sB,KAAO,SAAexvB,GACjC,OAAO2F,KAAK4e,MAAMvkB,IAIpBghB,EAAGpe,UAAU4hB,MAAQ,SAAgBxkB,GACnC,IAAI4sB,EAAW5sB,EAAM,EACjB4sB,IAAU5sB,GAAOA,GAErB0gB,EAAO1gB,GAAO,UAGd,IADA,IAAI8jB,EAAQ,EACHzlB,EAAIsH,KAAK3G,OAAS,EAAGX,GAAK,EAAGA,IAAK,CACzC,IAAIskB,GAAqB,EAAhBhd,KAAK2b,MAAMjjB,IAAkB,SAARylB,EAC9Bne,KAAK2b,MAAMjjB,GAAMskB,EAAI3iB,EAAO,EAC5B8jB,EAAQnB,EAAI3iB,CACb,CAGD,OADA2F,KAAKkd,SACE+J,EAAWjnB,KAAKkgB,OAASlgB,MAGlCqb,EAAGpe,UAAUosB,KAAO,SAAehvB,GACjC,OAAO2F,KAAK0d,QAAQmB,MAAMxkB,IAG5BghB,EAAGpe,UAAU6sB,KAAO,SAAeF,GACjC7O,EAAsB,IAAf6O,EAAElO,UACTX,GAAQ6O,EAAEjL,UAEV,IAAIla,EAAIzE,KACJ0E,EAAIklB,EAAElM,QAGRjZ,EADiB,IAAfA,EAAEiX,SACAjX,EAAE6kB,KAAKM,GAEPnlB,EAAEiZ,QAaR,IATA,IAAIqM,EAAI,IAAI1O,EAAG,GACX2O,EAAI,IAAI3O,EAAG,GAGX4O,EAAI,IAAI5O,EAAG,GACX6O,EAAI,IAAI7O,EAAG,GAEX8O,EAAI,EAED1lB,EAAE2lB,UAAY1lB,EAAE0lB,UACrB3lB,EAAEkjB,OAAO,GACTjjB,EAAEijB,OAAO,KACPwC,EAMJ,IAHA,IAAIE,EAAK3lB,EAAEgZ,QACP4M,EAAK7lB,EAAEiZ,SAEHjZ,EAAEka,UAAU,CAClB,IAAK,IAAIjmB,EAAI,EAAG6xB,EAAK,EAAyB,IAArB9lB,EAAEkX,MAAM,GAAK4O,IAAa7xB,EAAI,KAAMA,EAAG6xB,IAAO,GACvE,GAAI7xB,EAAI,EAEN,IADA+L,EAAEkjB,OAAOjvB,GACFA,KAAM,IACPqxB,EAAES,SAAWR,EAAEQ,WACjBT,EAAEzI,KAAK+I,GACPL,EAAEzI,KAAK+I,IAGTP,EAAEpC,OAAO,GACTqC,EAAErC,OAAO,GAIb,IAAK,IAAIpmB,EAAI,EAAGkpB,EAAK,EAAyB,IAArB/lB,EAAEiX,MAAM,GAAK8O,IAAalpB,EAAI,KAAMA,EAAGkpB,IAAO,GACvE,GAAIlpB,EAAI,EAEN,IADAmD,EAAEijB,OAAOpmB,GACFA,KAAM,IACP0oB,EAAEO,SAAWN,EAAEM,WACjBP,EAAE3I,KAAK+I,GACPH,EAAE3I,KAAK+I,IAGTL,EAAEtC,OAAO,GACTuC,EAAEvC,OAAO,GAITljB,EAAEgY,IAAI/X,IAAM,GACdD,EAAE8c,KAAK7c,GACPqlB,EAAExI,KAAK0I,GACPD,EAAEzI,KAAK2I,KAEPxlB,EAAE6c,KAAK9c,GACPwlB,EAAE1I,KAAKwI,GACPG,EAAE3I,KAAKyI,GAEV,CAED,MAAO,CACLxlB,EAAGylB,EACHvrB,EAAGwrB,EACHQ,IAAKhmB,EAAE6iB,OAAO4C,KAOlB9O,EAAGpe,UAAU0tB,OAAS,SAAiBf,GACrC7O,EAAsB,IAAf6O,EAAElO,UACTX,GAAQ6O,EAAEjL,UAEV,IAAIna,EAAIxE,KACJtB,EAAIkrB,EAAElM,QAGRlZ,EADiB,IAAfA,EAAEkX,SACAlX,EAAE8kB,KAAKM,GAEPplB,EAAEkZ,QAQR,IALA,IAuCI9a,EAvCAgoB,EAAK,IAAIvP,EAAG,GACZwP,EAAK,IAAIxP,EAAG,GAEZyP,EAAQpsB,EAAEgf,QAEPlZ,EAAEumB,KAAK,GAAK,GAAKrsB,EAAEqsB,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIryB,EAAI,EAAG6xB,EAAK,EAAyB,IAArB/lB,EAAEmX,MAAM,GAAK4O,IAAa7xB,EAAI,KAAMA,EAAG6xB,IAAO,GACvE,GAAI7xB,EAAI,EAEN,IADA8L,EAAEmjB,OAAOjvB,GACFA,KAAM,GACPkyB,EAAGJ,SACLI,EAAGtJ,KAAKwJ,GAGVF,EAAGjD,OAAO,GAId,IAAK,IAAIpmB,EAAI,EAAGkpB,EAAK,EAAyB,IAArB/rB,EAAEid,MAAM,GAAK8O,IAAalpB,EAAI,KAAMA,EAAGkpB,IAAO,GACvE,GAAIlpB,EAAI,EAEN,IADA7C,EAAEipB,OAAOpmB,GACFA,KAAM,GACPspB,EAAGL,SACLK,EAAGvJ,KAAKwJ,GAGVD,EAAGlD,OAAO,GAIVnjB,EAAEiY,IAAI/d,IAAM,GACd8F,EAAE+c,KAAK7iB,GACPksB,EAAGrJ,KAAKsJ,KAERnsB,EAAE6iB,KAAK/c,GACPqmB,EAAGtJ,KAAKqJ,GAEX,CAaD,OATEhoB,EADgB,IAAd4B,EAAEumB,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBnoB,EAAI0e,KAAKsI,GAGJhnB,GAGTyY,EAAGpe,UAAUytB,IAAM,SAAcrwB,GAC/B,GAAI2F,KAAK2e,SAAU,OAAOtkB,EAAIuB,MAC9B,GAAIvB,EAAIskB,SAAU,OAAO3e,KAAKpE,MAE9B,IAAI4I,EAAIxE,KAAK0d,QACThf,EAAIrE,EAAIqjB,QACZlZ,EAAEkX,SAAW,EACbhd,EAAEgd,SAAW,EAGb,IAAK,IAAIxI,EAAQ,EAAG1O,EAAE4lB,UAAY1rB,EAAE0rB,SAAUlX,IAC5C1O,EAAEmjB,OAAO,GACTjpB,EAAEipB,OAAO,GAGX,OAAG,CACD,KAAOnjB,EAAE4lB,UACP5lB,EAAEmjB,OAAO,GAEX,KAAOjpB,EAAE0rB,UACP1rB,EAAEipB,OAAO,GAGX,IAAIvL,EAAI5X,EAAEiY,IAAI/d,GACd,GAAI0d,EAAI,EAAG,CAET,IAAIoD,EAAIhb,EACRA,EAAI9F,EACJA,EAAI8gB,CACZ,MAAa,GAAU,IAANpD,GAAyB,IAAd1d,EAAEqsB,KAAK,GAC3B,MAGFvmB,EAAE+c,KAAK7iB,EACR,CAED,OAAOA,EAAE6oB,OAAOrU,IAIlBmI,EAAGpe,UAAU+tB,KAAO,SAAe3wB,GACjC,OAAO2F,KAAK8pB,KAAKzvB,GAAKmK,EAAE8kB,KAAKjvB,IAG/BghB,EAAGpe,UAAUmtB,OAAS,WACpB,OAA+B,IAAP,EAAhBpqB,KAAK2b,MAAM,KAGrBN,EAAGpe,UAAUutB,MAAQ,WACnB,OAA+B,IAAP,EAAhBxqB,KAAK2b,MAAM,KAIrBN,EAAGpe,UAAU0sB,MAAQ,SAAgBtvB,GACnC,OAAO2F,KAAK2b,MAAM,GAAKthB,GAIzBghB,EAAGpe,UAAUguB,MAAQ,SAAgB7J,GACnCrG,EAAsB,iBAARqG,GACd,IAAIhF,EAAIgF,EAAM,GACVhmB,GAAKgmB,EAAMhF,GAAK,GAChBkL,EAAI,GAAKlL,EAGb,GAAIpc,KAAK3G,QAAU+B,EAGjB,OAFA4E,KAAK2d,QAAQviB,EAAI,GACjB4E,KAAK2b,MAAMvgB,IAAMksB,EACVtnB,KAKT,IADA,IAAIme,EAAQmJ,EACH5uB,EAAI0C,EAAa,IAAV+iB,GAAezlB,EAAIsH,KAAK3G,OAAQX,IAAK,CACnD,IAAIskB,EAAoB,EAAhBhd,KAAK2b,MAAMjjB,GAEnBylB,GADAnB,GAAKmB,KACS,GACdnB,GAAK,SACLhd,KAAK2b,MAAMjjB,GAAKskB,CACjB,CAKD,OAJc,IAAVmB,IACFne,KAAK2b,MAAMjjB,GAAKylB,EAChBne,KAAK3G,UAEA2G,MAGTqb,EAAGpe,UAAU0hB,OAAS,WACpB,OAAuB,IAAhB3e,KAAK3G,QAAkC,IAAlB2G,KAAK2b,MAAM,IAGzCN,EAAGpe,UAAU8tB,KAAO,SAAe1wB,GACjC,IAOIuI,EAPA8Y,EAAWrhB,EAAM,EAErB,GAAsB,IAAlB2F,KAAK0b,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlB1b,KAAK0b,UAAkBA,EAAU,OAAO,EAK5C,GAHA1b,KAAKkd,SAGDld,KAAK3G,OAAS,EAChBuJ,EAAM,MACD,CACD8Y,IACFrhB,GAAOA,GAGT0gB,EAAO1gB,GAAO,SAAW,qBAEzB,IAAI2iB,EAAoB,EAAhBhd,KAAK2b,MAAM,GACnB/Y,EAAMoa,IAAM3iB,EAAM,EAAI2iB,EAAI3iB,GAAO,EAAI,CACtC,CACD,OAAsB,IAAlB2F,KAAK0b,SAA8B,GAAN9Y,EAC1BA,GAOTyY,EAAGpe,UAAUwf,IAAM,SAAcpiB,GAC/B,GAAsB,IAAlB2F,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,SAAgB,OAAQ,EACvD,GAAsB,IAAlB1b,KAAK0b,UAAmC,IAAjBrhB,EAAIqhB,SAAgB,OAAO,EAEtD,IAAI9Y,EAAM5C,KAAKkrB,KAAK7wB,GACpB,OAAsB,IAAlB2F,KAAK0b,SAA8B,GAAN9Y,EAC1BA,GAITyY,EAAGpe,UAAUiuB,KAAO,SAAe7wB,GAEjC,GAAI2F,KAAK3G,OAASgB,EAAIhB,OAAQ,OAAO,EACrC,GAAI2G,KAAK3G,OAASgB,EAAIhB,OAAQ,OAAQ,EAGtC,IADA,IAAIuJ,EAAM,EACDlK,EAAIsH,KAAK3G,OAAS,EAAGX,GAAK,EAAGA,IAAK,CACzC,IAAI8L,EAAoB,EAAhBxE,KAAK2b,MAAMjjB,GACfgG,EAAmB,EAAfrE,EAAIshB,MAAMjjB,GAElB,GAAI8L,IAAM9F,EAAV,CACI8F,EAAI9F,EACNkE,GAAO,EACE4B,EAAI9F,IACbkE,EAAM,GAER,KANa,CAOd,CACD,OAAOA,GAGTyY,EAAGpe,UAAUkuB,IAAM,SAAc9wB,GAC/B,OAA0B,IAAnB2F,KAAK+qB,KAAK1wB,IAGnBghB,EAAGpe,UAAUmuB,GAAK,SAAa/wB,GAC7B,OAAyB,IAAlB2F,KAAKyc,IAAIpiB,IAGlBghB,EAAGpe,UAAUouB,KAAO,SAAehxB,GACjC,OAAO2F,KAAK+qB,KAAK1wB,IAAQ,GAG3BghB,EAAGpe,UAAUquB,IAAM,SAAcjxB,GAC/B,OAAO2F,KAAKyc,IAAIpiB,IAAQ,GAG1BghB,EAAGpe,UAAUsuB,IAAM,SAAclxB,GAC/B,OAA2B,IAApB2F,KAAK+qB,KAAK1wB,IAGnBghB,EAAGpe,UAAUuuB,GAAK,SAAanxB,GAC7B,OAA0B,IAAnB2F,KAAKyc,IAAIpiB,IAGlBghB,EAAGpe,UAAUwuB,KAAO,SAAepxB,GACjC,OAAO2F,KAAK+qB,KAAK1wB,IAAQ,GAG3BghB,EAAGpe,UAAUyuB,IAAM,SAAcrxB,GAC/B,OAAO2F,KAAKyc,IAAIpiB,IAAQ,GAG1BghB,EAAGpe,UAAU0uB,IAAM,SAActxB,GAC/B,OAA0B,IAAnB2F,KAAK+qB,KAAK1wB,IAGnBghB,EAAGpe,UAAU2uB,GAAK,SAAavxB,GAC7B,OAAyB,IAAlB2F,KAAKyc,IAAIpiB,IAOlBghB,EAAGO,IAAM,SAAcvhB,GACrB,OAAO,IAAIwxB,EAAIxxB,IAGjBghB,EAAGpe,UAAU6uB,MAAQ,SAAgBC,GAGnC,OAFAhR,GAAQ/a,KAAK4b,IAAK,yCAClBb,EAAyB,IAAlB/a,KAAK0b,SAAgB,iCACrBqQ,EAAIC,UAAUhsB,MAAMisB,UAAUF,IAGvC1Q,EAAGpe,UAAUivB,QAAU,WAErB,OADAnR,EAAO/a,KAAK4b,IAAK,wDACV5b,KAAK4b,IAAIuQ,YAAYnsB,OAG9Bqb,EAAGpe,UAAUgvB,UAAY,SAAoBF,GAE3C,OADA/rB,KAAK4b,IAAMmQ,EACJ/rB,MAGTqb,EAAGpe,UAAUmvB,SAAW,SAAmBL,GAEzC,OADAhR,GAAQ/a,KAAK4b,IAAK,yCACX5b,KAAKisB,UAAUF,IAGxB1Q,EAAGpe,UAAUovB,OAAS,SAAiBhyB,GAErC,OADA0gB,EAAO/a,KAAK4b,IAAK,sCACV5b,KAAK4b,IAAI4F,IAAIxhB,KAAM3F,IAG5BghB,EAAGpe,UAAUqvB,QAAU,SAAkBjyB,GAEvC,OADA0gB,EAAO/a,KAAK4b,IAAK,uCACV5b,KAAK4b,IAAI0F,KAAKthB,KAAM3F,IAG7BghB,EAAGpe,UAAUsvB,OAAS,SAAiBlyB,GAErC,OADA0gB,EAAO/a,KAAK4b,IAAK,sCACV5b,KAAK4b,IAAIrR,IAAIvK,KAAM3F,IAG5BghB,EAAGpe,UAAUuvB,QAAU,SAAkBnyB,GAEvC,OADA0gB,EAAO/a,KAAK4b,IAAK,uCACV5b,KAAK4b,IAAI2F,KAAKvhB,KAAM3F,IAG7BghB,EAAGpe,UAAUwvB,OAAS,SAAiBpyB,GAErC,OADA0gB,EAAO/a,KAAK4b,IAAK,sCACV5b,KAAK4b,IAAI8Q,IAAI1sB,KAAM3F,IAG5BghB,EAAGpe,UAAU0vB,OAAS,SAAiBtyB,GAGrC,OAFA0gB,EAAO/a,KAAK4b,IAAK,sCACjB5b,KAAK4b,IAAIgR,SAAS5sB,KAAM3F,GACjB2F,KAAK4b,IAAIvU,IAAIrH,KAAM3F,IAG5BghB,EAAGpe,UAAU4vB,QAAU,SAAkBxyB,GAGvC,OAFA0gB,EAAO/a,KAAK4b,IAAK,sCACjB5b,KAAK4b,IAAIgR,SAAS5sB,KAAM3F,GACjB2F,KAAK4b,IAAI6J,KAAKzlB,KAAM3F,IAG7BghB,EAAGpe,UAAU6vB,OAAS,WAGpB,OAFA/R,EAAO/a,KAAK4b,IAAK,sCACjB5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIuL,IAAInnB,OAGtBqb,EAAGpe,UAAU+vB,QAAU,WAGrB,OAFAjS,EAAO/a,KAAK4b,IAAK,uCACjB5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIwL,KAAKpnB,OAIvBqb,EAAGpe,UAAUgwB,QAAU,WAGrB,OAFAlS,EAAO/a,KAAK4b,IAAK,uCACjB5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIsR,KAAKltB,OAGvBqb,EAAGpe,UAAUkwB,QAAU,WAGrB,OAFApS,EAAO/a,KAAK4b,IAAK,uCACjB5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIoP,KAAKhrB,OAIvBqb,EAAGpe,UAAUmwB,OAAS,WAGpB,OAFArS,EAAO/a,KAAK4b,IAAK,sCACjB5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIwE,IAAIpgB,OAGtBqb,EAAGpe,UAAUowB,OAAS,SAAiBhzB,GAGrC,OAFA0gB,EAAO/a,KAAK4b,MAAQvhB,EAAIuhB,IAAK,qBAC7B5b,KAAK4b,IAAImR,SAAS/sB,MACXA,KAAK4b,IAAIpgB,IAAIwE,KAAM3F,IAI5B,IAAIizB,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ5hB,EAAM6d,GAErB5pB,KAAK+L,KAAOA,EACZ/L,KAAK4pB,EAAI,IAAIvO,EAAGuO,EAAG,IACnB5pB,KAAKQ,EAAIR,KAAK4pB,EAAElK,YAChB1f,KAAKoe,EAAI,IAAI/C,EAAG,GAAGkM,OAAOvnB,KAAKQ,GAAG+gB,KAAKvhB,KAAK4pB,GAE5C5pB,KAAKvH,IAAMuH,KAAK4tB,MACjB,CAgDD,SAASC,IACPF,EAAO9sB,KACLb,KACA,OACA,0EACH,CA8DD,SAAS8tB,IACPH,EAAO9sB,KACLb,KACA,OACA,iEACH,CAGD,SAAS+tB,IACPJ,EAAO9sB,KACLb,KACA,OACA,wDACH,CAGD,SAASguB,IAEPL,EAAO9sB,KACLb,KACA,QACA,sEACH,CA6CD,SAAS6rB,EAAK/wB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAImzB,EAAQ5S,EAAG6S,OAAOpzB,GACtBkF,KAAKlF,EAAImzB,EAAMrE,EACf5pB,KAAKiuB,MAAQA,CACnB,MACMlT,EAAOjgB,EAAEqwB,IAAI,GAAI,kCACjBnrB,KAAKlF,EAAIA,EACTkF,KAAKiuB,MAAQ,IAEhB,CAkOD,SAASE,EAAMrzB,GACb+wB,EAAIhrB,KAAKb,KAAMlF,GAEfkF,KAAKkT,MAAQlT,KAAKlF,EAAE4kB,YAChB1f,KAAKkT,MAAQ,IAAO,IACtBlT,KAAKkT,OAAS,GAAMlT,KAAKkT,MAAQ,IAGnClT,KAAKoc,EAAI,IAAIf,EAAG,GAAGkM,OAAOvnB,KAAKkT,OAC/BlT,KAAK0pB,GAAK1pB,KAAKouB,KAAKpuB,KAAKoc,EAAE+K,OAC3BnnB,KAAKquB,KAAOruB,KAAKoc,EAAEuO,OAAO3qB,KAAKlF,GAE/BkF,KAAKsuB,KAAOtuB,KAAKquB,KAAKhnB,IAAIrH,KAAKoc,GAAGoM,MAAM,GAAGU,IAAIlpB,KAAKlF,GACpDkF,KAAKsuB,KAAOtuB,KAAKsuB,KAAKhF,KAAKtpB,KAAKoc,GAChCpc,KAAKsuB,KAAOtuB,KAAKoc,EAAE7R,IAAIvK,KAAKsuB,KAC7B,CA/aDX,EAAO1wB,UAAU2wB,KAAO,WACtB,IAAIn1B,EAAM,IAAI4iB,EAAG,MAEjB,OADA5iB,EAAIkjB,MAAQ,IAAI5hB,MAAMwB,KAAKwhB,KAAK/c,KAAKQ,EAAI,KAClC/H,GAGTk1B,EAAO1wB,UAAUsxB,QAAU,SAAkBl0B,GAG3C,IACIm0B,EADApS,EAAI/hB,EAGR,GACE2F,KAAK8M,MAAMsP,EAAGpc,KAAKvH,KAGnB+1B,GADApS,GADAA,EAAIpc,KAAKyuB,MAAMrS,IACTkF,KAAKthB,KAAKvH,MACPinB,kBACF8O,EAAOxuB,KAAKQ,GAErB,IAAIic,EAAM+R,EAAOxuB,KAAKQ,GAAK,EAAI4b,EAAE8O,KAAKlrB,KAAK4pB,GAgB3C,OAfY,IAARnN,GACFL,EAAET,MAAM,GAAK,EACbS,EAAE/iB,OAAS,GACFojB,EAAM,EACfL,EAAEmF,KAAKvhB,KAAK4pB,QAEI9qB,IAAZsd,EAAEsS,MAEJtS,EAAEsS,QAGFtS,EAAEc,SAICd,GAGTuR,EAAO1wB,UAAU6P,MAAQ,SAAgBN,EAAOtG,GAC9CsG,EAAMmb,OAAO3nB,KAAKQ,EAAG,EAAG0F,IAG1BynB,EAAO1wB,UAAUwxB,MAAQ,SAAgBp0B,GACvC,OAAOA,EAAIorB,KAAKzlB,KAAKoe,IASvBpD,EAAS6S,EAAMF,GAEfE,EAAK5wB,UAAU6P,MAAQ,SAAgBN,EAAOlS,GAK5C,IAHA,IAAIytB,EAAO,QAEP4G,EAASpzB,KAAKoH,IAAI6J,EAAMnT,OAAQ,GAC3BX,EAAI,EAAGA,EAAIi2B,EAAQj2B,IAC1B4B,EAAOqhB,MAAMjjB,GAAK8T,EAAMmP,MAAMjjB,GAIhC,GAFA4B,EAAOjB,OAASs1B,EAEZniB,EAAMnT,QAAU,EAGlB,OAFAmT,EAAMmP,MAAM,GAAK,OACjBnP,EAAMnT,OAAS,GAKjB,IAAIu1B,EAAOpiB,EAAMmP,MAAM,GAGvB,IAFArhB,EAAOqhB,MAAMrhB,EAAOjB,UAAYu1B,EAAO7G,EAElCrvB,EAAI,GAAIA,EAAI8T,EAAMnT,OAAQX,IAAK,CAClC,IAAIm2B,EAAwB,EAAjBriB,EAAMmP,MAAMjjB,GACvB8T,EAAMmP,MAAMjjB,EAAI,KAAQm2B,EAAO9G,IAAS,EAAM6G,IAAS,GACvDA,EAAOC,CACR,CACDD,KAAU,GACVpiB,EAAMmP,MAAMjjB,EAAI,IAAMk2B,EACT,IAATA,GAAcpiB,EAAMnT,OAAS,GAC/BmT,EAAMnT,QAAU,GAEhBmT,EAAMnT,QAAU,GAIpBw0B,EAAK5wB,UAAUwxB,MAAQ,SAAgBp0B,GAErCA,EAAIshB,MAAMthB,EAAIhB,QAAU,EACxBgB,EAAIshB,MAAMthB,EAAIhB,OAAS,GAAK,EAC5BgB,EAAIhB,QAAU,EAId,IADA,IAAIoJ,EAAK,EACA/J,EAAI,EAAGA,EAAI2B,EAAIhB,OAAQX,IAAK,CACnC,IAAIskB,EAAmB,EAAf3iB,EAAIshB,MAAMjjB,GAClB+J,GAAU,IAAJua,EACN3iB,EAAIshB,MAAMjjB,GAAU,SAAL+J,EACfA,EAAS,GAAJua,GAAava,EAAK,SAAa,EACrC,CASD,OANkC,IAA9BpI,EAAIshB,MAAMthB,EAAIhB,OAAS,KACzBgB,EAAIhB,SAC8B,IAA9BgB,EAAIshB,MAAMthB,EAAIhB,OAAS,IACzBgB,EAAIhB,UAGDgB,GAST2gB,EAAS8S,EAAMH,GAQf3S,EAAS+S,EAAMJ,GASf3S,EAASgT,EAAQL,GAEjBK,EAAO/wB,UAAUwxB,MAAQ,SAAgBp0B,GAGvC,IADA,IAAI8jB,EAAQ,EACHzlB,EAAI,EAAGA,EAAI2B,EAAIhB,OAAQX,IAAK,CACnC,IAAI8J,EAA0B,IAAL,EAAfnI,EAAIshB,MAAMjjB,IAAiBylB,EACjC1b,EAAU,SAALD,EACTA,KAAQ,GAERnI,EAAIshB,MAAMjjB,GAAK+J,EACf0b,EAAQ3b,CACT,CAID,OAHc,IAAV2b,IACF9jB,EAAIshB,MAAMthB,EAAIhB,UAAY8kB,GAErB9jB,GAITghB,EAAG6S,OAAS,SAAgBniB,GAE1B,GAAIuhB,EAAOvhB,GAAO,OAAOuhB,EAAOvhB,GAEhC,IAAIkiB,EACJ,GAAa,SAATliB,EACFkiB,EAAQ,IAAIJ,OACP,GAAa,SAAT9hB,EACTkiB,EAAQ,IAAIH,OACP,GAAa,SAAT/hB,EACTkiB,EAAQ,IAAIF,MACP,IAAa,WAAThiB,EAGT,MAAM,IAAI9R,MAAM,iBAAmB8R,GAFnCkiB,EAAQ,IAAID,CAGb,CAGD,OAFAV,EAAOvhB,GAAQkiB,EAERA,GAkBTpC,EAAI5uB,UAAU8vB,SAAW,SAAmBvoB,GAC1CuW,EAAsB,IAAfvW,EAAEkX,SAAgB,iCACzBX,EAAOvW,EAAEoX,IAAK,oCAGhBiQ,EAAI5uB,UAAU2vB,SAAW,SAAmBpoB,EAAG9F,GAC7Cqc,EAAqC,IAA7BvW,EAAEkX,SAAWhd,EAAEgd,UAAiB,iCACxCX,EAAOvW,EAAEoX,KAAOpX,EAAEoX,MAAQld,EAAEkd,IAC1B,oCAGJiQ,EAAI5uB,UAAUmxB,KAAO,SAAe5pB,GAClC,OAAIxE,KAAKiuB,MAAcjuB,KAAKiuB,MAAMM,QAAQ/pB,GAAGynB,UAAUjsB,OAEvDsc,EAAK9X,EAAGA,EAAE8kB,KAAKtpB,KAAKlF,GAAGmxB,UAAUjsB,OAC1BwE,IAGTqnB,EAAI5uB,UAAUmjB,IAAM,SAAc5b,GAChC,OAAIA,EAAEma,SACGna,EAAEkZ,QAGJ1d,KAAKlF,EAAEyP,IAAI/F,GAAGynB,UAAUjsB,OAGjC6rB,EAAI5uB,UAAUukB,IAAM,SAAchd,EAAG9F,GACnCsB,KAAK4sB,SAASpoB,EAAG9F,GAEjB,IAAIkE,EAAM4B,EAAEgd,IAAI9iB,GAIhB,OAHIkE,EAAI6Z,IAAIzc,KAAKlF,IAAM,GACrB8H,EAAI2e,KAAKvhB,KAAKlF,GAET8H,EAAIqpB,UAAUjsB,OAGvB6rB,EAAI5uB,UAAUqkB,KAAO,SAAe9c,EAAG9F,GACrCsB,KAAK4sB,SAASpoB,EAAG9F,GAEjB,IAAIkE,EAAM4B,EAAE8c,KAAK5iB,GAIjB,OAHIkE,EAAI6Z,IAAIzc,KAAKlF,IAAM,GACrB8H,EAAI2e,KAAKvhB,KAAKlF,GAET8H,GAGTipB,EAAI5uB,UAAUsN,IAAM,SAAc/F,EAAG9F,GACnCsB,KAAK4sB,SAASpoB,EAAG9F,GAEjB,IAAIkE,EAAM4B,EAAE+F,IAAI7L,GAIhB,OAHIkE,EAAImoB,KAAK,GAAK,GAChBnoB,EAAI0e,KAAKthB,KAAKlF,GAET8H,EAAIqpB,UAAUjsB,OAGvB6rB,EAAI5uB,UAAUskB,KAAO,SAAe/c,EAAG9F,GACrCsB,KAAK4sB,SAASpoB,EAAG9F,GAEjB,IAAIkE,EAAM4B,EAAE+c,KAAK7iB,GAIjB,OAHIkE,EAAImoB,KAAK,GAAK,GAChBnoB,EAAI0e,KAAKthB,KAAKlF,GAET8H,GAGTipB,EAAI5uB,UAAUyvB,IAAM,SAAcloB,EAAGnK,GAEnC,OADA2F,KAAK+sB,SAASvoB,GACPxE,KAAKouB,KAAK5pB,EAAE2jB,MAAM9tB,KAG3BwxB,EAAI5uB,UAAUwoB,KAAO,SAAejhB,EAAG9F,GAErC,OADAsB,KAAK4sB,SAASpoB,EAAG9F,GACVsB,KAAKouB,KAAK5pB,EAAEihB,KAAK/mB,KAG1BmtB,EAAI5uB,UAAUoK,IAAM,SAAc7C,EAAG9F,GAEnC,OADAsB,KAAK4sB,SAASpoB,EAAG9F,GACVsB,KAAKouB,KAAK5pB,EAAE6C,IAAI3I,KAGzBmtB,EAAI5uB,UAAUmqB,KAAO,SAAe5iB,GAClC,OAAOxE,KAAKylB,KAAKjhB,EAAGA,EAAEkZ,UAGxBmO,EAAI5uB,UAAUkqB,IAAM,SAAc3iB,GAChC,OAAOxE,KAAKqH,IAAI7C,EAAGA,IAGrBqnB,EAAI5uB,UAAUiwB,KAAO,SAAe1oB,GAClC,GAAIA,EAAEma,SAAU,OAAOna,EAAEkZ,QAEzB,IAAIoR,EAAO9uB,KAAKlF,EAAE6uB,MAAM,GAIxB,GAHA5O,EAAO+T,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAItzB,EAAMwE,KAAKlF,EAAE0mB,IAAI,IAAInG,EAAG,IAAIsM,OAAO,GACvC,OAAO3nB,KAAKxE,IAAIgJ,EAAGhJ,EACpB,CAOD,IAFA,IAAI8rB,EAAItnB,KAAKlF,EAAE4tB,KAAK,GAChBttB,EAAI,GACAksB,EAAE3I,UAA2B,IAAf2I,EAAEqC,MAAM,IAC5BvuB,IACAksB,EAAEK,OAAO,GAEX5M,GAAQuM,EAAE3I,UAEV,IAAIoQ,EAAM,IAAI1T,EAAG,GAAGyQ,MAAM9rB,MACtBgvB,EAAOD,EAAI3B,SAIX6B,EAAOjvB,KAAKlF,EAAE4tB,KAAK,GAAGf,OAAO,GAC7BuH,EAAIlvB,KAAKlF,EAAE4kB,YAGf,IAFAwP,EAAI,IAAI7T,EAAG,EAAI6T,EAAIA,GAAGpD,MAAM9rB,MAEW,IAAhCA,KAAKxE,IAAI0zB,EAAGD,GAAMxS,IAAIuS,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAItzB,EAAIsE,KAAKxE,IAAI0zB,EAAG5H,GAChBlL,EAAIpc,KAAKxE,IAAIgJ,EAAG8iB,EAAEmB,KAAK,GAAGd,OAAO,IACjCnI,EAAIxf,KAAKxE,IAAIgJ,EAAG8iB,GAChBxsB,EAAIM,EACc,IAAfokB,EAAE/C,IAAIsS,IAAY,CAEvB,IADA,IAAIt2B,EAAM+mB,EACD9mB,EAAI,EAAoB,IAAjBD,EAAIgkB,IAAIsS,GAAYr2B,IAClCD,EAAMA,EAAIq0B,SAEZ/R,EAAOriB,EAAIoC,GACX,IAAI4D,EAAIsB,KAAKxE,IAAIE,EAAG,IAAI2f,EAAG,GAAGkM,OAAOzsB,EAAIpC,EAAI,IAE7C0jB,EAAIA,EAAEuQ,OAAOjuB,GACbhD,EAAIgD,EAAEouB,SACNtN,EAAIA,EAAEmN,OAAOjxB,GACbZ,EAAIpC,CACL,CAED,OAAO0jB,GAGTyP,EAAI5uB,UAAU+tB,KAAO,SAAexmB,GAClC,IAAI2qB,EAAM3qB,EAAEmmB,OAAO3qB,KAAKlF,GACxB,OAAqB,IAAjBq0B,EAAIzT,UACNyT,EAAIzT,SAAW,EACR1b,KAAKouB,KAAKe,GAAK/B,UAEfptB,KAAKouB,KAAKe,IAIrBtD,EAAI5uB,UAAUzB,IAAM,SAAcgJ,EAAGnK,GACnC,GAAIA,EAAIskB,SAAU,OAAO,IAAItD,EAAG,GAAGyQ,MAAM9rB,MACzC,GAAoB,IAAhB3F,EAAI0wB,KAAK,GAAU,OAAOvmB,EAAEkZ,QAEhC,IACI0R,EAAM,IAAIr1B,MAAM,IACpBq1B,EAAI,GAAK,IAAI/T,EAAG,GAAGyQ,MAAM9rB,MACzBovB,EAAI,GAAK5qB,EACT,IAAK,IAAI9L,EAAI,EAAGA,EAAI02B,EAAI/1B,OAAQX,IAC9B02B,EAAI12B,GAAKsH,KAAKqH,IAAI+nB,EAAI12B,EAAI,GAAI8L,GAGhC,IAAI5B,EAAMwsB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbn1B,EAAQE,EAAIqlB,YAAc,GAK9B,IAJc,IAAVvlB,IACFA,EAAQ,IAGLzB,EAAI2B,EAAIhB,OAAS,EAAGX,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAIqc,EAAO1a,EAAIshB,MAAMjjB,GACZ6I,EAAIpH,EAAQ,EAAGoH,GAAK,EAAGA,IAAK,CACnC,IAAI6f,EAAOrM,GAAQxT,EAAK,EACpBqB,IAAQwsB,EAAI,KACdxsB,EAAM5C,KAAKmnB,IAAIvkB,IAGL,IAARwe,GAAyB,IAAZiO,GAKjBA,IAAY,EACZA,GAAWjO,GA9BE,KA+BbkO,GACwC,IAAN52B,GAAiB,IAAN6I,KAE7CqB,EAAM5C,KAAKqH,IAAIzE,EAAKwsB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYhB,CACDn1B,EAAQ,EACT,CAED,OAAOyI,GAGTipB,EAAI5uB,UAAU+uB,UAAY,SAAoB3xB,GAC5C,IAAI+hB,EAAI/hB,EAAIivB,KAAKtpB,KAAKlF,GAEtB,OAAOshB,IAAM/hB,EAAM+hB,EAAEsB,QAAUtB,GAGjCyP,EAAI5uB,UAAUkvB,YAAc,SAAsB9xB,GAChD,IAAIuI,EAAMvI,EAAIqjB,QAEd,OADA9a,EAAIgZ,IAAM,KACHhZ,GAOTyY,EAAGkU,KAAO,SAAel1B,GACvB,OAAO,IAAI8zB,EAAK9zB,IAmBlB2gB,EAASmT,EAAMtC,GAEfsC,EAAKlxB,UAAU+uB,UAAY,SAAoB3xB,GAC7C,OAAO2F,KAAKouB,KAAK/zB,EAAI8tB,MAAMnoB,KAAKkT,SAGlCib,EAAKlxB,UAAUkvB,YAAc,SAAsB9xB,GACjD,IAAI+hB,EAAIpc,KAAKouB,KAAK/zB,EAAIgN,IAAIrH,KAAKquB,OAE/B,OADAjS,EAAER,IAAM,KACDQ,GAGT+R,EAAKlxB,UAAUwoB,KAAO,SAAejhB,EAAG9F,GACtC,GAAI8F,EAAEma,UAAYjgB,EAAEigB,SAGlB,OAFAna,EAAEmX,MAAM,GAAK,EACbnX,EAAEnL,OAAS,EACJmL,EAGT,IAAIgb,EAAIhb,EAAEihB,KAAK/mB,GACXhD,EAAI8jB,EAAE+I,MAAMvoB,KAAKkT,OAAO7L,IAAIrH,KAAKsuB,MAAMhG,OAAOtoB,KAAKkT,OAAO7L,IAAIrH,KAAKlF,GACnE00B,EAAIhQ,EAAE+B,KAAK7lB,GAAGisB,OAAO3nB,KAAKkT,OAC1BtQ,EAAM4sB,EAQV,OANIA,EAAE/S,IAAIzc,KAAKlF,IAAM,EACnB8H,EAAM4sB,EAAEjO,KAAKvhB,KAAKlF,GACT00B,EAAEzE,KAAK,GAAK,IACrBnoB,EAAM4sB,EAAElO,KAAKthB,KAAKlF,IAGb8H,EAAIqpB,UAAUjsB,OAGvBmuB,EAAKlxB,UAAUoK,IAAM,SAAc7C,EAAG9F,GACpC,GAAI8F,EAAEma,UAAYjgB,EAAEigB,SAAU,OAAO,IAAItD,EAAG,GAAG4Q,UAAUjsB,MAEzD,IAAIwf,EAAIhb,EAAE6C,IAAI3I,GACVhD,EAAI8jB,EAAE+I,MAAMvoB,KAAKkT,OAAO7L,IAAIrH,KAAKsuB,MAAMhG,OAAOtoB,KAAKkT,OAAO7L,IAAIrH,KAAKlF,GACnE00B,EAAIhQ,EAAE+B,KAAK7lB,GAAGisB,OAAO3nB,KAAKkT,OAC1BtQ,EAAM4sB,EAOV,OANIA,EAAE/S,IAAIzc,KAAKlF,IAAM,EACnB8H,EAAM4sB,EAAEjO,KAAKvhB,KAAKlF,GACT00B,EAAEzE,KAAK,GAAK,IACrBnoB,EAAM4sB,EAAElO,KAAKthB,KAAKlF,IAGb8H,EAAIqpB,UAAUjsB,OAGvBmuB,EAAKlxB,UAAU+tB,KAAO,SAAexmB,GAGnC,OADUxE,KAAKouB,KAAK5pB,EAAEmmB,OAAO3qB,KAAKlF,GAAGuM,IAAIrH,KAAK0pB,KACnCuC,UAAUjsB,MAExB,CA19GD,IA09G4CA,OC19GhCyvB,0BAAAA,QA4BXA,eAAA,GA5BWA,GAAAA,oBAAAA,QAAAA,UA4BX,CAAA,IA3BC,eAAA,iBACAA,GAAA,iBAAA,mBACAA,GAAA,wBAAA,0BACAA,GAAA,mBAAA,qBACAA,GAAA,YAAA,cACAA,GAAA,oBAAA,sBACAA,GAAA,YAAA,cACAA,GAAA,aAAA,eACAA,GAAA,kBAAA,oBACAA,GAAA,kBAAA,oBACAA,GAAA,kBAAA,oBACAA,GAAA,wBAAA,0BACAA,GAAA,eAAA,iBACAA,GAAA,kBAAA,oBACAA,GAAA,mBAAA,qBACAA,GAAA,iBAAA,mBACAA,GAAA,oBAAA,sBACAA,GAAA,mBAAA,qBACAA,GAAA,sBAAA,wBACAA,GAAA,cAAA,gBACAA,GAAA,aAAA,eACAA,GAAA,cAAA,gBACAA,GAAA,gBAAA,0BACAA,GAAA,qBAAA,uBACAA,GAAA,iCAAA,mCACAA,GAAA,kBAAA,oBACAA,GAAA,yBAAA,2BAGI,MAAOC,WAAiBz1B,MAG5B,WAAA0R,CAAY3M,EAAiBiN,GAC3BL,MAAMK,GACNjM,KAAK+L,KAAO,WACZ/L,KAAKhB,KAAOA,EAER/E,MAAM01B,mBACR11B,MAAM01B,kBAAkB3vB,KAAM0vB,GAEjC,ECrCG,MAAOE,WAAkBvU,GAI7B,QAAA5D,GACE,MAAMjT,EAAIoH,MAAMkR,UAAUrG,UACpB/X,EAAInC,EAAAA,OAAOe,KAAKkH,GACtB,GAAiB,IAAb9F,EAAErF,OACJ,OAAOqF,EAET,GAAIA,EAAErF,OAAS,EACb,MAAM,IAAIq2B,GAASD,kBAAUI,aAG/B,MAAMC,EAAUvzB,EAAAA,OAAOE,MAAM,GAE7B,OADAiC,EAAEP,KAAK2xB,GACAA,CACR,CAKD,iBAAOC,CAAWv1B,GAChB,GAAsB,IAAlBA,EAAOnB,OACT,MAAM,IAAIq2B,GACRD,QAAAA,UAAUO,oBACV,0BAA0Bx1B,EAAOnB,UAIrC,OAAO,IAAIgiB,GACT,IAAI7gB,GACDic,UACAwZ,KAAKv3B,GAAM,KAAKA,EAAE8G,SAAS,MAAM3B,OAAO,KACxChE,KAAK,IACR,GAEH,EAGG,MAAOq2B,WAAkB7U,GAI7B,QAAA5D,GACE,MAAMjT,EAAIoH,MAAMkR,UAAUrG,UACpB/X,EAAInC,EAAAA,OAAOe,KAAKkH,GACtB,GAAiB,IAAb9F,EAAErF,OACJ,OAAOqF,EAGT,GAAIA,EAAErF,OAAS,EACb,MAAM,IAAIq2B,GAASD,kBAAUU,aAG/B,MAAML,EAAUvzB,EAAAA,OAAOE,MAAM,GAE7B,OADAiC,EAAEP,KAAK2xB,GACAA,CACR,CAKD,iBAAOC,CAAWv1B,GAChB,GAAsB,IAAlBA,EAAOnB,OACT,MAAM,IAAIq2B,GACRD,QAAAA,UAAUU,YACV,0BAA0B31B,EAAOnB,UAGrC,OAAO,IAAIgiB,GACT,IAAI7gB,GACDic,UACAwZ,KAAKv3B,GAAM,KAAKA,EAAE8G,SAAS,MAAM3B,OAAO,KACxChE,KAAK,IACR,GAEH,2CC/EH,IAAIW,EAAS0B,EACTK,EAAS/B,EAAO+B,OAGpB,SAAS6zB,EAAWpjB,EAAKC,GACvB,IAAK,IAAIojB,KAAOrjB,EACdC,EAAIojB,GAAOrjB,EAAIqjB,EAEnB,CASA,SAASC,EAAYpzB,EAAKC,EAAkB9D,GAC1C,OAAOkD,EAAOW,EAAKC,EAAkB9D,EACvC,CAVIkD,EAAOe,MAAQf,EAAOE,OAASF,EAAOc,aAAed,EAAO8H,gBAC9DyW,UAAiBtgB,GAGjB41B,EAAU51B,EAAQ8B,GAClBA,SAAiBg0B,GAOnBA,EAAWrzB,UAAYF,OAAO4S,OAAOpT,EAAOU,WAG5CmzB,EAAU7zB,EAAQ+zB,GAElBA,EAAWhzB,KAAO,SAAUJ,EAAKC,EAAkB9D,GACjD,GAAmB,iBAAR6D,EACT,MAAM,IAAIE,UAAU,iCAEtB,OAAOb,EAAOW,EAAKC,EAAkB9D,IAGvCi3B,EAAW7zB,MAAQ,SAAU6C,EAAM8E,EAAM5G,GACvC,GAAoB,iBAAT8B,EACT,MAAM,IAAIlC,UAAU,6BAEtB,IAAIN,EAAMP,EAAO+C,GAUjB,YATaR,IAATsF,EACsB,iBAAb5G,EACTV,EAAIsH,KAAKA,EAAM5G,GAEfV,EAAIsH,KAAKA,GAGXtH,EAAIsH,KAAK,GAEJtH,GAGTwzB,EAAWjzB,YAAc,SAAUiC,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAIlC,UAAU,6BAEtB,OAAOb,EAAO+C,IAGhBgxB,EAAWjsB,gBAAkB,SAAU/E,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAIlC,UAAU,6BAEtB,OAAO5C,EAAOgC,WAAW8C,wBCxDvBixB,cAAiCh0B,OA+GrC,IAAAyQ,GA9GA,SAAewjB,GACb,GAAIA,EAASn3B,QAAU,IAAO,MAAM,IAAI+D,UAAU,qBAElD,IADA,IAAIqzB,EAAW,IAAI32B,WAAW,KACrByH,EAAI,EAAGA,EAAIkvB,EAASp3B,OAAQkI,IACnCkvB,EAASlvB,GAAK,IAEhB,IAAK,IAAI7I,EAAI,EAAGA,EAAI83B,EAASn3B,OAAQX,IAAK,CACxC,IAAI+L,EAAI+rB,EAASE,OAAOh4B,GACpBi4B,EAAKlsB,EAAExL,WAAW,GACtB,GAAqB,MAAjBw3B,EAASE,GAAe,MAAM,IAAIvzB,UAAUqH,EAAI,iBACpDgsB,EAASE,GAAMj4B,CAChB,CACD,IAAIk4B,EAAOJ,EAASn3B,OAChBw3B,EAASL,EAASE,OAAO,GACzBI,EAASv1B,KAAKQ,IAAI60B,GAAQr1B,KAAKQ,IAAI,KACnCg1B,EAAUx1B,KAAKQ,IAAI,KAAOR,KAAKQ,IAAI60B,GAyCvC,SAASI,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAI7zB,UAAU,mBACtD,GAAsB,IAAlB6zB,EAAO53B,OAAgB,OAAOk3B,GAAQ9zB,MAAM,GAKhD,IAJA,IAAIy0B,EAAM,EAENC,EAAS,EACT93B,EAAS,EACN43B,EAAOC,KAASL,GACrBM,IACAD,IAMF,IAHA,IAAI5xB,GAAU2xB,EAAO53B,OAAS63B,GAAOJ,EAAU,IAAO,EAClDM,EAAO,IAAIt3B,WAAWwF,GAEnB2xB,EAAOC,IAAM,CAElB,IAAI/S,EAAQsS,EAASQ,EAAOh4B,WAAWi4B,IAEvC,GAAc,MAAV/S,EAAiB,OAErB,IADA,IAAIzlB,EAAI,EACC24B,EAAM/xB,EAAO,GAAc,IAAV6e,GAAezlB,EAAIW,KAAqB,IAATg4B,EAAaA,IAAO34B,IAC3EylB,GAAUyS,EAAOQ,EAAKC,KAAU,EAChCD,EAAKC,GAAQlT,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAIlkB,MAAM,kBACnCZ,EAASX,EACTw4B,GACD,CAGD,IADA,IAAII,EAAMhyB,EAAOjG,EACVi4B,IAAQhyB,GAAsB,IAAd8xB,EAAKE,IAC1BA,IAEF,IAAIC,EAAMhB,GAAQlzB,YAAY8zB,GAAU7xB,EAAOgyB,IAC/CC,EAAIntB,KAAK,EAAM,EAAG+sB,GAElB,IADA,IAAI5vB,EAAI4vB,EACDG,IAAQhyB,GACbiyB,EAAIhwB,KAAO6vB,EAAKE,KAElB,OAAOC,CACR,CAMD,MAAO,CACLhhB,OAzFF,SAAiB0gB,GAEf,IADIl3B,MAAMkF,QAAQgyB,IAAWA,aAAkBn3B,cAAcm3B,EAASV,GAAQjzB,KAAK2zB,KAC9EV,GAAQ3xB,SAASqyB,GAAW,MAAM,IAAI7zB,UAAU,mBACrD,GAAsB,IAAlB6zB,EAAO53B,OAAgB,MAAO,GAMlC,IAJA,IAAI83B,EAAS,EACT93B,EAAS,EACTm4B,EAAS,EACTC,EAAOR,EAAO53B,OACXm4B,IAAWC,GAA2B,IAAnBR,EAAOO,IAC/BA,IACAL,IAMF,IAHA,IAAI7xB,GAASmyB,EAAOD,GAAUT,EAAU,IAAO,EAC3CW,EAAM,IAAI53B,WAAWwF,GAElBkyB,IAAWC,GAAM,CAItB,IAHA,IAAItT,EAAQ8S,EAAOO,GAEf94B,EAAI,EACCi5B,EAAMryB,EAAO,GAAc,IAAV6e,GAAezlB,EAAIW,KAAqB,IAATs4B,EAAaA,IAAOj5B,IAC3EylB,GAAU,IAAMuT,EAAIC,KAAU,EAC9BD,EAAIC,GAAQxT,EAAQyS,IAAU,EAC9BzS,EAASA,EAAQyS,IAAU,EAE7B,GAAc,IAAVzS,EAAe,MAAM,IAAIlkB,MAAM,kBACnCZ,EAASX,EACT84B,GACD,CAGD,IADA,IAAII,EAAMtyB,EAAOjG,EACVu4B,IAAQtyB,GAAqB,IAAboyB,EAAIE,IACzBA,IAIF,IADA,IAAI1vB,EAAM2uB,EAAOgB,OAAOV,GACjBS,EAAMtyB,IAAQsyB,EAAO1vB,GAAOsuB,EAASE,OAAOgB,EAAIE,IACvD,OAAO1vB,CACR,EAmDC8uB,aAAcA,EACdxgB,OARF,SAAiBjT,GACf,IAAI/C,EAASw2B,EAAazzB,GAC1B,GAAI/C,EAAU,OAAOA,EACrB,MAAM,IAAIP,MAAM,WAAa22B,EAAO,aACrC,EAMH,EClHAkB,GAHY51B,GACG,8DCcf,SAAS61B,GAAQvtB,EAAG7B,EAAK0C,GACvB,OAAO1C,GAAO6B,GAAKA,GAAKa,CAC1B,CAMA,SAAS2sB,GAAarQ,GACpB,QAAU7iB,IAAN6iB,EAAiB,MAAO,GAC5B,GAAIA,IAAM5kB,OAAO4kB,GAAI,OAAOA,EAC5B,MAAMvkB,UAAU,2CAClB,CA+HA,SAAS60B,GAAOC,GAEdlyB,KAAKkyB,OAAS,GAAGr0B,MAAMgD,KAAKqxB,EAC9B,CAEAD,GAAOh1B,UAAY,CAIjBk1B,YAAa,WACX,OAAQnyB,KAAKkyB,OAAO74B,MACrB,EAUA8H,KAAM,WACL,OAAKnB,KAAKkyB,OAAO74B,OAET2G,KAAKkyB,OAAOhf,SAjCA,CAkCpB,EASFkf,QAAS,SAASC,GAChB,GAAIt4B,MAAMkF,QAAQozB,GAEhB,IADA,IAAIH,EAAsCG,EACnCH,EAAO74B,QACZ2G,KAAKkyB,OAAOI,QAAQJ,EAAOK,YAE7BvyB,KAAKkyB,OAAOI,QAAQD,EAEvB,EASD34B,KAAM,SAAS24B,GACb,GAAIt4B,MAAMkF,QAAQozB,GAEhB,IADA,IAAIH,EAAsCG,EACnCH,EAAO74B,QACZ2G,KAAKkyB,OAAOx4B,KAAKw4B,EAAOhf,cAE1BlT,KAAKkyB,OAAOx4B,KAAK24B,EAErB,GAUF,IAAIG,IAAY,EAOhB,SAASC,GAAaC,EAAOC,GAC3B,GAAID,EACF,MAAMt1B,UAAU,iBAClB,OAAOu1B,GAAkB,KAC3B,CA8Bc,IAAIC,GAAmB,QAUrC,SAASC,GAAYr1B,EAAUs1B,GAC7B,KAAM9yB,gBAAgB6yB,IACpB,OAAO,IAAIA,GAAYr1B,EAAUs1B,GAGnC,IADAt1B,OAAwBsB,IAAbtB,EAAyB0D,OAAO1D,GAAUsC,cAAgB8yB,MACpDA,GACf,MAAM,IAAI34B,MAAM,mDAElB64B,EAAUd,GAAac,GAGvB9yB,KAAK+yB,YAAa,EAElB/yB,KAAKgzB,UAAW,EAEhBhzB,KAAKizB,SAAW,KAEhBjzB,KAAKkzB,OAAS3d,QAAQud,EAAe,OAErC9yB,KAAKmzB,WAAa5d,QAAQud,EAAmB,WAE7C/1B,OAAOiH,eAAehE,KAAM,WAAY,CAACvE,MAAO,UAChDsB,OAAOiH,eAAehE,KAAM,QAAS,CAACvE,MAAOuE,KAAKkzB,SAClDn2B,OAAOiH,eAAehE,KAAM,YAAa,CAACvE,MAAOuE,KAAKmzB,YACxD,CA4FA,SAASC,GAAY51B,EAAUs1B,GAC7B,KAAM9yB,gBAAgBozB,IACpB,OAAO,IAAIA,GAAY51B,EAAUs1B,GAEnC,IADAt1B,OAAwBsB,IAAbtB,EAAyB0D,OAAO1D,GAAUsC,cAAgB8yB,MACpDA,GACf,MAAM,IAAI34B,MAAM,mDAElB64B,EAAUd,GAAac,GAGvB9yB,KAAK+yB,YAAa,EAElB/yB,KAAKqzB,SAAW,KAEhBrzB,KAAKszB,SAAW,CAACZ,MAAOnd,QAAQud,EAAe,QAE/C/1B,OAAOiH,eAAehE,KAAM,WAAY,CAACvE,MAAO,SAClD,CA2DA,SAAS83B,GAAYT,GACnB,IAAIJ,EAAQI,EAAQJ,MAMMc,EAAkB,EAClBC,EAAkB,EAClBC,EAAoB,EACpBC,EAAsB,IACtBC,EAAsB,IAShD5zB,KAAK6zB,QAAU,SAASC,EAAQC,GAG9B,IAxVoB,IAwVhBA,GAAgD,IAAtBL,EAE5B,OADAA,EAAoB,EACbjB,GAAaC,GAItB,IA9VoB,IA8VhBqB,EACF,OAAOvB,GAGT,GAA0B,IAAtBkB,EAAyB,CAG3B,GAAI3B,GAAQgC,EAAM,EAAM,KAEtB,OAAOA,EAIT,GAAIhC,GAAQgC,EAAM,IAAM,KAGtBL,EAAoB,EACpBF,EAAkBO,EAAO,SAItB,GAAIhC,GAAQgC,EAAM,IAAM,KAEd,MAATA,IACFJ,EAAsB,KAEX,MAATI,IACFH,EAAsB,KAGxBF,EAAoB,EACpBF,EAAkBO,EAAO,QAItB,KAAIhC,GAAQgC,EAAM,IAAM,KAgB3B,OAAOtB,GAAaC,GAdP,MAATqB,IACFJ,EAAsB,KAEX,MAATI,IACFH,EAAsB,KAGxBF,EAAoB,EACpBF,EAAkBO,EAAO,GAO3B,CAMA,OADAP,IAAsC,EAAIE,EACnC,IACT,CAIA,IAAK3B,GAAQgC,EAAMJ,EAAqBC,GAatC,OARAJ,EAAkBE,EAAoBD,EAAkB,EACxDE,EAAsB,IACtBC,EAAsB,IAGtBE,EAAO1B,QAAQ2B,GAGRtB,GAAaC,GAgBtB,GAXAiB,EAAsB,IACtBC,EAAsB,IAMtBJ,GAAoBO,EAAO,KAAU,GAAKL,GAD1CD,GAAmB,IAKfA,IAAoBC,EACtB,OAAO,KAGT,IAAIM,EAAaR,EAOjB,OAHAA,EAAkBE,EAAoBD,EAAkB,EAGjDO,EAEX,CAOA,SAASC,GAAYnB,GACPA,EAAQJ,MAMpB1yB,KAAK6zB,QAAU,SAASC,EAAQE,GAE9B,IAvdoB,IAudhBA,EACF,OAAOxB,GAIT,GAAIT,GAAQiC,EAAY,EAAQ,KAC9B,OAAOA,EAGT,IAAI/hB,EAAOxX,EAEPs3B,GAAQiC,EAAY,IAAQ,OAC9B/hB,EAAQ,EACRxX,EAAS,KAGFs3B,GAAQiC,EAAY,KAAQ,QACnC/hB,EAAQ,EACRxX,EAAS,KAGFs3B,GAAQiC,EAAY,MAAS,WACpC/hB,EAAQ,EACRxX,EAAS,KAQX,IAHA,IAAI2L,EAAQ,EAAE4tB,GAAe,EAAI/hB,GAAUxX,GAGpCwX,EAAQ,GAAG,CAGhB,IAAIiiB,EAAOF,GAAe,GAAK/hB,EAAQ,GAGvC7L,EAAM1M,KAAK,IAAe,GAAPw6B,GAGnBjiB,GAAS,CACX,CAGA,OAAO7L,EAEX,CA1WAysB,GAAY51B,UAAY,CAMtBuT,OAAQ,SAAgBhE,EAAOsmB,GAC7B,IAAI1sB,EAEFA,EADmB,iBAAVoG,GAAsBA,aAAiBzO,YACxC,IAAIjE,WAAW0S,GACG,iBAAVA,GAAsB,WAAYA,GACzCA,EAAMhS,kBAAkBuD,YACzB,IAAIjE,WAAW0S,EAAMhS,OACNgS,EAAMnO,WACNmO,EAAM9O,YAErB,IAAI5D,WAAW,GAGzBg5B,EAAUd,GAAac,GAElB9yB,KAAK+yB,aACR/yB,KAAKizB,SAAW,IAAIM,GAAY,CAACb,MAAO1yB,KAAKkzB,SAC7ClzB,KAAKgzB,UAAW,GAElBhzB,KAAK+yB,WAAaxd,QAAQud,EAAgB,QAS1C,IAPA,IAKIqB,EALAC,EAAe,IAAInC,GAAO7rB,GAE1BiuB,EAAc,IAKVD,EAAajC,gBACnBgC,EAASn0B,KAAKizB,SAASY,QAAQO,EAAcA,EAAajzB,WAC3CqxB,IAEA,OAAX2B,IAEAp6B,MAAMkF,QAAQk1B,GAChBE,EAAY36B,KAAK6J,MAAM8wB,EAA0CF,GAEjEE,EAAY36B,KAAKy6B,IAErB,IAAKn0B,KAAK+yB,WAAY,CACpB,EAAG,CAED,IADAoB,EAASn0B,KAAKizB,SAASY,QAAQO,EAAcA,EAAajzB,WAC3CqxB,GACb,MACa,OAAX2B,IAEAp6B,MAAMkF,QAAQk1B,GAChBE,EAAY36B,KAAK6J,MAAM8wB,EAA0CF,GAEjEE,EAAY36B,KAAKy6B,GACrB,QAAUC,EAAajC,eACvBnyB,KAAKizB,SAAW,IAClB,CAoBA,OAlBIoB,EAAYh7B,UAI4B,IAAtC,CAAC,SAASa,QAAQ8F,KAAKxC,WACtBwC,KAAKmzB,YAAenzB,KAAKgzB,WAEL,QAAnBqB,EAAY,IACdr0B,KAAKgzB,UAAW,EAChBqB,EAAYnhB,SAIZlT,KAAKgzB,UAAW,IAjQ1B,SAA4BqB,GAE1B,IADA,IAAIj5B,EAAI,GACC1C,EAAI,EAAGA,EAAI27B,EAAYh7B,SAAUX,EAAG,CAC3C,IAAI47B,EAAKD,EAAY37B,GACjB47B,GAAM,MACRl5B,GAAK8F,OAAOoC,aAAagxB,IAEzBA,GAAM,MACNl5B,GAAK8F,OAAOoC,aAA0B,OAAZgxB,GAAM,IACQ,OAAT,KAALA,IAE9B,CACA,OAAOl5B,CACT,CAyPWm5B,CAAmBF,EAC5B,GA8BFjB,GAAYn2B,UAAY,CAMtBsT,OAAQ,SAAgBikB,EAAY1B,GAClC0B,EAAaA,EAAatzB,OAAOszB,GAAc,GAC/C1B,EAAUd,GAAac,GAKlB9yB,KAAK+yB,aACR/yB,KAAKqzB,SAAW,IAAIY,GAAYj0B,KAAKszB,WACvCtzB,KAAK+yB,WAAaxd,QAAQud,EAAgB,QAM1C,IAJA,IAGIqB,EAHA/tB,EAAQ,GACRguB,EAAe,IAAInC,GA1Y3B,SAA4B10B,GAgB1B,IAZA,IAAInC,EAAI8F,OAAO3D,GAGXiD,EAAIpF,EAAE/B,OAGNX,EAAI,EAGJ82B,EAAI,GAGD92B,EAAI8H,GAAG,CAGZ,IAAI9E,EAAIN,EAAEnC,WAAWP,GAKrB,GAAIgD,EAAI,OAAUA,EAAI,MAEpB8zB,EAAE91B,KAAKgC,QAIJ,GAAI,OAAUA,GAAKA,GAAK,MAE3B8zB,EAAE91B,KAAK,YAIJ,GAAI,OAAUgC,GAAKA,GAAK,MAG3B,GAAIhD,IAAM8H,EAAI,EACZgvB,EAAE91B,KAAK,WAGJ,CAEH,IAAIyB,EAAIoC,EAAOtE,WAAWP,EAAI,GAG9B,GAAI,OAAUyC,GAAKA,GAAK,MAAQ,CAE9B,IAAIqJ,EAAQ,KAAJ9I,EAGJgD,EAAQ,KAAJvD,EAIRq0B,EAAE91B,KAAK,OAAW8K,GAAK,IAAM9F,GAG7BhG,GAAK,CACP,MAKE82B,EAAE91B,KAAK,MAEX,CAIFhB,GAAK,CACP,CAGA,OAAO82B,CACT,CA6TkCiF,CAAmBD,KAGzCJ,EAAajC,gBACnBgC,EAASn0B,KAAKqzB,SAASQ,QAAQO,EAAcA,EAAajzB,WAC3CqxB,IAEXz4B,MAAMkF,QAAQk1B,GAChB/tB,EAAM1M,KAAK6J,MAAM6C,EAAoC+tB,GAErD/tB,EAAM1M,KAAKy6B,GAEf,IAAKn0B,KAAK+yB,WAAY,CACpB,MACEoB,EAASn0B,KAAKqzB,SAASQ,QAAQO,EAAcA,EAAajzB,WAC3CqxB,IAEXz4B,MAAMkF,QAAQk1B,GAChB/tB,EAAM1M,KAAK6J,MAAM6C,EAAoC+tB,GAErD/tB,EAAM1M,KAAKy6B,GAEfn0B,KAAKqzB,SAAW,IAClB,CACA,OAAO,IAAIv5B,WAAWsM,EACxB,2ECncEsuB,GAAmB10B,GAAQA,EAAK00B,kBAAqB33B,OAAO4S,OAAU,SAASgS,EAAG7mB,EAAGsjB,EAAGuW,QAC7E71B,IAAP61B,IAAkBA,EAAKvW,GAC3BrhB,OAAOiH,eAAe2d,EAAGgT,EAAI,CAAE1wB,YAAY,EAAMC,IAAK,WAAa,OAAOpJ,EAAEsjB,EAAG,GACnF,EAAM,SAASuD,EAAG7mB,EAAGsjB,EAAGuW,QACT71B,IAAP61B,IAAkBA,EAAKvW,GAC3BuD,EAAEgT,GAAM75B,EAAEsjB,EACd,GACIwW,GAAsB50B,GAAQA,EAAK40B,qBAAwB73B,OAAO4S,OAAU,SAASgS,EAAGrP,GACxFvV,OAAOiH,eAAe2d,EAAG,UAAW,CAAE1d,YAAY,EAAMxI,MAAO6W,GACnE,EAAK,SAASqP,EAAGrP,GACbqP,EAAW,QAAIrP,CACnB,GACIuiB,GAAc70B,GAAQA,EAAK60B,YAAe,SAAUC,EAAYtvB,EAAQ6qB,EAAK0E,GAC7E,IAA2H55B,EAAvHO,EAAIgE,UAAUrG,OAAQ+iB,EAAI1gB,EAAI,EAAI8J,EAAkB,OAATuvB,EAAgBA,EAAOh4B,OAAOi4B,yBAAyBxvB,EAAQ6qB,GAAO0E,EACrH,GAAuB,iBAAZE,SAAoD,mBAArBA,QAAQC,SAAyB9Y,EAAI6Y,QAAQC,SAASJ,EAAYtvB,EAAQ6qB,EAAK0E,QACpH,IAAK,IAAIr8B,EAAIo8B,EAAWz7B,OAAS,EAAGX,GAAK,EAAGA,KAASyC,EAAI25B,EAAWp8B,MAAI0jB,GAAK1gB,EAAI,EAAIP,EAAEihB,GAAK1gB,EAAI,EAAIP,EAAEqK,EAAQ6qB,EAAKjU,GAAKjhB,EAAEqK,EAAQ6qB,KAASjU,GAChJ,OAAO1gB,EAAI,GAAK0gB,GAAKrf,OAAOiH,eAAewB,EAAQ6qB,EAAKjU,GAAIA,CAChE,EACI+Y,GAAgBn1B,GAAQA,EAAKm1B,cAAiB,SAAU7X,GACxD,GAAIA,GAAOA,EAAI8X,WAAY,OAAO9X,EAClC,IAAI6W,EAAS,CAAA,EACb,GAAW,MAAP7W,EAAa,IAAK,IAAIc,KAAKd,EAAe,YAANc,GAAmBrhB,OAAOoT,eAAetP,KAAKyc,EAAKc,IAAIsW,GAAgBP,EAAQ7W,EAAKc,GAE5H,OADAwW,GAAmBT,EAAQ7W,GACpB6W,CACX,EACIkB,GAAmBr1B,GAAQA,EAAKq1B,iBAAoB,SAAU/X,GAC9D,OAAQA,GAAOA,EAAI8X,WAAc9X,EAAM,CAAEgY,QAAWhY,EACxD,EACAvgB,OAAOiH,eAAeuxB,GAAS,aAAc,CAAE95B,OAAO,IACtD,IAAA+5B,GAAAD,GAAAE,qBAA+BC,GAAmBH,GAAAI,YAAGC,GAAiBL,GAAAM,0BAA0BN,GAAAO,aAAuBP,GAAAQ,WAAuCR,GAAAS,8BAAwB,EACtL,MAAMC,GAAUZ,GAAgBn5B,IAC1Bg6B,GAASb,GAAgBl5B,IAEzBqB,GAAW23B,GAAagB,IAExBC,GAAc,IAD+B,mBAAhBvD,YAA6Br1B,GAASq1B,YAAcA,aAC3C,QAAS,CAAEH,OAAO,IAO5C6C,GAAAc,WANlB,SAAoB56B,GAIhB,MAHqB,iBAAVA,IACPA,EAAQc,OAAOe,KAAK7B,EAAO,SAExBy6B,GAAOZ,QAAQ/kB,OAAOhU,OAAOe,KAAK7B,GAC7C,EAKkB85B,GAAAS,WAHlB,SAAoBv6B,GAChB,OAAOc,OAAOe,KAAK44B,GAAOZ,QAAQ9kB,OAAO/U,GAC7C,EAEA,MAAM66B,GAAiB,KACvB,MAAMP,WAAmB97B,MACrB0R,WAAAA,CAAYM,GACRL,MAAMK,GACNjM,KAAKu2B,UAAY,GACjBv2B,KAAKw2B,gBAAkBvqB,CAC1B,CACDwqB,cAAAA,CAAeC,GACX12B,KAAKu2B,UAAUI,OAAO,EAAG,EAAGD,GAE5B12B,KAAKiM,QAAUjM,KAAKw2B,gBAAkB,KAAOx2B,KAAKu2B,UAAU18B,KAAK,IACpE,EAEa07B,GAAAQ,WAAGA,GAErB,MAAMD,GACFnqB,WAAAA,GACI3L,KAAKlD,IAAMP,OAAOE,MAAM65B,IACxBt2B,KAAK3G,OAAS,CACjB,CACDu9B,WAAAA,GACQ52B,KAAKlD,IAAIzD,OAAS,GAAK2G,KAAK3G,SAC5B2G,KAAKlD,IAAMP,OAAOoI,OAAO,CAAC3E,KAAKlD,IAAKP,OAAOE,MAAM65B,MAExD,CACDO,OAAAA,CAAQp7B,GACJuE,KAAK42B,cACL52B,KAAKlD,IAAI4M,WAAWjO,EAAOuE,KAAK3G,QAChC2G,KAAK3G,QAAU,CAClB,CACDy9B,QAAAA,CAASr7B,GACLuE,KAAK42B,cACL52B,KAAKlD,IAAI8M,cAAcnO,EAAOuE,KAAK3G,QACnC2G,KAAK3G,QAAU,CAClB,CACD09B,QAAAA,CAASt7B,GACLuE,KAAK42B,cACL52B,KAAKlD,IAAIkN,cAAcvO,EAAOuE,KAAK3G,QACnC2G,KAAK3G,QAAU,CAClB,CACD29B,QAAAA,CAASv7B,GACLuE,KAAK42B,cACL52B,KAAKi3B,YAAY16B,OAAOe,KAAK,IAAI24B,GAAQX,QAAQ75B,GAAOqhB,QAAQ,KAAM,IACzE,CACDoa,SAAAA,CAAUz7B,GACNuE,KAAK42B,cACL52B,KAAKi3B,YAAY16B,OAAOe,KAAK,IAAI24B,GAAQX,QAAQ75B,GAAOqhB,QAAQ,KAAM,KACzE,CACDqa,SAAAA,CAAU17B,GACNuE,KAAK42B,cACL52B,KAAKi3B,YAAY16B,OAAOe,KAAK,IAAI24B,GAAQX,QAAQ75B,GAAOqhB,QAAQ,KAAM,KACzE,CACDsa,SAAAA,CAAU37B,GACNuE,KAAK42B,cACL52B,KAAKi3B,YAAY16B,OAAOe,KAAK,IAAI24B,GAAQX,QAAQ75B,GAAOqhB,QAAQ,KAAM,KACzE,CACDma,WAAAA,CAAYz8B,GAERwF,KAAKlD,IAAMP,OAAOoI,OAAO,CACrBpI,OAAOe,KAAK0C,KAAKlD,IAAIoK,SAAS,EAAGlH,KAAK3G,SACtCmB,EACA+B,OAAOE,MAAM65B,MAEjBt2B,KAAK3G,QAAUmB,EAAOnB,MACzB,CACDg+B,WAAAA,CAAYn1B,GACRlC,KAAK42B,cACL,MAAMl4B,EAAInC,OAAOe,KAAK4E,EAAK,QAC3BlC,KAAK+2B,SAASr4B,EAAErF,QAChB2G,KAAKi3B,YAAYv4B,EACpB,CACD44B,eAAAA,CAAgB/3B,GACZS,KAAKi3B,YAAY16B,OAAOe,KAAKiC,GAChC,CACDg4B,UAAAA,CAAWh4B,EAAO8N,GACdrN,KAAK42B,cACL52B,KAAK+2B,SAASx3B,EAAMlG,QACpB,IAAK,MAAMm+B,KAAQj4B,EACfS,KAAK42B,cACLvpB,EAAGmqB,EAEV,CACD1a,OAAAA,GACI,OAAO9c,KAAKlD,IAAIoK,SAAS,EAAGlH,KAAK3G,OACpC,EAGL,SAASo+B,GAAmBjyB,EAAQkyB,EAAaC,GAC7C,MAAMC,EAAiBD,EAAmBl8B,MAC1Ck8B,EAAmBl8B,MAAQ,YAAao8B,GACpC,IACI,OAAOD,EAAer0B,MAAMvD,KAAM63B,EACrC,CACD,MAAOh9B,GACH,GAAIA,aAAagC,WAAY,CACzB,MAAM7C,EAAOa,EAAEb,KACf,GAAI,CAAC,2BAA4B,oBAAoBE,QAAQF,IAAS,EAClE,MAAM,IAAI+7B,GAAW,+CAE5B,CACD,MAAMl7B,CACT,EAET,CAjBoB06B,GAAAO,aAAGA,GAkBvB,MAAMgC,GACFnsB,WAAAA,CAAY7O,GACRkD,KAAKlD,IAAMA,EACXkD,KAAKvF,OAAS,CACjB,CACDs9B,MAAAA,GACI,MAAMt8B,EAAQuE,KAAKlD,IAAI2K,UAAUzH,KAAKvF,QAEtC,OADAuF,KAAKvF,QAAU,EACRgB,CACV,CACDu8B,OAAAA,GACI,MAAMv8B,EAAQuE,KAAKlD,IAAI6K,aAAa3H,KAAKvF,QAEzC,OADAuF,KAAKvF,QAAU,EACRgB,CACV,CACDw8B,OAAAA,GACI,MAAMx8B,EAAQuE,KAAKlD,IAAIgL,aAAa9H,KAAKvF,QAEzC,OADAuF,KAAKvF,QAAU,EACRgB,CACV,CACDy8B,OAAAA,GACI,MAAMp7B,EAAMkD,KAAKm4B,WAAW,GAC5B,OAAO,IAAIlC,GAAQX,QAAQx4B,EAAK,KACnC,CACDs7B,QAAAA,GACI,MAAMt7B,EAAMkD,KAAKm4B,WAAW,IAC5B,OAAO,IAAIlC,GAAQX,QAAQx4B,EAAK,KACnC,CACDu7B,QAAAA,GACI,MAAMv7B,EAAMkD,KAAKm4B,WAAW,IAC5B,OAAO,IAAIlC,GAAQX,QAAQx4B,EAAK,KACnC,CACDw7B,QAAAA,GACI,MAAMx7B,EAAMkD,KAAKm4B,WAAW,IAC5B,OAAO,IAAIlC,GAAQX,QAAQx4B,EAAK,KACnC,CACDq7B,UAAAA,CAAWp/B,GACP,GAAIiH,KAAKvF,OAAS1B,EAAMiH,KAAKlD,IAAIzD,OAC7B,MAAM,IAAI08B,GAAY,0BAAyBh9B,yBAEnD,MAAMo7B,EAASn0B,KAAKlD,IAAIe,MAAMmC,KAAKvF,OAAQuF,KAAKvF,OAAS1B,GAEzD,OADAiH,KAAKvF,QAAU1B,EACRo7B,CACV,CACDoE,UAAAA,GACI,MAAMx/B,EAAMiH,KAAKi4B,UACXn7B,EAAMkD,KAAKm4B,WAAWp/B,GAC5B,IAEI,OAAOq9B,GAAY5lB,OAAO1T,EAC7B,CACD,MAAOjC,GACH,MAAM,IAAIk7B,GAAY,gCAA+Bl7B,IACxD,CACJ,CACD29B,cAAAA,CAAez/B,GACX,OAAO,IAAIe,WAAWkG,KAAKm4B,WAAWp/B,GACzC,CACD0/B,SAAAA,CAAUprB,GACN,MAAMtU,EAAMiH,KAAKi4B,UACX9D,EAASp6B,QACf,IAAK,IAAIrB,EAAI,EAAGA,EAAIK,IAAOL,EACvBy7B,EAAOz6B,KAAK2T,KAEhB,OAAO8mB,CACV,EAiCL,SAASuE,GAAsBn7B,GAC3B,OAAOA,EAAOmzB,OAAO,GAAGiI,cAAgBp7B,EAAOM,MAAM,EACzD,CACA,SAAS+6B,GAAeC,EAAQnC,EAAWj7B,EAAOq9B,EAAWC,GACzD,IAEI,GAAyB,iBAAdD,EACPC,EAAQ,QAAOL,GAAsBI,MAAcr9B,QAElD,GAAIq9B,aAAqB/+B,MAC1B,GAA4B,iBAAjB++B,EAAU,GAAiB,CAClC,GAAIr9B,EAAMpC,SAAWy/B,EAAU,GAC3B,MAAM,IAAI/C,GAAY,kCAAiC+C,EAAU,eAAer9B,EAAMpC,gBAE1F0/B,EAAOzB,gBAAgB77B,EAC1B,MACI,GAAyB,IAArBq9B,EAAUz/B,QAAwC,iBAAjBy/B,EAAU,GAAiB,CACjE,GAAIr9B,EAAMpC,SAAWy/B,EAAU,GAC3B,MAAM,IAAI/C,GAAY,kCAAiC+C,EAAU,eAAer9B,EAAMpC,gBAE1F,IAAK,IAAIX,EAAI,EAAGA,EAAIogC,EAAU,GAAIpgC,IAC9BkgC,GAAeC,EAAQ,KAAMp9B,EAAM/C,GAAIogC,EAAU,GAAIC,EAE5D,MAEGA,EAAOxB,WAAW97B,GAAQu9B,IACtBJ,GAAeC,EAAQnC,EAAWsC,EAAMF,EAAU,GAAIC,EAAO,SAIpE,QAAuBj6B,IAAnBg6B,EAAUG,KACf,OAAQH,EAAUG,MACd,IAAK,SACGx9B,QACAs9B,EAAOlC,QAAQ,IAGfkC,EAAOlC,QAAQ,GACf+B,GAAeC,EAAQnC,EAAWj7B,EAAOq9B,EAAU95B,KAAM+5B,IAE7D,MAEJ,IAAK,MACDA,EAAOhC,SAASt7B,EAAM6D,MACtB7D,EAAMy9B,SAAQ,CAACx4B,EAAK2vB,KAChBuI,GAAeC,EAAQnC,EAAWrG,EAAKyI,EAAUzI,IAAK0I,GACtDH,GAAeC,EAAQnC,EAAWh2B,EAAKo4B,EAAUr9B,MAAOs9B,EAAO,IAEnE,MAEJ,QACI,MAAM,IAAIhD,GAAY,aAAY+C,uBAI1CK,GAAgBN,EAAQp9B,EAAOs9B,EAEtC,CACD,MAAOh1B,GAIH,MAHIA,aAAiBgyB,IACjBhyB,EAAM0yB,eAAeC,GAEnB3yB,CACT,CACL,CACA,SAASo1B,GAAgBN,EAAQl6B,EAAKo6B,GAClC,GAAkC,mBAAvBp6B,EAAIy6B,eAEX,YADAz6B,EAAIy6B,eAAeL,GAGvB,MAAMM,EAAeR,EAAO30B,IAAIvF,EAAIgN,aACpC,IAAK0tB,EACD,MAAM,IAAItD,GAAY,SAAQp3B,EAAIgN,YAAYI,6BAElD,GAA0B,WAAtBstB,EAAaJ,KACbI,EAAa7mB,OAAOyd,KAAI,EAAEyG,EAAWoC,MACjCF,GAAeC,EAAQnC,EAAW/3B,EAAI+3B,GAAYoC,EAAWC,EAAO,QAGvE,IAA0B,SAAtBM,EAAaJ,KAYlB,MAAM,IAAIlD,GAAY,2BAA0BsD,EAAaJ,YAAYt6B,EAAIgN,YAAYI,QAZtD,CACnC,MAAMA,EAAOpN,EAAI06B,EAAaC,OAC9B,IAAK,IAAIpnB,EAAM,EAAGA,EAAMmnB,EAAavpB,OAAOzW,SAAU6Y,EAAK,CACvD,MAAOwkB,EAAWoC,GAAaO,EAAavpB,OAAOoC,GACnD,GAAIwkB,IAAc3qB,EAAM,CACpBgtB,EAAOlC,QAAQ3kB,GACf0mB,GAAeC,EAAQnC,EAAW/3B,EAAI+3B,GAAYoC,EAAWC,GAC7D,KACH,CACJ,CACJ,CAGA,CACL,CA5HAlE,GAAW,CACP4C,IACDK,GAAa76B,UAAW,SAAU,MACrC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,UAAW,MACtC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,UAAW,MACtC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,UAAW,MACtC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,WAAY,MACvC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,WAAY,MACvC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,WAAY,MACvC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,aAAc,MACzC43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,iBAAkB,MAC7C43B,GAAW,CACP4C,IACDK,GAAa76B,UAAW,YAAa,MACpBs4B,GAAAuC,aAAGA,GAsGvB,IAAiBlC,GAAAL,GAAAM,UALjB,SAAmBgD,EAAQl6B,EAAK46B,EAASzD,IACrC,MAAMiD,EAAS,IAAIQ,EAEnB,OADAJ,GAAgBN,EAAQl6B,EAAKo6B,GACtBA,EAAOjc,SAClB,EAEA,SAAS0c,GAAiBX,EAAQnC,EAAWoC,EAAWW,GACpD,IACI,GAAyB,iBAAdX,EACP,OAAOW,EAAQ,OAAMf,GAAsBI,QAE/C,GAAIA,aAAqB/+B,MAAO,CAC5B,GAA4B,iBAAjB++B,EAAU,GACjB,OAAOW,EAAOjB,eAAeM,EAAU,IAEtC,GAA4B,iBAAjBA,EAAU,GAAiB,CACvC,MAAMngC,EAAM,GACZ,IAAK,IAAID,EAAI,EAAGA,EAAIogC,EAAU,GAAIpgC,IAC9BC,EAAIe,KAAK8/B,GAAiBX,EAAQ,KAAMC,EAAU,GAAIW,IAE1D,OAAO9gC,CACV,CAEG,OAAO8gC,EAAOhB,WAAU,IAAMe,GAAiBX,EAAQnC,EAAWoC,EAAU,GAAIW,IAEvF,CACD,GAAuB,WAAnBX,EAAUG,KAAmB,CAE7B,OADeQ,EAAO1B,SAEXyB,GAAiBX,EAAQnC,EAAWoC,EAAU95B,KAAMy6B,QAE/D,CACH,CACD,GAAuB,QAAnBX,EAAUG,KAAgB,CAC1B,IAAIhJ,EAAM,IAAIyJ,IACd,MAAMrgC,EAASogC,EAAOxB,UACtB,IAAK,IAAIv/B,EAAI,EAAGA,EAAIW,EAAQX,IAAK,CAC7B,MAAM23B,EAAMmJ,GAAiBX,EAAQnC,EAAWoC,EAAUzI,IAAKoJ,GACzD/4B,EAAM84B,GAAiBX,EAAQnC,EAAWoC,EAAUr9B,MAAOg+B,GACjExJ,EAAInrB,IAAIurB,EAAK3vB,EAChB,CACD,OAAOuvB,CACV,CACD,OAAO0J,GAAkBd,EAAQC,EAAWW,EAC/C,CACD,MAAO11B,GAIH,MAHIA,aAAiBgyB,IACjBhyB,EAAM0yB,eAAeC,GAEnB3yB,CACT,CACL,CACA,SAAS41B,GAAkBd,EAAQe,EAAWH,GAC1C,GAA0C,mBAA/BG,EAAUC,iBACjB,OAAOD,EAAUC,iBAAiBJ,GAEtC,MAAMJ,EAAeR,EAAO30B,IAAI01B,GAChC,IAAKP,EACD,MAAM,IAAItD,GAAY,SAAQ6D,EAAU7tB,6BAE5C,GAA0B,WAAtBstB,EAAaJ,KAAmB,CAChC,MAAM9E,EAAS,CAAA,EACf,IAAK,MAAOuC,EAAWoC,KAAcD,EAAO30B,IAAI01B,GAAWpnB,OACvD2hB,EAAOuC,GAAa8C,GAAiBX,EAAQnC,EAAWoC,EAAWW,GAEvE,OAAO,IAAIG,EAAUzF,EACxB,CACD,GAA0B,SAAtBkF,EAAaJ,KAAiB,CAC9B,MAAM/mB,EAAMunB,EAAO1B,SACnB,GAAI7lB,GAAOmnB,EAAavpB,OAAOzW,OAC3B,MAAM,IAAI08B,GAAY,eAAc7jB,qBAExC,MAAOwkB,EAAWoC,GAAaO,EAAavpB,OAAOoC,GAEnD,OAAO,IAAI0nB,EAAU,CAAElD,CAACA,GADL8C,GAAiBX,EAAQnC,EAAWoC,EAAWW,IAErE,CACD,MAAM,IAAI1D,GAAY,2BAA0BsD,EAAaJ,YAAYW,EAAUjuB,YAAYI,OACnG,CAUA,IAAmB2pB,GAAAH,GAAAI,YARnB,SAAqBkD,EAAQe,EAAWp/B,EAAQs/B,EAAShC,IACrD,MAAM2B,EAAS,IAAIK,EAAOt/B,GACpB25B,EAASwF,GAAkBd,EAAQe,EAAWH,GACpD,GAAIA,EAAOh/B,OAASD,EAAOnB,OACvB,MAAM,IAAI08B,GAAY,cAAav7B,EAAOnB,OAASogC,EAAOh/B,wCAE9D,OAAO05B,CACX,EChaM,SAAU4F,GACdC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAU,CACdp+B,EAAMA,OAACe,KAAKs9B,UAAUt9B,KAAK,CAAC,KAE5B,IAAIsyB,GAAUyK,EAAYhhC,QAAQoe,WAClC4iB,EACAC,EAAS7iB,WACT8iB,EAAM9iB,YAGFvY,EAAO3C,EAAAA,OAAOoI,OAAOg2B,GAErBpgB,EAAO,CACX,CACEC,OAAQyf,EACRxf,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ4f,EACR3f,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ0f,EACRzf,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ2f,EACR1f,UAAU,EACVC,YAAY,IAsChB,OAlCI8f,EACFjgB,EAAK7gB,KAAK,CACR8gB,OAAQggB,EACR/f,UAAU,EACVC,YAAY,IAGdH,EAAK7gB,KAAK,CACR8gB,OAAQ,IAAIhN,EAASA,UAACjR,EAAMA,OAACE,MAAM,KACnCge,UAAU,EACVC,YAAY,IAGZ+f,EACFlgB,EAAK7gB,KAAK,CACR8gB,OAAQigB,EACRhgB,UAAU,EACVC,YAAY,IAGdH,EAAK7gB,KAAK,CACR8gB,OAAQ,IAAIhN,EAASA,UAACjR,EAAMA,OAACE,MAAM,KACnCge,UAAU,EACVC,YAAY,IAGZggB,GACFngB,EAAK7gB,KAAK,CACR8gB,OAAQkgB,EACRjgB,UAAU,EACVC,YAAY,IAIT,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,UAAWkhB,EACX96B,QAEJ,CAEM,SAAU27B,GACdb,EACAc,EACArgC,EACAsgC,EACAC,GAEA,MAAML,EAAU,CACdp+B,EAAMA,OAACe,KAAKs9B,UAAUt9B,KAAK,CAAC,KAC5B7C,EAAOgd,WAEP,IAAImY,GAAUmL,EAAW1hC,QAAQoe,WACjCsjB,GAGI77B,EAAO3C,EAAAA,OAAOoI,OAAOg2B,GACrBpgB,EAAO,CACX,CACEC,OAAQsgB,EACRrgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQwgB,EACRvgB,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,UAAWkhB,EACX96B,QAEJ,CAEgB,SAAA+7B,GACdjB,EACAc,EACAI,EACAC,EACAX,EACAC,EACAW,GAEA,MAAMT,EAAU,CAACp+B,SAAOe,KAAKs9B,UAAUt9B,KAAK,CAAC,KAAM49B,EAAYzjB,YAEzDvY,EAAO3C,EAAAA,OAAOoI,OAAOg2B,GAErBpgB,EAAO,CACX,CACEC,OAAQsgB,EACRrgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ4gB,GAA4BD,EACpC1gB,UAAU,EACVC,YAAY,IA2BhB,OAvBI8f,GACFjgB,EAAK7gB,KAAK,CACR8gB,OAAQggB,EACR/f,UAAU,EACVC,YAAY,IAIZ0gB,GAAeX,IACZD,GACHjgB,EAAK7gB,KAAK,CACR8gB,OAAQhN,EAASA,UAAC8nB,QAClB7a,UAAU,EACVC,YAAY,IAGhBH,EAAK7gB,KAAK,CACR8gB,OAAQigB,EACRhgB,UAAU,EACVC,YAAY,KAIT,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,UAAWkhB,EACX96B,QAEJ,CAEM,SAAUm8B,GACdrB,EACAc,EACAQ,EACAnB,GAEA,MAAMQ,EAAU,CAACp+B,EAAMA,OAACe,KAAKs9B,UAAUt9B,KAAK,CAAC,MAEvC4B,EAAO3C,EAAAA,OAAOoI,OAAOg2B,GACrBpgB,EAAO,CACX,CACEC,OAAQsgB,EACRrgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ2f,EACR1f,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ8gB,EACR7gB,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,UAAWkhB,EACX96B,QAEJ,CDmNAs2B,GAAAD,GAAAE,qBAJA,SAA8BoD,EAAQe,EAAWp/B,EAAQs/B,EAAShC,IAE9D,OAAO6B,GAAkBd,EAAQe,EADlB,IAAIE,EAAOt/B,GAE9B,QChNa+gC,GAmBX,WAAA5vB,CAAYhN,GACVqB,KAAKkU,IAAM,EACXlU,KAAK+L,KAAOpN,EAAIoN,KAChB/L,KAAKu6B,MAAQ57B,EAAI47B,KAClB,CAED,SAAA1E,GACE,OAAOA,GAAU0F,GAAoB1C,OAAQ74B,KAC9C,CAED,cAAAw7B,CACE1iB,EACA2iB,EACAzB,EACA0B,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAM/8B,EAAO3C,EAAAA,OAAOe,KAAK0C,KAAK61B,aACxBtb,EAAO,CACX,CACEC,OAAQihB,EACRhhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQwf,EACRvf,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQkhB,EACRjhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQmhB,EACRlhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQohB,EACRnhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQG,EAAaA,cAAC7B,UACtB2B,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQqhB,EACRphB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQshB,EACRrhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQuhB,EACRthB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQwhB,EACRvhB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQjN,EACRkN,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQyhB,EACRxhB,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,YACA5Z,QAEH,EA1GMq8B,GAAM1C,OAAW,IAAIa,IAAI,CAC9B,CACE6B,GACA,CACEtC,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,OAAQ,UACT,CAAC,QAAS,kBAqGP0pB,GAeX,WAAAvwB,CAAYhN,GACVqB,KAAKkU,IAAM,GACXlU,KAAK+L,KAAOpN,EAAIoN,IACjB,CACD,SAAA8pB,GACE,OAAOA,GAAUqG,GAAyBrD,OAAQ74B,KACnD,CACD,cAAAw7B,CACE1iB,EACAqjB,EACAT,EACAU,EACAC,EACAR,EACAS,EACAC,EACAC,EACAC,GAEA,MAAMv9B,EAAO3C,EAAAA,OAAOe,KAAK0C,KAAK61B,aAC9B,IAAItb,EAAqB,GAkDzB,OAjDAA,EAAK7gB,KAAK,CACR8gB,OAAQ2hB,EACR1hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQkhB,EACRjhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ4hB,EACR3hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ6hB,EACR5hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqhB,EACRphB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ8hB,EACR7hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ+hB,EACR9hB,UAAU,EACVC,YAAY,IAER8hB,GACJjiB,EAAK7gB,KAAK,CACR8gB,OAAQgiB,EACR/hB,UAAU,EACVC,YAAY,IAGV+hB,GACJliB,EAAK7gB,KAAK,CACR8gB,OAAQiiB,EACRhiB,UAAU,EACVC,YAAY,IAGT,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,YACA5Z,QAEH,EAvFMg9B,GAAMrD,OAAW,IAAIa,IAAI,CAC9B,CACEwC,GACA,CACEjD,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,OAAQ,qBAkFNkqB,GAmBX,WAAA/wB,CAAYhN,GAKVqB,KAAKkU,IAAM,GACXlU,KAAK+L,KAAOpN,EAAIoN,KAChB/L,KAAKu6B,MAAQ57B,EAAI47B,MACjBv6B,KAAK28B,eAAiBh+B,EAAIg+B,cAC3B,CACD,SAAA9G,GACE,OAAOA,GAAU6G,GAAoB7D,OAAQ74B,KAC9C,CACD,cAAAw7B,CACE1iB,EACAqjB,EACAT,EACA3vB,EACAqwB,EACAC,EACAR,EACAC,EACAc,EACAC,EACAC,EACAC,EACAC,EACAC,EACAV,EACAN,EACAiB,GAEA,MAAMh+B,EAAO3C,EAAAA,OAAOe,KAAK0C,KAAK61B,aAC9B,IAAItb,EAAqB,GAmFzB,OAlFAA,EAAK7gB,KAAK,CACR8gB,OAAQ2hB,EACR1hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQkhB,EACRjhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQzO,EACR0O,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ4hB,EACR3hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ6hB,EACR5hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqhB,EACRphB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQshB,EACRrhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQoiB,EACRniB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqiB,EACRpiB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQsiB,EACRriB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQuiB,EACRtiB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQwiB,EACRviB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQyiB,EACRxiB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ+hB,EACR9hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQyhB,EACRxhB,UAAU,EACVC,YAAY,IAERwiB,GACJ3iB,EAAK7gB,KAAK,CACR8gB,OAAQ0iB,EACRziB,UAAU,EACVC,YAAY,IAGT,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,YACA5Z,QAEH,EAvIMw9B,GAAM7D,OAAW,IAAIa,IAAI,CAC9B,CACEgD,GACA,CACEzD,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,OAAQ,UACT,CAAC,QAAS,OACV,CAAC,iBAAkB,CAAEymB,KAAM,SAAUj6B,KAAM,mBAiIxCm+B,GAiBX,WAAAxxB,CAAYhN,GACVqB,KAAKkU,IAAM,GACXlU,KAAK+L,KAAOpN,EAAIoN,KAChB/L,KAAKu6B,MAAQ57B,EAAI47B,KAClB,CACD,SAAA1E,GACE,OAAOA,GAAUsH,GAAyBtE,OAAQ74B,KACnD,CACD,cAAAw7B,CACE1iB,EACAqjB,EACAT,EACA3vB,EACAqwB,EACAC,EACAR,EACAC,EACAsB,EACAC,EACAC,EACAC,EACAC,EACAP,EACAV,EACAN,EACAwB,GAEA,MAAMv+B,EAAO3C,EAAAA,OAAOe,KAAK0C,KAAK61B,aAC9B,IAAItb,EAAqB,GAiFzB,OAhFAA,EAAK7gB,KAAK,CACR8gB,OAAQ2hB,EACR1hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQkhB,EACRjhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQzO,EACR0O,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ4hB,EACR3hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ6hB,EACR5hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqhB,EACRphB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQshB,EACRrhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ4iB,EACR3iB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ6iB,EACR5iB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ8iB,EACR7iB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ+iB,EACR9iB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQgjB,EACR/iB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQyiB,EACRxiB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ+hB,EACR9hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQyhB,EACRxhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQijB,EACRhjB,UAAU,EACVC,YAAY,IAEP,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,YACA5Z,QAEH,EA/HMi+B,GAAMtE,OAAW,IAAIa,IAAI,CAC9B,CACEyD,GACA,CACElE,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,OAAQ,UACT,CAAC,QAAS,kBA0HPkrB,GAWX,WAAA/xB,GACE3L,KAAKkU,IAAM,EACZ,CACD,SAAA2hB,GACE,OAAOA,GAAU6H,GAAgB7E,OAAQ74B,KAC1C,CACD,cAAAw7B,CACE1iB,EACA6kB,EACAtB,EACAuB,EACAnnB,EACAonB,EACA5B,EACAJ,EACA7iB,EACAxT,GAEA,MAAMtG,EAAO3C,EAAAA,OAAOe,KAAK0C,KAAK61B,aAC9B,IAAItb,EAAqB,GA8CzB,OA7CAA,EAAK7gB,KAAK,CACR8gB,OAAQmjB,EACRljB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ6hB,EACR5hB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQojB,EACRnjB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQ/D,EACRgE,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqjB,EACRpjB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQyhB,EACRxhB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQqhB,EACRphB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQxB,EACRyB,UAAU,EACVC,YAAY,IAEdH,EAAK7gB,KAAK,CACR8gB,OAAQhV,EACRiV,UAAU,EACVC,YAAY,IAEP,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,YACA5Z,QAEH,EA/EMw+B,GAAM7E,OAAW,IAAIa,IAAI,CAC9B,CACEgE,GACA,CACEzE,KAAM,SACNzmB,OAAQ,CAAC,CAAC,MAAO,WC5sBlB,MAAMsrB,GAAoB,IAAItwB,YACnC,+CAGWuwB,GAAcxhC,EAAMA,OAACe,KAAK,kBAEvC,IAAY0gC,IAAZ,SAAYA,GACVA,EAAAA,EAAA,cAAA,GAAA,gBACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,aAAA,GAAA,eACAA,EAAAA,EAAA,eAAA,GAAA,gBACD,CALD,CAAYA,KAAAA,GAKX,CAAA,UAEYC,GAuBX,WAAAtyB,CAAYhN,GAOVqB,KAAKkU,IAAMvV,EAAIuV,IACflU,KAAKk+B,MAAQv/B,EAAIu/B,MACjBl+B,KAAK27B,YAAc,IAAInuB,EAASA,UAAC7O,EAAIg9B,aACrC37B,KAAKgZ,MAAQ,IAAIxL,EAASA,UAAC7O,EAAIqa,OAC/BhZ,KAAKs9B,QAAU,IAAI9vB,EAASA,UAAC7O,EAAI2+B,QAClC,CAED,kBAAO3H,CAAYz2B,GACjB,OAAOy2B,GAAY31B,KAAK64B,OAAQoF,GAAW/+B,EAC5C,CAED,qBAAai/B,CAASxlB,EAAwB0X,GAC5C,MAAM+N,QAAoBzlB,EAAWiB,eAAeyW,GACpD,IAAK+N,IAAgBA,EAAYl/B,KAC/B,MAAM,IAAIjF,MAAM,wBAElB,OAAO+F,KAAK21B,YAAYyI,EAAYl/B,KACrC,CACD,oBAAam/B,CAAQ1C,EAAwB7iB,GAC3C,aAAatL,EAASA,UAAC8wB,mBACrB,CAAC/hC,EAAMA,OAACe,KAAK,cAAeq+B,EAAYlkB,YACxCqB,EAEH,EA9CMmlB,GAAMpF,OAAW,IAAIa,IAAI,CAC9B,CACEuE,GACA,CACEhF,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,QAAS,MACV,CAAC,cAAe,CAAC,KACjB,CAAC,QAAS,CAAC,KACX,CAAC,UAAW,CAAC,UA8ChB,MCrDM+rB,GAAmB9lB,MAC9BE,EACAgjB,KAEA,IACE,MAAO7hB,SAActM,EAAAA,UAAU8wB,mBAC7B,CAACP,GAAapC,EAAYlkB,YAC1BqmB,IAIF,GAAmC,aADZplB,GAAQC,EAAYmB,IAC9BR,OAAO9Z,WAClB,OAGF,MAAMg/B,EAAsC,CAC1C,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO0T,EAAK4kB,aAGhB,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAO,MAGX,CAAEu4B,SAAU,MAGRxK,QAAexb,EAAWimB,mBAAmBrxB,EAAkB,CACnEixB,YAGF,GAAqB,GAAjBrK,EAAO96B,OACT,OAGF,OAAO,IAAImU,EAASA,UAAC2mB,EAAO,GAAG0K,QAAQ3/B,KAAKrB,MAAM,GAAI,IACvD,CAAC,MACA,MACD,GA4BGihC,GAAa9lB,GACe,CAC9B,CACEylB,OAAQ,CAAEhkC,OAAQ,GAAI2L,MAAO4S,IAE/B,CAAEylB,OAAQ,CAAEhkC,OAAQ,GAAI2L,MAAO,OAK7B24B,GAAUtmB,MAAOE,EAAwBjG,KAC7C,MAAMssB,OD5ByBvmB,OAC/BE,EACAmB,KAEA,MAAM0kB,EAAU,CACd,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO,MAGX,CACEq4B,OAAQ,CACNhkC,OAAQ,GACR2L,MAAO0T,EAAK4kB,cASlB,aAJqB/lB,EAAWimB,mBAAmBd,GAAmB,CACpEU,WAGW,ECKQS,CAAkBtmB,EAAYjG,EAAIoH,MACvD,GAAsB,IAAlBklB,EAAO3lC,OACT,OAAO4kC,GAAUtI,YAAYqJ,EAAO,GAAGH,QAAQ3/B,KAChD,EAGUggC,GAAkBzmB,MAC7BE,EACAK,KAEA,MAAMwlB,EAAsC,IACvCM,GAAU9lB,EAAM0lB,YACnB,CAAEC,SAAU,MAMRQ,SAJexmB,EAAWimB,mBAAmBrxB,EAAkB,CACnEixB,aAGuBvO,KAAKp1B,GAAMud,GAAc5H,OAAO3V,EAAEgkC,QAAQ3/B,QAE7DkgC,EAAWD,EAAUlP,KAAKvd,GAAQqsB,GAAQpmB,EAAYjG,KAG5D,aAFsB2sB,QAAQC,IAAIF,IAEnBG,QAAQ1kC,QAAYiE,IAANjE,GAA+B,QC7HjD2kC,GAoBX,WAAA7zB,CAAYhN,GAKVqB,KAAKw8B,WAAa,IAAIhvB,EAASA,UAAC7O,EAAI69B,YACpCx8B,KAAKgZ,MAAQ,IAAIxL,EAASA,UAAC7O,EAAIqa,OAC/BhZ,KAAKy/B,MAAQ,IAAIjyB,EAASA,UAAC7O,EAAI8gC,MAChC,CAEM,qBAAatB,CAClBxlB,EACAmiB,SAEA,MAAMa,QAAoBhjB,EAAWiB,eAAekhB,GACpD,IAAKa,EACH,MAAM,IAAIjM,GAASD,kBAAUiQ,qBAG/B,IAAI98B,EAAyB6yB,GAC3Bz1B,KAAK64B,OACL2G,GACA7D,EAAYz8B,MAGd0D,EAAI1D,KAAyB,QAAlBygC,EAAAhE,EAAYz8B,YAAM,IAAAygC,OAAA,EAAAA,EAAA9hC,MAAMmC,KAAK4/B,YAIxC,MAAO,CAAE3rB,SAAUrR,EAAKi9B,eAFDtB,GAAiB5lB,EAAYmiB,GAGrD,CAED,2BAAagF,CACXnnB,EACAonB,GAEA,MAAMC,QAAqBrnB,EAAWsnB,wBACpCF,GAEI1yB,EAAMnO,IACV,IAAKA,EAAM,OACX,MAAM0D,EAAyB6yB,GAC7Bz1B,KAAK64B,OACL2G,GACAtgC,GAGF,OADA0D,EAAI1D,KAAOA,aAAI,EAAJA,EAAMrB,MAAMmC,KAAK4/B,YACrBh9B,CAAG,EAEZ,OAAOo9B,EAAa/P,KAAKp1B,GAAMwS,EAAGxS,aAAA,EAAAA,EAAGqE,OACtC,CAEM,0BAAaghC,CAClBvnB,EACAonB,GAEA,IAAI5L,EAA4C,GAChD,MAAM5Z,EAAO,IAAIwlB,GACjB,KAAOxlB,EAAKlhB,OAAS,GACnB86B,EAAOz6B,cACKsG,KAAK8/B,eAAennB,EAAY4B,EAAKoc,OAAO,EAAG,OAG7D,OAAOxC,CACR,EAnFMqL,GAAUI,WAAG,GAMbJ,GAAM3G,OAAW,IAAIa,IAAI,CAC9B,CACE8F,GACA,CACEvG,KAAM,SACNzmB,OAAQ,CACN,CAAC,aAAc,CAAC,KAChB,CAAC,QAAS,CAAC,KACX,CAAC,QAAS,CAAC,0BCrBrB2tB,GAAiBplB,GAEjB,SAASA,GAAOra,EAAK+L,GACnB,IAAK/L,EACH,MAAM,IAAIzG,MAAMwS,GAAO,mBAC3B,CAEAsO,GAAOqlB,MAAQ,SAAqBC,EAAGjkB,EAAG3P,GACxC,GAAI4zB,GAAKjkB,EACP,MAAM,IAAIniB,MAAMwS,GAAQ,qBAAuB4zB,EAAI,OAASjkB,EAChE,sBCV6B,mBAAlBrf,OAAO4S,OAEhB2wB,GAAAhkC,QAAiB,SAAkB2e,EAAMC,GACnCA,IACFD,EAAKE,OAASD,EACdD,EAAKhe,UAAYF,OAAO4S,OAAOuL,EAAUje,UAAW,CAClD0O,YAAa,CACXlQ,MAAOwf,EACPhX,YAAY,EACZ4H,UAAU,EACVC,cAAc,OAOtBw0B,GAAAhkC,QAAiB,SAAkB2e,EAAMC,GACvC,GAAIA,EAAW,CACbD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAASne,UAAYie,EAAUje,UAC/Bge,EAAKhe,UAAY,IAAIme,EACrBH,EAAKhe,UAAU0O,YAAcsP,CAC9B,qBCtBDF,GAAS7e,GACT8e,GAAW7e,GAIf,SAASokC,GAAgB9zB,EAAK/T,GAC5B,OAAqC,QAAZ,MAApB+T,EAAIxT,WAAWP,QAGhBA,EAAI,GAAKA,EAAI,GAAK+T,EAAIpT,SAGkB,QAAZ,MAAxBoT,EAAIxT,WAAWP,EAAI,IAC7B,CAyDA,SAAS8nC,GAAMxjB,GAKb,OAJWA,IAAM,GACLA,IAAM,EAAK,MACXA,GAAK,EAAK,UACN,IAAJA,IAAa,MACV,CACjB,CAeA,SAASyjB,GAAM1rB,GACb,OAAoB,IAAhBA,EAAK1b,OACA,IAAM0b,EAENA,CACX,CAGA,SAAS2rB,GAAM3rB,GACb,OAAoB,IAAhBA,EAAK1b,OACA,IAAM0b,EACU,IAAhBA,EAAK1b,OACL,KAAO0b,EACS,IAAhBA,EAAK1b,OACL,MAAQ0b,EACQ,IAAhBA,EAAK1b,OACL,OAAS0b,EACO,IAAhBA,EAAK1b,OACL,QAAU0b,EACM,IAAhBA,EAAK1b,OACL,SAAW0b,EACK,IAAhBA,EAAK1b,OACL,UAAY0b,EAEZA,CACX,CAjHgB4rB,GAAA3lB,SAAGA,GAyDJ2lB,GAAA7jB,QA7Cf,SAAiBrQ,EAAKm0B,GACpB,GAAI7mC,MAAMkF,QAAQwN,GAChB,OAAOA,EAAI5O,QACb,IAAK4O,EACH,MAAO,GACT,IAAI7J,EAAM,GACV,GAAmB,iBAAR6J,EACT,GAAKm0B,GAyBE,GAAY,QAARA,EAIT,KAHAn0B,EAAMA,EAAInH,QAAQ,eAAgB,KAC1BjM,OAAS,GAAM,IACrBoT,EAAM,IAAMA,GACT/T,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,GAAK,EAC/BkK,EAAIlJ,KAAKmI,SAAS4K,EAAI/T,GAAK+T,EAAI/T,EAAI,GAAI,UAxBzC,IADA,IAAIkxB,EAAI,EACClxB,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAAK,CACnC,IAAIgD,EAAI+Q,EAAIxT,WAAWP,GACnBgD,EAAI,IACNkH,EAAIgnB,KAAOluB,EACFA,EAAI,MACbkH,EAAIgnB,KAAQluB,GAAK,EAAK,IACtBkH,EAAIgnB,KAAY,GAAJluB,EAAU,KACb6kC,GAAgB9zB,EAAK/T,IAC9BgD,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtB+Q,EAAIxT,aAAaP,IACvDkK,EAAIgnB,KAAQluB,GAAK,GAAM,IACvBkH,EAAIgnB,KAASluB,GAAK,GAAM,GAAM,IAC9BkH,EAAIgnB,KAASluB,GAAK,EAAK,GAAM,IAC7BkH,EAAIgnB,KAAY,GAAJluB,EAAU,MAEtBkH,EAAIgnB,KAAQluB,GAAK,GAAM,IACvBkH,EAAIgnB,KAASluB,GAAK,EAAK,GAAM,IAC7BkH,EAAIgnB,KAAY,GAAJluB,EAAU,IAEzB,MASH,IAAKhD,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAC1BkK,EAAIlK,GAAc,EAAT+T,EAAI/T,GAEjB,OAAOkK,CACT,EASa+9B,GAAAE,MANb,SAAep0B,GAEb,IADA,IAAI7J,EAAM,GACDlK,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAC9BkK,GAAO69B,GAAMh0B,EAAI/T,GAAG8G,SAAS,KAC/B,OAAOoD,CACT,EAUa+9B,GAAAH,MAAGA,GAYDG,GAAAG,QAVf,SAAiBr0B,EAAK+O,GAEpB,IADA,IAAI5Y,EAAM,GACDlK,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAAK,CACnC,IAAIskB,EAAIvQ,EAAI/T,GACG,WAAX8iB,IACFwB,EAAIwjB,GAAMxjB,IACZpa,GAAO89B,GAAM1jB,EAAExd,SAAS,IACzB,CACD,OAAOoD,CACT,EASa+9B,GAAAF,MAAGA,GAoBHE,GAAAD,MAAGA,GAgBFC,GAAAI,OAdd,SAAgBt0B,EAAKtS,EAAOC,EAAKohB,GAC/B,IAAIziB,EAAMqB,EAAMD,EAChB4gB,GAAOhiB,EAAM,GAAM,GAEnB,IADA,IAAI6J,EAAM,IAAI7I,MAAMhB,EAAM,GACjBL,EAAI,EAAG0lB,EAAIjkB,EAAOzB,EAAIkK,EAAIvJ,OAAQX,IAAK0lB,GAAK,EAAG,CACtD,IAAIpB,EAEFA,EADa,QAAXxB,EACG/O,EAAI2R,IAAM,GAAO3R,EAAI2R,EAAI,IAAM,GAAO3R,EAAI2R,EAAI,IAAM,EAAK3R,EAAI2R,EAAI,GAEjE3R,EAAI2R,EAAI,IAAM,GAAO3R,EAAI2R,EAAI,IAAM,GAAO3R,EAAI2R,EAAI,IAAM,EAAK3R,EAAI2R,GACxExb,EAAIlK,GAAKskB,IAAM,CAChB,CACD,OAAOpa,CACT,EAqBe+9B,GAAAK,QAlBf,SAAiBv0B,EAAK+O,GAEpB,IADA,IAAI5Y,EAAM,IAAI7I,MAAmB,EAAb0S,EAAIpT,QACfX,EAAI,EAAG0lB,EAAI,EAAG1lB,EAAI+T,EAAIpT,OAAQX,IAAK0lB,GAAK,EAAG,CAClD,IAAItjB,EAAI2R,EAAI/T,GACG,QAAX8iB,GACF5Y,EAAIwb,GAAKtjB,IAAM,GACf8H,EAAIwb,EAAI,GAAMtjB,IAAM,GAAM,IAC1B8H,EAAIwb,EAAI,GAAMtjB,IAAM,EAAK,IACzB8H,EAAIwb,EAAI,GAAS,IAAJtjB,IAEb8H,EAAIwb,EAAI,GAAKtjB,IAAM,GACnB8H,EAAIwb,EAAI,GAAMtjB,IAAM,GAAM,IAC1B8H,EAAIwb,EAAI,GAAMtjB,IAAM,EAAK,IACzB8H,EAAIwb,GAAS,IAAJtjB,EAEZ,CACD,OAAO8H,CACT,EAMc+9B,GAAAM,OAHd,SAAgBjkB,EAAGte,GACjB,OAAQse,IAAMte,EAAMse,GAAM,GAAKte,CACjC,EAMciiC,GAAAO,OAHd,SAAgBlkB,EAAGte,GACjB,OAAQse,GAAKte,EAAMse,IAAO,GAAKte,CACjC,EAMaiiC,GAAAQ,MAHb,SAAe38B,EAAG9F,GAChB,OAAQ8F,EAAI9F,IAAO,CACrB,EAMeiiC,GAAAS,QAHf,SAAiB58B,EAAG9F,EAAGhD,GACrB,OAAQ8I,EAAI9F,EAAIhD,IAAO,CACzB,EAMeilC,GAAAU,QAHf,SAAiB78B,EAAG9F,EAAGhD,EAAGP,GACxB,OAAQqJ,EAAI9F,EAAIhD,EAAIP,IAAO,CAC7B,EAMewlC,GAAAW,QAHf,SAAiB98B,EAAG9F,EAAGhD,EAAGP,EAAGN,GAC3B,OAAQ2J,EAAI9F,EAAIhD,EAAIP,EAAIN,IAAO,CACjC,EAYa8lC,GAAAY,MATb,SAAezkC,EAAK+H,EAAK28B,EAAIC,GAC3B,IAAIC,EAAK5kC,EAAI+H,GAGTpC,EAAMg/B,EAFD3kC,EAAI+H,EAAM,KAEI,EACnBrC,GAAMC,EAAKg/B,EAAK,EAAI,GAAKD,EAAKE,EAClC5kC,EAAI+H,GAAOrC,IAAO,EAClB1F,EAAI+H,EAAM,GAAKpC,CACjB,EAQgBk+B,GAAAgB,SALhB,SAAkBH,EAAIC,EAAIC,EAAIE,GAG5B,OAFUH,EAAKG,IAAQ,EACRH,EAAK,EAAI,GAAKD,EAAKE,IACpB,CAChB,EAOgBf,GAAAkB,SAJhB,SAAkBL,EAAIC,EAAIC,EAAIE,GAE5B,OADSH,EAAKG,IACA,CAChB,EAgBkBjB,GAAAmB,WAblB,SAAoBN,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,GAC9C,IAAI/jB,EAAQ,EACR1b,EAAKg/B,EAST,OAPAtjB,IADA1b,EAAMA,EAAKm/B,IAAQ,GACLH,EAAK,EAAI,EAEvBtjB,IADA1b,EAAMA,EAAKu/B,IAAQ,GACLA,EAAK,EAAI,EAIdR,EAAKE,EAAKK,EAAKE,GAFxB9jB,IADA1b,EAAMA,EAAKy/B,IAAQ,GACLA,EAAK,EAAI,KAGT,CAChB,EAOkBvB,GAAAwB,WAJlB,SAAoBX,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,GAE9C,OADST,EAAKG,EAAKI,EAAKE,IACV,CAChB,EAkBkBvB,GAAAyB,WAflB,SAAoBZ,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,EAAIG,EAAIC,GACtD,IAAInkB,EAAQ,EACR1b,EAAKg/B,EAWT,OATAtjB,IADA1b,EAAMA,EAAKm/B,IAAQ,GACLH,EAAK,EAAI,EAEvBtjB,IADA1b,EAAMA,EAAKu/B,IAAQ,GACLA,EAAK,EAAI,EAEvB7jB,IADA1b,EAAMA,EAAKy/B,IAAQ,GACLA,EAAK,EAAI,EAIdV,EAAKE,EAAKK,EAAKE,EAAKI,GAF7BlkB,IADA1b,EAAMA,EAAK6/B,IAAQ,GACLA,EAAK,EAAI,KAGT,CAChB,EAQkB3B,GAAA4B,WALlB,SAAoBf,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,EAAIC,EAAIC,EAAIG,EAAIC,GAGtD,OAFSb,EAAKG,EAAKI,EAAKE,EAAKI,IAEf,CAChB,EAOiB3B,GAAA6B,UAJjB,SAAmBhB,EAAIC,EAAIpnC,GAEzB,OADSonC,GAAO,GAAKpnC,EAASmnC,IAAOnnC,KACxB,CACf,EAOiBsmC,GAAA8B,UAJjB,SAAmBjB,EAAIC,EAAIpnC,GAEzB,OADSmnC,GAAO,GAAKnnC,EAASonC,IAAOpnC,KACxB,CACf,EAMgBsmC,GAAA+B,SAHhB,SAAkBlB,EAAIC,EAAIpnC,GACxB,OAAOmnC,IAAOnnC,CAChB,EAOAsmC,GAAAgC,SAJA,SAAkBnB,EAAIC,EAAIpnC,GAExB,OADSmnC,GAAO,GAAKnnC,EAASonC,IAAOpnC,KACxB,CACf,YClRIsmC,GAAQzkC,GACR6e,GAAS5e,GAEb,SAASymC,KACP5iC,KAAK6iC,QAAU,KACf7iC,KAAK8iC,aAAe,EACpB9iC,KAAK+iC,UAAY/iC,KAAK2L,YAAYo3B,UAClC/iC,KAAKgjC,QAAUhjC,KAAK2L,YAAYq3B,QAChChjC,KAAKijC,aAAejjC,KAAK2L,YAAYs3B,aACrCjjC,KAAKkjC,UAAYljC,KAAK2L,YAAYu3B,UAAY,EAC9CljC,KAAKwb,OAAS,MAEdxb,KAAKmjC,QAAUnjC,KAAK+iC,UAAY,EAChC/iC,KAAKojC,SAAWpjC,KAAK+iC,UAAY,EACnC,CACiBM,GAAAT,UAAGA,GAEpBA,GAAU3lC,UAAUqmC,OAAS,SAAgB72B,EAAKm0B,GAUhD,GARAn0B,EAAMk0B,GAAM7jB,QAAQrQ,EAAKm0B,GACpB5gC,KAAK6iC,QAGR7iC,KAAK6iC,QAAU7iC,KAAK6iC,QAAQl+B,OAAO8H,GAFnCzM,KAAK6iC,QAAUp2B,EAGjBzM,KAAK8iC,cAAgBr2B,EAAIpT,OAGrB2G,KAAK6iC,QAAQxpC,QAAU2G,KAAKmjC,QAAS,CAIvC,IAAI/mB,GAHJ3P,EAAMzM,KAAK6iC,SAGCxpC,OAAS2G,KAAKmjC,QAC1BnjC,KAAK6iC,QAAUp2B,EAAI5O,MAAM4O,EAAIpT,OAAS+iB,EAAG3P,EAAIpT,QACjB,IAAxB2G,KAAK6iC,QAAQxpC,SACf2G,KAAK6iC,QAAU,MAEjBp2B,EAAMk0B,GAAMI,OAAOt0B,EAAK,EAAGA,EAAIpT,OAAS+iB,EAAGpc,KAAKwb,QAChD,IAAK,IAAI9iB,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,GAAKsH,KAAKojC,SACxCpjC,KAAKujC,QAAQ92B,EAAK/T,EAAGA,EAAIsH,KAAKojC,SACjC,CAED,OAAOpjC,IACT,EAEA4iC,GAAU3lC,UAAUumC,OAAS,SAAgB5C,GAI3C,OAHA5gC,KAAKsjC,OAAOtjC,KAAKyjC,QACjB1oB,GAAwB,OAAjB/a,KAAK6iC,SAEL7iC,KAAK0jC,QAAQ9C,EACtB,EAEAgC,GAAU3lC,UAAUwmC,KAAO,WACzB,IAAI1qC,EAAMiH,KAAK8iC,aACX18B,EAAQpG,KAAKmjC,QACb/kB,EAAIhY,GAAUrN,EAAMiH,KAAKkjC,WAAa98B,EACtCxD,EAAM,IAAI7I,MAAMqkB,EAAIpe,KAAKkjC,WAC7BtgC,EAAI,GAAK,IACT,IAAK,IAAIlK,EAAI,EAAGA,EAAI0lB,EAAG1lB,IACrBkK,EAAIlK,GAAK,EAIX,GADAK,IAAQ,EACY,QAAhBiH,KAAKwb,OAAkB,CACzB,IAAK,IAAIgE,EAAI,EAAGA,EAAIxf,KAAKkjC,UAAW1jB,IAClC5c,EAAIlK,KAAO,EAEbkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAQK,IAAQ,GAAM,IAC1B6J,EAAIlK,KAAQK,IAAQ,GAAM,IAC1B6J,EAAIlK,KAAQK,IAAQ,EAAK,IACzB6J,EAAIlK,KAAa,IAANK,CACf,MAUI,IATA6J,EAAIlK,KAAa,IAANK,EACX6J,EAAIlK,KAAQK,IAAQ,EAAK,IACzB6J,EAAIlK,KAAQK,IAAQ,GAAM,IAC1B6J,EAAIlK,KAAQK,IAAQ,GAAM,IAC1B6J,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EACXkK,EAAIlK,KAAO,EAEN8mB,EAAI,EAAGA,EAAIxf,KAAKkjC,UAAW1jB,IAC9B5c,EAAIlK,KAAO,EAGf,OAAOkK,CACT,kBCxFIq+B,GADQ/kC,GACO+kC,OAYnB,SAAS0C,GAAKl/B,EAAGC,EAAGwqB,GAClB,OAAQzqB,EAAIC,GAAQD,EAAKyqB,CAC3B,CAGA,SAAS0U,GAAMn/B,EAAGC,EAAGwqB,GACnB,OAAQzqB,EAAIC,EAAMD,EAAIyqB,EAAMxqB,EAAIwqB,CAClC,CAGA,SAAS2U,GAAIp/B,EAAGC,EAAGwqB,GACjB,OAAOzqB,EAAIC,EAAIwqB,CACjB,CAdYmU,GAAAS,KARZ,SAAc1oC,EAAGqJ,EAAGC,EAAGwqB,GACrB,OAAU,IAAN9zB,EACKuoC,GAAKl/B,EAAGC,EAAGwqB,GACV,IAAN9zB,GAAiB,IAANA,EACNyoC,GAAIp/B,EAAGC,EAAGwqB,GACT,IAAN9zB,EACKwoC,GAAMn/B,EAAGC,EAAGwqB,QADrB,CAEF,EAMYmU,GAAAM,KAAGA,GAKFN,GAAAO,MAAGA,GAKLP,GAAAQ,IAAGA,GAKAR,GAAAU,OAHd,SAAgBt/B,GACd,OAAOw8B,GAAOx8B,EAAG,GAAKw8B,GAAOx8B,EAAG,IAAMw8B,GAAOx8B,EAAG,GAClD,EAMc4+B,GAAAW,OAHd,SAAgBv/B,GACd,OAAOw8B,GAAOx8B,EAAG,GAAKw8B,GAAOx8B,EAAG,IAAMw8B,GAAOx8B,EAAG,GAClD,EAMc4+B,GAAAY,OAHd,SAAgBx/B,GACd,OAAOw8B,GAAOx8B,EAAG,GAAKw8B,GAAOx8B,EAAG,IAAOA,IAAM,CAC/C,EAMA4+B,GAAAa,OAHA,SAAgBz/B,GACd,OAAOw8B,GAAOx8B,EAAG,IAAMw8B,GAAOx8B,EAAG,IAAOA,IAAM,EAChD,EC7CA,IAAIk8B,GAAQzkC,GACRmnC,GAASlnC,GACTgoC,GAAYhO,GAEZ+K,GAASP,GAAMO,OACfC,GAAQR,GAAMQ,MACdG,GAAUX,GAAMW,QAChBwC,GAAOK,GAAUL,KACjBlB,GAAYS,GAAOT,UAEnBwB,GAAS,CACX,WAAY,WACZ,WAAY,YAGd,SAASC,KACP,KAAMrkC,gBAAgBqkC,IACpB,OAAO,IAAIA,GAEbzB,GAAU/hC,KAAKb,MACfA,KAAK8nB,EAAI,CACP,WAAY,WAAY,WACxB,UAAY,YACd9nB,KAAKskC,EAAI,IAAIvqC,MAAM,GACrB,CAEA4mC,GAAM3lB,SAASqpB,GAAMzB,QACrB2B,GAAiBF,GAEjBA,GAAKtB,UAAY,IACjBsB,GAAKrB,QAAU,IACfqB,GAAKpB,aAAe,GACpBoB,GAAKnB,UAAY,GAEjBmB,GAAKpnC,UAAUsmC,QAAU,SAAiB92B,EAAKtS,GAG7C,IAFA,IAAImqC,EAAItkC,KAAKskC,EAEJ5rC,EAAI,EAAGA,EAAI,GAAIA,IACtB4rC,EAAE5rC,GAAK+T,EAAItS,EAAQzB,GAErB,KAAMA,EAAI4rC,EAAEjrC,OAAQX,IAClB4rC,EAAE5rC,GAAKwoC,GAAOoD,EAAE5rC,EAAI,GAAK4rC,EAAE5rC,EAAI,GAAK4rC,EAAE5rC,EAAI,IAAM4rC,EAAE5rC,EAAI,IAAK,GAE7D,IAAI8L,EAAIxE,KAAK8nB,EAAE,GACXppB,EAAIsB,KAAK8nB,EAAE,GACXpsB,EAAIsE,KAAK8nB,EAAE,GACX3sB,EAAI6E,KAAK8nB,EAAE,GACXjtB,EAAImF,KAAK8nB,EAAE,GAEf,IAAKpvB,EAAI,EAAGA,EAAI4rC,EAAEjrC,OAAQX,IAAK,CAC7B,IAAI0C,KAAO1C,EAAI,IACX8mB,EAAI8hB,GAAQJ,GAAO18B,EAAG,GAAIs/B,GAAK1oC,EAAGsD,EAAGhD,EAAGP,GAAIN,EAAGypC,EAAE5rC,GAAI0rC,GAAOhpC,IAChEP,EAAIM,EACJA,EAAIO,EACJA,EAAIwlC,GAAOxiC,EAAG,IACdA,EAAI8F,EACJA,EAAIgb,CACL,CAEDxf,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAItjB,GAC7BxE,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIppB,GAC7BsB,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIpsB,GAC7BsE,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAI3sB,GAC7B6E,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIjtB,EAC/B,EAEAwpC,GAAKpnC,UAAUymC,QAAU,SAAgB9C,GACvC,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAG,OAEtB6Y,GAAMK,QAAQhhC,KAAK8nB,EAAG,MACjC,ECvEA,IAAI6Y,GAAQzkC,GACRmnC,GAASlnC,GACTgoC,GAAYhO,GACZpb,GAASypB,GAETrD,GAAQR,GAAMQ,MACdE,GAAUV,GAAMU,QAChBC,GAAUX,GAAMW,QAChBqC,GAAOQ,GAAUR,KACjBC,GAAQO,GAAUP,MAClBG,GAASI,GAAUJ,OACnBC,GAASG,GAAUH,OACnBC,GAASE,GAAUF,OACnBC,GAASC,GAAUD,OAEnBtB,GAAYS,GAAOT,UAEnB6B,GAAW,CACb,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGtC,SAASC,KACP,KAAM1kC,gBAAgB0kC,IACpB,OAAO,IAAIA,GAEb9B,GAAU/hC,KAAKb,MACfA,KAAK8nB,EAAI,CACP,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,YAEtC9nB,KAAKoe,EAAIqmB,GACTzkC,KAAKskC,EAAI,IAAIvqC,MAAM,GACrB,CACA4mC,GAAM3lB,SAAS0pB,GAAQ9B,QACvB+B,GAAiBD,GAEjBA,GAAO3B,UAAY,IACnB2B,GAAO1B,QAAU,IACjB0B,GAAOzB,aAAe,IACtByB,GAAOxB,UAAY,GAEnBwB,GAAOznC,UAAUsmC,QAAU,SAAiB92B,EAAKtS,GAG/C,IAFA,IAAImqC,EAAItkC,KAAKskC,EAEJ5rC,EAAI,EAAGA,EAAI,GAAIA,IACtB4rC,EAAE5rC,GAAK+T,EAAItS,EAAQzB,GACrB,KAAOA,EAAI4rC,EAAEjrC,OAAQX,IACnB4rC,EAAE5rC,GAAK2oC,GAAQ6C,GAAOI,EAAE5rC,EAAI,IAAK4rC,EAAE5rC,EAAI,GAAIurC,GAAOK,EAAE5rC,EAAI,KAAM4rC,EAAE5rC,EAAI,KAEtE,IAAI8L,EAAIxE,KAAK8nB,EAAE,GACXppB,EAAIsB,KAAK8nB,EAAE,GACXpsB,EAAIsE,KAAK8nB,EAAE,GACX3sB,EAAI6E,KAAK8nB,EAAE,GACXjtB,EAAImF,KAAK8nB,EAAE,GACX8c,EAAI5kC,KAAK8nB,EAAE,GACXqC,EAAInqB,KAAK8nB,EAAE,GACXA,EAAI9nB,KAAK8nB,EAAE,GAGf,IADA/M,GAAO/a,KAAKoe,EAAE/kB,SAAWirC,EAAEjrC,QACtBX,EAAI,EAAGA,EAAI4rC,EAAEjrC,OAAQX,IAAK,CAC7B,IAAImsC,EAAKvD,GAAQxZ,EAAGkc,GAAOnpC,GAAI8oC,GAAK9oC,EAAG+pC,EAAGza,GAAInqB,KAAKoe,EAAE1lB,GAAI4rC,EAAE5rC,IACvDosC,EAAK3D,GAAM4C,GAAOv/B,GAAIo/B,GAAMp/B,EAAG9F,EAAGhD,IACtCosB,EAAIqC,EACJA,EAAIya,EACJA,EAAI/pC,EACJA,EAAIsmC,GAAMhmC,EAAG0pC,GACb1pC,EAAIO,EACJA,EAAIgD,EACJA,EAAI8F,EACJA,EAAI28B,GAAM0D,EAAIC,EACf,CAED9kC,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAItjB,GAC7BxE,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIppB,GAC7BsB,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIpsB,GAC7BsE,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAI3sB,GAC7B6E,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIjtB,GAC7BmF,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAI8c,GAC7B5kC,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIqC,GAC7BnqB,KAAK8nB,EAAE,GAAKqZ,GAAMnhC,KAAK8nB,EAAE,GAAIA,EAC/B,EAEA4c,GAAOznC,UAAUymC,QAAU,SAAgB9C,GACzC,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAG,OAEtB6Y,GAAMK,QAAQhhC,KAAK8nB,EAAG,MACjC,ECtGA,IAAI6Y,GAAQzkC,GACRwoC,GAASvoC,GAEb,SAAS4oC,KACP,KAAM/kC,gBAAgB+kC,IACpB,OAAO,IAAIA,GAEbL,GAAO7jC,KAAKb,MACZA,KAAK8nB,EAAI,CACP,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACxC,CACA6Y,GAAM3lB,SAAS+pB,GAAQL,QACvBM,GAAiBD,GAEjBA,GAAOhC,UAAY,IACnBgC,GAAO/B,QAAU,IACjB+B,GAAO9B,aAAe,IACtB8B,GAAO7B,UAAY,GAEnB6B,GAAO9nC,UAAUymC,QAAU,SAAgB9C,GAEzC,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAEjqB,MAAM,EAAG,GAAI,OAElC8iC,GAAMK,QAAQhhC,KAAK8nB,EAAEjqB,MAAM,EAAG,GAAI,MAC7C,EC1BA,IAAI8iC,GAAQzkC,GACRmnC,GAASlnC,GACT4e,GAASob,GAETqM,GAAY7B,GAAM6B,UAClBC,GAAY9B,GAAM8B,UAClBC,GAAW/B,GAAM+B,SACjBC,GAAWhC,GAAMgC,SACjBpB,GAAQZ,GAAMY,MACdI,GAAWhB,GAAMgB,SACjBE,GAAWlB,GAAMkB,SACjBC,GAAanB,GAAMmB,WACnBK,GAAaxB,GAAMwB,WACnBC,GAAazB,GAAMyB,WACnBG,GAAa5B,GAAM4B,WAEnBK,GAAYS,GAAOT,UAEnBqC,GAAW,CACb,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGtC,SAASC,KACP,KAAMllC,gBAAgBklC,IACpB,OAAO,IAAIA,GAEbtC,GAAU/hC,KAAKb,MACfA,KAAK8nB,EAAI,CACP,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACd9nB,KAAKoe,EAAI6mB,GACTjlC,KAAKskC,EAAI,IAAIvqC,MAAM,IACrB,CACA4mC,GAAM3lB,SAASkqB,GAAQtC,QACvBuC,GAAiBD,GAsIjB,SAASE,GAAQC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,IAAIrpB,EAAKipB,EAAKE,GAASF,EAAMI,EAG7B,OAFIrpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASspB,GAAQL,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,GACnC,IAAIvpB,EAAKkpB,EAAKE,GAASF,EAAMK,EAG7B,OAFIvpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASwpB,GAASP,EAAIC,EAAIC,EAAIC,EAAIC,GAChC,IAAIrpB,EAAKipB,EAAKE,EAAOF,EAAKI,EAAOF,EAAKE,EAGtC,OAFIrpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASypB,GAASR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,GACpC,IAAIvpB,EAAKkpB,EAAKE,EAAOF,EAAKK,EAAOH,EAAKG,EAGtC,OAFIvpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS0pB,GAAUT,EAAIC,GACrB,IAIIlpB,EAJQomB,GAAU6C,EAAIC,EAAI,IAClB9C,GAAU8C,EAAID,EAAI,GAClB7C,GAAU8C,EAAID,EAAI,GAK9B,OAFIjpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS2pB,GAAUV,EAAIC,GACrB,IAIIlpB,EAJQqmB,GAAU4C,EAAIC,EAAI,IAClB7C,GAAU6C,EAAID,EAAI,GAClB5C,GAAU6C,EAAID,EAAI,GAK9B,OAFIjpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS4pB,GAAUX,EAAIC,GACrB,IAIIlpB,EAJQomB,GAAU6C,EAAIC,EAAI,IAClB9C,GAAU6C,EAAIC,EAAI,IAClB9C,GAAU8C,EAAID,EAAI,GAK9B,OAFIjpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS6pB,GAAUZ,EAAIC,GACrB,IAIIlpB,EAJQqmB,GAAU4C,EAAIC,EAAI,IAClB7C,GAAU4C,EAAIC,EAAI,IAClB7C,GAAU6C,EAAID,EAAI,GAK9B,OAFIjpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS8pB,GAAUb,EAAIC,GACrB,IAIIlpB,EAJQomB,GAAU6C,EAAIC,EAAI,GAClB9C,GAAU6C,EAAIC,EAAI,GAClB5C,GAAS2C,EAAIC,EAAI,GAK7B,OAFIlpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAAS+pB,GAAUd,EAAIC,GACrB,IAIIlpB,EAJQqmB,GAAU4C,EAAIC,EAAI,GAClB7C,GAAU4C,EAAIC,EAAI,GAClB3C,GAAS0C,EAAIC,EAAI,GAK7B,OAFIlpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASgqB,GAAUf,EAAIC,GACrB,IAIIlpB,EAJQomB,GAAU6C,EAAIC,EAAI,IAClB9C,GAAU8C,EAAID,EAAI,IAClB3C,GAAS2C,EAAIC,EAAI,GAK7B,OAFIlpB,EAAI,IACNA,GAAK,YACAA,CACT,CAEA,SAASiqB,GAAUhB,EAAIC,GACrB,IAIIlpB,EAJQqmB,GAAU4C,EAAIC,EAAI,IAClB7C,GAAU6C,EAAID,EAAI,IAClB1C,GAAS0C,EAAIC,EAAI,GAK7B,OAFIlpB,EAAI,IACNA,GAAK,YACAA,CACT,CAtPA8oB,GAAOnC,UAAY,KACnBmC,GAAOlC,QAAU,IACjBkC,GAAOjC,aAAe,IACtBiC,GAAOhC,UAAY,IAEnBgC,GAAOjoC,UAAUqpC,cAAgB,SAAuB75B,EAAKtS,GAI3D,IAHA,IAAImqC,EAAItkC,KAAKskC,EAGJ5rC,EAAI,EAAGA,EAAI,GAAIA,IACtB4rC,EAAE5rC,GAAK+T,EAAItS,EAAQzB,GACrB,KAAOA,EAAI4rC,EAAEjrC,OAAQX,GAAK,EAAG,CAC3B,IAAI6tC,EAAQH,GAAU9B,EAAE5rC,EAAI,GAAI4rC,EAAE5rC,EAAI,IAClC8tC,EAAQH,GAAU/B,EAAE5rC,EAAI,GAAI4rC,EAAE5rC,EAAI,IAClC+tC,EAAQnC,EAAE5rC,EAAI,IACdguC,EAAQpC,EAAE5rC,EAAI,IACdiuC,EAAQT,GAAU5B,EAAE5rC,EAAI,IAAK4rC,EAAE5rC,EAAI,KACnCkuC,EAAQT,GAAU7B,EAAE5rC,EAAI,IAAK4rC,EAAE5rC,EAAI,KACnCmuC,EAAQvC,EAAE5rC,EAAI,IACdouC,EAAQxC,EAAE5rC,EAAI,IAElB4rC,EAAE5rC,GAAKopC,GACLyE,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,GACTxC,EAAE5rC,EAAI,GAAKypC,GACToE,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACV,CACH,EAEA5B,GAAOjoC,UAAUsmC,QAAU,SAAiB92B,EAAKtS,GAC/C6F,KAAKsmC,cAAc75B,EAAKtS,GAExB,IAAImqC,EAAItkC,KAAKskC,EAET9C,EAAKxhC,KAAK8nB,EAAE,GACZ2Z,EAAKzhC,KAAK8nB,EAAE,GACZ4Z,EAAK1hC,KAAK8nB,EAAE,GACZ8Z,EAAK5hC,KAAK8nB,EAAE,GACZia,EAAK/hC,KAAK8nB,EAAE,GACZka,EAAKhiC,KAAK8nB,EAAE,GACZma,EAAKjiC,KAAK8nB,EAAE,GACZoa,EAAKliC,KAAK8nB,EAAE,GACZua,EAAKriC,KAAK8nB,EAAE,GACZwa,EAAKtiC,KAAK8nB,EAAE,GACZif,EAAK/mC,KAAK8nB,EAAE,IACZkf,EAAKhnC,KAAK8nB,EAAE,IACZmf,EAAKjnC,KAAK8nB,EAAE,IACZof,EAAKlnC,KAAK8nB,EAAE,IACZqf,EAAKnnC,KAAK8nB,EAAE,IACZsf,EAAKpnC,KAAK8nB,EAAE,IAEhB/M,GAAO/a,KAAKoe,EAAE/kB,SAAWirC,EAAEjrC,QAC3B,IAAK,IAAIX,EAAI,EAAGA,EAAI4rC,EAAEjrC,OAAQX,GAAK,EAAG,CACpC,IAAI6tC,EAAQY,EACRX,EAAQY,EACRX,EAAQT,GAAU3D,EAAIC,GACtBoE,EAAQT,GAAU5D,EAAIC,GACtBqE,EAAQvB,GAAQ/C,EAAIC,EAAIyE,EAAIC,EAAIC,GAChCL,EAAQlB,GAAQrD,EAAIC,EAAIyE,EAAIC,EAAIC,EAAIC,GACpCL,EAAQ7mC,KAAKoe,EAAE1lB,GACfouC,EAAQ9mC,KAAKoe,EAAE1lB,EAAI,GACnB2uC,EAAQ/C,EAAE5rC,GACV4uC,EAAQhD,EAAE5rC,EAAI,GAEd6uC,EAAQnF,GACVmE,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPO,EAAOC,GACLE,EAAQjF,GACVgE,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPO,EAAOC,GAETf,EAAQT,GAAUtE,EAAIC,GACtB+E,EAAQT,GAAUvE,EAAIC,GACtBgF,EAAQb,GAASpE,EAAIC,EAAIC,EAAIE,EAAIG,GACjC2E,EAAQb,GAASrE,EAAIC,EAAIC,EAAIE,EAAIG,EAAIC,GAErC,IAAIyF,EAAQ9F,GAAS4E,EAAOC,EAAOC,EAAOC,GACtCgB,EAAQ7F,GAAS0E,EAAOC,EAAOC,EAAOC,GAE1CS,EAAKF,EACLG,EAAKF,EAELD,EAAKF,EACLG,EAAKF,EAELD,EAAK1E,EACL2E,EAAK1E,EAELD,EAAKV,GAASM,EAAIC,EAAIqF,EAAOC,GAC7BlF,EAAKT,GAASK,EAAIA,EAAIqF,EAAOC,GAE7BvF,EAAKF,EACLG,EAAKF,EAELD,EAAKL,EACLM,EAAKJ,EAELF,EAAKF,EACLI,EAAKH,EAELD,EAAKG,GAAS4F,EAAOC,EAAOC,EAAOC,GACnCjG,EAAKI,GAAS0F,EAAOC,EAAOC,EAAOC,EACpC,CAEDnG,GAAMvhC,KAAK8nB,EAAG,EAAG0Z,EAAIC,GACrBF,GAAMvhC,KAAK8nB,EAAG,EAAG4Z,EAAIE,GACrBL,GAAMvhC,KAAK8nB,EAAG,EAAGia,EAAIC,GACrBT,GAAMvhC,KAAK8nB,EAAG,EAAGma,EAAIC,GACrBX,GAAMvhC,KAAK8nB,EAAG,EAAGua,EAAIC,GACrBf,GAAMvhC,KAAK8nB,EAAG,GAAIif,EAAIC,GACtBzF,GAAMvhC,KAAK8nB,EAAG,GAAImf,EAAIC,GACtB3F,GAAMvhC,KAAK8nB,EAAG,GAAIqf,EAAIC,EACxB,EAEAlC,GAAOjoC,UAAUymC,QAAU,SAAgB9C,GACzC,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAG,OAEtB6Y,GAAMK,QAAQhhC,KAAK8nB,EAAG,MACjC,ECnNA,IAAI6Y,GAAQzkC,GAERgpC,GAAS/oC,GAEb,SAASwrC,KACP,KAAM3nC,gBAAgB2nC,IACpB,OAAO,IAAIA,GAEbzC,GAAOrkC,KAAKb,MACZA,KAAK8nB,EAAI,CACP,WAAY,WACZ,WAAY,UACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WAChB,CACA6Y,GAAM3lB,SAAS2sB,GAAQzC,QACvB0C,GAAiBD,GAEjBA,GAAO5E,UAAY,KACnB4E,GAAO3E,QAAU,IACjB2E,GAAO1E,aAAe,IACtB0E,GAAOzE,UAAY,IAEnByE,GAAO1qC,UAAUymC,QAAU,SAAgB9C,GACzC,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAEjqB,MAAM,EAAG,IAAK,OAEnC8iC,GAAMK,QAAQhhC,KAAK8nB,EAAEjqB,MAAM,EAAG,IAAK,MAC9C,EChCYgqC,GAAAC,KAAG5rC,GACD2rC,GAAAE,OAAG5rC,GACH0rC,GAAAG,OAAG7R,GACH0R,GAAAI,OAAGzD,GACjBqD,GAAAK,OAAiBC,aCJbxH,GAAQzkC,GACRmnC,GAASlnC,GAET+kC,GAASP,GAAMO,OACfC,GAAQR,GAAMQ,MACdC,GAAUT,GAAMS,QAChBC,GAAUV,GAAMU,QAChBuB,GAAYS,GAAOT,UAEvB,SAASwF,KACP,KAAMpoC,gBAAgBooC,IACpB,OAAO,IAAIA,GAEbxF,GAAU/hC,KAAKb,MAEfA,KAAK8nB,EAAI,CAAE,WAAY,WAAY,WAAY,UAAY,YAC3D9nB,KAAKwb,OAAS,QAChB,CAyDA,SAASopB,GAAErjC,EAAGkD,EAAGC,EAAGwqB,GAClB,OAAI3tB,GAAK,GACAkD,EAAIC,EAAIwqB,EACR3tB,GAAK,GACJkD,EAAIC,GAAQD,EAAKyqB,EAClB3tB,GAAK,IACJkD,GAAMC,GAAMwqB,EACb3tB,GAAK,GACJkD,EAAIyqB,EAAMxqB,GAAMwqB,EAEjBzqB,GAAKC,GAAMwqB,EACtB,CAEA,SAASmZ,GAAE9mC,GACT,OAAIA,GAAK,GACA,EACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,UACX,CAEA,SAAS+mC,GAAG/mC,GACV,OAAIA,GAAK,GACA,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,CACX,CA7FAo/B,GAAM3lB,SAASotB,GAAWxF,IACT2F,GAAAC,UAAGJ,GAEpBA,GAAUrF,UAAY,IACtBqF,GAAUpF,QAAU,IACpBoF,GAAUnF,aAAe,IACzBmF,GAAUlF,UAAY,GAEtBkF,GAAUnrC,UAAUsmC,QAAU,SAAgB92B,EAAKtS,GAWjD,IAVA,IAAI4vB,EAAI/pB,KAAK8nB,EAAE,GACXkC,EAAIhqB,KAAK8nB,EAAE,GACXmC,EAAIjqB,KAAK8nB,EAAE,GACXoC,EAAIlqB,KAAK8nB,EAAE,GACXvc,EAAIvL,KAAK8nB,EAAE,GACX2gB,EAAK1e,EACL2e,EAAK1e,EACL2e,EAAK1e,EACL2e,EAAK1e,EACL2e,EAAKt9B,EACAhK,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAIunC,EAAI3H,GACND,GACEG,GAAQtX,EAAG6a,GAAErjC,EAAGyoB,EAAGC,EAAGC,GAAIzd,EAAI2P,GAAE7a,GAAKpH,GAAQkuC,GAAE9mC,IAC/CnG,GAAEmG,IACJgK,GACFwe,EAAIxe,EACJA,EAAI2e,EACJA,EAAIgX,GAAOjX,EAAG,IACdA,EAAID,EACJA,EAAI8e,EACJA,EAAI3H,GACFD,GACEG,GAAQoH,EAAI7D,GAAE,GAAKrjC,EAAGmnC,EAAIC,EAAIC,GAAKn8B,EAAIs8B,GAAGxnC,GAAKpH,GAAQmuC,GAAG/mC,IAC1DynC,GAAGznC,IACLsnC,GACFJ,EAAKI,EACLA,EAAKD,EACLA,EAAK1H,GAAOyH,EAAI,IAChBA,EAAKD,EACLA,EAAKI,CACN,CACDA,EAAI1H,GAAQphC,KAAK8nB,EAAE,GAAImC,EAAG2e,GAC1B5oC,KAAK8nB,EAAE,GAAKsZ,GAAQphC,KAAK8nB,EAAE,GAAIoC,EAAG2e,GAClC7oC,KAAK8nB,EAAE,GAAKsZ,GAAQphC,KAAK8nB,EAAE,GAAIvc,EAAGk9B,GAClCzoC,KAAK8nB,EAAE,GAAKsZ,GAAQphC,KAAK8nB,EAAE,GAAIiC,EAAG2e,GAClC1oC,KAAK8nB,EAAE,GAAKsZ,GAAQphC,KAAK8nB,EAAE,GAAIkC,EAAG2e,GAClC3oC,KAAK8nB,EAAE,GAAKghB,CACd,EAEAV,GAAUnrC,UAAUymC,QAAU,SAAgB9C,GAC5C,MAAY,QAARA,EACKD,GAAMG,QAAQ9gC,KAAK8nB,EAAG,UAEtB6Y,GAAMK,QAAQhhC,KAAK8nB,EAAG,SACjC,EAyCA,IAAI1L,GAAI,CACN,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhD2sB,GAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhD3tC,GAAI,CACN,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnD4tC,GAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,IC9IlDrI,GAAQzkC,GACR6e,GAAS5e,GAEb,SAAS8sC,GAAKC,EAAM7Y,EAAKuQ,GACvB,KAAM5gC,gBAAgBipC,IACpB,OAAO,IAAIA,GAAKC,EAAM7Y,EAAKuQ,GAC7B5gC,KAAKmpC,KAAOD,EACZlpC,KAAK+iC,UAAYmG,EAAKnG,UAAY,EAClC/iC,KAAKgjC,QAAUkG,EAAKlG,QAAU,EAC9BhjC,KAAKopC,MAAQ,KACbppC,KAAKqpC,MAAQ,KAEbrpC,KAAK6b,MAAM8kB,GAAM7jB,QAAQuT,EAAKuQ,GAChC,KACA0I,GAAiBL,GAEjBA,GAAKhsC,UAAU4e,MAAQ,SAAcwU,GAE/BA,EAAIh3B,OAAS2G,KAAK+iC,YACpB1S,GAAM,IAAIrwB,KAAKmpC,MAAO7F,OAAOjT,GAAKmT,UACpCzoB,GAAOsV,EAAIh3B,QAAU2G,KAAK+iC,WAG1B,IAAK,IAAIrqC,EAAI23B,EAAIh3B,OAAQX,EAAIsH,KAAK+iC,UAAWrqC,IAC3C23B,EAAI32B,KAAK,GAEX,IAAKhB,EAAI,EAAGA,EAAI23B,EAAIh3B,OAAQX,IAC1B23B,EAAI33B,IAAM,GAIZ,IAHAsH,KAAKopC,OAAQ,IAAIppC,KAAKmpC,MAAO7F,OAAOjT,GAG/B33B,EAAI,EAAGA,EAAI23B,EAAIh3B,OAAQX,IAC1B23B,EAAI33B,IAAM,IACZsH,KAAKqpC,OAAQ,IAAIrpC,KAAKmpC,MAAO7F,OAAOjT,EACtC,EAEA4Y,GAAKhsC,UAAUqmC,OAAS,SAAgB72B,EAAKm0B,GAE3C,OADA5gC,KAAKopC,MAAM9F,OAAO72B,EAAKm0B,GAChB5gC,IACT,EAEAipC,GAAKhsC,UAAUumC,OAAS,SAAgB5C,GAEtC,OADA5gC,KAAKqpC,MAAM/F,OAAOtjC,KAAKopC,MAAM5F,UACtBxjC,KAAKqpC,MAAM7F,OAAO5C,EAC3B,cC9CA,IAAIsI,KAEJA,EAAKvI,MAAQzkC,GACbgtC,EAAK7F,OAASlnC,GACd+sC,EAAKrB,IAAM1R,GACX+S,EAAKX,OAAS/D,GACd0E,EAAKI,KAAOnB,GAGZe,EAAKpB,KAAOoB,EAAKrB,IAAIC,KACrBoB,EAAKlB,OAASkB,EAAKrB,IAAIG,OACvBkB,EAAKnB,OAASmB,EAAKrB,IAAIE,OACvBmB,EAAKjB,OAASiB,EAAKrB,IAAII,OACvBiB,EAAKhB,OAASgB,EAAKrB,IAAIK,OACvBgB,EAAKV,UAAYU,EAAKX,OAAOC,0BCZ7B,IAAIe,IAAyB,EACzBC,IAAgB,EAEpB,MAAMC,GAA0C,CAAEC,MAAO,EAAGpU,QAAW,EAAGvc,KAAM,EAAG4wB,QAAS,EAAG5lC,MAAO,EAAGkZ,IAAK,GAC9G,IAAI2sB,GAAYH,GAAmB,QAI/BI,GAAwB,KA+B5B,MAAMC,GA7BN,WACI,IACI,MAAMC,EAAyB,GAa/B,GAVA,CAAC,MAAO,MAAO,OAAQ,QAAQ7Q,SAAS8Q,IACpC,IACI,GAA+B,SAA3B,OAAOC,UAAUD,GACjB,MAAM,IAAI/vC,MAAM,gBAEvB,CAAC,MAAM8J,GACJgmC,EAAQrwC,KAAKswC,OAIjBD,EAAQ1wC,OACR,MAAM,IAAIY,MAAM,WAAa8vC,EAAQlwC,KAAK,OAG9C,GAAIqH,OAAOoC,aAAa,KAAM2mC,UAAU,SAAW/oC,OAAOoC,aAAa,IAAM,KACzE,MAAM,IAAIrJ,MAAM,wBAEvB,CAAC,MAAO8J,GACL,OAAOA,EAAMkI,QAGjB,OAAO,IACX,CAEwBi+B,GAExB,IAAYC,GASAC,IATZ,SAAYD,GACRA,EAAkB,MAAA,QAClBA,EAAiB,KAAA,OACjBA,EAAoB,QAAA,UACpBA,EAAkB,MAAA,QAClBA,EAAgB,IAAA,KACnB,CAND,CAAYA,KAAAA,GAAQ,CAAA,IASpB,SAAYC,GAMRA,EAA+B,cAAA,gBAG/BA,EAAmC,gBAAA,kBAInCA,EAA+C,sBAAA,wBAI/CA,EAA+B,cAAA,gBAG/BA,EAA6B,aAAA,eAG7BA,EAAmB,QAAA,UAMnBA,EAAiC,eAAA,iBAKjCA,EAA+B,cAAA,gBAQ/BA,EAA2B,YAAA,cAK3BA,EAAqC,iBAAA,mBAKrCA,EAAqC,iBAAA,mBAKrCA,EAA2C,oBAAA,sBAc3CA,EAAiC,eAAA,iBAIjCA,EAAyC,mBAAA,qBAIzCA,EAA+B,cAAA,gBAI/BA,EAAmD,wBAAA,0BAInDA,EAAmD,wBAAA,0BAQnDA,EAA6C,qBAAA,uBAQ7CA,EAAmC,gBAAA,iBACtC,CAxGD,CAAYA,KAAAA,GAAS,CAAA,IA0GrB,MAAMC,GAAM,mBAEN,MAAOC,GAOT3+B,WAAAA,CAAY4+B,GACRxtC,OAAOiH,eAAehE,KAAM,UAAW,CACnCiE,YAAY,EACZxI,MAAO8uC,EACP1+B,UAAU,GAElB,CAEA2+B,IAAAA,CAAKC,EAAoB5S,GACrB,MAAM6S,EAAQD,EAAS3qC,cACC,MAApB2pC,GAAUiB,IACV1qC,KAAK2qC,mBAAmB,yBAA0B,WAAYF,GAE9Db,GAAYH,GAAUiB,IAC1B5mC,QAAQ/H,IAAIwH,MAAMO,QAAS+zB,EAC/B,CAEA6R,KAAAA,IAAS7R,GACL73B,KAAKwqC,KAAKF,GAAOM,OAAOC,MAAOhT,EACnC,CAEA9e,IAAAA,IAAQ8e,GACJ73B,KAAKwqC,KAAKF,GAAOM,OAAOE,KAAMjT,EAClC,CAEAkT,IAAAA,IAAQlT,GACJ73B,KAAKwqC,KAAKF,GAAOM,OAAOI,QAASnT,EACrC,CAEAoT,SAAAA,CAAUh/B,EAAiBjS,EAAkBkxC,GAEzC,GAAI1B,GACA,OAAOxpC,KAAKirC,UAAU,iBAAkBjxC,EAAM,CAAG,GAGhDA,IAAQA,EAAOswC,GAAOh/B,OAAO6/B,eAC7BD,IAAUA,EAAS,CAAA,GAExB,MAAME,EAAgC,GACtCruC,OAAOwd,KAAK2wB,GAAQhS,SAAS7I,IACzB,MAAM50B,EAAQyvC,EAAO7a,GACrB,IACI,GAAI50B,aAAiB3B,WAAY,CAC7B,IAAI4c,EAAM,GACV,IAAK,IAAIhe,EAAI,EAAGA,EAAI+C,EAAMpC,OAAQX,IAChCge,GAAO2zB,GAAI5uC,EAAM/C,IAAM,GACvBge,GAAO2zB,GAAe,GAAX5uC,EAAM/C,IAEnB0yC,EAAe1xC,KAAK22B,EAAM,iBAAmB3Z,EAAM,UAEnD00B,EAAe1xC,KAAK22B,EAAM,IAAMgb,KAAKC,UAAU7vC,GAEtD,CAAC,MAAOsI,GACLqnC,EAAe1xC,KAAK22B,EAAM,IAAMgb,KAAKC,UAAUJ,EAAO7a,GAAK7wB,iBAGnE4rC,EAAe1xC,KAAK,QAASM,KAC7BoxC,EAAe1xC,KAAK,WAAYsG,KAAKuqC,WAErC,MAAMgB,EAASt/B,EAEf,IAAIu/B,EAAM,GAEV,OAAQxxC,GACJ,KAAKowC,GAAUqB,cAAe,CAC1BD,EAAM,gBACN,MAAME,EAAQz/B,EAEd,OAAQy/B,GACJ,IAAK,WAAY,IAAK,YAAa,IAAK,mBACpCF,GAAO,IAAME,EACb,MACJ,IAAK,iBAAkB,IAAK,iBACxBF,GAAO,eACP,MACJ,IAAK,yBACDA,GAAO,kBAGf,MAEJ,KAAKpB,GAAUuB,eACf,KAAKvB,GAAUwB,mBACf,KAAKxB,GAAUyB,YACf,KAAKzB,GAAU0B,cACf,KAAK1B,GAAU2B,wBACf,KAAK3B,GAAU4B,qBACf,KAAK5B,GAAU6B,wBACXT,EAAMxxC,EAIVwxC,IACAv/B,GAAW,8CAAiDu/B,EAAM,MAGlEJ,EAAe/xC,SACf4S,GAAW,KAAOm/B,EAAevxC,KAAK,MAAQ,KAIlD,MAAMkK,EAAa,IAAI9J,MAAMgS,GAQ7B,OAPAlI,EAAMwnC,OAASA,EACfxnC,EAAM/J,KAAOA,EAEb+C,OAAOwd,KAAK2wB,GAAQhS,SAAQ,SAAS7I,GACjCtsB,EAAMssB,GAAO6a,EAAO7a,EACxB,IAEOtsB,CACX,CAEAmoC,UAAAA,CAAWjgC,EAAiBjS,EAAkBkxC,GAC1C,MAAMlrC,KAAKirC,UAAUh/B,EAASjS,EAAMkxC,EACxC,CAEAP,kBAAAA,CAAmB1+B,EAAiBF,EAActQ,GAC9C,OAAOuE,KAAKksC,WAAWjgC,EAASq+B,GAAOh/B,OAAO6gC,iBAAkB,CAC5DC,SAAUrgC,EACVtQ,MAAOA,GAEf,CAEAsf,MAAAA,CAAOsxB,EAAgBpgC,EAAiBjS,EAAkBkxC,GAChDmB,GACNrsC,KAAKksC,WAAWjgC,EAASjS,EAAMkxC,EACnC,CAEAoB,cAAAA,CAAeD,EAAgBpgC,EAAiBF,EAActQ,GACpD4wC,GACNrsC,KAAK2qC,mBAAmB1+B,EAASF,EAAMtQ,EAC3C,CAEA8wC,cAAAA,CAAetgC,GAEP69B,IACA9pC,KAAKksC,WAAW,8CAA+C5B,GAAOh/B,OAAOkhC,sBAAuB,CAChGC,UAAW,6BAA8BzC,KAAMF,IAG3D,CAEA4C,eAAAA,CAAgBjxC,EAAewQ,GACL,iBAAXxQ,IAEI,MAAXwQ,IAAmBA,EAAU,mBAE7BxQ,EAAQ,GAAKA,GAAS,mBACtBuE,KAAKksC,WAAWjgC,EAASq+B,GAAOh/B,OAAOmgC,cAAe,CAClDgB,UAAW,mBACXf,MAAO,oBACPjwC,MAAOA,IAIXA,EAAQ,GACRuE,KAAKksC,WAAWjgC,EAASq+B,GAAOh/B,OAAOmgC,cAAe,CAClDgB,UAAW,mBACXf,MAAO,cACPjwC,MAAOA,IAGnB,CAEAkxC,kBAAAA,CAAmB16B,EAAe26B,EAAuB3gC,GAEjDA,EADAA,EACU,KAAOA,EAEP,GAGVgG,EAAQ26B,GACR5sC,KAAKksC,WAAW,mBAAqBjgC,EAASq+B,GAAOh/B,OAAOuhC,iBAAkB,CAC1E56B,MAAOA,EACP26B,cAAeA,IAInB36B,EAAQ26B,GACR5sC,KAAKksC,WAAW,qBAAuBjgC,EAASq+B,GAAOh/B,OAAOwhC,oBAAqB,CAC/E76B,MAAOA,EACP26B,cAAeA,GAG3B,CAEAG,QAAAA,CAASvnC,EAAayzB,GACdzzB,IAAWzI,QAAoB,MAAVyI,GACrBxF,KAAKksC,WAAW,cAAe5B,GAAOh/B,OAAOugC,YAAa,CAAE9/B,KAAMktB,EAAKltB,MAE/E,CAEAihC,aAAAA,CAAcxnC,EAAayzB,GACnBzzB,IAAWyzB,EACXj5B,KAAKksC,WACD,qCAAuCb,KAAKC,UAAUrS,EAAKltB,MAAQ,6BACnEu+B,GAAOh/B,OAAOkhC,sBACd,CAAEzgC,KAAMvG,EAAOuG,KAAM0gC,UAAW,QAE7BjnC,IAAWzI,QAAoB,MAAVyI,GAC5BxF,KAAKksC,WAAW,cAAe5B,GAAOh/B,OAAOugC,YAAa,CAAE9/B,KAAMktB,EAAKltB,MAE/E,CAEA,mBAAOkhC,GAEH,OADKpD,KAAiBA,GAAgB,IAAIS,GCpX3B,iBDqXRT,EACX,CAEA,oBAAOqD,CAAcC,EAAqBC,GAOtC,IANKD,GAAcC,GACfptC,KAAKitC,eAAef,WAAW,wCAAyC5B,GAAOh/B,OAAOkhC,sBAAuB,CACzGC,UAAW,kBAIflD,GAAwB,CACxB,IAAK4D,EAAc,OACnBntC,KAAKitC,eAAef,WAAW,6BAA8B5B,GAAOh/B,OAAOkhC,sBAAuB,CAC9FC,UAAW,kBAInBjD,KAAkB2D,EAClB5D,KAA2B6D,CAC/B,CAEA,kBAAOC,CAAY5C,GACf,MAAMC,EAAQjB,GAAUgB,EAAS3qC,eACpB,MAAT4qC,EAIJd,GAAYc,EAHRJ,GAAO2C,eAAelC,KAAK,uBAAyBN,EAI5D,CAEA,WAAOntC,CAAKitC,GACR,OAAO,IAAID,GAAOC,EACtB,EAlPOD,GAAAh/B,OAAS8+B,GAETE,GAAAM,OAAST,GErKb,MCIDmD,GAAS,IAAIhD,GDJI,eC4DvB,SAASiD,GAAShuC,GACd,OAAIA,EAAM1B,QAEV0B,EAAM1B,MAAQ,WACV,MAAMg6B,EAAO99B,MAAMkD,UAAUY,MAAMgD,KAAKnB,WACxC,OAAO6tC,GAAS,IAAIzzC,WAAWC,MAAMkD,UAAUY,MAAM0F,MAAMhE,EAAOs4B,OAJ5Ct4B,CAQ9B,CAMA,SAASoN,GAAUlR,GACf,MAA0B,iBAAXA,GAAuBA,GAASA,GAAUA,EAAQ,GAAO,CAC5E,CAiBM,SAAU+xC,GAAS/xC,EAAqCq3B,GAG1D,GAFKA,IAAWA,EAAU,CAAA,GAEJ,iBAAXr3B,EAAqB,CAC5B6xC,GAAOZ,gBAAgBjxC,EAAO,0BAE9B,MAAM04B,EAAS,GACf,KAAO14B,GACH04B,EAAO7B,QAAgB,IAAR72B,GACfA,EAAQoG,SAASX,OAAOzF,EAAQ,MAIpC,OAFsB,IAAlB04B,EAAO96B,QAAgB86B,EAAOz6B,KAAK,GAEhC6zC,GAAS,IAAIzzC,WAAWq6B,IASnC,GANIrB,EAAQ2a,oBAAwC,iBAAXhyC,GAAiD,OAA1BA,EAAMiyC,UAAU,EAAG,KAC9EjyC,EAAQ,KAAOA,GAvDxB,SAAmBA,GACf,QAAUA,EAAMkyC,WACpB,CAwDQC,CAAUnyC,KAAUA,EAAQA,EAAMkyC,eAyEpC,SAAsBlyC,EAAYpC,GACpC,GAAsB,iBAAXoC,IAAwBA,EAAMoyC,MAAM,oBAC3C,OAAO,EAEX,GAAIx0C,GAAUoC,EAAMpC,SAAW,EAAI,EAAIA,EAAU,OAAO,EACxD,OAAO,CACX,CA7EQy0C,CAAYryC,GAAQ,CACpB,IAAIib,EAAejb,EAAOiyC,UAAU,GAChCh3B,EAAIrd,OAAS,IACU,SAAnBy5B,EAAQib,OACRr3B,EAAM,IAAMA,EACc,UAAnBoc,EAAQib,OACfr3B,GAAO,IAEP42B,GAAO3C,mBAAmB,yBAA0B,QAASlvC,IAIrE,MAAM04B,EAAS,GACf,IAAK,IAAIz7B,EAAI,EAAGA,EAAIge,EAAIrd,OAAQX,GAAK,EACjCy7B,EAAOz6B,KAAKmI,SAAS6U,EAAIg3B,UAAUh1C,EAAGA,EAAI,GAAI,KAGlD,OAAO60C,GAAS,IAAIzzC,WAAWq6B,IAGnC,OAzDE,SAAkB14B,GACpB,GAAa,MAATA,EAAiB,OAAO,EAE5B,GAAIA,EAAMkQ,cAAgB7R,WAAc,OAAO,EAC/C,GAAsB,iBAAX2B,EAAuB,OAAO,EACzC,IAAKkR,GAAUlR,EAAMpC,SAAWoC,EAAMpC,OAAS,EAAK,OAAO,EAE3D,IAAK,IAAIX,EAAI,EAAGA,EAAI+C,EAAMpC,OAAQX,IAAK,CACnC,MAAM4Z,EAAI7W,EAAM/C,GAChB,IAAKiU,GAAU2F,IAAMA,EAAI,GAAKA,GAAK,IAAO,OAAO,EAErD,OAAO,CACX,CA6CQ07B,CAAQvyC,GACD8xC,GAAS,IAAIzzC,WAAW2B,IAG5B6xC,GAAO3C,mBAAmB,yBAA0B,QAASlvC,EACxE,CC5HM,SAAUusC,GAAO9oC,GACnB,MAAO,KAAQgqC,GAAKlB,SAAS1E,OAAOkK,GAAStuC,IAAOskC,OAAO,MAC/D,CARe,IAAI8G,GCXI,oBCKV2D,GAAkB,IAAIzgC,EAASA,UAC1C,+CAMW0gC,GAAc,mBAKdC,GAAsB,IAAI3gC,EAASA,UAC9C,gDAMW4gC,GAAsB,IAAI5gC,EAASA,UAC9C,+CAMW6gC,GAAsB,IAAI7gC,EAASA,UAC9C,gDAMW8gC,GAAmB,IAAI9gC,EAASA,UAC3C,gDAMW+gC,GAAuB,IAAI/gC,EAASA,UAC/C,gDAMWghC,GAAiC,IAAIhhC,EAASA,UACzD,gDAMWihC,GAAmC,IAAIjhC,EAASA,UAC3D,gDAQWkhC,GAAmB,IAAIlhC,EAASA,UAC3C,gDAGWmhC,GAAY,IAAInhC,EAASA,UACpC,gDAGWohC,GAAyB,CACpC,IAAIphC,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,gDACd,IAAIA,EAAAA,UAAU,iDAGHqhC,GAAkB,IAAInV,IAAoB,CACrD,CAAC,+CAAgD,QACjD,CAAC,+CAAgD,QACjD,CAAC,8CAA+C,OAChD,CAAC,+CAAgD,QACjD,CAAC,+CAAgD,OACjD,CAAC,+CAAgD,OACjD,CAAC,+CAAgD,OACjD,CAAC,8CAA+C,QAChD,CAAC,+CAAgD,QACjD,CAAC,+CAAgD,SAGtCoV,GAAmB,IAAIthC,EAASA,UAC3C,gDAGWuhC,GAAc,IAAIvhC,EAASA,UACtC,gDAGWwhC,GAAgB,IAAIxhC,EAASA,UACxC,gDAGWyhC,GAA6B,IAAIzhC,EAASA,UACrD,gDAGW0hC,GAAc,IAAI1hC,EAAAA,UAC7B,+CCpGKiL,eAAe02B,GACpBx2B,EACAmiB,GAGA,UAD0BniB,EAAWiB,eAAekhB,GAElD,MAAM,IAAIpL,GAASD,kBAAUiQ,qBAE/B,OAAOF,GAAkBrB,SAASxlB,EAAYmiB,EAChD,CAKOriB,eAAe22B,GAAcrjC,GAClC,MAAMS,EAAQ0hC,GAAcniC,EACtB7J,EAAM8lC,GAAOzrC,EAAAA,OAAOe,KAAKkP,EAAO,SAAS3O,MAAM,GACrD,OAAOtB,SAAOe,KAAK4E,EAAK,MAC1B,CAKOuW,eAAe42B,GACpBhV,EACAiV,EACA7U,GAEA,MAAM8U,EAAQ,CAAClV,GACXiV,EACFC,EAAM71C,KAAK41C,EAAU73B,YAErB83B,EAAM71C,KAAK6C,EAAAA,OAAOE,MAAM,KAEtBg+B,EACF8U,EAAM71C,KAAK+gC,EAAWhjB,YAEtB83B,EAAM71C,KAAK6C,EAAAA,OAAOE,MAAM,KAE1B,MAAOq+B,SAAwBttB,EAAAA,UAAU8wB,mBACvCiR,EACAtB,IAEF,OAAOnT,CACT,CAiEA,MAAM0U,GAAU/2B,MACd1M,EACA0jC,EAAoBtB,MAEpB,IAAIuB,QAAeN,GAAcrjC,GAEjC,MAAO,CAAEyO,aADU60B,GAAkBK,OAAQ5wC,EAAW2wC,GACvCC,SAAQ,EAUdC,GAAel3B,MAAOmlB,EAAgBoB,GAAS,KACtDpB,EAAOgS,SAAS,UAClBhS,EAASA,EAAO//B,MAAM,GAAI,IAE5B,MAAMgyC,EAAWjS,EAAO9wB,MAAM,KAC9B,GAAwB,IAApB+iC,EAASx2C,OAAc,CACzB,MACMkR,EADShO,SAAOe,KAAK,CAAC0hC,EAAS,EAAI,IAAIx/B,WAC1BmF,OAAOkrC,EAAS,KAC3Br1B,OAAQs1B,SAAoBN,GAAQK,EAAS,IAErD,MAAO,UADcL,GAAQjlC,EAAKulC,GACdC,OAAO,EAAMN,OAAQK,EAC1C,CAAM,GAAwB,IAApBD,EAASx2C,QAAgB2lC,EAAQ,CAE1C,MAAQxkB,OAAQs1B,SAAoBN,GAAQK,EAAS,KAE7Cr1B,OAAQw1B,SAAiBR,GAC/B,KAAK7qC,OAAOkrC,EAAS,IACrBC,GAGIG,EAAe1zC,EAAAA,OAAOe,KAAK,CAAC,IAAIkC,WAEtC,MAAO,UADcgwC,GAAQS,EAAatrC,OAAOkrC,EAAS,IAAKG,GAC3CD,OAAO,EAAMN,OAAQK,EAAWI,aAAa,EAClE,CAAM,GAAIL,EAASx2C,QAAU,EAC5B,MAAM,IAAIq2B,GAASD,kBAAU0gB,cAG/B,MAAO,UADcX,GAAQ5R,EAAQuQ,IACjB4B,OAAO,EAAON,YAAQ3wC,EAAW,kBCvKvD/B,OAAOiH,eAAeosC,GAAS,aAAc,CAAE30C,OAAO,IACtD20C,GAAAnoC,gBAA0BmoC,GAAArnC,oBAAyB,EAEnD,IAAIwD,GAA2B,WAAc,OAAO,IAAItS,MAAM,iDAAkD,EAE5GqS,GAAuB,SAAUP,EAAMskC,EAAU1yC,GACjD,OAAO,IAAI1D,MAAM,QAAW8R,EAAO,8BAAiCskC,EAAW,cAAgB1yC,EACnG,EAEIyO,GAAmB,SAAUlK,EAAKiK,EAAOO,GACzC,OAAO,IAAIzS,MAAM,iBAAoBiI,EAAM,gCAAkCiK,EAAQ,cAAgBO,EACzG,EAEA,SAASvE,GAAe1M,EAAOsQ,GAC3B,GAAqB,iBAAVtQ,EACP,MAAM6Q,GAAqBP,EAAM,SAAUtQ,EACnD,CAEA,SAAS6M,GAAY7M,EAAOpC,GACxB,GAAIkC,KAAKO,MAAML,KAAWA,EAEtB,MADA0M,GAAe1M,EAAO,UAChB2Q,GAAiB,SAAU,aAAc3Q,GAEnD,GAAIpC,EAAS,EACT,MAAMkT,KACV,MAAMH,GAAiB,SAAU,eAAiB/S,EAAQoC,EAC9D,CAcsB20C,GAAArnC,eAZtB,SAAwBvO,EAAQC,QACb,IAAXA,IAAqBA,EAAS,GAClC0N,GAAe1N,EAAQ,UACvB,IAAI2N,EAAQ5N,EAAOC,GACf4N,EAAO7N,EAAOC,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACvBC,GAAY7N,EAAQD,EAAOnB,OAAS,GAExC,IAAIqH,EAAMlG,EAAOC,EAAS,GAAKD,EAAOC,EAAS,GAAKc,KAAKC,IAAI,EAAG,GAAKhB,EAAOC,EAAS,GAAKc,KAAKC,IAAI,EAAG,KAAO6M,GAAQ,IACrH,OAAS3B,OAAOhG,IAAQgG,OAAO,KAC3BA,OAAO0B,EAAQ5N,IAASC,GAAUc,KAAKC,IAAI,EAAG,GAAKhB,IAASC,GAAUc,KAAKC,IAAI,EAAG,IAAMhB,IAASC,GAAUc,KAAKC,IAAI,EAAG,IAC/H,EAcA40C,GAAAnoC,gBAXA,SAAyBzN,EAAQC,QACd,IAAXA,IAAqBA,EAAS,GAClC0N,GAAe1N,EAAQ,UACvB,IAAI2N,EAAQ5N,EAAOC,GACf4N,EAAO7N,EAAOC,EAAS,QACbqE,IAAVsJ,QAAgCtJ,IAATuJ,GACvBC,GAAY7N,EAAQD,EAAOnB,OAAS,GACxC,IAAIoJ,EAAK2F,EAAQ5N,IAASC,GAAUc,KAAKC,IAAI,EAAG,GAAKhB,IAASC,GAAUc,KAAKC,IAAI,EAAG,IAAMhB,IAASC,GAAUc,KAAKC,IAAI,EAAG,IACrHgH,EAAKhI,IAASC,GAAUD,IAASC,GAAUc,KAAKC,IAAI,EAAG,GAAKhB,IAASC,GAAUc,KAAKC,IAAI,EAAG,IAAM6M,EAAO9M,KAAKC,IAAI,EAAG,IACxH,OAAOkL,OAAOjE,IAAOiE,OAAOlE,IAAOkE,OAAO,IAC9C,kDCpDA,IAAI4pC,EAAYtwC,GAAQA,EAAKswC,UAAa,WAStC,OARAA,EAAWvzC,OAAO6S,QAAU,SAAS4P,GACjC,IAAK,IAAIpkB,EAAG1C,EAAI,EAAG8H,EAAId,UAAUrG,OAAQX,EAAI8H,EAAG9H,IAE5C,IAAK,IAAIkxB,KADTxuB,EAAIsE,UAAUhH,GACOqE,OAAOE,UAAUkT,eAAetP,KAAKzF,EAAGwuB,KACzDpK,EAAEoK,GAAKxuB,EAAEwuB,IAEjB,OAAOpK,GAEJ8wB,EAAS/sC,MAAMvD,KAAMN,YAE5B6wC,EAAavwC,GAAQA,EAAKuwC,WAAc,SAAUC,EAASC,EAAYC,EAAGC,GAE1E,OAAO,IAAKD,IAAMA,EAAIrR,WAAU,SAAUuR,EAASC,GAC/C,SAASC,EAAUr1C,GAAS,IAAMs1C,EAAKJ,EAAU9hB,KAAKpzB,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC3F,SAASm2C,EAASv1C,GAAS,IAAMs1C,EAAKJ,EAAiB,MAAEl1C,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC9F,SAASk2C,EAAK5c,GAJlB,IAAe14B,EAIa04B,EAAO8c,KAAOL,EAAQzc,EAAO14B,QAJ1CA,EAIyD04B,EAAO14B,MAJhDA,aAAiBi1C,EAAIj1C,EAAQ,IAAIi1C,GAAE,SAAUE,GAAWA,EAAQn1C,EAAO,KAIhBy1C,KAAKJ,EAAWE,EAAY,CAC9GD,GAAMJ,EAAYA,EAAUptC,MAAMitC,EAASC,GAAc,KAAK5hB,OACtE,KAEIsiB,EAAenxC,GAAQA,EAAKmxC,aAAgB,SAAUX,EAASY,GAC/D,IAAsGxM,EAAGlgC,EAAG8a,EAAG2K,EAA3GknB,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAP/xB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAK,EAAEgyB,KAAM,GAAIC,IAAK,IAChG,OAAOtnB,EAAI,CAAE0E,KAAM6iB,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXr1C,SAA0B8tB,EAAE9tB,OAAOw1C,UAAY,WAAa,OAAO7xC,IAAO,GAAGmqB,EACvJ,SAASunB,EAAKlxC,GAAK,OAAO,SAAU8R,GAAK,OACzC,SAAcw/B,GACV,GAAIlN,EAAG,MAAM,IAAIxnC,UAAU,mCAC3B,KAAOi0C,OACH,GAAIzM,EAAI,EAAGlgC,IAAM8a,EAAY,EAARsyB,EAAG,GAASptC,EAAU,OAAIotC,EAAG,GAAKptC,EAAS,SAAO8a,EAAI9a,EAAU,SAAM8a,EAAE3e,KAAK6D,GAAI,GAAKA,EAAEmqB,SAAWrP,EAAIA,EAAE3e,KAAK6D,EAAGotC,EAAG,KAAKb,KAAM,OAAOzxB,EAE3J,OADI9a,EAAI,EAAG8a,IAAGsyB,EAAK,CAAS,EAARA,EAAG,GAAQtyB,EAAE/jB,QACzBq2C,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtyB,EAAIsyB,EAAI,MACxB,KAAK,EAAc,OAAXT,EAAEC,QAAgB,CAAE71C,MAAOq2C,EAAG,GAAIb,MAAM,GAChD,KAAK,EAAGI,EAAEC,QAAS5sC,EAAIotC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKT,EAAEI,IAAIlf,MAAO8e,EAAEG,KAAKjf,MAAO,SACxC,QACI,KAAM/S,EAAI6xB,EAAEG,MAAMhyB,EAAIA,EAAEnmB,OAAS,GAAKmmB,EAAEA,EAAEnmB,OAAS,KAAkB,IAAVy4C,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAET,EAAI,EAAG,QAAW,CAC5G,GAAc,IAAVS,EAAG,MAActyB,GAAMsyB,EAAG,GAAKtyB,EAAE,IAAMsyB,EAAG,GAAKtyB,EAAE,IAAM,CAAE6xB,EAAEC,MAAQQ,EAAG,GAAI,KAAQ,CACtF,GAAc,IAAVA,EAAG,IAAYT,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAIA,EAAIsyB,EAAI,KAAQ,CACrE,GAAItyB,GAAK6xB,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAI6xB,EAAEI,IAAI/3C,KAAKo4C,GAAK,KAAQ,CAC/DtyB,EAAE,IAAI6xB,EAAEI,IAAIlf,MAChB8e,EAAEG,KAAKjf,MAAO,SAEtBuf,EAAKV,EAAKvwC,KAAK2vC,EAASa,EAC3B,CAAC,MAAOx2C,GAAKi3C,EAAK,CAAC,EAAGj3C,GAAI6J,EAAI,CAAE,CAAW,QAAEkgC,EAAIplB,EAAI,CAAI,CAC1D,GAAY,EAARsyB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEr2C,MAAOq2C,EAAG,GAAKA,EAAG,QAAK,EAAQb,MAAM,EAC7E,CAtB+CF,CAAK,CAACvwC,EAAG8R,IAAS,GAwBtEvV,OAAOiH,eAAe+tC,GAAS,aAAc,CAAEt2C,OAAO,IAChCs2C,GAAAC,oBAAG,EACzB,IAAIC,EAAU/1C,KAMV81C,EAAgC,WAIhC,SAASA,EAAer5B,EAAYu5B,EAAgBr5B,EAAYs5B,QACzC,IAAft5B,IAAyBA,EAAa,aAC1C7Y,KAAKoyC,2BAA6B,GAClCpyC,KAAKqyC,mCAAqC,GAC1CryC,KAAKsyC,UAAY,GACjBtyC,KAAK2Y,WAAaA,EAClB3Y,KAAKkyC,eAAiBA,EACtBlyC,KAAK6Y,WAAaA,EAClB7Y,KAAKmyC,QAAUA,CAClB,CAyHD,OAxHAH,EAAe/0C,UAAUs1C,qBAAuB,SAAUliB,EAAKwO,EAAS2T,GACpE,IAAIC,EAAcR,EAAQS,iBAAiB7T,EAAQ3/B,MACnDc,KAAKoyC,2BAA2B/hB,EAAI7wB,YAAc,CAC9C6wB,IAAKA,EACLmiB,KAAMA,EACNpU,YAAakS,EAASA,EAAS,CAAE,EAAEzR,GAAU,CAAE3/B,KAAMuzC,KAErDA,EAAYE,kBACZ3yC,KAAKqyC,mCAAmCI,EAAYE,gBAAgBnzC,YAAc6wB,EAAI7wB,aAG9FwyC,EAAe/0C,UAAU21C,mBAAqB,SAAUviB,EAAKwO,EAAS2T,GAClE,IAAIK,EAAgB7yC,KAAKoyC,2BAA2BpyC,KAAKqyC,mCAAmChiB,EAAI7wB,aAChG,QAAsBV,IAAlB+zC,EAGA,MAAM,IAAI54C,MAAM,gHAQpB,IANA,IAAI64C,EAAYb,EAAQc,eAAelU,EAAQ3/B,KAAMszC,GACjDQ,EAAc,CACd3iB,IAAKA,EACLmiB,KAAMA,EACNpU,YAAakS,EAASA,EAAS,CAAE,EAAEzR,GAAU,CAAE3/B,KAAM4zC,KAEhDG,EAAK,EAAGtT,EAAK3/B,KAAKsyC,UAAWW,EAAKtT,EAAGtmC,OAAQ45C,IAAM,EAExDC,EADevT,EAAGsT,IACTJ,EAAeG,EAC3B,GAELhB,EAAe/0C,UAAUk2C,cAAgB,SAAU9iB,EAAKwO,EAASuU,EAAaZ,GAC1E,IAAIj3B,EAAO02B,EAAQoB,cAAcxU,EAAQ3/B,MAEzC,GAAIqc,EACA,OAAQA,EAAKvc,MACT,KAAKizC,EAAQj6B,YAAYs7B,QAErB,MACJ,KAAKrB,EAAQj6B,YAAYu7B,QACrBvzC,KAAKuyC,qBAAqBliB,EAAKwO,EAAS2T,GACxC,MACJ,KAAKP,EAAQj6B,YAAYw7B,MAChBJ,GACDpzC,KAAK4yC,mBAAmBviB,EAAKwO,EAAS2T,GAE1C,MACJ,KAAKP,EAAQj6B,YAAYy7B,KACzB,KAAKxB,EAAQj6B,YAAY07B,WACrB,MACJ,QACI,MAAM,IAAIz5C,MAAM,yBAA2BshB,EAAKvc,KAAO,kCAOvEgzC,EAAe/0C,UAAU9C,MAAQ,WAC7B,OAAOo2C,EAAUvwC,UAAM,OAAQ,GAAQ,WACnC,IAAI2zC,EAAaC,EAAUC,EAAaZ,EAAIa,EAAqBC,EAAUC,EAASC,EAAQtU,EAAIuU,EAAYrV,EACxGsV,EAAQn0C,KACZ,OAAOmxC,EAAYnxC,MAAM,SAAUo0C,GAC/B,OAAQA,EAAG9C,OACP,KAAK,EAAG,MAAO,CAAC,EAAajS,QAAQC,IAAI,CACjCt/B,KAAK2Y,WAAWimB,mBAAmB5+B,KAAKkyC,eAAgBlyC,KAAK6Y,YAC7D7Y,KAAK2Y,WAAW07B,QAAQr0C,KAAK6Y,eAErC,KAAK,EAMD,IALA86B,EAAcS,EAAG7C,OACjBqC,EAAWD,EAAY,GACvBE,EAAcF,EAAY,GAGrBV,EAAK,EAAGa,EAAaF,EAAUX,EAAKa,EAAWz6C,OAAQ45C,IACxDpU,EAAUiV,EAAWb,GACrBjzC,KAAKmzC,cAActU,EAAQrkB,OAAQqkB,EAAQA,SAAS,EAAMgV,GAE9D,GAAI7zC,KAAKmyC,QASL,IARA4B,EAAW/zC,KAAKmyC,QAAQliB,KAAI,SAAUqkB,GAAQ,OAAOA,EAAK90C,UAAW,IACrEo0C,EAAWA,EAASrU,QAAO,SAAU+U,GAAQ,OAAOP,EAASluC,SAASyuC,EAAK95B,OAAOhb,WAAc,IAChGw0C,EAAU,SAAUnV,GAChBoV,EAAOt7B,WAAW47B,gBAAgB1V,EAAQrkB,QAAQ,SAAU4jB,EAAaoW,GACrEL,EAAMhB,cAActU,EAAQrkB,OAAQ4jB,GAAa,EAAOoW,EAAQhC,KACpG,GAAmCyB,EAAOp7B,aAEdo7B,EAASj0C,KACJ2/B,EAAK,EAAGuU,EAAaN,EAAUjU,EAAKuU,EAAW76C,OAAQsmC,IACxDd,EAAUqV,EAAWvU,GACrBqU,EAAQnV,QAIZ7+B,KAAK2Y,WAAW87B,uBAAuBz0C,KAAKkyC,gBAAgB,SAAUwC,EAAkBF,GACpFL,EAAMhB,cAAcuB,EAAiBC,UAAWD,EAAiBtW,aAAa,EAAOoW,EAAQhC,KAC7H,GAA+BxyC,KAAK6Y,YAEZ,MAAO,CAAC,GAEhC,GACA,KAGIm5B,EAAe/0C,UAAU23C,cAAgB,SAAU1B,GAC/ClzC,KAAKsyC,UAAU54C,MAAK,SAAUm7C,EAASC,GAAS,OAAO5B,EAAS2B,EAAQzW,YAAYl/B,KAAK21C,QAASC,EAAM1W,YAAYl/B,KAAM,KAG9H8yC,EAAe/0C,UAAU83C,qBAAuB,SAAU7B,GACtDlzC,KAAKsyC,UAAU54C,KAAKw5C,IAGxBlB,EAAe/0C,UAAU+3C,KAAO,WAC5B,OAAOzE,EAAUvwC,UAAM,OAAQ,GAAQ,WACnC,OAAOmxC,EAAYnxC,MAAM,SAAU2/B,GAK/B,OADA3/B,KAAKsyC,UAAY,GACV,CAAC,EACxB,GACA,KAEWN,CACX,CAvIoC,UAwIpCD,GAAAC,eAAyBA,qDC/LzB,IAAIzB,EAAavwC,GAAQA,EAAKuwC,WAAc,SAAUC,EAASC,EAAYC,EAAGC,GAE1E,OAAO,IAAKD,IAAMA,EAAIrR,WAAU,SAAUuR,EAASC,GAC/C,SAASC,EAAUr1C,GAAS,IAAMs1C,EAAKJ,EAAU9hB,KAAKpzB,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC3F,SAASm2C,EAASv1C,GAAS,IAAMs1C,EAAKJ,EAAiB,MAAEl1C,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC9F,SAASk2C,EAAK5c,GAJlB,IAAe14B,EAIa04B,EAAO8c,KAAOL,EAAQzc,EAAO14B,QAJ1CA,EAIyD04B,EAAO14B,MAJhDA,aAAiBi1C,EAAIj1C,EAAQ,IAAIi1C,GAAE,SAAUE,GAAWA,EAAQn1C,EAAO,KAIhBy1C,KAAKJ,EAAWE,EAAY,CAC9GD,GAAMJ,EAAYA,EAAUptC,MAAMitC,EAASC,GAAc,KAAK5hB,OACtE,KAEIsiB,EAAenxC,GAAQA,EAAKmxC,aAAgB,SAAUX,EAASY,GAC/D,IAAsGxM,EAAGlgC,EAAG8a,EAAG2K,EAA3GknB,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAP/xB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAK,EAAEgyB,KAAM,GAAIC,IAAK,IAChG,OAAOtnB,EAAI,CAAE0E,KAAM6iB,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXr1C,SAA0B8tB,EAAE9tB,OAAOw1C,UAAY,WAAa,OAAO7xC,IAAO,GAAGmqB,EACvJ,SAASunB,EAAKlxC,GAAK,OAAO,SAAU8R,GAAK,OACzC,SAAcw/B,GACV,GAAIlN,EAAG,MAAM,IAAIxnC,UAAU,mCAC3B,KAAOi0C,OACH,GAAIzM,EAAI,EAAGlgC,IAAM8a,EAAY,EAARsyB,EAAG,GAASptC,EAAU,OAAIotC,EAAG,GAAKptC,EAAS,SAAO8a,EAAI9a,EAAU,SAAM8a,EAAE3e,KAAK6D,GAAI,GAAKA,EAAEmqB,SAAWrP,EAAIA,EAAE3e,KAAK6D,EAAGotC,EAAG,KAAKb,KAAM,OAAOzxB,EAE3J,OADI9a,EAAI,EAAG8a,IAAGsyB,EAAK,CAAS,EAARA,EAAG,GAAQtyB,EAAE/jB,QACzBq2C,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtyB,EAAIsyB,EAAI,MACxB,KAAK,EAAc,OAAXT,EAAEC,QAAgB,CAAE71C,MAAOq2C,EAAG,GAAIb,MAAM,GAChD,KAAK,EAAGI,EAAEC,QAAS5sC,EAAIotC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKT,EAAEI,IAAIlf,MAAO8e,EAAEG,KAAKjf,MAAO,SACxC,QACI,KAAM/S,EAAI6xB,EAAEG,MAAMhyB,EAAIA,EAAEnmB,OAAS,GAAKmmB,EAAEA,EAAEnmB,OAAS,KAAkB,IAAVy4C,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAET,EAAI,EAAG,QAAW,CAC5G,GAAc,IAAVS,EAAG,MAActyB,GAAMsyB,EAAG,GAAKtyB,EAAE,IAAMsyB,EAAG,GAAKtyB,EAAE,IAAM,CAAE6xB,EAAEC,MAAQQ,EAAG,GAAI,KAAQ,CACtF,GAAc,IAAVA,EAAG,IAAYT,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAIA,EAAIsyB,EAAI,KAAQ,CACrE,GAAItyB,GAAK6xB,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAI6xB,EAAEI,IAAI/3C,KAAKo4C,GAAK,KAAQ,CAC/DtyB,EAAE,IAAI6xB,EAAEI,IAAIlf,MAChB8e,EAAEG,KAAKjf,MAAO,SAEtBuf,EAAKV,EAAKvwC,KAAK2vC,EAASa,EAC3B,CAAC,MAAOx2C,GAAKi3C,EAAK,CAAC,EAAGj3C,GAAI6J,EAAI,CAAE,CAAW,QAAEkgC,EAAIplB,EAAI,CAAI,CAC1D,GAAY,EAARsyB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEr2C,MAAOq2C,EAAG,GAAKA,EAAG,QAAK,EAAQb,MAAM,EAC7E,CAtB+CF,CAAK,CAACvwC,EAAG8R,IAAS,GAwBtEvV,OAAOiH,eAAeixC,GAAS,aAAc,CAAEx5C,OAAO,IAChCw5C,GAAAC,oBAAG,EACzB,IAAI3Q,EAAKroC,KAKLg5C,EAAgC,WAChC,SAASA,EAAev8B,EAAYu5B,EAAgBr5B,QAC7B,IAAfA,IAAyBA,EAAa,aAC1C7Y,KAAK2Y,WAAaA,EAClB3Y,KAAKkyC,eAAiBA,EACtBlyC,KAAK6Y,WAAaA,CACrB,CA+GD,OA1GAq8B,EAAej4C,UAAUk4C,QAAU,WAC/B,OAAO5E,EAAUvwC,UAAM,OAAQ,GAAQ,WACnC,IAAIo1C,EAAYC,EAAgBC,EAAUC,EAAmBC,EAAcC,EAAQ9V,EAAI+V,EAAa7B,EAAa8B,EAAgBvD,EAA4BwD,EAC7J,OAAOzE,EAAYnxC,MAAM,SAAUo0C,GAC/B,OAAQA,EAAG9C,OACP,KAAK,EAOD,OANA8D,EAAa,IAAIS,IACjBR,EAAiB,IAAIQ,IACrBP,EAAW,IAAIO,IACfN,EAAoB,IAAI7b,IACxB8b,EAAe,IAAI9b,IACnB+b,EAAS,IAAI17C,MACN,CAAC,EAAaslC,QAAQC,IAAI,CACzBt/B,KAAK2Y,WAAWimB,mBAAmB5+B,KAAKkyC,eAAgBlyC,KAAK6Y,YAC7D7Y,KAAK2Y,WAAW07B,QAAQr0C,KAAK6Y,eAIzC,KAAK,EAiDD,OAhDA8mB,EAAKyU,EAAG7C,OAAQmE,EAAc/V,EAAG,GAAIkU,EAAclU,EAAG,GACtDgW,EAAiB,IAAI57C,MACrBq4C,EAA6B,IAAI1Y,IACjCgc,EAAYxc,SAAQ,SAAU4c,GAC1B,IAAIv6B,EAAOgpB,EAAG8O,cAAcyC,EAAcjX,QAAQ3/B,MAClD,GAAIqc,EACA,OAAQA,EAAKvc,MACT,KAAKulC,EAAGvsB,YAAYs7B,QAEhB,MACJ,KAAK/O,EAAGvsB,YAAYu7B,QAChB,IAAId,EAAclO,EAAGmO,iBAAiBoD,EAAcjX,QAAQ3/B,MAC5DkzC,EAA2BttC,IAAIgxC,EAAct7B,OAAOkkB,WAAY+T,EAAYoC,SAC5EO,EAAW5zB,IAAIixB,EAAYoC,QAAQkB,YACnCV,EAAe7zB,IAAIixB,EAAYoC,QAAQmB,QACvCV,EAAS9zB,IAAIixB,EAAYoC,SACzBU,EAAkBzwC,IAAI2tC,EAAYoC,QAAQmB,OAAQvD,EAAYoC,SAC9D,MACJ,KAAKtQ,EAAGvsB,YAAYw7B,MAChB,IAAIV,EAAYvO,EAAGwO,eAAe+C,EAAcjX,QAAQ3/B,KAAM20C,GAC9D8B,EAAej8C,KAAKo5C,GACpB,MACJ,KAAKvO,EAAGvsB,YAAYy7B,KAChB,MACJ,KAAKlP,EAAGvsB,YAAY07B,WAChBkC,EAAiBrR,EAAG0R,oBAAoBH,EAAcjX,QAAQ3/B,MAC9D,MACJ,QACI,MAAM,IAAIjF,MAAM,yBAA2BshB,EAAKvc,KAAO,gCAG/F,IACwB22C,EAAezc,SAAQ,SAAU4Z,GAC7B,IAAI+B,EAAUzC,EAA2BluC,IAAI4uC,EAAUoD,kBAAkBxX,YACrEmW,IACAW,EAAa1wC,IAAI+vC,EAAQmB,OAAQlD,GACjC2C,EAAO/7C,KAAKo5C,GAE5C,IAU+B,CAAC,EATC,CACLsC,WAAYr7C,MAAMuD,KAAK83C,GACvBe,QAASp8C,MAAMuD,KAAK+3C,GACpBC,SAAUv7C,MAAMuD,KAAKg4C,GACrBC,kBAAmBA,EACnBC,aAAcA,EACdC,OAAQA,EACRG,eAAgBA,IAI5C,GACA,KAMIV,EAAej4C,UAAUm5C,2BAA6B,SAAUC,GAC5D,OAAO9F,EAAUvwC,UAAM,OAAQ,GAAQ,WACnC,IAAIs2C,EAAY3W,EAAI4W,EAAc1C,EAAan7C,EAAG89C,EAASC,EAAU3D,EACrE,OAAO3B,EAAYnxC,MAAM,SAAUo0C,GAC/B,OAAQA,EAAG9C,OACP,KAAK,EAED,OADAgF,EAAa,GACN,CAAC,EAAajX,QAAQC,IAAI,CACzBt/B,KAAK2Y,WAAWsnB,wBAAwBoW,EAAer2C,KAAK6Y,YAC5D7Y,KAAK2Y,WAAW07B,QAAQr0C,KAAK6Y,eAEzC,KAAK,EAED,IADA8mB,EAAKyU,EAAG7C,OAAQgF,EAAe5W,EAAG,GAAIkU,EAAclU,EAAG,GAClDjnC,EAAI,EAAGA,EAAI29C,EAAch9C,OAAQX,IAAK,CAEvC,KADA89C,EAAUD,EAAa79C,IAEnB,MAAM,IAAIuB,MAAM,0CAA4Co8C,EAAc39C,GAAGgmC,YAGjF,QAAiB5/B,KADjB23C,EAAWlS,EAAG8O,cAAcmD,EAAQt3C,QACNu3C,EAASz3C,OAASulC,EAAGvsB,YAAYw7B,MAC3D,MAAM,IAAIv5C,MAAM,WAAao8C,EAAc39C,GAAGgmC,WAAa,2BAE/DoU,EAAYvO,EAAGwO,eAAeyD,EAAQt3C,KAAM20C,GAC5CyC,EAAW58C,KAAKo5C,EACnB,CACD,MAAO,CAAC,EAAcwD,GAE9C,GACA,KAEWpB,CACX,CAtHoC,UAuHpCD,GAAAC,eAAyBA,0CCnKbh5C,GACG,0HCCf,MAAMw6C,EAAY,YACZC,EAAY,YACZC,EAAkB,0BAClBC,EAAa,yBACbC,EAAa,WAEbC,EAAqB,IAAIC,OAAO,IAAMF,EAAW7lB,QACjDgmB,EAA4B,IAAID,OAAOF,EAAW7lB,OAAS4lB,EAAW5lB,OAAQ,MAC9EimB,EAAyB,IAAIF,OAAO,OAASH,EAAW5lB,OAAQ,MA6ChEkmB,EAAYA,CAAC3qC,EAAOsmB,KACzB,GAAuB,iBAAVtmB,IAAsBzS,MAAMkF,QAAQuN,GAChD,MAAM,IAAIpP,UAAU,gDAiBrB,GAdA01B,EAAU,CACTskB,YAAY,EACZC,8BAA8B,KAC3BvkB,GAIHtmB,EADGzS,MAAMkF,QAAQuN,GACTA,EAAMyjB,KAAIxrB,GAAKA,EAAEc,SACvBg6B,QAAO96B,GAAKA,EAAEpL,SACdQ,KAAK,KAEC2S,EAAMjH,OAGM,IAAjBiH,EAAMnT,OACT,MAAO,GAGR,MAAMyG,GAAiC,IAAnBgzB,EAAQwkB,OAC3B/5C,GAAUA,EAAOuC,cACjBvC,GAAUA,EAAOg6C,kBAAkBzkB,EAAQwkB,QACtC3e,GAAiC,IAAnB7F,EAAQwkB,OAC3B/5C,GAAUA,EAAOo7B,cACjBp7B,GAAUA,EAAOi6C,kBAAkB1kB,EAAQwkB,QAE5C,GAAqB,IAAjB9qC,EAAMnT,OACT,OAAOy5B,EAAQskB,WAAaze,EAAYnsB,GAAS1M,EAAY0M,GAqB9D,OAlBqBA,IAAU1M,EAAY0M,KAG1CA,EAhFwBirC,EAACl6C,EAAQuC,EAAa64B,KAC/C,IAAI+e,GAAkB,EAClBC,GAAkB,EAClBC,GAAsB,EAE1B,IAAK,IAAIl/C,EAAI,EAAGA,EAAI6E,EAAOlE,OAAQX,IAAK,CACvC,MAAMm/C,EAAYt6C,EAAO7E,GAErBg/C,GAAmBhB,EAAUoB,KAAKD,IACrCt6C,EAASA,EAAOM,MAAM,EAAGnF,GAAK,IAAM6E,EAAOM,MAAMnF,GACjDg/C,GAAkB,EAClBE,EAAsBD,EACtBA,GAAkB,EAClBj/C,KACUi/C,GAAmBC,GAAuBjB,EAAUmB,KAAKD,IACnEt6C,EAASA,EAAOM,MAAM,EAAGnF,EAAI,GAAK,IAAM6E,EAAOM,MAAMnF,EAAI,GACzDk/C,EAAsBD,EACtBA,GAAkB,EAClBD,GAAkB,IAElBA,EAAkB53C,EAAY+3C,KAAeA,GAAalf,EAAYkf,KAAeA,EACrFD,EAAsBD,EACtBA,EAAkBhf,EAAYkf,KAAeA,GAAa/3C,EAAY+3C,KAAeA,EAEtF,CAED,OAAOt6C,CAAM,EAsDJk6C,CAAkBjrC,EAAO1M,EAAa64B,IAG/CnsB,EAAQA,EAAMlH,QAAQyxC,EAAoB,IAGzCvqC,EADGsmB,EAAQukB,6BAxDwBA,EAAC7qC,EAAO1M,KAC5C82C,EAAgBmB,UAAY,EAErBvrC,EAAMlH,QAAQsxC,GAAiBoB,GAAMl4C,EAAYk4C,MAsD/CX,CAA6B7qC,EAAO1M,GAEpCA,EAAY0M,GAGjBsmB,EAAQskB,aACX5qC,EAAQmsB,EAAYnsB,EAAMkkB,OAAO,IAAMlkB,EAAM3O,MAAM,IAzDjCo6C,EAACzrC,EAAOmsB,KAC3Bse,EAA0Bc,UAAY,EACtCb,EAAuBa,UAAY,EAE5BvrC,EAAMlH,QAAQ2xC,GAA2B,CAAC5F,EAAG6G,IAAevf,EAAYuf,KAC7E5yC,QAAQ4xC,GAAwBp8C,GAAK69B,EAAY79B,MAuD5Cm9C,CAAYzrC,EAAOmsB,EAAY,SAGzBwf,GAAA77C,QAAG66C,EAEjBgB,GAAA77C,QAAAg5B,QAAyB6hB,wCCsCzB,MAAM7nC,GACJ3D,WAAAA,CAAY4D,EAAMC,GAChB,IAAK/N,OAAOkL,UAAU4C,GACpB,MAAM,IAAInS,UAAU,2BAYtB4C,KAAKuP,KAAOA,EAUZvP,KAAKwP,SAAWA,CACjB,CAiBDc,qBAAAA,GACE,MAAO,EACR,CAcDE,MAAAA,CAAO9R,EAAGjE,GACR,MAAM,IAAIR,MAAM,qBACjB,CAwBDsW,MAAAA,CAAOvD,EAAKtO,EAAGjE,GACb,MAAM,IAAIR,MAAM,qBACjB,CAkBDkY,OAAAA,CAAQzT,EAAGjE,GACT,GAAI,EAAIuF,KAAKuP,KACX,MAAM,IAAI1S,WAAW,sBAEvB,OAAOmD,KAAKuP,IACb,CAkBDE,SAAAA,CAAUD,GACR,MAAME,EAAK3S,OAAO4S,OAAO3P,KAAK2L,YAAY1O,WAG1C,OAFAF,OAAO6S,OAAOF,EAAI1P,MAClB0P,EAAGF,SAAWA,EACPE,CACR,CAsBDG,SAAAA,CAAUC,GAET,EASH,SAASC,GAAiBhE,EAAMtJ,GAC9B,OAAIA,EAAG+M,SACEzD,EAAO,IAAMtJ,EAAG+M,SAAW,IAE7BzD,CACT,CAZc2B,GAAA4B,OAAGA,GAaO5B,GAAAqC,iBAAGA,GA0DErC,GAAAsC,sBA7B7B,SAA+BC,EAAOC,GACpC,GAAI,mBAAsBD,EACxB,MAAM,IAAI7S,UAAU,6BAEtB,GAAI6S,EAAME,eAAe,WACvB,MAAM,IAAIlW,MAAM,sCAElB,KAAMiW,GAAWA,aAAkBZ,IACjC,MAAM,IAAIlS,UAAU,2BAEtB,GAAI8S,EAAOC,eAAe,qBACxB,MAAM,IAAIlW,MAAM,4CAElBgW,EAAMG,QAAUF,EAChBA,EAAOG,kBAAoBJ,EAC3BC,EAAOI,sBAAyB,IAAM,IAAIL,EAC1ClT,OAAOiH,eAAeiM,EAAMhT,UAAW,SAAU,CAC/CxB,MAAO,SAASiD,EAAGjE,GACjB,OAAOyV,EAAOK,OAAOvQ,KAAMtB,EAAGjE,EAC/B,EACDoR,UAAU,IAEZ9O,OAAOiH,eAAeiM,EAAO,SAAU,CACrCxU,MAAO,SAASiD,EAAGjE,GACjB,OAAOyV,EAAOM,OAAO9R,EAAGjE,EACzB,EACDoR,UAAU,GAEd,EAwBA,MAAM8E,WAAuBrB,GAY3BmB,OAAAA,GACE,MAAM,IAAIxW,MAAM,6BACjB,EAkBH,MAAMyW,WAAoBC,GACxBhF,WAAAA,CAAYiF,EAAapB,GAIvB,QAHI1Q,IAAc8R,IAChBA,EAAc,IAEVnP,OAAOkL,UAAUiE,IAAkB,GAAKA,EAC5C,MAAM,IAAIxT,UAAU,4CAEtBwO,OAAO,EAAG4D,GAKVxP,KAAK4Q,YAAcA,CACpB,CAGDH,OAAAA,GACE,OAAO,CACR,CAGDD,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMoW,EAAMnS,EAAErF,OAASoB,EACvB,OAAOc,KAAKO,MAAM+U,EAAM7Q,KAAK4Q,YAC9B,CAGDL,MAAAA,CAAOvD,EAAKtO,EAAGjE,GACb,OAAO,CACR,EAuBH,MAAMqW,WAAqBH,GACzBhF,WAAAA,CAAYuE,EAAQzV,EAAQ+U,GAC1B,KAAMU,aAAkBZ,IACtB,MAAM,IAAIlS,UAAU,2BAGtB,QAAI0B,IAAcrE,EAChBA,EAAS,OACJ,IAAKgH,OAAOkL,UAAUlS,GAC3B,MAAM,IAAI2C,UAAU,uCAGtBwO,MAAMsE,EAAOX,KAAMC,GAAYU,EAAOV,UAGtCxP,KAAKkQ,OAASA,EAQdlQ,KAAKvF,OAASA,CACf,CAGDgW,OAAAA,GACE,OAASzQ,KAAKkQ,kBAAkBa,IACpB/Q,KAAKkQ,kBAAkBc,EACpC,CAGDR,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJuF,KAAKkQ,OAAOM,OAAO9R,EAAGjE,EAASuF,KAAKvF,OAC5C,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAIb,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJuF,KAAKkQ,OAAOK,OAAOvD,EAAKtO,EAAGjE,EAASuF,KAAKvF,OACjD,EAmBH,MAAMsW,WAAazB,GACjB3D,WAAAA,CAAY4D,EAAMC,GAEhB,GADA5D,MAAM2D,EAAMC,GACR,EAAIxP,KAAKuP,KACX,MAAM,IAAI1S,WAAW,+BAExB,CAGD2T,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAE0I,WAAW3M,EAAQuF,KAAKuP,KAClC,CAGDgB,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAE4K,YAAY0D,EAAKvS,EAAQuF,KAAKuP,MACzBvP,KAAKuP,IACb,EAmBH,MAAMyB,WAAe1B,GACnB3D,WAAAA,CAAY4D,EAAMC,GAEhB,GADA5D,MAAO2D,EAAMC,GACT,EAAIxP,KAAKuP,KACX,MAAM,IAAI1S,WAAW,+BAExB,CAGD2T,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAE6I,WAAW9M,EAAQuF,KAAKuP,KAClC,CAGDgB,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAE8K,YAAYwD,EAAKvS,EAAQuF,KAAKuP,MACzBvP,KAAKuP,IACb,EAmBH,MAAM6oC,WAAY9oC,GAChB3D,WAAAA,CAAY4D,EAAMC,GAEhB,GADA5D,MAAM2D,EAAMC,GACR,EAAIxP,KAAKuP,KACX,MAAM,IAAI1S,WAAW,+BAExB,CAGD2T,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAE8J,UAAU/N,EAAQuF,KAAKuP,KACjC,CAGDgB,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAE2L,WAAW2C,EAAKvS,EAAQuF,KAAKuP,MACxBvP,KAAKuP,IACb,EAmBH,MAAM0B,WAAc3B,GAClB3D,WAAAA,CAAY4D,EAAMC,GAEhB,GADA5D,MAAM2D,EAAMC,GACR,EAAIxP,KAAKuP,KACX,MAAM,IAAI1S,WAAW,+BAExB,CAGD2T,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAE+J,UAAUhO,EAAQuF,KAAKuP,KACjC,CAGDgB,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAE8L,WAAWwC,EAAKvS,EAAQuF,KAAKuP,MACxBvP,KAAKuP,IACb,EAGH,MAAM2B,GAAQ3V,KAAKC,IAAI,EAAG,IAI1B,SAAS2V,GAAYnE,GACnB,MAAMoE,EAAO7V,KAAKO,MAAMkR,EAAMkE,IAE9B,MAAO,CAACE,OAAMC,KADDrE,EAAOoE,EAAOF,GAE7B,CAEA,SAASK,GAAaH,EAAMC,GAC1B,OAAOD,EAAOF,GAAQG,CACxB,CAaA,MAAMC,WAAmBhC,GACvB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,MAAM4W,EAAO3S,EAAEoJ,aAAarN,GAE5B,OAAO8W,GADM7S,EAAEoJ,aAAarN,EAAS,GACX4W,EAC3B,CAGDd,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqS,EAAQqE,GAAYnE,GAG1B,OAFAtO,EAAEsL,cAAc8C,EAAMuE,KAAM5W,GAC5BiE,EAAEsL,cAAc8C,EAAMsE,KAAM3W,EAAS,GAC9B,CACR,EAcH,MAAM+W,WAAqBlC,GACzB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAIX,OAAO8W,GAFM7S,EAAEsJ,aAAavN,GACfiE,EAAEsJ,aAAavN,EAAS,GAEtC,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqS,EAAQqE,GAAYnE,GAG1B,OAFAtO,EAAEwL,cAAc4C,EAAMsE,KAAM3W,GAC5BiE,EAAEwL,cAAc4C,EAAMuE,KAAM5W,EAAS,GAC9B,CACR,EAcH,MAAMgX,WAAkBnC,GACtB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,MAAM4W,EAAO3S,EAAEoJ,aAAarN,GAE5B,OAAO8W,GADM7S,EAAEmK,YAAYpO,EAAS,GACV4W,EAC3B,CAGDd,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqS,EAAQqE,GAAYnE,GAG1B,OAFAtO,EAAEsL,cAAc8C,EAAMuE,KAAM5W,GAC5BiE,EAAEkM,aAAakC,EAAMsE,KAAM3W,EAAS,GAC7B,CACR,EAcH,MAAMiX,WAAoBpC,GACxB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAIX,OAAO8W,GAFM7S,EAAEoK,YAAYrO,GACdiE,EAAEsJ,aAAavN,EAAS,GAEtC,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqS,EAAQqE,GAAYnE,GAG1B,OAFAtO,EAAEmM,aAAaiC,EAAMsE,KAAM3W,GAC3BiE,EAAEwL,cAAc4C,EAAMuE,KAAM5W,EAAS,GAC9B,CACR,EAaH,MAAMkX,WAAcrC,GAClB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAEuK,YAAYxO,EACtB,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAEsM,aAAagC,EAAKvS,GACb,CACR,EAaH,MAAMmX,WAAgBtC,GACpB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAEwK,YAAYzO,EACtB,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAEuM,aAAa+B,EAAKvS,GACb,CACR,EAaH,MAAMoX,WAAevC,GACnB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAEyK,aAAa1O,EACvB,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAEwM,cAAc8B,EAAKvS,GACd,CACR,EAaH,MAAMqX,WAAiBxC,GACrB3D,WAAAA,CAAY6D,GACV5D,MAAM,EAAG4D,EACV,CAGDgB,MAAAA,CAAO9R,EAAGjE,GAIR,YAHIqE,IAAcrE,IAChBA,EAAS,GAEJiE,EAAE0K,aAAa3O,EACvB,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAKb,YAJIqE,IAAcrE,IAChBA,EAAS,GAEXiE,EAAEyM,cAAc6B,EAAKvS,GACd,CACR,EAoBH,MAAMsX,WAAiBzC,GACrB3D,WAAAA,CAAYqG,EAAeC,EAAOzC,GAChC,KAAMwC,aAAyB1C,IAC7B,MAAM,IAAIlS,UAAU,kCAEtB,KAAQ6U,aAAiBtB,IAAmBsB,EAAMxB,WACxChP,OAAOkL,UAAUsF,IAAW,GAAKA,GACzC,MAAM,IAAI7U,UAAU,4EAGtB,IAAImS,GAAQ,IACL0C,aAAiBtB,KAChB,EAAIqB,EAAczC,OACxBA,EAAO0C,EAAQD,EAAczC,MAG/B3D,MAAM2D,EAAMC,GAGZxP,KAAKgS,cAAgBA,EAOrBhS,KAAKiS,MAAQA,CACd,CAGDE,OAAAA,CAAQzT,EAAGjE,GACT,GAAI,GAAKuF,KAAKuP,KACZ,OAAOvP,KAAKuP,UAEVzQ,IAAcrE,IAChBA,EAAS,GAEX,IAAI8U,EAAO,EACP0C,EAAQjS,KAAKiS,MAIjB,GAHIA,aAAiBtB,KACnBsB,EAAQA,EAAMzB,OAAO9R,EAAGjE,IAEtB,EAAIuF,KAAKgS,cAAczC,KACzBA,EAAO0C,EAAQjS,KAAKgS,cAAczC,SAC7B,CACL,IAAI2C,EAAM,EACV,KAAOA,EAAMD,GACX1C,GAAQvP,KAAKgS,cAAcG,QAAQzT,EAAGjE,EAAS8U,KAC7C2C,CAEL,CACD,OAAO3C,CACR,CAGDiB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMiV,EAAK,GACX,IAAIhX,EAAI,EACJuZ,EAAQjS,KAAKiS,MAIjB,IAHIA,aAAiBtB,KACnBsB,EAAQA,EAAMzB,OAAO9R,EAAGjE,IAEnB/B,EAAIuZ,GACTvC,EAAGhW,KAAKsG,KAAKgS,cAAcxB,OAAO9R,EAAGjE,IACrCA,GAAUuF,KAAKgS,cAAcG,QAAQzT,EAAGjE,GACxC/B,GAAK,EAEP,OAAOgX,CACR,CAYDa,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAM2X,EAAMpS,KAAKgS,cACXzC,EAAOvC,EAAIqF,QAAO,CAAC9C,EAAM+C,IACtB/C,EAAO6C,EAAI7B,OAAO+B,EAAG5T,EAAGjE,EAAS8U,IACvC,GAIH,OAHIvP,KAAKiS,iBAAiBtB,IACxB3Q,KAAKiS,MAAM1B,OAAOvD,EAAI3T,OAAQqF,EAAGjE,GAE5B8U,CACR,EAmCH,MAAMgD,WAAkBjD,GACtB3D,WAAAA,CAAY6G,EAAQhD,EAAUiD,GAC5B,IAAM1Y,MAAMkF,QAAQuT,KACXA,EAAOH,QAAO,CAACK,EAAKJ,IAAMI,GAAQJ,aAAahD,KAAS,GAC/D,MAAM,IAAIlS,UAAU,4CAEjB,kBAAqBoS,QAClB1Q,IAAc2T,IACpBA,EAAiBjD,EACjBA,OAAW1Q,GAIb,IAAK,MAAM6T,KAAMH,EACf,GAAK,EAAIG,EAAGpD,WACJzQ,IAAc6T,EAAGnD,SACvB,MAAM,IAAIvV,MAAM,wDAIpB,IAAIsV,GAAQ,EACZ,IACEA,EAAOiD,EAAOH,QAAO,CAAC9C,EAAMoD,IAAOpD,EAAOoD,EAAGR,WAAW,EACzD,CAAC,MAAOtX,GACR,CACD+Q,MAAM2D,EAAMC,GAYZxP,KAAKwS,OAASA,EAWdxS,KAAKyS,iBAAmBA,CACzB,CAGDN,OAAAA,CAAQzT,EAAGjE,GACT,GAAI,GAAKuF,KAAKuP,KACZ,OAAOvP,KAAKuP,UAEVzQ,IAAcrE,IAChBA,EAAS,GAEX,IAAI8U,EAAO,EACX,IACEA,EAAOvP,KAAKwS,OAAOH,QAAO,CAAC9C,EAAMoD,KAC/B,MAAMC,EAAMD,EAAGR,QAAQzT,EAAGjE,GAE1B,OADAA,GAAUmY,EACHrD,EAAOqD,CAAG,GAChB,EACJ,CAAC,MAAO/X,GACP,MAAM,IAAIgC,WAAW,qBACtB,CACD,OAAO0S,CACR,CAGDiB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMoY,EAAO7S,KAAKsQ,wBAClB,IAAK,MAAMqC,KAAM3S,KAAKwS,OAKpB,QAJI1T,IAAc6T,EAAGnD,WACnBqD,EAAKF,EAAGnD,UAAYmD,EAAGnC,OAAO9R,EAAGjE,IAEnCA,GAAUkY,EAAGR,QAAQzT,EAAGjE,GACpBuF,KAAKyS,gBACD/T,EAAErF,SAAWoB,EACnB,MAGJ,OAAOoY,CACR,CAODtC,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqY,EAAcrY,EACpB,IAAIsY,EAAa,EACbC,EAAY,EAChB,IAAK,MAAML,KAAM3S,KAAKwS,OAAQ,CAC5B,IAAIjD,EAAOoD,EAAGpD,KAEd,GADAyD,EAAa,EAAIzD,EAAQA,EAAO,OAC5BzQ,IAAc6T,EAAGnD,SAAU,CAC7B,MAAMyD,EAAKjG,EAAI2F,EAAGnD,eACd1Q,IAAcmU,IAChBD,EAAYL,EAAGpC,OAAO0C,EAAIvU,EAAGjE,GACzB,EAAI8U,IAGNA,EAAOoD,EAAGR,QAAQzT,EAAGjE,IAG1B,CACDsY,EAAatY,EACbA,GAAU8U,CACX,CAKD,OAAQwD,EAAaC,EAAaF,CACnC,CAGDjD,SAAAA,CAAUC,GACR,MAAM+C,EAAO7S,KAAKsQ,wBAClB,IAAK,MAAMqC,KAAM3S,KAAKwS,YACf1T,IAAc6T,EAAGnD,UACd,EAAIM,EAAOzW,SACjBwZ,EAAKF,EAAGnD,UAAYM,EAAOoD,SAG/B,OAAOL,CACR,CAUDM,SAAAA,CAAU3D,GACR,GAAI,iBAAoBA,EACtB,MAAM,IAAIpS,UAAU,2BAEtB,IAAK,MAAMuV,KAAM3S,KAAKwS,OACpB,GAAIG,EAAGnD,WAAaA,EAClB,OAAOmD,CAGZ,CAaDS,QAAAA,CAAS5D,GACP,GAAI,iBAAoBA,EACtB,MAAM,IAAIpS,UAAU,2BAEtB,IAAI3C,EAAS,EACb,IAAK,MAAMkY,KAAM3S,KAAKwS,OAAQ,CAC5B,GAAIG,EAAGnD,WAAaA,EAClB,OAAO/U,EAEL,EAAIkY,EAAGpD,KACT9U,GAAU,EACD,GAAKA,IACdA,GAAUkY,EAAGpD,KAEhB,CACF,EAiBH,MAAM+D,GACJ3H,WAAAA,CAAY6D,GAKVxP,KAAKwP,SAAWA,CACjB,CAMDgB,MAAAA,GACE,MAAM,IAAIvW,MAAM,iCACjB,CAMDsW,MAAAA,GACE,MAAM,IAAItW,MAAM,iCACjB,EAoBH,MAAMoZ,WAAiCC,GACrC3H,WAAAA,CAAYuE,EAAQV,GAClB,KAAOU,aAAkBS,IAChBT,EAAOO,WACd,MAAM,IAAIrT,UAAU,qDAGtBwO,MAAM4D,GAAYU,EAAOV,UAAY,WAIrCxP,KAAKkQ,OAASA,CACf,CAGDM,MAAAA,CAAO9R,EAAGjE,GACR,OAAOuF,KAAKkQ,OAAOM,OAAO9R,EAAGjE,EAC9B,CAGD8V,MAAAA,CAAOvD,EAAKtO,EAAGjE,GACb,OAAOuF,KAAKkQ,OAAOK,OAAOvD,EAAKtO,EAAGjE,EACnC,EA8DH,MAAMma,WAActF,GAClB3D,WAAAA,CAAY4H,EAAOC,EAAehE,GAChC,MAAM6oC,EAAQ9kC,aAAiBxC,IAChBwC,aAAiBvC,GAChC,GAAIqnC,EACF9kC,EAAQ,IAAIF,GAAyB,IAAIvC,GAAayC,SACjD,GAAKA,aAAiB5C,IACf4C,EAAM9C,UAClB8C,EAAQ,IAAIF,GAAyBE,QAChC,KAAMA,aAAiBD,IAC5B,MAAM,IAAIlW,UAAU,oEAMtB,QAHI0B,IAAc0U,IAChBA,EAAgB,QAEX,OAASA,GACNA,aAAyBlE,IACjC,MAAM,IAAIlS,UAAU,0CAEtB,GAAI,OAASoW,EAAe,CAC1B,GAAI,EAAIA,EAAcjE,KACpB,MAAM,IAAItV,MAAM,8CAEd6E,IAAc0U,EAAchE,WAC9BgE,EAAgBA,EAAc/D,UAAU,WAE3C,CAMD,IAAIF,GAAQ,EACRiE,IACFjE,EAAOiE,EAAcjE,KAChB,GAAKA,GAAS8oC,IACjB9oC,GAAQgE,EAAMrD,OAAOX,OAGzB3D,MAAM2D,EAAMC,GAUZxP,KAAKyT,cAAgBF,EAOrBvT,KAAKqU,wBAA0BgkC,EAS/Br4C,KAAKwT,cAAgBA,EAYrBxT,KAAKiU,SAAW,GAGhB,IAAIL,EAAwB5T,KAAKgU,wBAAwBH,KAAK7T,MAe9DA,KAAKuU,iBAAmB,SAASvH,GAC/B,OAAO4G,EAAsB5G,IAgB/BhN,KAAK0T,uBAAyB,SAASC,GACrCC,EAAwBD,EAAIE,KAAK7T,MAEpC,CAGDmS,OAAAA,CAAQzT,EAAGjE,GACT,GAAI,GAAKuF,KAAKuP,KACZ,OAAOvP,KAAKuP,UAEVzQ,IAAcrE,IAChBA,EAAS,GAKX,MAAMqZ,EAAM9T,KAAK+T,WAAWrV,EAAGjE,GAC/B,IAAKqZ,EACH,MAAM,IAAI7Z,MAAM,qDAElB,OAAO6Z,EAAI3B,QAAQzT,EAAGjE,EACvB,CA+BDuZ,uBAAAA,CAAwBhH,GACtB,GAAIA,EAAImD,eAAenQ,KAAKyT,cAAcjE,UAAW,CACnD,GAAIxP,KAAKwT,eACFxG,EAAImD,eAAenQ,KAAKwT,cAAchE,UAC3C,OAEF,MAAMsE,EAAM9T,KAAKiU,SAASjH,EAAIhN,KAAKyT,cAAcjE,WACjD,GAAIsE,KACMA,EAAI5D,QACHlD,EAAImD,eAAe2D,EAAItE,WAChC,OAAOsE,CAEf,MACM,IAAK,MAAMI,KAAOlU,KAAKiU,SAAU,CAC/B,MAAMH,EAAM9T,KAAKiU,SAASC,GAC1B,GAAIlH,EAAImD,eAAe2D,EAAItE,UACzB,OAAOsE,CAEV,CAEH,MAAM,IAAI7Z,MAAM,8BACjB,CAQDuW,MAAAA,CAAO9R,EAAGjE,GAIR,IAAIoY,OAHA/T,IAAcrE,IAChBA,EAAS,GAGX,MAAM0Z,EAAMnU,KAAKyT,cACXF,EAAQY,EAAI3D,OAAO9R,EAAGjE,GAC5B,IAAI2Z,EAAMpU,KAAKiU,SAASV,GACxB,QAAIzU,IAAcsV,EAAK,CACrB,IAAIE,EAAgB,EACpBF,EAAMpU,KAAKwT,cACPxT,KAAKqU,0BACPC,EAAgBH,EAAIjE,OAAOX,MAE7BsD,EAAO7S,KAAKsQ,wBACZuC,EAAKsB,EAAI3E,UAAY+D,EACrBV,EAAKuB,EAAI5E,UAAYxP,KAAKwT,cAAchD,OAAO9R,EAAGjE,EAAS6Z,EACjE,MACMzB,EAAOuB,EAAI5D,OAAO9R,EAAGjE,GAEvB,OAAOoY,CACR,CAQDtC,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMqZ,EAAM9T,KAAKuU,iBAAiBvH,GAClC,QAAIlO,IAAcgV,EAAK,CACrB,MAAMK,EAAMnU,KAAKyT,cACXW,EAAMpU,KAAKwT,cACjB,IAAIc,EAAgB,EAKpB,OAJItU,KAAKqU,0BACPC,EAAgBH,EAAIjE,OAAOX,MAE7B4E,EAAI5D,OAAOvD,EAAImH,EAAI3E,UAAW9Q,EAAGjE,GAC1B6Z,EAAgBF,EAAI7D,OAAOvD,EAAIoH,EAAI5E,UAAW9Q,EACnBjE,EAAS6Z,EAC5C,CACD,OAAOR,EAAIvD,OAAOvD,EAAKtO,EAAGjE,EAC3B,CAeD+Z,UAAAA,CAAWC,EAASvE,EAAQV,GAC1B,MAAME,EAAK,IAAIgF,GAAc1U,KAAMyU,EAASvE,EAAQV,GAEpD,OADAxP,KAAKiU,SAASQ,GAAW/E,EAClBA,CACR,CAgBDqE,UAAAA,CAAWY,EAAIla,GACb,IAAIga,EAAUE,EAOd,OANIpY,OAAOqC,SAAS+V,UACd7V,IAAcrE,IAChBA,EAAS,GAEXga,EAAUzU,KAAKyT,cAAcjD,OAAOmE,EAAIla,IAEnCuF,KAAKiU,SAASQ,EACtB,EAgCH,MAAMC,WAAsBpF,GAC1B3D,WAAAA,CAAYqC,EAAOyG,EAASvE,EAAQV,GAClC,KAAMxB,aAAiB4G,IACrB,MAAM,IAAIxX,UAAU,yBAEtB,IAAMqE,OAAOkL,UAAU8H,IAAc,EAAIA,EACvC,MAAM,IAAIrX,UAAU,4CAOtB,GALK,iBAAoB8S,QACjBpR,IAAc0Q,IACpBA,EAAWU,EACXA,EAAS,MAEPA,EAAQ,CACV,KAAMA,aAAkBZ,IACtB,MAAM,IAAIlS,UAAU,2BAEtB,GAAK,OAAS4Q,EAAMwF,eACZ,GAAKtD,EAAOX,MACZW,EAAOX,KAAOvB,EAAMwF,cAAcjE,KACxC,MAAM,IAAItV,MAAM,iDAElB,GAAI,iBAAoBuV,EACtB,MAAM,IAAIpS,UAAU,sCAEvB,CACD,IAAImS,EAAOvB,EAAMuB,KACb,EAAIvB,EAAMuB,OACZA,EAAOW,EAASA,EAAOX,KAAO,EACzB,GAAKA,GAASvB,EAAMqG,0BACvB9E,GAAQvB,EAAMyF,cAAcvD,OAAOX,OAGvC3D,MAAM2D,EAAMC,GAGZxP,KAAKgO,MAAQA,EAKbhO,KAAKyU,QAAUA,EAMfzU,KAAKkQ,OAASA,GAAU,IACzB,CAGDiC,OAAAA,CAAQzT,EAAGjE,GACT,GAAI,GAAKuF,KAAKuP,KAGZ,OAAOvP,KAAKuP,UAEVzQ,IAAcrE,IAChBA,EAAS,GAEX,IAAI6Z,EAAgB,EAKpB,OAJItU,KAAKgO,MAAMqG,0BACbC,EAAgBtU,KAAKgO,MAAMyF,cAAcvD,OAAOX,MAG3C+E,EAAgBtU,KAAKkQ,OAAOiC,QAAQzT,EAAGjE,EAAS6Z,EACxD,CAGD9D,MAAAA,CAAO9R,EAAGjE,GACR,MAAMoY,EAAO7S,KAAKsQ,wBAIlB,QAHIxR,IAAcrE,IAChBA,EAAS,GAEPuF,OAASA,KAAKgO,MAAM+F,WAAWrV,EAAGjE,GACpC,MAAM,IAAIR,MAAM,oBAElB,IAAIqa,EAAgB,EAWpB,OAVItU,KAAKgO,MAAMqG,0BACbC,EAAgBtU,KAAKgO,MAAMyF,cAAcvD,OAAOX,MAE9CvP,KAAKkQ,OACP2C,EAAK7S,KAAKwP,UAAYxP,KAAKkQ,OAAOM,OAAO9R,EAAGjE,EAAS6Z,GAC5CtU,KAAKwP,SACdqD,EAAK7S,KAAKwP,WAAY,EACbxP,KAAKgO,MAAMqG,0BACpBxB,EAAK7S,KAAKgO,MAAMyF,cAAcjE,UAAYxP,KAAKyU,SAE1C5B,CACR,CAGDtC,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,IAAI6Z,EAAgB,EAIpB,GAHItU,KAAKgO,MAAMqG,0BACbC,EAAgBtU,KAAKgO,MAAMyF,cAAcvD,OAAOX,MAE9CvP,KAAKkQ,SACAlD,EAAImD,eAAenQ,KAAKwP,UAC/B,MAAM,IAAIpS,UAAU,0BAA4B4C,KAAKwP,UAEvDxP,KAAKgO,MAAMyF,cAAclD,OAAOvQ,KAAKyU,QAAS/V,EAAGjE,GACjD,IAAI8U,EAAO+E,EACX,GAAItU,KAAKkQ,SACPlQ,KAAKkQ,OAAOK,OAAOvD,EAAIhN,KAAKwP,UAAW9Q,EAAGjE,EAAS6Z,GACnD/E,GAAQvP,KAAKkQ,OAAOiC,QAAQzT,EAAGjE,EAAS6Z,GACnC,GAAKtU,KAAKgO,MAAMuB,MACbA,EAAOvP,KAAKgO,MAAMuB,MACxB,MAAM,IAAItV,MAAM,6CAGpB,OAAOsV,CACR,CAIDM,SAAAA,CAAUC,GACR,GAAI9P,KAAKkQ,OACP,OAAOlQ,KAAKkQ,OAAOL,UAAUC,EAEhC,EASH,SAAS+E,GAAiBvC,GAIxB,OAHI,EAAIA,IACNA,GAAK,YAEAA,CACT,CAiCA,MAAMwC,WAAqBxF,GACzB3D,WAAAA,CAAYoJ,EAAMC,EAAKxF,GACrB,KAAOuF,aAAgBhE,IACbgE,aAAgB/D,IACxB,MAAM,IAAI5T,UAAU,wCAOtB,GALK,iBAAoB4X,QACjBlW,IAAc0Q,IACpBA,EAAWwF,EACXA,OAAMlW,GAEJ,EAAIiW,EAAKxF,KACX,MAAM,IAAI1S,WAAW,8BAEvB+O,MAAMmJ,EAAKxF,KAAMC,GAKjBxP,KAAK+U,KAAOA,EASZ/U,KAAKgV,MAAQA,EAQbhV,KAAKwS,OAAS,GAKd,IAAI/W,EAAQ,EACZuE,KAAKiV,gBAAkB,SAAS3C,GAE9B,OADA7W,EAAQoZ,GAAiBvC,GAClBtS,MAETA,KAAKkV,gBAAkB,WACrB,OAAOzZ,EAEV,CAGD+U,MAAAA,CAAO9R,EAAGjE,GACR,MAAMoY,EAAO7S,KAAKsQ,6BACdxR,IAAcrE,IAChBA,EAAS,GAEX,MAAMgB,EAAQuE,KAAK+U,KAAKvE,OAAO9R,EAAGjE,GAClCuF,KAAKiV,gBAAgBxZ,GACrB,IAAK,MAAMkX,KAAM3S,KAAKwS,YAChB1T,IAAc6T,EAAGnD,WACnBqD,EAAKF,EAAGnD,UAAYmD,EAAGnC,OAAO/U,IAGlC,OAAOoX,CACR,CAODtC,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAEX,MAAMgB,EAAQuE,KAAK+U,KAAKvE,OAAO9R,EAAGjE,GAClCuF,KAAKiV,gBAAgBxZ,GACrB,IAAK,MAAMkX,KAAM3S,KAAKwS,OACpB,QAAI1T,IAAc6T,EAAGnD,SAAU,CAC7B,MAAMyD,EAAKjG,EAAI2F,EAAGnD,eACd1Q,IAAcmU,GAChBN,EAAGpC,OAAO0C,EAEb,CAEH,OAAOjT,KAAK+U,KAAKxE,OAAOvQ,KAAKkV,kBAAmBxW,EAAGjE,EACpD,CAWD0a,QAAAA,CAASjH,EAAMsB,GACb,MAAM4F,EAAK,IAAIC,GAASrV,KAAMkO,EAAMsB,GAEpC,OADAxP,KAAKwS,OAAO9Y,KAAK0b,GACVA,CACR,CASDE,UAAAA,CAAW9F,GAGT,MAAM4F,EAAK,IAAIG,GAAQvV,KAAMwP,GAE7B,OADAxP,KAAKwS,OAAO9Y,KAAK0b,GACVA,CACR,CAUDI,QAAAA,CAAShG,GACP,GAAI,iBAAoBA,EACtB,MAAM,IAAIpS,UAAU,2BAEtB,IAAK,MAAMuV,KAAM3S,KAAKwS,OACpB,GAAIG,EAAGnD,WAAaA,EAClB,OAAOmD,CAGZ,EAuBH,MAAM0C,GACJ1J,WAAAA,CAAY8J,EAAWvH,EAAMsB,GAC3B,KAAMiG,aAAqBX,IACzB,MAAM,IAAI1X,UAAU,oCAEtB,IAAMqE,OAAOkL,UAAUuB,IAAW,GAAKA,EACrC,MAAM,IAAI9Q,UAAU,iCAEtB,MAAMwY,EAAY,EAAIH,EAAUlG,KAC1BmG,EAAWD,EAAUjD,OAAOH,QAAO,CAACsD,EAAKhD,IAAOgD,EAAMhD,EAAGzE,MAAM,GACrE,GAAKA,EAAOwH,EAAYE,EACtB,MAAM,IAAI3b,MAAM,sCACG2b,EAAYF,GAAY,OACzBE,EAAY,YAKhC5V,KAAKyV,UAAYA,EAGjBzV,KAAKkO,KAAOA,EAOZlO,KAAK6V,WAAa,GAAK3H,GAAQ,EAC3B,KAAOA,IACTlO,KAAK6V,UAAY,YAMnB7V,KAAK7F,MAAQub,EACT1V,KAAKyV,UAAUT,MACjBhV,KAAK7F,MAAQyb,EAAYF,EAAWxH,GAKtClO,KAAK8V,SAAWjB,GAAiB7U,KAAK6V,WAAa7V,KAAK7F,OAYxD6F,KAAKwP,SAAWA,CACjB,CAIDgB,MAAAA,GAIE,OAFkBqE,GADL7U,KAAKyV,UAAUP,kBACclV,KAAK8V,YACnB9V,KAAK7F,KAElC,CAODoW,MAAAA,CAAO9U,GACL,IAAMgG,OAAOkL,UAAUlR,IACfA,IAAUoZ,GAAiBpZ,EAAQuE,KAAK6V,WAC9C,MAAM,IAAIzY,UAAU2S,GAAiB,kBAAmB/P,MAClC,wCAA0CA,KAAK6V,WAEvE,MAAMd,EAAO/U,KAAKyV,UAAUP,kBACtBa,EAAYlB,GAAiBpZ,GAASuE,KAAK7F,OACjD6F,KAAKyV,UAAUR,gBAAgBJ,GAAiBE,GAAQ/U,KAAK8V,UAC5BC,EAClC,EAoBH,MAAMR,WAAgBF,GACpB1J,WAAAA,CAAY8J,EAAWjG,GACrB5D,MAAM6J,EAAW,EAAGjG,EACrB,CAKDgB,MAAAA,CAAO9R,EAAGjE,GACR,QAAS4a,GAASpY,UAAUuT,OAAO3P,KAAKb,KAAMtB,EAAGjE,EAClD,CAGD8V,MAAAA,CAAO9U,GAKL,MAJI,kBAAqBA,IAEvBA,GAASA,GAEJ4Z,GAASpY,UAAUsT,OAAO1P,KAAKb,KAAMvE,EAC7C,EAkBH,MAAM68C,WAAahpC,GACjB3D,WAAAA,CAAYtS,EAAQmW,GAClB,KAAQnW,aAAkBsX,IAAmBtX,EAAOoX,WAC1ChP,OAAOkL,UAAUtT,IAAY,GAAKA,GAC1C,MAAM,IAAI+D,UAAU,yEAItB,IAAImS,GAAQ,EACNlW,aAAkBsX,KACtBpB,EAAOlW,GAETuS,MAAM2D,EAAMC,GAOZxP,KAAK3G,OAASA,CACf,CAGD8Y,OAAAA,CAAQzT,EAAGjE,GACT,IAAI8U,EAAOvP,KAAKuP,KAIhB,OAHI,EAAIA,IACNA,EAAOvP,KAAK3G,OAAOmX,OAAO9R,EAAGjE,IAExB8U,CACR,CAGDiB,MAAAA,CAAO9R,EAAGjE,QACJqE,IAAcrE,IAChBA,EAAS,GAEX,IAAI8U,EAAOvP,KAAKuP,KAIhB,OAHI,EAAIA,IACNA,EAAOvP,KAAK3G,OAAOmX,OAAO9R,EAAGjE,IAExBiE,EAAEb,MAAMpD,EAAQA,EAAS8U,EACjC,CAODgB,MAAAA,CAAOvD,EAAKtO,EAAGjE,GACb,IAAI8U,EAAOvP,KAAK3G,OAIhB,GAHI2G,KAAK3G,kBAAkBsX,KACzBpB,EAAOvC,EAAI3T,SAEPkD,OAAOqC,SAASoO,IACZuC,IAASvC,EAAI3T,OACrB,MAAM,IAAI+D,UAAU2S,GAAiB,cAAe/P,MAC9B,qBAAuBuP,EAAO,mBAEtD,GAAK9U,EAAS8U,EAAQ7Q,EAAErF,OACtB,MAAM,IAAIwD,WAAW,4BAMvB,OAJA6B,EAAEd,MAAMoP,EAAIxN,SAAS,OAAQ/E,EAAQ8U,EAAM,OACvCvP,KAAK3G,kBAAkBsX,IACzB3Q,KAAK3G,OAAOkX,OAAOhB,EAAM7Q,EAAGjE,GAEvB8U,CACR,EAgBH,MAAM0G,WAAgB3G,GACpB3D,WAAAA,CAAY6D,GACV5D,OAAO,EAAG4D,EACX,CAGD2C,OAAAA,CAAQzT,EAAGjE,GACT,IAAK8B,OAAOqC,SAASF,GACnB,MAAM,IAAItB,UAAU,2BAElB0B,IAAcrE,IAChBA,EAAS,GAEX,IAAIyX,EAAMzX,EACV,KAAQyX,EAAMxT,EAAErF,QAAY,IAAMqF,EAAEwT,IAClCA,GAAO,EAET,OAAO,EAAIA,EAAMzX,CAClB,CAGD+V,MAAAA,CAAO9R,EAAGjE,EAAQoY,QACZ/T,IAAcrE,IAChBA,EAAS,GAEX,IAAI8U,EAAOvP,KAAKmS,QAAQzT,EAAGjE,GAC3B,OAAOiE,EAAEb,MAAMpD,EAAQA,EAAS8U,EAAO,GAAG/P,SAAS,QACpD,CAGD+Q,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAKP,iBAAoBuS,IACtBA,EAAMA,EAAIxN,YAEZ,MAAM0W,EAAO,IAAI3Z,OAAOyQ,EAAK,QACvBuC,EAAO2G,EAAK7c,OAClB,GAAKoB,EAAS8U,EAAQ7Q,EAAErF,OACtB,MAAM,IAAIwD,WAAW,4BAIvB,OAFAqZ,EAAK/X,KAAKO,EAAGjE,GACbiE,EAAEjE,EAAS8U,GAAQ,EACZA,EAAO,CACf,EAsBH,MAAMgpC,WAAajpC,GACjB3D,WAAAA,CAAYwK,EAAS3G,GAMnB,GALK,iBAAoB2G,QACjBrX,IAAc0Q,IACpBA,EAAW2G,EACXA,OAAUrX,QAERA,IAAcqX,EAChBA,GAAW,OACN,IAAK1U,OAAOkL,UAAUwJ,GAC3B,MAAM,IAAI/Y,UAAU,8BAGtBwO,OAAO,EAAG4D,GAUVxP,KAAKmW,QAAUA,CAChB,CAGDhE,OAAAA,CAAQzT,EAAGjE,GACT,IAAK8B,OAAOqC,SAASF,GACnB,MAAM,IAAItB,UAAU,sBAKtB,YAHI0B,IAAcrE,IAChBA,EAAS,GAEJiE,EAAErF,OAASoB,CACnB,CAGD+V,MAAAA,CAAO9R,EAAGjE,EAAQoY,QACZ/T,IAAcrE,IAChBA,EAAS,GAEX,IAAI8U,EAAOvP,KAAKmS,QAAQzT,EAAGjE,GAC3B,GAAK,GAAKuF,KAAKmW,SACPnW,KAAKmW,QAAU5G,EACrB,MAAM,IAAI1S,WAAW,+BAEvB,OAAO6B,EAAEb,MAAMpD,EAAQA,EAAS8U,GAAM/P,SAAS,QAChD,CAGD+Q,MAAAA,CAAOvD,EAAKtO,EAAGjE,QACTqE,IAAcrE,IAChBA,EAAS,GAKP,iBAAoBuS,IACtBA,EAAMA,EAAIxN,YAEZ,MAAM0W,EAAO,IAAI3Z,OAAOyQ,EAAK,QACvBuC,EAAO2G,EAAK7c,OAClB,GAAK,GAAK2G,KAAKmW,SACPnW,KAAKmW,QAAU5G,EACrB,MAAM,IAAI1S,WAAW,+BAEvB,GAAKpC,EAAS8U,EAAQ7Q,EAAErF,OACtB,MAAM,IAAIwD,WAAW,4BAGvB,OADAqZ,EAAK/X,KAAKO,EAAGjE,GACN8U,CACR,EAsBH,MAAMipC,WAAiBlpC,GACrB3D,WAAAA,CAAYlQ,EAAO+T,GACjB5D,MAAM,EAAG4D,GAWTxP,KAAKvE,MAAQA,CACd,CAGD+U,MAAAA,CAAO9R,EAAGjE,EAAQoY,GAChB,OAAO7S,KAAKvE,KACb,CAGD8U,MAAAA,CAAOvD,EAAKtO,EAAGjE,GAEb,OAAO,CACR,EC78EH,SAASg+C,GAAOC,EAAeC,GAAgB,GAC7C,GAAID,EAASE,UAAW,MAAM,IAAI3+C,MAAM,oCACxC,GAAI0+C,GAAiBD,EAASlmB,SAAU,MAAM,IAAIv4B,MAAM,wCAC1D,CACA,SAASK,GAAO4L,EAAUwyC,IAvB1B,SAAeh6C,KAA8Bm6C,GAC3C,KAAMn6C,aAAa5E,YAAa,MAAM,IAAIG,MAAM,uBAChD,GAAI4+C,EAAQx/C,OAAS,IAAMw/C,EAAQhzC,SAASnH,EAAErF,QAC5C,MAAM,IAAIY,MAAM,iCAAiC4+C,oBAA0Bn6C,EAAErF,SACjF,CAoBE+M,CAAMF,GACN,MAAMvD,EAAM+1C,EAASI,UACrB,GAAI5yC,EAAI7M,OAASsJ,EACf,MAAM,IAAI1I,MAAM,yDAAyD0I,IAE7E;sEDs8EsB+K,GAAAiD,eAAGA,GACNjD,GAAAgD,YAAGA,GACFhD,GAAAoD,aAAGA,GACXpD,GAAAqD,KAAGA,GACDrD,GAAAsD,OAAGA,GACNtD,GAAA0qC,IAAGA,GACD1qC,GAAAuD,MAAGA,GACHvD,GAAAiE,MAAGA,GACDjE,GAAAkE,QAAGA,GACJlE,GAAAmE,OAAGA,GACDnE,GAAAoE,SAAGA,GACHpE,GAAAqE,SAAGA,GACFrE,GAAA6E,UAAGA,GACM7E,GAAA4F,mBAAGA,GACG5F,GAAA2F,yBAAGA,GACtB3F,GAAAkH,MAAGA,GACKlH,GAAAgH,cAAGA,GACJhH,GAAAoH,aAAGA,GACPpH,GAAA2H,SAAGA,GACJ3H,GAAA6H,QAAGA,GACN7H,GAAA4qC,KAAGA,GACA5qC,GAAAuI,QAAGA,GACNvI,GAAA6qC,KAAGA,GACC7qC,GAAA8qC,SAAGA,GAGnB9qC,GAAAqrC,OAAkB,CAACnoC,EAAapB,IAAa,IAAIkB,GAAYE,EAAapB,GAG1E9B,GAAAjT,OAAkB,CAACyV,EAAQzV,EAAQ+U,IAAa,IAAIsB,GAAaZ,EAAQzV,EAAQ+U,GAIvE9B,GAAA2J,GAAI7H,GAAY,IAAIuB,GAAK,EAAGvB,GAI3B9B,GAAAsrC,IAAIxpC,GAAY,IAAIuB,GAAK,EAAGvB,GAI5B9B,GAAAurC,IAAIzpC,GAAY,IAAIuB,GAAK,EAAGvB,GAI5B9B,GAAA2K,IAAI7I,GAAY,IAAIuB,GAAK,EAAGvB,GAI5B9B,GAAAwrC,IAAI1pC,GAAY,IAAIuB,GAAK,EAAGvB,GAI5B9B,GAAAyrC,IAAI3pC,GAAY,IAAIuB,GAAK,EAAGvB,GAI3B9B,GAAA0rC,KAAI5pC,GAAY,IAAI8B,GAAW9B,GAI9B9B,GAAA2rC,MAAI7pC,GAAY,IAAIwB,GAAO,EAAGxB,GAI9B9B,GAAA4rC,MAAI9pC,GAAY,IAAIwB,GAAO,EAAGxB,GAI9B9B,GAAA6rC,MAAI/pC,GAAY,IAAIwB,GAAO,EAAGxB,GAI9B9B,GAAA8rC,MAAIhqC,GAAY,IAAIwB,GAAO,EAAGxB,GAI9B9B,GAAA+rC,MAAIjqC,GAAY,IAAIwB,GAAO,EAAGxB,GAI7B9B,GAAAgsC,OAAIlqC,GAAY,IAAIgC,GAAahC,GAIrC9B,GAAAisC,GAAInqC,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI1B9B,GAAAksC,IAAIpqC,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI3B9B,GAAAwB,IAAIM,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI3B9B,GAAAuB,IAAIO,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI3B9B,GAAAsB,IAAIQ,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI3B9B,GAAAqB,IAAIS,GAAY,IAAI4oC,GAAI,EAAG5oC,GAI1B9B,GAAAoB,KAAIU,GAAY,IAAIiC,GAAUjC,GAI7B9B,GAAAmB,MAAIW,GAAY,IAAIyB,GAAM,EAAGzB,GAI7B9B,GAAAkB,MAAIY,GAAY,IAAIyB,GAAM,EAAGzB,GAI7B9B,GAAAiB,MAAIa,GAAY,IAAIyB,GAAM,EAAGzB,GAI7B9B,GAAAgB,MAAIc,GAAY,IAAIyB,GAAM,EAAGzB,GAI7B9B,GAAAe,MAAIe,GAAY,IAAIyB,GAAM,EAAGzB,GAI5B9B,GAAAc,OAAIgB,GAAY,IAAIkC,GAAYlC,GAGnC9B,GAAAa,IAAIiB,GAAY,IAAImC,GAAMnC,GAGxB9B,GAAAY,MAAIkB,GAAY,IAAIoC,GAAQpC,GAG9B9B,GAAAW,IAAImB,GAAY,IAAIqC,GAAOrC,GAGzB9B,GAAAU,MAAIoB,GAAY,IAAIsC,GAAStC,GAG1C9B,GAAAS,OAAkB,CAACqE,EAAQhD,EAAUiD,IAAmB,IAAIF,GAAUC,EAAQhD,EAAUiD,GAGxF/E,GAAAQ,KAAgB,CAAC6G,EAAMC,EAAKxF,IAAa,IAAIsF,GAAaC,EAAMC,EAAKxF,GAGrE9B,GAAAO,IAAe,CAAC+D,EAAeC,EAAOzC,IAAa,IAAIuC,GAASC,EAAeC,EAAOzC,GAGtF9B,GAAAM,MAAiB,CAACuF,EAAOC,EAAehE,IAAa,IAAIoF,GAAMrB,EAAOC,EAAehE,GAGrF9B,GAAAK,yBAAoC,CAACmC,EAAQV,IAAa,IAAI6D,GAAyBnD,EAAQV,GAG/F9B,GAAAI,KAAgB,CAACzU,EAAQmW,IAAa,IAAI8oC,GAAKj/C,EAAQmW,GAG3C9B,GAAAG,KAAI2B,GAAY,IAAIyG,GAAQzG,GAGxC9B,GAAAE,KAAgB,CAACuI,EAAS3G,IAAa,IAAI+oC,GAAKpiC,EAAS3G,GAGzD9B,GAAAmsC,MAAiB,CAACp+C,EAAO+T,IAAa,IAAIgpC,GAAS/8C,EAAO+T,wBEnpFrCsqC,EAAAzkB,iBAAA,SAAA/X,qCAYCA,EAThB,EACNvgB,OAAAiH,eAAA1H,EAAA,aAAA,CAAAb,OAAA,IACIa,EAAA2zB,IAAA3zB,EAAAiD,MAAAjD,EAAAy9C,SAAAz9C,EAAA4F,IAAA5F,EAAA09C,MAAA19C,EAAA29C,OAAA39C,EAAA49C,IAAA59C,EAAA8a,KAAA9a,EAAA69C,OAAA79C,EAAAib,UAAAjb,EAAA89C,KAAA99C,EAAA+9C,KAAA/9C,EAAAg+C,KAAAh+C,EAAAi+C,KAAAj+C,EAAAk+C,IAAAl+C,EAAA2a,IAAA3a,EAAA6R,OAAA7R,EAAA+R,IAAA/R,EAAAiS,IAAAjS,EAAAm+C,IAAAn+C,EAAA+b,IAAA/b,EAAA8Q,IAAA9Q,EAAA08C,IAAA18C,EAAAo+C,GAAAp+C,EAAA+a,QAAA,EACE,MAAAsjC,EAAAz+C,GACA0+C,EAAAz+C,EAAAA,QACA85B,EAAAZ,EAAAc,IACA,IAAA0kB,EAAA3+C,GACAa,OAAAiH,eAAA1H,EAAA,KAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAxjC,EAAA,IACAta,OAAAiH,eAAA1H,EAAA,KAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAlB,EAAA,WAgBD31C,eAAA1H,EAAA,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAA7B,GAAA,WAIIh1C,eAAA1H,EAAA,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAjB,GAAA,IACD51C,OAAAA,eAAO1H,EAAU,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAxiC,GAAA,IACpBrU,OAAAA,eAAA1H,EAAA,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAA5rC,GAAA,IACJjL,OAAAA,eAAA1H,EAAA,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAtsC,GAAA,WACQvK,eAAA1H,EAAA,MAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAAxsC,GAAA,WAERrK,eAAA1H,EAAA,SAAA,CAAA2H,YAAA,EAAAC,eAAA,OAAA22C,EAAA1sC,MAAA,oBACiBwsC,EAAArrC,OACT3D,WAAAA,CAAG4D,EAACurC,EAAAtrC,SACTD,EAAWC,GACdxP,KAAA8N,MAAA6sC,EAAAA,EAAA7sC,MAAAyB,GACDvP,KAAA86C,OAAcA,CACL,CAERtqC,MAAAA,CAAA9R,EAAAjE,EAAA,GACD,MAAAJ,EAAA,IAAoB47B,EAAAX,QAAAt1B,KAAA8N,KAAA0C,OAAA9R,EAAAjE,GAAA,GAAA,MACX,OAAAuF,KAAA86C,OACLzgD,EAAA0lB,WAAAxQ,KAAAA,MAAAmO,QAMJrjB,CACA,QAEC2S,EAAAtO,EAAAjE,EAAA,GAImB,OAHpBuF,KAAA86C,SACA9tC,EAAAA,EAAA4S,OAAA,OAAArQ,OAEoBvP,KAAgB8N,KAAAyC,OAAAvD,EAAA+R,YAAAxiB,OAAAgT,KAAAA,KAAAA,MAAA7Q,EAAAjE,EACpC,uBAGK,IAAAsgD,EAAA,GAAA,EAAAvrC,GAELlT,EAAA2a,IAAAA,EAIA3a,EAAAk+C,gBAFA,aAA2B,GAAA,EAAAhrC,IAM3BlT,EAAAi+C,KANA,SAAA/qC,UAIe,IAAKurC,EAAgB,IAAA,EAAAvrC,IAMpClT,EAAAg+C,iBAFA,OAAe,IAAaS,EAAoB,IAAA,EAAAvrC,MAe3C6qC,KAfL,SAAA7qC,GAIA,OAAe,IAAAurC,EAAmB,IAAA,EAAAvrC,MAetB4qC,KAHZA,mBACA,IAAQW,EAAM,IAAA,EAAAvrC,UAIdwrC,UAAmCL,EAAArrC,OACnC3D,WAAAA,CAAAuE,EAAmB+qC,EAAKC,EAAO1rC,GACtB5D,MAAAsE,EAAAX,KAAAC,GAEJxP,KAAAkQ,OAAAA,EACLlQ,KAAAi7C,QAAeA,EACfj7C,KAAAk7C,QAAAA,CAEY,QACHx8C,EAAAjE,GACT,OAAAwgD,KAAAA,aAAA/qC,OAAAM,OAAA9R,EAAAjE,GACA,QAEkBuS,EAAAtO,EAAMjE,GACnB,OAAAuF,KAAAkQ,OAAAK,OACJ2qC,KAAAA,QAAAluC,GAAAtO,EAAAjE,EAKD,cAEC,OAAAuF,KAAAkQ,OAAAiC,QAAAzT,EAAAjE,EAIO,IAMP8c,mBAJY/H,UACL,IAAAwrC,KAAYL,EAAA7sC,MAAA,KAAApP,GAAAk8C,IAAAA,EAAAptC,UAAA9O,KAAA2xB,GAAAA,EAAA5Y,YAAAjI,oBAIAmrC,EAAOrrC,qBACXE,GACf5D,OAAA,EAAA4D,GACDxP,KAAAkQ,OAAAA,EACAlQ,KAAAyT,eAAqB,EAAiBknC,EAAItjC,KACtC,CAEI9G,MAAAA,CAAmBvD,EAAAtO,EAAAjE,KAC3B,OAAAuS,QACIhN,KAAwByT,cAAAlD,OAAA7R,EAAAA,EAAAjE,IAE5BuF,KAAAyT,cAAAlD,OAAA7R,EAAAA,EAAAjE,GAAAuF,KAAckQ,OAAAK,OAAIvD,EAAAtO,EAAAjE,EAAA,GAAA,UAEdiE,EAAAjE,EAAA,GACI,MAAAgZ,OAAUA,cAAAjD,OAAA9R,EAAAjE,GAClB,GAAA,IAAAgZ,EAEsB,OAAA,KAEtB,GAA4B,IAA5BA,EACA,OAAAzT,KAAAkQ,OAAAM,OAAA9R,EAAAjE,EAAA,SACA,IAAAR,MAAyB,kBAAA+F,KAAAwP,kBAEhB9Q,EAAAjE,EAAA,GACD,MAAAgZ,OAAWA,cAACjD,OAAA9R,EAAAjE,GACf,GAAA,IAAAgZ,EACL,OAAA,EAMQ,GAAM,IAAAA,EACd,OAAAzT,KAAAkQ,OAAAiC,QAAAzT,EAAAjE,EAAA,GAAA,EAEe,MAAa,IAAAR,MAAS,kBAAA+F,KAAAwP,SACpC,EASG2rC,SAAAA,KACJ,GAAA,IAAA1/C,EAEA,OAAe,EAEf,GAAA,IAAAA,EAEe,OACd,EAID,MAAA,IAAAxB,MAA0C,iBAAAwB,GAE1C2/C,SAAAA,EAAA3/C,GACK,OAAAA,EAAA,EAAA,+JAnBL0+C,kBAJA3qC,GAEA,OAAW,IAAA6rC,EAAuBnrC,EAAAV,MAK9B4H,KAFJA,SAAA5H,UAAA,OAAkBmrC,EAAAA,EAAAtjC,MAAA8jC,EAAAC,EAAA5rC,MAsClB0qC,IAbA,SAAAloC,EAAAxC,YAAA,EAAAmrC,EAAAtiC,KAAA,UAEsBnI,GACd,EACRyqC,EACKxsC,QAEG9U,CAAAA,GACH,EAAAshD,EAAA1sC,KAAA+D,GAAA2oC,EAAAA,EAAAlgD,QAAApB,GAAAA,EAAAkW,kBAEL,OAAA,IAAAyrC,EAAA9qC,GAAA,EAAAJ,YAAAA,IAAAA,IAAA,CAAAA,YAAAN,aAIAyqC,SAAA/lC,EAAYhE,EACLV,YACQ,EAAAmrC,EAAaxsC,oBAE5BsB,UAAA,oHAhBA,OAAA,ghCC9LA,MAAM6rC,GAAO92C,GAA4BA,aAAa1K,WAOzCyhD,GAAc5iD,GACzB,IAAI6iD,SAAS7iD,EAAI6B,OAAQ7B,EAAI0F,WAAY1F,EAAI+E,YAGlC+9C,GAAOA,CAAC1mC,EAAc7B,IAAmB6B,GAAS,GAAK7B,EAAW6B,IAAS7B,EAKxF,KADgF,KAA5D,IAAIpZ,WAAW,IAAI4hD,YAAY,CAAC,YAAalhD,QAAQ,IAC9D,MAAM,IAAIP,MAAM,+CAwErB,SAAU0hD,GAAQz8C,GAEtB,GADoB,iBAATA,IAAmBA,EAZ1B,SAAsBgD,GAC1B,GAAmB,iBAARA,EAAkB,MAAM,IAAIjI,MAAM,2CAA2CiI,GACxF,OAAO,IAAIpI,YAAW,IAAIs5B,aAAc7iB,OAAOrO,GACjD,CASuCtC,CAAYV,KAC5Co8C,GAAIp8C,GAAO,MAAM,IAAIjF,MAAM,mCAAmCiF,GACnE,OAAOA,CACT,CAiBM,MAAgBiqC,GAsBpBzrB,KAAAA,GACE,OAAO1d,KAAK47C,YACd,EA4BI,SAAUC,GAAmCC,GACjD,MAAMC,EAAStvC,GAA2BqvC,IAAWxY,OAAOqY,GAAQlvC,IAAM+2B,SACpE/qC,EAAMqjD,IAIZ,OAHAC,EAAMjD,UAAYrgD,EAAIqgD,UACtBiD,EAAMC,SAAWvjD,EAAIujD,SACrBD,EAAMpsC,OAAS,IAAMmsC,IACdC,CACT,CCrKM,MAAgBE,WAAgC9S,GAcpDx9B,WAAAA,CACWqwC,EACFlD,EACEoD,EACAxhD,GAETkR,QALS5L,KAAAg8C,SAAAA,EACFh8C,KAAA84C,UAAAA,EACE94C,KAAAk8C,UAAAA,EACAl8C,KAAAtF,KAAAA,EATDsF,KAAAwyB,UAAW,EACXxyB,KAAA3G,OAAS,EACT2G,KAAA6E,IAAM,EACN7E,KAAA44C,WAAY,EASpB54C,KAAKxF,OAAS,IAAIV,WAAWkiD,GAC7Bh8C,KAAKm8C,KAAOZ,GAAWv7C,KAAKxF,OAC9B,CACA8oC,MAAAA,CAAOpkC,GACLu5C,GAAOz4C,MACP,MAAMm8C,KAAEA,EAAI3hD,OAAEA,EAAMwhD,SAAEA,GAAah8C,KAE7BjH,GADNmG,EAAOy8C,GAAQz8C,IACE7F,OACjB,IAAK,IAAIwL,EAAM,EAAGA,EAAM9L,GAAO,CAC7B,MAAMqjD,EAAO7gD,KAAKoH,IAAIq5C,EAAWh8C,KAAK6E,IAAK9L,EAAM8L,GAEjD,GAAIu3C,IAASJ,EAKbxhD,EAAOsK,IAAI5F,EAAKgI,SAASrC,EAAKA,EAAMu3C,GAAOp8C,KAAK6E,KAChD7E,KAAK6E,KAAOu3C,EACZv3C,GAAOu3C,EACHp8C,KAAK6E,MAAQm3C,IACfh8C,KAAKq8C,QAAQF,EAAM,GACnBn8C,KAAK6E,IAAM,OAVb,CACE,MAAMy3C,EAAWf,GAAWr8C,GAC5B,KAAO88C,GAAYjjD,EAAM8L,EAAKA,GAAOm3C,EAAUh8C,KAAKq8C,QAAQC,EAAUz3C,IAa1E,OAFA7E,KAAK3G,QAAU6F,EAAK7F,OACpB2G,KAAKu8C,aACEv8C,IACT,CACAw8C,UAAAA,CAAWt2C,GACTuyC,GAAOz4C,MACP1F,GAAO4L,EAAKlG,MACZA,KAAKwyB,UAAW,EAIhB,MAAMh4B,OAAEA,EAAM2hD,KAAEA,EAAIH,SAAEA,EAAQthD,KAAEA,GAASsF,KACzC,IAAI6E,IAAEA,GAAQ7E,KAEdxF,EAAOqK,KAAS,IAChB7E,KAAKxF,OAAO0M,SAASrC,GAAKT,KAAK,GAE3BpE,KAAKk8C,UAAYF,EAAWn3C,IAC9B7E,KAAKq8C,QAAQF,EAAM,GACnBt3C,EAAM,GAGR,IAAK,IAAInM,EAAImM,EAAKnM,EAAIsjD,EAAUtjD,IAAK8B,EAAO9B,GAAK,GAhFrD,SAAsByjD,EAAgB99C,EAAoB5C,EAAef,GACvE,GAAiC,mBAAtByhD,EAAKM,aAA6B,OAAON,EAAKM,aAAap+C,EAAY5C,EAAOf,GACzF,MAAMgiD,EAAOh2C,OAAO,IACdi2C,EAAWj2C,OAAO,YAClBk2C,EAAKn7C,OAAQhG,GAASihD,EAAQC,GAC9BE,EAAKp7C,OAAOhG,EAAQkhD,GACpB70B,EAAIptB,EAAO,EAAI,EACf2lC,EAAI3lC,EAAO,EAAI,EACrByhD,EAAKW,UAAUz+C,EAAaypB,EAAG80B,EAAIliD,GACnCyhD,EAAKW,UAAUz+C,EAAagiC,EAAGwc,EAAIniD,EACrC,CA0EI+hD,CAAaN,EAAMH,EAAW,EAAGt1C,OAAqB,EAAd1G,KAAK3G,QAAaqB,GAC1DsF,KAAKq8C,QAAQF,EAAM,GACnB,MAAMY,EAAQxB,GAAWr1C,GACnBnN,EAAMiH,KAAK84C,UAEjB,GAAI//C,EAAM,EAAG,MAAM,IAAIkB,MAAM,+CAC7B,MAAM00B,EAAS51B,EAAM,EACfkjC,EAAQj8B,KAAKkE,MACnB,GAAIyqB,EAASsN,EAAM5iC,OAAQ,MAAM,IAAIY,MAAM,sCAC3C,IAAK,IAAIvB,EAAI,EAAGA,EAAIi2B,EAAQj2B,IAAKqkD,EAAMD,UAAU,EAAIpkD,EAAGujC,EAAMvjC,GAAIgC,EACpE,CACA8oC,MAAAA,GACE,MAAMhpC,OAAEA,EAAMs+C,UAAEA,GAAc94C,KAC9BA,KAAKw8C,WAAWhiD,GAChB,MAAMoI,EAAMpI,EAAOqD,MAAM,EAAGi7C,GAE5B,OADA94C,KAAKg9C,UACEp6C,CACT,CACAg5C,UAAAA,CAAWqB,GACTA,IAAAA,EAAO,IAAKj9C,KAAK2L,aACjBsxC,EAAGn4C,OAAO9E,KAAKkE,OACf,MAAM83C,SAAEA,EAAQxhD,OAAEA,EAAMnB,OAAEA,EAAMm5B,SAAEA,EAAQomB,UAAEA,EAAS/zC,IAAEA,GAAQ7E,KAM/D,OALAi9C,EAAG5jD,OAASA,EACZ4jD,EAAGp4C,IAAMA,EACTo4C,EAAGzqB,SAAWA,EACdyqB,EAAGrE,UAAYA,EACXv/C,EAAS2iD,GAAUiB,EAAGziD,OAAOsK,IAAItK,GAC9ByiD,CACT,EC7GF,MAAMC,GAAMA,CAAC14C,EAAW9F,EAAWhD,IAAe8I,EAAI9F,GAAO8F,EAAI9I,EAE3DyhD,GAAMA,CAAC34C,EAAW9F,EAAWhD,IAAe8I,EAAI9F,EAAM8F,EAAI9I,EAAMgD,EAAIhD,EAKpE0hD,GAA0B,IAAI1B,YAAY,CAC9C,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,aAKhF2B,GAAoB,IAAI3B,YAAY,CACxC,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAKhF4B,GAA2B,IAAI5B,YAAY,IACjD,MAAMhX,WAAeuX,GAYnBtwC,WAAAA,GACEC,MAAM,GAAI,GAAI,GAAG,GAVnB5L,KAAA+pB,EAAY,EAARszB,GAAG,GACPr9C,KAAAgqB,EAAY,EAARqzB,GAAG,GACPr9C,KAAAiqB,EAAY,EAARozB,GAAG,GACPr9C,KAAAkqB,EAAY,EAARmzB,GAAG,GACPr9C,KAAAuL,EAAY,EAAR8xC,GAAG,GACPr9C,KAAAu9C,EAAY,EAARF,GAAG,GACPr9C,KAAAw9C,EAAY,EAARH,GAAG,GACPr9C,KAAAy9C,EAAY,EAARJ,GAAG,EAIP,CACUn5C,GAAAA,GACR,MAAM6lB,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAAC3e,EAAEA,EAACgyC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMz9C,KACnC,MAAO,CAAC+pB,EAAGC,EAAGC,EAAGC,EAAG3e,EAAGgyC,EAAGC,EAAGC,EAC/B,CAEU34C,GAAAA,CACRilB,EAAWC,EAAWC,EAAWC,EAAW3e,EAAWgyC,EAAWC,EAAWC,GAE7Ez9C,KAAK+pB,EAAQ,EAAJA,EACT/pB,KAAKgqB,EAAQ,EAAJA,EACThqB,KAAKiqB,EAAQ,EAAJA,EACTjqB,KAAKkqB,EAAQ,EAAJA,EACTlqB,KAAKuL,EAAQ,EAAJA,EACTvL,KAAKu9C,EAAQ,EAAJA,EACTv9C,KAAKw9C,EAAQ,EAAJA,EACTx9C,KAAKy9C,EAAQ,EAAJA,CACX,CACUpB,OAAAA,CAAQF,EAAgB1hD,GAEhC,IAAK,IAAI/B,EAAI,EAAGA,EAAI,GAAIA,IAAK+B,GAAU,EAAG6iD,GAAS5kD,GAAKyjD,EAAKuB,UAAUjjD,GAAQ,GAC/E,IAAK,IAAI/B,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,MAAMilD,EAAML,GAAS5kD,EAAI,IACnBklD,EAAKN,GAAS5kD,EAAI,GAClBmlD,EAAKpC,GAAKkC,EAAK,GAAKlC,GAAKkC,EAAK,IAAOA,IAAQ,EAC7CG,EAAKrC,GAAKmC,EAAI,IAAMnC,GAAKmC,EAAI,IAAOA,IAAO,GACjDN,GAAS5kD,GAAMolD,EAAKR,GAAS5kD,EAAI,GAAKmlD,EAAKP,GAAS5kD,EAAI,IAAO,EAGjE,IAAIqxB,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,EAAC3e,EAAEA,EAACgyC,EAAEA,EAACC,EAAEA,EAACC,EAAEA,GAAMz9C,KACjC,IAAK,IAAItH,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,MACMmsC,EAAM4Y,GADGhC,GAAKlwC,EAAG,GAAKkwC,GAAKlwC,EAAG,IAAMkwC,GAAKlwC,EAAG,KACzB2xC,GAAI3xC,EAAGgyC,EAAGC,GAAKJ,GAAS1kD,GAAK4kD,GAAS5kD,GAAM,EAE/DosC,GADS2W,GAAK1xB,EAAG,GAAK0xB,GAAK1xB,EAAG,IAAM0xB,GAAK1xB,EAAG,KAC7BozB,GAAIpzB,EAAGC,EAAGC,GAAM,EACrCwzB,EAAID,EACJA,EAAID,EACJA,EAAIhyC,EACJA,EAAK2e,EAAI2a,EAAM,EACf3a,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAK8a,EAAKC,EAAM,EAGlB/a,EAAKA,EAAI/pB,KAAK+pB,EAAK,EACnBC,EAAKA,EAAIhqB,KAAKgqB,EAAK,EACnBC,EAAKA,EAAIjqB,KAAKiqB,EAAK,EACnBC,EAAKA,EAAIlqB,KAAKkqB,EAAK,EACnB3e,EAAKA,EAAIvL,KAAKuL,EAAK,EACnBgyC,EAAKA,EAAIv9C,KAAKu9C,EAAK,EACnBC,EAAKA,EAAIx9C,KAAKw9C,EAAK,EACnBC,EAAKA,EAAIz9C,KAAKy9C,EAAK,EACnBz9C,KAAK8E,IAAIilB,EAAGC,EAAGC,EAAGC,EAAG3e,EAAGgyC,EAAGC,EAAGC,EAChC,CACUlB,UAAAA,GACRe,GAASl5C,KAAK,EAChB,CACA44C,OAAAA,GACEh9C,KAAK8E,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9B9E,KAAKxF,OAAO4J,KAAK,EACnB,EAsBK,MAAM4jC,GAAyB6T,IAAgB,IAAM,IAAInX;wECzFhE,SAASqZ,GAAOjhD,GAAO,IAAI/D,EAAM+D,EAAIzD,OAAQ,OAASN,GAAO,GAAK+D,EAAI/D,GAAO,CAAK,CAIlF,MAiBMilD,GAAkB,IAGlBC,GAAkBD,IAGlBE,GAAkB,GASlBC,GAAkB,GA2BlBC,GACJ,IAAItkD,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEpEukD,GACJ,IAAIvkD,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,KAE7EwkD,GACJ,IAAIxkD,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAEhDykD,GACJ,IAAIzkD,WAAW,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,KAgBxD0kD,GAAgB,IAAIzkD,MAAM,KAChCgkD,GAAOS,IAOP,MAAMC,GAAgB,IAAI1kD,MAAMmkD,IAChCH,GAAOU,IAKP,MAAMC,GAAgB,IAAI3kD,MAjBJ,KAkBtBgkD,GAAOW,IAMP,MAAMC,GAAgB,IAAI5kD,MAAM6kD,KAChCb,GAAOY,IAGP,MAAME,GAAgB,IAAI9kD,MAhGF,IAiGxBgkD,GAAOc,IAGP,MAAMC,GAAgB,IAAI/kD,MAAMmkD,IAKhC,SAASa,GAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElEp/C,KAAKg/C,YAAeA,EACpBh/C,KAAKi/C,WAAeA,EACpBj/C,KAAKk/C,WAAeA,EACpBl/C,KAAKm/C,MAAeA,EACpBn/C,KAAKo/C,WAAeA,EAGpBp/C,KAAKq/C,UAAeL,GAAeA,EAAY3lD,MACjD,CAGA,IAAIimD,GACAC,GACAC,GAGJ,SAASC,GAASC,EAAUC,GAC1B3/C,KAAK0/C,SAAWA,EAChB1/C,KAAK4/C,SAAW,EAChB5/C,KAAK2/C,UAAYA,CACnB,CA1BA5B,GAAOe,IA8BP,MAAMe,GAAUC,GAEPA,EAAO,IAAMpB,GAAWoB,GAAQpB,GAAW,KAAOoB,IAAS,IAQ9DC,GAAYA,CAAC3kD,EAAG4hB,KAGpB5hB,EAAE4kD,YAAY5kD,EAAEynC,WAAmB,IAAL7lB,EAC9B5hB,EAAE4kD,YAAY5kD,EAAEynC,WAAc7lB,IAAM,EAAK,GAAI,EAQzCijC,GAAYA,CAAC7kD,EAAGK,EAAOpC,KAEvB+B,EAAE8kD,SAtIc,GAsIS7mD,GAC3B+B,EAAE+kD,QAAW1kD,GAASL,EAAE8kD,SAAY,MACpCH,GAAU3kD,EAAGA,EAAE+kD,QACf/kD,EAAE+kD,OAAS1kD,GAzIO,GAyIcL,EAAE8kD,SAClC9kD,EAAE8kD,UAAY7mD,EA1II,KA4IlB+B,EAAE+kD,QAAW1kD,GAASL,EAAE8kD,SAAY,MACpC9kD,EAAE8kD,UAAY7mD,EAChB,EAII+mD,GAAYA,CAAChlD,EAAGM,EAAG2kD,KAEvBJ,GAAU7kD,EAAGilD,EAAS,EAAJ3kD,GAAiB2kD,EAAS,EAAJ3kD,EAAQ,GAAW,EASvD4kD,GAAaA,CAACtmD,EAAMjB,KAExB,IAAI6J,EAAM,EACV,GACEA,GAAc,EAAP5I,EACPA,KAAU,EACV4I,IAAQ,UACC7J,EAAM,GACjB,OAAO6J,IAAQ,CAAC,EAiIZ29C,GAAYA,CAACF,EAAMT,EAAUY,KAKjC,MAAMC,EAAY,IAAI1mD,MAAMokD,IAC5B,IACIjwC,EACA1N,EAFAxG,EAAO,EAOX,IAAKkU,EAAO,EAAGA,GAAQiwC,GAAYjwC,IACjClU,EAAQA,EAAOwmD,EAAStyC,EAAO,IAAO,EACtCuyC,EAAUvyC,GAAQlU,EASpB,IAAKwG,EAAI,EAAIA,GAAKo/C,EAAUp/C,IAAK,CAC/B,IAAIzH,EAAMsnD,EAAS,EAAJ7/C,EAAQ,GACX,IAARzH,IAEJsnD,EAAS,EAAJ7/C,GAAkB8/C,GAAWG,EAAU1nD,KAAQA,GAItD,GAgHI2nD,GAActlD,IAElB,IAAIoF,EAGJ,IAAKA,EAAI,EAAGA,EAAIy9C,GAAYz9C,IAAOpF,EAAEulD,UAAc,EAAJngD,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAAI09C,GAAY19C,IAAOpF,EAAEwlD,UAAc,EAAJpgD,GAAkB,EACjE,IAAKA,EAAI,EAAGA,EAtcU,GAscMA,IAAOpF,EAAEylD,QAAY,EAAJrgD,GAAkB,EAE/DpF,EAAEulD,UAAUG,KAA0B,EACtC1lD,EAAE2lD,QAAU3lD,EAAE4lD,WAAa,EAC3B5lD,EAAE6lD,SAAW7lD,EAAE8lD,QAAU,CAAC,EAOtBC,GAAa/lD,IAEbA,EAAE8kD,SAAW,EACfH,GAAU3kD,EAAGA,EAAE+kD,QACN/kD,EAAE8kD,SAAW,IAEtB9kD,EAAE4kD,YAAY5kD,EAAEynC,WAAaznC,EAAE+kD,QAEjC/kD,EAAE+kD,OAAS,EACX/kD,EAAE8kD,SAAW,CAAC,EAOVkB,GAAUA,CAACf,EAAM7/C,EAAG1F,EAAGumD,KAE3B,MAAMC,EAAU,EAAJ9gD,EACN+gD,EAAU,EAAJzmD,EACZ,OAAQulD,EAAKiB,GAAgBjB,EAAKkB,IAC1BlB,EAAKiB,KAAkBjB,EAAKkB,IAAiBF,EAAM7gD,IAAM6gD,EAAMvmD,EAAG,EAStE0mD,GAAaA,CAACpmD,EAAGilD,EAAMjiC,KAK3B,MAAM9L,EAAIlX,EAAEqmD,KAAKrjC,GACjB,IAAI7c,EAAI6c,GAAK,EACb,KAAO7c,GAAKnG,EAAEsmD,WAERngD,EAAInG,EAAEsmD,UACRN,GAAQf,EAAMjlD,EAAEqmD,KAAKlgD,EAAI,GAAInG,EAAEqmD,KAAKlgD,GAAInG,EAAEimD,QAC1C9/C,KAGE6/C,GAAQf,EAAM/tC,EAAGlX,EAAEqmD,KAAKlgD,GAAInG,EAAEimD,SAGlCjmD,EAAEqmD,KAAKrjC,GAAKhjB,EAAEqmD,KAAKlgD,GACnB6c,EAAI7c,EAGJA,IAAM,EAERnG,EAAEqmD,KAAKrjC,GAAK9L,CAAC,EAUTqvC,GAAiBA,CAACvmD,EAAGwmD,EAAOC,KAKhC,IAAI/B,EACAgC,EAEA9nD,EACA+nD,EAFAC,EAAK,EAIT,GAAmB,IAAf5mD,EAAE6lD,SACJ,GACEnB,EAAyC,IAAlC1kD,EAAE4kD,YAAY5kD,EAAE6mD,QAAUD,KACjClC,IAA2C,IAAlC1kD,EAAE4kD,YAAY5kD,EAAE6mD,QAAUD,OAAiB,EACpDF,EAAK1mD,EAAE4kD,YAAY5kD,EAAE6mD,QAAUD,KAClB,IAATlC,EACFM,GAAUhlD,EAAG0mD,EAAIF,IAIjB5nD,EAAO2kD,GAAamD,GACpB1B,GAAUhlD,EAAGpB,EAAOgkD,GAAa,EAAG4D,GACpCG,EAAQ3D,GAAYpkD,GACN,IAAV+nD,IACFD,GAAMjD,GAAY7kD,GAClBimD,GAAU7kD,EAAG0mD,EAAIC,IAEnBjC,IACA9lD,EAAO6lD,GAAOC,GAGdM,GAAUhlD,EAAGpB,EAAM6nD,GACnBE,EAAQ1D,GAAYrkD,GACN,IAAV+nD,IACFjC,GAAQhB,GAAU9kD,GAClBimD,GAAU7kD,EAAG0kD,EAAMiC,WAOhBC,EAAK5mD,EAAE6lD,UAGlBb,GAAUhlD,EA1iBQ,IA0iBMwmD,EAAM,EAY1BM,GAAaA,CAAC9mD,EAAG25B,KAIrB,MAAMsrB,EAAWtrB,EAAK2qB,SAChByC,EAAWptB,EAAK4qB,UAAUX,YAC1BK,EAAYtqB,EAAK4qB,UAAUN,UAC3BF,EAAWpqB,EAAK4qB,UAAUR,MAChC,IAAI3+C,EAAG1F,EAEHsnD,EADAxC,GAAY,EAUhB,IAHAxkD,EAAEsmD,SAAW,EACbtmD,EAAEinD,SAxlBoB,IA0lBjB7hD,EAAI,EAAGA,EAAI2+C,EAAO3+C,IACQ,IAAzB6/C,EAAS,EAAJ7/C,IACPpF,EAAEqmD,OAAOrmD,EAAEsmD,UAAY9B,EAAWp/C,EAClCpF,EAAEimD,MAAM7gD,GAAK,GAGb6/C,EAAS,EAAJ7/C,EAAQ,GAAa,EAS9B,KAAOpF,EAAEsmD,SAAW,GAClBU,EAAOhnD,EAAEqmD,OAAOrmD,EAAEsmD,UAAa9B,EAAW,IAAMA,EAAW,EAC3DS,EAAY,EAAP+B,GAAqB,EAC1BhnD,EAAEimD,MAAMe,GAAQ,EAChBhnD,EAAE2lD,UAEE1B,IACFjkD,EAAE4lD,YAAcmB,EAAa,EAAPC,EAAW,IASrC,IALArtB,EAAK6qB,SAAWA,EAKXp/C,EAAKpF,EAAEsmD,UAAY,EAAclhD,GAAK,EAAGA,IAAOghD,GAAWpmD,EAAGilD,EAAM7/C,GAKzE4hD,EAAOjD,EACP,GAGE3+C,EAAIpF,EAAEqmD,KAAK,GACXrmD,EAAEqmD,KAAK,GAAiBrmD,EAAEqmD,KAAKrmD,EAAEsmD,YACjCF,GAAWpmD,EAAGilD,EAAM,GAGpBvlD,EAAIM,EAAEqmD,KAAK,GAEXrmD,EAAEqmD,OAAOrmD,EAAEinD,UAAY7hD,EACvBpF,EAAEqmD,OAAOrmD,EAAEinD,UAAYvnD,EAGvBulD,EAAY,EAAP+B,GAAqB/B,EAAS,EAAJ7/C,GAAkB6/C,EAAS,EAAJvlD,GACtDM,EAAEimD,MAAMe,IAAShnD,EAAEimD,MAAM7gD,IAAMpF,EAAEimD,MAAMvmD,GAAKM,EAAEimD,MAAM7gD,GAAKpF,EAAEimD,MAAMvmD,IAAM,EACvEulD,EAAS,EAAJ7/C,EAAQ,GAAa6/C,EAAS,EAAJvlD,EAAQ,GAAasnD,EAGpDhnD,EAAEqmD,KAAK,GAAiBW,IACxBZ,GAAWpmD,EAAGilD,EAAM,SAEbjlD,EAAEsmD,UAAY,GAEvBtmD,EAAEqmD,OAAOrmD,EAAEinD,UAAYjnD,EAAEqmD,KAAK,GA5cba,EAAClnD,EAAG25B,KAIrB,MAAMsrB,EAAkBtrB,EAAK2qB,SACvBE,EAAkB7qB,EAAK6qB,SACvBuC,EAAkBptB,EAAK4qB,UAAUX,YACjCK,EAAkBtqB,EAAK4qB,UAAUN,UACjC0C,EAAkBhtB,EAAK4qB,UAAUV,WACjC1jC,EAAkBwZ,EAAK4qB,UAAUT,WACjCE,EAAkBrqB,EAAK4qB,UAAUP,WACvC,IAAIt3B,EACAtnB,EAAG1F,EACHoT,EACAq0C,EACA3d,EACA4d,EAAW,EAEf,IAAKt0C,EAAO,EAAGA,GAAQiwC,GAAYjwC,IACjC9S,EAAEolD,SAAStyC,GAAQ,EAQrB,IAFAmyC,EAA0B,EAArBjlD,EAAEqmD,KAAKrmD,EAAEinD,UAAgB,GAAa,EAEtCv6B,EAAI1sB,EAAEinD,SAAW,EAAGv6B,EAtOH,IAsOoBA,IACxCtnB,EAAIpF,EAAEqmD,KAAK35B,GACX5Z,EAAOmyC,EAA+B,EAA1BA,EAAS,EAAJ7/C,EAAQ,GAAiB,GAAa,EACnD0N,EAAOkxC,IACTlxC,EAAOkxC,EACPoD,KAEFnC,EAAS,EAAJ7/C,EAAQ,GAAa0N,EAGtB1N,EAAIo/C,IAERxkD,EAAEolD,SAAStyC,KACXq0C,EAAQ,EACJ/hD,GAAK+a,IACPgnC,EAAQR,EAAMvhD,EAAI+a,IAEpBqpB,EAAIyb,EAAS,EAAJ7/C,GACTpF,EAAE2lD,SAAWnc,GAAK12B,EAAOq0C,GACrBlD,IACFjkD,EAAE4lD,YAAcpc,GAAKud,EAAU,EAAJ3hD,EAAQ,GAAa+hD,KAGpD,GAAiB,IAAbC,EAAJ,CAMA,EAAG,CAED,IADAt0C,EAAOkxC,EAAa,EACQ,IAArBhkD,EAAEolD,SAAStyC,IAAeA,IACjC9S,EAAEolD,SAAStyC,KACX9S,EAAEolD,SAAStyC,EAAO,IAAM,EACxB9S,EAAEolD,SAASpB,KAIXoD,GAAY,QACLA,EAAW,GAOpB,IAAKt0C,EAAOkxC,EAAqB,IAATlxC,EAAYA,IAElC,IADA1N,EAAIpF,EAAEolD,SAAStyC,GACF,IAAN1N,GACL1F,EAAIM,EAAEqmD,OAAO35B,GACThtB,EAAI8kD,IACJS,EAAS,EAAJvlD,EAAQ,KAAeoT,IAE9B9S,EAAE2lD,UAAY7yC,EAAOmyC,EAAS,EAAJvlD,EAAQ,IAAculD,EAAS,EAAJvlD,GACrDulD,EAAS,EAAJvlD,EAAQ,GAAaoT,GAE5B1N,IAjC0B,CAmC9B,EA4XA8hD,CAAWlnD,EAAG25B,GAGdwrB,GAAUF,EAAMT,EAAUxkD,EAAEolD,SAAS,EAQjCiC,GAAYA,CAACrnD,EAAGilD,EAAMT,KAK1B,IAAIp/C,EAEAkiD,EADAC,GAAW,EAGXC,EAAUvC,EAAK,GAEfpuC,EAAQ,EACR4wC,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEdzC,EAAsB,GAAhBT,EAAW,GAAS,GAAa,MAElCp/C,EAAI,EAAGA,GAAKo/C,EAAUp/C,IACzBkiD,EAASE,EACTA,EAAUvC,EAAe,GAAT7/C,EAAI,GAAS,KAEvByR,EAAQ4wC,GAAaH,IAAWE,IAG3B3wC,EAAQ6wC,EACjB1nD,EAAEylD,QAAiB,EAAT6B,IAAwBzwC,EAEd,IAAXywC,GAELA,IAAWC,GAAWvnD,EAAEylD,QAAiB,EAAT6B,KACpCtnD,EAAEylD,QAAQkC,OAED9wC,GAAS,GAClB7W,EAAEylD,QAAQmC,MAGV5nD,EAAEylD,QAAQoC,MAGZhxC,EAAQ,EACR0wC,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,GAEhB,EAQII,GAAYA,CAAC9nD,EAAGilD,EAAMT,KAK1B,IAAIp/C,EAEAkiD,EADAC,GAAW,EAGXC,EAAUvC,EAAK,GAEfpuC,EAAQ,EACR4wC,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGTtiD,EAAI,EAAGA,GAAKo/C,EAAUp/C,IAIzB,GAHAkiD,EAASE,EACTA,EAAUvC,EAAe,GAAT7/C,EAAI,GAAS,OAEvByR,EAAQ4wC,GAAaH,IAAWE,GAAtC,CAGO,GAAI3wC,EAAQ6wC,EACjB,GAAK1C,GAAUhlD,EAAGsnD,EAAQtnD,EAAEylD,eAA+B,KAAV5uC,QAE7B,IAAXywC,GACLA,IAAWC,IACbvC,GAAUhlD,EAAGsnD,EAAQtnD,EAAEylD,SACvB5uC,KAGFmuC,GAAUhlD,EA1vBI,GA0vBQA,EAAEylD,SACxBZ,GAAU7kD,EAAG6W,EAAQ,EAAG,IAEfA,GAAS,IAClBmuC,GAAUhlD,EA3vBI,GA2vBUA,EAAEylD,SAC1BZ,GAAU7kD,EAAG6W,EAAQ,EAAG,KAGxBmuC,GAAUhlD,EA5vBI,GA4vBYA,EAAEylD,SAC5BZ,GAAU7kD,EAAG6W,EAAQ,GAAI,IAG3BA,EAAQ,EACR0wC,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,EAdd,CAgBF,EAsHF,IAAIK,IAAmB,EAKvB,MAuBMC,GAAqBA,CAAChoD,EAAG0B,EAAKumD,EAAYh7C,KAM9C43C,GAAU7kD,EAAG,GAAuBiN,EAAO,EAAI,GAAI,GACnD84C,GAAU/lD,GACV2kD,GAAU3kD,EAAGioD,GACbtD,GAAU3kD,GAAIioD,GACVA,GACFjoD,EAAE4kD,YAAYl7C,IAAI1J,EAAE2gB,OAAO7U,SAASpK,EAAKA,EAAMumD,GAAajoD,EAAEynC,SAEhEznC,EAAEynC,SAAWwgB,CAAU,EAoIzB,IAAIC,GAxKgBloD,IAGb+nD,KAnlBgBI,MAErB,IAAI/iD,EACA0N,EACA7U,EACAW,EACA8lD,EACJ,MAAMU,EAAW,IAAIzmD,MAAMokD,IAiB3B,IADA9kD,EAAS,EACJW,EAAO,EAAGA,EAAOwpD,GAAoBxpD,IAExC,IADA6kD,GAAY7kD,GAAQX,EACfmH,EAAI,EAAGA,EAAK,GAAK49C,GAAYpkD,GAAQwG,IACxCm+C,GAAatlD,KAAYW,EAY7B,IAJA2kD,GAAatlD,EAAS,GAAKW,EAG3B8lD,EAAO,EACF9lD,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADA8kD,GAAU9kD,GAAQ8lD,EACbt/C,EAAI,EAAGA,EAAK,GAAK69C,GAAYrkD,GAAQwG,IACxCk+C,GAAWoB,KAAU9lD,EAKzB,IADA8lD,IAAS,EACF9lD,EAAOkkD,GAAWlkD,IAEvB,IADA8kD,GAAU9kD,GAAQ8lD,GAAQ,EACrBt/C,EAAI,EAAGA,EAAK,GAAM69C,GAAYrkD,GAAQ,EAAKwG,IAC9Ck+C,GAAW,IAAMoB,KAAU9lD,EAM/B,IAAKkU,EAAO,EAAGA,GAAQiwC,GAAYjwC,IACjCsyC,EAAStyC,GAAQ,EAInB,IADA1N,EAAI,EACGA,GAAK,KACVg+C,GAAiB,EAAJh+C,EAAQ,GAAa,EAClCA,IACAggD,EAAS,KAEX,KAAOhgD,GAAK,KACVg+C,GAAiB,EAAJh+C,EAAQ,GAAa,EAClCA,IACAggD,EAAS,KAEX,KAAOhgD,GAAK,KACVg+C,GAAiB,EAAJh+C,EAAQ,GAAa,EAClCA,IACAggD,EAAS,KAEX,KAAOhgD,GAAK,KACVg+C,GAAiB,EAAJh+C,EAAQ,GAAa,EAClCA,IACAggD,EAAS,KASX,IAHAD,GAAU/B,GAAcP,IAAeuC,GAGlChgD,EAAI,EAAGA,EAAI09C,GAAW19C,IACzBi+C,GAAiB,EAAJj+C,EAAQ,GAAa,EAClCi+C,GAAiB,EAAJj+C,GAAkB8/C,GAAW9/C,EAAG,GAI/C8+C,GAAgB,IAAIP,GAAeP,GAAcJ,GAAaJ,IAAgBC,GAAWE,IACzFoB,GAAgB,IAAIR,GAAeN,GAAcJ,GAAa,EAAYH,GAAWC,IACrFqB,GAAiB,IAAIT,GAAe,IAAIhlD,MAAM,GAAIukD,GAAc,EAtb1C,GAiBJ,EAqaiF,EAofjGiF,GACAJ,IAAmB,GAGrB/nD,EAAEqoD,OAAU,IAAIhE,GAASrkD,EAAEulD,UAAWrB,IACtClkD,EAAEsoD,OAAU,IAAIjE,GAASrkD,EAAEwlD,UAAWrB,IACtCnkD,EAAEuoD,QAAU,IAAIlE,GAASrkD,EAAEylD,QAASrB,IAEpCpkD,EAAE+kD,OAAS,EACX/kD,EAAE8kD,SAAW,EAGbQ,GAAWtlD,EAAE,EA0JXwoD,GAnHsBC,CAACzoD,EAAG0B,EAAKumD,EAAYh7C,KAM7C,IAAIy7C,EAAUC,EACVC,EAAc,EAGd5oD,EAAEsvC,MAAQ,GA1gCgB,IA6gCxBtvC,EAAE6oD,KAAKC,YACT9oD,EAAE6oD,KAAKC,UA3Ga9oD,KAKxB,IACIoF,EADA2jD,EAAa,WAIjB,IAAK3jD,EAAI,EAAGA,GAAK,GAAIA,IAAK2jD,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhC/oD,EAAEulD,UAAc,EAAJngD,GACnC,OAj7BwB,EAs7B5B,GAAoC,IAAhCpF,EAAEulD,UAAU,KAA0D,IAAjCvlD,EAAEulD,UAAU,KAChB,IAAjCvlD,EAAEulD,UAAU,IACd,OAv7B0B,EAy7B5B,IAAKngD,EAAI,GAAIA,EAAIw9C,GAAYx9C,IAC3B,GAAoC,IAAhCpF,EAAEulD,UAAc,EAAJngD,GACd,OA37BwB,EAk8B5B,OAn8B4B,CAm8Bb,EA8EQ4jD,CAAiBhpD,IAItC8mD,GAAW9mD,EAAGA,EAAEqoD,QAIhBvB,GAAW9mD,EAAGA,EAAEsoD,QAUhBM,EA1MmB5oD,KAErB,IAAI4oD,EAgBJ,IAbAvB,GAAUrnD,EAAGA,EAAEulD,UAAWvlD,EAAEqoD,OAAO7D,UACnC6C,GAAUrnD,EAAGA,EAAEwlD,UAAWxlD,EAAEsoD,OAAO9D,UAGnCsC,GAAW9mD,EAAGA,EAAEuoD,SASXK,EAAcK,GAAgBL,GAAe,GACS,IAArD5oD,EAAEylD,QAAgC,EAAxBtC,GAASyF,GAAmB,GADSA,KAUrD,OAJA5oD,EAAE2lD,SAAW,GAAKiD,EAAc,GAAK,EAAI,EAAI,EAItCA,CAAW,EA8KFM,CAAclpD,GAG5B0oD,EAAY1oD,EAAE2lD,QAAU,EAAI,IAAO,EACnCgD,EAAe3oD,EAAE4lD,WAAa,EAAI,IAAO,EAMrC+C,GAAeD,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcV,EAAa,EAGnCA,EAAa,GAAKS,IAAuB,IAAThnD,EASnCsmD,GAAmBhoD,EAAG0B,EAAKumD,EAAYh7C,GAjkCX,IAmkCnBjN,EAAEmpD,UAA0BR,IAAgBD,GAErD7D,GAAU7kD,EAAG,GAAuBiN,EAAO,EAAI,GAAI,GACnDs5C,GAAevmD,EAAGojD,GAAcC,MAGhCwB,GAAU7kD,EAAG,GAAoBiN,EAAO,EAAI,GAAI,GAvM7Bm8C,EAACppD,EAAGqpD,EAAQC,EAAQC,KAIzC,IAAIC,EASJ,IAHA3E,GAAU7kD,EAAGqpD,EAAS,IAAK,GAC3BxE,GAAU7kD,EAAGspD,EAAS,EAAK,GAC3BzE,GAAU7kD,EAAGupD,EAAU,EAAI,GACtBC,EAAO,EAAGA,EAAOD,EAASC,IAE7B3E,GAAU7kD,EAAGA,EAAEylD,QAAyB,EAAjBtC,GAASqG,GAAY,GAAY,GAI1D1B,GAAU9nD,EAAGA,EAAEulD,UAAW8D,EAAS,GAGnCvB,GAAU9nD,EAAGA,EAAEwlD,UAAW8D,EAAS,EAAE,EAkLnCF,CAAeppD,EAAGA,EAAEqoD,OAAO7D,SAAW,EAAGxkD,EAAEsoD,OAAO9D,SAAW,EAAGoE,EAAc,GAC9ErC,GAAevmD,EAAGA,EAAEulD,UAAWvlD,EAAEwlD,YAMnCF,GAAWtlD,GAEPiN,GACF84C,GAAU/lD,EACZ,EAsCEypD,GA7BgBC,CAAC1pD,EAAG0kD,EAAMgC,KAK5B1mD,EAAE4kD,YAAY5kD,EAAE6mD,QAAU7mD,EAAE6lD,YAAcnB,EAC1C1kD,EAAE4kD,YAAY5kD,EAAE6mD,QAAU7mD,EAAE6lD,YAAcnB,GAAQ,EAClD1kD,EAAE4kD,YAAY5kD,EAAE6mD,QAAU7mD,EAAE6lD,YAAca,EAC7B,IAAThC,EAEF1kD,EAAEulD,UAAe,EAALmB,MAEZ1mD,EAAE8lD,UAEFpB,IAKA1kD,EAAEulD,UAAgD,GAArChC,GAAamD,GAAM9D,GAAa,MAC7C5iD,EAAEwlD,UAAyB,EAAff,GAAOC,OAGb1kD,EAAE6lD,WAAa7lD,EAAE2pD,SAOvBC,GAhIiB5pD,IACnB6kD,GAAU7kD,EAAG6pD,EAAmB,GAChC7E,GAAUhlD,EAh8BQ,IAg8BMojD,IA/xBRpjD,KAEG,KAAfA,EAAE8kD,UACJH,GAAU3kD,EAAGA,EAAE+kD,QACf/kD,EAAE+kD,OAAS,EACX/kD,EAAE8kD,SAAW,GAEJ9kD,EAAE8kD,UAAY,IACvB9kD,EAAE4kD,YAAY5kD,EAAEynC,WAAwB,IAAXznC,EAAE+kD,OAC/B/kD,EAAE+kD,SAAW,EACb/kD,EAAE8kD,UAAY,EAChB,EAqxBAgF,CAAS9pD,EAAE,EA+HT+pD,GAAQ,CACXC,SAAU9B,GACV+B,iBAPwBjC,GAQxBkC,gBAAiB1B,GACjB2B,UAAWV,GACXW,UAAWR,IAmDZ,IAAIS,GAzBYC,CAACC,EAAO7oD,EAAK/D,EAAK8L,KAChC,IAAIi5C,EAAc,MAAR6H,EAAiB,EACvBC,EAAOD,IAAU,GAAM,MAAS,EAChCnlD,EAAI,EAER,KAAe,IAARzH,GAAW,CAIhByH,EAAIzH,EAAM,IAAO,IAAOA,EACxBA,GAAOyH,EAEP,GACEs9C,EAAMA,EAAKhhD,EAAI+H,KAAS,EACxB+gD,EAAMA,EAAK9H,EAAK,UACPt9C,GAEXs9C,GAAM,MACN8H,GAAM,KACR,CAEA,OAAQ9H,EAAM8H,GAAM,GAAM,CAAC,EA8B7B,MAeMC,GAAW,IAAInK,YAfHoK,MAChB,IAAIpqD,EAAGyR,EAAQ,GAEf,IAAK,IAAI3M,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5B9E,EAAI8E,EACJ,IAAK,IAAI4d,EAAI,EAAGA,EAAI,EAAGA,IACrB1iB,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDyR,EAAM3M,GAAK9E,CACb,CAEA,OAAOyR,CAAK,EAImB24C,IAiBjC,IAAIC,GAdUC,CAACC,EAAKnpD,EAAK/D,EAAK8L,KAC5B,MAAM2a,EAAIqmC,GACJzrD,EAAMyK,EAAM9L,EAElBktD,IAAQ,EAER,IAAK,IAAIvtD,EAAImM,EAAKnM,EAAI0B,EAAK1B,IACzButD,EAAOA,IAAQ,EAAKzmC,EAAmB,KAAhBymC,EAAMnpD,EAAIpE,KAGnC,OAAgB,EAARutD,CAAU,EAyBhBC,GAAW,CACb,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,wBAsBNC,GAAc,CAGhBC,WAAoB,EACpBC,gBAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EACpBC,SAAoB,EACpBC,QAAoB,EACpBC,QAAoB,EAKpBC,KAAoB,EACpBC,aAAoB,EACpBC,YAAoB,EACpBC,SAAoB,EACpBC,gBAAoB,EACpBC,cAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EAIpBC,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1BC,uBAA0B,EAG1BC,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1BC,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1BC,WAA0B,GAuB5B,MAAM3C,SAAEA,GAAQC,iBAAEA,GAAgBC,gBAAEA,GAAeC,UAAEA,GAASC,UAAEA,IAAcL,IAS5EiB,WAAY4B,GAAY3B,gBAAEA,GAAiBE,aAAc0B,GAAgBzB,SAAU0B,GAAYzB,QAAS0B,GACxGxB,KAAMyB,GAAQxB,aAAcyB,GAAgBtB,eAAgBuB,GAAkBtB,aAAcuB,GAAgBrB,YAAasB,GACzHlB,sBAAuBmB,GAAuBlB,WAC9CA,GAAUC,eAAEA,GAAcC,MAAEA,GAAKC,QAAEA,GAASC,mBAAoBe,GAAoBZ,UACpFA,GACAC,WAAYY,IACVxC,GA4BEyC,GAAY,IACZC,GAAiBD,IAIjBE,GAAiB,GAQjBC,GAAgB,IAChBC,GAAgB,IAShBC,GAAMA,CAAChF,EAAMiF,KACjBjF,EAAKx3C,IAAMy5C,GAASgD,GACbA,GAGHtE,GAAQhgB,GACE,EAALA,GAAYA,EAAK,EAAI,EAAI,GAG9BukB,GAAQrsD,IACZ,IAAI/D,EAAM+D,EAAIzD,OAAQ,OAASN,GAAO,GAAK+D,EAAI/D,GAAO,CAAG,EAQrDqwD,GAAchuD,IAClB,IAAIoF,EAAG1F,EACH8uB,EACAy/B,EAAQjuD,EAAEkuD,OAEd9oD,EAAIpF,EAAEmuD,UACN3/B,EAAIppB,EACJ,GACE1F,EAAIM,EAAEouD,OAAO5/B,GACbxuB,EAAEouD,KAAK5/B,GAAM9uB,GAAKuuD,EAAQvuD,EAAIuuD,EAAQ,UAC7B7oD,GACXA,EAAI6oD,EAEJz/B,EAAIppB,EACJ,GACE1F,EAAIM,EAAEwzB,OAAOhF,GACbxuB,EAAEwzB,KAAKhF,GAAM9uB,GAAKuuD,EAAQvuD,EAAIuuD,EAAQ,UAI7B7oD,EAAC,EAKd,IAIIipD,GAJYC,CAACtuD,EAAGwzB,EAAM1vB,KAAW0vB,GAAQxzB,EAAEuuD,WAAczqD,GAAQ9D,EAAEwuD,UAavE,MAAMC,GAAiB5F,IACrB,MAAM7oD,EAAI6oD,EAAKhoB,MAGf,IAAIljC,EAAMqC,EAAEynC,QACR9pC,EAAMkrD,EAAK6F,YACb/wD,EAAMkrD,EAAK6F,WAED,IAAR/wD,IAEJkrD,EAAK3pD,OAAOwK,IAAI1J,EAAE4kD,YAAY94C,SAAS9L,EAAE2uD,YAAa3uD,EAAE2uD,YAAchxD,GAAMkrD,EAAK+F,UACjF/F,EAAK+F,UAAajxD,EAClBqC,EAAE2uD,aAAgBhxD,EAClBkrD,EAAKgG,WAAalxD,EAClBkrD,EAAK6F,WAAa/wD,EAClBqC,EAAEynC,SAAgB9pC,EACA,IAAdqC,EAAEynC,UACJznC,EAAE2uD,YAAc,GAClB,EAIIG,GAAmBA,CAAC9uD,EAAGiN,KAC3Bi9C,GAAgBlqD,EAAIA,EAAE+uD,aAAe,EAAI/uD,EAAE+uD,aAAe,EAAI/uD,EAAEgvD,SAAWhvD,EAAE+uD,YAAa9hD,GAC1FjN,EAAE+uD,YAAc/uD,EAAEgvD,SAClBP,GAAczuD,EAAE6oD,KAAK,EAIjBoG,GAAWA,CAACjvD,EAAGsD,KACnBtD,EAAE4kD,YAAY5kD,EAAEynC,WAAankC,CAAC,EAS1B4rD,GAAcA,CAAClvD,EAAGsD,KAItBtD,EAAE4kD,YAAY5kD,EAAEynC,WAAcnkC,IAAM,EAAK,IACzCtD,EAAE4kD,YAAY5kD,EAAEynC,WAAiB,IAAJnkC,CAAQ,EAWjC6rD,GAAWA,CAACtG,EAAMnnD,EAAK3C,EAAOmF,KAElC,IAAIvG,EAAMkrD,EAAKuG,SAGf,OADIzxD,EAAMuG,IAAQvG,EAAMuG,GACZ,IAARvG,EAAoB,GAExBkrD,EAAKuG,UAAYzxD,EAGjB+D,EAAIgI,IAAIm/C,EAAKz3C,MAAMtF,SAAS+8C,EAAKwG,QAASxG,EAAKwG,QAAU1xD,GAAMoB,GACvC,IAApB8pD,EAAKhoB,MAAMyuB,KACbzG,EAAK0B,MAAQF,GAAUxB,EAAK0B,MAAO7oD,EAAK/D,EAAKoB,GAGlB,IAApB8pD,EAAKhoB,MAAMyuB,OAClBzG,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAO7oD,EAAK/D,EAAKoB,IAG7C8pD,EAAKwG,SAAW1xD,EAChBkrD,EAAK0G,UAAY5xD,EAEVA,EAAG,EAaN6xD,GAAgBA,CAACxvD,EAAGyvD,KAExB,IAEIhd,EACA90C,EAHA+xD,EAAe1vD,EAAE2vD,iBACjBC,EAAO5vD,EAAEgvD,SAGTa,EAAW7vD,EAAE8vD,YACbC,EAAa/vD,EAAE+vD,WACnB,MAAM7gD,EAASlP,EAAEgvD,SAAYhvD,EAAEkuD,OAAST,GACpCztD,EAAEgvD,UAAYhvD,EAAEkuD,OAAST,IAAiB,EAExCuC,EAAOhwD,EAAE2gB,OAETsvC,EAAQjwD,EAAEkwD,OACV18B,EAAQxzB,EAAEwzB,KAMV28B,EAASnwD,EAAEgvD,SAAWxB,GAC5B,IAAI4C,EAAaJ,EAAKJ,EAAOC,EAAW,GACpCQ,EAAaL,EAAKJ,EAAOC,GAQzB7vD,EAAE8vD,aAAe9vD,EAAEswD,aACrBZ,IAAiB,GAKfK,EAAa/vD,EAAEuwD,YAAaR,EAAa/vD,EAAEuwD,WAI/C,GAaE,GAXA9d,EAAQgd,EAWJO,EAAKvd,EAAQod,KAAkBQ,GAC/BL,EAAKvd,EAAQod,EAAW,KAAOO,GAC/BJ,EAAKvd,KAA0Bud,EAAKJ,IACpCI,IAAOvd,KAAwBud,EAAKJ,EAAO,GAH/C,CAaAA,GAAQ,EACRnd,IAMA,UAESud,IAAOJ,KAAUI,IAAOvd,IAAUud,IAAOJ,KAAUI,IAAOvd,IAC1Dud,IAAOJ,KAAUI,IAAOvd,IAAUud,IAAOJ,KAAUI,IAAOvd,IAC1Dud,IAAOJ,KAAUI,IAAOvd,IAAUud,IAAOJ,KAAUI,IAAOvd,IAC1Dud,IAAOJ,KAAUI,IAAOvd,IAAUud,IAAOJ,KAAUI,IAAOvd,IAC1Dmd,EAAOO,GAOhB,GAHAxyD,EAAM6vD,IAAa2C,EAASP,GAC5BA,EAAOO,EAAS3C,GAEZ7vD,EAAMkyD,EAAU,CAGlB,GAFA7vD,EAAEwwD,YAAcf,EAChBI,EAAWlyD,EACPA,GAAOoyD,EACT,MAEFK,EAAaJ,EAAKJ,EAAOC,EAAW,GACpCQ,EAAaL,EAAKJ,EAAOC,EAC3B,CApCA,SAqCQJ,EAAYj8B,EAAKi8B,EAAYQ,IAAU/gD,GAA4B,KAAjBwgD,GAE5D,OAAIG,GAAY7vD,EAAEuwD,UACTV,EAEF7vD,EAAEuwD,SAAS,EAcdE,GAAezwD,IAEnB,MAAM0wD,EAAU1wD,EAAEkuD,OAClB,IAAI9oD,EAAGurD,EAAM7pD,EAIb,EAAG,CAkCD,GAjCA6pD,EAAO3wD,EAAE4wD,YAAc5wD,EAAEuwD,UAAYvwD,EAAEgvD,SAoBnChvD,EAAEgvD,UAAY0B,GAAWA,EAAUjD,MAErCztD,EAAE2gB,OAAOjX,IAAI1J,EAAE2gB,OAAO7U,SAAS4kD,EAASA,EAAUA,EAAUC,GAAO,GACnE3wD,EAAEwwD,aAAeE,EACjB1wD,EAAEgvD,UAAY0B,EAEd1wD,EAAE+uD,aAAe2B,EACb1wD,EAAE6wD,OAAS7wD,EAAEgvD,WACfhvD,EAAE6wD,OAAS7wD,EAAEgvD,UAEfhB,GAAWhuD,GACX2wD,GAAQD,GAEc,IAApB1wD,EAAE6oD,KAAKuG,SACT,MAmBF,GAJAhqD,EAAI+pD,GAASnvD,EAAE6oD,KAAM7oD,EAAE2gB,OAAQ3gB,EAAEgvD,SAAWhvD,EAAEuwD,UAAWI,GACzD3wD,EAAEuwD,WAAanrD,EAGXpF,EAAEuwD,UAAYvwD,EAAE6wD,QAzVN,EAkWZ,IARA/pD,EAAM9G,EAAEgvD,SAAWhvD,EAAE6wD,OACrB7wD,EAAE8wD,MAAQ9wD,EAAE2gB,OAAO7Z,GAGnB9G,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO7Z,EAAM,IAInC9G,EAAE6wD,SAEP7wD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO7Z,EApW1B,EAoW4C,IAEtD9G,EAAEwzB,KAAK1sB,EAAM9G,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OAClC9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAShqD,EAClBA,IACA9G,EAAE6wD,WACE7wD,EAAEuwD,UAAYvwD,EAAE6wD,OA1WV,MAmXhB,OAAS7wD,EAAEuwD,UAAY9C,IAAqC,IAApBztD,EAAE6oD,KAAKuG,SAAc,EAuDzD2B,GAAiBA,CAAC/wD,EAAGgxD,KAMzB,IAMIrzD,EAAKwjB,EAAM8vC,EANXC,EAAYlxD,EAAEmxD,iBAAmB,EAAInxD,EAAEkuD,OAASluD,EAAEkuD,OAASluD,EAAEmxD,iBAAmB,EAM/DlkD,EAAO,EACxBmkD,EAAOpxD,EAAE6oD,KAAKuG,SAClB,EAAG,CAOD,GAFAzxD,EAAM,MACNszD,EAAQjxD,EAAE8kD,SAAW,IAAO,EACxB9kD,EAAE6oD,KAAK6F,UAAYuC,EACrB,MAiBF,GAdAA,EAAOjxD,EAAE6oD,KAAK6F,UAAYuC,EAC1B9vC,EAAOnhB,EAAEgvD,SAAWhvD,EAAE+uD,YAClBpxD,EAAMwjB,EAAOnhB,EAAE6oD,KAAKuG,WACtBzxD,EAAMwjB,EAAOnhB,EAAE6oD,KAAKuG,UAElBzxD,EAAMszD,IACRtzD,EAAMszD,GAQJtzD,EAAMuzD,IAAuB,IAARvzD,GAAaqzD,IAAUlE,IAC5BkE,IAAUpE,IACVjvD,IAAQwjB,EAAOnhB,EAAE6oD,KAAKuG,UACxC,MAMFniD,EAAO+jD,IAAUlE,IAAcnvD,IAAQwjB,EAAOnhB,EAAE6oD,KAAKuG,SAAW,EAAI,EACpEnF,GAAiBjqD,EAAG,EAAG,EAAGiN,GAG1BjN,EAAE4kD,YAAY5kD,EAAEynC,QAAU,GAAK9pC,EAC/BqC,EAAE4kD,YAAY5kD,EAAEynC,QAAU,GAAK9pC,GAAO,EACtCqC,EAAE4kD,YAAY5kD,EAAEynC,QAAU,IAAM9pC,EAChCqC,EAAE4kD,YAAY5kD,EAAEynC,QAAU,IAAM9pC,GAAO,EAGvC8wD,GAAczuD,EAAE6oD,MASZ1nC,IACEA,EAAOxjB,IACTwjB,EAAOxjB,GAGTqC,EAAE6oD,KAAK3pD,OAAOwK,IAAI1J,EAAE2gB,OAAO7U,SAAS9L,EAAE+uD,YAAa/uD,EAAE+uD,YAAc5tC,GAAOnhB,EAAE6oD,KAAK+F,UACjF5uD,EAAE6oD,KAAK+F,UAAYztC,EACnBnhB,EAAE6oD,KAAK6F,WAAavtC,EACpBnhB,EAAE6oD,KAAKgG,WAAa1tC,EACpBnhB,EAAE+uD,aAAe5tC,EACjBxjB,GAAOwjB,GAMLxjB,IACFwxD,GAASnvD,EAAE6oD,KAAM7oD,EAAE6oD,KAAK3pD,OAAQc,EAAE6oD,KAAK+F,SAAUjxD,GACjDqC,EAAE6oD,KAAK+F,UAAYjxD,EACnBqC,EAAE6oD,KAAK6F,WAAa/wD,EACpBqC,EAAE6oD,KAAKgG,WAAalxD,SAEN,IAATsP,GA6CT,OArCAmkD,GAAQpxD,EAAE6oD,KAAKuG,SACXgC,IAIEA,GAAQpxD,EAAEkuD,QACZluD,EAAE8lD,QAAU,EAEZ9lD,EAAE2gB,OAAOjX,IAAI1J,EAAE6oD,KAAKz3C,MAAMtF,SAAS9L,EAAE6oD,KAAKwG,QAAUrvD,EAAEkuD,OAAQluD,EAAE6oD,KAAKwG,SAAU,GAC/ErvD,EAAEgvD,SAAWhvD,EAAEkuD,OACfluD,EAAE6wD,OAAS7wD,EAAEgvD,WAGThvD,EAAE4wD,YAAc5wD,EAAEgvD,UAAYoC,IAEhCpxD,EAAEgvD,UAAYhvD,EAAEkuD,OAEhBluD,EAAE2gB,OAAOjX,IAAI1J,EAAE2gB,OAAO7U,SAAS9L,EAAEkuD,OAAQluD,EAAEkuD,OAASluD,EAAEgvD,UAAW,GAC7DhvD,EAAE8lD,QAAU,GACd9lD,EAAE8lD,UAEA9lD,EAAE6wD,OAAS7wD,EAAEgvD,WACfhvD,EAAE6wD,OAAS7wD,EAAEgvD,WAIjBhvD,EAAE2gB,OAAOjX,IAAI1J,EAAE6oD,KAAKz3C,MAAMtF,SAAS9L,EAAE6oD,KAAKwG,QAAU+B,EAAMpxD,EAAE6oD,KAAKwG,SAAUrvD,EAAEgvD,UAC7EhvD,EAAEgvD,UAAYoC,EACdpxD,EAAE6wD,QAAUO,EAAOpxD,EAAEkuD,OAASluD,EAAE6wD,OAAS7wD,EAAEkuD,OAASluD,EAAE6wD,OAASO,GAEjEpxD,EAAE+uD,YAAc/uD,EAAEgvD,UAEhBhvD,EAAEqxD,WAAarxD,EAAEgvD,WACnBhvD,EAAEqxD,WAAarxD,EAAEgvD,UAIf/hD,EA5hBoB,EAiiBpB+jD,IAAUpE,IAAgBoE,IAAUlE,IAClB,IAApB9sD,EAAE6oD,KAAKuG,UAAkBpvD,EAAEgvD,WAAahvD,EAAE+uD,YApiBpB,GAyiBxBkC,EAAOjxD,EAAE4wD,YAAc5wD,EAAEgvD,SACrBhvD,EAAE6oD,KAAKuG,SAAW6B,GAAQjxD,EAAE+uD,aAAe/uD,EAAEkuD,SAE/CluD,EAAE+uD,aAAe/uD,EAAEkuD,OACnBluD,EAAEgvD,UAAYhvD,EAAEkuD,OAEhBluD,EAAE2gB,OAAOjX,IAAI1J,EAAE2gB,OAAO7U,SAAS9L,EAAEkuD,OAAQluD,EAAEkuD,OAASluD,EAAEgvD,UAAW,GAC7DhvD,EAAE8lD,QAAU,GACd9lD,EAAE8lD,UAEJmL,GAAQjxD,EAAEkuD,OACNluD,EAAE6wD,OAAS7wD,EAAEgvD,WACfhvD,EAAE6wD,OAAS7wD,EAAEgvD,WAGbiC,EAAOjxD,EAAE6oD,KAAKuG,WAChB6B,EAAOjxD,EAAE6oD,KAAKuG,UAEZ6B,IACF9B,GAASnvD,EAAE6oD,KAAM7oD,EAAE2gB,OAAQ3gB,EAAEgvD,SAAUiC,GACvCjxD,EAAEgvD,UAAYiC,EACdjxD,EAAE6wD,QAAUI,EAAOjxD,EAAEkuD,OAASluD,EAAE6wD,OAAS7wD,EAAEkuD,OAASluD,EAAE6wD,OAASI,GAE7DjxD,EAAEqxD,WAAarxD,EAAEgvD,WACnBhvD,EAAEqxD,WAAarxD,EAAEgvD,UAQnBiC,EAAQjxD,EAAE8kD,SAAW,IAAO,EAE5BmM,EAAOjxD,EAAEmxD,iBAAmBF,EAAO,MAAwB,MAAwBjxD,EAAEmxD,iBAAmBF,EACxGC,EAAYD,EAAOjxD,EAAEkuD,OAASluD,EAAEkuD,OAAS+C,EACzC9vC,EAAOnhB,EAAEgvD,SAAWhvD,EAAE+uD,aAClB5tC,GAAQ+vC,IACP/vC,GAAQ6vC,IAAUlE,KAAekE,IAAUpE,IACzB,IAApB5sD,EAAE6oD,KAAKuG,UAAkBjuC,GAAQ8vC,KAClCtzD,EAAMwjB,EAAO8vC,EAAOA,EAAO9vC,EAC3BlU,EAAO+jD,IAAUlE,IAAkC,IAApB9sD,EAAE6oD,KAAKuG,UACjCzxD,IAAQwjB,EAAO,EAAI,EACxB8oC,GAAiBjqD,EAAGA,EAAE+uD,YAAapxD,EAAKsP,GACxCjN,EAAE+uD,aAAepxD,EACjB8wD,GAAczuD,EAAE6oD,OAIX57C,EAzlBiB,EAFA,EA2lBsB,EAW1CqkD,GAAeA,CAACtxD,EAAGgxD,KAEvB,IAAIO,EACAC,EAEJ,OAAS,CAMP,GAAIxxD,EAAEuwD,UAAY9C,GAAe,CAE/B,GADAgD,GAAYzwD,GACRA,EAAEuwD,UAAY9C,IAAiBuD,IAAUpE,GAC3C,OApnBkB,EAsnBpB,GAAoB,IAAhB5sD,EAAEuwD,UACJ,KAEJ,CAyBA,GApBAgB,EAAY,EACRvxD,EAAEuwD,WAhpBQ,IAkpBZvwD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO3gB,EAAEgvD,SAlpB1B,EAkpBiD,IAC7DuC,EAAYvxD,EAAEwzB,KAAKxzB,EAAEgvD,SAAWhvD,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OACrD9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAS9wD,EAAEgvD,UAOJ,IAAduC,GAA4BvxD,EAAEgvD,SAAWuC,GAAevxD,EAAEkuD,OAAST,KAKrEztD,EAAEyxD,aAAejC,GAAcxvD,EAAGuxD,IAGhCvxD,EAAEyxD,cAnqBQ,EA+qBZ,GAPAD,EAASrH,GAAUnqD,EAAGA,EAAEgvD,SAAWhvD,EAAEwwD,YAAaxwD,EAAEyxD,aAxqBxC,GA0qBZzxD,EAAEuwD,WAAavwD,EAAEyxD,aAKbzxD,EAAEyxD,cAAgBzxD,EAAE0xD,gBAAuC1xD,EAAEuwD,WA/qBrD,EA+qB6E,CACvFvwD,EAAEyxD,eACF,GACEzxD,EAAEgvD,WAEFhvD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO3gB,EAAEgvD,SAprB9B,EAorBqD,IAC7DuC,EAAYvxD,EAAEwzB,KAAKxzB,EAAEgvD,SAAWhvD,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OACrD9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAS9wD,EAAEgvD,eAKQ,KAAnBhvD,EAAEyxD,cACbzxD,EAAEgvD,UACJ,MAEEhvD,EAAEgvD,UAAYhvD,EAAEyxD,aAChBzxD,EAAEyxD,aAAe,EACjBzxD,EAAE8wD,MAAQ9wD,EAAE2gB,OAAO3gB,EAAEgvD,UAErBhvD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO3gB,EAAEgvD,SAAW,SAanDwC,EAASrH,GAAUnqD,EAAG,EAAGA,EAAE2gB,OAAO3gB,EAAEgvD,WAEpChvD,EAAEuwD,YACFvwD,EAAEgvD,WAEJ,GAAIwC,IAEF1C,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WACT,OAxsBkB,CA4sBxB,CAEA,OADA1uD,EAAE6wD,OAAW7wD,EAAEgvD,SAAY2C,EAAkB3xD,EAAEgvD,SAAW2C,EACtDX,IAAUlE,IAEZgC,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,UA/sBW,EACA,GAotBpB1uD,EAAE6lD,WAEJiJ,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WA1tBW,EACA,CA8tBJ,EAQhBkD,GAAeA,CAAC5xD,EAAGgxD,KAEvB,IAAIO,EACAC,EAEAK,EAGJ,OAAS,CAMP,GAAI7xD,EAAEuwD,UAAY9C,GAAe,CAE/B,GADAgD,GAAYzwD,GACRA,EAAEuwD,UAAY9C,IAAiBuD,IAAUpE,GAC3C,OAxvBkB,EA0vBpB,GAAoB,IAAhB5sD,EAAEuwD,UAAmB,KAC3B,CAyCA,GApCAgB,EAAY,EACRvxD,EAAEuwD,WAlxBQ,IAoxBZvwD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO3gB,EAAEgvD,SApxB1B,EAoxBiD,IAC7DuC,EAAYvxD,EAAEwzB,KAAKxzB,EAAEgvD,SAAWhvD,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OACrD9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAS9wD,EAAEgvD,UAMtBhvD,EAAE8vD,YAAc9vD,EAAEyxD,aAClBzxD,EAAE8xD,WAAa9xD,EAAEwwD,YACjBxwD,EAAEyxD,aAAeE,EAEC,IAAdJ,GAA0BvxD,EAAE8vD,YAAc9vD,EAAE0xD,gBAC5C1xD,EAAEgvD,SAAWuC,GAAcvxD,EAAEkuD,OAAST,KAKxCztD,EAAEyxD,aAAejC,GAAcxvD,EAAGuxD,GAG9BvxD,EAAEyxD,cAAgB,IAClBzxD,EAAEmpD,WAAagD,IA1yBP,IA0yBsBnsD,EAAEyxD,cAA8BzxD,EAAEgvD,SAAWhvD,EAAEwwD,YAAc,QAK7FxwD,EAAEyxD,aAAeE,IAMjB3xD,EAAE8vD,aArzBQ,GAqzBoB9vD,EAAEyxD,cAAgBzxD,EAAE8vD,YAAa,CACjE+B,EAAa7xD,EAAEgvD,SAAWhvD,EAAEuwD,UAtzBhB,EA6zBZiB,EAASrH,GAAUnqD,EAAGA,EAAEgvD,SAAW,EAAIhvD,EAAE8xD,WAAY9xD,EAAE8vD,YA7zB3C,GAm0BZ9vD,EAAEuwD,WAAavwD,EAAE8vD,YAAc,EAC/B9vD,EAAE8vD,aAAe,EACjB,KACQ9vD,EAAEgvD,UAAY6C,IAElB7xD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO3gB,EAAEgvD,SAx0B9B,EAw0BqD,IAC7DuC,EAAYvxD,EAAEwzB,KAAKxzB,EAAEgvD,SAAWhvD,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OACrD9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAS9wD,EAAEgvD,gBAGK,KAAlBhvD,EAAE8vD,aAKb,GAJA9vD,EAAE+xD,gBAAkB,EACpB/xD,EAAEyxD,aAAeE,EACjB3xD,EAAEgvD,WAEEwC,IAEF1C,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WACT,OAr0BgB,CA00BtB,MAAO,GAAI1uD,EAAE+xD,iBAgBX,GATAP,EAASrH,GAAUnqD,EAAG,EAAGA,EAAE2gB,OAAO3gB,EAAEgvD,SAAW,IAE3CwC,GAEF1C,GAAiB9uD,GAAG,GAGtBA,EAAEgvD,WACFhvD,EAAEuwD,YACuB,IAArBvwD,EAAE6oD,KAAK6F,UACT,OA31BkB,OAi2BpB1uD,EAAE+xD,gBAAkB,EACpB/xD,EAAEgvD,WACFhvD,EAAEuwD,WAEN,CAUA,OARIvwD,EAAE+xD,kBAGJP,EAASrH,GAAUnqD,EAAG,EAAGA,EAAE2gB,OAAO3gB,EAAEgvD,SAAW,IAE/ChvD,EAAE+xD,gBAAkB,GAEtB/xD,EAAE6wD,OAAS7wD,EAAEgvD,SAAW2C,EAAgB3xD,EAAEgvD,SAAW2C,EACjDX,IAAUlE,IAEZgC,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,UAh3BW,EACA,GAq3BpB1uD,EAAE6lD,WAEJiJ,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WA33BW,EACA,CAg4BJ,EAmKtB,SAASsD,GAAOC,EAAaC,EAAUC,EAAaC,EAAWC,GAE7DztD,KAAKqtD,YAAcA,EACnBrtD,KAAKstD,SAAWA,EAChBttD,KAAKutD,YAAcA,EACnBvtD,KAAKwtD,UAAYA,EACjBxtD,KAAKytD,KAAOA,CACd,CAEA,MAAMC,GAAsB,CAE1B,IAAIN,GAAO,EAAG,EAAG,EAAG,EAAGjB,IACvB,IAAIiB,GAAO,EAAG,EAAG,EAAG,EAAGV,IACvB,IAAIU,GAAO,EAAG,EAAG,GAAI,EAAGV,IACxB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIV,IAEzB,IAAIU,GAAO,EAAG,EAAG,GAAI,GAAIJ,IACzB,IAAII,GAAO,EAAG,GAAI,GAAI,GAAIJ,IAC1B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,EAAG,GAAI,IAAK,IAAKJ,IAC5B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,IAC/B,IAAII,GAAO,GAAI,IAAK,IAAK,KAAMJ,KA+BjC,SAASW,KACP3tD,KAAKikD,KAAO,KACZjkD,KAAK4tD,OAAS,EACd5tD,KAAKggD,YAAc,KACnBhgD,KAAKusD,iBAAmB,EACxBvsD,KAAK+pD,YAAc,EACnB/pD,KAAK6iC,QAAU,EACf7iC,KAAK0qD,KAAO,EACZ1qD,KAAK6tD,OAAS,KACd7tD,KAAK8tD,QAAU,EACf9tD,KAAK+tD,OAASpF,GACd3oD,KAAKguD,YAAc,EAEnBhuD,KAAKspD,OAAS,EACdtpD,KAAKiuD,OAAS,EACdjuD,KAAKsrD,OAAS,EAEdtrD,KAAK+b,OAAS,KAQd/b,KAAKgsD,YAAc,EAKnBhsD,KAAK4uB,KAAO,KAMZ5uB,KAAKwpD,KAAO,KAEZxpD,KAAKksD,MAAQ,EACblsD,KAAKupD,UAAY,EACjBvpD,KAAKkuD,UAAY,EACjBluD,KAAK4pD,UAAY,EAEjB5pD,KAAK2pD,WAAa,EAOlB3pD,KAAKmqD,YAAc,EAKnBnqD,KAAK6sD,aAAe,EACpB7sD,KAAKktD,WAAa,EAClBltD,KAAKmtD,gBAAkB,EACvBntD,KAAKoqD,SAAW,EAChBpqD,KAAK4rD,YAAc,EACnB5rD,KAAK2rD,UAAY,EAEjB3rD,KAAKkrD,YAAc,EAKnBlrD,KAAK+qD,iBAAmB,EAMxB/qD,KAAK8sD,eAAiB,EAYtB9sD,KAAK0qC,MAAQ,EACb1qC,KAAKukD,SAAW,EAEhBvkD,KAAK0rD,WAAa,EAGlB1rD,KAAKmrD,WAAa,EAYlBnrD,KAAK2gD,UAAa,IAAIwN,YAAYC,MAClCpuD,KAAK4gD,UAAa,IAAIuN,YAAY,KAClCnuD,KAAK6gD,QAAa,IAAIsN,YAAY,IAClChF,GAAKnpD,KAAK2gD,WACVwI,GAAKnpD,KAAK4gD,WACVuI,GAAKnpD,KAAK6gD,SAEV7gD,KAAKyjD,OAAW,KAChBzjD,KAAK0jD,OAAW,KAChB1jD,KAAK2jD,QAAW,KAGhB3jD,KAAKwgD,SAAW,IAAI2N,YAAYE,IAIhCruD,KAAKyhD,KAAO,IAAI0M,YAAY,KAC5BhF,GAAKnpD,KAAKyhD,MAEVzhD,KAAK0hD,SAAW,EAChB1hD,KAAKqiD,SAAW,EAKhBriD,KAAKqhD,MAAQ,IAAI8M,YAAY,KAC7BhF,GAAKnpD,KAAKqhD,OAIVrhD,KAAKiiD,QAAU,EAEfjiD,KAAKsuD,YAAc,EAoBnBtuD,KAAKihD,SAAW,EAChBjhD,KAAK+kD,QAAU,EAEf/kD,KAAK+gD,QAAU,EACf/gD,KAAKghD,WAAa,EAClBhhD,KAAKkhD,QAAU,EACflhD,KAAKisD,OAAS,EAGdjsD,KAAKmgD,OAAS,EAIdngD,KAAKkgD,SAAW,CAalB,CAMA,MAAMqO,GAAqBtK,IAEzB,IAAKA,EACH,OAAO,EAET,MAAM7oD,EAAI6oD,EAAKhoB,MACf,OAAK7gC,GAAKA,EAAE6oD,OAASA,GAAS7oD,EAAEwyD,SAAW9E,IAlyCtB,KAoyCS1tD,EAAEwyD,QAlyCX,KAoyCSxyD,EAAEwyD,QAnyCX,KAoyCSxyD,EAAEwyD,QAnyCX,KAoyCSxyD,EAAEwyD,QAnyCZ,MAoyCUxyD,EAAEwyD,QACFxyD,EAAEwyD,SAAW7E,IACb3tD,EAAEwyD,SAAW5E,GAClC,EAEF,CAAC,EAIJwF,GAAoBvK,IAExB,GAAIsK,GAAkBtK,GACpB,OAAOgF,GAAIhF,EAAMqE,IAGnBrE,EAAK0G,SAAW1G,EAAKgG,UAAY,EACjChG,EAAKC,UAAY4D,GAEjB,MAAM1sD,EAAI6oD,EAAKhoB,MAmBf,OAlBA7gC,EAAEynC,QAAU,EACZznC,EAAE2uD,YAAc,EAEZ3uD,EAAEsvD,KAAO,IACXtvD,EAAEsvD,MAAQtvD,EAAEsvD,MAGdtvD,EAAEwyD,OAEW,IAAXxyD,EAAEsvD,KAr0CiB,GAu0CnBtvD,EAAEsvD,KAAO5B,GAAaC,GACxB9E,EAAK0B,MAAoB,IAAXvqD,EAAEsvD,KACd,EAEA,EACFtvD,EAAE4yD,YAAc,EAChB5I,GAAShqD,GACFgtD,EAAM,EAITqG,GAAgBxK,IAEpB,MAAMh+C,EAAMuoD,GAAiBvK,GAI7B,OAHIh+C,IAAQmiD,IA5QGhtD,KAEfA,EAAE4wD,YAAc,EAAI5wD,EAAEkuD,OAGtBH,GAAK/tD,EAAEouD,MAIPpuD,EAAE0xD,eAAiBY,GAAoBtyD,EAAEsvC,OAAO4iB,SAChDlyD,EAAEswD,WAAagC,GAAoBtyD,EAAEsvC,OAAO2iB,YAC5CjyD,EAAE+vD,WAAauC,GAAoBtyD,EAAEsvC,OAAO6iB,YAC5CnyD,EAAE2vD,iBAAmB2C,GAAoBtyD,EAAEsvC,OAAO8iB,UAElDpyD,EAAEgvD,SAAW,EACbhvD,EAAE+uD,YAAc,EAChB/uD,EAAEuwD,UAAY,EACdvwD,EAAE6wD,OAAS,EACX7wD,EAAEyxD,aAAezxD,EAAE8vD,YAAc6B,EACjC3xD,EAAE+xD,gBAAkB,EACpB/xD,EAAE8wD,MAAQ,CAAC,EAyPTwC,CAAQzK,EAAKhoB,OAERh2B,CAAG,EAcN0oD,GAAeA,CAAC1K,EAAMvZ,EAAOqjB,EAAQa,EAAYC,EAAUtK,KAE/D,IAAKN,EACH,OAAOqE,GAET,IAAIoC,EAAO,EAiBX,GAfIhgB,IAAU+d,KACZ/d,EAAQ,GAGNkkB,EAAa,GACflE,EAAO,EACPkE,GAAcA,GAGPA,EAAa,KACpBlE,EAAO,EACPkE,GAAc,IAIZC,EAAW,GAAKA,EA15CA,GA05C4Bd,IAAWpF,IACzDiG,EAAa,GAAKA,EAAa,IAAMlkB,EAAQ,GAAKA,EAAQ,GAC1D6Z,EAAW,GAAKA,EAAWmD,IAA2B,IAAfkH,GAA6B,IAATlE,EAC3D,OAAOzB,GAAIhF,EAAMqE,IAIA,IAAfsG,IACFA,EAAa,GAIf,MAAMxzD,EAAI,IAAIuyD,GAmFd,OAjFA1J,EAAKhoB,MAAQ7gC,EACbA,EAAE6oD,KAAOA,EACT7oD,EAAEwyD,OAAS9E,GAEX1tD,EAAEsvD,KAAOA,EACTtvD,EAAEyyD,OAAS,KACXzyD,EAAE6yD,OAASW,EACXxzD,EAAEkuD,OAAS,GAAKluD,EAAE6yD,OAClB7yD,EAAEkwD,OAASlwD,EAAEkuD,OAAS,EAEtBluD,EAAE8yD,UAAYW,EAAW,EACzBzzD,EAAEmuD,UAAY,GAAKnuD,EAAE8yD,UACrB9yD,EAAEwuD,UAAYxuD,EAAEmuD,UAAY,EAC5BnuD,EAAEuuD,eAAiBvuD,EAAE8yD,UA/5CL,EA+5C6B,GA/5C7B,GAi6ChB9yD,EAAE2gB,OAAS,IAAIjiB,WAAsB,EAAXsB,EAAEkuD,QAC5BluD,EAAEouD,KAAO,IAAI2E,YAAY/yD,EAAEmuD,WAC3BnuD,EAAEwzB,KAAO,IAAIu/B,YAAY/yD,EAAEkuD,QAK3BluD,EAAEkzD,YAAc,GAAMO,EAAW,EAyCjCzzD,EAAEmxD,iBAAmC,EAAhBnxD,EAAEkzD,YACvBlzD,EAAE4kD,YAAc,IAAIlmD,WAAWsB,EAAEmxD,kBAIjCnxD,EAAE6mD,QAAU7mD,EAAEkzD,YAGdlzD,EAAE2pD,QAAgC,GAArB3pD,EAAEkzD,YAAc,GAM7BlzD,EAAEsvC,MAAQA,EACVtvC,EAAEmpD,SAAWA,EACbnpD,EAAE2yD,OAASA,EAEJU,GAAaxK,EAAK,EA2c3B,IAKI6K,GAtccC,CAAC9K,EAAMmI,KAEvB,GAAImC,GAAkBtK,IAASmI,EAAQjE,IAAaiE,EAAQ,EAC1D,OAAOnI,EAAOgF,GAAIhF,EAAMqE,IAAoBA,GAG9C,MAAMltD,EAAI6oD,EAAKhoB,MAEf,IAAKgoB,EAAK3pD,QACa,IAAlB2pD,EAAKuG,WAAmBvG,EAAKz3C,OAC7BpR,EAAEwyD,SAAW5E,IAAgBoD,IAAUlE,GAC1C,OAAOe,GAAIhF,EAA0B,IAAnBA,EAAK6F,UAAmBtB,GAAgBF,IAG5D,MAAM0G,EAAY5zD,EAAE4yD,WAIpB,GAHA5yD,EAAE4yD,WAAa5B,EAGG,IAAdhxD,EAAEynC,SAEJ,GADAgnB,GAAc5F,GACS,IAAnBA,EAAK6F,UAQP,OADA1uD,EAAE4yD,YAAc,EACT5F,QAOJ,GAAsB,IAAlBnE,EAAKuG,UAAkB5F,GAAKwH,IAAUxH,GAAKoK,IACpD5C,IAAUlE,GACV,OAAOe,GAAIhF,EAAMuE,IAInB,GAAIptD,EAAEwyD,SAAW5E,IAAkC,IAAlB/E,EAAKuG,SACpC,OAAOvB,GAAIhF,EAAMuE,IAOnB,GAHIptD,EAAEwyD,SAAW9E,IAAyB,IAAX1tD,EAAEsvD,OAC/BtvD,EAAEwyD,OAAS7E,IAET3tD,EAAEwyD,SAAW9E,GAAY,CAE3B,IAAImG,EAAUtG,IAAiBvtD,EAAE6yD,OAAS,GAAM,IAAO,EACnDiB,GAAe,EA2BnB,GAxBEA,EADE9zD,EAAEmpD,UAAYiD,IAAkBpsD,EAAEsvC,MAAQ,EAC9B,EACLtvC,EAAEsvC,MAAQ,EACL,EACO,IAAZtvC,EAAEsvC,MACG,EAEA,EAEhBukB,GAAWC,GAAe,EACP,IAAf9zD,EAAEgvD,WAAkB6E,GAziDR,IA0iDhBA,GAAU,GAAMA,EAAS,GAEzB3E,GAAYlvD,EAAG6zD,GAGI,IAAf7zD,EAAEgvD,WACJE,GAAYlvD,EAAG6oD,EAAK0B,QAAU,IAC9B2E,GAAYlvD,EAAgB,MAAb6oD,EAAK0B,QAEtB1B,EAAK0B,MAAQ,EACbvqD,EAAEwyD,OAAS7E,GAGXc,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,EAEX,CAEA,GA1jDqB,KA0jDjBhtD,EAAEwyD,OAMJ,GAJA3J,EAAK0B,MAAQ,EACb0E,GAASjvD,EAAG,IACZivD,GAASjvD,EAAG,KACZivD,GAASjvD,EAAG,GACPA,EAAEyyD,OAoBLxD,GAASjvD,GAAIA,EAAEyyD,OAAOsB,KAAO,EAAI,IACpB/zD,EAAEyyD,OAAOuB,KAAO,EAAI,IACnBh0D,EAAEyyD,OAAO9L,MAAY,EAAJ,IACjB3mD,EAAEyyD,OAAO9hD,KAAW,EAAJ,IAChB3Q,EAAEyyD,OAAOwB,QAAc,GAAJ,IAEjChF,GAASjvD,EAAmB,IAAhBA,EAAEyyD,OAAOyB,MACrBjF,GAASjvD,EAAIA,EAAEyyD,OAAOyB,MAAQ,EAAK,KACnCjF,GAASjvD,EAAIA,EAAEyyD,OAAOyB,MAAQ,GAAM,KACpCjF,GAASjvD,EAAIA,EAAEyyD,OAAOyB,MAAQ,GAAM,KACpCjF,GAASjvD,EAAe,IAAZA,EAAEsvC,MAAc,EACftvC,EAAEmpD,UAAYiD,IAAkBpsD,EAAEsvC,MAAQ,EAC1C,EAAI,GACjB2f,GAASjvD,EAAiB,IAAdA,EAAEyyD,OAAO0B,IACjBn0D,EAAEyyD,OAAO9L,OAAS3mD,EAAEyyD,OAAO9L,MAAM1oD,SACnCgxD,GAASjvD,EAA2B,IAAxBA,EAAEyyD,OAAO9L,MAAM1oD,QAC3BgxD,GAASjvD,EAAIA,EAAEyyD,OAAO9L,MAAM1oD,QAAU,EAAK,MAEzC+B,EAAEyyD,OAAOuB,OACXnL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAS,IAE7DznC,EAAE0yD,QAAU,EACZ1yD,EAAEwyD,OAxmDe,QA4kDjB,GAbAvD,GAASjvD,EAAG,GACZivD,GAASjvD,EAAG,GACZivD,GAASjvD,EAAG,GACZivD,GAASjvD,EAAG,GACZivD,GAASjvD,EAAG,GACZivD,GAASjvD,EAAe,IAAZA,EAAEsvC,MAAc,EACftvC,EAAEmpD,UAAYiD,IAAkBpsD,EAAEsvC,MAAQ,EAC1C,EAAI,GACjB2f,GAASjvD,EA3jDC,GA4jDVA,EAAEwyD,OAAS7E,GAGXc,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,GA6Bb,GA3mDqB,KA2mDjBhtD,EAAEwyD,OAAwB,CAC5B,GAAIxyD,EAAEyyD,OAAO9L,MAAqB,CAChC,IAAIyN,EAAMp0D,EAAEynC,QACRtmB,GAAgC,MAAxBnhB,EAAEyyD,OAAO9L,MAAM1oD,QAAmB+B,EAAE0yD,QAChD,KAAO1yD,EAAEynC,QAAUtmB,EAAOnhB,EAAEmxD,kBAAkB,CAC5C,IAAIpuD,EAAO/C,EAAEmxD,iBAAmBnxD,EAAEynC,QAYlC,GATAznC,EAAE4kD,YAAYl7C,IAAI1J,EAAEyyD,OAAO9L,MAAM76C,SAAS9L,EAAE0yD,QAAS1yD,EAAE0yD,QAAU3vD,GAAO/C,EAAEynC,SAC1EznC,EAAEynC,QAAUznC,EAAEmxD,iBAEVnxD,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,IAGnEp0D,EAAE0yD,SAAW3vD,EACb0rD,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,GAEToH,EAAM,EACNjzC,GAAQpe,CACV,CAGA,IAAIsxD,EAAe,IAAI31D,WAAWsB,EAAEyyD,OAAO9L,OAG3C3mD,EAAE4kD,YAAYl7C,IAAI2qD,EAAavoD,SAAS9L,EAAE0yD,QAAS1yD,EAAE0yD,QAAUvxC,GAAOnhB,EAAEynC,SACxEznC,EAAEynC,SAAWtmB,EAETnhB,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,IAGnEp0D,EAAE0yD,QAAU,CACd,CACA1yD,EAAEwyD,OAhpDiB,EAipDrB,CACA,GAlpDqB,KAkpDjBxyD,EAAEwyD,OAAuB,CAC3B,GAAIxyD,EAAEyyD,OAAO9hD,KAAoB,CAC/B,IACIrL,EADA8uD,EAAMp0D,EAAEynC,QAEZ,EAAG,CACD,GAAIznC,EAAEynC,UAAYznC,EAAEmxD,iBAAkB,CAOpC,GALInxD,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,IAGnE3F,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,GAEToH,EAAM,CACR,CAGE9uD,EADEtF,EAAE0yD,QAAU1yD,EAAEyyD,OAAO9hD,KAAK1S,OACkB,IAAxC+B,EAAEyyD,OAAO9hD,KAAK9S,WAAWmC,EAAE0yD,WAE3B,EAERzD,GAASjvD,EAAGsF,SACG,IAARA,GAELtF,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,IAGnEp0D,EAAE0yD,QAAU,CACd,CACA1yD,EAAEwyD,OAlrDiB,EAmrDrB,CACA,GAprDqB,KAorDjBxyD,EAAEwyD,OAA0B,CAC9B,GAAIxyD,EAAEyyD,OAAOwB,QAAuB,CAClC,IACI3uD,EADA8uD,EAAMp0D,EAAEynC,QAEZ,EAAG,CACD,GAAIznC,EAAEynC,UAAYznC,EAAEmxD,iBAAkB,CAOpC,GALInxD,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,IAGnE3F,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,GAEToH,EAAM,CACR,CAGE9uD,EADEtF,EAAE0yD,QAAU1yD,EAAEyyD,OAAOwB,QAAQh2D,OACkB,IAA3C+B,EAAEyyD,OAAOwB,QAAQp2D,WAAWmC,EAAE0yD,WAE9B,EAERzD,GAASjvD,EAAGsF,SACG,IAARA,GAELtF,EAAEyyD,OAAOuB,MAAQh0D,EAAEynC,QAAU2sB,IAC/BvL,EAAK0B,MAAQI,GAAQ9B,EAAK0B,MAAOvqD,EAAE4kD,YAAa5kD,EAAEynC,QAAU2sB,EAAKA,GAGrE,CACAp0D,EAAEwyD,OAntDgB,GAotDpB,CACA,GArtDoB,MAqtDhBxyD,EAAEwyD,OAAuB,CAC3B,GAAIxyD,EAAEyyD,OAAOuB,KAAM,CACjB,GAAIh0D,EAAEynC,QAAU,EAAIznC,EAAEmxD,mBACpB1C,GAAc5F,GACI,IAAd7oD,EAAEynC,SAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,GAGXiC,GAASjvD,EAAgB,IAAb6oD,EAAK0B,OACjB0E,GAASjvD,EAAI6oD,EAAK0B,OAAS,EAAK,KAChC1B,EAAK0B,MAAQ,CACf,CAKA,GAJAvqD,EAAEwyD,OAAS7E,GAGXc,GAAc5F,GACI,IAAd7oD,EAAEynC,QAEJ,OADAznC,EAAE4yD,YAAc,EACT5F,EAEX,CAKA,GAAsB,IAAlBnE,EAAKuG,UAAkC,IAAhBpvD,EAAEuwD,WAC1BS,IAAUpE,IAAgB5sD,EAAEwyD,SAAW5E,GAAe,CACvD,IAAI0G,EAAqB,IAAZt0D,EAAEsvC,MAAcyhB,GAAe/wD,EAAGgxD,GAClChxD,EAAEmpD,WAAaiD,GApwBXmI,EAACv0D,EAAGgxD,KAEvB,IAAIQ,EAEJ,OAAS,CAEP,GAAoB,IAAhBxxD,EAAEuwD,YACJE,GAAYzwD,GACQ,IAAhBA,EAAEuwD,WAAiB,CACrB,GAAIS,IAAUpE,GACZ,OAp/BgB,EAs/BlB,KACF,CAUF,GANA5sD,EAAEyxD,aAAe,EAGjBD,EAASrH,GAAUnqD,EAAG,EAAGA,EAAE2gB,OAAO3gB,EAAEgvD,WACpChvD,EAAEuwD,YACFvwD,EAAEgvD,WACEwC,IAEF1C,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WACT,OArgCkB,CAygCxB,CAEA,OADA1uD,EAAE6wD,OAAS,EACPG,IAAUlE,IAEZgC,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,UA5gCW,EACA,GAihCpB1uD,EAAE6lD,WAEJiJ,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WAvhCW,EACA,CA2hCJ,EAktB2B6F,CAAav0D,EAAGgxD,GAChDhxD,EAAEmpD,WAAakD,GAr2BZmI,EAACx0D,EAAGgxD,KAEtB,IAAIQ,EACAh+B,EACAo8B,EAAMO,EAEV,MAAMH,EAAOhwD,EAAE2gB,OAEf,OAAS,CAKP,GAAI3gB,EAAEuwD,WAAa/C,GAAW,CAE5B,GADAiD,GAAYzwD,GACRA,EAAEuwD,WAAa/C,IAAawD,IAAUpE,GACxC,OA15BkB,EA45BpB,GAAoB,IAAhB5sD,EAAEuwD,UAAmB,KAC3B,CAIA,GADAvwD,EAAEyxD,aAAe,EACbzxD,EAAEuwD,WAl7BQ,GAk7BkBvwD,EAAEgvD,SAAW,IAC3CY,EAAO5vD,EAAEgvD,SAAW,EACpBx7B,EAAOw8B,EAAKJ,GACRp8B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IAAO,CAC3EO,EAASnwD,EAAEgvD,SAAWxB,GACtB,UAESh6B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IACzCp8B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IACzCp8B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IACzCp8B,IAASw8B,IAAOJ,IAASp8B,IAASw8B,IAAOJ,IACzCA,EAAOO,GAChBnwD,EAAEyxD,aAAejE,IAAa2C,EAASP,GACnC5vD,EAAEyxD,aAAezxD,EAAEuwD,YACrBvwD,EAAEyxD,aAAezxD,EAAEuwD,UAEvB,CAuBF,GAlBIvwD,EAAEyxD,cAv8BQ,GA28BZD,EAASrH,GAAUnqD,EAAG,EAAGA,EAAEyxD,aA38Bf,GA68BZzxD,EAAEuwD,WAAavwD,EAAEyxD,aACjBzxD,EAAEgvD,UAAYhvD,EAAEyxD,aAChBzxD,EAAEyxD,aAAe,IAKjBD,EAASrH,GAAUnqD,EAAG,EAAGA,EAAE2gB,OAAO3gB,EAAEgvD,WAEpChvD,EAAEuwD,YACFvwD,EAAEgvD,YAEAwC,IAEF1C,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WACT,OA58BkB,CAg9BxB,CAEA,OADA1uD,EAAE6wD,OAAS,EACPG,IAAUlE,IAEZgC,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,UAn9BW,EACA,GAw9BpB1uD,EAAE6lD,WAEJiJ,GAAiB9uD,GAAG,GACK,IAArBA,EAAE6oD,KAAK6F,WA99BW,EACA,CAk+BJ,EA4wBkB8F,CAAYx0D,EAAGgxD,GACtCsB,GAAoBtyD,EAAEsvC,OAAO+iB,KAAKryD,EAAGgxD,GAKlD,GAnvDsB,IAgvDlBsD,GA/uDkB,IA+uDcA,IAClCt0D,EAAEwyD,OAAS5E,IAnvDS,IAqvDlB0G,GAnvDkB,IAmvDSA,EAK7B,OAJuB,IAAnBzL,EAAK6F,YACP1uD,EAAE4yD,YAAc,GAGX5F,GAST,GAlwDsB,IAkwDlBsH,IACEtD,IAAU/F,GACZb,GAAUpqD,GAEHgxD,IAAUjE,KAEjB9C,GAAiBjqD,EAAG,EAAG,GAAG,GAItBgxD,IAAUnE,KAEZkB,GAAK/tD,EAAEouD,MAEa,IAAhBpuD,EAAEuwD,YACJvwD,EAAEgvD,SAAW,EACbhvD,EAAE+uD,YAAc,EAChB/uD,EAAE6wD,OAAS,KAIjBpC,GAAc5F,GACS,IAAnBA,EAAK6F,WAEP,OADA1uD,EAAE4yD,YAAc,EACT5F,EAGb,CAEA,OAAIgE,IAAUlE,GAAqBE,GAC/BhtD,EAAEsvD,MAAQ,EAAYrC,IAGX,IAAXjtD,EAAEsvD,MACJL,GAASjvD,EAAgB,IAAb6oD,EAAK0B,OACjB0E,GAASjvD,EAAI6oD,EAAK0B,OAAS,EAAK,KAChC0E,GAASjvD,EAAI6oD,EAAK0B,OAAS,GAAM,KACjC0E,GAASjvD,EAAI6oD,EAAK0B,OAAS,GAAM,KACjC0E,GAASjvD,EAAmB,IAAhB6oD,EAAK0G,UACjBN,GAASjvD,EAAI6oD,EAAK0G,UAAY,EAAK,KACnCN,GAASjvD,EAAI6oD,EAAK0G,UAAY,GAAM,KACpCN,GAASjvD,EAAI6oD,EAAK0G,UAAY,GAAM,OAIpCL,GAAYlvD,EAAG6oD,EAAK0B,QAAU,IAC9B2E,GAAYlvD,EAAgB,MAAb6oD,EAAK0B,QAGtBkE,GAAc5F,GAIV7oD,EAAEsvD,KAAO,IAAKtvD,EAAEsvD,MAAQtvD,EAAEsvD,MAET,IAAdtvD,EAAEynC,QAAgBulB,GAASC,GAAc,EA0G9CwH,GApFyBC,CAAC7L,EAAM8L,KAElC,IAAIC,EAAaD,EAAW12D,OAE5B,GAAIk1D,GAAkBtK,GACpB,OAAOqE,GAGT,MAAMltD,EAAI6oD,EAAKhoB,MACTyuB,EAAOtvD,EAAEsvD,KAEf,GAAa,IAATA,GAAwB,IAATA,GAActvD,EAAEwyD,SAAW9E,IAAe1tD,EAAEuwD,UAC7D,OAAOrD,GAYT,GARa,IAAToC,IAEFzG,EAAK0B,MAAQF,GAAUxB,EAAK0B,MAAOoK,EAAYC,EAAY,IAG7D50D,EAAEsvD,KAAO,EAGLsF,GAAc50D,EAAEkuD,OAAQ,CACb,IAAToB,IAEFvB,GAAK/tD,EAAEouD,MACPpuD,EAAEgvD,SAAW,EACbhvD,EAAE+uD,YAAc,EAChB/uD,EAAE6wD,OAAS,GAIb,IAAIgE,EAAU,IAAIn2D,WAAWsB,EAAEkuD,QAC/B2G,EAAQnrD,IAAIirD,EAAW7oD,SAAS8oD,EAAa50D,EAAEkuD,OAAQ0G,GAAa,GACpED,EAAaE,EACbD,EAAa50D,EAAEkuD,MACjB,CAEA,MAAM4G,EAAQjM,EAAKuG,SACb37B,EAAOo1B,EAAKwG,QACZj+C,EAAQy3C,EAAKz3C,MAKnB,IAJAy3C,EAAKuG,SAAWwF,EAChB/L,EAAKwG,QAAU,EACfxG,EAAKz3C,MAAQujD,EACblE,GAAYzwD,GACLA,EAAEuwD,WAh5DO,GAg5DiB,CAC/B,IAAIzpD,EAAM9G,EAAEgvD,SACR5pD,EAAIpF,EAAEuwD,UAAS,EACnB,GAEEvwD,EAAE8wD,MAAQzC,GAAKruD,EAAGA,EAAE8wD,MAAO9wD,EAAE2gB,OAAO7Z,EAr5DxB,EAq5D0C,IAEtD9G,EAAEwzB,KAAK1sB,EAAM9G,EAAEkwD,QAAUlwD,EAAEouD,KAAKpuD,EAAE8wD,OAElC9wD,EAAEouD,KAAKpuD,EAAE8wD,OAAShqD,EAClBA,YACS1B,GACXpF,EAAEgvD,SAAWloD,EACb9G,EAAEuwD,UAAYoB,EACdlB,GAAYzwD,EACd,CAWA,OAVAA,EAAEgvD,UAAYhvD,EAAEuwD,UAChBvwD,EAAE+uD,YAAc/uD,EAAEgvD,SAClBhvD,EAAE6wD,OAAS7wD,EAAEuwD,UACbvwD,EAAEuwD,UAAY,EACdvwD,EAAEyxD,aAAezxD,EAAE8vD,YAAc6B,EACjC3xD,EAAE+xD,gBAAkB,EACpBlJ,EAAKwG,QAAU57B,EACfo1B,EAAKz3C,MAAQA,EACby3C,EAAKuG,SAAW0F,EAChB90D,EAAEsvD,KAAOA,EACFtC,EAAM,EAwBX+H,GAAc,CACjBC,YA7dmBA,CAACnM,EAAMvZ,IAElBikB,GAAa1K,EAAMvZ,EAAOie,GA5/Cf,GAEE,EA0/CuDD,IA4d5EiG,aArBoBA,GAsBpBF,aArBoBA,GAsBpBD,iBArBwBA,GAsBxB6B,iBAnmBwBA,CAACpM,EAAMuF,IAE1B+E,GAAkBtK,IAA6B,IAApBA,EAAKhoB,MAAMyuB,KACjCpC,IAETrE,EAAKhoB,MAAM4xB,OAASrE,EACbpB,IA8lBRkI,QAASxB,GACTyB,WA1HmBtM,IAElB,GAAIsK,GAAkBtK,GACpB,OAAOqE,GAGT,MAAMsF,EAAS3J,EAAKhoB,MAAM2xB,OAI1B,OAFA3J,EAAKhoB,MAAQ,KAEN2xB,IAAW7E,GAAaE,GAAIhF,EAAMsE,IAAkBH,EAAM,EAiHlE0H,qBAAsBD,GACtBW,YArBiB,sCAwBlB,MAAMC,GAAOA,CAAC9xD,EAAK0xB,IACVtzB,OAAOE,UAAUkT,eAAetP,KAAKlC,EAAK0xB,GAGnD,IA0CIgT,GAAS,CACZzzB,OA3CY,SAAUjR,GACrB,MAAM+xD,EAAU32D,MAAMkD,UAAUY,MAAMgD,KAAKnB,UAAW,GACtD,KAAOgxD,EAAQr3D,QAAQ,CACrB,MAAM43B,EAASy/B,EAAQx9C,QACvB,GAAK+d,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAI7zB,UAAU6zB,EAAS,sBAG/B,IAAK,MAAMrH,KAAKqH,EACVw/B,GAAKx/B,EAAQrH,KACfjrB,EAAIirB,GAAKqH,EAAOrH,GARK,CAW3B,CAEA,OAAOjrB,CACT,EA0BCgyD,cAtBoBC,IAEnB,IAAI73D,EAAM,EAEV,IAAK,IAAIL,EAAI,EAAG2nC,EAAIuwB,EAAOv3D,OAAQX,EAAI2nC,EAAG3nC,IACxCK,GAAO63D,EAAOl4D,GAAGW,OAInB,MAAM86B,EAAS,IAAIr6B,WAAWf,GAE9B,IAAK,IAAIL,EAAI,EAAGmM,EAAM,EAAGw7B,EAAIuwB,EAAOv3D,OAAQX,EAAI2nC,EAAG3nC,IAAK,CACtD,IAAIm4D,EAAQD,EAAOl4D,GACnBy7B,EAAOrvB,IAAI+rD,EAAOhsD,GAClBA,GAAOgsD,EAAMx3D,MACf,CAEA,OAAO86B,CAAM,GAgBf,IAAI28B,IAAmB,EAEvB,IAAM5vD,OAAOoC,aAAaC,MAAM,KAAM,IAAIzJ,WAAW,GAAK,CAAE,MAAOi3D,GAAMD,IAAmB,CAAO,CAMnG,MAAME,GAAW,IAAIl3D,WAAW,KAChC,IAAK,IAAIwtB,EAAI,EAAGA,EAAI,IAAKA,IACvB0pC,GAAS1pC,GAAMA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAIA,GAAK,IAAM,EAAI,EAE5F0pC,GAAS,KAAOA,GAAS,KAAO,EAiFhC,IAyEIC,GAAU,CACbC,WAvJiBhvD,IAChB,GAA2B,mBAAhBkxB,aAA8BA,YAAYn2B,UAAUsT,OAC7D,OAAO,IAAI6iB,aAAc7iB,OAAOrO,GAGlC,IAAIpF,EAAKpB,EAAGy1D,EAAIC,EAAO14D,EAAG24D,EAAUnvD,EAAI7I,OAAQi4D,EAAU,EAG1D,IAAKF,EAAQ,EAAGA,EAAQC,EAASD,IAC/B11D,EAAIwG,EAAIjJ,WAAWm4D,GACE,QAAZ,MAAJ11D,IAA2B01D,EAAQ,EAAIC,IAC1CF,EAAKjvD,EAAIjJ,WAAWm4D,EAAQ,GACN,QAAZ,MAALD,KACHz1D,EAAI,OAAYA,EAAI,OAAW,KAAOy1D,EAAK,OAC3CC,MAGJE,GAAW51D,EAAI,IAAO,EAAIA,EAAI,KAAQ,EAAIA,EAAI,MAAU,EAAI,EAO9D,IAHAoB,EAAM,IAAIhD,WAAWw3D,GAGhB54D,EAAI,EAAG04D,EAAQ,EAAG14D,EAAI44D,EAASF,IAClC11D,EAAIwG,EAAIjJ,WAAWm4D,GACE,QAAZ,MAAJ11D,IAA2B01D,EAAQ,EAAIC,IAC1CF,EAAKjvD,EAAIjJ,WAAWm4D,EAAQ,GACN,QAAZ,MAALD,KACHz1D,EAAI,OAAYA,EAAI,OAAW,KAAOy1D,EAAK,OAC3CC,MAGA11D,EAAI,IAENoB,EAAIpE,KAAOgD,EACFA,EAAI,MAEboB,EAAIpE,KAAO,IAAQgD,IAAM,EACzBoB,EAAIpE,KAAO,IAAY,GAAJgD,GACVA,EAAI,OAEboB,EAAIpE,KAAO,IAAQgD,IAAM,GACzBoB,EAAIpE,KAAO,IAAQgD,IAAM,EAAI,GAC7BoB,EAAIpE,KAAO,IAAY,GAAJgD,IAGnBoB,EAAIpE,KAAO,IAAQgD,IAAM,GACzBoB,EAAIpE,KAAO,IAAQgD,IAAM,GAAK,GAC9BoB,EAAIpE,KAAO,IAAQgD,IAAM,EAAI,GAC7BoB,EAAIpE,KAAO,IAAY,GAAJgD,GAIvB,OAAOoB,CAAG,EAkGXy0D,WA3EgBA,CAACz0D,EAAKuI,KACrB,MAAMtM,EAAMsM,GAAOvI,EAAIzD,OAEvB,GAA2B,mBAAhBw5B,aAA8BA,YAAY51B,UAAUuT,OAC7D,OAAO,IAAIqiB,aAAcriB,OAAO1T,EAAIoK,SAAS,EAAG7B,IAGlD,IAAI3M,EAAGwN,EAKP,MAAMsrD,EAAW,IAAIz3D,MAAY,EAANhB,GAE3B,IAAKmN,EAAM,EAAGxN,EAAI,EAAGA,EAAIK,GAAM,CAC7B,IAAI2C,EAAIoB,EAAIpE,KAEZ,GAAIgD,EAAI,IAAM,CAAE81D,EAAStrD,KAASxK,EAAG,QAAU,CAE/C,IAAI+1D,EAAQT,GAASt1D,GAErB,GAAI+1D,EAAQ,EAAKD,EAAStrD,KAAS,MAAQxN,GAAK+4D,EAAQ,MAAxD,CAKA,IAFA/1D,GAAe,IAAV+1D,EAAc,GAAiB,IAAVA,EAAc,GAAO,EAExCA,EAAQ,GAAK/4D,EAAIK,GACtB2C,EAAKA,GAAK,EAAiB,GAAXoB,EAAIpE,KACpB+4D,IAIEA,EAAQ,EAAKD,EAAStrD,KAAS,MAE/BxK,EAAI,MACN81D,EAAStrD,KAASxK,GAElBA,GAAK,MACL81D,EAAStrD,KAAS,MAAWxK,GAAK,GAAM,KACxC81D,EAAStrD,KAAS,MAAc,KAAJxK,EAlBuC,CAoBvE,CAEA,MA9DoBg2D,EAAC50D,EAAK/D,KAI1B,GAAIA,EAAM,OACJ+D,EAAIoK,UAAY4pD,GAClB,OAAO5vD,OAAOoC,aAAaC,MAAM,KAAMzG,EAAIzD,SAAWN,EAAM+D,EAAMA,EAAIoK,SAAS,EAAGnO,IAItF,IAAIo7B,EAAS,GACb,IAAK,IAAIz7B,EAAI,EAAGA,EAAIK,EAAKL,IACvBy7B,GAAUjzB,OAAOoC,aAAaxG,EAAIpE,IAEpC,OAAOy7B,CAAM,EAgDNu9B,CAAcF,EAAUtrD,EAAI,EAiCpCyrD,WAvBgBA,CAAC70D,EAAKuI,MAErBA,EAAMA,GAAOvI,EAAIzD,QACPyD,EAAIzD,SAAUgM,EAAMvI,EAAIzD,QAGlC,IAAIwL,EAAMQ,EAAM,EAChB,KAAOR,GAAO,GAA2B,MAAV,IAAX/H,EAAI+H,KAAyBA,IAIjD,OAAIA,EAAM,GAIE,IAARA,EAJkBQ,EAMdR,EAAMmsD,GAASl0D,EAAI+H,IAAQQ,EAAOR,EAAMQ,CAAG,GAqDrD,IAAIusD,GAzBJ,WAEE5xD,KAAKwM,MAAQ,KACbxM,KAAKyqD,QAAU,EAEfzqD,KAAKwqD,SAAW,EAEhBxqD,KAAK2qD,SAAW,EAEhB3qD,KAAK1F,OAAS,KACd0F,KAAKgqD,SAAW,EAEhBhqD,KAAK8pD,UAAY,EAEjB9pD,KAAKiqD,UAAY,EAEjBjqD,KAAKyM,IAAM,GAEXzM,KAAKi8B,MAAQ,KAEbj8B,KAAKkkD,UAAY,EAEjBlkD,KAAK2lD,MAAQ,CACf,EAIA,MAAMkM,GAAa90D,OAAOE,UAAUuC,UAMlC4mD,WAAY0L,GAAYxL,aAAEA,GAAYC,aAAEA,GAAcC,SAAUuL,GAChEpL,KAAMqL,GAAQpL,aAAcqL,GAAc3K,sBAC1CA,GAAqBK,mBACrBA,GACAI,WAAYmK,IACV/L,GA0FJ,SAASgM,GAAUr/B,GACjB9yB,KAAK8yB,QAAUuQ,GAAOzzB,OAAO,CAC3B86B,MAAO4c,GACPyG,OAAQmE,GACRE,UAAW,MACXxD,WAAY,GACZC,SAAU,EACVtK,SAAUoD,IACT70B,GAAW,CAAA,GAEd,IAAIu/B,EAAMryD,KAAK8yB,QAEXu/B,EAAIC,KAAQD,EAAIzD,WAAa,EAC/ByD,EAAIzD,YAAcyD,EAAIzD,WAGfyD,EAAIE,MAASF,EAAIzD,WAAa,GAAOyD,EAAIzD,WAAa,KAC7DyD,EAAIzD,YAAc,IAGpB5uD,KAAKipD,IAAS,EACdjpD,KAAKyM,IAAS,GACdzM,KAAKwyD,OAAS,EACdxyD,KAAK4wD,OAAS,GAEd5wD,KAAKikD,KAAO,IAAI2N,GAChB5xD,KAAKikD,KAAK6F,UAAY,EAEtB,IAAI8D,EAASuC,GAAYxB,aACvB3uD,KAAKikD,KACLoO,EAAI3nB,MACJ2nB,EAAItE,OACJsE,EAAIzD,WACJyD,EAAIxD,SACJwD,EAAI9N,UAGN,GAAIqJ,IAAWoE,GACb,MAAM,IAAI/3D,MAAMisD,GAAS0H,IAO3B,GAJIyE,EAAIpD,QACNkB,GAAYE,iBAAiBrwD,KAAKikD,KAAMoO,EAAIpD,QAG1CoD,EAAItC,WAAY,CAClB,IAAI0C,EAaJ,GATEA,EAF4B,iBAAnBJ,EAAItC,WAENkB,GAAQC,WAAWmB,EAAItC,YACe,yBAApC8B,GAAWhxD,KAAKwxD,EAAItC,YACtB,IAAIj2D,WAAWu4D,EAAItC,YAEnBsC,EAAItC,WAGbnC,EAASuC,GAAYL,qBAAqB9vD,KAAKikD,KAAMwO,GAEjD7E,IAAWoE,GACb,MAAM,IAAI/3D,MAAMisD,GAAS0H,IAG3B5tD,KAAK0yD,WAAY,CACnB,CACF,CAwBAP,GAAUl1D,UAAUvD,KAAO,SAAUwF,EAAMyzD,GACzC,MAAM1O,EAAOjkD,KAAKikD,KACZmO,EAAYpyD,KAAK8yB,QAAQs/B,UAC/B,IAAIxE,EAAQgF,EAEZ,GAAI5yD,KAAKwyD,MAAS,OAAO,EAkBzB,IAhBiCI,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBZ,GAAaD,GAGlC,iBAAT5yD,EAET+kD,EAAKz3C,MAAQykD,GAAQC,WAAWhyD,GACG,yBAA1B2yD,GAAWhxD,KAAK3B,GACzB+kD,EAAKz3C,MAAQ,IAAI1S,WAAWoF,GAE5B+kD,EAAKz3C,MAAQtN,EAGf+kD,EAAKwG,QAAU,EACfxG,EAAKuG,SAAWvG,EAAKz3C,MAAMnT,SAUzB,GAPuB,IAAnB4qD,EAAK6F,YACP7F,EAAK3pD,OAAS,IAAIR,WAAWs4D,GAC7BnO,EAAK+F,SAAW,EAChB/F,EAAK6F,UAAYsI,IAIdQ,IAAgBtM,IAAgBsM,IAAgBrM,KAAiBtC,EAAK6F,WAAa,EACtF9pD,KAAK6yD,OAAO5O,EAAK3pD,OAAO4M,SAAS,EAAG+8C,EAAK+F,WACzC/F,EAAK6F,UAAY,MAFnB,CASA,GAHA8D,EAASuC,GAAYG,QAAQrM,EAAM2O,GAG/BhF,IAAWqE,GAOb,OANIhO,EAAK+F,SAAW,GAClBhqD,KAAK6yD,OAAO5O,EAAK3pD,OAAO4M,SAAS,EAAG+8C,EAAK+F,WAE3C4D,EAASuC,GAAYI,WAAWvwD,KAAKikD,MACrCjkD,KAAK8yD,MAAMlF,GACX5tD,KAAKwyD,OAAQ,EACN5E,IAAWoE,GAIpB,GAAuB,IAAnB/N,EAAK6F,WAMT,GAAI8I,EAAc,GAAK3O,EAAK+F,SAAW,EACrChqD,KAAK6yD,OAAO5O,EAAK3pD,OAAO4M,SAAS,EAAG+8C,EAAK+F,WACzC/F,EAAK6F,UAAY,OAInB,GAAsB,IAAlB7F,EAAKuG,SAAgB,WAXvBxqD,KAAK6yD,OAAO5O,EAAK3pD,OAjBnB,CA+BF,OAAO,CACT,EAUA63D,GAAUl1D,UAAU41D,OAAS,SAAUhC,GACrC7wD,KAAK4wD,OAAOl3D,KAAKm3D,EACnB,EAYAsB,GAAUl1D,UAAU61D,MAAQ,SAAUlF,GAEhCA,IAAWoE,KACbhyD,KAAKm0B,OAASkP,GAAOstB,cAAc3wD,KAAK4wD,SAE1C5wD,KAAK4wD,OAAS,GACd5wD,KAAKipD,IAAM2E,EACX5tD,KAAKyM,IAAMzM,KAAKikD,KAAKx3C,GACvB,EA+GA,MAAMsmD,GAAQ,MAsCd,IAAIC,GAAU,SAAsB/O,EAAM9pD,GACxC,IAAI84D,EACA5qD,EACA6qD,EACA1D,EACAp1D,EAEA+4D,EAEA9J,EACA+J,EACAC,EAEAC,EACAC,EACArlD,EACAslD,EACAC,EACAC,EACAC,EACAC,EACA9hB,EAEA/4C,EACA+mD,EACAxiD,EACAu2D,EAGArnD,EAAOlS,EAGX,MAAM2hC,EAAQgoB,EAAKhoB,MAEnBg3B,EAAMhP,EAAKwG,QACXj+C,EAAQy3C,EAAKz3C,MACbnE,EAAO4qD,GAAOhP,EAAKuG,SAAW,GAC9B0I,EAAOjP,EAAK+F,SACZ1vD,EAAS2pD,EAAK3pD,OACdk1D,EAAM0D,GAAQ/4D,EAAQ8pD,EAAK6F,WAC3B1vD,EAAM84D,GAAQjP,EAAK6F,UAAY,KAE/BqJ,EAAOl3B,EAAMk3B,KAEb9J,EAAQptB,EAAMotB,MACd+J,EAAQn3B,EAAMm3B,MACdC,EAAQp3B,EAAMo3B,MACdC,EAAWr3B,EAAMlgB,OACjBw3C,EAAOt3B,EAAMs3B,KACbrlD,EAAO+tB,EAAM/tB,KACbslD,EAAQv3B,EAAM63B,QACdL,EAAQx3B,EAAM83B,SACdL,GAAS,GAAKz3B,EAAM+3B,SAAW,EAC/BL,GAAS,GAAK13B,EAAMg4B,UAAY,EAMhCC,EACA,EAAG,CACGhmD,EAAO,KACTqlD,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,EACRqlD,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,GAGV0lD,EAAOJ,EAAMD,EAAOG,GAEpBS,EACA,OAAS,CAKP,GAJAriB,EAAK8hB,IAAS,GACdL,KAAUzhB,EACV5jC,GAAQ4jC,EACRA,EAAM8hB,IAAS,GAAM,IACV,IAAP9hB,EAIFx3C,EAAO44D,KAAiB,MAAPU,MAEd,MAAS,GAAL9hB,GAwKJ,IAAkB,IAAR,GAALA,GAAgB,CACxB8hB,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKzhB,GAAM,IAChE,SAASqiB,CACX,CACK,GAAS,GAALriB,EAAS,CAEhB7V,EAAMnT,KArSC,MAsSP,MAAMorC,CACR,CAEEjQ,EAAKx3C,IAAM,8BACXwvB,EAAMnT,KAAOiqC,GACb,MAAMmB,CACR,CApLEn7D,EAAa,MAAP66D,EACN9hB,GAAM,GACFA,IACE5jC,EAAO4jC,IACTyhB,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,GAEVnV,GAAOw6D,GAAS,GAAKzhB,GAAM,EAC3ByhB,KAAUzhB,EACV5jC,GAAQ4jC,GAGN5jC,EAAO,KACTqlD,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,EACRqlD,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,GAEV0lD,EAAOH,EAAMF,EAAOI,GAEpBS,EACA,OAAS,CAMP,GALAtiB,EAAK8hB,IAAS,GACdL,KAAUzhB,EACV5jC,GAAQ4jC,EACRA,EAAM8hB,IAAS,GAAM,MAEZ,GAAL9hB,GA+HC,IAAkB,IAAR,GAALA,GAAgB,CACxB8hB,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKzhB,GAAM,IAChE,SAASsiB,CACX,CAEEnQ,EAAKx3C,IAAM,wBACXwvB,EAAMnT,KAAOiqC,GACb,MAAMmB,CACR,CA1HE,GAZApU,EAAc,MAAP8T,EACP9hB,GAAM,GACF5jC,EAAO4jC,IACTyhB,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,EACJA,EAAO4jC,IACTyhB,GAAQ/mD,EAAMymD,MAAU/kD,EACxBA,GAAQ,IAGZ4xC,GAAQyT,GAAS,GAAKzhB,GAAM,EAExBgO,EAAOqT,EAAM,CACflP,EAAKx3C,IAAM,gCACXwvB,EAAMnT,KAAOiqC,GACb,MAAMmB,CACR,CAMA,GAJAX,KAAUzhB,EACV5jC,GAAQ4jC,EAERA,EAAKohB,EAAO1D,EACR1P,EAAOhO,EAAI,CAEb,GADAA,EAAKgO,EAAOhO,EACRA,EAAKshB,GACHn3B,EAAMo4B,KAAM,CACdpQ,EAAKx3C,IAAM,gCACXwvB,EAAMnT,KAAOiqC,GACb,MAAMmB,CACR,CA0BF,GAFA52D,EAAO,EACPu2D,EAAcP,EACA,IAAVD,GAEF,GADA/1D,GAAQ+rD,EAAQvX,EACZA,EAAK/4C,EAAK,CACZA,GAAO+4C,EACP,GACEx3C,EAAO44D,KAAUI,EAASh2D,aACjBw0C,GACXx0C,EAAO41D,EAAOpT,EACd+T,EAAcv5D,CAChB,OAEG,GAAI+4D,EAAQvhB,GAGf,GAFAx0C,GAAQ+rD,EAAQgK,EAAQvhB,EACxBA,GAAMuhB,EACFvhB,EAAK/4C,EAAK,CACZA,GAAO+4C,EACP,GACEx3C,EAAO44D,KAAUI,EAASh2D,aACjBw0C,GAEX,GADAx0C,EAAO,EACH+1D,EAAQt6D,EAAK,CACf+4C,EAAKuhB,EACLt6D,GAAO+4C,EACP,GACEx3C,EAAO44D,KAAUI,EAASh2D,aACjBw0C,GACXx0C,EAAO41D,EAAOpT,EACd+T,EAAcv5D,CAChB,CACF,OAIA,GADAgD,GAAQ+1D,EAAQvhB,EACZA,EAAK/4C,EAAK,CACZA,GAAO+4C,EACP,GACEx3C,EAAO44D,KAAUI,EAASh2D,aACjBw0C,GACXx0C,EAAO41D,EAAOpT,EACd+T,EAAcv5D,CAChB,CAEF,KAAOvB,EAAM,GACXuB,EAAO44D,KAAUW,EAAYv2D,KAC7BhD,EAAO44D,KAAUW,EAAYv2D,KAC7BhD,EAAO44D,KAAUW,EAAYv2D,KAC7BvE,GAAO,EAELA,IACFuB,EAAO44D,KAAUW,EAAYv2D,KACzBvE,EAAM,IACRuB,EAAO44D,KAAUW,EAAYv2D,MAGnC,KACK,CACHA,EAAO41D,EAAOpT,EACd,GACExlD,EAAO44D,KAAU54D,EAAOgD,KACxBhD,EAAO44D,KAAU54D,EAAOgD,KACxBhD,EAAO44D,KAAU54D,EAAOgD,KACxBvE,GAAO,QACAA,EAAM,GACXA,IACFuB,EAAO44D,KAAU54D,EAAOgD,KACpBvE,EAAM,IACRuB,EAAO44D,KAAU54D,EAAOgD,MAG9B,CAYF,KACF,CAeF,CAEA,KACF,CACD,OAAQ21D,EAAM5qD,GAAQ6qD,EAAO94D,GAG9BrB,EAAMmV,GAAQ,EACd+kD,GAAOl6D,EACPmV,GAAQnV,GAAO,EACfw6D,IAAS,GAAKrlD,GAAQ,EAGtB+1C,EAAKwG,QAAUwI,EACfhP,EAAK+F,SAAWkJ,EAChBjP,EAAKuG,SAAYyI,EAAM5qD,EAAYA,EAAO4qD,EAAZ,EAAmB,GAAKA,EAAM5qD,GAC5D47C,EAAK6F,UAAaoJ,EAAO94D,EAAaA,EAAM84D,EAAb,IAAqB,KAAOA,EAAO94D,GAClE6hC,EAAMs3B,KAAOA,EACbt3B,EAAM/tB,KAAOA,CAEf,EAqBA,MAAMomD,GAAU,GASVC,GAAQ,IAAIpG,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,IAGzDqG,GAAO,IAAI16D,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,KAGpD26D,GAAQ,IAAItG,YAAY,CAC5B,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,IAG1BuG,GAAO,IAAI56D,WAAW,CAC1B,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,KAkStB,IAAI66D,GA/RkBC,CAAC51D,EAAM7G,EAAM08D,EAAYC,EAAO3nD,EAAO4nD,EAAaC,EAAMC,KAE9E,MAAM/mD,EAAO+mD,EAAK/mD,KAGlB,IASIgnD,EACA9wD,EACA+wD,EACAptC,EACA8G,EAGAgf,EAhBA90C,EAAM,EACNyS,EAAM,EACN7I,EAAM,EAAG0C,EAAM,EACf+vD,EAAO,EACPC,EAAO,EACPC,EAAO,EACP/4C,EAAO,EACPiwC,EAAO,EACP+I,EAAO,EAMPh6C,EAAO,KAGX,MAAMtJ,EAAQ,IAAIk8C,YAAYmG,IACxBkB,EAAO,IAAIrH,YAAYmG,IAC7B,IAEImB,EAAWC,EAASC,EAFpB5T,EAAQ,KAoCZ,IAAKhpD,EAAM,EAAGA,GAAOu7D,GAASv7D,IAC5BkZ,EAAMlZ,GAAO,EAEf,IAAKyS,EAAM,EAAGA,EAAMspD,EAAOtpD,IACzByG,EAAM9Z,EAAK08D,EAAarpD,MAK1B,IADA4pD,EAAOlnD,EACF7I,EAAMivD,GAASjvD,GAAO,GACN,IAAf4M,EAAM5M,GADkBA,KAM9B,GAHI+vD,EAAO/vD,IACT+vD,EAAO/vD,GAEG,IAARA,EAaF,OATA8H,EAAM4nD,KAAkB,SAMxB5nD,EAAM4nD,KAAkB,SAExBE,EAAK/mD,KAAO,EACL,EAET,IAAKvL,EAAM,EAAGA,EAAM0C,GACC,IAAf4M,EAAMtP,GADaA,KASzB,IANIyyD,EAAOzyD,IACTyyD,EAAOzyD,GAIT4Z,EAAO,EACFxjB,EAAM,EAAGA,GAAOu7D,GAASv7D,IAG5B,GAFAwjB,IAAS,EACTA,GAAQtK,EAAMlZ,GACVwjB,EAAO,EACT,OAAQ,EAGZ,GAAIA,EAAO,IApIG,IAoIGvd,GAA4B,IAARqG,GACnC,OAAQ,EAKV,IADAmwD,EAAK,GAAK,EACLz8D,EAAM,EAAGA,EAAMu7D,GAASv7D,IAC3By8D,EAAKz8D,EAAM,GAAKy8D,EAAKz8D,GAAOkZ,EAAMlZ,GAIpC,IAAKyS,EAAM,EAAGA,EAAMspD,EAAOtpD,IACM,IAA3BrT,EAAK08D,EAAarpD,KACpBwpD,EAAKQ,EAAKr9D,EAAK08D,EAAarpD,OAAWA,GAiE3C,GAlNc,IAuLVxM,GACFuc,EAAOwmC,EAAQiT,EACfnnB,EAAQ,IAxLG,IA0LF7uC,GACTuc,EAAOg5C,GACPxS,EAAQyS,GACR3mB,EAAQ,MAGRtyB,EAAOk5C,GACP1S,EAAQ2S,GACR7mB,EAAQ,GAIV0nB,EAAO,EACP/pD,EAAM,EACNzS,EAAM4J,EACNksB,EAAOkmC,EACPM,EAAOD,EACPE,EAAO,EACPH,GAAO,EACP3I,EAAO,GAAK4I,EACZrtC,EAAOykC,EAAO,EA9MD,IAiNRxtD,GAAmBwtD,EAtNJ,KAMN,IAiNXxtD,GAAoBwtD,EAtNF,IAuNnB,OAAO,EAIT,OAAS,CAEPiJ,EAAY18D,EAAMu8D,EACdN,EAAKxpD,GAAO,EAAIqiC,GAClB6nB,EAAU,EACVC,EAAWX,EAAKxpD,IAETwpD,EAAKxpD,IAAQqiC,GACpB6nB,EAAU3T,EAAMiT,EAAKxpD,GAAOqiC,GAC5B8nB,EAAWp6C,EAAKy5C,EAAKxpD,GAAOqiC,KAG5B6nB,EAAU,GACVC,EAAW,GAIbT,EAAO,GAAMn8D,EAAMu8D,EACnBlxD,EAAO,GAAKixD,EACZ1yD,EAAMyB,EACN,GACEA,GAAQ8wD,EACR/nD,EAAM0hB,GAAQ0mC,GAAQD,GAAQlxD,GAASqxD,GAAa,GAAOC,GAAW,GAAMC,EAAU,QACtE,IAATvxD,GAIT,IADA8wD,EAAO,GAAMn8D,EAAM,EACZw8D,EAAOL,GACZA,IAAS,EAWX,GATa,IAATA,GACFK,GAAQL,EAAO,EACfK,GAAQL,GAERK,EAAO,EAIT/pD,IACqB,KAAfyG,EAAMlZ,GAAY,CACtB,GAAIA,IAAQsM,EAAO,MACnBtM,EAAMZ,EAAK08D,EAAaG,EAAKxpD,GAC/B,CAGA,GAAIzS,EAAMq8D,IAASG,EAAOxtC,KAAUotC,EAAK,CAYvC,IAVa,IAATG,IACFA,EAAOF,GAITvmC,GAAQlsB,EAGR0yD,EAAOt8D,EAAMu8D,EACb/4C,EAAO,GAAK84C,EACLA,EAAOC,EAAOjwD,IACnBkX,GAAQtK,EAAMojD,EAAOC,KACjB/4C,GAAQ,KACZ84C,IACA94C,IAAS,EAKX,GADAiwC,GAAQ,GAAK6I,EAxRJ,IAyRJr2D,GAAmBwtD,EA9RR,KAMN,IAyRPxtD,GAAoBwtD,EA9RN,IA+Rf,OAAO,EAIT2I,EAAMI,EAAOxtC,EAIb5a,EAAMgoD,GAAQC,GAAQ,GAAOC,GAAQ,GAAOxmC,EAAOkmC,EAAc,CACnE,CACF,CAeA,OAVa,IAATQ,IAIFpoD,EAAM0hB,EAAO0mC,GAAUx8D,EAAMu8D,GAAS,GAAO,IAAM,GAAK,GAK1DL,EAAK/mD,KAAOknD,EACL,CAAC,EA8BV,MAQE5O,SAAUoP,GAAUnP,QAAEA,GAAOC,QAAEA,GAC/BC,KAAMkP,GAAQjP,aAAckP,GAAgBjP,YAAakP,GAAehP,eAAgBiP,GAAkBhP,aAAciP,GAAgBhP,YAAaiP,GAAahP,YAAEA,GAAWa,WAC/KA,IACE5B,GAOKgQ,GAAO,MAUPC,GAAO,MACHC,GAAO,MACPC,GAAS,MAETC,GAAQ,MAKJC,GAAO,MACPC,GAAM,MAMdC,GAAQ,MAGRC,GAAM,MAiBTC,GAAWtvC,IAEJA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,IAIzB,SAASuvC,KACP72D,KAAKikD,KAAO,KACZjkD,KAAK8oB,KAAO,EACZ9oB,KAAKqI,MAAO,EACZrI,KAAK0qD,KAAO,EAEZ1qD,KAAK82D,UAAW,EAChB92D,KAAK+2D,MAAQ,EAEb/2D,KAAKmzD,KAAO,EACZnzD,KAAKg3D,MAAQ,EACbh3D,KAAKqd,MAAQ,EAEbrd,KAAKwpD,KAAO,KAGZxpD,KAAKi3D,MAAQ,EACbj3D,KAAKqpD,MAAQ,EACbrpD,KAAKozD,MAAQ,EACbpzD,KAAKqzD,MAAQ,EACbrzD,KAAK+b,OAAS,KAGd/b,KAAKuzD,KAAO,EACZvzD,KAAKkO,KAAO,EAGZlO,KAAK3G,OAAS,EACd2G,KAAKvF,OAAS,EAGduF,KAAK+hD,MAAQ,EAGb/hD,KAAK8zD,QAAU,KACf9zD,KAAK+zD,SAAW,KAChB/zD,KAAKg0D,QAAU,EACfh0D,KAAKi0D,SAAW,EAGhBj0D,KAAKk3D,MAAQ,EACbl3D,KAAKm3D,KAAO,EACZn3D,KAAKo3D,MAAQ,EACbp3D,KAAKqsD,KAAO,EACZrsD,KAAK6uB,KAAO,KAEZ7uB,KAAK7H,KAAO,IAAIg2D,YAAY,KAC5BnuD,KAAKg1D,KAAO,IAAI7G,YAAY,KAO5BnuD,KAAKq3D,OAAS,KACdr3D,KAAKs3D,QAAU,KACft3D,KAAKq0D,KAAO,EACZr0D,KAAKu3D,KAAO,EACZv3D,KAAKw3D,IAAM,CACb,CAGA,MAAMC,GAAqBxT,IAEzB,IAAKA,EACH,OAAO,EAET,MAAMhoB,EAAQgoB,EAAKhoB,MACnB,OAAKA,GAASA,EAAMgoB,OAASA,GAC3BhoB,EAAMnT,KAAOqtC,IAAQl6B,EAAMnT,KA7Ff,MA8FL,EAEF,CAAC,EAIJ4uC,GAAoBzT,IAExB,GAAIwT,GAAkBxT,GAAS,OAAO+R,GACtC,MAAM/5B,EAAQgoB,EAAKhoB,MAqBnB,OApBAgoB,EAAK0G,SAAW1G,EAAKgG,UAAYhuB,EAAM5e,MAAQ,EAC/C4mC,EAAKx3C,IAAM,GACPwvB,EAAMyuB,OACRzG,EAAK0B,MAAqB,EAAb1pB,EAAMyuB,MAErBzuB,EAAMnT,KAAOqtC,GACbl6B,EAAM5zB,KAAO,EACb4zB,EAAM66B,SAAW,EACjB76B,EAAM86B,OAAS,EACf96B,EAAMk3B,KAAO,MACbl3B,EAAMutB,KAAO,KACbvtB,EAAMs3B,KAAO,EACbt3B,EAAM/tB,KAAO,EAEb+tB,EAAM63B,QAAU73B,EAAMo7B,OAAS,IAAIM,WAhHjB,KAiHlB17B,EAAM83B,SAAW93B,EAAMq7B,QAAU,IAAIK,WAhHlB,KAkHnB17B,EAAMo4B,KAAO,EACbp4B,EAAMs7B,MAAQ,EAEP1B,EAAM,EAIT+B,GAAgB3T,IAEpB,GAAIwT,GAAkBxT,GAAS,OAAO+R,GACtC,MAAM/5B,EAAQgoB,EAAKhoB,MAInB,OAHAA,EAAMotB,MAAQ,EACdptB,EAAMm3B,MAAQ,EACdn3B,EAAMo3B,MAAQ,EACPqE,GAAiBzT,EAAK,EAKzB4T,GAAgBA,CAAC5T,EAAM2K,KAC3B,IAAIlE,EAGJ,GAAI+M,GAAkBxT,GAAS,OAAO+R,GACtC,MAAM/5B,EAAQgoB,EAAKhoB,MAenB,OAZI2yB,EAAa,GACflE,EAAO,EACPkE,GAAcA,IAGdlE,EAA2B,GAAnBkE,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCoH,IAEY,OAAjB/5B,EAAMlgB,QAAmBkgB,EAAMg7B,QAAUrI,IAC3C3yB,EAAMlgB,OAAS,MAIjBkgB,EAAMyuB,KAAOA,EACbzuB,EAAMg7B,MAAQrI,EACPgJ,GAAa3T,GAAK,EAIrB6T,GAAeA,CAAC7T,EAAM2K,KAE1B,IAAK3K,EAAQ,OAAO+R,GAGpB,MAAM/5B,EAAQ,IAAI46B,GAIlB5S,EAAKhoB,MAAQA,EACbA,EAAMgoB,KAAOA,EACbhoB,EAAMlgB,OAAS,KACfkgB,EAAMnT,KAAOqtC,GACb,MAAMlwD,EAAM4xD,GAAc5T,EAAM2K,GAIhC,OAHI3oD,IAAQ4vD,KACV5R,EAAKhoB,MAAQ,MAERh2B,CAAG,EAoBZ,IAEI8xD,GAAQC,GAFRC,IAAS,EAKb,MAAMC,GAAej8B,IAGnB,GAAIg8B,GAAQ,CACVF,GAAS,IAAIJ,WAAW,KACxBK,GAAU,IAAIL,WAAW,IAGzB,IAAInsD,EAAM,EACV,KAAOA,EAAM,KAAOywB,EAAM9jC,KAAKqT,KAAS,EACxC,KAAOA,EAAM,KAAOywB,EAAM9jC,KAAKqT,KAAS,EACxC,KAAOA,EAAM,KAAOywB,EAAM9jC,KAAKqT,KAAS,EACxC,KAAOA,EAAM,KAAOywB,EAAM9jC,KAAKqT,KAAS,EAMxC,IAJAmpD,GAtRS,EAsRO14B,EAAM9jC,KAAM,EAAG,IAAK4/D,GAAU,EAAG97B,EAAM+4B,KAAM,CAAE9mD,KAAM,IAGrE1C,EAAM,EACCA,EAAM,IAAMywB,EAAM9jC,KAAKqT,KAAS,EAEvCmpD,GA3RU,EA2RM14B,EAAM9jC,KAAM,EAAG,GAAM6/D,GAAS,EAAG/7B,EAAM+4B,KAAM,CAAE9mD,KAAM,IAGrE+pD,IAAS,CACX,CAEAh8B,EAAM63B,QAAUiE,GAChB97B,EAAM+3B,QAAU,EAChB/3B,EAAM83B,SAAWiE,GACjB/7B,EAAMg4B,SAAW,CAAC,EAkBdkE,GAAeA,CAAClU,EAAMj3C,EAAK5S,EAAK+D,KAEpC,IAAI2hD,EACJ,MAAM7jB,EAAQgoB,EAAKhoB,MAqCnB,OAlCqB,OAAjBA,EAAMlgB,SACRkgB,EAAMotB,MAAQ,GAAKptB,EAAMg7B,MACzBh7B,EAAMo3B,MAAQ,EACdp3B,EAAMm3B,MAAQ,EAEdn3B,EAAMlgB,OAAS,IAAIjiB,WAAWmiC,EAAMotB,QAIlClrD,GAAQ89B,EAAMotB,OAChBptB,EAAMlgB,OAAOjX,IAAIkI,EAAI9F,SAAS9M,EAAM6hC,EAAMotB,MAAOjvD,GAAM,GACvD6hC,EAAMo3B,MAAQ,EACdp3B,EAAMm3B,MAAQn3B,EAAMotB,QAGpBvJ,EAAO7jB,EAAMotB,MAAQptB,EAAMo3B,MACvBvT,EAAO3hD,IACT2hD,EAAO3hD,GAGT89B,EAAMlgB,OAAOjX,IAAIkI,EAAI9F,SAAS9M,EAAM+D,EAAM/D,EAAM+D,EAAO2hD,GAAO7jB,EAAMo3B,QACpEl1D,GAAQ2hD,IAGN7jB,EAAMlgB,OAAOjX,IAAIkI,EAAI9F,SAAS9M,EAAM+D,EAAM/D,GAAM,GAChD6hC,EAAMo3B,MAAQl1D,EACd89B,EAAMm3B,MAAQn3B,EAAMotB,QAGpBptB,EAAMo3B,OAASvT,EACX7jB,EAAMo3B,QAAUp3B,EAAMotB,QAASptB,EAAMo3B,MAAQ,GAC7Cp3B,EAAMm3B,MAAQn3B,EAAMotB,QAASptB,EAAMm3B,OAAStT,KAG7C,CAAC,EAipCV,IAKIsY,GAlpCcC,CAACpU,EAAMmI,KAEvB,IAAInwB,EACAzvB,EAAOlS,EACPu0B,EACAypC,EACAjM,EAAM9vC,EACNg3C,EACArlD,EACA+kD,EAAKC,EACL/0D,EACAb,EACAu2D,EAEA4B,EAAWC,EAASC,EAEpB4C,EAAWC,EAASC,EACpB1/D,EACAkN,EALA2tD,EAAO,EAMX,MAAM8E,EAAO,IAAI5+D,WAAW,GAC5B,IAAIm7D,EAEAz0D,EAEJ,MAAMm4D,EACJ,IAAI7+D,WAAW,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,KAGjF,GAAI29D,GAAkBxT,KAAUA,EAAK3pD,SAC/B2pD,EAAKz3C,OAA2B,IAAlBy3C,EAAKuG,SACvB,OAAOwL,GAGT/5B,EAAQgoB,EAAKhoB,MACTA,EAAMnT,OAASutC,KAAQp6B,EAAMnT,KAAOwtC,IAIxCgC,EAAMrU,EAAK+F,SACX1vD,EAAS2pD,EAAK3pD,OACdiiB,EAAO0nC,EAAK6F,UACZj7B,EAAOo1B,EAAKwG,QACZj+C,EAAQy3C,EAAKz3C,MACb6/C,EAAOpI,EAAKuG,SACZ+I,EAAOt3B,EAAMs3B,KACbrlD,EAAO+tB,EAAM/tB,KAGb+kD,EAAM5G,EACN6G,EAAO32C,EACPtW,EAAM4vD,GAEN+C,EACA,OACE,OAAQ38B,EAAMnT,MACZ,KAAKqtC,GACH,GAAmB,IAAfl6B,EAAMyuB,KAAY,CACpBzuB,EAAMnT,KAAOwtC,GACb,KACF,CAEA,KAAOpoD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb+tB,EAAMyuB,MAAsB,QAAT6I,EAAiB,CACnB,IAAhBt3B,EAAMg7B,QACRh7B,EAAMg7B,MAAQ,IAEhBh7B,EAAM+6B,MAAQ,EAEd0B,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBt3B,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAO0B,EAAM,EAAG,GAI5CnF,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KApaC,MAqaP,KACF,CAIA,GAHImT,EAAMutB,OACRvtB,EAAMutB,KAAKvY,MAAO,KAED,EAAbhV,EAAMyuB,UACA,IAAP6I,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDtP,EAAKx3C,IAAM,yBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA,IAAY,GAAPpD,KAA4BxL,GAAY,CAC3C9D,EAAKx3C,IAAM,6BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CASA,GAPApD,KAAU,EACVrlD,GAAQ,EAERnV,EAAiC,GAAnB,GAAPw6D,GACa,IAAhBt3B,EAAMg7B,QACRh7B,EAAMg7B,MAAQl+D,GAEZA,EAAM,IAAMA,EAAMkjC,EAAMg7B,MAAO,CACjChT,EAAKx3C,IAAM,sBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAIA16B,EAAMk3B,KAAO,GAAKl3B,EAAMg7B,MAGxBh7B,EAAM86B,MAAQ,EAEd9S,EAAK0B,MAAQ1pB,EAAM+6B,MAAQ,EAC3B/6B,EAAMnT,KAAc,IAAPyqC,EAncH,MAmc2B8C,GAErC9C,EAAO,EACPrlD,EAAO,EAEP,MACF,KAjdW,MAmdT,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAGA,GADA+tB,EAAM86B,MAAQxD,GACK,IAAdt3B,EAAM86B,SAAkBhP,GAAY,CACvC9D,EAAKx3C,IAAM,6BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA,GAAkB,MAAd16B,EAAM86B,MAAgB,CACxB9S,EAAKx3C,IAAM,2BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACI16B,EAAMutB,OACRvtB,EAAMutB,KAAK2F,KAASoE,GAAQ,EAAK,GAEhB,IAAdt3B,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OAEnCgO,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBt3B,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAO0B,EAAM,EAAG,IAI9CnF,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KAlfE,MAofV,KApfU,MAsfR,KAAO5a,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEI+tB,EAAMutB,OACRvtB,EAAMutB,KAAK8F,KAAOiE,GAED,IAAdt3B,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OAEnCgO,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBmF,EAAK,GAAMnF,IAAS,GAAM,IAC1BmF,EAAK,GAAMnF,IAAS,GAAM,IAC1Bt3B,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAO0B,EAAM,EAAG,IAI9CnF,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KA5gBA,MA8gBR,KA9gBQ,MAghBN,KAAO5a,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEI+tB,EAAMutB,OACRvtB,EAAMutB,KAAKqP,OAAiB,IAAPtF,EACrBt3B,EAAMutB,KAAK+F,GAAMgE,GAAQ,GAER,IAAdt3B,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OAEnCgO,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBt3B,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAO0B,EAAM,EAAG,IAI9CnF,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KAriBG,MAuiBX,KAviBW,MAwiBT,GAAkB,KAAdmT,EAAM86B,MAAgB,CAExB,KAAO7oD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA+tB,EAAM5iC,OAASk6D,EACXt3B,EAAMutB,OACRvtB,EAAMutB,KAAKsP,UAAYvF,GAEN,IAAdt3B,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OAEnCgO,EAAK,GAAY,IAAPnF,EACVmF,EAAK,GAAMnF,IAAS,EAAK,IACzBt3B,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAO0B,EAAM,EAAG,IAI9CnF,EAAO,EACPrlD,EAAO,CAET,MACS+tB,EAAMutB,OACbvtB,EAAMutB,KAAKzH,MAAQ,MAErB9lB,EAAMnT,KAnkBG,MAqkBX,KArkBW,MAskBT,GAAkB,KAAdmT,EAAM86B,QACR54D,EAAO89B,EAAM5iC,OACT8E,EAAOkuD,IAAQluD,EAAOkuD,GACtBluD,IACE89B,EAAMutB,OACRzwD,EAAMkjC,EAAMutB,KAAKsP,UAAY78B,EAAM5iC,OAC9B4iC,EAAMutB,KAAKzH,QAEd9lB,EAAMutB,KAAKzH,MAAQ,IAAIjoD,WAAWmiC,EAAMutB,KAAKsP,YAE/C78B,EAAMutB,KAAKzH,MAAMj9C,IACf0H,EAAMtF,SACJ2nB,EAGAA,EAAO1wB,GAGTpF,IAMe,IAAdkjC,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OACnCzuB,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAOxqD,EAAOrO,EAAM0wB,IAElDw9B,GAAQluD,EACR0wB,GAAQ1wB,EACR89B,EAAM5iC,QAAU8E,GAEd89B,EAAM5iC,QAAU,MAAMu/D,EAE5B38B,EAAM5iC,OAAS,EACf4iC,EAAMnT,KAvmBE,MAymBV,KAzmBU,MA0mBR,GAAkB,KAAdmT,EAAM86B,MAAgB,CACxB,GAAa,IAAT1K,EAAc,MAAMuM,EACxBz6D,EAAO,EACP,GAEEpF,EAAMyT,EAAMqiB,EAAO1wB,KAEf89B,EAAMutB,MAAQzwD,GACbkjC,EAAM5iC,OAAS,QAClB4iC,EAAMutB,KAAKz9C,MAAQ7K,OAAOoC,aAAavK,UAElCA,GAAOoF,EAAOkuD,GAOvB,GALmB,IAAdpwB,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OACnCzuB,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAOxqD,EAAOrO,EAAM0wB,IAElDw9B,GAAQluD,EACR0wB,GAAQ1wB,EACJpF,EAAO,MAAM6/D,CACnB,MACS38B,EAAMutB,OACbvtB,EAAMutB,KAAKz9C,KAAO,MAEpBkwB,EAAM5iC,OAAS,EACf4iC,EAAMnT,KAjoBK,MAmoBb,KAnoBa,MAooBX,GAAkB,KAAdmT,EAAM86B,MAAgB,CACxB,GAAa,IAAT1K,EAAc,MAAMuM,EACxBz6D,EAAO,EACP,GACEpF,EAAMyT,EAAMqiB,EAAO1wB,KAEf89B,EAAMutB,MAAQzwD,GACbkjC,EAAM5iC,OAAS,QAClB4iC,EAAMutB,KAAK6F,SAAWnuD,OAAOoC,aAAavK,UAErCA,GAAOoF,EAAOkuD,GAMvB,GALmB,IAAdpwB,EAAM86B,OAAiC,EAAb96B,EAAMyuB,OACnCzuB,EAAM+6B,MAAQjR,GAAQ9pB,EAAM+6B,MAAOxqD,EAAOrO,EAAM0wB,IAElDw9B,GAAQluD,EACR0wB,GAAQ1wB,EACJpF,EAAO,MAAM6/D,CACnB,MACS38B,EAAMutB,OACbvtB,EAAMutB,KAAK6F,QAAU,MAEvBpzB,EAAMnT,KAxpBE,MA0pBV,KA1pBU,MA2pBR,GAAkB,IAAdmT,EAAM86B,MAAgB,CAExB,KAAO7oD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb+tB,EAAMyuB,MAAa6I,KAAwB,MAAdt3B,EAAM+6B,OAAiB,CACvD/S,EAAKx3C,IAAM,sBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAEApD,EAAO,EACPrlD,EAAO,CAET,CACI+tB,EAAMutB,OACRvtB,EAAMutB,KAAK4F,KAASnzB,EAAM86B,OAAS,EAAK,EACxC96B,EAAMutB,KAAKvY,MAAO,GAEpBgT,EAAK0B,MAAQ1pB,EAAM+6B,MAAQ,EAC3B/6B,EAAMnT,KAAOutC,GACb,MACF,KAprBY,MAsrBV,KAAOnoD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA+1C,EAAK0B,MAAQ1pB,EAAM+6B,MAAQJ,GAAQrD,GAEnCA,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KAAOstC,GAEf,KAAKA,GACH,GAAuB,IAAnBn6B,EAAM66B,SASR,OAPA7S,EAAK+F,SAAWsO,EAChBrU,EAAK6F,UAAYvtC,EACjB0nC,EAAKwG,QAAU57B,EACfo1B,EAAKuG,SAAW6B,EAChBpwB,EAAMs3B,KAAOA,EACbt3B,EAAM/tB,KAAOA,EAEN6nD,GAET9R,EAAK0B,MAAQ1pB,EAAM+6B,MAAQ,EAC3B/6B,EAAMnT,KAAOutC,GAEf,KAAKA,GACH,GAAIjK,IAAU3F,IAAW2F,IAAU1F,GAAW,MAAMkS,EAEtD,KAAKtC,GACH,GAAIr6B,EAAM5zB,KAAM,CAEdkrD,KAAiB,EAAPrlD,EACVA,GAAe,EAAPA,EAER+tB,EAAMnT,KAAO4tC,GACb,KACF,CAEA,KAAOxoD,EAAO,GAAG,CACf,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAQA,OANA+tB,EAAM5zB,KAAe,EAAPkrD,EAEdA,KAAU,EACVrlD,GAAQ,EAGQ,EAAPqlD,GACP,KAAK,EAGHt3B,EAAMnT,KA7uBI,MA8uBV,MACF,KAAK,EAKH,GAJAovC,GAAYj8B,GAGZA,EAAMnT,KAAO0tC,GACTpK,IAAU1F,GAAS,CAErB6M,KAAU,EACVrlD,GAAQ,EAER,MAAM0qD,CACR,CACA,MACF,KAAK,EAGH38B,EAAMnT,KA5vBG,MA6vBT,MACF,KAAK,EACHm7B,EAAKx3C,IAAM,qBACXwvB,EAAMnT,KAAO6tC,GAGjBpD,KAAU,EACVrlD,GAAQ,EAER,MACF,KA1wBgB,MAgxBd,IAJAqlD,KAAiB,EAAPrlD,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA,IAAY,MAAPqlD,KAAqBA,IAAS,GAAM,OAAS,CAChDtP,EAAKx3C,IAAM,+BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CASA,GARA16B,EAAM5iC,OAAgB,MAAPk6D,EAIfA,EAAO,EACPrlD,EAAO,EAEP+tB,EAAMnT,KAAOytC,GACTnK,IAAU1F,GAAW,MAAMkS,EAEjC,KAAKrC,GACHt6B,EAAMnT,KAryBM,MAuyBd,KAvyBc,MAyyBZ,GADA3qB,EAAO89B,EAAM5iC,OACT8E,EAAM,CAGR,GAFIA,EAAOkuD,IAAQluD,EAAOkuD,GACtBluD,EAAOoe,IAAQpe,EAAOoe,GACb,IAATpe,EAAc,MAAMy6D,EAExBt+D,EAAOwK,IAAI0H,EAAMtF,SAAS2nB,EAAMA,EAAO1wB,GAAOm6D,GAE9CjM,GAAQluD,EACR0wB,GAAQ1wB,EACRoe,GAAQpe,EACRm6D,GAAOn6D,EACP89B,EAAM5iC,QAAU8E,EAChB,KACF,CAEA89B,EAAMnT,KAAOutC,GACb,MACF,KAzzBe,MA2zBb,KAAOnoD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAkBA,GAhBA+tB,EAAMk7B,KAAkC,KAAnB,GAAP5D,GAEdA,KAAU,EACVrlD,GAAQ,EAER+tB,EAAMm7B,MAAmC,GAAnB,GAAP7D,GAEfA,KAAU,EACVrlD,GAAQ,EAER+tB,EAAMi7B,MAAmC,GAAnB,GAAP3D,GAEfA,KAAU,EACVrlD,GAAQ,EAGJ+tB,EAAMk7B,KAAO,KAAOl7B,EAAMm7B,MAAQ,GAAI,CACxCnT,EAAKx3C,IAAM,sCACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAGA16B,EAAMowB,KAAO,EACbpwB,EAAMnT,KAz1BS,MA21BjB,KA31BiB,MA41Bf,KAAOmT,EAAMowB,KAAOpwB,EAAMi7B,OAAO,CAE/B,KAAOhpD,EAAO,GAAG,CACf,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA+tB,EAAM9jC,KAAKwgE,EAAM18B,EAAMowB,SAAmB,EAAPkH,EAEnCA,KAAU,EACVrlD,GAAQ,CAEV,CACA,KAAO+tB,EAAMowB,KAAO,IAClBpwB,EAAM9jC,KAAKwgE,EAAM18B,EAAMowB,SAAW,EAapC,GAPApwB,EAAM63B,QAAU73B,EAAMo7B,OACtBp7B,EAAM+3B,QAAU,EAEhBiB,EAAO,CAAE/mD,KAAM+tB,EAAM+3B,SACrB/tD,EAAM0uD,GAz5BA,EAy5BgB14B,EAAM9jC,KAAM,EAAG,GAAI8jC,EAAM63B,QAAS,EAAG73B,EAAM+4B,KAAMC,GACvEh5B,EAAM+3B,QAAUiB,EAAK/mD,KAEjBjI,EAAK,CACPg+C,EAAKx3C,IAAM,2BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAEA16B,EAAMowB,KAAO,EACbpwB,EAAMnT,KA/3BU,MAi4BlB,KAj4BkB,MAk4BhB,KAAOmT,EAAMowB,KAAOpwB,EAAMk7B,KAAOl7B,EAAMm7B,OAAO,CAC5C,KACExD,EAAO33B,EAAM63B,QAAQP,GAAS,GAAKt3B,EAAM+3B,SAAW,GACpDyB,EAAY7B,IAAS,GACrB8B,EAAW9B,IAAS,GAAM,IAC1B+B,EAAkB,MAAP/B,IAEN6B,GAAcvnD,IANZ,CAQP,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CAEV,CACA,GAAIynD,EAAW,GAEbpC,KAAUkC,EACVvnD,GAAQunD,EAERx5B,EAAM9jC,KAAK8jC,EAAMowB,QAAUsJ,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADAn1D,EAAIi1D,EAAY,EACTvnD,EAAO1N,GAAG,CACf,GAAa,IAAT6rD,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAMA,GAHAqlD,KAAUkC,EACVvnD,GAAQunD,EAEW,IAAfx5B,EAAMowB,KAAY,CACpBpI,EAAKx3C,IAAM,4BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA59D,EAAMkjC,EAAM9jC,KAAK8jC,EAAMowB,KAAO,GAC9BluD,EAAO,GAAY,EAAPo1D,GAEZA,KAAU,EACVrlD,GAAQ,CAEV,MACK,GAAiB,KAAbynD,EAAiB,CAGxB,IADAn1D,EAAIi1D,EAAY,EACTvnD,EAAO1N,GAAG,CACf,GAAa,IAAT6rD,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAGAqlD,KAAUkC,EACVvnD,GAAQunD,EAER18D,EAAM,EACNoF,EAAO,GAAY,EAAPo1D,GAEZA,KAAU,EACVrlD,GAAQ,CAEV,KACK,CAGH,IADA1N,EAAIi1D,EAAY,EACTvnD,EAAO1N,GAAG,CACf,GAAa,IAAT6rD,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAGAqlD,KAAUkC,EACVvnD,GAAQunD,EAER18D,EAAM,EACNoF,EAAO,IAAa,IAAPo1D,GAEbA,KAAU,EACVrlD,GAAQ,CAEV,CACA,GAAI+tB,EAAMowB,KAAOluD,EAAO89B,EAAMk7B,KAAOl7B,EAAMm7B,MAAO,CAChDnT,EAAKx3C,IAAM,4BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA,KAAOx4D,KACL89B,EAAM9jC,KAAK8jC,EAAMowB,QAAUtzD,CAE/B,CACF,CAGA,GAAIkjC,EAAMnT,OAAS6tC,GAAO,MAG1B,GAAwB,IAApB16B,EAAM9jC,KAAK,KAAY,CACzB8rD,EAAKx3C,IAAM,uCACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAcA,GATA16B,EAAM+3B,QAAU,EAEhBiB,EAAO,CAAE/mD,KAAM+tB,EAAM+3B,SACrB/tD,EAAM0uD,GA3hCD,EA2hCgB14B,EAAM9jC,KAAM,EAAG8jC,EAAMk7B,KAAMl7B,EAAM63B,QAAS,EAAG73B,EAAM+4B,KAAMC,GAG9Eh5B,EAAM+3B,QAAUiB,EAAK/mD,KAGjBjI,EAAK,CACPg+C,EAAKx3C,IAAM,8BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAaA,GAXA16B,EAAMg4B,SAAW,EAGjBh4B,EAAM83B,SAAW93B,EAAMq7B,QACvBrC,EAAO,CAAE/mD,KAAM+tB,EAAMg4B,UACrBhuD,EAAM0uD,GA3iCA,EA2iCgB14B,EAAM9jC,KAAM8jC,EAAMk7B,KAAMl7B,EAAMm7B,MAAOn7B,EAAM83B,SAAU,EAAG93B,EAAM+4B,KAAMC,GAG1Fh5B,EAAMg4B,SAAWgB,EAAK/mD,KAGlBjI,EAAK,CACPg+C,EAAKx3C,IAAM,wBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAGA,GADA16B,EAAMnT,KAAO0tC,GACTpK,IAAU1F,GAAW,MAAMkS,EAEjC,KAAKpC,GACHv6B,EAAMnT,KAAO2tC,GAEf,KAAKA,GACH,GAAIpK,GAAQ,GAAK9vC,GAAQ,IAAK,CAE5B0nC,EAAK+F,SAAWsO,EAChBrU,EAAK6F,UAAYvtC,EACjB0nC,EAAKwG,QAAU57B,EACfo1B,EAAKuG,SAAW6B,EAChBpwB,EAAMs3B,KAAOA,EACbt3B,EAAM/tB,KAAOA,EAEb8kD,GAAQ/O,EAAMiP,GAEdoF,EAAMrU,EAAK+F,SACX1vD,EAAS2pD,EAAK3pD,OACdiiB,EAAO0nC,EAAK6F,UACZj7B,EAAOo1B,EAAKwG,QACZj+C,EAAQy3C,EAAKz3C,MACb6/C,EAAOpI,EAAKuG,SACZ+I,EAAOt3B,EAAMs3B,KACbrlD,EAAO+tB,EAAM/tB,KAGT+tB,EAAMnT,OAASutC,KACjBp6B,EAAMs7B,MAAQ,GAEhB,KACF,CAEA,IADAt7B,EAAMs7B,KAAO,EAEX3D,EAAO33B,EAAM63B,QAAQP,GAAS,GAAKt3B,EAAM+3B,SAAW,GACpDyB,EAAY7B,IAAS,GACrB8B,EAAW9B,IAAS,GAAM,IAC1B+B,EAAkB,MAAP/B,IAEP6B,GAAavnD,IANV,CAQP,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CAEV,CACA,GAAIwnD,GAAgC,IAAV,IAAVA,GAAuB,CAIrC,IAHA6C,EAAY9C,EACZ+C,EAAU9C,EACV+C,EAAW9C,EAET/B,EAAO33B,EAAM63B,QAAQ2E,IACXlF,GAAS,GAAMgF,EAAYC,GAAY,IAAoCD,IACrF9C,EAAY7B,IAAS,GACrB8B,EAAW9B,IAAS,GAAM,IAC1B+B,EAAkB,MAAP/B,IAEN2E,EAAY9C,GAAcvnD,IAPxB,CASP,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CAEV,CAEAqlD,KAAUgF,EACVrqD,GAAQqqD,EAERt8B,EAAMs7B,MAAQgB,CAChB,CAOA,GALAhF,KAAUkC,EACVvnD,GAAQunD,EAERx5B,EAAMs7B,MAAQ9B,EACdx5B,EAAM5iC,OAASs8D,EACC,IAAZD,EAAe,CAIjBz5B,EAAMnT,KAjmCO,MAkmCb,KACF,CACA,GAAc,GAAV4sC,EAAc,CAEhBz5B,EAAMs7B,MAAQ,EACdt7B,EAAMnT,KAAOutC,GACb,KACF,CACA,GAAc,GAAVX,EAAc,CAChBzR,EAAKx3C,IAAM,8BACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA16B,EAAM8lB,MAAkB,GAAV2T,EACdz5B,EAAMnT,KApnCY,MAsnCpB,KAtnCoB,MAunClB,GAAImT,EAAM8lB,MAAO,CAGf,IADAvhD,EAAIy7B,EAAM8lB,MACH7zC,EAAO1N,GAAG,CACf,GAAa,IAAT6rD,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA+tB,EAAM5iC,QAAUk6D,GAAS,GAAKt3B,EAAM8lB,OAAS,EAE7CwR,KAAUt3B,EAAM8lB,MAChB7zC,GAAQ+tB,EAAM8lB,MAEd9lB,EAAMs7B,MAAQt7B,EAAM8lB,KACtB,CAEA9lB,EAAMu7B,IAAMv7B,EAAM5iC,OAClB4iC,EAAMnT,KAzoCU,MA2oClB,KA3oCkB,MA4oChB,KACE8qC,EAAO33B,EAAM83B,SAASR,GAAS,GAAKt3B,EAAMg4B,UAAY,GACtDwB,EAAY7B,IAAS,GACrB8B,EAAW9B,IAAS,GAAM,IAC1B+B,EAAkB,MAAP/B,IAEN6B,GAAcvnD,IANZ,CAQP,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CAEV,CACA,GAAyB,IAAV,IAAVwnD,GAAuB,CAI1B,IAHA6C,EAAY9C,EACZ+C,EAAU9C,EACV+C,EAAW9C,EAET/B,EAAO33B,EAAM83B,SAAS0E,IACZlF,GAAS,GAAMgF,EAAYC,GAAY,IAAoCD,IACrF9C,EAAY7B,IAAS,GACrB8B,EAAW9B,IAAS,GAAM,IAC1B+B,EAAkB,MAAP/B,IAEN2E,EAAY9C,GAAcvnD,IAPxB,CASP,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CAEV,CAEAqlD,KAAUgF,EACVrqD,GAAQqqD,EAERt8B,EAAMs7B,MAAQgB,CAChB,CAMA,GAJAhF,KAAUkC,EACVvnD,GAAQunD,EAERx5B,EAAMs7B,MAAQ9B,EACA,GAAVC,EAAc,CAChBzR,EAAKx3C,IAAM,wBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CACA16B,EAAMxhC,OAASk7D,EACf15B,EAAM8lB,MAAoB,GAAX2T,EACfz5B,EAAMnT,KA9rCa,MAgsCrB,KAhsCqB,MAisCnB,GAAImT,EAAM8lB,MAAO,CAGf,IADAvhD,EAAIy7B,EAAM8lB,MACH7zC,EAAO1N,GAAG,CACf,GAAa,IAAT6rD,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA+tB,EAAMxhC,QAAU84D,GAAS,GAAKt3B,EAAM8lB,OAAS,EAE7CwR,KAAUt3B,EAAM8lB,MAChB7zC,GAAQ+tB,EAAM8lB,MAEd9lB,EAAMs7B,MAAQt7B,EAAM8lB,KACtB,CAEA,GAAI9lB,EAAMxhC,OAASwhC,EAAMk3B,KAAM,CAC7BlP,EAAKx3C,IAAM,gCACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAGA16B,EAAMnT,KAztCW,MA2tCnB,KA3tCmB,MA4tCjB,GAAa,IAATvM,EAAc,MAAMq8C,EAExB,GADAz6D,EAAO+0D,EAAO32C,EACV0f,EAAMxhC,OAAS0D,EAAM,CAEvB,GADAA,EAAO89B,EAAMxhC,OAAS0D,EAClBA,EAAO89B,EAAMm3B,OACXn3B,EAAMo4B,KAAM,CACdpQ,EAAKx3C,IAAM,gCACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAiBEx4D,EAAO89B,EAAMo3B,OACfl1D,GAAQ89B,EAAMo3B,MACd/1D,EAAO2+B,EAAMotB,MAAQlrD,GAGrBb,EAAO2+B,EAAMo3B,MAAQl1D,EAEnBA,EAAO89B,EAAM5iC,SAAU8E,EAAO89B,EAAM5iC,QACxCw6D,EAAc53B,EAAMlgB,MACtB,MAEE83C,EAAcv5D,EACdgD,EAAOg7D,EAAMr8B,EAAMxhC,OACnB0D,EAAO89B,EAAM5iC,OAEX8E,EAAOoe,IAAQpe,EAAOoe,GAC1BA,GAAQpe,EACR89B,EAAM5iC,QAAU8E,EAChB,GACE7D,EAAOg+D,KAASzE,EAAYv2D,aACnBa,GACU,IAAjB89B,EAAM5iC,SAAgB4iC,EAAMnT,KAAO2tC,IACvC,MACF,KA5wCiB,MA6wCf,GAAa,IAATl6C,EAAc,MAAMq8C,EACxBt+D,EAAOg+D,KAASr8B,EAAM5iC,OACtBkjB,IACA0f,EAAMnT,KAAO2tC,GACb,MACF,KAAKC,GACH,GAAIz6B,EAAMyuB,KAAM,CAEd,KAAOx8C,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IAEAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAaA,GAXAglD,GAAQ32C,EACR0nC,EAAKgG,WAAaiJ,EAClBj3B,EAAM5e,OAAS61C,EACG,EAAbj3B,EAAMyuB,MAAawI,IACtBjP,EAAK0B,MAAQ1pB,EAAM+6B,MAEd/6B,EAAM86B,MAAQhR,GAAQ9pB,EAAM+6B,MAAO18D,EAAQ44D,EAAMoF,EAAMpF,GAAQzN,GAAUxpB,EAAM+6B,MAAO18D,EAAQ44D,EAAMoF,EAAMpF,IAGjHA,EAAO32C,EAEW,EAAb0f,EAAMyuB,OAAczuB,EAAM86B,MAAQxD,EAAOqD,GAAQrD,MAAWt3B,EAAM+6B,MAAO,CAC5E/S,EAAKx3C,IAAM,uBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAEApD,EAAO,EACPrlD,EAAO,CAGT,CACA+tB,EAAMnT,KAjzCI,MAmzCZ,KAnzCY,MAozCV,GAAImT,EAAMyuB,MAAQzuB,EAAM86B,MAAO,CAE7B,KAAO7oD,EAAO,IAAI,CAChB,GAAa,IAATm+C,EAAc,MAAMuM,EACxBvM,IACAkH,GAAQ/mD,EAAMqiB,MAAW3gB,EACzBA,GAAQ,CACV,CAEA,GAAkB,EAAb+tB,EAAMyuB,MAAa6I,KAAwB,WAAdt3B,EAAM5e,OAAqB,CAC3D4mC,EAAKx3C,IAAM,yBACXwvB,EAAMnT,KAAO6tC,GACb,KACF,CAEApD,EAAO,EACPrlD,EAAO,CAGT,CACA+tB,EAAMnT,KAv0CE,MAy0CV,KAz0CU,MA00CR7iB,EAAM6vD,GACN,MAAM8C,EACR,KAAKjC,GACH1wD,EAAMgwD,GACN,MAAM2C,EACR,KA70CS,MA80CP,OAAO1C,GAGT,QACE,OAAOF,GAyCb,OA3BA/R,EAAK+F,SAAWsO,EAChBrU,EAAK6F,UAAYvtC,EACjB0nC,EAAKwG,QAAU57B,EACfo1B,EAAKuG,SAAW6B,EAChBpwB,EAAMs3B,KAAOA,EACbt3B,EAAM/tB,KAAOA,GAGT+tB,EAAMotB,OAAU6J,IAASjP,EAAK6F,WAAa7tB,EAAMnT,KAAO6tC,KACvC16B,EAAMnT,KAAO4tC,IAAStK,IAAUwJ,MAC/CuC,GAAalU,EAAMA,EAAK3pD,OAAQ2pD,EAAK+F,SAAUkJ,EAAOjP,EAAK6F,WAEjEmJ,GAAOhP,EAAKuG,SACZ0I,GAAQjP,EAAK6F,UACb7F,EAAK0G,UAAYsI,EACjBhP,EAAKgG,WAAaiJ,EAClBj3B,EAAM5e,OAAS61C,EACG,EAAbj3B,EAAMyuB,MAAawI,IACtBjP,EAAK0B,MAAQ1pB,EAAM+6B,MAChB/6B,EAAM86B,MAAQhR,GAAQ9pB,EAAM+6B,MAAO18D,EAAQ44D,EAAMjP,EAAK+F,SAAWkJ,GAAQzN,GAAUxpB,EAAM+6B,MAAO18D,EAAQ44D,EAAMjP,EAAK+F,SAAWkJ,IAEnIjP,EAAKC,UAAYjoB,EAAM/tB,MAAQ+tB,EAAM5zB,KAAO,GAAK,IAC9B4zB,EAAMnT,OAASutC,GAAO,IAAM,IAC5Bp6B,EAAMnT,OAAS0tC,IAAQv6B,EAAMnT,OAASytC,GAAQ,IAAM,IACzD,IAARtD,GAAsB,IAATC,GAAe9G,IAAUwJ,KAAe3vD,IAAQ4vD,KACjE5vD,EAAMihD,IAEDjhD,CAAG,EA4ER8yD,GAxEgB9U,IAElB,GAAIwT,GAAkBxT,GACpB,OAAO+R,GAGT,IAAI/5B,EAAQgoB,EAAKhoB,MAKjB,OAJIA,EAAMlgB,SACRkgB,EAAMlgB,OAAS,MAEjBkoC,EAAKhoB,MAAQ,KACN45B,EAAM,EA8DXmD,GA1DqBC,CAAChV,EAAMuF,KAG9B,GAAIiO,GAAkBxT,GAAS,OAAO+R,GACtC,MAAM/5B,EAAQgoB,EAAKhoB,MACnB,OAAyB,IAAP,EAAbA,EAAMyuB,MAA0BsL,IAGrC/5B,EAAMutB,KAAOA,EACbA,EAAKvY,MAAO,EACL4kB,GAAM,EAiDXqD,GA7CyBC,CAAClV,EAAM8L,KAClC,MAAMC,EAAaD,EAAW12D,OAE9B,IAAI4iC,EACAm9B,EACAnzD,EAGJ,OAAIwxD,GAAkBxT,GAAgB+R,IACtC/5B,EAAQgoB,EAAKhoB,MAEM,IAAfA,EAAMyuB,MAAczuB,EAAMnT,OAASstC,GAC9BJ,GAIL/5B,EAAMnT,OAASstC,KACjBgD,EAAS,EAETA,EAAS3T,GAAU2T,EAAQrJ,EAAYC,EAAY,GAC/CoJ,IAAWn9B,EAAM+6B,OACZf,IAKXhwD,EAAMkyD,GAAalU,EAAM8L,EAAYC,EAAYA,GAC7C/pD,GACFg2B,EAAMnT,KAx7CK,MAy7CJotC,KAETj6B,EAAM66B,SAAW,EAEVjB,KAAM,EA2BXwD,GAAc,CACjBzB,aAxBoBA,GAyBpBC,cAxBqBA,GAyBrBH,iBAxBwBA,GAyBxB4B,YAxxCoBrV,GAEZ6T,GAAa7T,EA3LJ,IAk9CjB6T,aAxBoBA,GAyBpByB,QAASnB,GACToB,WAAYT,GACZE,iBAAkBD,GAClBG,qBAAsBD,GACtBO,YAxBiB,sCAkFlB,IAAIC,GApCJ,WAEE15D,KAAKmvD,KAAa,EAElBnvD,KAAKsvD,KAAa,EAElBtvD,KAAK64D,OAAa,EAElB74D,KAAKuvD,GAAa,EAElBvvD,KAAK+hD,MAAa,KAElB/hD,KAAK84D,UAAa,EAWlB94D,KAAK+L,KAAa,GAIlB/L,KAAKqvD,QAAa,GAIlBrvD,KAAKovD,KAAa,EAElBpvD,KAAKixC,MAAa,CACpB,EAIA,MAAMzxC,GAAWzC,OAAOE,UAAUuC,UAK5B4mD,WACJA,GAAUI,SAAEA,GAAQG,KACpBA,GAAIC,aAAEA,GAAYC,YAAEA,GAAWE,eAAEA,GAAcC,aAAEA,GAAYC,YAAEA,IAC7Dd,GAkFJ,SAASwT,GAAU7mC,GACjB9yB,KAAK8yB,QAAUuQ,GAAOzzB,OAAO,CAC3BwiD,UAAW,MACXxD,WAAY,GACZ3R,GAAI,IACHnqB,GAAW,CAAA,GAEd,MAAMu/B,EAAMryD,KAAK8yB,QAIbu/B,EAAIC,KAAQD,EAAIzD,YAAc,GAAOyD,EAAIzD,WAAa,KACxDyD,EAAIzD,YAAcyD,EAAIzD,WACC,IAAnByD,EAAIzD,aAAoByD,EAAIzD,YAAc,OAI3CyD,EAAIzD,YAAc,GAAOyD,EAAIzD,WAAa,KACzC97B,GAAWA,EAAQ87B,aACvByD,EAAIzD,YAAc,IAKfyD,EAAIzD,WAAa,IAAQyD,EAAIzD,WAAa,IAGf,IAAR,GAAjByD,EAAIzD,cACPyD,EAAIzD,YAAc,IAItB5uD,KAAKipD,IAAS,EACdjpD,KAAKyM,IAAS,GACdzM,KAAKwyD,OAAS,EACdxyD,KAAK4wD,OAAS,GAEd5wD,KAAKikD,KAAS,IAAI2N,GAClB5xD,KAAKikD,KAAK6F,UAAY,EAEtB,IAAI8D,EAAUyL,GAAYvB,aACxB93D,KAAKikD,KACLoO,EAAIzD,YAGN,GAAIhB,IAAWjH,GACb,MAAM,IAAI1sD,MAAMisD,GAAS0H,IAQ3B,GALA5tD,KAAKivD,OAAS,IAAIyK,GAElBL,GAAYJ,iBAAiBj5D,KAAKikD,KAAMjkD,KAAKivD,QAGzCoD,EAAItC,aAEwB,iBAAnBsC,EAAItC,WACbsC,EAAItC,WAAakB,GAAQC,WAAWmB,EAAItC,YACG,yBAAlCvwD,GAASqB,KAAKwxD,EAAItC,cAC3BsC,EAAItC,WAAa,IAAIj2D,WAAWu4D,EAAItC,aAElCsC,EAAIC,MACN1E,EAASyL,GAAYF,qBAAqBn5D,KAAKikD,KAAMoO,EAAItC,YACrDnC,IAAWjH,KACb,MAAM,IAAI1sD,MAAMisD,GAAS0H,GAIjC,CAiNA,SAASgM,GAAUptD,EAAOsmB,GACxB,MAAM+mC,EAAW,IAAIF,GAAU7mC,GAK/B,GAHA+mC,EAASngE,KAAK8S,GAGVqtD,EAAS5Q,IAAK,MAAM4Q,EAASptD,KAAOy5C,GAAS2T,EAAS5Q,KAE1D,OAAO4Q,EAAS1lC,MAClB,CA/LAwlC,GAAU18D,UAAUvD,KAAO,SAAUwF,EAAMyzD,GACzC,MAAM1O,EAAOjkD,KAAKikD,KACZmO,EAAYpyD,KAAK8yB,QAAQs/B,UACzBrC,EAAa/vD,KAAK8yB,QAAQi9B,WAChC,IAAInC,EAAQgF,EAAakH,EAEzB,GAAI95D,KAAKwyD,MAAO,OAAO,EAevB,IAbiCI,EAA7BD,MAAiBA,EAA0BA,GACb,IAAfA,EAAsBnM,GAAWJ,GAGxB,yBAAxB5mD,GAASqB,KAAK3B,GAChB+kD,EAAKz3C,MAAQ,IAAI1S,WAAWoF,GAE5B+kD,EAAKz3C,MAAQtN,EAGf+kD,EAAKwG,QAAU,EACfxG,EAAKuG,SAAWvG,EAAKz3C,MAAMnT,SAElB,CAqBP,IApBuB,IAAnB4qD,EAAK6F,YACP7F,EAAK3pD,OAAS,IAAIR,WAAWs4D,GAC7BnO,EAAK+F,SAAW,EAChB/F,EAAK6F,UAAYsI,GAGnBxE,EAASyL,GAAYE,QAAQtV,EAAM2O,GAE/BhF,IAAW/G,IAAekJ,IAC5BnC,EAASyL,GAAYF,qBAAqBlV,EAAM8L,GAE5CnC,IAAWjH,GACbiH,EAASyL,GAAYE,QAAQtV,EAAM2O,GAC1BhF,IAAW5G,KAEpB4G,EAAS/G,KAKN5C,EAAKuG,SAAW,GAChBoD,IAAWhH,IACX3C,EAAKhoB,MAAMyuB,KAAO,GACK,IAAvBxrD,EAAK+kD,EAAKwG,UAEf4O,GAAYzB,aAAa3T,GACzB2J,EAASyL,GAAYE,QAAQtV,EAAM2O,GAGrC,OAAQhF,GACN,KAAK7G,GACL,KAAKC,GACL,KAAKH,GACL,KAAKI,GAGH,OAFAjnD,KAAK8yD,MAAMlF,GACX5tD,KAAKwyD,OAAQ,GACN,EAOX,GAFAsH,EAAiB7V,EAAK6F,UAElB7F,EAAK+F,WACgB,IAAnB/F,EAAK6F,WAAmB8D,IAAWhH,IAErC,GAAwB,WAApB5mD,KAAK8yB,QAAQmqB,GAAiB,CAEhC,IAAI8c,EAAgB9I,GAAQU,WAAW1N,EAAK3pD,OAAQ2pD,EAAK+F,UAErDgQ,EAAO/V,EAAK+F,SAAW+P,EACvBE,EAAUhJ,GAAQM,WAAWtN,EAAK3pD,OAAQy/D,GAG9C9V,EAAK+F,SAAWgQ,EAChB/V,EAAK6F,UAAYsI,EAAY4H,EACzBA,GAAM/V,EAAK3pD,OAAOwK,IAAIm/C,EAAK3pD,OAAO4M,SAAS6yD,EAAeA,EAAgBC,GAAO,GAErFh6D,KAAK6yD,OAAOoH,EAEd,MACEj6D,KAAK6yD,OAAO5O,EAAK3pD,OAAOjB,SAAW4qD,EAAK+F,SAAW/F,EAAK3pD,OAAS2pD,EAAK3pD,OAAO4M,SAAS,EAAG+8C,EAAK+F,WAMpG,GAAI4D,IAAWjH,IAA2B,IAAnBmT,EAAvB,CAGA,GAAIlM,IAAWhH,GAIb,OAHAgH,EAASyL,GAAYG,WAAWx5D,KAAKikD,MACrCjkD,KAAK8yD,MAAMlF,GACX5tD,KAAKwyD,OAAQ,GACN,EAGT,GAAsB,IAAlBvO,EAAKuG,SAAgB,KAVoB,CAW/C,CAEA,OAAO,CACT,EAWAmP,GAAU18D,UAAU41D,OAAS,SAAUhC,GACrC7wD,KAAK4wD,OAAOl3D,KAAKm3D,EACnB,EAYA8I,GAAU18D,UAAU61D,MAAQ,SAAUlF,GAEhCA,IAAWjH,KACW,WAApB3mD,KAAK8yB,QAAQmqB,GACfj9C,KAAKm0B,OAASn0B,KAAK4wD,OAAO/2D,KAAK,IAE/BmG,KAAKm0B,OAASkP,GAAOstB,cAAc3wD,KAAK4wD,SAG5C5wD,KAAK4wD,OAAS,GACd5wD,KAAKipD,IAAM2E,EACX5tD,KAAKyM,IAAMzM,KAAKikD,KAAKx3C,GACvB,EA+EA,IAMIytD,GAAc,CACjBC,QAPiBR,GAQjBJ,QAPeK,GAQfQ,WA1BD,SAAsB5tD,EAAOsmB,GAG3B,OAFAA,EAAUA,GAAW,IACbw/B,KAAM,EACPsH,GAAUptD,EAAOsmB,EAC1B,EAuBCunC,OAPcT,GAQdU,UAPenU,IAYhB,MAAMgU,QAAEA,GAAOZ,QAAEA,GAAOa,WAAEA,GAAUC,OAAEA,IAAWH,GASjD,IAAIK,GAAYhB,gCCzsNhB,IAAIiB,EAAMz9D,OAAOE,UAAUkT,eACvBsqD,EAAS,IASb,SAASC,IAAW,CA4BpB,SAASC,EAAGttD,EAAImnC,EAASomB,GACvB56D,KAAKqN,GAAKA,EACVrN,KAAKw0C,QAAUA,EACfx0C,KAAK46D,KAAOA,IAAQ,CACtB,CAaA,SAASC,EAAYC,EAASC,EAAO1tD,EAAImnC,EAASomB,GAChD,GAAkB,mBAAPvtD,EACT,MAAM,IAAIjQ,UAAU,mCAGtB,IAAI49D,EAAW,IAAIL,EAAGttD,EAAImnC,GAAWsmB,EAASF,GAC1CK,EAAMR,EAASA,EAASM,EAAQA,EAMpC,OAJKD,EAAQI,QAAQD,GACXH,EAAQI,QAAQD,GAAK5tD,GAC1BytD,EAAQI,QAAQD,GAAO,CAACH,EAAQI,QAAQD,GAAMD,GADhBF,EAAQI,QAAQD,GAAKvhE,KAAKshE,IADlCF,EAAQI,QAAQD,GAAOD,EAAUF,EAAQK,gBAI7DL,CACT,CASA,SAASM,EAAWN,EAASG,GACI,KAAzBH,EAAQK,aAAoBL,EAAQI,QAAU,IAAIR,SAC5CI,EAAQI,QAAQD,EAC9B,CASA,SAASI,IACPr7D,KAAKk7D,QAAU,IAAIR,EACnB16D,KAAKm7D,aAAe,CACtB,CAzEIp+D,OAAO4S,SACT+qD,EAAOz9D,UAAYF,OAAO4S,OAAO,OAM5B,IAAI+qD,GAASY,YAAWb,GAAS,IA2ExCY,EAAap+D,UAAUs+D,WAAa,WAClC,IACIC,EACAzvD,EAFA0vD,EAAQ,GAIZ,GAA0B,IAAtBz7D,KAAKm7D,aAAoB,OAAOM,EAEpC,IAAK1vD,KAASyvD,EAASx7D,KAAKk7D,QACtBV,EAAI35D,KAAK26D,EAAQzvD,IAAO0vD,EAAM/hE,KAAK+gE,EAAS1uD,EAAKlO,MAAM,GAAKkO,GAGlE,OAAIhP,OAAO2+D,sBACFD,EAAM92D,OAAO5H,OAAO2+D,sBAAsBF,IAG5CC,GAUTJ,EAAap+D,UAAU0+D,UAAY,SAAmBZ,GACpD,IAAIE,EAAMR,EAASA,EAASM,EAAQA,EAChCa,EAAW57D,KAAKk7D,QAAQD,GAE5B,IAAKW,EAAU,MAAO,GACtB,GAAIA,EAASvuD,GAAI,MAAO,CAACuuD,EAASvuD,IAElC,IAAK,IAAI3U,EAAI,EAAG2nC,EAAIu7B,EAASviE,OAAQwiE,EAAK,IAAI9hE,MAAMsmC,GAAI3nC,EAAI2nC,EAAG3nC,IAC7DmjE,EAAGnjE,GAAKkjE,EAASljE,GAAG2U,GAGtB,OAAOwuD,GAUTR,EAAap+D,UAAU6+D,cAAgB,SAAuBf,GAC5D,IAAIE,EAAMR,EAASA,EAASM,EAAQA,EAChCY,EAAY37D,KAAKk7D,QAAQD,GAE7B,OAAKU,EACDA,EAAUtuD,GAAW,EAClBsuD,EAAUtiE,OAFM,GAYzBgiE,EAAap+D,UAAU8+D,KAAO,SAAchB,EAAOh5C,EAAIG,EAAIG,EAAIG,EAAIG,GACjE,IAAIs4C,EAAMR,EAASA,EAASM,EAAQA,EAEpC,IAAK/6D,KAAKk7D,QAAQD,GAAM,OAAO,EAE/B,IAEIpjC,EACAn/B,EAHAijE,EAAY37D,KAAKk7D,QAAQD,GACzBliE,EAAM2G,UAAUrG,OAIpB,GAAIsiE,EAAUtuD,GAAI,CAGhB,OAFIsuD,EAAUf,MAAM56D,KAAKg8D,eAAejB,EAAOY,EAAUtuD,QAAIvO,GAAW,GAEhE/F,GACN,KAAK,EAAG,OAAO4iE,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,UAAU,EACrD,KAAK,EAAG,OAAOmnB,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,QAASzyB,IAAK,EACzD,KAAK,EAAG,OAAO45C,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,QAASzyB,EAAIG,IAAK,EAC7D,KAAK,EAAG,OAAOy5C,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,QAASzyB,EAAIG,EAAIG,IAAK,EACjE,KAAK,EAAG,OAAOs5C,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,QAASzyB,EAAIG,EAAIG,EAAIG,IAAK,EACrE,KAAK,EAAG,OAAOm5C,EAAUtuD,GAAGxM,KAAK86D,EAAUnnB,QAASzyB,EAAIG,EAAIG,EAAIG,EAAIG,IAAK,EAG3E,IAAKjqB,EAAI,EAAGm/B,EAAO,IAAI99B,MAAMhB,EAAK,GAAIL,EAAIK,EAAKL,IAC7Cm/B,EAAKn/B,EAAI,GAAKgH,UAAUhH,GAG1BijE,EAAUtuD,GAAG9J,MAAMo4D,EAAUnnB,QAAS3c,EAC1C,KAAS,CACL,IACIt2B,EADAlI,EAASsiE,EAAUtiE,OAGvB,IAAKX,EAAI,EAAGA,EAAIW,EAAQX,IAGtB,OAFIijE,EAAUjjE,GAAGkiE,MAAM56D,KAAKg8D,eAAejB,EAAOY,EAAUjjE,GAAG2U,QAAIvO,GAAW,GAEtE/F,GACN,KAAK,EAAG4iE,EAAUjjE,GAAG2U,GAAGxM,KAAK86D,EAAUjjE,GAAG87C,SAAU,MACpD,KAAK,EAAGmnB,EAAUjjE,GAAG2U,GAAGxM,KAAK86D,EAAUjjE,GAAG87C,QAASzyB,GAAK,MACxD,KAAK,EAAG45C,EAAUjjE,GAAG2U,GAAGxM,KAAK86D,EAAUjjE,GAAG87C,QAASzyB,EAAIG,GAAK,MAC5D,KAAK,EAAGy5C,EAAUjjE,GAAG2U,GAAGxM,KAAK86D,EAAUjjE,GAAG87C,QAASzyB,EAAIG,EAAIG,GAAK,MAChE,QACE,IAAKwV,EAAM,IAAKt2B,EAAI,EAAGs2B,EAAO,IAAI99B,MAAMhB,EAAK,GAAIwI,EAAIxI,EAAKwI,IACxDs2B,EAAKt2B,EAAI,GAAK7B,UAAU6B,GAG1Bo6D,EAAUjjE,GAAG2U,GAAG9J,MAAMo4D,EAAUjjE,GAAG87C,QAAS3c,GAGnD,CAED,OAAO,GAYTwjC,EAAap+D,UAAUg/D,GAAK,SAAYlB,EAAO1tD,EAAImnC,GACjD,OAAOqmB,EAAY76D,KAAM+6D,EAAO1tD,EAAImnC,GAAS,IAY/C6mB,EAAap+D,UAAU29D,KAAO,SAAcG,EAAO1tD,EAAImnC,GACrD,OAAOqmB,EAAY76D,KAAM+6D,EAAO1tD,EAAImnC,GAAS,IAa/C6mB,EAAap+D,UAAU++D,eAAiB,SAAwBjB,EAAO1tD,EAAImnC,EAASomB,GAClF,IAAIK,EAAMR,EAASA,EAASM,EAAQA,EAEpC,IAAK/6D,KAAKk7D,QAAQD,GAAM,OAAOj7D,KAC/B,IAAKqN,EAEH,OADA+tD,EAAWp7D,KAAMi7D,GACVj7D,KAGT,IAAI27D,EAAY37D,KAAKk7D,QAAQD,GAE7B,GAAIU,EAAUtuD,GAEVsuD,EAAUtuD,KAAOA,GACfutD,IAAQe,EAAUf,MAClBpmB,GAAWmnB,EAAUnnB,UAAYA,GAEnC4mB,EAAWp7D,KAAMi7D,OAEd,CACL,IAAK,IAAIviE,EAAI,EAAG8iE,EAAS,GAAIniE,EAASsiE,EAAUtiE,OAAQX,EAAIW,EAAQX,KAEhEijE,EAAUjjE,GAAG2U,KAAOA,GACnButD,IAASe,EAAUjjE,GAAGkiE,MACtBpmB,GAAWmnB,EAAUjjE,GAAG87C,UAAYA,IAErCgnB,EAAO9hE,KAAKiiE,EAAUjjE,IAOtB8iE,EAAOniE,OAAQ2G,KAAKk7D,QAAQD,GAAyB,IAAlBO,EAAOniE,OAAemiE,EAAO,GAAKA,EACpEJ,EAAWp7D,KAAMi7D,EACvB,CAED,OAAOj7D,MAUTq7D,EAAap+D,UAAUi/D,mBAAqB,SAA4BnB,GACtE,IAAIE,EAUJ,OARIF,GACFE,EAAMR,EAASA,EAASM,EAAQA,EAC5B/6D,KAAKk7D,QAAQD,IAAMG,EAAWp7D,KAAMi7D,KAExCj7D,KAAKk7D,QAAU,IAAIR,EACnB16D,KAAKm7D,aAAe,GAGfn7D,MAMTq7D,EAAap+D,UAAUggB,IAAMo+C,EAAap+D,UAAU++D,eACpDX,EAAap+D,UAAU49D,YAAcQ,EAAap+D,UAAUg/D,GAK5DZ,EAAac,SAAW1B,EAKxBY,EAAaA,aAAeA,EAM1BvgD,EAAAxe,QAAiB++D,4BCjTZ,MAAMe,GACXC,GAEO,YAAaA,slLAfN,SAAU98D,EAAYD,GACpC,OAAOvF,MAAMwJ,MAAM,EAAG,IAAIxJ,MAAMwB,KAAKwhB,KAAKxd,EAAMlG,OAASiG,KAAQ2wB,KAC/D,CAACohB,EAAGp1B,IAAU1c,EAAM1B,MAAMoe,EAAQ3c,GAAO2c,EAAQ,GAAK3c,IAE1D,u9vECpBA,IAAIixC,EAAavwC,GAAQA,EAAKuwC,WAAc,SAAUC,EAASC,EAAYC,EAAGC,GAE1E,OAAO,IAAKD,IAAMA,EAAIrR,WAAU,SAAUuR,EAASC,GAC/C,SAASC,EAAUr1C,GAAS,IAAMs1C,EAAKJ,EAAU9hB,KAAKpzB,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC3F,SAASm2C,EAASv1C,GAAS,IAAMs1C,EAAKJ,EAAiB,MAAEl1C,GAAU,CAAC,MAAOZ,GAAKg2C,EAAOh2C,GAAO,CAC9F,SAASk2C,EAAK5c,GAAUA,EAAO8c,KAAOL,EAAQzc,EAAO14B,OAJzD,SAAeA,GAAS,OAAOA,aAAiBi1C,EAAIj1C,EAAQ,IAAIi1C,GAAE,SAAUE,GAAWA,EAAQn1C,EAAO,GAAM,CAI1C6gE,CAAMnoC,EAAO14B,OAAOy1C,KAAKJ,EAAWE,EAAY,CAC9GD,GAAMJ,EAAYA,EAAUptC,MAAMitC,EAASC,GAAc,KAAK5hB,OACtE,KAEIsiB,EAAenxC,GAAQA,EAAKmxC,aAAgB,SAAUX,EAASY,GAC/D,IAAsGxM,EAAGlgC,EAAG8a,EAAG2K,EAA3GknB,EAAI,CAAEC,MAAO,EAAGC,KAAM,WAAa,GAAW,EAAP/xB,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAK,EAAEgyB,KAAM,GAAIC,IAAK,IAChG,OAAOtnB,EAAI,CAAE0E,KAAM6iB,EAAK,GAAIC,MAASD,EAAK,GAAIE,OAAUF,EAAK,IAAwB,mBAAXr1C,SAA0B8tB,EAAE9tB,OAAOw1C,UAAY,WAAa,OAAO7xC,IAAO,GAAGmqB,EACvJ,SAASunB,EAAKlxC,GAAK,OAAO,SAAU8R,GAAK,OACzC,SAAcw/B,GACV,GAAIlN,EAAG,MAAM,IAAIxnC,UAAU,mCAC3B,KAAOi0C,OACH,GAAIzM,EAAI,EAAGlgC,IAAM8a,EAAY,EAARsyB,EAAG,GAASptC,EAAU,OAAIotC,EAAG,GAAKptC,EAAS,SAAO8a,EAAI9a,EAAU,SAAM8a,EAAE3e,KAAK6D,GAAI,GAAKA,EAAEmqB,SAAWrP,EAAIA,EAAE3e,KAAK6D,EAAGotC,EAAG,KAAKb,KAAM,OAAOzxB,EAE3J,OADI9a,EAAI,EAAG8a,IAAGsyB,EAAK,CAAS,EAARA,EAAG,GAAQtyB,EAAE/jB,QACzBq2C,EAAG,IACP,KAAK,EAAG,KAAK,EAAGtyB,EAAIsyB,EAAI,MACxB,KAAK,EAAc,OAAXT,EAAEC,QAAgB,CAAE71C,MAAOq2C,EAAG,GAAIb,MAAM,GAChD,KAAK,EAAGI,EAAEC,QAAS5sC,EAAIotC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAKT,EAAEI,IAAIlf,MAAO8e,EAAEG,KAAKjf,MAAO,SACxC,QACI,KAAM/S,EAAI6xB,EAAEG,MAAMhyB,EAAIA,EAAEnmB,OAAS,GAAKmmB,EAAEA,EAAEnmB,OAAS,KAAkB,IAAVy4C,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAET,EAAI,EAAG,QAAW,CAC5G,GAAc,IAAVS,EAAG,MAActyB,GAAMsyB,EAAG,GAAKtyB,EAAE,IAAMsyB,EAAG,GAAKtyB,EAAE,IAAM,CAAE6xB,EAAEC,MAAQQ,EAAG,GAAI,KAAQ,CACtF,GAAc,IAAVA,EAAG,IAAYT,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAIA,EAAIsyB,EAAI,KAAQ,CACrE,GAAItyB,GAAK6xB,EAAEC,MAAQ9xB,EAAE,GAAI,CAAE6xB,EAAEC,MAAQ9xB,EAAE,GAAI6xB,EAAEI,IAAI/3C,KAAKo4C,GAAK,KAAQ,CAC/DtyB,EAAE,IAAI6xB,EAAEI,IAAIlf,MAChB8e,EAAEG,KAAKjf,MAAO,SAEtBuf,EAAKV,EAAKvwC,KAAK2vC,EAASa,EAC3B,CAAC,MAAOx2C,GAAKi3C,EAAK,CAAC,EAAGj3C,GAAI6J,EAAI,CAAE,CAAW,QAAEkgC,EAAIplB,EAAI,CAAI,CAC1D,GAAY,EAARsyB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEr2C,MAAOq2C,EAAG,GAAKA,EAAG,QAAK,EAAQb,MAAM,EAC7E,CAtB+CF,CAAK,CAACvwC,EAAG8R,IAAS,GAwBtEvV,OAAOiH,eAAe4vC,GAAS,aAAc,CAAEn4C,OAAO,IACxBm4C,GAAA2oB,4BAAG,EACjC,IAAIA,EAAwC,WACxC,SAASA,EAAuBC,GAC5Bx8D,KAAKw8D,IAAMA,CACd,CAoBD,OAnBAD,EAAuBt/D,UAAUsT,OAAS,SAAUksD,EAAa59B,GAC7D,OAAO0R,EAAUvwC,UAAM,OAAQ,GAAQ,WACnC,OAAOmxC,EAAYnxC,MAAM,SAAU2/B,GAC/B,MAAM,IAAI1lC,MAAM,kBAChC,GACA,KAEIsiE,EAAuBt/D,UAAUuT,OAAS,SAAUisD,EAAaC,GAC7D,MAAM,IAAIziE,MAAM,oBAEpBsiE,EAAuBt/D,UAAU0/D,gBAAkB,SAAUF,EAAaC,GACtE,MAAM,IAAIziE,MAAM,oBAEpBsiE,EAAuBt/D,UAAUwhC,OAAS,SAAUg+B,EAAaG,GAC7D,MAAM,IAAI3iE,MAAM,oBAEpBsiE,EAAuBt/D,UAAUqC,KAAO,SAAUu9D,GAC9C,OAAO,GAEJN,CACX,CAxB4C,UAyB5C3oB,GAAA2oB,uBAAiCA,eCwDjC,IAAAvvD,GAlHA,SAAewjB,GACb,GAAIA,EAASn3B,QAAU,IAAO,MAAM,IAAI+D,UAAU,qBAElD,IADA,IAAIqzB,EAAW,IAAI32B,WAAW,KACrByH,EAAI,EAAGA,EAAIkvB,EAASp3B,OAAQkI,IACnCkvB,EAASlvB,GAAK,IAEhB,IAAK,IAAI7I,EAAI,EAAGA,EAAI83B,EAASn3B,OAAQX,IAAK,CACxC,IAAI+L,EAAI+rB,EAASE,OAAOh4B,GACpBi4B,EAAKlsB,EAAExL,WAAW,GACtB,GAAqB,MAAjBw3B,EAASE,GAAe,MAAM,IAAIvzB,UAAUqH,EAAI,iBACpDgsB,EAASE,GAAMj4B,CAChB,CACD,IAAIk4B,EAAOJ,EAASn3B,OAChBw3B,EAASL,EAASE,OAAO,GACzBI,EAASv1B,KAAKQ,IAAI60B,GAAQr1B,KAAKQ,IAAI,KACnCg1B,EAAUx1B,KAAKQ,IAAI,KAAOR,KAAKQ,IAAI60B,GA8CvC,SAASI,EAAcC,GACrB,GAAsB,iBAAXA,EAAuB,MAAM,IAAI7zB,UAAU,mBACtD,GAAsB,IAAlB6zB,EAAO53B,OAAgB,OAAO,IAAIS,WAKtC,IAJA,IAAIo3B,EAAM,EAENC,EAAS,EACT93B,EAAS,EACN43B,EAAOC,KAASL,GACrBM,IACAD,IAMF,IAHA,IAAI5xB,GAAU2xB,EAAO53B,OAAS63B,GAAOJ,EAAU,IAAO,EAClDM,EAAO,IAAIt3B,WAAWwF,GAEnB2xB,EAAOC,IAAM,CAElB,IAAI/S,EAAQsS,EAASQ,EAAOh4B,WAAWi4B,IAEvC,GAAc,MAAV/S,EAAiB,OAErB,IADA,IAAIzlB,EAAI,EACC24B,EAAM/xB,EAAO,GAAc,IAAV6e,GAAezlB,EAAIW,KAAqB,IAATg4B,EAAaA,IAAO34B,IAC3EylB,GAAUyS,EAAOQ,EAAKC,KAAU,EAChCD,EAAKC,GAAQlT,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE5B,GAAc,IAAVA,EAAe,MAAM,IAAIlkB,MAAM,kBACnCZ,EAASX,EACTw4B,GACD,CAGD,IADA,IAAII,EAAMhyB,EAAOjG,EACVi4B,IAAQhyB,GAAsB,IAAd8xB,EAAKE,IAC1BA,IAIF,IAFA,IAAIC,EAAM,IAAIz3B,WAAWq3B,GAAU7xB,EAAOgyB,IACtC/vB,EAAI4vB,EACDG,IAAQhyB,GACbiyB,EAAIhwB,KAAO6vB,EAAKE,KAElB,OAAOC,CACR,CAMD,MAAO,CACLhhB,OA7FF,SAAiB0gB,GAOf,GANIA,aAAkBn3B,aACXiE,YAAYC,OAAOizB,GAC5BA,EAAS,IAAIn3B,WAAWm3B,EAAOz2B,OAAQy2B,EAAO5yB,WAAY4yB,EAAOvzB,YACxD3D,MAAMkF,QAAQgyB,KACvBA,EAASn3B,WAAWwD,KAAK2zB,OAErBA,aAAkBn3B,YAAe,MAAM,IAAIsD,UAAU,uBAC3D,GAAsB,IAAlB6zB,EAAO53B,OAAgB,MAAO,GAMlC,IAJA,IAAI83B,EAAS,EACT93B,EAAS,EACTm4B,EAAS,EACTC,EAAOR,EAAO53B,OACXm4B,IAAWC,GAA2B,IAAnBR,EAAOO,IAC/BA,IACAL,IAMF,IAHA,IAAI7xB,GAASmyB,EAAOD,GAAUT,EAAU,IAAO,EAC3CW,EAAM,IAAI53B,WAAWwF,GAElBkyB,IAAWC,GAAM,CAItB,IAHA,IAAItT,EAAQ8S,EAAOO,GAEf94B,EAAI,EACCi5B,EAAMryB,EAAO,GAAc,IAAV6e,GAAezlB,EAAIW,KAAqB,IAATs4B,EAAaA,IAAOj5B,IAC3EylB,GAAU,IAAMuT,EAAIC,KAAU,EAC9BD,EAAIC,GAAQxT,EAAQyS,IAAU,EAC9BzS,EAASA,EAAQyS,IAAU,EAE7B,GAAc,IAAVzS,EAAe,MAAM,IAAIlkB,MAAM,kBACnCZ,EAASX,EACT84B,GACD,CAGD,IADA,IAAII,EAAMtyB,EAAOjG,EACVu4B,IAAQtyB,GAAqB,IAAboyB,EAAIE,IACzBA,IAIF,IADA,IAAI1vB,EAAM2uB,EAAOgB,OAAOV,GACjBS,EAAMtyB,IAAQsyB,EAAO1vB,GAAOsuB,EAASE,OAAOgB,EAAIE,IACvD,OAAO1vB,CACR,EAkDC8uB,aAAcA,EACdxgB,OARF,SAAiBjT,GACf,IAAI/C,EAASw2B,EAAazzB,GAC1B,GAAI/C,EAAU,OAAOA,EACrB,MAAM,IAAIP,MAAM,WAAa22B,EAAO,aACrC,EAMH,YCpHAkB,GAHc51B,GACG,gHCGjB,IAAIw4B,EAAmB10B,GAAQA,EAAK00B,kBAAqB33B,OAAO4S,OAAU,SAASgS,EAAG7mB,EAAGsjB,EAAGuW,QAC7E71B,IAAP61B,IAAkBA,EAAKvW,GAC3BrhB,OAAOiH,eAAe2d,EAAGgT,EAAI,CAAE1wB,YAAY,EAAMC,IAAK,WAAa,OAAOpJ,EAAEsjB,EAAG,GAClF,EAAK,SAASuD,EAAG7mB,EAAGsjB,EAAGuW,QACT71B,IAAP61B,IAAkBA,EAAKvW,GAC3BuD,EAAEgT,GAAM75B,EAAEsjB,EACd,GACIwW,EAAsB50B,GAAQA,EAAK40B,qBAAwB73B,OAAO4S,OAAU,SAASgS,EAAGrP,GACxFvV,OAAOiH,eAAe2d,EAAG,UAAW,CAAE1d,YAAY,EAAMxI,MAAO6W,GACnE,EAAK,SAASqP,EAAGrP,GACbqP,EAAW,QAAIrP,CACnB,GACI6iB,EAAgBn1B,GAAQA,EAAKm1B,cAAiB,SAAU7X,GACxD,GAAIA,GAAOA,EAAI8X,WAAY,OAAO9X,EAClC,IAAI6W,EAAS,CAAA,EACb,GAAW,MAAP7W,EAAa,IAAK,IAAIc,KAAKd,EAAe,YAANc,GAAmBrhB,OAAOE,UAAUkT,eAAetP,KAAKyc,EAAKc,IAAIsW,EAAgBP,EAAQ7W,EAAKc,GAEtI,OADAwW,EAAmBT,EAAQ7W,GACpB6W,GAEP2oC,EAAiB98D,GAAQA,EAAK88D,eAAkB,SAAU7f,EAAI3/C,GAC9D,IAAK,IAAI5E,EAAI,EAAGqkE,EAAKz/D,EAAKjE,OAAQkI,EAAI07C,EAAG5jD,OAAQX,EAAIqkE,EAAIrkE,IAAK6I,IAC1D07C,EAAG17C,GAAKjE,EAAK5E,GACjB,OAAOukD,GAEP5nB,EAAmBr1B,GAAQA,EAAKq1B,iBAAoB,SAAU/X,GAC9D,OAAQA,GAAOA,EAAI8X,WAAc9X,EAAM,CAAEgY,QAAWhY,IAExDvgB,OAAOiH,eAAeg5D,GAAS,aAAc,CAAEvhE,OAAO,IACpBuhE,GAAAC,gCAAG,EACrC,IAAI/mC,EAASb,EAAgBn5B,IACzBiT,EAAWhT,EACX+gE,EAAc7nC,EAAgBc,MAC9BgnC,EAAQhoC,EAAaqP,IACrB44B,kCCjCJ,IAAI1oC,EAAmB10B,GAAQA,EAAK00B,kBAAqB33B,OAAO4S,OAAU,SAASgS,EAAG7mB,EAAGsjB,EAAGuW,QAC7E71B,IAAP61B,IAAkBA,EAAKvW,GAC3BrhB,OAAOiH,eAAe2d,EAAGgT,EAAI,CAAE1wB,YAAY,EAAMC,IAAK,WAAa,OAAOpJ,EAAEsjB,EAAG,GAClF,EAAK,SAASuD,EAAG7mB,EAAGsjB,EAAGuW,QACT71B,IAAP61B,IAAkBA,EAAKvW,GAC3BuD,EAAEgT,GAAM75B,EAAEsjB,EACd,GACIwW,EAAsB50B,GAAQA,EAAK40B,qBAAwB73B,OAAO4S,OAAU,SAASgS,EAAGrP,GACxFvV,OAAOiH,eAAe2d,EAAG,UAAW,CAAE1d,YAAY,EAAMxI,MAAO6W,GACnE,EAAK,SAASqP,EAAGrP,GACbqP,EAAW,QAAIrP,CACnB,GACI6iB,EAAgBn1B,GAAQA,EAAKm1B,cAAiB,SAAU7X,GACxD,GAAIA,GAAOA,EAAI8X,WAAY,OAAO9X,EAClC,IAAI6W,EAAS,CAAA,EACb,GAAW,MAAP7W,EAAa,IAAK,IAAIc,KAAKd,EAAe,YAANc,GAAmBrhB,OAAOE,UAAUkT,eAAetP,KAAKyc,EAAKc,IAAIsW,EAAgBP,EAAQ7W,EAAKc,GAEtI,OADAwW,EAAmBT,EAAQ7W,GACpB6W,GAEPkB,EAAmBr1B,GAAQA,EAAKq1B,iBAAoB,SAAU/X,GAC9D,OAAQA,GAAOA,EAAI8X,WAAc9X,EAAM,CAAEgY,QAAWhY,IAExDvgB,OAAOiH,eAAew4D,GAAS,aAAc,CAAE/gE,OAAO,IACtC+gE,GAAAa,cAAG,EACnB,IAAIH,EAAc7nC,EAAgBn5B,MAC9BihE,EAAQhoC,EAAah5B,IACrBmhE,EAAWnnC,GACXknC,EAA0B,WAC1B,SAASA,IACR,CAwID,OAvIAA,EAASE,YAAc,SAAUjkC,EAAOkkC,GACpC,IAAI9mC,OAA2B53B,IAAfw6B,EAAMvtB,KAAqBmxD,EAAY5nC,QAAQgE,EAAMvtB,WAAQjN,EAC7E,OAAQw6B,EAAMt6B,MACV,IAAK,OACD,OAAOm+D,EAAM/lD,KAAKsf,GAEtB,IAAK,KACD,OAAOymC,EAAM9lD,GAAGqf,GAEpB,IAAK,KACD,OAAOymC,EAAMziB,GAAGhkB,GAEpB,IAAK,MACD,OAAOymC,EAAMnkB,IAAItiB,GAErB,IAAK,MACD,OAAOymC,EAAM/vD,IAAIspB,GAErB,IAAK,MACD,OAAOymC,EAAM9kD,IAAIqe,GAErB,IAAK,MACD,OAAOymC,EAAM1iB,IAAI/jB,GAErB,IAAK,MACD,OAAOymC,EAAM5uD,IAAImoB,GAErB,IAAK,MACD,OAAOymC,EAAMlmD,IAAIyf,GAErB,IAAK,MACD,OAAOymC,EAAM3iB,IAAI9jB,GAErB,IAAK,MACD,OAAOymC,EAAM9uD,IAAIqoB,GAErB,IAAK,OACD,OAAOymC,EAAM5iB,KAAK7jB,GAEtB,IAAK,OACD,OAAOymC,EAAM7iB,KAAK5jB,GAEtB,IAAK,OACD,OAAOymC,EAAM9iB,KAAK3jB,GAEtB,IAAK,OACD,OAAOymC,EAAM/iB,KAAK1jB,GAEtB,IAAK,QACD,OAAOymC,EAAMnjB,MAAMtjB,GAEvB,IAAK,SACD,OAAOymC,EAAMj7D,IAAIw0B,GAErB,IAAK,YACD,OAAOymC,EAAM5lD,UAAUmf,GAE3B,QACI,GAAI,QAAS4C,EAAMt6B,KACf,OAAOm+D,EAAMjjB,IAAImjB,EAASE,YAAY,CAClCxxD,UAAMjN,EACNE,KAAMs6B,EAAMt6B,KAAKk7C,KAClBsjB,GAAQ9mC,GAEV,GAAI,WAAY4C,EAAMt6B,KACvB,OAAOm+D,EAAMhjB,OAAOkjB,EAASE,YAAY,CACrCxxD,UAAMjN,EACNE,KAAMs6B,EAAMt6B,KAAKm7C,QAClBqjB,GAAQ9mC,GAEV,GAAI,YAAa4C,EAAMt6B,KAAM,CAC9B,IAAIy+D,EAAYnkC,EAAMt6B,KAAK0+D,QAE3B,QAAc5+D,IAAV0+D,EACA,MAAM,IAAIF,EAASK,SAAS,mCAEhC,IAAIC,EAAWJ,EAAMj+B,QAAO,SAAU/f,GAAK,OAAOA,EAAEzT,OAAS0xD,CAAU,IACvE,GAAwB,IAApBG,EAASvkE,OACT,MAAM,IAAIikE,EAASK,SAAS,mBAAqBtyB,KAAKC,UAAUhS,IAEpE,OAAO+jC,EAASQ,cAAcD,EAAS,GAAIJ,EAAO9mC,EACrD,CACI,GAAI,UAAW4C,EAAMt6B,KAAM,CAC5B,IAAI8+D,EAAUxkC,EAAMt6B,KAAKO,MAAM,GAC3Bw+D,EAAWzkC,EAAMt6B,KAAKO,MAAM,GAC5By+D,EAAcX,EAASE,YAAY,CACnCxxD,UAAMjN,EACNE,KAAM8+D,GACPN,GACH,OAAOL,EAAM59D,MAAMy+D,EAAaD,EAAUrnC,EAC7C,CAEG,MAAM,IAAIz8B,MAAM,wBAA0Bq/B,KAK1D+jC,EAASQ,cAAgB,SAAUI,EAAST,EAAOzxD,GAE/C,QADc,IAAVyxD,IAAoBA,EAAQ,IACN,WAAtBS,EAAQj/D,KAAKi6B,KAAmB,CAChC,IAAIilC,EAAeD,EAAQj/D,KAAKwT,OAAOyd,KAAI,SAAUqJ,GAEjD,OADQ+jC,EAASE,YAAYjkC,EAAOkkC,EAEpD,IACY,OAAOL,EAAMhvD,OAAO+vD,EAAcnyD,EACrC,CACI,GAA0B,SAAtBkyD,EAAQj/D,KAAKi6B,KAAiB,CACnC,IAAIklC,EAAWF,EAAQj/D,KAAKm/D,SAASluC,KAAI,SAAUxb,GAC/C,IAAI2pD,EAAclB,EAAY5nC,QAAQ7gB,EAAQ1I,MAC9C,QAAuBjN,IAAnB2V,EAAQjC,OACR,OAAO2qD,EAAMhvD,OAAO,GAAIiwD,GAE5B,IAAIF,EAAezpD,EAAQjC,OAAOyd,KAAI,SAAU2U,EAAGlsC,GAC/C,OAAKksC,EAAEz0B,eAAe,QAOfktD,EAASE,YAAY34B,EAAG44B,GANpBH,EAASE,YAAY,CAAEv+D,KAAM4lC,EAAG74B,KAAMrT,EAAE8G,YAAcg+D,EAOrF,IACgB,OAAOL,EAAMhvD,OAAO+vD,EAAcE,EAClD,IACY,YAAat/D,IAATiN,EAGOoxD,EAAMpjB,SAASokB,GAAU1uD,UAAU1D,GAEvCoxD,EAAMpjB,SAASokB,EAAUpyD,EACnC,CAEG,MAAM,IAAI9R,MAAM,sBAAwBgkE,IAGzCZ,CACX,CA3I8B,UA4I9Bb,GAAAa,SAAmBA,KDtIPl1B,GAKR80B,EAA4C,WAC5C,SAASA,EAA2BT,GAChC,IAAIroB,EAAQn0C,KACZA,KAAKw8D,IAAMA,EACXx8D,KAAKq+D,SAAWpB,EAA2BqB,cAAc9B,GACzD,IAAI+B,EAAuB,IAAI7kC,IAC3B8kC,EAAkB,IAAI9kC,IAC1B8iC,EAAIQ,aAAa9jC,SAAQ,SAAUwjC,GAC/B,IACI+B,EADAC,EAAShC,EAEb,IAAIgC,EAAOC,aASP,MAAM,IAAI1kE,MAAM,8CAEpB,GAVIskE,EAAqBz5D,IAAIoxB,EAAOZ,QAAQ/kB,OAAOpB,EAAS5S,OAAOe,KAAKohE,EAAOC,aAAaljE,QAAS,CAC7FyU,OAAQikC,EAAMkqB,SAASn6D,IAAIw6D,EAAO3yD,MAClCA,KAAM2yD,EAAO3yD,OAEjByyD,EAAgB15D,IAAI45D,EAAO3yD,KAAMoD,EAAS5S,OAAOe,KAAKohE,EAAOC,aAAaljE,QAC1EgjE,EAAsBC,EAAOC,aAAaljE,MAAMpC,OAKhD86C,EAAMsqB,qBAAuBtqB,EAAMsqB,sBAAwBA,EAC3D,MAAM,IAAIxkE,MAAM,4DAGhBk6C,EAAMsqB,oBAAsBA,CAE5C,IACQz+D,KAAKu+D,qBAAuBA,EAC5Bv+D,KAAKw+D,gBAAkBA,CAC1B,CA2FD,OAvFAvB,EAA2BhgE,UAAU2hE,YAAc,SAAUC,EAAQnC,GACjE,OAAO18D,KAAKuQ,OAAOsuD,EAAQnC,IAK/BO,EAA2BhgE,UAAUsT,OAAS,SAAUsuD,EAAQnC,GAC5D,IAAIliE,EAAS2U,EAAS5S,OAAOE,MAAM,KAC/BqiE,EAAa5B,EAAY5nC,QAAQupC,GACjC3uD,EAASlQ,KAAKq+D,SAASn6D,IAAI46D,GAC3BrrD,EAAgBzT,KAAKw+D,gBAAgBt6D,IAAI46D,GAC7C,IAAK5uD,IAAWuD,EACZ,MAAM,IAAIxZ,MAAM,mBAAqB6kE,GAGzC,GAAmB,eAAfA,GAA8C,eAAfA,EAA6B,CAE5D,IADA,IAAIrkE,EAAS,EACJw4C,EAAK,EAAGtT,EAAK5iC,OAAOwd,KAAKmiD,EAAGqC,iBAAkB9rB,EAAKtT,EAAGtmC,OAAQ45C,IAAM,CACzE,IAAI5iB,EAAMsP,EAAGsT,GACbx4C,GAAUD,EAAO0M,SAASzM,GAAQgQ,UAAU4lB,EAAIh3B,QAChDoB,GAAUD,EAAO0M,SAASzM,GAAQmD,MAAMyyB,GACxC51B,GAAUD,EAAO0M,SAASzM,GAAQgQ,UAAUiyD,EAAGqC,gBAAgB1uC,GAAKh3B,QACpEoB,GAAUD,EAAO0M,SAASzM,GAAQmD,MAAM8+D,EAAGqC,gBAAgB1uC,GAC9D,CACD,GAAI51B,EA9DQ,IA+DR,MAAM,IAAIR,MAAM,4BAEpB,IAAIiF,EAAO1E,EAAO0M,SAAS,EAAGzM,GAC9B,OAAO0U,EAAS5S,OAAOoI,OAAO,CAAC8O,EAAevU,GACjD,CAEG,IAAInG,EAAMmX,EAAOK,OAAOmsD,EAAIliE,GACxB0E,EAAO1E,EAAO0M,SAAS,EAAGnO,GAC9B,OAAOoW,EAAS5S,OAAOoI,OAAO,CAAC8O,EAAevU,KAGtD+9D,EAA2BqB,cAAgB,SAAU9B,GACjD,IAAIwC,EAAYxC,EAAIQ,aAAa/sC,KAAI,SAAUysC,GAC3C,IAAIwB,EAAexB,EAAG7kC,KAAK5H,KAAI,SAAU/yB,GAAO,IAAIyiC,EAAIyU,EAAI,OAAOgpB,EAAMC,SAASE,YAAYrgE,EAAKnD,MAAMuD,KAAKw/D,EAAcA,EAAc,GAA6B,QAAvBn9B,EAAK68B,EAAI5oB,gBAA6B,IAAPjU,EAAgBA,EAAK,IAA4B,QAApByU,EAAKooB,EAAIgB,aAA0B,IAAPppB,EAAgBA,EAAK,KAAO,IAChQroC,EAAOmxD,EAAY5nC,QAAQonC,EAAG3wD,MAClC,MAAO,CAACA,EAAMoxD,EAAMhvD,OAAO+vD,EAAcnyD,GACrD,IACQ,OAAO,IAAI2tB,IAAIslC,IAKnB/B,EAA2BhgE,UAAUuT,OAAS,SAAUksD,EAAIl/D,QACvC,IAAbA,IAAuBA,EAAW,OACpB,iBAAPk/D,IACPA,EAAkB,QAAbl/D,EAAqB2R,EAAS5S,OAAOe,KAAKo/D,EAAI,OAASvtD,EAAS5S,OAAOe,KAAK44B,EAAOZ,QAAQ9kB,OAAOksD,KAE3G,IAAIjpD,EAAgByiB,EAAOZ,QAAQ/kB,OAAOmsD,EAAGx1D,SAAS,EAAGlH,KAAKy+D,sBAC1Dv/D,EAAOw9D,EAAGx1D,SAASlH,KAAKy+D,qBACxBxjB,EAAUj7C,KAAKu+D,qBAAqBr6D,IAAIuP,GAC5C,IAAKwnC,EACD,OAAO,KAGX,GAAqB,eAAjBA,EAAQlvC,MAA0C,eAAjBkvC,EAAQlvC,KAAuB,CAGhE,IAFA,IAAI8oC,EAAU,CAAA,EACV3iC,EAAM,EACHA,EAAMhT,EAAK7F,QAAQ,CACtB,IAAI4lE,EAAY//D,EAAKgT,GAErB,GADAA,IACI+sD,EAAW,CACX,IAAI5uC,EAAMnxB,EAAKrB,MAAMqU,EAAKA,EAAM+sD,GAAWz/D,WAEvC0/D,EAAchgE,EADlBgT,GAAO+sD,GAEP/sD,IACA,IAAIzW,EAAQyD,EAAKrB,MAAMqU,EAAKA,EAAMgtD,GAAa1/D,WAC/C0S,GAAOgtD,EACPrqB,EAAQxkB,GAAO50B,CAClB,CACJ,CACD,MAAO,CACHyD,KAAM21C,EACN9oC,KAAMkvC,EAAQlvC,KAErB,CAEG,MAAO,CACH7M,KAAM+7C,EAAQ/qC,OAAOM,OAAOtR,GAC5B6M,KAAMkvC,EAAQlvC,OAInBkxD,CACX,CA1HgD,UA2HhDD,GAAAC,2BAAqCA,qEEpKrClgE,OAAOiH,eAAem7D,GAAS,aAAc,CAAE1jE,OAAO,IAC/B0jE,GAAAC,qBAAG,EAC1B,IAAIC,kCCFJtiE,OAAOiH,eAAew3D,GAAS,aAAc,CAAE//D,OAAO,IAC1B+/D,GAAA8D,0BAAG,EAC/B,IAAIA,EAAsC,WACtC,SAASA,IACR,CAID,OAHAA,EAAqBriE,UAAUuT,OAAS,SAAUg6B,GAC9C,MAAM,IAAIvwC,MAAM,6CAEbqlE,CACX,CAP0C,UAQ1C9D,GAAA8D,qBAA+BA,KDRhBpjE,GACX43C,EAAa33C,KACbojE,EAAiBppC,KACjBqpC,kCELJziE,OAAOiH,eAAei4B,GAAS,aAAc,CAAExgC,OAAO,IAC1BwgC,GAAAwjC,0BAAG,EAC/B,IAAIA,EAAsC,WACtC,SAASA,IACR,CAOD,OANAA,EAAqBxiE,UAAUsT,OAAS,SAAUmvD,EAAOC,GACrD,MAAM,IAAI1lE,MAAM,oBAEpBwlE,EAAqBxiE,UAAUuT,OAAS,SAAUovD,GAC9C,MAAM,IAAI3lE,MAAM,oBAEbwlE,CACX,CAV0C,UAW1CxjC,GAAAwjC,qBAA+BA,KFRjBj7B,GACVq7B,kCGNJ9iE,OAAOiH,eAAew5D,GAAS,aAAc,CAAE/hE,OAAO,IAC1B+hE,GAAAsC,0BAAG,EAC/B,IAAIA,EAAsC,WACtC,SAASA,IACR,CAOD,OANAA,EAAqB7iE,UAAUsT,OAAS,SAAUmvD,EAAOK,GACrD,MAAM,IAAI9lE,MAAM,oBAEpB6lE,EAAqB7iE,UAAUuT,OAAS,SAAUkvD,EAAOM,GACrD,MAAM,IAAI/lE,MAAM,oBAEb6lE,CACX,CAV0C,UAW1CtC,GAAAsC,qBAA+BA,KHPjB33B,GAIVi3B,EACA,SAAyB5C,GACrBx8D,KAAK4zC,SAAW,IAAIE,EAAWyoB,uBAAuBC,GACtDx8D,KAAKw7D,OAAS,IAAI6D,EAASC,qBAC3Bt/D,KAAKigE,YAAc,IAAIV,EAAetC,2BAA2BT,GACjEx8D,KAAKi8B,MAAQ,IAAIujC,EAAQC,qBACzBz/D,KAAKw9D,MAAQ,IAAIqC,EAAQC,oBAC5B,SAGLX,GAAAC,gBAA0BA,6qKIpB1B,IAAI1qC,EAAmB10B,GAAQA,EAAK00B,kBAAqB33B,OAAO4S,OAAU,SAASgS,EAAG7mB,EAAGsjB,EAAGuW,QAC7E71B,IAAP61B,IAAkBA,EAAKvW,GAC3BrhB,OAAOiH,eAAe2d,EAAGgT,EAAI,CAAE1wB,YAAY,EAAMC,IAAK,WAAa,OAAOpJ,EAAEsjB,EAAG,GAClF,EAAK,SAASuD,EAAG7mB,EAAGsjB,EAAGuW,QACT71B,IAAP61B,IAAkBA,EAAKvW,GAC3BuD,EAAEgT,GAAM75B,EAAEsjB,EACd,GACI8hD,EAAgBlgE,GAAQA,EAAKkgE,cAAiB,SAASplE,EAAGwB,GAC1D,IAAK,IAAIstB,KAAK9uB,EAAa,YAAN8uB,GAAoB7sB,OAAOE,UAAUkT,eAAetP,KAAKvE,EAASstB,IAAI8K,EAAgBp4B,EAASxB,EAAG8uB,IAE3H7sB,OAAOiH,eAAc1H,EAAU,aAAc,CAAEb,OAAO,IACtDykE,yBCXA,IAAI7qC,EAAmBr1B,GAAQA,EAAKq1B,iBAAoB,SAAU/X,GAC9D,OAAQA,GAAOA,EAAI8X,WAAc9X,EAAM,CAAEgY,QAAWhY,IAExDvgB,OAAOiH,eAAc1H,EAAU,aAAc,CAAEb,OAAO,IACtDa,EAAA6jE,QAAkB7jE,EAA0B8jE,gBAAA9jE,EAAA+jE,uBAA4B,EACxE,IAAI/C,EAAWphE,GACXokE,EAAUnkE,KACVokE,EAAalrC,EAAgBc,IASjC75B,EAAA+jE,kBAHA,SAA2BvnD,EAAW0nD,GAClC,OAAO,IAAIlD,EAASmD,QAAQF,EAAWjrC,QAASxc,EAAW0nD,EAAU,IAAIF,EAAQlB,gBAAgBmB,EAAWjrC,SAChH,EAKAh5B,EAAA8jE,gBAHA,WACI,OAAO,IAAIE,EAAQlB,gBAAgBmB,EAAWjrC,QAClD,EAEA,IAAIorC,EAAavqC,GACjBp5B,OAAOiH,eAAe1H,EAAS,UAAW,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOmxB,EAAgBqrC,GAAYprC,OAAU,cDX3Fh5B,uDEXnCS,OAAOiH,eAAc1H,EAAU,aAAc,CAAEb,OAAO,IACtDa,EAAkB6jE,QAAA7jE,EAAA8jE,gBAA0B9jE,oBAA4BA,EAA+BqkE,qBAAArkE,EAAAskE,4BAAsCtkE,iBAAyBA,EAAyB01C,eAAA11C,EAAA25C,oBAA8B35C,EAAyBy2C,eAAAz2C,EAAAo2C,iBAA2Bp2C,EAA2BukE,iBAAAvkE,EAAA+2C,cAAwB/2C,cAAsBA,EAAqBwkE,WAAAxkE,EAAAykE,UAAoBzkE,aAAqBA,EAAsB0kE,YAAA1kE,EAAA2kE,oBAA8B3kE,UAAkBA,EAAmB4kE,SAAA5kE,EAAA6kE,WAAgB,EACjgB,IASIH,EASOI,EAIAL,EAKAD,EA3BPlmB,EAAY1+C,EAAAA,QACZiT,EAAWhT,EACXklE,EAAYlrC,GAEhB75B,EAAA6kE,MAAgB,WAChB7kE,EAAA4kE,SAAmB,EACnB5kE,EAAkBglE,QAAAhlE,EAAQ4kE,SAE1B5kE,EAAA2kE,oBAA8B,GAE9B,SAAWD,GACPA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAoB,OAAI,GAAK,SACzCA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAqB,QAAI,GAAK,SAC7C,CAND,CAMGA,EAAc1kE,EAAQ0kE,cAAgB1kE,EAAsB0kE,YAAA,CAAE,KAEtDI,EAEK9kE,EAAQ8kE,aAAe9kE,EAAqB8kE,WAAA,CAAA,IAD7CA,EAAsB,UAAI,GAAK,aAGnCL,EAGIzkE,EAAQykE,YAAczkE,EAAoBykE,UAAA,CAAA,IAF3CA,EAAmB,QAAI,GAAK,UACtCA,EAAUA,EAAiB,MAAI,GAAK,SAG7BD,EAGKxkE,EAAQwkE,aAAexkE,EAAqBwkE,WAAA,CAAA,IAF7CA,EAAoB,QAAI,GAAK,UACxCA,EAAWA,EAAuB,WAAI,GAAK,aAG/C,SAAW9oD,GACPA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAqB,QAAI,GAAK,UAC1CA,EAAYA,EAAmB,MAAI,GAAK,QACxCA,EAAYA,EAAkB,KAAI,GAAK,OACvCA,EAAYA,EAAwB,WAAI,GAAK,YAChD,CAPD,CAOiB1b,EAAQ0b,cAAgB1b,EAAsB0b,YAAA,CAAA,IAC/D,IAAIupD,EAAgBpyD,EAAS5S,OAAOE,MAAM,IACtC+kE,EAAW,SAAUtiE,GAAQ,OAAQA,EAAKiG,OAAOo8D,GAAiB,KAAO,IAAI3mB,EAAUptC,UAAUtO,IAqBrG5C,EAAA+2C,cAnBA,SAAuBn0C,GAEnB,KAAIA,EAAKxB,WAAa,GAAtB,CAGA,IAAI+jE,EAAQviE,EAAK4I,aAAa,GAC9B,OAAI25D,IAAUnlE,EAAQ6kE,MAOX,CAAEM,MAAOA,EAAOl3B,QALTrrC,EAAK4I,aAAa,GAKS9I,KAH9BE,EAAK4I,aAAa,GAGwBxI,KAD1CJ,EAAK4I,aAAa,UAI7B,CAZH,CAcL,EAmCAxL,EAAAukE,iBAjCuB,SAAU3hE,GAkB7B,IAhBA,IAAIuiE,EAAQviE,EAAK4I,aAAa,GAE1ByiC,EAAUrrC,EAAK4I,aAAa,GAE5B9I,EAAOE,EAAK4I,aAAa,GAEzBxI,EAAOJ,EAAK4I,aAAa,IAEzB45D,EAAcxiE,EAAK4I,aAAa,IAIhC65D,EAAqBH,EAAStiE,EAAKrB,MAAM,GAAI,KAE7CpD,EAAS,GACTmnE,EAAqB,GAChBlpE,EAAI,EAAGA,EAAIgpE,EAAahpE,IAAK,CAClC,IAAImpE,EAAsB3iE,EAAKrB,MAAMpD,EAAQA,EAAS,IAClDy7C,EAAoB,IAAI0E,EAAUptC,UAAUq0D,GAChDpnE,GAAU,GACVmnE,EAAmBloE,KAAKw8C,EAC3B,CACD,MAAO,CACHurB,MAAOA,EACPl3B,QAASA,EACTvrC,KAAMA,EACNM,KAAMA,EACNqiE,mBAAoBA,EACpBC,mBAAoBA,IAmC5BtlE,EAAAo2C,iBA/BuB,SAAUxzC,GAE7B,IAAIuiE,EAAQviE,EAAK4I,aAAa,GAE1ByiC,EAAUrrC,EAAK4I,aAAa,GAE5B9I,EAAOE,EAAK4I,aAAa,GAEzBxI,EAAOJ,EAAK4I,aAAa,IAEzBg6D,EAAoB5iE,EAAKrB,MAAM,GAAI,IACnC80C,EAAkB6uB,EAASM,GAC3BjtB,EAAU,CAAA,EACVlC,IACAkC,EAAQktB,cAAgBpvB,EAAgBjU,YAE5C,IADA,IAAIxsB,EAAM,GACHA,EAAM5S,GAAM,CACf,IAAI2/D,EAAY//D,EAAKgT,GAErB,GADAA,IACI+sD,EAAW,CACX,IAAI5uC,EAAMnxB,EAAKrB,MAAMqU,EAAKA,EAAM+sD,GAAWz/D,WAEvC0/D,EAAchgE,EADlBgT,GAAO+sD,GAEP/sD,IACA,IAAIzW,EAAQyD,EAAKrB,MAAMqU,EAAKA,EAAMgtD,GAAa1/D,WAC/C0S,GAAOgtD,EACPrqB,EAAQxkB,GAAO50B,CAClB,CACJ,CACD,MAAO,CAAEgmE,MAAOA,EAAOl3B,QAASA,EAASvrC,KAAMA,EAAMM,KAAMA,EAAMqzC,gBAAiBA,EAAiBkC,QAASA,IAGhH,IAAImtB,EAAW,SAAU9iE,EAAM+iE,GAE3B,IAAIC,EAAiBb,EAAUt4D,eAAe7J,EAAM,GAMpD,MAAO,CAAEgjE,eAAgBA,EAAgBzmE,MAL7BgG,OAAOygE,GAAkB3mE,KAAKC,IAAI,GAAIymE,GAKKE,UAHvCd,EAAUt4D,eAAe7J,EAAM,GAG8BkjE,YAD3Df,EAAUt4D,eAAe7J,EAAM,MAGjDmjE,EAAiB,SAAUnjE,EAAM+iE,GAEjC,IAAIK,EAAiBjB,EAAUt4D,eAAe7J,EAAM,GAChD41C,EAAQrzC,OAAO6gE,GAAkB/mE,KAAKC,IAAI,GAAIymE,GAE9CM,EAAsBlB,EAAUp5D,gBAAgB/I,EAAM,GAQ1D,MAAO,CACHojE,eAAgBA,EAChBxtB,MAAOA,EACPytB,oBAAqBA,EACrBC,WAXa/gE,OAAO8gE,GAAuBhnE,KAAKC,IAAI,GAAIymE,GAYxDrU,OAVS1uD,EAAK4I,aAAa,IAW3B26D,gBATkBvjE,EAAK4I,aAAa,IAUpC46D,YARcjhE,OAAO4/D,EAAUp5D,gBAAgB/I,EAAM,OAwH7D5C,EAAAy2C,eA3GqB,SAAU7zC,EAAM20C,GAEjC,IAsDIiB,EACA0tB,EAvDAf,EAAQviE,EAAK4I,aAAa,GAE1ByiC,EAAUrrC,EAAK4I,aAAa,GAE5B9I,EAAOE,EAAK4I,aAAa,GAEzBxI,EAAOJ,EAAK4I,aAAa,IAEzB66D,EAAYzjE,EAAK4I,aAAa,IAE9Bm6D,EAAW/iE,EAAK2J,YAAY,IAE5B+5D,EAAqB1jE,EAAK4I,aAAa,IAEvC+6D,EAAa3jE,EAAK4I,aAAa,IAE/Bg7D,EAAWzB,EAAUp5D,gBAAgB/I,EAAM,IAE3C6jE,EAAY1B,EAAUp5D,gBAAgB/I,EAAM,IAE5C8jE,EAAWhB,EAAS9iE,EAAKrB,MAAM,GAAI,IAAKokE,GAExCgB,EAAgBjB,EAAS9iE,EAAKrB,MAAM,GAAI,IAAKokE,GAE7CiB,EAAY7B,EAAUt4D,eAAe7J,EAAM,IAE3CikE,EAAgBjkE,EAAKuI,UAAU,KAE/B27D,EAAOlkE,EAAKwJ,SAAS,KAErB26D,EAAOnkE,EAAKyJ,YAAY,KAExB26D,EAAOpkE,EAAK2J,YAAY,KAExBqtC,EAAoB,IAAI0E,EAAUptC,UAAUtO,EAAKrB,MAAM,IAAK,MAE5D0lE,EAAsB/B,EAAStiE,EAAKrB,MAAM,IAAK,MAE/C2lE,EAAenC,EAAUp5D,gBAAgB/I,EAAM,KAE/CukE,EAAyBpC,EAAUt4D,eAAe7J,EAAM,KACxDwkE,EAAgBjiE,OAAOgiE,GAA0BloE,KAAKC,IAAI,GAAIymE,GAE9D0B,EAA8BtC,EAAUp5D,gBAAgB/I,EAAM,KAC9D0kE,EAAqBniE,OAAOkiE,GAA+BpoE,KAAKC,IAAI,GAAIymE,GAExE4B,EAAoBxC,EAAUt4D,eAAe7J,EAAM,KACnD4kE,EAAYzB,EAAenjE,EAAKrB,MAAM,IAAK,KAAMokE,GACjDrU,EAASkW,EAAUlW,OACnB/Z,GAAe+Z,IAAWoT,EAAY+C,SAClClwB,EAAciwB,EAAUpB,YAAcpmE,EAAQ2kE,sBAC9CrT,EAASoT,EAAYgD,SAKzBpW,IAAWoT,EAAY+C,UACvBjvB,EAAQgvB,EAAUhvB,MAClB0tB,EAAasB,EAAUtB,YAK3B,IAFA,IAAIyB,EAAkB,GAClBxpE,EAAS,IACNwpE,EAAgB5qE,OAASupE,GAAoB,CAChD,IAAIsB,EAAY,IAAItpB,EAAUptC,UAAUtO,EAAKrB,MAAMpD,EAAQA,EAAS,KACpEA,GAAU,GACV,IAAI0pE,EAAqB9B,EAAenjE,EAAKrB,MAAMpD,EAAQA,EAAS,IAAKwnE,GACzExnE,GAAU,GACV,IAAI2pE,EAAS/B,EAAenjE,EAAKrB,MAAMpD,EAAQA,EAAS,IAAKwnE,GAC7DxnE,GAAU,GACVwpE,EAAgBvqE,KAAK,CAAEwqE,UAAWA,EAAWJ,UAAWK,EAAoBC,OAAQA,GACvF,CACD,MAAO,CACH3C,MAAOA,EACPl3B,QAASA,EACTvrC,KAAMA,EACNM,KAAMA,EACNqjE,UAAWA,EACXV,SAAUA,EACVW,mBAAoBA,EACpBC,WAAYA,EACZC,SAAUA,EACVC,UAAWA,EACXC,SAAUA,EACVC,cAAeA,EACfC,UAAWA,EACXC,cAAeA,EACfC,KAAMA,EACNC,KAAMA,EACNC,KAAMA,EACNptB,kBAAmBA,EACnBqtB,oBAAqBA,EACrBC,aAAcA,EACdC,uBAAwBA,EACxBC,cAAeA,EACfC,4BAA6BA,EAC7BC,mBAAoBA,EACpBC,kBAAmBA,EACnBC,UAAWA,EACXG,gBAAiBA,EACjBnvB,MAAOA,EACP0tB,WAAYA,EACZ5U,OAAQA,IA0BhBtxD,EAAA25C,oBAtB0B,SAAU/2C,GAYhC,MAAO,CACHuiE,MAXQviE,EAAK4I,aAAa,GAY1ByiC,QAVUrrC,EAAK4I,aAAa,GAW5B9I,KATOE,EAAK4I,aAAa,GAUzBxI,KAROJ,EAAK4I,aAAa,IASzBu8D,gBARkB,IAAIzpB,EAAUptC,UAAUtO,EAAKrB,MAAM,GAAI,KASzDymE,sBARwB,IAAI1pB,EAAUptC,UAAUtO,EAAKrB,MAAM,GAAI,KAS/D0mE,kBARoB,IAAI3pB,EAAUptC,UAAUtO,EAAKrB,MAAM,GAAI,QAYnE,IAAIk0C,EAAmBvN,KACvBznC,OAAOiH,eAAe1H,EAAS,iBAAkB,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAO6tC,EAAiBC,cAAe,IAC/H,IAAIiD,EAAmB9M,KACvBprC,OAAOiH,eAAe1H,EAAS,iBAAkB,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAO+wC,EAAiBC,cAAe,IAC/H,IAAIsvB,kCC7SJznE,OAAOiH,eAAeygE,GAAS,aAAc,CAAEhpE,OAAO,IACtDgpE,GAAA9D,qBAA+B8D,GAAA7D,iCAAsC,EACrE,IAAIhmB,EAAY1+C,EAAAA,QAEZwoE,EAA0B,CAC1B,eAAgB,+CAChBC,OAAQ,8CACR,sBAAuB,8CACvBC,QAAS,+CACT,uBAAwB,+CACxBC,QAAS,+CACTC,SAAU,sDAWqBL,GAAA7D,4BARnC,SAAqC6D,GACjC,QAAyC3lE,IAArC4lE,EAAwBD,GACxB,OAAO,IAAI7pB,EAAUptC,UAAUk3D,EAAwBD,IAGvD,MAAM,IAAIxqE,MAAM,gCAAkCwqE,EAAU,wBAA0Bp5B,KAAKC,UAAUvuC,OAAOwd,KAAKmqD,IAEzH,EAkBAD,GAAA9D,qBAfA,SAA8B8D,GAE1B,MAAgB,yBAAZA,GAAkD,wBAAZA,EAC/B,oCAEU,YAAZA,EACE,8BAEU,aAAZA,EACE,wBAGA7pB,EAAUmqB,cAAcN,EAEvC,KDuQgBO,GAChBjoE,OAAOiH,eAAe1H,EAAS,8BAA+B,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOsgE,EAAU5D,2BAA4B,IAClJ7jE,OAAOiH,eAAe1H,EAAS,uBAAwB,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOsgE,EAAU7D,oBAAqB,IACpI,IAAIrD,EAAW2H,KACfloE,OAAOiH,eAAe1H,EAAS,oBAAqB,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOo5D,EAAS+C,iBAAkB,IAC7HtjE,OAAOiH,eAAe1H,EAAS,kBAAmB,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOo5D,EAAS8C,eAAgB,IACzHrjE,OAAOiH,eAAe1H,EAAS,UAAW,CAAE2H,YAAY,EAAMC,IAAK,WAAc,OAAOo5D,EAAS6C,OAAU,mtBEzS3G,IAAA3/D,IAAAA,MAAA9H,GAAA,CATAgF,WAuCA,SAAqB8hB,GACnB,IAAI3kB,EAAOitB,GAAQtI,GACfpD,EAAWvhB,EAAK,GAChB2F,EAAkB3F,EAAK,GAC3B,OAAuC,GAA9BuhB,EAAW5b,GAAuB,EAAKA,CAClD,EA3CAhI,YAiDA,SAAsBgnB,GACpB,IAAI3kB,EAcAuhB,EAbA5b,EAAOsnB,GAAQtI,GACf9mB,EAAW8H,EAAK,GAChBmhB,EAAkBnhB,EAAK,GAEvBgvB,EAAM,IAAIhrB,GAVhB,SAAsBgb,EAAK3kB,EAAUuhB,GACnC,OAAuC,GAA9BvhB,EAAWuhB,GAAuB,EAAKA,CAClD,CAFA,CAUgC,EAAK1jB,EAAUipB,IAEzCjmB,EAAU,EAGVkpC,EAAMjjB,EAAkB,EACxBjpB,EAAW,EACXA,EAGJ,IAAK0jB,EAAI,EAAGA,EAAIwoB,EAAKxoB,GAAK,EACxBvhB,EACGO,GAAUokB,EAAIvmB,WAAWmjB,KAAO,GAChChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,KAAO,GACpChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,KAAO,EACrChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,IAC/BoT,EAAI9zB,KAAcb,GAAO,GAAM,IAC/B20B,EAAI9zB,KAAcb,GAAO,EAAK,IAC9B20B,EAAI9zB,KAAmB,IAANb,EAmBnB,OAhBwB,IAApB8mB,IACF9mB,EACGO,GAAUokB,EAAIvmB,WAAWmjB,KAAO,EAChChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,KAAO,EACvCoT,EAAI9zB,KAAmB,IAANb,GAGK,IAApB8mB,IACF9mB,EACGO,GAAUokB,EAAIvmB,WAAWmjB,KAAO,GAChChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,KAAO,EACpChhB,GAAUokB,EAAIvmB,WAAWmjB,EAAI,KAAO,EACvCoT,EAAI9zB,KAAcb,GAAO,EAAK,IAC9B20B,EAAI9zB,KAAmB,IAANb,GAGZ20B,CACT,EA5FAr2B,cAkHA,SAAwBqmB,GAQtB,IAPA,IAAI3kB,EACAuhB,EAAMoD,EAAMnmB,OACZmH,EAAa4b,EAAM,EACnB1jB,EAAQ,GACR0C,EAAiB,MAGZoJ,EAAI,EAAGgrB,EAAOpT,EAAM5b,EAAYgE,EAAIgrB,EAAMhrB,GAAKpJ,EACtD1C,EAAMgB,KAAKkrC,GAAYplB,EAAOhb,EAAIA,EAAIpJ,EAAkBo0B,EAAOA,EAAQhrB,EAAIpJ,IAqB7E,OAjBmB,IAAfoF,GACF3F,EAAM2kB,EAAMpD,EAAM,GAClB1jB,EAAMgB,KACJioB,GAAO9mB,GAAO,GACd8mB,GAAQ9mB,GAAO,EAAK,IACpB,OAEsB,IAAf2F,IACT3F,GAAO2kB,EAAMpD,EAAM,IAAM,GAAKoD,EAAMpD,EAAM,GAC1C1jB,EAAMgB,KACJioB,GAAO9mB,GAAO,IACd8mB,GAAQ9mB,GAAO,EAAK,IACpB8mB,GAAQ9mB,GAAO,EAAK,IACpB,MAIGnC,EAAMmB,KAAK,GACpB,GA/II8nB,GAAS,GACTvmB,GAAY,GACZoJ,GAA4B,oBAAf1K,WAA6BA,WAAaC,MAEvDy1B,GAAO,mEACF9zB,GAAI,EAAsBA,GAAb,KAAwBA,GAC5CimB,GAAOjmB,IAAK8zB,GAAK9zB,IACjBN,GAAUo0B,GAAKv2B,WAAWyC,KAAMA,GAQlC,SAASosB,GAAStI,GAChB,IAAI3kB,EAAM2kB,EAAInmB,OAEd,GAAIwB,EAAM,EAAI,EACZ,MAAM,IAAIZ,MAAM,kDAKlB,IAAImiB,EAAWoD,EAAItlB,QAAQ,KAO3B,OANkB,IAAdkiB,IAAiBA,EAAWvhB,GAMzB,CAACuhB,EAJcA,IAAavhB,EAC/B,EACA,EAAKuhB,EAAW,EAGtB,CAmEA,SAASwoB,GAAaplB,EAAO3kB,EAAOuhB,GAGlC,IAFA,IAAI5b,EARoB9H,EASpB0C,EAAS,GACJoJ,EAAI3J,EAAO2J,EAAI4X,EAAK5X,GAAK,EAChChE,GACIgf,EAAMhb,IAAM,GAAM,WAClBgb,EAAMhb,EAAI,IAAM,EAAK,QACP,IAAfgb,EAAMhb,EAAI,IACbpJ,EAAO1B,KAdFioB,IADiBjpB,EAeM8H,IAdT,GAAK,IACxBmhB,GAAOjpB,GAAO,GAAK,IACnBipB,GAAOjpB,GAAO,EAAI,IAClBipB,GAAa,GAANjpB,IAaT,OAAO0C,EAAOvB,KAAK,GACrB,CAlGAuB,GAAU,IAAInC,WAAW,IAAM,GAC/BmC,GAAU,IAAInC,WAAW,IAAM,GAAA,IAAAonC,GAAA,CAAA;;;;;;;;;;;;;;;;;;;;82mDChB/B,IAAY6kC,GAAAA,QA0BXA,YAAA,GA1BWA,GAAAA,iBAAAA,QAAAA,OA0BX,CAAA,IAzBC,KAAA,OACAA,GAAA,KAAA,OACAA,GAAA,IAAA,MACAA,GAAA,IAAA,MACAA,GAAA,IAAA,MACAA,GAAA,IAAA,MACAA,GAAA,KAAA,OACAA,GAAA,MAAA,QACAA,GAAA,IAAA,MACAA,GAAA,QAAA,UACAA,GAAA,OAAA,SACAA,GAAA,OAAA,SACAA,GAAA,QAAA,UACAA,GAAA,SAAA,WACAA,GAAA,IAAA,MACAA,GAAA,KAAA,OACAA,GAAA,MAAA,QACAA,GAAA,IAAA,MACAA,GAAA,UAAA,MACAA,GAAA,SAAA,WACAA,GAAA,EAAA,IACAA,GAAA,KAAA,OACAA,GAAA,MAAA,QACAA,GAAA,IAAA,MACAA,GAAA,WAAA,aAGW,MAAAC,GAAsC,IAAIzrC,IAAI,CACzD,CAACwrC,QAAMA,OAACE,IAAK,IACb,CAACF,QAAMA,OAACG,IAAK,IACb,CAACH,QAAMA,OAACI,IAAK,IACb,CAACJ,QAAMA,OAACK,UAAW,IACnB,CAACL,QAAMA,OAACn7C,EAAG,GACX,CAACm7C,QAAMA,OAACM,KAAM,IACd,CAACN,QAAMA,OAACO,WAAY,MAGtB,IAAYC,GAAAA,QAGXA,mBAAA,GAHWA,GAAAA,QAAaA,gBAAbA,sBAGX,CAAA,IAFCA,GAAA,GAAA,GAAA,KACAA,GAAAA,GAAA,GAAA,GAAA,KC/BW,MAAAC,GAAqB55D,IAChC,MAAMS,EAAQ0hC,GAAcniC,EACtB7J,EAAM8lC,GAAOzrC,EAAAA,OAAOe,KAAKkP,EAAO,SAAS3O,MAAM,GACrD,OAAOtB,SAAOe,KAAK4E,EAAK,MAAM,EAGnB0jE,GAAwB,CACnCvrC,EACAiV,EACA7U,KAEA,MAAM8U,EAAQ,CAAClV,GACXiV,EACFC,EAAM71C,KAAK41C,EAAU73B,YAErB83B,EAAM71C,KAAK6C,EAAAA,OAAOE,MAAM,KAEtBg+B,EACF8U,EAAM71C,KAAK+gC,EAAWhjB,YAEtB83B,EAAM71C,KAAK6C,EAAAA,OAAOE,MAAM,KAE1B,MAAOq+B,GAAkBttB,EAAAA,UAAU0M,uBACjCq1B,EACAtB,IAEF,OAAOnT,CAAc,EAShBriB,eAAe2jB,GACpBzjB,EACAgjB,GAEA,MAAMkqC,EAAsBF,GAAkBhqC,EAAY+C,YACpD9C,EAAuBgqC,GAC3BC,EACAt3B,KAGIt6B,SAAEA,SAAmBurB,GAAkBrB,SAC3CxlB,EACAijB,GAEF,IAAK3nB,EAAS/U,KACZ,MAAM,IAAIwwB,GAASD,kBAAUq2C,eAE/B,MAAMC,EAAa,IAAI1qD,GAAGpH,EAAS/U,KAAKrB,MAAM,EAAG,GAAI,MAAMihB,WAC3D,OAAO7K,EAAS/U,KAAKrB,MAAM,EAAG,EAAIkoE,GAAYvmE,UAChD,CAQOiZ,eAAeutD,GACpBrtD,EACAqnB,GAEA,IAAIimC,EAAqC,GACzC,IAAK,IAAItqC,KAAeqE,EAAc,CACpC,MAAM6lC,EAAsBF,GAAkBhqC,EAAY+C,YACpD9C,EAAuBgqC,GAC3BC,EACAt3B,IAEF03B,EAAsBvsE,KAAKkiC,EAC5B,CAOD,aALkB4D,GAAkBU,cAClCvnB,EACAstD,IAGWh2C,KAAKlkB,IAChB,QAAajN,IAATiN,QAAoCjN,IAAdiN,EAAK7M,KAC7B,OAEF,IAAI6mE,EAAa,IAAI1qD,GAAGtP,EAAK7M,KAAKrB,MAAM,EAAG,GAAI,MAAMihB,WACrD,OAAO/S,EAAK7M,KAAKrB,MAAM,EAAG,EAAIkoE,GAAYvmE,UAAU,GAExD,CAQa,MAkCP0mE,GAAc,CAClBn6D,EACA0jC,EAAoBtB,GACpBg4B,KAEA,IAAIz2B,EAASi2B,GAAkB55D,GAE/B,MAAO,CAAEyO,OADIorD,GAAsBl2B,EAAQy2B,EAAU12B,GACpCC,SAAQ,EASd02B,GAAmB,CAACxoC,EAAgBoB,KAC3CpB,EAAOgS,SAAS,UAClBhS,EAASA,EAAO//B,MAAM,GAAI,IAE5B,MAAMgyC,EAAWjS,EAAO9wB,MAAM,KAC9B,GAAwB,IAApB+iC,EAASx2C,OAAc,CACzB,MACMkR,EADShO,SAAOe,KAAK,CAAC0hC,GAAkB,IAAIx/B,WAC/BmF,OAAOkrC,EAAS,KAC3Br1B,OAAQs1B,GAAco2B,GAAYr2B,EAAS,IAMnD,MAAO,IALQq2B,GACb37D,EACAulC,EACA9Q,IAAW0mC,QAAAA,cAAcW,GAAKC,QAA4BxnE,GAExCixC,OAAO,EAAMN,OAAQK,EAC1C,CAAM,GAAwB,IAApBD,EAASx2C,QAAkB2lC,EAAQ,CAE5C,MAAQxkB,OAAQs1B,GAAco2B,GAAYr2B,EAAS,KAE3Cr1B,OAAQw1B,GAAWk2B,GAAY,KAAKvhE,OAAOkrC,EAAS,IAAKC,GAE3DG,EAAe1zC,EAAAA,OAAOe,KAAK,CAAC,IAAIkC,WAEtC,MAAO,IADQ0mE,GAAYj2B,EAAatrC,OAAOkrC,EAAS,IAAKG,GACzCD,OAAO,EAAMN,OAAQK,EAAWI,aAAa,EAClE,CAAM,GAAIL,EAASx2C,QAAU,EAC5B,MAAM,IAAIq2B,GAASD,kBAAU0gB,cAG/B,MAAO,IADQ+1B,GAAYtoC,EAAQuQ,IACf4B,OAAO,EAAON,YAAQ3wC,EAAW,QA+D1CynE,GAAoB,CAAC3oC,EAAgBmS,KAChD,MAAMv1B,OAAEA,EAAMi1B,OAAEA,GAAW22B,GAAiBxoC,GACtCioC,EAAsBF,GAAkBnrD,EAAOkkB,YAMrD,OAL6BknC,GAC3BC,EACAt3B,GACAwB,EAAQN,OAAS3wC,EAEQ,EAGhBk4D,GAAQ,CAAC5/C,EAAeovD,KACnC,IAAKpvD,EACH,MAAM,IAAIsY,GAAS82C,EACpB,kBCjNH,SAASC,GAAQz5D,EAAK05D,EAASz5D,EAAK05D,EAASC,GAC3C,IAAI7+C,GAAQ,GAAK4+C,GAAW,EACxBj0D,EAAM,EACNxE,EAAO,EACPrJ,EAAM,EAaV,GAZAmI,EAAIksB,SAAQ,SAAUx6B,GAKpB,IAHAgU,GAAOA,GAAOg0D,GAAWhoE,EACzBwP,GAAQw4D,EAEDx4D,GAAQy4D,GACbz4D,GAAQy4D,EACR15D,EAAIpI,GAAO6N,GAAOxE,EAAO6Z,EACzBljB,GAAO,CAEb,IAEM+hE,EACE14D,EAAO,IAGTjB,EAAIpI,GAAO6N,GAAOi0D,EAAUz4D,EAAO6Z,OAEhC,CAGL,GAAI7Z,GAAQw4D,EACV,MAAM,IAAIzsE,MAAM,sBAAsB0K,OAAOuJ,EAAM,UAAUvJ,OAAO+hE,EAAU,EAAG,cAGnF,GAAIh0D,GAAO,GAAKxE,IAAU,EACxB,MAAM,IAAIjU,MAAM,mBAEnB,CACH,CAtFA8C,OAAOiH,eAAe6iE,GAAS,aAAc,CAC3CprE,OAAO,IAEaorE,GAAAC,eAuCtB,SAAwB/tE,GACtB,OAA2B,IAAIe,WAAWf,EAC5C,EAxCgB8tE,GAAAE,SAqGhB,SAAkB/5D,EAAKkB,EAAMjB,GAC3B,GAAIiB,EAAO,GAAKA,EAAO,EACrB,MAAM,IAAIrR,WAAW,6CAIvB,OADA4pE,GAAQz5D,EAAKkB,EAA0BjB,EAAM,GAAG,GACzCA,CACT,EA3Gc45D,GAAAG,OAyFd,SAAgBh6D,EAAKkB,EAAMjB,GACzB,GAAIiB,EAAO,GAAKA,EAAO,EACrB,MAAM,IAAIrR,WAAW,6CAMvB,OADA4pE,GAA4Bz5D,EAAM,EAAGC,EAAKiB,GAAM,GACzCjB,CACT,YCvGAlQ,OAAOiH,eAAexG,GAAS,aAAc,CAC3C/B,OAAO,IAEc+B,GAAAypE,qBAAG,EACJzpE,GAAA0pE,eAmFtB,SAAwB1sE,EAAQgD,GAC9B,IAAI2pE,EAEJ,OAAQ3pE,GACN,IAAK,SACH2pE,EAAmB,EACnB,MAEF,IAAK,UACHA,EAAmBC,GACnB,MAEF,QACE,MAAMntE,MAAM,2BAA2B0K,OAAOnH,EAAU,iCAK5D,IAFA,IAAI8f,EAAM+pD,GAAQ7sE,GAAU2sE,EAEnBzuE,EAAI,EAAGA,EAAIuuE,GAAiBvuE,GAAK,EAAG,CAC3C,IAAIwa,EAAQ,GAAK,EAAIxa,GACrB8B,EAAOA,EAAOnB,OAAS4tE,GAAkBvuE,GAAK4kB,GAAOpK,EAAQ,EAC9D,CACH,EAxGc1V,GAAAgT,OAAGA,GACOhT,GAAA8pE,iBAmKxB,SAA0B7M,EAAQxuD,GAChC,IAAIlT,EAAMkT,EAAQ5S,OAAS,EAAIohE,EAAOphE,OAAS,EAC3C4T,GAAM,EAAIs6D,GAAcT,gBAAgB/tE,GAG5C,OAFAyuE,GAAa/M,EAAQxtD,EAAI/F,SAAS,EAAG,EAAIuzD,EAAOphE,OAAS,IACzDmX,GAAOvE,EAASgB,EAAI/F,SAAS,EAAIuzD,EAAOphE,OAAS,IAC1C4T,CACT,EAxKkBzP,GAAAiqE,WAsLlB,SAAoBx7D,GAKlB,IAJA,IAAIy7D,EAAqBhoE,UAAUrG,OAAS,QAAsByF,IAAjBY,UAAU,GAAmBA,UAAU,GAAK,UACzFioE,GAAe,EACfC,GAAe,EAEVlvE,EAAI,EAAGA,EAAIuT,EAAQ5S,OAAQX,GAAK,EAAG,CAC1C,IAAImvE,EAAM57D,EAAQhT,WAAWP,GAE7B,GAAImvE,EAAMC,IAAiBD,EAAME,GAC/B,MAAM,IAAI3qE,UAAU,mBAAmBuH,OAAO+iE,EAAoB,MAAM/iE,OAAOkjE,EAAK,MAAQ,4BAA4BljE,OAAOmjE,GAAe,KAAKnjE,OAAOojE,KAG5JH,EAAeA,GAAgBC,GAAO,IAAMA,GAAO,GACnDF,EAAeA,GAAgBE,GAAO,IAAMA,GAAO,GACpD,CAED,GAAIF,GAAgBC,EAClB,MAAM,IAAIxqE,UAAU,cAAcuH,OAAO+iE,IACpC,OAAIE,EACF,QACED,EACF,QAEA,IAEX,EA9McnqE,GAAA+S,OAgHd,SAAgB/V,GACd,OAAOA,EAAO6X,QAAO,SAAUK,EAAKxE,GAClC,OAAOwE,EAAMs1D,GAAQ95D,EACtB,GAAE,GACL,EAnHoB1Q,GAAAgqE,aAAGA,GACDhqE,GAAAyqE,eA2DtB,SAAwBztE,GACtB,OAAQ6sE,GAAQ7sE,IACd,KAAK,EACH,MAAO,SAET,KAAK4sE,GACH,MAAO,UAET,QACE,OAEN,EApEA,IAAIG,GAAgBrrE,GAGhB8rE,GAAU,mCAEVZ,GAAmB,UAEnBU,GAAgB,GAEhBC,GAAgB,IAChBd,GAAkB,EAECzpE,GAAAypE,gBAAGA,GAE1B,IAAIiB,GAAc,WAGhB,IAFA,IAAItuE,EAAS,IAAI8/B,IAERhhC,EAAI,EAAGA,EAAIsvE,GAAQ3uE,OAAQX,GAAK,EACvCkB,EAAOkL,IAAIkjE,GAAQtvE,GAAIA,GAGzB,OAAOkB,CACT,CARkB,GAWduuE,GAAM,CAAC,UAAY,UAAY,UAAY,WAAY,WAE3D,SAASd,GAAQv3D,GACf,OAAOA,EAAOuC,QAAO,SAAU+1D,EAAU3sE,GACvC,IAAIyS,EAAOk6D,GAAY,GACnBC,GAA0B,SAAXD,IAAyB,EAAI3sE,EAChD,OAAO0sE,GAAI91D,QAAO,SAAUi2D,EAAKC,EAAK7vE,GACpC,OAA2B,IAAnBwV,GAAQxV,EAAI,GAAW4vE,EAAMA,EAAMC,CAC5C,GAAEF,EACJ,GAED,EACF,CAMA,SAASb,GAAa/M,EAAQ+N,GAC5B,IAAK,IAAI9vE,EAAI,EAAGA,EAAI+hE,EAAOphE,OAAQX,GAAK,EAAG,CACzC,IAAIsB,EAAOygE,EAAOxhE,WAAWP,GAC7B8vE,EAAU9vE,GAAKsB,GAAQ,EACvBwuE,EAAU9vE,EAAI+hE,EAAOphE,OAAS,GAAY,GAAPW,CACpC,CAEDwuE,EAAU/N,EAAOphE,QAAU,CAC7B,CA8EA,SAASmX,GAAOvE,EAASgB,GAGvB,IAFA,IAAIw7D,EAAUx7D,IAAO,EAAIs6D,GAAcT,gBAAgB76D,EAAQ5S,QAEtDX,EAAI,EAAGA,EAAIuT,EAAQ5S,OAAQX,GAAK,EAAG,CAC1C,IAAIwZ,EAAMg2D,GAAYhkE,IAAI+H,EAAQvT,IAElC,QAAYoG,IAARoT,EACF,MAAM,IAAIjY,MAAM,4BAA4B0K,OAAOsH,EAAQvT,KAG7D+vE,EAAQ/vE,GAAKwZ,CACd,CAED,OAAOu2D,CACT,CC3JA1rE,OAAOiH,eAAeuxB,GAAS,aAAc,CAC3C95B,OAAO,IAEa85B,GAAAmzC,oBAAG,EACzB,IAAcC,GAAApzC,GAAA/kB,OAsMd,SAAgBvE,GACd,IAAI28D,EAAqBC,GAAkB58D,GACvCwuD,EAASmO,EAAmBnO,OAC5Bj9D,EAAWorE,EAAmBprE,SAC9BsrE,EAAWF,EAAmB1pE,KAElC,MAAO,CACLu7D,OAAQA,EACRj9D,SAAUA,EACV0B,KAAM6pE,GAAcD,GAExB,EAhNyBvzC,GAAAszC,kBAAGA,GAC5B,IAAcG,GAAAzzC,GAAAhlB,OA0Hd,SAAgBkqD,EAAQv7D,GACtB,IAAI1B,EAAWkC,UAAUrG,OAAS,QAAsByF,IAAjBY,UAAU,GAAmBA,UAAU,GAAK,SACnF,OAAOupE,GAAgBxO,EAAQyO,GAAYhqE,GAAO1B,EACpD,EA5HuB+3B,GAAA0zC,gBAAGA,GACL1zC,GAAAwzC,cAAGA,GACLxzC,GAAA2zC,YAAGA,GAEtB,IAAI3B,GAAgBrrE,GAEhBitE,GAAYhtE,GAIhB,SAASitE,GAAkB5jE,EAAQ6jE,GAAS,IAAK,IAAI3wE,EAAI,EAAGA,EAAI2wE,EAAMhwE,OAAQX,IAAK,CAAE,IAAI4wE,EAAaD,EAAM3wE,GAAI4wE,EAAWrlE,WAAaqlE,EAAWrlE,aAAc,EAAOqlE,EAAWx9D,cAAe,EAAU,UAAWw9D,IAAYA,EAAWz9D,UAAW,GAAM9O,OAAOiH,eAAewB,EAAQ8jE,EAAWj5C,IAAKi5C,GAAgB,CAK7T,IAAIC,GAAiB,GAiBrB,SAASL,GAAYl8D,EAAKC,GACxB,IAAIlU,EAAMwC,KAAKwhB,KAAkB,EAAb/P,EAAI3T,OAAa,GACjCovE,EAAUx7D,IAAO,EAAIs6D,GAAcT,gBAAgB/tE,GACvD,OAAO,EAAIwuE,GAAcP,QAAQh6D,EAAK,EAAGy7D,EAC3C,CAEA,SAASM,GAAc/7D,EAAKC,GAC1B,IAAIlU,EAAMwC,KAAKO,MAAmB,EAAbkR,EAAI3T,OAAa,GAClCovE,EAAUx7D,GAAO,IAAInT,WAAWf,GACpC,OAAO,EAAIwuE,GAAcR,UAAU/5D,EAAK,EAAGy7D,EAC7C,CA0BA,SAASQ,GAAgBxO,EAAQv7D,GAC/B,IAAIsqE,EAEAhsE,EAAWkC,UAAUrG,OAAS,QAAsByF,IAAjBY,UAAU,GAAmBA,UAAU,GAAK,SAE/E3G,EAAM,EAAI0hE,EAAOphE,OAAS,EAC5B6F,EAAK7F,OACL8vE,GAAUlC,gBAEZ,GAAIluE,EAAM0hE,EAAOphE,OAASkwE,GACxB,MAAM,IAAItvE,MAAM,2CAA2C0K,OAAO4kE,GAAgB,gBAGpF,IAAIE,EAA6E,QAA/DD,GAAc,EAAIL,GAAU1B,YAAYhN,EAAQ,iBAAuC,IAAhB+O,EAAyBA,EAAc,QAC5HhvE,GAAS,EAAI+sE,GAAcT,gBAAgB/tE,IAE/C,EAAIowE,GAAU3B,cAAc/M,EAAO36D,cAAetF,EAAO0M,SAAS,EAAG,EAAIuzD,EAAOphE,OAAS,IAExEmB,EAAO0M,SAAS,EAAIuzD,EAAOphE,OAAS,EAAGmB,EAAOnB,OAAS8vE,GAAUlC,iBACvEniE,IAAI5F,IAEf,EAAIiqE,GAAUjC,gBAAgB1sE,EAAQgD,GAEtC,IAAIksE,GAAU,EAAIP,GAAU54D,QAAQ/V,EAAO0M,SAAS,EAAIuzD,EAAOphE,OAAS,IAMxE,MAJmB,UAAfowE,IACFC,EAAUA,EAAQ/wC,eAGb,GAAGh0B,OAAO81D,EAAQ,KAAK91D,OAAO+kE,EACvC,CA2CA,SAASb,GAAkB58D,GAGzB,GAAIA,EAAQ5S,OAASkwE,GACnB,MAAM,IAAInsE,UAAU,yBAAyBuH,OAAO4kE,GAAgB,eAItE,EAAIJ,GAAU1B,YAAYx7D,GAE1B,IAAI09D,EAAe19D,EAAQnM,cAEvB8pE,EAASD,EAAa7oE,YAAY,KAEtC,GAAI8oE,EAAS,EACX,MAAM,IAAI3vE,MAAM,iCAIlB,GAAI2vE,EAAS39D,EAAQ5S,OAAS8vE,GAAUlC,gBAAkB,EACxD,MAAM,IAAIhtE,MAAM,gDAAgD0K,OAAOwkE,GAAUlC,gBAAiB,qBAGpG,IAAIxM,EAASkP,EAAaj8B,UAAU,EAAGk8B,GAGnCd,GAAW,EAAIK,GAAU7B,kBAAkB7M,EAAQkP,EAAaj8B,UAAUk8B,EAAS,IAEnFpsE,GAAW,EAAI2rE,GAAUlB,gBAAgBa,GAE7C,QAAiBhqE,IAAbtB,EACF,MAAM,IAAIvD,MAAM,oBAGlB,MAAO,CACLwgE,OAAQA,EACRj9D,SAAUA,EAEV0B,KAAM4pE,EAAS5hE,SAAS,EAAIuzD,EAAOphE,OAAS,EAAGyvE,EAASzvE,OAAS8vE,GAAUlC,iBAE/E,CA+BA,IAAIyB,GAA8B,WAChC,SAASA,EAAejO,EAAQoP,EAAe3qE,GAG7C,GAhNJ,SAAyBw5C,EAAUoxB,GAAe,KAAMpxB,aAAoBoxB,GAAgB,MAAM,IAAI1sE,UAAU,oCAAyC,CA8MrJ2sE,CAAgB/pE,KAAM0oE,GAEP,OAAXjO,GAA8B,OAAXA,EACrB,MAAM,IAAIxgE,MAAM,wDAGlB,GAAI4vE,EAAgB,GAAKA,EAAgB,GACvC,MAAM,IAAIhtE,WAAW,0DAGvB,GAAIqC,EAAK7F,OAAS,GAAK6F,EAAK7F,OAAS,GACnC,MAAM,IAAIwD,WAAW,iDAGvB,GAAsB,IAAlBgtE,GAAuC,KAAhB3qE,EAAK7F,QAAiC,KAAhB6F,EAAK7F,OACpD,MAAM,IAAIY,MAAM,qDAGlB+F,KAAKy6D,OAASA,EACdz6D,KAAK6pE,cAAgBA,EACrB7pE,KAAKd,KAAOA,CACb,CA/NH,IAAsB4qE,EAAaE,EAAYC,EAoU7C,OApUoBH,EAuOPpB,EAvOoBsB,EAuOJ,CAAC,CAC5B35C,IAAK,OACL50B,MAAO,WACL,GAA2B,IAAvBuE,KAAK6pE,cAIT,OAAQ7pE,KAAKd,KAAK7F,QAChB,KAAK,GACH,MAAO,SAET,KAAK,GACH,MAAO,QAGT,QACE,OAEL,GAUA,CACDg3B,IAAK,SACL50B,MAAO,WAIL,IAAI1C,EAAMwC,KAAKwhB,KAAwB,EAAnB/c,KAAKd,KAAK7F,OAAa,GACvC6wE,GAAY,EAAI3C,GAAcT,gBAAgB/tE,EAAM,GACxDmxE,EAAU,GAAKlqE,KAAK6pE,cACpBX,GAAYlpE,KAAKd,KAAMgrE,EAAUhjE,SAAS,IAC1C,IAAI1J,EAAkC,IAAvBwC,KAAK6pE,cAAsB,SAAW,UACrD,OAAOZ,GAAgBjpE,KAAKy6D,OAAQyP,EAAW1sE,EAChD,IA/Q0CysE,EAgRzC,CAAC,CACH55C,IAAK,SACL50B,MAyBA,SAAgBwQ,GACd,IAAIk+D,EAAsBtB,GAAkB58D,GACxCwuD,EAAS0P,EAAoB1P,OAC7Bv7D,EAAOirE,EAAoBjrE,KAC3B1B,EAAW2sE,EAAoB3sE,SAGnC,GAAe,OAAXi9D,GAA8B,OAAXA,EACrB,MAAM,IAAIxgE,MAAM,wDAGlB,IAAI4vE,EAAgB3qE,EAAK,GAEzB,GAAsB,IAAlB2qE,GAAoC,WAAbrsE,EACzB,MAAMvD,MAAM,uBAAuB0K,OAAOnH,EAAU,+BAGtD,GAAIqsE,EAAgB,GAAkB,YAAbrsE,EACvB,MAAMvD,MAAM,uBAAuB0K,OAAOnH,EAAU,sBAAsBmH,OAAOklE,EAAe,YAGlG,OAAO,IAAI7pE,KAAKy6D,EAAQoP,EAAed,GAAc7pE,EAAKgI,SAAS,IACpE,IAjU6D8iE,GAAYZ,GAAkBU,EAAY7sE,UAAW+sE,GAAiBC,GAAab,GAAkBU,EAAaG,GAAcltE,OAAOiH,eAAe8lE,EAAa,YAAa,CAAEj+D,UAAU,IAoUrP68D,CACT,CA7HkC,GA+HlCnzC,GAAAmzC,eAAyBA,gCC5VxB,SAAUtT,GAKP,MAAMgV,EAAW,uBACXC,EAAc,CAChBC,UAAW,IAAItzB,OAAQ,IAAGozB,OAAcA,OAAcA,OAAcA,KAAa,KACjFG,WAAY,IAAIvzB,OAAQ,IAAGozB,OAAcA,OAAcA,KAAa,KACpEI,SAAU,IAAIxzB,OAAQ,IAAGozB,OAAcA,KAAa,KACpDK,UAAW,IAAIzzB,OAAQ,IAAGozB,KAAa,MAIrCM,EAAa,IAAI1zB,OAAQ,YAAY,KACrC2zB,EAAW,IAAI3zB,OAAQ,gBAAgB,KAEvC4zB,EAAY,gBAMZC,EAAW,oBACXC,EAAc,CAChBF,UAAW,IAAI5zB,OAAO4zB,EAAW,KACjCG,OAAU,IAAI/zB,OAAQ,UAAS6zB,wBAA+BD,OAAgB,KAC9EI,uBAAwB,IAAIh0B,OAAQ,WAAUozB,OAAcA,OAAcA,OAAcA,KAAYQ,QAAiB,KACrHK,aAAc,IAAIj0B,OAAQ,QAAO6zB,eAAsBA,OAAcT,OAAcA,OAAcA,OAAcA,KAAYQ,OAAgB,MAI/I,SAASM,EAAY3tE,EAAQhE,GAEzB,GAAIgE,EAAOrD,QAAQ,QAAUqD,EAAOuD,YAAY,MAC5C,OAAO,KAGX,IAGIqqE,EAAaC,EAHbC,EAAa,EACbC,GAAa,EACbC,GAAUhuE,EAAOswC,MAAMi9B,EAAYF,YAAc,IAAI,GAUzD,IANIW,IACAA,EAASA,EAAO79B,UAAU,GAC1BnwC,EAASA,EAAO+H,QAAQ,OAAQ,MAI5BgmE,EAAY/tE,EAAOrD,QAAQ,IAAKoxE,EAAY,KAAO,GACvDD,IAaJ,GAT4B,OAAxB9tE,EAAOuE,OAAO,EAAG,IACjBupE,IAGyB,OAAzB9tE,EAAOuE,QAAQ,EAAG,IAClBupE,IAIAA,EAAa9xE,EACb,OAAO,KAMX,IAFA6xE,EAAmB7xE,EAAQ8xE,EAC3BF,EAAc,IACPC,KACHD,GAAe,KA2BnB,MAnBkB,OAJlB5tE,EAASA,EAAO+H,QAAQ,KAAM6lE,IAInB,KACP5tE,EAASA,EAAOM,MAAM,IAGQ,MAA9BN,EAAOA,EAAOlE,OAAS,KACvBkE,EAASA,EAAOM,MAAM,GAAI,IAG9BtE,EAAS,WACL,MAAMiyE,EAAMjuE,EAAOuP,MAAM,KACnB2+D,EAAU,GAEhB,IAAK,IAAI/yE,EAAI,EAAGA,EAAI8yE,EAAInyE,OAAQX,IAC5B+yE,EAAQ/xE,KAAKmI,SAAS2pE,EAAI9yE,GAAI,KAGlC,OAAO+yE,CACnB,CATiB,GAWF,CACHlyE,MAAOA,EACPgyE,OAAQA,EAEf,CAGD,SAASG,EAAWtjE,EAAOujE,EAAQC,EAAUC,GACzC,GAAIzjE,EAAM/O,SAAWsyE,EAAOtyE,OACxB,MAAM,IAAIY,MAAM,gEAGpB,IACIiZ,EADA44D,EAAO,EAGX,KAAOD,EAAW,GAAG,CAMjB,GALA34D,EAAQ04D,EAAWC,EACf34D,EAAQ,IACRA,EAAQ,GAGR9K,EAAM0jE,IAAS54D,GAAUy4D,EAAOG,IAAS54D,EACzC,OAAO,EAGX24D,GAAYD,EACZE,GAAQ,CACX,CAED,OAAO,CACV,CAED,SAASC,EAAcxuE,GAEnB,GAAIotE,EAAS7yB,KAAKv6C,GACd,OAAOsE,SAAStE,EAAQ,IAK5B,GAAkB,MAAdA,EAAO,KAAe1B,MAAMgG,SAAStE,EAAO,GAAI,KAAM,CAC1D,GAAImtE,EAAW5yB,KAAKv6C,GAChB,OAAOsE,SAAStE,EAAQ,GAExB,MAAM,IAAItD,MAAO,wBAAuBsD,aAC3C,CAED,OAAOsE,SAAStE,EAAQ,GAC3B,CAED,SAASyuE,EAASF,EAAMzyE,GACpB,KAAOyyE,EAAKzyE,OAASA,GACjByyE,EAAQ,IAAGA,IAGf,OAAOA,CACV,CAED,MAAMG,EAAS,CAAA,EAGfA,EAAOC,KAAQ,WAIX,SAASA,EAAMC,GACX,GAAsB,IAAlBA,EAAO9yE,OACP,MAAM,IAAIY,MAAM,wCAGpB,IAAIvB,EAAG0zE,EAEP,IAAK1zE,EAAI,EAAGA,EAAIyzE,EAAO9yE,OAAQX,IAE3B,GADA0zE,EAAQD,EAAOzzE,KACR,GAAK0zE,GAASA,GAAS,KAC1B,MAAM,IAAInyE,MAAM,2CAIxB+F,KAAKmsE,OAASA,CACjB,CAyHD,OArHAD,EAAKjvE,UAAUovE,cAAgB,CAC3BC,YAAa,CAAC,CAAC,IAAIJ,EAAK,CAAC,EAAG,EAAG,EAAG,IAAK,IACvCK,UAAW,CAAC,CAAC,IAAIL,EAAK,CAAC,IAAK,IAAK,IAAK,MAAO,KAE7CM,UAAW,CAAC,CAAC,IAAIN,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAEvCO,UAAW,CAAC,CAAC,IAAIP,EAAK,CAAC,IAAK,IAAK,EAAG,IAAK,KAEzCQ,SAAU,CAAC,CAAC,IAAIR,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAEtCS,gBAAiB,CAAC,CAAC,IAAIT,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,KAE9CU,QAAW,CACP,CAAC,IAAIV,EAAK,CAAC,GAAI,EAAG,EAAG,IAAK,GAC1B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,IAC5B,CAAC,IAAIA,EAAK,CAAC,IAAK,IAAK,EAAG,IAAK,KAGjCW,SAAU,CACN,CAAC,IAAIX,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAC3B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,IAC3B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,GAAI,IAAK,IAC7B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,EAAG,IAAK,IAC5B,CAAC,IAAIA,EAAK,CAAC,IAAK,GAAI,IAAK,IAAK,IAC9B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,IAAK,IAAK,IAC7B,CAAC,IAAIA,EAAK,CAAC,IAAK,EAAG,EAAG,IAAK,KAKnCA,EAAKjvE,UAAUg8B,KAAO,WAClB,MAAO,QAIXizC,EAAKjvE,UAAU4wC,MAAQ,SAAUi/B,EAAOC,GACpC,IAAIvB,EAOJ,QANkB1sE,IAAdiuE,IACAvB,EAAMsB,EACNA,EAAQtB,EAAI,GACZuB,EAAYvB,EAAI,IAGC,SAAjBsB,EAAM7zC,OACN,MAAM,IAAIh/B,MAAM,uDAGpB,OAAOyxE,EAAU1rE,KAAKmsE,OAAQW,EAAMX,OAAQ,EAAGY,IAMnDb,EAAKjvE,UAAU+vE,2BAA6B,WACxC,IAAIC,EAAO,EAEPj4B,GAAO,EAEX,MAAMk4B,EAAY,CACd,EAAG,EACH,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,GAET,IAAIx0E,EAAG0zE,EAAOtuD,EAEd,IAAKplB,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAExB,GADA0zE,EAAQpsE,KAAKmsE,OAAOzzE,KAChB0zE,KAASc,GAYT,OAAO,KAVP,GADApvD,EAAQovD,EAAUd,GACdp3B,GAAkB,IAAVl3B,EACR,OAAO,KAGG,IAAVA,IACAk3B,GAAO,GAGXi4B,GAAQnvD,CAIf,CAED,OAAO,GAAKmvD,GAIhBf,EAAKjvE,UAAUkP,MAAQ,WACnB,OAAO8/D,EAAOkB,YAAYntE,KAAMA,KAAKqsE,gBAIzCH,EAAKjvE,UAAUzE,YAAc,WACzB,OAAOwH,KAAKmsE,OAAOtuE,MAAM,IAI7BquE,EAAKjvE,UAAUmwE,oBAAsB,WACjC,OAAOnB,EAAOoB,KAAKC,MAAO,UAASttE,KAAKR,eAI5C0sE,EAAKjvE,UAAUswE,mBAAqB,WAChC,OAAOvtE,KAAKR,YAIhB0sE,EAAKjvE,UAAUuC,SAAW,WACtB,OAAOQ,KAAKmsE,OAAOtyE,KAAK,MAGrBqyE,CACf,CA7ImB,GAgJfD,EAAOC,KAAKsB,yBAA2B,SAAUjwE,GAE7C,IACI,MAAM0vE,EAAOjtE,KAAKytE,UAAUlwE,GACtBmwE,EAAoBT,EAAK,GAAGz0E,cAC5Bm1E,EAAmB3tE,KAAK4tE,2BAA2BX,EAAK,IAAIz0E,cAC5D2zE,EAAS,GACf,IAAIzzE,EAAI,EACR,KAAOA,EAAI,GAEPyzE,EAAOzyE,KAAKmI,SAAS6rE,EAAkBh1E,GAAI,IAA0C,IAApCmJ,SAAS8rE,EAAiBj1E,GAAI,KAC/EA,IAGJ,OAAO,IAAIsH,KAAKmsE,EACnB,CAAC,MAAOtxE,GACL,MAAM,IAAIZ,MAAM,qDACnB,GAILgyE,EAAOC,KAAK2B,OAAS,SAAUtwE,GAC3B,OAA+B,OAAxByC,KAAK8tE,OAAOvwE,IAIvB0uE,EAAOC,KAAK6B,QAAU,SAAUxwE,GAC5B,IAEI,OADA,IAAIyC,KAAKA,KAAK8tE,OAAOvwE,KACd,CACV,CAAC,MAAO1C,GACL,OAAO,CACV,GAILoxE,EAAOC,KAAK8B,uBAAyB,SAAUzwE,GAC3C,SAAI0uE,EAAOC,KAAK6B,QAAQxwE,KAAWA,EAAOswC,MAAM,uCAQpDo+B,EAAOC,KAAK+B,uBAAyB,SAAU1wE,GAC3C,IAAI0vE,EAAMv0E,EAAGg1E,EAAmBvB,EAAQwB,EAExC,IAMI,IALAV,EAAOjtE,KAAKytE,UAAUlwE,GACtBmwE,EAAoBT,EAAK,GAAGz0E,cAC5Bm1E,EAAmB3tE,KAAK4tE,2BAA2BX,EAAK,IAAIz0E,cAC5D2zE,EAAS,GACTzzE,EAAI,EACGA,EAAI,GAEPyzE,EAAOzyE,KAAKmI,SAAS6rE,EAAkBh1E,GAAI,IAAMmJ,SAAS8rE,EAAiBj1E,GAAI,KAC/EA,IAGJ,OAAO,IAAIsH,KAAKmsE,EACnB,CAAC,MAAOtxE,GACL,MAAM,IAAIZ,MAAM,qDACnB,GAKLgyE,EAAOC,KAAKoB,MAAQ,SAAU/vE,GAC1B,MAAMhE,EAAQyG,KAAK8tE,OAAOvwE,GAE1B,GAAc,OAAVhE,EACA,MAAM,IAAIU,MAAM,wDAGpB,OAAO,IAAI+F,KAAKzG,IAIpB0yE,EAAOC,KAAKuB,UAAY,SAAUlwE,GAC9B,IAAIswC,EAEJ,GAAKA,EAAQtwC,EAAOswC,MAAM,iBAAmB,CACzC,MAAMqgC,EAAarsE,SAASgsC,EAAM,IAClC,GAAIqgC,GAAc,GAAKA,GAAc,GAAI,CACrC,MAAMtsE,EAAS,CAAC5B,KAAKstE,MAAMz/B,EAAM,IAAKqgC,GAMtC,OALAnxE,OAAOiH,eAAepC,EAAQ,WAAY,CACtCnG,MAAO,WACH,OAAOuE,KAAKnG,KAAK,IACpB,IAEE+H,CACV,CACJ,CAED,MAAM,IAAI3H,MAAM,4DAMpBgyE,EAAOC,KAAK4B,OAAS,SAAUvwE,GAC3B,IAAIswC,EAAOi+B,EAAMrwE,EAGjB,GAAKoyC,EAAQtwC,EAAOswC,MAAMw8B,EAAYC,WAClC,OAAQ,WACJ,MAAMkB,EAAM39B,EAAMhwC,MAAM,EAAG,GACrB4tE,EAAU,GAEhB,IAAK,IAAI/yE,EAAI,EAAGA,EAAI8yE,EAAInyE,OAAQX,IAC5BozE,EAAON,EAAI9yE,GACX+yE,EAAQ/xE,KAAKqyE,EAAaD,IAG9B,OAAOL,CACvB,CAVoB,GAWL,GAAK59B,EAAQtwC,EAAOswC,MAAMw8B,EAAYI,WAAa,CAEtD,GADAhvE,EAAQswE,EAAal+B,EAAM,IACvBpyC,EAAQ,YAAcA,EAAQ,EAC9B,MAAM,IAAIxB,MAAM,yCAGpB,OAAS,WACL,MAAMwxE,EAAU,GAChB,IAAIv4D,EAEJ,IAAKA,EAAQ,EAAGA,GAAS,GAAIA,GAAS,EAClCu4D,EAAQ/xE,KAAM+B,GAASyX,EAAS,KAGpC,OAAOu4D,CACvB,CATqB,GASHh1D,SAClB,CAAe,OAAKo3B,EAAQtwC,EAAOswC,MAAMw8B,EAAYG,WACjC,WACJ,MAAMgB,EAAM39B,EAAMhwC,MAAM,EAAG,GACrB4tE,EAAU,GAGhB,GADAhwE,EAAQswE,EAAaP,EAAI,IACrB/vE,EAAQ,UAAYA,EAAQ,EAC5B,MAAM,IAAIxB,MAAM,yCAQpB,OALAwxE,EAAQ/xE,KAAKqyE,EAAaP,EAAI,KAC9BC,EAAQ/xE,KAAM+B,GAAS,GAAM,KAC7BgwE,EAAQ/xE,KAAM+B,GAAU,EAAK,KAC7BgwE,EAAQ/xE,KAAqB,IAAf+B,GAEPgwE,CACvB,CAfoB,IAgBA59B,EAAQtwC,EAAOswC,MAAMw8B,EAAYE,aACjC,WACJ,MAAMiB,EAAM39B,EAAMhwC,MAAM,EAAG,GACrB4tE,EAAU,GAGhB,GADAhwE,EAAQswE,EAAaP,EAAI,IACrB/vE,EAAQ,OAAUA,EAAQ,EAC1B,MAAM,IAAIxB,MAAM,yCAQpB,OALAwxE,EAAQ/xE,KAAKqyE,EAAaP,EAAI,KAC9BC,EAAQ/xE,KAAKqyE,EAAaP,EAAI,KAC9BC,EAAQ/xE,KAAM+B,GAAS,EAAK,KAC5BgwE,EAAQ/xE,KAAoB,IAAd+B,GAEPgwE,CACvB,CAfoB,GAiBD,MAKfQ,EAAOC,KAAK0B,2BAA6B,SAAUnT,GAE/C,IADAA,EAAS54D,SAAS44D,IACL,GAAKA,EAAS,GACvB,MAAM,IAAIxgE,MAAM,sCAGpB,MAAMkyE,EAAS,CAAC,EAAG,EAAG,EAAG,GACzB,IAAI5qE,EAAI,EACR,MAAM4sE,EAAmB5yE,KAAKO,MAAM2+D,EAAS,GAE7C,KAAOl5D,EAAI4sE,GACPhC,EAAO5qE,GAAK,IACZA,IAOJ,OAJI4sE,EAAmB,IACnBhC,EAAOgC,GAAoB5yE,KAAKC,IAAI,EAAGi/D,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAIz6D,KAAKmsE,IAIpBF,EAAOoB,KAAQ,WAIX,SAASA,EAAM9zE,EAAOgyE,GAClB,IAAI7yE,EAAGozE,EAEP,GAAqB,KAAjBvyE,EAAMF,OAEN,IADA2G,KAAKzG,MAAQ,GACRb,EAAI,EAAGA,GAAK,GAAIA,GAAK,EACtBsH,KAAKzG,MAAMG,KAAMH,EAAMb,IAAM,EAAKa,EAAMb,EAAI,QAE7C,IAAqB,IAAjBa,EAAMF,OAGb,MAAM,IAAIY,MAAM,6CAFhB+F,KAAKzG,MAAQA,CAGhB,CAED,IAAKb,EAAI,EAAGA,EAAIsH,KAAKzG,MAAMF,OAAQX,IAE/B,GADAozE,EAAO9rE,KAAKzG,MAAMb,KACX,GAAKozE,GAAQA,GAAQ,OACxB,MAAM,IAAI7xE,MAAM,2CAIpBsxE,IACAvrE,KAAKurE,OAASA,EAErB,CAuND,OApNA8B,EAAKpwE,UAAUovE,cAAgB,CAE3BC,YAAa,CAAC,IAAIe,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KAClDZ,UAAW,CAAC,IAAIY,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACrDb,UAAW,CAAC,IAAIa,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GACrDX,SAAU,CAAC,IAAIW,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KAC/Ce,YAAa,CAAC,IAAIf,EAAK,CAAC,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,GACvDgB,WAAY,CAAC,IAAIhB,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,IAAK,IAEtDiB,QAAS,CAAC,IAAIjB,EAAK,CAAC,EAAG,EAAG,EAAG,EAAG,MAAQ,EAAG,EAAG,IAAK,IAEnDkB,QAAS,CAAC,IAAIlB,EAAK,CAAC,IAAM,MAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAEtD,OAAQ,CAAC,IAAIA,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElDmB,OAAQ,CAAC,IAAInB,EAAK,CAAC,KAAQ,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAElDR,SAAU,CAAC,CAAC,IAAIQ,EAAK,CAAC,KAAQ,KAAO,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KACzDoB,aAAc,CAAC,IAAIpB,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IAC1DqB,IAAK,CAAC,IAAIrB,EAAK,CAAC,KAAQ,EAAK,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACjDsB,QAAS,CAAC,IAAItB,EAAK,CAAC,KAAQ,EAAK,IAAO,EAAG,EAAG,EAAG,EAAG,IAAK,IACzDuB,WAAY,CAAC,IAAIvB,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,IACzDwB,QAAS,CAAC,IAAIxB,EAAK,CAAC,KAAQ,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,KAI1DA,EAAKpwE,UAAU6xE,oBAAsB,WACjC,MAAwB,eAAjB9uE,KAAKmM,SAIhBkhE,EAAKpwE,UAAUg8B,KAAO,WAClB,MAAO,QAIXo0C,EAAKpwE,UAAU4wC,MAAQ,SAAUi/B,EAAOC,GACpC,IAAIvB,EAQJ,QANkB1sE,IAAdiuE,IACAvB,EAAMsB,EACNA,EAAQtB,EAAI,GACZuB,EAAYvB,EAAI,IAGC,SAAjBsB,EAAM7zC,OACN,MAAM,IAAIh/B,MAAM,uDAGpB,OAAOyxE,EAAU1rE,KAAKzG,MAAOuzE,EAAMvzE,MAAO,GAAIwzE,IAMlDM,EAAKpwE,UAAU+vE,2BAA6B,WACxC,IAAIC,EAAO,EAEPj4B,GAAO,EAEX,MAAMk4B,EAAY,CACd,EAAG,GACH,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,GACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,EACP,MAAO,GAEX,IAAIpB,EAAMhuD,EAEV,IAAK,IAAIplB,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAE5B,GADAozE,EAAO9rE,KAAKzG,MAAMb,KACdozE,KAAQoB,GAYR,OAAO,KAVP,GADApvD,EAAQovD,EAAUpB,GACd92B,GAAkB,IAAVl3B,EACR,OAAO,KAGG,KAAVA,IACAk3B,GAAO,GAGXi4B,GAAQnvD,CAIf,CAED,OAAO,IAAMmvD,GAKjBI,EAAKpwE,UAAUkP,MAAQ,WACnB,OAAO8/D,EAAOkB,YAAYntE,KAAMA,KAAKqsE,gBAIzCgB,EAAKpwE,UAAUzE,YAAc,WACzB,IAAIszE,EACJ,MAAM1lE,EAAQ,GACRolE,EAAMxrE,KAAKzG,MACjB,IAAK,IAAIb,EAAI,EAAGA,EAAI8yE,EAAInyE,OAAQX,IAC5BozE,EAAON,EAAI9yE,GACX0N,EAAM1M,KAAKoyE,GAAQ,GACnB1lE,EAAM1M,KAAY,IAAPoyE,GAGf,OAAO1lE,GAKXinE,EAAKpwE,UAAU8xE,oBAAsB,WACjC,MAAMC,EAAS,WACX,MAAMvD,EAAU,GAChB,IAAK,IAAI/yE,EAAI,EAAGA,EAAIsH,KAAKzG,MAAMF,OAAQX,IACnC+yE,EAAQ/xE,KAAKsyE,EAAQhsE,KAAKzG,MAAMb,GAAG8G,SAAS,IAAK,IAGrD,OAAOisE,CACV,EAAE5qE,KAAKb,MAAOnG,KAAK,KAEpB,IAAIo1E,EAAS,GAMb,OAJIjvE,KAAKurE,SACL0D,EAAU,IAAGjvE,KAAKurE,UAGfyD,EAAOC,GAKlB5B,EAAKpwE,UAAUiyE,cAAgB,WAC3B,IAAKlvE,KAAK8uE,sBACN,MAAM,IAAI70E,MAAM,4DAGpB,MAAMuxE,EAAMxrE,KAAKzG,MAAMsE,OAAO,GACxBsxE,EAAO3D,EAAI,GACXrW,EAAMqW,EAAI,GAEhB,OAAO,IAAIS,EAAOC,KAAK,CAACiD,GAAQ,EAAU,IAAPA,EAAaha,GAAO,EAAS,IAANA,KAO9DkY,EAAKpwE,UAAUswE,mBAAqB,WAChC,MAAMyB,EAAS,WACX,MAAMvD,EAAU,GAEhB,IAAK,IAAI/yE,EAAI,EAAGA,EAAIsH,KAAKzG,MAAMF,OAAQX,IACnC+yE,EAAQ/xE,KAAKsG,KAAKzG,MAAMb,GAAG8G,SAAS,KAGxC,OAAOisE,CACV,EAAE5qE,KAAKb,MAAOnG,KAAK,KAEpB,IAAIo1E,EAAS,GAMb,OAJIjvE,KAAKurE,SACL0D,EAAU,IAAGjvE,KAAKurE,UAGfyD,EAAOC,GAMlB5B,EAAKpwE,UAAUmyE,gBAAkB,WAC7B,MAAMC,EAAQ,uBACR9xE,EAASyC,KAAKutE,qBACpB,IAEI1/B,EAFAyhC,EAAiB,EACjBC,GAAmB,EAGvB,KAAQ1hC,EAAQwhC,EAAMG,KAAKjyE,IACnBswC,EAAM,GAAGx0C,OAASk2E,IAClBD,EAAiBzhC,EAAM5xB,MACvBszD,EAAkB1hC,EAAM,GAAGx0C,QAInC,OAAIk2E,EAAkB,EACXhyE,EAGH,GAAEA,EAAOmwC,UAAU,EAAG4hC,OAAoB/xE,EAAOmwC,UAAU4hC,EAAiBC,MAMxFlC,EAAKpwE,UAAUuC,SAAW,WACtB,OAAOQ,KAAKovE,mBAGT/B,CAEf,CArPmB,GAwPfpB,EAAOoB,KAAKG,yBAA2B,SAAUjwE,GAC7C,IACI,MAAM0vE,EAAOjtE,KAAKytE,UAAUlwE,GACtBmwE,EAAoBT,EAAK,GAAGz0E,cAC5Bm1E,EAAmB3tE,KAAK4tE,2BAA2BX,EAAK,IAAIz0E,cAC5D2zE,EAAS,GACf,IAAIzzE,EAAI,EACR,KAAOA,EAAI,IAEPyzE,EAAOzyE,KAAKmI,SAAS6rE,EAAkBh1E,GAAI,IAA0C,IAApCmJ,SAAS8rE,EAAiBj1E,GAAI,KAC/EA,IAGJ,OAAO,IAAIsH,KAAKmsE,EACnB,CAAC,MAAOtxE,GACL,MAAM,IAAIZ,MAAO,uDAAsDY,KAC1E,GAILoxE,EAAOoB,KAAKoC,OAAS,SAAUlyE,GAC3B,OAA+B,OAAxByC,KAAK8tE,OAAOvwE,IAIvB0uE,EAAOoB,KAAKU,QAAU,SAAUxwE,GAI5B,GAAsB,iBAAXA,IAAgD,IAAzBA,EAAOrD,QAAQ,KAC7C,OAAO,EAGX,IACI,MAAM80E,EAAOhvE,KAAK8tE,OAAOvwE,GAEzB,OADA,IAAIyC,KAAKgvE,EAAKz1E,MAAOy1E,EAAKzD,SACnB,CACV,CAAC,MAAO1wE,GACL,OAAO,CACV,GAILoxE,EAAOoB,KAAKY,uBAAyB,SAAU1wE,GAC3C,IAAI0vE,EAAMv0E,EAAGg1E,EAAmBvB,EAAQwB,EAExC,IAMI,IALAV,EAAOjtE,KAAKytE,UAAUlwE,GACtBmwE,EAAoBT,EAAK,GAAGz0E,cAC5Bm1E,EAAmB3tE,KAAK4tE,2BAA2BX,EAAK,IAAIz0E,cAC5D2zE,EAAS,GACTzzE,EAAI,EACGA,EAAI,IAEPyzE,EAAOzyE,KAAKmI,SAAS6rE,EAAkBh1E,GAAI,IAAMmJ,SAAS8rE,EAAiBj1E,GAAI,KAC/EA,IAGJ,OAAO,IAAIsH,KAAKmsE,EACnB,CAAC,MAAOtxE,GACL,MAAM,IAAIZ,MAAO,uDAAsDY,KAC1E,GAKLoxE,EAAOoB,KAAKC,MAAQ,SAAU/vE,GAC1B,MAAMyxE,EAAOhvE,KAAK8tE,OAAOvwE,GAEzB,GAAmB,OAAfyxE,EAAKz1E,MACL,MAAM,IAAIU,MAAM,wDAGpB,OAAO,IAAI+F,KAAKgvE,EAAKz1E,MAAOy1E,EAAKzD,SAGrCU,EAAOoB,KAAKI,UAAY,SAAUlwE,GAC9B,IAAI2wE,EAAYrgC,EAAOjsC,EAEvB,IAAKisC,EAAQtwC,EAAOswC,MAAM,oBACtBqgC,EAAarsE,SAASgsC,EAAM,IACxBqgC,GAAc,GAAKA,GAAc,KAOjC,OANAtsE,EAAS,CAAC5B,KAAKstE,MAAMz/B,EAAM,IAAKqgC,GAChCnxE,OAAOiH,eAAepC,EAAQ,WAAY,CACtCnG,MAAO,WACH,OAAOuE,KAAKnG,KAAK,IACpB,IAEE+H,EAIf,MAAM,IAAI3H,MAAM,4DAIpBgyE,EAAOoB,KAAKS,OAAS,SAAUvwE,GAC3B,IAAIyxE,EAAMt2E,EAAGm1C,EAAOu+B,EAAOD,EAAQZ,EAEnC,GAAK19B,EAAQtwC,EAAOswC,MAAMi9B,EAAYE,wBAClC,OAAOhrE,KAAK8tE,OAAQ,UAASjgC,EAAM,MAEvC,GAAIi9B,EAAYC,OAAOjzB,KAAKv6C,GACxB,OAAO2tE,EAAW3tE,EAAQ,GAE9B,IAAKswC,EAAQtwC,EAAOswC,MAAMi9B,EAAYG,iBAClCM,EAAS19B,EAAM,IAAM,GACrBmhC,EAAO9D,EAAWr9B,EAAM,GAAGhwC,MAAM,GAAI,GAAK0tE,EAAQ,GAC9CyD,EAAKz1E,OAAO,CAOZ,IANA4yE,EAAS,CACLtqE,SAASgsC,EAAM,IACfhsC,SAASgsC,EAAM,IACfhsC,SAASgsC,EAAM,IACfhsC,SAASgsC,EAAM,KAEdn1C,EAAI,EAAGA,EAAIyzE,EAAO9yE,OAAQX,IAE3B,GADA0zE,EAAQD,EAAOzzE,KACR,GAAK0zE,GAASA,GAAS,KAC1B,OAAO,KAMf,OAFA4C,EAAKz1E,MAAMG,KAAKyyE,EAAO,IAAM,EAAIA,EAAO,IACxC6C,EAAKz1E,MAAMG,KAAKyyE,EAAO,IAAM,EAAIA,EAAO,IACjC,CACH5yE,MAAOy1E,EAAKz1E,MACZgyE,OAAQyD,EAAKzD,OAEpB,CAGL,OAAO,MAIXU,EAAOoB,KAAKO,2BAA6B,SAAUnT,GAE/C,IADAA,EAAS54D,SAAS44D,IACL,GAAKA,EAAS,IACvB,MAAM,IAAIxgE,MAAM,sCAGpB,MAAMkyE,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC7D,IAAI5qE,EAAI,EACR,MAAM4sE,EAAmB5yE,KAAKO,MAAM2+D,EAAS,GAE7C,KAAOl5D,EAAI4sE,GACPhC,EAAO5qE,GAAK,IACZA,IAOJ,OAJI4sE,EAAmB,KACnBhC,EAAOgC,GAAoB5yE,KAAKC,IAAI,EAAGi/D,EAAS,GAAK,GAAK,EAAKA,EAAS,GAGrE,IAAIz6D,KAAKmsE,IAIpBF,EAAO9yE,cAAgB,SAAUiN,GAC7B,MAAM/M,EAAS+M,EAAM/M,OAErB,GAAe,IAAXA,EACA,OAAO,IAAI4yE,EAAOC,KAAK9lE,GACpB,GAAe,KAAX/M,EACP,OAAO,IAAI4yE,EAAOoB,KAAKjnE,GAEvB,MAAM,IAAInM,MAAM,iEAKxBgyE,EAAO8B,QAAU,SAAUxwE,GACvB,OAAO0uE,EAAOoB,KAAKU,QAAQxwE,IAAW0uE,EAAOC,KAAK6B,QAAQxwE,IAM9D0uE,EAAOqB,MAAQ,SAAU/vE,GACrB,GAAI0uE,EAAOoB,KAAKU,QAAQxwE,GACpB,OAAO0uE,EAAOoB,KAAKC,MAAM/vE,GACtB,GAAI0uE,EAAOC,KAAK6B,QAAQxwE,GAC3B,OAAO0uE,EAAOC,KAAKoB,MAAM/vE,GAEzB,MAAM,IAAItD,MAAM,yDAMxBgyE,EAAOwB,UAAY,SAAUlwE,GACzB,IACI,OAAO0uE,EAAOoB,KAAKI,UAAUlwE,EAChC,CAAC,MAAO1C,GACL,IACI,OAAOoxE,EAAOC,KAAKuB,UAAUlwE,EAChC,CAAC,MAAOmyE,GACL,MAAM,IAAIz1E,MAAM,4DACnB,CACJ,GAILgyE,EAAO5vB,QAAU,SAAU9+C,GACvB,MAAMyxE,EAAOhvE,KAAKstE,MAAM/vE,GAExB,MAAoB,SAAhByxE,EAAK/1C,QAAqB+1C,EAAKF,sBACxBE,EAAKE,gBAELF,GAOf/C,EAAOkB,YAAc,SAAUv0D,EAAS+2D,EAAWC,GAC/C,IAAIl3E,EAAGm3E,EAAWC,EAAcC,EAMhC,IAAKF,KAJDD,UACAA,EAAc,WAGAD,EACd,GAAI5yE,OAAOE,UAAUkT,eAAetP,KAAK8uE,EAAWE,GAOhD,IANAC,EAAeH,EAAUE,IAErBC,EAAa,IAAQA,EAAa,aAAc/1E,QAChD+1E,EAAe,CAACA,IAGfp3E,EAAI,EAAGA,EAAIo3E,EAAaz2E,OAAQX,IAEjC,GADAq3E,EAASD,EAAap3E,GAClBkgB,EAAQqgB,SAAW82C,EAAO,GAAG92C,QAAUrgB,EAAQi1B,MAAMtqC,MAAMqV,EAASm3D,GACpE,OAAOF,EAMvB,OAAOD,GAI0B90D,GAAOxe,QACxCwe,GAAAxe,QAAiB2vE,EAGjB7W,EAAK6W,OAASA,CAGrB,CAv+BA,CAu+BCjsE,wBCp+BF,MAAMgwE,GAAS,WAGTz0D,GAAO,GAePjQ,GAAS,CACdk3C,SAAY,kDACZ,YAAa,iDACb,gBAAiB,iBAKZ1mD,GAAQP,KAAKO,MACbm0E,GAAqB/uE,OAAOoC,aAUlC,SAASS,GAAM/E,GACd,MAAM,IAAInC,WAAWyO,GAAOtM,GAC7B,CAqGA,MAwBMkxE,GAAe,SAASC,EAAOC,GAGpC,OAAOD,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARC,IAAc,EACzD,EAOMC,GAAQ,SAASvlD,EAAOwlD,EAAWC,GACxC,IAAInyD,EAAI,EAGR,IAFA0M,EAAQylD,EAAYz0E,GAAMgvB,EA1Kd,KA0K8BA,GAAS,EACnDA,GAAShvB,GAAMgvB,EAAQwlD,GACOxlD,EAAQ0lD,IAA2BpyD,GAAK7C,GACrEuP,EAAQhvB,GAAMgvB,EA3JMvP,IA6JrB,OAAOzf,GAAMsiB,EAAI,GAAsB0M,GAASA,EAhLpC,IAiLb,EAuGMva,GAAS,SAAS/D,GACvB,MAAMlS,EAAS,GAGfkS,EAjMD,SAAoBjP,GACnB,MAAMjD,EAAS,GACf,IAAIm2E,EAAU,EACd,MAAMp3E,EAASkE,EAAOlE,OACtB,KAAOo3E,EAAUp3E,GAAQ,CACxB,MAAMoC,EAAQ8B,EAAOtE,WAAWw3E,KAChC,GAAIh1E,GAAS,OAAUA,GAAS,OAAUg1E,EAAUp3E,EAAQ,CAE3D,MAAM0oD,EAAQxkD,EAAOtE,WAAWw3E,KACR,QAAX,MAAR1uB,GACJznD,EAAOZ,OAAe,KAAR+B,IAAkB,KAAe,KAARsmD,GAAiB,QAIxDznD,EAAOZ,KAAK+B,GACZg1E,IAEF,MACCn2E,EAAOZ,KAAK+B,EAEd,CACA,OAAOnB,CACR,CA2KSo2E,CAAWlkE,GAGnB,MAAMmkE,EAAcnkE,EAAMnT,OAG1B,IAAImH,EA/RY,IAgSZsqB,EAAQ,EACR8lD,EAlSe,GAqSnB,IAAK,MAAMC,KAAgBrkE,EACtBqkE,EAAe,KAClBv2E,EAAOZ,KAAKu2E,GAAmBY,IAIjC,MAAMC,EAAcx2E,EAAOjB,OAC3B,IAAI03E,EAAiBD,EAWrB,IALIA,GACHx2E,EAAOZ,KAjTS,KAqTVq3E,EAAiBJ,GAAa,CAIpC,IAAI71E,EAAIk1E,GACR,IAAK,MAAMa,KAAgBrkE,EACtBqkE,GAAgBrwE,GAAKqwE,EAAe/1E,IACvCA,EAAI+1E,GAMN,MAAMG,EAAwBD,EAAiB,EAC3Cj2E,EAAI0F,EAAI1E,IAAOk0E,GAASllD,GAASkmD,IACpCjtE,GAAM,YAGP+mB,IAAUhwB,EAAI0F,GAAKwwE,EACnBxwE,EAAI1F,EAEJ,IAAK,MAAM+1E,KAAgBrkE,EAI1B,GAHIqkE,EAAerwE,KAAOsqB,EAAQklD,IACjCjsE,GAAM,YAEH8sE,IAAiBrwE,EAAG,CAEvB,IAAI8mB,EAAIwD,EACR,IAAK,IAAI1M,EAAI7C,IAA0B6C,GAAK7C,GAAM,CACjD,MAAMiE,EAAIpB,GAAKwyD,EAxVP,EAwVsBxyD,GAAKwyD,EAvV3B,MAuVgDxyD,EAAIwyD,EAC5D,GAAItpD,EAAI9H,EACP,MAED,MAAMyxD,EAAU3pD,EAAI9H,EACd0xD,EAAa31D,GAAOiE,EAC1BllB,EAAOZ,KACNu2E,GAAmBC,GAAa1wD,EAAIyxD,EAAUC,EAAY,KAE3D5pD,EAAIxrB,GAAMm1E,EAAUC,EACrB,CAEA52E,EAAOZ,KAAKu2E,GAAmBC,GAAa5oD,EAAG,KAC/CspD,EAAOP,GAAMvlD,EAAOkmD,EAAuBD,IAAmBD,GAC9DhmD,EAAQ,IACNimD,CACH,GAGCjmD,IACAtqB,CAEH,CACA,OAAOlG,EAAOT,KAAK,GACpB,uPCvXA,SAAUs3E,GASV,IAAIC,EAAK,SAASC,GAChB,IAAI34E,EAAG0jB,EAAI,IAAIk1D,aAAa,IAC5B,GAAID,EAAM,IAAK34E,EAAI,EAAGA,EAAI24E,EAAKh4E,OAAQX,IAAK0jB,EAAE1jB,GAAK24E,EAAK34E,GACxD,OAAO0jB,GAILm1D,EAAc,WAAuB,MAAM,IAAIt3E,MAAM,YAErDu3E,EAAK,IAAI13E,WAAW,IACpB23E,EAAK,IAAI33E,WAAW,IAAK23E,EAAG,GAAK,EAErC,IAAIC,EAAMN,IACNO,EAAMP,EAAG,CAAC,IACVQ,EAAUR,EAAG,CAAC,MAAQ,IACtBlnD,EAAIknD,EAAG,CAAC,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,IAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,QAChIS,EAAKT,EAAG,CAAC,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,MAAQ,KAAQ,IAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,OACjIU,EAAIV,EAAG,CAAC,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,OAChIW,EAAIX,EAAG,CAAC,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,MAAQ,QAChIY,EAAIZ,EAAG,CAAC,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,KAAQ,MAAQ,MAAQ,MAAQ,IAAQ,MAAQ,MAAQ,MAAQ,KAAQ,QAEpI,SAASa,EAAKxtE,EAAG/L,EAAGovB,EAAGuY,GACrB57B,EAAE/L,GAAQovB,GAAK,GAAM,IACrBrjB,EAAE/L,EAAE,GAAMovB,GAAK,GAAM,IACrBrjB,EAAE/L,EAAE,GAAMovB,GAAM,EAAK,IACrBrjB,EAAE/L,EAAE,GAAS,IAAJovB,EACTrjB,EAAE/L,EAAE,GAAM2nC,GAAK,GAAO,IACtB57B,EAAE/L,EAAE,GAAM2nC,GAAK,GAAO,IACtB57B,EAAE/L,EAAE,GAAM2nC,GAAM,EAAM,IACtB57B,EAAE/L,EAAE,GAAS,IAAJ2nC,CACX,CAEA,SAAS6xC,EAAGztE,EAAG0tE,EAAIztE,EAAG0tE,EAAI5xE,GACxB,IAAI9H,EAAEyC,EAAI,EACV,IAAKzC,EAAI,EAAGA,EAAI8H,EAAG9H,IAAKyC,GAAKsJ,EAAE0tE,EAAGz5E,GAAGgM,EAAE0tE,EAAG15E,GAC1C,OAAQ,EAAMyC,EAAI,IAAO,GAAM,CACjC,CAEA,SAASk3E,EAAiB5tE,EAAG0tE,EAAIztE,EAAG0tE,GAClC,OAAOF,EAAGztE,EAAE0tE,EAAGztE,EAAE0tE,EAAG,GACtB,CAEA,SAASE,EAAiB7tE,EAAG0tE,EAAIztE,EAAG0tE,GAClC,OAAOF,EAAGztE,EAAE0tE,EAAGztE,EAAE0tE,EAAG,GACtB,CA4UA,SAASG,EAAoBrsE,EAAIssE,EAAIp0D,EAAE1iB,IA1UvC,SAAsBimB,EAAGiI,EAAGxL,EAAG1iB,GAsB7B,IArBA,IAmBe8zB,EAnBXijD,EAAc,IAAR/2E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9Eg3E,EAAc,IAARt0D,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9Eu0D,EAAc,IAARv0D,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9Ew0D,EAAc,IAARx0D,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9Ey0D,EAAc,IAARz0D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9E00D,EAAc,IAARp3E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9Eq3E,EAAc,IAARnpD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9EopD,EAAc,IAARppD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAC9EqpD,EAAc,IAARrpD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9EspD,EAAc,IAARtpD,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9EupD,EAAc,IAARz3E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9E03E,EAAc,IAARh1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9Ei1D,EAAc,IAARj1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9Ek1D,EAAc,IAARl1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9Em1D,EAAc,IAARn1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAC9Eo1D,EAAc,IAAR93E,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAE9E+3E,EAAKhB,EAAI7nD,EAAK8nD,EAAI7nD,EAAK8nD,EAAIe,EAAKd,EAAIe,EAAKd,EAAIe,EAAKd,EAAIe,EAAKd,EAAIe,EAAKd,EACpEe,EAAKd,EAAIe,EAAKd,EAAIe,EAAMd,EAAKe,EAAMd,EAAKe,EAAMd,EAAKe,EAAMd,EAAKe,EAAMd,EACpEe,EAAMd,EAED96E,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAQ3B+6E,IADAjkD,GADA2kD,IADA3kD,GADAukD,IADAvkD,GADAmkD,IADAnkD,EAAIikD,EAAKU,EAAM,IACN,EAAI3kD,IAAK,IACTikD,EAAK,IACL,EAAIjkD,IAAK,IACTmkD,EAAK,IACJ,GAAKnkD,IAAK,IACVukD,EAAK,IACN,GAAKvkD,IAAK,GASnBokD,IADApkD,GADA5E,IADA4E,GADA4kD,IADA5kD,GADAwkD,IADAxkD,EAAIokD,EAAKhpD,EAAK,IACL,EAAI4E,IAAK,IACTokD,EAAK,IACJ,EAAIpkD,IAAK,IACTwkD,EAAK,IACN,GAAKxkD,IAAK,IACV4kD,EAAM,IACN,GAAK5kD,IAAK,GASnBykD,IADAzkD,GADAqkD,IADArkD,GADA3E,IADA2E,GADA6kD,IADA7kD,EAAIykD,EAAMJ,EAAK,IACL,EAAIrkD,IAAK,IACTykD,EAAM,IACP,EAAIzkD,IAAK,IACT6kD,EAAM,IACN,GAAK7kD,IAAK,IACV3E,EAAK,IACJ,GAAK2E,IAAK,GASpB8kD,IADA9kD,GADA0kD,IADA1kD,GADAskD,IADAtkD,GADAkkD,IADAlkD,EAAI8kD,EAAMJ,EAAM,IACP,EAAI1kD,IAAK,IACT8kD,EAAM,IACN,EAAI9kD,IAAK,IACTkkD,EAAK,IACJ,GAAKlkD,IAAK,IACVskD,EAAK,IACL,GAAKtkD,IAAK,GASpBikD,IADAjkD,GADAkkD,IADAlkD,GADA3E,IADA2E,GADA5E,IADA4E,EAAIikD,EAAKC,EAAK,IACL,EAAIlkD,IAAK,IACTikD,EAAK,IACL,EAAIjkD,IAAK,IACT5E,EAAK,IACL,GAAK4E,IAAK,IACV3E,EAAK,IACL,GAAK2E,IAAK,GASnBokD,IADApkD,GADAmkD,IADAnkD,GADAskD,IADAtkD,GADAqkD,IADArkD,EAAIokD,EAAKD,EAAK,IACL,EAAInkD,IAAK,IACTokD,EAAK,IACL,EAAIpkD,IAAK,IACTqkD,EAAK,IACL,GAAKrkD,IAAK,IACVskD,EAAK,IACL,GAAKtkD,IAAK,GASnBykD,IADAzkD,GADAwkD,IADAxkD,GADAukD,IADAvkD,GADA0kD,IADA1kD,EAAIykD,EAAMD,EAAK,IACL,EAAIxkD,IAAK,IACTykD,EAAM,IACP,EAAIzkD,IAAK,IACT0kD,EAAM,IACN,GAAK1kD,IAAK,IACVukD,EAAK,IACJ,GAAKvkD,IAAK,GASpB8kD,IADA9kD,GADA6kD,IADA7kD,GADA4kD,IADA5kD,GADA2kD,IADA3kD,EAAI8kD,EAAMD,EAAM,IACN,EAAI7kD,IAAK,IACT8kD,EAAM,IACN,EAAI9kD,IAAK,IACT2kD,EAAM,IACN,GAAK3kD,IAAK,IACV4kD,EAAM,IACN,GAAK5kD,IAAK,GAErBikD,EAAMA,EAAMhB,EAAK,EACjB7nD,EAAMA,EAAM8nD,EAAK,EACjB7nD,EAAMA,EAAM8nD,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EACjBe,EAAMA,EAAMd,EAAK,EAClBe,EAAMA,EAAMd,EAAM,EAClBe,EAAMA,EAAMd,EAAM,EAClBe,EAAMA,EAAMd,EAAM,EAClBe,EAAMA,EAAMd,EAAM,EAClBe,EAAMA,EAAMd,EAAM,EAClBe,EAAMA,EAAMd,EAAM,EAElB7xD,EAAG,GAAK8xD,IAAQ,EAAI,IACpB9xD,EAAG,GAAK8xD,IAAQ,EAAI,IACpB9xD,EAAG,GAAK8xD,IAAO,GAAK,IACpB9xD,EAAG,GAAK8xD,IAAO,GAAK,IAEpB9xD,EAAG,GAAKiJ,IAAQ,EAAI,IACpBjJ,EAAG,GAAKiJ,IAAQ,EAAI,IACpBjJ,EAAG,GAAKiJ,IAAO,GAAK,IACpBjJ,EAAG,GAAKiJ,IAAO,GAAK,IAEpBjJ,EAAG,GAAKkJ,IAAQ,EAAI,IACpBlJ,EAAG,GAAKkJ,IAAQ,EAAI,IACpBlJ,EAAE,IAAMkJ,IAAO,GAAK,IACpBlJ,EAAE,IAAMkJ,IAAO,GAAK,IAEpBlJ,EAAE,IAAM+xD,IAAQ,EAAI,IACpB/xD,EAAE,IAAM+xD,IAAQ,EAAI,IACpB/xD,EAAE,IAAM+xD,IAAO,GAAK,IACpB/xD,EAAE,IAAM+xD,IAAO,GAAK,IAEpB/xD,EAAE,IAAMgyD,IAAQ,EAAI,IACpBhyD,EAAE,IAAMgyD,IAAQ,EAAI,IACpBhyD,EAAE,IAAMgyD,IAAO,GAAK,IACpBhyD,EAAE,IAAMgyD,IAAO,GAAK,IAEpBhyD,EAAE,IAAMiyD,IAAQ,EAAI,IACpBjyD,EAAE,IAAMiyD,IAAQ,EAAI,IACpBjyD,EAAE,IAAMiyD,IAAO,GAAK,IACpBjyD,EAAE,IAAMiyD,IAAO,GAAK,IAEpBjyD,EAAE,IAAMkyD,IAAQ,EAAI,IACpBlyD,EAAE,IAAMkyD,IAAQ,EAAI,IACpBlyD,EAAE,IAAMkyD,IAAO,GAAK,IACpBlyD,EAAE,IAAMkyD,IAAO,GAAK,IAEpBlyD,EAAE,IAAMmyD,IAAQ,EAAI,IACpBnyD,EAAE,IAAMmyD,IAAQ,EAAI,IACpBnyD,EAAE,IAAMmyD,IAAO,GAAK,IACpBnyD,EAAE,IAAMmyD,IAAO,GAAK,IAEpBnyD,EAAE,IAAMoyD,IAAQ,EAAI,IACpBpyD,EAAE,IAAMoyD,IAAQ,EAAI,IACpBpyD,EAAE,IAAMoyD,IAAO,GAAK,IACpBpyD,EAAE,IAAMoyD,IAAO,GAAK,IAEpBpyD,EAAE,IAAMqyD,IAAQ,EAAI,IACpBryD,EAAE,IAAMqyD,IAAQ,EAAI,IACpBryD,EAAE,IAAMqyD,IAAO,GAAK,IACpBryD,EAAE,IAAMqyD,IAAO,GAAK,IAEpBryD,EAAE,IAAMsyD,IAAS,EAAI,IACrBtyD,EAAE,IAAMsyD,IAAS,EAAI,IACrBtyD,EAAE,IAAMsyD,IAAQ,GAAK,IACrBtyD,EAAE,IAAMsyD,IAAQ,GAAK,IAErBtyD,EAAE,IAAMuyD,IAAS,EAAI,IACrBvyD,EAAE,IAAMuyD,IAAS,EAAI,IACrBvyD,EAAE,IAAMuyD,IAAQ,GAAK,IACrBvyD,EAAE,IAAMuyD,IAAQ,GAAK,IAErBvyD,EAAE,IAAMwyD,IAAS,EAAI,IACrBxyD,EAAE,IAAMwyD,IAAS,EAAI,IACrBxyD,EAAE,IAAMwyD,IAAQ,GAAK,IACrBxyD,EAAE,IAAMwyD,IAAQ,GAAK,IAErBxyD,EAAE,IAAMyyD,IAAS,EAAI,IACrBzyD,EAAE,IAAMyyD,IAAS,EAAI,IACrBzyD,EAAE,IAAMyyD,IAAQ,GAAK,IACrBzyD,EAAE,IAAMyyD,IAAQ,GAAK,IAErBzyD,EAAE,IAAM0yD,IAAS,EAAI,IACrB1yD,EAAE,IAAM0yD,IAAS,EAAI,IACrB1yD,EAAE,IAAM0yD,IAAQ,GAAK,IACrB1yD,EAAE,IAAM0yD,IAAQ,GAAK,IAErB1yD,EAAE,IAAM2yD,IAAS,EAAI,IACrB3yD,EAAE,IAAM2yD,IAAS,EAAI,IACrB3yD,EAAE,IAAM2yD,IAAQ,GAAK,IACrB3yD,EAAE,IAAM2yD,IAAQ,GAAK,GACvB,CA4IEC,CAAaruE,EAAIssE,EAAIp0D,EAAE1iB,EACzB,CAEA,SAAS84E,EAAqBtuE,EAAIssE,EAAIp0D,EAAE1iB,IA7IxC,SAAuBimB,EAAEiI,EAAExL,EAAE1iB,GAsB3B,IArBA,IAmBe8zB,EAFXikD,EAjBc,IAAR/3E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAiBrEkvB,EAhBK,IAARxM,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAgB5DyM,EAfJ,IAARzM,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAenDs1D,EAdb,IAARt1D,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAc1Cu1D,EAbtB,IAARv1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAajCw1D,EAZ/B,IAARl4E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAYxBm4E,EAXxC,IAARjqD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAWfkqD,EAVjD,IAARlqD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAG,KAAY,IAAc,IAARA,EAAG,KAAY,GAW9EmqD,EAVc,IAARnqD,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAUrEoqD,EATK,IAARpqD,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAS5DqqD,EARJ,IAARv4E,EAAG,IAAqB,IAARA,EAAG,KAAY,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAQjDw4E,EAPf,IAAR91D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAOtC+1D,EAN1B,IAAR/1D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAM3Bg2D,EALrC,IAARh2D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAKhBi2D,EAJhD,IAARj2D,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAK9Ek2D,EAJc,IAAR54E,EAAE,KAAsB,IAARA,EAAE,MAAa,GAAa,IAARA,EAAE,MAAa,IAAc,IAARA,EAAE,MAAa,GAMzEhD,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAQ3B+6E,IADAjkD,GADA2kD,IADA3kD,GADAukD,IADAvkD,GADAmkD,IADAnkD,EAAIikD,EAAKU,EAAM,IACN,EAAI3kD,IAAK,IACTikD,EAAK,IACL,EAAIjkD,IAAK,IACTmkD,EAAK,IACJ,GAAKnkD,IAAK,IACVukD,EAAK,IACN,GAAKvkD,IAAK,GASnBokD,IADApkD,GADA5E,IADA4E,GADA4kD,IADA5kD,GADAwkD,IADAxkD,EAAIokD,EAAKhpD,EAAK,IACL,EAAI4E,IAAK,IACTokD,EAAK,IACJ,EAAIpkD,IAAK,IACTwkD,EAAK,IACN,GAAKxkD,IAAK,IACV4kD,EAAM,IACN,GAAK5kD,IAAK,GASnBykD,IADAzkD,GADAqkD,IADArkD,GADA3E,IADA2E,GADA6kD,IADA7kD,EAAIykD,EAAMJ,EAAK,IACL,EAAIrkD,IAAK,IACTykD,EAAM,IACP,EAAIzkD,IAAK,IACT6kD,EAAM,IACN,GAAK7kD,IAAK,IACV3E,EAAK,IACJ,GAAK2E,IAAK,GASpB8kD,IADA9kD,GADA0kD,IADA1kD,GADAskD,IADAtkD,GADAkkD,IADAlkD,EAAI8kD,EAAMJ,EAAM,IACP,EAAI1kD,IAAK,IACT8kD,EAAM,IACN,EAAI9kD,IAAK,IACTkkD,EAAK,IACJ,GAAKlkD,IAAK,IACVskD,EAAK,IACL,GAAKtkD,IAAK,GASpBikD,IADAjkD,GADAkkD,IADAlkD,GADA3E,IADA2E,GADA5E,IADA4E,EAAIikD,EAAKC,EAAK,IACL,EAAIlkD,IAAK,IACTikD,EAAK,IACL,EAAIjkD,IAAK,IACT5E,EAAK,IACL,GAAK4E,IAAK,IACV3E,EAAK,IACL,GAAK2E,IAAK,GASnBokD,IADApkD,GADAmkD,IADAnkD,GADAskD,IADAtkD,GADAqkD,IADArkD,EAAIokD,EAAKD,EAAK,IACL,EAAInkD,IAAK,IACTokD,EAAK,IACL,EAAIpkD,IAAK,IACTqkD,EAAK,IACL,GAAKrkD,IAAK,IACVskD,EAAK,IACL,GAAKtkD,IAAK,GASnBykD,IADAzkD,GADAwkD,IADAxkD,GADAukD,IADAvkD,GADA0kD,IADA1kD,EAAIykD,EAAMD,EAAK,IACL,EAAIxkD,IAAK,IACTykD,EAAM,IACP,EAAIzkD,IAAK,IACT0kD,EAAM,IACN,GAAK1kD,IAAK,IACVukD,EAAK,IACJ,GAAKvkD,IAAK,GASpB8kD,IADA9kD,GADA6kD,IADA7kD,GADA4kD,IADA5kD,GADA2kD,IADA3kD,EAAI8kD,EAAMD,EAAM,IACN,EAAI7kD,IAAK,IACT8kD,EAAM,IACN,EAAI9kD,IAAK,IACT2kD,EAAM,IACN,GAAK3kD,IAAK,IACV4kD,EAAM,IACN,GAAK5kD,IAAK,GAGtB7N,EAAG,GAAK8xD,IAAQ,EAAI,IACpB9xD,EAAG,GAAK8xD,IAAQ,EAAI,IACpB9xD,EAAG,GAAK8xD,IAAO,GAAK,IACpB9xD,EAAG,GAAK8xD,IAAO,GAAK,IAEpB9xD,EAAG,GAAKiyD,IAAQ,EAAI,IACpBjyD,EAAG,GAAKiyD,IAAQ,EAAI,IACpBjyD,EAAG,GAAKiyD,IAAO,GAAK,IACpBjyD,EAAG,GAAKiyD,IAAO,GAAK,IAEpBjyD,EAAG,GAAKsyD,IAAS,EAAI,IACrBtyD,EAAG,GAAKsyD,IAAS,EAAI,IACrBtyD,EAAE,IAAMsyD,IAAQ,GAAK,IACrBtyD,EAAE,IAAMsyD,IAAQ,GAAK,IAErBtyD,EAAE,IAAM2yD,IAAS,EAAI,IACrB3yD,EAAE,IAAM2yD,IAAS,EAAI,IACrB3yD,EAAE,IAAM2yD,IAAQ,GAAK,IACrB3yD,EAAE,IAAM2yD,IAAQ,GAAK,IAErB3yD,EAAE,IAAMkyD,IAAQ,EAAI,IACpBlyD,EAAE,IAAMkyD,IAAQ,EAAI,IACpBlyD,EAAE,IAAMkyD,IAAO,GAAK,IACpBlyD,EAAE,IAAMkyD,IAAO,GAAK,IAEpBlyD,EAAE,IAAMmyD,IAAQ,EAAI,IACpBnyD,EAAE,IAAMmyD,IAAQ,EAAI,IACpBnyD,EAAE,IAAMmyD,IAAO,GAAK,IACpBnyD,EAAE,IAAMmyD,IAAO,GAAK,IAEpBnyD,EAAE,IAAMoyD,IAAQ,EAAI,IACpBpyD,EAAE,IAAMoyD,IAAQ,EAAI,IACpBpyD,EAAE,IAAMoyD,IAAO,GAAK,IACpBpyD,EAAE,IAAMoyD,IAAO,GAAK,IAEpBpyD,EAAE,IAAMqyD,IAAQ,EAAI,IACpBryD,EAAE,IAAMqyD,IAAQ,EAAI,IACpBryD,EAAE,IAAMqyD,IAAO,GAAK,IACpBryD,EAAE,IAAMqyD,IAAO,GAAK,GACtB,CAOES,CAAcvuE,EAAIssE,EAAIp0D,EAAE1iB,EAC1B,CAEA,IAAIg5E,EAAQ,IAAI56E,WAAW,CAAC,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,GAAI,MAGhG,SAAS66E,EAA0Bj5E,EAAEk5E,EAAK95E,EAAE+5E,EAAKn2E,EAAE8B,EAAE4d,GACnD,IACIoR,EAAG92B,EADHw2B,EAAI,IAAIp1B,WAAW,IAAK2K,EAAI,IAAI3K,WAAW,IAE/C,IAAKpB,EAAI,EAAGA,EAAI,GAAIA,IAAKw2B,EAAEx2B,GAAK,EAChC,IAAKA,EAAI,EAAGA,EAAI,EAAGA,IAAKw2B,EAAEx2B,GAAK8H,EAAE9H,GACjC,KAAOgG,GAAK,IAAI,CAEd,IADA6zE,EAAoB9tE,EAAEyqB,EAAE9Q,EAAEs2D,GACrBh8E,EAAI,EAAGA,EAAI,GAAIA,IAAKgD,EAAEk5E,EAAKl8E,GAAKoC,EAAE+5E,EAAKn8E,GAAK+L,EAAE/L,GAEnD,IADA82B,EAAI,EACC92B,EAAI,EAAGA,EAAI,GAAIA,IAClB82B,EAAIA,GAAY,IAAPN,EAAEx2B,IAAa,EACxBw2B,EAAEx2B,GAAS,IAAJ82B,EACPA,KAAO,EAET9wB,GAAK,GACLk2E,GAAQ,GACRC,GAAQ,EACT,CACD,GAAIn2E,EAAI,EAEN,IADA6zE,EAAoB9tE,EAAEyqB,EAAE9Q,EAAEs2D,GACrBh8E,EAAI,EAAGA,EAAIgG,EAAGhG,IAAKgD,EAAEk5E,EAAKl8E,GAAKoC,EAAE+5E,EAAKn8E,GAAK+L,EAAE/L,GAEpD,OAAO,CACT,CAEA,SAASo8E,EAAsBp5E,EAAEk5E,EAAKl2E,EAAE8B,EAAE4d,GACxC,IACIoR,EAAG92B,EADHw2B,EAAI,IAAIp1B,WAAW,IAAK2K,EAAI,IAAI3K,WAAW,IAE/C,IAAKpB,EAAI,EAAGA,EAAI,GAAIA,IAAKw2B,EAAEx2B,GAAK,EAChC,IAAKA,EAAI,EAAGA,EAAI,EAAGA,IAAKw2B,EAAEx2B,GAAK8H,EAAE9H,GACjC,KAAOgG,GAAK,IAAI,CAEd,IADA6zE,EAAoB9tE,EAAEyqB,EAAE9Q,EAAEs2D,GACrBh8E,EAAI,EAAGA,EAAI,GAAIA,IAAKgD,EAAEk5E,EAAKl8E,GAAK+L,EAAE/L,GAEvC,IADA82B,EAAI,EACC92B,EAAI,EAAGA,EAAI,GAAIA,IAClB82B,EAAIA,GAAY,IAAPN,EAAEx2B,IAAa,EACxBw2B,EAAEx2B,GAAS,IAAJ82B,EACPA,KAAO,EAET9wB,GAAK,GACLk2E,GAAQ,EACT,CACD,GAAIl2E,EAAI,EAEN,IADA6zE,EAAoB9tE,EAAEyqB,EAAE9Q,EAAEs2D,GACrBh8E,EAAI,EAAGA,EAAIgG,EAAGhG,IAAKgD,EAAEk5E,EAAKl8E,GAAK+L,EAAE/L,GAExC,OAAO,CACT,CAEA,SAASq8E,EAAcr5E,EAAEk5E,EAAKz5E,EAAEqF,EAAE4d,GAChC,IAAIhjB,EAAI,IAAItB,WAAW,IACvB06E,EAAqBp5E,EAAEoF,EAAE4d,EAAEs2D,GAE3B,IADA,IAAIM,EAAK,IAAIl7E,WAAW,GACfpB,EAAI,EAAGA,EAAI,EAAGA,IAAKs8E,EAAGt8E,GAAK8H,EAAE9H,EAAE,IACxC,OAAOo8E,EAAsBp5E,EAAEk5E,EAAKz5E,EAAE65E,EAAG55E,EAC3C,CAEA,SAAS65E,EAAkBv5E,EAAEk5E,EAAK95E,EAAE+5E,EAAK15E,EAAEqF,EAAE4d,GAC3C,IAAIhjB,EAAI,IAAItB,WAAW,IACvB06E,EAAqBp5E,EAAEoF,EAAE4d,EAAEs2D,GAE3B,IADA,IAAIM,EAAK,IAAIl7E,WAAW,GACfpB,EAAI,EAAGA,EAAI,EAAGA,IAAKs8E,EAAGt8E,GAAK8H,EAAE9H,EAAE,IACxC,OAAOi8E,EAA0Bj5E,EAAEk5E,EAAK95E,EAAE+5E,EAAK15E,EAAE65E,EAAG55E,EACtD,CAOA,IAAI85E,EAAW,SAAS7kD,GAQtB,IAAI8kD,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAPhC11E,KAAKxF,OAAS,IAAIV,WAAW,IAC7BkG,KAAKoc,EAAI,IAAI+xC,YAAY,IACzBnuD,KAAK8nB,EAAI,IAAIqmC,YAAY,IACzBnuD,KAAK4mE,IAAM,IAAIzY,YAAY,GAC3BnuD,KAAK21E,SAAW,EAChB31E,KAAK41E,IAAM,EAIXT,EAAe,IAAV9kD,EAAK,IAAuB,IAAVA,EAAK,KAAc,EAAGrwB,KAAKoc,EAAE,GAAkC,KAA3B+4D,EAC3DC,EAAe,IAAV/kD,EAAK,IAAuB,IAAVA,EAAK,KAAc,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3B+4D,IAAO,GAAOC,GAAO,GAChFC,EAAe,IAAVhlD,EAAK,IAAuB,IAAVA,EAAK,KAAc,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3Bg5D,IAAO,GAAOC,GAAO,GAChFC,EAAe,IAAVjlD,EAAK,IAAuB,IAAVA,EAAK,KAAc,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3Bi5D,IAAQ,EAAMC,GAAO,GAChFC,EAAe,IAAVllD,EAAK,IAAuB,IAAVA,EAAK,KAAc,EAAGrwB,KAAKoc,EAAE,GAAkC,KAA3Bk5D,IAAQ,EAAMC,GAAM,IAC/Ev1E,KAAKoc,EAAE,GAAOm5D,IAAQ,EAAM,KAC5BC,EAAe,IAAVnlD,EAAI,KAAwB,IAAVA,EAAI,MAAe,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3Bm5D,IAAO,GAAOC,GAAO,GAChFC,EAAe,IAAVplD,EAAI,KAAwB,IAAVA,EAAI,MAAe,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3Bo5D,IAAO,GAAOC,GAAO,GAChFC,EAAe,IAAVrlD,EAAI,KAAwB,IAAVA,EAAI,MAAe,EAAGrwB,KAAKoc,EAAE,GAAkC,MAA3Bq5D,IAAQ,EAAMC,GAAO,GAChF11E,KAAKoc,EAAE,GAAOs5D,IAAQ,EAAM,IAE5B11E,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,EACnDrwB,KAAK4mE,IAAI,GAAe,IAAVv2C,EAAI,KAAwB,IAAVA,EAAI,MAAe,GAoUrD,SAASwlD,EAAmB3vE,EAAK4vE,EAAQh7E,EAAG+5E,EAAMr0E,EAAG4d,GACnD,IAAIhjB,EAAI,IAAI85E,EAAS92D,GAGrB,OAFAhjB,EAAEkoC,OAAOxoC,EAAG+5E,EAAMr0E,GAClBpF,EAAE26E,OAAO7vE,EAAK4vE,GACP,CACT,CAEA,SAASE,EAA0BluD,EAAGmuD,EAAMn7E,EAAG+5E,EAAMr0E,EAAG4d,GACtD,IAAI3Z,EAAI,IAAI3K,WAAW,IAEvB,OADA+7E,EAAmBpxE,EAAE,EAAE3J,EAAE+5E,EAAKr0E,EAAE4d,GACzBi0D,EAAiBvqD,EAAEmuD,EAAKxxE,EAAE,EACnC,CAEA,SAASyxE,EAAiBx6E,EAAEZ,EAAEK,EAAEqF,EAAE4d,GAChC,IAAI1lB,EACJ,GAAIyC,EAAI,GAAI,OAAQ,EAGpB,IAFA85E,EAAkBv5E,EAAE,EAAEZ,EAAE,EAAEK,EAAEqF,EAAE4d,GAC9By3D,EAAmBn6E,EAAG,GAAIA,EAAG,GAAIP,EAAI,GAAIO,GACpChD,EAAI,EAAGA,EAAI,GAAIA,IAAKgD,EAAEhD,GAAK,EAChC,OAAO,CACT,CAEA,SAASy9E,EAAsBr7E,EAAEY,EAAEP,EAAEqF,EAAE4d,GACrC,IAAI1lB,EACA+L,EAAI,IAAI3K,WAAW,IACvB,GAAIqB,EAAI,GAAI,OAAQ,EAEpB,GADA45E,EAActwE,EAAE,EAAE,GAAGjE,EAAE4d,GACiC,IAApD43D,EAA0Bt6E,EAAG,GAAGA,EAAG,GAAGP,EAAI,GAAGsJ,GAAU,OAAQ,EAEnE,IADAwwE,EAAkBn6E,EAAE,EAAEY,EAAE,EAAEP,EAAEqF,EAAE4d,GACzB1lB,EAAI,EAAGA,EAAI,GAAIA,IAAKoC,EAAEpC,GAAK,EAChC,OAAO,CACT,CAEA,SAAS09E,EAASh6D,EAAG5X,GACnB,IAAI9L,EACJ,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAK0jB,EAAE1jB,GAAU,EAAL8L,EAAE9L,EACpC,CAEA,SAAS29E,EAAS10D,GAChB,IAAIjpB,EAAG4Z,EAAG5W,EAAI,EACd,IAAKhD,EAAI,EAAGA,EAAI,GAAIA,IAClB4Z,EAAIqP,EAAEjpB,GAAKgD,EAAI,MACfA,EAAIH,KAAKO,MAAMwW,EAAI,OACnBqP,EAAEjpB,GAAK4Z,EAAQ,MAAJ5W,EAEbimB,EAAE,IAAMjmB,EAAE,EAAI,IAAMA,EAAE,EACxB,CAEA,SAAS46E,EAAS1sD,EAAGtC,EAAG5oB,GAEtB,IADA,IAAI8gB,EAAG9jB,IAAMgD,EAAE,GACNhG,EAAI,EAAGA,EAAI,GAAIA,IACtB8mB,EAAI9jB,GAAKkuB,EAAElxB,GAAK4uB,EAAE5uB,IAClBkxB,EAAElxB,IAAM8mB,EACR8H,EAAE5uB,IAAM8mB,CAEZ,CAEA,SAAS+2D,EAAU50D,EAAGnhB,GACpB,IAAI9H,EAAG6I,EAAG7C,EACN5D,EAAIs2E,IAAM5xD,EAAI4xD,IAClB,IAAK14E,EAAI,EAAGA,EAAI,GAAIA,IAAK8mB,EAAE9mB,GAAK8H,EAAE9H,GAIlC,IAHA29E,EAAS72D,GACT62D,EAAS72D,GACT62D,EAAS72D,GACJje,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAEtB,IADAzG,EAAE,GAAK0kB,EAAE,GAAK,MACT9mB,EAAI,EAAGA,EAAI,GAAIA,IAClBoC,EAAEpC,GAAK8mB,EAAE9mB,GAAK,OAAWoC,EAAEpC,EAAE,IAAI,GAAM,GACvCoC,EAAEpC,EAAE,IAAM,MAEZoC,EAAE,IAAM0kB,EAAE,IAAM,OAAW1kB,EAAE,KAAK,GAAM,GACxC4D,EAAK5D,EAAE,KAAK,GAAM,EAClBA,EAAE,KAAO,MACTw7E,EAAS92D,EAAG1kB,EAAG,EAAE4D,EAClB,CACD,IAAKhG,EAAI,EAAGA,EAAI,GAAIA,IAClBipB,EAAE,EAAEjpB,GAAY,IAAP8mB,EAAE9mB,GACXipB,EAAE,EAAEjpB,EAAE,GAAK8mB,EAAE9mB,IAAI,CAErB,CAEA,SAAS89E,EAAShyE,EAAG9F,GACnB,IAAIhD,EAAI,IAAI5B,WAAW,IAAKqB,EAAI,IAAIrB,WAAW,IAG/C,OAFAy8E,EAAU76E,EAAG8I,GACb+xE,EAAUp7E,EAAGuD,GACN4zE,EAAiB52E,EAAG,EAAGP,EAAG,EACnC,CAEA,SAASs7E,EAASjyE,GAChB,IAAIrJ,EAAI,IAAIrB,WAAW,IAEvB,OADAy8E,EAAUp7E,EAAGqJ,GACC,EAAPrJ,EAAE,EACX,CAEA,SAASu7E,EAAY/0D,EAAGnhB,GACtB,IAAI9H,EACJ,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAKipB,EAAEjpB,GAAK8H,EAAE,EAAE9H,IAAM8H,EAAE,EAAE9H,EAAE,IAAM,GACtDipB,EAAE,KAAO,KACX,CAEA,SAASoI,EAAEpI,EAAGnd,EAAG9F,GACf,IAAK,IAAIhG,EAAI,EAAGA,EAAI,GAAIA,IAAKipB,EAAEjpB,GAAK8L,EAAE9L,GAAKgG,EAAEhG,EAC/C,CAEA,SAASi+E,EAAEh1D,EAAGnd,EAAG9F,GACf,IAAK,IAAIhG,EAAI,EAAGA,EAAI,GAAIA,IAAKipB,EAAEjpB,GAAK8L,EAAE9L,GAAKgG,EAAEhG,EAC/C,CAEA,SAASk+E,EAAEj1D,EAAGnd,EAAG9F,GACf,IAAI4T,EAAG5W,EACJy5E,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EAAIC,EAAK,EACpEmB,EAAK,EAAIC,EAAK,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrEC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EACrEC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAAGC,EAAM,EAC5Dz0D,EAAKhlB,EAAE,GACPmlB,EAAKnlB,EAAE,GACPslB,EAAKtlB,EAAE,GACPylB,EAAKzlB,EAAE,GACP4lB,EAAK5lB,EAAE,GACP+lB,EAAK/lB,EAAE,GACPkmB,EAAKlmB,EAAE,GACPqmB,EAAKrmB,EAAE,GACPwmB,EAAKxmB,EAAE,GACP2mB,EAAK3mB,EAAE,GACP05E,EAAM15E,EAAE,IACR25E,EAAM35E,EAAE,IACR45E,EAAM55E,EAAE,IACR65E,EAAM75E,EAAE,IACR85E,EAAM95E,EAAE,IACR+5E,EAAM/5E,EAAE,IAGVy2E,IADA7iE,EAAI9N,EAAE,IACIkf,EACV0xD,GAAM9iE,EAAIuR,EACVwxD,GAAM/iE,EAAI0R,EACVsxD,GAAMhjE,EAAI6R,EACVoxD,GAAMjjE,EAAIgS,EACVkxD,GAAMljE,EAAImS,EACVgxD,GAAMnjE,EAAIsS,EACV8wD,GAAMpjE,EAAIyS,EACV8xD,GAAMvkE,EAAI4S,EACV4xD,GAAMxkE,EAAI+S,EACV0xD,GAAOzkE,EAAI8lE,EACXpB,GAAO1kE,EAAI+lE,EACXpB,GAAO3kE,EAAIgmE,EACXpB,GAAO5kE,EAAIimE,EACXpB,GAAO7kE,EAAIkmE,EACXpB,GAAO9kE,EAAImmE,EAEXrD,IADA9iE,EAAI9N,EAAE,IACIkf,EACV2xD,GAAM/iE,EAAIuR,EACVyxD,GAAMhjE,EAAI0R,EACVuxD,GAAMjjE,EAAI6R,EACVqxD,GAAMljE,EAAIgS,EACVmxD,GAAMnjE,EAAImS,EACVixD,GAAMpjE,EAAIsS,EACViyD,GAAMvkE,EAAIyS,EACV+xD,GAAMxkE,EAAI4S,EACV6xD,GAAOzkE,EAAI+S,EACX2xD,GAAO1kE,EAAI8lE,EACXnB,GAAO3kE,EAAI+lE,EACXnB,GAAO5kE,EAAIgmE,EACXnB,GAAO7kE,EAAIimE,EACXnB,GAAO9kE,EAAIkmE,EACXnB,GAAO/kE,EAAImmE,EAEXpD,IADA/iE,EAAI9N,EAAE,IACIkf,EACV4xD,GAAMhjE,EAAIuR,EACV0xD,GAAMjjE,EAAI0R,EACVwxD,GAAMljE,EAAI6R,EACVsxD,GAAMnjE,EAAIgS,EACVoxD,GAAMpjE,EAAImS,EACVoyD,GAAMvkE,EAAIsS,EACVkyD,GAAMxkE,EAAIyS,EACVgyD,GAAOzkE,EAAI4S,EACX8xD,GAAO1kE,EAAI+S,EACX4xD,GAAO3kE,EAAI8lE,EACXlB,GAAO5kE,EAAI+lE,EACXlB,GAAO7kE,EAAIgmE,EACXlB,GAAO9kE,EAAIimE,EACXlB,GAAO/kE,EAAIkmE,EACXlB,GAAOhlE,EAAImmE,EAEXnD,IADAhjE,EAAI9N,EAAE,IACIkf,EACV6xD,GAAMjjE,EAAIuR,EACV2xD,GAAMljE,EAAI0R,EACVyxD,GAAMnjE,EAAI6R,EACVuxD,GAAMpjE,EAAIgS,EACVuyD,GAAMvkE,EAAImS,EACVqyD,GAAMxkE,EAAIsS,EACVmyD,GAAOzkE,EAAIyS,EACXiyD,GAAO1kE,EAAI4S,EACX+xD,GAAO3kE,EAAI+S,EACX6xD,GAAO5kE,EAAI8lE,EACXjB,GAAO7kE,EAAI+lE,EACXjB,GAAO9kE,EAAIgmE,EACXjB,GAAO/kE,EAAIimE,EACXjB,GAAOhlE,EAAIkmE,EACXjB,GAAOjlE,EAAImmE,EAEXlD,IADAjjE,EAAI9N,EAAE,IACIkf,EACV8xD,GAAMljE,EAAIuR,EACV4xD,GAAMnjE,EAAI0R,EACV0xD,GAAMpjE,EAAI6R,EACV0yD,GAAMvkE,EAAIgS,EACVwyD,GAAMxkE,EAAImS,EACVsyD,GAAOzkE,EAAIsS,EACXoyD,GAAO1kE,EAAIyS,EACXkyD,GAAO3kE,EAAI4S,EACXgyD,GAAO5kE,EAAI+S,EACX8xD,GAAO7kE,EAAI8lE,EACXhB,GAAO9kE,EAAI+lE,EACXhB,GAAO/kE,EAAIgmE,EACXhB,GAAOhlE,EAAIimE,EACXhB,GAAOjlE,EAAIkmE,EACXhB,GAAOllE,EAAImmE,EAEXjD,IADAljE,EAAI9N,EAAE,IACIkf,EACV+xD,GAAMnjE,EAAIuR,EACV6xD,GAAMpjE,EAAI0R,EACV6yD,GAAMvkE,EAAI6R,EACV2yD,GAAMxkE,EAAIgS,EACVyyD,GAAOzkE,EAAImS,EACXuyD,GAAO1kE,EAAIsS,EACXqyD,GAAO3kE,EAAIyS,EACXmyD,GAAO5kE,EAAI4S,EACXiyD,GAAO7kE,EAAI+S,EACX+xD,GAAO9kE,EAAI8lE,EACXf,GAAO/kE,EAAI+lE,EACXf,GAAOhlE,EAAIgmE,EACXf,GAAOjlE,EAAIimE,EACXf,GAAOllE,EAAIkmE,EACXf,GAAOnlE,EAAImmE,EAEXhD,IADAnjE,EAAI9N,EAAE,IACIkf,EACVgyD,GAAMpjE,EAAIuR,EACVgzD,GAAMvkE,EAAI0R,EACV8yD,GAAMxkE,EAAI6R,EACV4yD,GAAOzkE,EAAIgS,EACX0yD,GAAO1kE,EAAImS,EACXwyD,GAAO3kE,EAAIsS,EACXsyD,GAAO5kE,EAAIyS,EACXoyD,GAAO7kE,EAAI4S,EACXkyD,GAAO9kE,EAAI+S,EACXgyD,GAAO/kE,EAAI8lE,EACXd,GAAOhlE,EAAI+lE,EACXd,GAAOjlE,EAAIgmE,EACXd,GAAOllE,EAAIimE,EACXd,GAAOnlE,EAAIkmE,EACXd,GAAOplE,EAAImmE,EAEX/C,IADApjE,EAAI9N,EAAE,IACIkf,EACVmzD,GAAMvkE,EAAIuR,EACVizD,GAAMxkE,EAAI0R,EACV+yD,GAAOzkE,EAAI6R,EACX6yD,GAAO1kE,EAAIgS,EACX2yD,GAAO3kE,EAAImS,EACXyyD,GAAO5kE,EAAIsS,EACXuyD,GAAO7kE,EAAIyS,EACXqyD,GAAO9kE,EAAI4S,EACXmyD,GAAO/kE,EAAI+S,EACXiyD,GAAOhlE,EAAI8lE,EACXb,GAAOjlE,EAAI+lE,EACXb,GAAOllE,EAAIgmE,EACXb,GAAOnlE,EAAIimE,EACXb,GAAOplE,EAAIkmE,EACXb,GAAOrlE,EAAImmE,EAEX5B,IADAvkE,EAAI9N,EAAE,IACIkf,EACVozD,GAAMxkE,EAAIuR,EACVkzD,GAAOzkE,EAAI0R,EACXgzD,GAAO1kE,EAAI6R,EACX8yD,GAAO3kE,EAAIgS,EACX4yD,GAAO5kE,EAAImS,EACX0yD,GAAO7kE,EAAIsS,EACXwyD,GAAO9kE,EAAIyS,EACXsyD,GAAO/kE,EAAI4S,EACXoyD,GAAOhlE,EAAI+S,EACXkyD,GAAOjlE,EAAI8lE,EACXZ,GAAOllE,EAAI+lE,EACXZ,GAAOnlE,EAAIgmE,EACXZ,GAAOplE,EAAIimE,EACXZ,GAAOrlE,EAAIkmE,EACXZ,GAAOtlE,EAAImmE,EAEX3B,IADAxkE,EAAI9N,EAAE,IACIkf,EACVqzD,GAAOzkE,EAAIuR,EACXmzD,GAAO1kE,EAAI0R,EACXizD,GAAO3kE,EAAI6R,EACX+yD,GAAO5kE,EAAIgS,EACX6yD,GAAO7kE,EAAImS,EACX2yD,GAAO9kE,EAAIsS,EACXyyD,GAAO/kE,EAAIyS,EACXuyD,GAAOhlE,EAAI4S,EACXqyD,GAAOjlE,EAAI+S,EACXmyD,GAAOllE,EAAI8lE,EACXX,GAAOnlE,EAAI+lE,EACXX,GAAOplE,EAAIgmE,EACXX,GAAOrlE,EAAIimE,EACXX,GAAOtlE,EAAIkmE,EACXX,GAAOvlE,EAAImmE,EAEX1B,IADAzkE,EAAI9N,EAAE,KACKkf,EACXszD,GAAO1kE,EAAIuR,EACXozD,GAAO3kE,EAAI0R,EACXkzD,GAAO5kE,EAAI6R,EACXgzD,GAAO7kE,EAAIgS,EACX8yD,GAAO9kE,EAAImS,EACX4yD,GAAO/kE,EAAIsS,EACX0yD,GAAOhlE,EAAIyS,EACXwyD,GAAOjlE,EAAI4S,EACXsyD,GAAOllE,EAAI+S,EACXoyD,GAAOnlE,EAAI8lE,EACXV,GAAOplE,EAAI+lE,EACXV,GAAOrlE,EAAIgmE,EACXV,GAAOtlE,EAAIimE,EACXV,GAAOvlE,EAAIkmE,EACXV,GAAOxlE,EAAImmE,EAEXzB,IADA1kE,EAAI9N,EAAE,KACKkf,EACXuzD,GAAO3kE,EAAIuR,EACXqzD,GAAO5kE,EAAI0R,EACXmzD,GAAO7kE,EAAI6R,EACXizD,GAAO9kE,EAAIgS,EACX+yD,GAAO/kE,EAAImS,EACX6yD,GAAOhlE,EAAIsS,EACX2yD,GAAOjlE,EAAIyS,EACXyyD,GAAOllE,EAAI4S,EACXuyD,GAAOnlE,EAAI+S,EACXqyD,GAAOplE,EAAI8lE,EACXT,GAAOrlE,EAAI+lE,EACXT,GAAOtlE,EAAIgmE,EACXT,GAAOvlE,EAAIimE,EACXT,GAAOxlE,EAAIkmE,EACXT,GAAOzlE,EAAImmE,EAEXxB,IADA3kE,EAAI9N,EAAE,KACKkf,EACXwzD,GAAO5kE,EAAIuR,EACXszD,GAAO7kE,EAAI0R,EACXozD,GAAO9kE,EAAI6R,EACXkzD,GAAO/kE,EAAIgS,EACXgzD,GAAOhlE,EAAImS,EACX8yD,GAAOjlE,EAAIsS,EACX4yD,GAAOllE,EAAIyS,EACX0yD,GAAOnlE,EAAI4S,EACXwyD,GAAOplE,EAAI+S,EACXsyD,GAAOrlE,EAAI8lE,EACXR,GAAOtlE,EAAI+lE,EACXR,GAAOvlE,EAAIgmE,EACXR,GAAOxlE,EAAIimE,EACXR,GAAOzlE,EAAIkmE,EACXR,GAAO1lE,EAAImmE,EAEXvB,IADA5kE,EAAI9N,EAAE,KACKkf,EACXyzD,GAAO7kE,EAAIuR,EACXuzD,GAAO9kE,EAAI0R,EACXqzD,GAAO/kE,EAAI6R,EACXmzD,GAAOhlE,EAAIgS,EACXizD,GAAOjlE,EAAImS,EACX+yD,GAAOllE,EAAIsS,EACX6yD,GAAOnlE,EAAIyS,EACX2yD,GAAOplE,EAAI4S,EACXyyD,GAAOrlE,EAAI+S,EACXuyD,GAAOtlE,EAAI8lE,EACXP,GAAOvlE,EAAI+lE,EACXP,GAAOxlE,EAAIgmE,EACXP,GAAOzlE,EAAIimE,EACXP,GAAO1lE,EAAIkmE,EACXP,GAAO3lE,EAAImmE,EAEXtB,IADA7kE,EAAI9N,EAAE,KACKkf,EACX0zD,GAAO9kE,EAAIuR,EACXwzD,GAAO/kE,EAAI0R,EACXszD,GAAOhlE,EAAI6R,EACXozD,GAAOjlE,EAAIgS,EACXkzD,GAAOllE,EAAImS,EACXgzD,GAAOnlE,EAAIsS,EACX8yD,GAAOplE,EAAIyS,EACX4yD,GAAOrlE,EAAI4S,EACX0yD,GAAOtlE,EAAI+S,EACXwyD,GAAOvlE,EAAI8lE,EACXN,GAAOxlE,EAAI+lE,EACXN,GAAOzlE,EAAIgmE,EACXN,GAAO1lE,EAAIimE,EACXN,GAAO3lE,EAAIkmE,EACXN,GAAO5lE,EAAImmE,EAEXrB,IADA9kE,EAAI9N,EAAE,KACKkf,EAkBX0xD,GAAO,IAhBPkC,GAAOhlE,EAAI0R,GAiBXqxD,GAAO,IAhBPkC,GAAOjlE,EAAI6R,GAiBXmxD,GAAO,IAhBPkC,GAAOllE,EAAIgS,GAiBXixD,GAAO,IAhBPkC,GAAOnlE,EAAImS,GAiBX+wD,GAAO,IAhBPkC,GAAOplE,EAAIsS,GAiBX6wD,GAAO,IAhBPkC,GAAOrlE,EAAIyS,GAiBX2wD,GAAO,IAhBPkC,GAAOtlE,EAAI4S,GAiBX2xD,GAAO,IAhBPgB,GAAOvlE,EAAI+S,GAiBXyxD,GAAO,IAhBPgB,GAAOxlE,EAAI8lE,GAiBXrB,GAAO,IAhBPgB,GAAOzlE,EAAI+lE,GAiBXrB,GAAO,IAhBPgB,GAAO1lE,EAAIgmE,GAiBXrB,GAAO,IAhBPgB,GAAO3lE,EAAIimE,GAiBXrB,GAAO,IAhBPgB,GAAO5lE,EAAIkmE,GAiBXrB,GAAO,IAhBPgB,GAAO7lE,EAAImmE,GAqBsCtD,GAAjD7iE,GAnBA6iE,GAAO,IAhBPkC,GAAO/kE,EAAIuR,KAkCXnoB,EAAI,GACU,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACS8iE,GAAjD9iE,EAAK8iE,EAAK15E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACS+iE,GAAjD/iE,EAAK+iE,EAAK35E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSgjE,GAAjDhjE,EAAKgjE,EAAK55E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSijE,GAAjDjjE,EAAKijE,EAAK75E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSkjE,GAAjDljE,EAAKkjE,EAAK95E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSmjE,GAAjDnjE,EAAKmjE,EAAK/5E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSojE,GAAjDpjE,EAAKojE,EAAKh6E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSukE,GAAjDvkE,EAAKukE,EAAKn7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSwkE,GAAjDxkE,EAAKwkE,EAAKp7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQykE,GAAhDzkE,EAAIykE,EAAMr7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ0kE,GAAhD1kE,EAAI0kE,EAAMt7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ2kE,GAAhD3kE,EAAI2kE,EAAMv7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ4kE,GAAhD5kE,EAAI4kE,EAAMx7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ6kE,GAAhD7kE,EAAI6kE,EAAMz7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ8kE,GAAhD9kE,EAAI8kE,EAAM17E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QAKS6iE,GAAjD7iE,GAJA6iE,GAAMz5E,EAAE,EAAI,IAAMA,EAAE,KAGpBA,EAAI,GACU,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACS8iE,GAAjD9iE,EAAK8iE,EAAK15E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACS+iE,GAAjD/iE,EAAK+iE,EAAK35E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSgjE,GAAjDhjE,EAAKgjE,EAAK55E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSijE,GAAjDjjE,EAAKijE,EAAK75E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSkjE,GAAjDljE,EAAKkjE,EAAK95E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSmjE,GAAjDnjE,EAAKmjE,EAAK/5E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSojE,GAAjDpjE,EAAKojE,EAAKh6E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSukE,GAAjDvkE,EAAKukE,EAAKn7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACSwkE,GAAjDxkE,EAAKwkE,EAAKp7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQykE,GAAhDzkE,EAAIykE,EAAMr7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ0kE,GAAhD1kE,EAAI0kE,EAAMt7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ2kE,GAAhD3kE,EAAI2kE,EAAMv7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ4kE,GAAhD5kE,EAAI4kE,EAAMx7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ6kE,GAAhD7kE,EAAI6kE,EAAMz7E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACQ8kE,GAAhD9kE,EAAI8kE,EAAM17E,EAAI,OAAgD,OAAzCA,EAAIH,KAAKO,MAAMwW,EAAI,QACxC6iE,GAAMz5E,EAAE,EAAI,IAAMA,EAAE,GAEpBimB,EAAG,GAAKwzD,EACRxzD,EAAG,GAAKyzD,EACRzzD,EAAG,GAAK0zD,EACR1zD,EAAG,GAAK2zD,EACR3zD,EAAG,GAAK4zD,EACR5zD,EAAG,GAAK6zD,EACR7zD,EAAG,GAAK8zD,EACR9zD,EAAG,GAAK+zD,EACR/zD,EAAG,GAAKk1D,EACRl1D,EAAG,GAAKm1D,EACRn1D,EAAE,IAAMo1D,EACRp1D,EAAE,IAAMq1D,EACRr1D,EAAE,IAAMs1D,EACRt1D,EAAE,IAAMu1D,EACRv1D,EAAE,IAAMw1D,EACRx1D,EAAE,IAAMy1D,CACV,CAEA,SAASsB,EAAE/2D,EAAGnd,GACZoyE,EAAEj1D,EAAGnd,EAAGA,EACV,CAEA,SAASm0E,EAASh3D,EAAGjpB,GACnB,IACI8L,EADA9I,EAAI01E,IAER,IAAK5sE,EAAI,EAAGA,EAAI,GAAIA,IAAK9I,EAAE8I,GAAK9L,EAAE8L,GAClC,IAAKA,EAAI,IAAKA,GAAK,EAAGA,IACpBk0E,EAAEh9E,EAAGA,GACI,IAAN8I,GAAiB,IAANA,GAASoyE,EAAEl7E,EAAGA,EAAGhD,GAEjC,IAAK8L,EAAI,EAAGA,EAAI,GAAIA,IAAKmd,EAAEnd,GAAK9I,EAAE8I,EACpC,CAEA,SAASo0E,EAAQj3D,EAAGjpB,GAClB,IACI8L,EADA9I,EAAI01E,IAER,IAAK5sE,EAAI,EAAGA,EAAI,GAAIA,IAAK9I,EAAE8I,GAAK9L,EAAE8L,GAClC,IAAKA,EAAI,IAAKA,GAAK,EAAGA,IAClBk0E,EAAEh9E,EAAGA,GACI,IAAN8I,GAASoyE,EAAEl7E,EAAGA,EAAGhD,GAExB,IAAK8L,EAAI,EAAGA,EAAI,GAAIA,IAAKmd,EAAEnd,GAAK9I,EAAE8I,EACpC,CAEA,SAASq0E,EAAkBvxD,EAAG9mB,EAAGopB,GAC/B,IAC8BxN,EAAG1jB,EAD7Bw2B,EAAI,IAAIp1B,WAAW,IACnB2K,EAAI,IAAI6sE,aAAa,IACrB9sE,EAAI4sE,IAAM1yE,EAAI0yE,IAAM11E,EAAI01E,IACxBj2E,EAAIi2E,IAAMv2E,EAAIu2E,IAAMxsC,EAAIwsC,IAC5B,IAAK14E,EAAI,EAAGA,EAAI,GAAIA,IAAKw2B,EAAEx2B,GAAK8H,EAAE9H,GAIlC,IAHAw2B,EAAE,IAAW,IAAN1uB,EAAE,IAAS,GAClB0uB,EAAE,IAAI,IACNwnD,EAAYjyE,EAAEmlB,GACTlxB,EAAI,EAAGA,EAAI,GAAIA,IAClBgG,EAAEhG,GAAG+L,EAAE/L,GACPyC,EAAEzC,GAAG8L,EAAE9L,GAAGgD,EAAEhD,GAAG,EAGjB,IADA8L,EAAE,GAAGrJ,EAAE,GAAG,EACLzC,EAAE,IAAKA,GAAG,IAAKA,EAElB49E,EAAS9xE,EAAE9F,EADX0d,EAAG8S,EAAEx2B,IAAI,MAAQ,EAAFA,GAAM,GAErB49E,EAAS56E,EAAEP,EAAEihB,GACb2N,EAAElvB,EAAE2J,EAAE9I,GACNi7E,EAAEnyE,EAAEA,EAAE9I,GACNquB,EAAEruB,EAAEgD,EAAEvD,GACNw7E,EAAEj4E,EAAEA,EAAEvD,GACNu9E,EAAEv9E,EAAEN,GACJ69E,EAAE9zC,EAAEpgC,GACJoyE,EAAEpyE,EAAE9I,EAAE8I,GACNoyE,EAAEl7E,EAAEgD,EAAE7D,GACNkvB,EAAElvB,EAAE2J,EAAE9I,GACNi7E,EAAEnyE,EAAEA,EAAE9I,GACNg9E,EAAEh6E,EAAE8F,GACJmyE,EAAEj7E,EAAEP,EAAEypC,GACNgyC,EAAEpyE,EAAE9I,EAAEk2E,GACN7nD,EAAEvlB,EAAEA,EAAErJ,GACNy7E,EAAEl7E,EAAEA,EAAE8I,GACNoyE,EAAEpyE,EAAErJ,EAAEypC,GACNgyC,EAAEz7E,EAAEuD,EAAE+F,GACNi0E,EAAEh6E,EAAE7D,GACJy7E,EAAS9xE,EAAE9F,EAAE0d,GACbk6D,EAAS56E,EAAEP,EAAEihB,GAEf,IAAK1jB,EAAI,EAAGA,EAAI,GAAIA,IAClB+L,EAAE/L,EAAE,IAAI8L,EAAE9L,GACV+L,EAAE/L,EAAE,IAAIgD,EAAEhD,GACV+L,EAAE/L,EAAE,IAAIgG,EAAEhG,GACV+L,EAAE/L,EAAE,IAAIyC,EAAEzC,GAEZ,IAAIogF,EAAMr0E,EAAEyC,SAAS,IACjB6xE,EAAMt0E,EAAEyC,SAAS,IAIrB,OAHAyxE,EAASG,EAAIA,GACblC,EAAEmC,EAAIA,EAAID,GACVvC,EAAUjvD,EAAEyxD,GACL,CACT,CAEA,SAASC,EAAuB1xD,EAAG9mB,GACjC,OAAOq4E,EAAkBvxD,EAAG9mB,EAAGixE,EACjC,CAEA,SAASwH,EAAmBv0E,EAAGD,GAE7B,OADA8sE,EAAY9sE,EAAG,IACRu0E,EAAuBt0E,EAAGD,EACnC,CAEA,SAASy0E,EAAoB96D,EAAG1Z,EAAGD,GACjC,IAAIrJ,EAAI,IAAItB,WAAW,IAEvB,OADA++E,EAAkBz9E,EAAGqJ,EAAGC,GACjB8vE,EAAqBp2D,EAAGozD,EAAIp2E,EAAGs5E,EACxC,CA53BAQ,EAASj4E,UAAUk8E,OAAS,SAASr+E,EAAG+5E,EAAMzuE,GA2B5C,IA1BA,IACI+uE,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIh6E,EAChC09E,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAFpCC,EAAQ95E,KAAK41E,IAAM,EAAK,KAIxBmE,EAAK/5E,KAAK8nB,EAAE,GACZkyD,EAAKh6E,KAAK8nB,EAAE,GACZmyD,EAAKj6E,KAAK8nB,EAAE,GACZoyD,EAAKl6E,KAAK8nB,EAAE,GACZqyD,EAAKn6E,KAAK8nB,EAAE,GACZsyD,EAAKp6E,KAAK8nB,EAAE,GACZuyD,EAAKr6E,KAAK8nB,EAAE,GACZwyD,EAAKt6E,KAAK8nB,EAAE,GACZyyD,EAAKv6E,KAAK8nB,EAAE,GACZ0yD,EAAKx6E,KAAK8nB,EAAE,GAEZ2yD,EAAKz6E,KAAKoc,EAAE,GACZs+D,EAAK16E,KAAKoc,EAAE,GACZsN,EAAK1pB,KAAKoc,EAAE,GACZu+D,EAAK36E,KAAKoc,EAAE,GACZw+D,EAAK56E,KAAKoc,EAAE,GACZy+D,EAAK76E,KAAKoc,EAAE,GACZ0+D,EAAK96E,KAAKoc,EAAE,GACZ2+D,EAAK/6E,KAAKoc,EAAE,GACZ4+D,EAAKh7E,KAAKoc,EAAE,GACZ6+D,EAAKj7E,KAAKoc,EAAE,GAEThW,GAAS,IAcdgzE,EAFA19E,EAAI,EAGJ09E,IAdmDW,GAAmC,MAAtF5E,EAAkB,IAAbr6E,EAAE+5E,EAAM,IAA0B,IAAb/5E,EAAE+5E,EAAM,KAAc,IAcrC4F,EACXrB,IAdmDY,GAAmC,MAA3B7E,IAAO,IAAlEC,EAAkB,IAAbt6E,EAAE+5E,EAAM,IAA0B,IAAb/5E,EAAE+5E,EAAM,KAAc,IAAgC,KAcpE,EAAIoG,GAChB7B,IAdmDa,GAAmC,MAA3B7E,IAAO,IAAlEC,EAAkB,IAAbv6E,EAAE+5E,EAAM,IAA0B,IAAb/5E,EAAE+5E,EAAM,KAAc,IAAgC,KAcpE,EAAImG,GAChB5B,IAdmDc,GAAmC,MAA3B7E,IAAQ,GAAnEC,EAAkB,IAAbx6E,EAAE+5E,EAAM,IAA0B,IAAb/5E,EAAE+5E,EAAM,KAAc,IAAgC,KAcpE,EAAIkG,GAEhBr/E,GADA09E,IAdmDe,GAAmC,MAA3B7E,IAAQ,GAAnEC,EAAkB,IAAbz6E,EAAE+5E,EAAM,IAA0B,IAAb/5E,EAAE+5E,EAAM,KAAc,IAA+B,MAcnE,EAAIiG,MACJ,GAAK1B,GAAM,KACvBA,IAfAgB,GAAQ7E,IAAQ,EAAM,OAeV,EAAIsF,GAChBzB,IAfmDiB,GAAmC,MAA3B9E,IAAO,IAAlEC,EAAkB,IAAb16E,EAAE+5E,EAAK,KAA2B,IAAb/5E,EAAE+5E,EAAK,MAAe,IAAgC,KAepE,EAAI+F,GAChBxB,IAfmDkB,GAAmC,MAA3B9E,IAAO,IAAlEC,EAAkB,IAAb36E,EAAE+5E,EAAK,KAA2B,IAAb/5E,EAAE+5E,EAAK,MAAe,IAAgC,KAepE,EAAI8F,GAChBvB,IAfmDmB,GAAmC,MAA3B9E,IAAQ,GAAnEC,EAAkB,IAAb56E,EAAE+5E,EAAK,KAA2B,IAAb/5E,EAAE+5E,EAAK,MAAe,IAAgC,KAepE,EAAInrD,GAIhB2vD,EAFA39E,IADA09E,IAfAoB,GAAQ9E,IAAO,EAAMoE,IAeT,EAAIY,MACH,GAGbrB,GAAMU,EAAKW,EACXrB,GAAMW,EAAKS,EACXpB,GAAMY,GAAM,EAAIgB,GAChB5B,GAAMa,GAAM,EAAIc,GAEhBt/E,GADA29E,GAAMc,GAAM,EAAIY,MACJ,GAAK1B,GAAM,KACvBA,GAAMe,GAAM,EAAIU,GAChBzB,GAAMgB,GAAM,EAAIQ,GAChBxB,GAAMiB,GAAM,EAAIM,GAChBvB,GAAMkB,GAAM,EAAII,GAEhBj/E,IADA29E,GAAMmB,GAAM,EAAI9wD,MACH,GAAK2vD,GAAM,KAExBC,EAAK59E,EACL49E,GAAMS,EAAKrwD,EACX4vD,GAAMU,EAAKU,EACXpB,GAAMW,EAAKQ,EACXnB,GAAMY,GAAM,EAAIe,GAEhBv/E,GADA49E,GAAMa,GAAM,EAAIa,MACJ,GAAK1B,GAAM,KACvBA,GAAMc,GAAM,EAAIW,GAChBzB,GAAMe,GAAM,EAAIS,GAChBxB,GAAMgB,GAAM,EAAIO,GAChBvB,GAAMiB,GAAM,EAAIK,GAIhBrB,EAFA79E,IADA49E,GAAMkB,GAAM,EAAIG,MACH,GAGbpB,GAAMQ,EAAKY,EACXpB,GAAMS,EAAKtwD,EACX6vD,GAAMU,EAAKS,EACXnB,GAAMW,EAAKO,EAEX/+E,GADA69E,GAAMY,GAAM,EAAIc,MACJ,GAAK1B,GAAM,KACvBA,GAAMa,GAAM,EAAIY,GAChBzB,GAAMc,GAAM,EAAIU,GAChBxB,GAAMe,GAAM,EAAIQ,GAChBvB,GAAMgB,GAAM,EAAIM,GAIhBrB,EAFA99E,IADA69E,GAAMiB,GAAM,EAAII,MACH,GAGbpB,GAAMO,EAAKa,EACXpB,GAAMQ,EAAKW,EACXnB,GAAMS,EAAKvwD,EACX8vD,GAAMU,EAAKQ,EAEXh/E,GADA89E,GAAMW,EAAKM,KACC,GAAKjB,GAAM,KACvBA,GAAMY,GAAM,EAAIa,GAChBzB,GAAMa,GAAM,EAAIW,GAChBxB,GAAMc,GAAM,EAAIS,GAChBvB,GAAMe,GAAM,EAAIO,GAIhBrB,EAFA/9E,IADA89E,GAAMgB,GAAM,EAAIK,MACH,GAGbpB,GAAMM,EAAKc,EACXpB,GAAMO,EAAKY,EACXnB,GAAMQ,EAAKU,EACXlB,GAAMS,EAAKxwD,EAEXhuB,GADA+9E,GAAMU,EAAKO,KACC,GAAKjB,GAAM,KACvBA,GAAMW,EAAKK,EACXhB,GAAMY,GAAM,EAAIY,GAChBxB,GAAMa,GAAM,EAAIU,GAChBvB,GAAMc,GAAM,EAAIQ,GAIhBrB,EAFAh+E,IADA+9E,GAAMe,GAAM,EAAIM,MACH,GAGbpB,GAAMK,EAAKe,EACXpB,GAAMM,EAAKa,EACXnB,GAAMO,EAAKW,EACXlB,GAAMQ,EAAKS,EAEXj/E,GADAg+E,GAAMS,EAAKzwD,KACC,GAAKgwD,GAAM,KACvBA,GAAMU,EAAKM,EACXhB,GAAMW,EAAKI,EACXf,GAAMY,GAAM,EAAIW,GAChBvB,GAAMa,GAAM,EAAIS,GAIhBrB,EAFAj+E,IADAg+E,GAAMc,GAAM,EAAIO,MACH,GAGbpB,GAAMI,EAAKgB,EACXpB,GAAMK,EAAKc,EACXnB,GAAMM,EAAKY,EACXlB,GAAMO,EAAKU,EAEXl/E,GADAi+E,GAAMQ,EAAKQ,KACC,GAAKhB,GAAM,KACvBA,GAAMS,EAAK1wD,EACXiwD,GAAMU,EAAKK,EACXf,GAAMW,EAAKG,EACXd,GAAMY,GAAM,EAAIU,GAIhBrB,EAFAl+E,IADAi+E,GAAMa,GAAM,EAAIQ,MACH,GAGbpB,GAAMG,EAAKiB,EACXpB,GAAMI,EAAKe,EACXnB,GAAMK,EAAKa,EACXlB,GAAMM,EAAKW,EAEXn/E,GADAk+E,GAAMO,EAAKS,KACC,GAAKhB,GAAM,KACvBA,GAAMQ,EAAKO,EACXf,GAAMS,EAAK3wD,EACXkwD,GAAMU,EAAKI,EACXd,GAAMW,EAAKE,EAIXZ,EAFAn+E,IADAk+E,GAAMY,GAAM,EAAIS,MACH,GAGbpB,GAAME,EAAKkB,EACXpB,GAAMG,EAAKgB,EACXnB,GAAMI,EAAKc,EACXlB,GAAMK,EAAKY,EAEXp/E,GADAm+E,GAAMM,EAAKU,KACC,GAAKhB,GAAM,KACvBA,GAAMO,EAAKQ,EACXf,GAAMQ,EAAKM,EACXd,GAAMS,EAAK5wD,EACXmwD,GAAMU,EAAKG,EAUXX,EAJAX,EAAS,MADT19E,GADAA,IAFAA,IADAm+E,GAAMW,EAAKC,KACE,KAED,GAAK/+E,EAAM,IAhIL09E,GAAM,MAiIT,GAMfY,EAHAX,GADA39E,KAAW,GAKXu+E,EA5GkBX,GAAM,KA6GxBY,EA/FkBX,GAAM,KAgGxBY,EAlFkBX,GAAM,KAmFxBY,EArEkBX,GAAM,KAsExBY,EAxDkBX,GAAM,KAyDxBY,EA3CkBX,GAAM,KA4CxBY,EA9BkBX,GAAM,KA+BxBY,EAjBkBX,GAAM,KAmBxBhF,GAAQ,GACRzuE,GAAS,GAEXpG,KAAK8nB,EAAE,GAAKiyD,EACZ/5E,KAAK8nB,EAAE,GAAKkyD,EACZh6E,KAAK8nB,EAAE,GAAKmyD,EACZj6E,KAAK8nB,EAAE,GAAKoyD,EACZl6E,KAAK8nB,EAAE,GAAKqyD,EACZn6E,KAAK8nB,EAAE,GAAKsyD,EACZp6E,KAAK8nB,EAAE,GAAKuyD,EACZr6E,KAAK8nB,EAAE,GAAKwyD,EACZt6E,KAAK8nB,EAAE,GAAKyyD,EACZv6E,KAAK8nB,EAAE,GAAK0yD,GAGdtF,EAASj4E,UAAU84E,OAAS,SAASmF,EAAKC,GACxC,IACIz/E,EAAGqsB,EAAM6c,EAAGlsC,EADZyxB,EAAI,IAAIgkC,YAAY,IAGxB,GAAInuD,KAAK21E,SAAU,CAGjB,IAFAj9E,EAAIsH,KAAK21E,SACT31E,KAAKxF,OAAO9B,KAAO,EACZA,EAAI,GAAIA,IAAKsH,KAAKxF,OAAO9B,GAAK,EACrCsH,KAAK41E,IAAM,EACX51E,KAAKm5E,OAAOn5E,KAAKxF,OAAQ,EAAG,GAC7B,CAID,IAFAkB,EAAIsE,KAAK8nB,EAAE,KAAO,GAClB9nB,KAAK8nB,EAAE,IAAM,KACRpvB,EAAI,EAAGA,EAAI,GAAIA,IAClBsH,KAAK8nB,EAAEpvB,IAAMgD,EACbA,EAAIsE,KAAK8nB,EAAEpvB,KAAO,GAClBsH,KAAK8nB,EAAEpvB,IAAM,KAaf,IAXAsH,KAAK8nB,EAAE,IAAW,EAAJpsB,EACdA,EAAIsE,KAAK8nB,EAAE,KAAO,GAClB9nB,KAAK8nB,EAAE,IAAM,KACb9nB,KAAK8nB,EAAE,IAAMpsB,EACbA,EAAIsE,KAAK8nB,EAAE,KAAO,GAClB9nB,KAAK8nB,EAAE,IAAM,KACb9nB,KAAK8nB,EAAE,IAAMpsB,EAEbyuB,EAAE,GAAKnqB,KAAK8nB,EAAE,GAAK,EACnBpsB,EAAIyuB,EAAE,KAAO,GACbA,EAAE,IAAM,KACHzxB,EAAI,EAAGA,EAAI,GAAIA,IAClByxB,EAAEzxB,GAAKsH,KAAK8nB,EAAEpvB,GAAKgD,EACnBA,EAAIyuB,EAAEzxB,KAAO,GACbyxB,EAAEzxB,IAAM,KAKV,IAHAyxB,EAAE,IAAO,KAETpC,GAAY,EAAJrsB,GAAS,EACZhD,EAAI,EAAGA,EAAI,GAAIA,IAAKyxB,EAAEzxB,IAAMqvB,EAEjC,IADAA,GAAQA,EACHrvB,EAAI,EAAGA,EAAI,GAAIA,IAAKsH,KAAK8nB,EAAEpvB,GAAMsH,KAAK8nB,EAAEpvB,GAAKqvB,EAAQoC,EAAEzxB,GAa5D,IAXAsH,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,GAAc9nB,KAAK8nB,EAAE,IAAM,IAChD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAM,IAChD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAO,GACjD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAO,GACjD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAO,GAAO9nB,KAAK8nB,EAAE,IAAO,EAAM9nB,KAAK8nB,EAAE,IAAM,IACpE9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAM,IAChD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAO,GACjD9nB,KAAK8nB,EAAE,GAAoE,OAA7D9nB,KAAK8nB,EAAE,KAAQ,EAAM9nB,KAAK8nB,EAAE,IAAO,GAEjD8c,EAAI5kC,KAAK8nB,EAAE,GAAK9nB,KAAK4mE,IAAI,GACzB5mE,KAAK8nB,EAAE,GAAS,MAAJ8c,EACPlsC,EAAI,EAAGA,EAAI,EAAGA,IACjBksC,GAAO5kC,KAAK8nB,EAAEpvB,GAAKsH,KAAK4mE,IAAIluE,GAAM,IAAMksC,IAAM,IAAO,EACrD5kC,KAAK8nB,EAAEpvB,GAAS,MAAJksC,EAGds2C,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAQ,GAAMn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,IACrCozD,EAAIC,EAAO,IAAOn7E,KAAK8nB,EAAE,KAAO,EAAK,KAGvCotD,EAASj4E,UAAUqmC,OAAS,SAASxoC,EAAG+5E,EAAMzuE,GAC5C,IAAI1N,EAAG0iF,EAEP,GAAIp7E,KAAK21E,SAAU,CAIjB,KAHAyF,EAAQ,GAAKp7E,KAAK21E,UACPvvE,IACTg1E,EAAOh1E,GACJ1N,EAAI,EAAGA,EAAI0iF,EAAM1iF,IACpBsH,KAAKxF,OAAOwF,KAAK21E,SAAWj9E,GAAKoC,EAAE+5E,EAAKn8E,GAI1C,GAHA0N,GAASg1E,EACTvG,GAAQuG,EACRp7E,KAAK21E,UAAYyF,EACbp7E,KAAK21E,SAAW,GAClB,OACF31E,KAAKm5E,OAAOn5E,KAAKxF,OAAQ,EAAG,IAC5BwF,KAAK21E,SAAW,CACjB,CASD,GAPIvvE,GAAS,KACXg1E,EAAOh1E,EAASA,EAAQ,GACxBpG,KAAKm5E,OAAOr+E,EAAG+5E,EAAMuG,GACrBvG,GAAQuG,EACRh1E,GAASg1E,GAGPh1E,EAAO,CACT,IAAK1N,EAAI,EAAGA,EAAI0N,EAAO1N,IACrBsH,KAAKxF,OAAOwF,KAAK21E,SAAWj9E,GAAKoC,EAAE+5E,EAAKn8E,GAC1CsH,KAAK21E,UAAYvvE,CAClB,GAgkBH,IAAIi1E,EAAqBnF,EACrBoF,EAA0BnF,EAc1B9tC,EAAI,CACN,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGtC,SAASkzC,EAAqBp0C,EAAIC,EAAItsC,EAAG0F,GAyBvC,IAxBA,IACIojB,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EACnCtB,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EAAKG,EACnCw2D,EAAIC,EAAI/iF,EAAG6I,EAAGumB,EAAGuY,EAAG77B,EAAG9F,EAAGhD,EAAGP,EAH7ByhD,EAAK,IAAI+a,WAAW,IAAK9a,EAAK,IAAI8a,WAAW,IAK7C71C,EAAMqlB,EAAG,GACTllB,EAAMklB,EAAG,GACT/kB,EAAM+kB,EAAG,GACT5kB,EAAM4kB,EAAG,GACTzkB,EAAMykB,EAAG,GACTtkB,EAAMskB,EAAG,GACTnkB,EAAMmkB,EAAG,GACThkB,EAAMgkB,EAAG,GAETtlB,EAAMulB,EAAG,GACTplB,EAAMolB,EAAG,GACTjlB,EAAMilB,EAAG,GACT9kB,EAAM8kB,EAAG,GACT3kB,EAAM2kB,EAAG,GACTxkB,EAAMwkB,EAAG,GACTrkB,EAAMqkB,EAAG,GACTlkB,EAAMkkB,EAAG,GAETviC,EAAM,EACHrE,GAAK,KAAK,CACf,IAAK9H,EAAI,EAAGA,EAAI,GAAIA,IAClB6I,EAAI,EAAI7I,EAAImM,EACZ+3C,EAAGlkD,GAAMoC,EAAEyG,EAAE,IAAM,GAAOzG,EAAEyG,EAAE,IAAM,GAAOzG,EAAEyG,EAAE,IAAM,EAAKzG,EAAEyG,EAAE,GAC9Ds7C,EAAGnkD,GAAMoC,EAAEyG,EAAE,IAAM,GAAOzG,EAAEyG,EAAE,IAAM,GAAOzG,EAAEyG,EAAE,IAAM,EAAKzG,EAAEyG,EAAE,GAEhE,IAAK7I,EAAI,EAAGA,EAAI,GAAIA,IA+HlB,GA9HAkrB,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EAGNW,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EACNiC,EAAM9B,EAONve,EAAQ,OAFR67B,EAAInd,GAEYxkB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAI3E,GAIYhoB,EAAI2sB,IAAM,GAM1BtjB,GAAS,OAFT67B,GAAM5d,IAAQ,GAAOC,GAAQ,KAAaD,IAAQ,GAAOC,GAAQ,KAAaA,IAAS,EAAWD,GAAQ,KAEzF/jB,GAAK2hC,IAAM,GAC5B3kC,GAAS,OAJTosB,GAAMpF,IAAQ,GAAOD,GAAQ,KAAaC,IAAQ,GAAOD,GAAQ,KAAaA,IAAS,EAAWC,GAAQ,KAIzFvnB,GAAK2sB,IAAM,GAM5BtjB,GAAS,OAFT67B,EAAK5d,EAAMG,GAASH,EAAMM,GAETrkB,GAAK2hC,IAAM,GAC5B3kC,GAAS,OAJTosB,EAAKpF,EAAMG,GAASH,EAAMM,GAIT7nB,GAAK2sB,IAAM,GAG5BA,EAAIugB,EAAI,EAAF3vC,GAGN8L,GAAS,OAFT67B,EAAIgI,EAAI,EAAF3vC,EAAI,IAEOgG,GAAK2hC,IAAM,GAC5B3kC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAG5BA,EAAI80B,EAAGlkD,EAAE,IAGQgG,IAFjB2hC,EAAIwc,EAAGnkD,EAAE,OAEmB,GAC5BgD,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAG5BpsB,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,GAUX77B,EAAQ,OAFR67B,EAJAo7C,EAAS,MAAJj3E,EAAa9F,GAAK,IAMPA,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAJA0zD,EAAS,MAAJ9/E,GAFLP,GAAKO,IAAM,KAEY,IAQPP,EAAI2sB,IAAM,GAM1BtjB,GAAS,OAFT67B,GAAMxe,IAAQ,GAAOC,GAAQ,IAAaA,IAAS,EAAWD,GAAQ,KAAkBC,IAAS,EAAWD,GAAQ,KAEnGnjB,GAAK2hC,IAAM,GAC5B3kC,GAAS,OAJTosB,GAAMhG,IAAQ,GAAOD,GAAQ,IAAaA,IAAS,EAAWC,GAAQ,KAAkBD,IAAS,EAAWC,GAAQ,KAInG3mB,GAAK2sB,IAAM,GAMXppB,IAFjB2hC,EAAKxe,EAAMG,EAAQH,EAAMM,EAAQH,EAAMG,KAEX,GAC5BzmB,GAAS,OAJTosB,EAAKhG,EAAMG,EAAQH,EAAMM,EAAQH,EAAMG,GAItBjnB,GAAK2sB,IAAM,GAM5B7C,EAAW,OAHXvpB,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,KACXllC,GAAKO,IAAM,KAEgB,GAC3BspB,EAAW,MAAJxgB,EAAe9F,GAAK,GAM3B8F,EAAQ,OAFR67B,EAAIjc,GAEY1lB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAIzD,GAIYlpB,EAAI2sB,IAAM,GAKTppB,IAFjB2hC,EAAIo7C,KAEwB,GAC5B//E,GAAS,OAJTosB,EAAI0zD,GAIargF,GAAK2sB,IAAM,GAS5B7F,EAAM2B,EACNxB,EAAM2B,EACNxB,EAAM2B,EACNxB,EANA2B,EAAW,OAHX3oB,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,KACXllC,GAAKO,IAAM,KAEgB,GAO3BmnB,EAAM2B,EACNxB,EAAM2B,EACNxB,EAAM2B,EACNhD,EAAMmD,EAENjD,EAAM2B,EACNxB,EAAM2B,EACNxB,EAAM2B,EACNxB,EAdA2B,EAAW,MAAJ5f,EAAe9F,GAAK,GAe3BkkB,EAAM2B,EACNxB,EAAM2B,EACNxB,EAAM2B,EACNhD,EAAMmD,EAEFtsB,EAAE,IAAO,GACX,IAAK6I,EAAI,EAAGA,EAAI,GAAIA,IAElBumB,EAAI80B,EAAGr7C,GAGPiD,EAAQ,OAFR67B,EAAIwc,EAAGt7C,IAES7C,EAAI2hC,IAAM,GAC1B3kC,EAAQ,MAAJosB,EAAY3sB,EAAI2sB,IAAM,GAE1BA,EAAI80B,GAAIr7C,EAAE,GAAG,IAGbiD,GAAS,OAFT67B,EAAIwc,GAAIt7C,EAAE,GAAG,KAEI7C,GAAK2hC,IAAM,GAC5B3kC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAG5B0zD,EAAK5+B,GAAIr7C,EAAE,GAAG,IAKdiD,GAAS,OAFT67B,IAFAo7C,EAAK5+B,GAAIt7C,EAAE,GAAG,OAED,EAAMi6E,GAAO,KAAYC,IAAO,EAAMD,GAAO,KAAYC,IAAO,EAAMD,GAAO,KAEzE98E,GAAK2hC,IAAM,GAC5B3kC,GAAS,OAJTosB,GAAM0zD,IAAO,EAAMC,GAAO,KAAYD,IAAO,EAAMC,GAAO,IAAWD,IAAO,GAI3DrgF,GAAK2sB,IAAM,GAG5B0zD,EAAK5+B,GAAIr7C,EAAE,IAAI,IAKE7C,IAFjB2hC,IAFAo7C,EAAK5+B,GAAIt7C,EAAE,IAAI,OAEF,GAAOi6E,GAAO,KAAaA,IAAQ,GAAWC,GAAO,IAAkBA,IAAO,EAAMD,GAAO,OAE5E,GAC5B9/E,GAAS,OAJTosB,GAAM0zD,IAAO,GAAOC,GAAO,KAAaA,IAAQ,GAAWD,GAAO,GAAiBA,IAAO,GAIzErgF,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEXuc,EAAGr7C,GAAU,MAAJ7F,EAAeP,GAAK,GAC7B0hD,EAAGt7C,GAAU,MAAJiD,EAAe9F,GAAK,GASnC8F,EAAQ,OAFR67B,EAAIxe,GAEYnjB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAIhG,GAIY3mB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKrlB,EAAW,MAAJpmB,EAAeP,GAAK,GACnCisC,EAAG,GAAKvlB,EAAW,MAAJrd,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAIre,GAEYtjB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAI7F,GAIY9mB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKllB,EAAW,MAAJvmB,EAAeP,GAAK,GACnCisC,EAAG,GAAKplB,EAAW,MAAJxd,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAIle,GAEYzjB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAI1F,GAIYjnB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAK/kB,EAAW,MAAJ1mB,EAAeP,GAAK,GACnCisC,EAAG,GAAKjlB,EAAW,MAAJ3d,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAI/d,GAEY5jB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAIvF,GAIYpnB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAK5kB,EAAW,MAAJ7mB,EAAeP,GAAK,GACnCisC,EAAG,GAAK9kB,EAAW,MAAJ9d,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAI5d,GAEY/jB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAIpF,GAIYvnB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKzkB,EAAW,MAAJhnB,EAAeP,GAAK,GACnCisC,EAAG,GAAK3kB,EAAW,MAAJje,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAIzd,GAEYlkB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAIjF,GAIY1nB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKtkB,EAAW,MAAJnnB,EAAeP,GAAK,GACnCisC,EAAG,GAAKxkB,EAAW,MAAJpe,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAItd,GAEYrkB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAI9E,GAIY7nB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKnkB,EAAW,MAAJtnB,EAAeP,GAAK,GACnCisC,EAAG,GAAKrkB,EAAW,MAAJve,EAAe9F,GAAK,GAKnC8F,EAAQ,OAFR67B,EAAInd,GAEYxkB,EAAI2hC,IAAM,GAC1B3kC,EAAQ,OAJRosB,EAAI3E,GAIYhoB,EAAI2sB,IAAM,GAE1BA,EAAIqf,EAAG,GAGUzoC,IAFjB2hC,EAAI+G,EAAG,MAEqB,GAC5B1rC,GAAS,MAAJosB,EAAY3sB,GAAK2sB,IAAM,GAI5B3sB,IADAO,IADAgD,IAHA8F,GAAS,MAAJ67B,KAGM,MACA,MACA,GAEX8G,EAAG,GAAKhkB,EAAW,MAAJznB,EAAeP,GAAK,GACnCisC,EAAG,GAAKlkB,EAAW,MAAJ1e,EAAe9F,GAAK,GAEnCmG,GAAO,IACPrE,GAAK,GACN,CAED,OAAOA,CACT,CAEA,SAASk7E,EAAYx1E,EAAKpL,EAAG0F,GAC3B,IAGI9H,EAHAyuC,EAAK,IAAIwwB,WAAW,GACpBvwB,EAAK,IAAIuwB,WAAW,GACpBlzD,EAAI,IAAI3K,WAAW,KAChB4E,EAAI8B,EAuBX,IArBA2mC,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,UACRA,EAAG,GAAK,WAERC,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,WACRA,EAAG,GAAK,UACRA,EAAG,GAAK,WACRA,EAAG,GAAK,UAERm0C,EAAqBp0C,EAAIC,EAAItsC,EAAG0F,GAChCA,GAAK,IAEA9H,EAAI,EAAGA,EAAI8H,EAAG9H,IAAK+L,EAAE/L,GAAKoC,EAAE4D,EAAE8B,EAAE9H,GAQrC,IAPA+L,EAAEjE,GAAK,IAGPiE,GADAjE,EAAI,IAAI,KAAKA,EAAE,IAAI,EAAE,IACjB,GAAK,EACTyxE,EAAKxtE,EAAGjE,EAAE,EAAK9B,EAAI,UAAc,EAAGA,GAAK,GACzC68E,EAAqBp0C,EAAIC,EAAI3iC,EAAGjE,GAE3B9H,EAAI,EAAGA,EAAI,EAAGA,IAAKu5E,EAAK/rE,EAAK,EAAExN,EAAGyuC,EAAGzuC,GAAI0uC,EAAG1uC,IAEjD,OAAO,CACT,CAEA,SAAS8oB,EAAIoI,EAAGtC,GACd,IAAI9iB,EAAI4sE,IAAM1yE,EAAI0yE,IAAM11E,EAAI01E,IACxBj2E,EAAIi2E,IAAMv2E,EAAIu2E,IAAMxsC,EAAIwsC,IACxBjnD,EAAIinD,IAAMtpD,EAAIspD,IAAM5xD,EAAI4xD,IAE5BuF,EAAEnyE,EAAGolB,EAAE,GAAIA,EAAE,IACb+sD,EAAEn3D,EAAG8H,EAAE,GAAIA,EAAE,IACbsvD,EAAEpyE,EAAGA,EAAGgb,GACRuK,EAAErrB,EAAGkrB,EAAE,GAAIA,EAAE,IACbG,EAAEvK,EAAG8H,EAAE,GAAIA,EAAE,IACbsvD,EAAEl4E,EAAGA,EAAG8gB,GACRo3D,EAAEl7E,EAAGkuB,EAAE,GAAItC,EAAE,IACbsvD,EAAEl7E,EAAGA,EAAGm2E,GACR+E,EAAEz7E,EAAGyuB,EAAE,GAAItC,EAAE,IACbyC,EAAE5uB,EAAGA,EAAGA,GACRw7E,EAAE97E,EAAG6D,EAAG8F,GACRmyE,EAAE/xC,EAAGzpC,EAAGO,GACRquB,EAAEI,EAAGhvB,EAAGO,GACRquB,EAAEjC,EAAGppB,EAAG8F,GAERoyE,EAAEhtD,EAAE,GAAI/uB,EAAG+pC,GACXgyC,EAAEhtD,EAAE,GAAI9B,EAAGqC,GACXysD,EAAEhtD,EAAE,GAAIO,EAAGya,GACXgyC,EAAEhtD,EAAE,GAAI/uB,EAAGitB,EACb,CAEA,SAAS6zD,EAAM/xD,EAAGtC,EAAG5oB,GACnB,IAAIhG,EACJ,IAAKA,EAAI,EAAGA,EAAI,EAAGA,IACjB49E,EAAS1sD,EAAElxB,GAAI4uB,EAAE5uB,GAAIgG,EAEzB,CAEA,SAASk9E,EAAKx/D,EAAGwN,GACf,IAAIyyC,EAAK+U,IAAMyK,EAAKzK,IAAM0K,EAAK1K,IAC/BuH,EAASmD,EAAIlyD,EAAE,IACfgtD,EAAEva,EAAIzyC,EAAE,GAAIkyD,GACZlF,EAAEiF,EAAIjyD,EAAE,GAAIkyD,GACZvF,EAAUn6D,EAAGy/D,GACbz/D,EAAE,KAAOq6D,EAASpa,IAAO,CAC3B,CAEA,SAAS0f,GAAWnyD,EAAGtC,EAAGlsB,GACxB,IAAIsD,EAAGhG,EAKP,IAJA09E,EAASxsD,EAAE,GAAI8nD,GACf0E,EAASxsD,EAAE,GAAI+nD,GACfyE,EAASxsD,EAAE,GAAI+nD,GACfyE,EAASxsD,EAAE,GAAI8nD,GACVh5E,EAAI,IAAKA,GAAK,IAAKA,EAEtBijF,EAAM/xD,EAAGtC,EADT5oB,EAAKtD,EAAG1C,EAAE,EAAG,KAAS,EAAFA,GAAQ,GAE5B8oB,EAAI8F,EAAGsC,GACPpI,EAAIoI,EAAGA,GACP+xD,EAAM/xD,EAAGtC,EAAG5oB,EAEhB,CAEA,SAASs9E,GAAWpyD,EAAGxuB,GACrB,IAAIksB,EAAI,CAAC8pD,IAAMA,IAAMA,IAAMA,KAC3BgF,EAAS9uD,EAAE,GAAIwqD,GACfsE,EAAS9uD,EAAE,GAAIyqD,GACfqE,EAAS9uD,EAAE,GAAIqqD,GACfiF,EAAEtvD,EAAE,GAAIwqD,EAAGC,GACXgK,GAAWnyD,EAAGtC,EAAGlsB,EACnB,CAEA,SAAS6gF,GAAoBC,EAAIC,EAAIC,GACnC,IAEI1jF,EAFAyC,EAAI,IAAIrB,WAAW,IACnB8vB,EAAI,CAACwnD,IAAMA,IAAMA,IAAMA,KAY3B,IATKgL,GAAQ7K,EAAY4K,EAAI,IAC7BT,EAAYvgF,EAAGghF,EAAI,IACnBhhF,EAAE,IAAM,IACRA,EAAE,KAAO,IACTA,EAAE,KAAO,GAET6gF,GAAWpyD,EAAGzuB,GACdygF,EAAKM,EAAItyD,GAEJlxB,EAAI,EAAGA,EAAI,GAAIA,IAAKyjF,EAAGzjF,EAAE,IAAMwjF,EAAGxjF,GACvC,OAAO,CACT,CAEA,IAAI2jF,GAAI,IAAI/K,aAAa,CAAC,IAAM,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,GAAM,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAEvK,SAASgL,GAAKlgE,EAAG3X,GACf,IAAI0Z,EAAOzlB,EAAG6I,EAAG6c,EACjB,IAAK1lB,EAAI,GAAIA,GAAK,KAAMA,EAAG,CAEzB,IADAylB,EAAQ,EACH5c,EAAI7I,EAAI,GAAI0lB,EAAI1lB,EAAI,GAAI6I,EAAI6c,IAAK7c,EACpCkD,EAAElD,IAAM4c,EAAQ,GAAK1Z,EAAE/L,GAAK2jF,GAAE96E,GAAK7I,EAAI,KACvCylB,EAAQ5iB,KAAKO,OAAO2I,EAAElD,GAAK,KAAO,KAClCkD,EAAElD,IAAc,IAAR4c,EAEV1Z,EAAElD,IAAM4c,EACR1Z,EAAE/L,GAAK,CACR,CAED,IADAylB,EAAQ,EACH5c,EAAI,EAAGA,EAAI,GAAIA,IAClBkD,EAAElD,IAAM4c,GAAS1Z,EAAE,KAAO,GAAK43E,GAAE96E,GACjC4c,EAAQ1Z,EAAElD,IAAM,EAChBkD,EAAElD,IAAM,IAEV,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAKkD,EAAElD,IAAM4c,EAAQk+D,GAAE96E,GAC3C,IAAK7I,EAAI,EAAGA,EAAI,GAAIA,IAClB+L,EAAE/L,EAAE,IAAM+L,EAAE/L,IAAM,EAClB0jB,EAAE1jB,GAAY,IAAP+L,EAAE/L,EAEb,CAEA,SAAS2Z,GAAO+J,GACd,IAA8B1jB,EAA1B+L,EAAI,IAAI6sE,aAAa,IACzB,IAAK54E,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,EAAE/L,GAAK0jB,EAAE1jB,GAClC,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAK0jB,EAAE1jB,GAAK,EAChC4jF,GAAKlgE,EAAG3X,EACV,CAGA,SAAS83E,GAAYC,EAAI1hF,EAAG0F,EAAG27E,GAC7B,IACIzjF,EAAG6I,EADHpG,EAAI,IAAIrB,WAAW,IAAKguB,EAAI,IAAIhuB,WAAW,IAAKsiB,EAAI,IAAItiB,WAAW,IAC7D2K,EAAI,IAAI6sE,aAAa,IAC3B1nD,EAAI,CAACwnD,IAAMA,IAAMA,IAAMA,KAE3BsK,EAAYvgF,EAAGghF,EAAI,IACnBhhF,EAAE,IAAM,IACRA,EAAE,KAAO,IACTA,EAAE,KAAO,GAET,IAAIshF,EAAQj8E,EAAI,GAChB,IAAK9H,EAAI,EAAGA,EAAI8H,EAAG9H,IAAK8jF,EAAG,GAAK9jF,GAAKoC,EAAEpC,GACvC,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAK8jF,EAAG,GAAK9jF,GAAKyC,EAAE,GAAKzC,GAO7C,IALAgjF,EAAYt/D,EAAGogE,EAAGt1E,SAAS,IAAK1G,EAAE,IAClC6R,GAAO+J,GACP4/D,GAAWpyD,EAAGxN,GACdw/D,EAAKY,EAAI5yD,GAEJlxB,EAAI,GAAIA,EAAI,GAAIA,IAAK8jF,EAAG9jF,GAAKyjF,EAAGzjF,GAIrC,IAHAgjF,EAAY5zD,EAAG00D,EAAIh8E,EAAI,IACvB6R,GAAOyV,GAEFpvB,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,EAAE/L,GAAK,EAChC,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAK+L,EAAE/L,GAAK0jB,EAAE1jB,GAClC,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAClB,IAAK6I,EAAI,EAAGA,EAAI,GAAIA,IAClBkD,EAAE/L,EAAE6I,IAAMumB,EAAEpvB,GAAKyC,EAAEoG,GAKvB,OADA+6E,GAAKE,EAAGt1E,SAAS,IAAKzC,GACfg4E,CACT,CAwCA,SAASC,GAAiB5hF,EAAG0hF,EAAIh8E,EAAG07E,GAClC,IAAIxjF,EACA8mB,EAAI,IAAI1lB,WAAW,IAAKguB,EAAI,IAAIhuB,WAAW,IAC3C8vB,EAAI,CAACwnD,IAAMA,IAAMA,IAAMA,KACvB9pD,EAAI,CAAC8pD,IAAMA,IAAMA,IAAMA,KAE3B,GAAI5wE,EAAI,GAAI,OAAQ,EAEpB,GA9CF,SAAmB4b,EAAGwN,GACpB,IAAIpK,EAAI4xD,IAAM9I,EAAM8I,IAAM/2E,EAAM+2E,IAC5BuL,EAAMvL,IAAMwL,EAAOxL,IAAMyL,EAAOzL,IAChC0L,EAAO1L,IA2BX,OAzBAgF,EAASh6D,EAAE,GAAIu1D,GACf+E,EAAYt6D,EAAE,GAAIwN,GAClB8uD,EAAEr+E,EAAK+hB,EAAE,IACTw6D,EAAE+F,EAAKtiF,EAAK6vB,GACZysD,EAAEt8E,EAAKA,EAAK+hB,EAAE,IACd2N,EAAE4yD,EAAKvgE,EAAE,GAAIugE,GAEbjE,EAAEkE,EAAMD,GACRjE,EAAEmE,EAAMD,GACRhG,EAAEkG,EAAMD,EAAMD,GACdhG,EAAEp3D,EAAGs9D,EAAMziF,GACXu8E,EAAEp3D,EAAGA,EAAGm9D,GAER/D,EAAQp5D,EAAGA,GACXo3D,EAAEp3D,EAAGA,EAAGnlB,GACRu8E,EAAEp3D,EAAGA,EAAGm9D,GACR/F,EAAEp3D,EAAGA,EAAGm9D,GACR/F,EAAEx6D,EAAE,GAAIoD,EAAGm9D,GAEXjE,EAAEpQ,EAAKlsD,EAAE,IACTw6D,EAAEtO,EAAKA,EAAKqU,GACRnG,EAASlO,EAAKjuE,IAAMu8E,EAAEx6D,EAAE,GAAIA,EAAE,GAAI41D,GAEtC0G,EAAEpQ,EAAKlsD,EAAE,IACTw6D,EAAEtO,EAAKA,EAAKqU,GACRnG,EAASlO,EAAKjuE,IAAc,GAE5Bo8E,EAASr6D,EAAE,MAASwN,EAAE,KAAK,GAAI+sD,EAAEv6D,EAAE,GAAIs1D,EAAKt1D,EAAE,IAElDw6D,EAAEx6D,EAAE,GAAIA,EAAE,GAAIA,EAAE,IACT,EACT,CAUM2gE,CAAUz1D,EAAG40D,GAAK,OAAQ,EAE9B,IAAKxjF,EAAI,EAAGA,EAAI8H,EAAG9H,IAAKoC,EAAEpC,GAAK8jF,EAAG9jF,GAClC,IAAKA,EAAI,EAAGA,EAAI,GAAIA,IAAKoC,EAAEpC,EAAE,IAAMwjF,EAAGxjF,GAUtC,GATAgjF,EAAY5zD,EAAGhtB,EAAG0F,GAClB6R,GAAOyV,GACPi0D,GAAWnyD,EAAGtC,EAAGQ,GAEjBk0D,GAAW10D,EAAGk1D,EAAGt1E,SAAS,KAC1Bsa,EAAIoI,EAAGtC,GACPs0D,EAAKp8D,EAAGoK,GAERppB,GAAK,GACD8xE,EAAiBkK,EAAI,EAAGh9D,EAAG,GAAI,CACjC,IAAK9mB,EAAI,EAAGA,EAAI8H,EAAG9H,IAAKoC,EAAEpC,GAAK,EAC/B,OAAQ,CACT,CAED,IAAKA,EAAI,EAAGA,EAAI8H,EAAG9H,IAAKoC,EAAEpC,GAAK8jF,EAAG9jF,EAAI,IACtC,OAAO8H,CACT,CAEA,IAGIw8E,GAAgC,GAShCC,GAAoB,GACpBC,GAA6B,GAC7BC,GAA6B,GAiEjC,SAASC,GAAah/D,EAAG5d,GACvB,GAhF8B,KAgF1B4d,EAAE/kB,OAAsC,MAAM,IAAIY,MAAM,gBAC5D,GAhFgC,KAgF5BuG,EAAEnH,OAAwC,MAAM,IAAIY,MAAM,iBAChE,CAOA,SAASojF,KACP,IAAK,IAAI3kF,EAAI,EAAGA,EAAIgH,UAAUrG,OAAQX,IACpC,KAAMgH,UAAUhH,aAAcoB,YAC5B,MAAM,IAAIsD,UAAU,kCAE1B,CAEA,SAASkgF,GAAQ3kF,GACf,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAIU,OAAQX,IAAKC,EAAID,GAAK,CAChD,CAhFAy4E,EAAKoM,SAAW,CACd/I,qBAAsBA,EACtBS,kBAAmBA,EACnBF,cAAeA,EACfJ,0BAA2BA,EAC3BG,sBAAuBA,EACvBe,mBAAoBA,EACpBG,0BAA2BA,EAC3B3D,iBAAkBA,EAClBC,iBAAkBA,EAClB4D,iBAAkBA,EAClBC,sBAAuBA,EACvB0C,kBAAmBA,EACnBG,uBAAwBA,EACxBE,oBAAqBA,EACrBmC,mBAAoBA,EACpBmC,WAxsBF,SAAoB9hF,EAAGZ,EAAGK,EAAGqF,EAAGkE,EAAGD,GACjC,IAAI2Z,EAAI,IAAItkB,WAAW,IAEvB,OADAo/E,EAAoB96D,EAAG1Z,EAAGD,GACnB42E,EAAmB3/E,EAAGZ,EAAGK,EAAGqF,EAAG4d,EACxC,EAqsBEq/D,gBAnsBF,SAAyB3iF,EAAGY,EAAGP,EAAGqF,EAAGkE,EAAGD,GACtC,IAAI2Z,EAAI,IAAItkB,WAAW,IAEvB,OADAo/E,EAAoB96D,EAAG1Z,EAAGD,GACnB62E,EAAwBxgF,EAAGY,EAAGP,EAAGqF,EAAG4d,EAC7C,EAgsBE66D,mBAAoBA,EACpByC,YAAaA,EACba,YAAaA,GACbN,oBAAqBA,GACrBS,iBAAkBA,GAElBgB,0BA1C8B,GA2C9BC,4BA1CgC,GA2ChCC,2BA1C+B,GA2C/BZ,8BAA+BA,GAC/Ba,wBA1C4B,GA2C5BC,8BA1CkC,GA2ClCC,0BA1C8B,GA2C9BC,0BA1C8B,GA2C9BC,yBA1C6B,GA2C7BC,sBAlDgC,GAmDhCC,qBAlD+B,GAmD/BC,wBA1C4BpB,GA2C5BC,kBAAmBA,GACnBC,2BAA4BA,GAC5BC,2BAA4BA,GAC5BkB,sBA1C0B,GA2C1BC,kBA1CsB,GA4CtBlN,GAAIA,EACJlnD,EAAGA,EACHmyD,EAAGA,GACH9F,UAAWA,EACXG,YAAaA,EACbE,EAAGA,EACH7sD,EAAGA,EACH2uD,EAAGA,EACH/B,EAAGA,EACHiC,QAASA,EACTp3D,IAAKA,EACL40D,SAAUA,EACVkG,KAAMA,GACNP,WAAYA,GACZC,WAAYA,IA0Bd7K,EAAKoN,YAAc,SAAS/9E,GAC1B,IAAI9B,EAAI,IAAI5E,WAAW0G,GAEvB,OADA+wE,EAAY7yE,EAAG8B,GACR9B,GAGTyyE,EAAKqN,UAAY,SAAS/xE,EAAKyxB,EAAO7N,GACpCgtD,GAAgB5wE,EAAKyxB,EAAO7N,GAC5B+sD,GAAa/sD,EAAK6N,GAGlB,IAFA,IAAIpjC,EAAI,IAAIhB,WA3GmB,GA2GqB2S,EAAIpT,QACpDqC,EAAI,IAAI5B,WAAWgB,EAAEzB,QAChBX,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAAKoC,EAAEpC,EA7GR,IA6GwC+T,EAAI/T,GAE3E,OADAw9E,EAAiBx6E,EAAGZ,EAAGA,EAAEzB,OAAQ6kC,EAAO7N,GACjC30B,EAAEwL,SAAS81E,KAGpB7L,EAAKqN,UAAUC,KAAO,SAASC,EAAKxgD,EAAO7N,GACzCgtD,GAAgBqB,EAAKxgD,EAAO7N,GAC5B+sD,GAAa/sD,EAAK6N,GAGlB,IAFA,IAAIxiC,EAAI,IAAI5B,WAAWkjF,GAAgC0B,EAAIrlF,QACvDyB,EAAI,IAAIhB,WAAW4B,EAAErC,QAChBX,EAAI,EAAGA,EAAIgmF,EAAIrlF,OAAQX,IAAKgD,EAAEhD,EAAEskF,IAAiC0B,EAAIhmF,GAC9E,OAAIgD,EAAErC,OAAS,IAC2C,IAAtD88E,EAAsBr7E,EAAGY,EAAGA,EAAErC,OAAQ6kC,EAAO7N,GADvB,KAEnBv1B,EAAEoM,SA1HsB,KA6HjCiqE,EAAKqN,UAAUvf,UA/HiB,GAgIhCkS,EAAKqN,UAAUG,YA/HmB,GAgIlCxN,EAAKqN,UAAUI,eAAiB5B,GAEhC7L,EAAK0N,WAAa,SAASr+E,EAAGopB,GAE5B,GADAyzD,GAAgB78E,EAAGopB,GA/He,KAgI9BppB,EAAEnH,OAA0C,MAAM,IAAIY,MAAM,cAChE,GAlI4B,KAkIxB2vB,EAAEvwB,OAAoC,MAAM,IAAIY,MAAM,cAC1D,IAAIqtB,EAAI,IAAIxtB,WAnIgB,IAqI5B,OADA++E,EAAkBvxD,EAAG9mB,EAAGopB,GACjBtC,GAGT6pD,EAAK0N,WAAWtjE,KAAO,SAAS/a,GAE9B,GADA68E,GAAgB78E,GAxIkB,KAyI9BA,EAAEnH,OAA0C,MAAM,IAAIY,MAAM,cAChE,IAAIqtB,EAAI,IAAIxtB,WA3IgB,IA6I5B,OADAk/E,EAAuB1xD,EAAG9mB,GACnB8mB,GAGT6pD,EAAK0N,WAAWC,aA/IoB,GAgJpC3N,EAAK0N,WAAWE,mBAjJc,GAmJ9B5N,EAAKuN,IAAM,SAASjyE,EAAKyxB,EAAO3mB,EAAWynE,GACzC,IAAI5gE,EAAI+yD,EAAKuN,IAAIO,OAAO1nE,EAAWynE,GACnC,OAAO7N,EAAKqN,UAAU/xE,EAAKyxB,EAAO9f,IAGpC+yD,EAAKuN,IAAIO,OAAS,SAAS1nE,EAAWynE,GACpC3B,GAAgB9lE,EAAWynE,GAzE7B,SAAyB9C,EAAIC,GAC3B,GA/E8B,KA+E1BD,EAAG7iF,OAAsC,MAAM,IAAIY,MAAM,uBAC7D,GA/E8B,KA+E1BkiF,EAAG9iF,OAAsC,MAAM,IAAIY,MAAM,sBAC/D,CAuEEilF,CAAgB3nE,EAAWynE,GAC3B,IAAI5gE,EAAI,IAAItkB,WAvJiB,IAyJ7B,OADAo/E,EAAoB96D,EAAG7G,EAAWynE,GAC3B5gE,GAGT+yD,EAAKuN,IAAIS,MAAQhO,EAAKqN,UAEtBrN,EAAKuN,IAAID,KAAO,SAAShyE,EAAKyxB,EAAO3mB,EAAWynE,GAC9C,IAAI5gE,EAAI+yD,EAAKuN,IAAIO,OAAO1nE,EAAWynE,GACnC,OAAO7N,EAAKqN,UAAUC,KAAKhyE,EAAKyxB,EAAO9f,IAGzC+yD,EAAKuN,IAAID,KAAKU,MAAQhO,EAAKqN,UAAUC,KAErCtN,EAAKuN,IAAIU,QAAU,WACjB,IAAIlD,EAAK,IAAIpiF,WAxKiB,IAyK1BqiF,EAAK,IAAIriF,WAxKiB,IA0K9B,OADAm/E,EAAmBiD,EAAIC,GAChB,CAAC5kE,UAAW2kE,EAAI8C,UAAW7C,IAGpChL,EAAKuN,IAAIU,QAAQC,cAAgB,SAASL,GAExC,GADA3B,GAAgB2B,GA9Kc,KA+K1BA,EAAU3lF,OACZ,MAAM,IAAIY,MAAM,uBAClB,IAAIiiF,EAAK,IAAIpiF,WAlLiB,IAoL9B,OADAk/E,EAAuBkD,EAAI8C,GACpB,CAACznE,UAAW2kE,EAAI8C,UAAW,IAAIllF,WAAWklF,KAGnD7N,EAAKuN,IAAIY,gBAvLuB,GAwLhCnO,EAAKuN,IAAIa,gBAvLuB,GAwLhCpO,EAAKuN,IAAIc,gBAvLsB,GAwL/BrO,EAAKuN,IAAIC,YA/LyB,GAgMlCxN,EAAKuN,IAAIE,eAAiBzN,EAAKqN,UAAUI,eAEzCzN,EAAKsO,KAAO,SAAShzE,EAAKuyE,GAExB,GADA3B,GAAgB5wE,EAAKuyE,GACjBA,EAAU3lF,SAAW8jF,GACvB,MAAM,IAAIljF,MAAM,uBAClB,IAAIylF,EAAY,IAAI5lF,WAAWmjF,GAAkBxwE,EAAIpT,QAErD,OADAkjF,GAAYmD,EAAWjzE,EAAKA,EAAIpT,OAAQ2lF,GACjCU,GAGTvO,EAAKsO,KAAKhB,KAAO,SAASiB,EAAWnoE,GAEnC,GADA8lE,GAAgBqC,EAAWnoE,GACvBA,EAAUle,SAAW6jF,GACvB,MAAM,IAAIjjF,MAAM,uBAClB,IAAIxB,EAAM,IAAIqB,WAAW4lF,EAAUrmF,QAC/BsmF,EAAOjD,GAAiBjkF,EAAKinF,EAAWA,EAAUrmF,OAAQke,GAC9D,GAAIooE,EAAO,EAAG,OAAO,KAErB,IADA,IAAI7kF,EAAI,IAAIhB,WAAW6lF,GACdjnF,EAAI,EAAGA,EAAIoC,EAAEzB,OAAQX,IAAKoC,EAAEpC,GAAKD,EAAIC,GAC9C,OAAOoC,GAGTq2E,EAAKsO,KAAKG,SAAW,SAASnzE,EAAKuyE,GAGjC,IAFA,IAAIU,EAAYvO,EAAKsO,KAAKhzE,EAAKuyE,GAC3Ba,EAAM,IAAI/lF,WAAWmjF,IAChBvkF,EAAI,EAAGA,EAAImnF,EAAIxmF,OAAQX,IAAKmnF,EAAInnF,GAAKgnF,EAAUhnF,GACxD,OAAOmnF,GAGT1O,EAAKsO,KAAKG,SAASE,OAAS,SAASrzE,EAAKozE,EAAKtoE,GAE7C,GADA8lE,GAAgB5wE,EAAKozE,EAAKtoE,GACtBsoE,EAAIxmF,SAAW4jF,GACjB,MAAM,IAAIhjF,MAAM,sBAClB,GAAIsd,EAAUle,SAAW6jF,GACvB,MAAM,IAAIjjF,MAAM,uBAClB,IAEIvB,EAFA8jF,EAAK,IAAI1iF,WAAWmjF,GAAoBxwE,EAAIpT,QAC5CyB,EAAI,IAAIhB,WAAWmjF,GAAoBxwE,EAAIpT,QAE/C,IAAKX,EAAI,EAAGA,EAAIukF,GAAmBvkF,IAAK8jF,EAAG9jF,GAAKmnF,EAAInnF,GACpD,IAAKA,EAAI,EAAGA,EAAI+T,EAAIpT,OAAQX,IAAK8jF,EAAG9jF,EAAEukF,IAAqBxwE,EAAI/T,GAC/D,OAAQgkF,GAAiB5hF,EAAG0hF,EAAIA,EAAGnjF,OAAQke,IAAc,GAG3D45D,EAAKsO,KAAKL,QAAU,WAClB,IAAIlD,EAAK,IAAIpiF,WAAWojF,IACpBf,EAAK,IAAIriF,WAAWqjF,IAExB,OADAlB,GAAoBC,EAAIC,GACjB,CAAC5kE,UAAW2kE,EAAI8C,UAAW7C,IAGpChL,EAAKsO,KAAKL,QAAQC,cAAgB,SAASL,GAEzC,GADA3B,GAAgB2B,GACZA,EAAU3lF,SAAW8jF,GACvB,MAAM,IAAIljF,MAAM,uBAElB,IADA,IAAIiiF,EAAK,IAAIpiF,WAAWojF,IACfxkF,EAAI,EAAGA,EAAIwjF,EAAG7iF,OAAQX,IAAKwjF,EAAGxjF,GAAKsmF,EAAU,GAAGtmF,GACzD,MAAO,CAAC6e,UAAW2kE,EAAI8C,UAAW,IAAIllF,WAAWklF,KAGnD7N,EAAKsO,KAAKL,QAAQW,SAAW,SAASC,GAEpC,GADA3C,GAAgB2C,GA/OU,KAgPtBA,EAAK3mF,OACP,MAAM,IAAIY,MAAM,iBAGlB,IAFA,IAAIiiF,EAAK,IAAIpiF,WAAWojF,IACpBf,EAAK,IAAIriF,WAAWqjF,IACfzkF,EAAI,EAAGA,EAAI,GAAIA,IAAKyjF,EAAGzjF,GAAKsnF,EAAKtnF,GAE1C,OADAujF,GAAoBC,EAAIC,GAAI,GACrB,CAAC5kE,UAAW2kE,EAAI8C,UAAW7C,IAGpChL,EAAKsO,KAAKH,gBAAkBpC,GAC5B/L,EAAKsO,KAAKF,gBAAkBpC,GAC5BhM,EAAKsO,KAAKQ,WA3PkB,GA4P5B9O,EAAKsO,KAAKS,gBAAkBjD,GAE5B9L,EAAKjoC,KAAO,SAASz8B,GACnB4wE,GAAgB5wE,GAChB,IAAIqb,EAAI,IAAIhuB,WA/PU,IAiQtB,OADA4hF,EAAY5zD,EAAGrb,EAAKA,EAAIpT,QACjByuB,GAGTqpD,EAAKjoC,KAAKi3C,WApQc,GAsQxBhP,EAAK2O,OAAS,SAASr7E,EAAGC,GAGxB,OAFA24E,GAAgB54E,EAAGC,GAEF,IAAbD,EAAEpL,QAA6B,IAAbqL,EAAErL,QACpBoL,EAAEpL,SAAWqL,EAAErL,QACkB,IAA7B64E,EAAGztE,EAAG,EAAGC,EAAG,EAAGD,EAAEpL,SAG3B83E,EAAKiP,QAAU,SAAS/yE,GACtBkkE,EAAclkE,GAGhB,WAGE,IAAIgzE,EAAyB,oBAATniE,KAAwBA,KAAKmiE,QAAUniE,KAAKoiE,SAAY,KACxED,GAAUA,EAAOE,gBAGnBpP,EAAKiP,SAAQ,SAAS37E,EAAGjE,GACvB,IAAI9H,EAAG4Z,EAAI,IAAIxY,WAAW0G,GAC1B,IAAK9H,EAAI,EAAGA,EAAI8H,EAAG9H,GAHT,MAIR2nF,EAAOE,gBAAgBjuE,EAAEpL,SAASxO,EAAGA,EAAI6C,KAAKoH,IAAInC,EAAI9H,EAJ9C,SAMV,IAAKA,EAAI,EAAGA,EAAI8H,EAAG9H,IAAK+L,EAAE/L,GAAK4Z,EAAE5Z,GACjC4kF,GAAQhrE,EACd,SACgC,IAAZkuE,KAEhBH,EAASnkF,KACKmkF,EAAO9B,aACnBpN,EAAKiP,SAAQ,SAAS37E,EAAGjE,GACvB,IAAI9H,EAAG4Z,EAAI+tE,EAAO9B,YAAY/9E,GAC9B,IAAK9H,EAAI,EAAGA,EAAI8H,EAAG9H,IAAK+L,EAAE/L,GAAK4Z,EAAE5Z,GACjC4kF,GAAQhrE,EAChB,GAGC,CA1BD,EA4BC,CAt1ED,IAs1E2ChW,WAAiBA,QAAW4hB,KAAKizD,KAAOjzD,KAAKizD,MAAQ,CAAA,qBCz0EhG,MAcasP,GAAiB,CAC5BzhD,EACA0hD,EACAlmE,IAEOmmE,GAAclB,KAACG,SAASE,OAAO9gD,EAAQ0hD,EAAclmE,EAAOmhC,WASxDilC,GAAmB,CAAChjD,EAAgBoB,KAC/C,MAAMxkB,OAAEA,GAAW4rD,GAAiBpnC,EAAS,IAAMpB,EAAQ8nC,sBAAcmb,IACzE,OAAOrmE,CAAM,EA0BR/B,eAAeqoE,GACpBnoE,EACAilB,EACAoB,EACArJ,GAEA,MAAMnb,EAASomE,GAAiBhjD,EAAQoB,GACxC,IAAI/qB,SAAEA,SAAmBurB,GAAkBrB,SAASxlB,EAAY6B,GAEhE,IAAKvG,EAAS/U,KACZ,MAAM,IAAIwwB,GAASD,kBAAUsxD,cAG/B,GAAIprD,EACF,OAAOqrD,GAAkB/sE,EAAU+qB,EAAQxkB,GAE7C,MAAMymE,EAAa9b,GAAejhE,IAAI86B,GAGtC,OAFA/qB,EAAS/U,KAAO+U,EAAS/U,KAAKrB,MAAM,EAAGojF,GAEhChtE,CACT,CA8Ca,MA2KAitE,GAAezoE,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAMA,OAACE,KA0EvC4b,GAAoB,CAC/B/sE,EACA+qB,EACAmiD,KAEA,MAAM3mF,EAASyZ,aAAA,EAAAA,EAAU/U,KACzB,IAAK1E,EAAQ,OACb,GAAoD,IAAhDA,EAAO+J,QAAQhI,EAAMA,OAACE,MAAMjC,EAAOnB,SAAgB,OAEvD,MAAMiG,EAAO6lE,GAAejhE,IAAI86B,GAC1B9sB,EA1XmB,CAAC1X,IAC1B,MAAM7B,EAAMoB,MAAMuD,KAAK9C,GAGvB,OADE7B,EAAIU,OAAS,EAAIV,EAAI8d,UAAU2qE,WAAWC,GAAkB,IAATA,IAChC,CAAC,EAsXVC,CAAmB9mF,GAE/B,IAAK8E,EACH,OAAO9E,EAAOqD,MAAM,EAAGqU,GAAK1S,SAAS,SAIvC,GAAIw/B,IAAWkmC,QAAMA,OAACE,IAAK,CACzB,MAAMlqB,EAAU,IAAI9nB,YACdmuD,EAAiBhlF,EAAMA,OAACoI,OAAO,CACnCnK,EAAOqD,MAAM,EAAG,IAChBsjF,EAAU1pE,aAEN44B,EAAW6K,EAAQ3qC,OAAOgxE,EAAe/hF,SAAS,QAMxD,GALcihF,GACZpwC,EACA71C,EAAOqD,MAAM,GAAI,IACjBoW,EAAS+E,OAGT,OAAOwoE,GAAOjxE,OAAO/V,EAAOqD,MAAM,EAAG,IAExC,CAGD,GAAIyB,GAAQ4S,IAAQ5S,EAAM,CACxB,MAAMsZ,EAAUpe,EAAOqD,MAAM,EAAGqU,GAAK1S,SAAS,SAC9C,GAAIw/B,IAAWkmC,QAAMA,OAACK,UAAW,CAC/B,MAAMkc,EAAUjxE,GAAOoI,GACvB,GAAuB,QAAnB6oE,EAAQhnB,QAA4C,KAAxBgnB,EAAQviF,KAAK7F,OAC3C,OAAOuf,CAEV,MAAM,GAAIomB,IAAWkmC,QAAAA,OAAOI,KAAOtmC,IAAWkmC,QAAAA,OAAOG,IAAK,CACzD,MAAM5K,EAAS7hD,EAAQ/a,MAAM,EAAG,GAC1B6Y,EAAMkC,EAAQ/a,MAAM,GAC1B,GAAe,OAAX48D,GAAsD,KAAnCl+D,SAAOe,KAAKoZ,EAAK,OAAOrd,OAC7C,OAAOuf,CAEV,MAAM,IAAIomB,IAAWkmC,QAAAA,OAAOn7C,GAAKiV,IAAWkmC,QAAAA,OAAOM,OAC9CyG,GAAO8B,QAAQn1D,GACjB,OAAOA,EAGX,MAAM,IAAI8W,GAASD,kBAAUiyD,kBAC9B,CAED,GAAI1iD,IAAWkmC,QAAAA,OAAOG,KAAOrmC,IAAWkmC,QAAAA,OAAOI,IAC7C,MAAO,KAAO9qE,EAAOqD,MAAM,EAAGyB,GAAME,SAAS,OACxC,GAAIw/B,IAAWkmC,QAAMA,OAACK,UAC3B,OAAOh1D,GAAO,MAAO/V,EAAOqD,MAAM,EAAGyB,GAAO,UACvC,GAAI0/B,IAAWkmC,QAAAA,OAAOn7C,GAAKiV,IAAWkmC,QAAAA,OAAOM,KAClD,OAAOyG,GAAO9yE,cAAc,IAAIqB,EAAOqD,MAAM,EAAGyB,KAAQE,WACnD,GAAIw/B,IAAWkmC,QAAMA,OAACO,WAC3B,OAAO,IAAIj4D,EAAAA,UAAUhT,EAAOqD,MAAM,EAAGyB,IAAOE,WAE9C,MAAM,IAAIkwB,GAASD,kBAAUiyD,kBAAkB,EAUpCC,GAAkB,CAACz/E,EAAa88B,KAG3C,IAFammC,GAAejhE,IAAI86B,GAM9B,OAHIA,IAAWkmC,QAAAA,OAAO0c,OAAS5iD,IAAWkmC,QAAAA,OAAO2c,MAC/C3/E,EAAM4/E,GAAe5/E,IAEhB3F,SAAOe,KAAK4E,EAAK,SAG1B,GAAI88B,IAAWkmC,QAAMA,OAACE,IACpB,MAAM,IAAI11C,GACRD,QAAAA,UAAUsyD,kBACV,2CAEG,GAAI/iD,IAAWkmC,QAAAA,OAAOG,KAAOrmC,IAAWkmC,QAAAA,OAAOI,IAEpD,OADAtO,GAA0B,OAApB90D,EAAIrE,MAAM,EAAG,GAAa4xB,kBAAUuyD,mBACnCzlF,EAAAA,OAAOe,KAAK4E,EAAIrE,MAAM,GAAI,OAC5B,GAAImhC,IAAWkmC,QAAMA,OAACK,UAAW,CACtC,MAAMkc,EAAUjxE,GAAOtO,GAGvB,OAFA80D,GAAyB,QAAnByqB,EAAQhnB,OAAkBhrC,QAASA,UAACwyD,yBAC1CjrB,GAA8B,KAAxByqB,EAAQviF,KAAK7F,OAAeo2B,QAAAA,UAAUwyD,yBACrC1lF,SAAOe,KAAKmkF,EAAQviF,KAC5B,CAAM,GAAI8/B,IAAWkmC,QAAMA,OAACn7C,EAAG,CAC9B,MAAMxqB,EAAQ0sE,GAAOqB,MAAMprE,GAAK1J,cAEhC,OADAw+D,GAAuB,IAAjBz3D,EAAMlG,OAAco2B,QAASA,UAACyyD,gBAC7B3lF,EAAMA,OAACe,KAAKiC,EACpB,CAAM,GAAIy/B,IAAWkmC,QAAMA,OAACM,KAAM,CACjC,MAAMjmE,EAAQ0sE,GAAOqB,MAAMprE,GAAK1J,cAEhC,OADAw+D,GAAuB,KAAjBz3D,EAAMlG,OAAeo2B,QAASA,UAAC0yD,mBAC9B5lF,EAAMA,OAACe,KAAKiC,EACpB,CAAM,GAAIy/B,IAAWkmC,QAAMA,OAACO,WAC3B,OAAO,IAAIj4D,EAASA,UAACtL,GAAKuV,WAG5B,MAAM,IAAIiY,GAASD,kBAAU2yD,mBAAmB,EAWrCC,GAAqB,CAChCC,EACAnB,EACAoB,EACAC,KAEA,MAAMnyC,EAAW9zC,SAAOoI,OAAO,CAAC29E,EAAQ7qE,WAAY0pE,EAAU1pE,aACxDgrE,GAAiB,IAAIrvD,aAAc7iB,OAAO8/B,EAAS7wC,SAAS,QAC5DkjF,EAAQjC,GAAegC,EAAgBD,EAAWD,GAGxD,OAFAvrB,GAAM0rB,EAAOjzD,kBAAUkzD,kBAEhBpmF,EAAAA,OAAOoI,OAAO,CAAC29E,EAAQ7qE,WAAY+qE,GAAW,ECnf1C5xC,GAAUn4B,MAAOE,EAAwBilB,KACpD,MAAMpjB,OAAEA,GAAW4rD,GAAiBxoC,IAE9B3pB,SAAEA,EAAQ4rB,SAAEA,SAAmBL,GAAkBrB,SACrDxlB,EACA6B,GAGF,GAAIqlB,EACF,OAAOA,EAGT,IACE,MAAMshD,EAAYP,GAAiBhjD,EAAQsnC,QAAMA,OAACE,KAC5Cwd,QAAkB1B,GAAavoE,EAAYilB,GAEjD,KAAKglD,eAAAA,EAAW1jF,MACd,MAAM,IAAIwwB,GAASD,kBAAUsxD,cAG/B,MAAM7lC,EAAU,IAAI9nB,YACdmuD,EAAiBhlF,EAAMA,OAACoI,OAAO,CACnCi+E,EAAU1jF,KAAKrB,MAAM,EAAG,IACxBsjF,EAAU1pE,aAEN44B,EAAW6K,EAAQ3qC,OAAOgxE,EAAe/hF,SAAS,QAQxD,IANcihF,GACZpwC,EACAuyC,EAAU1jF,KAAKrB,MAAM,IACrBoW,EAAS+E,OAIT,MAAM,IAAI0W,GAASD,kBAAUkzD,kBAG/B,OAAO,IAAIn1E,EAASA,UAACo1E,EAAU1jF,KAAKrB,MAAM,EAAG,IAC9C,CAAC,MAAOorD,GACP,GAAIA,aAAehvD,OACA,eAAbgvD,EAAIl9C,KACN,MAAMk9C,CAGX,CAED,OAAOh1C,EAAS+E,KAAK,ECzCV6pE,GAAY,IAAInpD,IAAuB,CAClD,CACEwrC,QAAAA,OAAO4d,SACP,IAAIt1E,EAAAA,UAAU,iDAEhB,CAAC03D,QAAMA,OAAC6d,IAAK,IAAIv1E,EAASA,UAAC,iDAC3B,CAAC03D,QAAMA,OAAC8d,KAAM,IAAIx1E,EAASA,UAAC,mDAGjBy1E,GAAkB,IAAIptC,IAAY,CAC7CqvB,QAAAA,OAAOG,IACPH,QAAAA,OAAOK,UACPL,QAAAA,OAAOI,MA4CI4d,GAAe,IAAIrtC,IAAY,CAC1CqvB,QAAAA,OAAO8d,KACP9d,QAAAA,OAAOie,KACPje,QAAAA,OAAOke,IACPle,QAAAA,OAAOme,KACPne,QAAAA,OAAOoe,MACPpe,QAAAA,OAAO6d,IACP7d,QAAAA,OAAOqe,QACPre,QAAAA,OAAOse,OACPte,QAAAA,OAAOue,OACPve,QAAAA,OAAOwe,QACPxe,QAAAA,OAAOye,SACPze,QAAAA,OAAO0e,IACP1e,QAAAA,OAAO2e,KACP3e,QAAAA,OAAO4e,MACP5e,QAAAA,OAAO4d,SACP5d,QAAAA,OAAO2c,IACP3c,QAAAA,OAAO0c,MACP1c,QAAAA,OAAO6e,MAOIC,GAAc,IAAInuC,IAAY,CACzCqvB,QAAAA,OAAOG,IACPH,QAAAA,OAAOK,UACPL,QAAAA,OAAOE,MA0CI6e,GAA2B,CACtC3B,EACAtjD,KAGA,GADoBkkD,GAAa1oB,IAAIx7B,GAKnC,OAHIA,IAAWkmC,QAAAA,OAAO0c,OAAS5iD,IAAWkmC,QAAAA,OAAO2c,MAC/CS,EAAUR,GAAeQ,IAEpB/lF,OAAOe,KAAKglF,EAAS,SACvB,GAAItjD,IAAWkmC,QAAMA,OAACE,IAC3B,OAAO,IAAI53D,EAASA,UAAC80E,GAAS7qE,WACzB,GAAIunB,IAAWkmC,QAAAA,OAAOG,KAAOrmC,IAAWkmC,QAAAA,OAAOI,IAEpD,OADAtO,GAA8B,OAAxBsrB,EAAQzkF,MAAM,EAAG,GAAa4xB,kBAAUuyD,mBACvCzlF,OAAOe,KAAKglF,EAAQzkF,MAAM,GAAI,OAChC,GAAImhC,IAAWkmC,QAAMA,OAACK,UAAW,CACtC,MAAMkc,EAAUjxE,GAAO8xE,GAGvB,OAFAtrB,GAAyB,QAAnByqB,EAAQhnB,OAAkBhrC,QAASA,UAACwyD,yBAC1CjrB,GAA8B,KAAxByqB,EAAQviF,KAAK7F,OAAeo2B,QAAAA,UAAUwyD,yBACrC1lF,OAAOe,KAAKmkF,EAAQviF,KAC5B,CAAM,GAAI8/B,IAAWkmC,QAAMA,OAACn7C,EAAG,CAC9B,MAAMxqB,EAAQ0sE,GAAOqB,MAAMgV,GAAS9pF,cAEpC,OADAw+D,GAAuB,IAAjBz3D,EAAMlG,OAAco2B,QAASA,UAACyyD,gBAC7B3lF,OAAOe,KAAKiC,EACpB,CAAM,GAAIy/B,IAAWkmC,QAAMA,OAACM,KAAM,CACjC,MAAMjmE,EAAQ0sE,GAAOqB,MAAMgV,GAAS9pF,cAEpC,OADAw+D,GAAuB,KAAjBz3D,EAAMlG,OAAeo2B,QAASA,UAAC0yD,mBAC9B5lF,OAAOe,KAAKiC,EACpB,CACC,MAAM,IAAImwB,GAASD,kBAAUyyD,eAC9B,EASUgC,GAAiB,CAACtmD,EAAgBoB,KAC7C,MAAMxkB,OAAEA,GAAW4rD,GAAiBxoC,GAC9B8R,EAASi2B,GAAkB,IAAOhhE,OAAOq6B,IAC/C,OAAO4mC,GAAsBl2B,EAAQ42B,GAA2B9rD,EAAO,ECzGlE/B,eAAe0rE,GACpBxrE,EACA5M,EACAwuB,EACAH,EACAgqD,EACA9pD,EACAgV,EACA9S,GAEA,MAAMnC,QAAoB+U,GAAcrjC,GAClC+uB,QAAuBuU,GAC3BhV,EACAiV,EACA9S,GAGI6nD,EAAU/pD,SAEN3hB,EAAW2rE,kCAAkC/pD,GAEvD,IAAIG,EACJ,GAAI8B,EAAY,CACd,MAAQvoB,SAAUswE,SAAwBp1C,GACxCx2B,EACA6jB,GAEF9B,EAAkB6pD,EAAcvrE,KACjC,CAkBD,OAhBwB+gB,GACtBkU,GACAtzB,EAAAA,cAAc7B,UACdgiB,EACAspD,EACAhqD,EACAC,EAEA,IAAInK,GAAUm0D,GAEd,IAAIz0D,GAAU2K,GACd+U,EACA9S,EACA9B,EAIJ,CAyGOjiB,eAAe+rE,GACpB7rE,EACA5M,EACAuvB,EACAgU,EACA7U,GAEA,MAAMJ,QAAoB+U,GAAcrjC,GAClC+uB,QAAuBuU,GAC3BhV,EACAiV,EACA7U,GAGF,IAAI2pD,EAEFA,EADE90C,UAGiB9P,GAAkBrB,SAASxlB,EAAYmiB,IACvD7mB,SAAS+E,MAUd,OAP+BqiB,GAC7B4S,GACAnT,EACAQ,EACA8oD,EAIJ,OA0HaK,GAAoBhsE,MAC/BkjB,EACA5vB,EACAuwB,EACAE,EACAC,KAEA,IAAKZ,SAAsBruB,YAAU8wB,mBACnC,CAAC8P,GAAoB32B,YACrB22B,IAGEy3B,QAA4Bz2B,GAAczT,EAAY+C,YACtD9C,QAA6ByT,GAC/Bw2B,EACAhqC,EACAW,GAoBF,MAAO,CAAC,GAFW,CAfe,IAAIN,GAAyB,CAC7DnwB,SACCyvB,eACD4S,GACAH,GACAE,GACAvS,EACAjhB,EAAAA,cAAc7B,UACd+iB,EACAS,EACAooD,EAAkBA,mBAClBloD,EACAC,IAKuB,EAqEdkoD,GAA0BlsE,MACrCE,EACAilB,EACAoB,EACA9/B,EACA8Z,EACAoB,KAEA48C,GAAMh4B,IAAWkmC,QAAMA,OAACE,IAAK31C,QAASA,UAACsyD,mBACvC,MAAMvnE,OAAEA,EAAMk1B,OAAEA,EAAMD,OAAEA,GAAW22B,GACjC,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACmb,IAIVtmD,EADaonD,GAAgBziF,EAAM8/B,GAChB3lC,OACnBihC,QAAiB3hB,EAAW2rE,kCAChC/pD,EAAQiF,GAAkBI,YAiB5B,OAdW7F,GACTkU,GACAtzB,EAAAA,cAAc7B,UACd0B,EACAxB,EACAoB,EACAs1B,EACA,IAAIxf,GAAUoK,GACd,IAAI1K,GAAU2K,QACdz7B,EACA2wC,EACAz2B,EAGO,EA6PE4rE,GAA6BnsE,MACxCE,EACAilB,EACA0kD,EACAC,EACAC,EACApoE,KAEA,MAAMI,OAAEA,EAAMk1B,OAAEA,EAAMD,OAAEA,GAAW22B,GACjC,GAAGlB,QAAMA,OAACE,OAAOxnC,IACjB8nC,QAAaA,cAACmb,IAGVtmD,EADa8nD,GAAmBC,EAAS9nE,EAAQ+nE,EAAQC,GACtCnpF,OACnBihC,QAAiB3hB,EAAW2rE,kCAChC/pD,EAAQiF,GAAkBI,YAiB5B,MAAO,CAdI7F,GACTkU,GACAtzB,EAAAA,cAAc7B,UACd0B,EACA+nE,EACAnoE,EACAs1B,EACA,IAAIxf,GAAUoK,GACd,IAAI1K,GAAU2K,QACdz7B,EACA2wC,EACA8yC,GAGS,QC/cAsC,GAgBX,WAAAl5E,CAAYhN,GACVqB,KAAK8kF,mBAAqBnmF,EAAImmF,mBAC9B9kF,KAAK+kF,cAAgBpmF,EAAIomF,aAC1B,CAEM,qBAAa5mD,CAClBxlB,EACAqsE,GAEA,IAAIC,QAA8BtsE,EAAWiB,eAC3CorE,EACA,aAEF,IAAKC,EACH,MAAM,IAAIv1D,GAASD,kBAAUy1D,uBAS/B,OANuCzvD,GACrCz1B,KAAK64B,OACLgsD,GACAI,EAAsB/lF,KAAKrB,MAAM2hC,GAAkBI,YAItD,EAGInnB,eAAe0sE,GACpBxsE,EACAosE,EACAD,EACAM,EACAhrD,GAGA,MAAMirD,QAA6Bj2C,GAAcg2C,EAAe5lF,YAC1D8lF,QAA2Bj2C,GAC/Bg2C,EACA72C,GACAC,IAEF,IAAI82C,EAAkC1vD,GACpCgvD,GAA4BhsD,OAC5B,IAAIgsD,GAA4B,CAC9BC,mBAAoBA,EAAmBnpC,UACvCopC,mBAGJ,MAAO,CACLhrD,GACEkU,GACAtzB,EAAAA,cAAc7B,UACdwsE,EACAF,EACAhrD,EACAirD,EACA,IAAIn1D,SAEIvX,EAAW2rE,kCACfiB,EAAgClsF,OAASmmC,GAAkBI,aAI/D,IAAIhQ,GAAU21D,EAAgClsF,QAC9Cm1C,GACAC,GACAD,IAEF3T,GACEoT,GACAq3C,EAEA,IAAI11D,GAAU,GACdrzB,EAAAA,OAAOe,KAAKioF,GACZ/2C,IAGN,CAzFSq2C,GAAMhsD,OAAW,IAAIa,IAAI,CAC9B,CACEmrD,GACA,CACE5rD,KAAM,SACNzmB,OAAQ,CACN,CAAC,qBAAsB,CAAC,KACxB,CAAC,gBAAiB,qBChWfgzE,GAAiB,IAAIh4E,EAASA,UACzC,sDAGWi4E,GAiBX,WAAA95E,CAAYhN,GACVqB,KAAKkU,IAAMvV,EAAIuV,IACflU,KAAK27B,YAAc,IAAInuB,EAASA,UAAC7O,EAAIg9B,YACtC,CAOD,kBAAOhG,CAAYz2B,GACjB,OAAOy2B,GAAY31B,KAAK64B,OAAQ4sD,GAAiBvmF,EAClD,CAQD,qBAAai/B,CAASxlB,EAAwB0X,GAC5C,MAAM+N,QAAoBzlB,EAAWiB,eAAeyW,GACpD,IAAK+N,IAAgBA,EAAYl/B,KAC/B,MAAM,IAAIwwB,GAASD,kBAAUi2D,yBAE/B,OAAO1lF,KAAK21B,YAAYyI,EAAYl/B,KACrC,CAQD,mBAAaymF,CAAO7sE,EAAsBE,GACxC,aAAaxL,EAASA,UAAC8wB,mBACrB,CAAC/hC,EAAMA,OAACe,KAAK,oBAAqB0b,EAAMvB,YACxCqB,EAEH,CAQD,iBAAO8sE,CAAW9sE,EAAsBE,GACtC,OAAOxL,YAAU0M,uBACf,CAAC3d,EAAAA,OAAOe,KAAK,oBAAqB0b,EAAMvB,YACxCqB,EAEH,EAjEM2sE,GAAM5sD,OAAW,IAAIa,IAAI,CAC9B,CACE+rD,GACA,CACExsD,KAAM,SACNzmB,OAAQ,CACN,CAAC,MAAO,MACR,CAAC,cAAe,CAAC,UCrBfqzE,QAEXA,cAAA,GAFWA,QAAQA,WAARA,iBAEX,CAAA,IADC,WAAA,cCKF,MAAMC,GAAiB,IAAIt4E,YACzB,2qB7C2DgC,iPyCqxBR,CACxBowB,EACA5kB,EACAxT,KAEA,MAAMgV,OAAEA,GAAW4rD,GAAiBxoC,IAC7B3B,GAASzuB,EAAAA,UAAU0M,uBACxB,CAACM,EAAO/C,YACR22B,KAEKvQ,GAAkBrwB,EAAAA,UAAU0M,uBACjC,CAACM,EAAO/C,WAAY3d,WAAWwD,KAAK,CAAC,EAAG,KACxC8wC,IAeF,OAZW,IAAI1Q,IAAkBlC,eAC/B4S,GACAH,GACAtzB,EAAAA,cAAc7B,UACd0B,EACA+rD,GAAkB3oC,GAClBC,EACA5B,EACAsS,GACAv1B,EACAxT,EAEO,+DCjyBJiT,eACLssE,EACAK,EACA3qF,EACAsgC,GAEA,MAAMgrD,QAA4B32C,GAAc21C,GAC1CiB,QAAiC32C,GACrC02C,OACAjnF,EACA2vC,IAcF,MAXqB,CACnB5T,GACEoT,GACA+3C,EAEA,IAAIp2D,GAAUn1B,GACdsgC,EACAqqD,GAKN,+BAIO3sE,eACLE,EACAosE,EACAkB,EACAC,EACA9rD,GAEA,MAAM2rD,QAA4B32C,GAAc21C,GAC1CiB,QAAiC32C,GACrC02C,OACAjnF,EACA2vC,IAIF,IAAIuuB,EAAe,CACjB/hC,GACEgT,GACA+3C,EACAE,EACAD,OACAnnF,IAKJ,MAAMqnF,QAAoC/2C,GACxC62C,EAAsBzmF,YA4BxB,aA1BwC6vC,GACtC82C,EACA33C,QACA1vC,GAEFk+D,EAAatjE,WACL8qF,GACJ7rE,EACAstE,EAAsBzmF,WACtB46B,EACAoU,GACAC,KAKJuuB,EAAeA,EAAar4D,aACpBwgF,GACJxsE,EACAosE,EACAiB,EACAE,EACA9rD,IAIG4iC,CACT,4MDmXyC,CACvCp/B,EACAoB,EACAsjD,EACAtpE,EACAoB,KAEA,MAAMI,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAGhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAGlB,MAAMyiE,2GAAK0pB,CACThsE,EACAI,EACAi1B,EACAz2B,EACAi1B,GACA,IAAOtpC,OAAOq6B,GACdilD,GAAyB3B,EAAStjD,GAClCqnD,IAEF,OAAO3pB,CAAE,yKAnIoBjkD,MAC7BE,EACA2tE,EACAttE,EACAuhB,EAAQ,OAER,MAAMgsD,EAAgC,GAChCh8E,EAAM+7E,EAAUx5E,MAAM,KAAK,GACjC,IAAKvC,EACH,MAAM,IAAImlB,GAASD,kBAAU+2D,kBAG/B,MAAM/2C,OAAEA,EAAMj1B,OAAEA,GAAW4rD,GAAiBkgB,GAGtChsD,QAAiB3hB,EAAW2rE,kCAChC/pD,EAAQiF,GAAkBI,YAGtB6mD,QAAkBtC,GACtBxrE,EACA,KAAKhU,OAAO4F,GACZgwB,EACAvhB,EACAA,EACAshB,OACAx7B,EACA2wC,GAEF82C,EAAI7sF,KAAK+sF,GAGT,MAAMC,EAAangB,GAAkB+f,GAAW,GAC1CvtE,QAAaJ,EAAWiB,eAAe8sE,GAC7C,KAAK3tE,eAAAA,EAAM7Z,MAAM,CACf,OAASynF,SAAoBlC,GAC3BjqE,EACA,KAAK7V,OAAO4F,GACZyO,EACAy2B,EACAz2B,GAEFutE,EAAI7sF,QAAQitF,EACb,CAED,MAAO,CAAC,GAAIJ,EAAI,uEChcX9tE,eACLE,EACAosE,EACAK,EACA7qD,EACAH,GAGA,MAAM2rD,QAA4B32C,GAAc21C,GAC1CiB,QAAiC32C,GACrC02C,OACAjnF,EACA2vC,IAGInU,QAAiB3hB,EAAW2rE,kCAChC/pD,EAAQiF,GAAkBI,YAG5B,IAAIo9B,EAAe,CACjBjjC,GACEkU,GACAtzB,gBAAc7B,UACdktE,EACAZ,EACAhrD,EACA2rD,EAEA,IAAI71D,GAAUoK,GAEd,IAAI1K,GAAU2K,QACdz7B,EACA2vC,GACAD,KAcJ,OAVAwuB,EAAeA,EAAar4D,aACpBwgF,GACJxsE,EACAosE,EACAiB,EACAZ,EACAhrD,IAIG4iC,CACT,wHDikB8B,CAC5Bp/B,EACAoB,EACAhmB,EACAoB,KAEA,MAAMI,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAGhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAGlB,MAAMyiE,uEAAKkqB,CACTxsE,EACAq1B,EACAz2B,EACAwB,EACAyzB,GACAo4C,IAEF,OAAO3pB,CAAE,gCC3fJjkD,eACLssE,EACAK,GAEA,MAAMW,QAA4B32C,GAAc21C,GAC1CiB,QAAiC32C,GACrC02C,OACAjnF,EACA2vC,IAGI42C,QAA6Bj2C,GAAcg2C,EAAe5lF,YAC1D8lF,QAA2Bj2C,GAC/Bg2C,EACA72C,GACAC,IAoBF,MAjBqB,CAEnBpT,GACE4S,GACA+3C,EACAZ,EACAA,GAGF/pD,GACE4S,GACAq3C,EACAF,EACAA,GAKN,kEF7F0C,CACxC9C,EACAtjD,KAIA,GAFoBkkD,GAAa1oB,IAAIx7B,GAEpB,CACf,MAAMyiD,EAAUa,EAAQ9iF,SAAS,SACjC,OAAIw/B,IAAWkmC,QAAAA,OAAO0c,OAAS5iD,IAAWkmC,QAAAA,OAAO2c,IJ0EtC,SAASr1E,GAEvB,MAAMlS,EAAS,GACTq2E,EAAcnkE,EAAMnT,OAC1B,IAAIX,EAAI,EACJ8H,EA5LY,IA6LZowE,EA9Le,GAoMfiW,EAAQr6E,EAAM1L,YAlMD,KAmMb+lF,EAAQ,IACXA,EAAQ,GAGT,IAAK,IAAItlF,EAAI,EAAGA,EAAIslF,IAAStlF,EAExBiL,EAAMvT,WAAWsI,IAAM,KAC1BwC,GAAM,aAEPzJ,EAAOZ,KAAK8S,EAAMvT,WAAWsI,IAM9B,IAAK,IAAI0a,EAAQ4qE,EAAQ,EAAIA,EAAQ,EAAI,EAAG5qE,EAAQ00D,GAAwC,CAO3F,MAAMmW,EAAOpuF,EACb,IAAK,IAAIskB,EAAI,EAAGoB,EAAI7C,IAA0B6C,GAAK7C,GAAM,CAEpDU,GAAS00D,GACZ5sE,GAAM,iBAGP,MAAMosE,GA9FqBrtE,EA8FA0J,EAAMvT,WAAWgjB,OA7F7B,IAAQnZ,EAAY,GACvBA,EAAY,GAAlB,GAEJA,GAAa,IAAQA,EAAY,GAC7BA,EAAY,GAEhBA,GAAa,IAAQA,EAAY,IAC7BA,EAAY,GAEbyY,GAsFD40D,GAAS50D,IACZxX,GAAM,iBAEHosE,EAAQr0E,IAAOk0E,GAASt3E,GAAKskB,IAChCjZ,GAAM,YAGPrL,GAAKy3E,EAAQnzD,EACb,MAAMwC,EAAIpB,GAAKwyD,EAhPL,EAgPoBxyD,GAAKwyD,EA/OzB,MA+O8CxyD,EAAIwyD,EAE5D,GAAIT,EAAQ3wD,EACX,MAGD,MAAM0xD,EAAa31D,GAAOiE,EACtBxC,EAAIlhB,GAAMk0E,GAASkB,IACtBntE,GAAM,YAGPiZ,GAAKk0D,CAEN,CAEA,MAAMhrE,EAAM5L,EAAOjB,OAAS,EAC5Bu3E,EAAOP,GAAM33E,EAAIouF,EAAM5gF,EAAa,GAAR4gF,GAIxBhrF,GAAMpD,EAAIwN,GAAO8pE,GAASxvE,GAC7BuD,GAAM,YAGPvD,GAAK1E,GAAMpD,EAAIwN,GACfxN,GAAKwN,EAGL5L,EAAOq8B,OAAOj+B,IAAK,EAAG8H,EAEvB,CAtIoB,IAASsC,EAwI7B,OAAO5B,OAAO6lF,iBAAiBzsF,EAChC,CI9Ja0sF,CAAgBvF,GAElBA,CACR,CAAM,GAAIziD,IAAWkmC,QAAMA,OAACE,IAC3B,OAAO,IAAI53D,EAASA,UAAC80E,GAAS5jD,WACzB,GAAIM,IAAWkmC,QAAAA,OAAOG,KAAOrmC,IAAWkmC,QAAAA,OAAOI,IACpD,MAAO,KAAOgd,EAAQ9iF,SAAS,OAC1B,GAAIw/B,IAAWkmC,QAAMA,OAACK,UAC3B,OAAOh1D,GAAO,MAAO+xE,EAAS,UACzB,GAAItjD,IAAWkmC,QAAAA,OAAOn7C,GAAKiV,IAAWkmC,QAAAA,OAAOM,KAClD,OAAOyG,GAAO9yE,cAAc,IAAImpF,IAAU9iF,WAE1C,MAAM,IAAIkwB,GAASD,kBAAUyyD,eAC9B,qCC0lBuC,CACxCtkD,EACAoB,EACAhmB,EACAoB,EACAooE,EACAyE,KAEA,MAAMzsE,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAGhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAGlB,MAAMyiE,gJAAKwqB,CACT9sE,EACAI,EACAi1B,EACAz2B,EACAi1B,GACAk5C,GAAWC,SACX5E,EACAyE,EACAZ,IAEF,OAAO3pB,CAAE,yBVjpBmBjkD,MAC5BE,EACAm3B,KAGA,MAAMu3C,EAAiC,CACrC,CACE5oD,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO0pC,EAAUpR,aAGrB,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAOmoC,GAAqB7P,cAI5BjoB,QAAgBkC,EAAWimB,mBAAmBqP,GAAiB,CACnEzP,QAAS6oD,IAGL53C,QAAerT,GAAczjB,EAAYm3B,GACzCw3C,EAAO7wE,EAAQwZ,KAAKp1B,IAAK,IAAA8kC,EAC7B,eAAAA,EAAA9kC,EAAEgkC,QAAQ3/B,KAAKrB,MAAM,IAAI2B,SAAS,+BAAUsN,MAAM,MAAMjT,KAAK,GAAG,IAG5D0gB,EAAO+sE,EAAKr3D,KAAKp1B,GAAMurE,GAAiBvrE,EAAI,IAAM40C,GAAQj1B,SAC1D+sE,QAAgB5uE,EAAWsnB,wBAAwB1lB,GAEzD,OAAO+sE,EAAK/nD,QAAO,CAAC8R,EAAGn/B,MAAUq1E,EAAQr1E,IAAK,wBAwDzCuG,eACLE,EACA6uE,GAEA,MAAMhpD,EAAU,CACd,CACEC,OAAQ,CACNhkC,OAAQ,GACR2L,MAAOohF,EAAO9oD,aAGlB,CACED,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO+nC,GAAoBzP,cAOjC,aAHuB/lB,EAAWimB,mBAAmBqP,GAAiB,CACpEzP,aAEcvO,KAAKzrB,GAAMA,EAAEgW,QAC/B,kCAQuC/B,MAAOE,IAC5C,MAAM6lB,EAAU,CACd,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO+nC,GAAoBzP,cAUjC,aAJuB/lB,EAAWimB,mBAAmBqP,GAAiB,CACpEw5C,UAHgB,CAAEhtF,OAAQ,GAAIpB,OAAQ,IAItCmlC,WAEa,0BcxNekpD,IAC9B,GAAQA,IACD7B,QAAQA,SAAC8B,WACZ,OAAO7B,GAEP,MAAM,IAAIp2D,GAASD,kBAAUm4D,gBAChC,2BPmH6BnvE,MAC9BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOie,MAAM,+BA0NvB1qE,MACjCE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOO,YAAY,6BAnB/BhtD,MAC/BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO4d,UAAU,wBA3BlCrqE,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOI,KAAK,wBAlK7B7sD,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO6e,KAAK,2BO/J1B,CAACnmD,EAAgBiqD,KAC9C,MAAMC,EAAWniB,GAAkBkiB,GAC7BE,EAAepiB,GAAkB/nC,GAEjCoqD,EAAYpiB,GAChBmiB,OACAjpF,EACAkwC,IAIF,MAAO,CAAEg5C,YAAWC,MAFNriB,GAAsBkiB,OAAUhpF,EAAWkpF,GAE9B,2BPwMGvvE,MAC9BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOqe,SAAS,yBArChC9qE,MAAOE,EAAwBilB,UAC7CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOme,MAAM,8EAS5B5qE,MAC5BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOoe,OAAO,wBA5C/B7qE,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOG,KAAK,6BKvExB5sD,MAC/BE,EACAK,KAEA,MAAOkvE,GAAUzC,GAAgBG,WAC/BJ,GACA,IAAIh4E,EAAAA,UAAUwL,IAGVmvE,QAAiB1C,GAAgBtnD,SAASxlB,EAAYuvE,GAEtDzxE,QAAgB2lB,GAAczjB,EAAYwvE,EAASxsD,aAEzD,MAAO,CAAEiC,OAAQuqD,EAASxsD,YAAallB,UAAS,0BLqInBgC,MAC7BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOse,QAAQ,mCIErD/qE,eACLE,EACAysE,GAEA,MAAMC,QAA6Bj2C,GAAcg2C,EAAe5lF,YAC1D8lF,QAA2Bj2C,GAC/Bg2C,EACA72C,GACAC,IAGF,IAAI25C,QAA6BvD,GAA4B1mD,SAC3DxlB,EACA2sE,GAEF,MAAO,CACL8C,EAAqBrD,cACrB,IAAIv3E,EAASA,UAAC46E,EAAqBtD,oBAEvC,mFJgFkCrsE,MAChCE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOK,WAAW,yBAhNlC9sD,MAAOE,EAAwBilB,UAC7CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO8d,MAAM,wBA0C9BvqE,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOke,KAAK,8GA2G7B3qE,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO0e,KAAK,0BA6B3BnrE,MAC5BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO4e,OAAO,iGArNpDrrE,eACLE,EACAilB,EACAyqD,EACA1yD,GAEA,MAAM2yD,EAAUD,EAAQp4D,KAAK+O,GAAW4hD,GAAiBhjD,EAAQoB,KAC3DupD,QAAmB/oD,GAAkBU,cAAcvnB,EAAY2vE,GAErE,OAAI3yD,EACK4yD,EAAWt4D,KAAI,CAACp1B,EAAGqX,KACxB,GAAKrX,EACL,OAAOmmF,GACLnmF,EACAwtF,EAAQn2E,GACR0uE,GAAiBhjD,EAAQyqD,EAAQn2E,IAClC,IAGEq2E,CACT,0BAwH+B9vE,MAC7BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOue,QAAQ,yBrCzE/BhrE,MAAOmlB,EAAgBmS,KAClD,MAAMv1B,OAAEA,EAAMi1B,OAAEA,SAAiBE,GAAa/R,GACxCioC,QAA4Bz2B,GAAc50B,EAAOkkB,YAMvD,aALmC2Q,GACjCw2B,EACAt3B,GACAwB,EAAQN,OAAS3wC,EAEQ,qDqC8GA2Z,MAAOE,EAAwBilB,UAC7CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO2e,MAAM,qDAxBzBprE,MAC/BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOye,UAAU,+BPL3BlrE,MACjCE,EACAK,KAEA,MAAMwvE,QAAmBtpD,GAAgBvmB,EAAYK,GAE/CyiD,QAAcuK,GAClBrtD,EACA6vE,EAAWv4D,KAAKp1B,GAAMA,EAAE8gC,eAG1B,OAAO8/B,EACJxrC,KAAI,CAACp1B,EAAGqX,KACA,CACLme,IAAKm4D,EAAWt2E,GAAKypB,YACrB7hB,KAAM0uE,EAAWt2E,GAAKorB,QACtB7mB,QAAS5b,MAGZ0kC,QAAQ1kC,KAAQA,EAAE4b,SAAQ,mDW7BxBgC,eACLE,EACAysE,GAEA,MAAM5mD,EAAU,CACd,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAOqoC,GAAiC/P,aAG5C,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAOg/E,EAAe1mD,aAG1B,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAOooC,GAA+B9P,cAItC+pD,QAAyB9vE,EAAWimB,mBACxCqP,GACA,CAAEzP,YAGJ,IAAK,MAAMoG,KAAK6jD,EACd,GAAI7jD,EAAE/F,QAAQ3/B,KAAK7F,OAASmmC,GAAkBI,WAAa,GAAI,CAC7D,IAAI1gC,EAAO0lC,EAAE/F,QAAQ3/B,KAAKrB,MAAM2hC,GAAkBI,YAC9C3D,EAAqCxG,GACvCovD,GAA4BhsD,OAC5BgsD,GACA3lF,GAEF,MAAO,CAAC+8B,EAAM8oD,cAAe,IAAIv3E,EAASA,UAACyuB,EAAM6oD,oBAClD,CAEH,MAAM,IAAIp1D,GAASD,kBAAUiQ,oBAC/B,2BJ3CgCjnB,MAC9BE,EACAilB,UAEakjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAOwe,SAAS,8BIzCtDjrE,eACLE,EACA+vE,GAEA,MAAM3C,QAA4B32C,GAAcs5C,GAC1C1C,QAAiC32C,GACrC02C,OACAjnF,EACA2vC,KAEIx6B,SAAEA,SAAmBurB,GAAkBrB,SAC3CxlB,EACAqtE,GAEF,OAAO/xE,CACT,iCAqEOwE,eACLE,EACAysE,GAEA,MAAM5mD,EAAU,CACd,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAOqoC,GAAiC/P,aAG5C,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAOg/E,EAAe1mD,aAG1B,CACED,OAAQ,CACNhkC,OAAQ,GACR2L,MAAO,IAAIoH,EAASA,UAACjR,SAAOE,MAAM,GAAI,IAAIiiC,cAK1C+pD,QAAyB9vE,EAAWimB,mBACxCqP,GACA,CAAEzP,YAGJ,GAAIiqD,EAAiBpvF,OAAS,EAC5B,MAAM,IAAIq2B,GAASD,kBAAUk5D,oBAG/B,OAAOF,EAAiB,GAAG5pD,QAAQ3/B,KAAKrB,MAAM2hC,GAAkBI,WAClE,gCAlIOnnB,eACLiwE,GAEA,MAAM3C,QAA4B32C,GAAcs5C,GAChD,aAAar5C,GACX02C,OACAjnF,EACA2vC,GAEJ,uBJV4Bh2B,MAAOE,EAAwBilB,UAC5CkjD,GAAUnoE,EAAYilB,EAAQsnC,QAAAA,OAAO6d,KAAK,gCrC/IlDtqE,eACLE,EACAgjB,GAEA,MAAMkqC,QAA4Bz2B,GAAczT,EAAY+C,YACtD9C,QAA6ByT,GACjCw2B,EACAt3B,KAGIt6B,SAAEA,SAAmBurB,GAAkBrB,SAC3CxlB,EACAijB,GAEF,IAAK3nB,EAAS/U,KACZ,MAAM,IAAIwwB,GAASD,kBAAUq2C,eAE/B,MAAMC,EAAa,IAAI1qD,GAAGpH,EAAS/U,KAAKrB,MAAM,EAAG,GAAI,MAAMihB,WAC3D,OAAO7K,EAAS/U,KAAKrB,MAAM,EAAG,EAAIkoE,GAAYvmE,UAChD,oCASOiZ,eACLE,EACAqnB,GAEA,IAAIimC,EAAqC,GACzC,IAAK,IAAItqC,KAAeqE,EAAc,CACpC,MAAM6lC,QAA4Bz2B,GAAczT,EAAY+C,YACtD9C,QAA6ByT,GACjCw2B,EACAt3B,IAEF03B,EAAsBvsE,KAAKkiC,EAC5B,CAOD,aALkB4D,GAAkBU,cAClCvnB,EACAstD,IAGWh2C,KAAKlkB,IAChB,QAAajN,IAATiN,QAAoCjN,IAAdiN,EAAK7M,KAC7B,OAEF,IAAI6mE,EAAa,IAAI1qD,GAAGtP,EAAK7M,KAAKrB,MAAM,EAAG,GAAI,MAAMihB,WACrD,OAAO/S,EAAK7M,KAAKrB,MAAM,EAAG,EAAIkoE,GAAYvmE,UAAU,GAExD,6BzBkqBgB,SACdw6B,EACAC,EACAG,EACAU,EACAX,EACAI,GAEA,MAAMI,EAAU,CAACp+B,SAAOe,KAAKs9B,UAAUt9B,KAAK,CAAC,KAAMi9B,EAAM9iB,YAEnDvY,EAAO3C,EAAAA,OAAOoI,OAAOg2B,GACrBpgB,EAAO,CACX,CACEC,OAAQyf,EACRxf,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ4f,EACR3f,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQsgB,EACRrgB,UAAU,EACVC,YAAY,GAEd,CACEF,OAAQ2f,EACR1f,UAAU,EACVC,YAAY,IAIhB,OAAO,IAAIE,EAAAA,uBAAuB,CAChCL,OACAzB,UAAWkhB,EACX96B,QAEJ,6BiE/iBkCuZ,MAChCE,EACA5M,EACAwuB,EACAuB,EACAC,EACAjiB,EAAO60B,GACPi6C,KAGA,GAAI78E,EAAKlG,SAAS,MAAQkG,EAAKxG,OAAOzF,gBAAkBiM,EACtD,MAAM,IAAI2jB,GAASD,kBAAUo5D,eAE/B,MAAOC,GAAMt7E,EAAAA,UAAU0M,uBACrB,CAACk0B,GAAoB32B,YACrB22B,IAGIsB,EAASi2B,GAAkB55D,GAC3B4vB,EAAciqC,GAClBl2B,OACA5wC,EACAqvC,IAGI03B,EAAsBF,GAAkBhqC,EAAY+C,YACpD9C,EAAuBgqC,GAAsBC,EAAqBijB,IAEjEC,GAAiBv7E,EAAAA,UAAU0M,uBAChC,CAACyhB,EAAYlkB,YACb22B,IAGI46C,EAASp6C,GAAUwyC,WAAWvmF,GAAM+tF,eAAAA,EAAazjF,OAAOtK,KAC9D,IAAIouF,EAEJ,MAAM1C,EAAgC,GAEtC,IAAgB,IAAZyC,GAAmBJ,EAAa,CAClCK,EAAkBpvE,GAA8BC,EAAM8uE,GAAa,GACnE,MAAMl2E,QAAYiG,EAAWiB,eAAeqvE,GAC5C,KAAKv2E,eAAAA,EAAKxT,MAAM,CACd,MAAMw9D,EAAKviD,GACT2hB,EACAmtD,EACAL,EACA9uE,GAEFysE,EAAI7sF,KAAKgjE,EACV,CACF,CAED,MAAMwsB,EAAiB,IAAIh0C,GAAcA,eACvCv8B,EACAioD,GAA2BA,4BAAC,iBAExB1hE,QAAagqF,EAAe/zC,UAE5Ba,EAASnH,GAAgB3qC,IAAI4V,EAAK4kB,YAExC,IAAKsX,EACH,MAAM,IAAItmB,GACRD,QAASA,UAAC05D,eACV,4BAA4BrvE,EAAK4kB,cAIrC,MAAMoU,EAAY5zC,EAAKs2C,aAAatxC,IAAI,UAAY8xC,EAAS,QACvDvD,EAAcvzC,EAAKq2C,kBAAkBrxC,IAAI,UAAY8xC,EAAS,QAE9DhZ,EAAQnjB,GAA8BC,EAAMi1B,IAE5C2tB,EAAK,IAAIhgC,GAAoB,CACjC3wB,OACAwuB,QACAoC,gBAA2B,GAAXqsD,EAAeA,EAAS,OACvCxtD,eACD4S,GACAH,GACAE,GACAxS,EACAC,EACAjhB,gBAAc7B,UACdgwE,EACAhtD,EACAC,EACA+S,GACAgE,EAAUoD,kBACV,IAAI1oC,EAASA,UAACilC,EAAYsvB,eAC1B/kC,EACAzvB,EACAm3E,EAAAA,mBACAqE,EACAE,GAIF,OAFA1C,EAAI7sF,KAAKgjE,GAEF,CAAC,GAAI6pB,EAAI,0BA+fa,CAC7Bx6E,EACAwuB,EACAoB,EACAC,EACAE,EACAsB,EACAC,EACAC,EACAC,KAEA,MAAOtB,GAASzuB,EAAAA,UAAU0M,uBACxB,CAACyhB,EAAYlkB,YACb22B,IAqBF,OAnBW,IAAIjR,GAAyB,CAAE5C,QAAOxuB,SAAQyvB,eACvD4S,GACAH,GACAE,GACAxS,EACAC,EACAjhB,gBAAc7B,UACdy1B,GACAzS,EACAsB,EACAC,EACAC,EACAC,EACA0R,GACA1hC,EACAm3E,EAAAA,mBACAzoD,EACAiT,GAEO,sE/Dz0BiBz2B,MAAOE,IACjC,MASMwb,QAAexb,EAAWimB,mBAAmBd,GAAmB,CACpEU,QAVc,CACd,CACEC,OAAQ,CACNhkC,OAAQ,EACR2L,MAAO,SASb,OAAO+tB,EAAOlE,KACXp1B,GAAM,IAAI2S,EAASA,UAAC3S,EAAEgkC,QAAQ3/B,KAAKrB,MAFvB,GAEqCpD,MACnD,8O+D6FIge,eACLE,EACA5M,EACAq9E,EACA95C,EACA7U,EACAW,GAEA,MAAMf,QAAoB+U,GAAcrjC,GAClC+uB,QAAuBuU,GAC3BhV,EACAiV,EACA7U,GAGF,IAAI4uD,EAmBJ,OAjBEA,EADE/5C,UAIM9P,GAAkBrB,SAASxlB,EAAYmiB,IAC7C7mB,SAAS+E,MAGSiiB,GACpBgT,GACAnT,EACAsuD,EACAC,EACA/5C,EACA7U,EACAW,EAIJ,4BAssBiC3iB,MAC/BE,EACA2tE,EACA8C,EACAE,KAEA,MAAM9uE,OAAEA,EAAMu1B,MAAEA,EAAKN,OAAEA,GAAW22B,GAAiBkgB,GAEnD,IAAK72C,IAAWM,EACd,MAAM,IAAIrgB,GAASD,kBAAU+2D,kBAG/B,MAAMvyE,SAAEA,SAAmBurB,GAAkBrB,SAASxlB,EAAY6B,GAElE,IAAIigB,EACAC,EAEA4uD,IACF7uD,EAAagV,EACb/U,SAAyB8E,GAAkBrB,SAASxlB,EAAY82B,IAC7Dx7B,SAAS+E,OAad,OAVWiiB,GACTgT,GACAzzB,EACA4uE,EACAn1E,EAAS+E,WACTla,EACA27B,EACAC,EAGO,8DAxzBJjiB,eACLE,EACA5M,EACAtR,EACAsgC,EACAuU,EACA7U,GAEA,MAAMJ,QAAoB+U,GAAcrjC,GAClC+uB,QAAuBuU,GAC3BhV,EACAiV,EACA7U,GAGF,IAAI8nD,EAiBJ,OAfEA,EADEjzC,UAGc9P,GAAkBrB,SAASxlB,EAAYmiB,IACpD7mB,SAAS+E,MAGM6hB,GAClBoT,GACAnT,EAEA,IAAIlL,GAAUn1B,GACdsgC,EACAwnD,EAIJ,kCAwYuC9pE,MACrCE,EACAilB,EACAoB,EACA9/B,EACA8Z,EACAoB,KAEA48C,GAAMh4B,IAAWkmC,QAAMA,OAACE,IAAK31C,QAASA,UAACsyD,mBACvC,MAAMvnE,OAAEA,GAAW4rD,GAAiB,GAAGpnC,KAAUpB,IAAU8nC,QAAaA,cAACmb,IAEnE9nE,QAAaJ,EAAWiB,eAAeY,GAC7Cw8C,MAAQj+C,aAAI,EAAJA,EAAM7Z,MAAMuwB,QAASA,UAACiQ,qBAE9B,MAAM6pD,EAAa5H,GAAgBziF,EAAM8/B,GACzC,IAAIjmB,aAAA,EAAAA,EAAM7Z,KAAKrB,MAAM,IAAIxE,UAAWkwF,EAAWlwF,OAE7C,MAAO,CACLgiC,GAAkB4S,GAAiBzzB,EAAQJ,EAAOpB,SAC5C2rE,GACJhsE,EACAilB,EACAoB,EACA9/B,EACA8Z,EACAoB,IAaN,MAAO,CARIygB,GACToT,GACAzzB,EACA,IAAIoV,GAAU,GACd25D,EACAvwE,GAGS,oCAa4B,CACvC4kB,EACAoB,EACAsjD,EACAtpE,EACAoB,KAEA,MAAMI,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAEhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAGlB,MAAMyiE,2GAAK8sB,CACTpvE,EACAI,EACAi1B,EACAz2B,EACAi1B,GACA,IAAOtpC,OAAOq6B,GACdilD,GAAyB3B,EAAStjD,GAClCqnD,IAGF,OAAO3pB,CAAE,qCA0K+BjkD,MACxCE,EACAilB,EACA0kD,EACAC,EACAC,EACApoE,KAEA,MAAMI,OAAEA,GAAW4rD,GACjB,GAAGlB,QAAMA,OAACE,OAAOxnC,IACjB8nC,QAAaA,cAACmb,IAGV9nE,QAAaJ,EAAWiB,eAAeY,GAG7C,GAFAw8C,MAAQj+C,aAAI,EAAJA,EAAM7Z,MAAMuwB,QAASA,UAACiQ,qBAEJ,MAAtB3mB,aAAA,EAAAA,EAAM7Z,KAAK7F,QACb,MAAO,CACLgiC,GAAkB4S,GAAiBzzB,EAAQJ,EAAOmoE,SAC5CqC,GACJjsE,EACAilB,EACA0kD,EACAC,EACAC,EACApoE,IAKN,MAAMmvE,EAAalH,GAAmBC,EAAS9nE,EAAQ+nE,EAAQC,GAS/D,MAAO,CARI3nD,GACToT,GACAzzB,EACA,IAAIoV,GAAU,GACd25D,EACAhH,GAGS,kCA5K0B,CACrCkH,EACA7rD,EACAoB,EACAhmB,EACAoB,EACAsvE,KAEA,MAAMlvE,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAGhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAGlB,MAAMyiE,0FAAKitB,CACTvvE,EACAI,EACAi1B,EACAz2B,EACA0wE,EACAz7C,GACAw7C,EACApD,IAEF,OAAO3pB,CAAE,mCDhpB6BjkD,MACtCE,EACAqmB,EACApB,EACA8rD,KAEA,MAAMvI,EAAY+C,GAAetmD,EAAQoB,GACnC4qD,QAAkBC,GAAU1rD,SAASxlB,EAAYwoE,GAEjD2I,EAAQF,EAAUG,WAElBC,EAAa/G,GAAgBzoB,IAAIx7B,GACnCmoD,GAAWC,SACXD,GAAW8C,OAEf,OAC8B,IAA5BP,EAASnlF,QAAQulF,IACjBF,EAAU36B,OAAOi7B,+BAAiCF,CAClD,0BAnC2BvxE,MAC7BE,EACAqmB,EACApB,KAEA,MAAMujD,EAAY+C,GAAetmD,EAAQoB,GACnChmB,QAAc43B,GAAQj4B,EAAYilB,GAClCgsD,QAAkBC,GAAU1rD,SAASxlB,EAAYwoE,GAEjDgJ,EAAcP,EAAUQ,iBAE9B,OACEpxE,EAAM7T,OAAO,IAAIqI,EAASA,UAAC28E,KAC3BP,EAAU36B,OAAOo7B,sBAAwBlD,GAAW8C,MACpD,0BCspB2B,CAC7BrsD,EACAoB,EACAhmB,EACAoB,EACA0vE,KAEA,MAAMtvE,OAAEA,EAAMi1B,OAAEA,GAAW22B,GACzB,GAAGpnC,KAAUpB,IACb8nC,QAAaA,cAACW,IAGhB,IAAK52B,EACH,MAAM,IAAIx1C,MAAM,kBAElB,MAAMyiE,yGAAK4tB,CACTlwE,EACA6zB,GACAzzB,EACAi1B,EACAz2B,EACA8wE,EACAzD,IAEF,OAAO3pB,CAAE"}