@bitzy-app/bitzy-sdk 0.0.7 → 0.1.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (16) hide show
  1. package/CHANGELOG.md +22 -0
  2. package/README.md +56 -0
  3. package/dist/api/Client.d.ts +1 -4
  4. package/dist/api/Client.d.ts.map +1 -1
  5. package/dist/common/FetchSwapRoute.d.ts +7 -0
  6. package/dist/common/FetchSwapRoute.d.ts.map +1 -1
  7. package/dist/constants/index.d.ts +18 -0
  8. package/dist/constants/index.d.ts.map +1 -1
  9. package/dist/index.d.ts +13 -4
  10. package/dist/index.esm.js +1 -3
  11. package/dist/index.esm.js.map +1 -1
  12. package/dist/index.js +1 -3
  13. package/dist/index.js.map +1 -1
  14. package/dist/services/SwapV3Service.d.ts +5 -0
  15. package/dist/services/SwapV3Service.d.ts.map +1 -1
  16. package/package.json +10 -2
package/dist/index.esm.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.esm.js","sources":["../node_modules/bignumber.js/bignumber.mjs","../node_modules/abitype/dist/esm/human-readable/formatAbiParameter.js","../node_modules/abitype/dist/esm/regex.js","../node_modules/abitype/dist/esm/human-readable/formatAbiParameters.js","../node_modules/viem/_esm/utils/abi/formatAbiItem.js","../node_modules/viem/_esm/utils/data/isHex.js","../node_modules/viem/_esm/utils/data/size.js","../node_modules/viem/_esm/errors/version.js","../node_modules/viem/_esm/errors/base.js","../node_modules/viem/_esm/errors/abi.js","../node_modules/viem/_esm/errors/data.js","../node_modules/viem/_esm/utils/data/pad.js","../node_modules/viem/_esm/errors/encoding.js","../node_modules/viem/_esm/utils/data/trim.js","../node_modules/viem/_esm/utils/encoding/fromHex.js","../node_modules/viem/_esm/utils/encoding/toHex.js","../node_modules/viem/_esm/utils/encoding/toBytes.js","../node_modules/@noble/hashes/esm/_u64.js","../node_modules/@noble/hashes/esm/utils.js","../node_modules/@noble/hashes/esm/sha3.js","../node_modules/viem/_esm/utils/hash/keccak256.js","../node_modules/viem/_esm/utils/hash/hashSignature.js","../node_modules/viem/_esm/utils/hash/toSignature.js","../node_modules/abitype/dist/esm/human-readable/formatAbiItem.js","../node_modules/viem/_esm/utils/hash/normalizeSignature.js","../node_modules/viem/_esm/utils/hash/toSignatureHash.js","../node_modules/viem/_esm/utils/hash/toEventSelector.js","../node_modules/viem/_esm/errors/address.js","../node_modules/viem/_esm/utils/lru.js","../node_modules/viem/_esm/utils/address/getAddress.js","../node_modules/viem/_esm/utils/address/isAddress.js","../node_modules/viem/_esm/utils/data/concat.js","../node_modules/viem/_esm/utils/data/slice.js","../node_modules/viem/_esm/utils/regex.js","../node_modules/viem/_esm/utils/abi/encodeAbiParameters.js","../node_modules/viem/_esm/utils/hash/toFunctionSelector.js","../node_modules/viem/_esm/utils/abi/getAbiItem.js","../node_modules/viem/_esm/utils/abi/prepareEncodeFunctionData.js","../node_modules/viem/_esm/utils/abi/encodeFunctionData.js","../node_modules/viem/_esm/errors/cursor.js","../node_modules/viem/_esm/utils/cursor.js","../node_modules/viem/_esm/utils/encoding/fromBytes.js","../node_modules/viem/_esm/utils/abi/decodeAbiParameters.js","../node_modules/viem/_esm/utils/abi/decodeFunctionResult.js","../node_modules/viem/_esm/constants/address.js","../src/types/index.ts","../src/constants/index.ts","../src/api/Client.ts","../src/utils/PartCount.ts","../src/utils/index.ts","../src/constants/Abis.ts","../src/services/SwapV3Service.ts","../src/common/FetchSwapRoute.ts","../src/hooks/useSwapV3Routes.ts"],"sourcesContent":["/*\r\n * bignumber.js v9.3.1\r\n * A JavaScript library for arbitrary-precision arithmetic.\r\n * https://github.com/MikeMcl/bignumber.js\r\n * Copyright (c) 2025 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licensed.\r\n *\r\n * BigNumber.prototype methods | BigNumber methods\r\n * |\r\n * absoluteValue abs | clone\r\n * comparedTo | config set\r\n * decimalPlaces dp | DECIMAL_PLACES\r\n * dividedBy div | ROUNDING_MODE\r\n * dividedToIntegerBy idiv | EXPONENTIAL_AT\r\n * exponentiatedBy pow | RANGE\r\n * integerValue | CRYPTO\r\n * isEqualTo eq | MODULO_MODE\r\n * isFinite | POW_PRECISION\r\n * isGreaterThan gt | FORMAT\r\n * isGreaterThanOrEqualTo gte | ALPHABET\r\n * isInteger | isBigNumber\r\n * isLessThan lt | maximum max\r\n * isLessThanOrEqualTo lte | minimum min\r\n * isNaN | random\r\n * isNegative | sum\r\n * isPositive |\r\n * isZero |\r\n * minus |\r\n * modulo mod |\r\n * multipliedBy times |\r\n * negated |\r\n * plus |\r\n * precision sd |\r\n * shiftedBy |\r\n * squareRoot sqrt |\r\n * toExponential |\r\n * toFixed |\r\n * toFormat |\r\n * toFraction |\r\n * toJSON |\r\n * toNumber |\r\n * toPrecision |\r\n * toString |\r\n * valueOf |\r\n *\r\n */\r\n\r\n\r\nvar\r\n isNumeric = /^-?(?:\\d+(?:\\.\\d*)?|\\.\\d+)(?:e[+-]?\\d+)?$/i,\r\n mathceil = Math.ceil,\r\n mathfloor = Math.floor,\r\n\r\n bignumberError = '[BigNumber Error] ',\r\n tooManyDigits = bignumberError + 'Number primitive has more than 15 significant digits: ',\r\n\r\n BASE = 1e14,\r\n LOG_BASE = 14,\r\n MAX_SAFE_INTEGER = 0x1fffffffffffff, // 2^53 - 1\r\n // MAX_INT32 = 0x7fffffff, // 2^31 - 1\r\n POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13],\r\n SQRT_BASE = 1e7,\r\n\r\n // EDITABLE\r\n // The limit on the value of DECIMAL_PLACES, TO_EXP_NEG, TO_EXP_POS, MIN_EXP, MAX_EXP, and\r\n // the arguments to toExponential, toFixed, toFormat, and toPrecision.\r\n MAX = 1E9; // 0 to MAX_INT32\r\n\r\n\r\n/*\r\n * Create and return a BigNumber constructor.\r\n */\r\nfunction clone(configObject) {\r\n var div, convertBase, parseNumeric,\r\n P = BigNumber.prototype = { constructor: BigNumber, toString: null, valueOf: null },\r\n ONE = new BigNumber(1),\r\n\r\n\r\n //----------------------------- EDITABLE CONFIG DEFAULTS -------------------------------\r\n\r\n\r\n // The default values below must be integers within the inclusive ranges stated.\r\n // The values can also be changed at run-time using BigNumber.set.\r\n\r\n // The maximum number of decimal places for operations involving division.\r\n DECIMAL_PLACES = 20, // 0 to MAX\r\n\r\n // The rounding mode used when rounding to the above decimal places, and when using\r\n // toExponential, toFixed, toFormat and toPrecision, and round (default value).\r\n // UP 0 Away from zero.\r\n // DOWN 1 Towards zero.\r\n // CEIL 2 Towards +Infinity.\r\n // FLOOR 3 Towards -Infinity.\r\n // HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n ROUNDING_MODE = 4, // 0 to 8\r\n\r\n // EXPONENTIAL_AT : [TO_EXP_NEG , TO_EXP_POS]\r\n\r\n // The exponent value at and beneath which toString returns exponential notation.\r\n // Number type: -7\r\n TO_EXP_NEG = -7, // 0 to -MAX\r\n\r\n // The exponent value at and above which toString returns exponential notation.\r\n // Number type: 21\r\n TO_EXP_POS = 21, // 0 to MAX\r\n\r\n // RANGE : [MIN_EXP, MAX_EXP]\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // Number type: -324 (5e-324)\r\n MIN_EXP = -1e7, // -1 to -MAX\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // Number type: 308 (1.7976931348623157e+308)\r\n // For MAX_EXP > 1e7, e.g. new BigNumber('1e100000000').plus(1) may be slow.\r\n MAX_EXP = 1e7, // 1 to MAX\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n CRYPTO = false, // true or false\r\n\r\n // The modulo mode used when calculating the modulus: a mod n.\r\n // The quotient (q = a / n) is calculated according to the corresponding rounding mode.\r\n // The remainder (r) is calculated as: r = a - n * q.\r\n //\r\n // UP 0 The remainder is positive if the dividend is negative, else is negative.\r\n // DOWN 1 The remainder has the same sign as the dividend.\r\n // This modulo mode is commonly known as 'truncated division' and is\r\n // equivalent to (a % n) in JavaScript.\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 This modulo mode implements the IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)).\r\n // The remainder is always positive.\r\n //\r\n // The truncated division, floored division, Euclidian division and IEEE 754 remainder\r\n // modes are commonly used for the modulus operation.\r\n // Although the other rounding modes can also be used, they may not give useful results.\r\n MODULO_MODE = 1, // 0 to 9\r\n\r\n // The maximum number of significant digits of the result of the exponentiatedBy operation.\r\n // If POW_PRECISION is 0, there will be unlimited significant digits.\r\n POW_PRECISION = 0, // 0 to MAX\r\n\r\n // The format specification used by the BigNumber.prototype.toFormat method.\r\n FORMAT = {\r\n prefix: '',\r\n groupSize: 3,\r\n secondaryGroupSize: 0,\r\n groupSeparator: ',',\r\n decimalSeparator: '.',\r\n fractionGroupSize: 0,\r\n fractionGroupSeparator: '\\xA0', // non-breaking space\r\n suffix: ''\r\n },\r\n\r\n // The alphabet used for base conversion. It must be at least 2 characters long, with no '+',\r\n // '-', '.', whitespace, or repeated character.\r\n // '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ$_'\r\n ALPHABET = '0123456789abcdefghijklmnopqrstuvwxyz',\r\n alphabetHasNormalDecimalDigits = true;\r\n\r\n\r\n //------------------------------------------------------------------------------------------\r\n\r\n\r\n // CONSTRUCTOR\r\n\r\n\r\n /*\r\n * The BigNumber constructor and exported function.\r\n * Create and return a new instance of a BigNumber object.\r\n *\r\n * v {number|string|BigNumber} A numeric value.\r\n * [b] {number} The base of v. Integer, 2 to ALPHABET.length inclusive.\r\n */\r\n function BigNumber(v, b) {\r\n var alphabet, c, caseChanged, e, i, isNum, len, str,\r\n x = this;\r\n\r\n // Enable constructor call without `new`.\r\n if (!(x instanceof BigNumber)) return new BigNumber(v, b);\r\n\r\n if (b == null) {\r\n\r\n if (v && v._isBigNumber === true) {\r\n x.s = v.s;\r\n\r\n if (!v.c || v.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else if (v.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = v.e;\r\n x.c = v.c.slice();\r\n }\r\n\r\n return;\r\n }\r\n\r\n if ((isNum = typeof v == 'number') && v * 0 == 0) {\r\n\r\n // Use `1 / n` to handle minus zero also.\r\n x.s = 1 / v < 0 ? (v = -v, -1) : 1;\r\n\r\n // Fast path for integers, where n < 2147483648 (2**31).\r\n if (v === ~~v) {\r\n for (e = 0, i = v; i >= 10; i /= 10, e++);\r\n\r\n if (e > MAX_EXP) {\r\n x.c = x.e = null;\r\n } else {\r\n x.e = e;\r\n x.c = [v];\r\n }\r\n\r\n return;\r\n }\r\n\r\n str = String(v);\r\n } else {\r\n\r\n if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);\r\n\r\n x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n\r\n // Exponential form?\r\n if ((i = str.search(/e/i)) > 0) {\r\n\r\n // Determine exponent.\r\n if (e < 0) e = i;\r\n e += +str.slice(i + 1);\r\n str = str.substring(0, i);\r\n } else if (e < 0) {\r\n\r\n // Integer.\r\n e = str.length;\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n\r\n // Allow exponential notation to be used with base 10 argument, while\r\n // also rounding to DECIMAL_PLACES as with other bases.\r\n if (b == 10 && alphabetHasNormalDecimalDigits) {\r\n x = new BigNumber(v);\r\n return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);\r\n }\r\n\r\n str = String(v);\r\n\r\n if (isNum = typeof v == 'number') {\r\n\r\n // Avoid potential interpretation of Infinity and NaN as base 44+ values.\r\n if (v * 0 != 0) return parseNumeric(x, str, isNum, b);\r\n\r\n x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (BigNumber.DEBUG && str.replace(/^0\\.0*|\\./, '').length > 15) {\r\n throw Error\r\n (tooManyDigits + v);\r\n }\r\n } else {\r\n x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;\r\n }\r\n\r\n alphabet = ALPHABET.slice(0, b);\r\n e = i = 0;\r\n\r\n // Check that str is a valid base b number.\r\n // Don't use RegExp, so alphabet can contain special characters.\r\n for (len = str.length; i < len; i++) {\r\n if (alphabet.indexOf(c = str.charAt(i)) < 0) {\r\n if (c == '.') {\r\n\r\n // If '.' is not the first character and it has not be found before.\r\n if (i > e) {\r\n e = len;\r\n continue;\r\n }\r\n } else if (!caseChanged) {\r\n\r\n // Allow e.g. hexadecimal 'FF' as well as 'ff'.\r\n if (str == str.toUpperCase() && (str = str.toLowerCase()) ||\r\n str == str.toLowerCase() && (str = str.toUpperCase())) {\r\n caseChanged = true;\r\n i = -1;\r\n e = 0;\r\n continue;\r\n }\r\n }\r\n\r\n return parseNumeric(x, String(v), isNum, b);\r\n }\r\n }\r\n\r\n // Prevent later check for length on converted number.\r\n isNum = false;\r\n str = convertBase(str, b, 10, x.s);\r\n\r\n // Decimal point?\r\n if ((e = str.indexOf('.')) > -1) str = str.replace('.', '');\r\n else e = str.length;\r\n }\r\n\r\n // Determine leading zeros.\r\n for (i = 0; str.charCodeAt(i) === 48; i++);\r\n\r\n // Determine trailing zeros.\r\n for (len = str.length; str.charCodeAt(--len) === 48;);\r\n\r\n if (str = str.slice(i, ++len)) {\r\n len -= i;\r\n\r\n // '[BigNumber Error] Number primitive has more than 15 significant digits: {n}'\r\n if (isNum && BigNumber.DEBUG &&\r\n len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {\r\n throw Error\r\n (tooManyDigits + (x.s * v));\r\n }\r\n\r\n // Overflow?\r\n if ((e = e - i - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n x.c = x.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n } else {\r\n x.e = e;\r\n x.c = [];\r\n\r\n // Transform base\r\n\r\n // e is the base 10 exponent.\r\n // i is where to slice str to get the first element of the coefficient array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE; // i < 1\r\n\r\n if (i < len) {\r\n if (i) x.c.push(+str.slice(0, i));\r\n\r\n for (len -= LOG_BASE; i < len;) {\r\n x.c.push(+str.slice(i, i += LOG_BASE));\r\n }\r\n\r\n i = LOG_BASE - (str = str.slice(i)).length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--; str += '0');\r\n x.c.push(+str);\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n\r\n // CONSTRUCTOR PROPERTIES\r\n\r\n\r\n BigNumber.clone = clone;\r\n\r\n BigNumber.ROUND_UP = 0;\r\n BigNumber.ROUND_DOWN = 1;\r\n BigNumber.ROUND_CEIL = 2;\r\n BigNumber.ROUND_FLOOR = 3;\r\n BigNumber.ROUND_HALF_UP = 4;\r\n BigNumber.ROUND_HALF_DOWN = 5;\r\n BigNumber.ROUND_HALF_EVEN = 6;\r\n BigNumber.ROUND_HALF_CEIL = 7;\r\n BigNumber.ROUND_HALF_FLOOR = 8;\r\n BigNumber.EUCLID = 9;\r\n\r\n\r\n /*\r\n * Configure infrequently-changing library-wide settings.\r\n *\r\n * Accept an object with the following optional properties (if the value of a property is\r\n * a number, it must be an integer within the inclusive range stated):\r\n *\r\n * DECIMAL_PLACES {number} 0 to MAX\r\n * ROUNDING_MODE {number} 0 to 8\r\n * EXPONENTIAL_AT {number|number[]} -MAX to MAX or [-MAX to 0, 0 to MAX]\r\n * RANGE {number|number[]} -MAX to MAX (not zero) or [-MAX to -1, 1 to MAX]\r\n * CRYPTO {boolean} true or false\r\n * MODULO_MODE {number} 0 to 9\r\n * POW_PRECISION {number} 0 to MAX\r\n * ALPHABET {string} A string of two or more unique characters which does\r\n * not contain '.'.\r\n * FORMAT {object} An object with some of the following properties:\r\n * prefix {string}\r\n * groupSize {number}\r\n * secondaryGroupSize {number}\r\n * groupSeparator {string}\r\n * decimalSeparator {string}\r\n * fractionGroupSize {number}\r\n * fractionGroupSeparator {string}\r\n * suffix {string}\r\n *\r\n * (The values assigned to the above FORMAT object properties are not checked for validity.)\r\n *\r\n * E.g.\r\n * BigNumber.config({ DECIMAL_PLACES : 20, ROUNDING_MODE : 4 })\r\n *\r\n * Ignore properties/parameters set to null or undefined, except for ALPHABET.\r\n *\r\n * Return an object with the properties current values.\r\n */\r\n BigNumber.config = BigNumber.set = function (obj) {\r\n var p, v;\r\n\r\n if (obj != null) {\r\n\r\n if (typeof obj == 'object') {\r\n\r\n // DECIMAL_PLACES {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] DECIMAL_PLACES {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'DECIMAL_PLACES')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n DECIMAL_PLACES = v;\r\n }\r\n\r\n // ROUNDING_MODE {number} Integer, 0 to 8 inclusive.\r\n // '[BigNumber Error] ROUNDING_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'ROUNDING_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 8, p);\r\n ROUNDING_MODE = v;\r\n }\r\n\r\n // EXPONENTIAL_AT {number|number[]}\r\n // Integer, -MAX to MAX inclusive or\r\n // [integer -MAX to 0 inclusive, 0 to MAX inclusive].\r\n // '[BigNumber Error] EXPONENTIAL_AT {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'EXPONENTIAL_AT')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, 0, p);\r\n intCheck(v[1], 0, MAX, p);\r\n TO_EXP_NEG = v[0];\r\n TO_EXP_POS = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);\r\n }\r\n }\r\n\r\n // RANGE {number|number[]} Non-zero integer, -MAX to MAX inclusive or\r\n // [integer -MAX to -1 inclusive, integer 1 to MAX inclusive].\r\n // '[BigNumber Error] RANGE {not a primitive number|not an integer|out of range|cannot be zero}: {v}'\r\n if (obj.hasOwnProperty(p = 'RANGE')) {\r\n v = obj[p];\r\n if (v && v.pop) {\r\n intCheck(v[0], -MAX, -1, p);\r\n intCheck(v[1], 1, MAX, p);\r\n MIN_EXP = v[0];\r\n MAX_EXP = v[1];\r\n } else {\r\n intCheck(v, -MAX, MAX, p);\r\n if (v) {\r\n MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' cannot be zero: ' + v);\r\n }\r\n }\r\n }\r\n\r\n // CRYPTO {boolean} true or false.\r\n // '[BigNumber Error] CRYPTO not true or false: {v}'\r\n // '[BigNumber Error] crypto unavailable'\r\n if (obj.hasOwnProperty(p = 'CRYPTO')) {\r\n v = obj[p];\r\n if (v === !!v) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues || crypto.randomBytes)) {\r\n CRYPTO = v;\r\n } else {\r\n CRYPTO = !v;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n } else {\r\n CRYPTO = v;\r\n }\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' not true or false: ' + v);\r\n }\r\n }\r\n\r\n // MODULO_MODE {number} Integer, 0 to 9 inclusive.\r\n // '[BigNumber Error] MODULO_MODE {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'MODULO_MODE')) {\r\n v = obj[p];\r\n intCheck(v, 0, 9, p);\r\n MODULO_MODE = v;\r\n }\r\n\r\n // POW_PRECISION {number} Integer, 0 to MAX inclusive.\r\n // '[BigNumber Error] POW_PRECISION {not a primitive number|not an integer|out of range}: {v}'\r\n if (obj.hasOwnProperty(p = 'POW_PRECISION')) {\r\n v = obj[p];\r\n intCheck(v, 0, MAX, p);\r\n POW_PRECISION = v;\r\n }\r\n\r\n // FORMAT {object}\r\n // '[BigNumber Error] FORMAT not an object: {v}'\r\n if (obj.hasOwnProperty(p = 'FORMAT')) {\r\n v = obj[p];\r\n if (typeof v == 'object') FORMAT = v;\r\n else throw Error\r\n (bignumberError + p + ' not an object: ' + v);\r\n }\r\n\r\n // ALPHABET {string}\r\n // '[BigNumber Error] ALPHABET invalid: {v}'\r\n if (obj.hasOwnProperty(p = 'ALPHABET')) {\r\n v = obj[p];\r\n\r\n // Disallow if less than two characters,\r\n // or if it contains '+', '-', '.', whitespace, or a repeated character.\r\n if (typeof v == 'string' && !/^.?$|[+\\-.\\s]|(.).*\\1/.test(v)) {\r\n alphabetHasNormalDecimalDigits = v.slice(0, 10) == '0123456789';\r\n ALPHABET = v;\r\n } else {\r\n throw Error\r\n (bignumberError + p + ' invalid: ' + v);\r\n }\r\n }\r\n\r\n } else {\r\n\r\n // '[BigNumber Error] Object expected: {v}'\r\n throw Error\r\n (bignumberError + 'Object expected: ' + obj);\r\n }\r\n }\r\n\r\n return {\r\n DECIMAL_PLACES: DECIMAL_PLACES,\r\n ROUNDING_MODE: ROUNDING_MODE,\r\n EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],\r\n RANGE: [MIN_EXP, MAX_EXP],\r\n CRYPTO: CRYPTO,\r\n MODULO_MODE: MODULO_MODE,\r\n POW_PRECISION: POW_PRECISION,\r\n FORMAT: FORMAT,\r\n ALPHABET: ALPHABET\r\n };\r\n };\r\n\r\n\r\n /*\r\n * Return true if v is a BigNumber instance, otherwise return false.\r\n *\r\n * If BigNumber.DEBUG is true, throw if a BigNumber instance is not well-formed.\r\n *\r\n * v {any}\r\n *\r\n * '[BigNumber Error] Invalid BigNumber: {v}'\r\n */\r\n BigNumber.isBigNumber = function (v) {\r\n if (!v || v._isBigNumber !== true) return false;\r\n if (!BigNumber.DEBUG) return true;\r\n\r\n var i, n,\r\n c = v.c,\r\n e = v.e,\r\n s = v.s;\r\n\r\n out: if ({}.toString.call(c) == '[object Array]') {\r\n\r\n if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {\r\n\r\n // If the first element is zero, the BigNumber value must be zero.\r\n if (c[0] === 0) {\r\n if (e === 0 && c.length === 1) return true;\r\n break out;\r\n }\r\n\r\n // Calculate number of digits that c[0] should have, based on the exponent.\r\n i = (e + 1) % LOG_BASE;\r\n if (i < 1) i += LOG_BASE;\r\n\r\n // Calculate number of digits of c[0].\r\n //if (Math.ceil(Math.log(c[0] + 1) / Math.LN10) == i) {\r\n if (String(c[0]).length == i) {\r\n\r\n for (i = 0; i < c.length; i++) {\r\n n = c[i];\r\n if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;\r\n }\r\n\r\n // Last element cannot be zero, unless it is the only element.\r\n if (n !== 0) return true;\r\n }\r\n }\r\n\r\n // Infinity/NaN\r\n } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {\r\n return true;\r\n }\r\n\r\n throw Error\r\n (bignumberError + 'Invalid BigNumber: ' + v);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the maximum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.maximum = BigNumber.max = function () {\r\n return maxOrMin(arguments, -1);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the minimum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.minimum = BigNumber.min = function () {\r\n return maxOrMin(arguments, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber with a random value equal to or greater than 0 and less than 1,\r\n * and with dp, or DECIMAL_PLACES if dp is omitted, decimal places (or less if trailing\r\n * zeros are produced).\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp}'\r\n * '[BigNumber Error] crypto unavailable'\r\n */\r\n BigNumber.random = (function () {\r\n var pow2_53 = 0x20000000000000;\r\n\r\n // Return a 53 bit integer n, where 0 <= n < 9007199254740992.\r\n // Check if Math.random() produces more than 32 bits of randomness.\r\n // If it does, assume at least 53 bits are produced, otherwise assume at least 30 bits.\r\n // 0x40000000 is 2^30, 0x800000 is 2^23, 0x1fffff is 2^21 - 1.\r\n var random53bitInt = (Math.random() * pow2_53) & 0x1fffff\r\n ? function () { return mathfloor(Math.random() * pow2_53); }\r\n : function () { return ((Math.random() * 0x40000000 | 0) * 0x800000) +\r\n (Math.random() * 0x800000 | 0); };\r\n\r\n return function (dp) {\r\n var a, b, e, k, v,\r\n i = 0,\r\n c = [],\r\n rand = new BigNumber(ONE);\r\n\r\n if (dp == null) dp = DECIMAL_PLACES;\r\n else intCheck(dp, 0, MAX);\r\n\r\n k = mathceil(dp / LOG_BASE);\r\n\r\n if (CRYPTO) {\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n if (crypto.getRandomValues) {\r\n\r\n a = crypto.getRandomValues(new Uint32Array(k *= 2));\r\n\r\n for (; i < k;) {\r\n\r\n // 53 bits:\r\n // ((Math.pow(2, 32) - 1) * Math.pow(2, 21)).toString(2)\r\n // 11111 11111111 11111111 11111111 11100000 00000000 00000000\r\n // ((Math.pow(2, 32) - 1) >>> 11).toString(2)\r\n // 11111 11111111 11111111\r\n // 0x20000 is 2^21.\r\n v = a[i] * 0x20000 + (a[i + 1] >>> 11);\r\n\r\n // Rejection sampling:\r\n // 0 <= v < 9007199254740992\r\n // Probability that v >= 9e15, is\r\n // 7199254740992 / 9007199254740992 ~= 0.0008, i.e. 1 in 1251\r\n if (v >= 9e15) {\r\n b = crypto.getRandomValues(new Uint32Array(2));\r\n a[i] = b[0];\r\n a[i + 1] = b[1];\r\n } else {\r\n\r\n // 0 <= v <= 8999999999999999\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 2;\r\n }\r\n }\r\n i = k / 2;\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n a = crypto.randomBytes(k *= 7);\r\n\r\n for (; i < k;) {\r\n\r\n // 0x1000000000000 is 2^48, 0x10000000000 is 2^40\r\n // 0x100000000 is 2^32, 0x1000000 is 2^24\r\n // 11111 11111111 11111111 11111111 11111111 11111111 11111111\r\n // 0 <= v < 9007199254740992\r\n v = ((a[i] & 31) * 0x1000000000000) + (a[i + 1] * 0x10000000000) +\r\n (a[i + 2] * 0x100000000) + (a[i + 3] * 0x1000000) +\r\n (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];\r\n\r\n if (v >= 9e15) {\r\n crypto.randomBytes(7).copy(a, i);\r\n } else {\r\n\r\n // 0 <= (v % 1e14) <= 99999999999999\r\n c.push(v % 1e14);\r\n i += 7;\r\n }\r\n }\r\n i = k / 7;\r\n } else {\r\n CRYPTO = false;\r\n throw Error\r\n (bignumberError + 'crypto unavailable');\r\n }\r\n }\r\n\r\n // Use Math.random.\r\n if (!CRYPTO) {\r\n\r\n for (; i < k;) {\r\n v = random53bitInt();\r\n if (v < 9e15) c[i++] = v % 1e14;\r\n }\r\n }\r\n\r\n k = c[--i];\r\n dp %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to dp.\r\n if (k && dp) {\r\n v = POWS_TEN[LOG_BASE - dp];\r\n c[i] = mathfloor(k / v) * v;\r\n }\r\n\r\n // Remove trailing elements which are zero.\r\n for (; c[i] === 0; c.pop(), i--);\r\n\r\n // Zero?\r\n if (i < 0) {\r\n c = [e = 0];\r\n } else {\r\n\r\n // Remove leading elements which are zero and adjust exponent accordingly.\r\n for (e = -1 ; c[0] === 0; c.splice(0, 1), e -= LOG_BASE);\r\n\r\n // Count the digits of the first element of c to determine leading zeros, and...\r\n for (i = 1, v = c[0]; v >= 10; v /= 10, i++);\r\n\r\n // adjust the exponent accordingly.\r\n if (i < LOG_BASE) e -= LOG_BASE - i;\r\n }\r\n\r\n rand.e = e;\r\n rand.c = c;\r\n return rand;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the sum of the arguments.\r\n *\r\n * arguments {number|string|BigNumber}\r\n */\r\n BigNumber.sum = function () {\r\n var i = 1,\r\n args = arguments,\r\n sum = new BigNumber(args[0]);\r\n for (; i < args.length;) sum = sum.plus(args[i++]);\r\n return sum;\r\n };\r\n\r\n\r\n // PRIVATE FUNCTIONS\r\n\r\n\r\n // Called by BigNumber and BigNumber.prototype.toString.\r\n convertBase = (function () {\r\n var decimal = '0123456789';\r\n\r\n /*\r\n * Convert string of baseIn to an array of numbers of baseOut.\r\n * Eg. toBaseOut('255', 10, 16) returns [15, 15].\r\n * Eg. toBaseOut('ff', 16, 10) returns [2, 5, 5].\r\n */\r\n function toBaseOut(str, baseIn, baseOut, alphabet) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n len = str.length;\r\n\r\n for (; i < len;) {\r\n for (arrL = arr.length; arrL--; arr[arrL] *= baseIn);\r\n\r\n arr[0] += alphabet.indexOf(str.charAt(i++));\r\n\r\n for (j = 0; j < arr.length; j++) {\r\n\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] == null) arr[j + 1] = 0;\r\n arr[j + 1] += arr[j] / baseOut | 0;\r\n arr[j] %= baseOut;\r\n }\r\n }\r\n }\r\n\r\n return arr.reverse();\r\n }\r\n\r\n // Convert a numeric string of baseIn to a numeric string of baseOut.\r\n // If the caller is toString, we are converting from base 10 to baseOut.\r\n // If the caller is BigNumber, we are converting from baseIn to base 10.\r\n return function (str, baseIn, baseOut, sign, callerIsToString) {\r\n var alphabet, d, e, k, r, x, xc, y,\r\n i = str.indexOf('.'),\r\n dp = DECIMAL_PLACES,\r\n rm = ROUNDING_MODE;\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n k = POW_PRECISION;\r\n\r\n // Unlimited precision.\r\n POW_PRECISION = 0;\r\n str = str.replace('.', '');\r\n y = new BigNumber(baseIn);\r\n x = y.pow(str.length - i);\r\n POW_PRECISION = k;\r\n\r\n // Convert str as if an integer, then restore the fraction part by dividing the\r\n // result by its base raised to a power.\r\n\r\n y.c = toBaseOut(toFixedPoint(coeffToString(x.c), x.e, '0'),\r\n 10, baseOut, decimal);\r\n y.e = y.c.length;\r\n }\r\n\r\n // Convert the number as integer.\r\n\r\n xc = toBaseOut(str, baseIn, baseOut, callerIsToString\r\n ? (alphabet = ALPHABET, decimal)\r\n : (alphabet = decimal, ALPHABET));\r\n\r\n // xc now represents str as an integer and converted to baseOut. e is the exponent.\r\n e = k = xc.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xc[--k] == 0; xc.pop());\r\n\r\n // Zero?\r\n if (!xc[0]) return alphabet.charAt(0);\r\n\r\n // Does str represent an integer? If so, no need for the division.\r\n if (i < 0) {\r\n --e;\r\n } else {\r\n x.c = xc;\r\n x.e = e;\r\n\r\n // The sign is needed for correct rounding.\r\n x.s = sign;\r\n x = div(x, y, dp, rm, baseOut);\r\n xc = x.c;\r\n r = x.r;\r\n e = x.e;\r\n }\r\n\r\n // xc now represents str converted to baseOut.\r\n\r\n // The index of the rounding digit.\r\n d = e + dp + 1;\r\n\r\n // The rounding digit: the digit to the right of the digit that may be rounded up.\r\n i = xc[d];\r\n\r\n // Look at the rounding digits and mode to determine whether to round up.\r\n\r\n k = baseOut / 2;\r\n r = r || d < 0 || xc[d + 1] != null;\r\n\r\n r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : i > k || i == k &&(rm == 4 || r || rm == 6 && xc[d - 1] & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n // If the index of the rounding digit is not greater than zero, or xc represents\r\n // zero, then the result of the base conversion is zero or, if rounding up, a value\r\n // such as 0.00001.\r\n if (d < 1 || !xc[0]) {\r\n\r\n // 1^-dp or 0\r\n str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);\r\n } else {\r\n\r\n // Truncate xc to the required number of decimal places.\r\n xc.length = d;\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (--baseOut; ++xc[--d] > baseOut;) {\r\n xc[d] = 0;\r\n\r\n if (!d) {\r\n ++e;\r\n xc = [1].concat(xc);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (k = xc.length; !xc[--k];);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i <= k; str += alphabet.charAt(xc[i++]));\r\n\r\n // Add leading zeros, decimal point and trailing zeros as required.\r\n str = toFixedPoint(str, e, alphabet.charAt(0));\r\n }\r\n\r\n // The caller will add the sign.\r\n return str;\r\n };\r\n })();\r\n\r\n\r\n // Perform division in the specified base. Called by div and convertBase.\r\n div = (function () {\r\n\r\n // Assume non-zero x and k.\r\n function multiply(x, k, base) {\r\n var m, temp, xlo, xhi,\r\n carry = 0,\r\n i = x.length,\r\n klo = k % SQRT_BASE,\r\n khi = k / SQRT_BASE | 0;\r\n\r\n for (x = x.slice(); i--;) {\r\n xlo = x[i] % SQRT_BASE;\r\n xhi = x[i] / SQRT_BASE | 0;\r\n m = khi * xlo + xhi * klo;\r\n temp = klo * xlo + ((m % SQRT_BASE) * SQRT_BASE) + carry;\r\n carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;\r\n x[i] = temp % base;\r\n }\r\n\r\n if (carry) x = [carry].concat(x);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, cmp;\r\n\r\n if (aL != bL) {\r\n cmp = aL > bL ? 1 : -1;\r\n } else {\r\n\r\n for (i = cmp = 0; i < aL; i++) {\r\n\r\n if (a[i] != b[i]) {\r\n cmp = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return cmp;\r\n }\r\n\r\n function subtract(a, b, aL, base) {\r\n var i = 0;\r\n\r\n // Subtract b from a.\r\n for (; aL--;) {\r\n a[aL] -= i;\r\n i = a[aL] < b[aL] ? 1 : 0;\r\n a[aL] = i * base + a[aL] - b[aL];\r\n }\r\n\r\n // Remove leading zeros.\r\n for (; !a[0] && a.length > 1; a.splice(0, 1));\r\n }\r\n\r\n // x: dividend, y: divisor.\r\n return function (x, y, dp, rm, base) {\r\n var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0,\r\n yL, yz,\r\n s = x.s == y.s ? 1 : -1,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xc || !xc[0] || !yc || !yc[0]) {\r\n\r\n return new BigNumber(\r\n\r\n // Return NaN if either NaN, or both Infinity or 0.\r\n !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN :\r\n\r\n // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.\r\n xc && xc[0] == 0 || !yc ? s * 0 : s / 0\r\n );\r\n }\r\n\r\n q = new BigNumber(s);\r\n qc = q.c = [];\r\n e = x.e - y.e;\r\n s = dp + e + 1;\r\n\r\n if (!base) {\r\n base = BASE;\r\n e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);\r\n s = s / LOG_BASE | 0;\r\n }\r\n\r\n // Result exponent may be one less then the current value of e.\r\n // The coefficients of the BigNumbers from convertBase may have trailing zeros.\r\n for (i = 0; yc[i] == (xc[i] || 0); i++);\r\n\r\n if (yc[i] > (xc[i] || 0)) e--;\r\n\r\n if (s < 0) {\r\n qc.push(1);\r\n more = true;\r\n } else {\r\n xL = xc.length;\r\n yL = yc.length;\r\n i = 0;\r\n s += 2;\r\n\r\n // Normalise xc and yc so highest order digit of yc is >= base / 2.\r\n\r\n n = mathfloor(base / (yc[0] + 1));\r\n\r\n // Not necessary, but to handle odd bases where yc[0] == (base / 2) - 1.\r\n // if (n > 1 || n++ == 1 && yc[0] < base / 2) {\r\n if (n > 1) {\r\n yc = multiply(yc, n, base);\r\n xc = multiply(xc, n, base);\r\n yL = yc.length;\r\n xL = xc.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xc.slice(0, yL);\r\n remL = rem.length;\r\n\r\n // Add zeros to make remainder as long as divisor.\r\n for (; remL < yL; rem[remL++] = 0);\r\n yz = yc.slice();\r\n yz = [0].concat(yz);\r\n yc0 = yc[0];\r\n if (yc[1] >= base / 2) yc0++;\r\n // Not necessary, but to prevent trial digit n > base, when using base 3.\r\n // else if (base == 3 && yc0 == 1) yc0 = 1 + 1e-15;\r\n\r\n do {\r\n n = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yc, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, n.\r\n\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n // n is how many times the divisor goes into the current remainder.\r\n n = mathfloor(rem0 / yc0);\r\n\r\n // Algorithm:\r\n // product = divisor multiplied by trial digit (n).\r\n // Compare product and remainder.\r\n // If product is greater than remainder:\r\n // Subtract divisor from product, decrement trial digit.\r\n // Subtract product from remainder.\r\n // If product was less than remainder at the last compare:\r\n // Compare new remainder and divisor.\r\n // If remainder is greater than divisor:\r\n // Subtract divisor from remainder, increment trial digit.\r\n\r\n if (n > 1) {\r\n\r\n // n may be > base only when base is 3.\r\n if (n >= base) n = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiply(yc, n, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n // If product > remainder then trial digit n too high.\r\n // n is 1 too high about 5% of the time, and is not known to have\r\n // ever been more than 1 too high.\r\n while (compare(prod, rem, prodL, remL) == 1) {\r\n n--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yc, prodL, base);\r\n prodL = prod.length;\r\n cmp = 1;\r\n }\r\n } else {\r\n\r\n // n is 0 or 1, cmp is -1.\r\n // If n is 0, there is no need to compare yc and rem again below,\r\n // so change cmp to 1 to avoid it.\r\n // If n is 1, leave cmp as -1, so yc and rem are compared again.\r\n if (n == 0) {\r\n\r\n // divisor < remainder, so n must be at least 1.\r\n cmp = n = 1;\r\n }\r\n\r\n // product = divisor\r\n prod = yc.slice();\r\n prodL = prod.length;\r\n }\r\n\r\n if (prodL < remL) prod = [0].concat(prod);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n remL = rem.length;\r\n\r\n // If product was < remainder.\r\n if (cmp == -1) {\r\n\r\n // Compare divisor and new remainder.\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n // Trial digit n too low.\r\n // n is 1 too low about 5% of the time, and very rarely 2 too low.\r\n while (compare(yc, rem, yL, remL) < 1) {\r\n n++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yc, remL, base);\r\n remL = rem.length;\r\n }\r\n }\r\n } else if (cmp === 0) {\r\n n++;\r\n rem = [0];\r\n } // else cmp === 1 and n will be 0\r\n\r\n // Add the next digit, n, to the result array.\r\n qc[i++] = n;\r\n\r\n // Update the remainder.\r\n if (rem[0]) {\r\n rem[remL++] = xc[xi] || 0;\r\n } else {\r\n rem = [xc[xi]];\r\n remL = 1;\r\n }\r\n } while ((xi++ < xL || rem[0] != null) && s--);\r\n\r\n more = rem[0] != null;\r\n\r\n // Leading zero?\r\n if (!qc[0]) qc.splice(0, 1);\r\n }\r\n\r\n if (base == BASE) {\r\n\r\n // To calculate q.e, first get the number of digits of qc[0].\r\n for (i = 1, s = qc[0]; s >= 10; s /= 10, i++);\r\n\r\n round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);\r\n\r\n // Caller is convertBase.\r\n } else {\r\n q.e = e;\r\n q.r = +more;\r\n }\r\n\r\n return q;\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a string representing the value of BigNumber n in fixed-point or exponential\r\n * notation rounded to the specified decimal places or significant digits.\r\n *\r\n * n: a BigNumber.\r\n * i: the index of the last digit required (i.e. the digit that may be rounded up).\r\n * rm: the rounding mode.\r\n * id: 1 (toExponential) or 2 (toPrecision).\r\n */\r\n function format(n, i, rm, id) {\r\n var c0, e, ne, len, str;\r\n\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n if (!n.c) return n.toString();\r\n\r\n c0 = n.c[0];\r\n ne = n.e;\r\n\r\n if (i == null) {\r\n str = coeffToString(n.c);\r\n str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS)\r\n ? toExponential(str, ne)\r\n : toFixedPoint(str, ne, '0');\r\n } else {\r\n n = round(new BigNumber(n), i, rm);\r\n\r\n // n.e may have changed if the value was rounded up.\r\n e = n.e;\r\n\r\n str = coeffToString(n.c);\r\n len = str.length;\r\n\r\n // toPrecision returns exponential notation if the number of significant digits\r\n // specified is less than the number of digits necessary to represent the integer\r\n // part of the value in fixed-point notation.\r\n\r\n // Exponential notation.\r\n if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {\r\n\r\n // Append zeros?\r\n for (; len < i; str += '0', len++);\r\n str = toExponential(str, e);\r\n\r\n // Fixed-point notation.\r\n } else {\r\n i -= ne + (id === 2 && e > ne);\r\n str = toFixedPoint(str, e, '0');\r\n\r\n // Append zeros?\r\n if (e + 1 > len) {\r\n if (--i > 0) for (str += '.'; i--; str += '0');\r\n } else {\r\n i += e - len;\r\n if (i > 0) {\r\n if (e + 1 == len) str += '.';\r\n for (; i--; str += '0');\r\n }\r\n }\r\n }\r\n }\r\n\r\n return n.s < 0 && c0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Handle BigNumber.max and BigNumber.min.\r\n // If any number is NaN, return NaN.\r\n function maxOrMin(args, n) {\r\n var k, y,\r\n i = 1,\r\n x = new BigNumber(args[0]);\r\n\r\n for (; i < args.length; i++) {\r\n y = new BigNumber(args[i]);\r\n if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n /*\r\n * Strip trailing zeros, calculate base 10 exponent and check against MIN_EXP and MAX_EXP.\r\n * Called by minus, plus and times.\r\n */\r\n function normalise(n, c, e) {\r\n var i = 1,\r\n j = c.length;\r\n\r\n // Remove trailing zeros.\r\n for (; !c[--j]; c.pop());\r\n\r\n // Calculate the base 10 exponent. First get the number of digits of c[0].\r\n for (j = c[0]; j >= 10; j /= 10, i++);\r\n\r\n // Overflow?\r\n if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {\r\n\r\n // Infinity.\r\n n.c = n.e = null;\r\n\r\n // Underflow?\r\n } else if (e < MIN_EXP) {\r\n\r\n // Zero.\r\n n.c = [n.e = 0];\r\n } else {\r\n n.e = e;\r\n n.c = c;\r\n }\r\n\r\n return n;\r\n }\r\n\r\n\r\n // Handle values that fail the validity test in BigNumber.\r\n parseNumeric = (function () {\r\n var basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i,\r\n dotAfter = /^([^.]+)\\.$/,\r\n dotBefore = /^\\.([^.]+)$/,\r\n isInfinityOrNaN = /^-?(Infinity|NaN)$/,\r\n whitespaceOrPlus = /^\\s*\\+(?=[\\w.])|^\\s+|\\s+$/g;\r\n\r\n return function (x, str, isNum, b) {\r\n var base,\r\n s = isNum ? str : str.replace(whitespaceOrPlus, '');\r\n\r\n // No exception on ±Infinity or NaN.\r\n if (isInfinityOrNaN.test(s)) {\r\n x.s = isNaN(s) ? null : s < 0 ? -1 : 1;\r\n } else {\r\n if (!isNum) {\r\n\r\n // basePrefix = /^(-?)0([xbo])(?=\\w[\\w.]*$)/i\r\n s = s.replace(basePrefix, function (m, p1, p2) {\r\n base = (p2 = p2.toLowerCase()) == 'x' ? 16 : p2 == 'b' ? 2 : 8;\r\n return !b || b == base ? p1 : m;\r\n });\r\n\r\n if (b) {\r\n base = b;\r\n\r\n // E.g. '1.' to '1', '.1' to '0.1'\r\n s = s.replace(dotAfter, '$1').replace(dotBefore, '0.$1');\r\n }\r\n\r\n if (str != s) return new BigNumber(s, base);\r\n }\r\n\r\n // '[BigNumber Error] Not a number: {n}'\r\n // '[BigNumber Error] Not a base {b} number: {n}'\r\n if (BigNumber.DEBUG) {\r\n throw Error\r\n (bignumberError + 'Not a' + (b ? ' base ' + b : '') + ' number: ' + str);\r\n }\r\n\r\n // NaN\r\n x.s = null;\r\n }\r\n\r\n x.c = x.e = null;\r\n }\r\n })();\r\n\r\n\r\n /*\r\n * Round x to sd significant digits using rounding mode rm. Check for over/under-flow.\r\n * If r is truthy, it is known that there are more digits after the rounding digit.\r\n */\r\n function round(x, sd, rm, r) {\r\n var d, i, j, k, n, ni, rd,\r\n xc = x.c,\r\n pows10 = POWS_TEN;\r\n\r\n // if x is not Infinity or NaN...\r\n if (xc) {\r\n\r\n // rd is the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // n is a base 1e14 number, the value of the element of array x.c containing rd.\r\n // ni is the index of n within x.c.\r\n // d is the number of digits of n.\r\n // i is the index of rd within n including leading zeros.\r\n // j is the actual index of rd within n (if < 0, rd is a leading zero).\r\n out: {\r\n\r\n // Get the number of digits of the first element of xc.\r\n for (d = 1, k = xc[0]; k >= 10; k /= 10, d++);\r\n i = sd - d;\r\n\r\n // If the rounding digit is in the first element of xc...\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n n = xc[ni = 0];\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = mathfloor(n / pows10[d - j - 1] % 10);\r\n } else {\r\n ni = mathceil((i + 1) / LOG_BASE);\r\n\r\n if (ni >= xc.length) {\r\n\r\n if (r) {\r\n\r\n // Needed by sqrt.\r\n for (; xc.length <= ni; xc.push(0));\r\n n = rd = 0;\r\n d = 1;\r\n i %= LOG_BASE;\r\n j = i - LOG_BASE + 1;\r\n } else {\r\n break out;\r\n }\r\n } else {\r\n n = k = xc[ni];\r\n\r\n // Get the number of digits of n.\r\n for (d = 1; k >= 10; k /= 10, d++);\r\n\r\n // Get the index of rd within n.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within n, adjusted for leading zeros.\r\n // The number of leading zeros of n is given by LOG_BASE - d.\r\n j = i - LOG_BASE + d;\r\n\r\n // Get the rounding digit at index j of n.\r\n rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);\r\n }\r\n }\r\n\r\n r = r || sd < 0 ||\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n // The expression n % pows10[d - j - 1] returns all digits of n to the right\r\n // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.\r\n xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);\r\n\r\n r = rm < 4\r\n ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 &&\r\n\r\n // Check whether the digit to the left of the rounding digit is odd.\r\n ((i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10) & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 || !xc[0]) {\r\n xc.length = 0;\r\n\r\n if (r) {\r\n\r\n // Convert sd to decimal places.\r\n sd -= x.e + 1;\r\n\r\n // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];\r\n x.e = -sd || 0;\r\n } else {\r\n\r\n // Zero.\r\n xc[0] = x.e = 0;\r\n }\r\n\r\n return x;\r\n }\r\n\r\n // Remove excess digits.\r\n if (i == 0) {\r\n xc.length = ni;\r\n k = 1;\r\n ni--;\r\n } else {\r\n xc.length = ni + 1;\r\n k = pows10[LOG_BASE - i];\r\n\r\n // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n // j > 0 means i > number of leading zeros of n.\r\n xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;\r\n }\r\n\r\n // Round up?\r\n if (r) {\r\n\r\n for (; ;) {\r\n\r\n // If the digit to be rounded up is in the first element of xc...\r\n if (ni == 0) {\r\n\r\n // i will be the length of xc[0] before k is added.\r\n for (i = 1, j = xc[0]; j >= 10; j /= 10, i++);\r\n j = xc[0] += k;\r\n for (k = 1; j >= 10; j /= 10, k++);\r\n\r\n // if i != k the length has increased.\r\n if (i != k) {\r\n x.e++;\r\n if (xc[0] == BASE) xc[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xc[ni] += k;\r\n if (xc[ni] != BASE) break;\r\n xc[ni--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xc.length; xc[--i] === 0; xc.pop());\r\n }\r\n\r\n // Overflow? Infinity.\r\n if (x.e > MAX_EXP) {\r\n x.c = x.e = null;\r\n\r\n // Underflow? Zero.\r\n } else if (x.e < MIN_EXP) {\r\n x.c = [x.e = 0];\r\n }\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function valueOf(n) {\r\n var str,\r\n e = n.e;\r\n\r\n if (e === null) return n.toString();\r\n\r\n str = coeffToString(n.c);\r\n\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(str, e)\r\n : toFixedPoint(str, e, '0');\r\n\r\n return n.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // PROTOTYPE/INSTANCE METHODS\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the absolute value of this BigNumber.\r\n */\r\n P.absoluteValue = P.abs = function () {\r\n var x = new BigNumber(this);\r\n if (x.s < 0) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * -1 if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * 0 if they have the same value,\r\n * or null if the value of either is NaN.\r\n */\r\n P.comparedTo = function (y, b) {\r\n return compare(this, new BigNumber(y, b));\r\n };\r\n\r\n\r\n /*\r\n * If dp is undefined or null or true or false, return the number of decimal places of the\r\n * value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n *\r\n * Otherwise, if dp is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of dp decimal places using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * [dp] {number} Decimal places: integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.decimalPlaces = P.dp = function (dp, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), dp + x.e + 1, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last number.\r\n if (v = c[v]) for (; v % 10 == 0; v /= 10, n--);\r\n if (n < 0) n = 0;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * n / 0 = I\r\n * n / N = N\r\n * n / I = 0\r\n * 0 / n = 0\r\n * 0 / 0 = N\r\n * 0 / N = N\r\n * 0 / I = 0\r\n * N / n = N\r\n * N / 0 = N\r\n * N / N = N\r\n * N / I = N\r\n * I / n = I\r\n * I / 0 = I\r\n * I / N = N\r\n * I / I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber divided by the value of\r\n * BigNumber(y, b), rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.dividedBy = P.div = function (y, b) {\r\n return div(this, new BigNumber(y, b), DECIMAL_PLACES, ROUNDING_MODE);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the integer part of dividing the value of this\r\n * BigNumber by the value of BigNumber(y, b).\r\n */\r\n P.dividedToIntegerBy = P.idiv = function (y, b) {\r\n return div(this, new BigNumber(y, b), 0, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a BigNumber whose value is the value of this BigNumber exponentiated by n.\r\n *\r\n * If m is present, return the result modulo m.\r\n * If n is negative round according to DECIMAL_PLACES and ROUNDING_MODE.\r\n * If POW_PRECISION is non-zero and m is not present, round to POW_PRECISION using ROUNDING_MODE.\r\n *\r\n * The modular power operation works efficiently when x, n, and m are integers, otherwise it\r\n * is equivalent to calculating x.exponentiatedBy(n).modulo(m) with a POW_PRECISION of 0.\r\n *\r\n * n {number|string|BigNumber} The exponent. An integer.\r\n * [m] {number|string|BigNumber} The modulus.\r\n *\r\n * '[BigNumber Error] Exponent not an integer: {n}'\r\n */\r\n P.exponentiatedBy = P.pow = function (n, m) {\r\n var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y,\r\n x = this;\r\n\r\n n = new BigNumber(n);\r\n\r\n // Allow NaN and ±Infinity, but not other non-integers.\r\n if (n.c && !n.isInteger()) {\r\n throw Error\r\n (bignumberError + 'Exponent not an integer: ' + valueOf(n));\r\n }\r\n\r\n if (m != null) m = new BigNumber(m);\r\n\r\n // Exponent of MAX_SAFE_INTEGER is 15.\r\n nIsBig = n.e > 14;\r\n\r\n // If x is NaN, ±Infinity, ±0 or ±1, or n is ±Infinity, NaN or ±0.\r\n if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {\r\n\r\n // The sign of the result of pow when x is negative depends on the evenness of n.\r\n // If +n overflows to ±Infinity, the evenness of n would be not be known.\r\n y = new BigNumber(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));\r\n return m ? y.mod(m) : y;\r\n }\r\n\r\n nIsNeg = n.s < 0;\r\n\r\n if (m) {\r\n\r\n // x % m returns NaN if abs(m) is zero, or m is NaN.\r\n if (m.c ? !m.c[0] : !m.s) return new BigNumber(NaN);\r\n\r\n isModExp = !nIsNeg && x.isInteger() && m.isInteger();\r\n\r\n if (isModExp) x = x.mod(m);\r\n\r\n // Overflow to ±Infinity: >=2**1e10 or >=1.0000024**1e15.\r\n // Underflow to ±0: <=0.79**1e10 or <=0.9999975**1e15.\r\n } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0\r\n // [1, 240000000]\r\n ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7\r\n // [80000000000000] [99999750000000]\r\n : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {\r\n\r\n // If x is negative and n is odd, k = -0, else k = 0.\r\n k = x.s < 0 && isOdd(n) ? -0 : 0;\r\n\r\n // If x >= 1, k = ±Infinity.\r\n if (x.e > -1) k = 1 / k;\r\n\r\n // If n is negative return ±0, else return ±Infinity.\r\n return new BigNumber(nIsNeg ? 1 / k : k);\r\n\r\n } else if (POW_PRECISION) {\r\n\r\n // Truncating each coefficient array to a length of k after each multiplication\r\n // equates to truncating significant digits to POW_PRECISION + [28, 41],\r\n // i.e. there will be a minimum of 28 guard digits retained.\r\n k = mathceil(POW_PRECISION / LOG_BASE + 2);\r\n }\r\n\r\n if (nIsBig) {\r\n half = new BigNumber(0.5);\r\n if (nIsNeg) n.s = 1;\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = Math.abs(+valueOf(n));\r\n nIsOdd = i % 2;\r\n }\r\n\r\n y = new BigNumber(ONE);\r\n\r\n // Performs 54 loop iterations for n of 9007199254740991.\r\n for (; ;) {\r\n\r\n if (nIsOdd) {\r\n y = y.times(x);\r\n if (!y.c) break;\r\n\r\n if (k) {\r\n if (y.c.length > k) y.c.length = k;\r\n } else if (isModExp) {\r\n y = y.mod(m); //y = y.minus(div(y, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (i) {\r\n i = mathfloor(i / 2);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n } else {\r\n n = n.times(half);\r\n round(n, n.e + 1, 1);\r\n\r\n if (n.e > 14) {\r\n nIsOdd = isOdd(n);\r\n } else {\r\n i = +valueOf(n);\r\n if (i === 0) break;\r\n nIsOdd = i % 2;\r\n }\r\n }\r\n\r\n x = x.times(x);\r\n\r\n if (k) {\r\n if (x.c && x.c.length > k) x.c.length = k;\r\n } else if (isModExp) {\r\n x = x.mod(m); //x = x.minus(div(x, m, 0, MODULO_MODE).times(m));\r\n }\r\n }\r\n\r\n if (isModExp) return y;\r\n if (nIsNeg) y = ONE.div(y);\r\n\r\n return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber rounded to an integer\r\n * using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {rm}'\r\n */\r\n P.integerValue = function (rm) {\r\n var n = new BigNumber(this);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n return round(n, n.e + 1, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is equal to the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isEqualTo = P.eq = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is a finite number, otherwise return false.\r\n */\r\n P.isFinite = function () {\r\n return !!this.c;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isGreaterThan = P.gt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is greater than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isGreaterThanOrEqualTo = P.gte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === 1 || b === 0;\r\n\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is an integer, otherwise return false.\r\n */\r\n P.isInteger = function () {\r\n return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than the value of BigNumber(y, b),\r\n * otherwise return false.\r\n */\r\n P.isLessThan = P.lt = function (y, b) {\r\n return compare(this, new BigNumber(y, b)) < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is less than or equal to the value of\r\n * BigNumber(y, b), otherwise return false.\r\n */\r\n P.isLessThanOrEqualTo = P.lte = function (y, b) {\r\n return (b = compare(this, new BigNumber(y, b))) === -1 || b === 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is NaN, otherwise return false.\r\n */\r\n P.isNaN = function () {\r\n return !this.s;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is negative, otherwise return false.\r\n */\r\n P.isNegative = function () {\r\n return this.s < 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is positive, otherwise return false.\r\n */\r\n P.isPositive = function () {\r\n return this.s > 0;\r\n };\r\n\r\n\r\n /*\r\n * Return true if the value of this BigNumber is 0 or -0, otherwise return false.\r\n */\r\n P.isZero = function () {\r\n return !!this.c && this.c[0] == 0;\r\n };\r\n\r\n\r\n /*\r\n * n - 0 = n\r\n * n - N = N\r\n * n - I = -I\r\n * 0 - n = -n\r\n * 0 - 0 = 0\r\n * 0 - N = N\r\n * 0 - I = -I\r\n * N - n = N\r\n * N - 0 = N\r\n * N - N = N\r\n * N - I = N\r\n * I - n = I\r\n * I - 0 = I\r\n * I - N = N\r\n * I - I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber minus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.minus = function (y, b) {\r\n var i, j, t, xLTy,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.plus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber(yc ? x : NaN);\r\n\r\n // Either zero?\r\n if (!xc[0] || !yc[0]) {\r\n\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n return yc[0] ? (y.s = -b, y) : new BigNumber(xc[0] ? x :\r\n\r\n // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity\r\n ROUNDING_MODE == 3 ? -0 : 0);\r\n }\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Determine which is the bigger number.\r\n if (a = xe - ye) {\r\n\r\n if (xLTy = a < 0) {\r\n a = -a;\r\n t = xc;\r\n } else {\r\n ye = xe;\r\n t = yc;\r\n }\r\n\r\n t.reverse();\r\n\r\n // Prepend zeros to equalise exponents.\r\n for (b = a; b--; t.push(0));\r\n t.reverse();\r\n } else {\r\n\r\n // Exponents equal. Check digit by digit.\r\n j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;\r\n\r\n for (a = b = 0; b < j; b++) {\r\n\r\n if (xc[b] != yc[b]) {\r\n xLTy = xc[b] < yc[b];\r\n break;\r\n }\r\n }\r\n }\r\n\r\n // x < y? Point xc to the array of the bigger number.\r\n if (xLTy) {\r\n t = xc;\r\n xc = yc;\r\n yc = t;\r\n y.s = -y.s;\r\n }\r\n\r\n b = (j = yc.length) - (i = xc.length);\r\n\r\n // Append zeros to xc if shorter.\r\n // No need to add zeros to yc if shorter as subtract only needs to start at yc.length.\r\n if (b > 0) for (; b--; xc[i++] = 0);\r\n b = BASE - 1;\r\n\r\n // Subtract yc from xc.\r\n for (; j > a;) {\r\n\r\n if (xc[--j] < yc[j]) {\r\n for (i = j; i && !xc[--i]; xc[i] = b);\r\n --xc[i];\r\n xc[j] += BASE;\r\n }\r\n\r\n xc[j] -= yc[j];\r\n }\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xc[0] == 0; xc.splice(0, 1), --ye);\r\n\r\n // Zero?\r\n if (!xc[0]) {\r\n\r\n // Following IEEE 754 (2008) 6.3,\r\n // n - n = +0 but n - n = -0 when rounding towards -Infinity.\r\n y.s = ROUNDING_MODE == 3 ? -1 : 1;\r\n y.c = [y.e = 0];\r\n return y;\r\n }\r\n\r\n // No need to check for Infinity as +x - +y != Infinity && -x - -y != Infinity\r\n // for finite x and y.\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * n % 0 = N\r\n * n % N = N\r\n * n % I = n\r\n * 0 % n = 0\r\n * -0 % n = -0\r\n * 0 % 0 = N\r\n * 0 % N = N\r\n * 0 % I = 0\r\n * N % n = N\r\n * N % 0 = N\r\n * N % N = N\r\n * N % I = N\r\n * I % n = N\r\n * I % 0 = N\r\n * I % N = N\r\n * I % I = N\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber modulo the value of\r\n * BigNumber(y, b). The result depends on the value of MODULO_MODE.\r\n */\r\n P.modulo = P.mod = function (y, b) {\r\n var q, s,\r\n x = this;\r\n\r\n y = new BigNumber(y, b);\r\n\r\n // Return NaN if x is Infinity or NaN, or y is NaN or zero.\r\n if (!x.c || !y.s || y.c && !y.c[0]) {\r\n return new BigNumber(NaN);\r\n\r\n // Return x if y is Infinity or x is zero.\r\n } else if (!y.c || x.c && !x.c[0]) {\r\n return new BigNumber(x);\r\n }\r\n\r\n if (MODULO_MODE == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // r = x - qy where 0 <= r < abs(y)\r\n s = y.s;\r\n y.s = 1;\r\n q = div(x, y, 0, 3);\r\n y.s = s;\r\n q.s *= s;\r\n } else {\r\n q = div(x, y, 0, MODULO_MODE);\r\n }\r\n\r\n y = x.minus(q.times(y));\r\n\r\n // To match JavaScript %, ensure sign of zero is sign of dividend.\r\n if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;\r\n\r\n return y;\r\n };\r\n\r\n\r\n /*\r\n * n * 0 = 0\r\n * n * N = N\r\n * n * I = I\r\n * 0 * n = 0\r\n * 0 * 0 = 0\r\n * 0 * N = N\r\n * 0 * I = N\r\n * N * n = N\r\n * N * 0 = N\r\n * N * N = N\r\n * N * I = N\r\n * I * n = I\r\n * I * 0 = N\r\n * I * N = N\r\n * I * I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber multiplied by the value\r\n * of BigNumber(y, b).\r\n */\r\n P.multipliedBy = P.times = function (y, b) {\r\n var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc,\r\n base, sqrtBase,\r\n x = this,\r\n xc = x.c,\r\n yc = (y = new BigNumber(y, b)).c;\r\n\r\n // Either NaN, ±Infinity or ±0?\r\n if (!xc || !yc || !xc[0] || !yc[0]) {\r\n\r\n // Return NaN if either is NaN, or one is 0 and the other is Infinity.\r\n if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {\r\n y.c = y.e = y.s = null;\r\n } else {\r\n y.s *= x.s;\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n if (!xc || !yc) {\r\n y.c = y.e = null;\r\n\r\n // Return ±0 if either is ±0.\r\n } else {\r\n y.c = [0];\r\n y.e = 0;\r\n }\r\n }\r\n\r\n return y;\r\n }\r\n\r\n e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);\r\n y.s *= x.s;\r\n xcL = xc.length;\r\n ycL = yc.length;\r\n\r\n // Ensure xc points to longer array and xcL to its length.\r\n if (xcL < ycL) {\r\n zc = xc;\r\n xc = yc;\r\n yc = zc;\r\n i = xcL;\r\n xcL = ycL;\r\n ycL = i;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n for (i = xcL + ycL, zc = []; i--; zc.push(0));\r\n\r\n base = BASE;\r\n sqrtBase = SQRT_BASE;\r\n\r\n for (i = ycL; --i >= 0;) {\r\n c = 0;\r\n ylo = yc[i] % sqrtBase;\r\n yhi = yc[i] / sqrtBase | 0;\r\n\r\n for (k = xcL, j = i + k; j > i;) {\r\n xlo = xc[--k] % sqrtBase;\r\n xhi = xc[k] / sqrtBase | 0;\r\n m = yhi * xlo + xhi * ylo;\r\n xlo = ylo * xlo + ((m % sqrtBase) * sqrtBase) + zc[j] + c;\r\n c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;\r\n zc[j--] = xlo % base;\r\n }\r\n\r\n zc[j] = c;\r\n }\r\n\r\n if (c) {\r\n ++e;\r\n } else {\r\n zc.splice(0, 1);\r\n }\r\n\r\n return normalise(y, zc, e);\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber negated,\r\n * i.e. multiplied by -1.\r\n */\r\n P.negated = function () {\r\n var x = new BigNumber(this);\r\n x.s = -x.s || null;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * n + 0 = n\r\n * n + N = N\r\n * n + I = I\r\n * 0 + n = n\r\n * 0 + 0 = 0\r\n * 0 + N = N\r\n * 0 + I = I\r\n * N + n = N\r\n * N + 0 = N\r\n * N + N = N\r\n * N + I = N\r\n * I + n = I\r\n * I + 0 = I\r\n * I + N = N\r\n * I + I = I\r\n *\r\n * Return a new BigNumber whose value is the value of this BigNumber plus the value of\r\n * BigNumber(y, b).\r\n */\r\n P.plus = function (y, b) {\r\n var t,\r\n x = this,\r\n a = x.s;\r\n\r\n y = new BigNumber(y, b);\r\n b = y.s;\r\n\r\n // Either NaN?\r\n if (!a || !b) return new BigNumber(NaN);\r\n\r\n // Signs differ?\r\n if (a != b) {\r\n y.s = -b;\r\n return x.minus(y);\r\n }\r\n\r\n var xe = x.e / LOG_BASE,\r\n ye = y.e / LOG_BASE,\r\n xc = x.c,\r\n yc = y.c;\r\n\r\n if (!xe || !ye) {\r\n\r\n // Return ±Infinity if either ±Infinity.\r\n if (!xc || !yc) return new BigNumber(a / 0);\r\n\r\n // Either zero?\r\n // Return y if y is non-zero, x if x is non-zero, or zero if both are zero.\r\n if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber(xc[0] ? x : a * 0);\r\n }\r\n\r\n xe = bitFloor(xe);\r\n ye = bitFloor(ye);\r\n xc = xc.slice();\r\n\r\n // Prepend zeros to equalise exponents. Faster to use reverse then do unshifts.\r\n if (a = xe - ye) {\r\n if (a > 0) {\r\n ye = xe;\r\n t = yc;\r\n } else {\r\n a = -a;\r\n t = xc;\r\n }\r\n\r\n t.reverse();\r\n for (; a--; t.push(0));\r\n t.reverse();\r\n }\r\n\r\n a = xc.length;\r\n b = yc.length;\r\n\r\n // Point xc to the longer array, and b to the shorter length.\r\n if (a - b < 0) {\r\n t = yc;\r\n yc = xc;\r\n xc = t;\r\n b = a;\r\n }\r\n\r\n // Only start adding at yc.length - 1 as the further digits of xc can be ignored.\r\n for (a = 0; b;) {\r\n a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;\r\n xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;\r\n }\r\n\r\n if (a) {\r\n xc = [a].concat(xc);\r\n ++ye;\r\n }\r\n\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n // ye = MAX_EXP + 1 possible\r\n return normalise(y, xc, ye);\r\n };\r\n\r\n\r\n /*\r\n * If sd is undefined or null or true or false, return the number of significant digits of\r\n * the value of this BigNumber, or null if the value of this BigNumber is ±Infinity or NaN.\r\n * If sd is true include integer-part trailing zeros in the count.\r\n *\r\n * Otherwise, if sd is a number, return a new BigNumber whose value is the value of this\r\n * BigNumber rounded to a maximum of sd significant digits using rounding mode rm, or\r\n * ROUNDING_MODE if rm is omitted.\r\n *\r\n * sd {number|boolean} number: significant digits: integer, 1 to MAX inclusive.\r\n * boolean: whether to count integer-part trailing zeros: true or false.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.precision = P.sd = function (sd, rm) {\r\n var c, n, v,\r\n x = this;\r\n\r\n if (sd != null && sd !== !!sd) {\r\n intCheck(sd, 1, MAX);\r\n if (rm == null) rm = ROUNDING_MODE;\r\n else intCheck(rm, 0, 8);\r\n\r\n return round(new BigNumber(x), sd, rm);\r\n }\r\n\r\n if (!(c = x.c)) return null;\r\n v = c.length - 1;\r\n n = v * LOG_BASE + 1;\r\n\r\n if (v = c[v]) {\r\n\r\n // Subtract the number of trailing zeros of the last element.\r\n for (; v % 10 == 0; v /= 10, n--);\r\n\r\n // Add the number of digits of the first element.\r\n for (v = c[0]; v >= 10; v /= 10, n++);\r\n }\r\n\r\n if (sd && x.e + 1 > n) n = x.e + 1;\r\n\r\n return n;\r\n };\r\n\r\n\r\n /*\r\n * Return a new BigNumber whose value is the value of this BigNumber shifted by k places\r\n * (powers of 10). Shift to the right if n > 0, and to the left if n < 0.\r\n *\r\n * k {number} Integer, -MAX_SAFE_INTEGER to MAX_SAFE_INTEGER inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {k}'\r\n */\r\n P.shiftedBy = function (k) {\r\n intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);\r\n return this.times('1e' + k);\r\n };\r\n\r\n\r\n /*\r\n * sqrt(-n) = N\r\n * sqrt(N) = N\r\n * sqrt(-I) = N\r\n * sqrt(I) = I\r\n * sqrt(0) = 0\r\n * sqrt(-0) = -0\r\n *\r\n * Return a new BigNumber whose value is the square root of the value of this BigNumber,\r\n * rounded according to DECIMAL_PLACES and ROUNDING_MODE.\r\n */\r\n P.squareRoot = P.sqrt = function () {\r\n var m, n, r, rep, t,\r\n x = this,\r\n c = x.c,\r\n s = x.s,\r\n e = x.e,\r\n dp = DECIMAL_PLACES + 4,\r\n half = new BigNumber('0.5');\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 || !c || !c[0]) {\r\n return new BigNumber(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);\r\n }\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+valueOf(x));\r\n\r\n // Math.sqrt underflow/overflow?\r\n // Pass x to Math.sqrt as integer, then adjust the exponent of the result.\r\n if (s == 0 || s == 1 / 0) {\r\n n = coeffToString(c);\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(+n);\r\n e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);\r\n\r\n if (s == 1 / 0) {\r\n n = '5e' + e;\r\n } else {\r\n n = s.toExponential();\r\n n = n.slice(0, n.indexOf('e') + 1) + e;\r\n }\r\n\r\n r = new BigNumber(n);\r\n } else {\r\n r = new BigNumber(s + '');\r\n }\r\n\r\n // Check for zero.\r\n // r could be zero if MIN_EXP is changed after the this value was created.\r\n // This would cause a division by zero (x/t) and hence Infinity below, which would cause\r\n // coeffToString to throw.\r\n if (r.c[0]) {\r\n e = r.e;\r\n s = e + dp;\r\n if (s < 3) s = 0;\r\n\r\n // Newton-Raphson iteration.\r\n for (; ;) {\r\n t = r;\r\n r = half.times(t.plus(div(x, t, dp, 1)));\r\n\r\n if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {\r\n\r\n // The exponent of r may here be one less than the final result exponent,\r\n // e.g 0.0009999 (e-4) --> 0.001 (e-3), so adjust s so the rounding digits\r\n // are indexed correctly.\r\n if (r.e < e) --s;\r\n n = n.slice(s - 3, s + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits\r\n // are 9999 or 4999 (i.e. approaching a rounding boundary) continue the\r\n // iteration.\r\n if (n == '9999' || !rep && n == '4999') {\r\n\r\n // On the first iteration only, check to see if rounding up gives the\r\n // exact result as the nines may infinitely repeat.\r\n if (!rep) {\r\n round(t, t.e + DECIMAL_PLACES + 2, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n dp += 4;\r\n s += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If rounding digits are null, 0{0,4} or 50{0,3}, check for exact\r\n // result. If not, then there are further digits and m will be truthy.\r\n if (!+n || !+n.slice(1) && n.charAt(0) == '5') {\r\n\r\n // Truncate to the first rounding digit.\r\n round(r, r.e + DECIMAL_PLACES + 2, 1);\r\n m = !r.times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n }\r\n\r\n return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in exponential notation and\r\n * rounded using ROUNDING_MODE to dp fixed decimal places.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toExponential = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp++;\r\n }\r\n return format(this, dp, rm, 1);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounding\r\n * to dp fixed decimal places using rounding mode rm, or ROUNDING_MODE if rm is omitted.\r\n *\r\n * Note: as with JavaScript's number type, (-0).toFixed(0) is '0',\r\n * but e.g. (-0.00001).toFixed(0) is '-0'.\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n */\r\n P.toFixed = function (dp, rm) {\r\n if (dp != null) {\r\n intCheck(dp, 0, MAX);\r\n dp = dp + this.e + 1;\r\n }\r\n return format(this, dp, rm);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in fixed-point notation rounded\r\n * using rm or ROUNDING_MODE to dp decimal places, and formatted according to the properties\r\n * of the format or FORMAT object (see BigNumber.set).\r\n *\r\n * The formatting object may contain some or all of the properties shown below.\r\n *\r\n * FORMAT = {\r\n * prefix: '',\r\n * groupSize: 3,\r\n * secondaryGroupSize: 0,\r\n * groupSeparator: ',',\r\n * decimalSeparator: '.',\r\n * fractionGroupSize: 0,\r\n * fractionGroupSeparator: '\\xA0', // non-breaking space\r\n * suffix: ''\r\n * };\r\n *\r\n * [dp] {number} Decimal places. Integer, 0 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n * [format] {object} Formatting options. See FORMAT pbject above.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {dp|rm}'\r\n * '[BigNumber Error] Argument not an object: {format}'\r\n */\r\n P.toFormat = function (dp, rm, format) {\r\n var str,\r\n x = this;\r\n\r\n if (format == null) {\r\n if (dp != null && rm && typeof rm == 'object') {\r\n format = rm;\r\n rm = null;\r\n } else if (dp && typeof dp == 'object') {\r\n format = dp;\r\n dp = rm = null;\r\n } else {\r\n format = FORMAT;\r\n }\r\n } else if (typeof format != 'object') {\r\n throw Error\r\n (bignumberError + 'Argument not an object: ' + format);\r\n }\r\n\r\n str = x.toFixed(dp, rm);\r\n\r\n if (x.c) {\r\n var i,\r\n arr = str.split('.'),\r\n g1 = +format.groupSize,\r\n g2 = +format.secondaryGroupSize,\r\n groupSeparator = format.groupSeparator || '',\r\n intPart = arr[0],\r\n fractionPart = arr[1],\r\n isNeg = x.s < 0,\r\n intDigits = isNeg ? intPart.slice(1) : intPart,\r\n len = intDigits.length;\r\n\r\n if (g2) {\r\n i = g1;\r\n g1 = g2;\r\n g2 = i;\r\n len -= i;\r\n }\r\n\r\n if (g1 > 0 && len > 0) {\r\n i = len % g1 || g1;\r\n intPart = intDigits.substr(0, i);\r\n for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);\r\n if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);\r\n if (isNeg) intPart = '-' + intPart;\r\n }\r\n\r\n str = fractionPart\r\n ? intPart + (format.decimalSeparator || '') + ((g2 = +format.fractionGroupSize)\r\n ? fractionPart.replace(new RegExp('\\\\d{' + g2 + '}\\\\B', 'g'),\r\n '$&' + (format.fractionGroupSeparator || ''))\r\n : fractionPart)\r\n : intPart;\r\n }\r\n\r\n return (format.prefix || '') + str + (format.suffix || '');\r\n };\r\n\r\n\r\n /*\r\n * Return an array of two BigNumbers representing the value of this BigNumber as a simple\r\n * fraction with an integer numerator and an integer denominator.\r\n * The denominator will be a positive non-zero value less than or equal to the specified\r\n * maximum denominator. If a maximum denominator is not specified, the denominator will be\r\n * the lowest value necessary to represent the number exactly.\r\n *\r\n * [md] {number|string|BigNumber} Integer >= 1, or Infinity. The maximum denominator.\r\n *\r\n * '[BigNumber Error] Argument {not an integer|out of range} : {md}'\r\n */\r\n P.toFraction = function (md) {\r\n var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s,\r\n x = this,\r\n xc = x.c;\r\n\r\n if (md != null) {\r\n n = new BigNumber(md);\r\n\r\n // Throw if md is less than one or is not an integer, unless it is Infinity.\r\n if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {\r\n throw Error\r\n (bignumberError + 'Argument ' +\r\n (n.isInteger() ? 'out of range: ' : 'not an integer: ') + valueOf(n));\r\n }\r\n }\r\n\r\n if (!xc) return new BigNumber(x);\r\n\r\n d = new BigNumber(ONE);\r\n n1 = d0 = new BigNumber(ONE);\r\n d1 = n0 = new BigNumber(ONE);\r\n s = coeffToString(xc);\r\n\r\n // Determine initial denominator.\r\n // d is a power of 10 and the minimum max denominator that specifies the value exactly.\r\n e = d.e = s.length - x.e - 1;\r\n d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];\r\n md = !md || n.comparedTo(d) > 0 ? (e > 0 ? d : n1) : n;\r\n\r\n exp = MAX_EXP;\r\n MAX_EXP = 1 / 0;\r\n n = new BigNumber(s);\r\n\r\n // n0 = d1 = 0\r\n n0.c[0] = 0;\r\n\r\n for (; ;) {\r\n q = div(n, d, 0, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.comparedTo(md) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n n1 = n0.plus(q.times(d2 = n1));\r\n n0 = d2;\r\n d = n.minus(q.times(d2 = d));\r\n n = d2;\r\n }\r\n\r\n d2 = div(md.minus(d0), d1, 0, 1);\r\n n0 = n0.plus(d2.times(n1));\r\n d0 = d0.plus(d2.times(d1));\r\n n0.s = n1.s = x.s;\r\n e = e * 2;\r\n\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1\r\n r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(\r\n div(n0, d0, e, ROUNDING_MODE).minus(x).abs()) < 1 ? [n1, d1] : [n0, d0];\r\n\r\n MAX_EXP = exp;\r\n\r\n return r;\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this BigNumber converted to a number primitive.\r\n */\r\n P.toNumber = function () {\r\n return +valueOf(this);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber rounded to sd significant digits\r\n * using rounding mode rm or ROUNDING_MODE. If sd is less than the number of digits\r\n * necessary to represent the integer part of the value in fixed-point notation, then use\r\n * exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n * '[BigNumber Error] Argument {not a primitive number|not an integer|out of range}: {sd|rm}'\r\n */\r\n P.toPrecision = function (sd, rm) {\r\n if (sd != null) intCheck(sd, 1, MAX);\r\n return format(this, sd, rm, 2);\r\n };\r\n\r\n\r\n /*\r\n * Return a string representing the value of this BigNumber in base b, or base 10 if b is\r\n * omitted. If a base is specified, including base 10, round according to DECIMAL_PLACES and\r\n * ROUNDING_MODE. If a base is not specified, and this BigNumber has a positive exponent\r\n * that is equal to or greater than TO_EXP_POS, or a negative exponent equal to or less than\r\n * TO_EXP_NEG, return exponential notation.\r\n *\r\n * [b] {number} Integer, 2 to ALPHABET.length inclusive.\r\n *\r\n * '[BigNumber Error] Base {not a primitive number|not an integer|out of range}: {b}'\r\n */\r\n P.toString = function (b) {\r\n var str,\r\n n = this,\r\n s = n.s,\r\n e = n.e;\r\n\r\n // Infinity or NaN?\r\n if (e === null) {\r\n if (s) {\r\n str = 'Infinity';\r\n if (s < 0) str = '-' + str;\r\n } else {\r\n str = 'NaN';\r\n }\r\n } else {\r\n if (b == null) {\r\n str = e <= TO_EXP_NEG || e >= TO_EXP_POS\r\n ? toExponential(coeffToString(n.c), e)\r\n : toFixedPoint(coeffToString(n.c), e, '0');\r\n } else if (b === 10 && alphabetHasNormalDecimalDigits) {\r\n n = round(new BigNumber(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);\r\n str = toFixedPoint(coeffToString(n.c), n.e, '0');\r\n } else {\r\n intCheck(b, 2, ALPHABET.length, 'Base');\r\n str = convertBase(toFixedPoint(coeffToString(n.c), e, '0'), 10, b, s, true);\r\n }\r\n\r\n if (s < 0 && n.c[0]) str = '-' + str;\r\n }\r\n\r\n return str;\r\n };\r\n\r\n\r\n /*\r\n * Return as toString, but do not accept a base argument, and include the minus sign for\r\n * negative zero.\r\n */\r\n P.valueOf = P.toJSON = function () {\r\n return valueOf(this);\r\n };\r\n\r\n\r\n P._isBigNumber = true;\r\n\r\n P[Symbol.toStringTag] = 'BigNumber';\r\n\r\n // Node.js v10.12.0+\r\n P[Symbol.for('nodejs.util.inspect.custom')] = P.valueOf;\r\n\r\n if (configObject != null) BigNumber.set(configObject);\r\n\r\n return BigNumber;\r\n}\r\n\r\n\r\n// PRIVATE HELPER FUNCTIONS\r\n\r\n// These functions don't need access to variables,\r\n// e.g. DECIMAL_PLACES, in the scope of the `clone` function above.\r\n\r\n\r\nfunction bitFloor(n) {\r\n var i = n | 0;\r\n return n > 0 || n === i ? i : i - 1;\r\n}\r\n\r\n\r\n// Return a coefficient array as a string of base 10 digits.\r\nfunction coeffToString(a) {\r\n var s, z,\r\n i = 1,\r\n j = a.length,\r\n r = a[0] + '';\r\n\r\n for (; i < j;) {\r\n s = a[i++] + '';\r\n z = LOG_BASE - s.length;\r\n for (; z--; s = '0' + s);\r\n r += s;\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (j = r.length; r.charCodeAt(--j) === 48;);\r\n\r\n return r.slice(0, j + 1 || 1);\r\n}\r\n\r\n\r\n// Compare the value of BigNumbers x and y.\r\nfunction compare(x, y) {\r\n var a, b,\r\n xc = x.c,\r\n yc = y.c,\r\n i = x.s,\r\n j = y.s,\r\n k = x.e,\r\n l = y.e;\r\n\r\n // Either NaN?\r\n if (!i || !j) return null;\r\n\r\n a = xc && !xc[0];\r\n b = yc && !yc[0];\r\n\r\n // Either zero?\r\n if (a || b) return a ? b ? 0 : -j : i;\r\n\r\n // Signs differ?\r\n if (i != j) return i;\r\n\r\n a = i < 0;\r\n b = k == l;\r\n\r\n // Either Infinity?\r\n if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;\r\n\r\n // Compare exponents.\r\n if (!b) return k > l ^ a ? 1 : -1;\r\n\r\n j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n // Compare digit by digit.\r\n for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;\r\n\r\n // Compare lengths.\r\n return k == l ? 0 : k > l ^ a ? 1 : -1;\r\n}\r\n\r\n\r\n/*\r\n * Check that n is a primitive number, an integer, and in range, otherwise throw.\r\n */\r\nfunction intCheck(n, min, max, name) {\r\n if (n < min || n > max || n !== mathfloor(n)) {\r\n throw Error\r\n (bignumberError + (name || 'Argument') + (typeof n == 'number'\r\n ? n < min || n > max ? ' out of range: ' : ' not an integer: '\r\n : ' not a primitive number: ') + String(n));\r\n }\r\n}\r\n\r\n\r\n// Assumes finite n.\r\nfunction isOdd(n) {\r\n var k = n.c.length - 1;\r\n return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;\r\n}\r\n\r\n\r\nfunction toExponential(str, e) {\r\n return (str.length > 1 ? str.charAt(0) + '.' + str.slice(1) : str) +\r\n (e < 0 ? 'e' : 'e+') + e;\r\n}\r\n\r\n\r\nfunction toFixedPoint(str, e, z) {\r\n var len, zs;\r\n\r\n // Negative exponent?\r\n if (e < 0) {\r\n\r\n // Prepend zeros.\r\n for (zs = z + '.'; ++e; zs += z);\r\n str = zs + str;\r\n\r\n // Positive exponent\r\n } else {\r\n len = str.length;\r\n\r\n // Append zeros.\r\n if (++e > len) {\r\n for (zs = z, e -= len; --e; zs += z);\r\n str += zs;\r\n } else if (e < len) {\r\n str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// EXPORT\r\n\r\n\r\nexport var BigNumber = clone();\r\n\r\nexport default BigNumber;\r\n","import { execTyped } from '../regex.js';\n// https://regexr.com/7f7rv\nconst tupleRegex = /^tuple(?<array>(\\[(\\d*)\\])*)$/;\n/**\n * Formats {@link AbiParameter} to human-readable ABI parameter.\n *\n * @param abiParameter - ABI parameter\n * @returns Human-readable ABI parameter\n *\n * @example\n * const result = formatAbiParameter({ type: 'address', name: 'from' })\n * // ^? const result: 'address from'\n */\nexport function formatAbiParameter(abiParameter) {\n let type = abiParameter.type;\n if (tupleRegex.test(abiParameter.type) && 'components' in abiParameter) {\n type = '(';\n const length = abiParameter.components.length;\n for (let i = 0; i < length; i++) {\n const component = abiParameter.components[i];\n type += formatAbiParameter(component);\n if (i < length - 1)\n type += ', ';\n }\n const result = execTyped(tupleRegex, abiParameter.type);\n type += `)${result?.array ?? ''}`;\n return formatAbiParameter({\n ...abiParameter,\n type,\n });\n }\n // Add `indexed` to type if in `abiParameter`\n if ('indexed' in abiParameter && abiParameter.indexed)\n type = `${type} indexed`;\n // Return human-readable ABI parameter\n if (abiParameter.name)\n return `${type} ${abiParameter.name}`;\n return type;\n}\n//# sourceMappingURL=formatAbiParameter.js.map","// TODO: This looks cool. Need to check the performance of `new RegExp` versus defined inline though.\n// https://twitter.com/GabrielVergnaud/status/1622906834343366657\nexport function execTyped(regex, string) {\n const match = regex.exec(string);\n return match?.groups;\n}\n// `bytes<M>`: binary type of `M` bytes, `0 < M <= 32`\n// https://regexr.com/6va55\nexport const bytesRegex = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/;\n// `(u)int<M>`: (un)signed integer type of `M` bits, `0 < M <= 256`, `M % 8 == 0`\n// https://regexr.com/6v8hp\nexport const integerRegex = /^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;\nexport const isTupleRegex = /^\\(.+?\\).*?$/;\n//# sourceMappingURL=regex.js.map","import { formatAbiParameter, } from './formatAbiParameter.js';\n/**\n * Formats {@link AbiParameter}s to human-readable ABI parameters.\n *\n * @param abiParameters - ABI parameters\n * @returns Human-readable ABI parameters\n *\n * @example\n * const result = formatAbiParameters([\n * // ^? const result: 'address from, uint256 tokenId'\n * { type: 'address', name: 'from' },\n * { type: 'uint256', name: 'tokenId' },\n * ])\n */\nexport function formatAbiParameters(abiParameters) {\n let params = '';\n const length = abiParameters.length;\n for (let i = 0; i < length; i++) {\n const abiParameter = abiParameters[i];\n params += formatAbiParameter(abiParameter);\n if (i !== length - 1)\n params += ', ';\n }\n return params;\n}\n//# sourceMappingURL=formatAbiParameters.js.map","import { InvalidDefinitionTypeError, } from '../../errors/abi.js';\nexport function formatAbiItem(abiItem, { includeName = false } = {}) {\n if (abiItem.type !== 'function' &&\n abiItem.type !== 'event' &&\n abiItem.type !== 'error')\n throw new InvalidDefinitionTypeError(abiItem.type);\n return `${abiItem.name}(${formatAbiParams(abiItem.inputs, { includeName })})`;\n}\nexport function formatAbiParams(params, { includeName = false } = {}) {\n if (!params)\n return '';\n return params\n .map((param) => formatAbiParam(param, { includeName }))\n .join(includeName ? ', ' : ',');\n}\nfunction formatAbiParam(param, { includeName }) {\n if (param.type.startsWith('tuple')) {\n return `(${formatAbiParams(param.components, { includeName })})${param.type.slice('tuple'.length)}`;\n }\n return param.type + (includeName && param.name ? ` ${param.name}` : '');\n}\n//# sourceMappingURL=formatAbiItem.js.map","export function isHex(value, { strict = true } = {}) {\n if (!value)\n return false;\n if (typeof value !== 'string')\n return false;\n return strict ? /^0x[0-9a-fA-F]*$/.test(value) : value.startsWith('0x');\n}\n//# sourceMappingURL=isHex.js.map","import { isHex } from './isHex.js';\n/**\n * @description Retrieves the size of the value (in bytes).\n *\n * @param value The value (hex or byte array) to retrieve the size of.\n * @returns The size of the value (in bytes).\n */\nexport function size(value) {\n if (isHex(value, { strict: false }))\n return Math.ceil((value.length - 2) / 2);\n return value.length;\n}\n//# sourceMappingURL=size.js.map","export const version = '2.36.0';\n//# sourceMappingURL=version.js.map","import { version } from './version.js';\nlet errorConfig = {\n getDocsUrl: ({ docsBaseUrl, docsPath = '', docsSlug, }) => docsPath\n ? `${docsBaseUrl ?? 'https://viem.sh'}${docsPath}${docsSlug ? `#${docsSlug}` : ''}`\n : undefined,\n version: `viem@${version}`,\n};\nexport function setErrorConfig(config) {\n errorConfig = config;\n}\nexport class BaseError extends Error {\n constructor(shortMessage, args = {}) {\n const details = (() => {\n if (args.cause instanceof BaseError)\n return args.cause.details;\n if (args.cause?.message)\n return args.cause.message;\n return args.details;\n })();\n const docsPath = (() => {\n if (args.cause instanceof BaseError)\n return args.cause.docsPath || args.docsPath;\n return args.docsPath;\n })();\n const docsUrl = errorConfig.getDocsUrl?.({ ...args, docsPath });\n const message = [\n shortMessage || 'An error occurred.',\n '',\n ...(args.metaMessages ? [...args.metaMessages, ''] : []),\n ...(docsUrl ? [`Docs: ${docsUrl}`] : []),\n ...(details ? [`Details: ${details}`] : []),\n ...(errorConfig.version ? [`Version: ${errorConfig.version}`] : []),\n ].join('\\n');\n super(message, args.cause ? { cause: args.cause } : undefined);\n Object.defineProperty(this, \"details\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"docsPath\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"metaMessages\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"shortMessage\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"version\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"name\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: 'BaseError'\n });\n this.details = details;\n this.docsPath = docsPath;\n this.metaMessages = args.metaMessages;\n this.name = args.name ?? this.name;\n this.shortMessage = shortMessage;\n this.version = version;\n }\n walk(fn) {\n return walk(this, fn);\n }\n}\nfunction walk(err, fn) {\n if (fn?.(err))\n return err;\n if (err &&\n typeof err === 'object' &&\n 'cause' in err &&\n err.cause !== undefined)\n return walk(err.cause, fn);\n return fn ? null : err;\n}\n//# sourceMappingURL=base.js.map","import { formatAbiItem, formatAbiParams } from '../utils/abi/formatAbiItem.js';\nimport { size } from '../utils/data/size.js';\nimport { BaseError } from './base.js';\nexport class AbiConstructorNotFoundError extends BaseError {\n constructor({ docsPath }) {\n super([\n 'A constructor was not found on the ABI.',\n 'Make sure you are using the correct ABI and that the constructor exists on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiConstructorNotFoundError',\n });\n }\n}\nexport class AbiConstructorParamsNotFoundError extends BaseError {\n constructor({ docsPath }) {\n super([\n 'Constructor arguments were provided (`args`), but a constructor parameters (`inputs`) were not found on the ABI.',\n 'Make sure you are using the correct ABI, and that the `inputs` attribute on the constructor exists.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiConstructorParamsNotFoundError',\n });\n }\n}\nexport class AbiDecodingDataSizeInvalidError extends BaseError {\n constructor({ data, size }) {\n super([\n `Data size of ${size} bytes is invalid.`,\n 'Size must be in increments of 32 bytes (size % 32 === 0).',\n ].join('\\n'), {\n metaMessages: [`Data: ${data} (${size} bytes)`],\n name: 'AbiDecodingDataSizeInvalidError',\n });\n }\n}\nexport class AbiDecodingDataSizeTooSmallError extends BaseError {\n constructor({ data, params, size, }) {\n super([`Data size of ${size} bytes is too small for given parameters.`].join('\\n'), {\n metaMessages: [\n `Params: (${formatAbiParams(params, { includeName: true })})`,\n `Data: ${data} (${size} bytes)`,\n ],\n name: 'AbiDecodingDataSizeTooSmallError',\n });\n Object.defineProperty(this, \"data\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"params\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"size\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.data = data;\n this.params = params;\n this.size = size;\n }\n}\nexport class AbiDecodingZeroDataError extends BaseError {\n constructor() {\n super('Cannot decode zero data (\"0x\") with ABI parameters.', {\n name: 'AbiDecodingZeroDataError',\n });\n }\n}\nexport class AbiEncodingArrayLengthMismatchError extends BaseError {\n constructor({ expectedLength, givenLength, type, }) {\n super([\n `ABI encoding array length mismatch for type ${type}.`,\n `Expected length: ${expectedLength}`,\n `Given length: ${givenLength}`,\n ].join('\\n'), { name: 'AbiEncodingArrayLengthMismatchError' });\n }\n}\nexport class AbiEncodingBytesSizeMismatchError extends BaseError {\n constructor({ expectedSize, value }) {\n super(`Size of bytes \"${value}\" (bytes${size(value)}) does not match expected size (bytes${expectedSize}).`, { name: 'AbiEncodingBytesSizeMismatchError' });\n }\n}\nexport class AbiEncodingLengthMismatchError extends BaseError {\n constructor({ expectedLength, givenLength, }) {\n super([\n 'ABI encoding params/values length mismatch.',\n `Expected length (params): ${expectedLength}`,\n `Given length (values): ${givenLength}`,\n ].join('\\n'), { name: 'AbiEncodingLengthMismatchError' });\n }\n}\nexport class AbiErrorInputsNotFoundError extends BaseError {\n constructor(errorName, { docsPath }) {\n super([\n `Arguments (\\`args\\`) were provided to \"${errorName}\", but \"${errorName}\" on the ABI does not contain any parameters (\\`inputs\\`).`,\n 'Cannot encode error result without knowing what the parameter types are.',\n 'Make sure you are using the correct ABI and that the inputs exist on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiErrorInputsNotFoundError',\n });\n }\n}\nexport class AbiErrorNotFoundError extends BaseError {\n constructor(errorName, { docsPath } = {}) {\n super([\n `Error ${errorName ? `\"${errorName}\" ` : ''}not found on ABI.`,\n 'Make sure you are using the correct ABI and that the error exists on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiErrorNotFoundError',\n });\n }\n}\nexport class AbiErrorSignatureNotFoundError extends BaseError {\n constructor(signature, { docsPath }) {\n super([\n `Encoded error signature \"${signature}\" not found on ABI.`,\n 'Make sure you are using the correct ABI and that the error exists on it.',\n `You can look up the decoded signature here: https://openchain.xyz/signatures?query=${signature}.`,\n ].join('\\n'), {\n docsPath,\n name: 'AbiErrorSignatureNotFoundError',\n });\n Object.defineProperty(this, \"signature\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.signature = signature;\n }\n}\nexport class AbiEventSignatureEmptyTopicsError extends BaseError {\n constructor({ docsPath }) {\n super('Cannot extract event signature from empty topics.', {\n docsPath,\n name: 'AbiEventSignatureEmptyTopicsError',\n });\n }\n}\nexport class AbiEventSignatureNotFoundError extends BaseError {\n constructor(signature, { docsPath }) {\n super([\n `Encoded event signature \"${signature}\" not found on ABI.`,\n 'Make sure you are using the correct ABI and that the event exists on it.',\n `You can look up the signature here: https://openchain.xyz/signatures?query=${signature}.`,\n ].join('\\n'), {\n docsPath,\n name: 'AbiEventSignatureNotFoundError',\n });\n }\n}\nexport class AbiEventNotFoundError extends BaseError {\n constructor(eventName, { docsPath } = {}) {\n super([\n `Event ${eventName ? `\"${eventName}\" ` : ''}not found on ABI.`,\n 'Make sure you are using the correct ABI and that the event exists on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiEventNotFoundError',\n });\n }\n}\nexport class AbiFunctionNotFoundError extends BaseError {\n constructor(functionName, { docsPath } = {}) {\n super([\n `Function ${functionName ? `\"${functionName}\" ` : ''}not found on ABI.`,\n 'Make sure you are using the correct ABI and that the function exists on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiFunctionNotFoundError',\n });\n }\n}\nexport class AbiFunctionOutputsNotFoundError extends BaseError {\n constructor(functionName, { docsPath }) {\n super([\n `Function \"${functionName}\" does not contain any \\`outputs\\` on ABI.`,\n 'Cannot decode function result without knowing what the parameter types are.',\n 'Make sure you are using the correct ABI and that the function exists on it.',\n ].join('\\n'), {\n docsPath,\n name: 'AbiFunctionOutputsNotFoundError',\n });\n }\n}\nexport class AbiFunctionSignatureNotFoundError extends BaseError {\n constructor(signature, { docsPath }) {\n super([\n `Encoded function signature \"${signature}\" not found on ABI.`,\n 'Make sure you are using the correct ABI and that the function exists on it.',\n `You can look up the signature here: https://openchain.xyz/signatures?query=${signature}.`,\n ].join('\\n'), {\n docsPath,\n name: 'AbiFunctionSignatureNotFoundError',\n });\n }\n}\nexport class AbiItemAmbiguityError extends BaseError {\n constructor(x, y) {\n super('Found ambiguous types in overloaded ABI items.', {\n metaMessages: [\n `\\`${x.type}\\` in \\`${formatAbiItem(x.abiItem)}\\`, and`,\n `\\`${y.type}\\` in \\`${formatAbiItem(y.abiItem)}\\``,\n '',\n 'These types encode differently and cannot be distinguished at runtime.',\n 'Remove one of the ambiguous items in the ABI.',\n ],\n name: 'AbiItemAmbiguityError',\n });\n }\n}\nexport class BytesSizeMismatchError extends BaseError {\n constructor({ expectedSize, givenSize, }) {\n super(`Expected bytes${expectedSize}, got bytes${givenSize}.`, {\n name: 'BytesSizeMismatchError',\n });\n }\n}\nexport class DecodeLogDataMismatch extends BaseError {\n constructor({ abiItem, data, params, size, }) {\n super([\n `Data size of ${size} bytes is too small for non-indexed event parameters.`,\n ].join('\\n'), {\n metaMessages: [\n `Params: (${formatAbiParams(params, { includeName: true })})`,\n `Data: ${data} (${size} bytes)`,\n ],\n name: 'DecodeLogDataMismatch',\n });\n Object.defineProperty(this, \"abiItem\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"data\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"params\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n Object.defineProperty(this, \"size\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.abiItem = abiItem;\n this.data = data;\n this.params = params;\n this.size = size;\n }\n}\nexport class DecodeLogTopicsMismatch extends BaseError {\n constructor({ abiItem, param, }) {\n super([\n `Expected a topic for indexed event parameter${param.name ? ` \"${param.name}\"` : ''} on event \"${formatAbiItem(abiItem, { includeName: true })}\".`,\n ].join('\\n'), { name: 'DecodeLogTopicsMismatch' });\n Object.defineProperty(this, \"abiItem\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.abiItem = abiItem;\n }\n}\nexport class InvalidAbiEncodingTypeError extends BaseError {\n constructor(type, { docsPath }) {\n super([\n `Type \"${type}\" is not a valid encoding type.`,\n 'Please provide a valid ABI type.',\n ].join('\\n'), { docsPath, name: 'InvalidAbiEncodingType' });\n }\n}\nexport class InvalidAbiDecodingTypeError extends BaseError {\n constructor(type, { docsPath }) {\n super([\n `Type \"${type}\" is not a valid decoding type.`,\n 'Please provide a valid ABI type.',\n ].join('\\n'), { docsPath, name: 'InvalidAbiDecodingType' });\n }\n}\nexport class InvalidArrayError extends BaseError {\n constructor(value) {\n super([`Value \"${value}\" is not a valid array.`].join('\\n'), {\n name: 'InvalidArrayError',\n });\n }\n}\nexport class InvalidDefinitionTypeError extends BaseError {\n constructor(type) {\n super([\n `\"${type}\" is not a valid definition type.`,\n 'Valid types: \"function\", \"event\", \"error\"',\n ].join('\\n'), { name: 'InvalidDefinitionTypeError' });\n }\n}\nexport class UnsupportedPackedAbiType extends BaseError {\n constructor(type) {\n super(`Type \"${type}\" is not supported for packed encoding.`, {\n name: 'UnsupportedPackedAbiType',\n });\n }\n}\n//# sourceMappingURL=abi.js.map","import { BaseError } from './base.js';\nexport class SliceOffsetOutOfBoundsError extends BaseError {\n constructor({ offset, position, size, }) {\n super(`Slice ${position === 'start' ? 'starting' : 'ending'} at offset \"${offset}\" is out-of-bounds (size: ${size}).`, { name: 'SliceOffsetOutOfBoundsError' });\n }\n}\nexport class SizeExceedsPaddingSizeError extends BaseError {\n constructor({ size, targetSize, type, }) {\n super(`${type.charAt(0).toUpperCase()}${type\n .slice(1)\n .toLowerCase()} size (${size}) exceeds padding size (${targetSize}).`, { name: 'SizeExceedsPaddingSizeError' });\n }\n}\nexport class InvalidBytesLengthError extends BaseError {\n constructor({ size, targetSize, type, }) {\n super(`${type.charAt(0).toUpperCase()}${type\n .slice(1)\n .toLowerCase()} is expected to be ${targetSize} ${type} long, but is ${size} ${type} long.`, { name: 'InvalidBytesLengthError' });\n }\n}\n//# sourceMappingURL=data.js.map","import { SizeExceedsPaddingSizeError, } from '../../errors/data.js';\nexport function pad(hexOrBytes, { dir, size = 32 } = {}) {\n if (typeof hexOrBytes === 'string')\n return padHex(hexOrBytes, { dir, size });\n return padBytes(hexOrBytes, { dir, size });\n}\nexport function padHex(hex_, { dir, size = 32 } = {}) {\n if (size === null)\n return hex_;\n const hex = hex_.replace('0x', '');\n if (hex.length > size * 2)\n throw new SizeExceedsPaddingSizeError({\n size: Math.ceil(hex.length / 2),\n targetSize: size,\n type: 'hex',\n });\n return `0x${hex[dir === 'right' ? 'padEnd' : 'padStart'](size * 2, '0')}`;\n}\nexport function padBytes(bytes, { dir, size = 32 } = {}) {\n if (size === null)\n return bytes;\n if (bytes.length > size)\n throw new SizeExceedsPaddingSizeError({\n size: bytes.length,\n targetSize: size,\n type: 'bytes',\n });\n const paddedBytes = new Uint8Array(size);\n for (let i = 0; i < size; i++) {\n const padEnd = dir === 'right';\n paddedBytes[padEnd ? i : size - i - 1] =\n bytes[padEnd ? i : bytes.length - i - 1];\n }\n return paddedBytes;\n}\n//# sourceMappingURL=pad.js.map","import { BaseError } from './base.js';\nexport class IntegerOutOfRangeError extends BaseError {\n constructor({ max, min, signed, size, value, }) {\n super(`Number \"${value}\" is not in safe ${size ? `${size * 8}-bit ${signed ? 'signed' : 'unsigned'} ` : ''}integer range ${max ? `(${min} to ${max})` : `(above ${min})`}`, { name: 'IntegerOutOfRangeError' });\n }\n}\nexport class InvalidBytesBooleanError extends BaseError {\n constructor(bytes) {\n super(`Bytes value \"${bytes}\" is not a valid boolean. The bytes array must contain a single byte of either a 0 or 1 value.`, {\n name: 'InvalidBytesBooleanError',\n });\n }\n}\nexport class InvalidHexBooleanError extends BaseError {\n constructor(hex) {\n super(`Hex value \"${hex}\" is not a valid boolean. The hex value must be \"0x0\" (false) or \"0x1\" (true).`, { name: 'InvalidHexBooleanError' });\n }\n}\nexport class InvalidHexValueError extends BaseError {\n constructor(value) {\n super(`Hex value \"${value}\" is an odd length (${value.length}). It must be an even length.`, { name: 'InvalidHexValueError' });\n }\n}\nexport class SizeOverflowError extends BaseError {\n constructor({ givenSize, maxSize }) {\n super(`Size cannot exceed ${maxSize} bytes. Given size: ${givenSize} bytes.`, { name: 'SizeOverflowError' });\n }\n}\n//# sourceMappingURL=encoding.js.map","export function trim(hexOrBytes, { dir = 'left' } = {}) {\n let data = typeof hexOrBytes === 'string' ? hexOrBytes.replace('0x', '') : hexOrBytes;\n let sliceLength = 0;\n for (let i = 0; i < data.length - 1; i++) {\n if (data[dir === 'left' ? i : data.length - i - 1].toString() === '0')\n sliceLength++;\n else\n break;\n }\n data =\n dir === 'left'\n ? data.slice(sliceLength)\n : data.slice(0, data.length - sliceLength);\n if (typeof hexOrBytes === 'string') {\n if (data.length === 1 && dir === 'right')\n data = `${data}0`;\n return `0x${data.length % 2 === 1 ? `0${data}` : data}`;\n }\n return data;\n}\n//# sourceMappingURL=trim.js.map","import { InvalidHexBooleanError, SizeOverflowError, } from '../../errors/encoding.js';\nimport { size as size_ } from '../data/size.js';\nimport { trim } from '../data/trim.js';\nimport { hexToBytes } from './toBytes.js';\nexport function assertSize(hexOrBytes, { size }) {\n if (size_(hexOrBytes) > size)\n throw new SizeOverflowError({\n givenSize: size_(hexOrBytes),\n maxSize: size,\n });\n}\n/**\n * Decodes a hex string into a string, number, bigint, boolean, or byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex\n * - Example: https://viem.sh/docs/utilities/fromHex#usage\n *\n * @param hex Hex string to decode.\n * @param toOrOpts Type to convert to or options.\n * @returns Decoded value.\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x1a4', 'number')\n * // 420\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x48656c6c6f20576f726c6421', 'string')\n * // 'Hello world'\n *\n * @example\n * import { fromHex } from 'viem'\n * const data = fromHex('0x48656c6c6f20576f726c64210000000000000000000000000000000000000000', {\n * size: 32,\n * to: 'string'\n * })\n * // 'Hello world'\n */\nexport function fromHex(hex, toOrOpts) {\n const opts = typeof toOrOpts === 'string' ? { to: toOrOpts } : toOrOpts;\n const to = opts.to;\n if (to === 'number')\n return hexToNumber(hex, opts);\n if (to === 'bigint')\n return hexToBigInt(hex, opts);\n if (to === 'string')\n return hexToString(hex, opts);\n if (to === 'boolean')\n return hexToBool(hex, opts);\n return hexToBytes(hex, opts);\n}\n/**\n * Decodes a hex value into a bigint.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextobigint\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns BigInt value.\n *\n * @example\n * import { hexToBigInt } from 'viem'\n * const data = hexToBigInt('0x1a4', { signed: true })\n * // 420n\n *\n * @example\n * import { hexToBigInt } from 'viem'\n * const data = hexToBigInt('0x00000000000000000000000000000000000000000000000000000000000001a4', { size: 32 })\n * // 420n\n */\nexport function hexToBigInt(hex, opts = {}) {\n const { signed } = opts;\n if (opts.size)\n assertSize(hex, { size: opts.size });\n const value = BigInt(hex);\n if (!signed)\n return value;\n const size = (hex.length - 2) / 2;\n const max = (1n << (BigInt(size) * 8n - 1n)) - 1n;\n if (value <= max)\n return value;\n return value - BigInt(`0x${'f'.padStart(size * 2, 'f')}`) - 1n;\n}\n/**\n * Decodes a hex value into a boolean.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextobool\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns Boolean value.\n *\n * @example\n * import { hexToBool } from 'viem'\n * const data = hexToBool('0x01')\n * // true\n *\n * @example\n * import { hexToBool } from 'viem'\n * const data = hexToBool('0x0000000000000000000000000000000000000000000000000000000000000001', { size: 32 })\n * // true\n */\nexport function hexToBool(hex_, opts = {}) {\n let hex = hex_;\n if (opts.size) {\n assertSize(hex, { size: opts.size });\n hex = trim(hex);\n }\n if (trim(hex) === '0x00')\n return false;\n if (trim(hex) === '0x01')\n return true;\n throw new InvalidHexBooleanError(hex);\n}\n/**\n * Decodes a hex string into a number.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextonumber\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns Number value.\n *\n * @example\n * import { hexToNumber } from 'viem'\n * const data = hexToNumber('0x1a4')\n * // 420\n *\n * @example\n * import { hexToNumber } from 'viem'\n * const data = hexToBigInt('0x00000000000000000000000000000000000000000000000000000000000001a4', { size: 32 })\n * // 420\n */\nexport function hexToNumber(hex, opts = {}) {\n return Number(hexToBigInt(hex, opts));\n}\n/**\n * Decodes a hex value into a UTF-8 string.\n *\n * - Docs: https://viem.sh/docs/utilities/fromHex#hextostring\n *\n * @param hex Hex value to decode.\n * @param opts Options.\n * @returns String value.\n *\n * @example\n * import { hexToString } from 'viem'\n * const data = hexToString('0x48656c6c6f20576f726c6421')\n * // 'Hello world!'\n *\n * @example\n * import { hexToString } from 'viem'\n * const data = hexToString('0x48656c6c6f20576f726c64210000000000000000000000000000000000000000', {\n * size: 32,\n * })\n * // 'Hello world'\n */\nexport function hexToString(hex, opts = {}) {\n let bytes = hexToBytes(hex);\n if (opts.size) {\n assertSize(bytes, { size: opts.size });\n bytes = trim(bytes, { dir: 'right' });\n }\n return new TextDecoder().decode(bytes);\n}\n//# sourceMappingURL=fromHex.js.map","import { IntegerOutOfRangeError, } from '../../errors/encoding.js';\nimport { pad } from '../data/pad.js';\nimport { assertSize } from './fromHex.js';\nconst hexes = /*#__PURE__*/ Array.from({ length: 256 }, (_v, i) => i.toString(16).padStart(2, '0'));\n/**\n * Encodes a string, number, bigint, or ByteArray into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex\n * - Example: https://viem.sh/docs/utilities/toHex#usage\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex('Hello world')\n * // '0x48656c6c6f20776f726c6421'\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex(420)\n * // '0x1a4'\n *\n * @example\n * import { toHex } from 'viem'\n * const data = toHex('Hello world', { size: 32 })\n * // '0x48656c6c6f20776f726c64210000000000000000000000000000000000000000'\n */\nexport function toHex(value, opts = {}) {\n if (typeof value === 'number' || typeof value === 'bigint')\n return numberToHex(value, opts);\n if (typeof value === 'string') {\n return stringToHex(value, opts);\n }\n if (typeof value === 'boolean')\n return boolToHex(value, opts);\n return bytesToHex(value, opts);\n}\n/**\n * Encodes a boolean into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#booltohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(true)\n * // '0x1'\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(false)\n * // '0x0'\n *\n * @example\n * import { boolToHex } from 'viem'\n * const data = boolToHex(true, { size: 32 })\n * // '0x0000000000000000000000000000000000000000000000000000000000000001'\n */\nexport function boolToHex(value, opts = {}) {\n const hex = `0x${Number(value)}`;\n if (typeof opts.size === 'number') {\n assertSize(hex, { size: opts.size });\n return pad(hex, { size: opts.size });\n }\n return hex;\n}\n/**\n * Encodes a bytes array into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#bytestohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { bytesToHex } from 'viem'\n * const data = bytesToHex(Uint8Array.from([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n * // '0x48656c6c6f20576f726c6421'\n *\n * @example\n * import { bytesToHex } from 'viem'\n * const data = bytesToHex(Uint8Array.from([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33]), { size: 32 })\n * // '0x48656c6c6f20576f726c64210000000000000000000000000000000000000000'\n */\nexport function bytesToHex(value, opts = {}) {\n let string = '';\n for (let i = 0; i < value.length; i++) {\n string += hexes[value[i]];\n }\n const hex = `0x${string}`;\n if (typeof opts.size === 'number') {\n assertSize(hex, { size: opts.size });\n return pad(hex, { dir: 'right', size: opts.size });\n }\n return hex;\n}\n/**\n * Encodes a number or bigint into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#numbertohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { numberToHex } from 'viem'\n * const data = numberToHex(420)\n * // '0x1a4'\n *\n * @example\n * import { numberToHex } from 'viem'\n * const data = numberToHex(420, { size: 32 })\n * // '0x00000000000000000000000000000000000000000000000000000000000001a4'\n */\nexport function numberToHex(value_, opts = {}) {\n const { signed, size } = opts;\n const value = BigInt(value_);\n let maxValue;\n if (size) {\n if (signed)\n maxValue = (1n << (BigInt(size) * 8n - 1n)) - 1n;\n else\n maxValue = 2n ** (BigInt(size) * 8n) - 1n;\n }\n else if (typeof value_ === 'number') {\n maxValue = BigInt(Number.MAX_SAFE_INTEGER);\n }\n const minValue = typeof maxValue === 'bigint' && signed ? -maxValue - 1n : 0;\n if ((maxValue && value > maxValue) || value < minValue) {\n const suffix = typeof value_ === 'bigint' ? 'n' : '';\n throw new IntegerOutOfRangeError({\n max: maxValue ? `${maxValue}${suffix}` : undefined,\n min: `${minValue}${suffix}`,\n signed,\n size,\n value: `${value_}${suffix}`,\n });\n }\n const hex = `0x${(signed && value < 0 ? (1n << BigInt(size * 8)) + BigInt(value) : value).toString(16)}`;\n if (size)\n return pad(hex, { size });\n return hex;\n}\nconst encoder = /*#__PURE__*/ new TextEncoder();\n/**\n * Encodes a UTF-8 string into a hex string\n *\n * - Docs: https://viem.sh/docs/utilities/toHex#stringtohex\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Hex value.\n *\n * @example\n * import { stringToHex } from 'viem'\n * const data = stringToHex('Hello World!')\n * // '0x48656c6c6f20576f726c6421'\n *\n * @example\n * import { stringToHex } from 'viem'\n * const data = stringToHex('Hello World!', { size: 32 })\n * // '0x48656c6c6f20576f726c64210000000000000000000000000000000000000000'\n */\nexport function stringToHex(value_, opts = {}) {\n const value = encoder.encode(value_);\n return bytesToHex(value, opts);\n}\n//# sourceMappingURL=toHex.js.map","import { BaseError } from '../../errors/base.js';\nimport { isHex } from '../data/isHex.js';\nimport { pad } from '../data/pad.js';\nimport { assertSize } from './fromHex.js';\nimport { numberToHex, } from './toHex.js';\nconst encoder = /*#__PURE__*/ new TextEncoder();\n/**\n * Encodes a UTF-8 string, hex value, bigint, number or boolean to a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes\n * - Example: https://viem.sh/docs/utilities/toBytes#usage\n *\n * @param value Value to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes('Hello world')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes(420)\n * // Uint8Array([1, 164])\n *\n * @example\n * import { toBytes } from 'viem'\n * const data = toBytes(420, { size: 4 })\n * // Uint8Array([0, 0, 1, 164])\n */\nexport function toBytes(value, opts = {}) {\n if (typeof value === 'number' || typeof value === 'bigint')\n return numberToBytes(value, opts);\n if (typeof value === 'boolean')\n return boolToBytes(value, opts);\n if (isHex(value))\n return hexToBytes(value, opts);\n return stringToBytes(value, opts);\n}\n/**\n * Encodes a boolean into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#booltobytes\n *\n * @param value Boolean value to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { boolToBytes } from 'viem'\n * const data = boolToBytes(true)\n * // Uint8Array([1])\n *\n * @example\n * import { boolToBytes } from 'viem'\n * const data = boolToBytes(true, { size: 32 })\n * // Uint8Array([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1])\n */\nexport function boolToBytes(value, opts = {}) {\n const bytes = new Uint8Array(1);\n bytes[0] = Number(value);\n if (typeof opts.size === 'number') {\n assertSize(bytes, { size: opts.size });\n return pad(bytes, { size: opts.size });\n }\n return bytes;\n}\n// We use very optimized technique to convert hex string to byte array\nconst charCodeMap = {\n zero: 48,\n nine: 57,\n A: 65,\n F: 70,\n a: 97,\n f: 102,\n};\nfunction charCodeToBase16(char) {\n if (char >= charCodeMap.zero && char <= charCodeMap.nine)\n return char - charCodeMap.zero;\n if (char >= charCodeMap.A && char <= charCodeMap.F)\n return char - (charCodeMap.A - 10);\n if (char >= charCodeMap.a && char <= charCodeMap.f)\n return char - (charCodeMap.a - 10);\n return undefined;\n}\n/**\n * Encodes a hex string into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#hextobytes\n *\n * @param hex Hex string to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { hexToBytes } from 'viem'\n * const data = hexToBytes('0x48656c6c6f20776f726c6421')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33])\n *\n * @example\n * import { hexToBytes } from 'viem'\n * const data = hexToBytes('0x48656c6c6f20776f726c6421', { size: 32 })\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])\n */\nexport function hexToBytes(hex_, opts = {}) {\n let hex = hex_;\n if (opts.size) {\n assertSize(hex, { size: opts.size });\n hex = pad(hex, { dir: 'right', size: opts.size });\n }\n let hexString = hex.slice(2);\n if (hexString.length % 2)\n hexString = `0${hexString}`;\n const length = hexString.length / 2;\n const bytes = new Uint8Array(length);\n for (let index = 0, j = 0; index < length; index++) {\n const nibbleLeft = charCodeToBase16(hexString.charCodeAt(j++));\n const nibbleRight = charCodeToBase16(hexString.charCodeAt(j++));\n if (nibbleLeft === undefined || nibbleRight === undefined) {\n throw new BaseError(`Invalid byte sequence (\"${hexString[j - 2]}${hexString[j - 1]}\" in \"${hexString}\").`);\n }\n bytes[index] = nibbleLeft * 16 + nibbleRight;\n }\n return bytes;\n}\n/**\n * Encodes a number into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#numbertobytes\n *\n * @param value Number to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { numberToBytes } from 'viem'\n * const data = numberToBytes(420)\n * // Uint8Array([1, 164])\n *\n * @example\n * import { numberToBytes } from 'viem'\n * const data = numberToBytes(420, { size: 4 })\n * // Uint8Array([0, 0, 1, 164])\n */\nexport function numberToBytes(value, opts) {\n const hex = numberToHex(value, opts);\n return hexToBytes(hex);\n}\n/**\n * Encodes a UTF-8 string into a byte array.\n *\n * - Docs: https://viem.sh/docs/utilities/toBytes#stringtobytes\n *\n * @param value String to encode.\n * @param opts Options.\n * @returns Byte array value.\n *\n * @example\n * import { stringToBytes } from 'viem'\n * const data = stringToBytes('Hello world!')\n * // Uint8Array([72, 101, 108, 108, 111, 32, 119, 111, 114, 108, 100, 33])\n *\n * @example\n * import { stringToBytes } from 'viem'\n * const data = stringToBytes('Hello world!', { size: 32 })\n * // Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0])\n */\nexport function stringToBytes(value, opts = {}) {\n const bytes = encoder.encode(value);\n if (typeof opts.size === 'number') {\n assertSize(bytes, { size: opts.size });\n return pad(bytes, { dir: 'right', size: opts.size });\n }\n return bytes;\n}\n//# sourceMappingURL=toBytes.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\nfunction fromBig(n, le = false) {\n if (le)\n return { h: Number(n & U32_MASK64), l: Number((n >> _32n) & U32_MASK64) };\n return { h: Number((n >> _32n) & U32_MASK64) | 0, l: Number(n & U32_MASK64) | 0 };\n}\nfunction split(lst, le = false) {\n const len = lst.length;\n let Ah = new Uint32Array(len);\n let Al = new Uint32Array(len);\n for (let i = 0; i < len; i++) {\n const { h, l } = fromBig(lst[i], le);\n [Ah[i], Al[i]] = [h, l];\n }\n return [Ah, Al];\n}\nconst toBig = (h, l) => (BigInt(h >>> 0) << _32n) | BigInt(l >>> 0);\n// for Shift in [0, 32)\nconst shrSH = (h, _l, s) => h >>> s;\nconst shrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in [1, 32)\nconst rotrSH = (h, l, s) => (h >>> s) | (l << (32 - s));\nconst rotrSL = (h, l, s) => (h << (32 - s)) | (l >>> s);\n// Right rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotrBH = (h, l, s) => (h << (64 - s)) | (l >>> (s - 32));\nconst rotrBL = (h, l, s) => (h >>> (s - 32)) | (l << (64 - s));\n// Right rotate for shift===32 (just swaps l&h)\nconst rotr32H = (_h, l) => l;\nconst rotr32L = (h, _l) => h;\n// Left rotate for Shift in [1, 32)\nconst rotlSH = (h, l, s) => (h << s) | (l >>> (32 - s));\nconst rotlSL = (h, l, s) => (l << s) | (h >>> (32 - s));\n// Left rotate for Shift in (32, 64), NOTE: 32 is special case.\nconst rotlBH = (h, l, s) => (l << (s - 32)) | (h >>> (64 - s));\nconst rotlBL = (h, l, s) => (h << (s - 32)) | (l >>> (64 - s));\n// JS uses 32-bit signed integers for bitwise operations which means we cannot\n// simple take carry out of low bit sum by shift, we need to use division.\nfunction add(Ah, Al, Bh, Bl) {\n const l = (Al >>> 0) + (Bl >>> 0);\n return { h: (Ah + Bh + ((l / 2 ** 32) | 0)) | 0, l: l | 0 };\n}\n// Addition with more than 2 elements\nconst add3L = (Al, Bl, Cl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0);\nconst add3H = (low, Ah, Bh, Ch) => (Ah + Bh + Ch + ((low / 2 ** 32) | 0)) | 0;\nconst add4L = (Al, Bl, Cl, Dl) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0);\nconst add4H = (low, Ah, Bh, Ch, Dh) => (Ah + Bh + Ch + Dh + ((low / 2 ** 32) | 0)) | 0;\nconst add5L = (Al, Bl, Cl, Dl, El) => (Al >>> 0) + (Bl >>> 0) + (Cl >>> 0) + (Dl >>> 0) + (El >>> 0);\nconst add5H = (low, Ah, Bh, Ch, Dh, Eh) => (Ah + Bh + Ch + Dh + Eh + ((low / 2 ** 32) | 0)) | 0;\n// prettier-ignore\nexport { add, add3H, add3L, add4H, add4L, add5H, add5L, fromBig, rotlBH, rotlBL, rotlSH, rotlSL, rotr32H, rotr32L, rotrBH, rotrBL, rotrSH, rotrSL, shrSH, shrSL, split, toBig };\n// prettier-ignore\nconst u64 = {\n fromBig, split, toBig,\n shrSH, shrSL,\n rotrSH, rotrSL, rotrBH, rotrBL,\n rotr32H, rotr32L,\n rotlSH, rotlSL, rotlBH, rotlBL,\n add, add3L, add3H, add4L, add4H, add5H, add5L,\n};\nexport default u64;\n//# sourceMappingURL=_u64.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! 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 (2025-04-30), we can just drop the import.\nimport { crypto } from '@noble/hashes/crypto';\n/** Checks if something is Uint8Array. Be careful: nodejs Buffer will return true. */\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is positive integer. */\nexport function anumber(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error('positive integer expected, got ' + n);\n}\n/** Asserts something is Uint8Array. */\nexport function abytes(b, ...lengths) {\n if (!isBytes(b))\n throw new Error('Uint8Array expected');\n if (lengths.length > 0 && !lengths.includes(b.length))\n throw new Error('Uint8Array expected of length ' + lengths + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nexport function ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.createHasher');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nexport function aexists(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}\n/** Asserts output is properly-sized byte array */\nexport function aoutput(out, instance) {\n abytes(out);\n const min = instance.outputLen;\n if (out.length < min) {\n throw new Error('digestInto() expects output buffer of length at least ' + min);\n }\n}\n/** Cast u8 / u16 / u32 to u8. */\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** Cast u8 / u16 / u32 to u32. */\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n/** Zeroize a byte array. Warning: JS provides no guarantees. */\nexport function clean(...arrays) {\n for (let i = 0; i < arrays.length; i++) {\n arrays[i].fill(0);\n }\n}\n/** Create DataView of an array for easy byte-level manipulation. */\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n/** The byte swap operation for uint32 */\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const swap8IfBE = isLE\n ? (n) => n\n : (n) => byteSwap(n);\n/** @deprecated */\nexport const byteSwapIfBE = swap8IfBE;\n/** In place byte swap for Uint32Array */\nexport function byteSwap32(arr) {\n for (let i = 0; i < arr.length; i++) {\n arr[i] = byteSwap(arr[i]);\n }\n return arr;\n}\nexport const swap32IfBE = isLE\n ? (u) => u\n : byteSwap32;\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = /* @__PURE__ */ (() => \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function')();\n// Array where index 0xf0 (240) is mapped to string 'f0'\nconst hexes = /* @__PURE__ */ Array.from({ length: 256 }, (_, i) => i.toString(16).padStart(2, '0'));\n/**\n * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\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// We use optimized technique to convert hex string to byte array\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\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 // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('hex string expected, got unpadded hex of length ' + hl);\n const array = new Uint8Array(al);\n for (let ai = 0, hi = 0; ai < al; ai++, hi += 2) {\n const n1 = asciiToBase16(hex.charCodeAt(hi));\n const n2 = asciiToBase16(hex.charCodeAt(hi + 1));\n if (n1 === undefined || n2 === undefined) {\n const char = hex[hi] + hex[hi + 1];\n throw new Error('hex string expected, got non-hex character \"' + char + '\" at index ' + hi);\n }\n array[ai] = n1 * 16 + n2; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\n/**\n * There is no setImmediate in browser and setTimeout is slow.\n * Call of async fn will return Promise, which will be fullfiled only on\n * next scheduler queue processing step and this is exactly what we need.\n */\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 * Converts string to bytes using UTF8 encoding.\n * @example utf8ToBytes('abc') // Uint8Array.from([97, 98, 99])\n */\nexport function utf8ToBytes(str) {\n if (typeof str !== 'string')\n throw new Error('string expected');\n return new Uint8Array(new TextEncoder().encode(str)); // https://bugzil.la/1681809\n}\n/**\n * Converts bytes to string using UTF8 encoding.\n * @example bytesToUtf8(Uint8Array.from([97, 98, 99])) // 'abc'\n */\nexport function bytesToUtf8(bytes) {\n return new TextDecoder().decode(bytes);\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 abytes(data);\n return data;\n}\n/**\n * Helper for KDFs: consumes uint8array or string.\n * When string is passed, does utf8 decoding, using TextDecoder.\n */\nexport function kdfInputToBytes(data) {\n if (typeof data === 'string')\n data = utf8ToBytes(data);\n abytes(data);\n return data;\n}\n/** Copies several Uint8Arrays into one. */\nexport function concatBytes(...arrays) {\n let sum = 0;\n for (let i = 0; i < arrays.length; i++) {\n const a = arrays[i];\n abytes(a);\n sum += a.length;\n }\n const res = new Uint8Array(sum);\n for (let i = 0, pad = 0; i < arrays.length; i++) {\n const a = arrays[i];\n res.set(a, pad);\n pad += a.length;\n }\n return res;\n}\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.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}\n/** For runtime check if class implements interface */\nexport class Hash {\n}\n/** Wraps hash function, creating an interface on top of it */\nexport function createHasher(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 createOptHasher(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 createXOFer(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 const wrapConstructor = createHasher;\nexport const wrapConstructorWithOpts = createOptHasher;\nexport const wrapXOFConstructorWithOpts = createXOFer;\n/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n // Legacy Node.js compatibility\n if (crypto && typeof crypto.randomBytes === 'function') {\n return Uint8Array.from(crypto.randomBytes(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * SHA3 (keccak) hash function, based on a new \"Sponge function\" design.\n * Different from older hashes, the internal state is bigger than output size.\n *\n * Check out [FIPS-202](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.202.pdf),\n * [Website](https://keccak.team/keccak.html),\n * [the differences between SHA-3 and Keccak](https://crypto.stackexchange.com/questions/15727/what-are-the-key-differences-between-the-draft-sha-3-standard-and-the-keccak-sub).\n *\n * Check out `sha3-addons` module for cSHAKE, k12, and others.\n * @module\n */\nimport { rotlBH, rotlBL, rotlSH, rotlSL, split } from \"./_u64.js\";\n// prettier-ignore\nimport { abytes, aexists, anumber, aoutput, clean, createHasher, createXOFer, Hash, swap32IfBE, toBytes, u32 } from \"./utils.js\";\n// No __PURE__ annotations in sha3 header:\n// EVERYTHING is in fact used on every export.\n// Various per round constants calculations\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nconst _2n = BigInt(2);\nconst _7n = BigInt(7);\nconst _256n = BigInt(256);\nconst _0x71n = BigInt(0x71);\nconst SHA3_PI = [];\nconst SHA3_ROTL = [];\nconst _SHA3_IOTA = [];\nfor (let round = 0, R = _1n, x = 1, y = 0; round < 24; round++) {\n // Pi\n [x, y] = [y, (2 * x + 3 * y) % 5];\n SHA3_PI.push(2 * (5 * y + x));\n // Rotational\n SHA3_ROTL.push((((round + 1) * (round + 2)) / 2) % 64);\n // Iota\n let t = _0n;\n for (let j = 0; j < 7; j++) {\n R = ((R << _1n) ^ ((R >> _7n) * _0x71n)) % _256n;\n if (R & _2n)\n t ^= _1n << ((_1n << /* @__PURE__ */ BigInt(j)) - _1n);\n }\n _SHA3_IOTA.push(t);\n}\nconst IOTAS = split(_SHA3_IOTA, true);\nconst SHA3_IOTA_H = IOTAS[0];\nconst SHA3_IOTA_L = IOTAS[1];\n// Left rotation (without 0, 32, 64)\nconst rotlH = (h, l, s) => (s > 32 ? rotlBH(h, l, s) : rotlSH(h, l, s));\nconst rotlL = (h, l, s) => (s > 32 ? rotlBL(h, l, s) : rotlSL(h, l, s));\n/** `keccakf1600` internal function, additionally allows to adjust round count. */\nexport function keccakP(s, rounds = 24) {\n const B = new Uint32Array(5 * 2);\n // NOTE: all indices are x2 since we store state as u32 instead of u64 (bigints to slow in js)\n for (let round = 24 - rounds; round < 24; round++) {\n // Theta θ\n for (let x = 0; x < 10; x++)\n B[x] = s[x] ^ s[x + 10] ^ s[x + 20] ^ s[x + 30] ^ s[x + 40];\n for (let x = 0; x < 10; x += 2) {\n const idx1 = (x + 8) % 10;\n const idx0 = (x + 2) % 10;\n const B0 = B[idx0];\n const B1 = B[idx0 + 1];\n const Th = rotlH(B0, B1, 1) ^ B[idx1];\n const Tl = rotlL(B0, B1, 1) ^ B[idx1 + 1];\n for (let y = 0; y < 50; y += 10) {\n s[x + y] ^= Th;\n s[x + y + 1] ^= Tl;\n }\n }\n // Rho (ρ) and Pi (π)\n let curH = s[2];\n let curL = s[3];\n for (let t = 0; t < 24; t++) {\n const shift = SHA3_ROTL[t];\n const Th = rotlH(curH, curL, shift);\n const Tl = rotlL(curH, curL, shift);\n const PI = SHA3_PI[t];\n curH = s[PI];\n curL = s[PI + 1];\n s[PI] = Th;\n s[PI + 1] = Tl;\n }\n // Chi (χ)\n for (let y = 0; y < 50; y += 10) {\n for (let x = 0; x < 10; x++)\n B[x] = s[y + x];\n for (let x = 0; x < 10; x++)\n s[y + x] ^= ~B[(x + 2) % 10] & B[(x + 4) % 10];\n }\n // Iota (ι)\n s[0] ^= SHA3_IOTA_H[round];\n s[1] ^= SHA3_IOTA_L[round];\n }\n clean(B);\n}\n/** Keccak sponge function. */\nexport class Keccak extends Hash {\n // NOTE: we accept arguments in bytes instead of bits here.\n constructor(blockLen, suffix, outputLen, enableXOF = false, rounds = 24) {\n super();\n this.pos = 0;\n this.posOut = 0;\n this.finished = false;\n this.destroyed = false;\n this.enableXOF = false;\n this.blockLen = blockLen;\n this.suffix = suffix;\n this.outputLen = outputLen;\n this.enableXOF = enableXOF;\n this.rounds = rounds;\n // Can be passed from user as dkLen\n anumber(outputLen);\n // 1600 = 5x5 matrix of 64bit. 1600 bits === 200 bytes\n // 0 < blockLen < 200\n if (!(0 < blockLen && blockLen < 200))\n throw new Error('only keccak-f1600 function is supported');\n this.state = new Uint8Array(200);\n this.state32 = u32(this.state);\n }\n clone() {\n return this._cloneInto();\n }\n keccak() {\n swap32IfBE(this.state32);\n keccakP(this.state32, this.rounds);\n swap32IfBE(this.state32);\n this.posOut = 0;\n this.pos = 0;\n }\n update(data) {\n aexists(this);\n data = toBytes(data);\n abytes(data);\n const { blockLen, state } = this;\n const len = data.length;\n for (let pos = 0; pos < len;) {\n const take = Math.min(blockLen - this.pos, len - pos);\n for (let i = 0; i < take; i++)\n state[this.pos++] ^= data[pos++];\n if (this.pos === blockLen)\n this.keccak();\n }\n return this;\n }\n finish() {\n if (this.finished)\n return;\n this.finished = true;\n const { state, suffix, pos, blockLen } = this;\n // Do the padding\n state[pos] ^= suffix;\n if ((suffix & 0x80) !== 0 && pos === blockLen - 1)\n this.keccak();\n state[blockLen - 1] ^= 0x80;\n this.keccak();\n }\n writeInto(out) {\n aexists(this, false);\n abytes(out);\n this.finish();\n const bufferOut = this.state;\n const { blockLen } = this;\n for (let pos = 0, len = out.length; pos < len;) {\n if (this.posOut >= blockLen)\n this.keccak();\n const take = Math.min(blockLen - this.posOut, len - pos);\n out.set(bufferOut.subarray(this.posOut, this.posOut + take), pos);\n this.posOut += take;\n pos += take;\n }\n return out;\n }\n xofInto(out) {\n // Sha3/Keccak usage with XOF is probably mistake, only SHAKE instances can do XOF\n if (!this.enableXOF)\n throw new Error('XOF is not possible for this instance');\n return this.writeInto(out);\n }\n xof(bytes) {\n anumber(bytes);\n return this.xofInto(new Uint8Array(bytes));\n }\n digestInto(out) {\n aoutput(out, this);\n if (this.finished)\n throw new Error('digest() was already called');\n this.writeInto(out);\n this.destroy();\n return out;\n }\n digest() {\n return this.digestInto(new Uint8Array(this.outputLen));\n }\n destroy() {\n this.destroyed = true;\n clean(this.state);\n }\n _cloneInto(to) {\n const { blockLen, suffix, outputLen, rounds, enableXOF } = this;\n to || (to = new Keccak(blockLen, suffix, outputLen, enableXOF, rounds));\n to.state32.set(this.state32);\n to.pos = this.pos;\n to.posOut = this.posOut;\n to.finished = this.finished;\n to.rounds = rounds;\n // Suffix can change in cSHAKE\n to.suffix = suffix;\n to.outputLen = outputLen;\n to.enableXOF = enableXOF;\n to.destroyed = this.destroyed;\n return to;\n }\n}\nconst gen = (suffix, blockLen, outputLen) => createHasher(() => new Keccak(blockLen, suffix, outputLen));\n/** SHA3-224 hash function. */\nexport const sha3_224 = /* @__PURE__ */ (() => gen(0x06, 144, 224 / 8))();\n/** SHA3-256 hash function. Different from keccak-256. */\nexport const sha3_256 = /* @__PURE__ */ (() => gen(0x06, 136, 256 / 8))();\n/** SHA3-384 hash function. */\nexport const sha3_384 = /* @__PURE__ */ (() => gen(0x06, 104, 384 / 8))();\n/** SHA3-512 hash function. */\nexport const sha3_512 = /* @__PURE__ */ (() => gen(0x06, 72, 512 / 8))();\n/** keccak-224 hash function. */\nexport const keccak_224 = /* @__PURE__ */ (() => gen(0x01, 144, 224 / 8))();\n/** keccak-256 hash function. Different from SHA3-256. */\nexport const keccak_256 = /* @__PURE__ */ (() => gen(0x01, 136, 256 / 8))();\n/** keccak-384 hash function. */\nexport const keccak_384 = /* @__PURE__ */ (() => gen(0x01, 104, 384 / 8))();\n/** keccak-512 hash function. */\nexport const keccak_512 = /* @__PURE__ */ (() => gen(0x01, 72, 512 / 8))();\nconst genShake = (suffix, blockLen, outputLen) => createXOFer((opts = {}) => new Keccak(blockLen, suffix, opts.dkLen === undefined ? outputLen : opts.dkLen, true));\n/** SHAKE128 XOF with 128-bit security. */\nexport const shake128 = /* @__PURE__ */ (() => genShake(0x1f, 168, 128 / 8))();\n/** SHAKE256 XOF with 256-bit security. */\nexport const shake256 = /* @__PURE__ */ (() => genShake(0x1f, 136, 256 / 8))();\n//# sourceMappingURL=sha3.js.map","import { keccak_256 } from '@noble/hashes/sha3';\nimport { isHex } from '../data/isHex.js';\nimport { toBytes } from '../encoding/toBytes.js';\nimport { toHex } from '../encoding/toHex.js';\nexport function keccak256(value, to_) {\n const to = to_ || 'hex';\n const bytes = keccak_256(isHex(value, { strict: false }) ? toBytes(value) : value);\n if (to === 'bytes')\n return bytes;\n return toHex(bytes);\n}\n//# sourceMappingURL=keccak256.js.map","import { toBytes } from '../encoding/toBytes.js';\nimport { keccak256 } from './keccak256.js';\nconst hash = (value) => keccak256(toBytes(value));\nexport function hashSignature(sig) {\n return hash(sig);\n}\n//# sourceMappingURL=hashSignature.js.map","import { formatAbiItem } from 'abitype';\nimport { normalizeSignature, } from './normalizeSignature.js';\n/**\n * Returns the signature for a given function or event definition.\n *\n * @example\n * const signature = toSignature('function ownerOf(uint256 tokenId)')\n * // 'ownerOf(uint256)'\n *\n * @example\n * const signature_3 = toSignature({\n * name: 'ownerOf',\n * type: 'function',\n * inputs: [{ name: 'tokenId', type: 'uint256' }],\n * outputs: [],\n * stateMutability: 'view',\n * })\n * // 'ownerOf(uint256)'\n */\nexport const toSignature = (def) => {\n const def_ = (() => {\n if (typeof def === 'string')\n return def;\n return formatAbiItem(def);\n })();\n return normalizeSignature(def_);\n};\n//# sourceMappingURL=toSignature.js.map","import { formatAbiParameters, } from './formatAbiParameters.js';\n/**\n * Formats ABI item (e.g. error, event, function) into human-readable ABI item\n *\n * @param abiItem - ABI item\n * @returns Human-readable ABI item\n */\nexport function formatAbiItem(abiItem) {\n if (abiItem.type === 'function')\n return `function ${abiItem.name}(${formatAbiParameters(abiItem.inputs)})${abiItem.stateMutability && abiItem.stateMutability !== 'nonpayable'\n ? ` ${abiItem.stateMutability}`\n : ''}${abiItem.outputs?.length\n ? ` returns (${formatAbiParameters(abiItem.outputs)})`\n : ''}`;\n if (abiItem.type === 'event')\n return `event ${abiItem.name}(${formatAbiParameters(abiItem.inputs)})`;\n if (abiItem.type === 'error')\n return `error ${abiItem.name}(${formatAbiParameters(abiItem.inputs)})`;\n if (abiItem.type === 'constructor')\n return `constructor(${formatAbiParameters(abiItem.inputs)})${abiItem.stateMutability === 'payable' ? ' payable' : ''}`;\n if (abiItem.type === 'fallback')\n return `fallback() external${abiItem.stateMutability === 'payable' ? ' payable' : ''}`;\n return 'receive() external payable';\n}\n//# sourceMappingURL=formatAbiItem.js.map","import { BaseError } from '../../errors/base.js';\nexport function normalizeSignature(signature) {\n let active = true;\n let current = '';\n let level = 0;\n let result = '';\n let valid = false;\n for (let i = 0; i < signature.length; i++) {\n const char = signature[i];\n // If the character is a separator, we want to reactivate.\n if (['(', ')', ','].includes(char))\n active = true;\n // If the character is a \"level\" token, we want to increment/decrement.\n if (char === '(')\n level++;\n if (char === ')')\n level--;\n // If we aren't active, we don't want to mutate the result.\n if (!active)\n continue;\n // If level === 0, we are at the definition level.\n if (level === 0) {\n if (char === ' ' && ['event', 'function', ''].includes(result))\n result = '';\n else {\n result += char;\n // If we are at the end of the definition, we must be finished.\n if (char === ')') {\n valid = true;\n break;\n }\n }\n continue;\n }\n // Ignore spaces\n if (char === ' ') {\n // If the previous character is a separator, and the current section isn't empty, we want to deactivate.\n if (signature[i - 1] !== ',' && current !== ',' && current !== ',(') {\n current = '';\n active = false;\n }\n continue;\n }\n result += char;\n current += char;\n }\n if (!valid)\n throw new BaseError('Unable to normalize signature.');\n return result;\n}\n//# sourceMappingURL=normalizeSignature.js.map","import { hashSignature } from './hashSignature.js';\nimport { toSignature } from './toSignature.js';\n/**\n * Returns the hash (of the function/event signature) for a given event or function definition.\n */\nexport function toSignatureHash(fn) {\n return hashSignature(toSignature(fn));\n}\n//# sourceMappingURL=toSignatureHash.js.map","import { toSignatureHash, } from './toSignatureHash.js';\n/**\n * Returns the event selector for a given event definition.\n *\n * @example\n * const selector = toEventSelector('Transfer(address indexed from, address indexed to, uint256 amount)')\n * // 0xddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef\n */\nexport const toEventSelector = toSignatureHash;\n//# sourceMappingURL=toEventSelector.js.map","import { BaseError } from './base.js';\nexport class InvalidAddressError extends BaseError {\n constructor({ address }) {\n super(`Address \"${address}\" is invalid.`, {\n metaMessages: [\n '- Address must be a hex value of 20 bytes (40 hex characters).',\n '- Address must match its checksum counterpart.',\n ],\n name: 'InvalidAddressError',\n });\n }\n}\n//# sourceMappingURL=address.js.map","/**\n * Map with a LRU (Least recently used) policy.\n *\n * @link https://en.wikipedia.org/wiki/Cache_replacement_policies#LRU\n */\nexport class LruMap extends Map {\n constructor(size) {\n super();\n Object.defineProperty(this, \"maxSize\", {\n enumerable: true,\n configurable: true,\n writable: true,\n value: void 0\n });\n this.maxSize = size;\n }\n get(key) {\n const value = super.get(key);\n if (super.has(key) && value !== undefined) {\n this.delete(key);\n super.set(key, value);\n }\n return value;\n }\n set(key, value) {\n super.set(key, value);\n if (this.maxSize && this.size > this.maxSize) {\n const firstKey = this.keys().next().value;\n if (firstKey)\n this.delete(firstKey);\n }\n return this;\n }\n}\n//# sourceMappingURL=lru.js.map","import { InvalidAddressError } from '../../errors/address.js';\nimport { stringToBytes, } from '../encoding/toBytes.js';\nimport { keccak256 } from '../hash/keccak256.js';\nimport { LruMap } from '../lru.js';\nimport { isAddress } from './isAddress.js';\nconst checksumAddressCache = /*#__PURE__*/ new LruMap(8192);\nexport function checksumAddress(address_, \n/**\n * Warning: EIP-1191 checksum addresses are generally not backwards compatible with the\n * wider Ethereum ecosystem, meaning it will break when validated against an application/tool\n * that relies on EIP-55 checksum encoding (checksum without chainId).\n *\n * It is highly recommended to not use this feature unless you\n * know what you are doing.\n *\n * See more: https://github.com/ethereum/EIPs/issues/1121\n */\nchainId) {\n if (checksumAddressCache.has(`${address_}.${chainId}`))\n return checksumAddressCache.get(`${address_}.${chainId}`);\n const hexAddress = chainId\n ? `${chainId}${address_.toLowerCase()}`\n : address_.substring(2).toLowerCase();\n const hash = keccak256(stringToBytes(hexAddress), 'bytes');\n const address = (chainId ? hexAddress.substring(`${chainId}0x`.length) : hexAddress).split('');\n for (let i = 0; i < 40; i += 2) {\n if (hash[i >> 1] >> 4 >= 8 && address[i]) {\n address[i] = address[i].toUpperCase();\n }\n if ((hash[i >> 1] & 0x0f) >= 8 && address[i + 1]) {\n address[i + 1] = address[i + 1].toUpperCase();\n }\n }\n const result = `0x${address.join('')}`;\n checksumAddressCache.set(`${address_}.${chainId}`, result);\n return result;\n}\nexport function getAddress(address, \n/**\n * Warning: EIP-1191 checksum addresses are generally not backwards compatible with the\n * wider Ethereum ecosystem, meaning it will break when validated against an application/tool\n * that relies on EIP-55 checksum encoding (checksum without chainId).\n *\n * It is highly recommended to not use this feature unless you\n * know what you are doing.\n *\n * See more: https://github.com/ethereum/EIPs/issues/1121\n */\nchainId) {\n if (!isAddress(address, { strict: false }))\n throw new InvalidAddressError({ address });\n return checksumAddress(address, chainId);\n}\n//# sourceMappingURL=getAddress.js.map","import { LruMap } from '../lru.js';\nimport { checksumAddress } from './getAddress.js';\nconst addressRegex = /^0x[a-fA-F0-9]{40}$/;\n/** @internal */\nexport const isAddressCache = /*#__PURE__*/ new LruMap(8192);\nexport function isAddress(address, options) {\n const { strict = true } = options ?? {};\n const cacheKey = `${address}.${strict}`;\n if (isAddressCache.has(cacheKey))\n return isAddressCache.get(cacheKey);\n const result = (() => {\n if (!addressRegex.test(address))\n return false;\n if (address.toLowerCase() === address)\n return true;\n if (strict)\n return checksumAddress(address) === address;\n return true;\n })();\n isAddressCache.set(cacheKey, result);\n return result;\n}\n//# sourceMappingURL=isAddress.js.map","export function concat(values) {\n if (typeof values[0] === 'string')\n return concatHex(values);\n return concatBytes(values);\n}\nexport function concatBytes(values) {\n let length = 0;\n for (const arr of values) {\n length += arr.length;\n }\n const result = new Uint8Array(length);\n let offset = 0;\n for (const arr of values) {\n result.set(arr, offset);\n offset += arr.length;\n }\n return result;\n}\nexport function concatHex(values) {\n return `0x${values.reduce((acc, x) => acc + x.replace('0x', ''), '')}`;\n}\n//# sourceMappingURL=concat.js.map","import { SliceOffsetOutOfBoundsError, } from '../../errors/data.js';\nimport { isHex } from './isHex.js';\nimport { size } from './size.js';\n/**\n * @description Returns a section of the hex or byte array given a start/end bytes offset.\n *\n * @param value The hex or byte array to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function slice(value, start, end, { strict } = {}) {\n if (isHex(value, { strict: false }))\n return sliceHex(value, start, end, {\n strict,\n });\n return sliceBytes(value, start, end, {\n strict,\n });\n}\nfunction assertStartOffset(value, start) {\n if (typeof start === 'number' && start > 0 && start > size(value) - 1)\n throw new SliceOffsetOutOfBoundsError({\n offset: start,\n position: 'start',\n size: size(value),\n });\n}\nfunction assertEndOffset(value, start, end) {\n if (typeof start === 'number' &&\n typeof end === 'number' &&\n size(value) !== end - start) {\n throw new SliceOffsetOutOfBoundsError({\n offset: end,\n position: 'end',\n size: size(value),\n });\n }\n}\n/**\n * @description Returns a section of the byte array given a start/end bytes offset.\n *\n * @param value The byte array to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function sliceBytes(value_, start, end, { strict } = {}) {\n assertStartOffset(value_, start);\n const value = value_.slice(start, end);\n if (strict)\n assertEndOffset(value, start, end);\n return value;\n}\n/**\n * @description Returns a section of the hex value given a start/end bytes offset.\n *\n * @param value The hex value to slice.\n * @param start The start offset (in bytes).\n * @param end The end offset (in bytes).\n */\nexport function sliceHex(value_, start, end, { strict } = {}) {\n assertStartOffset(value_, start);\n const value = `0x${value_\n .replace('0x', '')\n .slice((start ?? 0) * 2, (end ?? value_.length) * 2)}`;\n if (strict)\n assertEndOffset(value, start, end);\n return value;\n}\n//# sourceMappingURL=slice.js.map","export const arrayRegex = /^(.*)\\[([0-9]*)\\]$/;\n// `bytes<M>`: binary type of `M` bytes, `0 < M <= 32`\n// https://regexr.com/6va55\nexport const bytesRegex = /^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/;\n// `(u)int<M>`: (un)signed integer type of `M` bits, `0 < M <= 256`, `M % 8 == 0`\n// https://regexr.com/6v8hp\nexport const integerRegex = /^(u?int)(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/;\n//# sourceMappingURL=regex.js.map","import { AbiEncodingArrayLengthMismatchError, AbiEncodingBytesSizeMismatchError, AbiEncodingLengthMismatchError, InvalidAbiEncodingTypeError, InvalidArrayError, } from '../../errors/abi.js';\nimport { InvalidAddressError, } from '../../errors/address.js';\nimport { BaseError } from '../../errors/base.js';\nimport { IntegerOutOfRangeError } from '../../errors/encoding.js';\nimport { isAddress } from '../address/isAddress.js';\nimport { concat } from '../data/concat.js';\nimport { padHex } from '../data/pad.js';\nimport { size } from '../data/size.js';\nimport { slice } from '../data/slice.js';\nimport { boolToHex, numberToHex, stringToHex, } from '../encoding/toHex.js';\nimport { integerRegex } from '../regex.js';\n/**\n * @description Encodes a list of primitive values into an ABI-encoded hex value.\n *\n * - Docs: https://viem.sh/docs/abi/encodeAbiParameters#encodeabiparameters\n *\n * Generates ABI encoded data using the [ABI specification](https://docs.soliditylang.org/en/latest/abi-spec), given a set of ABI parameters (inputs/outputs) and their corresponding values.\n *\n * @param params - a set of ABI Parameters (params), that can be in the shape of the inputs or outputs attribute of an ABI Item.\n * @param values - a set of values (values) that correspond to the given params.\n * @example\n * ```typescript\n * import { encodeAbiParameters } from 'viem'\n *\n * const encodedData = encodeAbiParameters(\n * [\n * { name: 'x', type: 'string' },\n * { name: 'y', type: 'uint' },\n * { name: 'z', type: 'bool' }\n * ],\n * ['wagmi', 420n, true]\n * )\n * ```\n *\n * You can also pass in Human Readable parameters with the parseAbiParameters utility.\n *\n * @example\n * ```typescript\n * import { encodeAbiParameters, parseAbiParameters } from 'viem'\n *\n * const encodedData = encodeAbiParameters(\n * parseAbiParameters('string x, uint y, bool z'),\n * ['wagmi', 420n, true]\n * )\n * ```\n */\nexport function encodeAbiParameters(params, values) {\n if (params.length !== values.length)\n throw new AbiEncodingLengthMismatchError({\n expectedLength: params.length,\n givenLength: values.length,\n });\n // Prepare the parameters to determine dynamic types to encode.\n const preparedParams = prepareParams({\n params: params,\n values: values,\n });\n const data = encodeParams(preparedParams);\n if (data.length === 0)\n return '0x';\n return data;\n}\nfunction prepareParams({ params, values, }) {\n const preparedParams = [];\n for (let i = 0; i < params.length; i++) {\n preparedParams.push(prepareParam({ param: params[i], value: values[i] }));\n }\n return preparedParams;\n}\nfunction prepareParam({ param, value, }) {\n const arrayComponents = getArrayComponents(param.type);\n if (arrayComponents) {\n const [length, type] = arrayComponents;\n return encodeArray(value, { length, param: { ...param, type } });\n }\n if (param.type === 'tuple') {\n return encodeTuple(value, {\n param: param,\n });\n }\n if (param.type === 'address') {\n return encodeAddress(value);\n }\n if (param.type === 'bool') {\n return encodeBool(value);\n }\n if (param.type.startsWith('uint') || param.type.startsWith('int')) {\n const signed = param.type.startsWith('int');\n const [, , size = '256'] = integerRegex.exec(param.type) ?? [];\n return encodeNumber(value, {\n signed,\n size: Number(size),\n });\n }\n if (param.type.startsWith('bytes')) {\n return encodeBytes(value, { param });\n }\n if (param.type === 'string') {\n return encodeString(value);\n }\n throw new InvalidAbiEncodingTypeError(param.type, {\n docsPath: '/docs/contract/encodeAbiParameters',\n });\n}\nfunction encodeParams(preparedParams) {\n // 1. Compute the size of the static part of the parameters.\n let staticSize = 0;\n for (let i = 0; i < preparedParams.length; i++) {\n const { dynamic, encoded } = preparedParams[i];\n if (dynamic)\n staticSize += 32;\n else\n staticSize += size(encoded);\n }\n // 2. Split the parameters into static and dynamic parts.\n const staticParams = [];\n const dynamicParams = [];\n let dynamicSize = 0;\n for (let i = 0; i < preparedParams.length; i++) {\n const { dynamic, encoded } = preparedParams[i];\n if (dynamic) {\n staticParams.push(numberToHex(staticSize + dynamicSize, { size: 32 }));\n dynamicParams.push(encoded);\n dynamicSize += size(encoded);\n }\n else {\n staticParams.push(encoded);\n }\n }\n // 3. Concatenate static and dynamic parts.\n return concat([...staticParams, ...dynamicParams]);\n}\nfunction encodeAddress(value) {\n if (!isAddress(value))\n throw new InvalidAddressError({ address: value });\n return { dynamic: false, encoded: padHex(value.toLowerCase()) };\n}\nfunction encodeArray(value, { length, param, }) {\n const dynamic = length === null;\n if (!Array.isArray(value))\n throw new InvalidArrayError(value);\n if (!dynamic && value.length !== length)\n throw new AbiEncodingArrayLengthMismatchError({\n expectedLength: length,\n givenLength: value.length,\n type: `${param.type}[${length}]`,\n });\n let dynamicChild = false;\n const preparedParams = [];\n for (let i = 0; i < value.length; i++) {\n const preparedParam = prepareParam({ param, value: value[i] });\n if (preparedParam.dynamic)\n dynamicChild = true;\n preparedParams.push(preparedParam);\n }\n if (dynamic || dynamicChild) {\n const data = encodeParams(preparedParams);\n if (dynamic) {\n const length = numberToHex(preparedParams.length, { size: 32 });\n return {\n dynamic: true,\n encoded: preparedParams.length > 0 ? concat([length, data]) : length,\n };\n }\n if (dynamicChild)\n return { dynamic: true, encoded: data };\n }\n return {\n dynamic: false,\n encoded: concat(preparedParams.map(({ encoded }) => encoded)),\n };\n}\nfunction encodeBytes(value, { param }) {\n const [, paramSize] = param.type.split('bytes');\n const bytesSize = size(value);\n if (!paramSize) {\n let value_ = value;\n // If the size is not divisible by 32 bytes, pad the end\n // with empty bytes to the ceiling 32 bytes.\n if (bytesSize % 32 !== 0)\n value_ = padHex(value_, {\n dir: 'right',\n size: Math.ceil((value.length - 2) / 2 / 32) * 32,\n });\n return {\n dynamic: true,\n encoded: concat([padHex(numberToHex(bytesSize, { size: 32 })), value_]),\n };\n }\n if (bytesSize !== Number.parseInt(paramSize, 10))\n throw new AbiEncodingBytesSizeMismatchError({\n expectedSize: Number.parseInt(paramSize, 10),\n value,\n });\n return { dynamic: false, encoded: padHex(value, { dir: 'right' }) };\n}\nfunction encodeBool(value) {\n if (typeof value !== 'boolean')\n throw new BaseError(`Invalid boolean value: \"${value}\" (type: ${typeof value}). Expected: \\`true\\` or \\`false\\`.`);\n return { dynamic: false, encoded: padHex(boolToHex(value)) };\n}\nfunction encodeNumber(value, { signed, size = 256 }) {\n if (typeof size === 'number') {\n const max = 2n ** (BigInt(size) - (signed ? 1n : 0n)) - 1n;\n const min = signed ? -max - 1n : 0n;\n if (value > max || value < min)\n throw new IntegerOutOfRangeError({\n max: max.toString(),\n min: min.toString(),\n signed,\n size: size / 8,\n value: value.toString(),\n });\n }\n return {\n dynamic: false,\n encoded: numberToHex(value, {\n size: 32,\n signed,\n }),\n };\n}\nfunction encodeString(value) {\n const hexValue = stringToHex(value);\n const partsLength = Math.ceil(size(hexValue) / 32);\n const parts = [];\n for (let i = 0; i < partsLength; i++) {\n parts.push(padHex(slice(hexValue, i * 32, (i + 1) * 32), {\n dir: 'right',\n }));\n }\n return {\n dynamic: true,\n encoded: concat([\n padHex(numberToHex(size(hexValue), { size: 32 })),\n ...parts,\n ]),\n };\n}\nfunction encodeTuple(value, { param }) {\n let dynamic = false;\n const preparedParams = [];\n for (let i = 0; i < param.components.length; i++) {\n const param_ = param.components[i];\n const index = Array.isArray(value) ? i : param_.name;\n const preparedParam = prepareParam({\n param: param_,\n value: value[index],\n });\n preparedParams.push(preparedParam);\n if (preparedParam.dynamic)\n dynamic = true;\n }\n return {\n dynamic,\n encoded: dynamic\n ? encodeParams(preparedParams)\n : concat(preparedParams.map(({ encoded }) => encoded)),\n };\n}\nexport function getArrayComponents(type) {\n const matches = type.match(/^(.*)\\[(\\d+)?\\]$/);\n return matches\n ? // Return `null` if the array is dynamic.\n [matches[2] ? Number(matches[2]) : null, matches[1]]\n : undefined;\n}\n//# sourceMappingURL=encodeAbiParameters.js.map","import { slice } from '../data/slice.js';\nimport { toSignatureHash, } from './toSignatureHash.js';\n/**\n * Returns the function selector for a given function definition.\n *\n * @example\n * const selector = toFunctionSelector('function ownerOf(uint256 tokenId)')\n * // 0x6352211e\n */\nexport const toFunctionSelector = (fn) => slice(toSignatureHash(fn), 0, 4);\n//# sourceMappingURL=toFunctionSelector.js.map","import { AbiItemAmbiguityError, } from '../../errors/abi.js';\nimport { isHex } from '../../utils/data/isHex.js';\nimport { isAddress } from '../address/isAddress.js';\nimport { toEventSelector } from '../hash/toEventSelector.js';\nimport { toFunctionSelector, } from '../hash/toFunctionSelector.js';\nexport function getAbiItem(parameters) {\n const { abi, args = [], name } = parameters;\n const isSelector = isHex(name, { strict: false });\n const abiItems = abi.filter((abiItem) => {\n if (isSelector) {\n if (abiItem.type === 'function')\n return toFunctionSelector(abiItem) === name;\n if (abiItem.type === 'event')\n return toEventSelector(abiItem) === name;\n return false;\n }\n return 'name' in abiItem && abiItem.name === name;\n });\n if (abiItems.length === 0)\n return undefined;\n if (abiItems.length === 1)\n return abiItems[0];\n let matchedAbiItem;\n for (const abiItem of abiItems) {\n if (!('inputs' in abiItem))\n continue;\n if (!args || args.length === 0) {\n if (!abiItem.inputs || abiItem.inputs.length === 0)\n return abiItem;\n continue;\n }\n if (!abiItem.inputs)\n continue;\n if (abiItem.inputs.length === 0)\n continue;\n if (abiItem.inputs.length !== args.length)\n continue;\n const matched = args.every((arg, index) => {\n const abiParameter = 'inputs' in abiItem && abiItem.inputs[index];\n if (!abiParameter)\n return false;\n return isArgOfType(arg, abiParameter);\n });\n if (matched) {\n // Check for ambiguity against already matched parameters (e.g. `address` vs `bytes20`).\n if (matchedAbiItem &&\n 'inputs' in matchedAbiItem &&\n matchedAbiItem.inputs) {\n const ambiguousTypes = getAmbiguousTypes(abiItem.inputs, matchedAbiItem.inputs, args);\n if (ambiguousTypes)\n throw new AbiItemAmbiguityError({\n abiItem,\n type: ambiguousTypes[0],\n }, {\n abiItem: matchedAbiItem,\n type: ambiguousTypes[1],\n });\n }\n matchedAbiItem = abiItem;\n }\n }\n if (matchedAbiItem)\n return matchedAbiItem;\n return abiItems[0];\n}\n/** @internal */\nexport function isArgOfType(arg, abiParameter) {\n const argType = typeof arg;\n const abiParameterType = abiParameter.type;\n switch (abiParameterType) {\n case 'address':\n return isAddress(arg, { strict: false });\n case 'bool':\n return argType === 'boolean';\n case 'function':\n return argType === 'string';\n case 'string':\n return argType === 'string';\n default: {\n if (abiParameterType === 'tuple' && 'components' in abiParameter)\n return Object.values(abiParameter.components).every((component, index) => {\n return isArgOfType(Object.values(arg)[index], component);\n });\n // `(u)int<M>`: (un)signed integer type of `M` bits, `0 < M <= 256`, `M % 8 == 0`\n // https://regexr.com/6v8hp\n if (/^u?int(8|16|24|32|40|48|56|64|72|80|88|96|104|112|120|128|136|144|152|160|168|176|184|192|200|208|216|224|232|240|248|256)?$/.test(abiParameterType))\n return argType === 'number' || argType === 'bigint';\n // `bytes<M>`: binary type of `M` bytes, `0 < M <= 32`\n // https://regexr.com/6va55\n if (/^bytes([1-9]|1[0-9]|2[0-9]|3[0-2])?$/.test(abiParameterType))\n return argType === 'string' || arg instanceof Uint8Array;\n // fixed-length (`<type>[M]`) and dynamic (`<type>[]`) arrays\n // https://regexr.com/6va6i\n if (/[a-z]+[1-9]{0,3}(\\[[0-9]{0,}\\])+$/.test(abiParameterType)) {\n return (Array.isArray(arg) &&\n arg.every((x) => isArgOfType(x, {\n ...abiParameter,\n // Pop off `[]` or `[M]` from end of type\n type: abiParameterType.replace(/(\\[[0-9]{0,}\\])$/, ''),\n })));\n }\n return false;\n }\n }\n}\n/** @internal */\nexport function getAmbiguousTypes(sourceParameters, targetParameters, args) {\n for (const parameterIndex in sourceParameters) {\n const sourceParameter = sourceParameters[parameterIndex];\n const targetParameter = targetParameters[parameterIndex];\n if (sourceParameter.type === 'tuple' &&\n targetParameter.type === 'tuple' &&\n 'components' in sourceParameter &&\n 'components' in targetParameter)\n return getAmbiguousTypes(sourceParameter.components, targetParameter.components, args[parameterIndex]);\n const types = [sourceParameter.type, targetParameter.type];\n const ambiguous = (() => {\n if (types.includes('address') && types.includes('bytes20'))\n return true;\n if (types.includes('address') && types.includes('string'))\n return isAddress(args[parameterIndex], { strict: false });\n if (types.includes('address') && types.includes('bytes'))\n return isAddress(args[parameterIndex], { strict: false });\n return false;\n })();\n if (ambiguous)\n return types;\n }\n return;\n}\n//# sourceMappingURL=getAbiItem.js.map","import { AbiFunctionNotFoundError, } from '../../errors/abi.js';\nimport { toFunctionSelector, } from '../hash/toFunctionSelector.js';\nimport { formatAbiItem } from './formatAbiItem.js';\nimport { getAbiItem } from './getAbiItem.js';\nconst docsPath = '/docs/contract/encodeFunctionData';\nexport function prepareEncodeFunctionData(parameters) {\n const { abi, args, functionName } = parameters;\n let abiItem = abi[0];\n if (functionName) {\n const item = getAbiItem({\n abi,\n args,\n name: functionName,\n });\n if (!item)\n throw new AbiFunctionNotFoundError(functionName, { docsPath });\n abiItem = item;\n }\n if (abiItem.type !== 'function')\n throw new AbiFunctionNotFoundError(undefined, { docsPath });\n return {\n abi: [abiItem],\n functionName: toFunctionSelector(formatAbiItem(abiItem)),\n };\n}\n//# sourceMappingURL=prepareEncodeFunctionData.js.map","import { concatHex } from '../data/concat.js';\nimport { encodeAbiParameters, } from './encodeAbiParameters.js';\nimport { prepareEncodeFunctionData } from './prepareEncodeFunctionData.js';\nexport function encodeFunctionData(parameters) {\n const { args } = parameters;\n const { abi, functionName } = (() => {\n if (parameters.abi.length === 1 &&\n parameters.functionName?.startsWith('0x'))\n return parameters;\n return prepareEncodeFunctionData(parameters);\n })();\n const abiItem = abi[0];\n const signature = functionName;\n const data = 'inputs' in abiItem && abiItem.inputs\n ? encodeAbiParameters(abiItem.inputs, args ?? [])\n : undefined;\n return concatHex([signature, data ?? '0x']);\n}\n//# sourceMappingURL=encodeFunctionData.js.map","import { BaseError } from './base.js';\nexport class NegativeOffsetError extends BaseError {\n constructor({ offset }) {\n super(`Offset \\`${offset}\\` cannot be negative.`, {\n name: 'NegativeOffsetError',\n });\n }\n}\nexport class PositionOutOfBoundsError extends BaseError {\n constructor({ length, position }) {\n super(`Position \\`${position}\\` is out of bounds (\\`0 < position < ${length}\\`).`, { name: 'PositionOutOfBoundsError' });\n }\n}\nexport class RecursiveReadLimitExceededError extends BaseError {\n constructor({ count, limit }) {\n super(`Recursive read limit of \\`${limit}\\` exceeded (recursive read count: \\`${count}\\`).`, { name: 'RecursiveReadLimitExceededError' });\n }\n}\n//# sourceMappingURL=cursor.js.map","import { NegativeOffsetError, PositionOutOfBoundsError, RecursiveReadLimitExceededError, } from '../errors/cursor.js';\nconst staticCursor = {\n bytes: new Uint8Array(),\n dataView: new DataView(new ArrayBuffer(0)),\n position: 0,\n positionReadCount: new Map(),\n recursiveReadCount: 0,\n recursiveReadLimit: Number.POSITIVE_INFINITY,\n assertReadLimit() {\n if (this.recursiveReadCount >= this.recursiveReadLimit)\n throw new RecursiveReadLimitExceededError({\n count: this.recursiveReadCount + 1,\n limit: this.recursiveReadLimit,\n });\n },\n assertPosition(position) {\n if (position < 0 || position > this.bytes.length - 1)\n throw new PositionOutOfBoundsError({\n length: this.bytes.length,\n position,\n });\n },\n decrementPosition(offset) {\n if (offset < 0)\n throw new NegativeOffsetError({ offset });\n const position = this.position - offset;\n this.assertPosition(position);\n this.position = position;\n },\n getReadCount(position) {\n return this.positionReadCount.get(position || this.position) || 0;\n },\n incrementPosition(offset) {\n if (offset < 0)\n throw new NegativeOffsetError({ offset });\n const position = this.position + offset;\n this.assertPosition(position);\n this.position = position;\n },\n inspectByte(position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position);\n return this.bytes[position];\n },\n inspectBytes(length, position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position + length - 1);\n return this.bytes.subarray(position, position + length);\n },\n inspectUint8(position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position);\n return this.bytes[position];\n },\n inspectUint16(position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position + 1);\n return this.dataView.getUint16(position);\n },\n inspectUint24(position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position + 2);\n return ((this.dataView.getUint16(position) << 8) +\n this.dataView.getUint8(position + 2));\n },\n inspectUint32(position_) {\n const position = position_ ?? this.position;\n this.assertPosition(position + 3);\n return this.dataView.getUint32(position);\n },\n pushByte(byte) {\n this.assertPosition(this.position);\n this.bytes[this.position] = byte;\n this.position++;\n },\n pushBytes(bytes) {\n this.assertPosition(this.position + bytes.length - 1);\n this.bytes.set(bytes, this.position);\n this.position += bytes.length;\n },\n pushUint8(value) {\n this.assertPosition(this.position);\n this.bytes[this.position] = value;\n this.position++;\n },\n pushUint16(value) {\n this.assertPosition(this.position + 1);\n this.dataView.setUint16(this.position, value);\n this.position += 2;\n },\n pushUint24(value) {\n this.assertPosition(this.position + 2);\n this.dataView.setUint16(this.position, value >> 8);\n this.dataView.setUint8(this.position + 2, value & ~4294967040);\n this.position += 3;\n },\n pushUint32(value) {\n this.assertPosition(this.position + 3);\n this.dataView.setUint32(this.position, value);\n this.position += 4;\n },\n readByte() {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectByte();\n this.position++;\n return value;\n },\n readBytes(length, size) {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectBytes(length);\n this.position += size ?? length;\n return value;\n },\n readUint8() {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectUint8();\n this.position += 1;\n return value;\n },\n readUint16() {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectUint16();\n this.position += 2;\n return value;\n },\n readUint24() {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectUint24();\n this.position += 3;\n return value;\n },\n readUint32() {\n this.assertReadLimit();\n this._touch();\n const value = this.inspectUint32();\n this.position += 4;\n return value;\n },\n get remaining() {\n return this.bytes.length - this.position;\n },\n setPosition(position) {\n const oldPosition = this.position;\n this.assertPosition(position);\n this.position = position;\n return () => (this.position = oldPosition);\n },\n _touch() {\n if (this.recursiveReadLimit === Number.POSITIVE_INFINITY)\n return;\n const count = this.getReadCount();\n this.positionReadCount.set(this.position, count + 1);\n if (count > 0)\n this.recursiveReadCount++;\n },\n};\nexport function createCursor(bytes, { recursiveReadLimit = 8_192 } = {}) {\n const cursor = Object.create(staticCursor);\n cursor.bytes = bytes;\n cursor.dataView = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n cursor.positionReadCount = new Map();\n cursor.recursiveReadLimit = recursiveReadLimit;\n return cursor;\n}\n//# sourceMappingURL=cursor.js.map","import { InvalidBytesBooleanError } from '../../errors/encoding.js';\nimport { trim } from '../data/trim.js';\nimport { assertSize, hexToBigInt, hexToNumber, } from './fromHex.js';\nimport { bytesToHex } from './toHex.js';\n/**\n * Decodes a byte array into a UTF-8 string, hex value, number, bigint or boolean.\n *\n * - Docs: https://viem.sh/docs/utilities/fromBytes\n * - Example: https://viem.sh/docs/utilities/fromBytes#usage\n *\n * @param bytes Byte array to decode.\n * @param toOrOpts Type to convert to or options.\n * @returns Decoded value.\n *\n * @example\n * import { fromBytes } from 'viem'\n * const data = fromBytes(new Uint8Array([1, 164]), 'number')\n * // 420\n *\n * @example\n * import { fromBytes } from 'viem'\n * const data = fromBytes(\n * new Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33]),\n * 'string'\n * )\n * // 'Hello world'\n */\nexport function fromBytes(bytes, toOrOpts) {\n const opts = typeof toOrOpts === 'string' ? { to: toOrOpts } : toOrOpts;\n const to = opts.to;\n if (to === 'number')\n return bytesToNumber(bytes, opts);\n if (to === 'bigint')\n return bytesToBigInt(bytes, opts);\n if (to === 'boolean')\n return bytesToBool(bytes, opts);\n if (to === 'string')\n return bytesToString(bytes, opts);\n return bytesToHex(bytes, opts);\n}\n/**\n * Decodes a byte array into a bigint.\n *\n * - Docs: https://viem.sh/docs/utilities/fromBytes#bytestobigint\n *\n * @param bytes Byte array to decode.\n * @param opts Options.\n * @returns BigInt value.\n *\n * @example\n * import { bytesToBigInt } from 'viem'\n * const data = bytesToBigInt(new Uint8Array([1, 164]))\n * // 420n\n */\nexport function bytesToBigInt(bytes, opts = {}) {\n if (typeof opts.size !== 'undefined')\n assertSize(bytes, { size: opts.size });\n const hex = bytesToHex(bytes, opts);\n return hexToBigInt(hex, opts);\n}\n/**\n * Decodes a byte array into a boolean.\n *\n * - Docs: https://viem.sh/docs/utilities/fromBytes#bytestobool\n *\n * @param bytes Byte array to decode.\n * @param opts Options.\n * @returns Boolean value.\n *\n * @example\n * import { bytesToBool } from 'viem'\n * const data = bytesToBool(new Uint8Array([1]))\n * // true\n */\nexport function bytesToBool(bytes_, opts = {}) {\n let bytes = bytes_;\n if (typeof opts.size !== 'undefined') {\n assertSize(bytes, { size: opts.size });\n bytes = trim(bytes);\n }\n if (bytes.length > 1 || bytes[0] > 1)\n throw new InvalidBytesBooleanError(bytes);\n return Boolean(bytes[0]);\n}\n/**\n * Decodes a byte array into a number.\n *\n * - Docs: https://viem.sh/docs/utilities/fromBytes#bytestonumber\n *\n * @param bytes Byte array to decode.\n * @param opts Options.\n * @returns Number value.\n *\n * @example\n * import { bytesToNumber } from 'viem'\n * const data = bytesToNumber(new Uint8Array([1, 164]))\n * // 420\n */\nexport function bytesToNumber(bytes, opts = {}) {\n if (typeof opts.size !== 'undefined')\n assertSize(bytes, { size: opts.size });\n const hex = bytesToHex(bytes, opts);\n return hexToNumber(hex, opts);\n}\n/**\n * Decodes a byte array into a UTF-8 string.\n *\n * - Docs: https://viem.sh/docs/utilities/fromBytes#bytestostring\n *\n * @param bytes Byte array to decode.\n * @param opts Options.\n * @returns String value.\n *\n * @example\n * import { bytesToString } from 'viem'\n * const data = bytesToString(new Uint8Array([72, 101, 108, 108, 111, 32, 87, 111, 114, 108, 100, 33]))\n * // 'Hello world'\n */\nexport function bytesToString(bytes_, opts = {}) {\n let bytes = bytes_;\n if (typeof opts.size !== 'undefined') {\n assertSize(bytes, { size: opts.size });\n bytes = trim(bytes, { dir: 'right' });\n }\n return new TextDecoder().decode(bytes);\n}\n//# sourceMappingURL=fromBytes.js.map","import { AbiDecodingDataSizeTooSmallError, AbiDecodingZeroDataError, InvalidAbiDecodingTypeError, } from '../../errors/abi.js';\nimport { checksumAddress, } from '../address/getAddress.js';\nimport { createCursor, } from '../cursor.js';\nimport { size } from '../data/size.js';\nimport { sliceBytes } from '../data/slice.js';\nimport { trim } from '../data/trim.js';\nimport { bytesToBigInt, bytesToBool, bytesToNumber, bytesToString, } from '../encoding/fromBytes.js';\nimport { hexToBytes } from '../encoding/toBytes.js';\nimport { bytesToHex } from '../encoding/toHex.js';\nimport { getArrayComponents } from './encodeAbiParameters.js';\nexport function decodeAbiParameters(params, data) {\n const bytes = typeof data === 'string' ? hexToBytes(data) : data;\n const cursor = createCursor(bytes);\n if (size(bytes) === 0 && params.length > 0)\n throw new AbiDecodingZeroDataError();\n if (size(data) && size(data) < 32)\n throw new AbiDecodingDataSizeTooSmallError({\n data: typeof data === 'string' ? data : bytesToHex(data),\n params: params,\n size: size(data),\n });\n let consumed = 0;\n const values = [];\n for (let i = 0; i < params.length; ++i) {\n const param = params[i];\n cursor.setPosition(consumed);\n const [data, consumed_] = decodeParameter(cursor, param, {\n staticPosition: 0,\n });\n consumed += consumed_;\n values.push(data);\n }\n return values;\n}\nfunction decodeParameter(cursor, param, { staticPosition }) {\n const arrayComponents = getArrayComponents(param.type);\n if (arrayComponents) {\n const [length, type] = arrayComponents;\n return decodeArray(cursor, { ...param, type }, { length, staticPosition });\n }\n if (param.type === 'tuple')\n return decodeTuple(cursor, param, { staticPosition });\n if (param.type === 'address')\n return decodeAddress(cursor);\n if (param.type === 'bool')\n return decodeBool(cursor);\n if (param.type.startsWith('bytes'))\n return decodeBytes(cursor, param, { staticPosition });\n if (param.type.startsWith('uint') || param.type.startsWith('int'))\n return decodeNumber(cursor, param);\n if (param.type === 'string')\n return decodeString(cursor, { staticPosition });\n throw new InvalidAbiDecodingTypeError(param.type, {\n docsPath: '/docs/contract/decodeAbiParameters',\n });\n}\n////////////////////////////////////////////////////////////////////\n// Type Decoders\nconst sizeOfLength = 32;\nconst sizeOfOffset = 32;\nfunction decodeAddress(cursor) {\n const value = cursor.readBytes(32);\n return [checksumAddress(bytesToHex(sliceBytes(value, -20))), 32];\n}\nfunction decodeArray(cursor, param, { length, staticPosition }) {\n // If the length of the array is not known in advance (dynamic array),\n // this means we will need to wonder off to the pointer and decode.\n if (!length) {\n // Dealing with a dynamic type, so get the offset of the array data.\n const offset = bytesToNumber(cursor.readBytes(sizeOfOffset));\n // Start is the static position of current slot + offset.\n const start = staticPosition + offset;\n const startOfData = start + sizeOfLength;\n // Get the length of the array from the offset.\n cursor.setPosition(start);\n const length = bytesToNumber(cursor.readBytes(sizeOfLength));\n // Check if the array has any dynamic children.\n const dynamicChild = hasDynamicChild(param);\n let consumed = 0;\n const value = [];\n for (let i = 0; i < length; ++i) {\n // If any of the children is dynamic, then all elements will be offset pointer, thus size of one slot (32 bytes).\n // Otherwise, elements will be the size of their encoding (consumed bytes).\n cursor.setPosition(startOfData + (dynamicChild ? i * 32 : consumed));\n const [data, consumed_] = decodeParameter(cursor, param, {\n staticPosition: startOfData,\n });\n consumed += consumed_;\n value.push(data);\n }\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return [value, 32];\n }\n // If the length of the array is known in advance,\n // and the length of an element deeply nested in the array is not known,\n // we need to decode the offset of the array data.\n if (hasDynamicChild(param)) {\n // Dealing with dynamic types, so get the offset of the array data.\n const offset = bytesToNumber(cursor.readBytes(sizeOfOffset));\n // Start is the static position of current slot + offset.\n const start = staticPosition + offset;\n const value = [];\n for (let i = 0; i < length; ++i) {\n // Move cursor along to the next slot (next offset pointer).\n cursor.setPosition(start + i * 32);\n const [data] = decodeParameter(cursor, param, {\n staticPosition: start,\n });\n value.push(data);\n }\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return [value, 32];\n }\n // If the length of the array is known in advance and the array is deeply static,\n // then we can just decode each element in sequence.\n let consumed = 0;\n const value = [];\n for (let i = 0; i < length; ++i) {\n const [data, consumed_] = decodeParameter(cursor, param, {\n staticPosition: staticPosition + consumed,\n });\n consumed += consumed_;\n value.push(data);\n }\n return [value, consumed];\n}\nfunction decodeBool(cursor) {\n return [bytesToBool(cursor.readBytes(32), { size: 32 }), 32];\n}\nfunction decodeBytes(cursor, param, { staticPosition }) {\n const [_, size] = param.type.split('bytes');\n if (!size) {\n // Dealing with dynamic types, so get the offset of the bytes data.\n const offset = bytesToNumber(cursor.readBytes(32));\n // Set position of the cursor to start of bytes data.\n cursor.setPosition(staticPosition + offset);\n const length = bytesToNumber(cursor.readBytes(32));\n // If there is no length, we have zero data.\n if (length === 0) {\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return ['0x', 32];\n }\n const data = cursor.readBytes(length);\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return [bytesToHex(data), 32];\n }\n const value = bytesToHex(cursor.readBytes(Number.parseInt(size, 10), 32));\n return [value, 32];\n}\nfunction decodeNumber(cursor, param) {\n const signed = param.type.startsWith('int');\n const size = Number.parseInt(param.type.split('int')[1] || '256', 10);\n const value = cursor.readBytes(32);\n return [\n size > 48\n ? bytesToBigInt(value, { signed })\n : bytesToNumber(value, { signed }),\n 32,\n ];\n}\nfunction decodeTuple(cursor, param, { staticPosition }) {\n // Tuples can have unnamed components (i.e. they are arrays), so we must\n // determine whether the tuple is named or unnamed. In the case of a named\n // tuple, the value will be an object where each property is the name of the\n // component. In the case of an unnamed tuple, the value will be an array.\n const hasUnnamedChild = param.components.length === 0 || param.components.some(({ name }) => !name);\n // Initialize the value to an object or an array, depending on whether the\n // tuple is named or unnamed.\n const value = hasUnnamedChild ? [] : {};\n let consumed = 0;\n // If the tuple has a dynamic child, we must first decode the offset to the\n // tuple data.\n if (hasDynamicChild(param)) {\n // Dealing with dynamic types, so get the offset of the tuple data.\n const offset = bytesToNumber(cursor.readBytes(sizeOfOffset));\n // Start is the static position of referencing slot + offset.\n const start = staticPosition + offset;\n for (let i = 0; i < param.components.length; ++i) {\n const component = param.components[i];\n cursor.setPosition(start + consumed);\n const [data, consumed_] = decodeParameter(cursor, component, {\n staticPosition: start,\n });\n consumed += consumed_;\n value[hasUnnamedChild ? i : component?.name] = data;\n }\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return [value, 32];\n }\n // If the tuple has static children, we can just decode each component\n // in sequence.\n for (let i = 0; i < param.components.length; ++i) {\n const component = param.components[i];\n const [data, consumed_] = decodeParameter(cursor, component, {\n staticPosition,\n });\n value[hasUnnamedChild ? i : component?.name] = data;\n consumed += consumed_;\n }\n return [value, consumed];\n}\nfunction decodeString(cursor, { staticPosition }) {\n // Get offset to start of string data.\n const offset = bytesToNumber(cursor.readBytes(32));\n // Start is the static position of current slot + offset.\n const start = staticPosition + offset;\n cursor.setPosition(start);\n const length = bytesToNumber(cursor.readBytes(32));\n // If there is no length, we have zero data (empty string).\n if (length === 0) {\n cursor.setPosition(staticPosition + 32);\n return ['', 32];\n }\n const data = cursor.readBytes(length, 32);\n const value = bytesToString(trim(data));\n // As we have gone wondering, restore to the original position + next slot.\n cursor.setPosition(staticPosition + 32);\n return [value, 32];\n}\nfunction hasDynamicChild(param) {\n const { type } = param;\n if (type === 'string')\n return true;\n if (type === 'bytes')\n return true;\n if (type.endsWith('[]'))\n return true;\n if (type === 'tuple')\n return param.components?.some(hasDynamicChild);\n const arrayComponents = getArrayComponents(param.type);\n if (arrayComponents &&\n hasDynamicChild({ ...param, type: arrayComponents[1] }))\n return true;\n return false;\n}\n//# sourceMappingURL=decodeAbiParameters.js.map","import { AbiFunctionNotFoundError, AbiFunctionOutputsNotFoundError, } from '../../errors/abi.js';\nimport { decodeAbiParameters, } from './decodeAbiParameters.js';\nimport { getAbiItem } from './getAbiItem.js';\nconst docsPath = '/docs/contract/decodeFunctionResult';\nexport function decodeFunctionResult(parameters) {\n const { abi, args, functionName, data } = parameters;\n let abiItem = abi[0];\n if (functionName) {\n const item = getAbiItem({ abi, args, name: functionName });\n if (!item)\n throw new AbiFunctionNotFoundError(functionName, { docsPath });\n abiItem = item;\n }\n if (abiItem.type !== 'function')\n throw new AbiFunctionNotFoundError(undefined, { docsPath });\n if (!abiItem.outputs)\n throw new AbiFunctionOutputsNotFoundError(abiItem.name, { docsPath });\n const values = decodeAbiParameters(abiItem.outputs, data);\n if (values && values.length > 1)\n return values;\n if (values && values.length === 1)\n return values[0];\n return undefined;\n}\n//# sourceMappingURL=decodeFunctionResult.js.map","export const entryPoint06Address = '0x5FF137D4b0FDCD49DcA30c7CF57E578a026d2789';\nexport const entryPoint07Address = '0x0000000071727De22E5E9d8BAf0edAc6f37da032';\nexport const entryPoint08Address = '0x4337084D9E255Ff0702461CF8895CE9E3b5Ff108';\nexport const ethAddress = '0xeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee';\nexport const zeroAddress = '0x0000000000000000000000000000000000000000';\n//# sourceMappingURL=address.js.map",null,null,null,null,null,null,null,null,null],"names":["isNumeric","mathceil","Math","ceil","mathfloor","floor","bignumberError","tooManyDigits","BASE","LOG_BASE","MAX_SAFE_INTEGER","POWS_TEN","SQRT_BASE","MAX","bitFloor","n","i","coeffToString","a","s","z","j","length","r","charCodeAt","slice","compare","x","y","b","xc","c","yc","k","e","l","intCheck","min","max","name","Error","String","isOdd","toExponential","str","charAt","toFixedPoint","len","zs","BigNumber","clone","configObject","div","convertBase","parseNumeric","pow2_53","random53bitInt","basePrefix","dotAfter","dotBefore","isInfinityOrNaN","whitespaceOrPlus","P","prototype","constructor","toString","valueOf","ONE","DECIMAL_PLACES","ROUNDING_MODE","TO_EXP_NEG","TO_EXP_POS","MIN_EXP","MAX_EXP","CRYPTO","MODULO_MODE","POW_PRECISION","FORMAT","prefix","groupSize","secondaryGroupSize","groupSeparator","decimalSeparator","fractionGroupSize","fractionGroupSeparator","suffix","ALPHABET","alphabetHasNormalDecimalDigits","v","alphabet","caseChanged","isNum","this","_isBigNumber","test","indexOf","replace","search","substring","round","DEBUG","toUpperCase","toLowerCase","push","format","rm","id","c0","ne","maxOrMin","args","normalise","pop","sd","d","ni","rd","pows10","out","ROUND_UP","ROUND_DOWN","ROUND_CEIL","ROUND_FLOOR","ROUND_HALF_UP","ROUND_HALF_DOWN","ROUND_HALF_EVEN","ROUND_HALF_CEIL","ROUND_HALF_FLOOR","EUCLID","config","set","obj","p","hasOwnProperty","crypto","getRandomValues","randomBytes","EXPONENTIAL_AT","RANGE","isBigNumber","call","maximum","arguments","minimum","random","dp","rand","Uint32Array","copy","splice","sum","plus","decimal","toBaseOut","baseIn","baseOut","arrL","arr","reverse","sign","callerIsToString","pow","concat","multiply","base","m","temp","xlo","xhi","carry","klo","khi","aL","bL","cmp","subtract","more","prod","prodL","q","qc","rem","remL","rem0","xi","xL","yc0","yL","yz","NaN","isNaN","p1","p2","absoluteValue","abs","comparedTo","decimalPlaces","dividedBy","dividedToIntegerBy","idiv","exponentiatedBy","half","isModExp","nIsBig","nIsNeg","nIsOdd","isInteger","mod","times","integerValue","isEqualTo","eq","isFinite","isGreaterThan","gt","isGreaterThanOrEqualTo","gte","isLessThan","lt","isLessThanOrEqualTo","lte","isNegative","isPositive","isZero","minus","t","xLTy","xe","ye","modulo","multipliedBy","xcL","ycL","ylo","yhi","zc","sqrtBase","negated","precision","shiftedBy","squareRoot","sqrt","rep","toFixed","toFormat","split","g1","g2","intPart","fractionPart","isNeg","intDigits","substr","RegExp","toFraction","md","d0","d1","d2","exp","n0","n1","toNumber","toPrecision","toJSON","Symbol","toStringTag","for","tupleRegex","formatAbiParameter","abiParameter","type","components","result","regex","string","match","exec","groups","execTyped","array","indexed","formatAbiParameters","abiParameters","params","formatAbiItem","abiItem","includeName","InvalidDefinitionTypeError","formatAbiParams","inputs","map","param","startsWith","formatAbiParam","join","isHex","value","strict","size","version","errorConfig","docsBaseUrl","docsPath","docsSlug","undefined","BaseError","shortMessage","details","cause","message","docsUrl","super","metaMessages","Object","defineProperty","enumerable","configurable","writable","walk","fn","err","AbiDecodingDataSizeTooSmallError","data","AbiDecodingZeroDataError","AbiEncodingArrayLengthMismatchError","expectedLength","givenLength","AbiEncodingBytesSizeMismatchError","expectedSize","AbiEncodingLengthMismatchError","AbiFunctionNotFoundError","functionName","AbiFunctionOutputsNotFoundError","AbiItemAmbiguityError","InvalidAbiEncodingTypeError","InvalidAbiDecodingTypeError","InvalidArrayError","SliceOffsetOutOfBoundsError","offset","position","SizeExceedsPaddingSizeError","targetSize","pad","hexOrBytes","dir","padHex","bytes","paddedBytes","Uint8Array","padEnd","padBytes","hex_","hex","IntegerOutOfRangeError","signed","InvalidBytesBooleanError","SizeOverflowError","givenSize","maxSize","trim","sliceLength","assertSize","size_","hexToBigInt","opts","BigInt","padStart","hexes","Array","from","_v","boolToHex","Number","bytesToHex","numberToHex","value_","maxValue","minValue","encoder","TextEncoder","stringToHex","encode","toBytes","hexToBytes","numberToBytes","boolToBytes","stringToBytes","charCodeMap","zero","nine","A","F","f","charCodeToBase16","char","hexString","index","nibbleLeft","nibbleRight","U32_MASK64","_32n","fromBig","le","h","anumber","isSafeInteger","abytes","lengths","ArrayBuffer","isView","includes","aexists","instance","checkFinished","destroyed","finished","clean","arrays","fill","byteSwap","word","swap32IfBE","buffer","u","utf8ToBytes","Hash","_0n","_1n","_2n","_7n","_256n","_0x71n","SHA3_PI","SHA3_ROTL","_SHA3_IOTA","R","IOTAS","lst","Ah","Al","SHA3_IOTA_H","SHA3_IOTA_L","rotlH","rotlBH","rotlSH","rotlL","rotlBL","rotlSL","Keccak","blockLen","outputLen","enableXOF","rounds","pos","posOut","state","state32","byteOffset","byteLength","_cloneInto","keccak","B","idx1","idx0","B0","B1","Th","Tl","curH","curL","shift","PI","keccakP","update","take","finish","writeInto","bufferOut","subarray","xofInto","xof","digestInto","aoutput","destroy","digest","to","gen","hashCons","hashC","msg","tmp","create","createHasher","keccak_256","keccak256","to_","toHex","hashSignature","sig","toSignature","def","signature","active","current","level","valid","normalizeSignature","stateMutability","outputs","toSignatureHash","toEventSelector","InvalidAddressError","address","LruMap","Map","get","key","has","delete","firstKey","keys","next","checksumAddressCache","checksumAddress","address_","chainId","hexAddress","hash","addressRegex","isAddressCache","isAddress","options","cacheKey","values","concatHex","concatBytes","reduce","acc","start","end","assertStartOffset","assertEndOffset","sliceHex","sliceBytes","integerRegex","encodeAbiParameters","preparedParams","prepareParam","prepareParams","encodeParams","arrayComponents","getArrayComponents","dynamic","isArray","dynamicChild","preparedParam","encoded","encodeArray","param_","encodeTuple","encodeAddress","encodeBool","encodeNumber","paramSize","bytesSize","parseInt","encodeBytes","hexValue","partsLength","parts","encodeString","staticSize","staticParams","dynamicParams","dynamicSize","matches","toFunctionSelector","getAbiItem","parameters","abi","isSelector","abiItems","filter","matchedAbiItem","every","arg","isArgOfType","ambiguousTypes","getAmbiguousTypes","argType","abiParameterType","component","sourceParameters","targetParameters","parameterIndex","sourceParameter","targetParameter","types","encodeFunctionData","item","prepareEncodeFunctionData","NegativeOffsetError","PositionOutOfBoundsError","RecursiveReadLimitExceededError","count","limit","staticCursor","dataView","DataView","positionReadCount","recursiveReadCount","recursiveReadLimit","POSITIVE_INFINITY","assertReadLimit","assertPosition","decrementPosition","getReadCount","incrementPosition","inspectByte","position_","inspectBytes","inspectUint8","inspectUint16","getUint16","inspectUint24","getUint8","inspectUint32","getUint32","pushByte","byte","pushBytes","pushUint8","pushUint16","setUint16","pushUint24","setUint8","pushUint32","setUint32","readByte","_touch","readBytes","readUint8","readUint16","readUint24","readUint32","remaining","setPosition","oldPosition","bytesToBigInt","bytesToBool","bytes_","Boolean","bytesToNumber","hexToNumber","decodeAbiParameters","cursor","createCursor","consumed","consumed_","decodeParameter","staticPosition","sizeOfOffset","startOfData","sizeOfLength","hasDynamicChild","decodeArray","hasUnnamedChild","some","decodeTuple","decodeAddress","decodeBool","_","decodeBytes","decodeNumber","TextDecoder","decode","bytesToString","decodeString","endsWith","zeroAddress","ensureBigNumber","SwapError","code","captureStackTrace","DEX_INTERFACE","V2","V3","USER_TARGET","ROUTER_TARGET","DEFAULT_PART_COUNT","DEFAULT_TIMEOUT","DEFAULT_API_BASE_URL","DEX_ROUTERS","BITZY_V3","BITZY_V2","AVOCADO_V2","CONTRACT_ADDRESSES","factoryAddress","v3FactoryAddress","v3PositionManagerAddress","v3WalletHelperAddress","routerAddress","aggregatorAddress","otcAddress","memeTokenGenerator","bitzyQueryAddress","wrappedAddress","nativeAddress","gasLimit","LIQUIDITY_SOURCES","enabledSources","getLiquiditySources","getContractAddresses","getDexRouters","DEFAULT_NETWORKS","DEX_ROUTER","API_ENDPOINTS","PATH_V3","ASSET_MINIMUM","ERROR_CODES","INVALID_TOKENS","INVALID_AMOUNT","NETWORK_NOT_SUPPORTED","API_ERROR","QUERY_ERROR","INSUFFICIENT_LIQUIDITY","APIClient","getInstance","console","log","process","env","NEXT_PUBLIC_BITZY_API_KEY","configWithApiKey","headers","resetInstance","request","endpoint","controller","AbortController","timeoutId","setTimeout","abort","timeout","response","fetch","baseUrl","signal","clearTimeout","ok","status","statusText","json","error","originalError","getPathV3","srcToken","dstToken","amountIn","src","dest","amount","typeId","sourceId","query","buildQueryString","method","getAssetMinimum","queries","minimumAmountsCache","clearMinimumAmountsCache","HIGH_VALUE_TOKENS","isHighValueToken","token","networkTokens","addr","getPartCountOffline","defaultPartCount","srcIsHighValue","dstIsHighValue","async","getPartCountOnline","apiBaseUrl","apiKey","fallbackPartCount","minimumData","now","Date","expiresAt","apiClient","success","timestamp","getMinimumAmounts","srcTokenMin","find","dstTokenMin","amountInBN","minimumAmount","warn","getPartCountWithFallback","calculatePriceImpact","swapAmount","pairLiquidity","partCount","Infinity","getOptimalPartCount","maxImpactThreshold","fromTokenAmount","decimals","toTokenAmount","isNativeToken","isWrappedToken","validateTokens","validateAmount","num","calculatePartCount","price","formatError","debounce","func","wait","debouncedFn","cancel","BITZY_QUERY_ABI","internalType","SwapV3Service","fetchRoute","providedPartCount","forcePartCount","getPartCount","isSrcNative","isDstNative","isWrap","amountOutBN","routes","lpAddress","fromToken","toToken","part","amountAfterFee","dexInterface","distributions","amountOutRoutes","amountInParts","isAmountOutError","usingSrcToken","usingDstToken","pathData","hops","validPath","encodedRoutes","publicClient","encodedRoutesLength","gas","gasPrice","decoded","decodeFunctionResult","splitRouteData","amountOut","distributionsRaw","distribution","path","source","pool","fee","contractError","am","getSupportedNetworks","getNetworkConfig","fetchSwapRoute","networkConfig","fetchBatchSwapRoutes","swaps","Promise","allSettled","reason","getSwapQuote","fetchSwapRouteSimple","useSwapV3Routes","defaultHeaders","useMemo","defaultAddressConfig","addressConfig","refreshInterval","configTypes","configEnabledSources","useOnlinePartCount","defaultLiquiditySources","useEffect","setAmountOutBN","useState","setRoutes","setDistributions","setAmountOutRoutes","setAmountInParts","isLoading","setIsLoading","setIsAmountOutError","setIsWrap","isFirstFetch","setIsFirstFetch","setError","onlinePartCount","setOnlinePartCount","onlinePartCountValue","fetchOnlinePartCount","swapService","defaultAddresses","finalAddressConfig","clearError","useCallback","errorMessage","debouncedFetchRoute","intervalId","setInterval","clearInterval"],"mappings":"8EAgDA,IACEA,EAAY,6CACZC,EAAWC,KAAKC,KAChBC,EAAYF,KAAKG,MAEjBC,EAAiB,qBACjBC,EAAgBD,EAAiB,yDAEjCE,EAAO,KACPC,EAAW,GACXC,EAAmB,iBAEnBC,EAAW,CAAC,EAAG,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,MAC7EC,EAAY,IAKZC,EAAM,IA0pFR,SAASC,EAASC,GAChB,IAAIC,EAAQ,EAAJD,EACR,OAAOA,EAAI,GAAKA,IAAMC,EAAIA,EAAIA,EAAI,CACpC,CAIA,SAASC,EAAcC,GAMrB,IALA,IAAIC,EAAGC,EACLJ,EAAI,EACJK,EAAIH,EAAEI,OACNC,EAAIL,EAAE,GAAK,GAENF,EAAIK,GAAI,CAGb,IAFAF,EAAID,EAAEF,KAAO,GACbI,EAAIX,EAAWU,EAAEG,OACVF,IAAKD,EAAI,IAAMA,GACtBI,GAAKJ,CACP,CAGA,IAAKE,EAAIE,EAAED,OAA8B,KAAtBC,EAAEC,aAAaH,KAElC,OAAOE,EAAEE,MAAM,EAAGJ,EAAI,GAAK,EAC7B,CAIA,SAASK,EAAQC,EAAGC,GAClB,IAAIV,EAAGW,EACLC,EAAKH,EAAEI,EACPC,EAAKJ,EAAEG,EACPf,EAAIW,EAAER,EACNE,EAAIO,EAAET,EACNc,EAAIN,EAAEO,EACNC,EAAIP,EAAEM,EAGR,IAAKlB,IAAMK,EAAG,OAAO,KAMrB,GAJAH,EAAIY,IAAOA,EAAG,GACdD,EAAIG,IAAOA,EAAG,GAGVd,GAAKW,EAAG,OAAOX,EAAIW,EAAI,GAAKR,EAAIL,EAGpC,GAAIA,GAAKK,EAAG,OAAOL,EAMnB,GAJAE,EAAIF,EAAI,EACRa,EAAII,GAAKE,GAGJL,IAAOE,EAAI,OAAOH,EAAI,GAAKC,EAAKZ,EAAI,KAGzC,IAAKW,EAAG,OAAOI,EAAIE,EAAIjB,EAAI,KAK3B,IAHAG,GAAKY,EAAIH,EAAGR,SAAWa,EAAIH,EAAGV,QAAUW,EAAIE,EAGvCnB,EAAI,EAAGA,EAAIK,EAAGL,IAAK,GAAIc,EAAGd,IAAMgB,EAAGhB,GAAI,OAAOc,EAAGd,GAAKgB,EAAGhB,GAAKE,EAAI,KAGvE,OAAOe,GAAKE,EAAI,EAAIF,EAAIE,EAAIjB,EAAI,IAClC,CAMA,SAASkB,EAASrB,EAAGsB,EAAKC,EAAKC,GAC7B,GAAIxB,EAAIsB,GAAOtB,EAAIuB,GAAOvB,IAAMX,EAAUW,GACxC,MAAMyB,MACJlC,GAAkBiC,GAAQ,aAA2B,iBAALxB,EAC7CA,EAAIsB,GAAOtB,EAAIuB,EAAM,kBAAoB,oBACzC,6BAA+BG,OAAO1B,GAE/C,CAIA,SAAS2B,EAAM3B,GACb,IAAIkB,EAAIlB,EAAEgB,EAAET,OAAS,EACrB,OAAOR,EAASC,EAAEmB,EAAIzB,IAAawB,GAAKlB,EAAEgB,EAAEE,GAAK,GAAK,CACxD,CAGA,SAASU,EAAcC,EAAKV,GAC1B,OAAQU,EAAItB,OAAS,EAAIsB,EAAIC,OAAO,GAAK,IAAMD,EAAInB,MAAM,GAAKmB,IAC5DV,EAAI,EAAI,IAAM,MAAQA,CAC1B,CAGA,SAASY,EAAaF,EAAKV,EAAGd,GAC5B,IAAI2B,EAAKC,EAGT,GAAId,EAAI,EAAG,CAGT,IAAKc,EAAK5B,EAAI,MAAOc,EAAGc,GAAM5B,GAC9BwB,EAAMI,EAAKJ,CAGb,MAIE,KAAMV,GAHNa,EAAMH,EAAItB,QAGK,CACb,IAAK0B,EAAK5B,EAAGc,GAAKa,IAAOb,EAAGc,GAAM5B,GAClCwB,GAAOI,CACT,MAAWd,EAAIa,IACbH,EAAMA,EAAInB,MAAM,EAAGS,GAAK,IAAMU,EAAInB,MAAMS,IAI5C,OAAOU,CACT,CAMO,IAAIK,EAhxFX,SAASC,EAAMC,GACb,IAAIC,EAAKC,EAAaC,EA4kBhBC,EAMAC,EAoqBAC,EACFC,EACAC,EACAC,EACAC,EAzvCFC,EAAIb,EAAUc,UAAY,CAAEC,YAAaf,EAAWgB,SAAU,KAAMC,QAAS,MAC7EC,EAAM,IAAIlB,EAAU,GAUpBmB,EAAiB,GAajBC,EAAgB,EAMhBC,GAAa,EAIbC,EAAa,GAMbC,GAAU,IAKVC,EAAU,IAGVC,GAAS,EAkBTC,EAAc,EAIdC,EAAgB,EAGhBC,EAAS,CACPC,OAAQ,GACRC,UAAW,EACXC,mBAAoB,EACpBC,eAAgB,IAChBC,iBAAkB,IAClBC,kBAAmB,EACnBC,uBAAwB,IACxBC,OAAQ,IAMVC,EAAW,uCACXC,GAAiC,EAgBnC,SAAStC,EAAUuC,EAAG3D,GACpB,IAAI4D,EAAU1D,EAAG2D,EAAaxD,EAAGlB,EAAG2E,EAAO5C,EAAKH,EAC9CjB,EAAIiE,KAGN,KAAMjE,aAAasB,GAAY,OAAO,IAAIA,EAAUuC,EAAG3D,GAEvD,GAAS,MAALA,EAAW,CAEb,GAAI2D,IAAwB,IAAnBA,EAAEK,aAYT,OAXAlE,EAAER,EAAIqE,EAAErE,QAEHqE,EAAEzD,GAAKyD,EAAEtD,EAAIuC,EAChB9C,EAAEI,EAAIJ,EAAEO,EAAI,KACHsD,EAAEtD,EAAIsC,EACf7C,EAAEI,EAAI,CAACJ,EAAEO,EAAI,IAEbP,EAAEO,EAAIsD,EAAEtD,EACRP,EAAEI,EAAIyD,EAAEzD,EAAEN,UAMd,IAAKkE,EAAoB,iBAALH,IAAsB,EAAJA,GAAS,EAAG,CAMhD,GAHA7D,EAAER,EAAI,EAAIqE,EAAI,GAAKA,GAAKA,GAAG,GAAM,EAG7BA,MAAQA,EAAG,CACb,IAAKtD,EAAI,EAAGlB,EAAIwE,EAAGxE,GAAK,GAAIA,GAAK,GAAIkB,KASrC,YAPIA,EAAIuC,EACN9C,EAAEI,EAAIJ,EAAEO,EAAI,MAEZP,EAAEO,EAAIA,EACNP,EAAEI,EAAI,CAACyD,IAIX,CAEA5C,EAAMH,OAAO+C,EACf,KAAO,CAEL,IAAKxF,EAAU8F,KAAKlD,EAAMH,OAAO+C,IAAK,OAAOlC,EAAa3B,EAAGiB,EAAK+C,GAElEhE,EAAER,EAAyB,IAArByB,EAAIpB,WAAW,IAAYoB,EAAMA,EAAInB,MAAM,IAAI,GAAM,CAC7D,EAGKS,EAAIU,EAAImD,QAAQ,WAAYnD,EAAMA,EAAIoD,QAAQ,IAAK,MAGnDhF,EAAI4B,EAAIqD,OAAO,OAAS,GAGvB/D,EAAI,IAAGA,EAAIlB,GACfkB,IAAMU,EAAInB,MAAMT,EAAI,GACpB4B,EAAMA,EAAIsD,UAAU,EAAGlF,IACdkB,EAAI,IAGbA,EAAIU,EAAItB,OAGZ,KAAO,CAOL,GAJAc,EAASP,EAAG,EAAGyD,EAAShE,OAAQ,QAIvB,IAALO,GAAW0D,EAEb,OAAOY,EADPxE,EAAI,IAAIsB,EAAUuC,GACFpB,EAAiBzC,EAAEO,EAAI,EAAGmC,GAK5C,GAFAzB,EAAMH,OAAO+C,GAETG,EAAoB,iBAALH,EAAe,CAGhC,GAAQ,EAAJA,GAAS,EAAG,OAAOlC,EAAa3B,EAAGiB,EAAK+C,EAAO9D,GAKnD,GAHAF,EAAER,EAAI,EAAIqE,EAAI,GAAK5C,EAAMA,EAAInB,MAAM,IAAI,GAAM,EAGzCwB,EAAUmD,OAASxD,EAAIoD,QAAQ,YAAa,IAAI1E,OAAS,GAC3D,MAAMkB,MACJjC,EAAgBiF,EAEtB,MACE7D,EAAER,EAA0B,KAAtByB,EAAIpB,WAAW,IAAaoB,EAAMA,EAAInB,MAAM,IAAI,GAAM,EAQ9D,IALAgE,EAAWH,EAAS7D,MAAM,EAAGI,GAC7BK,EAAIlB,EAAI,EAIH+B,EAAMH,EAAItB,OAAQN,EAAI+B,EAAK/B,IAC9B,GAAIyE,EAASM,QAAQhE,EAAIa,EAAIC,OAAO7B,IAAM,EAAG,CAC3C,GAAS,KAALe,GAGF,GAAIf,EAAIkB,EAAG,CACTA,EAAIa,EACJ,QACF,OACK,IAAK2C,IAGN9C,GAAOA,EAAIyD,gBAAkBzD,EAAMA,EAAI0D,gBACvC1D,GAAOA,EAAI0D,gBAAkB1D,EAAMA,EAAIyD,gBAAgB,CACzDX,GAAc,EACd1E,GAAI,EACJkB,EAAI,EACJ,QACF,CAGF,OAAOoB,EAAa3B,EAAGc,OAAO+C,GAAIG,EAAO9D,EAC3C,CAIF8D,GAAQ,GAIHzD,GAHLU,EAAMS,EAAYT,EAAKf,EAAG,GAAIF,EAAER,IAGnB4E,QAAQ,SAAYnD,EAAMA,EAAIoD,QAAQ,IAAK,IACnD9D,EAAIU,EAAItB,MACf,CAGA,IAAKN,EAAI,EAAyB,KAAtB4B,EAAIpB,WAAWR,GAAWA,KAGtC,IAAK+B,EAAMH,EAAItB,OAAkC,KAA1BsB,EAAIpB,aAAauB,KAExC,GAAIH,EAAMA,EAAInB,MAAMT,IAAK+B,GAAM,CAI7B,GAHAA,GAAO/B,EAGH2E,GAAS1C,EAAUmD,OACrBrD,EAAM,KAAOyC,EAAI9E,GAAoB8E,IAAMpF,EAAUoF,IACnD,MAAMhD,MACJjC,EAAiBoB,EAAER,EAAIqE,GAI7B,IAAKtD,EAAIA,EAAIlB,EAAI,GAAKyD,EAGpB9C,EAAEI,EAAIJ,EAAEO,EAAI,UAGP,GAAIA,EAAIsC,EAGb7C,EAAEI,EAAI,CAACJ,EAAEO,EAAI,OACR,CAWL,GAVAP,EAAEO,EAAIA,EACNP,EAAEI,EAAI,GAMNf,GAAKkB,EAAI,GAAKzB,EACVyB,EAAI,IAAGlB,GAAKP,GAEZO,EAAI+B,EAAK,CAGX,IAFI/B,GAAGW,EAAEI,EAAEwE,MAAM3D,EAAInB,MAAM,EAAGT,IAEzB+B,GAAOtC,EAAUO,EAAI+B,GACxBpB,EAAEI,EAAEwE,MAAM3D,EAAInB,MAAMT,EAAGA,GAAKP,IAG9BO,EAAIP,GAAYmC,EAAMA,EAAInB,MAAMT,IAAIM,MACtC,MACEN,GAAK+B,EAGP,KAAO/B,IAAK4B,GAAO,KACnBjB,EAAEI,EAAEwE,MAAM3D,EACZ,CACF,MAGEjB,EAAEI,EAAI,CAACJ,EAAEO,EAAI,EAEjB,CA21BA,SAASsE,EAAOzF,EAAGC,EAAGyF,EAAIC,GACxB,IAAIC,EAAIzE,EAAG0E,EAAI7D,EAAKH,EAKpB,GAHU,MAAN6D,EAAYA,EAAKpC,EAChBjC,EAASqE,EAAI,EAAG,IAEhB1F,EAAEgB,EAAG,OAAOhB,EAAEkD,WAKnB,GAHA0C,EAAK5F,EAAEgB,EAAE,GACT6E,EAAK7F,EAAEmB,EAEE,MAALlB,EACF4B,EAAM3B,EAAcF,EAAEgB,GACtBa,EAAY,GAAN8D,GAAiB,GAANA,IAAYE,GAAMtC,GAAcsC,GAAMrC,GACpD5B,EAAcC,EAAKgE,GACnB9D,EAAaF,EAAKgE,EAAI,UAezB,GAVA1E,GAHAnB,EAAIoF,EAAM,IAAIlD,EAAUlC,GAAIC,EAAGyF,IAGzBvE,EAGNa,GADAH,EAAM3B,EAAcF,EAAEgB,IACZT,OAOA,GAANoF,GAAiB,GAANA,IAAY1F,GAAKkB,GAAKA,GAAKoC,GAAa,CAGrD,KAAOvB,EAAM/B,EAAG4B,GAAO,IAAKG,KAC5BH,EAAMD,EAAcC,EAAKV,EAG3B,MAKE,GAJAlB,GAAK4F,GAAa,IAAPF,GAAYxE,EAAI0E,GAC3BhE,EAAME,EAAaF,EAAKV,EAAG,KAGvBA,EAAI,EAAIa,GACV,KAAM/B,EAAI,EAAG,IAAK4B,GAAO,IAAK5B,IAAK4B,GAAO,WAG1C,IADA5B,GAAKkB,EAAIa,GACD,EAEN,IADIb,EAAI,GAAKa,IAAKH,GAAO,KAClB5B,IAAK4B,GAAO,KAM3B,OAAO7B,EAAEI,EAAI,GAAKwF,EAAK,IAAM/D,EAAMA,CACrC,CAKA,SAASiE,EAASC,EAAM/F,GAKtB,IAJA,IAAIkB,EAAGL,EACLZ,EAAI,EACJW,EAAI,IAAIsB,EAAU6D,EAAK,IAElB9F,EAAI8F,EAAKxF,OAAQN,OACtBY,EAAI,IAAIqB,EAAU6D,EAAK9F,KAChBG,IAAMc,EAAIP,EAAQC,EAAGC,MAAQb,GAAW,IAANkB,GAAWN,EAAER,IAAMJ,KAC1DY,EAAIC,GAIR,OAAOD,CACT,CAOA,SAASoF,EAAUhG,EAAGgB,EAAGG,GAKvB,IAJA,IAAIlB,EAAI,EACNK,EAAIU,EAAET,QAGAS,IAAIV,GAAIU,EAAEiF,OAGlB,IAAK3F,EAAIU,EAAE,GAAIV,GAAK,GAAIA,GAAK,GAAIL,KAkBjC,OAfKkB,EAAIlB,EAAIkB,EAAIzB,EAAW,GAAKgE,EAG/B1D,EAAEgB,EAAIhB,EAAEmB,EAAI,KAGHA,EAAIsC,EAGbzD,EAAEgB,EAAI,CAAChB,EAAEmB,EAAI,IAEbnB,EAAEmB,EAAIA,EACNnB,EAAEgB,EAAIA,GAGDhB,CACT,CAyDA,SAASoF,EAAMxE,EAAGsF,EAAIR,EAAIlF,GACxB,IAAI2F,EAAGlG,EAAGK,EAAGY,EAAGlB,EAAGoG,EAAIC,EACrBtF,EAAKH,EAAEI,EACPsF,EAAS1G,EAGX,GAAImB,EAAI,CAQNwF,EAAK,CAGH,IAAKJ,EAAI,EAAGjF,EAAIH,EAAG,GAAIG,GAAK,GAAIA,GAAK,GAAIiF,KAIzC,IAHAlG,EAAIiG,EAAKC,GAGD,EACNlG,GAAKP,EACLY,EAAI4F,EACJlG,EAAIe,EAAGqF,EAAK,GAGZC,EAAKhH,EAAUW,EAAIsG,EAAOH,EAAI7F,EAAI,GAAK,SAIvC,IAFA8F,EAAKlH,GAAUe,EAAI,GAAKP,KAEdqB,EAAGR,OAAQ,CAEnB,IAAIC,EASF,MAAM+F,EANN,KAAOxF,EAAGR,QAAU6F,EAAIrF,EAAGyE,KAAK,IAChCxF,EAAIqG,EAAK,EACTF,EAAI,EAEJ7F,GADAL,GAAKP,GACGA,EAAW,CAIvB,KAAO,CAIL,IAHAM,EAAIkB,EAAIH,EAAGqF,GAGND,EAAI,EAAGjF,GAAK,GAAIA,GAAK,GAAIiF,KAU9BE,GAHA/F,GAJAL,GAAKP,GAIGA,EAAWyG,GAGV,EAAI,EAAI9G,EAAUW,EAAIsG,EAAOH,EAAI7F,EAAI,GAAK,GACrD,CAkBF,GAfAE,EAAIA,GAAK0F,EAAK,GAKC,MAAdnF,EAAGqF,EAAK,KAAe9F,EAAI,EAAIN,EAAIA,EAAIsG,EAAOH,EAAI7F,EAAI,IAEvDE,EAAIkF,EAAK,GACLW,GAAM7F,KAAa,GAANkF,GAAWA,IAAO9E,EAAER,EAAI,EAAI,EAAI,IAC9CiG,EAAK,GAAW,GAANA,IAAkB,GAANX,GAAWlF,GAAW,GAANkF,IAGrCzF,EAAI,EAAIK,EAAI,EAAIN,EAAIsG,EAAOH,EAAI7F,GAAK,EAAIS,EAAGqF,EAAK,IAAM,GAAM,GAC7DV,IAAO9E,EAAER,EAAI,EAAI,EAAI,IAEpB8F,EAAK,IAAMnF,EAAG,GAiBhB,OAhBAA,EAAGR,OAAS,EAERC,GAGF0F,GAAMtF,EAAEO,EAAI,EAGZJ,EAAG,GAAKuF,GAAQ5G,EAAWwG,EAAKxG,GAAYA,GAC5CkB,EAAEO,GAAK+E,GAAM,GAIbnF,EAAG,GAAKH,EAAEO,EAAI,EAGTP,EAkBT,GAdS,GAALX,GACFc,EAAGR,OAAS6F,EACZlF,EAAI,EACJkF,MAEArF,EAAGR,OAAS6F,EAAK,EACjBlF,EAAIoF,EAAO5G,EAAWO,GAItBc,EAAGqF,GAAM9F,EAAI,EAAIjB,EAAUW,EAAIsG,EAAOH,EAAI7F,GAAKgG,EAAOhG,IAAMY,EAAI,GAI9DV,EAEF,OAAU,CAGR,GAAU,GAAN4F,EAAS,CAGX,IAAKnG,EAAI,EAAGK,EAAIS,EAAG,GAAIT,GAAK,GAAIA,GAAK,GAAIL,KAEzC,IADAK,EAAIS,EAAG,IAAMG,EACRA,EAAI,EAAGZ,GAAK,GAAIA,GAAK,GAAIY,KAG1BjB,GAAKiB,IACPN,EAAEO,IACEJ,EAAG,IAAMtB,IAAMsB,EAAG,GAAK,IAG7B,KACF,CAEE,GADAA,EAAGqF,IAAOlF,EACNH,EAAGqF,IAAO3G,EAAM,MACpBsB,EAAGqF,KAAQ,EACXlF,EAAI,CAER,CAIF,IAAKjB,EAAIc,EAAGR,OAAoB,IAAZQ,IAAKd,GAAUc,EAAGkF,OACxC,CAGIrF,EAAEO,EAAIuC,EACR9C,EAAEI,EAAIJ,EAAEO,EAAI,KAGHP,EAAEO,EAAIsC,IACf7C,EAAEI,EAAI,CAACJ,EAAEO,EAAI,GAEjB,CAEA,OAAOP,CACT,CAGA,SAASuC,EAAQnD,GACf,IAAI6B,EACFV,EAAInB,EAAEmB,EAER,OAAU,OAANA,EAAmBnB,EAAEkD,YAEzBrB,EAAM3B,EAAcF,EAAEgB,GAEtBa,EAAMV,GAAKoC,GAAcpC,GAAKqC,EAC1B5B,EAAcC,EAAKV,GACnBY,EAAaF,EAAKV,EAAG,KAElBnB,EAAEI,EAAI,EAAI,IAAMyB,EAAMA,EAC/B,CAorCA,OAx1EAK,EAAUC,MAAQA,EAElBD,EAAUsE,SAAW,EACrBtE,EAAUuE,WAAa,EACvBvE,EAAUwE,WAAa,EACvBxE,EAAUyE,YAAc,EACxBzE,EAAU0E,cAAgB,EAC1B1E,EAAU2E,gBAAkB,EAC5B3E,EAAU4E,gBAAkB,EAC5B5E,EAAU6E,gBAAkB,EAC5B7E,EAAU8E,iBAAmB,EAC7B9E,EAAU+E,OAAS,EAqCnB/E,EAAUgF,OAAShF,EAAUiF,IAAM,SAAUC,GAC3C,IAAIC,EAAG5C,EAEP,GAAW,MAAP2C,EAAa,CAEf,GAAkB,iBAAPA,EA4HT,MAAM3F,MACJlC,EAAiB,oBAAsB6H,GAvFzC,GAlCIA,EAAIE,eAAeD,EAAI,oBAEzBhG,EADAoD,EAAI2C,EAAIC,GACI,EAAGvH,EAAKuH,GACpBhE,EAAiBoB,GAKf2C,EAAIE,eAAeD,EAAI,mBAEzBhG,EADAoD,EAAI2C,EAAIC,GACI,EAAG,EAAGA,GAClB/D,EAAgBmB,GAOd2C,EAAIE,eAAeD,EAAI,qBACzB5C,EAAI2C,EAAIC,KACC5C,EAAEwB,KACT5E,EAASoD,EAAE,IAAK3E,EAAK,EAAGuH,GACxBhG,EAASoD,EAAE,GAAI,EAAG3E,EAAKuH,GACvB9D,EAAakB,EAAE,GACfjB,EAAaiB,EAAE,KAEfpD,EAASoD,GAAI3E,EAAKA,EAAKuH,GACvB9D,IAAeC,EAAaiB,EAAI,GAAKA,EAAIA,KAOzC2C,EAAIE,eAAeD,EAAI,SAEzB,IADA5C,EAAI2C,EAAIC,KACC5C,EAAEwB,IACT5E,EAASoD,EAAE,IAAK3E,GAAK,EAAIuH,GACzBhG,EAASoD,EAAE,GAAI,EAAG3E,EAAKuH,GACvB5D,EAAUgB,EAAE,GACZf,EAAUe,EAAE,OACP,CAEL,GADApD,EAASoD,GAAI3E,EAAKA,EAAKuH,IACnB5C,EAGF,MAAMhD,MACJlC,EAAiB8H,EAAI,oBAAsB5C,GAH7ChB,IAAYC,EAAUe,EAAI,GAAKA,EAAIA,EAKvC,CAMF,GAAI2C,EAAIE,eAAeD,EAAI,UAAW,CAEpC,IADA5C,EAAI2C,EAAIC,QACI5C,EAcV,MAAMhD,MACJlC,EAAiB8H,EAAI,uBAAyB5C,GAdhD,GAAIA,EAAG,CACL,GAAqB,oBAAV8C,SAAyBA,SAClCA,OAAOC,kBAAmBD,OAAOE,YAIjC,MADA9D,GAAUc,EACJhD,MACJlC,EAAiB,sBAJnBoE,EAASc,CAMb,MACEd,EAASc,CAMf,CAoBA,GAhBI2C,EAAIE,eAAeD,EAAI,iBAEzBhG,EADAoD,EAAI2C,EAAIC,GACI,EAAG,EAAGA,GAClBzD,EAAca,GAKZ2C,EAAIE,eAAeD,EAAI,mBAEzBhG,EADAoD,EAAI2C,EAAIC,GACI,EAAGvH,EAAKuH,GACpBxD,EAAgBY,GAKd2C,EAAIE,eAAeD,EAAI,UAAW,CAEpC,GAAgB,iBADhB5C,EAAI2C,EAAIC,IAEH,MAAM5F,MACTlC,EAAiB8H,EAAI,mBAAqB5C,GAFlBX,EAASW,CAGrC,CAIA,GAAI2C,EAAIE,eAAeD,EAAI,YAAa,CAKtC,GAAgB,iBAJhB5C,EAAI2C,EAAIC,KAIqB,wBAAwBtC,KAAKN,GAIxD,MAAMhD,MACJlC,EAAiB8H,EAAI,aAAe5C,GAJtCD,EAAmD,cAAlBC,EAAE/D,MAAM,EAAG,IAC5C6D,EAAWE,CAKf,CAQJ,CAEA,MAAO,CACLpB,eAAgBA,EAChBC,cAAeA,EACfoE,eAAgB,CAACnE,EAAYC,GAC7BmE,MAAO,CAAClE,EAASC,GACjBC,OAAQA,EACRC,YAAaA,EACbC,cAAeA,EACfC,OAAQA,EACRS,SAAUA,EAEd,EAYArC,EAAU0F,YAAc,SAAUnD,GAChC,IAAKA,IAAwB,IAAnBA,EAAEK,aAAuB,OAAO,EAC1C,IAAK5C,EAAUmD,MAAO,OAAO,EAE7B,IAAIpF,EAAGD,EACLgB,EAAIyD,EAAEzD,EACNG,EAAIsD,EAAEtD,EACNf,EAAIqE,EAAErE,EAERmG,EAAK,GAA2B,kBAAvB,CAAA,EAAGrD,SAAS2E,KAAK7G,IAExB,IAAW,IAANZ,IAAiB,IAANA,IAAae,IAAMrB,GAAOqB,GAAKrB,GAAOqB,IAAM9B,EAAU8B,GAAI,CAGxE,GAAa,IAATH,EAAE,GAAU,CACd,GAAU,IAANG,GAAwB,IAAbH,EAAET,OAAc,OAAO,EACtC,MAAMgG,CACR,CAQA,IALAtG,GAAKkB,EAAI,GAAKzB,GACN,IAAGO,GAAKP,GAIZgC,OAAOV,EAAE,IAAIT,QAAUN,EAAG,CAE5B,IAAKA,EAAI,EAAGA,EAAIe,EAAET,OAAQN,IAExB,IADAD,EAAIgB,EAAEf,IACE,GAAKD,GAAKP,GAAQO,IAAMX,EAAUW,GAAI,MAAMuG,EAItD,GAAU,IAANvG,EAAS,OAAO,CACtB,CACF,OAGK,GAAU,OAANgB,GAAoB,OAANG,IAAqB,OAANf,GAAoB,IAANA,IAAiB,IAANA,GAC/D,OAAO,EAGT,MAAMqB,MACHlC,EAAiB,sBAAwBkF,EAC9C,EAQAvC,EAAU4F,QAAU5F,EAAUX,IAAM,WAClC,OAAOuE,EAASiC,WAAW,EAC7B,EAQA7F,EAAU8F,QAAU9F,EAAUZ,IAAM,WAClC,OAAOwE,EAASiC,UAAW,EAC7B,EAaA7F,EAAU+F,QACJzF,EAAU,iBAMVC,EAAkBtD,KAAK8I,SAAWzF,EAAW,QAC9C,WAAc,OAAOnD,EAAUF,KAAK8I,SAAWzF,EAAU,EACzD,WAAc,OAA2C,SAAlB,WAAhBrD,KAAK8I,SAAwB,IACnC,QAAhB9I,KAAK8I,SAAsB,EAAI,EAE5B,SAAUC,GACf,IAAI/H,EAAGW,EAAGK,EAAGD,EAAGuD,EACdxE,EAAI,EACJe,EAAI,GACJmH,EAAO,IAAIjG,EAAUkB,GAOvB,GALU,MAAN8E,EAAYA,EAAK7E,EAChBhC,EAAS6G,EAAI,EAAGpI,GAErBoB,EAAIhC,EAASgJ,EAAKxI,GAEdiE,EAGF,GAAI4D,OAAOC,gBAAiB,CAI1B,IAFArH,EAAIoH,OAAOC,gBAAgB,IAAIY,YAAYlH,GAAK,IAEzCjB,EAAIiB,IAQTuD,EAAW,OAAPtE,EAAEF,IAAgBE,EAAEF,EAAI,KAAO,MAM1B,MACPa,EAAIyG,OAAOC,gBAAgB,IAAIY,YAAY,IAC3CjI,EAAEF,GAAKa,EAAE,GACTX,EAAEF,EAAI,GAAKa,EAAE,KAKbE,EAAEwE,KAAKf,EAAI,MACXxE,GAAK,GAGTA,EAAIiB,EAAI,CAGV,KAAO,KAAIqG,OAAOE,YA2BhB,MADA9D,GAAS,EACHlC,MACJlC,EAAiB,sBAvBnB,IAFAY,EAAIoH,OAAOE,YAAYvG,GAAK,GAErBjB,EAAIiB,IAMTuD,EAAmB,iBAAN,GAAPtE,EAAEF,IAA0C,cAAXE,EAAEF,EAAI,GAC9B,WAAXE,EAAEF,EAAI,GAAgC,SAAXE,EAAEF,EAAI,IACjCE,EAAEF,EAAI,IAAM,KAAOE,EAAEF,EAAI,IAAM,GAAKE,EAAEF,EAAI,KAErC,KACPsH,OAAOE,YAAY,GAAGY,KAAKlI,EAAGF,IAI9Be,EAAEwE,KAAKf,EAAI,MACXxE,GAAK,GAGTA,EAAIiB,EAAI,CAKV,CAIF,IAAKyC,EAEH,KAAO1D,EAAIiB,IACTuD,EAAIhC,KACI,OAAMzB,EAAEf,KAAOwE,EAAI,MAc/B,IAVAvD,EAAIF,IAAIf,GACRiI,GAAMxI,EAGFwB,GAAKgH,IACPzD,EAAI7E,EAASF,EAAWwI,GACxBlH,EAAEf,GAAKZ,EAAU6B,EAAIuD,GAAKA,GAIZ,IAATzD,EAAEf,GAAUe,EAAEiF,MAAOhG,KAG5B,GAAIA,EAAI,EACNe,EAAI,CAACG,EAAI,OACJ,CAGL,IAAKA,GAAI,EAAc,IAATH,EAAE,GAAUA,EAAEsH,OAAO,EAAG,GAAInH,GAAKzB,GAG/C,IAAKO,EAAI,EAAGwE,EAAIzD,EAAE,GAAIyD,GAAK,GAAIA,GAAK,GAAIxE,KAGpCA,EAAIP,IAAUyB,GAAKzB,EAAWO,EACpC,CAIA,OAFAkI,EAAKhH,EAAIA,EACTgH,EAAKnH,EAAIA,EACFmH,CACT,GASFjG,EAAUqG,IAAM,WAId,IAHA,IAAItI,EAAI,EACN8F,EAAOgC,UACPQ,EAAM,IAAIrG,EAAU6D,EAAK,IACpB9F,EAAI8F,EAAKxF,QAASgI,EAAMA,EAAIC,KAAKzC,EAAK9F,MAC7C,OAAOsI,CACT,EAOAjG,EAAc,WACZ,IAAImG,EAAU,aAOd,SAASC,EAAU7G,EAAK8G,EAAQC,EAASlE,GAOvC,IANA,IAAIpE,EAEFuI,EADAC,EAAM,CAAC,GAEP7I,EAAI,EACJ+B,EAAMH,EAAItB,OAELN,EAAI+B,GAAM,CACf,IAAK6G,EAAOC,EAAIvI,OAAQsI,IAAQC,EAAID,IAASF,GAI7C,IAFAG,EAAI,IAAMpE,EAASM,QAAQnD,EAAIC,OAAO7B,MAEjCK,EAAI,EAAGA,EAAIwI,EAAIvI,OAAQD,IAEtBwI,EAAIxI,GAAKsI,EAAU,IACH,MAAdE,EAAIxI,EAAI,KAAYwI,EAAIxI,EAAI,GAAK,GACrCwI,EAAIxI,EAAI,IAAMwI,EAAIxI,GAAKsI,EAAU,EACjCE,EAAIxI,IAAMsI,EAGhB,CAEA,OAAOE,EAAIC,SACb,CAKA,OAAO,SAAUlH,EAAK8G,EAAQC,EAASI,EAAMC,GAC3C,IAAIvE,EAAUyB,EAAGhF,EAAGD,EAAGV,EAAGI,EAAGG,EAAIF,EAC/BZ,EAAI4B,EAAImD,QAAQ,KAChBkD,EAAK7E,EACLqC,EAAKpC,EA+BP,IA5BIrD,GAAK,IACPiB,EAAI2C,EAGJA,EAAgB,EAChBhC,EAAMA,EAAIoD,QAAQ,IAAK,IAEvBrE,GADAC,EAAI,IAAIqB,EAAUyG,IACZO,IAAIrH,EAAItB,OAASN,GACvB4D,EAAgB3C,EAKhBL,EAAEG,EAAI0H,EAAU3G,EAAa7B,EAAcU,EAAEI,GAAIJ,EAAEO,EAAG,KACrD,GAAIyH,EAASH,GACd5H,EAAEM,EAAIN,EAAEG,EAAET,QAUZY,EAAID,GALJH,EAAK2H,EAAU7G,EAAK8G,EAAQC,EAASK,GACjCvE,EAAWH,EAAUkE,IACrB/D,EAAW+D,EAASlE,KAGbhE,OAGO,GAAXQ,IAAKG,GAASH,EAAGkF,OAGxB,IAAKlF,EAAG,GAAI,OAAO2D,EAAS5C,OAAO,GAqCnC,GAlCI7B,EAAI,IACJkB,GAEFP,EAAEI,EAAID,EACNH,EAAEO,EAAIA,EAGNP,EAAER,EAAI4I,EAENjI,GADAH,EAAIyB,EAAIzB,EAAGC,EAAGqH,EAAIxC,EAAIkD,IACf5H,EACPR,EAAII,EAAEJ,EACNW,EAAIP,EAAEO,GASRlB,EAAIc,EAHJoF,EAAIhF,EAAI+G,EAAK,GAObhH,EAAI0H,EAAU,EACdpI,EAAIA,GAAK2F,EAAI,GAAkB,MAAbpF,EAAGoF,EAAI,GAEzB3F,EAAIkF,EAAK,GAAU,MAALzF,GAAaO,KAAa,GAANkF,GAAWA,IAAO9E,EAAER,EAAI,EAAI,EAAI,IAC1DH,EAAIiB,GAAKjB,GAAKiB,IAAW,GAANwE,GAAWlF,GAAW,GAANkF,GAAuB,EAAZ3E,EAAGoF,EAAI,IACtDT,IAAO9E,EAAER,EAAI,EAAI,EAAI,IAKxB+F,EAAI,IAAMpF,EAAG,GAGfc,EAAMrB,EAAIuB,EAAa2C,EAAS5C,OAAO,IAAKoG,EAAIxD,EAAS5C,OAAO,IAAM4C,EAAS5C,OAAO,OACjF,CAML,GAHAf,EAAGR,OAAS4F,EAGR3F,EAGF,MAAOoI,IAAW7H,IAAKoF,GAAKyC,GAC1B7H,EAAGoF,GAAK,EAEHA,MACDhF,EACFJ,EAAK,CAAC,GAAGoI,OAAOpI,IAMtB,IAAKG,EAAIH,EAAGR,QAASQ,IAAKG,KAG1B,IAAKjB,EAAI,EAAG4B,EAAM,GAAI5B,GAAKiB,EAAGW,GAAO6C,EAAS5C,OAAOf,EAAGd,OAGxD4B,EAAME,EAAaF,EAAKV,EAAGuD,EAAS5C,OAAO,GAC7C,CAGA,OAAOD,CACT,CACD,CAnJa,GAuJdQ,EAAM,WAGJ,SAAS+G,EAASxI,EAAGM,EAAGmI,GACtB,IAAIC,EAAGC,EAAMC,EAAKC,EAChBC,EAAQ,EACRzJ,EAAIW,EAAEL,OACNoJ,EAAMzI,EAAIrB,EACV+J,EAAM1I,EAAIrB,EAAY,EAExB,IAAKe,EAAIA,EAAEF,QAAST,KAKlByJ,IADAH,EAAOI,GAHPH,EAAM5I,EAAEX,GAAKJ,IAEbyJ,EAAIM,EAAMJ,GADVC,EAAM7I,EAAEX,GAAKJ,EAAY,GACH8J,GACG9J,EAAaA,EAAa6J,GACnCL,EAAO,IAAMC,EAAIzJ,EAAY,GAAK+J,EAAMH,EACxD7I,EAAEX,GAAKsJ,EAAOF,EAKhB,OAFIK,IAAO9I,EAAI,CAAC8I,GAAOP,OAAOvI,IAEvBA,CACT,CAEA,SAASD,EAAQR,EAAGW,EAAG+I,EAAIC,GACzB,IAAI7J,EAAG8J,EAEP,GAAIF,GAAMC,EACRC,EAAMF,EAAKC,EAAK,GAAI,OAGpB,IAAK7J,EAAI8J,EAAM,EAAG9J,EAAI4J,EAAI5J,IAExB,GAAIE,EAAEF,IAAMa,EAAEb,GAAI,CAChB8J,EAAM5J,EAAEF,GAAKa,EAAEb,GAAK,KACpB,KACF,CAIJ,OAAO8J,CACT,CAEA,SAASC,EAAS7J,EAAGW,EAAG+I,EAAIR,GAI1B,IAHA,IAAIpJ,EAAI,EAGD4J,KACL1J,EAAE0J,IAAO5J,EACTA,EAAIE,EAAE0J,GAAM/I,EAAE+I,GAAM,EAAI,EACxB1J,EAAE0J,GAAM5J,EAAIoJ,EAAOlJ,EAAE0J,GAAM/I,EAAE+I,GAI/B,MAAQ1J,EAAE,IAAMA,EAAEI,OAAS,EAAGJ,EAAEmI,OAAO,EAAG,IAC5C,CAGA,OAAO,SAAU1H,EAAGC,EAAGqH,EAAIxC,EAAI2D,GAC7B,IAAIU,EAAK5I,EAAGlB,EAAGgK,EAAMjK,EAAGkK,EAAMC,EAAOC,EAAGC,EAAIC,EAAKC,EAAMC,EAAMC,EAAIC,EAAIC,EACnEC,EAAIC,EACJzK,EAAIQ,EAAER,GAAKS,EAAET,EAAI,GAAI,EACrBW,EAAKH,EAAEI,EACPC,EAAKJ,EAAEG,EAGT,KAAKD,GAAOA,EAAG,IAAOE,GAAOA,EAAG,IAE9B,OAAO,IAAIiB,EAGTtB,EAAER,GAAMS,EAAET,IAAMW,GAAKE,GAAMF,EAAG,IAAME,EAAG,GAAMA,GAG7CF,GAAe,GAATA,EAAG,KAAYE,EAAS,EAAJb,EAAQA,EAAI,EAHa0K,KAoBvD,IAZAT,GADAD,EAAI,IAAIlI,EAAU9B,IACXY,EAAI,GAEXZ,EAAI8H,GADJ/G,EAAIP,EAAEO,EAAIN,EAAEM,GACC,EAERkI,IACHA,EAAO5J,EACP0B,EAAIpB,EAASa,EAAEO,EAAIzB,GAAYK,EAASc,EAAEM,EAAIzB,GAC9CU,EAAIA,EAAIV,EAAW,GAKhBO,EAAI,EAAGgB,EAAGhB,KAAOc,EAAGd,IAAM,GAAIA,KAInC,GAFIgB,EAAGhB,IAAMc,EAAGd,IAAM,IAAIkB,IAEtBf,EAAI,EACNiK,EAAG7E,KAAK,GACRyE,GAAO,MACF,CAwBL,IAvBAS,EAAK3J,EAAGR,OACRqK,EAAK3J,EAAGV,OACRN,EAAI,EACJG,GAAK,GAILJ,EAAIX,EAAUgK,GAAQpI,EAAG,GAAK,KAItB,IACNA,EAAKmI,EAASnI,EAAIjB,EAAGqJ,GACrBtI,EAAKqI,EAASrI,EAAIf,EAAGqJ,GACrBuB,EAAK3J,EAAGV,OACRmK,EAAK3J,EAAGR,QAGVkK,EAAKG,EAELL,GADAD,EAAMvJ,EAAGL,MAAM,EAAGkK,IACPrK,OAGJgK,EAAOK,EAAIN,EAAIC,KAAU,GAChCM,EAAK5J,EAAGP,QACRmK,EAAK,CAAC,GAAG1B,OAAO0B,GAChBF,EAAM1J,EAAG,GACLA,EAAG,IAAMoI,EAAO,GAAGsB,IAIvB,EAAG,CAOD,GANA3K,EAAI,GAGJ+J,EAAMpJ,EAAQM,EAAIqJ,EAAKM,EAAIL,IAGjB,EAAG,CAqBX,GAjBAC,EAAOF,EAAI,GACPM,GAAML,IAAMC,EAAOA,EAAOnB,GAAQiB,EAAI,IAAM,KAGhDtK,EAAIX,EAAUmL,EAAOG,IAab,EAcN,IAXI3K,GAAKqJ,IAAMrJ,EAAIqJ,EAAO,GAI1Bc,GADAD,EAAOd,EAASnI,EAAIjB,EAAGqJ,IACV9I,OACbgK,EAAOD,EAAI/J,OAM+B,GAAnCI,EAAQuJ,EAAMI,EAAKH,EAAOI,IAC/BvK,IAGAgK,EAASE,EAAMU,EAAKT,EAAQU,EAAK5J,EAAIkJ,EAAOd,GAC5Cc,EAAQD,EAAK3J,OACbwJ,EAAM,OAQC,GAAL/J,IAGF+J,EAAM/J,EAAI,GAKZmK,GADAD,EAAOjJ,EAAGP,SACGH,OAUf,GAPI4J,EAAQI,IAAML,EAAO,CAAC,GAAGf,OAAOe,IAGpCF,EAASM,EAAKJ,EAAMK,EAAMlB,GAC1BkB,EAAOD,EAAI/J,QAGA,GAAPwJ,EAMF,KAAOpJ,EAAQM,EAAIqJ,EAAKM,EAAIL,GAAQ,GAClCvK,IAGAgK,EAASM,EAAKM,EAAKL,EAAOM,EAAK5J,EAAIsJ,EAAMlB,GACzCkB,EAAOD,EAAI/J,MAGjB,MAAmB,IAARwJ,IACT/J,IACAsK,EAAM,CAAC,IAITD,EAAGpK,KAAOD,EAGNsK,EAAI,GACNA,EAAIC,KAAUxJ,EAAG0J,IAAO,GAExBH,EAAM,CAACvJ,EAAG0J,IACVF,EAAO,EAEX,QAAUE,IAAOC,GAAgB,MAAVJ,EAAI,KAAelK,KAE1C6J,EAAiB,MAAVK,EAAI,GAGND,EAAG,IAAIA,EAAG/B,OAAO,EAAG,EAC3B,CAEA,GAAIe,GAAQ5J,EAAM,CAGhB,IAAKQ,EAAI,EAAGG,EAAIiK,EAAG,GAAIjK,GAAK,GAAIA,GAAK,GAAIH,KAEzCmF,EAAMgF,EAAGlC,GAAMkC,EAAEjJ,EAAIlB,EAAIkB,EAAIzB,EAAW,GAAK,EAAGgG,EAAIuE,EAGtD,MACEG,EAAEjJ,EAAIA,EACNiJ,EAAE5J,GAAKyJ,EAGT,OAAOG,CACT,CACD,CAhQK,GA4XA1H,EAAa,8BACfC,EAAW,cACXC,EAAY,cACZC,EAAkB,qBAClBC,EAAmB,6BALvBP,EAOS,SAAU3B,EAAGiB,EAAK+C,EAAO9D,GAC9B,IAAIuI,EACFjJ,EAAIwE,EAAQ/C,EAAMA,EAAIoD,QAAQnC,EAAkB,IAGlD,GAAID,EAAgBkC,KAAK3E,GACvBQ,EAAER,EAAI2K,MAAM3K,GAAK,KAAOA,EAAI,GAAI,EAAK,MAChC,CACL,IAAKwE,IAGHxE,EAAIA,EAAE6E,QAAQvC,EAAY,SAAU4G,EAAG0B,EAAIC,GAEzC,OADA5B,EAAkC,MAA1B4B,EAAKA,EAAG1F,eAAwB,GAAW,KAAN0F,EAAY,EAAI,EACrDnK,GAAKA,GAAKuI,EAAYC,EAAL0B,CAC3B,GAEIlK,IACFuI,EAAOvI,EAGPV,EAAIA,EAAE6E,QAAQtC,EAAU,MAAMsC,QAAQrC,EAAW,SAG/Cf,GAAOzB,GAAG,OAAO,IAAI8B,EAAU9B,EAAGiJ,GAKxC,GAAInH,EAAUmD,MACZ,MAAM5D,MACHlC,EAAiB,SAAWuB,EAAI,SAAWA,EAAI,IAAM,YAAce,GAIxEjB,EAAER,EAAI,IACR,CAEAQ,EAAEI,EAAIJ,EAAEO,EAAI,IACd,EA4LF4B,EAAEmI,cAAgBnI,EAAEoI,IAAM,WACxB,IAAIvK,EAAI,IAAIsB,EAAU2C,MAEtB,OADIjE,EAAER,EAAI,IAAGQ,EAAER,EAAI,GACZQ,CACT,EAUAmC,EAAEqI,WAAa,SAAUvK,EAAGC,GAC1B,OAAOH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,GACxC,EAgBAiC,EAAEsI,cAAgBtI,EAAEmF,GAAK,SAAUA,EAAIxC,GACrC,IAAI1E,EAAGhB,EAAGyE,EACR7D,EAAIiE,KAEN,GAAU,MAANqD,EAKF,OAJA7G,EAAS6G,EAAI,EAAGpI,GACN,MAAN4F,EAAYA,EAAKpC,EAChBjC,EAASqE,EAAI,EAAG,GAEdN,EAAM,IAAIlD,EAAUtB,GAAIsH,EAAKtH,EAAEO,EAAI,EAAGuE,GAG/C,KAAM1E,EAAIJ,EAAEI,GAAI,OAAO,KAIvB,GAHAhB,IAAMyE,EAAIzD,EAAET,OAAS,GAAKR,EAAS8E,KAAK1D,EAAIzB,IAAaA,EAGrD+E,EAAIzD,EAAEyD,GAAI,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIzE,KAG3C,OAFIA,EAAI,IAAGA,EAAI,GAERA,CACT,EAuBA+C,EAAEuI,UAAYvI,EAAEV,IAAM,SAAUxB,EAAGC,GACjC,OAAOuB,EAAIwC,KAAM,IAAI3C,EAAUrB,EAAGC,GAAIuC,EAAgBC,EACxD,EAOAP,EAAEwI,mBAAqBxI,EAAEyI,KAAO,SAAU3K,EAAGC,GAC3C,OAAOuB,EAAIwC,KAAM,IAAI3C,EAAUrB,EAAGC,GAAI,EAAG,EAC3C,EAkBAiC,EAAE0I,gBAAkB1I,EAAEmG,IAAM,SAAUlJ,EAAGsJ,GACvC,IAAIoC,EAAMC,EAAU1L,EAAGiB,EAAS0K,EAAQC,EAAQC,EAAQjL,EACtDD,EAAIiE,KAKN,IAHA7E,EAAI,IAAIkC,EAAUlC,IAGZgB,IAAMhB,EAAE+L,YACZ,MAAMtK,MACHlC,EAAiB,4BAA8B4D,EAAQnD,IAS5D,GANS,MAALsJ,IAAWA,EAAI,IAAIpH,EAAUoH,IAGjCsC,EAAS5L,EAAEmB,EAAI,IAGVP,EAAEI,IAAMJ,EAAEI,EAAE,IAAgB,GAAVJ,EAAEI,EAAE,KAAYJ,EAAEO,GAAmB,GAAdP,EAAEI,EAAET,SAAgBP,EAAEgB,IAAMhB,EAAEgB,EAAE,GAK5E,OADAH,EAAI,IAAIqB,EAAU/C,KAAK+J,KAAK/F,EAAQvC,GAAIgL,EAAS5L,EAAEI,GAAK,EAAIuB,EAAM3B,KAAOmD,EAAQnD,KAC1EsJ,EAAIzI,EAAEmL,IAAI1C,GAAKzI,EAKxB,GAFAgL,EAAS7L,EAAEI,EAAI,EAEXkJ,EAAG,CAGL,GAAIA,EAAEtI,GAAKsI,EAAEtI,EAAE,IAAMsI,EAAElJ,EAAG,OAAO,IAAI8B,EAAU4I,MAE/Ca,GAAYE,GAAUjL,EAAEmL,aAAezC,EAAEyC,eAE3BnL,EAAIA,EAAEoL,IAAI1C,GAI1B,KAAO,IAAItJ,EAAEmB,EAAI,IAAMP,EAAEO,EAAI,GAAKP,EAAEO,GAAI,IAAc,GAAPP,EAAEO,EAE7CP,EAAEI,EAAE,GAAK,GAAK4K,GAAUhL,EAAEI,EAAE,IAAM,KAElCJ,EAAEI,EAAE,GAAK,MAAQ4K,GAAUhL,EAAEI,EAAE,IAAM,YASvC,OANAE,EAAIN,EAAER,EAAI,GAAKuB,EAAM3B,IAAK,EAAK,EAG3BY,EAAEO,GAAI,IAAID,EAAI,EAAIA,GAGf,IAAIgB,EAAU2J,EAAS,EAAI3K,EAAIA,GAE7B2C,IAKT3C,EAAIhC,EAAS2E,EAAgBnE,EAAW,GAC1C,CAcA,IAZIkM,GACFF,EAAO,IAAIxJ,EAAU,IACjB2J,IAAQ7L,EAAEI,EAAI,GAClB0L,EAASnK,EAAM3B,IAGf8L,GADA7L,EAAId,KAAKgM,KAAKhI,EAAQnD,KACT,EAGfa,EAAI,IAAIqB,EAAUkB,KAGR,CAER,GAAI0I,EAAQ,CAEV,KADAjL,EAAIA,EAAEoL,MAAMrL,IACLI,EAAG,MAENE,EACEL,EAAEG,EAAET,OAASW,IAAGL,EAAEG,EAAET,OAASW,GACxByK,IACT9K,EAAIA,EAAEmL,IAAI1C,GAEd,CAEA,GAAIrJ,EAAG,CAEL,GAAU,KADVA,EAAIZ,EAAUY,EAAI,IACL,MACb6L,EAAS7L,EAAI,CACf,MAIE,GAFAmF,EADApF,EAAIA,EAAEiM,MAAMP,GACH1L,EAAEmB,EAAI,EAAG,GAEdnB,EAAEmB,EAAI,GACR2K,EAASnK,EAAM3B,OACV,CAEL,GAAU,KADVC,GAAKkD,EAAQnD,IACA,MACb8L,EAAS7L,EAAI,CACf,CAGFW,EAAIA,EAAEqL,MAAMrL,GAERM,EACEN,EAAEI,GAAKJ,EAAEI,EAAET,OAASW,IAAGN,EAAEI,EAAET,OAASW,GAC/ByK,IACT/K,EAAIA,EAAEoL,IAAI1C,GAEd,CAEA,OAAIqC,EAAiB9K,GACjBgL,IAAQhL,EAAIuC,EAAIf,IAAIxB,IAEjByI,EAAIzI,EAAEmL,IAAI1C,GAAKpI,EAAIkE,EAAMvE,EAAGgD,EAAeP,EAnHxB2G,WAmH+CpJ,EAC3E,EAWAkC,EAAEmJ,aAAe,SAAUxG,GACzB,IAAI1F,EAAI,IAAIkC,EAAU2C,MAGtB,OAFU,MAANa,EAAYA,EAAKpC,EAChBjC,EAASqE,EAAI,EAAG,GACdN,EAAMpF,EAAGA,EAAEmB,EAAI,EAAGuE,EAC3B,EAOA3C,EAAEoJ,UAAYpJ,EAAEqJ,GAAK,SAAUvL,EAAGC,GAChC,OAA8C,IAAvCH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,GACxC,EAMAiC,EAAEsJ,SAAW,WACX,QAASxH,KAAK7D,CAChB,EAOA+B,EAAEuJ,cAAgBvJ,EAAEwJ,GAAK,SAAU1L,EAAGC,GACpC,OAAOH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,IAAM,CAC9C,EAOAiC,EAAEyJ,uBAAyBzJ,EAAE0J,IAAM,SAAU5L,EAAGC,GAC9C,OAAoD,KAA5CA,EAAIH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,MAAoB,IAANA,CAE3D,EAMAiC,EAAEgJ,UAAY,WACZ,QAASlH,KAAK7D,GAAKjB,EAAS8E,KAAK1D,EAAIzB,GAAYmF,KAAK7D,EAAET,OAAS,CACnE,EAOAwC,EAAE2J,WAAa3J,EAAE4J,GAAK,SAAU9L,EAAGC,GACjC,OAAOH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,IAAM,CAC9C,EAOAiC,EAAE6J,oBAAsB7J,EAAE8J,IAAM,SAAUhM,EAAGC,GAC3C,YAAQA,EAAIH,EAAQkE,KAAM,IAAI3C,EAAUrB,EAAGC,MAAqB,IAANA,CAC5D,EAMAiC,EAAEgI,MAAQ,WACR,OAAQlG,KAAKzE,CACf,EAMA2C,EAAE+J,WAAa,WACb,OAAOjI,KAAKzE,EAAI,CAClB,EAMA2C,EAAEgK,WAAa,WACb,OAAOlI,KAAKzE,EAAI,CAClB,EAMA2C,EAAEiK,OAAS,WACT,QAASnI,KAAK7D,GAAkB,GAAb6D,KAAK7D,EAAE,EAC5B,EAuBA+B,EAAEkK,MAAQ,SAAUpM,EAAGC,GACrB,IAAIb,EAAGK,EAAG4M,EAAGC,EACXvM,EAAIiE,KACJ1E,EAAIS,EAAER,EAMR,GAHAU,GADAD,EAAI,IAAIqB,EAAUrB,EAAGC,IACfV,GAGDD,IAAMW,EAAG,OAAO,IAAIoB,EAAU4I,KAGnC,GAAI3K,GAAKW,EAEP,OADAD,EAAET,GAAKU,EACAF,EAAE4H,KAAK3H,GAGhB,IAAIuM,EAAKxM,EAAEO,EAAIzB,EACb2N,EAAKxM,EAAEM,EAAIzB,EACXqB,EAAKH,EAAEI,EACPC,EAAKJ,EAAEG,EAET,IAAKoM,IAAOC,EAAI,CAGd,IAAKtM,IAAOE,EAAI,OAAOF,GAAMF,EAAET,GAAKU,EAAGD,GAAK,IAAIqB,EAAUjB,EAAKL,EAAIkK,KAGnE,IAAK/J,EAAG,KAAOE,EAAG,GAGhB,OAAOA,EAAG,IAAMJ,EAAET,GAAKU,EAAGD,GAAK,IAAIqB,EAAUnB,EAAG,GAAKH,EAGnC,GAAjB0C,KAA0B,EAE/B,CAOA,GALA8J,EAAKrN,EAASqN,GACdC,EAAKtN,EAASsN,GACdtM,EAAKA,EAAGL,QAGJP,EAAIiN,EAAKC,EAAI,CAaf,KAXIF,EAAOhN,EAAI,IACbA,GAAKA,EACL+M,EAAInM,IAEJsM,EAAKD,EACLF,EAAIjM,GAGNiM,EAAEnE,UAGGjI,EAAIX,EAAGW,IAAKoM,EAAE1H,KAAK,IACxB0H,EAAEnE,SACJ,MAKE,IAFAzI,GAAK6M,GAAQhN,EAAIY,EAAGR,SAAWO,EAAIG,EAAGV,SAAWJ,EAAIW,EAEhDX,EAAIW,EAAI,EAAGA,EAAIR,EAAGQ,IAErB,GAAIC,EAAGD,IAAMG,EAAGH,GAAI,CAClBqM,EAAOpM,EAAGD,GAAKG,EAAGH,GAClB,KACF,CAgBJ,GAXIqM,IACFD,EAAInM,EACJA,EAAKE,EACLA,EAAKiM,EACLrM,EAAET,GAAKS,EAAET,IAGXU,GAAKR,EAAIW,EAAGV,SAAWN,EAAIc,EAAGR,SAItB,EAAG,KAAOO,IAAKC,EAAGd,KAAO,GAIjC,IAHAa,EAAIrB,EAAO,EAGJa,EAAIH,GAAI,CAEb,GAAIY,IAAKT,GAAKW,EAAGX,GAAI,CACnB,IAAKL,EAAIK,EAAGL,IAAMc,IAAKd,GAAIc,EAAGd,GAAKa,KACjCC,EAAGd,GACLc,EAAGT,IAAMb,CACX,CAEAsB,EAAGT,IAAMW,EAAGX,EACd,CAGA,KAAgB,GAATS,EAAG,GAASA,EAAGuH,OAAO,EAAG,KAAM+E,GAGtC,OAAKtM,EAAG,GAWDiF,EAAUnF,EAAGE,EAAIsM,IAPtBxM,EAAET,EAAqB,GAAjBkD,GAAqB,EAAK,EAChCzC,EAAEG,EAAI,CAACH,EAAEM,EAAI,GACNN,EAMX,EAwBAkC,EAAEuK,OAASvK,EAAEiJ,IAAM,SAAUnL,EAAGC,GAC9B,IAAIsJ,EAAGhK,EACLQ,EAAIiE,KAKN,OAHAhE,EAAI,IAAIqB,EAAUrB,EAAGC,IAGhBF,EAAEI,IAAMH,EAAET,GAAKS,EAAEG,IAAMH,EAAEG,EAAE,GACvB,IAAIkB,EAAU4I,MAGXjK,EAAEG,GAAKJ,EAAEI,IAAMJ,EAAEI,EAAE,GACtB,IAAIkB,EAAUtB,IAGJ,GAAfgD,GAIFxD,EAAIS,EAAET,EACNS,EAAET,EAAI,EACNgK,EAAI/H,EAAIzB,EAAGC,EAAG,EAAG,GACjBA,EAAET,EAAIA,EACNgK,EAAEhK,GAAKA,GAEPgK,EAAI/H,EAAIzB,EAAGC,EAAG,EAAG+C,IAGnB/C,EAAID,EAAEqM,MAAM7C,EAAE6B,MAAMpL,KAGbG,EAAE,IAAqB,GAAf4C,IAAkB/C,EAAET,EAAIQ,EAAER,GAElCS,EACT,EAuBAkC,EAAEwK,aAAexK,EAAEkJ,MAAQ,SAAUpL,EAAGC,GACtC,IAAIE,EAAGG,EAAGlB,EAAGK,EAAGY,EAAGoI,EAAGkE,EAAKhE,EAAKC,EAAKgE,EAAKC,EAAKC,EAAKC,EAClDvE,EAAMwE,EACNjN,EAAIiE,KACJ9D,EAAKH,EAAEI,EACPC,GAAMJ,EAAI,IAAIqB,EAAUrB,EAAGC,IAAIE,EAGjC,KAAKD,GAAOE,GAAOF,EAAG,IAAOE,EAAG,IAmB9B,OAhBKL,EAAER,IAAMS,EAAET,GAAKW,IAAOA,EAAG,KAAOE,GAAMA,IAAOA,EAAG,KAAOF,EAC1DF,EAAEG,EAAIH,EAAEM,EAAIN,EAAET,EAAI,MAElBS,EAAET,GAAKQ,EAAER,EAGJW,GAAOE,GAKVJ,EAAEG,EAAI,CAAC,GACPH,EAAEM,EAAI,GALNN,EAAEG,EAAIH,EAAEM,EAAI,MASTN,EAmBT,IAhBAM,EAAIpB,EAASa,EAAEO,EAAIzB,GAAYK,EAASc,EAAEM,EAAIzB,GAC9CmB,EAAET,GAAKQ,EAAER,GACToN,EAAMzM,EAAGR,SACTkN,EAAMxM,EAAGV,UAIPqN,EAAK7M,EACLA,EAAKE,EACLA,EAAK2M,EACL3N,EAAIuN,EACJA,EAAMC,EACNA,EAAMxN,GAIHA,EAAIuN,EAAMC,EAAKG,EAAK,GAAI3N,IAAK2N,EAAGpI,KAAK,IAK1C,IAHA6D,EAAO5J,EACPoO,EAAWhO,EAENI,EAAIwN,IAAOxN,GAAK,GAAI,CAKvB,IAJAe,EAAI,EACJ0M,EAAMzM,EAAGhB,GAAK4N,EACdF,EAAM1M,EAAGhB,GAAK4N,EAAW,EAEXvN,EAAIL,GAAbiB,EAAIsM,GAAgBlN,EAAIL,GAK3Be,IADAwI,EAAMkE,GAHNlE,EAAMzI,IAAKG,GAAK2M,IAEhBvE,EAAIqE,EAAMnE,GADVC,EAAM1I,EAAGG,GAAK2M,EAAW,GACHH,GACEG,EAAYA,EAAYD,EAAGtN,GAAKU,GAC7CqI,EAAO,IAAMC,EAAIuE,EAAW,GAAKF,EAAMlE,EAClDmE,EAAGtN,KAAOkJ,EAAMH,EAGlBuE,EAAGtN,GAAKU,CACV,CAQA,OANIA,IACAG,EAEFyM,EAAGtF,OAAO,EAAG,GAGRtC,EAAUnF,EAAG+M,EAAIzM,EAC1B,EAOA4B,EAAE+K,QAAU,WACV,IAAIlN,EAAI,IAAIsB,EAAU2C,MAEtB,OADAjE,EAAER,GAAKQ,EAAER,GAAK,KACPQ,CACT,EAuBAmC,EAAEyF,KAAO,SAAU3H,EAAGC,GACpB,IAAIoM,EACFtM,EAAIiE,KACJ1E,EAAIS,EAAER,EAMR,GAHAU,GADAD,EAAI,IAAIqB,EAAUrB,EAAGC,IACfV,GAGDD,IAAMW,EAAG,OAAO,IAAIoB,EAAU4I,KAGlC,GAAI3K,GAAKW,EAER,OADAD,EAAET,GAAKU,EACAF,EAAEqM,MAAMpM,GAGjB,IAAIuM,EAAKxM,EAAEO,EAAIzB,EACb2N,EAAKxM,EAAEM,EAAIzB,EACXqB,EAAKH,EAAEI,EACPC,EAAKJ,EAAEG,EAET,IAAKoM,IAAOC,EAAI,CAGd,IAAKtM,IAAOE,EAAI,OAAO,IAAIiB,EAAU/B,EAAI,GAIzC,IAAKY,EAAG,KAAOE,EAAG,GAAI,OAAOA,EAAG,GAAKJ,EAAI,IAAIqB,EAAUnB,EAAG,GAAKH,EAAQ,EAAJT,EACrE,CAOA,GALAiN,EAAKrN,EAASqN,GACdC,EAAKtN,EAASsN,GACdtM,EAAKA,EAAGL,QAGJP,EAAIiN,EAAKC,EAAI,CAUf,IATIlN,EAAI,GACNkN,EAAKD,EACLF,EAAIjM,IAEJd,GAAKA,EACL+M,EAAInM,GAGNmM,EAAEnE,UACK5I,IAAK+M,EAAE1H,KAAK,IACnB0H,EAAEnE,SACJ,CAcA,KAZA5I,EAAIY,EAAGR,SACPO,EAAIG,EAAGV,QAGK,IACV2M,EAAIjM,EACJA,EAAKF,EACLA,EAAKmM,EACLpM,EAAIX,GAIDA,EAAI,EAAGW,GACVX,GAAKY,IAAKD,GAAKC,EAAGD,GAAKG,EAAGH,GAAKX,GAAKV,EAAO,EAC3CsB,EAAGD,GAAKrB,IAASsB,EAAGD,GAAK,EAAIC,EAAGD,GAAKrB,EAUvC,OAPIU,IACFY,EAAK,CAACZ,GAAGgJ,OAAOpI,KACdsM,GAKGrH,EAAUnF,EAAGE,EAAIsM,EAC1B,EAkBAtK,EAAEgL,UAAYhL,EAAEmD,GAAK,SAAUA,EAAIR,GACjC,IAAI1E,EAAGhB,EAAGyE,EACR7D,EAAIiE,KAEN,GAAU,MAANqB,GAAcA,MAASA,EAKzB,OAJA7E,EAAS6E,EAAI,EAAGpG,GACN,MAAN4F,EAAYA,EAAKpC,EAChBjC,EAASqE,EAAI,EAAG,GAEdN,EAAM,IAAIlD,EAAUtB,GAAIsF,EAAIR,GAGrC,KAAM1E,EAAIJ,EAAEI,GAAI,OAAO,KAIvB,GAFAhB,GADAyE,EAAIzD,EAAET,OAAS,GACPb,EAAW,EAEf+E,EAAIzD,EAAEyD,GAAI,CAGZ,KAAOA,EAAI,IAAM,EAAGA,GAAK,GAAIzE,KAG7B,IAAKyE,EAAIzD,EAAE,GAAIyD,GAAK,GAAIA,GAAK,GAAIzE,KACnC,CAIA,OAFIkG,GAAMtF,EAAEO,EAAI,EAAInB,IAAGA,EAAIY,EAAEO,EAAI,GAE1BnB,CACT,EAWA+C,EAAEiL,UAAY,SAAU9M,GAEtB,OADAG,EAASH,GAAG,iBAAmBvB,GACxBkF,KAAKoH,MAAM,KAAO/K,EAC3B,EAcA6B,EAAEkL,WAAalL,EAAEmL,KAAO,WACtB,IAAI5E,EAAGtJ,EAAGQ,EAAG2N,EAAKjB,EAChBtM,EAAIiE,KACJ7D,EAAIJ,EAAEI,EACNZ,EAAIQ,EAAER,EACNe,EAAIP,EAAEO,EACN+G,EAAK7E,EAAiB,EACtBqI,EAAO,IAAIxJ,EAAU,OAGvB,GAAU,IAAN9B,IAAYY,IAAMA,EAAE,GACtB,OAAO,IAAIkB,GAAW9B,GAAKA,EAAI,KAAOY,GAAKA,EAAE,IAAM8J,IAAM9J,EAAIJ,EAAI,KA8BnE,GAtBS,IAJTR,EAAIjB,KAAK+O,MAAM/K,EAAQvC,MAITR,GAAK,OACjBJ,EAAIE,EAAcc,IACXT,OAASY,GAAK,GAAK,IAAGnB,GAAK,KAClCI,EAAIjB,KAAK+O,MAAMlO,GACfmB,EAAIpB,GAAUoB,EAAI,GAAK,IAAMA,EAAI,GAAKA,EAAI,GAS1CX,EAAI,IAAI0B,EANNlC,EADEI,GAAK,IACH,KAAOe,GAEXnB,EAAII,EAAEwB,iBACAlB,MAAM,EAAGV,EAAEgF,QAAQ,KAAO,GAAK7D,IAKvCX,EAAI,IAAI0B,EAAU9B,EAAI,IAOpBI,EAAEQ,EAAE,GAMN,KAJAZ,GADAe,EAAIX,EAAEW,GACE+G,GACA,IAAG9H,EAAI,KAOb,GAHA8M,EAAI1M,EACJA,EAAIkL,EAAKO,MAAMiB,EAAE1E,KAAKnG,EAAIzB,EAAGsM,EAAGhF,EAAI,KAEhChI,EAAcgN,EAAElM,GAAGN,MAAM,EAAGN,MAAQJ,EAAIE,EAAcM,EAAEQ,IAAIN,MAAM,EAAGN,GAAI,CAW3E,GANII,EAAEW,EAAIA,KAAKf,EAMN,SALTJ,EAAIA,EAAEU,MAAMN,EAAI,EAAGA,EAAI,MAKH+N,GAAY,QAALnO,GAgBpB,EAICA,KAAOA,EAAEU,MAAM,IAAqB,KAAfV,EAAE8B,OAAO,MAGlCsD,EAAM5E,EAAGA,EAAEW,EAAIkC,EAAiB,EAAG,GACnCiG,GAAK9I,EAAEyL,MAAMzL,GAAG4L,GAAGxL,IAGrB,KACF,CAxBE,IAAKuN,IACH/I,EAAM8H,EAAGA,EAAE/L,EAAIkC,EAAiB,EAAG,GAE/B6J,EAAEjB,MAAMiB,GAAGd,GAAGxL,IAAI,CACpBJ,EAAI0M,EACJ,KACF,CAGFhF,GAAM,EACN9H,GAAK,EACL+N,EAAM,CAcV,CAIJ,OAAO/I,EAAM5E,EAAGA,EAAEW,EAAIkC,EAAiB,EAAGC,EAAegG,EAC3D,EAYAvG,EAAEnB,cAAgB,SAAUsG,EAAIxC,GAK9B,OAJU,MAANwC,IACF7G,EAAS6G,EAAI,EAAGpI,GAChBoI,KAEKzC,EAAOZ,KAAMqD,EAAIxC,EAAI,EAC9B,EAeA3C,EAAEqL,QAAU,SAAUlG,EAAIxC,GAKxB,OAJU,MAANwC,IACF7G,EAAS6G,EAAI,EAAGpI,GAChBoI,EAAKA,EAAKrD,KAAK1D,EAAI,GAEdsE,EAAOZ,KAAMqD,EAAIxC,EAC1B,EA4BA3C,EAAEsL,SAAW,SAAUnG,EAAIxC,EAAID,GAC7B,IAAI5D,EACFjB,EAAIiE,KAEN,GAAc,MAAVY,EACQ,MAANyC,GAAcxC,GAAmB,iBAANA,GAC7BD,EAASC,EACTA,EAAK,MACIwC,GAAmB,iBAANA,GACtBzC,EAASyC,EACTA,EAAKxC,EAAK,MAEVD,EAAS3B,OAEN,GAAqB,iBAAV2B,EAChB,MAAMhE,MACHlC,EAAiB,2BAA6BkG,GAKnD,GAFA5D,EAAMjB,EAAEwN,QAAQlG,EAAIxC,GAEhB9E,EAAEI,EAAG,CACP,IAAIf,EACF6I,EAAMjH,EAAIyM,MAAM,KAChBC,GAAM9I,EAAOzB,UACbwK,GAAM/I,EAAOxB,mBACbC,EAAiBuB,EAAOvB,gBAAkB,GAC1CuK,EAAU3F,EAAI,GACd4F,EAAe5F,EAAI,GACnB6F,EAAQ/N,EAAER,EAAI,EACdwO,EAAYD,EAAQF,EAAQ/N,MAAM,GAAK+N,EACvCzM,EAAM4M,EAAUrO,OASlB,GAPIiO,IACFvO,EAAIsO,EACJA,EAAKC,EACLA,EAAKvO,EACL+B,GAAO/B,GAGLsO,EAAK,GAAKvM,EAAM,EAAG,CAGrB,IAFA/B,EAAI+B,EAAMuM,GAAMA,EAChBE,EAAUG,EAAUC,OAAO,EAAG5O,GACvBA,EAAI+B,EAAK/B,GAAKsO,EAAIE,GAAWvK,EAAiB0K,EAAUC,OAAO5O,EAAGsO,GACrEC,EAAK,IAAGC,GAAWvK,EAAiB0K,EAAUlO,MAAMT,IACpD0O,IAAOF,EAAU,IAAMA,EAC7B,CAEA5M,EAAM6M,EACHD,GAAWhJ,EAAOtB,kBAAoB,MAAQqK,GAAM/I,EAAOrB,mBAC1DsK,EAAazJ,QAAQ,IAAI6J,OAAO,OAASN,EAAK,OAAQ,KACvD,MAAQ/I,EAAOpB,wBAA0B,KACxCqK,GACDD,CACL,CAEA,OAAQhJ,EAAO1B,QAAU,IAAMlC,GAAO4D,EAAOnB,QAAU,GACzD,EAcAvB,EAAEgM,WAAa,SAAUC,GACvB,IAAI7I,EAAG8I,EAAIC,EAAIC,EAAIhO,EAAGiO,EAAKpP,EAAGqP,EAAIC,EAAIlF,EAAG5J,EAAGJ,EAC1CQ,EAAIiE,KACJ9D,EAAKH,EAAEI,EAET,GAAU,MAANgO,MACFhP,EAAI,IAAIkC,EAAU8M,IAGXjD,cAAgB/L,EAAEgB,GAAa,IAARhB,EAAEI,IAAYJ,EAAE2M,GAAGvJ,IAC/C,MAAM3B,MACHlC,EAAiB,aACfS,EAAE+L,YAAc,iBAAmB,oBAAsB5I,EAAQnD,IAI1E,IAAKe,EAAI,OAAO,IAAImB,EAAUtB,GAoB9B,IAlBAuF,EAAI,IAAIjE,EAAUkB,GAClBkM,EAAKL,EAAK,IAAI/M,EAAUkB,GACxB8L,EAAKG,EAAK,IAAInN,EAAUkB,GACxBhD,EAAIF,EAAca,GAIlBI,EAAIgF,EAAEhF,EAAIf,EAAEG,OAASK,EAAEO,EAAI,EAC3BgF,EAAEnF,EAAE,GAAKpB,GAAUwP,EAAMjO,EAAIzB,GAAY,EAAIA,EAAW0P,EAAMA,GAC9DJ,GAAMA,GAAMhP,EAAEoL,WAAWjF,GAAK,EAAKhF,EAAI,EAAIgF,EAAImJ,EAAMtP,EAErDoP,EAAM1L,EACNA,EAAU,IACV1D,EAAI,IAAIkC,EAAU9B,GAGlBiP,EAAGrO,EAAE,GAAK,EAGRoJ,EAAI/H,EAAIrC,EAAGmG,EAAG,EAAG,GAEQ,IADzBgJ,EAAKF,EAAGzG,KAAK4B,EAAE6B,MAAMiD,KACd9D,WAAW4D,IAClBC,EAAKC,EACLA,EAAKC,EACLG,EAAKD,EAAG7G,KAAK4B,EAAE6B,MAAMkD,EAAKG,IAC1BD,EAAKF,EACLhJ,EAAInG,EAAEiN,MAAM7C,EAAE6B,MAAMkD,EAAKhJ,IACzBnG,EAAImP,EAeN,OAZAA,EAAK9M,EAAI2M,EAAG/B,MAAMgC,GAAKC,EAAI,EAAG,GAC9BG,EAAKA,EAAG7G,KAAK2G,EAAGlD,MAAMqD,IACtBL,EAAKA,EAAGzG,KAAK2G,EAAGlD,MAAMiD,IACtBG,EAAGjP,EAAIkP,EAAGlP,EAAIQ,EAAER,EAIhBI,EAAI6B,EAAIiN,EAAIJ,EAHZ/N,GAAQ,EAGWmC,GAAe2J,MAAMrM,GAAGuK,MAAMC,WAC7C/I,EAAIgN,EAAIJ,EAAI9N,EAAGmC,GAAe2J,MAAMrM,GAAGuK,OAAS,EAAI,CAACmE,EAAIJ,GAAM,CAACG,EAAIJ,GAExEvL,EAAU0L,EAEH5O,CACT,EAMAuC,EAAEwM,SAAW,WACX,OAAQpM,EAAQ0B,KAClB,EAcA9B,EAAEyM,YAAc,SAAUtJ,EAAIR,GAE5B,OADU,MAANQ,GAAY7E,EAAS6E,EAAI,EAAGpG,GACzB2F,EAAOZ,KAAMqB,EAAIR,EAAI,EAC9B,EAcA3C,EAAEG,SAAW,SAAUpC,GACrB,IAAIe,EACF7B,EAAI6E,KACJzE,EAAIJ,EAAEI,EACNe,EAAInB,EAAEmB,EA0BR,OAvBU,OAANA,EACEf,GACFyB,EAAM,WACFzB,EAAI,IAAGyB,EAAM,IAAMA,IAEvBA,EAAM,OAGC,MAALf,EACFe,EAAMV,GAAKoC,GAAcpC,GAAKqC,EAC3B5B,EAAc1B,EAAcF,EAAEgB,GAAIG,GAClCY,EAAa7B,EAAcF,EAAEgB,GAAIG,EAAG,KACxB,KAANL,GAAY0D,EAErB3C,EAAME,EAAa7B,GADnBF,EAAIoF,EAAM,IAAIlD,EAAUlC,GAAIqD,EAAiBlC,EAAI,EAAGmC,IACjBtC,GAAIhB,EAAEmB,EAAG,MAE5CE,EAASP,EAAG,EAAGyD,EAAShE,OAAQ,QAChCsB,EAAMS,EAAYP,EAAa7B,EAAcF,EAAEgB,GAAIG,EAAG,KAAM,GAAIL,EAAGV,GAAG,IAGpEA,EAAI,GAAKJ,EAAEgB,EAAE,KAAIa,EAAM,IAAMA,IAG5BA,CACT,EAOAkB,EAAEI,QAAUJ,EAAE0M,OAAS,WACrB,OAAOtM,EAAQ0B,KACjB,EAGA9B,EAAE+B,cAAe,EAEjB/B,EAAE2M,OAAOC,aAAe,YAGxB5M,EAAE2M,OAAOE,IAAI,+BAAiC7M,EAAEI,QAE5B,MAAhBf,GAAsBF,EAAUiF,IAAI/E,GAEjCF,CACT,CAqIuBC,GCt1FvB,MAAM0N,EAAa,gCAWZ,SAASC,EAAmBC,GAC/B,IAAIC,EAAOD,EAAaC,KACxB,GAAIH,EAAW9K,KAAKgL,EAAaC,OAAS,eAAgBD,EAAc,CACpEC,EAAO,IACP,MAAMzP,EAASwP,EAAaE,WAAW1P,OACvC,IAAK,IAAIN,EAAI,EAAGA,EAAIM,EAAQN,IAAK,CAE7B+P,GAAQF,EADUC,EAAaE,WAAWhQ,IAEtCA,EAAIM,EAAS,IACbyP,GAAQ,KAChB,CACA,MAAME,ECtBP,SAAmBC,EAAOC,GAC7B,MAAMC,EAAQF,EAAMG,KAAKF,GACzB,OAAOC,GAAOE,MAClB,CDmBuBC,CAAUX,EAAYE,EAAaC,MAElD,OADAA,GAAQ,IAAIE,GAAQO,OAAS,KACtBX,EAAmB,IACnBC,EACHC,QAER,CAKA,MAHI,YAAaD,GAAgBA,EAAaW,UAC1CV,EAAO,GAAGA,aAEVD,EAAavO,KACN,GAAGwO,KAAQD,EAAavO,OAC5BwO,CACX,CExBO,SAASW,EAAoBC,GAChC,IAAIC,EAAS,GACb,MAAMtQ,EAASqQ,EAAcrQ,OAC7B,IAAK,IAAIN,EAAI,EAAGA,EAAIM,EAAQN,IAAK,CAE7B4Q,GAAUf,EADWc,EAAc3Q,IAE/BA,IAAMM,EAAS,IACfsQ,GAAU,KAClB,CACA,OAAOA,CACX,CCvBO,SAASC,EAAcC,GAASC,YAAEA,GAAc,GAAU,CAAA,GAC7D,GAAqB,aAAjBD,EAAQf,MACS,UAAjBe,EAAQf,MACS,UAAjBe,EAAQf,KACR,MAAM,IAAIiB,EAA2BF,EAAQf,MACjD,MAAO,GAAGe,EAAQvP,QAAQ0P,EAAgBH,EAAQI,OAAQ,CAAEH,kBAChE,CACO,SAASE,EAAgBL,GAAQG,YAAEA,GAAc,GAAU,CAAA,GAC9D,OAAKH,EAEEA,EACFO,IAAKC,GAGd,SAAwBA,GAAOL,YAAEA,IAC7B,GAAIK,EAAMrB,KAAKsB,WAAW,SACtB,MAAO,IAAIJ,EAAgBG,EAAMpB,WAAY,CAAEe,mBAAkBK,EAAMrB,KAAKtP,MAAM,KAEtF,OAAO2Q,EAAMrB,MAAQgB,GAAeK,EAAM7P,KAAO,IAAI6P,EAAM7P,OAAS,GACxE,CARwB+P,CAAeF,EAAO,CAAEL,iBACvCQ,KAAKR,EAAc,KAAO,KAHpB,EAIf,CCdO,SAASS,EAAMC,GAAOC,OAAEA,GAAS,GAAS,CAAA,GAC7C,QAAKD,IAEgB,iBAAVA,IAEJC,EAAS,mBAAmB5M,KAAK2M,GAASA,EAAMJ,WAAW,OACtE,CCCO,SAASM,EAAKF,GACjB,OAAID,EAAMC,EAAO,CAAEC,QAAQ,IAChBxS,KAAKC,MAAMsS,EAAMnR,OAAS,GAAK,GACnCmR,EAAMnR,MACjB,CCXO,MAAMsR,EAAU,SCCvB,IAAIC,EACY,EAAGC,cAAaC,WAAW,GAAIC,cAAgBD,EACrD,GAAGD,GAAe,oBAAoBC,IAAWC,EAAW,IAAIA,IAAa,UAC7EC,EAHNJ,EAIS,QAAQD,IAKd,MAAMM,UAAkB1Q,MAC3B,WAAAwB,CAAYmP,EAAcrM,EAAO,IAC7B,MAAMsM,EACEtM,EAAKuM,iBAAiBH,EACfpM,EAAKuM,MAAMD,QAClBtM,EAAKuM,OAAOC,QACLxM,EAAKuM,MAAMC,QACfxM,EAAKsM,QAEVL,EACEjM,EAAKuM,iBAAiBH,GACfpM,EAAKuM,MAAMN,UACfjM,EAAKiM,SAEVQ,EAAUV,IAAyB,IAAK/L,EAAMiM,aASpDS,MARgB,CACZL,GAAgB,qBAChB,MACIrM,EAAK2M,aAAe,IAAI3M,EAAK2M,aAAc,IAAM,MACjDF,EAAU,CAAC,SAASA,KAAa,MACjCH,EAAU,CAAC,YAAYA,KAAa,MACpCP,EAAsB,CAAC,YAAYA,KAAyB,IAClEN,KAAK,MACQzL,EAAKuM,MAAQ,CAAEA,MAAOvM,EAAKuM,YAAUJ,GACpDS,OAAOC,eAAe/N,KAAM,UAAW,CACnCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,WAAY,CACpCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,eAAgB,CACxCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,eAAgB,CACxCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,UAAW,CACnCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,OAAQ,CAChCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,MAAO,cAEX7M,KAAKwN,QAAUA,EACfxN,KAAKmN,SAAWA,EAChBnN,KAAK6N,aAAe3M,EAAK2M,aACzB7N,KAAKrD,KAAOuE,EAAKvE,MAAQqD,KAAKrD,KAC9BqD,KAAKuN,aAAeA,EACpBvN,KAAKgN,QAAUA,CACnB,CACA,IAAAmB,CAAKC,GACD,OAAOD,EAAKnO,KAAMoO,EACtB,EAEJ,SAASD,EAAKE,EAAKD,GACf,OAAIA,IAAKC,GACEA,EACPA,GACe,iBAARA,GACP,UAAWA,QACGhB,IAAdgB,EAAIZ,MACGU,EAAKE,EAAIZ,MAAOW,GACpBA,EAAK,KAAOC,CACvB,CCtDO,MAAMC,UAAyChB,EAClD,WAAAlP,EAAYmQ,KAAEA,EAAIvC,OAAEA,EAAMe,KAAEA,IACxBa,MAAM,CAAC,gBAAgBb,8CAAiDJ,KAAK,MAAO,CAChFkB,aAAc,CACV,YAAYxB,EAAgBL,EAAQ,CAAEG,aAAa,OACnD,WAAWoC,MAASxB,YAExBpQ,KAAM,qCAEVmR,OAAOC,eAAe/N,KAAM,OAAQ,CAChCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,SAAU,CAClCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEXiB,OAAOC,eAAe/N,KAAM,OAAQ,CAChCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEX7M,KAAKuO,KAAOA,EACZvO,KAAKgM,OAASA,EACdhM,KAAK+M,KAAOA,CAChB,EAEG,MAAMyB,UAAiClB,EAC1C,WAAAlP,GACIwP,MAAM,sDAAuD,CACzDjR,KAAM,4BAEd,EAEG,MAAM8R,UAA4CnB,EACrD,WAAAlP,EAAYsQ,eAAEA,EAAcC,YAAEA,EAAWxD,KAAEA,IACvCyC,MAAM,CACF,+CAA+CzC,KAC/C,oBAAoBuD,IACpB,iBAAiBC,KACnBhC,KAAK,MAAO,CAAEhQ,KAAM,uCAC1B,EAEG,MAAMiS,UAA0CtB,EACnD,WAAAlP,EAAYyQ,aAAEA,EAAYhC,MAAEA,IACxBe,MAAM,kBAAkBf,YAAgBE,EAAKF,0CAA8CgC,MAAkB,CAAElS,KAAM,qCACzH,EAEG,MAAMmS,UAAuCxB,EAChD,WAAAlP,EAAYsQ,eAAEA,EAAcC,YAAEA,IAC1Bf,MAAM,CACF,8CACA,6BAA6Bc,IAC7B,0BAA0BC,KAC5BhC,KAAK,MAAO,CAAEhQ,KAAM,kCAC1B,EA2EG,MAAMoS,UAAiCzB,EAC1C,WAAAlP,CAAY4Q,GAAc7B,SAAEA,GAAa,CAAA,GACrCS,MAAM,CACF,YAAYoB,EAAe,IAAIA,MAAmB,sBAClD,+EACFrC,KAAK,MAAO,CACVQ,WACAxQ,KAAM,4BAEd,EAEG,MAAMsS,UAAwC3B,EACjD,WAAAlP,CAAY4Q,GAAc7B,SAAEA,IACxBS,MAAM,CACF,aAAaoB,8CACb,8EACA,+EACFrC,KAAK,MAAO,CACVQ,WACAxQ,KAAM,mCAEd,EAcG,MAAMuS,UAA8B5B,EACvC,WAAAlP,CAAYrC,EAAGC,GACX4R,MAAM,iDAAkD,CACpDC,aAAc,CACV,KAAK9R,EAAEoP,eAAec,EAAclQ,EAAEmQ,kBACtC,KAAKlQ,EAAEmP,eAAec,EAAcjQ,EAAEkQ,aACtC,GACA,yEACA,iDAEJvP,KAAM,yBAEd,EAgEG,MAAMwS,UAAoC7B,EAC7C,WAAAlP,CAAY+M,GAAMgC,SAAEA,IAChBS,MAAM,CACF,SAASzC,mCACT,oCACFwB,KAAK,MAAO,CAAEQ,WAAUxQ,KAAM,0BACpC,EAEG,MAAMyS,UAAoC9B,EAC7C,WAAAlP,CAAY+M,GAAMgC,SAAEA,IAChBS,MAAM,CACF,SAASzC,mCACT,oCACFwB,KAAK,MAAO,CAAEQ,WAAUxQ,KAAM,0BACpC,EAEG,MAAM0S,UAA0B/B,EACnC,WAAAlP,CAAYyO,GACRe,MAAM,CAAC,UAAUf,4BAAgCF,KAAK,MAAO,CACzDhQ,KAAM,qBAEd,EAEG,MAAMyP,UAAmCkB,EAC5C,WAAAlP,CAAY+M,GACRyC,MAAM,CACF,IAAIzC,qCACJ,6CACFwB,KAAK,MAAO,CAAEhQ,KAAM,8BAC1B,ECtTG,MAAM2S,UAAoChC,EAC7C,WAAAlP,EAAYmR,OAAEA,EAAMC,SAAEA,EAAQzC,KAAEA,IAC5Ba,MAAM,SAAsB,UAAb4B,EAAuB,WAAa,uBAAuBD,8BAAmCxC,MAAU,CAAEpQ,KAAM,+BACnI,EAEG,MAAM8S,UAAoCnC,EAC7C,WAAAlP,EAAY2O,KAAEA,EAAI2C,WAAEA,EAAUvE,KAAEA,IAC5ByC,MAAM,GAAGzC,EAAKlO,OAAO,GAAGwD,gBAAgB0K,EACnCtP,MAAM,GACN6E,uBAAuBqM,4BAA+B2C,MAAgB,CAAE/S,KAAM,+BACvF,ECVG,SAASgT,EAAIC,GAAYC,IAAEA,EAAG9C,KAAEA,EAAO,IAAO,IACjD,MAA0B,iBAAf6C,EACAE,EAAOF,EAAY,CAAEC,MAAK9C,SAelC,SAAkBgD,GAAOF,IAAEA,EAAG9C,KAAEA,EAAO,IAAO,IACjD,GAAa,OAATA,EACA,OAAOgD,EACX,GAAIA,EAAMrU,OAASqR,EACf,MAAM,IAAI0C,EAA4B,CAClC1C,KAAMgD,EAAMrU,OACZgU,WAAY3C,EACZ5B,KAAM,UAEd,MAAM6E,EAAc,IAAIC,WAAWlD,GACnC,IAAK,IAAI3R,EAAI,EAAGA,EAAI2R,EAAM3R,IAAK,CAC3B,MAAM8U,EAAiB,UAARL,EACfG,EAAYE,EAAS9U,EAAI2R,EAAO3R,EAAI,GAChC2U,EAAMG,EAAS9U,EAAI2U,EAAMrU,OAASN,EAAI,EAC9C,CACA,OAAO4U,CACX,CA9BWG,CAASP,EAAY,CAAEC,MAAK9C,QACvC,CACO,SAAS+C,EAAOM,GAAMP,IAAEA,EAAG9C,KAAEA,EAAO,IAAO,IAC9C,GAAa,OAATA,EACA,OAAOqD,EACX,MAAMC,EAAMD,EAAKhQ,QAAQ,KAAM,IAC/B,GAAIiQ,EAAI3U,OAAgB,EAAPqR,EACb,MAAM,IAAI0C,EAA4B,CAClC1C,KAAMzS,KAAKC,KAAK8V,EAAI3U,OAAS,GAC7BgU,WAAY3C,EACZ5B,KAAM,QAEd,MAAO,KAAKkF,EAAY,UAARR,EAAkB,SAAW,YAAmB,EAAP9C,EAAU,MACvE,CChBO,MAAMuD,UAA+BhD,EACxC,WAAAlP,EAAY1B,IAAEA,EAAGD,IAAEA,EAAG8T,OAAEA,EAAMxD,KAAEA,EAAIF,MAAEA,IAClCe,MAAM,WAAWf,qBAAyBE,EAAO,GAAU,EAAPA,SAAgBwD,EAAS,SAAW,cAAgB,mBAAmB7T,EAAM,IAAID,QAAUC,KAAS,UAAUD,OAAU,CAAEE,KAAM,0BACxL,EAEG,MAAM6T,UAAiClD,EAC1C,WAAAlP,CAAY2R,GACRnC,MAAM,gBAAgBmC,kGAAuG,CACzHpT,KAAM,4BAEd,EAYG,MAAM8T,UAA0BnD,EACnC,WAAAlP,EAAYsS,UAAEA,EAASC,QAAEA,IACrB/C,MAAM,sBAAsB+C,wBAA8BD,WAAoB,CAAE/T,KAAM,qBAC1F,EC1BG,SAASiU,GAAKhB,GAAYC,IAAEA,EAAM,QAAW,CAAA,GAChD,IAAItB,EAA6B,iBAAfqB,EAA0BA,EAAWxP,QAAQ,KAAM,IAAMwP,EACvEiB,EAAc,EAClB,IAAK,IAAIzV,EAAI,EAAGA,EAAImT,EAAK7S,OAAS,GACoC,MAA9D6S,EAAa,SAARsB,EAAiBzU,EAAImT,EAAK7S,OAASN,EAAI,GAAGiD,WADlBjD,IAE7ByV,IAQR,OAJAtC,EACY,SAARsB,EACMtB,EAAK1S,MAAMgV,GACXtC,EAAK1S,MAAM,EAAG0S,EAAK7S,OAASmV,GACZ,iBAAfjB,GACa,IAAhBrB,EAAK7S,QAAwB,UAARmU,IACrBtB,EAAO,GAAGA,MACP,KAAKA,EAAK7S,OAAS,GAAM,EAAI,IAAI6S,IAASA,KAE9CA,CACX,CCfO,SAASuC,GAAWlB,GAAY7C,KAAEA,IACrC,GAAIgE,EAAMnB,GAAc7C,EACpB,MAAM,IAAI0D,EAAkB,CACxBC,UAAWK,EAAMnB,GACjBe,QAAS5D,GAErB,CA6DO,SAASiE,GAAYX,EAAKY,EAAO,IACpC,MAAMV,OAAEA,GAAWU,EACfA,EAAKlE,MACL+D,GAAWT,EAAK,CAAEtD,KAAMkE,EAAKlE,OACjC,MAAMF,EAAQqE,OAAOb,GACrB,IAAKE,EACD,OAAO1D,EACX,MAAME,GAAQsD,EAAI3U,OAAS,GAAK,EAEhC,OAAImR,IADS,IAAsB,GAAfqE,OAAOnE,GAAa,IAAO,GAEpCF,EACJA,EAAQqE,OAAO,KAAK,IAAIC,SAAgB,EAAPpE,EAAU,QAAU,EAChE,CChFA,MAAMqE,GAAsBC,MAAMC,KAAK,CAAE5V,OAAQ,KAAO,CAAC6V,EAAInW,IAAMA,EAAEiD,SAAS,IAAI8S,SAAS,EAAG,MA4DvF,SAASK,GAAU3E,EAAOoE,EAAO,IACpC,MAAMZ,EAAM,KAAKoB,OAAO5E,KACxB,MAAyB,iBAAdoE,EAAKlE,MACZ+D,GAAWT,EAAK,CAAEtD,KAAMkE,EAAKlE,OACtB4C,EAAIU,EAAK,CAAEtD,KAAMkE,EAAKlE,QAE1BsD,CACX,CAoBO,SAASqB,GAAW7E,EAAOoE,EAAO,IACrC,IAAI1F,EAAS,GACb,IAAK,IAAInQ,EAAI,EAAGA,EAAIyR,EAAMnR,OAAQN,IAC9BmQ,GAAU6F,GAAMvE,EAAMzR,IAE1B,MAAMiV,EAAM,KAAK9E,IACjB,MAAyB,iBAAd0F,EAAKlE,MACZ+D,GAAWT,EAAK,CAAEtD,KAAMkE,EAAKlE,OACtB4C,EAAIU,EAAK,CAAER,IAAK,QAAS9C,KAAMkE,EAAKlE,QAExCsD,CACX,CAoBO,SAASsB,GAAYC,EAAQX,EAAO,IACvC,MAAMV,OAAEA,EAAMxD,KAAEA,GAASkE,EACnBpE,EAAQqE,OAAOU,GACrB,IAAIC,EACA9E,EAEI8E,EADAtB,GACY,IAAsB,GAAfW,OAAOnE,GAAa,IAAO,GAEnC,KAAsB,GAAfmE,OAAOnE,IAAc,GAEpB,iBAAX6E,IACZC,EAAWX,OAAOO,OAAO3W,mBAE7B,MAAMgX,EAA+B,iBAAbD,GAAyBtB,GAAUsB,EAAW,GAAK,EAC3E,GAAKA,GAAYhF,EAAQgF,GAAahF,EAAQiF,EAAU,CACpD,MAAMrS,EAA2B,iBAAXmS,EAAsB,IAAM,GAClD,MAAM,IAAItB,EAAuB,CAC7B5T,IAAKmV,EAAW,GAAGA,IAAWpS,SAAW4N,EACzC5Q,IAAK,GAAGqV,IAAWrS,IACnB8Q,SACAxD,OACAF,MAAO,GAAG+E,IAASnS,KAE3B,CACA,MAAM4Q,EAAM,MAAME,GAAU1D,EAAQ,GAAK,IAAMqE,OAAc,EAAPnE,IAAamE,OAAOrE,GAASA,GAAOxO,SAAS,MACnG,OAAI0O,EACO4C,EAAIU,EAAK,CAAEtD,SACfsD,CACX,CACA,MAAM0B,GAAwB,IAAIC,YAoB3B,SAASC,GAAYL,EAAQX,EAAO,IAEvC,OAAOS,GADOK,GAAQG,OAAON,GACJX,EAC7B,CCxKA,MAAMc,GAAwB,IAAIC,YA0B3B,SAASG,GAAQtF,EAAOoE,EAAO,IAClC,MAAqB,iBAAVpE,GAAuC,iBAAVA,EAiHrC,SAAuBA,EAAOoE,GACjC,MAAMZ,EAAMsB,GAAY9E,EAAOoE,GAC/B,OAAOmB,GAAW/B,EACtB,CAnHegC,CAAcxF,EAAOoE,GACX,kBAAVpE,EAyBR,SAAqBA,EAAOoE,EAAO,IACtC,MAAMlB,EAAQ,IAAIE,WAAW,GAE7B,GADAF,EAAM,GAAK0B,OAAO5E,GACO,iBAAdoE,EAAKlE,KAEZ,OADA+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OACxB4C,EAAII,EAAO,CAAEhD,KAAMkE,EAAKlE,OAEnC,OAAOgD,CACX,CAhCeuC,CAAYzF,EAAOoE,GAC1BrE,EAAMC,GACCuF,GAAWvF,EAAOoE,GACtBsB,GAAc1F,EAAOoE,EAChC,CA8BA,MAAMuB,GAAc,CAChBC,KAAM,GACNC,KAAM,GACNC,EAAG,GACHC,EAAG,GACHtX,EAAG,GACHuX,EAAG,KAEP,SAASC,GAAiBC,GACtB,OAAIA,GAAQP,GAAYC,MAAQM,GAAQP,GAAYE,KACzCK,EAAOP,GAAYC,KAC1BM,GAAQP,GAAYG,GAAKI,GAAQP,GAAYI,EACtCG,GAAQP,GAAYG,EAAI,IAC/BI,GAAQP,GAAYlX,GAAKyX,GAAQP,GAAYK,EACtCE,GAAQP,GAAYlX,EAAI,SADnC,CAGJ,CAoBO,SAAS8W,GAAWhC,EAAMa,EAAO,IACpC,IAAIZ,EAAMD,EACNa,EAAKlE,OACL+D,GAAWT,EAAK,CAAEtD,KAAMkE,EAAKlE,OAC7BsD,EAAMV,EAAIU,EAAK,CAAER,IAAK,QAAS9C,KAAMkE,EAAKlE,QAE9C,IAAIiG,EAAY3C,EAAIxU,MAAM,GACtBmX,EAAUtX,OAAS,IACnBsX,EAAY,IAAIA,KACpB,MAAMtX,EAASsX,EAAUtX,OAAS,EAC5BqU,EAAQ,IAAIE,WAAWvU,GAC7B,IAAK,IAAIuX,EAAQ,EAAGxX,EAAI,EAAGwX,EAAQvX,EAAQuX,IAAS,CAChD,MAAMC,EAAaJ,GAAiBE,EAAUpX,WAAWH,MACnD0X,EAAcL,GAAiBE,EAAUpX,WAAWH,MAC1D,QAAmB4R,IAAf6F,QAA4C7F,IAAhB8F,EAC5B,MAAM,IAAI7F,EAAU,2BAA2B0F,EAAUvX,EAAI,KAAKuX,EAAUvX,EAAI,WAAWuX,QAE/FjD,EAAMkD,GAAsB,GAAbC,EAAkBC,CACrC,CACA,OAAOpD,CACX,CA2CO,SAASwC,GAAc1F,EAAOoE,EAAO,IACxC,MAAMlB,EAAQgC,GAAQG,OAAOrF,GAC7B,MAAyB,iBAAdoE,EAAKlE,MACZ+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OACxB4C,EAAII,EAAO,CAAEF,IAAK,QAAS9C,KAAMkE,EAAKlE,QAE1CgD,CACX,CC1KA,MAAMqD,GAA6BlC,OAAO,GAAK,GAAK,GAC9CmC,GAAuBnC,OAAO,IACpC,SAASoC,GAAQnY,EAAGoY,GAAK,GACrB,OAAIA,EACO,CAAEC,EAAG/B,OAAOtW,EAAIiY,IAAa7W,EAAGkV,OAAQtW,GAAKkY,GAAQD,KACzD,CAAEI,EAAsC,EAAnC/B,OAAQtW,GAAKkY,GAAQD,IAAiB7W,EAA4B,EAAzBkV,OAAOtW,EAAIiY,IACpE,CCMO,SAASK,GAAQtY,GACpB,IAAKsW,OAAOiC,cAAcvY,IAAMA,EAAI,EAChC,MAAM,IAAIyB,MAAM,kCAAoCzB,EAC5D,CAEO,SAASwY,GAAO1X,KAAM2X,GACzB,MAVoBtY,EAUPW,aATOgU,YAAe4D,YAAYC,OAAOxY,IAA6B,eAAvBA,EAAE8C,YAAYzB,MAUtE,MAAM,IAAIC,MAAM;;AAXjB,IAAiBtB,EAYpB,GAAIsY,EAAQlY,OAAS,IAAMkY,EAAQG,SAAS9X,EAAEP,QAC1C,MAAM,IAAIkB,MAAM,iCAAmCgX,EAAU,gBAAkB3X,EAAEP,OACzF,CASO,SAASsY,GAAQC,EAAUC,GAAgB,GAC9C,GAAID,EAASE,UACT,MAAM,IAAIvX,MAAM,oCACpB,GAAIsX,GAAiBD,EAASG,SAC1B,MAAM,IAAIxX,MAAM,wCACxB,CAkBO,SAASyX,MAASC,GACrB,IAAK,IAAIlZ,EAAI,EAAGA,EAAIkZ,EAAO5Y,OAAQN,IAC/BkZ,EAAOlZ,GAAGmZ,KAAK,EAEvB,CAgBO,SAASC,GAASC,GACrB,OAAUA,GAAQ,GAAM,WAClBA,GAAQ,EAAK,SACbA,IAAS,EAAK,MACdA,IAAS,GAAM,GACzB,CAcO,MAAMC,GArBuB,KAAmE,KAA5D,IAAIzE,WAAW,IAAI1M,YAAY,CAAC,YAAaoR,QAAQ,GAA5D,GAsB7BC,GAAMA,EAPN,SAAoB3Q,GACvB,IAAK,IAAI7I,EAAI,EAAGA,EAAI6I,EAAIvI,OAAQN,IAC5B6I,EAAI7I,GAAKoZ,GAASvQ,EAAI7I,IAE1B,OAAO6I,CACX,EAuGO,SAASkO,GAAQ5D,GAIpB,MAHoB,iBAATA,IACPA,EAnBD,SAAqBvR,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIJ,MAAM,mBACpB,OAAO,IAAIqT,YAAW,IAAI+B,aAAcE,OAAOlV,GACnD,CAee6X,CAAYtG,IACvBoF,GAAOpF,GACAA,CACX,CAkCO,MAAMuG,IC9Nb,MAAMC,GAAM7D,OAAO,GACb8D,GAAM9D,OAAO,GACb+D,GAAM/D,OAAO,GACbgE,GAAMhE,OAAO,GACbiE,GAAQjE,OAAO,KACfkE,GAASlE,OAAO,KAChBmE,GAAU,GACVC,GAAY,GACZC,GAAa,GACnB,IAAK,IAAIhV,EAAQ,EAAGiV,EAAIR,GAAKjZ,EAAI,EAAGC,EAAI,EAAGuE,EAAQ,GAAIA,IAAS,EAE3DxE,EAAGC,GAAK,CAACA,GAAI,EAAID,EAAI,EAAIC,GAAK,GAC/BqZ,GAAQ1U,KAAK,GAAK,EAAI3E,EAAID,IAE1BuZ,GAAU3U,MAAQJ,EAAQ,IAAMA,EAAQ,GAAM,EAAK,IAEnD,IAAI8H,EAAI0M,GACR,IAAK,IAAItZ,EAAI,EAAGA,EAAI,EAAGA,IACnB+Z,GAAMA,GAAKR,IAASQ,GAAKN,IAAOE,IAAWD,GACvCK,EAAIP,KACJ5M,GAAK2M,KAASA,IAAuB9D,OAAOzV,IAAMuZ,IAE1DO,GAAW5U,KAAK0H,EACpB,CACA,MAAMoN,GF7BN,SAAeC,EAAKnC,GAAK,GACrB,MAAMpW,EAAMuY,EAAIha,OAChB,IAAIia,EAAK,IAAIpS,YAAYpG,GACrByY,EAAK,IAAIrS,YAAYpG,GACzB,IAAK,IAAI/B,EAAI,EAAGA,EAAI+B,EAAK/B,IAAK,CAC1B,MAAMoY,EAAEA,EAACjX,EAAEA,GAAM+W,GAAQoC,EAAIta,GAAImY,IAChCoC,EAAGva,GAAIwa,EAAGxa,IAAM,CAACoY,EAAGjX,EACzB,CACA,MAAO,CAACoZ,EAAIC,EAChB,CEoBcnM,CAAM8L,IAAY,GAC1BM,GAAcJ,GAAM,GACpBK,GAAcL,GAAM,GAEpBM,GAAQ,CAACvC,EAAGjX,EAAGhB,IAAOA,EAAI,GFNjB,EAACiY,EAAGjX,EAAGhB,IAAOgB,GAAMhB,EAAI,GAAQiY,IAAO,GAAKjY,EEMtBya,CAAOxC,EAAGjX,EAAGhB,GFTnC,EAACiY,EAAGjX,EAAGhB,IAAOiY,GAAKjY,EAAMgB,IAAO,GAAKhB,EESG0a,CAAOzC,EAAGjX,EAAGhB,GAC9D2a,GAAQ,CAAC1C,EAAGjX,EAAGhB,IAAOA,EAAI,GFNjB,EAACiY,EAAGjX,EAAGhB,IAAOiY,GAAMjY,EAAI,GAAQgB,IAAO,GAAKhB,EEMtB4a,CAAO3C,EAAGjX,EAAGhB,GFTnC,EAACiY,EAAGjX,EAAGhB,IAAOgB,GAAKhB,EAAMiY,IAAO,GAAKjY,EESG6a,CAAO5C,EAAGjX,EAAGhB,GAgD7D,MAAM8a,WAAevB,GAExB,WAAA1W,CAAYkY,EAAU7W,EAAQ8W,EAAWC,GAAY,EAAOC,EAAS,IAgBjE,GAfA7I,QACA5N,KAAK0W,IAAM,EACX1W,KAAK2W,OAAS,EACd3W,KAAKoU,UAAW,EAChBpU,KAAKmU,WAAY,EACjBnU,KAAKwW,WAAY,EACjBxW,KAAKsW,SAAWA,EAChBtW,KAAKP,OAASA,EACdO,KAAKuW,UAAYA,EACjBvW,KAAKwW,UAAYA,EACjBxW,KAAKyW,OAASA,EAEdhD,GAAQ8C,KAGF,EAAID,GAAYA,EAAW,KAC7B,MAAM,IAAI1Z,MAAM,2CD1DrB,IAAaqH,EC2DZjE,KAAK4W,MAAQ,IAAI3G,WAAW,KAC5BjQ,KAAK6W,SD5DO5S,EC4DOjE,KAAK4W,MD3DrB,IAAIrT,YAAYU,EAAI0Q,OAAQ1Q,EAAI6S,WAAYxc,KAAKG,MAAMwJ,EAAI8S,WAAa,IC4D/E,CACA,KAAAzZ,GACI,OAAO0C,KAAKgX,YAChB,CACA,MAAAC,GACIvC,GAAW1U,KAAK6W,SAzEjB,SAAiBtb,EAAGkb,EAAS,IAChC,MAAMS,EAAI,IAAI3T,YAAY,IAE1B,IAAK,IAAIhD,EAAQ,GAAKkW,EAAQlW,EAAQ,GAAIA,IAAS,CAE/C,IAAK,IAAIxE,EAAI,EAAGA,EAAI,GAAIA,IACpBmb,EAAEnb,GAAKR,EAAEQ,GAAKR,EAAEQ,EAAI,IAAMR,EAAEQ,EAAI,IAAMR,EAAEQ,EAAI,IAAMR,EAAEQ,EAAI,IAC5D,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC5B,MAAMob,GAAQpb,EAAI,GAAK,GACjBqb,GAAQrb,EAAI,GAAK,GACjBsb,EAAKH,EAAEE,GACPE,EAAKJ,EAAEE,EAAO,GACdG,EAAKxB,GAAMsB,EAAIC,EAAI,GAAKJ,EAAEC,GAC1BK,EAAKtB,GAAMmB,EAAIC,EAAI,GAAKJ,EAAEC,EAAO,GACvC,IAAK,IAAInb,EAAI,EAAGA,EAAI,GAAIA,GAAK,GACzBT,EAAEQ,EAAIC,IAAMub,EACZhc,EAAEQ,EAAIC,EAAI,IAAMwb,CAExB,CAEA,IAAIC,EAAOlc,EAAE,GACTmc,EAAOnc,EAAE,GACb,IAAK,IAAI8M,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MAAMsP,EAAQrC,GAAUjN,GAClBkP,EAAKxB,GAAM0B,EAAMC,EAAMC,GACvBH,EAAKtB,GAAMuB,EAAMC,EAAMC,GACvBC,EAAKvC,GAAQhN,GACnBoP,EAAOlc,EAAEqc,GACTF,EAAOnc,EAAEqc,EAAK,GACdrc,EAAEqc,GAAML,EACRhc,EAAEqc,EAAK,GAAKJ,CAChB,CAEA,IAAK,IAAIxb,EAAI,EAAGA,EAAI,GAAIA,GAAK,GAAI,CAC7B,IAAK,IAAID,EAAI,EAAGA,EAAI,GAAIA,IACpBmb,EAAEnb,GAAKR,EAAES,EAAID,GACjB,IAAK,IAAIA,EAAI,EAAGA,EAAI,GAAIA,IACpBR,EAAES,EAAID,KAAOmb,GAAGnb,EAAI,GAAK,IAAMmb,GAAGnb,EAAI,GAAK,GACnD,CAEAR,EAAE,IAAMsa,GAAYtV,GACpBhF,EAAE,IAAMua,GAAYvV,EACxB,CACA8T,GAAM6C,EACV,CA8BQW,CAAQ7X,KAAK6W,QAAS7W,KAAKyW,QAC3B/B,GAAW1U,KAAK6W,SAChB7W,KAAK2W,OAAS,EACd3W,KAAK0W,IAAM,CACf,CACA,MAAAoB,CAAOvJ,GACHyF,GAAQhU,MAER2T,GADApF,EAAO4D,GAAQ5D,IAEf,MAAM+H,SAAEA,EAAQM,MAAEA,GAAU5W,KACtB7C,EAAMoR,EAAK7S,OACjB,IAAK,IAAIgb,EAAM,EAAGA,EAAMvZ,GAAM,CAC1B,MAAM4a,EAAOzd,KAAKmC,IAAI6Z,EAAWtW,KAAK0W,IAAKvZ,EAAMuZ,GACjD,IAAK,IAAItb,EAAI,EAAGA,EAAI2c,EAAM3c,IACtBwb,EAAM5W,KAAK0W,QAAUnI,EAAKmI,KAC1B1W,KAAK0W,MAAQJ,GACbtW,KAAKiX,QACb,CACA,OAAOjX,IACX,CACA,MAAAgY,GACI,GAAIhY,KAAKoU,SACL,OACJpU,KAAKoU,UAAW,EAChB,MAAMwC,MAAEA,EAAKnX,OAAEA,EAAMiX,IAAEA,EAAGJ,SAAEA,GAAatW,KAEzC4W,EAAMF,IAAQjX,EACA,IAATA,GAAwBiX,IAAQJ,EAAW,GAC5CtW,KAAKiX,SACTL,EAAMN,EAAW,IAAM,IACvBtW,KAAKiX,QACT,CACA,SAAAgB,CAAUvW,GACNsS,GAAQhU,MAAM,GACd2T,GAAOjS,GACP1B,KAAKgY,SACL,MAAME,EAAYlY,KAAK4W,OACjBN,SAAEA,GAAatW,KACrB,IAAK,IAAI0W,EAAM,EAAGvZ,EAAMuE,EAAIhG,OAAQgb,EAAMvZ,GAAM,CACxC6C,KAAK2W,QAAUL,GACftW,KAAKiX,SACT,MAAMc,EAAOzd,KAAKmC,IAAI6Z,EAAWtW,KAAK2W,OAAQxZ,EAAMuZ,GACpDhV,EAAIY,IAAI4V,EAAUC,SAASnY,KAAK2W,OAAQ3W,KAAK2W,OAASoB,GAAOrB,GAC7D1W,KAAK2W,QAAUoB,EACfrB,GAAOqB,CACX,CACA,OAAOrW,CACX,CACA,OAAA0W,CAAQ1W,GAEJ,IAAK1B,KAAKwW,UACN,MAAM,IAAI5Z,MAAM,yCACpB,OAAOoD,KAAKiY,UAAUvW,EAC1B,CACA,GAAA2W,CAAItI,GAEA,OADA0D,GAAQ1D,GACD/P,KAAKoY,QAAQ,IAAInI,WAAWF,GACvC,CACA,UAAAuI,CAAW5W,GAEP,GD3ID,SAAiBA,EAAKuS,GACzBN,GAAOjS,GACP,MAAMjF,EAAMwX,EAASsC,UACrB,GAAI7U,EAAIhG,OAASe,EACb,MAAM,IAAIG,MAAM,yDAA2DH,EAEnF,CCoIQ8b,CAAQ7W,EAAK1B,MACTA,KAAKoU,SACL,MAAM,IAAIxX,MAAM,+BAGpB,OAFAoD,KAAKiY,UAAUvW,GACf1B,KAAKwY,UACE9W,CACX,CACA,MAAA+W,GACI,OAAOzY,KAAKsY,WAAW,IAAIrI,WAAWjQ,KAAKuW,WAC/C,CACA,OAAAiC,GACIxY,KAAKmU,WAAY,EACjBE,GAAMrU,KAAK4W,MACf,CACA,UAAAI,CAAW0B,GACP,MAAMpC,SAAEA,EAAQ7W,OAAEA,EAAM8W,UAAEA,EAASE,OAAEA,EAAMD,UAAEA,GAAcxW,KAY3D,OAXA0Y,IAAOA,EAAK,IAAIrC,GAAOC,EAAU7W,EAAQ8W,EAAWC,EAAWC,IAC/DiC,EAAG7B,QAAQvU,IAAItC,KAAK6W,SACpB6B,EAAGhC,IAAM1W,KAAK0W,IACdgC,EAAG/B,OAAS3W,KAAK2W,OACjB+B,EAAGtE,SAAWpU,KAAKoU,SACnBsE,EAAGjC,OAASA,EAEZiC,EAAGjZ,OAASA,EACZiZ,EAAGnC,UAAYA,EACfmC,EAAGlC,UAAYA,EACfkC,EAAGvE,UAAYnU,KAAKmU,UACbuE,CACX,EAEJ,MAAMC,GAAM,CAAClZ,EAAQ6W,EAAUC,ID+BxB,SAAsBqC,GACzB,MAAMC,EAASC,GAAQF,IAAWd,OAAO3F,GAAQ2G,IAAML,SACjDM,EAAMH,IAIZ,OAHAC,EAAMtC,UAAYwC,EAAIxC,UACtBsC,EAAMvC,SAAWyC,EAAIzC,SACrBuC,EAAMG,OAAS,IAAMJ,IACdC,CACX,CCtC6CI,CAAa,IAAM,IAAI5C,GAAOC,EAAU7W,EAAQ8W,IAYhF2C,GAA6B,KAAOP,GAAI,EAAM,IAAK,IAAtB,GC3NnC,SAASQ,GAAUtM,EAAOuM,GAC7B,MAAMV,EAAKU,GAAO,MACZrJ,EAAQmJ,GAAWtM,EAAMC,EAAO,CAAEC,QAAQ,IAAWqF,GAAQtF,GAASA,GAC5E,MAAW,UAAP6L,EACO3I,ELqBR,SAAelD,EAAOoE,EAAO,IAChC,MAAqB,iBAAVpE,GAAuC,iBAAVA,EAC7B8E,GAAY9E,EAAOoE,GACT,iBAAVpE,EACAoF,GAAYpF,EAAOoE,GAET,kBAAVpE,EACA2E,GAAU3E,EAAOoE,GACrBS,GAAW7E,EAAOoE,EAC7B,CK7BWoI,CAAMtJ,EACjB,CCPO,SAASuJ,GAAcC,GAC1B,OAFoBJ,GAAUhH,GAElBoH,GAChB,CCcO,MAAMC,GAAeC,IACX,ICbavN,EDkB1B,OExBG,SAA4BwN,GAC/B,IAAIC,GAAS,EACTC,EAAU,GACVC,EAAQ,EACRxO,EAAS,GACTyO,GAAQ,EACZ,IAAK,IAAI1e,EAAI,EAAGA,EAAIse,EAAUhe,OAAQN,IAAK,CACvC,MAAM2X,EAAO2G,EAAUte,GAUvB,GARI,CAAC,IAAK,IAAK,KAAK2Y,SAAShB,KACzB4G,GAAS,GAEA,MAAT5G,GACA8G,IACS,MAAT9G,GACA8G,IAECF,EAGL,GAAc,IAAVE,EAcS,MAAT9G,GAQJ1H,GAAU0H,EACV6G,GAAW7G,GAPkB,MAArB2G,EAAUte,EAAI,IAA0B,MAAZwe,GAA+B,OAAZA,IAC/CA,EAAU,GACVD,GAAS,QAjBb,GAAa,MAAT5G,GAAgB,CAAC,QAAS,WAAY,IAAIgB,SAAS1I,GACnDA,EAAS,QAIT,GAFAA,GAAU0H,EAEG,MAATA,EAAc,CACd+G,GAAQ,EACR,KACJ,CAeZ,CACA,IAAKA,EACD,MAAM,IAAIxM,EAAU,kCACxB,OAAOjC,CACX,CFxBW0O,CAJgB,iBAARN,EACAA,ECdM,cADKvN,EDgBDuN,GCfbtO,KACD,YAAYe,EAAQvP,QAAQmP,EAAoBI,EAAQI,WAAWJ,EAAQ8N,iBAA+C,eAA5B9N,EAAQ8N,gBACvG,IAAI9N,EAAQ8N,kBACZ,KAAK9N,EAAQ+N,SAASve,OACtB,aAAaoQ,EAAoBI,EAAQ+N,YACzC,KACW,UAAjB/N,EAAQf,KACD,SAASe,EAAQvP,QAAQmP,EAAoBI,EAAQI,WAC3C,UAAjBJ,EAAQf,KACD,SAASe,EAAQvP,QAAQmP,EAAoBI,EAAQI,WAC3C,gBAAjBJ,EAAQf,KACD,eAAeW,EAAoBI,EAAQI,WAAuC,YAA5BJ,EAAQ8N,gBAAgC,WAAa,KACjG,aAAjB9N,EAAQf,KACD,uBAAkD,YAA5Be,EAAQ8N,gBAAgC,WAAa,IAC/E,+BEjBJ,SAASE,GAAgB9L,GAC5B,OAAOkL,GAAcE,GAAYpL,GACrC,CCCO,MAAM+L,GAAkBD,GCPxB,MAAME,WAA4B9M,EACrC,WAAAlP,EAAYic,QAAEA,IACVzM,MAAM,YAAYyM,iBAAwB,CACtCxM,aAAc,CACV,iEACA,kDAEJlR,KAAM,uBAEd,ECLG,MAAM2d,WAAeC,IACxB,WAAAnc,CAAY2O,GACRa,QACAE,OAAOC,eAAe/N,KAAM,UAAW,CACnCgO,YAAY,EACZC,cAAc,EACdC,UAAU,EACVrB,WAAO,IAEX7M,KAAK2Q,QAAU5D,CACnB,CACA,GAAAyN,CAAIC,GACA,MAAM5N,EAAQe,MAAM4M,IAAIC,GAKxB,OAJI7M,MAAM8M,IAAID,SAAkBpN,IAAVR,IAClB7M,KAAK2a,OAAOF,GACZ7M,MAAMtL,IAAImY,EAAK5N,IAEZA,CACX,CACA,GAAAvK,CAAImY,EAAK5N,GAEL,GADAe,MAAMtL,IAAImY,EAAK5N,GACX7M,KAAK2Q,SAAW3Q,KAAK+M,KAAO/M,KAAK2Q,QAAS,CAC1C,MAAMiK,EAAW5a,KAAK6a,OAAOC,OAAOjO,MAChC+N,GACA5a,KAAK2a,OAAOC,EACpB,CACA,OAAO5a,IACX,EC3BJ,MAAM+a,GAAqC,IAAIT,GAAO,MAC/C,SAASU,GAAgBC,EAWhCC,GACI,GAAIH,GAAqBL,IAAI,GAAGO,KAAYC,KACxC,OAAOH,GAAqBP,IAAI,GAAGS,KAAYC,KACnD,MAAMC,EAEAF,EAAS3a,UAAU,GAAGI,cACtB0a,EAAOjC,GAAU5G,GAAc4I,GAAa,SAC5Cd,EAAU,EAAqE5Q,MAAM,IAC3F,IAAK,IAAIrO,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACrBggB,EAAKhgB,GAAK,IAAM,GAAK,GAAKif,EAAQjf,KAClCif,EAAQjf,GAAKif,EAAQjf,GAAGqF,gBAER,GAAf2a,EAAKhgB,GAAK,KAAc,GAAKif,EAAQjf,EAAI,KAC1Cif,EAAQjf,EAAI,GAAKif,EAAQjf,EAAI,GAAGqF,eAGxC,MAAM4K,EAAS,KAAKgP,EAAQ1N,KAAK,MAEjC,OADAoO,GAAqBzY,IAAI,GAAG2Y,KAAYC,IAAW7P,GAC5CA,CACX,CClCA,MAAMgQ,GAAe,sBAERC,GAA+B,IAAIhB,GAAO,MAChD,SAASiB,GAAUlB,EAASmB,GAC/B,MAAM1O,OAAEA,GAAS,GAAS0O,GAAW,CAAA,EAC/BC,EAAW,GAAGpB,KAAWvN,IAC/B,GAAIwO,GAAeZ,IAAIe,GACnB,OAAOH,GAAed,IAAIiB,GAC9B,MAAMpQ,KACGgQ,GAAanb,KAAKma,IAEnBA,EAAQ3Z,gBAAkB2Z,GAE1BvN,GACOkO,GAAgBX,KAAaA,GAI5C,OADAiB,GAAehZ,IAAImZ,EAAUpQ,GACtBA,CACX,CCrBO,SAAS/G,GAAOoX,GACnB,MAAyB,iBAAdA,EAAO,GACPC,GAAUD,GAGlB,SAAqBA,GACxB,IAAIhgB,EAAS,EACb,IAAK,MAAMuI,KAAOyX,EACdhgB,GAAUuI,EAAIvI,OAElB,MAAM2P,EAAS,IAAI4E,WAAWvU,GAC9B,IAAI6T,EAAS,EACb,IAAK,MAAMtL,KAAOyX,EACdrQ,EAAO/I,IAAI2B,EAAKsL,GAChBA,GAAUtL,EAAIvI,OAElB,OAAO2P,CACX,CAdWuQ,CAAYF,EACvB,CAcO,SAASC,GAAUD,GACtB,MAAO,KAAKA,EAAOG,OAAO,CAACC,EAAK/f,IAAM+f,EAAM/f,EAAEqE,QAAQ,KAAM,IAAK,KACrE,CCVO,SAASvE,GAAMgR,EAAOkP,EAAOC,GAAKlP,OAAEA,GAAW,IAClD,OAAIF,EAAMC,EAAO,CAAEC,QAAQ,IAgDxB,SAAkB8E,EAAQmK,EAAOC,GAAKlP,OAAEA,GAAW,IACtDmP,GAAkBrK,EAAQmK,GAC1B,MAAMlP,EAAQ,KAAK+E,EACdxR,QAAQ,KAAM,IACdvE,MAAqB,GAAdkgB,GAAS,GAAiC,GAAxBC,GAAOpK,EAAOlW,WACxCoR,GACAoP,GAAgBrP,EAAOkP,EAAOC,GAClC,OAAOnP,CACX,CAvDesP,CAAStP,EAAOkP,EAAOC,EAAK,CAC/BlP,WAEDsP,GAAWvP,EAAOkP,EAAOC,EAAK,CACjClP,UAER,CACA,SAASmP,GAAkBpP,EAAOkP,GAC9B,GAAqB,iBAAVA,GAAsBA,EAAQ,GAAKA,EAAQhP,EAAKF,GAAS,EAChE,MAAM,IAAIyC,EAA4B,CAClCC,OAAQwM,EACRvM,SAAU,QACVzC,KAAMA,EAAKF,IAEvB,CACA,SAASqP,GAAgBrP,EAAOkP,EAAOC,GACnC,GAAqB,iBAAVD,GACQ,iBAARC,GACPjP,EAAKF,KAAWmP,EAAMD,EACtB,MAAM,IAAIzM,EAA4B,CAClCC,OAAQyM,EACRxM,SAAU,MACVzC,KAAMA,EAAKF,IAGvB,CAQO,SAASuP,GAAWxK,EAAQmK,EAAOC,GAAKlP,OAAEA,GAAW,IACxDmP,GAAkBrK,EAAQmK,GAC1B,MAAMlP,EAAQ+E,EAAO/V,MAAMkgB,EAAOC,GAGlC,OAFIlP,GACAoP,GAAgBrP,EAAOkP,EAAOC,GAC3BnP,CACX,CC7CO,MAAMwP,GAAe,iICwCrB,SAASC,GAAoBtQ,EAAQ0P,GACxC,GAAI1P,EAAOtQ,SAAWggB,EAAOhgB,OACzB,MAAM,IAAIoT,EAA+B,CACrCJ,eAAgB1C,EAAOtQ,OACvBiT,YAAa+M,EAAOhgB,SAG5B,MAAM6gB,EASV,UAAuBvQ,OAAEA,EAAM0P,OAAEA,IAC7B,MAAMa,EAAiB,GACvB,IAAK,IAAInhB,EAAI,EAAGA,EAAI4Q,EAAOtQ,OAAQN,IAC/BmhB,EAAe5b,KAAK6b,GAAa,CAAEhQ,MAAOR,EAAO5Q,GAAIyR,MAAO6O,EAAOtgB,MAEvE,OAAOmhB,CACX,CAf2BE,CAAc,CACjCzQ,OAAQA,EACR0P,OAAQA,IAENnN,EAAOmO,GAAaH,GAC1B,OAAoB,IAAhBhO,EAAK7S,OACE,KACJ6S,CACX,CAQA,SAASiO,IAAahQ,MAAEA,EAAKK,MAAEA,IAC3B,MAAM8P,EAAkBC,GAAmBpQ,EAAMrB,MACjD,GAAIwR,EAAiB,CACjB,MAAOjhB,EAAQyP,GAAQwR,EACvB,OAgER,SAAqB9P,GAAOnR,OAAEA,EAAM8Q,MAAEA,IAClC,MAAMqQ,EAAqB,OAAXnhB,EAChB,IAAK2V,MAAMyL,QAAQjQ,GACf,MAAM,IAAIwC,EAAkBxC,GAChC,IAAKgQ,GAAWhQ,EAAMnR,SAAWA,EAC7B,MAAM,IAAI+S,EAAoC,CAC1CC,eAAgBhT,EAChBiT,YAAa9B,EAAMnR,OACnByP,KAAM,GAAGqB,EAAMrB,QAAQzP,OAE/B,IAAIqhB,GAAe,EACnB,MAAMR,EAAiB,GACvB,IAAK,IAAInhB,EAAI,EAAGA,EAAIyR,EAAMnR,OAAQN,IAAK,CACnC,MAAM4hB,EAAgBR,GAAa,CAAEhQ,QAAOK,MAAOA,EAAMzR,KACrD4hB,EAAcH,UACdE,GAAe,GACnBR,EAAe5b,KAAKqc,EACxB,CACA,GAAIH,GAAWE,EAAc,CACzB,MAAMxO,EAAOmO,GAAaH,GAC1B,GAAIM,EAAS,CACT,MAAMnhB,EAASiW,GAAY4K,EAAe7gB,OAAQ,CAAEqR,KAAM,KAC1D,MAAO,CACH8P,SAAS,EACTI,QAASV,EAAe7gB,OAAS,EAAI4I,GAAO,CAAC5I,EAAQ6S,IAAS7S,EAEtE,CACA,GAAIqhB,EACA,MAAO,CAAEF,SAAS,EAAMI,QAAS1O,EACzC,CACA,MAAO,CACHsO,SAAS,EACTI,QAAS3Y,GAAOiY,EAAehQ,IAAI,EAAG0Q,aAAcA,IAE5D,CAlGeC,CAAYrQ,EAAO,CAAEnR,SAAQ8Q,MAAO,IAAKA,EAAOrB,SAC3D,CACA,GAAmB,UAAfqB,EAAMrB,KACN,OAmKR,SAAqB0B,GAAOL,MAAEA,IAC1B,IAAIqQ,GAAU,EACd,MAAMN,EAAiB,GACvB,IAAK,IAAInhB,EAAI,EAAGA,EAAIoR,EAAMpB,WAAW1P,OAAQN,IAAK,CAC9C,MAAM+hB,EAAS3Q,EAAMpB,WAAWhQ,GAE1B4hB,EAAgBR,GAAa,CAC/BhQ,MAAO2Q,EACPtQ,MAAOA,EAHGwE,MAAMyL,QAAQjQ,GAASzR,EAAI+hB,EAAOxgB,QAKhD4f,EAAe5b,KAAKqc,GAChBA,EAAcH,UACdA,GAAU,EAClB,CACA,MAAO,CACHA,UACAI,QAASJ,EACHH,GAAaH,GACbjY,GAAOiY,EAAehQ,IAAI,EAAG0Q,aAAcA,IAEzD,CAvLeG,CAAYvQ,EAAO,CACtBL,MAAOA,IAGf,GAAmB,YAAfA,EAAMrB,KACN,OAmDR,SAAuB0B,GACnB,IAAK0O,GAAU1O,GACX,MAAM,IAAIuN,GAAoB,CAAEC,QAASxN,IAC7C,MAAO,CAAEgQ,SAAS,EAAOI,QAASnN,EAAOjD,EAAMnM,eACnD,CAvDe2c,CAAcxQ,GAEzB,GAAmB,SAAfL,EAAMrB,KACN,OAgHR,SAAoB0B,GAChB,GAAqB,kBAAVA,EACP,MAAM,IAAIS,EAAU,2BAA2BT,oBAAwBA,wCAC3E,MAAO,CAAEgQ,SAAS,EAAOI,QAASnN,EAAO0B,GAAU3E,IACvD,CApHeyQ,CAAWzQ,GAEtB,GAAIL,EAAMrB,KAAKsB,WAAW,SAAWD,EAAMrB,KAAKsB,WAAW,OAAQ,CAC/D,MAAM8D,EAAS/D,EAAMrB,KAAKsB,WAAW,QAC/B,CAAA,CAAKM,EAAO,OAASsP,GAAa5Q,KAAKe,EAAMrB,OAAS,GAC5D,OAgHR,SAAsB0B,GAAO0D,OAAEA,EAAMxD,KAAEA,EAAO,MAC1C,GAAoB,iBAATA,EAAmB,CAC1B,MAAMrQ,EAAM,KAAOwU,OAAOnE,IAASwD,EAAS,GAAK,KAAO,GAClD9T,EAAM8T,GAAU7T,EAAM,GAAK,GACjC,GAAImQ,EAAQnQ,GAAOmQ,EAAQpQ,EACvB,MAAM,IAAI6T,EAAuB,CAC7B5T,IAAKA,EAAI2B,WACT5B,IAAKA,EAAI4B,WACTkS,SACAxD,KAAMA,EAAO,EACbF,MAAOA,EAAMxO,YAEzB,CACA,MAAO,CACHwe,SAAS,EACTI,QAAStL,GAAY9E,EAAO,CACxBE,KAAM,GACNwD,WAGZ,CApIegN,CAAa1Q,EAAO,CACvB0D,SACAxD,KAAM0E,OAAO1E,IAErB,CACA,GAAIP,EAAMrB,KAAKsB,WAAW,SACtB,OA6ER,SAAqBI,GAAOL,MAAEA,IAC1B,MAAM,CAAGgR,GAAahR,EAAMrB,KAAK1B,MAAM,SACjCgU,EAAY1Q,EAAKF,GACvB,IAAK2Q,EAAW,CACZ,IAAI5L,EAAS/E,EAQb,OALI4Q,EAAY,IAAO,IACnB7L,EAAS9B,EAAO8B,EAAQ,CACpB/B,IAAK,QACL9C,KAA+C,GAAzCzS,KAAKC,MAAMsS,EAAMnR,OAAS,GAAK,EAAI,OAE1C,CACHmhB,SAAS,EACTI,QAAS3Y,GAAO,CAACwL,EAAO6B,GAAY8L,EAAW,CAAE1Q,KAAM,MAAQ6E,IAEvE,CACA,GAAI6L,IAAchM,OAAOiM,SAASF,EAAW,IACzC,MAAM,IAAI5O,EAAkC,CACxCC,aAAc4C,OAAOiM,SAASF,EAAW,IACzC3Q,UAER,MAAO,CAAEgQ,SAAS,EAAOI,QAASnN,EAAOjD,EAAO,CAAEgD,IAAK,UAC3D,CApGe8N,CAAY9Q,EAAO,CAAEL,UAEhC,GAAmB,WAAfA,EAAMrB,KACN,OA4HR,SAAsB0B,GAClB,MAAM+Q,EAAW3L,GAAYpF,GACvBgR,EAAcvjB,KAAKC,KAAKwS,EAAK6Q,GAAY,IACzCE,EAAQ,GACd,IAAK,IAAI1iB,EAAI,EAAGA,EAAIyiB,EAAaziB,IAC7B0iB,EAAMnd,KAAKmP,EAAOjU,GAAM+hB,EAAc,GAAJxiB,EAAkB,IAATA,EAAI,IAAU,CACrDyU,IAAK,WAGb,MAAO,CACHgN,SAAS,EACTI,QAAS3Y,GAAO,CACZwL,EAAO6B,GAAY5E,EAAK6Q,GAAW,CAAE7Q,KAAM,SACxC+Q,IAGf,CA5IeC,CAAalR,GAExB,MAAM,IAAIsC,EAA4B3C,EAAMrB,KAAM,CAC9CgC,SAAU,sCAElB,CACA,SAASuP,GAAaH,GAElB,IAAIyB,EAAa,EACjB,IAAK,IAAI5iB,EAAI,EAAGA,EAAImhB,EAAe7gB,OAAQN,IAAK,CAC5C,MAAMyhB,QAAEA,EAAOI,QAAEA,GAAYV,EAAenhB,GAExC4iB,GADAnB,EACc,GAEA9P,EAAKkQ,EAC3B,CAEA,MAAMgB,EAAe,GACfC,EAAgB,GACtB,IAAIC,EAAc,EAClB,IAAK,IAAI/iB,EAAI,EAAGA,EAAImhB,EAAe7gB,OAAQN,IAAK,CAC5C,MAAMyhB,QAAEA,EAAOI,QAAEA,GAAYV,EAAenhB,GACxCyhB,GACAoB,EAAatd,KAAKgR,GAAYqM,EAAaG,EAAa,CAAEpR,KAAM,MAChEmR,EAAcvd,KAAKsc,GACnBkB,GAAepR,EAAKkQ,IAGpBgB,EAAatd,KAAKsc,EAE1B,CAEA,OAAO3Y,GAAO,IAAI2Z,KAAiBC,GACvC,CAiIO,SAAStB,GAAmBzR,GAC/B,MAAMiT,EAAUjT,EAAKK,MAAM,oBAC3B,OAAO4S,EAEC,CAACA,EAAQ,GAAK3M,OAAO2M,EAAQ,IAAM,KAAMA,EAAQ,SACnD/Q,CACV,CCjQO,MAAMgR,GAAsBjQ,GAAOvS,GAAMqe,GAAgB9L,GAAK,EAAG,GCJjE,SAASkQ,GAAWC,GACvB,MAAMC,IAAEA,EAAGtd,KAAEA,EAAO,GAAEvE,KAAEA,GAAS4hB,EAC3BE,EAAa7R,EAAMjQ,EAAM,CAAEmQ,QAAQ,IACnC4R,EAAWF,EAAIG,OAAQzS,GACrBuS,EACqB,aAAjBvS,EAAQf,KACDkT,GAAmBnS,KAAavP,EACtB,UAAjBuP,EAAQf,MACDgP,GAAgBjO,KAAavP,EAGrC,SAAUuP,GAAWA,EAAQvP,OAASA,GAEjD,GAAwB,IAApB+hB,EAAShjB,OACT,OACJ,GAAwB,IAApBgjB,EAAShjB,OACT,OAAOgjB,EAAS,GACpB,IAAIE,EACJ,IAAK,MAAM1S,KAAWwS,EAAU,CAC5B,KAAM,WAAYxS,GACd,SACJ,IAAKhL,GAAwB,IAAhBA,EAAKxF,OAAc,CAC5B,IAAKwQ,EAAQI,QAAoC,IAA1BJ,EAAQI,OAAO5Q,OAClC,OAAOwQ,EACX,QACJ,CACA,IAAKA,EAAQI,OACT,SACJ,GAA8B,IAA1BJ,EAAQI,OAAO5Q,OACf,SACJ,GAAIwQ,EAAQI,OAAO5Q,SAAWwF,EAAKxF,OAC/B,SAOJ,GANgBwF,EAAK2d,MAAM,CAACC,EAAK7L,KAC7B,MAAM/H,EAAe,WAAYgB,GAAWA,EAAQI,OAAO2G,GAC3D,QAAK/H,GAEE6T,GAAYD,EAAK5T,KAEf,CAET,GAAI0T,GACA,WAAYA,GACZA,EAAetS,OAAQ,CACvB,MAAM0S,EAAiBC,GAAkB/S,EAAQI,OAAQsS,EAAetS,OAAQpL,GAChF,GAAI8d,EACA,MAAM,IAAI9P,EAAsB,CAC5BhD,UACAf,KAAM6T,EAAe,IACtB,CACC9S,QAAS0S,EACTzT,KAAM6T,EAAe,IAEjC,CACAJ,EAAiB1S,CACrB,CACJ,CACA,OAAI0S,GAEGF,EAAS,EACpB,CAEO,SAASK,GAAYD,EAAK5T,GAC7B,MAAMgU,SAAiBJ,EACjBK,EAAmBjU,EAAaC,KACtC,OAAQgU,GACJ,IAAK,UACD,OAAO5D,GAAUuD,EAAK,CAAEhS,QAAQ,IACpC,IAAK,OACD,MAAmB,YAAZoS,EACX,IAAK,WAEL,IAAK,SACD,MAAmB,WAAZA,EACX,QACI,MAAyB,UAArBC,GAAgC,eAAgBjU,EACzC4C,OAAO4N,OAAOxQ,EAAaE,YAAYyT,MAAM,CAACO,EAAWnM,IACrD8L,GAAYjR,OAAO4N,OAAOoD,GAAK7L,GAAQmM,IAIlD,+HAA+Hlf,KAAKif,GACjH,WAAZD,GAAoC,WAAZA,EAG/B,uCAAuChf,KAAKif,GACzB,WAAZD,GAAwBJ,aAAe7O,aAG9C,oCAAoC/P,KAAKif,KACjC9N,MAAMyL,QAAQgC,IAClBA,EAAID,MAAO9iB,GAAMgjB,GAAYhjB,EAAG,IACzBmP,EAEHC,KAAMgU,EAAiB/e,QAAQ,mBAAoB,QAM3E,CAEO,SAAS6e,GAAkBI,EAAkBC,EAAkBpe,GAClE,IAAK,MAAMqe,KAAkBF,EAAkB,CAC3C,MAAMG,EAAkBH,EAAiBE,GACnCE,EAAkBH,EAAiBC,GACzC,GAA6B,UAAzBC,EAAgBrU,MACS,UAAzBsU,EAAgBtU,MAChB,eAAgBqU,GAChB,eAAgBC,EAChB,OAAOR,GAAkBO,EAAgBpU,WAAYqU,EAAgBrU,WAAYlK,EAAKqe,IAC1F,MAAMG,EAAQ,CAACF,EAAgBrU,KAAMsU,EAAgBtU,MAUrD,GATkB,QACVuU,EAAM3L,SAAS,aAAc2L,EAAM3L,SAAS,cAE5C2L,EAAM3L,SAAS,YAAc2L,EAAM3L,SAAS,cAE5C2L,EAAM3L,SAAS,aAAc2L,EAAM3L,SAAS,YADrCwH,GAAUra,EAAKqe,GAAiB,CAAEzS,QAAQ,IAJvC,GAUd,OAAO4S,CACf,CAEJ,CC7HA,MAAMvS,GAAW,oCCDV,SAASwS,GAAmBpB,GAC/B,MAAMrd,KAAEA,GAASqd,GACXC,IAAEA,EAAGxP,aAAEA,GACqB,IAA1BuP,EAAWC,IAAI9iB,QACf6iB,EAAWvP,cAAcvC,WAAW,MAC7B8R,EDHZ,SAAmCA,GACtC,MAAMC,IAAEA,EAAGtd,KAAEA,EAAI8N,aAAEA,GAAiBuP,EACpC,IAAIrS,EAAUsS,EAAI,GAClB,GAAIxP,EAAc,CACd,MAAM4Q,EAAOtB,GAAW,CACpBE,MACAtd,OACAvE,KAAMqS,IAEV,IAAK4Q,EACD,MAAM,IAAI7Q,EAAyBC,EAAc,CAAA7B,SAAEA,KACvDjB,EAAU0T,CACd,CACA,GAAqB,aAAjB1T,EAAQf,KACR,MAAM,IAAI4D,OAAyB1B,EAAW,CAAAF,SAAEA,KACpD,MAAO,CACHqR,IAAK,CAACtS,GACN8C,aAAcqP,GAAmBpS,EAAcC,IAEvD,CCfe2T,CAA0BtB,GAE/BrS,EAAUsS,EAAI,GAKpB,OAAO7C,GAAU,CAJC3M,GACL,WAAY9C,GAAWA,EAAQI,OACtCgQ,GAAoBpQ,EAAQI,OAAQpL,GAAQ,SAC5CmM,IAC+B,MACzC,CChBO,MAAMyS,WAA4BxS,EACrC,WAAAlP,EAAYmR,OAAEA,IACV3B,MAAM,YAAY2B,0BAAgC,CAC9C5S,KAAM,uBAEd,EAEG,MAAMojB,WAAiCzS,EAC1C,WAAAlP,EAAY1C,OAAEA,EAAM8T,SAAEA,IAClB5B,MAAM,cAAc4B,0CAAiD9T,QAAc,CAAEiB,KAAM,4BAC/F,EAEG,MAAMqjB,WAAwC1S,EACjD,WAAAlP,EAAY6hB,MAAEA,EAAKC,MAAEA,IACjBtS,MAAM,6BAA6BsS,yCAA6CD,QAAa,CAAEtjB,KAAM,mCACzG,ECfJ,MAAMwjB,GAAe,CACjBpQ,MAAO,IAAIE,WACXmQ,SAAU,IAAIC,SAAS,IAAIxM,YAAY,IACvCrE,SAAU,EACV8Q,kBAAmB,IAAI/F,IACvBgG,mBAAoB,EACpBC,mBAAoB/O,OAAOgP,kBAC3B,eAAAC,GACI,GAAI1gB,KAAKugB,oBAAsBvgB,KAAKwgB,mBAChC,MAAM,IAAIR,GAAgC,CACtCC,MAAOjgB,KAAKugB,mBAAqB,EACjCL,MAAOlgB,KAAKwgB,oBAExB,EACA,cAAAG,CAAenR,GACX,GAAIA,EAAW,GAAKA,EAAWxP,KAAK+P,MAAMrU,OAAS,EAC/C,MAAM,IAAIqkB,GAAyB,CAC/BrkB,OAAQsE,KAAK+P,MAAMrU,OACnB8T,YAEZ,EACA,iBAAAoR,CAAkBrR,GACd,GAAIA,EAAS,EACT,MAAM,IAAIuQ,GAAoB,CAAEvQ,WACpC,MAAMC,EAAWxP,KAAKwP,SAAWD,EACjCvP,KAAK2gB,eAAenR,GACpBxP,KAAKwP,SAAWA,CACpB,EACA,YAAAqR,CAAarR,GACT,OAAOxP,KAAKsgB,kBAAkB9F,IAAIhL,GAAYxP,KAAKwP,WAAa,CACpE,EACA,iBAAAsR,CAAkBvR,GACd,GAAIA,EAAS,EACT,MAAM,IAAIuQ,GAAoB,CAAEvQ,WACpC,MAAMC,EAAWxP,KAAKwP,SAAWD,EACjCvP,KAAK2gB,eAAenR,GACpBxP,KAAKwP,SAAWA,CACpB,EACA,WAAAuR,CAAYC,GACR,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,GACbxP,KAAK+P,MAAMP,EACtB,EACA,YAAAyR,CAAavlB,EAAQslB,GACjB,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,EAAW9T,EAAS,GACjCsE,KAAK+P,MAAMoI,SAAS3I,EAAUA,EAAW9T,EACpD,EACA,YAAAwlB,CAAaF,GACT,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,GACbxP,KAAK+P,MAAMP,EACtB,EACA,aAAA2R,CAAcH,GACV,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,EAAW,GACxBxP,KAAKogB,SAASgB,UAAU5R,EACnC,EACA,aAAA6R,CAAcL,GACV,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,EAAW,IACtBxP,KAAKogB,SAASgB,UAAU5R,IAAa,GAC1CxP,KAAKogB,SAASkB,SAAS9R,EAAW,EAC1C,EACA,aAAA+R,CAAcP,GACV,MAAMxR,EAAWwR,GAAahhB,KAAKwP,SAEnC,OADAxP,KAAK2gB,eAAenR,EAAW,GACxBxP,KAAKogB,SAASoB,UAAUhS,EACnC,EACA,QAAAiS,CAASC,GACL1hB,KAAK2gB,eAAe3gB,KAAKwP,UACzBxP,KAAK+P,MAAM/P,KAAKwP,UAAYkS,EAC5B1hB,KAAKwP,UACT,EACA,SAAAmS,CAAU5R,GACN/P,KAAK2gB,eAAe3gB,KAAKwP,SAAWO,EAAMrU,OAAS,GACnDsE,KAAK+P,MAAMzN,IAAIyN,EAAO/P,KAAKwP,UAC3BxP,KAAKwP,UAAYO,EAAMrU,MAC3B,EACA,SAAAkmB,CAAU/U,GACN7M,KAAK2gB,eAAe3gB,KAAKwP,UACzBxP,KAAK+P,MAAM/P,KAAKwP,UAAY3C,EAC5B7M,KAAKwP,UACT,EACA,UAAAqS,CAAWhV,GACP7M,KAAK2gB,eAAe3gB,KAAKwP,SAAW,GACpCxP,KAAKogB,SAAS0B,UAAU9hB,KAAKwP,SAAU3C,GACvC7M,KAAKwP,UAAY,CACrB,EACA,UAAAuS,CAAWlV,GACP7M,KAAK2gB,eAAe3gB,KAAKwP,SAAW,GACpCxP,KAAKogB,SAAS0B,UAAU9hB,KAAKwP,SAAU3C,GAAS,GAChD7M,KAAKogB,SAAS4B,SAAShiB,KAAKwP,SAAW,EAAW,IAAR3C,GAC1C7M,KAAKwP,UAAY,CACrB,EACA,UAAAyS,CAAWpV,GACP7M,KAAK2gB,eAAe3gB,KAAKwP,SAAW,GACpCxP,KAAKogB,SAAS8B,UAAUliB,KAAKwP,SAAU3C,GACvC7M,KAAKwP,UAAY,CACrB,EACA,QAAA2S,GACIniB,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAK+gB,cAEnB,OADA/gB,KAAKwP,WACE3C,CACX,EACA,SAAAwV,CAAU3mB,EAAQqR,GACd/M,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAKihB,aAAavlB,GAEhC,OADAsE,KAAKwP,UAAYzC,GAAQrR,EAClBmR,CACX,EACA,SAAAyV,GACItiB,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAKkhB,eAEnB,OADAlhB,KAAKwP,UAAY,EACV3C,CACX,EACA,UAAA0V,GACIviB,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAKmhB,gBAEnB,OADAnhB,KAAKwP,UAAY,EACV3C,CACX,EACA,UAAA2V,GACIxiB,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAKqhB,gBAEnB,OADArhB,KAAKwP,UAAY,EACV3C,CACX,EACA,UAAA4V,GACIziB,KAAK0gB,kBACL1gB,KAAKoiB,SACL,MAAMvV,EAAQ7M,KAAKuhB,gBAEnB,OADAvhB,KAAKwP,UAAY,EACV3C,CACX,EACA,aAAI6V,GACA,OAAO1iB,KAAK+P,MAAMrU,OAASsE,KAAKwP,QACpC,EACA,WAAAmT,CAAYnT,GACR,MAAMoT,EAAc5iB,KAAKwP,SAGzB,OAFAxP,KAAK2gB,eAAenR,GACpBxP,KAAKwP,SAAWA,EACT,IAAOxP,KAAKwP,SAAWoT,CAClC,EACA,MAAAR,GACI,GAAIpiB,KAAKwgB,qBAAuB/O,OAAOgP,kBACnC,OACJ,MAAMR,EAAQjgB,KAAK6gB,eACnB7gB,KAAKsgB,kBAAkBhe,IAAItC,KAAKwP,SAAUyQ,EAAQ,GAC9CA,EAAQ,GACRjgB,KAAKugB,oBACb,GCzGG,SAASsC,GAAc9S,EAAOkB,EAAO,SACf,IAAdA,EAAKlE,MACZ+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OAEnC,OAAOiE,GADKU,GAAW3B,EAAOkB,GACNA,EAC5B,CAeO,SAAS6R,GAAYC,EAAQ9R,EAAO,IACvC,IAAIlB,EAAQgT,EAKZ,QAJyB,IAAd9R,EAAKlE,OACZ+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OAC/BgD,EAAQa,GAAKb,IAEbA,EAAMrU,OAAS,GAAKqU,EAAM,GAAK,EAC/B,MAAM,IAAIS,EAAyBT,GACvC,OAAOiT,QAAQjT,EAAM,GACzB,CAeO,SAASkT,GAAclT,EAAOkB,EAAO,SACf,IAAdA,EAAKlE,MACZ+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OAEnC,O3BgCG,SAAqBsD,EAAKY,EAAO,IACpC,OAAOQ,OAAOT,GAAYX,EAAKY,GACnC,C2BlCWiS,CADKxR,GAAW3B,EAAOkB,GACNA,EAC5B,CC7FO,SAASkS,GAAoBnX,EAAQuC,GACxC,MAAMwB,EAAwB,iBAATxB,EAAoB6D,GAAW7D,GAAQA,EACtD6U,EFqJH,SAAsBrT,GAAOyQ,mBAAEA,EAAqB,MAAU,CAAA,GACjE,MAAM4C,EAAStV,OAAOkL,OAAOmH,IAK7B,OAJAiD,EAAOrT,MAAQA,EACfqT,EAAOhD,SAAW,IAAIC,SAAStQ,EAAM4E,OAAQ5E,EAAM+G,WAAY/G,EAAMgH,YACrEqM,EAAO9C,kBAAoB,IAAI/F,IAC/B6I,EAAO5C,mBAAqBA,EACrB4C,CACX,CE5JmBC,CAAatT,GAC5B,GAAoB,IAAhBhD,EAAKgD,IAAgB/D,EAAOtQ,OAAS,EACrC,MAAM,IAAI8S,EACd,GAAIzB,EAAKwB,IAASxB,EAAKwB,GAAQ,GAC3B,MAAM,IAAID,EAAiC,CACvCC,KAAsB,iBAATA,EAAoBA,EAAOmD,GAAWnD,GACnDvC,OAAQA,EACRe,KAAMA,EAAKwB,KAEnB,IAAI+U,EAAW,EACf,MAAM5H,EAAS,GACf,IAAK,IAAItgB,EAAI,EAAGA,EAAI4Q,EAAOtQ,SAAUN,EAAG,CACpC,MAAMoR,EAAQR,EAAO5Q,GACrBgoB,EAAOT,YAAYW,GACnB,MAAO/U,EAAMgV,GAAaC,GAAgBJ,EAAQ5W,EAAO,CACrDiX,eAAgB,IAEpBH,GAAYC,EACZ7H,EAAO/a,KAAK4N,EAChB,CACA,OAAOmN,CACX,CACA,SAAS8H,GAAgBJ,EAAQ5W,GAAOiX,eAAEA,IACtC,MAAM9G,EAAkBC,GAAmBpQ,EAAMrB,MACjD,GAAIwR,EAAiB,CACjB,MAAOjhB,EAAQyP,GAAQwR,EACvB,OA0BR,SAAqByG,EAAQ5W,GAAO9Q,OAAEA,EAAM+nB,eAAEA,IAG1C,IAAK/nB,EAAQ,CAET,MAEMqgB,EAAQ0H,EAFCR,GAAcG,EAAOf,UAAUqB,KAGxCC,EAAc5H,EAAQ6H,GAE5BR,EAAOT,YAAY5G,GACnB,MAAMrgB,EAASunB,GAAcG,EAAOf,UAAUuB,KAExC7G,EAAe8G,GAAgBrX,GACrC,IAAI8W,EAAW,EACf,MAAMzW,EAAQ,GACd,IAAK,IAAIzR,EAAI,EAAGA,EAAIM,IAAUN,EAAG,CAG7BgoB,EAAOT,YAAYgB,GAAe5G,EAAmB,GAAJ3hB,EAASkoB,IAC1D,MAAO/U,EAAMgV,GAAaC,GAAgBJ,EAAQ5W,EAAO,CACrDiX,eAAgBE,IAEpBL,GAAYC,EACZ1W,EAAMlM,KAAK4N,EACf,CAGA,OADA6U,EAAOT,YAAYc,EAAiB,IAC7B,CAAC5W,EAAO,GACnB,CAIA,GAAIgX,GAAgBrX,GAAQ,CAExB,MAEMuP,EAAQ0H,EAFCR,GAAcG,EAAOf,UAAUqB,KAGxC7W,EAAQ,GACd,IAAK,IAAIzR,EAAI,EAAGA,EAAIM,IAAUN,EAAG,CAE7BgoB,EAAOT,YAAY5G,EAAY,GAAJ3gB,GAC3B,MAAOmT,GAAQiV,GAAgBJ,EAAQ5W,EAAO,CAC1CiX,eAAgB1H,IAEpBlP,EAAMlM,KAAK4N,EACf,CAGA,OADA6U,EAAOT,YAAYc,EAAiB,IAC7B,CAAC5W,EAAO,GACnB,CAGA,IAAIyW,EAAW,EACf,MAAMzW,EAAQ,GACd,IAAK,IAAIzR,EAAI,EAAGA,EAAIM,IAAUN,EAAG,CAC7B,MAAOmT,EAAMgV,GAAaC,GAAgBJ,EAAQ5W,EAAO,CACrDiX,eAAgBA,EAAiBH,IAErCA,GAAYC,EACZ1W,EAAMlM,KAAK4N,EACf,CACA,MAAO,CAAC1B,EAAOyW,EACnB,CAzFeQ,CAAYV,EAAQ,IAAK5W,EAAOrB,QAAQ,CAAEzP,SAAQ+nB,kBAC7D,CACA,GAAmB,UAAfjX,EAAMrB,KACN,OA2HR,SAAqBiY,EAAQ5W,GAAOiX,eAAEA,IAKlC,MAAMM,EAA8C,IAA5BvX,EAAMpB,WAAW1P,QAAgB8Q,EAAMpB,WAAW4Y,KAAK,EAAGrnB,WAAYA,GAGxFkQ,EAAQkX,EAAkB,GAAK,CAAA,EACrC,IAAIT,EAAW,EAGf,GAAIO,GAAgBrX,GAAQ,CAExB,MAEMuP,EAAQ0H,EAFCR,GAAcG,EAAOf,UAAUqB,KAG9C,IAAK,IAAItoB,EAAI,EAAGA,EAAIoR,EAAMpB,WAAW1P,SAAUN,EAAG,CAC9C,MAAMgkB,EAAY5S,EAAMpB,WAAWhQ,GACnCgoB,EAAOT,YAAY5G,EAAQuH,GAC3B,MAAO/U,EAAMgV,GAAaC,GAAgBJ,EAAQhE,EAAW,CACzDqE,eAAgB1H,IAEpBuH,GAAYC,EACZ1W,EAAMkX,EAAkB3oB,EAAIgkB,GAAWziB,MAAQ4R,CACnD,CAGA,OADA6U,EAAOT,YAAYc,EAAiB,IAC7B,CAAC5W,EAAO,GACnB,CAGA,IAAK,IAAIzR,EAAI,EAAGA,EAAIoR,EAAMpB,WAAW1P,SAAUN,EAAG,CAC9C,MAAMgkB,EAAY5S,EAAMpB,WAAWhQ,IAC5BmT,EAAMgV,GAAaC,GAAgBJ,EAAQhE,EAAW,CACzDqE,mBAEJ5W,EAAMkX,EAAkB3oB,EAAIgkB,GAAWziB,MAAQ4R,EAC/C+U,GAAYC,CAChB,CACA,MAAO,CAAC1W,EAAOyW,EACnB,CApKeW,CAAYb,EAAQ5W,EAAO,CAAEiX,mBACxC,GAAmB,YAAfjX,EAAMrB,KACN,OAiBR,SAAuBiY,GACnB,MAAMvW,EAAQuW,EAAOf,UAAU,IAC/B,MAAO,CAACrH,GAAgBtJ,GAAW0K,GAAWvP,SAAe,GACjE,CApBeqX,CAAcd,GACzB,GAAmB,SAAf5W,EAAMrB,KACN,OAmFR,SAAoBiY,GAChB,MAAO,CAACN,GAAYM,EAAOf,UAAU,IAAK,CAAEtV,KAAM,KAAO,GAC7D,CArFeoX,CAAWf,GACtB,GAAI5W,EAAMrB,KAAKsB,WAAW,SACtB,OAoFR,SAAqB2W,EAAQ5W,GAAOiX,eAAEA,IAClC,MAAOW,EAAGrX,GAAQP,EAAMrB,KAAK1B,MAAM,SACnC,IAAKsD,EAAM,CAEP,MAAMwC,EAAS0T,GAAcG,EAAOf,UAAU,KAE9Ce,EAAOT,YAAYc,EAAiBlU,GACpC,MAAM7T,EAASunB,GAAcG,EAAOf,UAAU,KAE9C,GAAe,IAAX3mB,EAGA,OADA0nB,EAAOT,YAAYc,EAAiB,IAC7B,CAAC,KAAM,IAElB,MAAMlV,EAAO6U,EAAOf,UAAU3mB,GAG9B,OADA0nB,EAAOT,YAAYc,EAAiB,IAC7B,CAAC/R,GAAWnD,GAAO,GAC9B,CACA,MAAM1B,EAAQ6E,GAAW0R,EAAOf,UAAU5Q,OAAOiM,SAAS3Q,EAAM,IAAK,KACrE,MAAO,CAACF,EAAO,GACnB,CAzGewX,CAAYjB,EAAQ5W,EAAO,CAAEiX,mBACxC,GAAIjX,EAAMrB,KAAKsB,WAAW,SAAWD,EAAMrB,KAAKsB,WAAW,OACvD,OAwGR,SAAsB2W,EAAQ5W,GAC1B,MAAM+D,EAAS/D,EAAMrB,KAAKsB,WAAW,OAC/BM,EAAO0E,OAAOiM,SAASlR,EAAMrB,KAAK1B,MAAM,OAAO,IAAM,MAAO,IAC5DoD,EAAQuW,EAAOf,UAAU,IAC/B,MAAO,CACHtV,EAAO,GACD8V,GAAchW,EAAO,CAAE0D,WACvB0S,GAAcpW,EAAO,CAAE0D,WAC7B,GAER,CAlHe+T,CAAalB,EAAQ5W,GAChC,GAAmB,WAAfA,EAAMrB,KACN,OA2JR,SAAsBiY,GAAQK,eAAEA,IAE5B,MAAMlU,EAAS0T,GAAcG,EAAOf,UAAU,KAExCtG,EAAQ0H,EAAiBlU,EAC/B6T,EAAOT,YAAY5G,GACnB,MAAMrgB,EAASunB,GAAcG,EAAOf,UAAU,KAE9C,GAAe,IAAX3mB,EAEA,OADA0nB,EAAOT,YAAYc,EAAiB,IAC7B,CAAC,GAAI,IAEhB,MAAMlV,EAAO6U,EAAOf,UAAU3mB,EAAQ,IAChCmR,EDrGH,SAAuBkW,EAAQ9R,EAAO,IACzC,IAAIlB,EAAQgT,EAKZ,YAJyB,IAAd9R,EAAKlE,OACZ+D,GAAWf,EAAO,CAAEhD,KAAMkE,EAAKlE,OAC/BgD,EAAQa,GAAKb,EAAO,CAAEF,IAAK,YAExB,IAAI0U,aAAcC,OAAOzU,EACpC,CC8FkB0U,CAAc7T,GAAKrC,IAGjC,OADA6U,EAAOT,YAAYc,EAAiB,IAC7B,CAAC5W,EAAO,GACnB,CA5Ke6X,CAAatB,EAAQ,CAAEK,mBAClC,MAAM,IAAIrU,EAA4B5C,EAAMrB,KAAM,CAC9CgC,SAAU,sCAElB,CAGA,MAAMyW,GAAe,GACfF,GAAe,GAqKrB,SAASG,GAAgBrX,GACrB,MAAMrB,KAAEA,GAASqB,EACjB,GAAa,WAATrB,EACA,OAAO,EACX,GAAa,UAATA,EACA,OAAO,EACX,GAAIA,EAAKwZ,SAAS,MACd,OAAO,EACX,GAAa,UAATxZ,EACA,OAAOqB,EAAMpB,YAAY4Y,KAAKH,IAClC,MAAMlH,EAAkBC,GAAmBpQ,EAAMrB,MACjD,SAAIwR,IACAkH,GAAgB,IAAKrX,EAAOrB,KAAMwR,EAAgB,KAG1D,CC5OA,MAAMxP,GAAW,sCCCV,MAAMyX,GAAc,6CC8KdC,GAAmBhY,GAC1BA,aAAiBxP,EACZwP,EAEF,IAAIxP,EAAUwP,GAIV9J,GAAe8J,GACnBA,aAAiBxP,EAkGpB,MAAOynB,WAAkBloB,MAI7B,WAAAwB,CAAYod,GACV5N,MAAM4N,EAAQ9N,SACd1N,KAAKrD,KAAO,YACZqD,KAAK+kB,KAAOvJ,EAAQuJ,KACpB/kB,KAAKwN,QAAUgO,EAAQhO,QAGnB5Q,MAAMooB,mBACRpoB,MAAMooB,kBAAkBhlB,KAAM8kB,GAElC,ECvSK,MAAMG,GAAgB,CAC3BC,GAAI,EACJC,GAAI,GAIOC,GACX,6CACWC,GACX,6CAGWC,GAAqB,EACrBC,GAAkB,IAGlBC,GAAuB,+BAGvBC,GAAkD,CAC7D,KAAM,CAEJC,SAAU,6CACVC,SAAU,6CACVC,WAAY,8CAEd,KAAM,CAEJF,SAAU,6CACVC,SAAU,6CACVC,WAAY,+CAKHC,GAaR,CACH,KAAM,CAEJC,eAAgB,6CAChBC,iBAAkB,6CAClBC,yBAA0B,6CAC1BC,sBAAuB,6CACvBC,cAAe,6CACfC,kBAAmB,6CACnBC,WAAY,6CACZC,mBAAoB,6CACpBC,kBAAmB,6CACnBC,eAAgB,6CAChBC,cAAe,6CACfC,SAAUvV,OAAO,OAEnB,KAAM,CAEJ4U,eAAgB,6CAChBC,iBAAkB,6CAClBC,yBAA0B,6CAC1BC,sBAAuB,6CACvBC,cAAe,6CACfC,kBAAmB,6CACnBC,WAAY,6CACZC,mBAAoB,6CACpBC,kBAAmB,6CACnBC,eAAgB,6CAChBC,cAAe,6CACfC,SAAUvV,OAAO,QAKRwV,GAAuD,CAClE,KAAM,CAEJhH,MAAO,CAAC,EAAG,GACXiH,eAAgB,CAAC,IAEnB,KAAM,CAEJjH,MAAO,CAAC,EAAG,GACXiH,eAAgB,CAAC,KAKRC,GACX1L,GAEOwL,GAAkBxL,IAAY,CAAEwE,MAAO,CAAC,EAAG,GAAIiH,eAAgB,CAAC,IAG5DE,GAAwB3L,GAC5B2K,GAAmB3K,GAGf4L,GAAiB5L,GACrBuK,GAAYvK,IAAY,CAAA,EAIpB6L,GAAmBlB,GACnBmB,GAAavB,GAAY,OAAS,CAAA,EAGlCwB,GAAgB,CAC3BC,QAAS,0BACTC,cAAe,0BAIJC,GAAc,CACzBC,eAAgB,iBAChBC,eAAgB,iBAChBC,sBAAuB,wBACvBC,UAAW,YACXC,YAAa,cACbC,uBAAwB,gCCzHbC,GAIX,WAAAvpB,CAAoBiE,GAClBrC,KAAKqC,OAASA,CAChB,CAWA,kBAAOulB,CAAYvlB,GACjB,IAAKslB,GAAU1T,SAAU,CAGvB4T,QAAQC,IAAI,KAAMC,QAAQC,IAAIC,2BAC9B,MAAMC,EAAmB,IACpB7lB,EACH8lB,QAAS,IAEHJ,QAAQC,IAAIC,2BAA6B,CAC3C,aAAcF,QAAQC,IAAIC,8BAGzB5lB,EAAO8lB,UAGdR,GAAU1T,SAAW,IAAI0T,GAAUO,EACrC,CACA,OAAOP,GAAU1T,QACnB,CAKA,oBAAOmU,GACLT,GAAU1T,SAAW,IACvB,CAKQ,aAAMoU,CACZC,EACA9M,EAAuB,IAEvB,MAAM+M,EAAa,IAAIC,gBACjBC,EAAYC,WAAW,IAAMH,EAAWI,QAAS3oB,KAAKqC,OAAOumB,SAEnE,IACE,MAAMC,QAAiBC,MAAM,GAAG9oB,KAAKqC,OAAO0mB,UAAUT,IAAY,IAC7D9M,EACHwN,OAAQT,EAAWS,OACnBb,QAAS,CACP,eAAgB,sBACbnoB,KAAKqC,OAAO8lB,WACZ3M,EAAQ2M,WAMf,GAFAc,aAAaR,IAERI,EAASK,GACZ,MAAM,IAAItsB,MAAM,QAAQisB,EAASM,WAAWN,EAASO,cAIvD,aADmBP,EAASQ,MAE9B,CAAE,MAAOC,GAGP,GAFAL,aAAaR,GAETa,aAAiB1sB,MAAO,CAC1B,GAAmB,eAAf0sB,EAAM3sB,KACR,MAAM,IAAImoB,GAAU,CAClBpX,QAAS,kBACTqX,KAAMqC,GAAYI,UAClBha,QAAS,CAAE8a,WAAUM,QAAS5oB,KAAKqC,OAAOumB,WAG9C,MAAM,IAAI9D,GAAU,CAClBpX,QAAS4b,EAAM5b,QACfqX,KAAMqC,GAAYI,UAClBha,QAAS,CAAE8a,WAAUiB,cAAeD,IAExC,CAEA,MAAM,IAAIxE,GAAU,CAClBpX,QAAS,oBACTqX,KAAMqC,GAAYI,UAClBha,QAAS,CAAE8a,WAAUiB,cAAeD,IAExC,CACF,CAKA,eAAME,CACJC,EACAC,EACAC,EACAjK,EACAiH,GAEA,MAAM3a,EAAS,CACb4d,IAAKH,EAASpP,QACdwP,KAAMH,EAASrP,QACfyP,OAAQH,EACRI,OAAQrK,EACRsK,SAAUrD,GAGNsD,EAAQjqB,KAAKkqB,iBAAiBle,GAEpC,OAAOhM,KAAKqoB,QAAwB,GAAGpB,GAAcC,WAAW+C,IAAS,CACvEE,OAAQ,OAEZ,CAMA,qBAAMC,GACJ,OAAOpqB,KAAKqoB,QAAapB,GAAcE,cAAe,CACpDgD,OAAQ,OAEZ,CAKQ,gBAAAD,CAAiBG,GACvB,OAAOvc,OAAO+M,KAAKwP,GAChBxO,OAAO,CAACxQ,EAAaoP,IACb,IACFpP,EACH,GAAGoP,KACDpJ,MAAMyL,QAAQuN,EAAQ5P,IAClB,KAAO4P,EAAQ5P,GAAKlO,IAAK3M,GAAWA,GAAG+M,KAAK,OAAS,KACrD0d,EAAQ5P,MAGf,IACF9N,KAAK,IACV,EAtJegb,GAAA1T,SAA6B,KCC9C,IAAIqW,GAAkD,KAiDtD,SAASC,KACPD,GAAsB,KACtBzC,QAAQC,IAAI,gCACd,CAOA,MAAM0C,GAAyC,CAE7C,KAAM,CACJ,6CACA,6CACA,6CACA,6CACA,6CACA,8CAGF,KAAM,CACJ,6CACA,6CACA,6CACA,+CAUE,SAAUC,GACdC,EACAxP,GAEA,IAAKwP,GAAOrQ,QAAS,OAAO,EAE5B,MAAMsQ,EAAgBH,GAAkBtP,GACxC,QAAKyP,GAEEA,EAAc3G,KAClB4G,GAASA,EAAKlqB,gBAAkBgqB,EAAMrQ,QAAQ3Z,cAEnD,CAyBM,SAAUmqB,GACdpB,EACAC,EACAxO,EACA4P,EAA2B,GAG3B,MAAMC,EAAiBN,GAAiBhB,EAAUvO,GAC5C8P,EAAiBP,GAAiBf,EAAUxO,GAGlD,OAAO6P,GAAkBC,EAAiBF,EAAmB,CAC/D,CAcOG,eAAeC,GACpBzB,EACAC,EACAC,EACAzO,EACAiQ,EACAC,EACAC,EAA4B,GAE5B,IACExD,QAAQC,IAAI,qCAGZ,MAAMwD,QAzJVL,eACEE,EACAC,GAEA,MAAMG,EAAMC,KAAKD,MAGjB,GAAIjB,IAAuBiB,EAAMjB,GAAoBmB,UAEnD,OADA5D,QAAQC,IAAI,qCACLwC,GAAoB/b,KAI7BsZ,QAAQC,IAAI,gDACZ,MAAM4D,EAAY/D,GAAUC,YAAY,CACtCmB,QAASoC,EACTvC,QAAS,IACTT,QAAS,IACHiD,GAAU,CAAE,aAAcA,MAI5B7c,QAAamd,EAAUtB,kBAE7B,IAAK7b,EAAKod,QACR,MAAM,IAAI/uB,MAAM,uBAAuB2R,EAAK+a,OAAS,mBAUvD,OANAgB,GAAsB,CACpB/b,KAAMA,EAAKA,MAAQ,GACnBqd,UAAWL,EACXE,UAAWF,EAtCQ,KAyCdjB,GAAoB/b,IAC7B,CAqH8Bsd,CAAkBV,EAAYC,GAGlDU,EAAcR,EAAYS,KAC7BnM,GACCA,EAAK8K,OAAOhqB,gBAAkB+oB,EAASpP,QAAQ3Z,eAE7CsrB,EAAcV,EAAYS,KAC7BnM,GACCA,EAAK8K,OAAOhqB,gBAAkBgpB,EAASrP,QAAQ3Z,eAG7CurB,EAAa,IAAI5uB,EAAUssB,GAGjC,OACEmC,GACAE,GACAC,EAAWrkB,IAAIkkB,EAAYI,gBAC3BD,EAAWrkB,IAAIokB,EAAYE,gBAE3BrE,QAAQC,IACN,uEAEK,IAEPD,QAAQC,IACN,iFAEK+C,GACLpB,EACAC,EACAxO,EACAmQ,GAGN,CAAE,MAAO/B,GAGP,OAFAzB,QAAQsE,KAAK,yCAA0C7C,GACvDzB,QAAQC,IAAI,2CACL+C,GAAoBpB,EAAUC,EAAUxO,EAASmQ,EAC1D,CACF,CA4BOJ,eAAemB,GACpB3C,EACAC,EACAC,EACAzO,EACAiQ,EACAE,EAA4B,EAC5BD,GAEA,IACE,aAAaF,GACXzB,EACAC,EACAC,EACAzO,EACAiQ,EACAC,EACAC,EAEJ,CAAE,MAAO/B,GAGP,OAFAzB,QAAQsE,KAAK,mDAAoD7C,GAE1D+B,CACT,CACF,UASgBgB,GACdC,EACAC,EACAC,GAEA,GAAsB,IAAlBD,EAAqB,OAAOE,IAGhC,OADuBH,EAAaE,EAAYD,EAAiB,GAEnE,CASM,SAAUG,GACdJ,EACAC,EACAI,EAA6B,GAI7B,OAFyBN,GAAqBC,EAAYC,EAAe,GAElDI,EACd,EAGF,CACT,CCtSM,SAAUC,GAAgB9C,EAAgB+C,GAC9C,OAAK/C,GAAU5jB,MAAMuL,OAAOqY,IACnB,IAAIzsB,EAAU,GAEhB,IAAIA,EAAUysB,GAAQ1iB,MAAM,IAAI/J,EAAU,IAAIgH,IAAIwoB,GAC3D,CAQM,SAAUC,GACdhD,EACA+C,GAGA,OADW,IAAIxvB,EAAUysB,GACfrjB,UAAU,IAAIpJ,EAAU,IAAIgH,IAAIwoB,IAAWxuB,UACvD,CAQM,SAAU0uB,GAAcrC,EAAclE,GAC1C,OAAOkE,EAAMrQ,QAAQ3Z,gBAAkB8lB,EAAc9lB,aACvD,CAQM,SAAUssB,GAAetC,EAAcnE,GAC3C,OAAOmE,EAAMrQ,QAAQ3Z,gBAAkB6lB,EAAe7lB,aACxD,CAQM,SAAUusB,GAAexD,EAAiBC,GAC9C,OACED,GACAC,GACAD,EAASpP,SACTqP,EAASrP,SACToP,EAASpP,UAAYqP,EAASrP,SAC9BoP,EAASvO,UAAYwO,EAASxO,OAElC,CAOM,SAAUgS,GAAepD,GAC7B,IAAKA,GAAU5jB,MAAMuL,OAAOqY,IAC1B,OAAO,EAET,MAAMqD,EAAM,IAAI9vB,EAAUysB,GAC1B,OAAOqD,EAAIzlB,GAAG,IAAMylB,EAAI3lB,UAC1B,CASM,SAAU4lB,GACdtD,EACAuD,EACAb,EAAoB,IAGpB,OADkB,IAAInvB,EAAUysB,GAAQ1iB,MAAMimB,GAC7BvlB,GAAG,GAAK,EAAI0kB,CAC/B,CAOM,SAAUc,GAAYhE,GAC1B,MAAqB,iBAAVA,EACFA,EAELA,GAAO5b,QACF4b,EAAM5b,QAEX4b,GAAOA,MACFA,EAAMA,MAER,wBACT,CAQM,SAAUiE,GACdC,EACAC,GAEA,IAAI7E,EAEJ,MAAM8E,EAAc,IAAIxsB,KACtB+nB,aAAaL,GACbA,EAAUF,WAAW,IAAM8E,KAAQtsB,GAAOusB,IAO5C,OAJAC,EAAYC,OAAS,KACnB1E,aAAaL,IAGR8E,CACT,CCzIO,MAAME,GAAkB,CAC7B,CACEthB,OAAQ,CACN,CACEuhB,aAAc,UACdlxB,KAAM,YACNwO,KAAM,WAER,CACE0iB,aAAc,QACdlxB,KAAM,gBACNwO,KAAM,SAER,CACE0iB,aAAc,UACdlxB,KAAM,QACNwO,KAAM,YAGVxO,KAAM,aACNsd,QAAS,CACP,CACE7O,WAAY,CACV,CACEyiB,aAAc,UACdlxB,KAAM,YACNwO,KAAM,WAER,CACE0iB,aAAc,UACdlxB,KAAM,YACNwO,KAAM,YAGV0iB,aAAc,+BACdlxB,KAAM,GACNwO,KAAM,SAER,CACEC,WAAY,CACV,CACEyiB,aAAc,YACdlxB,KAAM,eACNwO,KAAM,aAER,CACE0iB,aAAc,UACdlxB,KAAM,YACNwO,KAAM,YAGV0iB,aAAc,iCACdlxB,KAAM,GACNwO,KAAM,UAGV6O,gBAAiB,aACjB7O,KAAM,mBClBG2iB,GAGX,WAAA1vB,CAAYiE,GACVrC,KAAKqC,OAASA,CAChB,CAiCA,gBAAM0rB,CAAWvS,GACf,MAAMmO,SACJA,EAAQF,SACRA,EAAQC,SACRA,EAAQxO,QACRA,EACAsR,UAAWwB,EAAiBC,eAC5BA,GACEzS,EAGEgR,EACJyB,GACAD,GACAhuB,KAAKkuB,aACHzE,EACAC,EACAxO,EACAlb,KAAKqC,OAAOyoB,kBAIhB,IAAKmC,GAAexD,EAAUC,GAC5B,MAAM,IAAI5E,GAAU,CAClBpX,QAAS,0BACTqX,KAAMqC,GAAYC,eAClB7Z,QAAS,CAAEic,WAAUC,cAIzB,IAAKwD,GAAevD,GAClB,MAAM,IAAI7E,GAAU,CAClBpX,QAAS,0BACTqX,KAAMqC,GAAYE,eAClB9Z,QAAS,CAAEmc,cAIf,MAAMsC,EAAaW,GAAgBjD,EAAUF,EAASoD,WAChD3G,cAAEA,EAAaI,kBAAEA,EAAiBC,eAAEA,EAAcC,cAAEA,GACxDxmB,KAAKqC,OAAOA,OAER8rB,EAAcpB,GAActD,EAAUjD,GACtC4H,EAAcrB,GAAcrD,EAAUlD,GAG5C,GACG2H,GAAenB,GAAetD,EAAUnD,IACxC6H,GAAepB,GAAevD,EAAUlD,GACzC,CACA,MAAM8H,EAASF,EAAc,OAAS,SAChCG,EAAcrC,EAEpB,MAAO,CACLsC,OAAQ,CACN,CACE,CACErI,gBACAsI,UAAW5J,GACX6J,UAAWhF,EAASpP,QACpBqU,QAAShF,EAASrP,QAClB/I,KAAMmY,EAASpP,QACf3B,GAAIgR,EAASrP,QACbsU,KAAM,YACNC,eAAgB,QAChBC,aAAc,KAIpBC,cAAe,CAACtC,GAChBuC,gBAAiB,CAACT,GAClBA,cACAU,cAAe,CAAC/C,GAChBgD,kBAAkB,EAClBZ,SAEJ,CAGA,MAAMa,EAAgBf,EAClB,IAAK1E,EAAUpP,QAASkM,GACxBkD,EACE0F,EAAgBf,EAClB,IAAK1E,EAAUrP,QAASkM,GACxBmD,EAEJ,IAEE,MAAM0F,QAAiBpvB,KAAKqC,OAAOqpB,UAAUlC,UAC3C0F,EACAC,EACAlD,EAAW1iB,QAAQ,GACnBiS,EAAQkE,OAAS,CAAC,EAAG,GACrBlE,EAAQmL,gBAAkB,CAAC,KAGvB0I,KAAEA,EAAIC,UAAEA,GAAcF,EAAS7gB,KAErC,GAAoB,IAAhB8gB,EAAK3zB,OAEP,OADAmsB,QAAQC,IAAI,sBACL,CACLyG,OAAQ,GACRO,cAAe,GACfC,gBAAiB,GACjBT,YAAa,IAAIjxB,EAAU,GAC3B2xB,cAAe,GACfC,kBAAkB,GAItBpH,QAAQC,IAAI,qBAAsBuH,EAAK3zB,QACvCmsB,QAAQC,IAAI,0BAA2BwH,EAAU5zB,QACjDmsB,QAAQC,IAAI,mBAAoB0E,GAGhC,MAAM+C,EAAgBjT,GACpB,CACE,CACEnR,KAAM,YACNC,WAAY,CACV,CAAED,KAAM,UAAWxO,KAAM,OACzB,CAAEwO,KAAM,UAAWxO,KAAM,QACzB,CAAEwO,KAAM,QAASxO,KAAM,UACvB,CAAEwO,KAAM,QAASxO,KAAM,YACvB,CAAEwO,KAAM,QAASxO,KAAM,WAI7B,CAAC0yB,IAIH,IAAIf,EAAc,IAAIjxB,EAAU,GAC5ByxB,EAA0B,GAC1BP,EAAgB,GAEpB,GAAIvuB,KAAKqC,OAAOmtB,aACd,IACE3H,QAAQC,IAAI,gCAAiC,CAC3CxB,oBACAqD,SAAUsC,EAAW1iB,QAAQ,GAC7BijB,YACAiD,oBAAqBF,EAAc7zB,SAGrC,MAAM6S,EAAOoR,GAAmB,CAC9BnB,IAAKoP,GACL5e,aAAc,aACd9N,KAAM,CACJ+qB,EAAW1iB,QAAQ,GACnBgmB,EACA/C,KAIEnhB,QAAerL,KAAKqC,OAAOmtB,aAAaxsB,KAAK,CACjD0V,GAAI4N,EACJ/X,KAAMA,EACNmhB,IAAK,aACLC,cAAUtiB,IAKZ,GAFAwa,QAAQC,IAAI,6BAA8Bzc,GAEtCA,EAAOkD,KAAM,CACf,MAAMqhB,ER9OX,SAA8BrR,GACjC,MAAMC,IAAEA,EAAGtd,KAAEA,EAAI8N,aAAEA,EAAYT,KAAEA,GAASgQ,EAC1C,IAAIrS,EAAUsS,EAAI,GAClB,GAAIxP,EAAc,CACd,MAAM4Q,EAAOtB,GAAW,CAAEE,MAAKtd,OAAMvE,KAAMqS,IAC3C,IAAK4Q,EACD,MAAM,IAAI7Q,EAAyBC,EAAc,CAAE7B,cACvDjB,EAAU0T,CACd,CACA,GAAqB,aAAjB1T,EAAQf,KACR,MAAM,IAAI4D,OAAyB1B,EAAW,CAAEF,cACpD,IAAKjB,EAAQ+N,QACT,MAAM,IAAIhL,EAAgC/C,EAAQvP,KAAM,CAAEwQ,cAC9D,MAAMuO,EAASyH,GAAoBjX,EAAQ+N,QAAS1L,GACpD,OAAImN,GAAUA,EAAOhgB,OAAS,EACnBggB,EACPA,GAA4B,IAAlBA,EAAOhgB,OACVggB,EAAO,QADlB,CAGJ,CQ2N4BmU,CAAqB,CACnCrR,IAAKoP,GACL5e,aAAc,aACdT,KAAMlD,EAAOkD,OAGTuhB,EAAiBF,EAAQ,GAC/B,GAAIE,GAAkBA,EAAeC,UAAW,CAC9CzB,EAAc,IAAIjxB,EAAUyyB,EAAeC,UAAU1xB,YACrD,IAAI2xB,EAAmBF,EAAeG,aAAa1jB,IAChDjL,GAAc,IAAIjE,EAAUiE,EAAEjD,YAAYqM,YAI7C6jB,EAASe,EAAUzT,OACjB,CAACC,EAAYoU,EAAa7zB,KACpB2zB,EAAiB3zB,GAAK,GACxByf,EAAInb,KACFuvB,EAAK3jB,IAAI,CAACM,EAAYzR,EAAWsgB,KAAa,CAC5CwK,cACEc,GAAWna,EAAMsjB,OAAS,IAAMtjB,EAAM1B,OACtCyZ,GACF4J,UAAW3hB,EAAMujB,MAAQxL,GACzB6J,UAAW5hB,EAAM+c,IACjB8E,QAAS7hB,EAAMgd,KACfvY,KACElW,EAAI,GACW,OAAfyR,EAAM1B,MACN0B,EAAM+c,MAAQrD,EAAe7lB,cACzB2kB,GACAD,GACN1M,GACEtd,EAAIsgB,EAAOhgB,OAAS,GACnBN,IAAMsgB,EAAOhgB,OAAS,GACrBmR,EAAMgd,OAAStD,EAAe7lB,cAC5B2kB,GACAD,GACNuJ,KAAM,YACNC,eAAgB,IAAIvxB,EAAU,KAC3B+K,MAAM,IAAI/K,EAAUwP,EAAMwjB,KAAO,GAAG5pB,UAAU,MAC9C8C,UACHslB,aACE5J,GACEpY,EAAM1B,OACH,MAIN2Q,GAET,IAIFgT,EAAgBkB,EAAiBrR,OAAQrd,GAAcA,EAAI,EAC7D,CACF,CACF,CAAE,MAAOgvB,GACPzI,QAAQyB,MAAM,wCAAyCgH,GAEvDhC,EAAc,IAAIjxB,EAAU,GAC5ByxB,EAAgB,GAChBP,EAAS,EACX,MAGA1G,QAAQyB,MAAM,yDACdgF,EAAc,IAAIjxB,EAAU,GAC5ByxB,EAAgB,GAChBP,EAAS,GAIX,MAAMQ,EAAkBD,EAAcviB,IAAKgkB,GACzCjC,EAAYlnB,MAAMmpB,GAAI9pB,UAAU+lB,GAAWnpB,GAAG,EAAGhG,EAAUuE,aAGvDotB,EAAgBF,EAAcviB,IAAK0jB,GACvChE,EACG7kB,MAAM6oB,GACNxpB,UAAU+lB,GACVnpB,GAAG,EAAGhG,EAAUuE,aAKrB,MAAO,CACL2sB,SACAO,gBACAC,kBACAT,cACAU,gBACAC,kBAAkB,EAEtB,CAAE,MAAO3F,GACP,MAAM,IAAIxE,GAAU,CAClBpX,QAAS,6BACTqX,KAAMqC,GAAYI,UAClBha,QAAS,CAAE+b,cAAeD,EAAO9N,YAErC,CACF,CAKA,oBAAAgV,GAEE,OAAO1iB,OAAO+M,KAAKkM,IAAkBxa,IAAIkF,OAC3C,CAKA,gBAAAgf,CAAiBvV,GAEf,OAAOlb,KAAKqC,OAAOA,MACrB,CAUQ,YAAA6rB,CACNzE,EACAC,EACAxO,EACA4P,GAEA,OAAOD,GAAoBpB,EAAUC,EAAUxO,EAAS4P,EAC1D,ECzVKG,eAAeyF,GACpBlV,EACAnZ,EAA+B,IAG/B,MAAM8oB,WACJA,EAAa3F,GAAoBsF,iBACjCA,EAAmBxF,GAAkBsD,QACrCA,EAAU,IAAKT,QACfA,EAAU,CAAA,GACR9lB,EAGE6Y,EAAUM,EAAQN,QAClByV,EAAgB9J,GAAqB3L,GAE3C,IAAKyV,EACH,MAAM,IAAI/zB,MAAM,wBAAwBse,KAI1C,MAAMwQ,EAAY/D,GAAUC,YAAY,CACtCmB,QAASoC,EACTvC,QAASA,EACTT,QAASA,IAcX,OAXoB,IAAI2F,GAAc,CACpCzrB,OAAQ,CACN6jB,cAAeyK,EAAczK,cAC7BI,kBAAmBqK,EAAcrK,kBACjCC,eAAgBoK,EAAcpK,eAC9BC,cAAemK,EAAcnK,eAE/BsE,iBAAkBA,EAClBY,UAAWA,IAGMqC,WAAWvS,EAChC,CAKOyP,eAAe2F,GACpBC,GAgBA,aAdsBC,QAAQC,WAC5BF,EAAMtkB,IAAI0e,OAASzP,UAASnZ,aAC1B,IAEE,MAAO,CAAEspB,SAAS,EAAMpd,WADHmiB,GAAelV,EAASnZ,GAE/C,CAAE,MAAOinB,GACP,MAAO,CACLqC,SAAS,EACTrC,MAAOA,aAAiB1sB,MAAQ0sB,EAAM5b,QAAU,gBAEpD,MAIWnB,IAAKlB,GACI,cAAlBA,EAAO8d,OACF9d,EAAOwB,MAEP,CACL8e,SAAS,EACTrC,MAAOje,EAAO2lB,QAAQtjB,SAAW,iBAIzC,CAKOud,eAAegG,GACpBxH,EACAC,EACAC,EACAzO,EACA7Y,EAA+B,IAE/B,MAAMgJ,QAAeqlB,GACnB,CACE/G,WACAF,WACAC,WACAxO,WAEF7Y,GAGF,MAAO,CACL0tB,UAAW1kB,EAAOijB,YAAY/kB,QAAQ,GACtCglB,OAAQljB,EAAOkjB,OAAO7yB,OAE1B,CAeOuvB,eAAeiG,GACpB1V,EACAnZ,EAA+B,IAE/B,MAAMqd,MAAEA,EAAKiH,eAAEA,GAAmBC,GAAoBpL,EAAQN,SAE9D,OAAOwV,GACL,IACKlV,EACHkE,QACAiH,kBAEF,IACKtkB,EACH4rB,eAAgB5rB,EAAO4rB,gBAG7B,CCzBO,MAAMkD,GAAkB,CAC7B1H,EACAC,EACAC,EACAzO,EACA7Y,EAAgC,MAGhC,MAAM+uB,EAAiBC,EAAQ,MAAS,GAAG,IACrCC,EAAuBD,EAC3B,KAAA,CAEInL,cAAetB,GACf0B,kBAAmB1B,GACnB2B,eAAgB3B,GAChB4B,cAAe5B,KAEnB,KAIIuG,WACJA,EAAUoG,cACVA,EAAazG,iBACbA,EAAgBlC,QAChBA,EAAOT,QACPA,EAAOqJ,gBACPA,EAAehC,aACfA,EAAYiC,YACZA,EAAWC,qBACXA,EAAoBzD,eACpBA,EAAc0D,mBACdA,GACEN,EAAQ,KACV,MAAMlG,WACJA,EAAa3F,GACbnjB,OAAQkvB,EAAgBD,EAAoBxG,iBAC5CA,EAAmB,EAAClC,QACpBA,EAAU,IAAKT,QACfA,EAAUiJ,EAAcI,gBACxBA,EAAkB,IAAKhC,aACvBA,EACA9P,MAAO+R,EACP9K,eAAgB+K,EAAoBzD,eACpCA,EAAc0D,mBACdA,GAAqB,GACnBtvB,EAEJ,MAAO,CACL8oB,aACAoG,gBACAzG,mBACAlC,UACAT,UACAqJ,kBACAhC,eACAiC,cACAC,uBACAzD,iBACA0D,uBAED,CAACtvB,EAAQ+uB,EAAgBE,IAGtBM,EAA0BP,EAC9B,IAAMzK,GAAoB1L,GAC1B,CAACA,IAEGwE,EAAQ2R,EACZ,IAAMI,GAAeG,EAAwBlS,MAC7C,CAAC+R,EAAaG,EAAwBlS,QAElCiH,EAAiB0K,EACrB,IAAMK,GAAwBE,EAAwBjL,eACtD,CAAC+K,EAAsBE,EAAwBjL,iBAIjDkL,EAAU,KACRhK,QAAQC,IAAI,SAAUzlB,IACrB,CAACA,IAEJwvB,EAAU,KACRhK,QAAQC,IAAI,WAAY2B,IACvB,CAACA,IAEJoI,EAAU,KACRhK,QAAQC,IAAI,WAAY4B,IACvB,CAACA,IAEJmI,EAAU,KACRhK,QAAQC,IAAI,WAAY6B,IACvB,CAACA,IAEJkI,EAAU,KACRhK,QAAQC,IAAI,UAAW5M,IACtB,CAACA,IAEJ2W,EAAU,KACRhK,QAAQC,IAAI,aAAcqD,IACzB,CAACA,IAEJ0G,EAAU,KACRhK,QAAQC,IAAI,gBAAiByJ,IAC5B,CAACA,IAEJM,EAAU,KACRhK,QAAQC,IAAI,mBAAoBgD,IAC/B,CAACA,IAEJ+G,EAAU,KACRhK,QAAQC,IAAI,UAAWc,IACtB,CAACA,IAEJiJ,EAAU,KACRhK,QAAQC,IAAI,UAAWK,IACtB,CAACA,IAEJ0J,EAAU,KACRhK,QAAQC,IAAI,QAASpI,IACpB,CAACA,IAEJmS,EAAU,KACRhK,QAAQC,IAAI,iBAAkBnB,IAC7B,CAACA,IAEJ,MAAO2H,EAAawD,GAAkBC,EAAoB,IAAI10B,EAAU,KACjEkxB,EAAQyD,GAAaD,EAAkB,KACvCjD,EAAemD,GAAoBF,EAAmB,KACtDhD,EAAiBmD,GAAsBH,EAAgB,KACvD/C,EAAemD,GAAoBJ,EAAgB,KACnDK,EAAWC,GAAgBN,GAAS,IACpC9C,EAAkBqD,GAAuBP,GAAS,IAClD1D,EAAQkE,GAAaR,KACrBS,EAAcC,GAAmBV,GAAS,IAC1CzI,EAAOoJ,GAAYX,EAAwB,OAC3CY,EAAiBC,GAAsBb,EAAwB,MAGhEvF,EAAY6E,EAAQ,KACxBxJ,QAAQC,IAAI,YAAa,EAAG6J,GAExBA,EAEyB,OAApBgB,EACHA,EACA9H,GAAoBpB,EAAUC,EAAUxO,EAAS4P,IAEvDjD,QAAQC,IAAI,YAAa,EAAGmG,QAGL5gB,IAAnB4gB,EACKA,GAETpG,QAAQC,IAAI,YAAa,EAAGgD,GAGrBD,GAAoBpB,EAAUC,EAAUxO,EAAS4P,MACvD,CACDA,EACAmD,EACA0D,EACAgB,EACAlJ,EACAC,EACAxO,IAIF2W,EAAU,KACR,KAAKF,GAAuBlI,GAAaC,GAAaC,GAEpD,YADAiJ,EAAmB,MAIQ3H,WAC3B,IACE,MAAM4H,QAA6BzG,GACjC3C,EACAC,EACAC,EACAzO,EACAiQ,EACAL,GAEF8H,EAAmBC,EACrB,CAAE,MAAOvJ,GACPzB,QAAQsE,KAAK,oCAAqC7C,GAClDsJ,EAAmB,KACrB,GAGFE,IACC,CACDnB,EACAlI,EACAC,EACAC,EACAzO,EACAiQ,EACAL,IAIF,MAAMiI,EAAc1B,EAAQ,KAE1B,MAAM2B,EAAmBnM,GAAqB3L,GACxC+X,EACJ1B,GAAiBzjB,OAAO+M,KAAK0W,GAAe71B,OAAS,EACjD61B,EACA,CACErL,cACE8M,GAAkB9M,eAClB,6CACFI,kBACE0M,GAAkB1M,mBAClB,6CACFC,eACEyM,GAAkBzM,gBAClB,6CACFC,cACEwM,GAAkBxM,eAClB,8CAIJkF,EAAY/D,GAAUC,YAAY,CACtCmB,QAASoC,EACTvC,QAASA,EACTT,QAASA,IAGX,OAAO,IAAI2F,GAAc,CACvBzrB,OAAQ4wB,EACRnI,iBAAkBA,EAClBY,YACA8D,aAAcA,KAEf,CACD+B,EACAzG,EACAK,EACAvC,EACAT,EACAqH,EACAtU,IAGIgY,EAAaC,EAAY,KAC7BT,EAAS,OACR,IAEG3E,EAAaoF,EAAYlI,UAC7B,IAAKxB,IAAaC,IAAaC,GAAyB,MAAbA,EASzC,OARAmI,EAAe,IAAIz0B,EAAU,IAC7B20B,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,QAChBC,EAAS,MAIXL,GAAa,GACbK,EAAS,MAET,IACE,MAAMlX,EAAuB,CAC3BmO,WACAF,WACAC,WACAxO,UACAsR,UAAWA,EACX9M,MAAOA,EACPiH,eAAgBA,GAGZtb,QAA2B0nB,EAAYhF,WAAWvS,GAExDsW,EAAezmB,EAAOijB,aACtB0D,EAAU3mB,EAAOkjB,QACjB0D,EAAiB5mB,EAAOyjB,eACxBoD,EAAmB7mB,EAAO0jB,iBAC1BoD,EAAiB9mB,EAAO2jB,eACxBsD,EAAoBjnB,EAAO4jB,kBAC3BsD,EAAUlnB,EAAOgjB,QACjBoE,GAAgB,EAClB,CAAE,MAAOpkB,GACP,MAAM+kB,EACJ/kB,aAAezR,MAAQyR,EAAIX,QAAU,yBACvCglB,EAASU,GACTvL,QAAQyB,MAAM,wBAAyBjb,GAEvCyjB,EAAe,IAAIz0B,EAAU,IAC7B20B,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,EAClB,SACEJ,GAAa,EACf,GACC,CACDU,EACAtJ,EACAC,EACAC,EACAzO,EACAsR,EACA9M,EACAiH,IAII0M,EAAsBhC,EAC1B,IAAM9D,GAASQ,EAAY,KAC3B,CAACA,IA+CH,OA3CA8D,EAAU,KACR,IAAKlI,GAAyB,MAAbA,EASf,OARAmI,EAAe,IAAIz0B,EAAU,IAC7B20B,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,QAChBC,EAAS,MAIXW,IAGA,MAAMC,EAAaC,YAAY,KAC7BF,KACC7B,GAEH,MAAO,KACLgC,cAAcF,GAE4B,mBAA/BD,EAAoB1F,QAC7B0F,EAAoB1F,WAGvB,CACDhE,EACAF,GAAUpP,QACVqP,GAAUrP,QACVgZ,EACA7B,IAIFK,EAAU,KAEJW,GACFzE,KAED,CAACA,EAAYyE,EAAcO,IAEvB,CACLxE,SACAO,gBACAC,kBACAT,cACAU,gBACAjB,aACAqE,YACAnD,mBACAuD,eACAnE,SACA/E,QACA4J","x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44]}
1
+ {"version":3,"file":"index.esm.js","sources":["../src/types/index.ts","../src/constants/index.ts","../src/api/Client.ts","../src/utils/PartCount.ts","../src/utils/index.ts","../src/constants/Abis.ts","../src/services/SwapV3Service.ts","../src/common/FetchSwapRoute.ts","../src/hooks/useSwapV3Routes.ts"],"sourcesContent":[null,null,null,null,null,null,null,null,null],"names":["ensureBigNumber","value","BigNumber","isBigNumber","SwapError","Error","constructor","options","super","message","this","name","code","details","captureStackTrace","DEX_INTERFACE","V2","V3","USER_TARGET","ROUTER_TARGET","DEFAULT_PART_COUNT","DEFAULT_TIMEOUT","DEFAULT_API_BASE_URL","DEX_ROUTERS","BITZY_V3","BITZY_V2","AVOCADO_V2","CONTRACT_ADDRESSES","factoryAddress","v3FactoryAddress","v3PositionManagerAddress","v3WalletHelperAddress","routerAddress","aggregatorAddress","otcAddress","memeTokenGenerator","bitzyQueryAddress","wrappedAddress","nativeAddress","gasLimit","BigInt","RPC_CONFIG","rpcUrls","nativeCurrency","symbol","decimals","LIQUIDITY_SOURCES","types","enabledSources","getLiquiditySources","chainId","getContractAddresses","getDexRouters","DEFAULT_NETWORKS","DEX_ROUTER","API_ENDPOINTS","PATH_V3","ASSET_MINIMUM","ERROR_CODES","INVALID_TOKENS","INVALID_AMOUNT","NETWORK_NOT_SUPPORTED","API_ERROR","QUERY_ERROR","INSUFFICIENT_LIQUIDITY","APIClient","config","getInstance","instance","configWithApiKey","headers","process","env","NEXT_PUBLIC_BITZY_API_KEY","resetInstance","request","endpoint","controller","AbortController","timeoutId","setTimeout","abort","timeout","response","fetch","baseUrl","signal","clearTimeout","ok","status","statusText","json","error","originalError","getPathV3","srcToken","dstToken","amountIn","params","URLSearchParams","set","address","JSON","stringify","toString","method","getAssetMinimum","minimumAmountsCache","clearMinimumAmountsCache","console","log","HIGH_VALUE_TOKENS","isHighValueToken","token","networkTokens","some","addr","toLowerCase","getPartCountOffline","defaultPartCount","srcIsHighValue","dstIsHighValue","async","getPartCountOnline","apiBaseUrl","apiKey","fallbackPartCount","minimumData","now","Date","expiresAt","data","apiClient","success","timestamp","getMinimumAmounts","srcTokenMin","find","item","dstTokenMin","amountInBN","gte","minimumAmount","warn","getPartCountWithFallback","calculatePriceImpact","swapAmount","pairLiquidity","partCount","Infinity","getOptimalPartCount","maxImpactThreshold","fromTokenAmount","amount","isNaN","Number","times","pow","toTokenAmount","dividedBy","isNativeToken","isWrappedToken","validateTokens","validateAmount","num","gt","isFinite","calculatePartCount","price","lt","formatError","debounce","func","wait","debouncedFn","args","cancel","BITZY_QUERY_ABI","inputs","internalType","type","outputs","components","stateMutability","SwapV3Service","getPublicClient","publicClient","rpcConfig","getRpcConfig","chain","defineChain","id","network","replace","default","http","public","createPublicClient","transport","fetchRoute","providedPartCount","forcePartCount","getPartCount","isSrcNative","isDstNative","isWrap","amountOutBN","routes","lpAddress","zeroAddress","fromToken","toToken","from","to","part","amountAfterFee","dexInterface","distributions","amountOutRoutes","amountInParts","isAmountOutError","usingSrcToken","usingDstToken","pathData","toFixed","hops","validPath","length","encodedRoutes","encodeAbiParameters","encodeFunctionData","abi","functionName","result","call","gas","gasPrice","undefined","splitRouteData","decodeFunctionResult","amountOut","distributionsRaw","distribution","map","d","toNumber","reduce","acc","path","k","push","i","values","source","pool","src","dest","minus","fee","filter","contractError","am","dp","ROUND_DOWN","getSupportedNetworks","Object","keys","getNetworkConfig","fetchSwapRoute","networkConfig","fetchBatchSwapRoutes","swaps","Promise","allSettled","reason","getSwapQuote","fetchSwapRouteSimple","useSwapV3Routes","defaultHeaders","useMemo","defaultAddressConfig","addressConfig","refreshInterval","configTypes","configEnabledSources","useOnlinePartCount","defaultLiquiditySources","useEffect","setAmountOutBN","useState","setRoutes","setDistributions","setAmountOutRoutes","setAmountInParts","isLoading","setIsLoading","setIsAmountOutError","setIsWrap","isFirstFetch","setIsFirstFetch","setError","onlinePartCount","setOnlinePartCount","onlinePartCountValue","fetchOnlinePartCount","swapService","defaultAddresses","finalAddressConfig","clearError","useCallback","err","errorMessage","debouncedFetchRoute","intervalId","setInterval","clearInterval"],"mappings":"2QAkLO,MAAMA,EAAmBC,GAC1BA,aAAiBC,EACZD,EAEF,IAAIC,EAAUD,GAIVE,EAAeF,GACnBA,aAAiBC,EAkGpB,MAAOE,UAAkBC,MAI7B,WAAAC,CAAYC,GACVC,MAAMD,EAAQE,SACdC,KAAKC,KAAO,YACZD,KAAKE,KAAOL,EAAQK,KACpBF,KAAKG,QAAUN,EAAQM,QAGnBR,MAAMS,mBACRT,MAAMS,kBAAkBJ,KAAMN,EAElC,ECvSK,MAAMW,EAAgB,CAC3BC,GAAI,EACJC,GAAI,GAIOC,EACX,6CACWC,EACX,6CAGWC,EAAqB,EACrBC,EAAkB,IAGlBC,EAAuB,+BAGvBC,EAAkD,CAC7D,KAAM,CAEJC,SAAU,6CACVC,SAAU,6CACVC,WAAY,8CAEd,KAAM,CAEJF,SAAU,6CACVC,SAAU,6CACVC,WAAY,+CAKHC,EAaR,CACH,KAAM,CAEJC,eAAgB,6CAChBC,iBAAkB,6CAClBC,yBAA0B,6CAC1BC,sBAAuB,6CACvBC,cAAe,6CACfC,kBAAmB,6CACnBC,WAAY,6CACZC,mBAAoB,6CACpBC,kBAAmB,6CACnBC,eAAgB,6CAChBC,cAAe,6CACfC,SAAUC,OAAO,OAEnB,KAAM,CAEJZ,eAAgB,6CAChBC,iBAAkB,6CAClBC,yBAA0B,6CAC1BC,sBAAuB,6CACvBC,cAAe,6CACfC,kBAAmB,6CACnBC,WAAY,6CACZC,mBAAoB,6CACpBC,kBAAmB,6CACnBC,eAAgB,6CAChBC,cAAe,6CACfC,SAAUC,OAAO,QAKRC,EAQR,CACH,KAAM,CAEJC,QAAS,CAAC,+BACV/B,KAAM,kBACNgC,eAAgB,CACdhC,KAAM,UACNiC,OAAQ,MACRC,SAAU,KAGd,KAAM,CAEJH,QAAS,CAAC,gCACV/B,KAAM,kBACNgC,eAAgB,CACdhC,KAAM,UACNiC,OAAQ,MACRC,SAAU,MAMHC,EAAuD,CAClE,KAAM,CAEJC,MAAO,CAAC,EAAG,GACXC,eAAgB,CAAC,IAEnB,KAAM,CAEJD,MAAO,CAAC,EAAG,GACXC,eAAgB,CAAC,KAKRC,EACXC,GAEOJ,EAAkBI,IAAY,CAAEH,MAAO,CAAC,EAAG,GAAIC,eAAgB,CAAC,IAG5DG,EAAwBD,GAC5BvB,EAAmBuB,GAGfE,EAAiBF,GACrB3B,EAAY2B,IAAY,CAAA,EAQpBG,EAAmB1B,EACnB2B,EAAa/B,EAAY,OAAS,CAAA,EAGlCgC,EAAgB,CAC3BC,QAAS,0BACTC,cAAe,0BAIJC,EAAc,CACzBC,eAAgB,iBAChBC,eAAgB,iBAChBC,sBAAuB,wBACvBC,UAAW,YACXC,YAAa,cACbC,uBAAwB,gCC7JbC,EAIX,WAAA3D,CAAoB4D,GAClBxD,KAAKwD,OAASA,CAChB,CAWA,kBAAOC,CAAYD,GACjB,IAAKD,EAAUG,SAAU,CAGvB,MAAMC,EAAmB,IACpBH,EACHI,QAAS,IAEHC,QAAQC,IAAIC,2BAA6B,CAC3C,aAAcF,QAAQC,IAAIC,8BAGzBP,EAAOI,UAGdL,EAAUG,SAAW,IAAIH,EAAUI,EACrC,CACA,OAAOJ,EAAUG,QACnB,CAKA,oBAAOM,GACLT,EAAUG,SAAW,IACvB,CAKQ,aAAMO,CACZC,EACArE,EAAuB,IAEvB,MAAMsE,EAAa,IAAIC,gBACjBC,EAAYC,WAAW,IAAMH,EAAWI,QAASvE,KAAKwD,OAAOgB,SAEnE,IACE,MAAMC,QAAiBC,MAAM,GAAG1E,KAAKwD,OAAOmB,UAAUT,IAAY,IAC7DrE,EACH+E,OAAQT,EAAWS,OACnBhB,QAAS,CACP,eAAgB,sBACb5D,KAAKwD,OAAOI,WACZ/D,EAAQ+D,WAMf,GAFAiB,aAAaR,IAERI,EAASK,GACZ,MAAM,IAAInF,MAAM,QAAQ8E,EAASM,WAAWN,EAASO,cAIvD,aADmBP,EAASQ,MAE9B,CAAE,MAAOC,GAGP,GAFAL,aAAaR,GAETa,aAAiBvF,MAAO,CAC1B,GAAmB,eAAfuF,EAAMjF,KACR,MAAM,IAAIP,EAAU,CAClBK,QAAS,kBACTG,KAAM8C,EAAYI,UAClBjD,QAAS,CAAE+D,WAAUM,QAASxE,KAAKwD,OAAOgB,WAG9C,MAAM,IAAI9E,EAAU,CAClBK,QAASmF,EAAMnF,QACfG,KAAM8C,EAAYI,UAClBjD,QAAS,CAAE+D,WAAUiB,cAAeD,IAExC,CAEA,MAAM,IAAIxF,EAAU,CAClBK,QAAS,oBACTG,KAAM8C,EAAYI,UAClBjD,QAAS,CAAE+D,WAAUiB,cAAeD,IAExC,CACF,CAMA,eAAME,CACJC,EACAC,EACAC,EACAlD,EACAC,GAEA,MAAMkD,EAAS,IAAIC,gBAOnB,OANAD,EAAOE,IAAI,MAAOL,EAASM,SAC3BH,EAAOE,IAAI,OAAQJ,EAASK,SAC5BH,EAAOE,IAAI,SAAUH,GACrBC,EAAOE,IAAI,SAAUE,KAAKC,UAAUxD,IACpCmD,EAAOE,IAAI,WAAYE,KAAKC,UAAUvD,IAE/BtC,KAAKiE,QAAwB,GAAGpB,EAAcC,WAAW0C,EAAOM,aAAc,CACnFC,OAAQ,OAEZ,CAMA,qBAAMC,GACJ,OAAOhG,KAAKiE,QAAapB,EAAcE,cAAe,CACpDgD,OAAQ,OAEZ,EAjIexC,EAAAG,SAA6B,KCC9C,IAAIuC,EAAkD,KAiDtD,SAASC,IACPD,EAAsB,KACtBE,QAAQC,IAAI,gCACd,CAOA,MAAMC,EAAyC,CAE7C,KAAM,CACJ,6CACA,6CACA,6CACA,6CACA,6CACA,8CAGF,KAAM,CACJ,6CACA,6CACA,6CACA,+CAUE,SAAUC,EACdC,EACA/D,GAEA,IAAK+D,GAAOZ,QAAS,OAAO,EAE5B,MAAMa,EAAgBH,EAAkB7D,GACxC,QAAKgE,GAEEA,EAAcC,KAClBC,GAASA,EAAKC,gBAAkBJ,EAAMZ,QAAQgB,cAEnD,CAyBM,SAAUC,EACdvB,EACAC,EACA9C,EACAqE,EAA2B,GAG3B,MAAMC,EAAiBR,EAAiBjB,EAAU7C,GAC5CuE,EAAiBT,EAAiBhB,EAAU9C,GAGlD,OAAOsE,GAAkBC,EAAiBF,EAAmB,CAC/D,CAcOG,eAAeC,EACpB5B,EACAC,EACAC,EACA/C,EACA0E,EACAC,EACAC,EAA4B,GAE5B,IACEjB,QAAQC,IAAI,qCAGZ,MAAMiB,QAzJVL,eACEE,EACAC,GAEA,MAAMG,EAAMC,KAAKD,MAGjB,GAAIrB,GAAuBqB,EAAMrB,EAAoBuB,UAEnD,OADArB,QAAQC,IAAI,qCACLH,EAAoBwB,KAI7BtB,QAAQC,IAAI,gDACZ,MAAMsB,EAAYnE,EAAUE,YAAY,CACtCkB,QAASuC,EACT1C,QAAS,IACTZ,QAAS,IACHuD,GAAU,CAAE,aAAcA,MAI5BM,QAAaC,EAAU1B,kBAE7B,IAAKyB,EAAKE,QACR,MAAM,IAAIhI,MAAM,uBAAuB8H,EAAKvC,OAAS,mBAUvD,OANAe,EAAsB,CACpBwB,KAAMA,EAAKA,MAAQ,GACnBG,UAAWN,EACXE,UAAWF,EAtCQ,KAyCdrB,EAAoBwB,IAC7B,CAqH8BI,CAAkBX,EAAYC,GAGlDW,EAAcT,EAAYU,KAC7BC,GACCA,EAAKzB,OAAOI,gBAAkBtB,EAASM,QAAQgB,eAE7CsB,EAAcZ,EAAYU,KAC7BC,GACCA,EAAKzB,OAAOI,gBAAkBrB,EAASK,QAAQgB,eAG7CuB,EAAa,IAAI1I,EAAU+F,GAGjC,OACEuC,GACAG,GACAC,EAAWC,IAAIL,EAAYM,gBAC3BF,EAAWC,IAAIF,EAAYG,gBAE3BjC,QAAQC,IACN,uEAEK,IAEPD,QAAQC,IACN,iFAEKQ,EACLvB,EACAC,EACA9C,EACA4E,GAGN,CAAE,MAAOlC,GAGP,OAFAiB,QAAQkC,KAAK,yCAA0CnD,GACvDiB,QAAQC,IAAI,2CACLQ,EAAoBvB,EAAUC,EAAU9C,EAAS4E,EAC1D,CACF,CA4BOJ,eAAesB,EACpBjD,EACAC,EACAC,EACA/C,EACA0E,EACAE,EAA4B,EAC5BD,GAEA,IACE,aAAaF,EACX5B,EACAC,EACAC,EACA/C,EACA0E,EACAC,EACAC,EAEJ,CAAE,MAAOlC,GAGP,OAFAiB,QAAQkC,KAAK,mDAAoDnD,GAE1DkC,CACT,CACF,UASgBmB,EACdC,EACAC,EACAC,GAEA,GAAsB,IAAlBD,EAAqB,OAAOE,IAGhC,OADuBH,EAAaE,EAAYD,EAAiB,GAEnE,CASM,SAAUG,EACdJ,EACAC,EACAI,EAA6B,GAI7B,OAFyBN,EAAqBC,EAAYC,EAAe,GAElDI,EACd,EAGF,CACT,CCtSM,SAAUC,EAAgBC,EAAgB5G,GAC9C,OAAK4G,GAAUC,MAAMC,OAAOF,IACnB,IAAIvJ,EAAU,GAEhB,IAAIA,EAAUuJ,GAAQG,MAAM,IAAI1J,EAAU,IAAI2J,IAAIhH,GAC3D,CAQM,SAAUiH,EACdL,EACA5G,GAGA,OADW,IAAI3C,EAAUuJ,GACfM,UAAU,IAAI7J,EAAU,IAAI2J,IAAIhH,IAAW2D,UACvD,CAQM,SAAUwD,EAAc/C,EAAc3E,GAC1C,OAAO2E,EAAMZ,QAAQgB,gBAAkB/E,EAAc+E,aACvD,CAQM,SAAU4C,EAAehD,EAAc5E,GAC3C,OAAO4E,EAAMZ,QAAQgB,gBAAkBhF,EAAegF,aACxD,CAQM,SAAU6C,EAAenE,EAAiBC,GAC9C,OACED,GACAC,GACAD,EAASM,SACTL,EAASK,SACTN,EAASM,UAAYL,EAASK,SAC9BN,EAAS7C,UAAY8C,EAAS9C,OAElC,CAOM,SAAUiH,EAAeV,GAC7B,IAAKA,GAAUC,MAAMC,OAAOF,IAC1B,OAAO,EAET,MAAMW,EAAM,IAAIlK,EAAUuJ,GAC1B,OAAOW,EAAIC,GAAG,IAAMD,EAAIE,UAC1B,CASM,SAAUC,EACdd,EACAe,EACApB,EAAoB,IAGpB,OADkB,IAAIlJ,EAAUuJ,GAAQG,MAAMY,GAC7BC,GAAG,GAAK,EAAIrB,CAC/B,CAOM,SAAUsB,EAAY9E,GAC1B,MAAqB,iBAAVA,EACFA,EAELA,GAAOnF,QACFmF,EAAMnF,QAEXmF,GAAOA,MACFA,EAAMA,MAER,wBACT,CAQM,SAAU+E,EACdC,EACAC,GAEA,IAAI3F,EAEJ,MAAM4F,EAAc,IAAIC,KACtBxF,aAAaL,GACbA,EAAUF,WAAW,IAAM4F,KAAQG,GAAOF,IAO5C,OAJAC,EAAYE,OAAS,KACnBzF,aAAaL,IAGR4F,CACT,CCzIO,MAAMG,EAAkB,CAC7B,CACEC,OAAQ,CACN,CACEC,aAAc,UACdxK,KAAM,YACNyK,KAAM,WAER,CACED,aAAc,QACdxK,KAAM,gBACNyK,KAAM,SAER,CACED,aAAc,UACdxK,KAAM,QACNyK,KAAM,YAGVzK,KAAM,aACN0K,QAAS,CACP,CACEC,WAAY,CACV,CACEH,aAAc,UACdxK,KAAM,YACNyK,KAAM,WAER,CACED,aAAc,UACdxK,KAAM,YACNyK,KAAM,YAGVD,aAAc,+BACdxK,KAAM,GACNyK,KAAM,SAER,CACEE,WAAY,CACV,CACEH,aAAc,YACdxK,KAAM,eACNyK,KAAM,aAER,CACED,aAAc,UACdxK,KAAM,YACNyK,KAAM,YAGVD,aAAc,iCACdxK,KAAM,GACNyK,KAAM,UAGVG,gBAAiB,aACjBH,KAAM,mBCdGI,EAGX,WAAAlL,CAAY4D,GACVxD,KAAKwD,OAASA,CAChB,CAMQ,eAAAuH,CAAgBvI,GACtB,GAAIxC,KAAKwD,OAAOwH,aACd,OAAOhL,KAAKwD,OAAOwH,aAGrB,MAAMC,ELuFkB,CAACzI,GACpBT,EAAWS,GKxFE0I,CAAa1I,GAC/B,IAAKyI,EACH,MAAM,IAAIvL,EAAU,CAClBK,QAAS,wBAAwByC,IACjCtC,KAAM8C,EAAYG,sBAClBhD,QAAS,CAAEqC,aAIf,MAAM2I,EAAQC,EAAY,CACxBC,GAAI7I,EACJvC,KAAMgL,EAAUhL,KAChBqL,QAASL,EAAUhL,KAAK0G,cAAc4E,QAAQ,OAAQ,KACtDtJ,eAAgBgJ,EAAUhJ,eAC1BD,QAAS,CACPwJ,QAAS,CAAEC,KAAMR,EAAUjJ,SAC3B0J,OAAQ,CAAED,KAAMR,EAAUjJ,YAI9B,OAAO2J,EAAmB,CACxBR,QACAS,UAAWH,KAEf,CAiCA,gBAAMI,CAAWhM,GACf,MAAM0F,SACJA,EAAQF,SACRA,EAAQC,SACRA,EAAQ9C,QACRA,EACAkG,UAAWoD,EAAiBC,eAC5BA,GACElM,EAGE6I,EACJqD,GACAD,GACA9L,KAAKgM,aACH3G,EACAC,EACA9C,EACAxC,KAAKwD,OAAOqD,kBAIhB,IAAK2C,EAAenE,EAAUC,GAC5B,MAAM,IAAI5F,EAAU,CAClBK,QAAS,0BACTG,KAAM8C,EAAYC,eAClB9C,QAAS,CAAEkF,WAAUC,cAIzB,IAAKmE,EAAelE,GAClB,MAAM,IAAI7F,EAAU,CAClBK,QAAS,0BACTG,KAAM8C,EAAYE,eAClB/C,QAAS,CAAEoF,cAIf,MAAM2C,EAAaY,EAAgBvD,EAAUF,EAASlD,WAChDb,cAAEA,EAAaI,kBAAEA,EAAiBC,eAAEA,EAAcC,cAAEA,GACxD5B,KAAKwD,OAAOA,OAERyI,EAAc3C,EAAcjE,EAAUzD,GACtCsK,EAAc5C,EAAchE,EAAU1D,GAG5C,GACGqK,GAAe1C,EAAejE,EAAU3D,IACxCuK,GAAe3C,EAAelE,EAAU1D,GACzC,CACA,MAAMwK,EAASF,EAAc,OAAS,SAChCG,EAAclE,EAEpB,MAAO,CACLmE,OAAQ,CACN,CACE,CACE/K,gBACAgL,UAAWC,EACXC,UAAWnH,EAASM,QACpB8G,QAASnH,EAASK,QAClB+G,KAAMrH,EAASM,QACfgH,GAAIrH,EAASK,QACbiH,KAAM,YACNC,eAAgB,QAChBC,aAAc,KAIpBC,cAAe,CAACrE,GAChBsE,gBAAiB,CAACZ,GAClBA,cACAa,cAAe,CAAC/E,GAChBgF,kBAAkB,EAClBf,SAEJ,CAGA,MAAMgB,EAAgBlB,EAClB,IAAK5G,EAAUM,QAAShE,GACxB0D,EACE+H,EAAgBlB,EAClB,IAAK5G,EAAUK,QAAShE,GACxB2D,EAEJ,IAEE,MAAM+H,QAAiBrN,KAAKwD,OAAOkE,UAAUtC,UAC3C+H,EACAC,EACAlF,EAAWoF,QAAQ,GACnBzN,EAAQwC,OAAS,CAAC,EAAG,GACrBxC,EAAQyC,gBAAkB,CAAC,KAGvBiL,KAAEA,EAAIC,UAAEA,GAAcH,EAAS5F,KAErC,GAAoB,IAAhB8F,EAAKE,OACP,MAAO,CACLpB,OAAQ,GACRU,cAAe,GACfC,gBAAiB,GACjBZ,YAAa,IAAI5M,EAAU,GAC3ByN,cAAe,GACfC,kBAAkB,GAKtB,MAAMQ,EAAgBC,EACpB,CACE,CACEjD,KAAM,YACNE,WAAY,CACV,CAAEF,KAAM,UAAWzK,KAAM,OACzB,CAAEyK,KAAM,UAAWzK,KAAM,QACzB,CAAEyK,KAAM,QAASzK,KAAM,UACvB,CAAEyK,KAAM,QAASzK,KAAM,YACvB,CAAEyK,KAAM,QAASzK,KAAM,WAI7B,CAACsN,IAIH,IAAInB,EAAc,IAAI5M,EAAU,GAC5BuN,EAA0B,GAC1BV,EAAgB,GAEpB,MAAMrB,EAAehL,KAAK+K,gBAAgBvI,GAC1C,IACE,MAAMiF,EAAOmG,EAAmB,CAC9BC,IAAKtD,EACLuD,aAAc,aACdzD,KAAM,CACJnC,EAAWoF,QAAQ,GACnBI,EACAhF,KAIEqF,QAAe/C,EAAagD,KAAK,CACrCrB,GAAIjL,EACJ+F,KAAMA,EACNwG,IAAK,aACLC,cAAUC,IAGZ,GAAIJ,EAAOtG,KAAM,CACf,MAMM2G,EANUC,EAAqB,CACnCR,IAAKtD,EACLuD,aAAc,aACdrG,KAAMsG,EAAOtG,OAGgB,GAC/B,GAAI2G,GAAkBA,EAAeE,UAAW,CAC9ClC,EAAc,IAAI5M,EAAU4O,EAAeE,UAAUxI,YACrD,IAAIyI,EAAmBH,EAAeI,aAAaC,IAChDC,GAAc,IAAIlP,EAAUkP,EAAE5I,YAAY6I,YAI7CtC,EAASmB,EAAUoB,OACjB,CAACC,EAAYC,EAAaC,KACpBR,EAAiBQ,GAAK,GACxBF,EAAIG,KACFF,EAAKL,IAAI,CAAClP,EAAY0P,EAAWC,KAAa,CAC5C5N,cACEsB,EAAWrD,EAAM4P,OAAS,IAAM5P,EAAMmL,OACtC6B,EACFD,UAAW/M,EAAM6P,MAAQ7C,EACzBC,UAAWjN,EAAM8P,IACjB5C,QAASlN,EAAM+P,KACf5C,KACEuC,EAAI,GACW,OAAf1P,EAAMmL,MACNnL,EAAM8P,MAAQ1N,EAAegF,cACzBlG,EACAD,EACNmM,GACEsC,EAAIC,EAAOzB,OAAS,GACnBwB,IAAMC,EAAOzB,OAAS,GACrBlO,EAAM+P,OAAS3N,EAAegF,cAC5BlG,EACAD,EACNoM,KAAM,YACNC,eAAgB,IAAIrN,EAAU,KAC3B+P,MAAM,IAAI/P,EAAUD,EAAMiQ,KAAO,GAAGnG,UAAU,MAC9CiE,UACHR,aACEzM,EACEd,EAAMmL,OACH,MAINmE,GAET,IAIF9B,EAAgBwB,EAAiBkB,OAAQf,GAAcA,EAAI,EAC7D,CACF,CACA,CAAE,MAAOgB,GAEPtD,EAAc,IAAI5M,EAAU,GAC5BuN,EAAgB,GAChBV,EAAS,EACX,CAGF,MAAMW,EAAkBD,EAAc0B,IAAKkB,GACzCvD,EAAYlD,MAAMyG,GAAItG,UAAUX,GAAWkH,GAAG,EAAGpQ,EAAUqQ,aAGvD5C,EAAgBF,EAAc0B,IAAKD,GACvCtG,EACGgB,MAAMsF,GACNnF,UAAUX,GACVkH,GAAG,EAAGpQ,EAAUqQ,aAKrB,MAAO,CACLxD,SACAU,gBACAC,kBACAZ,cACAa,gBACAC,kBAAkB,EAEtB,CAAE,MAAOhI,GACP,MAAM,IAAIxF,EAAU,CAClBK,QAAS,6BACTG,KAAM8C,EAAYI,UAClBjD,QAAS,CAAEgF,cAAeD,EAAOrF,YAErC,CACF,CAKA,oBAAAiQ,GAEE,OAAOC,OAAOC,KAAKrN,GAAkB8L,IAAIxF,OAC3C,CAKA,gBAAAgH,CAAiBzN,GAEf,OAAOxC,KAAKwD,OAAOA,MACrB,CAUQ,YAAAwI,CACN3G,EACAC,EACA9C,EACAqE,GAEA,OAAOD,EAAoBvB,EAAUC,EAAU9C,EAASqE,EAC1D,ECnWKG,eAAekJ,EACpBrQ,EACA2D,EAA+B,IAG/B,MAAM0D,WACJA,EAAatG,EAAoBiG,iBACjCA,EAAmBnG,EAAkB8D,QACrCA,EAAU,IAAKZ,QACfA,EAAU,GAAEoH,aACZA,GACExH,EAGEhB,EAAU3C,EAAQ2C,QAClB2N,EAAgB1N,EAAqBD,GAE3C,IAAK2N,EACH,MAAM,IAAIxQ,MAAM,wBAAwB6C,KAI1C,MAAMkF,EAAYnE,EAAUE,YAAY,CACtCkB,QAASuC,EACT1C,QAASA,EACTZ,QAASA,IAeX,OAZoB,IAAIkH,EAAc,CACpCtH,OAAQ,CACNlC,cAAe6O,EAAc7O,cAC7BI,kBAAmByO,EAAczO,kBACjCC,eAAgBwO,EAAcxO,eAC9BC,cAAeuO,EAAcvO,eAE/BiF,iBAAkBA,EAClBa,UAAWA,EACXsD,aAAcA,IAGGa,WAAWhM,EAChC,CAKOmH,eAAeoJ,GACpBC,GAgBA,aAdsBC,QAAQC,WAC5BF,EAAM5B,IAAIzH,OAASnH,UAAS2D,aAC1B,IAEE,MAAO,CAAEmE,SAAS,EAAMF,WADHyI,EAAerQ,EAAS2D,GAE/C,CAAE,MAAO0B,GACP,MAAO,CACLyC,SAAS,EACTzC,MAAOA,aAAiBvF,MAAQuF,EAAMnF,QAAU,gBAEpD,MAIW0O,IAAKV,GACI,cAAlBA,EAAOhJ,OACFgJ,EAAOxO,MAEP,CACLoI,SAAS,EACTzC,MAAO6I,EAAOyC,QAAQzQ,SAAW,iBAIzC,CAKOiH,eAAeyJ,GACpBpL,EACAC,EACAC,EACA/C,EACAgB,EAA+B,IAE/B,MAAMuK,QAAemC,EACnB,CACE3K,WACAF,WACAC,WACA9C,WAEFgB,GAGF,MAAO,CACL8K,UAAWP,EAAO3B,YAAYkB,QAAQ,GACtCjB,OAAQ0B,EAAO1B,OAAOoB,OAE1B,CAeOzG,eAAe0J,GACpB7Q,EACA2D,EAA+B,IAE/B,MAAMnB,MAAEA,EAAKC,eAAEA,GAAmBC,EAAoB1C,EAAQ2C,SAE9D,OAAO0N,EACL,IACKrQ,EACHwC,QACAC,kBAEF,IACKkB,EACHuI,eAAgBvI,EAAOuI,gBAG7B,CClCO,MAAM4E,GAAkB,CAC7BtL,EACAC,EACAC,EACA/C,EACAgB,EAAgC,MAGhC,MAAMoN,EAAiBC,EAAQ,MAAS,GAAG,IACrCC,EAAuBD,EAC3B,KAAA,CAEIvP,cAAeiL,EACf7K,kBAAmB6K,EACnB5K,eAAgB4K,EAChB3K,cAAe2K,IAEnB,KAIIrF,WACJA,EAAU6J,cACVA,EAAalK,iBACbA,EAAgBrC,QAChBA,EAAOZ,QACPA,EAAOoN,gBACPA,EAAehG,aACfA,EAAYiG,YACZA,EAAWC,qBACXA,EAAoBnF,eACpBA,EAAcoF,mBACdA,GACEN,EAAQ,KACV,MAAM3J,WACJA,EAAatG,EACb4C,OAAQuN,EAAgBD,EAAoBjK,iBAC5CA,EAAmB,EAACrC,QACpBA,EAAU,IAAKZ,QACfA,EAAUgN,EAAcI,gBACxBA,EAAkB,IAAKhG,aACvBA,EACA3I,MAAO4O,EACP3O,eAAgB4O,EAAoBnF,eACpCA,EAAcoF,mBACdA,GAAqB,GACnB3N,EAEJ,MAAO,CACL0D,aACA6J,gBACAlK,mBACArC,UACAZ,UACAoN,kBACAhG,eACAiG,cACAC,uBACAnF,iBACAoF,uBAED,CAAC3N,EAAQoN,EAAgBE,IAGtBM,EAA0BP,EAC9B,IAAMtO,EAAoBC,GAC1B,CAACA,IAEGH,EAAQwO,EACZ,IAAMI,GAAeG,EAAwB/O,MAC7C,CAAC4O,EAAaG,EAAwB/O,QAElCC,EAAiBuO,EACrB,IAAMK,GAAwBE,EAAwB9O,eACtD,CAAC4O,EAAsBE,EAAwB9O,iBAIjD+O,EAAU,KACRlL,QAAQC,IAAI,SAAU5C,IACrB,CAACA,IAEJ6N,EAAU,KACRlL,QAAQC,IAAI,WAAYf,IACvB,CAACA,IAEJgM,EAAU,KACRlL,QAAQC,IAAI,WAAYd,IACvB,CAACA,IAEJ+L,EAAU,KACRlL,QAAQC,IAAI,WAAYb,IACvB,CAACA,IAEJ8L,EAAU,KACRlL,QAAQC,IAAI,UAAW5D,IACtB,CAACA,IAEJ6O,EAAU,KACRlL,QAAQC,IAAI,aAAcc,IACzB,CAACA,IAEJmK,EAAU,KACRlL,QAAQC,IAAI,gBAAiB2K,IAC5B,CAACA,IAEJM,EAAU,KACRlL,QAAQC,IAAI,mBAAoBS,IAC/B,CAACA,IAEJwK,EAAU,KACRlL,QAAQC,IAAI,UAAW5B,IACtB,CAACA,IAEJ6M,EAAU,KACRlL,QAAQC,IAAI,UAAWxC,IACtB,CAACA,IAEJyN,EAAU,KACRlL,QAAQC,IAAI,QAAS/D,IACpB,CAACA,IAEJgP,EAAU,KACRlL,QAAQC,IAAI,iBAAkB9D,IAC7B,CAACA,IAEJ,MAAO8J,EAAakF,GAAkBC,EAAoB,IAAI/R,EAAU,KACjE6M,EAAQmF,GAAaD,EAAkB,KACvCxE,EAAe0E,GAAoBF,EAAmB,KACtDvE,EAAiB0E,GAAsBH,EAAgB,KACvDtE,EAAe0E,GAAoBJ,EAAgB,KACnDK,EAAWC,GAAgBN,GAAS,IACpCrE,EAAkB4E,GAAuBP,GAAS,IAClDpF,EAAQ4F,GAAaR,KACrBS,EAAcC,GAAmBV,GAAS,IAC1CrM,EAAOgN,IAAYX,EAAwB,OAC3CY,GAAiBC,IAAsBb,EAAwB,MAGhE7I,GAAYmI,EAAQ,KACxB1K,QAAQC,IAAI,YAAa,EAAG+K,GAExBA,EAEyB,OAApBgB,GACHA,GACAvL,EAAoBvB,EAAUC,EAAU9C,EAASqE,IAEvDV,QAAQC,IAAI,YAAa,EAAG2F,QAGLoC,IAAnBpC,EACKA,GAET5F,QAAQC,IAAI,YAAa,EAAGS,GAGrBD,EAAoBvB,EAAUC,EAAU9C,EAASqE,MACvD,CACDA,EACAkF,EACAoF,EACAgB,GACA9M,EACAC,EACA9C,IAIF6O,EAAU,KACR,KAAKF,GAAuB9L,GAAaC,GAAaC,GAEpD,YADA6M,GAAmB,MAIQpL,WAC3B,IACE,MAAMqL,QAA6B/J,EACjCjD,EACAC,EACAC,EACA/C,EACA0E,EACAL,GAEFuL,GAAmBC,EACrB,CAAE,MAAOnN,GACPiB,QAAQkC,KAAK,oCAAqCnD,GAClDkN,GAAmB,KACrB,GAGFE,IACC,CACDnB,EACA9L,EACAC,EACAC,EACA/C,EACA0E,EACAL,IAIF,MAAM0L,GAAc1B,EAAQ,KAE1B,MAAM2B,EAAmB/P,EAAqBD,GACxCiQ,EACJ1B,GAAiBhB,OAAOC,KAAKe,GAAetD,OAAS,EACjDsD,EACA,CACEzP,cACEkR,GAAkBlR,eAClB,6CACFI,kBACE8Q,GAAkB9Q,mBAClB,6CACFC,eACE6Q,GAAkB7Q,gBAClB,6CACFC,cACE4Q,GAAkB5Q,eAClB,8CAIJ8F,EAAYnE,EAAUE,YAAY,CACtCkB,QAASuC,EACT1C,QAASA,EACTZ,QAASA,IAGX,OAAO,IAAIkH,EAAc,CACvBtH,OAAQiP,EACR5L,iBAAkBA,EAClBa,YACAsD,aAAcA,KAEf,CACD+F,EACAlK,EACAK,EACA1C,EACAZ,EACAoH,EACAxI,IAGIkQ,GAAaC,EAAY,KAC7BT,GAAS,OACR,IAEGrG,GAAa8G,EAAY3L,UAC7B,IAAK3B,IAAaC,IAAaC,GAAyB,MAAbA,EASzC,OARA+L,EAAe,IAAI9R,EAAU,IAC7BgS,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,QAChBC,GAAS,MAIXL,GAAa,GACbK,GAAS,MAET,IACE,MAAMrS,EAAuB,CAC3B0F,WACAF,WACAC,WACA9C,UACAkG,UAAWA,GACXrG,MAAOA,EACPC,eAAgBA,GAGZyL,QAA2BwE,GAAY1G,WAAWhM,GAExDyR,EAAevD,EAAO3B,aACtBoF,EAAUzD,EAAO1B,QACjBoF,EAAiB1D,EAAOhB,eACxB2E,EAAmB3D,EAAOf,iBAC1B2E,EAAiB5D,EAAOd,eACxB6E,EAAoB/D,EAAOb,kBAC3B6E,EAAUhE,EAAO5B,QACjB8F,GAAgB,EAClB,CAAE,MAAOW,GACP,MAAMC,EACJD,aAAejT,MAAQiT,EAAI7S,QAAU,yBACvCmS,GAASW,GACT1M,QAAQjB,MAAM,wBAAyB0N,GAEvCtB,EAAe,IAAI9R,EAAU,IAC7BgS,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,EAClB,SACEJ,GAAa,EACf,GACC,CACDU,GACAlN,EACAC,EACAC,EACA/C,EACAkG,GACArG,EACAC,IAIIwQ,GAAsBjC,EAC1B,IAAM5G,EAAS4B,GAAY,KAC3B,CAACA,KA+CH,OA3CAwF,EAAU,KACR,IAAK9L,GAAyB,MAAbA,EASf,OARA+L,EAAe,IAAI9R,EAAU,IAC7BgS,EAAU,IACVC,EAAiB,IACjBC,EAAmB,IACnBC,EAAiB,IACjBG,GAAoB,GACpBG,GAAgB,QAChBC,GAAS,MAIXY,KAGA,MAAMC,EAAaC,YAAY,KAC7BF,MACC9B,GAEH,MAAO,KACLiC,cAAcF,GAE4B,mBAA/BD,GAAoBxI,QAC7BwI,GAAoBxI,WAGvB,CACD/E,EACAF,GAAUM,QACVL,GAAUK,QACVmN,GACA9B,IAIFK,EAAU,KAEJW,GACFnG,MAED,CAACA,GAAYmG,EAAcO,KAEvB,CACLlG,SACAU,gBACAC,kBACAZ,cACAa,gBACApB,cACA+F,YACA1E,mBACA8E,eACA7F,SACAjH,QACAwN"}