npm - @stonecrop/graphql-client - Versions diffs - 0.6.2 → 0.6.3 - Mend

@stonecrop/graphql-client 0.6.2 → 0.6.3

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 (6) hide show

package/dist/graphql-client.js +787 -697
package/dist/graphql-client.js.map +1 -1
package/dist/graphql-client.umd.cjs +38 -38
package/dist/graphql-client.umd.cjs.map +1 -1
package/dist/src/tsdoc-metadata.json +1 -1
package/package.json +2 -2

package/dist/graphql-client.js.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"graphql-client.js","sources":["../../common/temp/node_modules/.pnpm/decimal.js@10.4.3/node_modules/decimal.js/decimal.mjs","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/defaultJsonSerializer.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/helpers.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/parseArgs.js","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/jsutils/devAssert.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/jsutils/isObjectLike.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/jsutils/invariant.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/location.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/printLocation.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/error/GraphQLError.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/error/syntaxError.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/ast.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/directiveLocation.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/kinds.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/characterClasses.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/blockString.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/tokenKind.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/lexer.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/jsutils/inspect.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/jsutils/instanceOf.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/source.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/parser.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/printString.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/visitor.mjs","../../common/temp/node_modules/.pnpm/graphql@16.6.0/node_modules/graphql/language/printer.mjs","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/resolveRequestDocument.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/types.js","../../common/temp/node_modules/.pnpm/cross-fetch@3.2.0/node_modules/cross-fetch/dist/browser-ponyfill.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.6.0/node_modules/graphql-request/build/esm/index.js","../src/queries.ts","../src/gql/schema.ts","../src/index.ts"],"sourcesContent":["/!\r\n decimal.js v10.4.3\r\n * An arbitrary-precision Decimal type for JavaScript.\r\n * https://github.com/MikeMcl/decimal.js\r\n * Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licence\r\n /\r\n\r\n\r\n// ----------------------------------- EDITABLE DEFAULTS ------------------------------------ //\r\n\r\n\r\n // The maximum exponent magnitude.\r\n // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\nvar EXP_LIMIT = 9e15, // 0 to 9e15\r\n\r\n // The limit on the value of `precision`, and on the value of the first argument to\r\n // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n MAX_DIGITS = 1e9, // 0 to 1e9\r\n\r\n // Base conversion alphabet.\r\n NUMERALS = '0123456789abcdef',\r\n\r\n // The natural logarithm of 10 (1025 digits).\r\n LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n // Pi (1025 digits).\r\n PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n // The initial configuration properties of the Decimal constructor.\r\n DEFAULTS = {\r\n\r\n // These values must be integers within the stated ranges (inclusive).\r\n // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n // The maximum number of significant digits of the result of a calculation or base conversion.\r\n // E.g. `Decimal.config({ precision: 20 });`\r\n precision: 20, // 1 to MAX_DIGITS\r\n\r\n // The rounding mode used when rounding to `precision`.\r\n //\r\n // ROUND_UP 0 Away from zero.\r\n // ROUND_DOWN 1 Towards zero.\r\n // ROUND_CEIL 2 Towards +Infinity.\r\n // ROUND_FLOOR 3 Towards -Infinity.\r\n // ROUND_HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // ROUND_HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // ROUND_HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // ROUND_HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n //\r\n // E.g.\r\n // `Decimal.rounding = 4;`\r\n // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n rounding: 4, // 0 to 8\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 (JavaScript %).\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 The IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n //\r\n // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n // be used, but they may not give useful results.\r\n modulo: 1, // 0 to 9\r\n\r\n // The exponent value at and beneath which `toString` returns exponential notation.\r\n // JavaScript numbers: -7\r\n toExpNeg: -7, // 0 to -EXP_LIMIT\r\n\r\n // The exponent value at and above which `toString` returns exponential notation.\r\n // JavaScript numbers: 21\r\n toExpPos: 21, // 0 to EXP_LIMIT\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // JavaScript numbers: -324 (5e-324)\r\n minE: -EXP_LIMIT, // -1 to -EXP_LIMIT\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // JavaScript numbers: 308 (1.7976931348623157e+308)\r\n maxE: EXP_LIMIT, // 1 to EXP_LIMIT\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n crypto: false // true/false\r\n },\r\n\r\n\r\n// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n inexact, quadrant,\r\n external = true,\r\n\r\n decimalError = '[DecimalError] ',\r\n invalidArgument = decimalError + 'Invalid argument: ',\r\n precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n cryptoUnavailable = decimalError + 'crypto unavailable',\r\n tag = '[object Decimal]',\r\n\r\n mathfloor = Math.floor,\r\n mathpow = Math.pow,\r\n\r\n isBinary = /^0b([01]+(\\.[01])?\|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n isHex = /^0x([0-9a-f]+(\\.[0-9a-f])?\|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n isOctal = /^0o([0-7]+(\\.[0-7])?\|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n isDecimal = /^(\\d+(\\.\\d)?\|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n BASE = 1e7,\r\n LOG_BASE = 7,\r\n MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n LN10_PRECISION = LN10.length - 1,\r\n PI_PRECISION = PI.length - 1,\r\n\r\n // Decimal.prototype object\r\n P = { toStringTag: tag };\r\n\r\n\r\n// Decimal prototype methods\r\n\r\n\r\n/\r\n absoluteValue abs\r\n * ceil\r\n * clampedTo clamp\r\n * comparedTo cmp\r\n * cosine cos\r\n * cubeRoot cbrt\r\n * decimalPlaces dp\r\n * dividedBy div\r\n * dividedToIntegerBy divToInt\r\n * equals eq\r\n * floor\r\n * greaterThan gt\r\n * greaterThanOrEqualTo gte\r\n * hyperbolicCosine cosh\r\n * hyperbolicSine sinh\r\n * hyperbolicTangent tanh\r\n * inverseCosine acos\r\n * inverseHyperbolicCosine acosh\r\n * inverseHyperbolicSine asinh\r\n * inverseHyperbolicTangent atanh\r\n * inverseSine asin\r\n * inverseTangent atan\r\n * isFinite\r\n * isInteger isInt\r\n * isNaN\r\n * isNegative isNeg\r\n * isPositive isPos\r\n * isZero\r\n * lessThan lt\r\n * lessThanOrEqualTo lte\r\n * logarithm log\r\n * [maximum] [max]\r\n * [minimum] [min]\r\n * minus sub\r\n * modulo mod\r\n * naturalExponential exp\r\n * naturalLogarithm ln\r\n * negated neg\r\n * plus add\r\n * precision sd\r\n * round\r\n * sine sin\r\n * squareRoot sqrt\r\n * tangent tan\r\n * times mul\r\n * toBinary\r\n * toDecimalPlaces toDP\r\n * toExponential\r\n * toFixed\r\n * toFraction\r\n * toHexadecimal toHex\r\n * toNearest\r\n * toNumber\r\n * toOctal\r\n * toPower pow\r\n * toPrecision\r\n * toSignificantDigits toSD\r\n * toString\r\n * truncated trunc\r\n * valueOf toJSON\r\n /\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n \r\n /\r\nP.absoluteValue = P.abs = function () {\r\n var x = new this.constructor(this);\r\n if (x.s < 0) x.s = 1;\r\n return finalise(x);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n \r\n /\r\nP.ceil = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 2);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n \r\n min {number\|string\|Decimal}\r\n * max {number\|string\|Decimal}\r\n \r\n /\r\nP.clampedTo = P.clamp = function (min, max) {\r\n var k,\r\n x = this,\r\n Ctor = x.constructor;\r\n min = new Ctor(min);\r\n max = new Ctor(max);\r\n if (!min.s \|\| !max.s) return new Ctor(NaN);\r\n if (min.gt(max)) throw Error(invalidArgument + max);\r\n k = x.cmp(min);\r\n return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n};\r\n\r\n\r\n/\r\n Return\r\n * 1 if the value of this Decimal is greater than the value of `y`,\r\n * -1 if the value of this Decimal is less than the value of `y`,\r\n * 0 if they have the same value,\r\n * NaN if the value of either Decimal is NaN.\r\n \r\n /\r\nP.comparedTo = P.cmp = function (y) {\r\n var i, j, xdL, ydL,\r\n x = this,\r\n xd = x.d,\r\n yd = (y = new x.constructor(y)).d,\r\n xs = x.s,\r\n ys = y.s;\r\n\r\n // Either NaN or ±Infinity?\r\n if (!xd \|\| !yd) {\r\n return !xs \|\| !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Either zero?\r\n if (!xd[0] \|\| !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n // Signs differ?\r\n if (xs !== ys) return xs;\r\n\r\n // Compare exponents.\r\n if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Compare digit by digit.\r\n for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n cos(0) = 1\r\n * cos(-0) = 1\r\n * cos(Infinity) = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN) = NaN\r\n \r\n /\r\nP.cosine = P.cos = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.d) return new Ctor(NaN);\r\n\r\n // cos(0) = cos(-0) = 1\r\n if (!x.d[0]) return new Ctor(1);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 \|\| quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n \r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n cbrt(0) = 0\r\n * cbrt(-0) = -0\r\n * cbrt(1) = 1\r\n * cbrt(-1) = -1\r\n * cbrt(N) = N\r\n * cbrt(-I) = -I\r\n * cbrt(I) = I\r\n \r\n Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n \r\n /\r\nP.cubeRoot = P.cbrt = function () {\r\n var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n // Math.cbrt underflow/overflow?\r\n // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n if (!s \|\| Math.abs(s) == 1 / 0) {\r\n n = digitsToString(x.d);\r\n e = x.e;\r\n\r\n // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n if (s = (e - n.length + 1) % 3) n += (s == 1 \|\| s == -2 ? '0' : '00');\r\n s = mathpow(n, 1 / 3);\r\n\r\n // Rarely, e may be one less than the result exponent value.\r\n e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 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 Ctor(n);\r\n r.s = x.s;\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Halley's method.\r\n // TODO? Compare Newton's method.\r\n for (;;) {\r\n t = r;\r\n t3 = t.times(t).times(t);\r\n t3plusx = t3.plus(x);\r\n r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n // , i.e. approaching a rounding boundary, continue the 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 exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 0);\r\n\r\n if (t.times(t).times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // 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 finalise(r, e + 1, 1);\r\n m = !r.times(r).times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/\r\n Return the number of decimal places of the value of this Decimal.\r\n \r\n /\r\nP.decimalPlaces = P.dp = function () {\r\n var w,\r\n d = this.d,\r\n n = NaN;\r\n\r\n if (d) {\r\n w = d.length - 1;\r\n n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n w = d[w];\r\n if (w) for (; w % 10 == 0; w /= 10) n--;\r\n if (n < 0) n = 0;\r\n }\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 Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.dividedBy = P.div = function (y) {\r\n return divide(this, new this.constructor(y));\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.dividedToIntegerBy = P.divToInt = function (y) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n \r\n /\r\nP.equals = P.eq = function (y) {\r\n return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n \r\n /\r\nP.floor = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 3);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n \r\n /\r\nP.greaterThan = P.gt = function (y) {\r\n return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n \r\n /\r\nP.greaterThanOrEqualTo = P.gte = function (y) {\r\n var k = this.cmp(y);\r\n return k == 1 \|\| k === 0;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n \r\n cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n \r\n cosh(0) = 1\r\n * cosh(-0) = 1\r\n * cosh(Infinity) = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN) = NaN\r\n \r\n x time taken (ms) result\r\n * 1000 9 9.8503555700852349694e+433\r\n * 10000 25 4.4034091128314607936e+4342\r\n * 100000 171 1.4033316802130615897e+43429\r\n * 1000000 3817 1.5166076984010437725e+434294\r\n * 10000000 abandoned after 2 minute wait\r\n \r\n TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n \r\n /\r\nP.hyperbolicCosine = P.cosh = function () {\r\n var k, n, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor,\r\n one = new Ctor(1);\r\n\r\n if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n if (x.isZero()) return one;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n // TODO? Estimation reused from cosine() and may not be optimal here.\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n n = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n n = '2.3283064365386962890625e-10';\r\n }\r\n\r\n x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n // Reverse argument reduction\r\n var cosh2_x,\r\n i = k,\r\n d8 = new Ctor(8);\r\n for (; i--;) {\r\n cosh2_x = x.times(x);\r\n x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n }\r\n\r\n return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n \r\n sinh(0) = 0\r\n * sinh(-0) = -0\r\n * sinh(Infinity) = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN) = NaN\r\n \r\n x time taken (ms)\r\n * 10 2 ms\r\n * 100 5 ms\r\n * 1000 14 ms\r\n * 10000 82 ms\r\n * 100000 886 ms 1.4033316802130615897e+43429\r\n * 200000 2613 ms\r\n * 300000 5407 ms\r\n * 400000 8824 ms\r\n * 500000 13026 ms 8.7080643612718084129e+217146\r\n * 1000000 48543 ms\r\n \r\n TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n \r\n /\r\nP.hyperbolicSine = P.sinh = function () {\r\n var k, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n } else {\r\n\r\n // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n // 3 multiplications and 1 addition\r\n\r\n // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n // 4 multiplications and 2 additions\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k \| 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n // Reverse argument reduction\r\n var sinh2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sinh2_x = x.times(x);\r\n x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n }\r\n }\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n tanh(x) = sinh(x) / cosh(x)\r\n \r\n tanh(0) = 0\r\n * tanh(-0) = -0\r\n * tanh(Infinity) = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN) = NaN\r\n \r\n /\r\nP.hyperbolicTangent = P.tanh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(x.s);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 7;\r\n Ctor.rounding = 1;\r\n\r\n return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n \r\n Domain: [-1, 1]\r\n * Range: [0, pi]\r\n \r\n acos(x) = pi/2 - asin(x)\r\n \r\n acos(0) = pi/2\r\n * acos(-0) = pi/2\r\n * acos(1) = 0\r\n * acos(-1) = pi\r\n * acos(1/2) = pi/3\r\n * acos(-1/2) = 2pi/3\r\n acos(\|x\| > 1) = NaN\r\n * acos(NaN) = NaN\r\n \r\n /\r\nP.inverseCosine = P.acos = function () {\r\n var halfPi,\r\n x = this,\r\n Ctor = x.constructor,\r\n k = x.abs().cmp(1),\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n return k === 0\r\n // \|x\| is 1\r\n ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n // \|x\| > 1 or x is NaN\r\n : new Ctor(NaN);\r\n }\r\n\r\n if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2pi/3\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.asin();\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return halfPi.minus(x);\r\n};\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n \r\n Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n \r\n acosh(x) = ln(x + sqrt(x^2 - 1))\r\n \r\n acosh(x < 1) = NaN\r\n * acosh(NaN) = NaN\r\n * acosh(Infinity) = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0) = NaN\r\n * acosh(-0) = NaN\r\n * acosh(1) = 0\r\n * acosh(-1) = NaN\r\n \r\n /\r\nP.inverseHyperbolicCosine = P.acosh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n if (!x.isFinite()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n asinh(x) = ln(x + sqrt(x^2 + 1))\r\n \r\n asinh(NaN) = NaN\r\n * asinh(Infinity) = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0) = 0\r\n * asinh(-0) = -0\r\n \r\n /\r\nP.inverseHyperbolicSine = P.asinh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n \r\n Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n \r\n atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n \r\n atanh(\|x\| > 1) = NaN\r\n * atanh(NaN) = NaN\r\n * atanh(Infinity) = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0) = 0\r\n * atanh(-0) = -0\r\n * atanh(1) = Infinity\r\n * atanh(-1) = -Infinity\r\n \r\n /\r\nP.inverseHyperbolicTangent = P.atanh = function () {\r\n var pr, rm, wpr, xsd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n xsd = x.sd();\r\n\r\n if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n Ctor.precision = wpr = xsd - x.e;\r\n\r\n x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n Ctor.precision = pr + 4;\r\n Ctor.rounding = 1;\r\n\r\n x = x.ln();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(0.5);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n \r\n asin(x) = 2atan(x/(1 + sqrt(1 - x^2)))\r\n \r\n * asin(0) = 0\r\n * asin(-0) = -0\r\n * asin(1/2) = pi/6\r\n * asin(-1/2) = -pi/6\r\n * asin(1) = pi/2\r\n * asin(-1) = -pi/2\r\n * asin(\|x\| > 1) = NaN\r\n * asin(NaN) = NaN\r\n \r\n TODO? Compare performance of Taylor series.\r\n \r\n /\r\nP.inverseSine = P.asin = function () {\r\n var halfPi, k,\r\n pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n k = x.abs().cmp(1);\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n\r\n // \|x\| is 1\r\n if (k === 0) {\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n halfPi.s = x.s;\r\n return halfPi;\r\n }\r\n\r\n // \|x\| > 1 or x is NaN\r\n return new Ctor(NaN);\r\n }\r\n\r\n // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(2);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n \r\n atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n \r\n atan(0) = 0\r\n * atan(-0) = -0\r\n * atan(1) = pi/4\r\n * atan(-1) = -pi/4\r\n * atan(Infinity) = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN) = NaN\r\n \r\n /\r\nP.inverseTangent = P.atan = function () {\r\n var i, j, k, n, px, t, r, wpr, x2,\r\n x = this,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (!x.isFinite()) {\r\n if (!x.s) return new Ctor(NaN);\r\n if (pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n r.s = x.s;\r\n return r;\r\n }\r\n } else if (x.isZero()) {\r\n return new Ctor(x);\r\n } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n r.s = x.s;\r\n return r;\r\n }\r\n\r\n Ctor.precision = wpr = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n // Argument reduction\r\n // Ensure \|x\| < 0.42\r\n // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n k = Math.min(28, wpr / LOG_BASE + 2 \| 0);\r\n\r\n for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n external = false;\r\n\r\n j = Math.ceil(wpr / LOG_BASE);\r\n n = 1;\r\n x2 = x.times(x);\r\n r = new Ctor(x);\r\n px = x;\r\n\r\n // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n for (; i !== -1;) {\r\n px = px.times(x2);\r\n t = r.minus(px.div(n += 2));\r\n\r\n px = px.times(x2);\r\n r = t.plus(px.div(n += 2));\r\n\r\n if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n }\r\n\r\n if (k) r = r.times(2 << (k - 1));\r\n\r\n external = true;\r\n\r\n return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is a finite number, otherwise return false.\r\n \r\n /\r\nP.isFinite = function () {\r\n return !!this.d;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is an integer, otherwise return false.\r\n \r\n /\r\nP.isInteger = P.isInt = function () {\r\n return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is NaN, otherwise return false.\r\n \r\n /\r\nP.isNaN = function () {\r\n return !this.s;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is negative, otherwise return false.\r\n \r\n /\r\nP.isNegative = P.isNeg = function () {\r\n return this.s < 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is positive, otherwise return false.\r\n \r\n /\r\nP.isPositive = P.isPos = function () {\r\n return this.s > 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n \r\n /\r\nP.isZero = function () {\r\n return !!this.d && this.d[0] === 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n \r\n /\r\nP.lessThan = P.lt = function (y) {\r\n return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n \r\n /\r\nP.lessThanOrEqualTo = P.lte = function (y) {\r\n return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/\r\n Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n If no base is specified, return log[10](arg).\r\n \r\n log[base](arg) = ln(arg) / ln(base)\r\n \r\n The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n \r\n Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n \r\n log[-b](a) = NaN\r\n * log[0](a) = NaN\r\n * log[1](a) = NaN\r\n * log[NaN](a) = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0) = -Infinity\r\n * log[b](-0) = -Infinity\r\n * log[b](-a) = NaN\r\n * log[b](1) = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN) = NaN\r\n \r\n [base] {number\|string\|Decimal} The base of the logarithm.\r\n \r\n /\r\nP.logarithm = P.log = function (base) {\r\n var isBase10, d, denominator, k, inf, num, sd, r,\r\n arg = this,\r\n Ctor = arg.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding,\r\n guard = 5;\r\n\r\n // Default base is 10.\r\n if (base == null) {\r\n base = new Ctor(10);\r\n isBase10 = true;\r\n } else {\r\n base = new Ctor(base);\r\n d = base.d;\r\n\r\n // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n if (base.s < 0 \|\| !d \|\| !d[0] \|\| base.eq(1)) return new Ctor(NaN);\r\n\r\n isBase10 = base.eq(10);\r\n }\r\n\r\n d = arg.d;\r\n\r\n // Is arg negative, non-finite, 0 or 1?\r\n if (arg.s < 0 \|\| !d \|\| !d[0] \|\| arg.eq(1)) {\r\n return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n }\r\n\r\n // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n // integer power of 10.\r\n if (isBase10) {\r\n if (d.length > 1) {\r\n inf = true;\r\n } else {\r\n for (k = d[0]; k % 10 === 0;) k /= 10;\r\n inf = k !== 1;\r\n }\r\n }\r\n\r\n external = false;\r\n sd = pr + guard;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n // The result will have 5 rounding digits.\r\n r = divide(num, denominator, sd, 1);\r\n\r\n // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n // calculate 10 further digits.\r\n //\r\n // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n // further digits, the last 14 are nines, round up and assume the result is exact.\r\n // Also assume the result is exact if the last 14 are zero.\r\n //\r\n // Example of a result that will be incorrectly rounded:\r\n // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n // place is still 2.6.\r\n if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n do {\r\n sd += 10;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n r = divide(num, denominator, sd, 1);\r\n\r\n if (!inf) {\r\n\r\n // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n\r\n break;\r\n }\r\n } while (checkRoundingDigits(r.d, k += 10, rm));\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\nP.max = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'lt');\r\n};\r\n /\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\nP.min = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'gt');\r\n};\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 Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.minus = P.sub = function (y) {\r\n var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d \|\| !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s \|\| !y.s) y = new Ctor(NaN);\r\n\r\n // Return y negated if x is finite and y is ±Infinity.\r\n else if (x.d) y.s = -y.s;\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with different signs.\r\n // Return NaN if both are ±Infinity with the same sign.\r\n else y = new Ctor(y.d \|\| x.s !== y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.plus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] \|\| !yd[0]) {\r\n\r\n // Return y negated if x is zero and y is non-zero.\r\n if (yd[0]) y.s = -y.s;\r\n\r\n // Return x if y is zero and x is non-zero.\r\n else if (xd[0]) y = new Ctor(x);\r\n\r\n // Return zero if both are zero.\r\n // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n e = mathfloor(y.e / LOG_BASE);\r\n xe = mathfloor(x.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n k = xe - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (k) {\r\n xLTy = k < 0;\r\n\r\n if (xLTy) {\r\n d = xd;\r\n k = -k;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = xe;\r\n len = xd.length;\r\n }\r\n\r\n // Numbers with massively different exponents would result in a very high number of\r\n // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n if (k > i) {\r\n k = i;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents.\r\n d.reverse();\r\n for (i = k; i--;) d.push(0);\r\n d.reverse();\r\n\r\n // Base 1e7 exponents equal.\r\n } else {\r\n\r\n // Check digits to determine which is the bigger number.\r\n\r\n i = xd.length;\r\n len = yd.length;\r\n xLTy = i < len;\r\n if (xLTy) len = i;\r\n\r\n for (i = 0; i < len; i++) {\r\n if (xd[i] != yd[i]) {\r\n xLTy = xd[i] < yd[i];\r\n break;\r\n }\r\n }\r\n\r\n k = 0;\r\n }\r\n\r\n if (xLTy) {\r\n d = xd;\r\n xd = yd;\r\n yd = d;\r\n y.s = -y.s;\r\n }\r\n\r\n len = xd.length;\r\n\r\n // Append zeros to `xd` if shorter.\r\n // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n // Subtract yd from xd.\r\n for (i = yd.length; i > k;) {\r\n\r\n if (xd[--i] < yd[i]) {\r\n for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n --xd[j];\r\n xd[i] += BASE;\r\n }\r\n\r\n xd[i] -= yd[i];\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] === 0;) xd.pop();\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n // Zero?\r\n if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\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 Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n The result depends on the modulo mode.\r\n \r\n /\r\nP.modulo = P.mod = function (y) {\r\n var q,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n if (!x.d \|\| !y.s \|\| y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n // Return x if y is ±Infinity or x is ±0.\r\n if (!y.d \|\| x.d && !x.d[0]) {\r\n return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n }\r\n\r\n // Prevent rounding of intermediate calculations.\r\n external = false;\r\n\r\n if (Ctor.modulo == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // result = x - q * y where 0 <= result < abs(y)\r\n q = divide(x, y.abs(), 0, 3, 1);\r\n q.s = y.s;\r\n } else {\r\n q = divide(x, y, 0, Ctor.modulo, 1);\r\n }\r\n\r\n q = q.times(y);\r\n\r\n external = true;\r\n\r\n return x.minus(q);\r\n};\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.naturalExponential = P.exp = function () {\r\n return naturalExponential(this);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.naturalLogarithm = P.ln = function () {\r\n return naturalLogarithm(this);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n \r\n /\r\nP.negated = P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s;\r\n return finalise(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 Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.plus = P.add = function (y) {\r\n var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d \|\| !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s \|\| !y.s) y = new Ctor(NaN);\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with the same sign.\r\n // Return NaN if both are ±Infinity with different signs.\r\n // Return y if x is finite and y is ±Infinity.\r\n else if (!x.d) y = new Ctor(y.d \|\| x.s === y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.minus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] \|\| !yd[0]) {\r\n\r\n // Return x if y is zero.\r\n // Return y if y is non-zero.\r\n if (!yd[0]) y = new Ctor(x);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n k = mathfloor(x.e / LOG_BASE);\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n i = k - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (i) {\r\n\r\n if (i < 0) {\r\n d = xd;\r\n i = -i;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = k;\r\n len = xd.length;\r\n }\r\n\r\n // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n k = Math.ceil(pr / LOG_BASE);\r\n len = k > len ? k + 1 : len + 1;\r\n\r\n if (i > len) {\r\n i = len;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n d.reverse();\r\n for (; i--;) d.push(0);\r\n d.reverse();\r\n }\r\n\r\n len = xd.length;\r\n i = yd.length;\r\n\r\n // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n if (len - i < 0) {\r\n i = len;\r\n d = yd;\r\n yd = xd;\r\n xd = d;\r\n }\r\n\r\n // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n for (carry = 0; i;) {\r\n carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE \| 0;\r\n xd[i] %= BASE;\r\n }\r\n\r\n if (carry) {\r\n xd.unshift(carry);\r\n ++e;\r\n }\r\n\r\n // Remove trailing zeros.\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/\r\n Return the number of significant digits of the value of this Decimal.\r\n \r\n [z] {boolean\|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n \r\n /\r\nP.precision = P.sd = function (z) {\r\n var k,\r\n x = this;\r\n\r\n if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n if (x.d) {\r\n k = getPrecision(x.d);\r\n if (z && x.e + 1 > k) k = x.e + 1;\r\n } else {\r\n k = NaN;\r\n }\r\n\r\n return k;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n \r\n /\r\nP.round = function () {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n sin(x) = x - x^3/3! + x^5/5! - ...\r\n \r\n sin(0) = 0\r\n * sin(-0) = -0\r\n * sin(Infinity) = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN) = NaN\r\n \r\n /\r\nP.sine = P.sin = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\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 /\r\nP.squareRoot = P.sqrt = function () {\r\n var m, n, sd, r, rep, t,\r\n x = this,\r\n d = x.d,\r\n e = x.e,\r\n s = x.s,\r\n Ctor = x.constructor;\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 \|\| !d \|\| !d[0]) {\r\n return new Ctor(!s \|\| s < 0 && (!d \|\| d[0]) ? NaN : d ? x : 1 / 0);\r\n }\r\n\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+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 = digitsToString(d);\r\n\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(n);\r\n e = mathfloor((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 Ctor(n);\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Newton-Raphson iteration.\r\n for (;;) {\r\n t = r;\r\n r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n // 4999, i.e. approaching a rounding boundary, continue the 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 exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 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 sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // 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 finalise(r, e + 1, 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 external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n tan(0) = 0\r\n * tan(-0) = -0\r\n * tan(Infinity) = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN) = NaN\r\n \r\n /\r\nP.tangent = P.tan = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n x = x.sin();\r\n x.s = 1;\r\n x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 \|\| quadrant == 4 ? x.neg() : x, pr, rm, true);\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 Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n /\r\nP.times = P.mul = function (y) {\r\n var carry, e, i, k, r, rL, t, xdL, ydL,\r\n x = this,\r\n Ctor = x.constructor,\r\n xd = x.d,\r\n yd = (y = new Ctor(y)).d;\r\n\r\n y.s = x.s;\r\n\r\n // If either is NaN, ±Infinity or ±0...\r\n if (!xd \|\| !xd[0] \|\| !yd \|\| !yd[0]) {\r\n\r\n return new Ctor(!y.s \|\| xd && !xd[0] && !yd \|\| yd && !yd[0] && !xd\r\n\r\n // Return NaN if either is NaN.\r\n // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n ? NaN\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n // Return ±0 if either is ±0.\r\n : !xd \|\| !yd ? y.s / 0 : y.s 0);\r\n }\r\n\r\n e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Ensure xd points to the longer array.\r\n if (xdL < ydL) {\r\n r = xd;\r\n xd = yd;\r\n yd = r;\r\n rL = xdL;\r\n xdL = ydL;\r\n ydL = rL;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n r = [];\r\n rL = xdL + ydL;\r\n for (i = rL; i--;) r.push(0);\r\n\r\n // Multiply!\r\n for (i = ydL; --i >= 0;) {\r\n carry = 0;\r\n for (k = xdL + i; k > i;) {\r\n t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n r[k--] = t % BASE \| 0;\r\n carry = t / BASE \| 0;\r\n }\r\n\r\n r[k] = (r[k] + carry) % BASE \| 0;\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; !r[--rL];) r.pop();\r\n\r\n if (carry) ++e;\r\n else r.shift();\r\n\r\n y.d = r;\r\n y.e = getBase10Exponent(r, e);\r\n\r\n return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toBinary = function (sd, rm) {\r\n return toStringBinary(this, 2, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n \r\n If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n if (dp === void 0) return x;\r\n\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n return finalise(x, dp + x.e + 1, rm);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toExponential = function (dp, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x, true);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), dp + 1, rm);\r\n str = finiteToString(x, true, dp + 1);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n \r\n As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n \r\n /\r\nP.toFixed = function (dp, rm) {\r\n var str, y,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n str = finiteToString(y, false, dp + y.e + 1);\r\n }\r\n\r\n // To determine whether to add the minus sign look at the value before it was rounded,\r\n // i.e. look at `x` rather than `y`.\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n \r\n The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n \r\n [maxD] {number\|string\|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n \r\n /\r\nP.toFraction = function (maxD) {\r\n var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n x = this,\r\n xd = x.d,\r\n Ctor = x.constructor;\r\n\r\n if (!xd) return new Ctor(x);\r\n\r\n n1 = d0 = new Ctor(1);\r\n d1 = n0 = new Ctor(0);\r\n\r\n d = new Ctor(d1);\r\n e = d.e = getPrecision(xd) - x.e - 1;\r\n k = e % LOG_BASE;\r\n d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n if (maxD == null) {\r\n\r\n // d is 10*e, the minimum max-denominator needed.\r\n maxD = e > 0 ? d : n1;\r\n } else {\r\n n = new Ctor(maxD);\r\n if (!n.isInt() \|\| n.lt(n1)) throw Error(invalidArgument + n);\r\n maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n }\r\n\r\n external = false;\r\n n = new Ctor(digitsToString(xd));\r\n pr = Ctor.precision;\r\n Ctor.precision = e = xd.length LOG_BASE * 2;\r\n\r\n for (;;) {\r\n q = divide(n, d, 0, 1, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.cmp(maxD) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n d2 = n1;\r\n n1 = n0.plus(q.times(d2));\r\n n0 = d2;\r\n d2 = d;\r\n d = n.minus(q.times(d2));\r\n n = d2;\r\n }\r\n\r\n d2 = divide(maxD.minus(d0), d1, 0, 1, 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\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n ? [n1, d1] : [n0, d0];\r\n\r\n Ctor.precision = pr;\r\n external = true;\r\n\r\n return r;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toHexadecimal = P.toHex = function (sd, rm) {\r\n return toStringBinary(this, 16, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n \r\n The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n \r\n The return value is not affected by the value of `precision`.\r\n \r\n y {number\|string\|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n \r\n /\r\nP.toNearest = function (y, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n\r\n if (y == null) {\r\n\r\n // If x is not finite, return x.\r\n if (!x.d) return x;\r\n\r\n y = new Ctor(1);\r\n rm = Ctor.rounding;\r\n } else {\r\n y = new Ctor(y);\r\n if (rm === void 0) {\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(rm, 0, 8);\r\n }\r\n\r\n // If x is not finite, return x if y is not NaN, else NaN.\r\n if (!x.d) return y.s ? x : y;\r\n\r\n // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n if (!y.d) {\r\n if (y.s) y.s = x.s;\r\n return y;\r\n }\r\n }\r\n\r\n // If y is not zero, calculate the nearest multiple of y to x.\r\n if (y.d[0]) {\r\n external = false;\r\n x = divide(x, y, 0, rm, 1).times(y);\r\n external = true;\r\n finalise(x);\r\n\r\n // If y is zero, return zero with the sign of x.\r\n } else {\r\n y.s = x.s;\r\n x = y;\r\n }\r\n\r\n return x;\r\n};\r\n\r\n\r\n/\r\n Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n \r\n /\r\nP.toNumber = function () {\r\n return +this;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toOctal = function (sd, rm) {\r\n return toStringBinary(this, 8, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n \r\n ECMAScript compliant.\r\n \r\n pow(x, NaN) = NaN\r\n * pow(x, ±0) = 1\r\n\r\n * pow(NaN, non-zero) = NaN\r\n * pow(abs(x) > 1, +Infinity) = +Infinity\r\n * pow(abs(x) > 1, -Infinity) = +0\r\n * pow(abs(x) == 1, ±Infinity) = NaN\r\n * pow(abs(x) < 1, +Infinity) = +0\r\n * pow(abs(x) < 1, -Infinity) = +Infinity\r\n * pow(+Infinity, y > 0) = +Infinity\r\n * pow(+Infinity, y < 0) = +0\r\n * pow(-Infinity, odd integer > 0) = -Infinity\r\n * pow(-Infinity, even integer > 0) = +Infinity\r\n * pow(-Infinity, odd integer < 0) = -0\r\n * pow(-Infinity, even integer < 0) = +0\r\n * pow(+0, y > 0) = +0\r\n * pow(+0, y < 0) = +Infinity\r\n * pow(-0, odd integer > 0) = -0\r\n * pow(-0, even integer > 0) = +0\r\n * pow(-0, odd integer < 0) = -Infinity\r\n * pow(-0, even integer < 0) = +Infinity\r\n * pow(finite x < 0, finite non-integer) = NaN\r\n \r\n For non-integer or very large exponents pow(x, y) is calculated using\r\n \r\n x^y = exp(yln(x))\r\n \r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} \| [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n \r\n If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n \r\n y {number\|string\|Decimal} The power to which to raise this Decimal.\r\n \r\n /\r\nP.toPower = P.pow = function (y) {\r\n var e, k, pr, r, rm, s,\r\n x = this,\r\n Ctor = x.constructor,\r\n yn = +(y = new Ctor(y));\r\n\r\n // Either ±Infinity, NaN or ±0?\r\n if (!x.d \|\| !y.d \|\| !x.d[0] \|\| !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n x = new Ctor(x);\r\n\r\n if (x.eq(1)) return x;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n // y exponent\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n r = intPow(Ctor, x, k, pr);\r\n return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n }\r\n\r\n s = x.s;\r\n\r\n // if x is negative\r\n if (s < 0) {\r\n\r\n // if y is not an integer\r\n if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n // Result is positive if x is negative and the last digit of integer y is even.\r\n if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n // if x.eq(-1)\r\n if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n x.s = s;\r\n return x;\r\n }\r\n }\r\n\r\n // Estimate result exponent.\r\n // x^y = 10^e, where e = y * log10(x)\r\n // log10(x) = log10(x_significand) + x_exponent\r\n // log10(x_significand) = ln(x_significand) / ln(10)\r\n k = mathpow(+x, yn);\r\n e = k == 0 \|\| !isFinite(k)\r\n ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n : new Ctor(k + '').e;\r\n\r\n // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n // Overflow/underflow?\r\n if (e > Ctor.maxE + 1 \|\| e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n external = false;\r\n Ctor.rounding = x.s = 1;\r\n\r\n // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n // new Decimal(2.32456).pow('2087987436534566.46411')\r\n // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n k = Math.min(12, (e + '').length);\r\n\r\n // r = x^y = exp(yln(x))\r\n r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n if (r.d) {\r\n\r\n // Truncate to the required precision plus five rounding digits.\r\n r = finalise(r, pr + 5, 1);\r\n\r\n // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n // the result.\r\n if (checkRoundingDigits(r.d, pr, rm)) {\r\n e = pr + 10;\r\n\r\n // Truncate to the increased precision plus five rounding digits.\r\n r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n }\r\n }\r\n\r\n r.s = s;\r\n external = true;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toPrecision = function (sd, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), sd, rm);\r\n str = finiteToString(x, sd <= x.e \|\| x.e <= Ctor.toExpNeg, sd);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n \r\n /\r\nP.toSignificantDigits = P.toSD = function (sd, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n }\r\n\r\n return finalise(new Ctor(x), sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal.\r\n \r\n Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n \r\n /\r\nP.toString = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n \r\n /\r\nP.truncated = P.trunc = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 1);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n \r\n /\r\nP.valueOf = P.toJSON = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() ? '-' + str : str;\r\n};\r\n\r\n\r\n// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n/\r\n digitsToString P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n * finiteToString, naturalExponential, naturalLogarithm\r\n * checkInt32 P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n * P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n * checkRoundingDigits P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n * convertBase toStringBinary, parseOther\r\n * cos P.cos\r\n * divide P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n * P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n * P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n * taylorSeries, atan2, parseOther\r\n * finalise P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n * P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n * P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n * P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n * P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n * P.truncated, divide, getLn10, getPi, naturalExponential,\r\n * naturalLogarithm, ceil, floor, round, trunc\r\n * finiteToString P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n * toStringBinary\r\n * getBase10Exponent P.minus, P.plus, P.times, parseOther\r\n * getLn10 P.logarithm, naturalLogarithm\r\n * getPi P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n * getPrecision P.precision, P.toFraction\r\n * getZeroString digitsToString, finiteToString\r\n * intPow P.toPower, parseOther\r\n * isOdd toLessThanHalfPi\r\n * maxOrMin max, min\r\n * naturalExponential P.naturalExponential, P.toPower\r\n * naturalLogarithm P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n * P.toPower, naturalExponential\r\n * nonFiniteToString finiteToString, toStringBinary\r\n * parseDecimal Decimal\r\n * parseOther Decimal\r\n * sin P.sin\r\n * taylorSeries P.cosh, P.sinh, cos, sin\r\n * toLessThanHalfPi P.cos, P.sin\r\n * toStringBinary P.toBinary, P.toHexadecimal, P.toOctal\r\n * truncate intPow\r\n \r\n Throws: P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n * naturalLogarithm, config, parseOther, random, Decimal\r\n /\r\n\r\n\r\nfunction digitsToString(d) {\r\n var i, k, ws,\r\n indexOfLastWord = d.length - 1,\r\n str = '',\r\n w = d[0];\r\n\r\n if (indexOfLastWord > 0) {\r\n str += w;\r\n for (i = 1; i < indexOfLastWord; i++) {\r\n ws = d[i] + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n str += ws;\r\n }\r\n\r\n w = d[i];\r\n ws = w + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n } else if (w === 0) {\r\n return '0';\r\n }\r\n\r\n // Remove trailing zeros of last w.\r\n for (; w % 10 === 0;) w /= 10;\r\n\r\n return str + w;\r\n}\r\n\r\n\r\nfunction checkInt32(i, min, max) {\r\n if (i !== ~~i \|\| i < min \|\| i > max) {\r\n throw Error(invalidArgument + i);\r\n }\r\n}\r\n\r\n\r\n/\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n /\r\nfunction checkRoundingDigits(d, i, rm, repeating) {\r\n var di, k, r, rd;\r\n\r\n // Get the length of the first word of the array d.\r\n for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n // Is the rounding digit in the first word of d?\r\n if (--i < 0) {\r\n i += LOG_BASE;\r\n di = 0;\r\n } else {\r\n di = Math.ceil((i + 1) / LOG_BASE);\r\n i %= LOG_BASE;\r\n }\r\n\r\n // i is the index (0 - 6) of the rounding digit.\r\n // E.g. if within the word 3487563 the first rounding digit is 5,\r\n // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n k = mathpow(10, LOG_BASE - i);\r\n rd = d[di] % k \| 0;\r\n\r\n if (repeating == null) {\r\n if (i < 3) {\r\n if (i == 0) rd = rd / 100 \| 0;\r\n else if (i == 1) rd = rd / 10 \| 0;\r\n r = rm < 4 && rd == 99999 \|\| rm > 3 && rd == 49999 \|\| rd == 50000 \|\| rd == 0;\r\n } else {\r\n r = (rm < 4 && rd + 1 == k \|\| rm > 3 && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 100 \| 0) == mathpow(10, i - 2) - 1 \|\|\r\n (rd == k / 2 \|\| rd == 0) && (d[di + 1] / k / 100 \| 0) == 0;\r\n }\r\n } else {\r\n if (i < 4) {\r\n if (i == 0) rd = rd / 1000 \| 0;\r\n else if (i == 1) rd = rd / 100 \| 0;\r\n else if (i == 2) rd = rd / 10 \| 0;\r\n r = (repeating \|\| rm < 4) && rd == 9999 \|\| !repeating && rm > 3 && rd == 4999;\r\n } else {\r\n r = ((repeating \|\| rm < 4) && rd + 1 == k \|\|\r\n (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 1000 \| 0) == mathpow(10, i - 3) - 1;\r\n }\r\n }\r\n\r\n return r;\r\n}\r\n\r\n\r\n// Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n// Eg. convertBase('255', 10, 16) returns [15, 15].\r\n// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\nfunction convertBase(str, baseIn, baseOut) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n strL = str.length;\r\n\r\n for (; i < strL;) {\r\n for (arrL = arr.length; arrL--;) arr[arrL] = baseIn;\r\n arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n for (j = 0; j < arr.length; j++) {\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] === void 0) 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\r\n/\r\n cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * \|x\| < pi/2\r\n \r\n /\r\nfunction cosine(Ctor, x) {\r\n var k, len, y;\r\n\r\n if (x.isZero()) return x;\r\n\r\n // Argument reduction: cos(4x) = 8(cos^4(x) - cos^2(x)) + 1\r\n // i.e. cos(x) = 8(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n len = x.d.length;\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n y = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n y = '2.3283064365386962890625e-10';\r\n }\r\n\r\n Ctor.precision += k;\r\n\r\n x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n // Reverse argument reduction\r\n for (var i = k; i--;) {\r\n var cos2x = x.times(x);\r\n x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n }\r\n\r\n Ctor.precision -= k;\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n Perform division in the specified base.\r\n /\r\nvar divide = (function () {\r\n\r\n // Assumes non-zero x and k, and hence non-zero result.\r\n function multiplyInteger(x, k, base) {\r\n var temp,\r\n carry = 0,\r\n i = x.length;\r\n\r\n for (x = x.slice(); i--;) {\r\n temp = x[i] k + carry;\r\n x[i] = temp % base \| 0;\r\n carry = temp / base \| 0;\r\n }\r\n\r\n if (carry) x.unshift(carry);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, r;\r\n\r\n if (aL != bL) {\r\n r = aL > bL ? 1 : -1;\r\n } else {\r\n for (i = r = 0; i < aL; i++) {\r\n if (a[i] != b[i]) {\r\n r = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return r;\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.shift();\r\n }\r\n\r\n return function (x, y, pr, rm, dp, base) {\r\n var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n yL, yz,\r\n Ctor = x.constructor,\r\n sign = x.s == y.s ? 1 : -1,\r\n xd = x.d,\r\n yd = y.d;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xd \|\| !xd[0] \|\| !yd \|\| !yd[0]) {\r\n\r\n return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n !x.s \|\| !y.s \|\| (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n xd && xd[0] == 0 \|\| !yd ? sign * 0 : sign / 0);\r\n }\r\n\r\n if (base) {\r\n logBase = 1;\r\n e = x.e - y.e;\r\n } else {\r\n base = BASE;\r\n logBase = LOG_BASE;\r\n e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n }\r\n\r\n yL = yd.length;\r\n xL = xd.length;\r\n q = new Ctor(sign);\r\n qd = q.d = [];\r\n\r\n // Result exponent may be one less than e.\r\n // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n for (i = 0; yd[i] == (xd[i] \|\| 0); i++);\r\n\r\n if (yd[i] > (xd[i] \|\| 0)) e--;\r\n\r\n if (pr == null) {\r\n sd = pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else if (dp) {\r\n sd = pr + (x.e - y.e) + 1;\r\n } else {\r\n sd = pr;\r\n }\r\n\r\n if (sd < 0) {\r\n qd.push(1);\r\n more = true;\r\n } else {\r\n\r\n // Convert precision in number of base 10 digits to base 1e7 digits.\r\n sd = sd / logBase + 2 \| 0;\r\n i = 0;\r\n\r\n // divisor < 1e7\r\n if (yL == 1) {\r\n k = 0;\r\n yd = yd[0];\r\n sd++;\r\n\r\n // k is the carry.\r\n for (; (i < xL \|\| k) && sd--; i++) {\r\n t = k * base + (xd[i] \|\| 0);\r\n qd[i] = t / yd \| 0;\r\n k = t % yd \| 0;\r\n }\r\n\r\n more = k \|\| i < xL;\r\n\r\n // divisor >= 1e7\r\n } else {\r\n\r\n // Normalise xd and yd so highest order digit of yd is >= base/2\r\n k = base / (yd[0] + 1) \| 0;\r\n\r\n if (k > 1) {\r\n yd = multiplyInteger(yd, k, base);\r\n xd = multiplyInteger(xd, k, base);\r\n yL = yd.length;\r\n xL = xd.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xd.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\r\n yz = yd.slice();\r\n yz.unshift(0);\r\n yd0 = yd[0];\r\n\r\n if (yd[1] >= base / 2) ++yd0;\r\n\r\n do {\r\n k = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, k.\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] \|\| 0);\r\n\r\n // k will be how many times the divisor goes into the current remainder.\r\n k = rem0 / yd0 \| 0;\r\n\r\n // Algorithm:\r\n // 1. product = divisor * trial digit (k)\r\n // 2. if product > remainder: product -= divisor, k--\r\n // 3. remainder -= product\r\n // 4. if product was < remainder at 2:\r\n // 5. compare new remainder and divisor\r\n // 6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n if (k > 1) {\r\n if (k >= base) k = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiplyInteger(yd, k, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n cmp = compare(prod, rem, prodL, remL);\r\n\r\n // product > remainder.\r\n if (cmp == 1) {\r\n k--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n }\r\n } else {\r\n\r\n // cmp is -1.\r\n // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n if (k == 0) cmp = k = 1;\r\n prod = yd.slice();\r\n }\r\n\r\n prodL = prod.length;\r\n if (prodL < remL) prod.unshift(0);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n\r\n // If product was < previous remainder.\r\n if (cmp == -1) {\r\n remL = rem.length;\r\n\r\n // Compare divisor and new remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n if (cmp < 1) {\r\n k++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yd, remL, base);\r\n }\r\n }\r\n\r\n remL = rem.length;\r\n } else if (cmp === 0) {\r\n k++;\r\n rem = [0];\r\n } // if cmp === 1, k will be 0\r\n\r\n // Add the next digit, k, to the result array.\r\n qd[i++] = k;\r\n\r\n // Update the remainder.\r\n if (cmp && rem[0]) {\r\n rem[remL++] = xd[xi] \|\| 0;\r\n } else {\r\n rem = [xd[xi]];\r\n remL = 1;\r\n }\r\n\r\n } while ((xi++ < xL \|\| rem[0] !== void 0) && sd--);\r\n\r\n more = rem[0] !== void 0;\r\n }\r\n\r\n // Leading zero?\r\n if (!qd[0]) qd.shift();\r\n }\r\n\r\n // logBase is 1 when divide is being used for base conversion.\r\n if (logBase == 1) {\r\n q.e = e;\r\n inexact = more;\r\n } else {\r\n\r\n // To calculate q.e, first get the number of digits of qd[0].\r\n for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n q.e = i + e * logBase - 1;\r\n\r\n finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n }\r\n\r\n return q;\r\n };\r\n})();\r\n\r\n\r\n/\r\n Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n /\r\n function finalise(x, sd, rm, isTruncated) {\r\n var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n Ctor = x.constructor;\r\n\r\n // Don't round if sd is null or undefined.\r\n out: if (sd != null) {\r\n xd = x.d;\r\n\r\n // Infinity/NaN.\r\n if (!xd) return x;\r\n\r\n // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // w: the word of xd containing rd, a base 1e7 number.\r\n // xdi: the index of w within xd.\r\n // digits: the number of digits of w.\r\n // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n // they had leading zeros)\r\n // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n // Get the length of the first word of the digits array xd.\r\n for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n i = sd - digits;\r\n\r\n // Is the rounding digit in the first word of xd?\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n w = xd[xdi = 0];\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = w / mathpow(10, digits - j - 1) % 10 \| 0;\r\n } else {\r\n xdi = Math.ceil((i + 1) / LOG_BASE);\r\n k = xd.length;\r\n if (xdi >= k) {\r\n if (isTruncated) {\r\n\r\n // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n for (; k++ <= xdi;) xd.push(0);\r\n w = rd = 0;\r\n digits = 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 w = k = xd[xdi];\r\n\r\n // Get the number of digits of w.\r\n for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n // Get the index of rd within w.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within w, adjusted for leading zeros.\r\n // The number of leading zeros of w is given by LOG_BASE - digits.\r\n j = i - LOG_BASE + digits;\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 \| 0;\r\n }\r\n }\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n isTruncated = isTruncated \|\| sd < 0 \|\|\r\n xd[xdi + 1] !== void 0 \|\| (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n // will give 714.\r\n\r\n roundUp = rm < 4\r\n ? (rd \|\| isTruncated) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 \|\| rd == 5 && (rm == 4 \|\| isTruncated \|\| 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 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 \|\| !xd[0]) {\r\n xd.length = 0;\r\n if (roundUp) {\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 xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n x.e = -sd \|\| 0;\r\n } else {\r\n\r\n // Zero.\r\n xd[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 xd.length = xdi;\r\n k = 1;\r\n xdi--;\r\n } else {\r\n xd.length = xdi + 1;\r\n k = mathpow(10, 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 w.\r\n xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) \| 0) k : 0;\r\n }\r\n\r\n if (roundUp) {\r\n for (;;) {\r\n\r\n // Is the digit to be rounded up in the first word of xd?\r\n if (xdi == 0) {\r\n\r\n // i will be the length of xd[0] before k is added.\r\n for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n j = xd[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 (xd[0] == BASE) xd[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xd[xdi] += k;\r\n if (xd[xdi] != BASE) break;\r\n xd[xdi--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n }\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > Ctor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < Ctor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // Ctor.underflow = true;\r\n } // else Ctor.underflow = false;\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\nfunction finiteToString(x, isExp, sd) {\r\n if (!x.isFinite()) return nonFiniteToString(x);\r\n var k,\r\n e = x.e,\r\n str = digitsToString(x.d),\r\n len = str.length;\r\n\r\n if (isExp) {\r\n if (sd && (k = sd - len) > 0) {\r\n str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n } else if (len > 1) {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n\r\n str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n } else if (e < 0) {\r\n str = '0.' + getZeroString(-e - 1) + str;\r\n if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n } else if (e >= len) {\r\n str += getZeroString(e + 1 - len);\r\n if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n } else {\r\n if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n if (sd && (k = sd - len) > 0) {\r\n if (e + 1 === len) str += '.';\r\n str += getZeroString(k);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// Calculate the base 10 exponent from the base 1e7 exponent.\r\nfunction getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e = LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n}\r\n\r\n\r\nfunction getLn10(Ctor, sd, pr) {\r\n if (sd > LN10_PRECISION) {\r\n\r\n // Reset global state in case the exception is caught.\r\n external = true;\r\n if (pr) Ctor.precision = pr;\r\n throw Error(precisionLimitExceeded);\r\n }\r\n return finalise(new Ctor(LN10), sd, 1, true);\r\n}\r\n\r\n\r\nfunction getPi(Ctor, sd, rm) {\r\n if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n return finalise(new Ctor(PI), sd, rm, true);\r\n}\r\n\r\n\r\nfunction getPrecision(digits) {\r\n var w = digits.length - 1,\r\n len = w LOG_BASE + 1;\r\n\r\n w = digits[w];\r\n\r\n // If non-zero...\r\n if (w) {\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n for (; w % 10 == 0; w /= 10) len--;\r\n\r\n // Add the number of digits of the first word.\r\n for (w = digits[0]; w >= 10; w /= 10) len++;\r\n }\r\n\r\n return len;\r\n}\r\n\r\n\r\nfunction getZeroString(k) {\r\n var zs = '';\r\n for (; k--;) zs += '0';\r\n return zs;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n \r\n Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n \r\n /\r\nfunction intPow(Ctor, x, n, pr) {\r\n var isTruncated,\r\n r = new Ctor(1),\r\n\r\n // Max n of 9007199254740991 takes 53 loop iterations.\r\n // Maximum digits array length; leaves [28, 34] guard digits.\r\n k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n external = false;\r\n\r\n for (;;) {\r\n if (n % 2) {\r\n r = r.times(x);\r\n if (truncate(r.d, k)) isTruncated = true;\r\n }\r\n\r\n n = mathfloor(n / 2);\r\n if (n === 0) {\r\n\r\n // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n n = r.d.length - 1;\r\n if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n break;\r\n }\r\n\r\n x = x.times(x);\r\n truncate(x.d, k);\r\n }\r\n\r\n external = true;\r\n\r\n return r;\r\n}\r\n\r\n\r\nfunction isOdd(n) {\r\n return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/\r\n Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n /\r\nfunction maxOrMin(Ctor, args, ltgt) {\r\n var y,\r\n x = new Ctor(args[0]),\r\n i = 0;\r\n\r\n for (; ++i < args.length;) {\r\n y = new Ctor(args[i]);\r\n if (!y.s) {\r\n x = y;\r\n break;\r\n } else if (x[ltgt](y)) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n \r\n Taylor/Maclaurin series.\r\n \r\n exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n \r\n Argument reduction:\r\n * Repeat x = x / 32, k += 5, until \|x\| < 0.1\r\n * exp(x) = exp(x / 2^k)^(2^k)\r\n \r\n Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until \|x\| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n \r\n Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n \r\n exp(Infinity) = Infinity\r\n * exp(-Infinity) = 0\r\n * exp(NaN) = NaN\r\n * exp(±0) = 1\r\n \r\n exp(x) is non-terminating for any finite, non-zero x.\r\n \r\n The result will always be correctly rounded.\r\n \r\n /\r\nfunction naturalExponential(x, sd) {\r\n var denominator, guard, j, pow, sum, t, wpr,\r\n rep = 0,\r\n i = 0,\r\n k = 0,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // 0/NaN/Infinity?\r\n if (!x.d \|\| !x.d[0] \|\| x.e > 17) {\r\n\r\n return new Ctor(x.d\r\n ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n t = new Ctor(0.03125);\r\n\r\n // while abs(x) >= 0.1\r\n while (x.e > -2) {\r\n\r\n // x = x / 2^5\r\n x = x.times(t);\r\n k += 5;\r\n }\r\n\r\n // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n // necessary to ensure the first 4 rounding digits are correct.\r\n guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 \| 0;\r\n wpr += guard;\r\n denominator = pow = sum = new Ctor(1);\r\n Ctor.precision = wpr;\r\n\r\n for (;;) {\r\n pow = finalise(pow.times(x), wpr, 1);\r\n denominator = denominator.times(++i);\r\n t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n j = k;\r\n while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n // Check to see if the first 4 rounding digits are [49]999.\r\n // If so, repeat the summation with a higher precision, otherwise\r\n // e.g. with precision: 18, rounding: 1\r\n // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n\r\n if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += 10;\r\n denominator = pow = t = new Ctor(1);\r\n i = 0;\r\n rep++;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n }\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n \r\n ln(-n) = NaN\r\n * ln(0) = -Infinity\r\n * ln(-0) = -Infinity\r\n * ln(1) = 0\r\n * ln(Infinity) = Infinity\r\n * ln(-Infinity) = NaN\r\n * ln(NaN) = NaN\r\n \r\n ln(n) (n != 1) is non-terminating.\r\n \r\n /\r\nfunction naturalLogarithm(y, sd) {\r\n var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n n = 1,\r\n guard = 10,\r\n x = y,\r\n xd = x.d,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // Is x negative or Infinity, NaN, 0 or 1?\r\n if (x.s < 0 \|\| !xd \|\| !xd[0] \|\| !x.e && xd[0] == 1 && xd.length == 1) {\r\n return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n Ctor.precision = wpr += guard;\r\n c = digitsToString(xd);\r\n c0 = c.charAt(0);\r\n\r\n if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n // Argument reduction.\r\n // The series converges faster the closer the argument is to 1, so using\r\n // ln(a^b) = b * ln(a), ln(a) = ln(a^b) / b\r\n // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n // later be divided by this number, then separate out the power of 10 using\r\n // ln(a10^b) = ln(a) + bln(10).\r\n\r\n // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n //while (c0 < 9 && c0 != 1 \|\| c0 == 1 && c.charAt(1) > 1) {\r\n // max n is 6 (gives 0.7 - 1.3)\r\n while (c0 < 7 && c0 != 1 \|\| c0 == 1 && c.charAt(1) > 3) {\r\n x = x.times(y);\r\n c = digitsToString(x.d);\r\n c0 = c.charAt(0);\r\n n++;\r\n }\r\n\r\n e = x.e;\r\n\r\n if (c0 > 1) {\r\n x = new Ctor('0.' + c);\r\n e++;\r\n } else {\r\n x = new Ctor(c0 + '.' + c.slice(1));\r\n }\r\n } else {\r\n\r\n // The argument reduction method above may result in overflow if the argument y is a massive\r\n // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n // function using ln(x10^e) = ln(x) + eln(10).\r\n t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n Ctor.precision = pr;\r\n\r\n return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n }\r\n\r\n // x1 is x reduced to a value near 1.\r\n x1 = x;\r\n\r\n // Taylor series.\r\n // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n // where x = (y - 1)/(y + 1) (\|x\| < 1)\r\n sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = 3;\r\n\r\n for (;;) {\r\n numerator = finalise(numerator.times(x2), wpr, 1);\r\n t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n sum = sum.times(2);\r\n\r\n // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n // been repeated previously) and the first 4 rounding digits 9999?\r\n // If so, restart the summation with a higher precision, otherwise\r\n // e.g. with precision: 12, rounding: 1\r\n // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += guard;\r\n t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = rep = 1;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n denominator += 2;\r\n }\r\n}\r\n\r\n\r\n// ±Infinity, NaN.\r\nfunction nonFiniteToString(x) {\r\n // Unsigned.\r\n return String(x.s * x.s / 0);\r\n}\r\n\r\n\r\n/\r\n Parse the value of a new Decimal `x` from string `str`.\r\n /\r\nfunction parseDecimal(x, str) {\r\n var e, i, len;\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 // 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 - 1) === 48; --len);\r\n str = str.slice(i, len);\r\n\r\n if (str) {\r\n len -= i;\r\n x.e = e = e - i - 1;\r\n x.d = [];\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 word of the digits array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE;\r\n\r\n if (i < len) {\r\n if (i) x.d.push(+str.slice(0, i));\r\n for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n str = str.slice(i);\r\n i = LOG_BASE - str.length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--;) str += '0';\r\n x.d.push(+str);\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > x.constructor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < x.constructor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // x.constructor.underflow = true;\r\n } // else x.constructor.underflow = false;\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n /\r\nfunction parseOther(x, str) {\r\n var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n if (str.indexOf('_') > -1) {\r\n str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n if (isDecimal.test(str)) return parseDecimal(x, str);\r\n } else if (str === 'Infinity' \|\| str === 'NaN') {\r\n if (!+str) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return x;\r\n }\r\n\r\n if (isHex.test(str)) {\r\n base = 16;\r\n str = str.toLowerCase();\r\n } else if (isBinary.test(str)) {\r\n base = 2;\r\n } else if (isOctal.test(str)) {\r\n base = 8;\r\n } else {\r\n throw Error(invalidArgument + str);\r\n }\r\n\r\n // Is there a binary exponent part?\r\n i = str.search(/p/i);\r\n\r\n if (i > 0) {\r\n p = +str.slice(i + 1);\r\n str = str.substring(2, i);\r\n } else {\r\n str = str.slice(2);\r\n }\r\n\r\n // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n // fraction part will be restored.\r\n i = str.indexOf('.');\r\n isFloat = i >= 0;\r\n Ctor = x.constructor;\r\n\r\n if (isFloat) {\r\n str = str.replace('.', '');\r\n len = str.length;\r\n i = len - i;\r\n\r\n // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n divisor = intPow(Ctor, new Ctor(base), i, i 2);\r\n }\r\n\r\n xd = convertBase(str, base, BASE);\r\n xe = xd.length - 1;\r\n\r\n // Remove trailing zeros.\r\n for (i = xe; xd[i] === 0; --i) xd.pop();\r\n if (i < 0) return new Ctor(x.s * 0);\r\n x.e = getBase10Exponent(xd, xe);\r\n x.d = xd;\r\n external = false;\r\n\r\n // At what precision to perform the division to ensure exact conversion?\r\n // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n // maxDecimalFractionPartDigitCount = {Hex:4\|Oct:3\|Bin:1} * otherBaseFractionPartDigitCount\r\n // Therefore using 4 * the number of digits of str will always be enough.\r\n if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n // Multiply by the binary exponent part if present.\r\n if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n external = true;\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n sin(x) = x - x^3/3! + x^5/5! - ...\r\n * \|x\| < pi/2\r\n \r\n /\r\nfunction sine(Ctor, x) {\r\n var k,\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n }\r\n\r\n // Argument reduction: sin(5x) = 16sin^5(x) - 20sin^3(x) + 5sin(x)\r\n // i.e. sin(x) = 16sin^5(x/5) - 20sin^3(x/5) + 5sin(x/5)\r\n // and sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k \| 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x);\r\n\r\n // Reverse argument reduction\r\n var sin2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sin2_x = x.times(x);\r\n x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\nfunction taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n var j, t, u, x2,\r\n i = 1,\r\n pr = Ctor.precision,\r\n k = Math.ceil(pr / LOG_BASE);\r\n\r\n external = false;\r\n x2 = x.times(x);\r\n u = new Ctor(y);\r\n\r\n for (;;) {\r\n t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n t = u.plus(y);\r\n\r\n if (t.d[k] !== void 0) {\r\n for (j = k; t.d[j] === u.d[j] && j--;);\r\n if (j == -1) break;\r\n }\r\n\r\n j = u;\r\n u = y;\r\n y = t;\r\n t = j;\r\n i++;\r\n }\r\n\r\n external = true;\r\n t.d.length = k + 1;\r\n\r\n return t;\r\n}\r\n\r\n\r\n// Exponent e must be positive and non-zero.\r\nfunction tinyPow(b, e) {\r\n var n = b;\r\n while (--e) n = b;\r\n return n;\r\n}\r\n\r\n\r\n// Return the absolute value of `x` reduced to less than or equal to half pi.\r\nfunction toLessThanHalfPi(Ctor, x) {\r\n var t,\r\n isNeg = x.s < 0,\r\n pi = getPi(Ctor, Ctor.precision, 1),\r\n halfPi = pi.times(0.5);\r\n\r\n x = x.abs();\r\n\r\n if (x.lte(halfPi)) {\r\n quadrant = isNeg ? 4 : 1;\r\n return x;\r\n }\r\n\r\n t = x.divToInt(pi);\r\n\r\n if (t.isZero()) {\r\n quadrant = isNeg ? 3 : 2;\r\n } else {\r\n x = x.minus(t.times(pi));\r\n\r\n // 0 <= x < pi\r\n if (x.lte(halfPi)) {\r\n quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n return x;\r\n }\r\n\r\n quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n }\r\n\r\n return x.minus(pi).abs();\r\n}\r\n\r\n\r\n/\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n \r\n If the optional `sd` argument is present include a binary exponent suffix.\r\n /\r\nfunction toStringBinary(x, baseOut, sd, rm) {\r\n var base, e, i, k, len, roundUp, str, xd, y,\r\n Ctor = x.constructor,\r\n isExp = sd !== void 0;\r\n\r\n if (isExp) {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n } else {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n }\r\n\r\n if (!x.isFinite()) {\r\n str = nonFiniteToString(x);\r\n } else {\r\n str = finiteToString(x);\r\n i = str.indexOf('.');\r\n\r\n // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n // maxBinaryExponent = floor((decimalExponent + 1) log[2](10))\r\n // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n if (isExp) {\r\n base = 2;\r\n if (baseOut == 16) {\r\n sd = sd * 4 - 3;\r\n } else if (baseOut == 8) {\r\n sd = sd * 3 - 2;\r\n }\r\n } else {\r\n base = baseOut;\r\n }\r\n\r\n // Convert the number as an integer then divide the result by its base raised to a power such\r\n // that the fraction part will be restored.\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n str = str.replace('.', '');\r\n y = new Ctor(1);\r\n y.e = str.length - i;\r\n y.d = convertBase(finiteToString(y), 10, base);\r\n y.e = y.d.length;\r\n }\r\n\r\n xd = convertBase(str, 10, base);\r\n e = len = xd.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] == 0;) xd.pop();\r\n\r\n if (!xd[0]) {\r\n str = isExp ? '0p+0' : '0';\r\n } else {\r\n if (i < 0) {\r\n e--;\r\n } else {\r\n x = new Ctor(x);\r\n x.d = xd;\r\n x.e = e;\r\n x = divide(x, y, sd, rm, 0, base);\r\n xd = x.d;\r\n e = x.e;\r\n roundUp = inexact;\r\n }\r\n\r\n // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n i = xd[sd];\r\n k = base / 2;\r\n roundUp = roundUp \|\| xd[sd + 1] !== void 0;\r\n\r\n roundUp = rm < 4\r\n ? (i !== void 0 \|\| roundUp) && (rm === 0 \|\| rm === (x.s < 0 ? 3 : 2))\r\n : i > k \|\| i === k && (rm === 4 \|\| roundUp \|\| rm === 6 && xd[sd - 1] & 1 \|\|\r\n rm === (x.s < 0 ? 8 : 7));\r\n\r\n xd.length = sd;\r\n\r\n if (roundUp) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (; ++xd[--sd] > base - 1;) {\r\n xd[sd] = 0;\r\n if (!sd) {\r\n ++e;\r\n xd.unshift(1);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n // Add binary exponent suffix?\r\n if (isExp) {\r\n if (len > 1) {\r\n if (baseOut == 16 \|\| baseOut == 8) {\r\n i = baseOut == 16 ? 4 : 3;\r\n for (--len; len % i; len++) str += '0';\r\n xd = convertBase(str, base, baseOut);\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // xd[0] will always be be 1\r\n for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n } else {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n }\r\n\r\n str = str + (e < 0 ? 'p' : 'p+') + e;\r\n } else if (e < 0) {\r\n for (; ++e;) str = '0' + str;\r\n str = '0.' + str;\r\n } else {\r\n if (++e > len) for (e -= len; e-- ;) str += '0';\r\n else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n }\r\n\r\n return x.s < 0 ? '-' + str : str;\r\n}\r\n\r\n\r\n// Does not strip trailing zeros.\r\nfunction truncate(arr, len) {\r\n if (arr.length > len) {\r\n arr.length = len;\r\n return true;\r\n }\r\n}\r\n\r\n\r\n// Decimal methods\r\n\r\n\r\n/\r\n abs\r\n * acos\r\n * acosh\r\n * add\r\n * asin\r\n * asinh\r\n * atan\r\n * atanh\r\n * atan2\r\n * cbrt\r\n * ceil\r\n * clamp\r\n * clone\r\n * config\r\n * cos\r\n * cosh\r\n * div\r\n * exp\r\n * floor\r\n * hypot\r\n * ln\r\n * log\r\n * log2\r\n * log10\r\n * max\r\n * min\r\n * mod\r\n * mul\r\n * pow\r\n * random\r\n * round\r\n * set\r\n * sign\r\n * sin\r\n * sinh\r\n * sqrt\r\n * sub\r\n * sum\r\n * tan\r\n * tanh\r\n * trunc\r\n /\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction abs(x) {\r\n return new this(x).abs();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arccosine in radians of `x`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction acos(x) {\r\n return new this(x).acos();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction acosh(x) {\r\n return new this(x).acosh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction add(x, y) {\r\n return new this(x).plus(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction asin(x) {\r\n return new this(x).asin();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction asinh(x) {\r\n return new this(x).asinh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction atan(x) {\r\n return new this(x).atan();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction atanh(x) {\r\n return new this(x).atanh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n \r\n y {number\|string\|Decimal} The y-coordinate.\r\n * x {number\|string\|Decimal} The x-coordinate.\r\n \r\n atan2(±0, -0) = ±pi\r\n * atan2(±0, +0) = ±0\r\n * atan2(±0, -x) = ±pi for x > 0\r\n * atan2(±0, x) = ±0 for x > 0\r\n * atan2(-y, ±0) = -pi/2 for y > 0\r\n * atan2(y, ±0) = pi/2 for y > 0\r\n * atan2(±y, -Infinity) = ±pi for finite y > 0\r\n * atan2(±y, +Infinity) = ±0 for finite y > 0\r\n * atan2(±Infinity, x) = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3pi/4\r\n atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n \r\n /\r\nfunction atan2(y, x) {\r\n y = new this(y);\r\n x = new this(x);\r\n var r,\r\n pr = this.precision,\r\n rm = this.rounding,\r\n wpr = pr + 4;\r\n\r\n // Either NaN\r\n if (!y.s \|\| !x.s) {\r\n r = new this(NaN);\r\n\r\n // Both ±Infinity\r\n } else if (!y.d && !x.d) {\r\n r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n r.s = y.s;\r\n\r\n // x is ±Infinity or y is ±0\r\n } else if (!x.d \|\| y.isZero()) {\r\n r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n r.s = y.s;\r\n\r\n // y is ±Infinity or x is ±0\r\n } else if (!y.d \|\| x.isZero()) {\r\n r = getPi(this, wpr, 1).times(0.5);\r\n r.s = y.s;\r\n\r\n // Both non-zero and finite\r\n } else if (x.s < 0) {\r\n this.precision = wpr;\r\n this.rounding = 1;\r\n r = this.atan(divide(y, x, wpr, 1));\r\n x = getPi(this, wpr, 1);\r\n this.precision = pr;\r\n this.rounding = rm;\r\n r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n } else {\r\n r = this.atan(divide(y, x, wpr, 1));\r\n }\r\n\r\n return r;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction cbrt(x) {\r\n return new this(x).cbrt();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction ceil(x) {\r\n return finalise(x = new this(x), x.e + 1, 2);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n \r\n x {number\|string\|Decimal}\r\n * min {number\|string\|Decimal}\r\n * max {number\|string\|Decimal}\r\n \r\n /\r\nfunction clamp(x, min, max) {\r\n return new this(x).clamp(min, max);\r\n}\r\n\r\n\r\n/\r\n Configure global settings for a Decimal constructor.\r\n \r\n `obj` is an object with one or more of the following properties,\r\n \r\n precision {number}\r\n * rounding {number}\r\n * toExpNeg {number}\r\n * toExpPos {number}\r\n * maxE {number}\r\n * minE {number}\r\n * modulo {number}\r\n * crypto {boolean\|number}\r\n * defaults {true}\r\n \r\n E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n \r\n /\r\nfunction config(obj) {\r\n if (!obj \|\| typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n var i, p, v,\r\n useDefaults = obj.defaults === true,\r\n ps = [\r\n 'precision', 1, MAX_DIGITS,\r\n 'rounding', 0, 8,\r\n 'toExpNeg', -EXP_LIMIT, 0,\r\n 'toExpPos', 0, EXP_LIMIT,\r\n 'maxE', 0, EXP_LIMIT,\r\n 'minE', -EXP_LIMIT, 0,\r\n 'modulo', 0, 9\r\n ];\r\n\r\n for (i = 0; i < ps.length; i += 3) {\r\n if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n else throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (v === true \|\| v === false \|\| v === 0 \|\| v === 1) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues \|\| crypto.randomBytes)) {\r\n this[p] = true;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n } else {\r\n this[p] = false;\r\n }\r\n } else {\r\n throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n return this;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction cos(x) {\r\n return new this(x).cos();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction cosh(x) {\r\n return new this(x).cosh();\r\n}\r\n\r\n\r\n/\r\n Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n \r\n /\r\nfunction clone(obj) {\r\n var i, p, ps;\r\n\r\n /\r\n The Decimal constructor and exported function.\r\n * Return a new Decimal instance.\r\n \r\n v {number\|string\|Decimal} A numeric value.\r\n \r\n /\r\n function Decimal(v) {\r\n var e, i, t,\r\n x = this;\r\n\r\n // Decimal called without new.\r\n if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n // which points to Object.\r\n x.constructor = Decimal;\r\n\r\n // Duplicate.\r\n if (isDecimalInstance(v)) {\r\n x.s = v.s;\r\n\r\n if (external) {\r\n if (!v.d \|\| v.e > Decimal.maxE) {\r\n\r\n // Infinity.\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (v.e < Decimal.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d.slice();\r\n }\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d ? v.d.slice() : v.d;\r\n }\r\n\r\n return;\r\n }\r\n\r\n t = typeof v;\r\n\r\n if (t === 'number') {\r\n if (v === 0) {\r\n x.s = 1 / v < 0 ? -1 : 1;\r\n x.e = 0;\r\n x.d = [0];\r\n return;\r\n }\r\n\r\n if (v < 0) {\r\n v = -v;\r\n x.s = -1;\r\n } else {\r\n x.s = 1;\r\n }\r\n\r\n // Fast path for small integers.\r\n if (v === ~~v && v < 1e7) {\r\n for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n if (external) {\r\n if (e > Decimal.maxE) {\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (e < Decimal.minE) {\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n\r\n return;\r\n\r\n // Infinity, NaN.\r\n } else if (v * 0 !== 0) {\r\n if (!v) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return;\r\n }\r\n\r\n return parseDecimal(x, v.toString());\r\n\r\n } else if (t !== 'string') {\r\n throw Error(invalidArgument + v);\r\n }\r\n\r\n // Minus sign?\r\n if ((i = v.charCodeAt(0)) === 45) {\r\n v = v.slice(1);\r\n x.s = -1;\r\n } else {\r\n // Plus sign?\r\n if (i === 43) v = v.slice(1);\r\n x.s = 1;\r\n }\r\n\r\n return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n }\r\n\r\n Decimal.prototype = P;\r\n\r\n Decimal.ROUND_UP = 0;\r\n Decimal.ROUND_DOWN = 1;\r\n Decimal.ROUND_CEIL = 2;\r\n Decimal.ROUND_FLOOR = 3;\r\n Decimal.ROUND_HALF_UP = 4;\r\n Decimal.ROUND_HALF_DOWN = 5;\r\n Decimal.ROUND_HALF_EVEN = 6;\r\n Decimal.ROUND_HALF_CEIL = 7;\r\n Decimal.ROUND_HALF_FLOOR = 8;\r\n Decimal.EUCLID = 9;\r\n\r\n Decimal.config = Decimal.set = config;\r\n Decimal.clone = clone;\r\n Decimal.isDecimal = isDecimalInstance;\r\n\r\n Decimal.abs = abs;\r\n Decimal.acos = acos;\r\n Decimal.acosh = acosh; // ES6\r\n Decimal.add = add;\r\n Decimal.asin = asin;\r\n Decimal.asinh = asinh; // ES6\r\n Decimal.atan = atan;\r\n Decimal.atanh = atanh; // ES6\r\n Decimal.atan2 = atan2;\r\n Decimal.cbrt = cbrt; // ES6\r\n Decimal.ceil = ceil;\r\n Decimal.clamp = clamp;\r\n Decimal.cos = cos;\r\n Decimal.cosh = cosh; // ES6\r\n Decimal.div = div;\r\n Decimal.exp = exp;\r\n Decimal.floor = floor;\r\n Decimal.hypot = hypot; // ES6\r\n Decimal.ln = ln;\r\n Decimal.log = log;\r\n Decimal.log10 = log10; // ES6\r\n Decimal.log2 = log2; // ES6\r\n Decimal.max = max;\r\n Decimal.min = min;\r\n Decimal.mod = mod;\r\n Decimal.mul = mul;\r\n Decimal.pow = pow;\r\n Decimal.random = random;\r\n Decimal.round = round;\r\n Decimal.sign = sign; // ES6\r\n Decimal.sin = sin;\r\n Decimal.sinh = sinh; // ES6\r\n Decimal.sqrt = sqrt;\r\n Decimal.sub = sub;\r\n Decimal.sum = sum;\r\n Decimal.tan = tan;\r\n Decimal.tanh = tanh; // ES6\r\n Decimal.trunc = trunc; // ES6\r\n\r\n if (obj === void 0) obj = {};\r\n if (obj) {\r\n if (obj.defaults !== true) {\r\n ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n }\r\n }\r\n\r\n Decimal.config(obj);\r\n\r\n return Decimal;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction div(x, y) {\r\n return new this(x).div(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} The power to which to raise the base of the natural log.\r\n \r\n /\r\nfunction exp(x) {\r\n return new this(x).exp();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction floor(x) {\r\n return finalise(x = new this(x), x.e + 1, 3);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction hypot() {\r\n var i, n,\r\n t = new this(0);\r\n\r\n external = false;\r\n\r\n for (i = 0; i < arguments.length;) {\r\n n = new this(arguments[i++]);\r\n if (!n.d) {\r\n if (n.s) {\r\n external = true;\r\n return new this(1 / 0);\r\n }\r\n t = n;\r\n } else if (t.d) {\r\n t = t.plus(n.times(n));\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return t.sqrt();\r\n}\r\n\r\n\r\n/\r\n Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n \r\n /\r\nfunction isDecimalInstance(obj) {\r\n return obj instanceof Decimal \|\| obj && obj.toStringTag === tag \|\| false;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction ln(x) {\r\n return new this(x).ln();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n log[y](x)\r\n \r\n x {number\|string\|Decimal} The argument of the logarithm.\r\n * y {number\|string\|Decimal} The base of the logarithm.\r\n \r\n /\r\nfunction log(x, y) {\r\n return new this(x).log(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction log2(x) {\r\n return new this(x).log(2);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction log10(x) {\r\n return new this(x).log(10);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the maximum of the arguments.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction max() {\r\n return maxOrMin(this, arguments, 'lt');\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the minimum of the arguments.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction min() {\r\n return maxOrMin(this, arguments, 'gt');\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction mod(x, y) {\r\n return new this(x).mod(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction mul(x, y) {\r\n return new this(x).mul(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} The base.\r\n * y {number\|string\|Decimal} The exponent.\r\n \r\n /\r\nfunction pow(x, y) {\r\n return new this(x).pow(y);\r\n}\r\n\r\n\r\n/\r\n Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n \r\n [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n \r\n /\r\nfunction random(sd) {\r\n var d, e, k, n,\r\n i = 0,\r\n r = new this(1),\r\n rd = [];\r\n\r\n if (sd === void 0) sd = this.precision;\r\n else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n k = Math.ceil(sd / LOG_BASE);\r\n\r\n if (!this.crypto) {\r\n for (; i < k;) rd[i++] = Math.random() * 1e7 \| 0;\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n } else if (crypto.getRandomValues) {\r\n d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n for (; i < k;) {\r\n n = d[i];\r\n\r\n // 0 <= n < 4294967296\r\n // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n if (n >= 4.29e9) {\r\n d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n } else {\r\n\r\n // 0 <= n <= 4289999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd[i++] = n % 1e7;\r\n }\r\n }\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n d = crypto.randomBytes(k = 4);\r\n\r\n for (; i < k;) {\r\n\r\n // 0 <= n < 2147483648\r\n n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n if (n >= 2.14e9) {\r\n crypto.randomBytes(4).copy(d, i);\r\n } else {\r\n\r\n // 0 <= n <= 2139999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd.push(n % 1e7);\r\n i += 4;\r\n }\r\n }\r\n\r\n i = k / 4;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n\r\n k = rd[--i];\r\n sd %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to sd.\r\n if (k && sd) {\r\n n = mathpow(10, LOG_BASE - sd);\r\n rd[i] = (k / n \| 0) n;\r\n }\r\n\r\n // Remove trailing words which are zero.\r\n for (; rd[i] === 0; i--) rd.pop();\r\n\r\n // Zero?\r\n if (i < 0) {\r\n e = 0;\r\n rd = [0];\r\n } else {\r\n e = -1;\r\n\r\n // Remove leading words which are zero and adjust exponent accordingly.\r\n for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n // Count the digits of the first word of rd to determine leading zeros.\r\n for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n // Adjust the exponent for leading zeros of the first word of rd.\r\n if (k < LOG_BASE) e -= LOG_BASE - k;\r\n }\r\n\r\n r.e = e;\r\n r.d = rd;\r\n\r\n return r;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n \r\n To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction round(x) {\r\n return finalise(x = new this(x), x.e + 1, this.rounding);\r\n}\r\n\r\n\r\n/\r\n Return\r\n * 1 if x > 0,\r\n * -1 if x < 0,\r\n * 0 if x is 0,\r\n * -0 if x is -0,\r\n * NaN otherwise\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction sign(x) {\r\n x = new this(x);\r\n return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s \|\| NaN;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction sin(x) {\r\n return new this(x).sin();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction sinh(x) {\r\n return new this(x).sinh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction sqrt(x) {\r\n return new this(x).sqrt();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction sub(x, y) {\r\n return new this(x).sub(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n Only the result is rounded, not the intermediate calculations.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction sum() {\r\n var i = 0,\r\n args = arguments,\r\n x = new this(args[i]);\r\n\r\n external = false;\r\n for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n external = true;\r\n\r\n return finalise(x, this.precision, this.rounding);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction tan(x) {\r\n return new this(x).tan();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction tanh(x) {\r\n return new this(x).tanh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` truncated to an integer.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction trunc(x) {\r\n return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n","export const defaultJsonSerializer = JSON;\n//# sourceMappingURL=defaultJsonSerializer.js.map","export const uppercase = (str) => str.toUpperCase();\n/*\n Convert Headers instance into regular object\n /\nexport const HeadersInstanceToPlainObject = (headers) => {\n const o = {};\n headers.forEach((v, k) => {\n o[k] = v;\n });\n return o;\n};\n//# sourceMappingURL=helpers.js.map","export const parseRequestArgs = (documentOrOptions, variables, requestHeaders) => {\n return documentOrOptions.document\n ? documentOrOptions\n : {\n document: documentOrOptions,\n variables: variables,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRawRequestArgs = (queryOrOptions, variables, requestHeaders) => {\n return queryOrOptions.query\n ? queryOrOptions\n : {\n query: queryOrOptions,\n variables: variables,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseBatchRequestArgs = (documentsOrOptions, requestHeaders) => {\n return documentsOrOptions.documents\n ? documentsOrOptions\n : {\n documents: documentsOrOptions,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRequestExtendedArgs = (urlOrOptions, document, ...variablesAndRequestHeaders) => {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n return urlOrOptions.document\n ? urlOrOptions\n : {\n url: urlOrOptions,\n document: document,\n variables,\n requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRawRequestExtendedArgs = (urlOrOptions, query, ...variablesAndRequestHeaders) => {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n return urlOrOptions.query\n ? urlOrOptions\n : {\n url: urlOrOptions,\n query: query,\n variables,\n requestHeaders,\n signal: undefined,\n };\n};\n//# sourceMappingURL=parseArgs.js.map","export function devAssert(condition, message) {\n const booleanCondition = Boolean(condition);\n\n if (!booleanCondition) {\n throw new Error(message);\n }\n}\n","/\n Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n /\nexport function isObjectLike(value) {\n return typeof value == 'object' && value !== null;\n}\n","export function invariant(condition, message) {\n const booleanCondition = Boolean(condition);\n\n if (!booleanCondition) {\n throw new Error(\n message != null ? message : 'Unexpected invariant triggered.',\n );\n }\n}\n","import { invariant } from '../jsutils/invariant.mjs';\nconst LineRegExp = /\\r\\n\|[\\n\\r]/g;\n/\n Represents a location in a Source.\n /\n\n/\n Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n /\nexport function getLocation(source, position) {\n let lastLineStart = 0;\n let line = 1;\n\n for (const match of source.body.matchAll(LineRegExp)) {\n typeof match.index === 'number' \|\| invariant(false);\n\n if (match.index >= position) {\n break;\n }\n\n lastLineStart = match.index + match[0].length;\n line += 1;\n }\n\n return {\n line,\n column: position + 1 - lastLineStart,\n };\n}\n","import { getLocation } from './location.mjs';\n\n/\n Render a helpful description of the location in the GraphQL Source document.\n /\nexport function printLocation(location) {\n return printSourceLocation(\n location.source,\n getLocation(location.source, location.start),\n );\n}\n/\n Render a helpful description of the location in the GraphQL Source document.\n /\n\nexport function printSourceLocation(source, sourceLocation) {\n const firstLineColumnOffset = source.locationOffset.column - 1;\n const body = ''.padStart(firstLineColumnOffset) + source.body;\n const lineIndex = sourceLocation.line - 1;\n const lineOffset = source.locationOffset.line - 1;\n const lineNum = sourceLocation.line + lineOffset;\n const columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n const columnNum = sourceLocation.column + columnOffset;\n const locationStr = `${source.name}:${lineNum}:${columnNum}\\n`;\n const lines = body.split(/\\r\\n\|[\\n\\r]/g);\n const locationLine = lines[lineIndex]; // Special case for minified documents\n\n if (locationLine.length > 120) {\n const subLineIndex = Math.floor(columnNum / 80);\n const subLineColumnNum = columnNum % 80;\n const subLines = [];\n\n for (let i = 0; i < locationLine.length; i += 80) {\n subLines.push(locationLine.slice(i, i + 80));\n }\n\n return (\n locationStr +\n printPrefixedLines([\n [`${lineNum} \|`, subLines[0]],\n ...subLines.slice(1, subLineIndex + 1).map((subLine) => ['\|', subLine]),\n ['\|', '^'.padStart(subLineColumnNum)],\n ['\|', subLines[subLineIndex + 1]],\n ])\n );\n }\n\n return (\n locationStr +\n printPrefixedLines([\n // Lines specified like this: [\"prefix\", \"string\"],\n [`${lineNum - 1} \|`, lines[lineIndex - 1]],\n [`${lineNum} \|`, locationLine],\n ['\|', '^'.padStart(columnNum)],\n [`${lineNum + 1} \|`, lines[lineIndex + 1]],\n ])\n );\n}\n\nfunction printPrefixedLines(lines) {\n const existingLines = lines.filter(([_, line]) => line !== undefined);\n const padLen = Math.max(...existingLines.map(([prefix]) => prefix.length));\n return existingLines\n .map(([prefix, line]) => prefix.padStart(padLen) + (line ? ' ' + line : ''))\n .join('\\n');\n}\n","import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n printLocation,\n printSourceLocation,\n} from '../language/printLocation.mjs';\n\nfunction toNormalizedOptions(args) {\n const firstArg = args[0];\n\n if (firstArg == null \|\| 'kind' in firstArg \|\| 'length' in firstArg) {\n return {\n nodes: firstArg,\n source: args[1],\n positions: args[2],\n path: args[3],\n originalError: args[4],\n extensions: args[5],\n };\n }\n\n return firstArg;\n}\n/\n A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n /\n\nexport class GraphQLError extends Error {\n /\n An array of `{ line, column }` locations within the source GraphQL document\n * which correspond to this error.\n \n Errors during validation often contain multiple locations, for example to\n * point out two things with the same name. Errors during execution include a\n * single location, the field which produced the error.\n \n Enumerable, and appears in the result of JSON.stringify().\n /\n\n /\n An array describing the JSON-path into the execution response which\n * corresponds to this error. Only included for errors during execution.\n \n Enumerable, and appears in the result of JSON.stringify().\n /\n\n /\n An array of GraphQL AST Nodes corresponding to this error.\n /\n\n /\n The source GraphQL document for the first location of this error.\n \n Note that if this Error represents more than one node, the source may not\n * represent nodes after the first node.\n /\n\n /\n An array of character offsets within the source GraphQL document\n * which correspond to this error.\n /\n\n /\n The original error thrown from a field resolver during execution.\n /\n\n /\n Extension fields to add to the formatted error.\n /\n\n /\n @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.\n /\n constructor(message, ...rawArgs) {\n var _this$nodes, _nodeLocations$, _ref;\n\n const { nodes, source, positions, path, originalError, extensions } =\n toNormalizedOptions(rawArgs);\n super(message);\n this.name = 'GraphQLError';\n this.path = path !== null && path !== void 0 ? path : undefined;\n this.originalError =\n originalError !== null && originalError !== void 0\n ? originalError\n : undefined; // Compute list of blame nodes.\n\n this.nodes = undefinedIfEmpty(\n Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n );\n const nodeLocations = undefinedIfEmpty(\n (_this$nodes = this.nodes) === null \|\| _this$nodes === void 0\n ? void 0\n : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n ); // Compute locations in the source for the given nodes/positions.\n\n this.source =\n source !== null && source !== void 0\n ? source\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : (_nodeLocations$ = nodeLocations[0]) === null \|\|\n _nodeLocations$ === void 0\n ? void 0\n : _nodeLocations$.source;\n this.positions =\n positions !== null && positions !== void 0\n ? positions\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : nodeLocations.map((loc) => loc.start);\n this.locations =\n positions && source\n ? positions.map((pos) => getLocation(source, pos))\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n const originalExtensions = isObjectLike(\n originalError === null \|\| originalError === void 0\n ? void 0\n : originalError.extensions,\n )\n ? originalError === null \|\| originalError === void 0\n ? void 0\n : originalError.extensions\n : undefined;\n this.extensions =\n (_ref =\n extensions !== null && extensions !== void 0\n ? extensions\n : originalExtensions) !== null && _ref !== void 0\n ? _ref\n : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n // Keep the rest as non-enumerable.\n\n Object.defineProperties(this, {\n message: {\n writable: true,\n enumerable: true,\n },\n name: {\n enumerable: false,\n },\n nodes: {\n enumerable: false,\n },\n source: {\n enumerable: false,\n },\n positions: {\n enumerable: false,\n },\n originalError: {\n enumerable: false,\n },\n }); // Include (non-enumerable) stack trace.\n\n / c8 ignore start /\n // FIXME: https://github.com/graphql/graphql-js/issues/2317\n\n if (\n originalError !== null &&\n originalError !== void 0 &&\n originalError.stack\n ) {\n Object.defineProperty(this, 'stack', {\n value: originalError.stack,\n writable: true,\n configurable: true,\n });\n } else if (Error.captureStackTrace) {\n Error.captureStackTrace(this, GraphQLError);\n } else {\n Object.defineProperty(this, 'stack', {\n value: Error().stack,\n writable: true,\n configurable: true,\n });\n }\n / c8 ignore stop /\n }\n\n get [Symbol.toStringTag]() {\n return 'GraphQLError';\n }\n\n toString() {\n let output = this.message;\n\n if (this.nodes) {\n for (const node of this.nodes) {\n if (node.loc) {\n output += '\\n\\n' + printLocation(node.loc);\n }\n }\n } else if (this.source && this.locations) {\n for (const location of this.locations) {\n output += '\\n\\n' + printSourceLocation(this.source, location);\n }\n }\n\n return output;\n }\n\n toJSON() {\n const formattedError = {\n message: this.message,\n };\n\n if (this.locations != null) {\n formattedError.locations = this.locations;\n }\n\n if (this.path != null) {\n formattedError.path = this.path;\n }\n\n if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n formattedError.extensions = this.extensions;\n }\n\n return formattedError;\n }\n}\n\nfunction undefinedIfEmpty(array) {\n return array === undefined \|\| array.length === 0 ? undefined : array;\n}\n/\n See: https://spec.graphql.org/draft/#sec-Errors\n /\n\n/\n Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n \n @deprecated Please use `error.toString` instead. Will be removed in v17\n /\nexport function printError(error) {\n return error.toString();\n}\n/\n Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n \n @deprecated Please use `error.toJSON` instead. Will be removed in v17\n /\n\nexport function formatError(error) {\n return error.toJSON();\n}\n","import { GraphQLError } from './GraphQLError.mjs';\n/\n Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n /\n\nexport function syntaxError(source, position, description) {\n return new GraphQLError(`Syntax Error: ${description}`, {\n source,\n positions: [position],\n });\n}\n","/\n Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n /\nexport class Location {\n /\n The character offset at which this Node begins.\n /\n\n /\n The character offset at which this Node ends.\n /\n\n /\n The Token at which this Node begins.\n /\n\n /\n The Token at which this Node ends.\n /\n\n /\n The Source document the AST represents.\n /\n constructor(startToken, endToken, source) {\n this.start = startToken.start;\n this.end = endToken.end;\n this.startToken = startToken;\n this.endToken = endToken;\n this.source = source;\n }\n\n get [Symbol.toStringTag]() {\n return 'Location';\n }\n\n toJSON() {\n return {\n start: this.start,\n end: this.end,\n };\n }\n}\n/\n Represents a range of characters represented by a lexical token\n * within a Source.\n /\n\nexport class Token {\n /\n The kind of Token.\n /\n\n /\n The character offset at which this Node begins.\n /\n\n /\n The character offset at which this Node ends.\n /\n\n /\n The 1-indexed line number on which this Token appears.\n /\n\n /\n The 1-indexed column number at which this Token begins.\n /\n\n /\n For non-punctuation tokens, represents the interpreted value of the token.\n \n Note: is undefined for punctuation tokens, but typed as string for\n * convenience in the parser.\n /\n\n /\n Tokens exist as nodes in a double-linked-list amongst all tokens\n * including ignored tokens. <SOF> is always the first node and <EOF>\n * the last.\n /\n constructor(kind, start, end, line, column, value) {\n this.kind = kind;\n this.start = start;\n this.end = end;\n this.line = line;\n this.column = column; // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\n this.value = value;\n this.prev = null;\n this.next = null;\n }\n\n get [Symbol.toStringTag]() {\n return 'Token';\n }\n\n toJSON() {\n return {\n kind: this.kind,\n value: this.value,\n line: this.line,\n column: this.column,\n };\n }\n}\n/\n The list of all possible AST node types.\n /\n\n/\n @internal\n /\nexport const QueryDocumentKeys = {\n Name: [],\n Document: ['definitions'],\n OperationDefinition: [\n 'name',\n 'variableDefinitions',\n 'directives',\n 'selectionSet',\n ],\n VariableDefinition: ['variable', 'type', 'defaultValue', 'directives'],\n Variable: ['name'],\n SelectionSet: ['selections'],\n Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n Argument: ['name', 'value'],\n FragmentSpread: ['name', 'directives'],\n InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n FragmentDefinition: [\n 'name', // Note: fragment variable definitions are deprecated and will removed in v17.0.0\n 'variableDefinitions',\n 'typeCondition',\n 'directives',\n 'selectionSet',\n ],\n IntValue: [],\n FloatValue: [],\n StringValue: [],\n BooleanValue: [],\n NullValue: [],\n EnumValue: [],\n ListValue: ['values'],\n ObjectValue: ['fields'],\n ObjectField: ['name', 'value'],\n Directive: ['name', 'arguments'],\n NamedType: ['name'],\n ListType: ['type'],\n NonNullType: ['type'],\n SchemaDefinition: ['description', 'directives', 'operationTypes'],\n OperationTypeDefinition: ['type'],\n ScalarTypeDefinition: ['description', 'name', 'directives'],\n ObjectTypeDefinition: [\n 'description',\n 'name',\n 'interfaces',\n 'directives',\n 'fields',\n ],\n FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n InputValueDefinition: [\n 'description',\n 'name',\n 'type',\n 'defaultValue',\n 'directives',\n ],\n InterfaceTypeDefinition: [\n 'description',\n 'name',\n 'interfaces',\n 'directives',\n 'fields',\n ],\n UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n EnumValueDefinition: ['description', 'name', 'directives'],\n InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n SchemaExtension: ['directives', 'operationTypes'],\n ScalarTypeExtension: ['name', 'directives'],\n ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n UnionTypeExtension: ['name', 'directives', 'types'],\n EnumTypeExtension: ['name', 'directives', 'values'],\n InputObjectTypeExtension: ['name', 'directives', 'fields'],\n};\nconst kindValues = new Set(Object.keys(QueryDocumentKeys));\n/\n @internal\n /\n\nexport function isNode(maybeNode) {\n const maybeKind =\n maybeNode === null \|\| maybeNode === void 0 ? void 0 : maybeNode.kind;\n return typeof maybeKind === 'string' && kindValues.has(maybeKind);\n}\n/* Name /\n\nvar OperationTypeNode;\n\n(function (OperationTypeNode) {\n OperationTypeNode['QUERY'] = 'query';\n OperationTypeNode['MUTATION'] = 'mutation';\n OperationTypeNode['SUBSCRIPTION'] = 'subscription';\n})(OperationTypeNode \|\| (OperationTypeNode = {}));\n\nexport { OperationTypeNode };\n","/\n The set of allowed directive location values.\n /\nvar DirectiveLocation;\n\n(function (DirectiveLocation) {\n DirectiveLocation['QUERY'] = 'QUERY';\n DirectiveLocation['MUTATION'] = 'MUTATION';\n DirectiveLocation['SUBSCRIPTION'] = 'SUBSCRIPTION';\n DirectiveLocation['FIELD'] = 'FIELD';\n DirectiveLocation['FRAGMENT_DEFINITION'] = 'FRAGMENT_DEFINITION';\n DirectiveLocation['FRAGMENT_SPREAD'] = 'FRAGMENT_SPREAD';\n DirectiveLocation['INLINE_FRAGMENT'] = 'INLINE_FRAGMENT';\n DirectiveLocation['VARIABLE_DEFINITION'] = 'VARIABLE_DEFINITION';\n DirectiveLocation['SCHEMA'] = 'SCHEMA';\n DirectiveLocation['SCALAR'] = 'SCALAR';\n DirectiveLocation['OBJECT'] = 'OBJECT';\n DirectiveLocation['FIELD_DEFINITION'] = 'FIELD_DEFINITION';\n DirectiveLocation['ARGUMENT_DEFINITION'] = 'ARGUMENT_DEFINITION';\n DirectiveLocation['INTERFACE'] = 'INTERFACE';\n DirectiveLocation['UNION'] = 'UNION';\n DirectiveLocation['ENUM'] = 'ENUM';\n DirectiveLocation['ENUM_VALUE'] = 'ENUM_VALUE';\n DirectiveLocation['INPUT_OBJECT'] = 'INPUT_OBJECT';\n DirectiveLocation['INPUT_FIELD_DEFINITION'] = 'INPUT_FIELD_DEFINITION';\n})(DirectiveLocation \|\| (DirectiveLocation = {}));\n\nexport { DirectiveLocation };\n/\n The enum type representing the directive location values.\n \n @deprecated Please use `DirectiveLocation`. Will be remove in v17.\n /\n","/\n The set of allowed kind values for AST nodes.\n /\nvar Kind;\n\n(function (Kind) {\n Kind['NAME'] = 'Name';\n Kind['DOCUMENT'] = 'Document';\n Kind['OPERATION_DEFINITION'] = 'OperationDefinition';\n Kind['VARIABLE_DEFINITION'] = 'VariableDefinition';\n Kind['SELECTION_SET'] = 'SelectionSet';\n Kind['FIELD'] = 'Field';\n Kind['ARGUMENT'] = 'Argument';\n Kind['FRAGMENT_SPREAD'] = 'FragmentSpread';\n Kind['INLINE_FRAGMENT'] = 'InlineFragment';\n Kind['FRAGMENT_DEFINITION'] = 'FragmentDefinition';\n Kind['VARIABLE'] = 'Variable';\n Kind['INT'] = 'IntValue';\n Kind['FLOAT'] = 'FloatValue';\n Kind['STRING'] = 'StringValue';\n Kind['BOOLEAN'] = 'BooleanValue';\n Kind['NULL'] = 'NullValue';\n Kind['ENUM'] = 'EnumValue';\n Kind['LIST'] = 'ListValue';\n Kind['OBJECT'] = 'ObjectValue';\n Kind['OBJECT_FIELD'] = 'ObjectField';\n Kind['DIRECTIVE'] = 'Directive';\n Kind['NAMED_TYPE'] = 'NamedType';\n Kind['LIST_TYPE'] = 'ListType';\n Kind['NON_NULL_TYPE'] = 'NonNullType';\n Kind['SCHEMA_DEFINITION'] = 'SchemaDefinition';\n Kind['OPERATION_TYPE_DEFINITION'] = 'OperationTypeDefinition';\n Kind['SCALAR_TYPE_DEFINITION'] = 'ScalarTypeDefinition';\n Kind['OBJECT_TYPE_DEFINITION'] = 'ObjectTypeDefinition';\n Kind['FIELD_DEFINITION'] = 'FieldDefinition';\n Kind['INPUT_VALUE_DEFINITION'] = 'InputValueDefinition';\n Kind['INTERFACE_TYPE_DEFINITION'] = 'InterfaceTypeDefinition';\n Kind['UNION_TYPE_DEFINITION'] = 'UnionTypeDefinition';\n Kind['ENUM_TYPE_DEFINITION'] = 'EnumTypeDefinition';\n Kind['ENUM_VALUE_DEFINITION'] = 'EnumValueDefinition';\n Kind['INPUT_OBJECT_TYPE_DEFINITION'] = 'InputObjectTypeDefinition';\n Kind['DIRECTIVE_DEFINITION'] = 'DirectiveDefinition';\n Kind['SCHEMA_EXTENSION'] = 'SchemaExtension';\n Kind['SCALAR_TYPE_EXTENSION'] = 'ScalarTypeExtension';\n Kind['OBJECT_TYPE_EXTENSION'] = 'ObjectTypeExtension';\n Kind['INTERFACE_TYPE_EXTENSION'] = 'InterfaceTypeExtension';\n Kind['UNION_TYPE_EXTENSION'] = 'UnionTypeExtension';\n Kind['ENUM_TYPE_EXTENSION'] = 'EnumTypeExtension';\n Kind['INPUT_OBJECT_TYPE_EXTENSION'] = 'InputObjectTypeExtension';\n})(Kind \|\| (Kind = {}));\n\nexport { Kind };\n/\n The enum type representing the possible kind values of AST nodes.\n \n @deprecated Please use `Kind`. Will be remove in v17.\n /\n","/\n ```\n * WhiteSpace ::\n * - \"Horizontal Tab (U+0009)\"\n * - \"Space (U+0020)\"\n * ```\n * @internal\n /\nexport function isWhiteSpace(code) {\n return code === 0x0009 \|\| code === 0x0020;\n}\n/\n ```\n * Digit :: one of\n * - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * ```\n * @internal\n /\n\nexport function isDigit(code) {\n return code >= 0x0030 && code <= 0x0039;\n}\n/\n ```\n * Letter :: one of\n * - `A` `B` `C` `D` `E` `F` `G` `H` `I` `J` `K` `L` `M`\n * - `N` `O` `P` `Q` `R` `S` `T` `U` `V` `W` `X` `Y` `Z`\n * - `a` `b` `c` `d` `e` `f` `g` `h` `i` `j` `k` `l` `m`\n * - `n` `o` `p` `q` `r` `s` `t` `u` `v` `w` `x` `y` `z`\n * ```\n * @internal\n /\n\nexport function isLetter(code) {\n return (\n (code >= 0x0061 && code <= 0x007a) \|\| // A-Z\n (code >= 0x0041 && code <= 0x005a) // a-z\n );\n}\n/\n ```\n * NameStart ::\n * - Letter\n * - `_`\n * ```\n * @internal\n /\n\nexport function isNameStart(code) {\n return isLetter(code) \|\| code === 0x005f;\n}\n/\n ```\n * NameContinue ::\n * - Letter\n * - Digit\n * - `_`\n * ```\n * @internal\n /\n\nexport function isNameContinue(code) {\n return isLetter(code) \|\| isDigit(code) \|\| code === 0x005f;\n}\n","import { isWhiteSpace } from './characterClasses.mjs';\n/\n Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n \n This implements the GraphQL spec's BlockStringValue() static algorithm.\n \n @internal\n /\n\nexport function dedentBlockStringLines(lines) {\n var _firstNonEmptyLine2;\n\n let commonIndent = Number.MAX_SAFE_INTEGER;\n let firstNonEmptyLine = null;\n let lastNonEmptyLine = -1;\n\n for (let i = 0; i < lines.length; ++i) {\n var _firstNonEmptyLine;\n\n const line = lines[i];\n const indent = leadingWhitespace(line);\n\n if (indent === line.length) {\n continue; // skip empty lines\n }\n\n firstNonEmptyLine =\n (_firstNonEmptyLine = firstNonEmptyLine) !== null &&\n _firstNonEmptyLine !== void 0\n ? _firstNonEmptyLine\n : i;\n lastNonEmptyLine = i;\n\n if (i !== 0 && indent < commonIndent) {\n commonIndent = indent;\n }\n }\n\n return lines // Remove common indentation from all lines but first.\n .map((line, i) => (i === 0 ? line : line.slice(commonIndent))) // Remove leading and trailing blank lines.\n .slice(\n (_firstNonEmptyLine2 = firstNonEmptyLine) !== null &&\n _firstNonEmptyLine2 !== void 0\n ? _firstNonEmptyLine2\n : 0,\n lastNonEmptyLine + 1,\n );\n}\n\nfunction leadingWhitespace(str) {\n let i = 0;\n\n while (i < str.length && isWhiteSpace(str.charCodeAt(i))) {\n ++i;\n }\n\n return i;\n}\n/\n @internal\n /\n\nexport function isPrintableAsBlockString(value) {\n if (value === '') {\n return true; // empty string is printable\n }\n\n let isEmptyLine = true;\n let hasIndent = false;\n let hasCommonIndent = true;\n let seenNonEmptyLine = false;\n\n for (let i = 0; i < value.length; ++i) {\n switch (value.codePointAt(i)) {\n case 0x0000:\n case 0x0001:\n case 0x0002:\n case 0x0003:\n case 0x0004:\n case 0x0005:\n case 0x0006:\n case 0x0007:\n case 0x0008:\n case 0x000b:\n case 0x000c:\n case 0x000e:\n case 0x000f:\n return false;\n // Has non-printable characters\n\n case 0x000d:\n // \\r\n return false;\n // Has \\r or \\r\\n which will be replaced as \\n\n\n case 10:\n // \\n\n if (isEmptyLine && !seenNonEmptyLine) {\n return false; // Has leading new line\n }\n\n seenNonEmptyLine = true;\n isEmptyLine = true;\n hasIndent = false;\n break;\n\n case 9: // \\t\n\n case 32:\n // <space>\n hasIndent \|\| (hasIndent = isEmptyLine);\n break;\n\n default:\n hasCommonIndent && (hasCommonIndent = hasIndent);\n isEmptyLine = false;\n }\n }\n\n if (isEmptyLine) {\n return false; // Has trailing empty lines\n }\n\n if (hasCommonIndent && seenNonEmptyLine) {\n return false; // Has internal indent\n }\n\n return true;\n}\n/\n Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n \n @internal\n /\n\nexport function printBlockString(value, options) {\n const escapedValue = value.replace(/\"\"\"/g, '\\\\\"\"\"'); // Expand a block string's raw value into independent lines.\n\n const lines = escapedValue.split(/\\r\\n\|[\\n\\r]/g);\n const isSingleLine = lines.length === 1; // If common indentation is found we can fix some of those cases by adding leading new line\n\n const forceLeadingNewLine =\n lines.length > 1 &&\n lines\n .slice(1)\n .every((line) => line.length === 0 \|\| isWhiteSpace(line.charCodeAt(0))); // Trailing triple quotes just looks confusing but doesn't force trailing new line\n\n const hasTrailingTripleQuotes = escapedValue.endsWith('\\\\\"\"\"'); // Trailing quote (single or double) or slash forces trailing new line\n\n const hasTrailingQuote = value.endsWith('\"') && !hasTrailingTripleQuotes;\n const hasTrailingSlash = value.endsWith('\\\\');\n const forceTrailingNewline = hasTrailingQuote \|\| hasTrailingSlash;\n const printAsMultipleLines =\n !(options !== null && options !== void 0 && options.minimize) && // add leading and trailing new lines only if it improves readability\n (!isSingleLine \|\|\n value.length > 70 \|\|\n forceTrailingNewline \|\|\n forceLeadingNewLine \|\|\n hasTrailingTripleQuotes);\n let result = ''; // Format a multi-line block quote to account for leading space.\n\n const skipLeadingNewLine = isSingleLine && isWhiteSpace(value.charCodeAt(0));\n\n if ((printAsMultipleLines && !skipLeadingNewLine) \|\| forceLeadingNewLine) {\n result += '\\n';\n }\n\n result += escapedValue;\n\n if (printAsMultipleLines \|\| forceTrailingNewline) {\n result += '\\n';\n }\n\n return '\"\"\"' + result + '\"\"\"';\n}\n","/\n An exported enum describing the different kinds of tokens that the\n * lexer emits.\n /\nvar TokenKind;\n\n(function (TokenKind) {\n TokenKind['SOF'] = '<SOF>';\n TokenKind['EOF'] = '<EOF>';\n TokenKind['BANG'] = '!';\n TokenKind['DOLLAR'] = '$';\n TokenKind['AMP'] = '&';\n TokenKind['PAREN_L'] = '(';\n TokenKind['PAREN_R'] = ')';\n TokenKind['SPREAD'] = '...';\n TokenKind['COLON'] = ':';\n TokenKind['EQUALS'] = '=';\n TokenKind['AT'] = '@';\n TokenKind['BRACKET_L'] = '[';\n TokenKind['BRACKET_R'] = ']';\n TokenKind['BRACE_L'] = '{';\n TokenKind['PIPE'] = '\|';\n TokenKind['BRACE_R'] = '}';\n TokenKind['NAME'] = 'Name';\n TokenKind['INT'] = 'Int';\n TokenKind['FLOAT'] = 'Float';\n TokenKind['STRING'] = 'String';\n TokenKind['BLOCK_STRING'] = 'BlockString';\n TokenKind['COMMENT'] = 'Comment';\n})(TokenKind \|\| (TokenKind = {}));\n\nexport { TokenKind };\n/\n The enum type representing the token kinds values.\n \n @deprecated Please use `TokenKind`. Will be remove in v17.\n /\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Token } from './ast.mjs';\nimport { dedentBlockStringLines } from './blockString.mjs';\nimport { isDigit, isNameContinue, isNameStart } from './characterClasses.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/\n Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n /\n\nexport class Lexer {\n /\n The previously focused non-ignored token.\n /\n\n /\n The currently focused non-ignored token.\n /\n\n /\n The (1-indexed) line containing the current token.\n /\n\n /\n The character offset at which the current line begins.\n /\n constructor(source) {\n const startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0);\n this.source = source;\n this.lastToken = startOfFileToken;\n this.token = startOfFileToken;\n this.line = 1;\n this.lineStart = 0;\n }\n\n get [Symbol.toStringTag]() {\n return 'Lexer';\n }\n /\n Advances the token stream to the next non-ignored token.\n /\n\n advance() {\n this.lastToken = this.token;\n const token = (this.token = this.lookahead());\n return token;\n }\n /\n Looks ahead and returns the next non-ignored token, but does not change\n * the state of Lexer.\n /\n\n lookahead() {\n let token = this.token;\n\n if (token.kind !== TokenKind.EOF) {\n do {\n if (token.next) {\n token = token.next;\n } else {\n // Read the next token and form a link in the token linked-list.\n const nextToken = readNextToken(this, token.end); // @ts-expect-error next is only mutable during parsing.\n\n token.next = nextToken; // @ts-expect-error prev is only mutable during parsing.\n\n nextToken.prev = token;\n token = nextToken;\n }\n } while (token.kind === TokenKind.COMMENT);\n }\n\n return token;\n }\n}\n/\n @internal\n /\n\nexport function isPunctuatorTokenKind(kind) {\n return (\n kind === TokenKind.BANG \|\|\n kind === TokenKind.DOLLAR \|\|\n kind === TokenKind.AMP \|\|\n kind === TokenKind.PAREN_L \|\|\n kind === TokenKind.PAREN_R \|\|\n kind === TokenKind.SPREAD \|\|\n kind === TokenKind.COLON \|\|\n kind === TokenKind.EQUALS \|\|\n kind === TokenKind.AT \|\|\n kind === TokenKind.BRACKET_L \|\|\n kind === TokenKind.BRACKET_R \|\|\n kind === TokenKind.BRACE_L \|\|\n kind === TokenKind.PIPE \|\|\n kind === TokenKind.BRACE_R\n );\n}\n/\n A Unicode scalar value is any Unicode code point except surrogate code\n * points. In other words, the inclusive ranges of values 0x0000 to 0xD7FF and\n * 0xE000 to 0x10FFFF.\n \n SourceCharacter ::\n * - \"Any Unicode scalar value\"\n /\n\nfunction isUnicodeScalarValue(code) {\n return (\n (code >= 0x0000 && code <= 0xd7ff) \|\| (code >= 0xe000 && code <= 0x10ffff)\n );\n}\n/\n The GraphQL specification defines source text as a sequence of unicode scalar\n * values (which Unicode defines to exclude surrogate code points). However\n * JavaScript defines strings as a sequence of UTF-16 code units which may\n * include surrogates. A surrogate pair is a valid source character as it\n * encodes a supplementary code point (above U+FFFF), but unpaired surrogate\n * code points are not valid source characters.\n /\n\nfunction isSupplementaryCodePoint(body, location) {\n return (\n isLeadingSurrogate(body.charCodeAt(location)) &&\n isTrailingSurrogate(body.charCodeAt(location + 1))\n );\n}\n\nfunction isLeadingSurrogate(code) {\n return code >= 0xd800 && code <= 0xdbff;\n}\n\nfunction isTrailingSurrogate(code) {\n return code >= 0xdc00 && code <= 0xdfff;\n}\n/\n Prints the code point (or end of file reference) at a given location in a\n * source for use in error messages.\n \n Printable ASCII is printed quoted, while other points are printed in Unicode\n * code point form (ie. U+1234).\n /\n\nfunction printCodePointAt(lexer, location) {\n const code = lexer.source.body.codePointAt(location);\n\n if (code === undefined) {\n return TokenKind.EOF;\n } else if (code >= 0x0020 && code <= 0x007e) {\n // Printable ASCII\n const char = String.fromCodePoint(code);\n return char === '\"' ? \"'\\\"'\" : `\"${char}\"`;\n } // Unicode code point\n\n return 'U+' + code.toString(16).toUpperCase().padStart(4, '0');\n}\n/\n Create a token with line and column location information.\n /\n\nfunction createToken(lexer, kind, start, end, value) {\n const line = lexer.line;\n const col = 1 + start - lexer.lineStart;\n return new Token(kind, start, end, line, col, value);\n}\n/\n Gets the next token from the source starting at the given position.\n \n This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n /\n\nfunction readNextToken(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // SourceCharacter\n\n switch (code) {\n // Ignored ::\n // - UnicodeBOM\n // - WhiteSpace\n // - LineTerminator\n // - Comment\n // - Comma\n //\n // UnicodeBOM :: \"Byte Order Mark (U+FEFF)\"\n //\n // WhiteSpace ::\n // - \"Horizontal Tab (U+0009)\"\n // - \"Space (U+0020)\"\n //\n // Comma :: ,\n case 0xfeff: // <BOM>\n\n case 0x0009: // \\t\n\n case 0x0020: // <space>\n\n case 0x002c:\n // ,\n ++position;\n continue;\n // LineTerminator ::\n // - \"New Line (U+000A)\"\n // - \"Carriage Return (U+000D)\" [lookahead != \"New Line (U+000A)\"]\n // - \"Carriage Return (U+000D)\" \"New Line (U+000A)\"\n\n case 0x000a:\n // \\n\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n continue;\n\n case 0x000d:\n // \\r\n if (body.charCodeAt(position + 1) === 0x000a) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n continue;\n // Comment\n\n case 0x0023:\n // #\n return readComment(lexer, position);\n // Token ::\n // - Punctuator\n // - Name\n // - IntValue\n // - FloatValue\n // - StringValue\n //\n // Punctuator :: one of ! $ & ( ) ... : = @ [ ] { \| }\n\n case 0x0021:\n // !\n return createToken(lexer, TokenKind.BANG, position, position + 1);\n\n case 0x0024:\n // $\n return createToken(lexer, TokenKind.DOLLAR, position, position + 1);\n\n case 0x0026:\n // &\n return createToken(lexer, TokenKind.AMP, position, position + 1);\n\n case 0x0028:\n // (\n return createToken(lexer, TokenKind.PAREN_L, position, position + 1);\n\n case 0x0029:\n // )\n return createToken(lexer, TokenKind.PAREN_R, position, position + 1);\n\n case 0x002e:\n // .\n if (\n body.charCodeAt(position + 1) === 0x002e &&\n body.charCodeAt(position + 2) === 0x002e\n ) {\n return createToken(lexer, TokenKind.SPREAD, position, position + 3);\n }\n\n break;\n\n case 0x003a:\n // :\n return createToken(lexer, TokenKind.COLON, position, position + 1);\n\n case 0x003d:\n // =\n return createToken(lexer, TokenKind.EQUALS, position, position + 1);\n\n case 0x0040:\n // @\n return createToken(lexer, TokenKind.AT, position, position + 1);\n\n case 0x005b:\n // [\n return createToken(lexer, TokenKind.BRACKET_L, position, position + 1);\n\n case 0x005d:\n // ]\n return createToken(lexer, TokenKind.BRACKET_R, position, position + 1);\n\n case 0x007b:\n // {\n return createToken(lexer, TokenKind.BRACE_L, position, position + 1);\n\n case 0x007c:\n // \|\n return createToken(lexer, TokenKind.PIPE, position, position + 1);\n\n case 0x007d:\n // }\n return createToken(lexer, TokenKind.BRACE_R, position, position + 1);\n // StringValue\n\n case 0x0022:\n // \"\n if (\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022\n ) {\n return readBlockString(lexer, position);\n }\n\n return readString(lexer, position);\n } // IntValue \| FloatValue (Digit \| -)\n\n if (isDigit(code) \|\| code === 0x002d) {\n return readNumber(lexer, position, code);\n } // Name\n\n if (isNameStart(code)) {\n return readName(lexer, position);\n }\n\n throw syntaxError(\n lexer.source,\n position,\n code === 0x0027\n ? 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?'\n : isUnicodeScalarValue(code) \|\| isSupplementaryCodePoint(body, position)\n ? `Unexpected character: ${printCodePointAt(lexer, position)}.`\n : `Invalid character: ${printCodePointAt(lexer, position)}.`,\n );\n }\n\n return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);\n}\n/\n Reads a comment token from the source file.\n \n ```\n * Comment :: # CommentChar* [lookahead != CommentChar]\n \n CommentChar :: SourceCharacter but not LineTerminator\n * ```\n /\n\nfunction readComment(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // LineTerminator (\\n \| \\r)\n\n if (code === 0x000a \|\| code === 0x000d) {\n break;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n break;\n }\n }\n\n return createToken(\n lexer,\n TokenKind.COMMENT,\n start,\n position,\n body.slice(start + 1, position),\n );\n}\n/\n Reads a number token from the source file, either a FloatValue or an IntValue\n * depending on whether a FractionalPart or ExponentPart is encountered.\n \n ```\n * IntValue :: IntegerPart [lookahead != {Digit, `.`, NameStart}]\n \n IntegerPart ::\n * - NegativeSign? 0\n * - NegativeSign? NonZeroDigit Digit\n \n * NegativeSign :: -\n \n NonZeroDigit :: Digit but not `0`\n \n FloatValue ::\n * - IntegerPart FractionalPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n * - IntegerPart FractionalPart [lookahead != {Digit, `.`, NameStart}]\n * - IntegerPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n \n FractionalPart :: . Digit+\n \n ExponentPart :: ExponentIndicator Sign? Digit+\n \n ExponentIndicator :: one of `e` `E`\n \n Sign :: one of + -\n * ```\n /\n\nfunction readNumber(lexer, start, firstCode) {\n const body = lexer.source.body;\n let position = start;\n let code = firstCode;\n let isFloat = false; // NegativeSign (-)\n\n if (code === 0x002d) {\n code = body.charCodeAt(++position);\n } // Zero (0)\n\n if (code === 0x0030) {\n code = body.charCodeAt(++position);\n\n if (isDigit(code)) {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid number, unexpected digit after 0: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n } else {\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // Full stop (.)\n\n if (code === 0x002e) {\n isFloat = true;\n code = body.charCodeAt(++position);\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // E e\n\n if (code === 0x0045 \|\| code === 0x0065) {\n isFloat = true;\n code = body.charCodeAt(++position); // + -\n\n if (code === 0x002b \|\| code === 0x002d) {\n code = body.charCodeAt(++position);\n }\n\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // Numbers cannot be followed by . or NameStart\n\n if (code === 0x002e \|\| isNameStart(code)) {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid number, expected digit but got: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n\n return createToken(\n lexer,\n isFloat ? TokenKind.FLOAT : TokenKind.INT,\n start,\n position,\n body.slice(start, position),\n );\n}\n/\n Returns the new position in the source after reading one or more digits.\n /\n\nfunction readDigits(lexer, start, firstCode) {\n if (!isDigit(firstCode)) {\n throw syntaxError(\n lexer.source,\n start,\n `Invalid number, expected digit but got: ${printCodePointAt(\n lexer,\n start,\n )}.`,\n );\n }\n\n const body = lexer.source.body;\n let position = start + 1; // +1 to skip first firstCode\n\n while (isDigit(body.charCodeAt(position))) {\n ++position;\n }\n\n return position;\n}\n/\n Reads a single-quote string token from the source file.\n \n ```\n * StringValue ::\n * - `\"\"` [lookahead != `\"`]\n * - `\"` StringCharacter+ `\"`\n \n StringCharacter ::\n * - SourceCharacter but not `\"` or `\\` or LineTerminator\n * - `\\u` EscapedUnicode\n * - `\\` EscapedCharacter\n \n EscapedUnicode ::\n * - `{` HexDigit+ `}`\n * - HexDigit HexDigit HexDigit HexDigit\n \n EscapedCharacter :: one of `\"` `\\` `/` `b` `f` `n` `r` `t`\n * ```\n /\n\nfunction readString(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n let chunkStart = position;\n let value = '';\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // Closing Quote (\")\n\n if (code === 0x0022) {\n value += body.slice(chunkStart, position);\n return createToken(lexer, TokenKind.STRING, start, position + 1, value);\n } // Escape Sequence (\\)\n\n if (code === 0x005c) {\n value += body.slice(chunkStart, position);\n const escape =\n body.charCodeAt(position + 1) === 0x0075 // u\n ? body.charCodeAt(position + 2) === 0x007b // {\n ? readEscapedUnicodeVariableWidth(lexer, position)\n : readEscapedUnicodeFixedWidth(lexer, position)\n : readEscapedCharacter(lexer, position);\n value += escape.value;\n position += escape.size;\n chunkStart = position;\n continue;\n } // LineTerminator (\\n \| \\r)\n\n if (code === 0x000a \|\| code === 0x000d) {\n break;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character within String: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n }\n\n throw syntaxError(lexer.source, position, 'Unterminated string.');\n} // The string value and lexed size of an escape sequence.\n\nfunction readEscapedUnicodeVariableWidth(lexer, position) {\n const body = lexer.source.body;\n let point = 0;\n let size = 3; // Cannot be larger than 12 chars (\\u{00000000}).\n\n while (size < 12) {\n const code = body.charCodeAt(position + size++); // Closing Brace (})\n\n if (code === 0x007d) {\n // Must be at least 5 chars (\\u{0}) and encode a Unicode scalar value.\n if (size < 5 \|\| !isUnicodeScalarValue(point)) {\n break;\n }\n\n return {\n value: String.fromCodePoint(point),\n size,\n };\n } // Append this hex digit to the code point.\n\n point = (point << 4) \| readHexDigit(code);\n\n if (point < 0) {\n break;\n }\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid Unicode escape sequence: \"${body.slice(\n position,\n position + size,\n )}\".`,\n );\n}\n\nfunction readEscapedUnicodeFixedWidth(lexer, position) {\n const body = lexer.source.body;\n const code = read16BitHexCode(body, position + 2);\n\n if (isUnicodeScalarValue(code)) {\n return {\n value: String.fromCodePoint(code),\n size: 6,\n };\n } // GraphQL allows JSON-style surrogate pair escape sequences, but only when\n // a valid pair is formed.\n\n if (isLeadingSurrogate(code)) {\n // \\u\n if (\n body.charCodeAt(position + 6) === 0x005c &&\n body.charCodeAt(position + 7) === 0x0075\n ) {\n const trailingCode = read16BitHexCode(body, position + 8);\n\n if (isTrailingSurrogate(trailingCode)) {\n // JavaScript defines strings as a sequence of UTF-16 code units and\n // encodes Unicode code points above U+FFFF using a surrogate pair of\n // code units. Since this is a surrogate pair escape sequence, just\n // include both codes into the JavaScript string value. Had JavaScript\n // not been internally based on UTF-16, then this surrogate pair would\n // be decoded to retrieve the supplementary code point.\n return {\n value: String.fromCodePoint(code, trailingCode),\n size: 12,\n };\n }\n }\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid Unicode escape sequence: \"${body.slice(position, position + 6)}\".`,\n );\n}\n/\n Reads four hexadecimal characters and returns the positive integer that 16bit\n * hexadecimal string represents. For example, \"000f\" will return 15, and \"dead\"\n * will return 57005.\n \n Returns a negative number if any char was not a valid hexadecimal digit.\n /\n\nfunction read16BitHexCode(body, position) {\n // readHexDigit() returns -1 on error. ORing a negative value with any other\n // value always produces a negative value.\n return (\n (readHexDigit(body.charCodeAt(position)) << 12) \|\n (readHexDigit(body.charCodeAt(position + 1)) << 8) \|\n (readHexDigit(body.charCodeAt(position + 2)) << 4) \|\n readHexDigit(body.charCodeAt(position + 3))\n );\n}\n/\n Reads a hexadecimal character and returns its positive integer value (0-15).\n \n '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n \n Returns -1 if the provided character code was not a valid hexadecimal digit.\n \n HexDigit :: one of\n * - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * - `A` `B` `C` `D` `E` `F`\n * - `a` `b` `c` `d` `e` `f`\n /\n\nfunction readHexDigit(code) {\n return code >= 0x0030 && code <= 0x0039 // 0-9\n ? code - 0x0030\n : code >= 0x0041 && code <= 0x0046 // A-F\n ? code - 0x0037\n : code >= 0x0061 && code <= 0x0066 // a-f\n ? code - 0x0057\n : -1;\n}\n/\n \| Escaped Character \| Code Point \| Character Name \|\n * \| ----------------- \| ---------- \| ---------------------------- \|\n * \| `\"` \| U+0022 \| double quote \|\n * \| `\\` \| U+005C \| reverse solidus (back slash) \|\n * \| `/` \| U+002F \| solidus (forward slash) \|\n * \| `b` \| U+0008 \| backspace \|\n * \| `f` \| U+000C \| form feed \|\n * \| `n` \| U+000A \| line feed (new line) \|\n * \| `r` \| U+000D \| carriage return \|\n * \| `t` \| U+0009 \| horizontal tab \|\n /\n\nfunction readEscapedCharacter(lexer, position) {\n const body = lexer.source.body;\n const code = body.charCodeAt(position + 1);\n\n switch (code) {\n case 0x0022:\n // \"\n return {\n value: '\\u0022',\n size: 2,\n };\n\n case 0x005c:\n // \\\n return {\n value: '\\u005c',\n size: 2,\n };\n\n case 0x002f:\n // /\n return {\n value: '\\u002f',\n size: 2,\n };\n\n case 0x0062:\n // b\n return {\n value: '\\u0008',\n size: 2,\n };\n\n case 0x0066:\n // f\n return {\n value: '\\u000c',\n size: 2,\n };\n\n case 0x006e:\n // n\n return {\n value: '\\u000a',\n size: 2,\n };\n\n case 0x0072:\n // r\n return {\n value: '\\u000d',\n size: 2,\n };\n\n case 0x0074:\n // t\n return {\n value: '\\u0009',\n size: 2,\n };\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character escape sequence: \"${body.slice(\n position,\n position + 2,\n )}\".`,\n );\n}\n/\n Reads a block string token from the source file.\n \n ```\n * StringValue ::\n * - `\"\"\"` BlockStringCharacter* `\"\"\"`\n \n BlockStringCharacter ::\n * - SourceCharacter but not `\"\"\"` or `\\\"\"\"`\n * - `\\\"\"\"`\n * ```\n /\n\nfunction readBlockString(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let lineStart = lexer.lineStart;\n let position = start + 3;\n let chunkStart = position;\n let currentLine = '';\n const blockLines = [];\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n if (\n code === 0x0022 &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022\n ) {\n currentLine += body.slice(chunkStart, position);\n blockLines.push(currentLine);\n const token = createToken(\n lexer,\n TokenKind.BLOCK_STRING,\n start,\n position + 3, // Return a string of the lines joined with U+000A.\n dedentBlockStringLines(blockLines).join('\\n'),\n );\n lexer.line += blockLines.length - 1;\n lexer.lineStart = lineStart;\n return token;\n } // Escaped Triple-Quote (\\\"\"\")\n\n if (\n code === 0x005c &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022 &&\n body.charCodeAt(position + 3) === 0x0022\n ) {\n currentLine += body.slice(chunkStart, position);\n chunkStart = position + 1; // skip only slash\n\n position += 4;\n continue;\n } // LineTerminator\n\n if (code === 0x000a \|\| code === 0x000d) {\n currentLine += body.slice(chunkStart, position);\n blockLines.push(currentLine);\n\n if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n position += 2;\n } else {\n ++position;\n }\n\n currentLine = '';\n chunkStart = position;\n lineStart = position;\n continue;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character within String: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n }\n\n throw syntaxError(lexer.source, position, 'Unterminated string.');\n}\n/\n Reads an alphanumeric + underscore name from the source.\n \n ```\n * Name ::\n * - NameStart NameContinue* [lookahead != NameContinue]\n * ```\n /\n\nfunction readName(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position);\n\n if (isNameContinue(code)) {\n ++position;\n } else {\n break;\n }\n }\n\n return createToken(\n lexer,\n TokenKind.NAME,\n start,\n position,\n body.slice(start, position),\n );\n}\n","const MAX_ARRAY_LENGTH = 10;\nconst MAX_RECURSIVE_DEPTH = 2;\n/\n Used to print values in error messages.\n /\n\nexport function inspect(value) {\n return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n switch (typeof value) {\n case 'string':\n return JSON.stringify(value);\n\n case 'function':\n return value.name ? `[function ${value.name}]` : '[function]';\n\n case 'object':\n return formatObjectValue(value, seenValues);\n\n default:\n return String(value);\n }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n if (value === null) {\n return 'null';\n }\n\n if (previouslySeenValues.includes(value)) {\n return '[Circular]';\n }\n\n const seenValues = [...previouslySeenValues, value];\n\n if (isJSONable(value)) {\n const jsonValue = value.toJSON(); // check for infinite recursion\n\n if (jsonValue !== value) {\n return typeof jsonValue === 'string'\n ? jsonValue\n : formatValue(jsonValue, seenValues);\n }\n } else if (Array.isArray(value)) {\n return formatArray(value, seenValues);\n }\n\n return formatObject(value, seenValues);\n}\n\nfunction isJSONable(value) {\n return typeof value.toJSON === 'function';\n}\n\nfunction formatObject(object, seenValues) {\n const entries = Object.entries(object);\n\n if (entries.length === 0) {\n return '{}';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[' + getObjectTag(object) + ']';\n }\n\n const properties = entries.map(\n ([key, value]) => key + ': ' + formatValue(value, seenValues),\n );\n return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n if (array.length === 0) {\n return '[]';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[Array]';\n }\n\n const len = Math.min(MAX_ARRAY_LENGTH, array.length);\n const remaining = array.length - len;\n const items = [];\n\n for (let i = 0; i < len; ++i) {\n items.push(formatValue(array[i], seenValues));\n }\n\n if (remaining === 1) {\n items.push('... 1 more item');\n } else if (remaining > 1) {\n items.push(`... ${remaining} more items`);\n }\n\n return '[' + items.join(', ') + ']';\n}\n\nfunction getObjectTag(object) {\n const tag = Object.prototype.toString\n .call(object)\n .replace(/^\\[object /, '')\n .replace(/]$/, '');\n\n if (tag === 'Object' && typeof object.constructor === 'function') {\n const name = object.constructor.name;\n\n if (typeof name === 'string' && name !== '') {\n return name;\n }\n }\n\n return tag;\n}\n","import { inspect } from './inspect.mjs';\n/\n A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n * See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n * See: https://webpack.js.org/guides/production/\n /\n\nexport const instanceOf =\n / c8 ignore next 6 /\n // FIXME: https://github.com/graphql/graphql-js/issues/2317\n // eslint-disable-next-line no-undef\n process.env.NODE_ENV === 'production'\n ? function instanceOf(value, constructor) {\n return value instanceof constructor;\n }\n : function instanceOf(value, constructor) {\n if (value instanceof constructor) {\n return true;\n }\n\n if (typeof value === 'object' && value !== null) {\n var _value$constructor;\n\n // Prefer Symbol.toStringTag since it is immune to minification.\n const className = constructor.prototype[Symbol.toStringTag];\n const valueClassName = // We still need to support constructor's name to detect conflicts with older versions of this library.\n Symbol.toStringTag in value // @ts-expect-error TS bug see, https://github.com/microsoft/TypeScript/issues/38009\n ? value[Symbol.toStringTag]\n : (_value$constructor = value.constructor) === null \|\|\n _value$constructor === void 0\n ? void 0\n : _value$constructor.name;\n\n if (className === valueClassName) {\n const stringifiedValue = inspect(value);\n throw new Error(`Cannot use ${className} \"${stringifiedValue}\" from another module or realm.\n\nEnsure that there is only one instance of \"graphql\" in the node_modules\ndirectory. If different versions of \"graphql\" are the dependencies of other\nrelied on modules, use \"resolutions\" to ensure only one version is installed.\n\nhttps://yarnpkg.com/en/docs/selective-version-resolutions\n\nDuplicate \"graphql\" modules cannot be used at the same time since different\nversions may have different capabilities and behavior. The data from one\nversion used in the function from another could produce confusing and\nspurious results.`);\n }\n }\n\n return false;\n };\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\n\n/\n A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n /\nexport class Source {\n constructor(\n body,\n name = 'GraphQL request',\n locationOffset = {\n line: 1,\n column: 1,\n },\n ) {\n typeof body === 'string' \|\|\n devAssert(false, `Body must be a string. Received: ${inspect(body)}.`);\n this.body = body;\n this.name = name;\n this.locationOffset = locationOffset;\n this.locationOffset.line > 0 \|\|\n devAssert(\n false,\n 'line in locationOffset is 1-indexed and must be positive.',\n );\n this.locationOffset.column > 0 \|\|\n devAssert(\n false,\n 'column in locationOffset is 1-indexed and must be positive.',\n );\n }\n\n get [Symbol.toStringTag]() {\n return 'Source';\n }\n}\n/\n Test if the given value is a Source object.\n \n @internal\n /\n\nexport function isSource(source) {\n return instanceOf(source, Source);\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Location, OperationTypeNode } from './ast.mjs';\nimport { DirectiveLocation } from './directiveLocation.mjs';\nimport { Kind } from './kinds.mjs';\nimport { isPunctuatorTokenKind, Lexer } from './lexer.mjs';\nimport { isSource, Source } from './source.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/\n Configuration options to control parser behavior\n /\n\n/\n Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n /\nexport function parse(source, options) {\n const parser = new Parser(source, options);\n return parser.parseDocument();\n}\n/\n Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n \n This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n \n Consider providing the results to the utility function: valueFromAST().\n /\n\nexport function parseValue(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const value = parser.parseValueLiteral(false);\n parser.expectToken(TokenKind.EOF);\n return value;\n}\n/\n Similar to parseValue(), but raises a parse error if it encounters a\n * variable. The return type will be a constant value.\n /\n\nexport function parseConstValue(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const value = parser.parseConstValueLiteral();\n parser.expectToken(TokenKind.EOF);\n return value;\n}\n/\n Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n \n This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n \n Consider providing the results to the utility function: typeFromAST().\n /\n\nexport function parseType(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const type = parser.parseTypeReference();\n parser.expectToken(TokenKind.EOF);\n return type;\n}\n/\n This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n \n It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n \n @internal\n /\n\nexport class Parser {\n constructor(source, options = {}) {\n const sourceObj = isSource(source) ? source : new Source(source);\n this._lexer = new Lexer(sourceObj);\n this._options = options;\n this._tokenCounter = 0;\n }\n /\n Converts a name lex token into a name parse node.\n /\n\n parseName() {\n const token = this.expectToken(TokenKind.NAME);\n return this.node(token, {\n kind: Kind.NAME,\n value: token.value,\n });\n } // Implements the parsing rules in the Document section.\n\n /\n Document : Definition+\n /\n\n parseDocument() {\n return this.node(this._lexer.token, {\n kind: Kind.DOCUMENT,\n definitions: this.many(\n TokenKind.SOF,\n this.parseDefinition,\n TokenKind.EOF,\n ),\n });\n }\n /\n Definition :\n * - ExecutableDefinition\n * - TypeSystemDefinition\n * - TypeSystemExtension\n \n ExecutableDefinition :\n * - OperationDefinition\n * - FragmentDefinition\n \n TypeSystemDefinition :\n * - SchemaDefinition\n * - TypeDefinition\n * - DirectiveDefinition\n \n TypeDefinition :\n * - ScalarTypeDefinition\n * - ObjectTypeDefinition\n * - InterfaceTypeDefinition\n * - UnionTypeDefinition\n * - EnumTypeDefinition\n * - InputObjectTypeDefinition\n /\n\n parseDefinition() {\n if (this.peek(TokenKind.BRACE_L)) {\n return this.parseOperationDefinition();\n } // Many definitions begin with a description and require a lookahead.\n\n const hasDescription = this.peekDescription();\n const keywordToken = hasDescription\n ? this._lexer.lookahead()\n : this._lexer.token;\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaDefinition();\n\n case 'scalar':\n return this.parseScalarTypeDefinition();\n\n case 'type':\n return this.parseObjectTypeDefinition();\n\n case 'interface':\n return this.parseInterfaceTypeDefinition();\n\n case 'union':\n return this.parseUnionTypeDefinition();\n\n case 'enum':\n return this.parseEnumTypeDefinition();\n\n case 'input':\n return this.parseInputObjectTypeDefinition();\n\n case 'directive':\n return this.parseDirectiveDefinition();\n }\n\n if (hasDescription) {\n throw syntaxError(\n this._lexer.source,\n this._lexer.token.start,\n 'Unexpected description, descriptions are supported only on type definitions.',\n );\n }\n\n switch (keywordToken.value) {\n case 'query':\n case 'mutation':\n case 'subscription':\n return this.parseOperationDefinition();\n\n case 'fragment':\n return this.parseFragmentDefinition();\n\n case 'extend':\n return this.parseTypeSystemExtension();\n }\n }\n\n throw this.unexpected(keywordToken);\n } // Implements the parsing rules in the Operations section.\n\n /\n OperationDefinition :\n * - SelectionSet\n * - OperationType Name? VariableDefinitions? Directives? SelectionSet\n /\n\n parseOperationDefinition() {\n const start = this._lexer.token;\n\n if (this.peek(TokenKind.BRACE_L)) {\n return this.node(start, {\n kind: Kind.OPERATION_DEFINITION,\n operation: OperationTypeNode.QUERY,\n name: undefined,\n variableDefinitions: [],\n directives: [],\n selectionSet: this.parseSelectionSet(),\n });\n }\n\n const operation = this.parseOperationType();\n let name;\n\n if (this.peek(TokenKind.NAME)) {\n name = this.parseName();\n }\n\n return this.node(start, {\n kind: Kind.OPERATION_DEFINITION,\n operation,\n name,\n variableDefinitions: this.parseVariableDefinitions(),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n OperationType : one of query mutation subscription\n /\n\n parseOperationType() {\n const operationToken = this.expectToken(TokenKind.NAME);\n\n switch (operationToken.value) {\n case 'query':\n return OperationTypeNode.QUERY;\n\n case 'mutation':\n return OperationTypeNode.MUTATION;\n\n case 'subscription':\n return OperationTypeNode.SUBSCRIPTION;\n }\n\n throw this.unexpected(operationToken);\n }\n /\n VariableDefinitions : ( VariableDefinition+ )\n /\n\n parseVariableDefinitions() {\n return this.optionalMany(\n TokenKind.PAREN_L,\n this.parseVariableDefinition,\n TokenKind.PAREN_R,\n );\n }\n /\n VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n /\n\n parseVariableDefinition() {\n return this.node(this._lexer.token, {\n kind: Kind.VARIABLE_DEFINITION,\n variable: this.parseVariable(),\n type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n defaultValue: this.expectOptionalToken(TokenKind.EQUALS)\n ? this.parseConstValueLiteral()\n : undefined,\n directives: this.parseConstDirectives(),\n });\n }\n /\n Variable : $ Name\n /\n\n parseVariable() {\n const start = this._lexer.token;\n this.expectToken(TokenKind.DOLLAR);\n return this.node(start, {\n kind: Kind.VARIABLE,\n name: this.parseName(),\n });\n }\n /\n ```\n * SelectionSet : { Selection+ }\n * ```\n /\n\n parseSelectionSet() {\n return this.node(this._lexer.token, {\n kind: Kind.SELECTION_SET,\n selections: this.many(\n TokenKind.BRACE_L,\n this.parseSelection,\n TokenKind.BRACE_R,\n ),\n });\n }\n /\n Selection :\n * - Field\n * - FragmentSpread\n * - InlineFragment\n /\n\n parseSelection() {\n return this.peek(TokenKind.SPREAD)\n ? this.parseFragment()\n : this.parseField();\n }\n /\n Field : Alias? Name Arguments? Directives? SelectionSet?\n \n Alias : Name :\n /\n\n parseField() {\n const start = this._lexer.token;\n const nameOrAlias = this.parseName();\n let alias;\n let name;\n\n if (this.expectOptionalToken(TokenKind.COLON)) {\n alias = nameOrAlias;\n name = this.parseName();\n } else {\n name = nameOrAlias;\n }\n\n return this.node(start, {\n kind: Kind.FIELD,\n alias,\n name,\n arguments: this.parseArguments(false),\n directives: this.parseDirectives(false),\n selectionSet: this.peek(TokenKind.BRACE_L)\n ? this.parseSelectionSet()\n : undefined,\n });\n }\n /\n Arguments[Const] : ( Argument[?Const]+ )\n /\n\n parseArguments(isConst) {\n const item = isConst ? this.parseConstArgument : this.parseArgument;\n return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n }\n /\n Argument[Const] : Name : Value[?Const]\n /\n\n parseArgument(isConst = false) {\n const start = this._lexer.token;\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return this.node(start, {\n kind: Kind.ARGUMENT,\n name,\n value: this.parseValueLiteral(isConst),\n });\n }\n\n parseConstArgument() {\n return this.parseArgument(true);\n } // Implements the parsing rules in the Fragments section.\n\n /\n Corresponds to both FragmentSpread and InlineFragment in the spec.\n \n FragmentSpread : ... FragmentName Directives?\n \n InlineFragment : ... TypeCondition? Directives? SelectionSet\n /\n\n parseFragment() {\n const start = this._lexer.token;\n this.expectToken(TokenKind.SPREAD);\n const hasTypeCondition = this.expectOptionalKeyword('on');\n\n if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n return this.node(start, {\n kind: Kind.FRAGMENT_SPREAD,\n name: this.parseFragmentName(),\n directives: this.parseDirectives(false),\n });\n }\n\n return this.node(start, {\n kind: Kind.INLINE_FRAGMENT,\n typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n FragmentDefinition :\n * - fragment FragmentName on TypeCondition Directives? SelectionSet\n \n TypeCondition : NamedType\n /\n\n parseFragmentDefinition() {\n const start = this._lexer.token;\n this.expectKeyword('fragment'); // Legacy support for defining variables within fragments changes\n // the grammar of FragmentDefinition:\n // - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n if (this._options.allowLegacyFragmentVariables === true) {\n return this.node(start, {\n kind: Kind.FRAGMENT_DEFINITION,\n name: this.parseFragmentName(),\n variableDefinitions: this.parseVariableDefinitions(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n\n return this.node(start, {\n kind: Kind.FRAGMENT_DEFINITION,\n name: this.parseFragmentName(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n FragmentName : Name but not `on`\n /\n\n parseFragmentName() {\n if (this._lexer.token.value === 'on') {\n throw this.unexpected();\n }\n\n return this.parseName();\n } // Implements the parsing rules in the Values section.\n\n /\n Value[Const] :\n * - [~Const] Variable\n * - IntValue\n * - FloatValue\n * - StringValue\n * - BooleanValue\n * - NullValue\n * - EnumValue\n * - ListValue[?Const]\n * - ObjectValue[?Const]\n \n BooleanValue : one of `true` `false`\n \n NullValue : `null`\n \n EnumValue : Name but not `true`, `false` or `null`\n /\n\n parseValueLiteral(isConst) {\n const token = this._lexer.token;\n\n switch (token.kind) {\n case TokenKind.BRACKET_L:\n return this.parseList(isConst);\n\n case TokenKind.BRACE_L:\n return this.parseObject(isConst);\n\n case TokenKind.INT:\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.INT,\n value: token.value,\n });\n\n case TokenKind.FLOAT:\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.FLOAT,\n value: token.value,\n });\n\n case TokenKind.STRING:\n case TokenKind.BLOCK_STRING:\n return this.parseStringLiteral();\n\n case TokenKind.NAME:\n this.advanceLexer();\n\n switch (token.value) {\n case 'true':\n return this.node(token, {\n kind: Kind.BOOLEAN,\n value: true,\n });\n\n case 'false':\n return this.node(token, {\n kind: Kind.BOOLEAN,\n value: false,\n });\n\n case 'null':\n return this.node(token, {\n kind: Kind.NULL,\n });\n\n default:\n return this.node(token, {\n kind: Kind.ENUM,\n value: token.value,\n });\n }\n\n case TokenKind.DOLLAR:\n if (isConst) {\n this.expectToken(TokenKind.DOLLAR);\n\n if (this._lexer.token.kind === TokenKind.NAME) {\n const varName = this._lexer.token.value;\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Unexpected variable \"$${varName}\" in constant value.`,\n );\n } else {\n throw this.unexpected(token);\n }\n }\n\n return this.parseVariable();\n\n default:\n throw this.unexpected();\n }\n }\n\n parseConstValueLiteral() {\n return this.parseValueLiteral(true);\n }\n\n parseStringLiteral() {\n const token = this._lexer.token;\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.STRING,\n value: token.value,\n block: token.kind === TokenKind.BLOCK_STRING,\n });\n }\n /\n ListValue[Const] :\n * - [ ]\n * - [ Value[?Const]+ ]\n /\n\n parseList(isConst) {\n const item = () => this.parseValueLiteral(isConst);\n\n return this.node(this._lexer.token, {\n kind: Kind.LIST,\n values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n });\n }\n /\n ```\n * ObjectValue[Const] :\n * - { }\n * - { ObjectField[?Const]+ }\n * ```\n /\n\n parseObject(isConst) {\n const item = () => this.parseObjectField(isConst);\n\n return this.node(this._lexer.token, {\n kind: Kind.OBJECT,\n fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n });\n }\n /\n ObjectField[Const] : Name : Value[?Const]\n /\n\n parseObjectField(isConst) {\n const start = this._lexer.token;\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return this.node(start, {\n kind: Kind.OBJECT_FIELD,\n name,\n value: this.parseValueLiteral(isConst),\n });\n } // Implements the parsing rules in the Directives section.\n\n /\n Directives[Const] : Directive[?Const]+\n /\n\n parseDirectives(isConst) {\n const directives = [];\n\n while (this.peek(TokenKind.AT)) {\n directives.push(this.parseDirective(isConst));\n }\n\n return directives;\n }\n\n parseConstDirectives() {\n return this.parseDirectives(true);\n }\n /\n ```\n * Directive[Const] : @ Name Arguments[?Const]?\n * ```\n /\n\n parseDirective(isConst) {\n const start = this._lexer.token;\n this.expectToken(TokenKind.AT);\n return this.node(start, {\n kind: Kind.DIRECTIVE,\n name: this.parseName(),\n arguments: this.parseArguments(isConst),\n });\n } // Implements the parsing rules in the Types section.\n\n /\n Type :\n * - NamedType\n * - ListType\n * - NonNullType\n /\n\n parseTypeReference() {\n const start = this._lexer.token;\n let type;\n\n if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n const innerType = this.parseTypeReference();\n this.expectToken(TokenKind.BRACKET_R);\n type = this.node(start, {\n kind: Kind.LIST_TYPE,\n type: innerType,\n });\n } else {\n type = this.parseNamedType();\n }\n\n if (this.expectOptionalToken(TokenKind.BANG)) {\n return this.node(start, {\n kind: Kind.NON_NULL_TYPE,\n type,\n });\n }\n\n return type;\n }\n /\n NamedType : Name\n /\n\n parseNamedType() {\n return this.node(this._lexer.token, {\n kind: Kind.NAMED_TYPE,\n name: this.parseName(),\n });\n } // Implements the parsing rules in the Type Definition section.\n\n peekDescription() {\n return this.peek(TokenKind.STRING) \|\| this.peek(TokenKind.BLOCK_STRING);\n }\n /\n Description : StringValue\n /\n\n parseDescription() {\n if (this.peekDescription()) {\n return this.parseStringLiteral();\n }\n }\n /\n ```\n * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n * ```\n /\n\n parseSchemaDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('schema');\n const directives = this.parseConstDirectives();\n const operationTypes = this.many(\n TokenKind.BRACE_L,\n this.parseOperationTypeDefinition,\n TokenKind.BRACE_R,\n );\n return this.node(start, {\n kind: Kind.SCHEMA_DEFINITION,\n description,\n directives,\n operationTypes,\n });\n }\n /\n OperationTypeDefinition : OperationType : NamedType\n /\n\n parseOperationTypeDefinition() {\n const start = this._lexer.token;\n const operation = this.parseOperationType();\n this.expectToken(TokenKind.COLON);\n const type = this.parseNamedType();\n return this.node(start, {\n kind: Kind.OPERATION_TYPE_DEFINITION,\n operation,\n type,\n });\n }\n /\n ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n /\n\n parseScalarTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_DEFINITION,\n description,\n name,\n directives,\n });\n }\n /\n ObjectTypeDefinition :\n * Description?\n * type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n /\n\n parseObjectTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('type');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n return this.node(start, {\n kind: Kind.OBJECT_TYPE_DEFINITION,\n description,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n ImplementsInterfaces :\n * - implements `&`? NamedType\n * - ImplementsInterfaces & NamedType\n /\n\n parseImplementsInterfaces() {\n return this.expectOptionalKeyword('implements')\n ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)\n : [];\n }\n /\n ```\n * FieldsDefinition : { FieldDefinition+ }\n * ```\n /\n\n parseFieldsDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseFieldDefinition,\n TokenKind.BRACE_R,\n );\n }\n /\n FieldDefinition :\n * - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n /\n\n parseFieldDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseName();\n const args = this.parseArgumentDefs();\n this.expectToken(TokenKind.COLON);\n const type = this.parseTypeReference();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.FIELD_DEFINITION,\n description,\n name,\n arguments: args,\n type,\n directives,\n });\n }\n /\n ArgumentsDefinition : ( InputValueDefinition+ )\n /\n\n parseArgumentDefs() {\n return this.optionalMany(\n TokenKind.PAREN_L,\n this.parseInputValueDef,\n TokenKind.PAREN_R,\n );\n }\n /\n InputValueDefinition :\n * - Description? Name : Type DefaultValue? Directives[Const]?\n /\n\n parseInputValueDef() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n const type = this.parseTypeReference();\n let defaultValue;\n\n if (this.expectOptionalToken(TokenKind.EQUALS)) {\n defaultValue = this.parseConstValueLiteral();\n }\n\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.INPUT_VALUE_DEFINITION,\n description,\n name,\n type,\n defaultValue,\n directives,\n });\n }\n /\n InterfaceTypeDefinition :\n * - Description? interface Name Directives[Const]? FieldsDefinition?\n /\n\n parseInterfaceTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('interface');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n return this.node(start, {\n kind: Kind.INTERFACE_TYPE_DEFINITION,\n description,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n UnionTypeDefinition :\n * - Description? union Name Directives[Const]? UnionMemberTypes?\n /\n\n parseUnionTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('union');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const types = this.parseUnionMemberTypes();\n return this.node(start, {\n kind: Kind.UNION_TYPE_DEFINITION,\n description,\n name,\n directives,\n types,\n });\n }\n /\n UnionMemberTypes :\n * - = `\|`? NamedType\n * - UnionMemberTypes \| NamedType\n /\n\n parseUnionMemberTypes() {\n return this.expectOptionalToken(TokenKind.EQUALS)\n ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)\n : [];\n }\n /\n EnumTypeDefinition :\n * - Description? enum Name Directives[Const]? EnumValuesDefinition?\n /\n\n parseEnumTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('enum');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const values = this.parseEnumValuesDefinition();\n return this.node(start, {\n kind: Kind.ENUM_TYPE_DEFINITION,\n description,\n name,\n directives,\n values,\n });\n }\n /\n ```\n * EnumValuesDefinition : { EnumValueDefinition+ }\n * ```\n /\n\n parseEnumValuesDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseEnumValueDefinition,\n TokenKind.BRACE_R,\n );\n }\n /\n EnumValueDefinition : Description? EnumValue Directives[Const]?\n /\n\n parseEnumValueDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseEnumValueName();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.ENUM_VALUE_DEFINITION,\n description,\n name,\n directives,\n });\n }\n /\n EnumValue : Name but not `true`, `false` or `null`\n /\n\n parseEnumValueName() {\n if (\n this._lexer.token.value === 'true' \|\|\n this._lexer.token.value === 'false' \|\|\n this._lexer.token.value === 'null'\n ) {\n throw syntaxError(\n this._lexer.source,\n this._lexer.token.start,\n `${getTokenDesc(\n this._lexer.token,\n )} is reserved and cannot be used for an enum value.`,\n );\n }\n\n return this.parseName();\n }\n /\n InputObjectTypeDefinition :\n * - Description? input Name Directives[Const]? InputFieldsDefinition?\n /\n\n parseInputObjectTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('input');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const fields = this.parseInputFieldsDefinition();\n return this.node(start, {\n kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n description,\n name,\n directives,\n fields,\n });\n }\n /\n ```\n * InputFieldsDefinition : { InputValueDefinition+ }\n * ```\n /\n\n parseInputFieldsDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseInputValueDef,\n TokenKind.BRACE_R,\n );\n }\n /\n TypeSystemExtension :\n * - SchemaExtension\n * - TypeExtension\n \n TypeExtension :\n * - ScalarTypeExtension\n * - ObjectTypeExtension\n * - InterfaceTypeExtension\n * - UnionTypeExtension\n * - EnumTypeExtension\n * - InputObjectTypeDefinition\n /\n\n parseTypeSystemExtension() {\n const keywordToken = this._lexer.lookahead();\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaExtension();\n\n case 'scalar':\n return this.parseScalarTypeExtension();\n\n case 'type':\n return this.parseObjectTypeExtension();\n\n case 'interface':\n return this.parseInterfaceTypeExtension();\n\n case 'union':\n return this.parseUnionTypeExtension();\n\n case 'enum':\n return this.parseEnumTypeExtension();\n\n case 'input':\n return this.parseInputObjectTypeExtension();\n }\n }\n\n throw this.unexpected(keywordToken);\n }\n /\n ```\n * SchemaExtension :\n * - extend schema Directives[Const]? { OperationTypeDefinition+ }\n * - extend schema Directives[Const]\n * ```\n /\n\n parseSchemaExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('schema');\n const directives = this.parseConstDirectives();\n const operationTypes = this.optionalMany(\n TokenKind.BRACE_L,\n this.parseOperationTypeDefinition,\n TokenKind.BRACE_R,\n );\n\n if (directives.length === 0 && operationTypes.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.SCHEMA_EXTENSION,\n directives,\n operationTypes,\n });\n }\n /\n ScalarTypeExtension :\n * - extend scalar Name Directives[Const]\n /\n\n parseScalarTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n\n if (directives.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_EXTENSION,\n name,\n directives,\n });\n }\n /\n ObjectTypeExtension :\n * - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend type Name ImplementsInterfaces? Directives[Const]\n * - extend type Name ImplementsInterfaces\n /\n\n parseObjectTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('type');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n\n if (\n interfaces.length === 0 &&\n directives.length === 0 &&\n fields.length === 0\n ) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.OBJECT_TYPE_EXTENSION,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n InterfaceTypeExtension :\n * - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend interface Name ImplementsInterfaces? Directives[Const]\n * - extend interface Name ImplementsInterfaces\n /\n\n parseInterfaceTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('interface');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n\n if (\n interfaces.length === 0 &&\n directives.length === 0 &&\n fields.length === 0\n ) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.INTERFACE_TYPE_EXTENSION,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n UnionTypeExtension :\n * - extend union Name Directives[Const]? UnionMemberTypes\n * - extend union Name Directives[Const]\n /\n\n parseUnionTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('union');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const types = this.parseUnionMemberTypes();\n\n if (directives.length === 0 && types.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.UNION_TYPE_EXTENSION,\n name,\n directives,\n types,\n });\n }\n /\n EnumTypeExtension :\n * - extend enum Name Directives[Const]? EnumValuesDefinition\n * - extend enum Name Directives[Const]\n /\n\n parseEnumTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('enum');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const values = this.parseEnumValuesDefinition();\n\n if (directives.length === 0 && values.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.ENUM_TYPE_EXTENSION,\n name,\n directives,\n values,\n });\n }\n /\n InputObjectTypeExtension :\n * - extend input Name Directives[Const]? InputFieldsDefinition\n * - extend input Name Directives[Const]\n /\n\n parseInputObjectTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('input');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const fields = this.parseInputFieldsDefinition();\n\n if (directives.length === 0 && fields.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n name,\n directives,\n fields,\n });\n }\n /\n ```\n * DirectiveDefinition :\n * - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n * ```\n /\n\n parseDirectiveDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('directive');\n this.expectToken(TokenKind.AT);\n const name = this.parseName();\n const args = this.parseArgumentDefs();\n const repeatable = this.expectOptionalKeyword('repeatable');\n this.expectKeyword('on');\n const locations = this.parseDirectiveLocations();\n return this.node(start, {\n kind: Kind.DIRECTIVE_DEFINITION,\n description,\n name,\n arguments: args,\n repeatable,\n locations,\n });\n }\n /\n DirectiveLocations :\n * - `\|`? DirectiveLocation\n * - DirectiveLocations \| DirectiveLocation\n /\n\n parseDirectiveLocations() {\n return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n }\n /\n * DirectiveLocation :\n * - ExecutableDirectiveLocation\n * - TypeSystemDirectiveLocation\n \n ExecutableDirectiveLocation : one of\n * `QUERY`\n * `MUTATION`\n * `SUBSCRIPTION`\n * `FIELD`\n * `FRAGMENT_DEFINITION`\n * `FRAGMENT_SPREAD`\n * `INLINE_FRAGMENT`\n \n TypeSystemDirectiveLocation : one of\n * `SCHEMA`\n * `SCALAR`\n * `OBJECT`\n * `FIELD_DEFINITION`\n * `ARGUMENT_DEFINITION`\n * `INTERFACE`\n * `UNION`\n * `ENUM`\n * `ENUM_VALUE`\n * `INPUT_OBJECT`\n * `INPUT_FIELD_DEFINITION`\n /\n\n parseDirectiveLocation() {\n const start = this._lexer.token;\n const name = this.parseName();\n\n if (Object.prototype.hasOwnProperty.call(DirectiveLocation, name.value)) {\n return name;\n }\n\n throw this.unexpected(start);\n } // Core parsing utility functions\n\n /\n Returns a node that, if configured to do so, sets a \"loc\" field as a\n * location object, used to identify the place in the source that created a\n * given parsed object.\n /\n\n node(startToken, node) {\n if (this._options.noLocation !== true) {\n node.loc = new Location(\n startToken,\n this._lexer.lastToken,\n this._lexer.source,\n );\n }\n\n return node;\n }\n /\n Determines if the next token is of a given kind\n /\n\n peek(kind) {\n return this._lexer.token.kind === kind;\n }\n /\n If the next token is of the given kind, return that token after advancing the lexer.\n * Otherwise, do not change the parser state and throw an error.\n /\n\n expectToken(kind) {\n const token = this._lexer.token;\n\n if (token.kind === kind) {\n this.advanceLexer();\n return token;\n }\n\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Expected ${getTokenKindDesc(kind)}, found ${getTokenDesc(token)}.`,\n );\n }\n /\n If the next token is of the given kind, return \"true\" after advancing the lexer.\n * Otherwise, do not change the parser state and return \"false\".\n /\n\n expectOptionalToken(kind) {\n const token = this._lexer.token;\n\n if (token.kind === kind) {\n this.advanceLexer();\n return true;\n }\n\n return false;\n }\n /\n If the next token is a given keyword, advance the lexer.\n * Otherwise, do not change the parser state and throw an error.\n /\n\n expectKeyword(value) {\n const token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this.advanceLexer();\n } else {\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Expected \"${value}\", found ${getTokenDesc(token)}.`,\n );\n }\n }\n /\n If the next token is a given keyword, return \"true\" after advancing the lexer.\n * Otherwise, do not change the parser state and return \"false\".\n /\n\n expectOptionalKeyword(value) {\n const token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this.advanceLexer();\n return true;\n }\n\n return false;\n }\n /\n Helper function for creating an error when an unexpected lexed token is encountered.\n /\n\n unexpected(atToken) {\n const token =\n atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n return syntaxError(\n this._lexer.source,\n token.start,\n `Unexpected ${getTokenDesc(token)}.`,\n );\n }\n /\n Returns a possibly empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n any(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n const nodes = [];\n\n while (!this.expectOptionalToken(closeKind)) {\n nodes.push(parseFn.call(this));\n }\n\n return nodes;\n }\n /\n Returns a list of parse nodes, determined by the parseFn.\n * It can be empty only if open token is missing otherwise it will always return non-empty list\n * that begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n optionalMany(openKind, parseFn, closeKind) {\n if (this.expectOptionalToken(openKind)) {\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n\n return [];\n }\n /\n Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n many(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n /\n Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n * Advances the parser to the next lex token after last item in the list.\n /\n\n delimitedMany(delimiterKind, parseFn) {\n this.expectOptionalToken(delimiterKind);\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (this.expectOptionalToken(delimiterKind));\n\n return nodes;\n }\n\n advanceLexer() {\n const { maxTokens } = this._options;\n\n const token = this._lexer.advance();\n\n if (maxTokens !== undefined && token.kind !== TokenKind.EOF) {\n ++this._tokenCounter;\n\n if (this._tokenCounter > maxTokens) {\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Document contains more that ${maxTokens} tokens. Parsing aborted.`,\n );\n }\n }\n }\n}\n/\n A helper function to describe a token as a string for debugging.\n /\n\nfunction getTokenDesc(token) {\n const value = token.value;\n return getTokenKindDesc(token.kind) + (value != null ? ` \"${value}\"` : '');\n}\n/\n A helper function to describe a token kind as a string for debugging.\n /\n\nfunction getTokenKindDesc(kind) {\n return isPunctuatorTokenKind(kind) ? `\"${kind}\"` : kind;\n}\n","/\n Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n /\nexport function printString(str) {\n return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n '\\\\u0000',\n '\\\\u0001',\n '\\\\u0002',\n '\\\\u0003',\n '\\\\u0004',\n '\\\\u0005',\n '\\\\u0006',\n '\\\\u0007',\n '\\\\b',\n '\\\\t',\n '\\\\n',\n '\\\\u000B',\n '\\\\f',\n '\\\\r',\n '\\\\u000E',\n '\\\\u000F',\n '\\\\u0010',\n '\\\\u0011',\n '\\\\u0012',\n '\\\\u0013',\n '\\\\u0014',\n '\\\\u0015',\n '\\\\u0016',\n '\\\\u0017',\n '\\\\u0018',\n '\\\\u0019',\n '\\\\u001A',\n '\\\\u001B',\n '\\\\u001C',\n '\\\\u001D',\n '\\\\u001E',\n '\\\\u001F',\n '',\n '',\n '\\\\\"',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 2F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 3F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 4F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '\\\\\\\\',\n '',\n '',\n '', // 5F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 6F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '\\\\u007F',\n '\\\\u0080',\n '\\\\u0081',\n '\\\\u0082',\n '\\\\u0083',\n '\\\\u0084',\n '\\\\u0085',\n '\\\\u0086',\n '\\\\u0087',\n '\\\\u0088',\n '\\\\u0089',\n '\\\\u008A',\n '\\\\u008B',\n '\\\\u008C',\n '\\\\u008D',\n '\\\\u008E',\n '\\\\u008F',\n '\\\\u0090',\n '\\\\u0091',\n '\\\\u0092',\n '\\\\u0093',\n '\\\\u0094',\n '\\\\u0095',\n '\\\\u0096',\n '\\\\u0097',\n '\\\\u0098',\n '\\\\u0099',\n '\\\\u009A',\n '\\\\u009B',\n '\\\\u009C',\n '\\\\u009D',\n '\\\\u009E',\n '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/\n A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n /\n\nexport const BREAK = Object.freeze({});\n/\n visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n \n By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n \n When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n \n ```ts\n * const editedAST = visit(ast, {\n * enter(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: skip visiting this node\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * },\n * leave(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: no action\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * }\n * });\n * ```\n \n Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n \n 1) Named visitors triggered when entering a node of a specific kind.\n \n ```ts\n * visit(ast, {\n * Kind(node) {\n * // enter the \"Kind\" node\n * }\n * })\n * ```\n \n 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n \n ```ts\n * visit(ast, {\n * Kind: {\n * enter(node) {\n * // enter the \"Kind\" node\n * }\n * leave(node) {\n * // leave the \"Kind\" node\n * }\n * }\n * })\n * ```\n \n 3) Generic visitors that trigger upon entering and leaving any node.\n \n ```ts\n * visit(ast, {\n * enter(node) {\n * // enter any node\n * },\n * leave(node) {\n * // leave any node\n * }\n * })\n * ```\n /\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n const enterLeaveMap = new Map();\n\n for (const kind of Object.values(Kind)) {\n enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n }\n / eslint-disable no-undef-init /\n\n let stack = undefined;\n let inArray = Array.isArray(root);\n let keys = [root];\n let index = -1;\n let edits = [];\n let node = root;\n let key = undefined;\n let parent = undefined;\n const path = [];\n const ancestors = [];\n / eslint-enable no-undef-init /\n\n do {\n index++;\n const isLeaving = index === keys.length;\n const isEdited = isLeaving && edits.length !== 0;\n\n if (isLeaving) {\n key = ancestors.length === 0 ? undefined : path[path.length - 1];\n node = parent;\n parent = ancestors.pop();\n\n if (isEdited) {\n if (inArray) {\n node = node.slice();\n let editOffset = 0;\n\n for (const [editKey, editValue] of edits) {\n const arrayKey = editKey - editOffset;\n\n if (editValue === null) {\n node.splice(arrayKey, 1);\n editOffset++;\n } else {\n node[arrayKey] = editValue;\n }\n }\n } else {\n node = Object.defineProperties(\n {},\n Object.getOwnPropertyDescriptors(node),\n );\n\n for (const [editKey, editValue] of edits) {\n node[editKey] = editValue;\n }\n }\n }\n\n index = stack.index;\n keys = stack.keys;\n edits = stack.edits;\n inArray = stack.inArray;\n stack = stack.prev;\n } else if (parent) {\n key = inArray ? index : keys[index];\n node = parent[key];\n\n if (node === null \|\| node === undefined) {\n continue;\n }\n\n path.push(key);\n }\n\n let result;\n\n if (!Array.isArray(node)) {\n var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n isNode(node) \|\| devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n const visitFn = isLeaving\n ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null \|\|\n _enterLeaveMap$get === void 0\n ? void 0\n : _enterLeaveMap$get.leave\n : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null \|\|\n _enterLeaveMap$get2 === void 0\n ? void 0\n : _enterLeaveMap$get2.enter;\n result =\n visitFn === null \|\| visitFn === void 0\n ? void 0\n : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n if (result === BREAK) {\n break;\n }\n\n if (result === false) {\n if (!isLeaving) {\n path.pop();\n continue;\n }\n } else if (result !== undefined) {\n edits.push([key, result]);\n\n if (!isLeaving) {\n if (isNode(result)) {\n node = result;\n } else {\n path.pop();\n continue;\n }\n }\n }\n }\n\n if (result === undefined && isEdited) {\n edits.push([key, node]);\n }\n\n if (isLeaving) {\n path.pop();\n } else {\n var _node$kind;\n\n stack = {\n inArray,\n index,\n keys,\n edits,\n prev: stack,\n };\n inArray = Array.isArray(node);\n keys = inArray\n ? node\n : (_node$kind = visitorKeys[node.kind]) !== null &&\n _node$kind !== void 0\n ? _node$kind\n : [];\n index = -1;\n edits = [];\n\n if (parent) {\n ancestors.push(parent);\n }\n\n parent = node;\n }\n } while (stack !== undefined);\n\n if (edits.length !== 0) {\n // New root\n return edits[edits.length - 1][1];\n }\n\n return root;\n}\n/\n Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n \n If a prior visitor edits a node, no following visitors will see that node.\n /\n\nexport function visitInParallel(visitors) {\n const skipping = new Array(visitors.length).fill(null);\n const mergedVisitor = Object.create(null);\n\n for (const kind of Object.values(Kind)) {\n let hasVisitor = false;\n const enterList = new Array(visitors.length).fill(undefined);\n const leaveList = new Array(visitors.length).fill(undefined);\n\n for (let i = 0; i < visitors.length; ++i) {\n const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n hasVisitor \|\| (hasVisitor = enter != null \|\| leave != null);\n enterList[i] = enter;\n leaveList[i] = leave;\n }\n\n if (!hasVisitor) {\n continue;\n }\n\n const mergedEnterLeave = {\n enter(...args) {\n const node = args[0];\n\n for (let i = 0; i < visitors.length; i++) {\n if (skipping[i] === null) {\n var _enterList$i;\n\n const result =\n (_enterList$i = enterList[i]) === null \|\| _enterList$i === void 0\n ? void 0\n : _enterList$i.apply(visitors[i], args);\n\n if (result === false) {\n skipping[i] = node;\n } else if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined) {\n return result;\n }\n }\n }\n },\n\n leave(...args) {\n const node = args[0];\n\n for (let i = 0; i < visitors.length; i++) {\n if (skipping[i] === null) {\n var _leaveList$i;\n\n const result =\n (_leaveList$i = leaveList[i]) === null \|\| _leaveList$i === void 0\n ? void 0\n : _leaveList$i.apply(visitors[i], args);\n\n if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined && result !== false) {\n return result;\n }\n } else if (skipping[i] === node) {\n skipping[i] = null;\n }\n }\n },\n };\n mergedVisitor[kind] = mergedEnterLeave;\n }\n\n return mergedVisitor;\n}\n/\n Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n /\n\nexport function getEnterLeaveForKind(visitor, kind) {\n const kindVisitor = visitor[kind];\n\n if (typeof kindVisitor === 'object') {\n // { Kind: { enter() {}, leave() {} } }\n return kindVisitor;\n } else if (typeof kindVisitor === 'function') {\n // { Kind() {} }\n return {\n enter: kindVisitor,\n leave: undefined,\n };\n } // { enter() {}, leave() {} }\n\n return {\n enter: visitor.enter,\n leave: visitor.leave,\n };\n}\n/\n Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n \n @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n /\n\n/ c8 ignore next 8 /\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.mjs';\n/\n Converts an AST into a string, using one set of reasonable\n * formatting rules.\n /\n\nexport function print(ast) {\n return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n Name: {\n leave: (node) => node.value,\n },\n Variable: {\n leave: (node) => '$' + node.name,\n },\n // Document\n Document: {\n leave: (node) => join(node.definitions, '\\n\\n'),\n },\n OperationDefinition: {\n leave(node) {\n const varDefs = wrap('(', join(node.variableDefinitions, ', '), ')');\n const prefix = join(\n [\n node.operation,\n join([node.name, varDefs]),\n join(node.directives, ' '),\n ],\n ' ',\n ); // Anonymous queries with no directives or variable definitions can use\n // the query short form.\n\n return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n },\n },\n VariableDefinition: {\n leave: ({ variable, type, defaultValue, directives }) =>\n variable +\n ': ' +\n type +\n wrap(' = ', defaultValue) +\n wrap(' ', join(directives, ' ')),\n },\n SelectionSet: {\n leave: ({ selections }) => block(selections),\n },\n Field: {\n leave({ alias, name, arguments: args, directives, selectionSet }) {\n const prefix = wrap('', alias, ': ') + name;\n let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n if (argsLine.length > MAX_LINE_LENGTH) {\n argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n }\n\n return join([argsLine, join(directives, ' '), selectionSet], ' ');\n },\n },\n Argument: {\n leave: ({ name, value }) => name + ': ' + value,\n },\n // Fragments\n FragmentSpread: {\n leave: ({ name, directives }) =>\n '...' + name + wrap(' ', join(directives, ' ')),\n },\n InlineFragment: {\n leave: ({ typeCondition, directives, selectionSet }) =>\n join(\n [\n '...',\n wrap('on ', typeCondition),\n join(directives, ' '),\n selectionSet,\n ],\n ' ',\n ),\n },\n FragmentDefinition: {\n leave: (\n { name, typeCondition, variableDefinitions, directives, selectionSet }, // Note: fragment variable definitions are experimental and may be changed\n ) =>\n // or removed in the future.\n `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n selectionSet,\n },\n // Value\n IntValue: {\n leave: ({ value }) => value,\n },\n FloatValue: {\n leave: ({ value }) => value,\n },\n StringValue: {\n leave: ({ value, block: isBlockString }) =>\n isBlockString ? printBlockString(value) : printString(value),\n },\n BooleanValue: {\n leave: ({ value }) => (value ? 'true' : 'false'),\n },\n NullValue: {\n leave: () => 'null',\n },\n EnumValue: {\n leave: ({ value }) => value,\n },\n ListValue: {\n leave: ({ values }) => '[' + join(values, ', ') + ']',\n },\n ObjectValue: {\n leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n },\n ObjectField: {\n leave: ({ name, value }) => name + ': ' + value,\n },\n // Directive\n Directive: {\n leave: ({ name, arguments: args }) =>\n '@' + name + wrap('(', join(args, ', '), ')'),\n },\n // Type\n NamedType: {\n leave: ({ name }) => name,\n },\n ListType: {\n leave: ({ type }) => '[' + type + ']',\n },\n NonNullType: {\n leave: ({ type }) => type + '!',\n },\n // Type System Definitions\n SchemaDefinition: {\n leave: ({ description, directives, operationTypes }) =>\n wrap('', description, '\\n') +\n join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n },\n OperationTypeDefinition: {\n leave: ({ operation, type }) => operation + ': ' + type,\n },\n ScalarTypeDefinition: {\n leave: ({ description, name, directives }) =>\n wrap('', description, '\\n') +\n join(['scalar', name, join(directives, ' ')], ' '),\n },\n ObjectTypeDefinition: {\n leave: ({ description, name, interfaces, directives, fields }) =>\n wrap('', description, '\\n') +\n join(\n [\n 'type',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n FieldDefinition: {\n leave: ({ description, name, arguments: args, type, directives }) =>\n wrap('', description, '\\n') +\n name +\n (hasMultilineItems(args)\n ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n : wrap('(', join(args, ', '), ')')) +\n ': ' +\n type +\n wrap(' ', join(directives, ' ')),\n },\n InputValueDefinition: {\n leave: ({ description, name, type, defaultValue, directives }) =>\n wrap('', description, '\\n') +\n join(\n [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n ' ',\n ),\n },\n InterfaceTypeDefinition: {\n leave: ({ description, name, interfaces, directives, fields }) =>\n wrap('', description, '\\n') +\n join(\n [\n 'interface',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n UnionTypeDefinition: {\n leave: ({ description, name, directives, types }) =>\n wrap('', description, '\\n') +\n join(\n ['union', name, join(directives, ' '), wrap('= ', join(types, ' \| '))],\n ' ',\n ),\n },\n EnumTypeDefinition: {\n leave: ({ description, name, directives, values }) =>\n wrap('', description, '\\n') +\n join(['enum', name, join(directives, ' '), block(values)], ' '),\n },\n EnumValueDefinition: {\n leave: ({ description, name, directives }) =>\n wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n },\n InputObjectTypeDefinition: {\n leave: ({ description, name, directives, fields }) =>\n wrap('', description, '\\n') +\n join(['input', name, join(directives, ' '), block(fields)], ' '),\n },\n DirectiveDefinition: {\n leave: ({ description, name, arguments: args, repeatable, locations }) =>\n wrap('', description, '\\n') +\n 'directive @' +\n name +\n (hasMultilineItems(args)\n ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n : wrap('(', join(args, ', '), ')')) +\n (repeatable ? ' repeatable' : '') +\n ' on ' +\n join(locations, ' \| '),\n },\n SchemaExtension: {\n leave: ({ directives, operationTypes }) =>\n join(\n ['extend schema', join(directives, ' '), block(operationTypes)],\n ' ',\n ),\n },\n ScalarTypeExtension: {\n leave: ({ name, directives }) =>\n join(['extend scalar', name, join(directives, ' ')], ' '),\n },\n ObjectTypeExtension: {\n leave: ({ name, interfaces, directives, fields }) =>\n join(\n [\n 'extend type',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n InterfaceTypeExtension: {\n leave: ({ name, interfaces, directives, fields }) =>\n join(\n [\n 'extend interface',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n UnionTypeExtension: {\n leave: ({ name, directives, types }) =>\n join(\n [\n 'extend union',\n name,\n join(directives, ' '),\n wrap('= ', join(types, ' \| ')),\n ],\n ' ',\n ),\n },\n EnumTypeExtension: {\n leave: ({ name, directives, values }) =>\n join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n },\n InputObjectTypeExtension: {\n leave: ({ name, directives, fields }) =>\n join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n },\n};\n/\n Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n /\n\nfunction join(maybeArray, separator = '') {\n var _maybeArray$filter$jo;\n\n return (_maybeArray$filter$jo =\n maybeArray === null \|\| maybeArray === void 0\n ? void 0\n : maybeArray.filter((x) => x).join(separator)) !== null &&\n _maybeArray$filter$jo !== void 0\n ? _maybeArray$filter$jo\n : '';\n}\n/\n Given array, print each item on its own line, wrapped in an indented `{ }` block.\n /\n\nfunction block(array) {\n return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/\n If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n /\n\nfunction wrap(start, maybeString, end = '') {\n return maybeString != null && maybeString !== ''\n ? start + maybeString + end\n : '';\n}\n\nfunction indent(str) {\n return wrap(' ', str.replace(/\\n/g, '\\n '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n var _maybeArray$some;\n\n // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n / c8 ignore next /\n return (_maybeArray$some =\n maybeArray === null \|\| maybeArray === void 0\n ? void 0\n : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n _maybeArray$some !== void 0\n ? _maybeArray$some\n : false;\n}\n","import { parse, print } from 'graphql';\n/\n helpers\n /\nconst extractOperationName = (document) => {\n let operationName = undefined;\n const operationDefinitions = document.definitions.filter((definition) => definition.kind === `OperationDefinition`);\n if (operationDefinitions.length === 1) {\n operationName = operationDefinitions[0]?.name?.value;\n }\n return operationName;\n};\nexport const resolveRequestDocument = (document) => {\n if (typeof document === `string`) {\n let operationName = undefined;\n try {\n const parsedDocument = parse(document);\n operationName = extractOperationName(parsedDocument);\n }\n catch (err) {\n // Failed parsing the document, the operationName will be undefined\n }\n return { query: document, operationName };\n }\n const operationName = extractOperationName(document);\n return { query: print(document), operationName };\n};\n//# sourceMappingURL=resolveRequestDocument.js.map","export class ClientError extends Error {\n constructor(response, request) {\n const message = `${ClientError.extractMessage(response)}: ${JSON.stringify({\n response,\n request,\n })}`;\n super(message);\n Object.setPrototypeOf(this, ClientError.prototype);\n this.response = response;\n this.request = request;\n // this is needed as Safari doesn't support .captureStackTrace\n if (typeof Error.captureStackTrace === `function`) {\n Error.captureStackTrace(this, ClientError);\n }\n }\n static extractMessage(response) {\n return response.errors?.[0]?.message ?? `GraphQL Error (Code: ${response.status})`;\n }\n}\n//# sourceMappingURL=types.js.map","// Save global object in a variable\nvar __global__ =\n(typeof globalThis !== 'undefined' && globalThis) \|\|\n(typeof self !== 'undefined' && self) \|\|\n(typeof global !== 'undefined' && global);\n// Create an object that extends from __global__ without the fetch function\nvar __globalThis__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = __global__.DOMException\n}\nF.prototype = __global__; // Needed for feature detection on whatwg-fetch's code\nreturn new F();\n})();\n// Wraps whatwg-fetch with a function scope to hijack the global object\n// \"globalThis\" that's going to be patched\n(function(globalThis) {\n\nvar irrelevant = (function (exports) {\n\n / eslint-disable no-prototype-builtins /\n var g =\n (typeof globalThis !== 'undefined' && globalThis) \|\|\n (typeof self !== 'undefined' && self) \|\|\n // eslint-disable-next-line no-undef\n (typeof global !== 'undefined' && global) \|\|\n {};\n\n var support = {\n searchParams: 'URLSearchParams' in g,\n iterable: 'Symbol' in g && 'iterator' in Symbol,\n blob:\n 'FileReader' in g &&\n 'Blob' in g &&\n (function() {\n try {\n new Blob();\n return true\n } catch (e) {\n return false\n }\n })(),\n formData: 'FormData' in g,\n arrayBuffer: 'ArrayBuffer' in g\n };\n\n function isDataView(obj) {\n return obj && DataView.prototype.isPrototypeOf(obj)\n }\n\n if (support.arrayBuffer) {\n var viewClasses = [\n '[object Int8Array]',\n '[object Uint8Array]',\n '[object Uint8ClampedArray]',\n '[object Int16Array]',\n '[object Uint16Array]',\n '[object Int32Array]',\n '[object Uint32Array]',\n '[object Float32Array]',\n '[object Float64Array]'\n ];\n\n var isArrayBufferView =\n ArrayBuffer.isView \|\|\n function(obj) {\n return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n };\n }\n\n function normalizeName(name) {\n if (typeof name !== 'string') {\n name = String(name);\n }\n if (/[^a-z0-9\\-#$%&'+.^_`\|~!]/i.test(name) \|\| name === '') {\n throw new TypeError('Invalid character in header field name: \"' + name + '\"')\n }\n return name.toLowerCase()\n }\n\n function normalizeValue(value) {\n if (typeof value !== 'string') {\n value = String(value);\n }\n return value\n }\n\n // Build a destructive iterator for the value list\n function iteratorFor(items) {\n var iterator = {\n next: function() {\n var value = items.shift();\n return {done: value === undefined, value: value}\n }\n };\n\n if (support.iterable) {\n iterator[Symbol.iterator] = function() {\n return iterator\n };\n }\n\n return iterator\n }\n\n function Headers(headers) {\n this.map = {};\n\n if (headers instanceof Headers) {\n headers.forEach(function(value, name) {\n this.append(name, value);\n }, this);\n } else if (Array.isArray(headers)) {\n headers.forEach(function(header) {\n if (header.length != 2) {\n throw new TypeError('Headers constructor: expected name/value pair to be length 2, found' + header.length)\n }\n this.append(header[0], header[1]);\n }, this);\n } else if (headers) {\n Object.getOwnPropertyNames(headers).forEach(function(name) {\n this.append(name, headers[name]);\n }, this);\n }\n }\n\n Headers.prototype.append = function(name, value) {\n name = normalizeName(name);\n value = normalizeValue(value);\n var oldValue = this.map[name];\n this.map[name] = oldValue ? oldValue + ', ' + value : value;\n };\n\n Headers.prototype['delete'] = function(name) {\n delete this.map[normalizeName(name)];\n };\n\n Headers.prototype.get = function(name) {\n name = normalizeName(name);\n return this.has(name) ? this.map[name] : null\n };\n\n Headers.prototype.has = function(name) {\n return this.map.hasOwnProperty(normalizeName(name))\n };\n\n Headers.prototype.set = function(name, value) {\n this.map[normalizeName(name)] = normalizeValue(value);\n };\n\n Headers.prototype.forEach = function(callback, thisArg) {\n for (var name in this.map) {\n if (this.map.hasOwnProperty(name)) {\n callback.call(thisArg, this.map[name], name, this);\n }\n }\n };\n\n Headers.prototype.keys = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push(name);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.values = function() {\n var items = [];\n this.forEach(function(value) {\n items.push(value);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.entries = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push([name, value]);\n });\n return iteratorFor(items)\n };\n\n if (support.iterable) {\n Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n }\n\n function consumed(body) {\n if (body._noBody) return\n if (body.bodyUsed) {\n return Promise.reject(new TypeError('Already read'))\n }\n body.bodyUsed = true;\n }\n\n function fileReaderReady(reader) {\n return new Promise(function(resolve, reject) {\n reader.onload = function() {\n resolve(reader.result);\n };\n reader.onerror = function() {\n reject(reader.error);\n };\n })\n }\n\n function readBlobAsArrayBuffer(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n reader.readAsArrayBuffer(blob);\n return promise\n }\n\n function readBlobAsText(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n var match = /charset=([A-Za-z0-9_-]+)/.exec(blob.type);\n var encoding = match ? match[1] : 'utf-8';\n reader.readAsText(blob, encoding);\n return promise\n }\n\n function readArrayBufferAsText(buf) {\n var view = new Uint8Array(buf);\n var chars = new Array(view.length);\n\n for (var i = 0; i < view.length; i++) {\n chars[i] = String.fromCharCode(view[i]);\n }\n return chars.join('')\n }\n\n function bufferClone(buf) {\n if (buf.slice) {\n return buf.slice(0)\n } else {\n var view = new Uint8Array(buf.byteLength);\n view.set(new Uint8Array(buf));\n return view.buffer\n }\n }\n\n function Body() {\n this.bodyUsed = false;\n\n this._initBody = function(body) {\n /\n fetch-mock wraps the Response object in an ES6 Proxy to\n provide useful test harness features such as flush. However, on\n ES5 browsers without fetch or Proxy support pollyfills must be used;\n the proxy-pollyfill is unable to proxy an attribute unless it exists\n on the object before the Proxy is created. This change ensures\n Response.bodyUsed exists on the instance, while maintaining the\n semantic of setting Request.bodyUsed in the constructor before\n _initBody is called.\n /\n // eslint-disable-next-line no-self-assign\n this.bodyUsed = this.bodyUsed;\n this._bodyInit = body;\n if (!body) {\n this._noBody = true;\n this._bodyText = '';\n } else if (typeof body === 'string') {\n this._bodyText = body;\n } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n this._bodyBlob = body;\n } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n this._bodyFormData = body;\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this._bodyText = body.toString();\n } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n this._bodyArrayBuffer = bufferClone(body.buffer);\n // IE 10-11 can't handle a DataView body.\n this._bodyInit = new Blob([this._bodyArrayBuffer]);\n } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) \|\| isArrayBufferView(body))) {\n this._bodyArrayBuffer = bufferClone(body);\n } else {\n this._bodyText = body = Object.prototype.toString.call(body);\n }\n\n if (!this.headers.get('content-type')) {\n if (typeof body === 'string') {\n this.headers.set('content-type', 'text/plain;charset=UTF-8');\n } else if (this._bodyBlob && this._bodyBlob.type) {\n this.headers.set('content-type', this._bodyBlob.type);\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n }\n }\n };\n\n if (support.blob) {\n this.blob = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return Promise.resolve(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as blob')\n } else {\n return Promise.resolve(new Blob([this._bodyText]))\n }\n };\n }\n\n this.arrayBuffer = function() {\n if (this._bodyArrayBuffer) {\n var isConsumed = consumed(this);\n if (isConsumed) {\n return isConsumed\n } else if (ArrayBuffer.isView(this._bodyArrayBuffer)) {\n return Promise.resolve(\n this._bodyArrayBuffer.buffer.slice(\n this._bodyArrayBuffer.byteOffset,\n this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength\n )\n )\n } else {\n return Promise.resolve(this._bodyArrayBuffer)\n }\n } else if (support.blob) {\n return this.blob().then(readBlobAsArrayBuffer)\n } else {\n throw new Error('could not read as ArrayBuffer')\n }\n };\n\n this.text = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return readBlobAsText(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as text')\n } else {\n return Promise.resolve(this._bodyText)\n }\n };\n\n if (support.formData) {\n this.formData = function() {\n return this.text().then(decode)\n };\n }\n\n this.json = function() {\n return this.text().then(JSON.parse)\n };\n\n return this\n }\n\n // HTTP methods whose capitalization should be normalized\n var methods = ['CONNECT', 'DELETE', 'GET', 'HEAD', 'OPTIONS', 'PATCH', 'POST', 'PUT', 'TRACE'];\n\n function normalizeMethod(method) {\n var upcased = method.toUpperCase();\n return methods.indexOf(upcased) > -1 ? upcased : method\n }\n\n function Request(input, options) {\n if (!(this instanceof Request)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n\n options = options \|\| {};\n var body = options.body;\n\n if (input instanceof Request) {\n if (input.bodyUsed) {\n throw new TypeError('Already read')\n }\n this.url = input.url;\n this.credentials = input.credentials;\n if (!options.headers) {\n this.headers = new Headers(input.headers);\n }\n this.method = input.method;\n this.mode = input.mode;\n this.signal = input.signal;\n if (!body && input._bodyInit != null) {\n body = input._bodyInit;\n input.bodyUsed = true;\n }\n } else {\n this.url = String(input);\n }\n\n this.credentials = options.credentials \|\| this.credentials \|\| 'same-origin';\n if (options.headers \|\| !this.headers) {\n this.headers = new Headers(options.headers);\n }\n this.method = normalizeMethod(options.method \|\| this.method \|\| 'GET');\n this.mode = options.mode \|\| this.mode \|\| null;\n this.signal = options.signal \|\| this.signal \|\| (function () {\n if ('AbortController' in g) {\n var ctrl = new AbortController();\n return ctrl.signal;\n }\n }());\n this.referrer = null;\n\n if ((this.method === 'GET' \|\| this.method === 'HEAD') && body) {\n throw new TypeError('Body not allowed for GET or HEAD requests')\n }\n this._initBody(body);\n\n if (this.method === 'GET' \|\| this.method === 'HEAD') {\n if (options.cache === 'no-store' \|\| options.cache === 'no-cache') {\n // Search for a '_' parameter in the query string\n var reParamSearch = /([?&])_=[^&]/;\n if (reParamSearch.test(this.url)) {\n // If it already exists then set the value with the current time\n this.url = this.url.replace(reParamSearch, '$1_=' + new Date().getTime());\n } else {\n // Otherwise add a new '_' parameter to the end with the current time\n var reQueryString = /\\?/;\n this.url += (reQueryString.test(this.url) ? '&' : '?') + '_=' + new Date().getTime();\n }\n }\n }\n }\n\n Request.prototype.clone = function() {\n return new Request(this, {body: this._bodyInit})\n };\n\n function decode(body) {\n var form = new FormData();\n body\n .trim()\n .split('&')\n .forEach(function(bytes) {\n if (bytes) {\n var split = bytes.split('=');\n var name = split.shift().replace(/\\+/g, ' ');\n var value = split.join('=').replace(/\\+/g, ' ');\n form.append(decodeURIComponent(name), decodeURIComponent(value));\n }\n });\n return form\n }\n\n function parseHeaders(rawHeaders) {\n var headers = new Headers();\n // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n // https://tools.ietf.org/html/rfc7230#section-3.2\n var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n // Avoiding split via regex to work around a common IE11 bug with the core-js 3.6.0 regex polyfill\n // https://github.com/github/fetch/issues/748\n // https://github.com/zloirock/core-js/issues/751\n preProcessedHeaders\n .split('\\r')\n .map(function(header) {\n return header.indexOf('\\n') === 0 ? header.substr(1, header.length) : header\n })\n .forEach(function(line) {\n var parts = line.split(':');\n var key = parts.shift().trim();\n if (key) {\n var value = parts.join(':').trim();\n try {\n headers.append(key, value);\n } catch (error) {\n console.warn('Response ' + error.message);\n }\n }\n });\n return headers\n }\n\n Body.call(Request.prototype);\n\n function Response(bodyInit, options) {\n if (!(this instanceof Response)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n if (!options) {\n options = {};\n }\n\n this.type = 'default';\n this.status = options.status === undefined ? 200 : options.status;\n if (this.status < 200 \|\| this.status > 599) {\n throw new RangeError(\"Failed to construct 'Response': The status provided (0) is outside the range [200, 599].\")\n }\n this.ok = this.status >= 200 && this.status < 300;\n this.statusText = options.statusText === undefined ? '' : '' + options.statusText;\n this.headers = new Headers(options.headers);\n this.url = options.url \|\| '';\n this._initBody(bodyInit);\n }\n\n Body.call(Response.prototype);\n\n Response.prototype.clone = function() {\n return new Response(this._bodyInit, {\n status: this.status,\n statusText: this.statusText,\n headers: new Headers(this.headers),\n url: this.url\n })\n };\n\n Response.error = function() {\n var response = new Response(null, {status: 200, statusText: ''});\n response.ok = false;\n response.status = 0;\n response.type = 'error';\n return response\n };\n\n var redirectStatuses = [301, 302, 303, 307, 308];\n\n Response.redirect = function(url, status) {\n if (redirectStatuses.indexOf(status) === -1) {\n throw new RangeError('Invalid status code')\n }\n\n return new Response(null, {status: status, headers: {location: url}})\n };\n\n exports.DOMException = g.DOMException;\n try {\n new exports.DOMException();\n } catch (err) {\n exports.DOMException = function(message, name) {\n this.message = message;\n this.name = name;\n var error = Error(message);\n this.stack = error.stack;\n };\n exports.DOMException.prototype = Object.create(Error.prototype);\n exports.DOMException.prototype.constructor = exports.DOMException;\n }\n\n function fetch(input, init) {\n return new Promise(function(resolve, reject) {\n var request = new Request(input, init);\n\n if (request.signal && request.signal.aborted) {\n return reject(new exports.DOMException('Aborted', 'AbortError'))\n }\n\n var xhr = new XMLHttpRequest();\n\n function abortXhr() {\n xhr.abort();\n }\n\n xhr.onload = function() {\n var options = {\n statusText: xhr.statusText,\n headers: parseHeaders(xhr.getAllResponseHeaders() \|\| '')\n };\n // This check if specifically for when a user fetches a file locally from the file system\n // Only if the status is out of a normal range\n if (request.url.indexOf('file://') === 0 && (xhr.status < 200 \|\| xhr.status > 599)) {\n options.status = 200;\n } else {\n options.status = xhr.status;\n }\n options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n var body = 'response' in xhr ? xhr.response : xhr.responseText;\n setTimeout(function() {\n resolve(new Response(body, options));\n }, 0);\n };\n\n xhr.onerror = function() {\n setTimeout(function() {\n reject(new TypeError('Network request failed'));\n }, 0);\n };\n\n xhr.ontimeout = function() {\n setTimeout(function() {\n reject(new TypeError('Network request timed out'));\n }, 0);\n };\n\n xhr.onabort = function() {\n setTimeout(function() {\n reject(new exports.DOMException('Aborted', 'AbortError'));\n }, 0);\n };\n\n function fixUrl(url) {\n try {\n return url === '' && g.location.href ? g.location.href : url\n } catch (e) {\n return url\n }\n }\n\n xhr.open(request.method, fixUrl(request.url), true);\n\n if (request.credentials === 'include') {\n xhr.withCredentials = true;\n } else if (request.credentials === 'omit') {\n xhr.withCredentials = false;\n }\n\n if ('responseType' in xhr) {\n if (support.blob) {\n xhr.responseType = 'blob';\n } else if (\n support.arrayBuffer\n ) {\n xhr.responseType = 'arraybuffer';\n }\n }\n\n if (init && typeof init.headers === 'object' && !(init.headers instanceof Headers \|\| (g.Headers && init.headers instanceof g.Headers))) {\n var names = [];\n Object.getOwnPropertyNames(init.headers).forEach(function(name) {\n names.push(normalizeName(name));\n xhr.setRequestHeader(name, normalizeValue(init.headers[name]));\n });\n request.headers.forEach(function(value, name) {\n if (names.indexOf(name) === -1) {\n xhr.setRequestHeader(name, value);\n }\n });\n } else {\n request.headers.forEach(function(value, name) {\n xhr.setRequestHeader(name, value);\n });\n }\n\n if (request.signal) {\n request.signal.addEventListener('abort', abortXhr);\n\n xhr.onreadystatechange = function() {\n // DONE (success or failure)\n if (xhr.readyState === 4) {\n request.signal.removeEventListener('abort', abortXhr);\n }\n };\n }\n\n xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n })\n }\n\n fetch.polyfill = true;\n\n if (!g.fetch) {\n g.fetch = fetch;\n g.Headers = Headers;\n g.Request = Request;\n g.Response = Response;\n }\n\n exports.Headers = Headers;\n exports.Request = Request;\n exports.Response = Response;\n exports.fetch = fetch;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n return exports;\n\n})({});\n})(__globalThis__);\n// This is a ponyfill, so...\n__globalThis__.fetch.ponyfill = true;\ndelete __globalThis__.fetch.polyfill;\n// Choose between native implementation (__global__) or custom implementation (__globalThis__)\nvar ctx = __global__.fetch ? __global__ : __globalThis__;\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\n","import { defaultJsonSerializer } from './defaultJsonSerializer.js';\nimport { HeadersInstanceToPlainObject, uppercase } from './helpers.js';\nimport { parseBatchRequestArgs, parseRawRequestArgs, parseRawRequestExtendedArgs, parseRequestArgs, parseRequestExtendedArgs, } from './parseArgs.js';\nimport { resolveRequestDocument } from './resolveRequestDocument.js';\nimport { ClientError, } from './types.js';\nimport crossFetch, as CrossFetch from 'cross-fetch';\nexport { ClientError, };\n/*\n Convert the given headers configuration into a plain object.\n /\nconst resolveHeaders = (headers) => {\n let oHeaders = {};\n if (headers) {\n if ((typeof Headers !== `undefined` && headers instanceof Headers) \|\|\n (CrossFetch && CrossFetch.Headers && headers instanceof CrossFetch.Headers)) {\n oHeaders = HeadersInstanceToPlainObject(headers);\n }\n else if (Array.isArray(headers)) {\n headers.forEach(([name, value]) => {\n if (name && value !== undefined) {\n oHeaders[name] = value;\n }\n });\n }\n else {\n oHeaders = headers;\n }\n }\n return oHeaders;\n};\n/\n Clean a GraphQL document to send it via a GET query\n /\nconst cleanQuery = (str) => str.replace(/([\\s,]\|#[^\\n\\r]+)+/g, ` `).trim();\n/\n Create query string for GraphQL request\n /\nconst buildRequestConfig = (params) => {\n if (!Array.isArray(params.query)) {\n const params_ = params;\n const search = [`query=${encodeURIComponent(cleanQuery(params_.query))}`];\n if (params.variables) {\n search.push(`variables=${encodeURIComponent(params_.jsonSerializer.stringify(params_.variables))}`);\n }\n if (params_.operationName) {\n search.push(`operationName=${encodeURIComponent(params_.operationName)}`);\n }\n return search.join(`&`);\n }\n if (typeof params.variables !== `undefined` && !Array.isArray(params.variables)) {\n throw new Error(`Cannot create query with given variable type, array expected`);\n }\n // Batch support\n const params_ = params;\n const payload = params.query.reduce((acc, currentQuery, index) => {\n acc.push({\n query: cleanQuery(currentQuery),\n variables: params_.variables ? params_.jsonSerializer.stringify(params_.variables[index]) : undefined,\n });\n return acc;\n }, []);\n return `query=${encodeURIComponent(params_.jsonSerializer.stringify(payload))}`;\n};\nconst createHttpMethodFetcher = (method) => async (params) => {\n const { url, query, variables, operationName, fetch, fetchOptions, middleware } = params;\n const headers = { ...params.headers };\n let queryParams = ``;\n let body = undefined;\n if (method === `POST`) {\n body = createRequestBody(query, variables, operationName, fetchOptions.jsonSerializer);\n if (typeof body === `string`) {\n // @ts-expect-error todo\n headers[`Content-Type`] = `application/json`;\n }\n }\n else {\n // @ts-expect-error todo needs ADT for TS to understand the different states\n queryParams = buildRequestConfig({\n query,\n variables,\n operationName,\n jsonSerializer: fetchOptions.jsonSerializer ?? defaultJsonSerializer,\n });\n }\n const init = {\n method,\n headers,\n body,\n ...fetchOptions,\n };\n let urlResolved = url;\n let initResolved = init;\n if (middleware) {\n const result = await Promise.resolve(middleware({ ...init, url, operationName, variables }));\n const { url: urlNew, ...initNew } = result;\n urlResolved = urlNew;\n initResolved = initNew;\n }\n if (queryParams) {\n urlResolved = `${urlResolved}?${queryParams}`;\n }\n return await fetch(urlResolved, initResolved);\n};\n/\n GraphQL Client.\n /\nexport class GraphQLClient {\n constructor(url, requestConfig = {}) {\n this.url = url;\n this.requestConfig = requestConfig;\n /\n Send a GraphQL query to the server.\n /\n this.rawRequest = async (...args) => {\n const [queryOrOptions, variables, requestHeaders] = args;\n const rawRequestOptions = parseRawRequestArgs(queryOrOptions, variables, requestHeaders);\n const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n const { url } = this;\n if (rawRequestOptions.signal !== undefined) {\n fetchOptions.signal = rawRequestOptions.signal;\n }\n const { operationName } = resolveRequestDocument(rawRequestOptions.query);\n return makeRequest({\n url,\n query: rawRequestOptions.query,\n variables: rawRequestOptions.variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(rawRequestOptions.requestHeaders),\n },\n operationName,\n fetch,\n method,\n fetchOptions,\n middleware: requestMiddleware,\n })\n .then((response) => {\n if (responseMiddleware) {\n responseMiddleware(response);\n }\n return response;\n })\n .catch((error) => {\n if (responseMiddleware) {\n responseMiddleware(error);\n }\n throw error;\n });\n };\n }\n async request(documentOrOptions, ...variablesAndRequestHeaders) {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n const requestOptions = parseRequestArgs(documentOrOptions, variables, requestHeaders);\n const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n const { url } = this;\n if (requestOptions.signal !== undefined) {\n fetchOptions.signal = requestOptions.signal;\n }\n const { query, operationName } = resolveRequestDocument(requestOptions.document);\n return makeRequest({\n url,\n query,\n variables: requestOptions.variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(requestOptions.requestHeaders),\n },\n operationName,\n fetch,\n method,\n fetchOptions,\n middleware: requestMiddleware,\n })\n .then((response) => {\n if (responseMiddleware) {\n responseMiddleware(response);\n }\n return response.data;\n })\n .catch((error) => {\n if (responseMiddleware) {\n responseMiddleware(error);\n }\n throw error;\n });\n }\n // prettier-ignore\n batchRequests(documentsOrOptions, requestHeaders) {\n const batchRequestOptions = parseBatchRequestArgs(documentsOrOptions, requestHeaders);\n const { headers, ...fetchOptions } = this.requestConfig;\n if (batchRequestOptions.signal !== undefined) {\n fetchOptions.signal = batchRequestOptions.signal;\n }\n const queries = batchRequestOptions.documents.map(({ document }) => resolveRequestDocument(document).query);\n const variables = batchRequestOptions.documents.map(({ variables }) => variables);\n return makeRequest({\n url: this.url,\n query: queries,\n // @ts-expect-error TODO reconcile batch variables into system.\n variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(batchRequestOptions.requestHeaders),\n },\n operationName: undefined,\n fetch: this.requestConfig.fetch ?? crossFetch,\n method: this.requestConfig.method \|\| `POST`,\n fetchOptions,\n middleware: this.requestConfig.requestMiddleware,\n })\n .then((response) => {\n if (this.requestConfig.responseMiddleware) {\n this.requestConfig.responseMiddleware(response);\n }\n return response.data;\n })\n .catch((error) => {\n if (this.requestConfig.responseMiddleware) {\n this.requestConfig.responseMiddleware(error);\n }\n throw error;\n });\n }\n setHeaders(headers) {\n this.requestConfig.headers = headers;\n return this;\n }\n /\n Attach a header to the client. All subsequent requests will have this header.\n /\n setHeader(key, value) {\n const { headers } = this.requestConfig;\n if (headers) {\n // todo what if headers is in nested array form... ?\n //@ts-expect-error todo\n headers[key] = value;\n }\n else {\n this.requestConfig.headers = { [key]: value };\n }\n return this;\n }\n /\n Change the client endpoint. All subsequent requests will send to this endpoint.\n /\n setEndpoint(value) {\n this.url = value;\n return this;\n }\n}\nconst makeRequest = async (params) => {\n const { query, variables, fetchOptions } = params;\n const fetcher = createHttpMethodFetcher(uppercase(params.method ?? `post`));\n const isBatchingQuery = Array.isArray(params.query);\n const response = await fetcher(params);\n const result = await getResult(response, fetchOptions.jsonSerializer ?? defaultJsonSerializer);\n const successfullyReceivedData = Array.isArray(result)\n ? !result.some(({ data }) => !data)\n : Boolean(result.data);\n const successfullyPassedErrorPolicy = Array.isArray(result) \|\|\n !result.errors \|\|\n (Array.isArray(result.errors) && !result.errors.length) \|\|\n fetchOptions.errorPolicy === `all` \|\|\n fetchOptions.errorPolicy === `ignore`;\n if (response.ok && successfullyPassedErrorPolicy && successfullyReceivedData) {\n // @ts-expect-error TODO fixme\n const { errors: _, ...rest } = Array.isArray(result) ? result : result;\n const data = fetchOptions.errorPolicy === `ignore` ? rest : result;\n const dataEnvelope = isBatchingQuery ? { data } : data;\n // @ts-expect-error TODO\n return {\n ...dataEnvelope,\n headers: response.headers,\n status: response.status,\n };\n }\n else {\n const errorResult = typeof result === `string`\n ? {\n error: result,\n }\n : result;\n throw new ClientError(\n // @ts-expect-error TODO\n { ...errorResult, status: response.status, headers: response.headers }, { query, variables });\n }\n};\n/\n Send a GraphQL Query to the GraphQL server for execution.\n /\nexport const rawRequest = async (...args) => {\n const [urlOrOptions, query, ...variablesAndRequestHeaders] = args;\n const requestOptions = parseRawRequestExtendedArgs(urlOrOptions, query, ...variablesAndRequestHeaders);\n const client = new GraphQLClient(requestOptions.url);\n return client.rawRequest({\n ...requestOptions,\n });\n};\n// prettier-ignore\n// eslint-disable-next-line\nexport async function request(urlOrOptions, document, ...variablesAndRequestHeaders) {\n const requestOptions = parseRequestExtendedArgs(urlOrOptions, document, ...variablesAndRequestHeaders);\n const client = new GraphQLClient(requestOptions.url);\n return client.request({\n ...requestOptions,\n });\n}\n/\n Send a batch of GraphQL Document to the GraphQL server for execution.\n \n @example\n \n ```ts\n * // You can pass a raw string\n \n await batchRequests('https://foo.bar/graphql', [\n * {\n * query: `\n * {\n * query {\n * users\n * }\n * }`\n * },\n * {\n * query: `\n * {\n * query {\n * users\n * }\n * }`\n * }])\n \n // You can also pass a GraphQL DocumentNode as query. Convenient if you\n * // are using graphql-tag package.\n \n import gql from 'graphql-tag'\n \n await batchRequests('https://foo.bar/graphql', [{ query: gql`...` }])\n * ```\n /\nexport const batchRequests = async (...args) => {\n const params = parseBatchRequestsArgsExtended(args);\n const client = new GraphQLClient(params.url);\n return client.batchRequests(params);\n};\nconst parseBatchRequestsArgsExtended = (args) => {\n if (args.length === 1) {\n return args[0];\n }\n else {\n return {\n url: args[0],\n documents: args[1],\n requestHeaders: args[2],\n signal: undefined,\n };\n }\n};\nconst createRequestBody = (query, variables, operationName, jsonSerializer) => {\n const jsonSerializer_ = jsonSerializer ?? defaultJsonSerializer;\n if (!Array.isArray(query)) {\n return jsonSerializer_.stringify({ query, variables, operationName });\n }\n if (typeof variables !== `undefined` && !Array.isArray(variables)) {\n throw new Error(`Cannot create request body with given variable type, array expected`);\n }\n // Batch support\n const payload = query.reduce((acc, currentQuery, index) => {\n acc.push({ query: currentQuery, variables: variables ? variables[index] : undefined });\n return acc;\n }, []);\n return jsonSerializer_.stringify(payload);\n};\nconst getResult = async (response, jsonSerializer) => {\n let contentType;\n response.headers.forEach((value, key) => {\n if (key.toLowerCase() === `content-type`) {\n contentType = value;\n }\n });\n if (contentType &&\n (contentType.toLowerCase().startsWith(`application/json`) \|\|\n contentType.toLowerCase().startsWith(`application/graphql+json`) \|\|\n contentType.toLowerCase().startsWith(`application/graphql-response+json`))) {\n return jsonSerializer.parse(await response.text());\n }\n else {\n return response.text();\n }\n};\nconst callOrIdentity = (value) => {\n return typeof value === `function` ? value() : value;\n};\n/\n Convenience passthrough template tag to get the benefits of tooling for the gql template tag. This does not actually parse the input into a GraphQL DocumentNode like graphql-tag package does. It just returns the string with any variables given interpolated. Can save you a bit of performance and having to install another package.\n \n @example\n * ```\n * import { gql } from 'graphql-request'\n \n await request('https://foo.bar/graphql', gql`...`)\n * ```\n \n @remarks\n \n Several tools in the Node GraphQL ecosystem are hardcoded to specially treat any template tag named \"gql\". For example see this prettier issue: https://github.com/prettier/prettier/issues/4360. Using this template tag has no runtime effect beyond variable interpolation.\n /\nexport const gql = (chunks, ...variables) => {\n return chunks.reduce((acc, chunk, index) => `${acc}${chunk}${index in variables ? String(variables[index]) : ``}`, ``);\n};\nexport { GraphQLWebSocketClient } from './graphql-ws.js';\nexport { resolveRequestDocument } from './resolveRequestDocument.js';\nexport default request;\n//# sourceMappingURL=index.js.map","import { gql } from 'graphql-request'\n\n/\n Queries for the GraphQL API.\n * @public\n /\nconst queries = {\n\tgetMeta: gql`\n\t\tquery getDoctype($doctype: String!) {\n\t\t\tgetMeta(doctype: $doctype) {\n\t\t\t\tid\n\t\t\t\tname\n\t\t\t\tworkflow\n\t\t\t\tschema\n\t\t\t\tactions\n\t\t\t}\n\t\t}\n\t`,\n}\n\nexport { queries }\n","import { gql } from 'graphql-request'\n\n/\n This is the schema for the GraphQL API.\n * @public\n /\nconst typeDefs = gql`\n\ttype Doctype {\n\t\tid: ID!\n\t\tname: String!\n\t\tworkflow: String!\n\t\tschema: String!\n\t\tactions: String!\n\t}\n\n\ttype DoctypeField {\n\t\tid: ID!\n\t\tlabel: String!\n\t\tfieldtype: String\n\t\tcomponent: String\n\t\trequired: Boolean\n\t\treadonly: Boolean\n\t}\n\n\ttype DoctypeWorkflow {\n\t\tname: String!\n\t\tmachine: StateMachine!\n\t}\n\n\ttype StateMachine {\n\t\tid: ID!\n\t}\n\n\ttype DoctypeAction {\n\t\teventName: String!\n\t\tcallback: String\n\t}\n\n\ttype Query {\n\t\tgetMeta(doctype: String!): Doctype # ∪ error\n\t\tgetRecords(doctype: String!, filters: [String]): [String] # ∪ error\n\t\tgetRecord(doctype: String!, id: ID!): String # ∪ error\n\t}\n\n\ttype Mutation {\n\t\trunAction(doctype: String!, id: [ID!]!, functionName: String!): [String!]! # ∪ error\n\t}\n\n\tschema {\n\t\tquery: Query\n\t\tmutation: Mutation\n\t}\n`\n\nexport default typeDefs\n","import { Decimal } from 'decimal.js'\nimport { GraphQLClient } from 'graphql-request'\n\nimport { queries } from './queries'\nimport typeDefs from './gql/schema'\nimport type { Meta, MetaParser, MetaResponse } from './types'\n\n/\n Parse the response from the GraphQL server. Converts the stringified JSON to JSON and converts the stringified numbers to Decimal.\n * @param obj - The response from the GraphQL server\n * @returns The parsed response\n * @example\n * const response = '{\"data\":{\"getMeta\":{\"id\":\"Issue\",\"name\":\"Issue\",\"workflow\":\"{\\\"machineId\\\":null,\\\"name\\\":\\\"save\\\",\\\"id\\\":\\\"1\\\"}\",\"schema\":\"[{\\\"label\\\":\\\"Subject\\\",\\\"id\\\":\\\"1\\\"}]\",\"actions\":\"[{\\\"eventName\\\":\\\"save\\\",\\\"id\\\":\\\"1\\\"}]\"}}}'\n * const parsedResponse = metaParser(response)\n * console.log(parsedResponse)\n * /* Output: {\"id\": \"Issue\", \"name\": \"Issue\", \"workflow\": { \"machineId\": null, \"name\": \"save\", \"id\": \"1\" }, \"schema\": [{ \"label\": \"Subject\", \"id\": \"1\" }], \"actions\": [{ \"eventName\": \"save\", \"id\": \"1\" }]}\n /\nconst metaParser = (obj: string): MetaParser => {\n\treturn JSON.parse(obj, (key, value) => {\n\t\tif (typeof value === 'string') {\n\t\t\ttry {\n\t\t\t\treturn JSON.parse(value, (_key, value) => {\n\t\t\t\t\tif (typeof value === 'string' && !isNaN(Number(value))) {\n\t\t\t\t\t\treturn new Decimal(value)\n\t\t\t\t\t}\n\n\t\t\t\t\treturn value\n\t\t\t\t})\n\t\t\t} catch {\n\t\t\t\t// if the value is not a stringified JSON, return as it is\n\t\t\t\treturn value\n\t\t\t}\n\t\t} else if (!isNaN(Number(value))) {\n\t\t\treturn new Decimal(value as string \| number)\n\t\t}\n\t\treturn value\n\t})\n}\n\n/\n Get meta information for a doctype\n * @param doctype - The doctype to get meta information for\n * @param url - The URL to send the request to\n * @returns The meta information for the doctype\n * @public\n */\nconst methods = {\n\tgetMeta: async (doctype: string, url?: string): Promise<MetaResponse> => {\n\t\tconst client = new GraphQLClient(url \|\| '/graphql', {\n\t\t\tfetch: window.fetch,\n\t\t\tjsonSerializer: {\n\t\t\t\tstringify: obj => JSON.stringify(obj), // process the request object before sending; leave as default JSON\n\t\t\t\tparse: metaParser, // process the response meta object\n\t\t\t},\n\t\t})\n\n\t\tconst { getMeta } = await client.request<Meta['response'], Meta['variables']>({\n\t\t\tdocument: queries.getMeta,\n\t\t\tvariables: { doctype },\n\t\t})\n\n\t\treturn getMeta\n\t},\n}\n\nexport type { Meta, MetaParser, MetaResponse } from './types'\nexport { queries, typeDefs, methods }\n"],"names":["EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","PI","DEFAULTS","inexact","quadrant","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","tag","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LOG_BASE","MAX_SAFE_INTEGER","LN10_PRECISION","PI_PRECISION","P","x","finalise","min","max","k","Ctor","y","i","j","xdL","ydL","xd","yd","xs","ys","pr","rm","cosine","toLessThanHalfPi","m","r","rep","sd","t","t3","t3plusx","digitsToString","divide","w","d","n","len","one","tinyPow","taylorSeries","cosh2_x","d8","sinh2_x","d5","d16","d20","halfPi","getPi","wpr","xsd","px","x2","base","isBase10","denominator","inf","num","arg","guard","naturalLogarithm","getLn10","checkRoundingDigits","e","xe","xLTy","getBase10Exponent","q","naturalExponential","carry","z","getPrecision","sine","s","rL","toStringBinary","dp","checkInt32","str","finiteToString","maxD","d0","d1","d2","n0","n1","yn","intPow","ws","indexOfLastWord","getZeroString","repeating","di","rd","convertBase","baseIn","baseOut","arr","arrL","strL","cos2x","multiplyInteger","temp","compare","a","b","aL","bL","subtract","cmp","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","digits","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","args","ltgt","pow","sum","c","c0","numerator","x1","parseDecimal","parseOther","divisor","isFloat","p","Decimal","sin2_x","isHyperbolic","u","isNeg","pi","abs","acos","acosh","add","asin","asinh","atan","atanh","atan2","cbrt","ceil","clamp","config","obj","v","useDefaults","ps","cos","cosh","clone","isDecimalInstance","div","exp","floor","hypot","ln","log","log10","log2","mod","mul","random","round","sin","sinh","sqrt","sub","tan","tanh","trunc","defaultJsonSerializer","uppercase","HeadersInstanceToPlainObject","headers","o","parseRequestArgs","documentOrOptions","variables","requestHeaders","parseRawRequestArgs","queryOrOptions","parseBatchRequestArgs","documentsOrOptions","devAssert","condition","message","isObjectLike","value","invariant","LineRegExp","getLocation","source","position","lastLineStart","line","match","printLocation","location","printSourceLocation","sourceLocation","firstLineColumnOffset","body","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","lines","locationLine","subLineIndex","subLineColumnNum","subLines","printPrefixedLines","subLine","existingLines","_","padLen","prefix","toNormalizedOptions","firstArg","GraphQLError","rawArgs","_this$nodes","_nodeLocations$","_ref","nodes","positions","path","originalError","extensions","undefinedIfEmpty","nodeLocations","node","loc","pos","originalExtensions","output","formattedError","array","syntaxError","description","Location","startToken","endToken","Token","kind","start","end","column","QueryDocumentKeys","kindValues","isNode","maybeNode","maybeKind","OperationTypeNode","DirectiveLocation","Kind","isWhiteSpace","code","isDigit","isLetter","isNameStart","isNameContinue","dedentBlockStringLines","_firstNonEmptyLine2","commonIndent","firstNonEmptyLine","lastNonEmptyLine","_firstNonEmptyLine","indent","leadingWhitespace","printBlockString","options","escapedValue","isSingleLine","forceLeadingNewLine","hasTrailingTripleQuotes","hasTrailingQuote","hasTrailingSlash","forceTrailingNewline","printAsMultipleLines","result","skipLeadingNewLine","TokenKind","Lexer","startOfFileToken","token","nextToken","readNextToken","isPunctuatorTokenKind","isUnicodeScalarValue","isSupplementaryCodePoint","isLeadingSurrogate","isTrailingSurrogate","printCodePointAt","lexer","char","createToken","col","bodyLength","readComment","readBlockString","readString","readNumber","readName","firstCode","readDigits","chunkStart","escape","readEscapedUnicodeVariableWidth","readEscapedUnicodeFixedWidth","readEscapedCharacter","point","size","readHexDigit","read16BitHexCode","trailingCode","lineStart","currentLine","blockLines","MAX_ARRAY_LENGTH","MAX_RECURSIVE_DEPTH","inspect","formatValue","seenValues","formatObjectValue","previouslySeenValues","isJSONable","jsonValue","formatArray","formatObject","object","entries","getObjectTag","key","remaining","items","name","instanceOf","constructor","_value$constructor","className","valueClassName","stringifiedValue","Source","locationOffset","isSource","parse","Parser","sourceObj","hasDescription","keywordToken","operation","operationToken","nameOrAlias","alias","isConst","item","hasTypeCondition","varName","directives","type","innerType","operationTypes","interfaces","fields","defaultValue","types","values","getTokenDesc","repeatable","locations","getTokenKindDesc","atToken","openKind","parseFn","closeKind","delimiterKind","maxTokens","printString","escapedRegExp","escapedReplacer","escapeSequences","BREAK","visit","root","visitor","visitorKeys","enterLeaveMap","getEnterLeaveForKind","stack","inArray","keys","index","edits","parent","ancestors","isLeaving","isEdited","editOffset","editKey","editValue","arrayKey","_enterLeaveMap$get","_enterLeaveMap$get2","visitFn","_node$kind","kindVisitor","print","ast","printDocASTReducer","MAX_LINE_LENGTH","join","varDefs","wrap","variable","selections","block","selectionSet","argsLine","typeCondition","variableDefinitions","isBlockString","hasMultilineItems","maybeArray","separator","_maybeArray$filter$jo","maybeString","_maybeArray$some","extractOperationName","document","operationName","operationDefinitions","definition","resolveRequestDocument","parsedDocument","ClientError","response","request","__global__","global","__globalThis__","F","globalThis","exports","g","support","isDataView","viewClasses","isArrayBufferView","normalizeName","normalizeValue","iteratorFor","iterator","Headers","header","oldValue","callback","thisArg","consumed","fileReaderReady","reader","resolve","reject","readBlobAsArrayBuffer","blob","promise","readBlobAsText","encoding","readArrayBufferAsText","buf","view","chars","bufferClone","Body","rejected","isConsumed","decode","methods","normalizeMethod","method","upcased","Request","input","ctrl","reParamSearch","reQueryString","form","bytes","split","parseHeaders","rawHeaders","preProcessedHeaders","parts","error","Response","bodyInit","redirectStatuses","url","status","fetch","init","xhr","abortXhr","fixUrl","names","ctx","module","resolveHeaders","oHeaders","CrossFetch","CrossFetch.Headers","cleanQuery","buildRequestConfig","params","params_","search","payload","acc","currentQuery","createHttpMethodFetcher","query","fetchOptions","middleware","queryParams","createRequestBody","urlResolved","initResolved","urlNew","initNew","GraphQLClient","requestConfig","rawRequestOptions","crossFetch","requestMiddleware","responseMiddleware","makeRequest","callOrIdentity","variablesAndRequestHeaders","requestOptions","batchRequestOptions","queries","fetcher","isBatchingQuery","getResult","successfullyReceivedData","data","successfullyPassedErrorPolicy","rest","errorResult","jsonSerializer","jsonSerializer_","contentType","gql","chunks","chunk","typeDefs","metaParser","_key","doctype","client","getMeta"],"mappings":";;;;;;;;;;;;;;;;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAcA,IAAIA,KAAY,MAIdC,KAAa,KAGbC,KAAW,oBAGXC,KAAO,sgCAGPC,KAAK,sgCAILC,KAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAOT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBX,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeV,QAAQ;AAAA;AAAA;AAAA;AAAA,EAIR,UAAU;AAAA;AAAA;AAAA;AAAA,EAIV,UAAW;AAAA;AAAA;AAAA;AAAA,EAIX,MAAM,CAACL;AAAA;AAAA;AAAA;AAAA,EAIP,MAAMA;AAAA;AAAA;AAAA,EAGN,QAAQ;AAAA;AACZ,GAMEM,IAASC,GACTC,IAAW,IAEXC,KAAe,mBACfC,KAAkBD,KAAe,sBACjCE,KAAyBF,KAAe,4BACxCG,KAAoBH,KAAe,sBACnCI,KAAM,oBAENC,IAAY,KAAK,OACjBC,IAAU,KAAK,KAEfC,KAAW,8CACXC,KAAQ,0DACRC,KAAU,iDACVC,KAAY,sCAEZC,IAAO,KACPC,IAAW,GACXC,KAAmB,kBAEnBC,KAAiBpB,GAAK,SAAS,GAC/BqB,KAAepB,GAAG,SAAS,GAG3BqB,IAAI,EAAE,aAAaZ;AA0ErBY,EAAE,gBAAgBA,EAAE,MAAM,WAAY;AACpC,MAAIC,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,SAAIA,EAAE,IAAI,MAAGA,EAAE,IAAI,IACZC,EAASD,CAAC;AACnB;AAQAD,EAAE,OAAO,WAAY;AACnB,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAWAF,EAAE,YAAYA,EAAE,QAAQ,SAAUG,GAAKC,GAAK;AAC1C,MAAIC,GACFJ,IAAI,MACJK,IAAOL,EAAE;AAGX,MAFAE,IAAM,IAAIG,EAAKH,CAAG,GAClBC,IAAM,IAAIE,EAAKF,CAAG,GACd,CAACD,EAAI,KAAK,CAACC,EAAI,EAAG,QAAO,IAAIE,EAAK,GAAG;AACzC,MAAIH,EAAI,GAAGC,CAAG,EAAG,OAAM,MAAMnB,KAAkBmB,CAAG;AAClD,SAAAC,IAAIJ,EAAE,IAAIE,CAAG,GACNE,IAAI,IAAIF,IAAMF,EAAE,IAAIG,CAAG,IAAI,IAAIA,IAAM,IAAIE,EAAKL,CAAC;AACxD;AAWAD,EAAE,aAAaA,EAAE,MAAM,SAAUO,GAAG;AAClC,MAAIC,GAAGC,GAAGC,GAAKC,GACbV,IAAI,MACJW,IAAKX,EAAE,GACPY,KAAMN,IAAI,IAAIN,EAAE,YAAYM,CAAC,GAAG,GAChCO,IAAKb,EAAE,GACPc,IAAKR,EAAE;AAGT,MAAI,CAACK,KAAM,CAACC;AACV,WAAO,CAACC,KAAM,CAACC,IAAK,MAAMD,MAAOC,IAAKD,IAAKF,MAAOC,IAAK,IAAI,CAACD,IAAKE,IAAK,IAAI,IAAI;AAIhF,MAAI,CAACF,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC,EAAG,QAAOD,EAAG,CAAC,IAAIE,IAAKD,EAAG,CAAC,IAAI,CAACE,IAAK;AAGxD,MAAID,MAAOC,EAAI,QAAOD;AAGtB,MAAIb,EAAE,MAAMM,EAAE,EAAG,QAAON,EAAE,IAAIM,EAAE,IAAIO,IAAK,IAAI,IAAI;AAMjD,OAJAJ,IAAME,EAAG,QACTD,IAAME,EAAG,QAGJL,IAAI,GAAGC,IAAIC,IAAMC,IAAMD,IAAMC,GAAKH,IAAIC,GAAG,EAAED;AAC9C,QAAII,EAAGJ,CAAC,MAAMK,EAAGL,CAAC,EAAG,QAAOI,EAAGJ,CAAC,IAAIK,EAAGL,CAAC,IAAIM,IAAK,IAAI,IAAI;AAI3D,SAAOJ,MAAQC,IAAM,IAAID,IAAMC,IAAMG,IAAK,IAAI,IAAI;AACpD;AAgBAd,EAAE,SAASA,EAAE,MAAM,WAAY;AAC7B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,IAGFA,EAAE,EAAE,CAAC,KAEVe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAIL,GAC9CU,EAAK,WAAW,GAEhBL,IAAIiB,GAAOZ,GAAMa,GAAiBb,GAAML,CAAC,CAAC,GAE1CK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,KAAY,KAAKA,KAAY,IAAImB,EAAE,IAAG,IAAKA,GAAGe,GAAIC,GAAI,EAAI,KAZtD,IAAIX,EAAK,CAAC,IAHb,IAAIA,EAAK,GAAG;AAgB/B;AAmBAN,EAAE,WAAWA,EAAE,OAAO,WAAY;AAChC,MAAI,GAAGoB,GAAG,GAAGC,GAAGC,GAAK,GAAGC,GAAIC,GAAGC,GAAIC,GACjCzB,IAAI,MACJK,IAAOL,EAAE;AAEX,MAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,EAAI,QAAO,IAAIK,EAAKL,CAAC;AAoClD,OAnCAlB,IAAW,IAGX,IAAIkB,EAAE,IAAIX,EAAQW,EAAE,IAAIA,GAAG,IAAI,CAAC,GAI5B,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,SACvB,IAAI0B,EAAe1B,EAAE,CAAC,GACtB,IAAIA,EAAE,IAGF,KAAK,IAAI,EAAE,SAAS,KAAK,OAAG,KAAM,KAAK,KAAK,KAAK,KAAK,MAAM,OAChE,IAAIX,EAAQ,GAAG,IAAI,CAAC,GAGpB,IAAID,GAAW,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,IAAI,IAAI,KAAK,KAEjD,KAAK,QACP,IAAI,OAAO,KAEX,IAAI,EAAE,iBACN,IAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI,IAGvCgC,IAAI,IAAIf,EAAK,CAAC,GACde,EAAE,IAAIpB,EAAE,KAERoB,IAAI,IAAIf,EAAK,EAAE,SAAQ,CAAE,GAG3BiB,KAAM,IAAIjB,EAAK,aAAa;AAW1B,QANAkB,IAAIH,GACJI,IAAKD,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,GACvBE,IAAUD,EAAG,KAAKxB,CAAC,GACnBoB,IAAIO,EAAOF,EAAQ,KAAKzB,CAAC,EAAE,MAAMuB,CAAC,GAAGE,EAAQ,KAAKD,CAAE,GAAGF,IAAK,GAAG,CAAC,GAG5DI,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGD,CAAE,OAAO,IAAII,EAAeN,EAAE,CAAC,GAAG,MAAM,GAAGE,CAAE;AAK5E,UAJA,IAAI,EAAE,MAAMA,IAAK,GAAGA,IAAK,CAAC,GAItB,KAAK,UAAU,CAACD,KAAO,KAAK,QAAQ;AAItC,YAAI,CAACA,MACHpB,EAASsB,GAAG,IAAI,GAAG,CAAC,GAEhBA,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAGvB,CAAC,IAAG;AAC7B,UAAAoB,IAAIG;AACJ;AAAA,QACF;AAGF,QAAAD,KAAM,GACND,IAAM;AAAA,MACR,OAAO;AAIL,SAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,SAGxCpB,EAASmB,GAAG,IAAI,GAAG,CAAC,GACpBD,IAAI,CAACC,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAGpB,CAAC;AAG/B;AAAA,MACF;AAIJ,SAAAlB,IAAW,IAEJmB,EAASmB,GAAG,GAAGf,EAAK,UAAUc,CAAC;AACxC;AAOApB,EAAE,gBAAgBA,EAAE,KAAK,WAAY;AACnC,MAAI6B,GACFC,IAAI,KAAK,GACT,IAAI;AAEN,MAAIA,GAAG;AAML,QALAD,IAAIC,EAAE,SAAS,GACf,KAAKD,IAAIxC,EAAU,KAAK,IAAIO,CAAQ,KAAKA,GAGzCiC,IAAIC,EAAED,CAAC,GACHA,EAAG,QAAOA,IAAI,MAAM,GAAGA,KAAK,GAAI;AACpC,IAAI,IAAI,MAAG,IAAI;AAAA,EACjB;AAEA,SAAO;AACT;AAwBA7B,EAAE,YAAYA,EAAE,MAAM,SAAUO,GAAG;AACjC,SAAOqB,EAAO,MAAM,IAAI,KAAK,YAAYrB,CAAC,CAAC;AAC7C;AAQAP,EAAE,qBAAqBA,EAAE,WAAW,SAAUO,GAAG;AAC/C,MAAIN,IAAI,MACNK,IAAOL,EAAE;AACX,SAAOC,EAAS0B,EAAO3B,GAAG,IAAIK,EAAKC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAGD,EAAK,WAAWA,EAAK,QAAQ;AAChF;AAOAN,EAAE,SAASA,EAAE,KAAK,SAAUO,GAAG;AAC7B,SAAO,KAAK,IAAIA,CAAC,MAAM;AACzB;AAQAP,EAAE,QAAQ,WAAY;AACpB,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQAF,EAAE,cAAcA,EAAE,KAAK,SAAUO,GAAG;AAClC,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAQAP,EAAE,uBAAuBA,EAAE,MAAM,SAAUO,GAAG;AAC5C,MAAIF,IAAI,KAAK,IAAIE,CAAC;AAClB,SAAOF,KAAK,KAAKA,MAAM;AACzB;AA4BAL,EAAE,mBAAmBA,EAAE,OAAO,WAAY;AACxC,MAAIK,GAAG0B,GAAGf,GAAIC,GAAIe,GAChB/B,IAAI,MACJK,IAAOL,EAAE,aACTgC,IAAM,IAAI3B,EAAK,CAAC;AAElB,MAAI,CAACL,EAAE,SAAQ,EAAI,QAAO,IAAIK,EAAKL,EAAE,IAAI,QAAQ,GAAG;AACpD,MAAIA,EAAE,SAAU,QAAOgC;AAEvB,EAAAjB,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC9CK,EAAK,WAAW,GAChB0B,IAAM/B,EAAE,EAAE,QAON+B,IAAM,MACR3B,IAAI,KAAK,KAAK2B,IAAM,CAAC,GACrBD,KAAK,IAAIG,GAAQ,GAAG7B,CAAC,GAAG,eAExBA,IAAI,IACJ0B,IAAI,iCAGN9B,IAAIkC,GAAa7B,GAAM,GAAGL,EAAE,MAAM8B,CAAC,GAAG,IAAIzB,EAAK,CAAC,GAAG,EAAI;AAMvD,WAHI8B,GACF5B,IAAIH,GACJgC,IAAK,IAAI/B,EAAK,CAAC,GACVE;AACL,IAAA4B,IAAUnC,EAAE,MAAMA,CAAC,GACnBA,IAAIgC,EAAI,MAAMG,EAAQ,MAAMC,EAAG,MAAMD,EAAQ,MAAMC,CAAE,CAAC,CAAC,CAAC;AAG1D,SAAOnC,EAASD,GAAGK,EAAK,YAAYU,GAAIV,EAAK,WAAWW,GAAI,EAAI;AAClE;AAiCAjB,EAAE,iBAAiBA,EAAE,OAAO,WAAY;AACtC,MAAIK,GAAGW,GAAIC,GAAIe,GACb/B,IAAI,MACJK,IAAOL,EAAE;AAEX,MAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,EAAI,QAAO,IAAIK,EAAKL,CAAC;AAQlD,MANAe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC9CK,EAAK,WAAW,GAChB0B,IAAM/B,EAAE,EAAE,QAEN+B,IAAM;AACR,IAAA/B,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,GAAG,EAAI;AAAA,OAC/B;AAWL,IAAAI,IAAI,MAAM,KAAK,KAAK2B,CAAG,GACvB3B,IAAIA,IAAI,KAAK,KAAKA,IAAI,GAEtBJ,IAAIA,EAAE,MAAM,IAAIiC,GAAQ,GAAG7B,CAAC,CAAC,GAC7BJ,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,GAAG,EAAI;AAOpC,aAJIqC,GACFC,IAAK,IAAIjC,EAAK,CAAC,GACfkC,IAAM,IAAIlC,EAAK,EAAE,GACjBmC,IAAM,IAAInC,EAAK,EAAE,GACZD;AACL,MAAAiC,IAAUrC,EAAE,MAAMA,CAAC,GACnBA,IAAIA,EAAE,MAAMsC,EAAG,KAAKD,EAAQ,MAAME,EAAI,MAAMF,CAAO,EAAE,KAAKG,CAAG,CAAC,CAAC,CAAC;AAAA,EAEpE;AAEA,SAAAnC,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASD,GAAGe,GAAIC,GAAI,EAAI;AACjC;AAmBAjB,EAAE,oBAAoBA,EAAE,OAAO,WAAY;AACzC,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAETsB,EAAO3B,EAAE,KAAI,GAAIA,EAAE,KAAI,GAAIK,EAAK,YAAYU,GAAIV,EAAK,WAAWW,CAAE,KAR/C,IAAIX,EAAKL,EAAE,CAAC;AASxC;AAsBAD,EAAE,gBAAgBA,EAAE,OAAO,WAAY;AACrC,MAAI0C,GACFzC,IAAI,MACJK,IAAOL,EAAE,aACTI,IAAIJ,EAAE,MAAM,IAAI,CAAC,GACjBe,IAAKV,EAAK,WACVW,IAAKX,EAAK;AAEZ,SAAID,MAAM,KACDA,MAAM,IAETJ,EAAE,UAAU0C,EAAMrC,GAAMU,GAAIC,CAAE,IAAI,IAAIX,EAAK,CAAC,IAE5C,IAAIA,EAAK,GAAG,IAGdL,EAAE,WAAiB0C,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,KAIxDX,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,QACNyC,IAASC,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GAE1CX,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETyB,EAAO,MAAMzC,CAAC;AACvB;AAsBAD,EAAE,0BAA0BA,EAAE,QAAQ,WAAY;AAChD,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIA,EAAE,IAAI,CAAC,IAAU,IAAIK,EAAKL,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,IAC1CA,EAAE,SAAQ,KAEfe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAI,KAAK,IAAIf,EAAE,CAAC,GAAGA,EAAE,GAAE,CAAE,IAAI,GACxDK,EAAK,WAAW,GAChBvB,IAAW,IAEXkB,IAAIA,EAAE,MAAMA,CAAC,EAAE,MAAM,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,GAErClB,IAAW,IACXuB,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,QAdiB,IAAIK,EAAKL,CAAC;AAetC;AAmBAD,EAAE,wBAAwBA,EAAE,QAAQ,WAAY;AAC9C,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAElDe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,IAAI,KAAK,IAAI,KAAK,IAAIf,EAAE,CAAC,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC5DK,EAAK,WAAW,GAChBvB,IAAW,IAEXkB,IAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,GAEpClB,IAAW,IACXuB,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE;AACX;AAsBAD,EAAE,2BAA2BA,EAAE,QAAQ,WAAY;AACjD,MAAIgB,GAAIC,GAAI2B,GAAKC,GACf5C,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,KAAK,IAAU,IAAIK,EAAKL,EAAE,IAAG,EAAG,GAAG,CAAC,IAAIA,EAAE,IAAI,IAAIA,EAAE,WAAWA,IAAI,GAAG,KAE5Ee,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVuC,IAAM5C,EAAE,MAEJ,KAAK,IAAI4C,GAAK7B,CAAE,IAAI,IAAI,CAACf,EAAE,IAAI,IAAUC,EAAS,IAAII,EAAKL,CAAC,GAAGe,GAAIC,GAAI,EAAI,KAE/EX,EAAK,YAAYsC,IAAMC,IAAM5C,EAAE,GAE/BA,IAAI2B,EAAO3B,EAAE,KAAK,CAAC,GAAG,IAAIK,EAAK,CAAC,EAAE,MAAML,CAAC,GAAG2C,IAAM5B,GAAI,CAAC,GAEvDV,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,MAENK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,MAAM,GAAG,MArBQ,IAAIK,EAAK,GAAG;AAsBxC;AAwBAN,EAAE,cAAcA,EAAE,OAAO,WAAY;AACnC,MAAI0C,GAAQrC,GACVW,GAAIC,GACJhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCI,IAAIJ,EAAE,IAAG,EAAG,IAAI,CAAC,GACjBe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAEND,MAAM,KAGJA,MAAM,KACRqC,IAASC,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GAC1CyB,EAAO,IAAIzC,EAAE,GACNyC,KAIF,IAAIpC,EAAK,GAAG,KAKrBA,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,IAAI,IAAIK,EAAK,CAAC,EAAE,MAAML,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC,EAAE,QAExDK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,MAAM,CAAC;AAClB;AAqBAD,EAAE,iBAAiBA,EAAE,OAAO,WAAY;AACtC,MAAIQ,GAAGC,GAAGJ,GAAG0B,GAAGe,GAAItB,GAAGH,GAAGuB,GAAKG,GAC7B9C,IAAI,MACJK,IAAOL,EAAE,aACTe,IAAKV,EAAK,WACVW,IAAKX,EAAK;AAEZ,MAAKL,EAAE,YAOA;AAAA,QAAIA,EAAE;AACX,aAAO,IAAIK,EAAKL,CAAC;AACZ,QAAIA,EAAE,MAAM,GAAG,CAAC,KAAKe,IAAK,KAAKjB;AACpC,aAAAsB,IAAIsB,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,IAAI,GACtCI,EAAE,IAAIpB,EAAE,GACDoB;AAAA,SAZU;AACjB,QAAI,CAACpB,EAAE,EAAG,QAAO,IAAIK,EAAK,GAAG;AAC7B,QAAIU,IAAK,KAAKjB;AACZ,aAAAsB,IAAIsB,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GACrCI,EAAE,IAAIpB,EAAE,GACDoB;AAAA,EAEX;AAmBA,OAXAf,EAAK,YAAYsC,IAAM5B,IAAK,IAC5BV,EAAK,WAAW,GAQhBD,IAAI,KAAK,IAAI,IAAIuC,IAAMhD,IAAW,IAAI,CAAC,GAElCY,IAAIH,GAAGG,GAAG,EAAEA,EAAG,CAAAP,IAAIA,EAAE,IAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC;AAW/D,OATAlB,IAAW,IAEX0B,IAAI,KAAK,KAAKmC,IAAMhD,CAAQ,GAC5BmC,IAAI,GACJgB,IAAK9C,EAAE,MAAMA,CAAC,GACdoB,IAAI,IAAIf,EAAKL,CAAC,GACd6C,IAAK7C,GAGEO,MAAM;AAOX,QANAsC,IAAKA,EAAG,MAAMC,CAAE,GAChBvB,IAAIH,EAAE,MAAMyB,EAAG,IAAIf,KAAK,CAAC,CAAC,GAE1Be,IAAKA,EAAG,MAAMC,CAAE,GAChB1B,IAAIG,EAAE,KAAKsB,EAAG,IAAIf,KAAK,CAAC,CAAC,GAErBV,EAAE,EAAEZ,CAAC,MAAM,OAAQ,MAAKD,IAAIC,GAAGY,EAAE,EAAEb,CAAC,MAAMgB,EAAE,EAAEhB,CAAC,KAAKA,MAAK;AAG/D,SAAIH,MAAGgB,IAAIA,EAAE,MAAM,KAAMhB,IAAI,CAAE,IAE/BtB,IAAW,IAEJmB,EAASmB,GAAGf,EAAK,YAAYU,GAAIV,EAAK,WAAWW,GAAI,EAAI;AAClE;AAOAjB,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC,CAAC,KAAK;AAChB;AAOAA,EAAE,YAAYA,EAAE,QAAQ,WAAY;AAClC,SAAO,CAAC,CAAC,KAAK,KAAKX,EAAU,KAAK,IAAIO,CAAQ,IAAI,KAAK,EAAE,SAAS;AACpE;AAOAI,EAAE,QAAQ,WAAY;AACpB,SAAO,CAAC,KAAK;AACf;AAOAA,EAAE,aAAaA,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOAA,EAAE,aAAaA,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOAA,EAAE,SAAS,WAAY;AACrB,SAAO,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC,MAAM;AACnC;AAOAA,EAAE,WAAWA,EAAE,KAAK,SAAUO,GAAG;AAC/B,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAOAP,EAAE,oBAAoBA,EAAE,MAAM,SAAUO,GAAG;AACzC,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAiCAP,EAAE,YAAYA,EAAE,MAAM,SAAUgD,GAAM;AACpC,MAAIC,GAAUnB,GAAGoB,GAAa7C,GAAG8C,GAAKC,GAAK7B,GAAIF,GAC7CgC,IAAM,MACN/C,IAAO+C,EAAI,aACXrC,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVgD,IAAQ;AAGV,MAAIN,KAAQ;AACV,IAAAA,IAAO,IAAI1C,EAAK,EAAE,GAClB2C,IAAW;AAAA,OACN;AAKL,QAJAD,IAAO,IAAI1C,EAAK0C,CAAI,GACpBlB,IAAIkB,EAAK,GAGLA,EAAK,IAAI,KAAK,CAAClB,KAAK,CAACA,EAAE,CAAC,KAAKkB,EAAK,GAAG,CAAC,EAAG,QAAO,IAAI1C,EAAK,GAAG;AAEhE,IAAA2C,IAAWD,EAAK,GAAG,EAAE;AAAA,EACvB;AAKA,MAHAlB,IAAIuB,EAAI,GAGJA,EAAI,IAAI,KAAK,CAACvB,KAAK,CAACA,EAAE,CAAC,KAAKuB,EAAI,GAAG,CAAC;AACtC,WAAO,IAAI/C,EAAKwB,KAAK,CAACA,EAAE,CAAC,IAAI,SAASuB,EAAI,KAAK,IAAI,MAAMvB,IAAI,IAAI,KAAK;AAKxE,MAAImB;AACF,QAAInB,EAAE,SAAS;AACb,MAAAqB,IAAM;AAAA,SACD;AACL,WAAK9C,IAAIyB,EAAE,CAAC,GAAGzB,IAAI,OAAO,IAAI,CAAAA,KAAK;AACnC,MAAA8C,IAAM9C,MAAM;AAAA,IACd;AAyBF,MAtBAtB,IAAW,IACXwC,IAAKP,IAAKsC,GACVF,IAAMG,GAAiBF,GAAK9B,CAAE,GAC9B2B,IAAcD,IAAWO,GAAQlD,GAAMiB,IAAK,EAAE,IAAIgC,GAAiBP,GAAMzB,CAAE,GAG3EF,IAAIO,EAAOwB,GAAKF,GAAa3B,GAAI,CAAC,GAgB9BkC,GAAoBpC,EAAE,GAAGhB,IAAIW,GAAIC,CAAE;AAErC;AAME,UALAM,KAAM,IACN6B,IAAMG,GAAiBF,GAAK9B,CAAE,GAC9B2B,IAAcD,IAAWO,GAAQlD,GAAMiB,IAAK,EAAE,IAAIgC,GAAiBP,GAAMzB,CAAE,GAC3EF,IAAIO,EAAOwB,GAAKF,GAAa3B,GAAI,CAAC,GAE9B,CAAC4B,GAAK;AAGR,QAAI,CAACxB,EAAeN,EAAE,CAAC,EAAE,MAAMhB,IAAI,GAAGA,IAAI,EAAE,IAAI,KAAK,SACnDgB,IAAInB,EAASmB,GAAGL,IAAK,GAAG,CAAC;AAG3B;AAAA,MACF;AAAA,WACOyC,GAAoBpC,EAAE,GAAGhB,KAAK,IAAIY,CAAE;AAG/C,SAAAlC,IAAW,IAEJmB,EAASmB,GAAGL,GAAIC,CAAE;AAC3B;AAgDAjB,EAAE,QAAQA,EAAE,MAAM,SAAUO,GAAG;AAC7B,MAAIuB,GAAG4B,GAAG,GAAGjD,GAAGJ,GAAG2B,GAAKhB,GAAIC,GAAIL,GAAI+C,GAAIC,GAAM/C,GAC5CZ,IAAI,MACJK,IAAOL,EAAE;AAKX,MAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE;AAGb,WAAI,CAACN,EAAE,KAAK,CAACM,EAAE,IAAGA,IAAI,IAAID,EAAK,GAAG,IAGzBL,EAAE,IAAGM,EAAE,IAAI,CAACA,EAAE,IAKlBA,IAAI,IAAID,EAAKC,EAAE,KAAKN,EAAE,MAAMM,EAAE,IAAIN,IAAI,GAAG,GAEvCM;AAIT,MAAIN,EAAE,KAAKM,EAAE;AACX,WAAAA,EAAE,IAAI,CAACA,EAAE,GACFN,EAAE,KAAKM,CAAC;AASjB,MANAK,IAAKX,EAAE,GACPY,IAAKN,EAAE,GACPS,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAGN,CAACM,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC,GAAG;AAGpB,QAAIA,EAAG,CAAC,EAAG,CAAAN,EAAE,IAAI,CAACA,EAAE;AAAA,aAGXK,EAAG,CAAC,EAAG,CAAAL,IAAI,IAAID,EAAKL,CAAC;AAAA,QAIzB,QAAO,IAAIK,EAAKW,MAAO,IAAI,KAAK,CAAC;AAEtC,WAAOlC,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAAA,EAC1C;AAYA,MAPAmD,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAC5B+D,IAAKtE,EAAUY,EAAE,IAAIL,CAAQ,GAE7BgB,IAAKA,EAAG,SACRP,IAAIsD,IAAKD,GAGLrD,GAAG;AAyBL,SAxBAuD,IAAOvD,IAAI,GAEPuD,KACF9B,IAAIlB,GACJP,IAAI,CAACA,GACL2B,IAAMnB,EAAG,WAETiB,IAAIjB,GACJ6C,IAAIC,GACJ3B,IAAMpB,EAAG,SAMX,IAAI,KAAK,IAAI,KAAK,KAAKI,IAAKpB,CAAQ,GAAGoC,CAAG,IAAI,GAE1C3B,IAAI,MACNA,IAAI,GACJyB,EAAE,SAAS,IAIbA,EAAE,QAAO,GACJ,IAAIzB,GAAG,MAAM,CAAAyB,EAAE,KAAK,CAAC;AAC1B,IAAAA,EAAE,QAAO;AAAA,EAGX,OAAO;AASL,SALA,IAAIlB,EAAG,QACPoB,IAAMnB,EAAG,QACT+C,IAAO,IAAI5B,GACP4B,MAAM5B,IAAM,IAEX,IAAI,GAAG,IAAIA,GAAK;AACnB,UAAIpB,EAAG,CAAC,KAAKC,EAAG,CAAC,GAAG;AAClB,QAAA+C,IAAOhD,EAAG,CAAC,IAAIC,EAAG,CAAC;AACnB;AAAA,MACF;AAGF,IAAAR,IAAI;AAAA,EACN;AAaA,OAXIuD,MACF9B,IAAIlB,GACJA,IAAKC,GACLA,IAAKiB,GACLvB,EAAE,IAAI,CAACA,EAAE,IAGXyB,IAAMpB,EAAG,QAIJ,IAAIC,EAAG,SAASmB,GAAK,IAAI,GAAG,EAAE,EAAG,CAAApB,EAAGoB,GAAK,IAAI;AAGlD,OAAK,IAAInB,EAAG,QAAQ,IAAIR,KAAI;AAE1B,QAAIO,EAAG,EAAE,CAAC,IAAIC,EAAG,CAAC,GAAG;AACnB,WAAKJ,IAAI,GAAGA,KAAKG,EAAG,EAAEH,CAAC,MAAM,IAAI,CAAAG,EAAGH,CAAC,IAAId,IAAO;AAChD,QAAEiB,EAAGH,CAAC,GACNG,EAAG,CAAC,KAAKjB;AAAA,IACX;AAEA,IAAAiB,EAAG,CAAC,KAAKC,EAAG,CAAC;AAAA,EACf;AAGA,SAAOD,EAAG,EAAEoB,CAAG,MAAM,IAAI,CAAApB,EAAG;AAG5B,SAAOA,EAAG,CAAC,MAAM,GAAGA,EAAG,MAAK,EAAI,GAAE8C;AAGlC,SAAK9C,EAAG,CAAC,KAETL,EAAE,IAAIK,GACNL,EAAE,IAAIsD,GAAkBjD,GAAI8C,CAAC,GAEtB3E,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV,KALrB,IAAID,EAAKW,MAAO,IAAI,KAAK,CAAC;AAM/C;AA2BAjB,EAAE,SAASA,EAAE,MAAM,SAAUO,GAAG;AAC9B,MAAIuD,GACF7D,IAAI,MACJK,IAAOL,EAAE;AAKX,SAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE,KAAKA,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,IAAU,IAAID,EAAK,GAAG,IAGnD,CAACC,EAAE,KAAKN,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,IAChBC,EAAS,IAAII,EAAKL,CAAC,GAAGK,EAAK,WAAWA,EAAK,QAAQ,KAI5DvB,IAAW,IAEPuB,EAAK,UAAU,KAIjBwD,IAAIlC,EAAO3B,GAAGM,EAAE,IAAG,GAAI,GAAG,GAAG,CAAC,GAC9BuD,EAAE,KAAKvD,EAAE,KAETuD,IAAIlC,EAAO3B,GAAGM,GAAG,GAAGD,EAAK,QAAQ,CAAC,GAGpCwD,IAAIA,EAAE,MAAMvD,CAAC,GAEbxB,IAAW,IAEJkB,EAAE,MAAM6D,CAAC;AAClB;AASA9D,EAAE,qBAAqBA,EAAE,MAAM,WAAY;AACzC,SAAO+D,GAAmB,IAAI;AAChC;AAQA/D,EAAE,mBAAmBA,EAAE,KAAK,WAAY;AACtC,SAAOuD,GAAiB,IAAI;AAC9B;AAQAvD,EAAE,UAAUA,EAAE,MAAM,WAAY;AAC9B,MAAIC,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,SAAAA,EAAE,IAAI,CAACA,EAAE,GACFC,EAASD,CAAC;AACnB;AAwBAD,EAAE,OAAOA,EAAE,MAAM,SAAUO,GAAG;AAC5B,MAAIyD,GAAOlC,GAAG4B,GAAGlD,GAAGH,GAAG2B,GAAKhB,GAAIC,GAAIL,GAAIC,GACtCZ,IAAI,MACJK,IAAOL,EAAE;AAKX,MAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE;AAGb,WAAI,CAACN,EAAE,KAAK,CAACM,EAAE,IAAGA,IAAI,IAAID,EAAK,GAAG,IAMxBL,EAAE,MAAGM,IAAI,IAAID,EAAKC,EAAE,KAAKN,EAAE,MAAMM,EAAE,IAAIN,IAAI,GAAG,IAEjDM;AAIT,MAAIN,EAAE,KAAKM,EAAE;AACX,WAAAA,EAAE,IAAI,CAACA,EAAE,GACFN,EAAE,MAAMM,CAAC;AASlB,MANAK,IAAKX,EAAE,GACPY,IAAKN,EAAE,GACPS,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAGN,CAACM,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC;AAIjB,WAAKA,EAAG,CAAC,MAAGN,IAAI,IAAID,EAAKL,CAAC,IAEnBlB,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAa1C,MAPAF,IAAIhB,EAAUY,EAAE,IAAIL,CAAQ,GAC5B8D,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAE5BgB,IAAKA,EAAG,SACRJ,IAAIH,IAAIqD,GAGJlD,GAAG;AAuBL,SArBIA,IAAI,KACNsB,IAAIlB,GACJJ,IAAI,CAACA,GACLwB,IAAMnB,EAAG,WAETiB,IAAIjB,GACJ6C,IAAIrD,GACJ2B,IAAMpB,EAAG,SAIXP,IAAI,KAAK,KAAKW,IAAKpB,CAAQ,GAC3BoC,IAAM3B,IAAI2B,IAAM3B,IAAI,IAAI2B,IAAM,GAE1BxB,IAAIwB,MACNxB,IAAIwB,GACJF,EAAE,SAAS,IAIbA,EAAE,QAAO,GACFtB,MAAM,CAAAsB,EAAE,KAAK,CAAC;AACrB,IAAAA,EAAE,QAAO;AAAA,EACX;AAcA,OAZAE,IAAMpB,EAAG,QACTJ,IAAIK,EAAG,QAGHmB,IAAMxB,IAAI,MACZA,IAAIwB,GACJF,IAAIjB,GACJA,IAAKD,GACLA,IAAKkB,IAIFkC,IAAQ,GAAGxD;AACd,IAAAwD,KAASpD,EAAG,EAAEJ,CAAC,IAAII,EAAGJ,CAAC,IAAIK,EAAGL,CAAC,IAAIwD,KAASrE,IAAO,GACnDiB,EAAGJ,CAAC,KAAKb;AAUX,OAPIqE,MACFpD,EAAG,QAAQoD,CAAK,GAChB,EAAEN,IAKC1B,IAAMpB,EAAG,QAAQA,EAAG,EAAEoB,CAAG,KAAK,IAAI,CAAApB,EAAG;AAE1C,SAAAL,EAAE,IAAIK,GACNL,EAAE,IAAIsD,GAAkBjD,GAAI8C,CAAC,GAEtB3E,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAC1C;AASAP,EAAE,YAAYA,EAAE,KAAK,SAAUiE,GAAG;AAChC,MAAI5D,GACFJ,IAAI;AAEN,MAAIgE,MAAM,UAAUA,MAAM,CAAC,CAACA,KAAKA,MAAM,KAAKA,MAAM,EAAG,OAAM,MAAMhF,KAAkBgF,CAAC;AAEpF,SAAIhE,EAAE,KACJI,IAAI6D,GAAajE,EAAE,CAAC,GAChBgE,KAAKhE,EAAE,IAAI,IAAII,MAAGA,IAAIJ,EAAE,IAAI,MAEhCI,IAAI,KAGCA;AACT;AAQAL,EAAE,QAAQ,WAAY;AACpB,MAAIC,IAAI,MACNK,IAAOL,EAAE;AAEX,SAAOC,EAAS,IAAII,EAAKL,CAAC,GAAGA,EAAE,IAAI,GAAGK,EAAK,QAAQ;AACrD;AAkBAN,EAAE,OAAOA,EAAE,MAAM,WAAY;AAC3B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAIL,GAC9CU,EAAK,WAAW,GAEhBL,IAAIkE,GAAK7D,GAAMa,GAAiBb,GAAML,CAAC,CAAC,GAExCK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,IAAW,IAAImB,EAAE,QAAQA,GAAGe,GAAIC,GAAI,EAAI,KAb9B,IAAIX,EAAK,GAAG;AAcxC;AAeAN,EAAE,aAAaA,EAAE,OAAO,WAAY;AAClC,MAAIoB,GAAGW,GAAGR,GAAIF,GAAGC,GAAKE,GACpBvB,IAAI,MACJ6B,IAAI7B,EAAE,GACNyD,IAAIzD,EAAE,GACNmE,IAAInE,EAAE,GACNK,IAAOL,EAAE;AAGX,MAAImE,MAAM,KAAK,CAACtC,KAAK,CAACA,EAAE,CAAC;AACvB,WAAO,IAAIxB,EAAK,CAAC8D,KAAKA,IAAI,MAAM,CAACtC,KAAKA,EAAE,CAAC,KAAK,MAAMA,IAAI7B,IAAI,KAAK;AAgCnE,OA7BAlB,IAAW,IAGXqF,IAAI,KAAK,KAAK,CAACnE,CAAC,GAIZmE,KAAK,KAAKA,KAAK,SACjBrC,IAAIJ,EAAeG,CAAC,IAEfC,EAAE,SAAS2B,KAAK,KAAK,MAAG3B,KAAK,MAClCqC,IAAI,KAAK,KAAKrC,CAAC,GACf2B,IAAIrE,GAAWqE,IAAI,KAAK,CAAC,KAAKA,IAAI,KAAKA,IAAI,IAEvCU,KAAK,QACPrC,IAAI,OAAO2B,KAEX3B,IAAIqC,EAAE,iBACNrC,IAAIA,EAAE,MAAM,GAAGA,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI2B,IAGvCrC,IAAI,IAAIf,EAAKyB,CAAC,KAEdV,IAAI,IAAIf,EAAK8D,EAAE,SAAQ,CAAE,GAG3B7C,KAAMmC,IAAIpD,EAAK,aAAa;AAQ1B,QAJAkB,IAAIH,GACJA,IAAIG,EAAE,KAAKI,EAAO3B,GAAGuB,GAAGD,IAAK,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,GAGzCI,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGD,CAAE,OAAOQ,IAAIJ,EAAeN,EAAE,CAAC,GAAG,MAAM,GAAGE,CAAE;AAK5E,UAJAQ,IAAIA,EAAE,MAAMR,IAAK,GAAGA,IAAK,CAAC,GAItBQ,KAAK,UAAU,CAACT,KAAOS,KAAK,QAAQ;AAItC,YAAI,CAACT,MACHpB,EAASsB,GAAGkC,IAAI,GAAG,CAAC,GAEhBlC,EAAE,MAAMA,CAAC,EAAE,GAAGvB,CAAC,IAAG;AACpB,UAAAoB,IAAIG;AACJ;AAAA,QACF;AAGF,QAAAD,KAAM,GACND,IAAM;AAAA,MACR,OAAO;AAIL,SAAI,CAAC,CAACS,KAAK,CAAC,CAACA,EAAE,MAAM,CAAC,KAAKA,EAAE,OAAO,CAAC,KAAK,SAGxC7B,EAASmB,GAAGqC,IAAI,GAAG,CAAC,GACpBtC,IAAI,CAACC,EAAE,MAAMA,CAAC,EAAE,GAAGpB,CAAC;AAGtB;AAAA,MACF;AAIJ,SAAAlB,IAAW,IAEJmB,EAASmB,GAAGqC,GAAGpD,EAAK,UAAUc,CAAC;AACxC;AAgBApB,EAAE,UAAUA,EAAE,MAAM,WAAY;AAC9B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,IACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,OACNA,EAAE,IAAI,GACNA,IAAI2B,EAAO3B,GAAG,IAAIK,EAAK,CAAC,EAAE,MAAML,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,GAAIe,IAAK,IAAI,CAAC,GAE9DV,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,KAAY,KAAKA,KAAY,IAAImB,EAAE,IAAG,IAAKA,GAAGe,GAAIC,GAAI,EAAI,KAfhD,IAAIX,EAAK,GAAG;AAgBxC;AAwBAN,EAAE,QAAQA,EAAE,MAAM,SAAUO,GAAG;AAC7B,MAAIyD,GAAON,GAAG,GAAGrD,GAAGgB,GAAGgD,GAAI7C,GAAGd,GAAKC,GACjCV,IAAI,MACJK,IAAOL,EAAE,aACTW,IAAKX,EAAE,GACPY,KAAMN,IAAI,IAAID,EAAKC,CAAC,GAAG;AAKzB,MAHAA,EAAE,KAAKN,EAAE,GAGL,CAACW,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAM,CAACA,EAAG,CAAC;AAE/B,WAAO,IAAIP,EAAK,CAACC,EAAE,KAAKK,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAMA,KAAM,CAACA,EAAG,CAAC,KAAK,CAACD,IAI5D,MAIA,CAACA,KAAM,CAACC,IAAKN,EAAE,IAAI,IAAIA,EAAE,IAAI,CAAC;AAoBpC,OAjBAmD,IAAIrE,EAAUY,EAAE,IAAIL,CAAQ,IAAIP,EAAUkB,EAAE,IAAIX,CAAQ,GACxDc,IAAME,EAAG,QACTD,IAAME,EAAG,QAGLH,IAAMC,MACRU,IAAIT,GACJA,IAAKC,GACLA,IAAKQ,GACLgD,IAAK3D,GACLA,IAAMC,GACNA,IAAM0D,IAIRhD,IAAI,CAAA,GACJgD,IAAK3D,IAAMC,GACN,IAAI0D,GAAI,MAAM,CAAAhD,EAAE,KAAK,CAAC;AAG3B,OAAK,IAAIV,GAAK,EAAE,KAAK,KAAI;AAEvB,SADAqD,IAAQ,GACH3D,IAAIK,IAAM,GAAGL,IAAI;AACpB,MAAAmB,IAAIH,EAAEhB,CAAC,IAAIQ,EAAG,CAAC,IAAID,EAAGP,IAAI,IAAI,CAAC,IAAI2D,GACnC3C,EAAEhB,GAAG,IAAImB,IAAI7B,IAAO,GACpBqE,IAAQxC,IAAI7B,IAAO;AAGrB,IAAA0B,EAAEhB,CAAC,KAAKgB,EAAEhB,CAAC,IAAI2D,KAASrE,IAAO;AAAA,EACjC;AAGA,SAAO,CAAC0B,EAAE,EAAEgD,CAAE,IAAI,CAAAhD,EAAE,IAAG;AAEvB,SAAI2C,IAAO,EAAEN,IACRrC,EAAE,MAAK,GAEZd,EAAE,IAAIc,GACNd,EAAE,IAAIsD,GAAkBxC,GAAGqC,CAAC,GAErB3E,IAAWmB,EAASK,GAAGD,EAAK,WAAWA,EAAK,QAAQ,IAAIC;AACjE;AAaAP,EAAE,WAAW,SAAUuB,GAAIN,GAAI;AAC7B,SAAOqD,GAAe,MAAM,GAAG/C,GAAIN,CAAE;AACvC;AAaAjB,EAAE,kBAAkBA,EAAE,OAAO,SAAUuE,GAAItD,GAAI;AAC7C,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAGX,SADAA,IAAI,IAAIK,EAAKL,CAAC,GACVsE,MAAO,SAAetE,KAE1BuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAEjBf,EAASD,GAAGsE,IAAKtE,EAAE,IAAI,GAAGgB,CAAE;AACrC;AAWAjB,EAAE,gBAAgB,SAAUuE,GAAItD,GAAI;AAClC,MAAIwD,GACFxE,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsE,MAAO,SACTE,IAAMC,EAAezE,GAAG,EAAI,KAE5BuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBhB,IAAIC,EAAS,IAAII,EAAKL,CAAC,GAAGsE,IAAK,GAAGtD,CAAE,GACpCwD,IAAMC,EAAezE,GAAG,IAAMsE,IAAK,CAAC,IAG/BtE,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAmBAzE,EAAE,UAAU,SAAUuE,GAAItD,GAAI;AAC5B,MAAIwD,GAAKlE,GACPN,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsE,MAAO,SACTE,IAAMC,EAAezE,CAAC,KAEtBuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBV,IAAIL,EAAS,IAAII,EAAKL,CAAC,GAAGsE,IAAKtE,EAAE,IAAI,GAAGgB,CAAE,GAC1CwD,IAAMC,EAAenE,GAAG,IAAOgE,IAAKhE,EAAE,IAAI,CAAC,IAKtCN,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAcAzE,EAAE,aAAa,SAAU2E,GAAM;AAC7B,MAAI7C,GAAG8C,GAAIC,GAAIC,GAAIpB,GAAGrD,GAAG0B,GAAGgD,GAAIC,GAAIhE,GAAI8C,GAAGzC,GACzCpB,IAAI,MACJW,IAAKX,EAAE,GACPK,IAAOL,EAAE;AAEX,MAAI,CAACW,EAAI,QAAO,IAAIN,EAAKL,CAAC;AAU1B,MARA+E,IAAKJ,IAAK,IAAItE,EAAK,CAAC,GACpBuE,IAAKE,IAAK,IAAIzE,EAAK,CAAC,GAEpBwB,IAAI,IAAIxB,EAAKuE,CAAE,GACfnB,IAAI5B,EAAE,IAAIoC,GAAatD,CAAE,IAAIX,EAAE,IAAI,GACnCI,IAAIqD,IAAI9D,GACRkC,EAAE,EAAE,CAAC,IAAIxC,EAAQ,IAAIe,IAAI,IAAIT,IAAWS,IAAIA,CAAC,GAEzCsE,KAAQ;AAGV,IAAAA,IAAOjB,IAAI,IAAI5B,IAAIkD;AAAA,OACd;AAEL,QADAjD,IAAI,IAAIzB,EAAKqE,CAAI,GACb,CAAC5C,EAAE,MAAK,KAAMA,EAAE,GAAGiD,CAAE,EAAG,OAAM,MAAM/F,KAAkB8C,CAAC;AAC3D,IAAA4C,IAAO5C,EAAE,GAAGD,CAAC,IAAK4B,IAAI,IAAI5B,IAAIkD,IAAMjD;AAAA,EACtC;AAOA,OALAhD,IAAW,IACXgD,IAAI,IAAIzB,EAAKqB,EAAef,CAAE,CAAC,GAC/BI,IAAKV,EAAK,WACVA,EAAK,YAAYoD,IAAI9C,EAAG,SAAShB,IAAW,GAG1CkE,IAAIlC,EAAOG,GAAGD,GAAG,GAAG,GAAG,CAAC,GACxBgD,IAAKF,EAAG,KAAKd,EAAE,MAAMe,CAAE,CAAC,GACpBC,EAAG,IAAIH,CAAI,KAAK;AACpB,IAAAC,IAAKC,GACLA,IAAKC,GACLA,IAAKE,GACLA,IAAKD,EAAG,KAAKjB,EAAE,MAAMgB,CAAE,CAAC,GACxBC,IAAKD,GACLA,IAAKhD,GACLA,IAAIC,EAAE,MAAM+B,EAAE,MAAMgB,CAAE,CAAC,GACvB/C,IAAI+C;AAGN,SAAAA,IAAKlD,EAAO+C,EAAK,MAAMC,CAAE,GAAGC,GAAI,GAAG,GAAG,CAAC,GACvCE,IAAKA,EAAG,KAAKD,EAAG,MAAME,CAAE,CAAC,GACzBJ,IAAKA,EAAG,KAAKE,EAAG,MAAMD,CAAE,CAAC,GACzBE,EAAG,IAAIC,EAAG,IAAI/E,EAAE,GAGhBoB,IAAIO,EAAOoD,GAAIH,GAAInB,GAAG,CAAC,EAAE,MAAMzD,CAAC,EAAE,IAAG,EAAG,IAAI2B,EAAOmD,GAAIH,GAAIlB,GAAG,CAAC,EAAE,MAAMzD,CAAC,EAAE,IAAG,CAAE,IAAI,IAC7E,CAAC+E,GAAIH,CAAE,IAAI,CAACE,GAAIH,CAAE,GAExBtE,EAAK,YAAYU,GACjBjC,IAAW,IAEJsC;AACT;AAaArB,EAAE,gBAAgBA,EAAE,QAAQ,SAAUuB,GAAIN,GAAI;AAC5C,SAAOqD,GAAe,MAAM,IAAI/C,GAAIN,CAAE;AACxC;AAmBAjB,EAAE,YAAY,SAAUO,GAAGU,GAAI;AAC7B,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAIX,MAFAA,IAAI,IAAIK,EAAKL,CAAC,GAEVM,KAAK,MAAM;AAGb,QAAI,CAACN,EAAE,EAAG,QAAOA;AAEjB,IAAAM,IAAI,IAAID,EAAK,CAAC,GACdW,IAAKX,EAAK;AAAA,EACZ,OAAO;AASL,QARAC,IAAI,IAAID,EAAKC,CAAC,GACVU,MAAO,SACTA,IAAKX,EAAK,WAEVkE,EAAWvD,GAAI,GAAG,CAAC,GAIjB,CAAChB,EAAE,EAAG,QAAOM,EAAE,IAAIN,IAAIM;AAG3B,QAAI,CAACA,EAAE;AACL,aAAIA,EAAE,MAAGA,EAAE,IAAIN,EAAE,IACVM;AAAA,EAEX;AAGA,SAAIA,EAAE,EAAE,CAAC,KACPxB,IAAW,IACXkB,IAAI2B,EAAO3B,GAAGM,GAAG,GAAGU,GAAI,CAAC,EAAE,MAAMV,CAAC,GAClCxB,IAAW,IACXmB,EAASD,CAAC,MAIVM,EAAE,IAAIN,EAAE,GACRA,IAAIM,IAGCN;AACT;AAQAD,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC;AACV;AAaAA,EAAE,UAAU,SAAUuB,GAAIN,GAAI;AAC5B,SAAOqD,GAAe,MAAM,GAAG/C,GAAIN,CAAE;AACvC;AA8CAjB,EAAE,UAAUA,EAAE,MAAM,SAAUO,GAAG;AAC/B,MAAImD,GAAGrD,GAAGW,GAAI,GAAGC,GAAImD,GACnBnE,IAAI,MACJK,IAAOL,EAAE,aACTgF,IAAK,EAAE1E,IAAI,IAAID,EAAKC,CAAC;AAGvB,MAAI,CAACN,EAAE,KAAK,CAACM,EAAE,KAAK,CAACN,EAAE,EAAE,CAAC,KAAK,CAACM,EAAE,EAAE,CAAC,EAAG,QAAO,IAAID,EAAKhB,EAAQ,CAACW,GAAGgF,CAAE,CAAC;AAIvE,MAFAhF,IAAI,IAAIK,EAAKL,CAAC,GAEVA,EAAE,GAAG,CAAC,EAAG,QAAOA;AAKpB,MAHAe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAENC,EAAE,GAAG,CAAC,EAAG,QAAOL,EAASD,GAAGe,GAAIC,CAAE;AAMtC,MAHAyC,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAGxB8D,KAAKnD,EAAE,EAAE,SAAS,MAAMF,IAAI4E,IAAK,IAAI,CAACA,IAAKA,MAAOpF;AACpD,eAAIqF,GAAO5E,GAAML,GAAGI,GAAGW,CAAE,GAClBT,EAAE,IAAI,IAAI,IAAID,EAAK,CAAC,EAAE,IAAI,CAAC,IAAIJ,EAAS,GAAGc,GAAIC,CAAE;AAM1D,MAHAmD,IAAInE,EAAE,GAGFmE,IAAI,GAAG;AAGT,QAAIV,IAAInD,EAAE,EAAE,SAAS,EAAG,QAAO,IAAID,EAAK,GAAG;AAM3C,SAHKC,EAAE,EAAEmD,CAAC,IAAI,MAAM,MAAGU,IAAI,IAGvBnE,EAAE,KAAK,KAAKA,EAAE,EAAE,CAAC,KAAK,KAAKA,EAAE,EAAE,UAAU;AAC3C,aAAAA,EAAE,IAAImE,GACCnE;AAAA,EAEX;AAcA,SARAI,IAAIf,EAAQ,CAACW,GAAGgF,CAAE,GAClBvB,IAAIrD,KAAK,KAAK,CAAC,SAASA,CAAC,IACrBhB,EAAU4F,KAAM,KAAK,IAAI,OAAOtD,EAAe1B,EAAE,CAAC,CAAC,IAAI,KAAK,OAAOA,EAAE,IAAI,EAAE,IAC3E,IAAIK,EAAKD,IAAI,EAAE,EAAE,GAKjBqD,IAAIpD,EAAK,OAAO,KAAKoD,IAAIpD,EAAK,OAAO,IAAU,IAAIA,EAAKoD,IAAI,IAAIU,IAAI,IAAI,CAAC,KAE7ErF,IAAW,IACXuB,EAAK,WAAWL,EAAE,IAAI,GAMtBI,IAAI,KAAK,IAAI,KAAKqD,IAAI,IAAI,MAAM,GAGhC,IAAIK,GAAmBxD,EAAE,MAAMgD,GAAiBtD,GAAGe,IAAKX,CAAC,CAAC,GAAGW,CAAE,GAG3D,EAAE,MAGJ,IAAId,EAAS,GAAGc,IAAK,GAAG,CAAC,GAIrByC,GAAoB,EAAE,GAAGzC,GAAIC,CAAE,MACjCyC,IAAI1C,IAAK,IAGT,IAAId,EAAS6D,GAAmBxD,EAAE,MAAMgD,GAAiBtD,GAAGyD,IAAIrD,CAAC,CAAC,GAAGqD,CAAC,GAAGA,IAAI,GAAG,CAAC,GAG7E,CAAC/B,EAAe,EAAE,CAAC,EAAE,MAAMX,IAAK,GAAGA,IAAK,EAAE,IAAI,KAAK,SACrD,IAAId,EAAS,GAAGc,IAAK,GAAG,CAAC,MAK/B,EAAE,IAAIoD,GACNrF,IAAW,IACXuB,EAAK,WAAWW,GAETf,EAAS,GAAGc,GAAIC,CAAE;AAC3B;AAcAjB,EAAE,cAAc,SAAUuB,GAAIN,GAAI;AAChC,MAAIwD,GACFxE,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsB,MAAO,SACTkD,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ,KAEpEkE,EAAWjD,GAAI,GAAG/C,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBhB,IAAIC,EAAS,IAAII,EAAKL,CAAC,GAAGsB,GAAIN,CAAE,GAChCwD,IAAMC,EAAezE,GAAGsB,KAAMtB,EAAE,KAAKA,EAAE,KAAKK,EAAK,UAAUiB,CAAE,IAGxDtB,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAiBAzE,EAAE,sBAAsBA,EAAE,OAAO,SAAUuB,GAAIN,GAAI;AACjD,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAEX,SAAIsB,MAAO,UACTA,IAAKjB,EAAK,WACVW,IAAKX,EAAK,aAEVkE,EAAWjD,GAAI,GAAG/C,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,IAGnBf,EAAS,IAAII,EAAKL,CAAC,GAAGsB,GAAIN,CAAE;AACrC;AAUAjB,EAAE,WAAW,WAAY;AACvB,MAAIC,IAAI,MACNK,IAAOL,EAAE,aACTwE,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ;AAEtE,SAAOL,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAOAzE,EAAE,YAAYA,EAAE,QAAQ,WAAY;AAClC,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQAF,EAAE,UAAUA,EAAE,SAAS,WAAY;AACjC,MAAIC,IAAI,MACNK,IAAOL,EAAE,aACTwE,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ;AAEtE,SAAOL,EAAE,MAAK,IAAK,MAAMwE,IAAMA;AACjC;AAoDA,SAAS9C,EAAeG,GAAG;AACzB,MAAItB,GAAGH,GAAG8E,GACRC,IAAkBtD,EAAE,SAAS,GAC7B2C,IAAM,IACN5C,IAAIC,EAAE,CAAC;AAET,MAAIsD,IAAkB,GAAG;AAEvB,SADAX,KAAO5C,GACFrB,IAAI,GAAGA,IAAI4E,GAAiB5E;AAC/B,MAAA2E,IAAKrD,EAAEtB,CAAC,IAAI,IACZH,IAAIT,IAAWuF,EAAG,QACd9E,MAAGoE,KAAOY,GAAchF,CAAC,IAC7BoE,KAAOU;AAGT,IAAAtD,IAAIC,EAAEtB,CAAC,GACP2E,IAAKtD,IAAI,IACTxB,IAAIT,IAAWuF,EAAG,QACd9E,MAAGoE,KAAOY,GAAchF,CAAC;AAAA,EAC/B,WAAWwB,MAAM;AACf,WAAO;AAIT,SAAOA,IAAI,OAAO,IAAI,CAAAA,KAAK;AAE3B,SAAO4C,IAAM5C;AACf;AAGA,SAAS2C,EAAWhE,GAAGL,GAAKC,GAAK;AAC/B,MAAII,MAAM,CAAC,CAACA,KAAKA,IAAIL,KAAOK,IAAIJ;AAC9B,UAAM,MAAMnB,KAAkBuB,CAAC;AAEnC;AAQA,SAASiD,GAAoB3B,GAAGtB,GAAGS,GAAIqE,GAAW;AAChD,MAAIC,GAAIlF,GAAGgB,GAAGmE;AAGd,OAAKnF,IAAIyB,EAAE,CAAC,GAAGzB,KAAK,IAAIA,KAAK,GAAI,GAAEG;AAGnC,SAAI,EAAEA,IAAI,KACRA,KAAKZ,GACL2F,IAAK,MAELA,IAAK,KAAK,MAAM/E,IAAI,KAAKZ,CAAQ,GACjCY,KAAKZ,IAMPS,IAAIf,EAAQ,IAAIM,IAAWY,CAAC,GAC5BgF,IAAK1D,EAAEyD,CAAE,IAAIlF,IAAI,GAEbiF,KAAa,OACX9E,IAAI,KACFA,KAAK,IAAGgF,IAAKA,IAAK,MAAM,IACnBhF,KAAK,MAAGgF,IAAKA,IAAK,KAAK,IAChCnE,IAAIJ,IAAK,KAAKuE,KAAM,SAASvE,IAAK,KAAKuE,KAAM,SAASA,KAAM,OAASA,KAAM,KAE3EnE,KAAKJ,IAAK,KAAKuE,IAAK,KAAKnF,KAAKY,IAAK,KAAKuE,IAAK,KAAKnF,IAAI,OACnDyB,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAM,MAAMf,EAAQ,IAAIkB,IAAI,CAAC,IAAI,MAC/CgF,KAAMnF,IAAI,KAAKmF,KAAM,OAAO1D,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAM,MAAM,IAG3DG,IAAI,KACFA,KAAK,IAAGgF,IAAKA,IAAK,MAAO,IACpBhF,KAAK,IAAGgF,IAAKA,IAAK,MAAM,IACxBhF,KAAK,MAAGgF,IAAKA,IAAK,KAAK,IAChCnE,KAAKiE,KAAarE,IAAK,MAAMuE,KAAM,QAAQ,CAACF,KAAarE,IAAK,KAAKuE,KAAM,QAEzEnE,MAAMiE,KAAarE,IAAK,MAAMuE,IAAK,KAAKnF,KACvC,CAACiF,KAAarE,IAAK,KAAMuE,IAAK,KAAKnF,IAAI,OACrCyB,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAO,MAAMf,EAAQ,IAAIkB,IAAI,CAAC,IAAI,GAIlDa;AACT;AAMA,SAASoE,GAAYhB,GAAKiB,GAAQC,GAAS;AAOzC,WANIlF,GACFmF,IAAM,CAAC,CAAC,GACRC,GACArF,IAAI,GACJsF,IAAOrB,EAAI,QAENjE,IAAIsF,KAAO;AAChB,SAAKD,IAAOD,EAAI,QAAQC,MAAS,CAAAD,EAAIC,CAAI,KAAKH;AAE9C,SADAE,EAAI,CAAC,KAAKnH,GAAS,QAAQgG,EAAI,OAAOjE,GAAG,CAAC,GACrCC,IAAI,GAAGA,IAAImF,EAAI,QAAQnF;AAC1B,MAAImF,EAAInF,CAAC,IAAIkF,IAAU,MACjBC,EAAInF,IAAI,CAAC,MAAM,WAAQmF,EAAInF,IAAI,CAAC,IAAI,IACxCmF,EAAInF,IAAI,CAAC,KAAKmF,EAAInF,CAAC,IAAIkF,IAAU,GACjCC,EAAInF,CAAC,KAAKkF;AAAA,EAGhB;AAEA,SAAOC,EAAI;AACb;AAQA,SAAS1E,GAAOZ,GAAML,GAAG;AACvB,MAAII,GAAG2B,GAAKzB;AAEZ,MAAIN,EAAE,SAAU,QAAOA;AAMvB,EAAA+B,IAAM/B,EAAE,EAAE,QACN+B,IAAM,MACR3B,IAAI,KAAK,KAAK2B,IAAM,CAAC,GACrBzB,KAAK,IAAI2B,GAAQ,GAAG7B,CAAC,GAAG,eAExBA,IAAI,IACJE,IAAI,iCAGND,EAAK,aAAaD,GAElBJ,IAAIkC,GAAa7B,GAAM,GAAGL,EAAE,MAAMM,CAAC,GAAG,IAAID,EAAK,CAAC,CAAC;AAGjD,WAASE,IAAIH,GAAGG,OAAM;AACpB,QAAIuF,IAAQ9F,EAAE,MAAMA,CAAC;AACrB,IAAAA,IAAI8F,EAAM,MAAMA,CAAK,EAAE,MAAMA,CAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,EACrD;AAEA,SAAAzF,EAAK,aAAaD,GAEXJ;AACT;AAMA,IAAI2B,IAAU,4BAAY;AAGxB,WAASoE,EAAgB/F,GAAGI,GAAG2C,GAAM;AACnC,QAAIiD,GACFjC,IAAQ,GACRxD,IAAIP,EAAE;AAER,SAAKA,IAAIA,EAAE,MAAK,GAAIO;AAClB,MAAAyF,IAAOhG,EAAEO,CAAC,IAAIH,IAAI2D,GAClB/D,EAAEO,CAAC,IAAIyF,IAAOjD,IAAO,GACrBgB,IAAQiC,IAAOjD,IAAO;AAGxB,WAAIgB,KAAO/D,EAAE,QAAQ+D,CAAK,GAEnB/D;AAAA,EACT;AAEA,WAASiG,EAAQC,GAAGC,GAAGC,GAAIC,GAAI;AAC7B,QAAI9F,GAAGa;AAEP,QAAIgF,KAAMC;AACR,MAAAjF,IAAIgF,IAAKC,IAAK,IAAI;AAAA;AAElB,WAAK9F,IAAIa,IAAI,GAAGb,IAAI6F,GAAI7F;AACtB,YAAI2F,EAAE3F,CAAC,KAAK4F,EAAE5F,CAAC,GAAG;AAChB,UAAAa,IAAI8E,EAAE3F,CAAC,IAAI4F,EAAE5F,CAAC,IAAI,IAAI;AACtB;AAAA,QACF;AAIJ,WAAOa;AAAA,EACT;AAEA,WAASkF,EAASJ,GAAGC,GAAGC,GAAIrD,GAAM;AAIhC,aAHIxC,IAAI,GAGD6F;AACL,MAAAF,EAAEE,CAAE,KAAK7F,GACTA,IAAI2F,EAAEE,CAAE,IAAID,EAAEC,CAAE,IAAI,IAAI,GACxBF,EAAEE,CAAE,IAAI7F,IAAIwC,IAAOmD,EAAEE,CAAE,IAAID,EAAEC,CAAE;AAIjC,WAAO,CAACF,EAAE,CAAC,KAAKA,EAAE,SAAS,IAAI,CAAAA,EAAE;EACnC;AAEA,SAAO,SAAUlG,GAAGM,GAAGS,GAAIC,GAAIsD,GAAIvB,GAAM;AACvC,QAAIwD,GAAK9C,GAAGlD,GAAGH,GAAGoG,GAASC,GAAMC,GAAMC,GAAO9C,GAAG+C,GAAIC,GAAKC,GAAMC,GAAMzF,GAAIC,GAAGyF,IAAIC,GAAIC,IACnFC,GAAIC,GACJ/G,KAAOL,EAAE,aACTqH,KAAOrH,EAAE,KAAKM,EAAE,IAAI,IAAI,IACxBK,IAAKX,EAAE,GACPY,IAAKN,EAAE;AAGT,QAAI,CAACK,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAM,CAACA,EAAG,CAAC;AAE/B,aAAO,IAAIP;AAAA;AAAA,QACT,CAACL,EAAE,KAAK,CAACM,EAAE,MAAMK,IAAKC,KAAMD,EAAG,CAAC,KAAKC,EAAG,CAAC,IAAI,CAACA,KAAM;AAAA;AAAA,UAGpDD,KAAMA,EAAG,CAAC,KAAK,KAAK,CAACC,IAAKyG,KAAO,IAAIA,KAAO;AAAA;AAAA,MAAC;AAmBjD,SAhBItE,KACFyD,IAAU,GACV/C,IAAIzD,EAAE,IAAIM,EAAE,MAEZyC,IAAOrD,GACP8G,IAAU7G,GACV8D,IAAIrE,EAAUY,EAAE,IAAIwG,CAAO,IAAIpH,EAAUkB,EAAE,IAAIkG,CAAO,IAGxDW,IAAKvG,EAAG,QACRqG,IAAKtG,EAAG,QACRkD,IAAI,IAAIxD,GAAKgH,EAAI,GACjBT,IAAK/C,EAAE,IAAI,IAINtD,IAAI,GAAGK,EAAGL,CAAC,MAAMI,EAAGJ,CAAC,KAAK,IAAIA,IAAI;AAavC,QAXIK,EAAGL,CAAC,KAAKI,EAAGJ,CAAC,KAAK,MAAIkD,KAEtB1C,KAAM,QACRO,IAAKP,IAAKV,GAAK,WACfW,IAAKX,GAAK,YACDiE,IACThD,IAAKP,KAAMf,EAAE,IAAIM,EAAE,KAAK,IAExBgB,IAAKP,GAGHO,IAAK;AACP,MAAAsF,EAAG,KAAK,CAAC,GACTH,IAAO;AAAA,SACF;AAOL,UAJAnF,IAAKA,IAAKkF,IAAU,IAAI,GACxBjG,IAAI,GAGA4G,KAAM,GAAG;AAMX,aALA/G,IAAI,GACJQ,IAAKA,EAAG,CAAC,GACTU,MAGQf,IAAI0G,KAAM7G,MAAMkB,KAAMf;AAC5B,UAAAgB,IAAInB,IAAI2C,KAAQpC,EAAGJ,CAAC,KAAK,IACzBqG,EAAGrG,CAAC,IAAIgB,IAAIX,IAAK,GACjBR,IAAImB,IAAIX,IAAK;AAGf,QAAA6F,IAAOrG,KAAKG,IAAI0G;AAAA,MAGlB,OAAO;AAiBL,aAdA7G,IAAI2C,KAAQnC,EAAG,CAAC,IAAI,KAAK,GAErBR,IAAI,MACNQ,IAAKmF,EAAgBnF,GAAIR,GAAG2C,CAAI,GAChCpC,IAAKoF,EAAgBpF,GAAIP,GAAG2C,CAAI,GAChCoE,IAAKvG,EAAG,QACRqG,IAAKtG,EAAG,SAGVqG,KAAKG,GACLN,IAAMlG,EAAG,MAAM,GAAGwG,CAAE,GACpBL,IAAOD,EAAI,QAGJC,IAAOK,IAAK,CAAAN,EAAIC,GAAM,IAAI;AAEjC,QAAAM,IAAKxG,EAAG,SACRwG,EAAG,QAAQ,CAAC,GACZF,KAAMtG,EAAG,CAAC,GAENA,EAAG,CAAC,KAAKmC,IAAO,KAAG,EAAEmE;AAEzB;AACE,UAAA9G,IAAI,GAGJmG,IAAMN,EAAQrF,GAAIiG,GAAKM,GAAIL,CAAI,GAG3BP,IAAM,KAGRQ,IAAOF,EAAI,CAAC,GACRM,KAAML,MAAMC,IAAOA,IAAOhE,KAAQ8D,EAAI,CAAC,KAAK,KAGhDzG,IAAI2G,IAAOG,KAAM,GAUb9G,IAAI,KACFA,KAAK2C,MAAM3C,IAAI2C,IAAO,IAG1B2D,IAAOX,EAAgBnF,GAAIR,GAAG2C,CAAI,GAClC4D,IAAQD,EAAK,QACbI,IAAOD,EAAI,QAGXN,IAAMN,EAAQS,GAAMG,GAAKF,GAAOG,CAAI,GAGhCP,KAAO,MACTnG,KAGAkG,EAASI,GAAMS,IAAKR,IAAQS,IAAKxG,GAAI+F,GAAO5D,CAAI,OAO9C3C,KAAK,MAAGmG,IAAMnG,IAAI,IACtBsG,IAAO9F,EAAG,UAGZ+F,IAAQD,EAAK,QACTC,IAAQG,KAAMJ,EAAK,QAAQ,CAAC,GAGhCJ,EAASO,GAAKH,GAAMI,GAAM/D,CAAI,GAG1BwD,KAAO,OACTO,IAAOD,EAAI,QAGXN,IAAMN,EAAQrF,GAAIiG,GAAKM,GAAIL,CAAI,GAG3BP,IAAM,MACRnG,KAGAkG,EAASO,GAAKM,IAAKL,IAAOM,IAAKxG,GAAIkG,GAAM/D,CAAI,KAIjD+D,IAAOD,EAAI,UACFN,MAAQ,MACjBnG,KACAyG,IAAM,CAAC,CAAC,IAIVD,EAAGrG,GAAG,IAAIH,GAGNmG,KAAOM,EAAI,CAAC,IACdA,EAAIC,GAAM,IAAInG,EAAGqG,EAAE,KAAK,KAExBH,IAAM,CAAClG,EAAGqG,EAAE,CAAC,GACbF,IAAO;AAAA,gBAGDE,OAAOC,KAAMJ,EAAI,CAAC,MAAM,WAAWvF;AAE7C,QAAAmF,IAAOI,EAAI,CAAC,MAAM;AAAA,MACpB;AAGA,MAAKD,EAAG,CAAC,KAAGA,EAAG,MAAK;AAAA,IACtB;AAGA,QAAIJ,KAAW;AACb,MAAA3C,EAAE,IAAIJ,GACN7E,KAAU6H;AAAA,SACL;AAGL,WAAKlG,IAAI,GAAGH,IAAIwG,EAAG,CAAC,GAAGxG,KAAK,IAAIA,KAAK,GAAI,CAAAG;AACzC,MAAAsD,EAAE,IAAItD,IAAIkD,IAAI+C,IAAU,GAExBvG,EAAS4D,GAAGS,IAAKvD,IAAK8C,EAAE,IAAI,IAAI9C,GAAIC,GAAIyF,CAAI;AAAA,IAC9C;AAEA,WAAO5C;AAAA,EACT;AACF;AAOC,SAAS5D,EAASD,GAAGsB,GAAIN,GAAIsG,GAAa;AACzC,MAAIC,GAAQhH,GAAGC,GAAGJ,GAAGmF,GAAIiC,GAAS5F,GAAGjB,GAAI8G,GACvCpH,IAAOL,EAAE;AAGX,EAAA0H,EAAK,KAAIpG,KAAM,MAAM;AAInB,QAHAX,IAAKX,EAAE,GAGH,CAACW,EAAI,QAAOX;AAWhB,SAAKuH,IAAS,GAAGnH,IAAIO,EAAG,CAAC,GAAGP,KAAK,IAAIA,KAAK,GAAI,CAAAmH;AAI9C,QAHAhH,IAAIe,IAAKiG,GAGLhH,IAAI;AACN,MAAAA,KAAKZ,GACLa,IAAIc,GACJM,IAAIjB,EAAG8G,IAAM,CAAC,GAGdlC,IAAK3D,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAAI,KAAK;AAAA,aAE5CiH,IAAM,KAAK,MAAMlH,IAAI,KAAKZ,CAAQ,GAClCS,IAAIO,EAAG,QACH8G,KAAOrH;AACT,UAAIkH,GAAa;AAGf,eAAOlH,OAAOqH,IAAM,CAAA9G,EAAG,KAAK,CAAC;AAC7B,QAAAiB,IAAI2D,IAAK,GACTgC,IAAS,GACThH,KAAKZ,GACLa,IAAID,IAAIZ,IAAW;AAAA,MACrB;AACE,cAAM+H;AAAA,SAEH;AAIL,WAHA9F,IAAIxB,IAAIO,EAAG8G,CAAG,GAGTF,IAAS,GAAGnH,KAAK,IAAIA,KAAK,GAAI,CAAAmH;AAGnC,MAAAhH,KAAKZ,GAILa,IAAID,IAAIZ,IAAW4H,GAGnBhC,IAAK/E,IAAI,IAAI,IAAIoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAAI,KAAK;AAAA,IAC1D;AAmBF,QAfA8G,IAAcA,KAAehG,IAAK,KAChCX,EAAG8G,IAAM,CAAC,MAAM,WAAWjH,IAAI,IAAIoB,IAAIA,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAMvEgH,IAAUxG,IAAK,KACVuE,KAAM+B,OAAiBtG,KAAM,KAAKA,MAAOhB,EAAE,IAAI,IAAI,IAAI,MACxDuF,IAAK,KAAKA,KAAM,MAAMvE,KAAM,KAAKsG,KAAetG,KAAM;AAAA,KAGpDT,IAAI,IAAIC,IAAI,IAAIoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,CAAC,IAAI,IAAIG,EAAG8G,IAAM,CAAC,KAAK,KAAM,KACvEzG,MAAOhB,EAAE,IAAI,IAAI,IAAI,KAEvBsB,IAAK,KAAK,CAACX,EAAG,CAAC;AACjB,aAAAA,EAAG,SAAS,GACR6G,KAGFlG,KAAMtB,EAAE,IAAI,GAGZW,EAAG,CAAC,IAAItB,EAAQ,KAAKM,IAAW2B,IAAK3B,KAAYA,CAAQ,GACzDK,EAAE,IAAI,CAACsB,KAAM,KAIbX,EAAG,CAAC,IAAIX,EAAE,IAAI,GAGTA;AAiBT,QAbIO,KAAK,KACPI,EAAG,SAAS8G,GACZrH,IAAI,GACJqH,QAEA9G,EAAG,SAAS8G,IAAM,GAClBrH,IAAIf,EAAQ,IAAIM,IAAWY,CAAC,GAI5BI,EAAG8G,CAAG,IAAIjH,IAAI,KAAKoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,CAAC,IAAInB,EAAQ,IAAImB,CAAC,IAAI,KAAKJ,IAAI,IAGzEoH;AACF;AAGE,YAAIC,KAAO,GAAG;AAGZ,eAAKlH,IAAI,GAAGC,IAAIG,EAAG,CAAC,GAAGH,KAAK,IAAIA,KAAK,GAAI,CAAAD;AAEzC,eADAC,IAAIG,EAAG,CAAC,KAAKP,GACRA,IAAI,GAAGI,KAAK,IAAIA,KAAK,GAAI,CAAAJ;AAG9B,UAAIG,KAAKH,MACPJ,EAAE,KACEW,EAAG,CAAC,KAAKjB,MAAMiB,EAAG,CAAC,IAAI;AAG7B;AAAA,QACF,OAAO;AAEL,cADAA,EAAG8G,CAAG,KAAKrH,GACPO,EAAG8G,CAAG,KAAK/H,EAAM;AACrB,UAAAiB,EAAG8G,GAAK,IAAI,GACZrH,IAAI;AAAA,QACN;AAKJ,SAAKG,IAAII,EAAG,QAAQA,EAAG,EAAEJ,CAAC,MAAM,IAAI,CAAAI,EAAG;EACzC;AAEA,SAAI7B,MAGEkB,EAAE,IAAIK,EAAK,QAGbL,EAAE,IAAI,MACNA,EAAE,IAAI,OAGGA,EAAE,IAAIK,EAAK,SAGpBL,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,KAKLA;AACT;AAGA,SAASyE,EAAezE,GAAG2H,GAAOrG,GAAI;AACpC,MAAI,CAACtB,EAAE,SAAQ,EAAI,QAAO4H,GAAkB5H,CAAC;AAC7C,MAAII,GACFqD,IAAIzD,EAAE,GACNwE,IAAM9C,EAAe1B,EAAE,CAAC,GACxB+B,IAAMyC,EAAI;AAEZ,SAAImD,KACErG,MAAOlB,IAAIkB,IAAKS,KAAO,IACzByC,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC,IAAIY,GAAchF,CAAC,IACjD2B,IAAM,MACfyC,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC,IAGzCA,IAAMA,KAAOxE,EAAE,IAAI,IAAI,MAAM,QAAQA,EAAE,KAC9ByD,IAAI,KACbe,IAAM,OAAOY,GAAc,CAAC3B,IAAI,CAAC,IAAIe,GACjClD,MAAOlB,IAAIkB,IAAKS,KAAO,MAAGyC,KAAOY,GAAchF,CAAC,MAC3CqD,KAAK1B,KACdyC,KAAOY,GAAc3B,IAAI,IAAI1B,CAAG,GAC5BT,MAAOlB,IAAIkB,IAAKmC,IAAI,KAAK,MAAGe,IAAMA,IAAM,MAAMY,GAAchF,CAAC,QAE5DA,IAAIqD,IAAI,KAAK1B,MAAKyC,IAAMA,EAAI,MAAM,GAAGpE,CAAC,IAAI,MAAMoE,EAAI,MAAMpE,CAAC,IAC5DkB,MAAOlB,IAAIkB,IAAKS,KAAO,MACrB0B,IAAI,MAAM1B,MAAKyC,KAAO,MAC1BA,KAAOY,GAAchF,CAAC,KAInBoE;AACT;AAIA,SAASZ,GAAkB2D,GAAQ9D,GAAG;AACpC,MAAI7B,IAAI2F,EAAO,CAAC;AAGhB,OAAM9D,KAAK9D,GAAUiC,KAAK,IAAIA,KAAK,GAAI,CAAA6B;AACvC,SAAOA;AACT;AAGA,SAASF,GAAQlD,GAAMiB,GAAIP,GAAI;AAC7B,MAAIO,IAAKzB;AAGP,UAAAf,IAAW,IACPiC,MAAIV,EAAK,YAAYU,IACnB,MAAM9B,EAAsB;AAEpC,SAAOgB,EAAS,IAAII,EAAK5B,EAAI,GAAG6C,GAAI,GAAG,EAAI;AAC7C;AAGA,SAASoB,EAAMrC,GAAMiB,GAAIN,GAAI;AAC3B,MAAIM,IAAKxB,GAAc,OAAM,MAAMb,EAAsB;AACzD,SAAOgB,EAAS,IAAII,EAAK3B,EAAE,GAAG4C,GAAIN,GAAI,EAAI;AAC5C;AAGA,SAASiD,GAAasD,GAAQ;AAC5B,MAAI3F,IAAI2F,EAAO,SAAS,GACtBxF,IAAMH,IAAIjC,IAAW;AAKvB,MAHAiC,IAAI2F,EAAO3F,CAAC,GAGRA,GAAG;AAGL,WAAOA,IAAI,MAAM,GAAGA,KAAK,GAAI,CAAAG;AAG7B,SAAKH,IAAI2F,EAAO,CAAC,GAAG3F,KAAK,IAAIA,KAAK,GAAI,CAAAG;AAAA,EACxC;AAEA,SAAOA;AACT;AAGA,SAASqD,GAAchF,GAAG;AAExB,WADIyH,IAAK,IACFzH,MAAM,CAAAyH,KAAM;AACnB,SAAOA;AACT;AAUA,SAAS5C,GAAO5E,GAAML,GAAG,GAAGe,GAAI;AAC9B,MAAIuG,GACFlG,IAAI,IAAIf,EAAK,CAAC,GAIdD,IAAI,KAAK,KAAKW,IAAKpB,IAAW,CAAC;AAIjC,OAFAb,IAAW,QAEF;AAOP,QANI,IAAI,MACNsC,IAAIA,EAAE,MAAMpB,CAAC,GACT8H,GAAS1G,EAAE,GAAGhB,CAAC,MAAGkH,IAAc,MAGtC,IAAIlI,EAAU,IAAI,CAAC,GACf,MAAM,GAAG;AAGX,UAAIgC,EAAE,EAAE,SAAS,GACbkG,KAAelG,EAAE,EAAE,CAAC,MAAM,KAAG,EAAEA,EAAE,EAAE,CAAC;AACxC;AAAA,IACF;AAEA,IAAApB,IAAIA,EAAE,MAAMA,CAAC,GACb8H,GAAS9H,EAAE,GAAGI,CAAC;AAAA,EACjB;AAEA,SAAAtB,IAAW,IAEJsC;AACT;AAGA,SAAS2G,GAAMjG,GAAG;AAChB,SAAOA,EAAE,EAAEA,EAAE,EAAE,SAAS,CAAC,IAAI;AAC/B;AAMA,SAASkG,GAAS3H,GAAM4H,GAAMC,GAAM;AAKlC,WAJI5H,GACFN,IAAI,IAAIK,EAAK4H,EAAK,CAAC,CAAC,GACpB1H,IAAI,GAEC,EAAEA,IAAI0H,EAAK;AAEhB,QADA3H,IAAI,IAAID,EAAK4H,EAAK1H,CAAC,CAAC,GACfD,EAAE;AAGA,MAAIN,EAAEkI,CAAI,EAAE5H,CAAC,MAClBN,IAAIM;AAAA,SAJI;AACR,MAAAN,IAAIM;AACJ;AAAA,IACF;AAKF,SAAON;AACT;AAkCA,SAAS8D,GAAmB9D,GAAGsB,GAAI;AACjC,MAAI2B,GAAaI,GAAO7C,GAAG2H,GAAKC,GAAK7G,GAAGoB,GACtCtB,IAAM,GACNd,IAAI,GACJH,IAAI,GACJC,IAAOL,EAAE,aACTgB,IAAKX,EAAK,UACVU,IAAKV,EAAK;AAGZ,MAAI,CAACL,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,KAAKA,EAAE,IAAI;AAE3B,WAAO,IAAIK,EAAKL,EAAE,IACbA,EAAE,EAAE,CAAC,IAAQA,EAAE,IAAI,IAAI,IAAI,QAAlB,IACVA,EAAE,IAAIA,EAAE,IAAI,IAAI,IAAIA,IAAI,GAAK;AAanC,OAVIsB,KAAM,QACRxC,IAAW,IACX6D,IAAM5B,KAEN4B,IAAMrB,GAGRC,IAAI,IAAIlB,EAAK,OAAO,GAGbL,EAAE,IAAI;AAGX,IAAAA,IAAIA,EAAE,MAAMuB,CAAC,GACbnB,KAAK;AAUP,OALAiD,IAAQ,KAAK,IAAIhE,EAAQ,GAAGe,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,GACtDuC,KAAOU,GACPJ,IAAckF,IAAMC,IAAM,IAAI/H,EAAK,CAAC,GACpCA,EAAK,YAAYsC,OAER;AAKP,QAJAwF,IAAMlI,EAASkI,EAAI,MAAMnI,CAAC,GAAG2C,GAAK,CAAC,GACnCM,IAAcA,EAAY,MAAM,EAAE1C,CAAC,GACnCgB,IAAI6G,EAAI,KAAKzG,EAAOwG,GAAKlF,GAAaN,GAAK,CAAC,CAAC,GAEzCjB,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGoB,CAAG,MAAMjB,EAAe0G,EAAI,CAAC,EAAE,MAAM,GAAGzF,CAAG,GAAG;AAE7E,WADAnC,IAAIJ,GACGI,MAAK,CAAA4H,IAAMnI,EAASmI,EAAI,MAAMA,CAAG,GAAGzF,GAAK,CAAC;AAOjD,UAAIrB,KAAM;AAER,YAAID,IAAM,KAAKmC,GAAoB4E,EAAI,GAAGzF,IAAMU,GAAOrC,GAAIK,CAAG;AAC5D,UAAAhB,EAAK,YAAYsC,KAAO,IACxBM,IAAckF,IAAM5G,IAAI,IAAIlB,EAAK,CAAC,GAClCE,IAAI,GACJc;AAAA;AAEA,iBAAOpB,EAASmI,GAAK/H,EAAK,YAAYU,GAAIC,GAAIlC,IAAW,EAAI;AAAA;AAG/D,eAAAuB,EAAK,YAAYU,GACVqH;AAAA,IAEX;AAEA,IAAAA,IAAM7G;AAAA,EACR;AACF;AAkBA,SAAS+B,GAAiBhD,GAAGgB,GAAI;AAC/B,MAAI+G,GAAGC,GAAIrF,GAAaQ,GAAG8E,GAAWlH,GAAK+G,GAAK7G,GAAGoB,GAAK6F,GAAI1F,GAC1DhB,IAAI,GACJuB,IAAQ,IACRrD,IAAIM,GACJK,IAAKX,EAAE,GACPK,IAAOL,EAAE,aACTgB,IAAKX,EAAK,UACVU,IAAKV,EAAK;AAGZ,MAAIL,EAAE,IAAI,KAAK,CAACW,KAAM,CAACA,EAAG,CAAC,KAAK,CAACX,EAAE,KAAKW,EAAG,CAAC,KAAK,KAAKA,EAAG,UAAU;AACjE,WAAO,IAAIN,EAAKM,KAAM,CAACA,EAAG,CAAC,IAAI,SAASX,EAAE,KAAK,IAAI,MAAMW,IAAK,IAAIX,CAAC;AAcrE,MAXIsB,KAAM,QACRxC,IAAW,IACX6D,IAAM5B,KAEN4B,IAAMrB,GAGRjB,EAAK,YAAYsC,KAAOU,GACxBgF,IAAI3G,EAAef,CAAE,GACrB2H,IAAKD,EAAE,OAAO,CAAC,GAEX,KAAK,IAAI5E,IAAIzD,EAAE,CAAC,IAAI,OAAQ;AAa9B,WAAOsI,IAAK,KAAKA,KAAM,KAAKA,KAAM,KAAKD,EAAE,OAAO,CAAC,IAAI;AACnD,MAAArI,IAAIA,EAAE,MAAMM,CAAC,GACb+H,IAAI3G,EAAe1B,EAAE,CAAC,GACtBsI,IAAKD,EAAE,OAAO,CAAC,GACfvG;AAGF,IAAA2B,IAAIzD,EAAE,GAEFsI,IAAK,KACPtI,IAAI,IAAIK,EAAK,OAAOgI,CAAC,GACrB5E,OAEAzD,IAAI,IAAIK,EAAKiI,IAAK,MAAMD,EAAE,MAAM,CAAC,CAAC;AAAA,EAEtC;AAKE,WAAA9G,IAAIgC,GAAQlD,GAAMsC,IAAM,GAAG5B,CAAE,EAAE,MAAM0C,IAAI,EAAE,GAC3CzD,IAAIsD,GAAiB,IAAIjD,EAAKiI,IAAK,MAAMD,EAAE,MAAM,CAAC,CAAC,GAAG1F,IAAMU,CAAK,EAAE,KAAK9B,CAAC,GACzElB,EAAK,YAAYU,GAEVO,KAAM,OAAOrB,EAASD,GAAGe,GAAIC,GAAIlC,IAAW,EAAI,IAAIkB;AAa7D,OATAwI,IAAKxI,GAKLoI,IAAMG,IAAYvI,IAAI2B,EAAO3B,EAAE,MAAM,CAAC,GAAGA,EAAE,KAAK,CAAC,GAAG2C,GAAK,CAAC,GAC1DG,IAAK7C,EAASD,EAAE,MAAMA,CAAC,GAAG2C,GAAK,CAAC,GAChCM,IAAc,OAEL;AAIP,QAHAsF,IAAYtI,EAASsI,EAAU,MAAMzF,CAAE,GAAGH,GAAK,CAAC,GAChDpB,IAAI6G,EAAI,KAAKzG,EAAO4G,GAAW,IAAIlI,EAAK4C,CAAW,GAAGN,GAAK,CAAC,CAAC,GAEzDjB,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGoB,CAAG,MAAMjB,EAAe0G,EAAI,CAAC,EAAE,MAAM,GAAGzF,CAAG;AAc1E,UAbAyF,IAAMA,EAAI,MAAM,CAAC,GAIb3E,MAAM,MAAG2E,IAAMA,EAAI,KAAK7E,GAAQlD,GAAMsC,IAAM,GAAG5B,CAAE,EAAE,MAAM0C,IAAI,EAAE,CAAC,IACpE2E,IAAMzG,EAAOyG,GAAK,IAAI/H,EAAKyB,CAAC,GAAGa,GAAK,CAAC,GAQjCrB,KAAM;AACR,YAAIkC,GAAoB4E,EAAI,GAAGzF,IAAMU,GAAOrC,GAAIK,CAAG;AACjD,UAAAhB,EAAK,YAAYsC,KAAOU,GACxB9B,IAAIgH,IAAYvI,IAAI2B,EAAO6G,EAAG,MAAM,CAAC,GAAGA,EAAG,KAAK,CAAC,GAAG7F,GAAK,CAAC,GAC1DG,IAAK7C,EAASD,EAAE,MAAMA,CAAC,GAAG2C,GAAK,CAAC,GAChCM,IAAc5B,IAAM;AAAA;AAEpB,iBAAOpB,EAASmI,GAAK/H,EAAK,YAAYU,GAAIC,GAAIlC,IAAW,EAAI;AAAA;AAG/D,eAAAuB,EAAK,YAAYU,GACVqH;AAIX,IAAAA,IAAM7G,GACN0B,KAAe;AAAA,EACjB;AACF;AAIA,SAAS2E,GAAkB5H,GAAG;AAE5B,SAAO,OAAOA,EAAE,IAAIA,EAAE,IAAI,CAAC;AAC7B;AAMA,SAASyI,GAAazI,GAAGwE,GAAK;AAC5B,MAAIf,GAAG,GAAG1B;AAmBV,QAhBK0B,IAAIe,EAAI,QAAQ,GAAG,KAAK,OAAIA,IAAMA,EAAI,QAAQ,KAAK,EAAE,KAGrD,IAAIA,EAAI,OAAO,IAAI,KAAK,KAGvBf,IAAI,MAAGA,IAAI,IACfA,KAAK,CAACe,EAAI,MAAM,IAAI,CAAC,GACrBA,IAAMA,EAAI,UAAU,GAAG,CAAC,KACff,IAAI,MAGbA,IAAIe,EAAI,SAIL,IAAI,GAAGA,EAAI,WAAW,CAAC,MAAM,IAAI,IAAI;AAG1C,OAAKzC,IAAMyC,EAAI,QAAQA,EAAI,WAAWzC,IAAM,CAAC,MAAM,IAAI,EAAEA,EAAI;AAG7D,MAFAyC,IAAMA,EAAI,MAAM,GAAGzC,CAAG,GAElByC,GAAK;AAYP,QAXAzC,KAAO,GACP/B,EAAE,IAAIyD,IAAIA,IAAI,IAAI,GAClBzD,EAAE,IAAI,IAMN,KAAKyD,IAAI,KAAK9D,GACV8D,IAAI,MAAG,KAAK9D,IAEZ,IAAIoC,GAAK;AAEX,WADI,KAAG/B,EAAE,EAAE,KAAK,CAACwE,EAAI,MAAM,GAAG,CAAC,CAAC,GAC3BzC,KAAOpC,GAAU,IAAIoC,IAAM,CAAA/B,EAAE,EAAE,KAAK,CAACwE,EAAI,MAAM,GAAG,KAAK7E,CAAQ,CAAC;AACrE,MAAA6E,IAAMA,EAAI,MAAM,CAAC,GACjB,IAAI7E,IAAW6E,EAAI;AAAA,IACrB;AACE,WAAKzC;AAGP,WAAO,MAAM,CAAAyC,KAAO;AACpB,IAAAxE,EAAE,EAAE,KAAK,CAACwE,CAAG,GAET1F,MAGEkB,EAAE,IAAIA,EAAE,YAAY,QAGtBA,EAAE,IAAI,MACNA,EAAE,IAAI,OAGGA,EAAE,IAAIA,EAAE,YAAY,SAG7BA,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AAAA,EAId;AAGE,IAAAA,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AAGV,SAAOA;AACT;AAMA,SAAS0I,GAAW1I,GAAGwE,GAAK;AAC1B,MAAIzB,GAAM1C,GAAMsI,GAASpI,GAAGqI,GAAS7G,GAAK8G,GAAGlI,GAAI+C;AAEjD,MAAIc,EAAI,QAAQ,GAAG,IAAI;AAErB,QADAA,IAAMA,EAAI,QAAQ,gBAAgB,IAAI,GAClC/E,GAAU,KAAK+E,CAAG,EAAG,QAAOiE,GAAazI,GAAGwE,CAAG;AAAA,aAC1CA,MAAQ,cAAcA,MAAQ;AACvC,WAAK,CAACA,MAAKxE,EAAE,IAAI,MACjBA,EAAE,IAAI,KACNA,EAAE,IAAI,MACCA;AAGT,MAAIT,GAAM,KAAKiF,CAAG;AAChB,IAAAzB,IAAO,IACPyB,IAAMA,EAAI;WACDlF,GAAS,KAAKkF,CAAG;AAC1B,IAAAzB,IAAO;AAAA,WACEvD,GAAQ,KAAKgF,CAAG;AACzB,IAAAzB,IAAO;AAAA;AAEP,UAAM,MAAM/D,KAAkBwF,CAAG;AAgCnC,OA5BAjE,IAAIiE,EAAI,OAAO,IAAI,GAEfjE,IAAI,KACNsI,IAAI,CAACrE,EAAI,MAAMjE,IAAI,CAAC,GACpBiE,IAAMA,EAAI,UAAU,GAAGjE,CAAC,KAExBiE,IAAMA,EAAI,MAAM,CAAC,GAKnBjE,IAAIiE,EAAI,QAAQ,GAAG,GACnBoE,IAAUrI,KAAK,GACfF,IAAOL,EAAE,aAEL4I,MACFpE,IAAMA,EAAI,QAAQ,KAAK,EAAE,GACzBzC,IAAMyC,EAAI,QACVjE,IAAIwB,IAAMxB,GAGVoI,IAAU1D,GAAO5E,GAAM,IAAIA,EAAK0C,CAAI,GAAGxC,GAAGA,IAAI,CAAC,IAGjDI,IAAK6E,GAAYhB,GAAKzB,GAAMrD,CAAI,GAChCgE,IAAK/C,EAAG,SAAS,GAGZJ,IAAImD,GAAI/C,EAAGJ,CAAC,MAAM,GAAG,EAAEA,EAAG,CAAAI,EAAG;AAClC,SAAIJ,IAAI,IAAU,IAAIF,EAAKL,EAAE,IAAI,CAAC,KAClCA,EAAE,IAAI4D,GAAkBjD,GAAI+C,CAAE,GAC9B1D,EAAE,IAAIW,GACN7B,IAAW,IAQP8J,MAAS5I,IAAI2B,EAAO3B,GAAG2I,GAAS5G,IAAM,CAAC,IAGvC8G,MAAG7I,IAAIA,EAAE,MAAM,KAAK,IAAI6I,CAAC,IAAI,KAAKxJ,EAAQ,GAAGwJ,CAAC,IAAIC,GAAQ,IAAI,GAAGD,CAAC,CAAC,IACvE/J,IAAW,IAEJkB;AACT;AAQA,SAASkE,GAAK7D,GAAML,GAAG;AACrB,MAAII,GACF2B,IAAM/B,EAAE,EAAE;AAEZ,MAAI+B,IAAM;AACR,WAAO/B,EAAE,OAAM,IAAKA,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,CAAC;AAQpD,EAAAI,IAAI,MAAM,KAAK,KAAK2B,CAAG,GACvB3B,IAAIA,IAAI,KAAK,KAAKA,IAAI,GAEtBJ,IAAIA,EAAE,MAAM,IAAIiC,GAAQ,GAAG7B,CAAC,CAAC,GAC7BJ,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,CAAC;AAO9B,WAJI+I,GACFzG,IAAK,IAAIjC,EAAK,CAAC,GACfkC,IAAM,IAAIlC,EAAK,EAAE,GACjBmC,IAAM,IAAInC,EAAK,EAAE,GACZD;AACL,IAAA2I,IAAS/I,EAAE,MAAMA,CAAC,GAClBA,IAAIA,EAAE,MAAMsC,EAAG,KAAKyG,EAAO,MAAMxG,EAAI,MAAMwG,CAAM,EAAE,MAAMvG,CAAG,CAAC,CAAC,CAAC;AAGjE,SAAOxC;AACT;AAIA,SAASkC,GAAa7B,GAAMyB,GAAG9B,GAAGM,GAAG0I,GAAc;AAC9C,MAACxI,GAAGe,GAAG0H,GAAGnG,GAEX/B,IAAKV,EAAK,WACVD,IAAI,KAAK,KAAKW,IAAKpB,CAAQ;AAM7B,OAJAb,IAAW,IACXgE,IAAK9C,EAAE,MAAMA,CAAC,GACdiJ,IAAI,IAAI5I,EAAKC,CAAC,OAEL;AAMP,QALAiB,IAAII,EAAOsH,EAAE,MAAMnG,CAAE,GAAG,IAAIzC,EAAKyB,MAAMA,GAAG,GAAGf,GAAI,CAAC,GAClDkI,IAAID,IAAe1I,EAAE,KAAKiB,CAAC,IAAIjB,EAAE,MAAMiB,CAAC,GACxCjB,IAAIqB,EAAOJ,EAAE,MAAMuB,CAAE,GAAG,IAAIzC,EAAKyB,MAAMA,GAAG,GAAGf,GAAI,CAAC,GAClDQ,IAAI0H,EAAE,KAAK3I,CAAC,GAERiB,EAAE,EAAEnB,CAAC,MAAM,QAAQ;AACrB,WAAKI,IAAIJ,GAAGmB,EAAE,EAAEf,CAAC,MAAMyI,EAAE,EAAEzI,CAAC,KAAKA,MAAK;AACtC,UAAIA,KAAK,GAAI;AAAA,IACf;AAEA,IAAAA,IAAIyI,GACJA,IAAI3I,GACJA,IAAIiB,GACJA,IAAIf;AAAA,EAEN;AAEA,SAAA1B,IAAW,IACXyC,EAAE,EAAE,SAASnB,IAAI,GAEVmB;AACT;AAIA,SAASU,GAAQkE,GAAG1C,GAAG;AAErB,WADI,IAAI0C,GACD,EAAE1C,IAAG,MAAK0C;AACjB,SAAO;AACT;AAIA,SAASjF,GAAiBb,GAAML,GAAG;AACjC,MAAIuB,GACF2H,IAAQlJ,EAAE,IAAI,GACdmJ,IAAKzG,EAAMrC,GAAMA,EAAK,WAAW,CAAC,GAClCoC,IAAS0G,EAAG,MAAM,GAAG;AAIvB,MAFAnJ,IAAIA,EAAE,OAEFA,EAAE,IAAIyC,CAAM;AACd,WAAA5D,IAAWqK,IAAQ,IAAI,GAChBlJ;AAKT,MAFAuB,IAAIvB,EAAE,SAASmJ,CAAE,GAEb5H,EAAE;AACJ,IAAA1C,IAAWqK,IAAQ,IAAI;AAAA,OAClB;AAIL,QAHAlJ,IAAIA,EAAE,MAAMuB,EAAE,MAAM4H,CAAE,CAAC,GAGnBnJ,EAAE,IAAIyC,CAAM;AACd,aAAA5D,IAAWkJ,GAAMxG,CAAC,IAAK2H,IAAQ,IAAI,IAAMA,IAAQ,IAAI,GAC9ClJ;AAGT,IAAAnB,IAAWkJ,GAAMxG,CAAC,IAAK2H,IAAQ,IAAI,IAAMA,IAAQ,IAAI;AAAA,EACvD;AAEA,SAAOlJ,EAAE,MAAMmJ,CAAE,EAAE,IAAG;AACxB;AAQA,SAAS9E,GAAerE,GAAG0F,GAASpE,GAAIN,GAAI;AAC1C,MAAI+B,GAAMU,GAAGlD,GAAGH,GAAG2B,GAAKyF,GAAShD,GAAK7D,GAAIL,GACxCD,IAAOL,EAAE,aACT2H,IAAQrG,MAAO;AAWjB,MATIqG,KACFpD,EAAWjD,GAAI,GAAG/C,EAAU,GACxByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,MAExBM,IAAKjB,EAAK,WACVW,IAAKX,EAAK,WAGR,CAACL,EAAE;AACL,IAAAwE,IAAMoD,GAAkB5H,CAAC;AAAA,OACpB;AAoCL,SAnCAwE,IAAMC,EAAezE,CAAC,GACtBO,IAAIiE,EAAI,QAAQ,GAAG,GAOfmD,KACF5E,IAAO,GACH2C,KAAW,KACbpE,IAAKA,IAAK,IAAI,IACLoE,KAAW,MACpBpE,IAAKA,IAAK,IAAI,MAGhByB,IAAO2C,GAOLnF,KAAK,MACPiE,IAAMA,EAAI,QAAQ,KAAK,EAAE,GACzBlE,IAAI,IAAID,EAAK,CAAC,GACdC,EAAE,IAAIkE,EAAI,SAASjE,GACnBD,EAAE,IAAIkF,GAAYf,EAAenE,CAAC,GAAG,IAAIyC,CAAI,GAC7CzC,EAAE,IAAIA,EAAE,EAAE,SAGZK,IAAK6E,GAAYhB,GAAK,IAAIzB,CAAI,GAC9BU,IAAI1B,IAAMpB,EAAG,QAGNA,EAAG,EAAEoB,CAAG,KAAK,IAAI,CAAApB,EAAG;AAE3B,QAAI,CAACA,EAAG,CAAC;AACP,MAAA6D,IAAMmD,IAAQ,SAAS;AAAA,SAClB;AAyBL,UAxBIpH,IAAI,IACNkD,OAEAzD,IAAI,IAAIK,EAAKL,CAAC,GACdA,EAAE,IAAIW,GACNX,EAAE,IAAIyD,GACNzD,IAAI2B,EAAO3B,GAAGM,GAAGgB,GAAIN,GAAI,GAAG+B,CAAI,GAChCpC,IAAKX,EAAE,GACPyD,IAAIzD,EAAE,GACNwH,IAAU5I,KAIZ2B,IAAII,EAAGW,CAAE,GACTlB,IAAI2C,IAAO,GACXyE,IAAUA,KAAW7G,EAAGW,IAAK,CAAC,MAAM,QAEpCkG,IAAUxG,IAAK,KACVT,MAAM,UAAUiH,OAAaxG,MAAO,KAAKA,OAAQhB,EAAE,IAAI,IAAI,IAAI,MAChEO,IAAIH,KAAKG,MAAMH,MAAMY,MAAO,KAAKwG,KAAWxG,MAAO,KAAKL,EAAGW,IAAK,CAAC,IAAI,KACrEN,OAAQhB,EAAE,IAAI,IAAI,IAAI,KAE1BW,EAAG,SAASW,GAERkG;AAGF,eAAO,EAAE7G,EAAG,EAAEW,CAAE,IAAIyB,IAAO;AACzB,UAAApC,EAAGW,CAAE,IAAI,GACJA,MACH,EAAEmC,GACF9C,EAAG,QAAQ,CAAC;AAMlB,WAAKoB,IAAMpB,EAAG,QAAQ,CAACA,EAAGoB,IAAM,CAAC,GAAG,EAAEA,EAAI;AAG1C,WAAKxB,IAAI,GAAGiE,IAAM,IAAIjE,IAAIwB,GAAKxB,IAAK,CAAAiE,KAAOhG,GAAS,OAAOmC,EAAGJ,CAAC,CAAC;AAGhE,UAAIoH,GAAO;AACT,YAAI5F,IAAM;AACR,cAAI2D,KAAW,MAAMA,KAAW,GAAG;AAEjC,iBADAnF,IAAImF,KAAW,KAAK,IAAI,GACnB,EAAE3D,GAAKA,IAAMxB,GAAGwB,IAAO,CAAAyC,KAAO;AAEnC,iBADA7D,IAAK6E,GAAYhB,GAAKzB,GAAM2C,CAAO,GAC9B3D,IAAMpB,EAAG,QAAQ,CAACA,EAAGoB,IAAM,CAAC,GAAG,EAAEA,EAAI;AAG1C,iBAAKxB,IAAI,GAAGiE,IAAM,MAAMjE,IAAIwB,GAAKxB,IAAK,CAAAiE,KAAOhG,GAAS,OAAOmC,EAAGJ,CAAC,CAAC;AAAA,UACpE;AACE,YAAAiE,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC;AAI3C,QAAAA,IAAOA,KAAOf,IAAI,IAAI,MAAM,QAAQA;AAAA,MACtC,WAAWA,IAAI,GAAG;AAChB,eAAO,EAAEA,IAAI,CAAAe,IAAM,MAAMA;AACzB,QAAAA,IAAM,OAAOA;AAAA,MACf,WACM,EAAEf,IAAI1B,EAAK,MAAK0B,KAAK1B,GAAK0B,MAAO,CAAAe,KAAO;AAAA,UACvC,CAAIf,IAAI1B,MAAKyC,IAAMA,EAAI,MAAM,GAAGf,CAAC,IAAI,MAAMe,EAAI,MAAMf,CAAC;AAAA,IAE/D;AAEA,IAAAe,KAAOkB,KAAW,KAAK,OAAOA,KAAW,IAAI,OAAOA,KAAW,IAAI,OAAO,MAAMlB;AAAA,EAClF;AAEA,SAAOxE,EAAE,IAAI,IAAI,MAAMwE,IAAMA;AAC/B;AAIA,SAASsD,GAASnC,GAAK5D,GAAK;AAC1B,MAAI4D,EAAI,SAAS5D;AACf,WAAA4D,EAAI,SAAS5D,GACN;AAEX;AAyDA,SAASqH,GAAIpJ,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AASA,SAASqJ,GAAKrJ,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASsJ,GAAMtJ,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AAWA,SAASuJ,GAAIvJ,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,KAAKM,CAAC;AAC3B;AAUA,SAASkJ,GAAKxJ,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASyJ,GAAMzJ,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AAUA,SAAS0J,GAAK1J,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAAS2J,GAAM3J,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AA4BA,SAAS4J,GAAMtJ,GAAGN,GAAG;AACnB,EAAAM,IAAI,IAAI,KAAKA,CAAC,GACdN,IAAI,IAAI,KAAKA,CAAC;AACd,MAAIoB,GACFL,IAAK,KAAK,WACVC,IAAK,KAAK,UACV2B,IAAM5B,IAAK;AAGb,SAAI,CAACT,EAAE,KAAK,CAACN,EAAE,IACboB,IAAI,IAAI,KAAK,GAAG,IAGP,CAACd,EAAE,KAAK,CAACN,EAAE,KACpBoB,IAAIsB,EAAM,MAAMC,GAAK,CAAC,EAAE,MAAM3C,EAAE,IAAI,IAAI,OAAO,IAAI,GACnDoB,EAAE,IAAId,EAAE,KAGC,CAACN,EAAE,KAAKM,EAAE,OAAM,KACzBc,IAAIpB,EAAE,IAAI,IAAI0C,EAAM,MAAM3B,GAAIC,CAAE,IAAI,IAAI,KAAK,CAAC,GAC9CI,EAAE,IAAId,EAAE,KAGC,CAACA,EAAE,KAAKN,EAAE,OAAM,KACzBoB,IAAIsB,EAAM,MAAMC,GAAK,CAAC,EAAE,MAAM,GAAG,GACjCvB,EAAE,IAAId,EAAE,KAGCN,EAAE,IAAI,KACf,KAAK,YAAY2C,GACjB,KAAK,WAAW,GAChBvB,IAAI,KAAK,KAAKO,EAAOrB,GAAGN,GAAG2C,GAAK,CAAC,CAAC,GAClC3C,IAAI0C,EAAM,MAAMC,GAAK,CAAC,GACtB,KAAK,YAAY5B,GACjB,KAAK,WAAWC,GAChBI,IAAId,EAAE,IAAI,IAAIc,EAAE,MAAMpB,CAAC,IAAIoB,EAAE,KAAKpB,CAAC,KAEnCoB,IAAI,KAAK,KAAKO,EAAOrB,GAAGN,GAAG2C,GAAK,CAAC,CAAC,GAG7BvB;AACT;AAUA,SAASyI,GAAK7J,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AASA,SAAS8J,GAAK9J,GAAG;AACf,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAWA,SAAS+J,GAAM/J,GAAGE,GAAKC,GAAK;AAC1B,SAAO,IAAI,KAAKH,CAAC,EAAE,MAAME,GAAKC,CAAG;AACnC;AAqBA,SAAS6J,GAAOC,GAAK;AACnB,MAAI,CAACA,KAAO,OAAOA,KAAQ,SAAU,OAAM,MAAMlL,KAAe,iBAAiB;AACjF,MAAIwB,GAAGsI,GAAGqB,GACRC,IAAcF,EAAI,aAAa,IAC/BG,IAAK;AAAA,IACH;AAAA,IAAa;AAAA,IAAG7L;AAAA,IAChB;AAAA,IAAY;AAAA,IAAG;AAAA,IACf;AAAA,IAAY,CAACD;AAAA,IAAW;AAAA,IACxB;AAAA,IAAY;AAAA,IAAGA;AAAA,IACf;AAAA,IAAQ;AAAA,IAAGA;AAAA,IACX;AAAA,IAAQ,CAACA;AAAA,IAAW;AAAA,IACpB;AAAA,IAAU;AAAA,IAAG;AAAA,EACnB;AAEE,OAAKiC,IAAI,GAAGA,IAAI6J,EAAG,QAAQ7J,KAAK;AAE9B,QADIsI,IAAIuB,EAAG7J,CAAC,GAAG4J,MAAa,KAAKtB,CAAC,IAAIlK,GAASkK,CAAC,KAC3CqB,IAAID,EAAIpB,CAAC,OAAO;AACnB,UAAIzJ,EAAU8K,CAAC,MAAMA,KAAKA,KAAKE,EAAG7J,IAAI,CAAC,KAAK2J,KAAKE,EAAG7J,IAAI,CAAC,EAAG,MAAKsI,CAAC,IAAIqB;AAAA,UACjE,OAAM,MAAMlL,KAAkB6J,IAAI,OAAOqB,CAAC;AAKnD,MADIrB,IAAI,UAAUsB,MAAa,KAAKtB,CAAC,IAAIlK,GAASkK,CAAC,KAC9CqB,IAAID,EAAIpB,CAAC,OAAO;AACnB,QAAIqB,MAAM,MAAQA,MAAM,MAASA,MAAM,KAAKA,MAAM;AAChD,UAAIA;AACF,YAAI,OAAO,SAAU,OAAe,WACjC,OAAO,mBAAmB,OAAO;AAClC,eAAKrB,CAAC,IAAI;AAAA;AAEV,gBAAM,MAAM3J,EAAiB;AAAA;AAG/B,aAAK2J,CAAC,IAAI;AAAA;AAGZ,YAAM,MAAM7J,KAAkB6J,IAAI,OAAOqB,CAAC;AAI9C,SAAO;AACT;AAUA,SAASG,GAAIrK,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAASsK,GAAKtK,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAQA,SAASuK,GAAMN,GAAK;AAClB,MAAI1J,GAAGsI,GAAGuB;AASV,WAAStB,EAAQoB,GAAG;AAClB,QAAIzG,GAAGlD,GAAGgB,GACRvB,IAAI;AAGN,QAAI,EAAEA,aAAa8I,GAAU,QAAO,IAAIA,EAAQoB,CAAC;AAOjD,QAHAlK,EAAE,cAAc8I,GAGZ0B,GAAkBN,CAAC,GAAG;AACxB,MAAAlK,EAAE,IAAIkK,EAAE,GAEJpL,IACE,CAACoL,EAAE,KAAKA,EAAE,IAAIpB,EAAQ,QAGxB9I,EAAE,IAAI,KACNA,EAAE,IAAI,QACGkK,EAAE,IAAIpB,EAAQ,QAGvB9I,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,MAERA,EAAE,IAAIkK,EAAE,GACRlK,EAAE,IAAIkK,EAAE,EAAE,MAAK,MAGjBlK,EAAE,IAAIkK,EAAE,GACRlK,EAAE,IAAIkK,EAAE,IAAIA,EAAE,EAAE,MAAK,IAAKA,EAAE;AAG9B;AAAA,IACF;AAIA,QAFA3I,IAAI,OAAO2I,GAEP3I,MAAM,UAAU;AAClB,UAAI2I,MAAM,GAAG;AACX,QAAAlK,EAAE,IAAI,IAAIkK,IAAI,IAAI,KAAK,GACvBlK,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AACR;AAAA,MACF;AAUA,UARIkK,IAAI,KACNA,IAAI,CAACA,GACLlK,EAAE,IAAI,MAENA,EAAE,IAAI,GAIJkK,MAAM,CAAC,CAACA,KAAKA,IAAI,KAAK;AACxB,aAAKzG,IAAI,GAAGlD,IAAI2J,GAAG3J,KAAK,IAAIA,KAAK,GAAI,CAAAkD;AAErC,QAAI3E,IACE2E,IAAIqF,EAAQ,QACd9I,EAAE,IAAI,KACNA,EAAE,IAAI,QACGyD,IAAIqF,EAAQ,QACrB9I,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,MAERA,EAAE,IAAIyD,GACNzD,EAAE,IAAI,CAACkK,CAAC,MAGVlK,EAAE,IAAIyD,GACNzD,EAAE,IAAI,CAACkK,CAAC;AAGV;AAAA,MAGF,WAAWA,IAAI,MAAM,GAAG;AACtB,QAAKA,MAAGlK,EAAE,IAAI,MACdA,EAAE,IAAI,KACNA,EAAE,IAAI;AACN;AAAA,MACF;AAEA,aAAOyI,GAAazI,GAAGkK,EAAE,SAAQ,CAAE;AAAA,IAErC,WAAW3I,MAAM;AACf,YAAM,MAAMvC,KAAkBkL,CAAC;AAIjC,YAAK3J,IAAI2J,EAAE,WAAW,CAAC,OAAO,MAC5BA,IAAIA,EAAE,MAAM,CAAC,GACblK,EAAE,IAAI,OAGFO,MAAM,OAAI2J,IAAIA,EAAE,MAAM,CAAC,IAC3BlK,EAAE,IAAI,IAGDP,GAAU,KAAKyK,CAAC,IAAIzB,GAAazI,GAAGkK,CAAC,IAAIxB,GAAW1I,GAAGkK,CAAC;AAAA,EACjE;AA2DA,MAzDApB,EAAQ,YAAY/I,GAEpB+I,EAAQ,WAAW,GACnBA,EAAQ,aAAa,GACrBA,EAAQ,aAAa,GACrBA,EAAQ,cAAc,GACtBA,EAAQ,gBAAgB,GACxBA,EAAQ,kBAAkB,GAC1BA,EAAQ,kBAAkB,GAC1BA,EAAQ,kBAAkB,GAC1BA,EAAQ,mBAAmB,GAC3BA,EAAQ,SAAS,GAEjBA,EAAQ,SAASA,EAAQ,MAAMkB,IAC/BlB,EAAQ,QAAQyB,IAChBzB,EAAQ,YAAY0B,IAEpB1B,EAAQ,MAAMM,IACdN,EAAQ,OAAOO,IACfP,EAAQ,QAAQQ,IAChBR,EAAQ,MAAMS,IACdT,EAAQ,OAAOU,IACfV,EAAQ,QAAQW,IAChBX,EAAQ,OAAOY,IACfZ,EAAQ,QAAQa,IAChBb,EAAQ,QAAQc,IAChBd,EAAQ,OAAOe,IACff,EAAQ,OAAOgB,IACfhB,EAAQ,QAAQiB,IAChBjB,EAAQ,MAAMuB,IACdvB,EAAQ,OAAOwB,IACfxB,EAAQ,MAAM2B,IACd3B,EAAQ,MAAM4B,IACd5B,EAAQ,QAAQ6B,IAChB7B,EAAQ,QAAQ8B,IAChB9B,EAAQ,KAAK+B,IACb/B,EAAQ,MAAMgC,IACdhC,EAAQ,QAAQiC,IAChBjC,EAAQ,OAAOkC,IACflC,EAAQ,MAAM3I,IACd2I,EAAQ,MAAM5I,IACd4I,EAAQ,MAAMmC,IACdnC,EAAQ,MAAMoC,IACdpC,EAAQ,MAAMX,IACdW,EAAQ,SAASqC,IACjBrC,EAAQ,QAAQsC,IAChBtC,EAAQ,OAAOzB,IACfyB,EAAQ,MAAMuC,IACdvC,EAAQ,OAAOwC,IACfxC,EAAQ,OAAOyC,IACfzC,EAAQ,MAAM0C,IACd1C,EAAQ,MAAMV,IACdU,EAAQ,MAAM2C,IACd3C,EAAQ,OAAO4C,IACf5C,EAAQ,QAAQ6C,IAEZ1B,MAAQ,WAAQA,IAAM,KACtBA,KACEA,EAAI,aAAa;AAEnB,SADAG,IAAK,CAAC,aAAa,YAAY,YAAY,YAAY,QAAQ,QAAQ,UAAU,QAAQ,GACpF7J,IAAI,GAAGA,IAAI6J,EAAG,SAAS,CAAKH,EAAI,eAAepB,IAAIuB,EAAG7J,GAAG,CAAC,MAAG0J,EAAIpB,CAAC,IAAI,KAAKA,CAAC;AAIrF,SAAAC,EAAQ,OAAOmB,CAAG,GAEXnB;AACT;AAWA,SAAS2B,GAAIzK,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAUA,SAASoK,GAAI1K,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AASA,SAAS2K,GAAM3K,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAYA,SAAS4K,KAAQ;AACf,MAAIrK,GAAGuB,GACLP,IAAI,IAAI,KAAK,CAAC;AAIhB,OAFAzC,IAAW,IAENyB,IAAI,GAAGA,IAAI,UAAU;AAExB,QADAuB,IAAI,IAAI,KAAK,UAAUvB,GAAG,CAAC,GACtBuB,EAAE;AAMA,MAAIP,EAAE,MACXA,IAAIA,EAAE,KAAKO,EAAE,MAAMA,CAAC,CAAC;AAAA,SAPb;AACR,UAAIA,EAAE;AACJ,eAAAhD,IAAW,IACJ,IAAI,KAAK,KAAK;AAEvB,MAAAyC,IAAIO;AAAA,IACN;AAKF,SAAAhD,IAAW,IAEJyC,EAAE;AACX;AAQA,SAASiJ,GAAkBP,GAAK;AAC9B,SAAOA,aAAenB,MAAWmB,KAAOA,EAAI,gBAAgB9K,MAAO;AACrE;AAUA,SAAS0L,GAAG7K,GAAG;AACb,SAAO,IAAI,KAAKA,CAAC,EAAE,GAAE;AACvB;AAaA,SAAS8K,GAAI9K,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAUA,SAAS0K,GAAKhL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,CAAC;AAC1B;AAUA,SAAS+K,GAAM/K,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,EAAE;AAC3B;AASA,SAASG,KAAM;AACb,SAAO6H,GAAS,MAAM,WAAW,IAAI;AACvC;AASA,SAAS9H,KAAM;AACb,SAAO8H,GAAS,MAAM,WAAW,IAAI;AACvC;AAWA,SAASiD,GAAIjL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS4K,GAAIlL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS6H,GAAInI,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS6K,GAAO7J,GAAI;AAClB,MAAIO,GAAG4B,GAAGrD,GAAG0B,GACXvB,IAAI,GACJa,IAAI,IAAI,KAAK,CAAC,GACdmE,IAAK,CAAA;AAOP,MALIjE,MAAO,SAAQA,IAAK,KAAK,YACxBiD,EAAWjD,GAAI,GAAG/C,EAAU,GAEjC6B,IAAI,KAAK,KAAKkB,IAAK3B,CAAQ,GAEtB,KAAK;AAIH,QAAI,OAAO;AAGhB,WAFAkC,IAAI,OAAO,gBAAgB,IAAI,YAAYzB,CAAC,CAAC,GAEtCG,IAAIH;AACT,QAAA0B,IAAID,EAAEtB,CAAC,GAIHuB,KAAK,QACPD,EAAEtB,CAAC,IAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,IAKnDgF,EAAGhF,GAAG,IAAIuB,IAAI;AAAA,aAKT,OAAO,aAAa;AAK7B,WAFAD,IAAI,OAAO,YAAYzB,KAAK,CAAC,GAEtBG,IAAIH;AAGT,QAAA0B,IAAID,EAAEtB,CAAC,KAAKsB,EAAEtB,IAAI,CAAC,KAAK,MAAMsB,EAAEtB,IAAI,CAAC,KAAK,QAAQsB,EAAEtB,IAAI,CAAC,IAAI,QAAS,KAGlEuB,KAAK,QACP,OAAO,YAAY,CAAC,EAAE,KAAKD,GAAGtB,CAAC,KAK/BgF,EAAG,KAAKzD,IAAI,GAAG,GACfvB,KAAK;AAIT,MAAAA,IAAIH,IAAI;AAAA,IACV;AACE,YAAM,MAAMlB,EAAiB;AAAA,MA9C7B,QAAOqB,IAAIH,IAAI,CAAAmF,EAAGhF,GAAG,IAAI,KAAK,OAAM,IAAK,MAAM;AA2DjD,OAVAH,IAAImF,EAAG,EAAEhF,CAAC,GACVe,KAAM3B,GAGFS,KAAKkB,MACPQ,IAAIzC,EAAQ,IAAIM,IAAW2B,CAAE,GAC7BiE,EAAGhF,CAAC,KAAKH,IAAI0B,IAAI,KAAKA,IAIjByD,EAAGhF,CAAC,MAAM,GAAGA,IAAK,CAAAgF,EAAG;AAG5B,MAAIhF,IAAI;AACN,IAAAkD,IAAI,GACJ8B,IAAK,CAAC,CAAC;AAAA,OACF;AAIL,SAHA9B,IAAI,IAGG8B,EAAG,CAAC,MAAM,GAAG9B,KAAK9D,EAAU,CAAA4F,EAAG;AAGtC,SAAKnF,IAAI,GAAG0B,IAAIyD,EAAG,CAAC,GAAGzD,KAAK,IAAIA,KAAK,GAAI,CAAA1B;AAGzC,IAAIA,IAAIT,MAAU8D,KAAK9D,IAAWS;AAAA,EACpC;AAEA,SAAAgB,EAAE,IAAIqC,GACNrC,EAAE,IAAImE,GAECnE;AACT;AAWA,SAASgK,GAAMpL,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,KAAK,QAAQ;AACzD;AAcA,SAASqH,GAAKrH,GAAG;AACf,SAAAA,IAAI,IAAI,KAAKA,CAAC,GACPA,EAAE,IAAKA,EAAE,EAAE,CAAC,IAAIA,EAAE,IAAI,IAAIA,EAAE,IAAKA,EAAE,KAAK;AACjD;AAUA,SAASqL,GAAIrL,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAASsL,GAAKtL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASuL,GAAKvL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAWA,SAASwL,GAAIxL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAYA,SAAS8H,KAAM;AACb,MAAI7H,IAAI,GACN0H,IAAO,WACPjI,IAAI,IAAI,KAAKiI,EAAK1H,CAAC,CAAC;AAGtB,OADAzB,IAAW,IACJkB,EAAE,KAAK,EAAEO,IAAI0H,EAAK,SAAS,CAAAjI,IAAIA,EAAE,KAAKiI,EAAK1H,CAAC,CAAC;AACpD,SAAAzB,IAAW,IAEJmB,EAASD,GAAG,KAAK,WAAW,KAAK,QAAQ;AAClD;AAUA,SAASyL,GAAIzL,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAAS0L,GAAK1L,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AASA,SAAS2L,GAAM3L,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAGAD,EAAE,OAAO,IAAI,4BAA4B,CAAC,IAAIA,EAAE;AAChDA,EAAE,OAAO,WAAW,IAAI;AAGjB,IAAI+I,KAAU/I,EAAE,cAAcwK,GAAM5L,EAAQ;AAGnDF,KAAO,IAAIqK,GAAQrK,EAAI;AACvBC,KAAK,IAAIoK,GAAQpK,EAAE;AC/xJZ,MAAMkN,KAAwB,MCAxBC,KAAY,CAACrH,MAAQA,EAAI,YAAW,GAIpCsH,KAA+B,CAACC,MAAY;AACrD,QAAMC,IAAI,CAAA;AACV,SAAAD,EAAQ,QAAQ,CAAC7B,GAAG9J,MAAM;AACtB,IAAA4L,EAAE5L,CAAC,IAAI8J;AAAA,EACX,CAAC,GACM8B;AACX,GCVaC,KAAmB,CAACC,GAAmBC,GAAWC,MACpDF,EAAkB,WACnBA,IACA;AAAA,EACE,UAAUA;AAAA,EACV,WAAWC;AAAA,EACX,gBAAgBC;AAAA,EAChB,QAAQ;AACpB,GAEaC,KAAsB,CAACC,GAAgBH,GAAWC,MACpDE,EAAe,QAChBA,IACA;AAAA,EACE,OAAOA;AAAA,EACP,WAAWH;AAAA,EACX,gBAAgBC;AAAA,EAChB,QAAQ;AACpB,GAEaG,KAAwB,CAACC,GAAoBJ,MAC/CI,EAAmB,YACpBA,IACA;AAAA,EACE,WAAWA;AAAA,EACX,gBAAgBJ;AAAA,EAChB,QAAQ;AACpB;AC3BO,SAASK,GAAUC,GAAWC,GAAS;AAG5C,MAAI,CAFqB,EAAQD;AAG/B,UAAM,IAAI,MAAMC,CAAO;AAE3B;ACFO,SAASC,GAAaC,GAAO;AAClC,SAAO,OAAOA,KAAS,YAAYA,MAAU;AAC/C;ACNO,SAASC,GAAUJ,GAAWC,GAAS;AAG5C,MAAI,CAFqB,EAAQD;AAG/B,UAAM,IAAI;AAAA,MACoB;AAAA,IAClC;AAEA;ACPA,MAAMK,KAAa;AASZ,SAASC,GAAYC,GAAQC,GAAU;AAC5C,MAAIC,IAAgB,GAChBC,IAAO;AAEX,aAAWC,KAASJ,EAAO,KAAK,SAASF,EAAU,GAAG;AAGpD,QAFA,OAAOM,EAAM,SAAU,YAAYP,GAAU,EAAK,GAE9CO,EAAM,SAASH;AACjB;AAGF,IAAAC,IAAgBE,EAAM,QAAQA,EAAM,CAAC,EAAE,QACvCD,KAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,MAAAA;AAAA,IACA,QAAQF,IAAW,IAAIC;AAAA,EAC3B;AACA;ACxBO,SAASG,GAAcC,GAAU;AACtC,SAAOC;AAAA,IACLD,EAAS;AAAA,IACTP,GAAYO,EAAS,QAAQA,EAAS,KAAK;AAAA,EAC/C;AACA;AAKO,SAASC,GAAoBP,GAAQQ,GAAgB;AAC1D,QAAMC,IAAwBT,EAAO,eAAe,SAAS,GACvDU,IAAO,GAAG,SAASD,CAAqB,IAAIT,EAAO,MACnDW,IAAYH,EAAe,OAAO,GAClCI,IAAaZ,EAAO,eAAe,OAAO,GAC1Ca,IAAUL,EAAe,OAAOI,GAChCE,IAAeN,EAAe,SAAS,IAAIC,IAAwB,GACnEM,IAAYP,EAAe,SAASM,GACpCE,IAAc,GAAGhB,EAAO,IAAI,IAAIa,CAAO,IAAIE,CAAS;AAAA,GACpDE,IAAQP,EAAK,MAAM,cAAc,GACjCQ,IAAeD,EAAMN,CAAS;AAEpC,MAAIO,EAAa,SAAS,KAAK;AAC7B,UAAMC,IAAe,KAAK,MAAMJ,IAAY,EAAE,GACxCK,IAAmBL,IAAY,IAC/BM,IAAW,CAAA;AAEjB,aAAS/N,IAAI,GAAGA,IAAI4N,EAAa,QAAQ5N,KAAK;AAC5C,MAAA+N,EAAS,KAAKH,EAAa,MAAM5N,GAAGA,IAAI,EAAE,CAAC;AAG7C,WACE0N,IACAM,GAAmB;AAAA,MACjB,CAAC,GAAGT,CAAO,MAAMQ,EAAS,CAAC,CAAC;AAAA,MAC5B,GAAGA,EAAS,MAAM,GAAGF,IAAe,CAAC,EAAE,IAAI,CAACI,MAAY,CAAC,KAAKA,CAAO,CAAC;AAAA,MACtE,CAAC,KAAK,IAAI,SAASH,CAAgB,CAAC;AAAA,MACpC,CAAC,KAAKC,EAASF,IAAe,CAAC,CAAC;AAAA,IACxC,CAAO;AAAA,EAEL;AAEA,SACEH,IACAM,GAAmB;AAAA;AAAA,IAEjB,CAAC,GAAGT,IAAU,CAAC,MAAMI,EAAMN,IAAY,CAAC,CAAC;AAAA,IACzC,CAAC,GAAGE,CAAO,MAAMK,CAAY;AAAA,IAC7B,CAAC,KAAK,IAAI,SAASH,CAAS,CAAC;AAAA,IAC7B,CAAC,GAAGF,IAAU,CAAC,MAAMI,EAAMN,IAAY,CAAC,CAAC;AAAA,EAC/C,CAAK;AAEL;AAEA,SAASW,GAAmBL,GAAO;AACjC,QAAMO,IAAgBP,EAAM,OAAO,CAAC,CAACQ,GAAGtB,CAAI,MAAMA,MAAS,MAAS,GAC9DuB,IAAS,KAAK,IAAI,GAAGF,EAAc,IAAI,CAAC,CAACG,CAAM,MAAMA,EAAO,MAAM,CAAC;AACzE,SAAOH,EACJ,IAAI,CAAC,CAACG,GAAQxB,CAAI,MAAMwB,EAAO,SAASD,CAAM,KAAKvB,IAAO,MAAMA,IAAO,GAAG,EAC1E,KAAK;AAAA,CAAI;AACd;AC1DA,SAASyB,GAAoB5G,GAAM;AACjC,QAAM6G,IAAW7G,EAAK,CAAC;AAEvB,SAAI6G,KAAY,QAAQ,UAAUA,KAAY,YAAYA,IACjD;AAAA,IACL,OAAOA;AAAA,IACP,QAAQ7G,EAAK,CAAC;AAAA,IACd,WAAWA,EAAK,CAAC;AAAA,IACjB,MAAMA,EAAK,CAAC;AAAA,IACZ,eAAeA,EAAK,CAAC;AAAA,IACrB,YAAYA,EAAK,CAAC;AAAA,EACxB,IAGS6G;AACT;AAQO,MAAMC,WAAqB,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8CtC,YAAYpC,MAAYqC,GAAS;AAC/B,QAAIC,GAAaC,GAAiBC;AAElC,UAAM,EAAE,OAAAC,GAAO,QAAAnC,GAAQ,WAAAoC,GAAW,MAAAC,GAAM,eAAAC,GAAe,YAAAC,EAAU,IAC/DX,GAAoBG,CAAO;AAC7B,UAAMrC,CAAO,GACb,KAAK,OAAO,gBACZ,KAAK,OAAO2C,KAA0C,QACtD,KAAK,gBACHC,KAEI,QAEN,KAAK,QAAQE;AAAA,MACX,MAAM,QAAQL,CAAK,IAAIA,IAAQA,IAAQ,CAACA,CAAK,IAAI;AAAA,IACvD;AACI,UAAMM,IAAgBD;AAAA,OACnBR,IAAc,KAAK,WAAW,QAAQA,MAAgB,SACnD,SACAA,EAAY,IAAI,CAACU,MAASA,EAAK,GAAG,EAAE,OAAO,CAACC,MAAQA,KAAO,IAAI;AAAA,IACzE;AAEI,SAAK,SACH3C,MAEIyC,KAAkB,SAEjBR,IAAkBQ,EAAc,CAAC,OAAO,QACzCR,MAAoB,SAFpB,SAIAA,EAAgB,SACtB,KAAK,YACHG,KAIIK,GAAc,IAAI,CAACE,MAAQA,EAAI,KAAK,GAC1C,KAAK,YACHP,KAAapC,IACToC,EAAU,IAAI,CAACQ,MAAQ7C,GAAYC,GAAQ4C,CAAG,CAAC,IAG/CH,GAAc,IAAI,CAACE,MAAQ5C,GAAY4C,EAAI,QAAQA,EAAI,KAAK,CAAC;AACnE,UAAME,IAAqBlD;AAAA,MAGrB2C,GAAc;AAAA,IACxB,IAGUA,GAAc,aAChB;AACJ,SAAK,cACFJ,IACCK,KAEIM,OAAwB,QAAQX,MAAS,SAC3CA,IACA,uBAAO,OAAO,IAAI,GAGxB,OAAO,iBAAiB,MAAM;AAAA,MAC5B,SAAS;AAAA,QACP,UAAU;AAAA,QACV,YAAY;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,YAAY;AAAA,MACpB;AAAA,MACM,OAAO;AAAA,QACL,YAAY;AAAA,MACpB;AAAA,MACM,QAAQ;AAAA,QACN,YAAY;AAAA,MACpB;AAAA,MACM,WAAW;AAAA,QACT,YAAY;AAAA,MACpB;AAAA,MACM,eAAe;AAAA,QACb,YAAY;AAAA,MACpB;AAAA,IACA,CAAK,GAMCI,KAAkB,QAElBA,EAAc,QAEd,OAAO,eAAe,MAAM,SAAS;AAAA,MACnC,OAAOA,EAAc;AAAA,MACrB,UAAU;AAAA,MACV,cAAc;AAAA,IACtB,CAAO,IACQ,MAAM,oBACf,MAAM,kBAAkB,MAAMR,EAAY,IAE1C,OAAO,eAAe,MAAM,SAAS;AAAA,MACnC,OAAO,MAAK,EAAG;AAAA,MACf,UAAU;AAAA,MACV,cAAc;AAAA,IACtB,CAAO;AAAA,EAGL;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,WAAW;AACT,QAAIgB,IAAS,KAAK;AAElB,QAAI,KAAK;AACP,iBAAWJ,KAAQ,KAAK;AACtB,QAAIA,EAAK,QACPI,KAAU;AAAA;AAAA,IAASzC,GAAcqC,EAAK,GAAG;AAAA,aAGpC,KAAK,UAAU,KAAK;AAC7B,iBAAWpC,KAAY,KAAK;AAC1B,QAAAwC,KAAU;AAAA;AAAA,IAASvC,GAAoB,KAAK,QAAQD,CAAQ;AAIhE,WAAOwC;AAAA,EACT;AAAA,EAEA,SAAS;AACP,UAAMC,IAAiB;AAAA,MACrB,SAAS,KAAK;AAAA,IACpB;AAEI,WAAI,KAAK,aAAa,SACpBA,EAAe,YAAY,KAAK,YAG9B,KAAK,QAAQ,SACfA,EAAe,OAAO,KAAK,OAGzB,KAAK,cAAc,QAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,MACnEA,EAAe,aAAa,KAAK,aAG5BA;AAAA,EACT;AACF;AAEA,SAASP,GAAiBQ,GAAO;AAC/B,SAAOA,MAAU,UAAaA,EAAM,WAAW,IAAI,SAAYA;AACjE;AC/NO,SAASC,EAAYjD,GAAQC,GAAUiD,GAAa;AACzD,SAAO,IAAIpB,GAAa,iBAAiBoB,CAAW,IAAI;AAAA,IACtD,QAAAlD;AAAA,IACA,WAAW,CAACC,CAAQ;AAAA,EACxB,CAAG;AACH;ACPO,MAAMkD,GAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBpB,YAAYC,GAAYC,GAAUrD,GAAQ;AACxC,SAAK,QAAQoD,EAAW,OACxB,KAAK,MAAMC,EAAS,KACpB,KAAK,aAAaD,GAClB,KAAK,WAAWC,GAChB,KAAK,SAASrD;AAAA,EAChB;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA,IAChB;AAAA,EACE;AACF;AAMO,MAAMsD,GAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiCjB,YAAYC,GAAMC,GAAOC,GAAKtD,GAAMuD,GAAQ9D,GAAO;AACjD,SAAK,OAAO2D,GACZ,KAAK,QAAQC,GACb,KAAK,MAAMC,GACX,KAAK,OAAOtD,GACZ,KAAK,SAASuD,GAEd,KAAK,QAAQ9D,GACb,KAAK,OAAO,MACZ,KAAK,OAAO;AAAA,EACd;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK;AAAA,IACnB;AAAA,EACE;AACF;AAQO,MAAM+D,KAAoB;AAAA,EAC/B,MAAM,CAAA;AAAA,EACN,UAAU,CAAC,aAAa;AAAA,EACxB,qBAAqB;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,oBAAoB,CAAC,YAAY,QAAQ,gBAAgB,YAAY;AAAA,EACrE,UAAU,CAAC,MAAM;AAAA,EACjB,cAAc,CAAC,YAAY;AAAA,EAC3B,OAAO,CAAC,SAAS,QAAQ,aAAa,cAAc,cAAc;AAAA,EAClE,UAAU,CAAC,QAAQ,OAAO;AAAA,EAC1B,gBAAgB,CAAC,QAAQ,YAAY;AAAA,EACrC,gBAAgB,CAAC,iBAAiB,cAAc,cAAc;AAAA,EAC9D,oBAAoB;AAAA,IAClB;AAAA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,UAAU,CAAA;AAAA,EACV,YAAY,CAAA;AAAA,EACZ,aAAa,CAAA;AAAA,EACb,cAAc,CAAA;AAAA,EACd,WAAW,CAAA;AAAA,EACX,WAAW,CAAA;AAAA,EACX,WAAW,CAAC,QAAQ;AAAA,EACpB,aAAa,CAAC,QAAQ;AAAA,EACtB,aAAa,CAAC,QAAQ,OAAO;AAAA,EAC7B,WAAW,CAAC,QAAQ,WAAW;AAAA,EAC/B,WAAW,CAAC,MAAM;AAAA,EAClB,UAAU,CAAC,MAAM;AAAA,EACjB,aAAa,CAAC,MAAM;AAAA,EACpB,kBAAkB,CAAC,eAAe,cAAc,gBAAgB;AAAA,EAChE,yBAAyB,CAAC,MAAM;AAAA,EAChC,sBAAsB,CAAC,eAAe,QAAQ,YAAY;AAAA,EAC1D,sBAAsB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,iBAAiB,CAAC,eAAe,QAAQ,aAAa,QAAQ,YAAY;AAAA,EAC1E,sBAAsB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,yBAAyB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,qBAAqB,CAAC,eAAe,QAAQ,cAAc,OAAO;AAAA,EAClE,oBAAoB,CAAC,eAAe,QAAQ,cAAc,QAAQ;AAAA,EAClE,qBAAqB,CAAC,eAAe,QAAQ,YAAY;AAAA,EACzD,2BAA2B,CAAC,eAAe,QAAQ,cAAc,QAAQ;AAAA,EACzE,qBAAqB,CAAC,eAAe,QAAQ,aAAa,WAAW;AAAA,EACrE,iBAAiB,CAAC,cAAc,gBAAgB;AAAA,EAChD,qBAAqB,CAAC,QAAQ,YAAY;AAAA,EAC1C,qBAAqB,CAAC,QAAQ,cAAc,cAAc,QAAQ;AAAA,EAClE,wBAAwB,CAAC,QAAQ,cAAc,cAAc,QAAQ;AAAA,EACrE,oBAAoB,CAAC,QAAQ,cAAc,OAAO;AAAA,EAClD,mBAAmB,CAAC,QAAQ,cAAc,QAAQ;AAAA,EAClD,0BAA0B,CAAC,QAAQ,cAAc,QAAQ;AAC3D,GACMC,KAAa,IAAI,IAAI,OAAO,KAAKD,EAAiB,CAAC;AAKlD,SAASE,GAAOC,GAAW;AAChC,QAAMC,IACkDD,GAAU;AAClE,SAAO,OAAOC,KAAc,YAAYH,GAAW,IAAIG,CAAS;AAClE;AAGA,IAAIC;AAAA,CAEH,SAAUA,GAAmB;AAC5B,EAAAA,EAAkB,QAAW,SAC7BA,EAAkB,WAAc,YAChCA,EAAkB,eAAkB;AACtC,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;AC1MhD,IAAIC;AAAA,CAEH,SAAUA,GAAmB;AAC5B,EAAAA,EAAkB,QAAW,SAC7BA,EAAkB,WAAc,YAChCA,EAAkB,eAAkB,gBACpCA,EAAkB,QAAW,SAC7BA,EAAkB,sBAAyB,uBAC3CA,EAAkB,kBAAqB,mBACvCA,EAAkB,kBAAqB,mBACvCA,EAAkB,sBAAyB,uBAC3CA,EAAkB,SAAY,UAC9BA,EAAkB,SAAY,UAC9BA,EAAkB,SAAY,UAC9BA,EAAkB,mBAAsB,oBACxCA,EAAkB,sBAAyB,uBAC3CA,EAAkB,YAAe,aACjCA,EAAkB,QAAW,SAC7BA,EAAkB,OAAU,QAC5BA,EAAkB,aAAgB,cAClCA,EAAkB,eAAkB,gBACpCA,EAAkB,yBAA4B;AAChD,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;ACtBhD,IAAIC;AAAA,CAEH,SAAUA,GAAM;AACf,EAAAA,EAAK,OAAU,QACfA,EAAK,WAAc,YACnBA,EAAK,uBAA0B,uBAC/BA,EAAK,sBAAyB,sBAC9BA,EAAK,gBAAmB,gBACxBA,EAAK,QAAW,SAChBA,EAAK,WAAc,YACnBA,EAAK,kBAAqB,kBAC1BA,EAAK,kBAAqB,kBAC1BA,EAAK,sBAAyB,sBAC9BA,EAAK,WAAc,YACnBA,EAAK,MAAS,YACdA,EAAK,QAAW,cAChBA,EAAK,SAAY,eACjBA,EAAK,UAAa,gBAClBA,EAAK,OAAU,aACfA,EAAK,OAAU,aACfA,EAAK,OAAU,aACfA,EAAK,SAAY,eACjBA,EAAK,eAAkB,eACvBA,EAAK,YAAe,aACpBA,EAAK,aAAgB,aACrBA,EAAK,YAAe,YACpBA,EAAK,gBAAmB,eACxBA,EAAK,oBAAuB,oBAC5BA,EAAK,4BAA+B,2BACpCA,EAAK,yBAA4B,wBACjCA,EAAK,yBAA4B,wBACjCA,EAAK,mBAAsB,mBAC3BA,EAAK,yBAA4B,wBACjCA,EAAK,4BAA+B,2BACpCA,EAAK,wBAA2B,uBAChCA,EAAK,uBAA0B,sBAC/BA,EAAK,wBAA2B,uBAChCA,EAAK,+BAAkC,6BACvCA,EAAK,uBAA0B,uBAC/BA,EAAK,mBAAsB,mBAC3BA,EAAK,wBAA2B,uBAChCA,EAAK,wBAA2B,uBAChCA,EAAK,2BAA8B,0BACnCA,EAAK,uBAA0B,sBAC/BA,EAAK,sBAAyB,qBAC9BA,EAAK,8BAAiC;AACxC,GAAGA,MAASA,IAAO,CAAA,EAAG;ACzCf,SAASC,GAAaC,GAAM;AACjC,SAAOA,MAAS,KAAUA,MAAS;AACrC;AASO,SAASC,GAAQD,GAAM;AAC5B,SAAOA,KAAQ,MAAUA,KAAQ;AACnC;AAYO,SAASE,GAASF,GAAM;AAC7B,SACGA,KAAQ,MAAUA,KAAQ;AAAA,EAC1BA,KAAQ,MAAUA,KAAQ;AAE/B;AAUO,SAASG,GAAYH,GAAM;AAChC,SAAOE,GAASF,CAAI,KAAKA,MAAS;AACpC;AAWO,SAASI,GAAeJ,GAAM;AACnC,SAAOE,GAASF,CAAI,KAAKC,GAAQD,CAAI,KAAKA,MAAS;AACrD;ACrDO,SAASK,GAAuBxD,GAAO;AAC5C,MAAIyD;AAEJ,MAAIC,IAAe,OAAO,kBACtBC,IAAoB,MACpBC,IAAmB;AAEvB,WAASvR,IAAI,GAAGA,IAAI2N,EAAM,QAAQ,EAAE3N,GAAG;AACrC,QAAIwR;AAEJ,UAAM3E,IAAOc,EAAM3N,CAAC,GACdyR,IAASC,GAAkB7E,CAAI;AAErC,IAAI4E,MAAW5E,EAAK,WAIpByE,KACGE,IAAqBF,OAAuB,QAC7CE,MAAuB,SACnBA,IACAxR,GACNuR,IAAmBvR,GAEfA,MAAM,KAAKyR,IAASJ,MACtBA,IAAeI;AAAA,EAEnB;AAEA,SAAO9D,EACJ,IAAI,CAACd,GAAM7M,MAAOA,MAAM,IAAI6M,IAAOA,EAAK,MAAMwE,CAAY,CAAE,EAC5D;AAAA,KACED,IAAsBE,OAAuB,QAC5CF,MAAwB,SACtBA,IACA;AAAA,IACJG,IAAmB;AAAA,EACzB;AACA;AAEA,SAASG,GAAkBzN,GAAK;AAC9B,MAAIjE,IAAI;AAER,SAAOA,IAAIiE,EAAI,UAAU4M,GAAa5M,EAAI,WAAWjE,CAAC,CAAC;AACrD,MAAEA;AAGJ,SAAOA;AACT;AAgFO,SAAS2R,GAAiBrF,GAAOsF,GAAS;AAC/C,QAAMC,IAAevF,EAAM,QAAQ,QAAQ,OAAO,GAE5CqB,IAAQkE,EAAa,MAAM,cAAc,GACzCC,IAAenE,EAAM,WAAW,GAEhCoE,IACJpE,EAAM,SAAS,KACfA,EACG,MAAM,CAAC,EACP,MAAM,CAACd,MAASA,EAAK,WAAW,KAAKgE,GAAahE,EAAK,WAAW,CAAC,CAAC,CAAC,GAEpEmF,IAA0BH,EAAa,SAAS,OAAO,GAEvDI,IAAmB3F,EAAM,SAAS,GAAG,KAAK,CAAC0F,GAC3CE,IAAmB5F,EAAM,SAAS,IAAI,GACtC6F,IAAuBF,KAAoBC,GAC3CE;AAAA;AAAA,IAEH,CAACN,KACAxF,EAAM,SAAS,MACf6F,KACAJ,KACAC;AAAA;AACJ,MAAIK,IAAS;AAEb,QAAMC,IAAqBR,KAAgBjB,GAAavE,EAAM,WAAW,CAAC,CAAC;AAE3E,UAAK8F,KAAwB,CAACE,KAAuBP,OACnDM,KAAU;AAAA,IAGZA,KAAUR,IAENO,KAAwBD,OAC1BE,KAAU;AAAA,IAGL,QAAQA,IAAS;AAC1B;AC7KA,IAAIE;AAAA,CAEH,SAAUA,GAAW;AACpB,EAAAA,EAAU,MAAS,SACnBA,EAAU,MAAS,SACnBA,EAAU,OAAU,KACpBA,EAAU,SAAY,KACtBA,EAAU,MAAS,KACnBA,EAAU,UAAa,KACvBA,EAAU,UAAa,KACvBA,EAAU,SAAY,OACtBA,EAAU,QAAW,KACrBA,EAAU,SAAY,KACtBA,EAAU,KAAQ,KAClBA,EAAU,YAAe,KACzBA,EAAU,YAAe,KACzBA,EAAU,UAAa,KACvBA,EAAU,OAAU,KACpBA,EAAU,UAAa,KACvBA,EAAU,OAAU,QACpBA,EAAU,MAAS,OACnBA,EAAU,QAAW,SACrBA,EAAU,SAAY,UACtBA,EAAU,eAAkB,eAC5BA,EAAU,UAAa;AACzB,GAAGA,MAAcA,IAAY,CAAA,EAAG;ACfzB,MAAMC,GAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBjB,YAAY9F,GAAQ;AAClB,UAAM+F,IAAmB,IAAIzC,GAAMuC,EAAU,KAAK,GAAG,GAAG,GAAG,CAAC;AAC5D,SAAK,SAAS7F,GACd,KAAK,YAAY+F,GACjB,KAAK,QAAQA,GACb,KAAK,OAAO,GACZ,KAAK,YAAY;AAAA,EACnB;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU;AACR,gBAAK,YAAY,KAAK,OACP,KAAK,QAAQ,KAAK,UAAS;AAAA,EAE5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY;AACV,QAAIC,IAAQ,KAAK;AAEjB,QAAIA,EAAM,SAASH,EAAU;AAC3B;AACE,YAAIG,EAAM;AACR,UAAAA,IAAQA,EAAM;AAAA,aACT;AAEL,gBAAMC,IAAYC,GAAc,MAAMF,EAAM,GAAG;AAE/C,UAAAA,EAAM,OAAOC,GAEbA,EAAU,OAAOD,GACjBA,IAAQC;AAAA,QACV;AAAA,aACOD,EAAM,SAASH,EAAU;AAGpC,WAAOG;AAAA,EACT;AACF;AAKO,SAASG,GAAsB5C,GAAM;AAC1C,SACEA,MAASsC,EAAU,QACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,OACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,SACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,MACnBtC,MAASsC,EAAU,aACnBtC,MAASsC,EAAU,aACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,QACnBtC,MAASsC,EAAU;AAEvB;AAUA,SAASO,GAAqBhC,GAAM;AAClC,SACGA,KAAQ,KAAUA,KAAQ,SAAYA,KAAQ,SAAUA,KAAQ;AAErE;AAUA,SAASiC,GAAyB3F,GAAMJ,GAAU;AAChD,SACEgG,GAAmB5F,EAAK,WAAWJ,CAAQ,CAAC,KAC5CiG,GAAoB7F,EAAK,WAAWJ,IAAW,CAAC,CAAC;AAErD;AAEA,SAASgG,GAAmBlC,GAAM;AAChC,SAAOA,KAAQ,SAAUA,KAAQ;AACnC;AAEA,SAASmC,GAAoBnC,GAAM;AACjC,SAAOA,KAAQ,SAAUA,KAAQ;AACnC;AASA,SAASoC,GAAiBC,GAAOnG,GAAU;AACzC,QAAM8D,IAAOqC,EAAM,OAAO,KAAK,YAAYnG,CAAQ;AAEnD,MAAI8D,MAAS;AACX,WAAOyB,EAAU;AACZ,MAAIzB,KAAQ,MAAUA,KAAQ,KAAQ;AAE3C,UAAMsC,IAAO,OAAO,cAActC,CAAI;AACtC,WAAOsC,MAAS,MAAM,QAAS,IAAIA,CAAI;AAAA,EACzC;AAEA,SAAO,OAAOtC,EAAK,SAAS,EAAE,EAAE,cAAc,SAAS,GAAG,GAAG;AAC/D;AAKA,SAASuC,EAAYF,GAAOlD,GAAMC,GAAOC,GAAK7D,GAAO;AACnD,QAAMO,IAAOsG,EAAM,MACbG,IAAM,IAAIpD,IAAQiD,EAAM;AAC9B,SAAO,IAAInD,GAAMC,GAAMC,GAAOC,GAAKtD,GAAMyG,GAAKhH,CAAK;AACrD;AASA,SAASsG,GAAcO,GAAOjD,GAAO;AACnC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD;AAEf,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,YAAQmE,GAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeV,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAEH,UAAEnE;AACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMF,KAAK;AAEH,UAAEA,GACF,EAAEwG,EAAM,MACRA,EAAM,YAAYxG;AAClB;AAAA,MAEF,KAAK;AAEH,QAAIS,EAAK,WAAWT,IAAW,CAAC,MAAM,KACpCA,KAAY,IAEZ,EAAEA,GAGJ,EAAEwG,EAAM,MACRA,EAAM,YAAYxG;AAClB;AAAA;AAAA,MAGF,KAAK;AAEH,eAAO6G,GAAYL,GAAOxG,CAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUpC,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,MAAM5F,GAAUA,IAAW,CAAC;AAAA,MAElE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAAA,MAEpE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,KAAK5F,GAAUA,IAAW,CAAC;AAAA,MAEjE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,YACES,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM;AAElC,iBAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAGpE;AAAA,MAEF,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,OAAO5F,GAAUA,IAAW,CAAC;AAAA,MAEnE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAAA,MAEpE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,IAAI5F,GAAUA,IAAW,CAAC;AAAA,MAEhE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,WAAW5F,GAAUA,IAAW,CAAC;AAAA,MAEvE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,WAAW5F,GAAUA,IAAW,CAAC;AAAA,MAEvE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,MAAM5F,GAAUA,IAAW,CAAC;AAAA,MAElE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA;AAAA,MAGrE,KAAK;AAEH,eACES,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,KAE3B8G,GAAgBN,GAAOxG,CAAQ,IAGjC+G,GAAWP,GAAOxG,CAAQ;AAAA,IACzC;AAEI,QAAIoE,GAAQD,CAAI,KAAKA,MAAS;AAC5B,aAAO6C,GAAWR,GAAOxG,GAAUmE,CAAI;AAGzC,QAAIG,GAAYH,CAAI;AAClB,aAAO8C,GAAST,GAAOxG,CAAQ;AAGjC,UAAMgD;AAAA,MACJwD,EAAM;AAAA,MACNxG;AAAA,MACAmE,MAAS,KACL,mFACAgC,GAAqBhC,CAAI,KAAKiC,GAAyB3F,GAAMT,CAAQ,IACrE,yBAAyBuG,GAAiBC,GAAOxG,CAAQ,CAAC,MAC1D,sBAAsBuG,GAAiBC,GAAOxG,CAAQ,CAAC;AAAA,IACjE;AAAA,EACE;AAEA,SAAO0G,EAAYF,GAAOZ,EAAU,KAAKgB,GAAYA,CAAU;AACjE;AAWA,SAASC,GAAYL,GAAOjD,GAAO;AACjC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ;AAEvB,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAImE,MAAS,MAAUA,MAAS;AAC9B;AAGF,QAAIgC,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ;AAAA,EAEJ;AAEA,SAAO0G;AAAA,IACLF;AAAA,IACAZ,EAAU;AAAA,IACVrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,IAAQ,GAAGvD,CAAQ;AAAA,EAClC;AACA;AA+BA,SAASgH,GAAWR,GAAOjD,GAAO2D,GAAW;AAC3C,QAAMzG,IAAO+F,EAAM,OAAO;AAC1B,MAAIxG,IAAWuD,GACXY,IAAO+C,GACPxL,IAAU;AAMd,MAJIyI,MAAS,OACXA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAG/BmE,MAAS;AAGX,QAFAA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,GAE7BoE,GAAQD,CAAI;AACd,YAAMnB;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,6CAA6CuG;AAAA,UAC3CC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA;AAGI,IAAAA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ;AAsBjC,MAnBImE,MAAS,OACXzI,IAAU,IACVyI,IAAO1D,EAAK,WAAW,EAAET,CAAQ,GACjCA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ,KAG7BmE,MAAS,MAAUA,MAAS,SAC9BzI,IAAU,IACVyI,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAE7BmE,MAAS,MAAUA,MAAS,QAC9BA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAGnCA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ,IAG7BmE,MAAS,MAAUG,GAAYH,CAAI;AACrC,UAAMnB;AAAA,MACJwD,EAAM;AAAA,MACNxG;AAAA,MACA,2CAA2CuG;AAAA,QACzCC;AAAA,QACAxG;AAAA,MACR,CAAO;AAAA,IACP;AAGE,SAAO0G;AAAA,IACLF;AAAA,IACA9K,IAAUkK,EAAU,QAAQA,EAAU;AAAA,IACtCrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,GAAOvD,CAAQ;AAAA,EAC9B;AACA;AAKA,SAASmH,GAAWX,GAAOjD,GAAO2D,GAAW;AAC3C,MAAI,CAAC9C,GAAQ8C,CAAS;AACpB,UAAMlE;AAAA,MACJwD,EAAM;AAAA,MACNjD;AAAA,MACA,2CAA2CgD;AAAA,QACzCC;AAAA,QACAjD;AAAA,MACR,CAAO;AAAA,IACP;AAGE,QAAM9C,IAAO+F,EAAM,OAAO;AAC1B,MAAIxG,IAAWuD,IAAQ;AAEvB,SAAOa,GAAQ3D,EAAK,WAAWT,CAAQ,CAAC;AACtC,MAAEA;AAGJ,SAAOA;AACT;AAsBA,SAAS+G,GAAWP,GAAOjD,GAAO;AAChC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ,GACnB6D,IAAapH,GACbL,IAAQ;AAEZ,SAAOK,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAImE,MAAS;AACX,aAAAxE,KAASc,EAAK,MAAM2G,GAAYpH,CAAQ,GACjC0G,EAAYF,GAAOZ,EAAU,QAAQrC,GAAOvD,IAAW,GAAGL,CAAK;AAGxE,QAAIwE,MAAS,IAAQ;AACnB,MAAAxE,KAASc,EAAK,MAAM2G,GAAYpH,CAAQ;AACxC,YAAMqH,IACJ5G,EAAK,WAAWT,IAAW,CAAC,MAAM,MAC9BS,EAAK,WAAWT,IAAW,CAAC,MAAM,MAChCsH,GAAgCd,GAAOxG,CAAQ,IAC/CuH,GAA6Bf,GAAOxG,CAAQ,IAC9CwH,GAAqBhB,GAAOxG,CAAQ;AAC1C,MAAAL,KAAS0H,EAAO,OAChBrH,KAAYqH,EAAO,MACnBD,IAAapH;AACb;AAAA,IACF;AAEA,QAAImE,MAAS,MAAUA,MAAS;AAC9B;AAGF,QAAIgC,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ,YAAMgD;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,oCAAoCuG;AAAA,UAClCC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA,EAEE;AAEA,QAAMgD,EAAYwD,EAAM,QAAQxG,GAAU,sBAAsB;AAClE;AAEA,SAASsH,GAAgCd,GAAOxG,GAAU;AACxD,QAAMS,IAAO+F,EAAM,OAAO;AAC1B,MAAIiB,IAAQ,GACRC,IAAO;AAEX,SAAOA,IAAO,MAAI;AAChB,UAAMvD,IAAO1D,EAAK,WAAWT,IAAW0H,GAAM;AAE9C,QAAIvD,MAAS,KAAQ;AAEnB,UAAIuD,IAAO,KAAK,CAACvB,GAAqBsB,CAAK;AACzC;AAGF,aAAO;AAAA,QACL,OAAO,OAAO,cAAcA,CAAK;AAAA,QACjC,MAAAC;AAAA,MACR;AAAA,IACI;AAIA,QAFAD,IAASA,KAAS,IAAKE,GAAaxD,CAAI,GAEpCsD,IAAQ;AACV;AAAA,EAEJ;AAEA,QAAMzE;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,qCAAqCS,EAAK;AAAA,MACxCT;AAAA,MACAA,IAAW0H;AAAA,IACjB,CAAK;AAAA,EACL;AACA;AAEA,SAASH,GAA6Bf,GAAOxG,GAAU;AACrD,QAAMS,IAAO+F,EAAM,OAAO,MACpBrC,IAAOyD,GAAiBnH,GAAMT,IAAW,CAAC;AAEhD,MAAImG,GAAqBhC,CAAI;AAC3B,WAAO;AAAA,MACL,OAAO,OAAO,cAAcA,CAAI;AAAA,MAChC,MAAM;AAAA,IACZ;AAIE,MAAIkC,GAAmBlC,CAAI,KAGvB1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,KAClC;AACA,UAAM6H,IAAeD,GAAiBnH,GAAMT,IAAW,CAAC;AAExD,QAAIsG,GAAoBuB,CAAY;AAOlC,aAAO;AAAA,QACL,OAAO,OAAO,cAAc1D,GAAM0D,CAAY;AAAA,QAC9C,MAAM;AAAA,MAChB;AAAA,EAEI;AAGF,QAAM7E;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,qCAAqCS,EAAK,MAAMT,GAAUA,IAAW,CAAC,CAAC;AAAA,EAC3E;AACA;AASA,SAAS4H,GAAiBnH,GAAMT,GAAU;AAGxC,SACG2H,GAAalH,EAAK,WAAWT,CAAQ,CAAC,KAAK,KAC3C2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC,KAAK,IAC/C2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC,KAAK,IAChD2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC;AAE9C;AAgBA,SAAS2H,GAAaxD,GAAM;AAC1B,SAAOA,KAAQ,MAAUA,KAAQ,KAC7BA,IAAO,KACPA,KAAQ,MAAUA,KAAQ,KAC1BA,IAAO,KACPA,KAAQ,MAAUA,KAAQ,MAC1BA,IAAO,KACP;AACN;AAcA,SAASqD,GAAqBhB,GAAOxG,GAAU;AAC7C,QAAMS,IAAO+F,EAAM,OAAO;AAG1B,UAFa/F,EAAK,WAAWT,IAAW,CAAC,GAE7B;AAAA,IACV,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,EACA;AAEE,QAAMgD;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,uCAAuCS,EAAK;AAAA,MAC1CT;AAAA,MACAA,IAAW;AAAA,IACjB,CAAK;AAAA,EACL;AACA;AAcA,SAAS8G,GAAgBN,GAAOjD,GAAO;AACrC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIqH,IAAYtB,EAAM,WAClBxG,IAAWuD,IAAQ,GACnB6D,IAAapH,GACb+H,IAAc;AAClB,QAAMC,IAAa,CAAA;AAEnB,SAAOhI,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QACEmE,MAAS,MACT1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,IAClC;AACA,MAAA+H,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CgI,EAAW,KAAKD,CAAW;AAC3B,YAAMhC,IAAQW;AAAA,QACZF;AAAA,QACAZ,EAAU;AAAA,QACVrC;AAAA,QACAvD,IAAW;AAAA;AAAA,QACXwE,GAAuBwD,CAAU,EAAE,KAAK;AAAA,CAAI;AAAA,MACpD;AACM,aAAAxB,EAAM,QAAQwB,EAAW,SAAS,GAClCxB,EAAM,YAAYsB,GACX/B;AAAA,IACT;AAEA,QACE5B,MAAS,MACT1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,IAClC;AACA,MAAA+H,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CoH,IAAapH,IAAW,GAExBA,KAAY;AACZ;AAAA,IACF;AAEA,QAAImE,MAAS,MAAUA,MAAS,IAAQ;AACtC,MAAA4D,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CgI,EAAW,KAAKD,CAAW,GAEvB5D,MAAS,MAAU1D,EAAK,WAAWT,IAAW,CAAC,MAAM,KACvDA,KAAY,IAEZ,EAAEA,GAGJ+H,IAAc,IACdX,IAAapH,GACb8H,IAAY9H;AACZ;AAAA,IACF;AAEA,QAAImG,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ,YAAMgD;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,oCAAoCuG;AAAA,UAClCC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA,EAEE;AAEA,QAAMgD,EAAYwD,EAAM,QAAQxG,GAAU,sBAAsB;AAClE;AAUA,SAASiH,GAAST,GAAOjD,GAAO;AAC9B,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ;AAEvB,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAIuE,GAAeJ,CAAI;AACrB,QAAEnE;AAAA;AAEF;AAAA,EAEJ;AAEA,SAAO0G;AAAA,IACLF;AAAA,IACAZ,EAAU;AAAA,IACVrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,GAAOvD,CAAQ;AAAA,EAC9B;AACA;ACr4BA,MAAMiI,KAAmB,IACnBC,KAAsB;AAKrB,SAASC,GAAQxI,GAAO;AAC7B,SAAOyI,GAAYzI,GAAO,EAAE;AAC9B;AAEA,SAASyI,GAAYzI,GAAO0I,GAAY;AACtC,UAAQ,OAAO1I,GAAK;AAAA,IAClB,KAAK;AACH,aAAO,KAAK,UAAUA,CAAK;AAAA,IAE7B,KAAK;AACH,aAAOA,EAAM,OAAO,aAAaA,EAAM,IAAI,MAAM;AAAA,IAEnD,KAAK;AACH,aAAO2I,GAAkB3I,GAAO0I,CAAU;AAAA,IAE5C;AACE,aAAO,OAAO1I,CAAK;AAAA,EACzB;AACA;AAEA,SAAS2I,GAAkB3I,GAAO4I,GAAsB;AACtD,MAAI5I,MAAU;AACZ,WAAO;AAGT,MAAI4I,EAAqB,SAAS5I,CAAK;AACrC,WAAO;AAGT,QAAM0I,IAAa,CAAC,GAAGE,GAAsB5I,CAAK;AAElD,MAAI6I,GAAW7I,CAAK,GAAG;AACrB,UAAM8I,IAAY9I,EAAM;AAExB,QAAI8I,MAAc9I;AAChB,aAAO,OAAO8I,KAAc,WACxBA,IACAL,GAAYK,GAAWJ,CAAU;AAAA,EAEzC,WAAW,MAAM,QAAQ1I,CAAK;AAC5B,WAAO+I,GAAY/I,GAAO0I,CAAU;AAGtC,SAAOM,GAAahJ,GAAO0I,CAAU;AACvC;AAEA,SAASG,GAAW7I,GAAO;AACzB,SAAO,OAAOA,EAAM,UAAW;AACjC;AAEA,SAASgJ,GAAaC,GAAQP,GAAY;AACxC,QAAMQ,IAAU,OAAO,QAAQD,CAAM;AAErC,SAAIC,EAAQ,WAAW,IACd,OAGLR,EAAW,SAASH,KACf,MAAMY,GAAaF,CAAM,IAAI,MAM/B,OAHYC,EAAQ;AAAA,IACzB,CAAC,CAACE,GAAKpJ,CAAK,MAAMoJ,IAAM,OAAOX,GAAYzI,GAAO0I,CAAU;AAAA,EAChE,EAC2B,KAAK,IAAI,IAAI;AACxC;AAEA,SAASK,GAAY3F,GAAOsF,GAAY;AACtC,MAAItF,EAAM,WAAW;AACnB,WAAO;AAGT,MAAIsF,EAAW,SAASH;AACtB,WAAO;AAGT,QAAMrT,IAAM,KAAK,IAAIoT,IAAkBlF,EAAM,MAAM,GAC7CiG,IAAYjG,EAAM,SAASlO,GAC3BoU,IAAQ,CAAA;AAEd,WAAS5V,IAAI,GAAGA,IAAIwB,GAAK,EAAExB;AACzB,IAAA4V,EAAM,KAAKb,GAAYrF,EAAM1P,CAAC,GAAGgV,CAAU,CAAC;AAG9C,SAAIW,MAAc,IAChBC,EAAM,KAAK,iBAAiB,IACnBD,IAAY,KACrBC,EAAM,KAAK,OAAOD,CAAS,aAAa,GAGnC,MAAMC,EAAM,KAAK,IAAI,IAAI;AAClC;AAEA,SAASH,GAAaF,GAAQ;AAC5B,QAAM3W,IAAM,OAAO,UAAU,SAC1B,KAAK2W,CAAM,EACX,QAAQ,cAAc,EAAE,EACxB,QAAQ,MAAM,EAAE;AAEnB,MAAI3W,MAAQ,YAAY,OAAO2W,EAAO,eAAgB,YAAY;AAChE,UAAMM,IAAON,EAAO,YAAY;AAEhC,QAAI,OAAOM,KAAS,YAAYA,MAAS;AACvC,aAAOA;AAAA,EAEX;AAEA,SAAOjX;AACT;AC1GO,MAAMkX;AAAA;AAAA;AAAA;AAAA,EAIX,QAAQ,IAAI,aAAa,eACrB,SAAoBxJ,GAAOyJ,GAAa;AACtC,WAAOzJ,aAAiByJ;AAAA,EAC1B,IACA,SAAoBzJ,GAAOyJ,GAAa;AACtC,QAAIzJ,aAAiByJ;AACnB,aAAO;AAGT,QAAI,OAAOzJ,KAAU,YAAYA,MAAU,MAAM;AAC/C,UAAI0J;AAGJ,YAAMC,IAAYF,EAAY,UAAU,OAAO,WAAW,GACpDG;AAAA;AAAA,QACJ,OAAO,eAAe5J,IAClBA,EAAM,OAAO,WAAW,KACvB0J,IAAqB1J,EAAM,iBAAiB,QAC7C0J,MAAuB,SACvB,SACAA,EAAmB;AAAA;AAEzB,UAAIC,MAAcC,GAAgB;AAChC,cAAMC,IAAmBrB,GAAQxI,CAAK;AACtC,cAAM,IAAI,MAAM,cAAc2J,CAAS,KAAKE,CAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAWtD;AAAA,MACR;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;ACzCC,MAAMC,GAAO;AAAA,EAClB,YACEhJ,GACAyI,IAAO,mBACPQ,IAAiB;AAAA,IACf,MAAM;AAAA,IACN,QAAQ;AAAA,EACd,GACI;AACA,WAAOjJ,KAAS,YACdlB,GAAU,IAAO,oCAAoC4I,GAAQ1H,CAAI,CAAC,GAAG,GACvE,KAAK,OAAOA,GACZ,KAAK,OAAOyI,GACZ,KAAK,iBAAiBQ,GACtB,KAAK,eAAe,OAAO,KACzBnK;AAAA,MACE;AAAA,MACA;AAAA,IACR,GACI,KAAK,eAAe,SAAS,KAC3BA;AAAA,MACE;AAAA,MACA;AAAA,IACR;AAAA,EACE;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AACF;AAOO,SAASoK,GAAS5J,GAAQ;AAC/B,SAAOoJ,GAAWpJ,GAAQ0J,EAAM;AAClC;AClCO,SAASG,GAAM7J,GAAQkF,GAAS;AAErC,SADe,IAAI4E,GAAO9J,GAAQkF,CAAO,EAC3B,cAAa;AAC7B;AA6DO,MAAM4E,GAAO;AAAA,EAClB,YAAY9J,GAAQkF,IAAU,IAAI;AAChC,UAAM6E,IAAYH,GAAS5J,CAAM,IAAIA,IAAS,IAAI0J,GAAO1J,CAAM;AAC/D,SAAK,SAAS,IAAI8F,GAAMiE,CAAS,GACjC,KAAK,WAAW7E,GAChB,KAAK,gBAAgB;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY;AACV,UAAMc,IAAQ,KAAK,YAAYH,EAAU,IAAI;AAC7C,WAAO,KAAK,KAAKG,GAAO;AAAA,MACtB,MAAM9B,EAAK;AAAA,MACX,OAAO8B,EAAM;AAAA,IACnB,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB;AACd,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAM9B,EAAK;AAAA,MACX,aAAa,KAAK;AAAA,QAChB2B,EAAU;AAAA,QACV,KAAK;AAAA,QACLA,EAAU;AAAA,MAClB;AAAA,IACA,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,kBAAkB;AAChB,QAAI,KAAK,KAAKA,EAAU,OAAO;AAC7B,aAAO,KAAK,yBAAwB;AAGtC,UAAMmE,IAAiB,KAAK,gBAAe,GACrCC,IAAeD,IACjB,KAAK,OAAO,UAAS,IACrB,KAAK,OAAO;AAEhB,QAAIC,EAAa,SAASpE,EAAU,MAAM;AACxC,cAAQoE,EAAa,OAAK;AAAA,QACxB,KAAK;AACH,iBAAO,KAAK,sBAAqB;AAAA,QAEnC,KAAK;AACH,iBAAO,KAAK,0BAAyB;AAAA,QAEvC,KAAK;AACH,iBAAO,KAAK,0BAAyB;AAAA,QAEvC,KAAK;AACH,iBAAO,KAAK,6BAA4B;AAAA,QAE1C,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,QAErC,KAAK;AACH,iBAAO,KAAK,+BAA8B;AAAA,QAE5C,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,MAC9C;AAEM,UAAID;AACF,cAAM/G;AAAA,UACJ,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO,MAAM;AAAA,UAClB;AAAA,QACV;AAGM,cAAQgH,EAAa,OAAK;AAAA,QACxB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,QAErC,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,MAC9C;AAAA,IACI;AAEA,UAAM,KAAK,WAAWA,CAAY;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAMzG,IAAQ,KAAK,OAAO;AAE1B,QAAI,KAAK,KAAKqC,EAAU,OAAO;AAC7B,aAAO,KAAK,KAAKrC,GAAO;AAAA,QACtB,MAAMU,EAAK;AAAA,QACX,WAAWF,GAAkB;AAAA,QAC7B,MAAM;AAAA,QACN,qBAAqB,CAAA;AAAA,QACrB,YAAY,CAAA;AAAA,QACZ,cAAc,KAAK,kBAAiB;AAAA,MAC5C,CAAO;AAGH,UAAMkG,IAAY,KAAK,mBAAkB;AACzC,QAAIf;AAEJ,WAAI,KAAK,KAAKtD,EAAU,IAAI,MAC1BsD,IAAO,KAAK,UAAS,IAGhB,KAAK,KAAK3F,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,WAAAgG;AAAA,MACA,MAAAf;AAAA,MACA,qBAAqB,KAAK,yBAAwB;AAAA,MAClD,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB;AACnB,UAAMgB,IAAiB,KAAK,YAAYtE,EAAU,IAAI;AAEtD,YAAQsE,EAAe,OAAK;AAAA,MAC1B,KAAK;AACH,eAAOnG,GAAkB;AAAA,MAE3B,KAAK;AACH,eAAOA,GAAkB;AAAA,MAE3B,KAAK;AACH,eAAOA,GAAkB;AAAA,IACjC;AAEI,UAAM,KAAK,WAAWmG,CAAc;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,2BAA2B;AACzB,WAAO,KAAK;AAAA,MACVtE,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA,EAKA,0BAA0B;AACxB,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAM3B,EAAK;AAAA,MACX,UAAU,KAAK,cAAa;AAAA,MAC5B,OAAO,KAAK,YAAY2B,EAAU,KAAK,GAAG,KAAK;MAC/C,cAAc,KAAK,oBAAoBA,EAAU,MAAM,IACnD,KAAK,uBAAsB,IAC3B;AAAA,MACJ,YAAY,KAAK,qBAAoB;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB;AACd,UAAMrC,IAAQ,KAAK,OAAO;AAC1B,gBAAK,YAAYqC,EAAU,MAAM,GAC1B,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,IAC1B,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,oBAAoB;AAClB,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMA,EAAK;AAAA,MACX,YAAY,KAAK;AAAA,QACf2B,EAAU;AAAA,QACV,KAAK;AAAA,QACLA,EAAU;AAAA,MAClB;AAAA,IACA,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,iBAAiB;AACf,WAAO,KAAK,KAAKA,EAAU,MAAM,IAC7B,KAAK,cAAa,IAClB,KAAK,WAAU;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa;AACX,UAAMrC,IAAQ,KAAK,OAAO,OACpB4G,IAAc,KAAK,UAAS;AAClC,QAAIC,GACAlB;AAEJ,WAAI,KAAK,oBAAoBtD,EAAU,KAAK,KAC1CwE,IAAQD,GACRjB,IAAO,KAAK,UAAS,KAErBA,IAAOiB,GAGF,KAAK,KAAK5G,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,OAAAmG;AAAA,MACA,MAAAlB;AAAA,MACA,WAAW,KAAK,eAAe,EAAK;AAAA,MACpC,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,KAAKtD,EAAU,OAAO,IACrC,KAAK,kBAAiB,IACtB;AAAA,IACV,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,eAAeyE,GAAS;AACtB,UAAMC,IAAOD,IAAU,KAAK,qBAAqB,KAAK;AACtD,WAAO,KAAK,aAAazE,EAAU,SAAS0E,GAAM1E,EAAU,OAAO;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKA,cAAcyE,IAAU,IAAO;AAC7B,UAAM9G,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAC3B,gBAAK,YAAYtD,EAAU,KAAK,GACzB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,OAAO,KAAK,kBAAkBmB,CAAO;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA,EAEA,qBAAqB;AACnB,WAAO,KAAK,cAAc,EAAI;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,gBAAgB;AACd,UAAM9G,IAAQ,KAAK,OAAO;AAC1B,SAAK,YAAYqC,EAAU,MAAM;AACjC,UAAM2E,IAAmB,KAAK,sBAAsB,IAAI;AAExD,WAAI,CAACA,KAAoB,KAAK,KAAK3E,EAAU,IAAI,IACxC,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,kBAAiB;AAAA,MAC5B,YAAY,KAAK,gBAAgB,EAAK;AAAA,IAC9C,CAAO,IAGI,KAAK,KAAKV,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,eAAesG,IAAmB,KAAK,eAAc,IAAK;AAAA,MAC1D,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,0BAA0B;AACxB,UAAMhH,IAAQ,KAAK,OAAO;AAK1B,WAJA,KAAK,cAAc,UAAU,GAIzB,KAAK,SAAS,iCAAiC,KAC1C,KAAK,KAAKA,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,kBAAiB;AAAA,MAC5B,qBAAqB,KAAK,yBAAwB;AAAA,MAClD,gBAAgB,KAAK,cAAc,IAAI,GAAG,KAAK;MAC/C,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC5C,CAAO,IAGI,KAAK,KAAKV,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,kBAAiB;AAAA,MAC5B,gBAAgB,KAAK,cAAc,IAAI,GAAG,KAAK;MAC/C,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB;AAClB,QAAI,KAAK,OAAO,MAAM,UAAU;AAC9B,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,UAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,kBAAkBoG,GAAS;AACzB,UAAMtE,IAAQ,KAAK,OAAO;AAE1B,YAAQA,EAAM,MAAI;AAAA,MAChB,KAAKH,EAAU;AACb,eAAO,KAAK,UAAUyE,CAAO;AAAA,MAE/B,KAAKzE,EAAU;AACb,eAAO,KAAK,YAAYyE,CAAO;AAAA,MAEjC,KAAKzE,EAAU;AACb,oBAAK,aAAY,GACV,KAAK,KAAKG,GAAO;AAAA,UACtB,MAAM9B,EAAK;AAAA,UACX,OAAO8B,EAAM;AAAA,QACvB,CAAS;AAAA,MAEH,KAAKH,EAAU;AACb,oBAAK,aAAY,GACV,KAAK,KAAKG,GAAO;AAAA,UACtB,MAAM9B,EAAK;AAAA,UACX,OAAO8B,EAAM;AAAA,QACvB,CAAS;AAAA,MAEH,KAAKH,EAAU;AAAA,MACf,KAAKA,EAAU;AACb,eAAO,KAAK,mBAAkB;AAAA,MAEhC,KAAKA,EAAU;AAGb,gBAFA,KAAK,aAAY,GAETG,EAAM,OAAK;AAAA,UACjB,KAAK;AACH,mBAAO,KAAK,KAAKA,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO;AAAA,YACrB,CAAa;AAAA,UAEH,KAAK;AACH,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO;AAAA,YACrB,CAAa;AAAA,UAEH,KAAK;AACH,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,YACzB,CAAa;AAAA,UAEH;AACE,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO8B,EAAM;AAAA,YAC3B,CAAa;AAAA,QACb;AAAA,MAEM,KAAKH,EAAU;AACb,YAAIyE;AAGF,cAFA,KAAK,YAAYzE,EAAU,MAAM,GAE7B,KAAK,OAAO,MAAM,SAASA,EAAU,MAAM;AAC7C,kBAAM4E,IAAU,KAAK,OAAO,MAAM;AAClC,kBAAMxH;AAAA,cACJ,KAAK,OAAO;AAAA,cACZ+C,EAAM;AAAA,cACN,yBAAyByE,CAAO;AAAA,YAC9C;AAAA,UACU;AACE,kBAAM,KAAK,WAAWzE,CAAK;AAI/B,eAAO,KAAK,cAAa;AAAA,MAE3B;AACE,cAAM,KAAK,WAAU;AAAA,IAC7B;AAAA,EACE;AAAA,EAEA,yBAAyB;AACvB,WAAO,KAAK,kBAAkB,EAAI;AAAA,EACpC;AAAA,EAEA,qBAAqB;AACnB,UAAMA,IAAQ,KAAK,OAAO;AAC1B,gBAAK,aAAY,GACV,KAAK,KAAKA,GAAO;AAAA,MACtB,MAAM9B,EAAK;AAAA,MACX,OAAO8B,EAAM;AAAA,MACb,OAAOA,EAAM,SAASH,EAAU;AAAA,IACtC,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAUyE,GAAS;AACjB,UAAMC,IAAO,MAAM,KAAK,kBAAkBD,CAAO;AAEjD,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMpG,EAAK;AAAA,MACX,QAAQ,KAAK,IAAI2B,EAAU,WAAW0E,GAAM1E,EAAU,SAAS;AAAA,IACrE,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAYyE,GAAS;AACnB,UAAMC,IAAO,MAAM,KAAK,iBAAiBD,CAAO;AAEhD,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMpG,EAAK;AAAA,MACX,QAAQ,KAAK,IAAI2B,EAAU,SAAS0E,GAAM1E,EAAU,OAAO;AAAA,IACjE,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiByE,GAAS;AACxB,UAAM9G,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAC3B,gBAAK,YAAYtD,EAAU,KAAK,GACzB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,OAAO,KAAK,kBAAkBmB,CAAO;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgBA,GAAS;AACvB,UAAMI,IAAa,CAAA;AAEnB,WAAO,KAAK,KAAK7E,EAAU,EAAE;AAC3B,MAAA6E,EAAW,KAAK,KAAK,eAAeJ,CAAO,CAAC;AAG9C,WAAOI;AAAA,EACT;AAAA,EAEA,uBAAuB;AACrB,WAAO,KAAK,gBAAgB,EAAI;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAeJ,GAAS;AACtB,UAAM9G,IAAQ,KAAK,OAAO;AAC1B,gBAAK,YAAYqC,EAAU,EAAE,GACtB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,MACpB,WAAW,KAAK,eAAeoG,CAAO;AAAA,IAC5C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,qBAAqB;AACnB,UAAM9G,IAAQ,KAAK,OAAO;AAC1B,QAAImH;AAEJ,QAAI,KAAK,oBAAoB9E,EAAU,SAAS,GAAG;AACjD,YAAM+E,IAAY,KAAK,mBAAkB;AACzC,WAAK,YAAY/E,EAAU,SAAS,GACpC8E,IAAO,KAAK,KAAKnH,GAAO;AAAA,QACtB,MAAMU,EAAK;AAAA,QACX,MAAM0G;AAAA,MACd,CAAO;AAAA,IACH;AACE,MAAAD,IAAO,KAAK,eAAc;AAG5B,WAAI,KAAK,oBAAoB9E,EAAU,IAAI,IAClC,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAyG;AAAA,IACR,CAAO,IAGIA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB;AACf,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMzG,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,IAC1B,CAAK;AAAA,EACH;AAAA;AAAA,EAEA,kBAAkB;AAChB,WAAO,KAAK,KAAK2B,EAAU,MAAM,KAAK,KAAK,KAAKA,EAAU,YAAY;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA,EAKA,mBAAmB;AACjB,QAAI,KAAK;AACP,aAAO,KAAK,mBAAkB;AAAA,EAElC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,QAAQ;AAC3B,UAAMwH,IAAa,KAAK,qBAAoB,GACtCG,IAAiB,KAAK;AAAA,MAC1BhF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AACI,WAAO,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,YAAAwH;AAAA,MACA,gBAAAG;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,+BAA+B;AAC7B,UAAMrH,IAAQ,KAAK,OAAO,OACpB0G,IAAY,KAAK,mBAAkB;AACzC,SAAK,YAAYrE,EAAU,KAAK;AAChC,UAAM8E,IAAO,KAAK,eAAc;AAChC,WAAO,KAAK,KAAKnH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,WAAAgG;AAAA,MACA,MAAAS;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,4BAA4B;AAC1B,UAAMnH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,QAAQ;AAC3B,UAAMiG,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKlH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAAuB;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,UAAMlH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,MAAM;AACzB,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AACzC,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,WAAO,KAAK,sBAAsB,YAAY,IAC1C,KAAK,cAAclF,EAAU,KAAK,KAAK,cAAc,IACrD,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,WAAO,KAAK;AAAA,MACVA,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,uBAAuB;AACrB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,UAAS,GACrBnO,IAAO,KAAK,kBAAiB;AACnC,SAAK,YAAY6K,EAAU,KAAK;AAChC,UAAM8E,IAAO,KAAK,mBAAkB,GAC9BD,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKlH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,WAAWnO;AAAA,MACX,MAAA2P;AAAA,MACA,YAAAD;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB;AAClB,WAAO,KAAK;AAAA,MACV7E,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAAqB;AACnB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,UAAS;AAC3B,SAAK,YAAYtD,EAAU,KAAK;AAChC,UAAM8E,IAAO,KAAK,mBAAkB;AACpC,QAAIK;AAEJ,IAAI,KAAK,oBAAoBnF,EAAU,MAAM,MAC3CmF,IAAe,KAAK,uBAAsB;AAG5C,UAAMN,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKlH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,MAAAwB;AAAA,MACA,cAAAK;AAAA,MACA,YAAAN;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,+BAA+B;AAC7B,UAAMlH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,WAAW;AAC9B,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AACzC,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAA2B;AACzB,UAAMvH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,OAAO;AAC1B,UAAMiG,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCO,IAAQ,KAAK,sBAAqB;AACxC,WAAO,KAAK,KAAKzH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAAuB;AAAA,MACA,OAAAO;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,WAAO,KAAK,oBAAoBpF,EAAU,MAAM,IAC5C,KAAK,cAAcA,EAAU,MAAM,KAAK,cAAc,IACtD,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B;AACxB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,MAAM;AACzB,UAAMiG,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCQ,IAAS,KAAK,0BAAyB;AAC7C,WAAO,KAAK,KAAK1H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAAuB;AAAA,MACA,QAAAQ;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,WAAO,KAAK;AAAA,MACVrF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA,EAKA,2BAA2B;AACzB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,mBAAkB,GAC9BuB,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKlH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAAuB;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB;AACnB,QACE,KAAK,OAAO,MAAM,UAAU,UAC5B,KAAK,OAAO,MAAM,UAAU,WAC5B,KAAK,OAAO,MAAM,UAAU;AAE5B,YAAMzH;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ,KAAK,OAAO,MAAM;AAAA,QAClB,GAAGkI;AAAA,UACD,KAAK,OAAO;AAAA,QACtB,CAAS;AAAA,MACT;AAGI,WAAO,KAAK,UAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iCAAiC;AAC/B,UAAM3H,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,OAAO;AAC1B,UAAMiG,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,2BAA0B;AAC9C,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAAuB;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,6BAA6B;AAC3B,WAAO,KAAK;AAAA,MACVlF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,2BAA2B;AACzB,UAAMoE,IAAe,KAAK,OAAO,UAAS;AAE1C,QAAIA,EAAa,SAASpE,EAAU;AAClC,cAAQoE,EAAa,OAAK;AAAA,QACxB,KAAK;AACH,iBAAO,KAAK,qBAAoB;AAAA,QAElC,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,4BAA2B;AAAA,QAEzC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,QAErC,KAAK;AACH,iBAAO,KAAK,uBAAsB;AAAA,QAEpC,KAAK;AACH,iBAAO,KAAK,8BAA6B;AAAA,MACnD;AAGI,UAAM,KAAK,WAAWA,CAAY;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,uBAAuB;AACrB,UAAMzG,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,QAAQ;AAC3B,UAAMkH,IAAa,KAAK,qBAAoB,GACtCG,IAAiB,KAAK;AAAA,MAC1BhF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAEI,QAAI6E,EAAW,WAAW,KAAKG,EAAe,WAAW;AACvD,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKrH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,YAAAwG;AAAA,MACA,gBAAAG;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAA2B;AACzB,UAAMrH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,QAAQ;AAC3B,UAAM2F,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB;AAE5C,QAAIA,EAAW,WAAW;AACxB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKlH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAAuB;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAMlH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,MAAM;AACzB,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AAEzC,QACED,EAAW,WAAW,KACtBJ,EAAW,WAAW,KACtBK,EAAO,WAAW;AAElB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,8BAA8B;AAC5B,UAAMvH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,WAAW;AAC9B,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AAEzC,QACED,EAAW,WAAW,KACtBJ,EAAW,WAAW,KACtBK,EAAO,WAAW;AAElB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,0BAA0B;AACxB,UAAMvH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,OAAO;AAC1B,UAAM2F,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCO,IAAQ,KAAK,sBAAqB;AAExC,QAAIP,EAAW,WAAW,KAAKO,EAAM,WAAW;AAC9C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKzH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAAuB;AAAA,MACA,OAAAO;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,yBAAyB;AACvB,UAAMzH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,MAAM;AACzB,UAAM2F,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCQ,IAAS,KAAK,0BAAyB;AAE7C,QAAIR,EAAW,WAAW,KAAKQ,EAAO,WAAW;AAC/C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK1H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAAuB;AAAA,MACA,QAAAQ;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gCAAgC;AAC9B,UAAM1H,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,OAAO;AAC1B,UAAM2F,IAAO,KAAK,UAAS,GACrBuB,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,2BAA0B;AAE9C,QAAIL,EAAW,WAAW,KAAKK,EAAO,WAAW;AAC/C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAAuB;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAMvH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,WAAW,GAC9B,KAAK,YAAY2C,EAAU,EAAE;AAC7B,UAAMsD,IAAO,KAAK,UAAS,GACrBnO,IAAO,KAAK,kBAAiB,GAC7BoQ,IAAa,KAAK,sBAAsB,YAAY;AAC1D,SAAK,cAAc,IAAI;AACvB,UAAMC,IAAY,KAAK,wBAAuB;AAC9C,WAAO,KAAK,KAAK7H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,WAAWnO;AAAA,MACX,YAAAoQ;AAAA,MACA,WAAAC;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,0BAA0B;AACxB,WAAO,KAAK,cAAcxF,EAAU,MAAM,KAAK,sBAAsB;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6BA,yBAAyB;AACvB,UAAMrC,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAE3B,QAAI,OAAO,UAAU,eAAe,KAAKlF,IAAmBkF,EAAK,KAAK;AACpE,aAAOA;AAGT,UAAM,KAAK,WAAW3F,CAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAKJ,GAAYV,GAAM;AACrB,WAAI,KAAK,SAAS,eAAe,OAC/BA,EAAK,MAAM,IAAIS;AAAA,MACbC;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACpB,IAGWV;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,KAAKa,GAAM;AACT,WAAO,KAAK,OAAO,MAAM,SAASA;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAYA,GAAM;AAChB,UAAMyC,IAAQ,KAAK,OAAO;AAE1B,QAAIA,EAAM,SAASzC;AACjB,kBAAK,aAAY,GACVyC;AAGT,UAAM/C;AAAA,MACJ,KAAK,OAAO;AAAA,MACZ+C,EAAM;AAAA,MACN,YAAYsF,GAAiB/H,CAAI,CAAC,WAAW4H,GAAanF,CAAK,CAAC;AAAA,IACtE;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAoBzC,GAAM;AAGxB,WAFc,KAAK,OAAO,MAEhB,SAASA,KACjB,KAAK,aAAY,GACV,MAGF;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc3D,GAAO;AACnB,UAAMoG,IAAQ,KAAK,OAAO;AAE1B,QAAIA,EAAM,SAASH,EAAU,QAAQG,EAAM,UAAUpG;AACnD,WAAK,aAAY;AAAA;AAEjB,YAAMqD;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ+C,EAAM;AAAA,QACN,aAAapG,CAAK,YAAYuL,GAAanF,CAAK,CAAC;AAAA,MACzD;AAAA,EAEE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAAsBpG,GAAO;AAC3B,UAAMoG,IAAQ,KAAK,OAAO;AAE1B,WAAIA,EAAM,SAASH,EAAU,QAAQG,EAAM,UAAUpG,KACnD,KAAK,aAAY,GACV,MAGF;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAW2L,GAAS;AAClB,UAAMvF,IACJuF,KAAmD,KAAK,OAAO;AACjE,WAAOtI;AAAA,MACL,KAAK,OAAO;AAAA,MACZ+C,EAAM;AAAA,MACN,cAAcmF,GAAanF,CAAK,CAAC;AAAA,IACvC;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAIwF,GAAUC,GAASC,GAAW;AAChC,SAAK,YAAYF,CAAQ;AACzB,UAAMrJ,IAAQ,CAAA;AAEd,WAAO,CAAC,KAAK,oBAAoBuJ,CAAS;AACxC,MAAAvJ,EAAM,KAAKsJ,EAAQ,KAAK,IAAI,CAAC;AAG/B,WAAOtJ;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAaqJ,GAAUC,GAASC,GAAW;AACzC,QAAI,KAAK,oBAAoBF,CAAQ,GAAG;AACtC,YAAMrJ,IAAQ,CAAA;AAEd;AACE,QAAAA,EAAM,KAAKsJ,EAAQ,KAAK,IAAI,CAAC;AAAA,aACtB,CAAC,KAAK,oBAAoBC,CAAS;AAE5C,aAAOvJ;AAAA,IACT;AAEA,WAAO,CAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAKqJ,GAAUC,GAASC,GAAW;AACjC,SAAK,YAAYF,CAAQ;AACzB,UAAMrJ,IAAQ,CAAA;AAEd;AACE,MAAAA,EAAM,KAAKsJ,EAAQ,KAAK,IAAI,CAAC;AAAA,WACtB,CAAC,KAAK,oBAAoBC,CAAS;AAE5C,WAAOvJ;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAcwJ,GAAeF,GAAS;AACpC,SAAK,oBAAoBE,CAAa;AACtC,UAAMxJ,IAAQ,CAAA;AAEd;AACE,MAAAA,EAAM,KAAKsJ,EAAQ,KAAK,IAAI,CAAC;AAAA,WACtB,KAAK,oBAAoBE,CAAa;AAE/C,WAAOxJ;AAAA,EACT;AAAA,EAEA,eAAe;AACb,UAAM,EAAE,WAAAyJ,MAAc,KAAK,UAErB5F,IAAQ,KAAK,OAAO,QAAO;AAEjC,QAAI4F,MAAc,UAAa5F,EAAM,SAASH,EAAU,QACtD,EAAE,KAAK,eAEH,KAAK,gBAAgB+F;AACvB,YAAM3I;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ+C,EAAM;AAAA,QACN,+BAA+B4F,CAAS;AAAA,MAClD;AAAA,EAGE;AACF;AAKA,SAAST,GAAanF,GAAO;AAC3B,QAAMpG,IAAQoG,EAAM;AACpB,SAAOsF,GAAiBtF,EAAM,IAAI,KAAKpG,KAAS,OAAO,KAAKA,CAAK,MAAM;AACzE;AAKA,SAAS0L,GAAiB/H,GAAM;AAC9B,SAAO4C,GAAsB5C,CAAI,IAAI,IAAIA,CAAI,MAAMA;AACrD;AC/+CO,SAASsI,GAAYtU,GAAK;AAC/B,SAAO,IAAIA,EAAI,QAAQuU,IAAeC,EAAe,CAAC;AACxD;AAEA,MAAMD,KAAgB;AAEtB,SAASC,GAAgBxU,GAAK;AAC5B,SAAOyU,GAAgBzU,EAAI,WAAW,CAAC,CAAC;AAC1C;AAEA,MAAMyU,KAAkB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GCtKaC,KAAQ,OAAO,OAAO,EAAE;AAgF9B,SAASC,GAAMC,GAAMC,GAASC,IAAc1I,IAAmB;AACpE,QAAM2I,IAAgB,oBAAI,IAAG;AAE7B,aAAW/I,KAAQ,OAAO,OAAOW,CAAI;AACnC,IAAAoI,EAAc,IAAI/I,GAAMgJ,GAAqBH,GAAS7I,CAAI,CAAC;AAI7D,MAAIiJ,GACAC,IAAU,MAAM,QAAQN,CAAI,GAC5BO,IAAO,CAACP,CAAI,GACZQ,IAAQ,IACRC,IAAQ,CAAA,GACRlK,IAAOyJ,GACPnD,GACA6D;AACJ,QAAMxK,IAAO,CAAA,GACPyK,IAAY,CAAA;AAGlB,KAAG;AACD,IAAAH;AACA,UAAMI,IAAYJ,MAAUD,EAAK,QAC3BM,IAAWD,KAAaH,EAAM,WAAW;AAE/C,QAAIG,GAAW;AAKb,UAJA/D,IAAM8D,EAAU,WAAW,IAAI,SAAYzK,EAAKA,EAAK,SAAS,CAAC,GAC/DK,IAAOmK,GACPA,IAASC,EAAU,IAAG,GAElBE;AACF,YAAIP,GAAS;AACX,UAAA/J,IAAOA,EAAK,MAAK;AACjB,cAAIuK,IAAa;AAEjB,qBAAW,CAACC,GAASC,CAAS,KAAKP,GAAO;AACxC,kBAAMQ,IAAWF,IAAUD;AAE3B,YAAIE,MAAc,QAChBzK,EAAK,OAAO0K,GAAU,CAAC,GACvBH,OAEAvK,EAAK0K,CAAQ,IAAID;AAAA,UAErB;AAAA,QACF,OAAO;AACL,UAAAzK,IAAO,OAAO;AAAA,YACZ,CAAA;AAAA,YACA,OAAO,0BAA0BA,CAAI;AAAA,UACjD;AAEU,qBAAW,CAACwK,GAASC,CAAS,KAAKP;AACjC,YAAAlK,EAAKwK,CAAO,IAAIC;AAAA,QAEpB;AAGF,MAAAR,IAAQH,EAAM,OACdE,IAAOF,EAAM,MACbI,IAAQJ,EAAM,OACdC,IAAUD,EAAM,SAChBA,IAAQA,EAAM;AAAA,IAChB,WAAWK,GAAQ;AAIjB,UAHA7D,IAAMyD,IAAUE,IAAQD,EAAKC,CAAK,GAClCjK,IAAOmK,EAAO7D,CAAG,GAEbtG,KAAS;AACX;AAGF,MAAAL,EAAK,KAAK2G,CAAG;AAAA,IACf;AAEA,QAAIrD;AAEJ,QAAI,CAAC,MAAM,QAAQjD,CAAI,GAAG;AACxB,UAAI2K,GAAoBC;AAExB,MAAAzJ,GAAOnB,CAAI,KAAKlD,GAAU,IAAO,qBAAqB4I,GAAQ1F,CAAI,CAAC,GAAG;AACtE,YAAM6K,IAAUR,KACXM,IAAqBf,EAAc,IAAI5J,EAAK,IAAI,OAAO,QACxD2K,MAAuB,SACrB,SACAA,EAAmB,SACpBC,IAAsBhB,EAAc,IAAI5J,EAAK,IAAI,OAAO,QACzD4K,MAAwB,SACxB,SACAA,EAAoB;AAMxB,UALA3H,IAGM4H,GAAQ,KAAKnB,GAAS1J,GAAMsG,GAAK6D,GAAQxK,GAAMyK,CAAS,GAE1DnH,MAAWsG;AACb;AAGF,UAAItG,MAAW;AACb,YAAI,CAACoH,GAAW;AACd,UAAA1K,EAAK,IAAG;AACR;AAAA,QACF;AAAA,iBACSsD,MAAW,WACpBiH,EAAM,KAAK,CAAC5D,GAAKrD,CAAM,CAAC,GAEpB,CAACoH;AACH,YAAIlJ,GAAO8B,CAAM;AACf,UAAAjD,IAAOiD;AAAA,aACF;AACL,UAAAtD,EAAK,IAAG;AACR;AAAA,QACF;AAAA,IAGN;AAMA,QAJIsD,MAAW,UAAaqH,KAC1BJ,EAAM,KAAK,CAAC5D,GAAKtG,CAAI,CAAC,GAGpBqK;AACF,MAAA1K,EAAK,IAAG;AAAA,SACH;AACL,UAAImL;AAEJ,MAAAhB,IAAQ;AAAA,QACN,SAAAC;AAAA,QACA,OAAAE;AAAA,QACA,MAAAD;AAAA,QACA,OAAAE;AAAA,QACA,MAAMJ;AAAA,MACd,GACMC,IAAU,MAAM,QAAQ/J,CAAI,GAC5BgK,IAAOD,IACH/J,KACC8K,IAAanB,EAAY3J,EAAK,IAAI,OAAO,QAC1C8K,MAAe,SACfA,IACA,CAAA,GACJb,IAAQ,IACRC,IAAQ,CAAA,GAEJC,KACFC,EAAU,KAAKD,CAAM,GAGvBA,IAASnK;AAAA,IACX;AAAA,EACF,SAAS8J,MAAU;AAEnB,SAAII,EAAM,WAAW,IAEZA,EAAMA,EAAM,SAAS,CAAC,EAAE,CAAC,IAG3BT;AACT;AAoFO,SAASI,GAAqBH,GAAS7I,GAAM;AAClD,QAAMkK,IAAcrB,EAAQ7I,CAAI;AAEhC,SAAI,OAAOkK,KAAgB,WAElBA,IACE,OAAOA,KAAgB,aAEzB;AAAA,IACL,OAAOA;AAAA,IACP,OAAO;AAAA,EACb,IAGS;AAAA,IACL,OAAOrB,EAAQ;AAAA,IACf,OAAOA,EAAQ;AAAA,EACnB;AACA;ACnVO,SAASsB,GAAMC,GAAK;AACzB,SAAOzB,GAAMyB,GAAKC,EAAkB;AACtC;AACA,MAAMC,KAAkB,IAClBD,KAAqB;AAAA,EACzB,MAAM;AAAA,IACJ,OAAO,CAAClL,MAASA,EAAK;AAAA,EAC1B;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAACA,MAAS,MAAMA,EAAK;AAAA,EAChC;AAAA;AAAA,EAEE,UAAU;AAAA,IACR,OAAO,CAACA,MAASoL,EAAKpL,EAAK,aAAa;AAAA;AAAA,CAAM;AAAA,EAClD;AAAA,EACE,qBAAqB;AAAA,IACnB,MAAMA,GAAM;AACV,YAAMqL,IAAUC,EAAK,KAAKF,EAAKpL,EAAK,qBAAqB,IAAI,GAAG,GAAG,GAC7Df,IAASmM;AAAA,QACb;AAAA,UACEpL,EAAK;AAAA,UACLoL,EAAK,CAACpL,EAAK,MAAMqL,CAAO,CAAC;AAAA,UACzBD,EAAKpL,EAAK,YAAY,GAAG;AAAA,QACnC;AAAA,QACQ;AAAA,MACR;AAGM,cAAQf,MAAW,UAAU,KAAKA,IAAS,OAAOe,EAAK;AAAA,IACzD;AAAA,EACJ;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,UAAAuL,GAAU,MAAAtD,GAAM,cAAAK,GAAc,YAAAN,EAAU,MAChDuD,IACA,OACAtD,IACAqD,EAAK,OAAOhD,CAAY,IACxBgD,EAAK,KAAKF,EAAKpD,GAAY,GAAG,CAAC;AAAA,EACrC;AAAA,EACE,cAAc;AAAA,IACZ,OAAO,CAAC,EAAE,YAAAwD,QAAiBC,EAAMD,CAAU;AAAA,EAC/C;AAAA,EACE,OAAO;AAAA,IACL,MAAM,EAAE,OAAA7D,GAAO,MAAAlB,GAAM,WAAWnO,GAAM,YAAA0P,GAAY,cAAA0D,KAAgB;AAChE,YAAMzM,IAASqM,EAAK,IAAI3D,GAAO,IAAI,IAAIlB;AACvC,UAAIkF,IAAW1M,IAASqM,EAAK,KAAKF,EAAK9S,GAAM,IAAI,GAAG,GAAG;AAEvD,aAAIqT,EAAS,SAASR,OACpBQ,IAAW1M,IAASqM,EAAK;AAAA,GAAOjJ,GAAO+I,EAAK9S,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAG1D8S,EAAK,CAACO,GAAUP,EAAKpD,GAAY,GAAG,GAAG0D,CAAY,GAAG,GAAG;AAAA,IAClE;AAAA,EACJ;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,MAAAjF,GAAM,OAAAvJ,EAAK,MAAOuJ,IAAO,OAAOvJ;AAAA,EAC9C;AAAA;AAAA,EAEE,gBAAgB;AAAA,IACd,OAAO,CAAC,EAAE,MAAAuJ,GAAM,YAAAuB,EAAU,MACxB,QAAQvB,IAAO6E,EAAK,KAAKF,EAAKpD,GAAY,GAAG,CAAC;AAAA,EACpD;AAAA,EACE,gBAAgB;AAAA,IACd,OAAO,CAAC,EAAE,eAAA4D,GAAe,YAAA5D,GAAY,cAAA0D,EAAY,MAC/CN;AAAA,MACE;AAAA,QACE;AAAA,QACAE,EAAK,OAAOM,CAAa;AAAA,QACzBR,EAAKpD,GAAY,GAAG;AAAA,QACpB0D;AAAA,MACV;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CACL,EAAE,MAAAjF,GAAM,eAAAmF,GAAe,qBAAAC,GAAqB,YAAA7D,GAAY,cAAA0D,EAAY;AAAA;AAAA,MAGpE,YAAYjF,CAAI,GAAG6E,EAAK,KAAKF,EAAKS,GAAqB,IAAI,GAAG,GAAG,CAAC,OAC5DD,CAAa,IAAIN,EAAK,IAAIF,EAAKpD,GAAY,GAAG,GAAG,GAAG,CAAC,KAC3D0D;AAAA;AAAA,EACN;AAAA;AAAA,EAEE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,OAAAxO,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,YAAY;AAAA,IACV,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,OAAAA,GAAO,OAAO4O,EAAa,MACnCA,IAAgBvJ,GAAiBrF,CAAK,IAAIiM,GAAYjM,CAAK;AAAA,EACjE;AAAA,EACE,cAAc;AAAA,IACZ,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAQA,IAAQ,SAAS;AAAA,EAC5C;AAAA,EACE,WAAW;AAAA,IACT,OAAO,MAAM;AAAA,EACjB;AAAA,EACE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,QAAAsL,QAAa,MAAM4C,EAAK5C,GAAQ,IAAI,IAAI;AAAA,EACtD;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,QAAAH,QAAa,MAAM+C,EAAK/C,GAAQ,IAAI,IAAI;AAAA,EACtD;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,MAAA5B,GAAM,OAAAvJ,EAAK,MAAOuJ,IAAO,OAAOvJ;AAAA,EAC9C;AAAA;AAAA,EAEE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,MAAAuJ,GAAM,WAAWnO,EAAI,MAC7B,MAAMmO,IAAO6E,EAAK,KAAKF,EAAK9S,GAAM,IAAI,GAAG,GAAG;AAAA,EAClD;AAAA;AAAA,EAEE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,MAAAmO,EAAI,MAAOA;AAAA,EACzB;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,MAAAwB,EAAI,MAAO,MAAMA,IAAO;AAAA,EACtC;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,MAAAA,EAAI,MAAOA,IAAO;AAAA,EAChC;AAAA;AAAA,EAEE,kBAAkB;AAAA,IAChB,OAAO,CAAC,EAAE,aAAAzH,GAAa,YAAAwH,GAAY,gBAAAG,EAAc,MAC/CmD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K,EAAK,CAAC,UAAUA,EAAKpD,GAAY,GAAG,GAAGyD,EAAMtD,CAAc,CAAC,GAAG,GAAG;AAAA,EACxE;AAAA,EACE,yBAAyB;AAAA,IACvB,OAAO,CAAC,EAAE,WAAAX,GAAW,MAAAS,EAAI,MAAOT,IAAY,OAAOS;AAAA,EACvD;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAAzH,GAAa,MAAAiG,GAAM,YAAAuB,EAAU,MACrCsD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K,EAAK,CAAC,UAAU3E,GAAM2E,EAAKpD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EACvD;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAAxH,GAAa,MAAAiG,GAAM,YAAA2B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MACzDiD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K;AAAA,MACE;AAAA,QACE;AAAA,QACA3E;AAAA,QACA6E,EAAK,eAAeF,EAAKhD,GAAY,KAAK,CAAC;AAAA,QAC3CgD,EAAKpD,GAAY,GAAG;AAAA,QACpByD,EAAMpD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,iBAAiB;AAAA,IACf,OAAO,CAAC,EAAE,aAAA7H,GAAa,MAAAiG,GAAM,WAAWnO,GAAM,MAAA2P,GAAM,YAAAD,EAAU,MAC5DsD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1BiG,KACCsF,GAAkBzT,CAAI,IACnBgT,EAAK;AAAA,GAAOjJ,GAAO+I,EAAK9S,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAC3CgT,EAAK,KAAKF,EAAK9S,GAAM,IAAI,GAAG,GAAG,KACnC,OACA2P,IACAqD,EAAK,KAAKF,EAAKpD,GAAY,GAAG,CAAC;AAAA,EACrC;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAAxH,GAAa,MAAAiG,GAAM,MAAAwB,GAAM,cAAAK,GAAc,YAAAN,EAAU,MACzDsD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K;AAAA,MACE,CAAC3E,IAAO,OAAOwB,GAAMqD,EAAK,MAAMhD,CAAY,GAAG8C,EAAKpD,GAAY,GAAG,CAAC;AAAA,MACpE;AAAA,IACR;AAAA,EACA;AAAA,EACE,yBAAyB;AAAA,IACvB,OAAO,CAAC,EAAE,aAAAxH,GAAa,MAAAiG,GAAM,YAAA2B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MACzDiD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K;AAAA,MACE;AAAA,QACE;AAAA,QACA3E;AAAA,QACA6E,EAAK,eAAeF,EAAKhD,GAAY,KAAK,CAAC;AAAA,QAC3CgD,EAAKpD,GAAY,GAAG;AAAA,QACpByD,EAAMpD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAA7H,GAAa,MAAAiG,GAAM,YAAAuB,GAAY,OAAAO,EAAK,MAC5C+C,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K;AAAA,MACE,CAAC,SAAS3E,GAAM2E,EAAKpD,GAAY,GAAG,GAAGsD,EAAK,MAAMF,EAAK7C,GAAO,KAAK,CAAC,CAAC;AAAA,MACrE;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,aAAA/H,GAAa,MAAAiG,GAAM,YAAAuB,GAAY,QAAAQ,EAAM,MAC7C8C,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K,EAAK,CAAC,QAAQ3E,GAAM2E,EAAKpD,GAAY,GAAG,GAAGyD,EAAMjD,CAAM,CAAC,GAAG,GAAG;AAAA,EACpE;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAAhI,GAAa,MAAAiG,GAAM,YAAAuB,EAAU,MACrCsD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAAI4K,EAAK,CAAC3E,GAAM2E,EAAKpD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EAC3E;AAAA,EACE,2BAA2B;AAAA,IACzB,OAAO,CAAC,EAAE,aAAAxH,GAAa,MAAAiG,GAAM,YAAAuB,GAAY,QAAAK,EAAM,MAC7CiD,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B4K,EAAK,CAAC,SAAS3E,GAAM2E,EAAKpD,GAAY,GAAG,GAAGyD,EAAMpD,CAAM,CAAC,GAAG,GAAG;AAAA,EACrE;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAA7H,GAAa,MAAAiG,GAAM,WAAWnO,GAAM,YAAAoQ,GAAY,WAAAC,EAAS,MACjE2C,EAAK,IAAI9K,GAAa;AAAA,CAAI,IAC1B,gBACAiG,KACCsF,GAAkBzT,CAAI,IACnBgT,EAAK;AAAA,GAAOjJ,GAAO+I,EAAK9S,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAC3CgT,EAAK,KAAKF,EAAK9S,GAAM,IAAI,GAAG,GAAG,MAClCoQ,IAAa,gBAAgB,MAC9B,SACA0C,EAAKzC,GAAW,KAAK;AAAA,EAC3B;AAAA,EACE,iBAAiB;AAAA,IACf,OAAO,CAAC,EAAE,YAAAX,GAAY,gBAAAG,EAAc,MAClCiD;AAAA,MACE,CAAC,iBAAiBA,EAAKpD,GAAY,GAAG,GAAGyD,EAAMtD,CAAc,CAAC;AAAA,MAC9D;AAAA,IACR;AAAA,EACA;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,MAAA1B,GAAM,YAAAuB,EAAU,MACxBoD,EAAK,CAAC,iBAAiB3E,GAAM2E,EAAKpD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EAC9D;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,MAAAvB,GAAM,YAAA2B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MAC5C+C;AAAA,MACE;AAAA,QACE;AAAA,QACA3E;AAAA,QACA6E,EAAK,eAAeF,EAAKhD,GAAY,KAAK,CAAC;AAAA,QAC3CgD,EAAKpD,GAAY,GAAG;AAAA,QACpByD,EAAMpD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,wBAAwB;AAAA,IACtB,OAAO,CAAC,EAAE,MAAA5B,GAAM,YAAA2B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MAC5C+C;AAAA,MACE;AAAA,QACE;AAAA,QACA3E;AAAA,QACA6E,EAAK,eAAeF,EAAKhD,GAAY,KAAK,CAAC;AAAA,QAC3CgD,EAAKpD,GAAY,GAAG;AAAA,QACpByD,EAAMpD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,MAAA5B,GAAM,YAAAuB,GAAY,OAAAO,EAAK,MAC/B6C;AAAA,MACE;AAAA,QACE;AAAA,QACA3E;AAAA,QACA2E,EAAKpD,GAAY,GAAG;AAAA,QACpBsD,EAAK,MAAMF,EAAK7C,GAAO,KAAK,CAAC;AAAA,MACvC;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,mBAAmB;AAAA,IACjB,OAAO,CAAC,EAAE,MAAA9B,GAAM,YAAAuB,GAAY,QAAAQ,EAAM,MAChC4C,EAAK,CAAC,eAAe3E,GAAM2E,EAAKpD,GAAY,GAAG,GAAGyD,EAAMjD,CAAM,CAAC,GAAG,GAAG;AAAA,EAC3E;AAAA,EACE,0BAA0B;AAAA,IACxB,OAAO,CAAC,EAAE,MAAA/B,GAAM,YAAAuB,GAAY,QAAAK,EAAM,MAChC+C,EAAK,CAAC,gBAAgB3E,GAAM2E,EAAKpD,GAAY,GAAG,GAAGyD,EAAMpD,CAAM,CAAC,GAAG,GAAG;AAAA,EAC5E;AACA;AAMA,SAAS+C,EAAKY,GAAYC,IAAY,IAAI;AACxC,MAAIC;AAEJ,UAAQA,IAGFF,GAAW,OAAO,CAAC3b,MAAMA,CAAC,EAAE,KAAK4b,CAAS,OAAO,QACrDC,MAA0B,SACxBA,IACA;AACN;AAKA,SAAST,EAAMnL,GAAO;AACpB,SAAOgL,EAAK;AAAA,GAAOjJ,GAAO+I,EAAK9K,GAAO;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK;AACrD;AAKA,SAASgL,EAAKxK,GAAOqL,GAAapL,IAAM,IAAI;AAC1C,SAAOoL,KAAe,QAAQA,MAAgB,KAC1CrL,IAAQqL,IAAcpL,IACtB;AACN;AAEA,SAASsB,GAAOxN,GAAK;AACnB,SAAOyW,EAAK,MAAMzW,EAAI,QAAQ,OAAO;AAAA,GAAM,CAAC;AAC9C;AAEA,SAASkX,GAAkBC,GAAY;AACrC,MAAII;AAKJ,UAAQA,IAGFJ,GAAW,KAAK,CAACnX,MAAQA,EAAI,SAAS;AAAA,CAAI,CAAC,OAAO,QACtDuX,MAAqB,SACnBA,IACA;AACN;AC9UA,MAAMC,KAAuB,CAACC,MAAa;AACvC,MAAIC;AACJ,QAAMC,IAAuBF,EAAS,YAAY,OAAO,CAACG,MAAeA,EAAW,SAAS,qBAAqB;AAClH,SAAID,EAAqB,WAAW,MAChCD,IAAgBC,EAAqB,CAAC,GAAG,MAAM,QAE5CD;AACX,GACaG,KAAyB,CAACJ,MAAa;AAChD,MAAI,OAAOA,KAAa,UAAU;AAC9B,QAAIC;AACJ,QAAI;AACA,YAAMI,IAAiBxF,GAAMmF,CAAQ;AACrC,MAAAC,IAAgBF,GAAqBM,CAAc;AAAA,IACvD,QACY;AAAA,IAEZ;AACA,WAAO,EAAE,OAAOL,GAAU,eAAAC,EAAa;AAAA,EAC3C;AACA,QAAMA,IAAgBF,GAAqBC,CAAQ;AACnD,SAAO,EAAE,OAAOtB,GAAMsB,CAAQ,GAAG,eAAAC,EAAa;AAClD;AC1BO,MAAMK,WAAoB,MAAM;AAAA,EACnC,YAAYC,GAAUC,GAAS;AAC3B,UAAM9P,IAAU,GAAG4P,GAAY,eAAeC,CAAQ,CAAC,KAAK,KAAK,UAAU;AAAA,MACvE,UAAAA;AAAA,MACA,SAAAC;AAAA,IACZ,CAAS,CAAC;AACF,UAAM9P,CAAO,GACb,OAAO,eAAe,MAAM4P,GAAY,SAAS,GACjD,KAAK,WAAWC,GAChB,KAAK,UAAUC,GAEX,OAAO,MAAM,qBAAsB,cACnC,MAAM,kBAAkB,MAAMF,EAAW;AAAA,EAEjD;AAAA,EACA,OAAO,eAAeC,GAAU;AAC5B,WAAOA,EAAS,SAAS,CAAC,GAAG,WAAW,wBAAwBA,EAAS,MAAM;AAAA,EACnF;AACJ;;;;;;;;ACjBA,QAAIE,IACH,OAAO,aAAe,OAAe,cACrC,OAAO,OAAS,OAAe,QAC/B,OAAOC,KAAW,OAAeA,IAE9BC,KAAkB,WAAY;AAClC,eAASC,IAAI;AACb,aAAK,QAAQ,IACb,KAAK,eAAeH,EAAW;AAAA,MAC/B;AACA,aAAAG,EAAE,YAAYH,GACP,IAAIG,EAAC;AAAA,IACZ,GAAC;AAGD,KAAC,SAASC,GAAY;AAEL,OAAC,SAAUC,GAAS;AAGnC,YAAIC,IACD,OAAOF,IAAe,OAAeA,KACrC,OAAO,OAAS,OAAe;AAAA,QAE/B,OAAOH,KAAW,OAAeA,MAClC,CAAA,GAEEM,IAAU;AAAA,UACZ,cAAc,qBAAqBD;AAAA,UACnC,UAAU,YAAYA,KAAK,cAAc;AAAA,UACzC,MACE,gBAAgBA,KAChB,UAAUA,MACT,WAAW;AACV,gBAAI;AACF,yBAAI,KAAI,GACD;AAAA,YACjB,QAAoB;AACV,qBAAO;AAAA,YACjB;AAAA,UACA,GAAO;AAAA,UACH,UAAU,cAAcA;AAAA,UACxB,aAAa,iBAAiBA;AAAA;AAGhC,iBAASE,EAAWjT,GAAK;AACvB,iBAAOA,KAAO,SAAS,UAAU,cAAcA,CAAG;AAAA,QACtD;AAEE,YAAIgT,EAAQ;AACV,cAAIE,IAAc;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,aAGEC,IACF,YAAY,UACZ,SAASnT,GAAK;AACZ,mBAAOA,KAAOkT,EAAY,QAAQ,OAAO,UAAU,SAAS,KAAKlT,CAAG,CAAC,IAAI;AAAA,UACjF;AAGE,iBAASoT,EAAcjH,GAAM;AAI3B,cAHI,OAAOA,KAAS,aAClBA,IAAO,OAAOA,CAAI,IAEhB,6BAA6B,KAAKA,CAAI,KAAKA,MAAS;AACtD,kBAAM,IAAI,UAAU,8CAA8CA,IAAO,GAAG;AAE9E,iBAAOA,EAAK,YAAW;AAAA,QAC3B;AAEE,iBAASkH,EAAezQ,GAAO;AAC7B,iBAAI,OAAOA,KAAU,aACnBA,IAAQ,OAAOA,CAAK,IAEfA;AAAA,QACX;AAGE,iBAAS0Q,EAAYpH,GAAO;AAC1B,cAAIqH,IAAW;AAAA,YACb,MAAM,WAAW;AACf,kBAAI3Q,IAAQsJ,EAAM,MAAK;AACvB,qBAAO,EAAC,MAAMtJ,MAAU,QAAW,OAAOA,EAAK;AAAA,YACvD;AAAA;AAGI,iBAAIoQ,EAAQ,aACVO,EAAS,OAAO,QAAQ,IAAI,WAAW;AACrC,mBAAOA;AAAA,UACf,IAGWA;AAAA,QACX;AAEE,iBAASC,EAAQ1R,GAAS;AACxB,eAAK,MAAM,CAAA,GAEPA,aAAmB0R,IACrB1R,EAAQ,QAAQ,SAASc,GAAOuJ,GAAM;AACpC,iBAAK,OAAOA,GAAMvJ,CAAK;AAAA,UAC/B,GAAS,IAAI,IACE,MAAM,QAAQd,CAAO,IAC9BA,EAAQ,QAAQ,SAAS2R,GAAQ;AAC/B,gBAAIA,EAAO,UAAU;AACnB,oBAAM,IAAI,UAAU,wEAAwEA,EAAO,MAAM;AAE3G,iBAAK,OAAOA,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC;AAAA,UACxC,GAAS,IAAI,IACE3R,KACT,OAAO,oBAAoBA,CAAO,EAAE,QAAQ,SAASqK,GAAM;AACzD,iBAAK,OAAOA,GAAMrK,EAAQqK,CAAI,CAAC;AAAA,UACvC,GAAS,IAAI;AAAA,QAEb;AAEE,QAAAqH,EAAQ,UAAU,SAAS,SAASrH,GAAMvJ,GAAO;AAC/C,UAAAuJ,IAAOiH,EAAcjH,CAAI,GACzBvJ,IAAQyQ,EAAezQ,CAAK;AAC5B,cAAI8Q,IAAW,KAAK,IAAIvH,CAAI;AAC5B,eAAK,IAAIA,CAAI,IAAIuH,IAAWA,IAAW,OAAO9Q,IAAQA;AAAA,QAC1D,GAEE4Q,EAAQ,UAAU,SAAY,SAASrH,GAAM;AAC3C,iBAAO,KAAK,IAAIiH,EAAcjH,CAAI,CAAC;AAAA,QACvC,GAEEqH,EAAQ,UAAU,MAAM,SAASrH,GAAM;AACrC,iBAAAA,IAAOiH,EAAcjH,CAAI,GAClB,KAAK,IAAIA,CAAI,IAAI,KAAK,IAAIA,CAAI,IAAI;AAAA,QAC7C,GAEEqH,EAAQ,UAAU,MAAM,SAASrH,GAAM;AACrC,iBAAO,KAAK,IAAI,eAAeiH,EAAcjH,CAAI,CAAC;AAAA,QACtD,GAEEqH,EAAQ,UAAU,MAAM,SAASrH,GAAMvJ,GAAO;AAC5C,eAAK,IAAIwQ,EAAcjH,CAAI,CAAC,IAAIkH,EAAezQ,CAAK;AAAA,QACxD,GAEE4Q,EAAQ,UAAU,UAAU,SAASG,GAAUC,GAAS;AACtD,mBAASzH,KAAQ,KAAK;AACpB,YAAI,KAAK,IAAI,eAAeA,CAAI,KAC9BwH,EAAS,KAAKC,GAAS,KAAK,IAAIzH,CAAI,GAAGA,GAAM,IAAI;AAAA,QAGzD,GAEEqH,EAAQ,UAAU,OAAO,WAAW;AAClC,cAAItH,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAOuJ,GAAM;AACjC,YAAAD,EAAM,KAAKC,CAAI;AAAA,UACrB,CAAK,GACMmH,EAAYpH,CAAK;AAAA,QAC5B,GAEEsH,EAAQ,UAAU,SAAS,WAAW;AACpC,cAAItH,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAO;AAC3B,YAAAsJ,EAAM,KAAKtJ,CAAK;AAAA,UACtB,CAAK,GACM0Q,EAAYpH,CAAK;AAAA,QAC5B,GAEEsH,EAAQ,UAAU,UAAU,WAAW;AACrC,cAAItH,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAOuJ,GAAM;AACjC,YAAAD,EAAM,KAAK,CAACC,GAAMvJ,CAAK,CAAC;AAAA,UAC9B,CAAK,GACM0Q,EAAYpH,CAAK;AAAA,QAC5B,GAEM8G,EAAQ,aACVQ,EAAQ,UAAU,OAAO,QAAQ,IAAIA,EAAQ,UAAU;AAGzD,iBAASK,EAASnQ,GAAM;AACtB,cAAI,CAAAA,EAAK,SACT;AAAA,gBAAIA,EAAK;AACP,qBAAO,QAAQ,OAAO,IAAI,UAAU,cAAc,CAAC;AAErD,YAAAA,EAAK,WAAW;AAAA;AAAA,QACpB;AAEE,iBAASoQ,EAAgBC,GAAQ;AAC/B,iBAAO,IAAI,QAAQ,SAASC,GAASC,GAAQ;AAC3C,YAAAF,EAAO,SAAS,WAAW;AACzB,cAAAC,EAAQD,EAAO,MAAM;AAAA,YAC7B,GACMA,EAAO,UAAU,WAAW;AAC1B,cAAAE,EAAOF,EAAO,KAAK;AAAA,YAC3B;AAAA,UACA,CAAK;AAAA,QACL;AAEE,iBAASG,EAAsBC,GAAM;AACnC,cAAIJ,IAAS,IAAI,WAAU,GACvBK,IAAUN,EAAgBC,CAAM;AACpC,iBAAAA,EAAO,kBAAkBI,CAAI,GACtBC;AAAA,QACX;AAEE,iBAASC,EAAeF,GAAM;AAC5B,cAAIJ,IAAS,IAAI,WAAU,GACvBK,IAAUN,EAAgBC,CAAM,GAChC3Q,IAAQ,2BAA2B,KAAK+Q,EAAK,IAAI,GACjDG,IAAWlR,IAAQA,EAAM,CAAC,IAAI;AAClC,iBAAA2Q,EAAO,WAAWI,GAAMG,CAAQ,GACzBF;AAAA,QACX;AAEE,iBAASG,EAAsBC,GAAK;AAIlC,mBAHIC,IAAO,IAAI,WAAWD,CAAG,GACzBE,IAAQ,IAAI,MAAMD,EAAK,MAAM,GAExBne,IAAI,GAAGA,IAAIme,EAAK,QAAQne;AAC/B,YAAAoe,EAAMpe,CAAC,IAAI,OAAO,aAAame,EAAKne,CAAC,CAAC;AAExC,iBAAOoe,EAAM,KAAK,EAAE;AAAA,QACxB;AAEE,iBAASC,EAAYH,GAAK;AACxB,cAAIA,EAAI;AACN,mBAAOA,EAAI,MAAM,CAAC;AAElB,cAAIC,IAAO,IAAI,WAAWD,EAAI,UAAU;AACxC,iBAAAC,EAAK,IAAI,IAAI,WAAWD,CAAG,CAAC,GACrBC,EAAK;AAAA,QAElB;AAEE,iBAASG,IAAO;AACd,sBAAK,WAAW,IAEhB,KAAK,YAAY,SAASlR,GAAM;AAY9B,iBAAK,WAAW,KAAK,UACrB,KAAK,YAAYA,GACZA,IAGM,OAAOA,KAAS,WACzB,KAAK,YAAYA,IACRsP,EAAQ,QAAQ,KAAK,UAAU,cAActP,CAAI,IAC1D,KAAK,YAAYA,IACRsP,EAAQ,YAAY,SAAS,UAAU,cAActP,CAAI,IAClE,KAAK,gBAAgBA,IACZsP,EAAQ,gBAAgB,gBAAgB,UAAU,cAActP,CAAI,IAC7E,KAAK,YAAYA,EAAK,SAAQ,IACrBsP,EAAQ,eAAeA,EAAQ,QAAQC,EAAWvP,CAAI,KAC/D,KAAK,mBAAmBiR,EAAYjR,EAAK,MAAM,GAE/C,KAAK,YAAY,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,KACxCsP,EAAQ,gBAAgB,YAAY,UAAU,cAActP,CAAI,KAAKyP,EAAkBzP,CAAI,KACpG,KAAK,mBAAmBiR,EAAYjR,CAAI,IAExC,KAAK,YAAYA,IAAO,OAAO,UAAU,SAAS,KAAKA,CAAI,KAjB3D,KAAK,UAAU,IACf,KAAK,YAAY,KAmBd,KAAK,QAAQ,IAAI,cAAc,MAC9B,OAAOA,KAAS,WAClB,KAAK,QAAQ,IAAI,gBAAgB,0BAA0B,IAClD,KAAK,aAAa,KAAK,UAAU,OAC1C,KAAK,QAAQ,IAAI,gBAAgB,KAAK,UAAU,IAAI,IAC3CsP,EAAQ,gBAAgB,gBAAgB,UAAU,cAActP,CAAI,KAC7E,KAAK,QAAQ,IAAI,gBAAgB,iDAAiD;AAAA,UAG5F,GAEQsP,EAAQ,SACV,KAAK,OAAO,WAAW;AACrB,gBAAI6B,IAAWhB,EAAS,IAAI;AAC5B,gBAAIgB;AACF,qBAAOA;AAGT,gBAAI,KAAK;AACP,qBAAO,QAAQ,QAAQ,KAAK,SAAS;AAChC,gBAAI,KAAK;AACd,qBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,CAAC;AACnD,gBAAI,KAAK;AACd,oBAAM,IAAI,MAAM,sCAAsC;AAEtD,mBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC;AAAA,UAE3D,IAGI,KAAK,cAAc,WAAW;AAC5B,gBAAI,KAAK,kBAAkB;AACzB,kBAAIC,IAAajB,EAAS,IAAI;AAC9B,qBAAIiB,MAEO,YAAY,OAAO,KAAK,gBAAgB,IAC1C,QAAQ;AAAA,gBACb,KAAK,iBAAiB,OAAO;AAAA,kBAC3B,KAAK,iBAAiB;AAAA,kBACtB,KAAK,iBAAiB,aAAa,KAAK,iBAAiB;AAAA,gBACvE;AAAA,cACA,IAEiB,QAAQ,QAAQ,KAAK,gBAAgB;AAAA,YAEtD,OAAa;AAAA,kBAAI9B,EAAQ;AACjB,uBAAO,KAAK,OAAO,KAAKkB,CAAqB;AAE7C,oBAAM,IAAI,MAAM,+BAA+B;AAAA;AAAA,UAEvD,GAEI,KAAK,OAAO,WAAW;AACrB,gBAAIW,IAAWhB,EAAS,IAAI;AAC5B,gBAAIgB;AACF,qBAAOA;AAGT,gBAAI,KAAK;AACP,qBAAOR,EAAe,KAAK,SAAS;AAC/B,gBAAI,KAAK;AACd,qBAAO,QAAQ,QAAQE,EAAsB,KAAK,gBAAgB,CAAC;AAC9D,gBAAI,KAAK;AACd,oBAAM,IAAI,MAAM,sCAAsC;AAEtD,mBAAO,QAAQ,QAAQ,KAAK,SAAS;AAAA,UAE7C,GAEQvB,EAAQ,aACV,KAAK,WAAW,WAAW;AACzB,mBAAO,KAAK,OAAO,KAAK+B,EAAM;AAAA,UACtC,IAGI,KAAK,OAAO,WAAW;AACrB,mBAAO,KAAK,KAAI,EAAG,KAAK,KAAK,KAAK;AAAA,UACxC,GAEW;AAAA,QACX;AAGE,YAAIC,IAAU,CAAC,WAAW,UAAU,OAAO,QAAQ,WAAW,SAAS,QAAQ,OAAO,OAAO;AAE7F,iBAASC,GAAgBC,GAAQ;AAC/B,cAAIC,IAAUD,EAAO,YAAW;AAChC,iBAAOF,EAAQ,QAAQG,CAAO,IAAI,KAAKA,IAAUD;AAAA,QACrD;AAEE,iBAASE,EAAQC,GAAOnN,GAAS;AAC/B,cAAI,EAAE,gBAAgBkN;AACpB,kBAAM,IAAI,UAAU,4FAA4F;AAGlH,UAAAlN,IAAUA,KAAW,CAAA;AACrB,cAAIxE,IAAOwE,EAAQ;AAEnB,cAAImN,aAAiBD,GAAS;AAC5B,gBAAIC,EAAM;AACR,oBAAM,IAAI,UAAU,cAAc;AAEpC,iBAAK,MAAMA,EAAM,KACjB,KAAK,cAAcA,EAAM,aACpBnN,EAAQ,YACX,KAAK,UAAU,IAAIsL,EAAQ6B,EAAM,OAAO,IAE1C,KAAK,SAASA,EAAM,QACpB,KAAK,OAAOA,EAAM,MAClB,KAAK,SAASA,EAAM,QAChB,CAAC3R,KAAQ2R,EAAM,aAAa,SAC9B3R,IAAO2R,EAAM,WACbA,EAAM,WAAW;AAAA,UAEzB;AACM,iBAAK,MAAM,OAAOA,CAAK;AAiBzB,cAdA,KAAK,cAAcnN,EAAQ,eAAe,KAAK,eAAe,gBAC1DA,EAAQ,WAAW,CAAC,KAAK,aAC3B,KAAK,UAAU,IAAIsL,EAAQtL,EAAQ,OAAO,IAE5C,KAAK,SAAS+M,GAAgB/M,EAAQ,UAAU,KAAK,UAAU,KAAK,GACpE,KAAK,OAAOA,EAAQ,QAAQ,KAAK,QAAQ,MACzC,KAAK,SAASA,EAAQ,UAAU,KAAK,WAAW,WAAY;AAC1D,gBAAI,qBAAqB6K,GAAG;AAC1B,kBAAIuC,IAAO,IAAI,gBAAe;AAC9B,qBAAOA,EAAK;AAAA,YACpB;AAAA,UACA,MACI,KAAK,WAAW,OAEX,KAAK,WAAW,SAAS,KAAK,WAAW,WAAW5R;AACvD,kBAAM,IAAI,UAAU,2CAA2C;AAIjE,cAFA,KAAK,UAAUA,CAAI,IAEf,KAAK,WAAW,SAAS,KAAK,WAAW,YACvCwE,EAAQ,UAAU,cAAcA,EAAQ,UAAU,aAAY;AAEhE,gBAAIqN,IAAgB;AACpB,gBAAIA,EAAc,KAAK,KAAK,GAAG;AAE7B,mBAAK,MAAM,KAAK,IAAI,QAAQA,GAAe,UAAS,oBAAI,QAAO,SAAS;AAAA,iBACnE;AAEL,kBAAIC,IAAgB;AACpB,mBAAK,QAAQA,EAAc,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO,QAAO,oBAAI,KAAI,GAAG,QAAO;AAAA,YAC5F;AAAA,UACA;AAAA,QAEA;AAEE,QAAAJ,EAAQ,UAAU,QAAQ,WAAW;AACnC,iBAAO,IAAIA,EAAQ,MAAM,EAAC,MAAM,KAAK,UAAS,CAAC;AAAA,QACnD;AAEE,iBAASL,GAAOrR,GAAM;AACpB,cAAI+R,IAAO,IAAI,SAAQ;AACvB,iBAAA/R,EACG,KAAI,EACJ,MAAM,GAAG,EACT,QAAQ,SAASgS,GAAO;AACvB,gBAAIA,GAAO;AACT,kBAAIC,IAAQD,EAAM,MAAM,GAAG,GACvBvJ,IAAOwJ,EAAM,MAAK,EAAG,QAAQ,OAAO,GAAG,GACvC/S,IAAQ+S,EAAM,KAAK,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC9C,cAAAF,EAAK,OAAO,mBAAmBtJ,CAAI,GAAG,mBAAmBvJ,CAAK,CAAC;AAAA,YACzE;AAAA,UACA,CAAO,GACI6S;AAAA,QACX;AAEE,iBAASG,EAAaC,GAAY;AAChC,cAAI/T,IAAU,IAAI0R,EAAO,GAGrBsC,IAAsBD,EAAW,QAAQ,gBAAgB,GAAG;AAIhE,iBAAAC,EACG,MAAM,IAAI,EACV,IAAI,SAASrC,GAAQ;AACpB,mBAAOA,EAAO,QAAQ;AAAA,CAAI,MAAM,IAAIA,EAAO,OAAO,GAAGA,EAAO,MAAM,IAAIA;AAAA,UAC9E,CAAO,EACA,QAAQ,SAAStQ,GAAM;AACtB,gBAAI4S,IAAQ5S,EAAK,MAAM,GAAG,GACtB6I,IAAM+J,EAAM,MAAK,EAAG,KAAI;AAC5B,gBAAI/J,GAAK;AACP,kBAAIpJ,KAAQmT,EAAM,KAAK,GAAG,EAAE,KAAI;AAChC,kBAAI;AACF,gBAAAjU,EAAQ,OAAOkK,GAAKpJ,EAAK;AAAA,cACrC,SAAmBoT,IAAO;AACd,wBAAQ,KAAK,cAAcA,GAAM,OAAO;AAAA,cACpD;AAAA,YACA;AAAA,UACA,CAAO,GACIlU;AAAA,QACX;AAEE,QAAA8S,EAAK,KAAKQ,EAAQ,SAAS;AAE3B,iBAASa,EAASC,GAAUhO,GAAS;AACnC,cAAI,EAAE,gBAAgB+N;AACpB,kBAAM,IAAI,UAAU,4FAA4F;AAQlH,cANK/N,MACHA,IAAU,CAAA,IAGZ,KAAK,OAAO,WACZ,KAAK,SAASA,EAAQ,WAAW,SAAY,MAAMA,EAAQ,QACvD,KAAK,SAAS,OAAO,KAAK,SAAS;AACrC,kBAAM,IAAI,WAAW,0FAA0F;AAEjH,eAAK,KAAK,KAAK,UAAU,OAAO,KAAK,SAAS,KAC9C,KAAK,aAAaA,EAAQ,eAAe,SAAY,KAAK,KAAKA,EAAQ,YACvE,KAAK,UAAU,IAAIsL,EAAQtL,EAAQ,OAAO,GAC1C,KAAK,MAAMA,EAAQ,OAAO,IAC1B,KAAK,UAAUgO,CAAQ;AAAA,QAC3B;AAEE,QAAAtB,EAAK,KAAKqB,EAAS,SAAS,GAE5BA,EAAS,UAAU,QAAQ,WAAW;AACpC,iBAAO,IAAIA,EAAS,KAAK,WAAW;AAAA,YAClC,QAAQ,KAAK;AAAA,YACb,YAAY,KAAK;AAAA,YACjB,SAAS,IAAIzC,EAAQ,KAAK,OAAO;AAAA,YACjC,KAAK,KAAK;AAAA,WACX;AAAA,QACL,GAEEyC,EAAS,QAAQ,WAAW;AAC1B,cAAI1D,IAAW,IAAI0D,EAAS,MAAM,EAAC,QAAQ,KAAK,YAAY,GAAE,CAAC;AAC/D,iBAAA1D,EAAS,KAAK,IACdA,EAAS,SAAS,GAClBA,EAAS,OAAO,SACTA;AAAA,QACX;AAEE,YAAI4D,KAAmB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG;AAE/C,QAAAF,EAAS,WAAW,SAASG,GAAKC,GAAQ;AACxC,cAAIF,GAAiB,QAAQE,CAAM,MAAM;AACvC,kBAAM,IAAI,WAAW,qBAAqB;AAG5C,iBAAO,IAAIJ,EAAS,MAAM,EAAC,QAAQI,GAAQ,SAAS,EAAC,UAAUD,EAAG,EAAC,CAAC;AAAA,QACxE,GAEEtD,EAAQ,eAAeC,EAAE;AACzB,YAAI;AACF,cAAID,EAAQ,aAAY;AAAA,QAC5B,QAAgB;AACZ,UAAAA,EAAQ,eAAe,SAASpQ,GAASyJ,GAAM;AAC7C,iBAAK,UAAUzJ,GACf,KAAK,OAAOyJ;AACZ,gBAAI6J,IAAQ,MAAMtT,CAAO;AACzB,iBAAK,QAAQsT,EAAM;AAAA,UACzB,GACIlD,EAAQ,aAAa,YAAY,OAAO,OAAO,MAAM,SAAS,GAC9DA,EAAQ,aAAa,UAAU,cAAcA,EAAQ;AAAA,QACzD;AAEE,iBAASwD,GAAMjB,GAAOkB,GAAM;AAC1B,iBAAO,IAAI,QAAQ,SAASvC,GAASC,GAAQ;AAC3C,gBAAIzB,IAAU,IAAI4C,EAAQC,GAAOkB,CAAI;AAErC,gBAAI/D,EAAQ,UAAUA,EAAQ,OAAO;AACnC,qBAAOyB,EAAO,IAAInB,EAAQ,aAAa,WAAW,YAAY,CAAC;AAGjE,gBAAI0D,IAAM,IAAI,eAAc;AAE5B,qBAASC,KAAW;AAClB,cAAAD,EAAI,MAAK;AAAA,YACjB;AAEM,YAAAA,EAAI,SAAS,WAAW;AACtB,kBAAItO,IAAU;AAAA,gBACZ,YAAYsO,EAAI;AAAA,gBAChB,SAASZ,EAAaY,EAAI,sBAAqB,KAAM,EAAE;AAAA;AAIzD,cAAIhE,EAAQ,IAAI,QAAQ,SAAS,MAAM,MAAMgE,EAAI,SAAS,OAAOA,EAAI,SAAS,OAC5EtO,EAAQ,SAAS,MAEjBA,EAAQ,SAASsO,EAAI,QAEvBtO,EAAQ,MAAM,iBAAiBsO,IAAMA,EAAI,cAActO,EAAQ,QAAQ,IAAI,eAAe;AAC1F,kBAAIxE,KAAO,cAAc8S,IAAMA,EAAI,WAAWA,EAAI;AAClD,yBAAW,WAAW;AACpB,gBAAAxC,EAAQ,IAAIiC,EAASvS,IAAMwE,CAAO,CAAC;AAAA,cAC7C,GAAW,CAAC;AAAA,YACZ,GAEMsO,EAAI,UAAU,WAAW;AACvB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAI,UAAU,wBAAwB,CAAC;AAAA,cACxD,GAAW,CAAC;AAAA,YACZ,GAEMuC,EAAI,YAAY,WAAW;AACzB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAI,UAAU,2BAA2B,CAAC;AAAA,cAC3D,GAAW,CAAC;AAAA,YACZ,GAEMuC,EAAI,UAAU,WAAW;AACvB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAInB,EAAQ,aAAa,WAAW,YAAY,CAAC;AAAA,cAClE,GAAW,CAAC;AAAA,YACZ;AAEM,qBAAS4D,GAAON,GAAK;AACnB,kBAAI;AACF,uBAAOA,MAAQ,MAAMrD,EAAE,SAAS,OAAOA,EAAE,SAAS,OAAOqD;AAAA,cACnE,QAAoB;AACV,uBAAOA;AAAA,cACjB;AAAA,YACA;AAoBM,gBAlBAI,EAAI,KAAKhE,EAAQ,QAAQkE,GAAOlE,EAAQ,GAAG,GAAG,EAAI,GAE9CA,EAAQ,gBAAgB,YAC1BgE,EAAI,kBAAkB,KACbhE,EAAQ,gBAAgB,WACjCgE,EAAI,kBAAkB,KAGpB,kBAAkBA,MAChBxD,EAAQ,OACVwD,EAAI,eAAe,SAEnBxD,EAAQ,gBAERwD,EAAI,eAAe,iBAInBD,KAAQ,OAAOA,EAAK,WAAY,YAAY,EAAEA,EAAK,mBAAmB/C,KAAYT,EAAE,WAAWwD,EAAK,mBAAmBxD,EAAE,UAAW;AACtI,kBAAI4D,KAAQ,CAAA;AACZ,qBAAO,oBAAoBJ,EAAK,OAAO,EAAE,QAAQ,SAASpK,GAAM;AAC9D,gBAAAwK,GAAM,KAAKvD,EAAcjH,CAAI,CAAC,GAC9BqK,EAAI,iBAAiBrK,GAAMkH,EAAekD,EAAK,QAAQpK,CAAI,CAAC,CAAC;AAAA,cACvE,CAAS,GACDqG,EAAQ,QAAQ,QAAQ,SAAS5P,GAAOuJ,IAAM;AAC5C,gBAAIwK,GAAM,QAAQxK,EAAI,MAAM,MAC1BqK,EAAI,iBAAiBrK,IAAMvJ,CAAK;AAAA,cAE5C,CAAS;AAAA,YACT;AACQ,cAAA4P,EAAQ,QAAQ,QAAQ,SAAS5P,GAAOuJ,IAAM;AAC5C,gBAAAqK,EAAI,iBAAiBrK,IAAMvJ,CAAK;AAAA,cAC1C,CAAS;AAGH,YAAI4P,EAAQ,WACVA,EAAQ,OAAO,iBAAiB,SAASiE,EAAQ,GAEjDD,EAAI,qBAAqB,WAAW;AAElC,cAAIA,EAAI,eAAe,KACrBhE,EAAQ,OAAO,oBAAoB,SAASiE,EAAQ;AAAA,YAEhE,IAGMD,EAAI,KAAK,OAAOhE,EAAQ,YAAc,MAAc,OAAOA,EAAQ,SAAS;AAAA,UAClF,CAAK;AAAA,QACL;AAEE,eAAA8D,GAAM,WAAW,IAEZvD,EAAE,UACLA,EAAE,QAAQuD,IACVvD,EAAE,UAAUS,GACZT,EAAE,UAAUqC,GACZrC,EAAE,WAAWkD,IAGfnD,EAAQ,UAAUU,GAClBV,EAAQ,UAAUsC,GAClBtC,EAAQ,WAAWmD,GACnBnD,EAAQ,QAAQwD,IAEhB,OAAO,eAAexD,GAAS,cAAc,EAAE,OAAO,IAAM,GAErDA;AAAA,MAET,GAAG,CAAA,CAAE;AAAA,IACL,GAAGH,CAAc,GAEjBA,EAAe,MAAM,WAAW,IAChC,OAAOA,EAAe,MAAM;AAE5B,QAAIiE,IAAMnE,EAAW,QAAQA,IAAaE;AAC1C,IAAAG,IAAU8D,EAAI,OACd9D,EAAA,UAAkB8D,EAAI,OACtB9D,EAAA,QAAgB8D,EAAI,OACpB9D,EAAA,UAAkB8D,EAAI,SACtB9D,EAAA,UAAkB8D,EAAI,SACtB9D,EAAA,WAAmB8D,EAAI,UACvBC,EAAA,UAAiB/D;AAAA;;;;;;UCnqBXgE,KAAiB,CAAChV,MAAY;AAChC,MAAIiV,IAAW,CAAA;AACf,SAAIjV,MACK,OAAO,UAAY,OAAeA,aAAmB,WACrDkV,MAAcC,GAAAA,WAAsBnV,aAAmBmV,GAAAA,UACxDF,IAAWlV,GAA6BC,CAAO,IAE1C,MAAM,QAAQA,CAAO,IAC1BA,EAAQ,QAAQ,CAAC,CAACqK,GAAMvJ,CAAK,MAAM;AAC/B,IAAIuJ,KAAQvJ,MAAU,WAClBmU,EAAS5K,CAAI,IAAIvJ;AAAA,EAEzB,CAAC,IAGDmU,IAAWjV,IAGZiV;AACX,GAIMG,KAAa,CAAC3c,MAAQA,EAAI,QAAQ,uBAAuB,GAAG,EAAE,KAAI,GAIlE4c,KAAqB,CAACC,MAAW;AACnC,MAAI,CAAC,MAAM,QAAQA,EAAO,KAAK,GAAG;AAC9B,UAAMC,IAAUD,GACVE,IAAS,CAAC,SAAS,mBAAmBJ,GAAWG,EAAQ,KAAK,CAAC,CAAC,EAAE;AACxE,WAAID,EAAO,aACPE,EAAO,KAAK,aAAa,mBAAmBD,EAAQ,eAAe,UAAUA,EAAQ,SAAS,CAAC,CAAC,EAAE,GAElGA,EAAQ,iBACRC,EAAO,KAAK,iBAAiB,mBAAmBD,EAAQ,aAAa,CAAC,EAAE,GAErEC,EAAO,KAAK,GAAG;AAAA,EAC1B;AACA,MAAI,OAAOF,EAAO,YAAc,OAAe,CAAC,MAAM,QAAQA,EAAO,SAAS;AAC1E,UAAM,IAAI,MAAM,8DAA8D;AAGlF,QAAMC,IAAUD,GACVG,IAAUH,EAAO,MAAM,OAAO,CAACI,GAAKC,GAAc9H,OACpD6H,EAAI,KAAK;AAAA,IACL,OAAON,GAAWO,CAAY;AAAA,IAC9B,WAAWJ,EAAQ,YAAYA,EAAQ,eAAe,UAAUA,EAAQ,UAAU1H,CAAK,CAAC,IAAI;AAAA,EACxG,CAAS,GACM6H,IACR,CAAA,CAAE;AACL,SAAO,SAAS,mBAAmBH,EAAQ,eAAe,UAAUE,CAAO,CAAC,CAAC;AACjF,GACMG,KAA0B,CAACxC,MAAW,OAAOkC,MAAW;AAC1D,QAAM,EAAE,KAAAhB,GAAK,OAAAuB,GAAO,WAAAzV,GAAW,eAAA+P,GAAe,OAAAqE,GAAO,cAAAsB,GAAc,YAAAC,EAAU,IAAKT,GAC5EtV,IAAU,EAAE,GAAGsV,EAAO,QAAO;AACnC,MAAIU,IAAc,IACdpU;AACJ,EAAIwR,MAAW,UACXxR,IAAOqU,GAAkBJ,GAAOzV,GAAW+P,GAAe2F,EAAa,cAAc,GACjF,OAAOlU,KAAS,aAEhB5B,EAAQ,cAAc,IAAI,uBAK9BgW,IAAcX,GAAmB;AAAA,IAC7B,OAAAQ;AAAA,IACA,WAAAzV;AAAA,IACA,eAAA+P;AAAA,IACA,gBAAgB2F,EAAa,kBAAkBjW;AAAA,EAC3D,CAAS;AAEL,QAAM4U,IAAO;AAAA,IACT,QAAArB;AAAA,IACA,SAAApT;AAAA,IACA,MAAA4B;AAAA,IACA,GAAGkU;AAAA,EACX;AACI,MAAII,IAAc5B,GACd6B,IAAe1B;AACnB,MAAIsB,GAAY;AACZ,UAAMlP,IAAS,MAAM,QAAQ,QAAQkP,EAAW,EAAE,GAAGtB,GAAM,KAAAH,GAAK,eAAAnE,GAAe,WAAA/P,EAAS,CAAE,CAAC,GACrF,EAAE,KAAKgW,GAAQ,GAAGC,EAAO,IAAKxP;AACpC,IAAAqP,IAAcE,GACdD,IAAeE;AAAA,EACnB;AACA,SAAIL,MACAE,IAAc,GAAGA,CAAW,IAAIF,CAAW,KAExC,MAAMxB,EAAM0B,GAAaC,CAAY;AAChD;AAIO,MAAMG,GAAc;AAAA,EACvB,YAAYhC,GAAKiC,IAAgB,IAAI;AACjC,SAAK,MAAMjC,GACX,KAAK,gBAAgBiC,GAIrB,KAAK,aAAa,UAAUra,MAAS;AACjC,YAAM,CAACqE,GAAgBH,GAAWC,CAAc,IAAInE,GAC9Csa,IAAoBlW,GAAoBC,GAAgBH,GAAWC,CAAc,GACjF,EAAE,SAAAL,GAAS,OAAAwU,IAAQiC,IAAY,QAAArD,IAAS,QAAQ,mBAAAsD,GAAmB,oBAAAC,GAAoB,GAAGb,EAAY,IAAK,KAAK,eAChH,EAAE,KAAAxB,EAAG,IAAK;AAChB,MAAIkC,EAAkB,WAAW,WAC7BV,EAAa,SAASU,EAAkB;AAE5C,YAAM,EAAE,eAAArG,EAAa,IAAKG,GAAuBkG,EAAkB,KAAK;AACxE,aAAOI,GAAY;AAAA,QACf,KAAAtC;AAAA,QACA,OAAOkC,EAAkB;AAAA,QACzB,WAAWA,EAAkB;AAAA,QAC7B,SAAS;AAAA,UACL,GAAGxB,GAAe6B,GAAe7W,CAAO,CAAC;AAAA,UACzC,GAAGgV,GAAewB,EAAkB,cAAc;AAAA,QACtE;AAAA,QACgB,eAAArG;AAAA,QACA,OAAAqE;AAAA,QACA,QAAApB;AAAA,QACA,cAAA0C;AAAA,QACA,YAAYY;AAAA,MAC5B,CAAa,EACI,KAAK,CAACjG,OACHkG,KACAA,EAAmBlG,CAAQ,GAExBA,EACV,EACI,MAAM,CAACyD,MAAU;AAClB,cAAIyC,KACAA,EAAmBzC,CAAK,GAEtBA;AAAA,MACV,CAAC;AAAA,IACL;AAAA,EACJ;AAAA,EACA,MAAM,QAAQ/T,MAAsB2W,GAA4B;AAC5D,UAAM,CAAC1W,GAAWC,CAAc,IAAIyW,GAC9BC,IAAiB7W,GAAiBC,GAAmBC,GAAWC,CAAc,GAC9E,EAAE,SAAAL,GAAS,OAAAwU,IAAQiC,IAAY,QAAArD,IAAS,QAAQ,mBAAAsD,GAAmB,oBAAAC,GAAoB,GAAGb,EAAY,IAAK,KAAK,eAChH,EAAE,KAAAxB,EAAG,IAAK;AAChB,IAAIyC,EAAe,WAAW,WAC1BjB,EAAa,SAASiB,EAAe;AAEzC,UAAM,EAAE,OAAAlB,GAAO,eAAA1F,EAAa,IAAKG,GAAuByG,EAAe,QAAQ;AAC/E,WAAOH,GAAY;AAAA,MACf,KAAAtC;AAAA,MACA,OAAAuB;AAAA,MACA,WAAWkB,EAAe;AAAA,MAC1B,SAAS;AAAA,QACL,GAAG/B,GAAe6B,GAAe7W,CAAO,CAAC;AAAA,QACzC,GAAGgV,GAAe+B,EAAe,cAAc;AAAA,MAC/D;AAAA,MACY,eAAA5G;AAAA,MACA,OAAAqE;AAAA,MACA,QAAApB;AAAA,MACA,cAAA0C;AAAA,MACA,YAAYY;AAAA,IACxB,CAAS,EACI,KAAK,CAACjG,OACHkG,KACAA,EAAmBlG,CAAQ,GAExBA,EAAS,KACnB,EACI,MAAM,CAACyD,MAAU;AAClB,YAAIyC,KACAA,EAAmBzC,CAAK,GAEtBA;AAAA,IACV,CAAC;AAAA,EACL;AAAA;AAAA,EAEA,cAAczT,GAAoBJ,GAAgB;AAC9C,UAAM2W,IAAsBxW,GAAsBC,GAAoBJ,CAAc,GAC9E,EAAE,SAAAL,GAAS,GAAG8V,EAAY,IAAK,KAAK;AAC1C,IAAIkB,EAAoB,WAAW,WAC/BlB,EAAa,SAASkB,EAAoB;AAE9C,UAAMC,IAAUD,EAAoB,UAAU,IAAI,CAAC,EAAE,UAAA9G,EAAQ,MAAOI,GAAuBJ,CAAQ,EAAE,KAAK,GACpG9P,IAAY4W,EAAoB,UAAU,IAAI,CAAC,EAAE,WAAA5W,EAAS,MAAOA,CAAS;AAChF,WAAOwW,GAAY;AAAA,MACf,KAAK,KAAK;AAAA,MACV,OAAOK;AAAA;AAAA,MAEP,WAAA7W;AAAA,MACA,SAAS;AAAA,QACL,GAAG4U,GAAe6B,GAAe7W,CAAO,CAAC;AAAA,QACzC,GAAGgV,GAAegC,EAAoB,cAAc;AAAA,MACpE;AAAA,MACY,eAAe;AAAA,MACf,OAAO,KAAK,cAAc,SAASP;AAAA,MACnC,QAAQ,KAAK,cAAc,UAAU;AAAA,MACrC,cAAAX;AAAA,MACA,YAAY,KAAK,cAAc;AAAA,IAC3C,CAAS,EACI,KAAK,CAACrF,OACH,KAAK,cAAc,sBACnB,KAAK,cAAc,mBAAmBA,CAAQ,GAE3CA,EAAS,KACnB,EACI,MAAM,CAACyD,MAAU;AAClB,YAAI,KAAK,cAAc,sBACnB,KAAK,cAAc,mBAAmBA,CAAK,GAEzCA;AAAA,IACV,CAAC;AAAA,EACL;AAAA,EACA,WAAWlU,GAAS;AAChB,gBAAK,cAAc,UAAUA,GACtB;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,UAAUkK,GAAKpJ,GAAO;AAClB,UAAM,EAAE,SAAAd,MAAY,KAAK;AACzB,WAAIA,IAGAA,EAAQkK,CAAG,IAAIpJ,IAGf,KAAK,cAAc,UAAU,EAAE,CAACoJ,CAAG,GAAGpJ,EAAK,GAExC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,YAAYA,GAAO;AACf,gBAAK,MAAMA,GACJ;AAAA,EACX;AACJ;AACA,MAAM8V,KAAc,OAAOtB,MAAW;AAClC,QAAM,EAAE,OAAAO,GAAO,WAAAzV,GAAW,cAAA0V,EAAY,IAAKR,GACrC4B,IAAUtB,GAAwB9V,GAAUwV,EAAO,UAAU,MAAM,CAAC,GACpE6B,IAAkB,MAAM,QAAQ7B,EAAO,KAAK,GAC5C7E,IAAW,MAAMyG,EAAQ5B,CAAM,GAC/BzO,IAAS,MAAMuQ,GAAU3G,GAAUqF,EAAa,kBAAkBjW,EAAqB,GACvFwX,IAA2B,MAAM,QAAQxQ,CAAM,IAC/C,CAACA,EAAO,KAAK,CAAC,EAAE,MAAAyQ,EAAI,MAAO,CAACA,CAAI,IAChC,EAAQzQ,EAAO,MACf0Q,IAAgC,MAAM,QAAQ1Q,CAAM,KACtD,CAACA,EAAO,UACP,MAAM,QAAQA,EAAO,MAAM,KAAK,CAACA,EAAO,OAAO,UAChDiP,EAAa,gBAAgB,SAC7BA,EAAa,gBAAgB;AACjC,MAAIrF,EAAS,MAAM8G,KAAiCF,GAA0B;AAE1E,UAAM,EAAE,QAAQ1U,GAAG,GAAG6U,EAAI,KAAK,MAAM,QAAQ3Q,CAAM,GAAIA,IACjDyQ,IAAOxB,EAAa,gBAAgB,WAAW0B,IAAO3Q;AAG5D,WAAO;AAAA,MACH,GAHiBsQ,IAAkB,EAAE,MAAAG,EAAI,IAAKA;AAAA,MAI9C,SAAS7G,EAAS;AAAA,MAClB,QAAQA,EAAS;AAAA,IAC7B;AAAA,EACI,OACK;AACD,UAAMgH,IAAc,OAAO5Q,KAAW,WAChC;AAAA,MACE,OAAOA;AAAA,IACvB,IACcA;AACN,UAAM,IAAI2J;AAAA;AAAA,MAEV,EAAE,GAAGiH,GAAa,QAAQhH,EAAS,QAAQ,SAASA,EAAS,QAAO;AAAA,MAAI,EAAE,OAAAoF,GAAO,WAAAzV,EAAS;AAAA,IAAE;AAAA,EAChG;AACJ,GAyEM6V,KAAoB,CAACJ,GAAOzV,GAAW+P,GAAeuH,MAAmB;AAC3E,QAAMC,IAAkBD,KAAkB7X;AAC1C,MAAI,CAAC,MAAM,QAAQgW,CAAK;AACpB,WAAO8B,EAAgB,UAAU,EAAE,OAAA9B,GAAO,WAAAzV,GAAW,eAAA+P,EAAa,CAAE;AAExE,MAAI,OAAO/P,IAAc,OAAe,CAAC,MAAM,QAAQA,CAAS;AAC5D,UAAM,IAAI,MAAM,qEAAqE;AAGzF,QAAMqV,IAAUI,EAAM,OAAO,CAACH,GAAKC,GAAc9H,OAC7C6H,EAAI,KAAK,EAAE,OAAOC,GAAc,WAAWvV,IAAYA,EAAUyN,CAAK,IAAI,QAAW,GAC9E6H,IACR,CAAA,CAAE;AACL,SAAOiC,EAAgB,UAAUlC,CAAO;AAC5C,GACM2B,KAAY,OAAO3G,GAAUiH,MAAmB;AAClD,MAAIE;AAMJ,SALAnH,EAAS,QAAQ,QAAQ,CAAC3P,GAAOoJ,MAAQ;AACrC,IAAIA,EAAI,kBAAkB,mBACtB0N,IAAc9W;AAAA,EAEtB,CAAC,GACG8W,MACCA,EAAY,YAAW,EAAG,WAAW,kBAAkB,KACpDA,EAAY,YAAW,EAAG,WAAW,0BAA0B,KAC/DA,EAAY,YAAW,EAAG,WAAW,mCAAmC,KACrEF,EAAe,MAAM,MAAMjH,EAAS,KAAI,CAAE,IAG1CA,EAAS,KAAI;AAE5B,GACMoG,KAAiB,CAAC/V,MACb,OAAOA,KAAU,aAAaA,EAAK,IAAKA,GAgBtC+W,KAAM,CAACC,MAAW1X,MACpB0X,EAAO,OAAO,CAACpC,GAAKqC,GAAOlK,MAAU,GAAG6H,CAAG,GAAGqC,CAAK,GAAGlK,KAASzN,IAAY,OAAOA,EAAUyN,CAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GCnZnHoJ,KAAU;AAAA,EACf,SAASY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWV,GCZMG,KAAWH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GCWXI,KAAa,CAAC/Z,MACZ,KAAK,MAAMA,GAAK,CAACgM,GAAKpJ,MAAU;AACtC,MAAI,OAAOA,KAAU;AACpB,QAAI;AACH,aAAO,KAAK,MAAMA,GAAO,CAACoX,GAAMpX,MAC3B,OAAOA,KAAU,YAAY,CAAC,MAAM,OAAOA,CAAK,CAAC,IAC7C,IAAI/D,GAAQ+D,CAAK,IAGlBA,CACP;AAAA,IACF,QAAQ;AAEP,aAAOA;AAAA,IACR;AAAA,WACU,CAAC,MAAM,OAAOA,CAAK,CAAC;AAC9B,WAAO,IAAI/D,GAAQ+D,CAAwB;AAE5C,SAAOA;AACR,CAAC,GAUIoS,KAAU;AAAA,EACf,SAAS,OAAOiF,GAAiB7D,MAAwC;AACxE,UAAM8D,IAAS,IAAI9B,GAAchC,KAAO,YAAY;AAAA,MACnD,OAAO,OAAO;AAAA,MACd,gBAAgB;AAAA,QACf,WAAW,CAAApW,MAAO,KAAK,UAAUA,CAAG;AAAA;AAAA,QACpC,OAAO+Z;AAAA;AAAA,MAAA;AAAA,IACR,CACA,GAEK,EAAE,SAAAI,EAAA,IAAY,MAAMD,EAAO,QAA6C;AAAA,MAC7E,UAAUnB,GAAQ;AAAA,MAClB,WAAW,EAAE,SAAAkB,EAAA;AAAA,IAAQ,CACrB;AAED,WAAOE;AAAA,EACR;AACD;","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]}
1	+ {"version":3,"file":"graphql-client.js","sources":["../../common/temp/node_modules/.pnpm/decimal.js@10.4.3/node_modules/decimal.js/decimal.mjs","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/defaultJsonSerializer.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/helpers.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/parseArgs.js","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/devAssert.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/isObjectLike.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/invariant.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/location.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printLocation.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/error/GraphQLError.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/error/syntaxError.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/ast.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/directiveLocation.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/kinds.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/characterClasses.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/blockString.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/tokenKind.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/lexer.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/inspect.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/jsutils/instanceOf.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/source.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/parser.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printString.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/visitor.mjs","../../common/temp/node_modules/.pnpm/graphql@16.12.0/node_modules/graphql/language/printer.mjs","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/resolveRequestDocument.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/types.js","../../common/temp/node_modules/.pnpm/cross-fetch@3.2.0/node_modules/cross-fetch/dist/browser-ponyfill.js","../../common/temp/node_modules/.pnpm/graphql-request@6.0.0_graphql@16.12.0/node_modules/graphql-request/build/esm/index.js","../src/queries.ts","../src/gql/schema.ts","../src/index.ts"],"sourcesContent":["/!\r\n decimal.js v10.4.3\r\n * An arbitrary-precision Decimal type for JavaScript.\r\n * https://github.com/MikeMcl/decimal.js\r\n * Copyright (c) 2022 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Licence\r\n /\r\n\r\n\r\n// ----------------------------------- EDITABLE DEFAULTS ------------------------------------ //\r\n\r\n\r\n // The maximum exponent magnitude.\r\n // The limit on the value of `toExpNeg`, `toExpPos`, `minE` and `maxE`.\r\nvar EXP_LIMIT = 9e15, // 0 to 9e15\r\n\r\n // The limit on the value of `precision`, and on the value of the first argument to\r\n // `toDecimalPlaces`, `toExponential`, `toFixed`, `toPrecision` and `toSignificantDigits`.\r\n MAX_DIGITS = 1e9, // 0 to 1e9\r\n\r\n // Base conversion alphabet.\r\n NUMERALS = '0123456789abcdef',\r\n\r\n // The natural logarithm of 10 (1025 digits).\r\n LN10 = '2.3025850929940456840179914546843642076011014886287729760333279009675726096773524802359972050895982983419677840422862486334095254650828067566662873690987816894829072083255546808437998948262331985283935053089653777326288461633662222876982198867465436674744042432743651550489343149393914796194044002221051017141748003688084012647080685567743216228355220114804663715659121373450747856947683463616792101806445070648000277502684916746550586856935673420670581136429224554405758925724208241314695689016758940256776311356919292033376587141660230105703089634572075440370847469940168269282808481184289314848524948644871927809676271275775397027668605952496716674183485704422507197965004714951050492214776567636938662976979522110718264549734772662425709429322582798502585509785265383207606726317164309505995087807523710333101197857547331541421808427543863591778117054309827482385045648019095610299291824318237525357709750539565187697510374970888692180205189339507238539205144634197265287286965110862571492198849978748873771345686209167058',\r\n\r\n // Pi (1025 digits).\r\n PI = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679821480865132823066470938446095505822317253594081284811174502841027019385211055596446229489549303819644288109756659334461284756482337867831652712019091456485669234603486104543266482133936072602491412737245870066063155881748815209209628292540917153643678925903600113305305488204665213841469519415116094330572703657595919530921861173819326117931051185480744623799627495673518857527248912279381830119491298336733624406566430860213949463952247371907021798609437027705392171762931767523846748184676694051320005681271452635608277857713427577896091736371787214684409012249534301465495853710507922796892589235420199561121290219608640344181598136297747713099605187072113499999983729780499510597317328160963185950244594553469083026425223082533446850352619311881710100031378387528865875332083814206171776691473035982534904287554687311595628638823537875937519577818577805321712268066130019278766111959092164201989380952572010654858632789',\r\n\r\n\r\n // The initial configuration properties of the Decimal constructor.\r\n DEFAULTS = {\r\n\r\n // These values must be integers within the stated ranges (inclusive).\r\n // Most of these values can be changed at run-time using the `Decimal.config` method.\r\n\r\n // The maximum number of significant digits of the result of a calculation or base conversion.\r\n // E.g. `Decimal.config({ precision: 20 });`\r\n precision: 20, // 1 to MAX_DIGITS\r\n\r\n // The rounding mode used when rounding to `precision`.\r\n //\r\n // ROUND_UP 0 Away from zero.\r\n // ROUND_DOWN 1 Towards zero.\r\n // ROUND_CEIL 2 Towards +Infinity.\r\n // ROUND_FLOOR 3 Towards -Infinity.\r\n // ROUND_HALF_UP 4 Towards nearest neighbour. If equidistant, up.\r\n // ROUND_HALF_DOWN 5 Towards nearest neighbour. If equidistant, down.\r\n // ROUND_HALF_EVEN 6 Towards nearest neighbour. If equidistant, towards even neighbour.\r\n // ROUND_HALF_CEIL 7 Towards nearest neighbour. If equidistant, towards +Infinity.\r\n // ROUND_HALF_FLOOR 8 Towards nearest neighbour. If equidistant, towards -Infinity.\r\n //\r\n // E.g.\r\n // `Decimal.rounding = 4;`\r\n // `Decimal.rounding = Decimal.ROUND_HALF_UP;`\r\n rounding: 4, // 0 to 8\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 (JavaScript %).\r\n // FLOOR 3 The remainder has the same sign as the divisor (Python %).\r\n // HALF_EVEN 6 The IEEE 754 remainder function.\r\n // EUCLID 9 Euclidian division. q = sign(n) * floor(a / abs(n)). Always positive.\r\n //\r\n // Truncated division (1), floored division (3), the IEEE 754 remainder (6), and Euclidian\r\n // division (9) are commonly used for the modulus operation. The other rounding modes can also\r\n // be used, but they may not give useful results.\r\n modulo: 1, // 0 to 9\r\n\r\n // The exponent value at and beneath which `toString` returns exponential notation.\r\n // JavaScript numbers: -7\r\n toExpNeg: -7, // 0 to -EXP_LIMIT\r\n\r\n // The exponent value at and above which `toString` returns exponential notation.\r\n // JavaScript numbers: 21\r\n toExpPos: 21, // 0 to EXP_LIMIT\r\n\r\n // The minimum exponent value, beneath which underflow to zero occurs.\r\n // JavaScript numbers: -324 (5e-324)\r\n minE: -EXP_LIMIT, // -1 to -EXP_LIMIT\r\n\r\n // The maximum exponent value, above which overflow to Infinity occurs.\r\n // JavaScript numbers: 308 (1.7976931348623157e+308)\r\n maxE: EXP_LIMIT, // 1 to EXP_LIMIT\r\n\r\n // Whether to use cryptographically-secure random number generation, if available.\r\n crypto: false // true/false\r\n },\r\n\r\n\r\n// ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n inexact, quadrant,\r\n external = true,\r\n\r\n decimalError = '[DecimalError] ',\r\n invalidArgument = decimalError + 'Invalid argument: ',\r\n precisionLimitExceeded = decimalError + 'Precision limit exceeded',\r\n cryptoUnavailable = decimalError + 'crypto unavailable',\r\n tag = '[object Decimal]',\r\n\r\n mathfloor = Math.floor,\r\n mathpow = Math.pow,\r\n\r\n isBinary = /^0b([01]+(\\.[01])?\|\\.[01]+)(p[+-]?\\d+)?$/i,\r\n isHex = /^0x([0-9a-f]+(\\.[0-9a-f])?\|\\.[0-9a-f]+)(p[+-]?\\d+)?$/i,\r\n isOctal = /^0o([0-7]+(\\.[0-7])?\|\\.[0-7]+)(p[+-]?\\d+)?$/i,\r\n isDecimal = /^(\\d+(\\.\\d)?\|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n BASE = 1e7,\r\n LOG_BASE = 7,\r\n MAX_SAFE_INTEGER = 9007199254740991,\r\n\r\n LN10_PRECISION = LN10.length - 1,\r\n PI_PRECISION = PI.length - 1,\r\n\r\n // Decimal.prototype object\r\n P = { toStringTag: tag };\r\n\r\n\r\n// Decimal prototype methods\r\n\r\n\r\n/\r\n absoluteValue abs\r\n * ceil\r\n * clampedTo clamp\r\n * comparedTo cmp\r\n * cosine cos\r\n * cubeRoot cbrt\r\n * decimalPlaces dp\r\n * dividedBy div\r\n * dividedToIntegerBy divToInt\r\n * equals eq\r\n * floor\r\n * greaterThan gt\r\n * greaterThanOrEqualTo gte\r\n * hyperbolicCosine cosh\r\n * hyperbolicSine sinh\r\n * hyperbolicTangent tanh\r\n * inverseCosine acos\r\n * inverseHyperbolicCosine acosh\r\n * inverseHyperbolicSine asinh\r\n * inverseHyperbolicTangent atanh\r\n * inverseSine asin\r\n * inverseTangent atan\r\n * isFinite\r\n * isInteger isInt\r\n * isNaN\r\n * isNegative isNeg\r\n * isPositive isPos\r\n * isZero\r\n * lessThan lt\r\n * lessThanOrEqualTo lte\r\n * logarithm log\r\n * [maximum] [max]\r\n * [minimum] [min]\r\n * minus sub\r\n * modulo mod\r\n * naturalExponential exp\r\n * naturalLogarithm ln\r\n * negated neg\r\n * plus add\r\n * precision sd\r\n * round\r\n * sine sin\r\n * squareRoot sqrt\r\n * tangent tan\r\n * times mul\r\n * toBinary\r\n * toDecimalPlaces toDP\r\n * toExponential\r\n * toFixed\r\n * toFraction\r\n * toHexadecimal toHex\r\n * toNearest\r\n * toNumber\r\n * toOctal\r\n * toPower pow\r\n * toPrecision\r\n * toSignificantDigits toSD\r\n * toString\r\n * truncated trunc\r\n * valueOf toJSON\r\n /\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the absolute value of this Decimal.\r\n \r\n /\r\nP.absoluteValue = P.abs = function () {\r\n var x = new this.constructor(this);\r\n if (x.s < 0) x.s = 1;\r\n return finalise(x);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of positive Infinity.\r\n \r\n /\r\nP.ceil = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 2);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal clamped to the range\r\n * delineated by `min` and `max`.\r\n \r\n min {number\|string\|Decimal}\r\n * max {number\|string\|Decimal}\r\n \r\n /\r\nP.clampedTo = P.clamp = function (min, max) {\r\n var k,\r\n x = this,\r\n Ctor = x.constructor;\r\n min = new Ctor(min);\r\n max = new Ctor(max);\r\n if (!min.s \|\| !max.s) return new Ctor(NaN);\r\n if (min.gt(max)) throw Error(invalidArgument + max);\r\n k = x.cmp(min);\r\n return k < 0 ? min : x.cmp(max) > 0 ? max : new Ctor(x);\r\n};\r\n\r\n\r\n/\r\n Return\r\n * 1 if the value of this Decimal is greater than the value of `y`,\r\n * -1 if the value of this Decimal is less than the value of `y`,\r\n * 0 if they have the same value,\r\n * NaN if the value of either Decimal is NaN.\r\n \r\n /\r\nP.comparedTo = P.cmp = function (y) {\r\n var i, j, xdL, ydL,\r\n x = this,\r\n xd = x.d,\r\n yd = (y = new x.constructor(y)).d,\r\n xs = x.s,\r\n ys = y.s;\r\n\r\n // Either NaN or ±Infinity?\r\n if (!xd \|\| !yd) {\r\n return !xs \|\| !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Either zero?\r\n if (!xd[0] \|\| !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n // Signs differ?\r\n if (xs !== ys) return xs;\r\n\r\n // Compare exponents.\r\n if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Compare digit by digit.\r\n for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n cos(0) = 1\r\n * cos(-0) = 1\r\n * cos(Infinity) = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN) = NaN\r\n \r\n /\r\nP.cosine = P.cos = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.d) return new Ctor(NaN);\r\n\r\n // cos(0) = cos(-0) = 1\r\n if (!x.d[0]) return new Ctor(1);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = cosine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 \|\| quadrant == 3 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n \r\n * Return a new Decimal whose value is the cube root of the value of this Decimal, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n cbrt(0) = 0\r\n * cbrt(-0) = -0\r\n * cbrt(1) = 1\r\n * cbrt(-1) = -1\r\n * cbrt(N) = N\r\n * cbrt(-I) = -I\r\n * cbrt(I) = I\r\n \r\n Math.cbrt(x) = (x < 0 ? -Math.pow(-x, 1/3) : Math.pow(x, 1/3))\r\n \r\n /\r\nP.cubeRoot = P.cbrt = function () {\r\n var e, m, n, r, rep, s, sd, t, t3, t3plusx,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = x.s * mathpow(x.s * x, 1 / 3);\r\n\r\n // Math.cbrt underflow/overflow?\r\n // Pass x to Math.pow as integer, then adjust the exponent of the result.\r\n if (!s \|\| Math.abs(s) == 1 / 0) {\r\n n = digitsToString(x.d);\r\n e = x.e;\r\n\r\n // Adjust n exponent so it is a multiple of 3 away from x exponent.\r\n if (s = (e - n.length + 1) % 3) n += (s == 1 \|\| s == -2 ? '0' : '00');\r\n s = mathpow(n, 1 / 3);\r\n\r\n // Rarely, e may be one less than the result exponent value.\r\n e = mathfloor((e + 1) / 3) - (e % 3 == (e < 0 ? -1 : 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 Ctor(n);\r\n r.s = x.s;\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Halley's method.\r\n // TODO? Compare Newton's method.\r\n for (;;) {\r\n t = r;\r\n t3 = t.times(t).times(t);\r\n t3plusx = t3.plus(x);\r\n r = divide(t3plusx.plus(x).times(t), t3plusx.plus(t3), sd + 2, 1);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or 4999\r\n // , i.e. approaching a rounding boundary, continue the 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 exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 0);\r\n\r\n if (t.times(t).times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n }\r\n\r\n sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // 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 finalise(r, e + 1, 1);\r\n m = !r.times(r).times(r).eq(x);\r\n }\r\n\r\n break;\r\n }\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/\r\n Return the number of decimal places of the value of this Decimal.\r\n \r\n /\r\nP.decimalPlaces = P.dp = function () {\r\n var w,\r\n d = this.d,\r\n n = NaN;\r\n\r\n if (d) {\r\n w = d.length - 1;\r\n n = (w - mathfloor(this.e / LOG_BASE)) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n w = d[w];\r\n if (w) for (; w % 10 == 0; w /= 10) n--;\r\n if (n < 0) n = 0;\r\n }\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 Decimal whose value is the value of this Decimal divided by `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.dividedBy = P.div = function (y) {\r\n return divide(this, new this.constructor(y));\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the integer part of dividing the value of this Decimal\r\n * by the value of `y`, rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.dividedToIntegerBy = P.divToInt = function (y) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n return finalise(divide(x, new Ctor(y), 0, 1, 1), Ctor.precision, Ctor.rounding);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is equal to the value of `y`, otherwise return false.\r\n \r\n /\r\nP.equals = P.eq = function (y) {\r\n return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number in the\r\n * direction of negative Infinity.\r\n \r\n /\r\nP.floor = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 3);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is greater than the value of `y`, otherwise return\r\n * false.\r\n \r\n /\r\nP.greaterThan = P.gt = function (y) {\r\n return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is greater than or equal to the value of `y`,\r\n * otherwise return false.\r\n \r\n /\r\nP.greaterThanOrEqualTo = P.gte = function (y) {\r\n var k = this.cmp(y);\r\n return k == 1 \|\| k === 0;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic cosine of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [1, Infinity]\r\n \r\n cosh(x) = 1 + x^2/2! + x^4/4! + x^6/6! + ...\r\n \r\n cosh(0) = 1\r\n * cosh(-0) = 1\r\n * cosh(Infinity) = Infinity\r\n * cosh(-Infinity) = Infinity\r\n * cosh(NaN) = NaN\r\n \r\n x time taken (ms) result\r\n * 1000 9 9.8503555700852349694e+433\r\n * 10000 25 4.4034091128314607936e+4342\r\n * 100000 171 1.4033316802130615897e+43429\r\n * 1000000 3817 1.5166076984010437725e+434294\r\n * 10000000 abandoned after 2 minute wait\r\n \r\n TODO? Compare performance of cosh(x) = 0.5 * (exp(x) + exp(-x))\r\n \r\n /\r\nP.hyperbolicCosine = P.cosh = function () {\r\n var k, n, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor,\r\n one = new Ctor(1);\r\n\r\n if (!x.isFinite()) return new Ctor(x.s ? 1 / 0 : NaN);\r\n if (x.isZero()) return one;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n // Argument reduction: cos(4x) = 1 - 8cos^2(x) + 8cos^4(x) + 1\r\n // i.e. cos(x) = 1 - cos^2(x/4)(8 - 8cos^2(x/4))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n // TODO? Estimation reused from cosine() and may not be optimal here.\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n n = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n n = '2.3283064365386962890625e-10';\r\n }\r\n\r\n x = taylorSeries(Ctor, 1, x.times(n), new Ctor(1), true);\r\n\r\n // Reverse argument reduction\r\n var cosh2_x,\r\n i = k,\r\n d8 = new Ctor(8);\r\n for (; i--;) {\r\n cosh2_x = x.times(x);\r\n x = one.minus(cosh2_x.times(d8.minus(cosh2_x.times(d8))));\r\n }\r\n\r\n return finalise(x, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic sine of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n sinh(x) = x + x^3/3! + x^5/5! + x^7/7! + ...\r\n \r\n sinh(0) = 0\r\n * sinh(-0) = -0\r\n * sinh(Infinity) = Infinity\r\n * sinh(-Infinity) = -Infinity\r\n * sinh(NaN) = NaN\r\n \r\n x time taken (ms)\r\n * 10 2 ms\r\n * 100 5 ms\r\n * 1000 14 ms\r\n * 10000 82 ms\r\n * 100000 886 ms 1.4033316802130615897e+43429\r\n * 200000 2613 ms\r\n * 300000 5407 ms\r\n * 400000 8824 ms\r\n * 500000 13026 ms 8.7080643612718084129e+217146\r\n * 1000000 48543 ms\r\n \r\n TODO? Compare performance of sinh(x) = 0.5 * (exp(x) - exp(-x))\r\n \r\n /\r\nP.hyperbolicSine = P.sinh = function () {\r\n var k, pr, rm, len,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n } else {\r\n\r\n // Alternative argument reduction: sinh(3x) = sinh(x)(3 + 4sinh^2(x))\r\n // i.e. sinh(x) = sinh(x/3)(3 + 4sinh^2(x/3))\r\n // 3 multiplications and 1 addition\r\n\r\n // Argument reduction: sinh(5x) = sinh(x)(5 + sinh^2(x)(20 + 16sinh^2(x)))\r\n // i.e. sinh(x) = sinh(x/5)(5 + sinh^2(x/5)(20 + 16sinh^2(x/5)))\r\n // 4 multiplications and 2 additions\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k \| 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x, true);\r\n\r\n // Reverse argument reduction\r\n var sinh2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sinh2_x = x.times(x);\r\n x = x.times(d5.plus(sinh2_x.times(d16.times(sinh2_x).plus(d20))));\r\n }\r\n }\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic tangent of the value in radians of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n tanh(x) = sinh(x) / cosh(x)\r\n \r\n tanh(0) = 0\r\n * tanh(-0) = -0\r\n * tanh(Infinity) = 1\r\n * tanh(-Infinity) = -1\r\n * tanh(NaN) = NaN\r\n \r\n /\r\nP.hyperbolicTangent = P.tanh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(x.s);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 7;\r\n Ctor.rounding = 1;\r\n\r\n return divide(x.sinh(), x.cosh(), Ctor.precision = pr, Ctor.rounding = rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arccosine (inverse cosine) in radians of the value of\r\n * this Decimal.\r\n \r\n Domain: [-1, 1]\r\n * Range: [0, pi]\r\n \r\n acos(x) = pi/2 - asin(x)\r\n \r\n acos(0) = pi/2\r\n * acos(-0) = pi/2\r\n * acos(1) = 0\r\n * acos(-1) = pi\r\n * acos(1/2) = pi/3\r\n * acos(-1/2) = 2pi/3\r\n acos(\|x\| > 1) = NaN\r\n * acos(NaN) = NaN\r\n \r\n /\r\nP.inverseCosine = P.acos = function () {\r\n var halfPi,\r\n x = this,\r\n Ctor = x.constructor,\r\n k = x.abs().cmp(1),\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n return k === 0\r\n // \|x\| is 1\r\n ? x.isNeg() ? getPi(Ctor, pr, rm) : new Ctor(0)\r\n // \|x\| > 1 or x is NaN\r\n : new Ctor(NaN);\r\n }\r\n\r\n if (x.isZero()) return getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n // TODO? Special case acos(0.5) = pi/3 and acos(-0.5) = 2pi/3\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.asin();\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return halfPi.minus(x);\r\n};\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the inverse of the hyperbolic cosine in radians of the\r\n * value of this Decimal.\r\n \r\n Domain: [1, Infinity]\r\n * Range: [0, Infinity]\r\n \r\n acosh(x) = ln(x + sqrt(x^2 - 1))\r\n \r\n acosh(x < 1) = NaN\r\n * acosh(NaN) = NaN\r\n * acosh(Infinity) = Infinity\r\n * acosh(-Infinity) = NaN\r\n * acosh(0) = NaN\r\n * acosh(-0) = NaN\r\n * acosh(1) = 0\r\n * acosh(-1) = NaN\r\n \r\n /\r\nP.inverseHyperbolicCosine = P.acosh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.lte(1)) return new Ctor(x.eq(1) ? 0 : NaN);\r\n if (!x.isFinite()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(Math.abs(x.e), x.sd()) + 4;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).minus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic sine in radians of the value\r\n * of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n asinh(x) = ln(x + sqrt(x^2 + 1))\r\n \r\n asinh(NaN) = NaN\r\n * asinh(Infinity) = Infinity\r\n * asinh(-Infinity) = -Infinity\r\n * asinh(0) = 0\r\n * asinh(-0) = -0\r\n \r\n /\r\nP.inverseHyperbolicSine = P.asinh = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite() \|\| x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 2 * Math.max(Math.abs(x.e), x.sd()) + 6;\r\n Ctor.rounding = 1;\r\n external = false;\r\n\r\n x = x.times(x).plus(1).sqrt().plus(x);\r\n\r\n external = true;\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.ln();\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic tangent in radians of the\r\n * value of this Decimal.\r\n \r\n Domain: [-1, 1]\r\n * Range: [-Infinity, Infinity]\r\n \r\n atanh(x) = 0.5 * ln((1 + x) / (1 - x))\r\n \r\n atanh(\|x\| > 1) = NaN\r\n * atanh(NaN) = NaN\r\n * atanh(Infinity) = NaN\r\n * atanh(-Infinity) = NaN\r\n * atanh(0) = 0\r\n * atanh(-0) = -0\r\n * atanh(1) = Infinity\r\n * atanh(-1) = -Infinity\r\n \r\n /\r\nP.inverseHyperbolicTangent = P.atanh = function () {\r\n var pr, rm, wpr, xsd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.e >= 0) return new Ctor(x.abs().eq(1) ? x.s / 0 : x.isZero() ? x : NaN);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n xsd = x.sd();\r\n\r\n if (Math.max(xsd, pr) < 2 * -x.e - 1) return finalise(new Ctor(x), pr, rm, true);\r\n\r\n Ctor.precision = wpr = xsd - x.e;\r\n\r\n x = divide(x.plus(1), new Ctor(1).minus(x), wpr + pr, 1);\r\n\r\n Ctor.precision = pr + 4;\r\n Ctor.rounding = 1;\r\n\r\n x = x.ln();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(0.5);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arcsine (inverse sine) in radians of the value of this\r\n * Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n \r\n asin(x) = 2atan(x/(1 + sqrt(1 - x^2)))\r\n \r\n * asin(0) = 0\r\n * asin(-0) = -0\r\n * asin(1/2) = pi/6\r\n * asin(-1/2) = -pi/6\r\n * asin(1) = pi/2\r\n * asin(-1) = -pi/2\r\n * asin(\|x\| > 1) = NaN\r\n * asin(NaN) = NaN\r\n \r\n TODO? Compare performance of Taylor series.\r\n \r\n /\r\nP.inverseSine = P.asin = function () {\r\n var halfPi, k,\r\n pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n k = x.abs().cmp(1);\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (k !== -1) {\r\n\r\n // \|x\| is 1\r\n if (k === 0) {\r\n halfPi = getPi(Ctor, pr + 4, rm).times(0.5);\r\n halfPi.s = x.s;\r\n return halfPi;\r\n }\r\n\r\n // \|x\| > 1 or x is NaN\r\n return new Ctor(NaN);\r\n }\r\n\r\n // TODO? Special case asin(1/2) = pi/6 and asin(-1/2) = -pi/6\r\n\r\n Ctor.precision = pr + 6;\r\n Ctor.rounding = 1;\r\n\r\n x = x.div(new Ctor(1).minus(x.times(x)).sqrt().plus(1)).atan();\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return x.times(2);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent (inverse tangent) in radians of the value\r\n * of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi/2, pi/2]\r\n \r\n atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n \r\n atan(0) = 0\r\n * atan(-0) = -0\r\n * atan(1) = pi/4\r\n * atan(-1) = -pi/4\r\n * atan(Infinity) = pi/2\r\n * atan(-Infinity) = -pi/2\r\n * atan(NaN) = NaN\r\n \r\n /\r\nP.inverseTangent = P.atan = function () {\r\n var i, j, k, n, px, t, r, wpr, x2,\r\n x = this,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding;\r\n\r\n if (!x.isFinite()) {\r\n if (!x.s) return new Ctor(NaN);\r\n if (pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.5);\r\n r.s = x.s;\r\n return r;\r\n }\r\n } else if (x.isZero()) {\r\n return new Ctor(x);\r\n } else if (x.abs().eq(1) && pr + 4 <= PI_PRECISION) {\r\n r = getPi(Ctor, pr + 4, rm).times(0.25);\r\n r.s = x.s;\r\n return r;\r\n }\r\n\r\n Ctor.precision = wpr = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n // TODO? if (x >= 1 && pr <= PI_PRECISION) atan(x) = halfPi * x.s - atan(1 / x);\r\n\r\n // Argument reduction\r\n // Ensure \|x\| < 0.42\r\n // atan(x) = 2 * atan(x / (1 + sqrt(1 + x^2)))\r\n\r\n k = Math.min(28, wpr / LOG_BASE + 2 \| 0);\r\n\r\n for (i = k; i; --i) x = x.div(x.times(x).plus(1).sqrt().plus(1));\r\n\r\n external = false;\r\n\r\n j = Math.ceil(wpr / LOG_BASE);\r\n n = 1;\r\n x2 = x.times(x);\r\n r = new Ctor(x);\r\n px = x;\r\n\r\n // atan(x) = x - x^3/3 + x^5/5 - x^7/7 + ...\r\n for (; i !== -1;) {\r\n px = px.times(x2);\r\n t = r.minus(px.div(n += 2));\r\n\r\n px = px.times(x2);\r\n r = t.plus(px.div(n += 2));\r\n\r\n if (r.d[j] !== void 0) for (i = j; r.d[i] === t.d[i] && i--;);\r\n }\r\n\r\n if (k) r = r.times(2 << (k - 1));\r\n\r\n external = true;\r\n\r\n return finalise(r, Ctor.precision = pr, Ctor.rounding = rm, true);\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is a finite number, otherwise return false.\r\n \r\n /\r\nP.isFinite = function () {\r\n return !!this.d;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is an integer, otherwise return false.\r\n \r\n /\r\nP.isInteger = P.isInt = function () {\r\n return !!this.d && mathfloor(this.e / LOG_BASE) > this.d.length - 2;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is NaN, otherwise return false.\r\n \r\n /\r\nP.isNaN = function () {\r\n return !this.s;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is negative, otherwise return false.\r\n \r\n /\r\nP.isNegative = P.isNeg = function () {\r\n return this.s < 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is positive, otherwise return false.\r\n \r\n /\r\nP.isPositive = P.isPos = function () {\r\n return this.s > 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is 0 or -0, otherwise return false.\r\n \r\n /\r\nP.isZero = function () {\r\n return !!this.d && this.d[0] === 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is less than `y`, otherwise return false.\r\n \r\n /\r\nP.lessThan = P.lt = function (y) {\r\n return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/\r\n Return true if the value of this Decimal is less than or equal to `y`, otherwise return false.\r\n \r\n /\r\nP.lessThanOrEqualTo = P.lte = function (y) {\r\n return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/\r\n Return the logarithm of the value of this Decimal to the specified base, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n If no base is specified, return log[10](arg).\r\n \r\n log[base](arg) = ln(arg) / ln(base)\r\n \r\n The result will always be correctly rounded if the base of the log is 10, and 'almost always'\r\n * otherwise:\r\n \r\n Depending on the rounding mode, the result may be incorrectly rounded if the first fifteen\r\n * rounding digits are [49]99999999999999 or [50]00000000000000. In that case, the maximum error\r\n * between the result and the correctly rounded result will be one ulp (unit in the last place).\r\n \r\n log[-b](a) = NaN\r\n * log[0](a) = NaN\r\n * log[1](a) = NaN\r\n * log[NaN](a) = NaN\r\n * log[Infinity](a) = NaN\r\n * log[b](0) = -Infinity\r\n * log[b](-0) = -Infinity\r\n * log[b](-a) = NaN\r\n * log[b](1) = 0\r\n * log[b](Infinity) = Infinity\r\n * log[b](NaN) = NaN\r\n \r\n [base] {number\|string\|Decimal} The base of the logarithm.\r\n \r\n /\r\nP.logarithm = P.log = function (base) {\r\n var isBase10, d, denominator, k, inf, num, sd, r,\r\n arg = this,\r\n Ctor = arg.constructor,\r\n pr = Ctor.precision,\r\n rm = Ctor.rounding,\r\n guard = 5;\r\n\r\n // Default base is 10.\r\n if (base == null) {\r\n base = new Ctor(10);\r\n isBase10 = true;\r\n } else {\r\n base = new Ctor(base);\r\n d = base.d;\r\n\r\n // Return NaN if base is negative, or non-finite, or is 0 or 1.\r\n if (base.s < 0 \|\| !d \|\| !d[0] \|\| base.eq(1)) return new Ctor(NaN);\r\n\r\n isBase10 = base.eq(10);\r\n }\r\n\r\n d = arg.d;\r\n\r\n // Is arg negative, non-finite, 0 or 1?\r\n if (arg.s < 0 \|\| !d \|\| !d[0] \|\| arg.eq(1)) {\r\n return new Ctor(d && !d[0] ? -1 / 0 : arg.s != 1 ? NaN : d ? 0 : 1 / 0);\r\n }\r\n\r\n // The result will have a non-terminating decimal expansion if base is 10 and arg is not an\r\n // integer power of 10.\r\n if (isBase10) {\r\n if (d.length > 1) {\r\n inf = true;\r\n } else {\r\n for (k = d[0]; k % 10 === 0;) k /= 10;\r\n inf = k !== 1;\r\n }\r\n }\r\n\r\n external = false;\r\n sd = pr + guard;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n\r\n // The result will have 5 rounding digits.\r\n r = divide(num, denominator, sd, 1);\r\n\r\n // If at a rounding boundary, i.e. the result's rounding digits are [49]9999 or [50]0000,\r\n // calculate 10 further digits.\r\n //\r\n // If the result is known to have an infinite decimal expansion, repeat this until it is clear\r\n // that the result is above or below the boundary. Otherwise, if after calculating the 10\r\n // further digits, the last 14 are nines, round up and assume the result is exact.\r\n // Also assume the result is exact if the last 14 are zero.\r\n //\r\n // Example of a result that will be incorrectly rounded:\r\n // log[1048576](4503599627370502) = 2.60000000000000009610279511444746...\r\n // The above result correctly rounded using ROUND_CEIL to 1 decimal place should be 2.7, but it\r\n // will be given as 2.6 as there are 15 zeros immediately after the requested decimal place, so\r\n // the exact result would be assumed to be 2.6, which rounded using ROUND_CEIL to 1 decimal\r\n // place is still 2.6.\r\n if (checkRoundingDigits(r.d, k = pr, rm)) {\r\n\r\n do {\r\n sd += 10;\r\n num = naturalLogarithm(arg, sd);\r\n denominator = isBase10 ? getLn10(Ctor, sd + 10) : naturalLogarithm(base, sd);\r\n r = divide(num, denominator, sd, 1);\r\n\r\n if (!inf) {\r\n\r\n // Check for 14 nines from the 2nd rounding digit, as the first may be 4.\r\n if (+digitsToString(r.d).slice(k + 1, k + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n\r\n break;\r\n }\r\n } while (checkRoundingDigits(r.d, k += 10, rm));\r\n }\r\n\r\n external = true;\r\n\r\n return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the maximum of the arguments and the value of this Decimal.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\nP.max = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'lt');\r\n};\r\n /\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the minimum of the arguments and the value of this Decimal.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\nP.min = function () {\r\n Array.prototype.push.call(arguments, this);\r\n return maxOrMin(this.constructor, arguments, 'gt');\r\n};\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 Decimal whose value is the value of this Decimal minus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.minus = P.sub = function (y) {\r\n var d, e, i, j, k, len, pr, rm, xd, xe, xLTy, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d \|\| !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s \|\| !y.s) y = new Ctor(NaN);\r\n\r\n // Return y negated if x is finite and y is ±Infinity.\r\n else if (x.d) y.s = -y.s;\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with different signs.\r\n // Return NaN if both are ±Infinity with the same sign.\r\n else y = new Ctor(y.d \|\| x.s !== y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.plus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] \|\| !yd[0]) {\r\n\r\n // Return y negated if x is zero and y is non-zero.\r\n if (yd[0]) y.s = -y.s;\r\n\r\n // Return x if y is zero and x is non-zero.\r\n else if (xd[0]) y = new Ctor(x);\r\n\r\n // Return zero if both are zero.\r\n // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n e = mathfloor(y.e / LOG_BASE);\r\n xe = mathfloor(x.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n k = xe - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (k) {\r\n xLTy = k < 0;\r\n\r\n if (xLTy) {\r\n d = xd;\r\n k = -k;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = xe;\r\n len = xd.length;\r\n }\r\n\r\n // Numbers with massively different exponents would result in a very high number of\r\n // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n if (k > i) {\r\n k = i;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents.\r\n d.reverse();\r\n for (i = k; i--;) d.push(0);\r\n d.reverse();\r\n\r\n // Base 1e7 exponents equal.\r\n } else {\r\n\r\n // Check digits to determine which is the bigger number.\r\n\r\n i = xd.length;\r\n len = yd.length;\r\n xLTy = i < len;\r\n if (xLTy) len = i;\r\n\r\n for (i = 0; i < len; i++) {\r\n if (xd[i] != yd[i]) {\r\n xLTy = xd[i] < yd[i];\r\n break;\r\n }\r\n }\r\n\r\n k = 0;\r\n }\r\n\r\n if (xLTy) {\r\n d = xd;\r\n xd = yd;\r\n yd = d;\r\n y.s = -y.s;\r\n }\r\n\r\n len = xd.length;\r\n\r\n // Append zeros to `xd` if shorter.\r\n // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n // Subtract yd from xd.\r\n for (i = yd.length; i > k;) {\r\n\r\n if (xd[--i] < yd[i]) {\r\n for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n --xd[j];\r\n xd[i] += BASE;\r\n }\r\n\r\n xd[i] -= yd[i];\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] === 0;) xd.pop();\r\n\r\n // Remove leading zeros and adjust exponent accordingly.\r\n for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n // Zero?\r\n if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\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 Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n The result depends on the modulo mode.\r\n \r\n /\r\nP.modulo = P.mod = function (y) {\r\n var q,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // Return NaN if x is ±Infinity or NaN, or y is NaN or ±0.\r\n if (!x.d \|\| !y.s \|\| y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n // Return x if y is ±Infinity or x is ±0.\r\n if (!y.d \|\| x.d && !x.d[0]) {\r\n return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n }\r\n\r\n // Prevent rounding of intermediate calculations.\r\n external = false;\r\n\r\n if (Ctor.modulo == 9) {\r\n\r\n // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n // result = x - q * y where 0 <= result < abs(y)\r\n q = divide(x, y.abs(), 0, 3, 1);\r\n q.s = y.s;\r\n } else {\r\n q = divide(x, y, 0, Ctor.modulo, 1);\r\n }\r\n\r\n q = q.times(y);\r\n\r\n external = true;\r\n\r\n return x.minus(q);\r\n};\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.naturalExponential = P.exp = function () {\r\n return naturalExponential(this);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of the value of this Decimal,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.naturalLogarithm = P.ln = function () {\r\n return naturalLogarithm(this);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal negated, i.e. as if multiplied by\r\n * -1.\r\n \r\n /\r\nP.negated = P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s;\r\n return finalise(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 Decimal whose value is the value of this Decimal plus `y`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n /\r\nP.plus = P.add = function (y) {\r\n var carry, d, e, i, k, len, pr, rm, xd, yd,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n y = new Ctor(y);\r\n\r\n // If either is not finite...\r\n if (!x.d \|\| !y.d) {\r\n\r\n // Return NaN if either is NaN.\r\n if (!x.s \|\| !y.s) y = new Ctor(NaN);\r\n\r\n // Return x if y is finite and x is ±Infinity.\r\n // Return x if both are ±Infinity with the same sign.\r\n // Return NaN if both are ±Infinity with different signs.\r\n // Return y if x is finite and y is ±Infinity.\r\n else if (!x.d) y = new Ctor(y.d \|\| x.s === y.s ? x : NaN);\r\n\r\n return y;\r\n }\r\n\r\n // If signs differ...\r\n if (x.s != y.s) {\r\n y.s = -y.s;\r\n return x.minus(y);\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n // If either is zero...\r\n if (!xd[0] \|\| !yd[0]) {\r\n\r\n // Return x if y is zero.\r\n // Return y if y is non-zero.\r\n if (!yd[0]) y = new Ctor(x);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n }\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n // Calculate base 1e7 exponents.\r\n k = mathfloor(x.e / LOG_BASE);\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n xd = xd.slice();\r\n i = k - e;\r\n\r\n // If base 1e7 exponents differ...\r\n if (i) {\r\n\r\n if (i < 0) {\r\n d = xd;\r\n i = -i;\r\n len = yd.length;\r\n } else {\r\n d = yd;\r\n e = k;\r\n len = xd.length;\r\n }\r\n\r\n // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n k = Math.ceil(pr / LOG_BASE);\r\n len = k > len ? k + 1 : len + 1;\r\n\r\n if (i > len) {\r\n i = len;\r\n d.length = 1;\r\n }\r\n\r\n // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n d.reverse();\r\n for (; i--;) d.push(0);\r\n d.reverse();\r\n }\r\n\r\n len = xd.length;\r\n i = yd.length;\r\n\r\n // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n if (len - i < 0) {\r\n i = len;\r\n d = yd;\r\n yd = xd;\r\n xd = d;\r\n }\r\n\r\n // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n for (carry = 0; i;) {\r\n carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE \| 0;\r\n xd[i] %= BASE;\r\n }\r\n\r\n if (carry) {\r\n xd.unshift(carry);\r\n ++e;\r\n }\r\n\r\n // Remove trailing zeros.\r\n // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n y.d = xd;\r\n y.e = getBase10Exponent(xd, e);\r\n\r\n return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/\r\n Return the number of significant digits of the value of this Decimal.\r\n \r\n [z] {boolean\|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n \r\n /\r\nP.precision = P.sd = function (z) {\r\n var k,\r\n x = this;\r\n\r\n if (z !== void 0 && z !== !!z && z !== 1 && z !== 0) throw Error(invalidArgument + z);\r\n\r\n if (x.d) {\r\n k = getPrecision(x.d);\r\n if (z && x.e + 1 > k) k = x.e + 1;\r\n } else {\r\n k = NaN;\r\n }\r\n\r\n return k;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a whole number using\r\n * rounding mode `rounding`.\r\n \r\n /\r\nP.round = function () {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n return finalise(new Ctor(x), x.e + 1, Ctor.rounding);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sine of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n \r\n sin(x) = x - x^3/3! + x^5/5! - ...\r\n \r\n sin(0) = 0\r\n * sin(-0) = -0\r\n * sin(Infinity) = NaN\r\n * sin(-Infinity) = NaN\r\n * sin(NaN) = NaN\r\n \r\n /\r\nP.sine = P.sin = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + Math.max(x.e, x.sd()) + LOG_BASE;\r\n Ctor.rounding = 1;\r\n\r\n x = sine(Ctor, toLessThanHalfPi(Ctor, x));\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant > 2 ? x.neg() : x, pr, rm, true);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\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 /\r\nP.squareRoot = P.sqrt = function () {\r\n var m, n, sd, r, rep, t,\r\n x = this,\r\n d = x.d,\r\n e = x.e,\r\n s = x.s,\r\n Ctor = x.constructor;\r\n\r\n // Negative/NaN/Infinity/zero?\r\n if (s !== 1 \|\| !d \|\| !d[0]) {\r\n return new Ctor(!s \|\| s < 0 && (!d \|\| d[0]) ? NaN : d ? x : 1 / 0);\r\n }\r\n\r\n external = false;\r\n\r\n // Initial estimate.\r\n s = Math.sqrt(+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 = digitsToString(d);\r\n\r\n if ((n.length + e) % 2 == 0) n += '0';\r\n s = Math.sqrt(n);\r\n e = mathfloor((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 Ctor(n);\r\n } else {\r\n r = new Ctor(s.toString());\r\n }\r\n\r\n sd = (e = Ctor.precision) + 3;\r\n\r\n // Newton-Raphson iteration.\r\n for (;;) {\r\n t = r;\r\n r = t.plus(divide(x, t, sd + 2, 1)).times(0.5);\r\n\r\n // TODO? Replace with for-loop and checkRoundingDigits.\r\n if (digitsToString(t.d).slice(0, sd) === (n = digitsToString(r.d)).slice(0, sd)) {\r\n n = n.slice(sd - 3, sd + 1);\r\n\r\n // The 4th rounding digit may be in error by -1 so if the 4 rounding digits are 9999 or\r\n // 4999, i.e. approaching a rounding boundary, continue the 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 exact result as the\r\n // nines may infinitely repeat.\r\n if (!rep) {\r\n finalise(t, e + 1, 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 sd += 4;\r\n rep = 1;\r\n } else {\r\n\r\n // If the rounding digits are null, 0{0,4} or 50{0,3}, check for an exact result.\r\n // 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 finalise(r, e + 1, 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 external = true;\r\n\r\n return finalise(r, e, Ctor.rounding, m);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the tangent of the value in radians of this Decimal.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-Infinity, Infinity]\r\n \r\n tan(0) = 0\r\n * tan(-0) = -0\r\n * tan(Infinity) = NaN\r\n * tan(-Infinity) = NaN\r\n * tan(NaN) = NaN\r\n \r\n /\r\nP.tangent = P.tan = function () {\r\n var pr, rm,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (!x.isFinite()) return new Ctor(NaN);\r\n if (x.isZero()) return new Ctor(x);\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n Ctor.precision = pr + 10;\r\n Ctor.rounding = 1;\r\n\r\n x = x.sin();\r\n x.s = 1;\r\n x = divide(x, new Ctor(1).minus(x.times(x)).sqrt(), pr + 10, 0);\r\n\r\n Ctor.precision = pr;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(quadrant == 2 \|\| quadrant == 4 ? x.neg() : x, pr, rm, true);\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 Decimal whose value is this Decimal times `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n /\r\nP.times = P.mul = function (y) {\r\n var carry, e, i, k, r, rL, t, xdL, ydL,\r\n x = this,\r\n Ctor = x.constructor,\r\n xd = x.d,\r\n yd = (y = new Ctor(y)).d;\r\n\r\n y.s = x.s;\r\n\r\n // If either is NaN, ±Infinity or ±0...\r\n if (!xd \|\| !xd[0] \|\| !yd \|\| !yd[0]) {\r\n\r\n return new Ctor(!y.s \|\| xd && !xd[0] && !yd \|\| yd && !yd[0] && !xd\r\n\r\n // Return NaN if either is NaN.\r\n // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n ? NaN\r\n\r\n // Return ±Infinity if either is ±Infinity.\r\n // Return ±0 if either is ±0.\r\n : !xd \|\| !yd ? y.s / 0 : y.s 0);\r\n }\r\n\r\n e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n xdL = xd.length;\r\n ydL = yd.length;\r\n\r\n // Ensure xd points to the longer array.\r\n if (xdL < ydL) {\r\n r = xd;\r\n xd = yd;\r\n yd = r;\r\n rL = xdL;\r\n xdL = ydL;\r\n ydL = rL;\r\n }\r\n\r\n // Initialise the result array with zeros.\r\n r = [];\r\n rL = xdL + ydL;\r\n for (i = rL; i--;) r.push(0);\r\n\r\n // Multiply!\r\n for (i = ydL; --i >= 0;) {\r\n carry = 0;\r\n for (k = xdL + i; k > i;) {\r\n t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n r[k--] = t % BASE \| 0;\r\n carry = t / BASE \| 0;\r\n }\r\n\r\n r[k] = (r[k] + carry) % BASE \| 0;\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (; !r[--rL];) r.pop();\r\n\r\n if (carry) ++e;\r\n else r.shift();\r\n\r\n y.d = r;\r\n y.e = getBase10Exponent(r, e);\r\n\r\n return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toBinary = function (sd, rm) {\r\n return toStringBinary(this, 2, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `dp`\r\n * decimal places using rounding mode `rm` or `rounding` if `rm` is omitted.\r\n \r\n If `dp` is omitted, return a new Decimal whose value is the value of this Decimal.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toDecimalPlaces = P.toDP = function (dp, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n if (dp === void 0) return x;\r\n\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n return finalise(x, dp + x.e + 1, rm);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in exponential notation rounded to\r\n * `dp` fixed decimal places using rounding mode `rounding`.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toExponential = function (dp, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x, true);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), dp + 1, rm);\r\n str = finiteToString(x, true, dp + 1);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in normal (fixed-point) notation to\r\n * `dp` fixed decimal places and rounded using rounding mode `rm` or `rounding` if `rm` is\r\n * omitted.\r\n \r\n As with JavaScript numbers, (-0).toFixed(0) is '0', but e.g. (-0.00001).toFixed(0) is '-0'.\r\n \r\n [dp] {number} Decimal places. Integer, 0 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n * (-0).toFixed(3) is '0.000'.\r\n * (-0.5).toFixed(0) is '-0'.\r\n \r\n /\r\nP.toFixed = function (dp, rm) {\r\n var str, y,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (dp === void 0) {\r\n str = finiteToString(x);\r\n } else {\r\n checkInt32(dp, 0, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n y = finalise(new Ctor(x), dp + x.e + 1, rm);\r\n str = finiteToString(y, false, dp + y.e + 1);\r\n }\r\n\r\n // To determine whether to add the minus sign look at the value before it was rounded,\r\n // i.e. look at `x` rather than `y`.\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return an array representing the value of this Decimal as a simple fraction with an integer\r\n * numerator and an integer denominator.\r\n \r\n The denominator will be a positive non-zero value less than or equal to the specified maximum\r\n * denominator. If a maximum denominator is not specified, the denominator will be the lowest\r\n * value necessary to represent the number exactly.\r\n \r\n [maxD] {number\|string\|Decimal} Maximum denominator. Integer >= 1 and < Infinity.\r\n \r\n /\r\nP.toFraction = function (maxD) {\r\n var d, d0, d1, d2, e, k, n, n0, n1, pr, q, r,\r\n x = this,\r\n xd = x.d,\r\n Ctor = x.constructor;\r\n\r\n if (!xd) return new Ctor(x);\r\n\r\n n1 = d0 = new Ctor(1);\r\n d1 = n0 = new Ctor(0);\r\n\r\n d = new Ctor(d1);\r\n e = d.e = getPrecision(xd) - x.e - 1;\r\n k = e % LOG_BASE;\r\n d.d[0] = mathpow(10, k < 0 ? LOG_BASE + k : k);\r\n\r\n if (maxD == null) {\r\n\r\n // d is 10*e, the minimum max-denominator needed.\r\n maxD = e > 0 ? d : n1;\r\n } else {\r\n n = new Ctor(maxD);\r\n if (!n.isInt() \|\| n.lt(n1)) throw Error(invalidArgument + n);\r\n maxD = n.gt(d) ? (e > 0 ? d : n1) : n;\r\n }\r\n\r\n external = false;\r\n n = new Ctor(digitsToString(xd));\r\n pr = Ctor.precision;\r\n Ctor.precision = e = xd.length LOG_BASE * 2;\r\n\r\n for (;;) {\r\n q = divide(n, d, 0, 1, 1);\r\n d2 = d0.plus(q.times(d1));\r\n if (d2.cmp(maxD) == 1) break;\r\n d0 = d1;\r\n d1 = d2;\r\n d2 = n1;\r\n n1 = n0.plus(q.times(d2));\r\n n0 = d2;\r\n d2 = d;\r\n d = n.minus(q.times(d2));\r\n n = d2;\r\n }\r\n\r\n d2 = divide(maxD.minus(d0), d1, 0, 1, 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\r\n // Determine which fraction is closer to x, n0/d0 or n1/d1?\r\n r = divide(n1, d1, e, 1).minus(x).abs().cmp(divide(n0, d0, e, 1).minus(x).abs()) < 1\r\n ? [n1, d1] : [n0, d0];\r\n\r\n Ctor.precision = pr;\r\n external = true;\r\n\r\n return r;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 16, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toHexadecimal = P.toHex = function (sd, rm) {\r\n return toStringBinary(this, 16, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Returns a new Decimal whose value is the nearest multiple of `y` in the direction of rounding\r\n * mode `rm`, or `Decimal.rounding` if `rm` is omitted, to the value of this Decimal.\r\n \r\n The return value will always have the same sign as this Decimal, unless either this Decimal\r\n * or `y` is NaN, in which case the return value will be also be NaN.\r\n \r\n The return value is not affected by the value of `precision`.\r\n \r\n y {number\|string\|Decimal} The magnitude to round to a multiple of.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n 'toNearest() rounding mode not an integer: {rm}'\r\n * 'toNearest() rounding mode out of range: {rm}'\r\n \r\n /\r\nP.toNearest = function (y, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n x = new Ctor(x);\r\n\r\n if (y == null) {\r\n\r\n // If x is not finite, return x.\r\n if (!x.d) return x;\r\n\r\n y = new Ctor(1);\r\n rm = Ctor.rounding;\r\n } else {\r\n y = new Ctor(y);\r\n if (rm === void 0) {\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(rm, 0, 8);\r\n }\r\n\r\n // If x is not finite, return x if y is not NaN, else NaN.\r\n if (!x.d) return y.s ? x : y;\r\n\r\n // If y is not finite, return Infinity with the sign of x if y is Infinity, else NaN.\r\n if (!y.d) {\r\n if (y.s) y.s = x.s;\r\n return y;\r\n }\r\n }\r\n\r\n // If y is not zero, calculate the nearest multiple of y to x.\r\n if (y.d[0]) {\r\n external = false;\r\n x = divide(x, y, 0, rm, 1).times(y);\r\n external = true;\r\n finalise(x);\r\n\r\n // If y is zero, return zero with the sign of x.\r\n } else {\r\n y.s = x.s;\r\n x = y;\r\n }\r\n\r\n return x;\r\n};\r\n\r\n\r\n/\r\n Return the value of this Decimal converted to a number primitive.\r\n * Zero keeps its sign.\r\n \r\n /\r\nP.toNumber = function () {\r\n return +this;\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal in base 8, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n \r\n If the optional `sd` argument is present then return binary exponential notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toOctal = function (sd, rm) {\r\n return toStringBinary(this, 8, sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal raised to the power `y`, rounded\r\n * to `precision` significant digits using rounding mode `rounding`.\r\n \r\n ECMAScript compliant.\r\n \r\n pow(x, NaN) = NaN\r\n * pow(x, ±0) = 1\r\n\r\n * pow(NaN, non-zero) = NaN\r\n * pow(abs(x) > 1, +Infinity) = +Infinity\r\n * pow(abs(x) > 1, -Infinity) = +0\r\n * pow(abs(x) == 1, ±Infinity) = NaN\r\n * pow(abs(x) < 1, +Infinity) = +0\r\n * pow(abs(x) < 1, -Infinity) = +Infinity\r\n * pow(+Infinity, y > 0) = +Infinity\r\n * pow(+Infinity, y < 0) = +0\r\n * pow(-Infinity, odd integer > 0) = -Infinity\r\n * pow(-Infinity, even integer > 0) = +Infinity\r\n * pow(-Infinity, odd integer < 0) = -0\r\n * pow(-Infinity, even integer < 0) = +0\r\n * pow(+0, y > 0) = +0\r\n * pow(+0, y < 0) = +Infinity\r\n * pow(-0, odd integer > 0) = -0\r\n * pow(-0, even integer > 0) = +0\r\n * pow(-0, odd integer < 0) = -Infinity\r\n * pow(-0, even integer < 0) = +Infinity\r\n * pow(finite x < 0, finite non-integer) = NaN\r\n \r\n For non-integer or very large exponents pow(x, y) is calculated using\r\n \r\n x^y = exp(yln(x))\r\n \r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} \| [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n \r\n If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n \r\n y {number\|string\|Decimal} The power to which to raise this Decimal.\r\n \r\n /\r\nP.toPower = P.pow = function (y) {\r\n var e, k, pr, r, rm, s,\r\n x = this,\r\n Ctor = x.constructor,\r\n yn = +(y = new Ctor(y));\r\n\r\n // Either ±Infinity, NaN or ±0?\r\n if (!x.d \|\| !y.d \|\| !x.d[0] \|\| !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n x = new Ctor(x);\r\n\r\n if (x.eq(1)) return x;\r\n\r\n pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n\r\n if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n // y exponent\r\n e = mathfloor(y.e / LOG_BASE);\r\n\r\n // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n r = intPow(Ctor, x, k, pr);\r\n return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n }\r\n\r\n s = x.s;\r\n\r\n // if x is negative\r\n if (s < 0) {\r\n\r\n // if y is not an integer\r\n if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n // Result is positive if x is negative and the last digit of integer y is even.\r\n if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n // if x.eq(-1)\r\n if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n x.s = s;\r\n return x;\r\n }\r\n }\r\n\r\n // Estimate result exponent.\r\n // x^y = 10^e, where e = y * log10(x)\r\n // log10(x) = log10(x_significand) + x_exponent\r\n // log10(x_significand) = ln(x_significand) / ln(10)\r\n k = mathpow(+x, yn);\r\n e = k == 0 \|\| !isFinite(k)\r\n ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n : new Ctor(k + '').e;\r\n\r\n // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n // Overflow/underflow?\r\n if (e > Ctor.maxE + 1 \|\| e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n external = false;\r\n Ctor.rounding = x.s = 1;\r\n\r\n // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n // new Decimal(2.32456).pow('2087987436534566.46411')\r\n // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n k = Math.min(12, (e + '').length);\r\n\r\n // r = x^y = exp(yln(x))\r\n r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n if (r.d) {\r\n\r\n // Truncate to the required precision plus five rounding digits.\r\n r = finalise(r, pr + 5, 1);\r\n\r\n // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n // the result.\r\n if (checkRoundingDigits(r.d, pr, rm)) {\r\n e = pr + 10;\r\n\r\n // Truncate to the increased precision plus five rounding digits.\r\n r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n r = finalise(r, pr + 1, 0);\r\n }\r\n }\r\n }\r\n\r\n r.s = s;\r\n external = true;\r\n Ctor.rounding = rm;\r\n\r\n return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n /\r\nP.toPrecision = function (sd, rm) {\r\n var str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n\r\n x = finalise(new Ctor(x), sd, rm);\r\n str = finiteToString(x, sd <= x.e \|\| x.e <= Ctor.toExpNeg, sd);\r\n }\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal rounded to a maximum of `sd`\r\n * significant digits using rounding mode `rm`, or to `precision` and `rounding` respectively if\r\n * omitted.\r\n \r\n [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n \r\n 'toSD() digits out of range: {sd}'\r\n * 'toSD() digits not an integer: {sd}'\r\n * 'toSD() rounding mode not an integer: {rm}'\r\n * 'toSD() rounding mode out of range: {rm}'\r\n \r\n /\r\nP.toSignificantDigits = P.toSD = function (sd, rm) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n }\r\n\r\n return finalise(new Ctor(x), sd, rm);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal.\r\n \r\n Return exponential notation if this Decimal has a positive exponent equal to or greater than\r\n * `toExpPos`, or a negative exponent equal to or less than `toExpNeg`.\r\n \r\n /\r\nP.toString = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() && !x.isZero() ? '-' + str : str;\r\n};\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of this Decimal truncated to a whole number.\r\n \r\n /\r\nP.truncated = P.trunc = function () {\r\n return finalise(new this.constructor(this), this.e + 1, 1);\r\n};\r\n\r\n\r\n/\r\n Return a string representing the value of this Decimal.\r\n * Unlike `toString`, negative zero will include the minus sign.\r\n \r\n /\r\nP.valueOf = P.toJSON = function () {\r\n var x = this,\r\n Ctor = x.constructor,\r\n str = finiteToString(x, x.e <= Ctor.toExpNeg \|\| x.e >= Ctor.toExpPos);\r\n\r\n return x.isNeg() ? '-' + str : str;\r\n};\r\n\r\n\r\n// Helper functions for Decimal.prototype (P) and/or Decimal methods, and their callers.\r\n\r\n\r\n/\r\n digitsToString P.cubeRoot, P.logarithm, P.squareRoot, P.toFraction, P.toPower,\r\n * finiteToString, naturalExponential, naturalLogarithm\r\n * checkInt32 P.toDecimalPlaces, P.toExponential, P.toFixed, P.toNearest,\r\n * P.toPrecision, P.toSignificantDigits, toStringBinary, random\r\n * checkRoundingDigits P.logarithm, P.toPower, naturalExponential, naturalLogarithm\r\n * convertBase toStringBinary, parseOther\r\n * cos P.cos\r\n * divide P.atanh, P.cubeRoot, P.dividedBy, P.dividedToIntegerBy,\r\n * P.logarithm, P.modulo, P.squareRoot, P.tan, P.tanh, P.toFraction,\r\n * P.toNearest, toStringBinary, naturalExponential, naturalLogarithm,\r\n * taylorSeries, atan2, parseOther\r\n * finalise P.absoluteValue, P.atan, P.atanh, P.ceil, P.cos, P.cosh,\r\n * P.cubeRoot, P.dividedToIntegerBy, P.floor, P.logarithm, P.minus,\r\n * P.modulo, P.negated, P.plus, P.round, P.sin, P.sinh, P.squareRoot,\r\n * P.tan, P.times, P.toDecimalPlaces, P.toExponential, P.toFixed,\r\n * P.toNearest, P.toPower, P.toPrecision, P.toSignificantDigits,\r\n * P.truncated, divide, getLn10, getPi, naturalExponential,\r\n * naturalLogarithm, ceil, floor, round, trunc\r\n * finiteToString P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf,\r\n * toStringBinary\r\n * getBase10Exponent P.minus, P.plus, P.times, parseOther\r\n * getLn10 P.logarithm, naturalLogarithm\r\n * getPi P.acos, P.asin, P.atan, toLessThanHalfPi, atan2\r\n * getPrecision P.precision, P.toFraction\r\n * getZeroString digitsToString, finiteToString\r\n * intPow P.toPower, parseOther\r\n * isOdd toLessThanHalfPi\r\n * maxOrMin max, min\r\n * naturalExponential P.naturalExponential, P.toPower\r\n * naturalLogarithm P.acosh, P.asinh, P.atanh, P.logarithm, P.naturalLogarithm,\r\n * P.toPower, naturalExponential\r\n * nonFiniteToString finiteToString, toStringBinary\r\n * parseDecimal Decimal\r\n * parseOther Decimal\r\n * sin P.sin\r\n * taylorSeries P.cosh, P.sinh, cos, sin\r\n * toLessThanHalfPi P.cos, P.sin\r\n * toStringBinary P.toBinary, P.toHexadecimal, P.toOctal\r\n * truncate intPow\r\n \r\n Throws: P.logarithm, P.precision, P.toFraction, checkInt32, getLn10, getPi,\r\n * naturalLogarithm, config, parseOther, random, Decimal\r\n /\r\n\r\n\r\nfunction digitsToString(d) {\r\n var i, k, ws,\r\n indexOfLastWord = d.length - 1,\r\n str = '',\r\n w = d[0];\r\n\r\n if (indexOfLastWord > 0) {\r\n str += w;\r\n for (i = 1; i < indexOfLastWord; i++) {\r\n ws = d[i] + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n str += ws;\r\n }\r\n\r\n w = d[i];\r\n ws = w + '';\r\n k = LOG_BASE - ws.length;\r\n if (k) str += getZeroString(k);\r\n } else if (w === 0) {\r\n return '0';\r\n }\r\n\r\n // Remove trailing zeros of last w.\r\n for (; w % 10 === 0;) w /= 10;\r\n\r\n return str + w;\r\n}\r\n\r\n\r\nfunction checkInt32(i, min, max) {\r\n if (i !== ~~i \|\| i < min \|\| i > max) {\r\n throw Error(invalidArgument + i);\r\n }\r\n}\r\n\r\n\r\n/\r\n * Check 5 rounding digits if `repeating` is null, 4 otherwise.\r\n * `repeating == null` if caller is `log` or `pow`,\r\n * `repeating != null` if caller is `naturalLogarithm` or `naturalExponential`.\r\n /\r\nfunction checkRoundingDigits(d, i, rm, repeating) {\r\n var di, k, r, rd;\r\n\r\n // Get the length of the first word of the array d.\r\n for (k = d[0]; k >= 10; k /= 10) --i;\r\n\r\n // Is the rounding digit in the first word of d?\r\n if (--i < 0) {\r\n i += LOG_BASE;\r\n di = 0;\r\n } else {\r\n di = Math.ceil((i + 1) / LOG_BASE);\r\n i %= LOG_BASE;\r\n }\r\n\r\n // i is the index (0 - 6) of the rounding digit.\r\n // E.g. if within the word 3487563 the first rounding digit is 5,\r\n // then i = 4, k = 1000, rd = 3487563 % 1000 = 563\r\n k = mathpow(10, LOG_BASE - i);\r\n rd = d[di] % k \| 0;\r\n\r\n if (repeating == null) {\r\n if (i < 3) {\r\n if (i == 0) rd = rd / 100 \| 0;\r\n else if (i == 1) rd = rd / 10 \| 0;\r\n r = rm < 4 && rd == 99999 \|\| rm > 3 && rd == 49999 \|\| rd == 50000 \|\| rd == 0;\r\n } else {\r\n r = (rm < 4 && rd + 1 == k \|\| rm > 3 && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 100 \| 0) == mathpow(10, i - 2) - 1 \|\|\r\n (rd == k / 2 \|\| rd == 0) && (d[di + 1] / k / 100 \| 0) == 0;\r\n }\r\n } else {\r\n if (i < 4) {\r\n if (i == 0) rd = rd / 1000 \| 0;\r\n else if (i == 1) rd = rd / 100 \| 0;\r\n else if (i == 2) rd = rd / 10 \| 0;\r\n r = (repeating \|\| rm < 4) && rd == 9999 \|\| !repeating && rm > 3 && rd == 4999;\r\n } else {\r\n r = ((repeating \|\| rm < 4) && rd + 1 == k \|\|\r\n (!repeating && rm > 3) && rd + 1 == k / 2) &&\r\n (d[di + 1] / k / 1000 \| 0) == mathpow(10, i - 3) - 1;\r\n }\r\n }\r\n\r\n return r;\r\n}\r\n\r\n\r\n// Convert string of `baseIn` to an array of numbers of `baseOut`.\r\n// Eg. convertBase('255', 10, 16) returns [15, 15].\r\n// Eg. convertBase('ff', 16, 10) returns [2, 5, 5].\r\nfunction convertBase(str, baseIn, baseOut) {\r\n var j,\r\n arr = [0],\r\n arrL,\r\n i = 0,\r\n strL = str.length;\r\n\r\n for (; i < strL;) {\r\n for (arrL = arr.length; arrL--;) arr[arrL] = baseIn;\r\n arr[0] += NUMERALS.indexOf(str.charAt(i++));\r\n for (j = 0; j < arr.length; j++) {\r\n if (arr[j] > baseOut - 1) {\r\n if (arr[j + 1] === void 0) 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\r\n/\r\n cos(x) = 1 - x^2/2! + x^4/4! - ...\r\n * \|x\| < pi/2\r\n \r\n /\r\nfunction cosine(Ctor, x) {\r\n var k, len, y;\r\n\r\n if (x.isZero()) return x;\r\n\r\n // Argument reduction: cos(4x) = 8(cos^4(x) - cos^2(x)) + 1\r\n // i.e. cos(x) = 8(cos^4(x/4) - cos^2(x/4)) + 1\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n len = x.d.length;\r\n if (len < 32) {\r\n k = Math.ceil(len / 3);\r\n y = (1 / tinyPow(4, k)).toString();\r\n } else {\r\n k = 16;\r\n y = '2.3283064365386962890625e-10';\r\n }\r\n\r\n Ctor.precision += k;\r\n\r\n x = taylorSeries(Ctor, 1, x.times(y), new Ctor(1));\r\n\r\n // Reverse argument reduction\r\n for (var i = k; i--;) {\r\n var cos2x = x.times(x);\r\n x = cos2x.times(cos2x).minus(cos2x).times(8).plus(1);\r\n }\r\n\r\n Ctor.precision -= k;\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n Perform division in the specified base.\r\n /\r\nvar divide = (function () {\r\n\r\n // Assumes non-zero x and k, and hence non-zero result.\r\n function multiplyInteger(x, k, base) {\r\n var temp,\r\n carry = 0,\r\n i = x.length;\r\n\r\n for (x = x.slice(); i--;) {\r\n temp = x[i] k + carry;\r\n x[i] = temp % base \| 0;\r\n carry = temp / base \| 0;\r\n }\r\n\r\n if (carry) x.unshift(carry);\r\n\r\n return x;\r\n }\r\n\r\n function compare(a, b, aL, bL) {\r\n var i, r;\r\n\r\n if (aL != bL) {\r\n r = aL > bL ? 1 : -1;\r\n } else {\r\n for (i = r = 0; i < aL; i++) {\r\n if (a[i] != b[i]) {\r\n r = a[i] > b[i] ? 1 : -1;\r\n break;\r\n }\r\n }\r\n }\r\n\r\n return r;\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.shift();\r\n }\r\n\r\n return function (x, y, pr, rm, dp, base) {\r\n var cmp, e, i, k, logBase, more, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0,\r\n yL, yz,\r\n Ctor = x.constructor,\r\n sign = x.s == y.s ? 1 : -1,\r\n xd = x.d,\r\n yd = y.d;\r\n\r\n // Either NaN, Infinity or 0?\r\n if (!xd \|\| !xd[0] \|\| !yd \|\| !yd[0]) {\r\n\r\n return new Ctor(// Return NaN if either NaN, or both Infinity or 0.\r\n !x.s \|\| !y.s \|\| (xd ? yd && xd[0] == yd[0] : !yd) ? NaN :\r\n\r\n // Return ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n xd && xd[0] == 0 \|\| !yd ? sign * 0 : sign / 0);\r\n }\r\n\r\n if (base) {\r\n logBase = 1;\r\n e = x.e - y.e;\r\n } else {\r\n base = BASE;\r\n logBase = LOG_BASE;\r\n e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n }\r\n\r\n yL = yd.length;\r\n xL = xd.length;\r\n q = new Ctor(sign);\r\n qd = q.d = [];\r\n\r\n // Result exponent may be one less than e.\r\n // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n for (i = 0; yd[i] == (xd[i] \|\| 0); i++);\r\n\r\n if (yd[i] > (xd[i] \|\| 0)) e--;\r\n\r\n if (pr == null) {\r\n sd = pr = Ctor.precision;\r\n rm = Ctor.rounding;\r\n } else if (dp) {\r\n sd = pr + (x.e - y.e) + 1;\r\n } else {\r\n sd = pr;\r\n }\r\n\r\n if (sd < 0) {\r\n qd.push(1);\r\n more = true;\r\n } else {\r\n\r\n // Convert precision in number of base 10 digits to base 1e7 digits.\r\n sd = sd / logBase + 2 \| 0;\r\n i = 0;\r\n\r\n // divisor < 1e7\r\n if (yL == 1) {\r\n k = 0;\r\n yd = yd[0];\r\n sd++;\r\n\r\n // k is the carry.\r\n for (; (i < xL \|\| k) && sd--; i++) {\r\n t = k * base + (xd[i] \|\| 0);\r\n qd[i] = t / yd \| 0;\r\n k = t % yd \| 0;\r\n }\r\n\r\n more = k \|\| i < xL;\r\n\r\n // divisor >= 1e7\r\n } else {\r\n\r\n // Normalise xd and yd so highest order digit of yd is >= base/2\r\n k = base / (yd[0] + 1) \| 0;\r\n\r\n if (k > 1) {\r\n yd = multiplyInteger(yd, k, base);\r\n xd = multiplyInteger(xd, k, base);\r\n yL = yd.length;\r\n xL = xd.length;\r\n }\r\n\r\n xi = yL;\r\n rem = xd.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\r\n yz = yd.slice();\r\n yz.unshift(0);\r\n yd0 = yd[0];\r\n\r\n if (yd[1] >= base / 2) ++yd0;\r\n\r\n do {\r\n k = 0;\r\n\r\n // Compare divisor and remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < remainder.\r\n if (cmp < 0) {\r\n\r\n // Calculate trial digit, k.\r\n rem0 = rem[0];\r\n if (yL != remL) rem0 = rem0 * base + (rem[1] \|\| 0);\r\n\r\n // k will be how many times the divisor goes into the current remainder.\r\n k = rem0 / yd0 \| 0;\r\n\r\n // Algorithm:\r\n // 1. product = divisor * trial digit (k)\r\n // 2. if product > remainder: product -= divisor, k--\r\n // 3. remainder -= product\r\n // 4. if product was < remainder at 2:\r\n // 5. compare new remainder and divisor\r\n // 6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n if (k > 1) {\r\n if (k >= base) k = base - 1;\r\n\r\n // product = divisor * trial digit.\r\n prod = multiplyInteger(yd, k, base);\r\n prodL = prod.length;\r\n remL = rem.length;\r\n\r\n // Compare product and remainder.\r\n cmp = compare(prod, rem, prodL, remL);\r\n\r\n // product > remainder.\r\n if (cmp == 1) {\r\n k--;\r\n\r\n // Subtract divisor from product.\r\n subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n }\r\n } else {\r\n\r\n // cmp is -1.\r\n // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n if (k == 0) cmp = k = 1;\r\n prod = yd.slice();\r\n }\r\n\r\n prodL = prod.length;\r\n if (prodL < remL) prod.unshift(0);\r\n\r\n // Subtract product from remainder.\r\n subtract(rem, prod, remL, base);\r\n\r\n // If product was < previous remainder.\r\n if (cmp == -1) {\r\n remL = rem.length;\r\n\r\n // Compare divisor and new remainder.\r\n cmp = compare(yd, rem, yL, remL);\r\n\r\n // If divisor < new remainder, subtract divisor from remainder.\r\n if (cmp < 1) {\r\n k++;\r\n\r\n // Subtract divisor from remainder.\r\n subtract(rem, yL < remL ? yz : yd, remL, base);\r\n }\r\n }\r\n\r\n remL = rem.length;\r\n } else if (cmp === 0) {\r\n k++;\r\n rem = [0];\r\n } // if cmp === 1, k will be 0\r\n\r\n // Add the next digit, k, to the result array.\r\n qd[i++] = k;\r\n\r\n // Update the remainder.\r\n if (cmp && rem[0]) {\r\n rem[remL++] = xd[xi] \|\| 0;\r\n } else {\r\n rem = [xd[xi]];\r\n remL = 1;\r\n }\r\n\r\n } while ((xi++ < xL \|\| rem[0] !== void 0) && sd--);\r\n\r\n more = rem[0] !== void 0;\r\n }\r\n\r\n // Leading zero?\r\n if (!qd[0]) qd.shift();\r\n }\r\n\r\n // logBase is 1 when divide is being used for base conversion.\r\n if (logBase == 1) {\r\n q.e = e;\r\n inexact = more;\r\n } else {\r\n\r\n // To calculate q.e, first get the number of digits of qd[0].\r\n for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n q.e = i + e * logBase - 1;\r\n\r\n finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n }\r\n\r\n return q;\r\n };\r\n})();\r\n\r\n\r\n/\r\n Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n /\r\n function finalise(x, sd, rm, isTruncated) {\r\n var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n Ctor = x.constructor;\r\n\r\n // Don't round if sd is null or undefined.\r\n out: if (sd != null) {\r\n xd = x.d;\r\n\r\n // Infinity/NaN.\r\n if (!xd) return x;\r\n\r\n // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n // w: the word of xd containing rd, a base 1e7 number.\r\n // xdi: the index of w within xd.\r\n // digits: the number of digits of w.\r\n // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n // they had leading zeros)\r\n // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n // Get the length of the first word of the digits array xd.\r\n for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n i = sd - digits;\r\n\r\n // Is the rounding digit in the first word of xd?\r\n if (i < 0) {\r\n i += LOG_BASE;\r\n j = sd;\r\n w = xd[xdi = 0];\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = w / mathpow(10, digits - j - 1) % 10 \| 0;\r\n } else {\r\n xdi = Math.ceil((i + 1) / LOG_BASE);\r\n k = xd.length;\r\n if (xdi >= k) {\r\n if (isTruncated) {\r\n\r\n // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n for (; k++ <= xdi;) xd.push(0);\r\n w = rd = 0;\r\n digits = 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 w = k = xd[xdi];\r\n\r\n // Get the number of digits of w.\r\n for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n // Get the index of rd within w.\r\n i %= LOG_BASE;\r\n\r\n // Get the index of rd within w, adjusted for leading zeros.\r\n // The number of leading zeros of w is given by LOG_BASE - digits.\r\n j = i - LOG_BASE + digits;\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 \| 0;\r\n }\r\n }\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n isTruncated = isTruncated \|\| sd < 0 \|\|\r\n xd[xdi + 1] !== void 0 \|\| (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n // will give 714.\r\n\r\n roundUp = rm < 4\r\n ? (rd \|\| isTruncated) && (rm == 0 \|\| rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 \|\| rd == 5 && (rm == 4 \|\| isTruncated \|\| 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 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 \|\|\r\n rm == (x.s < 0 ? 8 : 7));\r\n\r\n if (sd < 1 \|\| !xd[0]) {\r\n xd.length = 0;\r\n if (roundUp) {\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 xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n x.e = -sd \|\| 0;\r\n } else {\r\n\r\n // Zero.\r\n xd[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 xd.length = xdi;\r\n k = 1;\r\n xdi--;\r\n } else {\r\n xd.length = xdi + 1;\r\n k = mathpow(10, 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 w.\r\n xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) \| 0) k : 0;\r\n }\r\n\r\n if (roundUp) {\r\n for (;;) {\r\n\r\n // Is the digit to be rounded up in the first word of xd?\r\n if (xdi == 0) {\r\n\r\n // i will be the length of xd[0] before k is added.\r\n for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n j = xd[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 (xd[0] == BASE) xd[0] = 1;\r\n }\r\n\r\n break;\r\n } else {\r\n xd[xdi] += k;\r\n if (xd[xdi] != BASE) break;\r\n xd[xdi--] = 0;\r\n k = 1;\r\n }\r\n }\r\n }\r\n\r\n // Remove trailing zeros.\r\n for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n }\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > Ctor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < Ctor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // Ctor.underflow = true;\r\n } // else Ctor.underflow = false;\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\nfunction finiteToString(x, isExp, sd) {\r\n if (!x.isFinite()) return nonFiniteToString(x);\r\n var k,\r\n e = x.e,\r\n str = digitsToString(x.d),\r\n len = str.length;\r\n\r\n if (isExp) {\r\n if (sd && (k = sd - len) > 0) {\r\n str = str.charAt(0) + '.' + str.slice(1) + getZeroString(k);\r\n } else if (len > 1) {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n\r\n str = str + (x.e < 0 ? 'e' : 'e+') + x.e;\r\n } else if (e < 0) {\r\n str = '0.' + getZeroString(-e - 1) + str;\r\n if (sd && (k = sd - len) > 0) str += getZeroString(k);\r\n } else if (e >= len) {\r\n str += getZeroString(e + 1 - len);\r\n if (sd && (k = sd - e - 1) > 0) str = str + '.' + getZeroString(k);\r\n } else {\r\n if ((k = e + 1) < len) str = str.slice(0, k) + '.' + str.slice(k);\r\n if (sd && (k = sd - len) > 0) {\r\n if (e + 1 === len) str += '.';\r\n str += getZeroString(k);\r\n }\r\n }\r\n\r\n return str;\r\n}\r\n\r\n\r\n// Calculate the base 10 exponent from the base 1e7 exponent.\r\nfunction getBase10Exponent(digits, e) {\r\n var w = digits[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for ( e = LOG_BASE; w >= 10; w /= 10) e++;\r\n return e;\r\n}\r\n\r\n\r\nfunction getLn10(Ctor, sd, pr) {\r\n if (sd > LN10_PRECISION) {\r\n\r\n // Reset global state in case the exception is caught.\r\n external = true;\r\n if (pr) Ctor.precision = pr;\r\n throw Error(precisionLimitExceeded);\r\n }\r\n return finalise(new Ctor(LN10), sd, 1, true);\r\n}\r\n\r\n\r\nfunction getPi(Ctor, sd, rm) {\r\n if (sd > PI_PRECISION) throw Error(precisionLimitExceeded);\r\n return finalise(new Ctor(PI), sd, rm, true);\r\n}\r\n\r\n\r\nfunction getPrecision(digits) {\r\n var w = digits.length - 1,\r\n len = w LOG_BASE + 1;\r\n\r\n w = digits[w];\r\n\r\n // If non-zero...\r\n if (w) {\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n for (; w % 10 == 0; w /= 10) len--;\r\n\r\n // Add the number of digits of the first word.\r\n for (w = digits[0]; w >= 10; w /= 10) len++;\r\n }\r\n\r\n return len;\r\n}\r\n\r\n\r\nfunction getZeroString(k) {\r\n var zs = '';\r\n for (; k--;) zs += '0';\r\n return zs;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the value of Decimal `x` to the power `n`, where `n` is an\r\n * integer of type number.\r\n \r\n Implements 'exponentiation by squaring'. Called by `pow` and `parseOther`.\r\n \r\n /\r\nfunction intPow(Ctor, x, n, pr) {\r\n var isTruncated,\r\n r = new Ctor(1),\r\n\r\n // Max n of 9007199254740991 takes 53 loop iterations.\r\n // Maximum digits array length; leaves [28, 34] guard digits.\r\n k = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n external = false;\r\n\r\n for (;;) {\r\n if (n % 2) {\r\n r = r.times(x);\r\n if (truncate(r.d, k)) isTruncated = true;\r\n }\r\n\r\n n = mathfloor(n / 2);\r\n if (n === 0) {\r\n\r\n // To ensure correct rounding when r.d is truncated, increment the last word if it is zero.\r\n n = r.d.length - 1;\r\n if (isTruncated && r.d[n] === 0) ++r.d[n];\r\n break;\r\n }\r\n\r\n x = x.times(x);\r\n truncate(x.d, k);\r\n }\r\n\r\n external = true;\r\n\r\n return r;\r\n}\r\n\r\n\r\nfunction isOdd(n) {\r\n return n.d[n.d.length - 1] & 1;\r\n}\r\n\r\n\r\n/\r\n Handle `max` and `min`. `ltgt` is 'lt' or 'gt'.\r\n /\r\nfunction maxOrMin(Ctor, args, ltgt) {\r\n var y,\r\n x = new Ctor(args[0]),\r\n i = 0;\r\n\r\n for (; ++i < args.length;) {\r\n y = new Ctor(args[i]);\r\n if (!y.s) {\r\n x = y;\r\n break;\r\n } else if (x[ltgt](y)) {\r\n x = y;\r\n }\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the natural exponential of `x` rounded to `sd` significant\r\n * digits.\r\n \r\n Taylor/Maclaurin series.\r\n \r\n exp(x) = x^0/0! + x^1/1! + x^2/2! + x^3/3! + ...\r\n \r\n Argument reduction:\r\n * Repeat x = x / 32, k += 5, until \|x\| < 0.1\r\n * exp(x) = exp(x / 2^k)^(2^k)\r\n \r\n Previously, the argument was initially reduced by\r\n * exp(x) = exp(r) * 10^k where r = x - k * ln10, k = floor(x / ln10)\r\n * to first put r in the range [0, ln10], before dividing by 32 until \|x\| < 0.1, but this was\r\n * found to be slower than just dividing repeatedly by 32 as above.\r\n \r\n Max integer argument: exp('20723265836946413') = 6.3e+9000000000000000\r\n * Min integer argument: exp('-20723265836946411') = 1.2e-9000000000000000\r\n * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n \r\n exp(Infinity) = Infinity\r\n * exp(-Infinity) = 0\r\n * exp(NaN) = NaN\r\n * exp(±0) = 1\r\n \r\n exp(x) is non-terminating for any finite, non-zero x.\r\n \r\n The result will always be correctly rounded.\r\n \r\n /\r\nfunction naturalExponential(x, sd) {\r\n var denominator, guard, j, pow, sum, t, wpr,\r\n rep = 0,\r\n i = 0,\r\n k = 0,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // 0/NaN/Infinity?\r\n if (!x.d \|\| !x.d[0] \|\| x.e > 17) {\r\n\r\n return new Ctor(x.d\r\n ? !x.d[0] ? 1 : x.s < 0 ? 0 : 1 / 0\r\n : x.s ? x.s < 0 ? 0 : x : 0 / 0);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n t = new Ctor(0.03125);\r\n\r\n // while abs(x) >= 0.1\r\n while (x.e > -2) {\r\n\r\n // x = x / 2^5\r\n x = x.times(t);\r\n k += 5;\r\n }\r\n\r\n // Use 2 * log10(2^k) + 5 (empirically derived) to estimate the increase in precision\r\n // necessary to ensure the first 4 rounding digits are correct.\r\n guard = Math.log(mathpow(2, k)) / Math.LN10 * 2 + 5 \| 0;\r\n wpr += guard;\r\n denominator = pow = sum = new Ctor(1);\r\n Ctor.precision = wpr;\r\n\r\n for (;;) {\r\n pow = finalise(pow.times(x), wpr, 1);\r\n denominator = denominator.times(++i);\r\n t = sum.plus(divide(pow, denominator, wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n j = k;\r\n while (j--) sum = finalise(sum.times(sum), wpr, 1);\r\n\r\n // Check to see if the first 4 rounding digits are [49]999.\r\n // If so, repeat the summation with a higher precision, otherwise\r\n // e.g. with precision: 18, rounding: 1\r\n // exp(18.404272462595034083567793919843761) = 98372560.1229999999 (should be 98372560.123)\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n\r\n if (rep < 3 && checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += 10;\r\n denominator = pow = t = new Ctor(1);\r\n i = 0;\r\n rep++;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n }\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of `x` rounded to `sd` significant\r\n * digits.\r\n \r\n ln(-n) = NaN\r\n * ln(0) = -Infinity\r\n * ln(-0) = -Infinity\r\n * ln(1) = 0\r\n * ln(Infinity) = Infinity\r\n * ln(-Infinity) = NaN\r\n * ln(NaN) = NaN\r\n \r\n ln(n) (n != 1) is non-terminating.\r\n \r\n /\r\nfunction naturalLogarithm(y, sd) {\r\n var c, c0, denominator, e, numerator, rep, sum, t, wpr, x1, x2,\r\n n = 1,\r\n guard = 10,\r\n x = y,\r\n xd = x.d,\r\n Ctor = x.constructor,\r\n rm = Ctor.rounding,\r\n pr = Ctor.precision;\r\n\r\n // Is x negative or Infinity, NaN, 0 or 1?\r\n if (x.s < 0 \|\| !xd \|\| !xd[0] \|\| !x.e && xd[0] == 1 && xd.length == 1) {\r\n return new Ctor(xd && !xd[0] ? -1 / 0 : x.s != 1 ? NaN : xd ? 0 : x);\r\n }\r\n\r\n if (sd == null) {\r\n external = false;\r\n wpr = pr;\r\n } else {\r\n wpr = sd;\r\n }\r\n\r\n Ctor.precision = wpr += guard;\r\n c = digitsToString(xd);\r\n c0 = c.charAt(0);\r\n\r\n if (Math.abs(e = x.e) < 1.5e15) {\r\n\r\n // Argument reduction.\r\n // The series converges faster the closer the argument is to 1, so using\r\n // ln(a^b) = b * ln(a), ln(a) = ln(a^b) / b\r\n // multiply the argument by itself until the leading digits of the significand are 7, 8, 9,\r\n // 10, 11, 12 or 13, recording the number of multiplications so the sum of the series can\r\n // later be divided by this number, then separate out the power of 10 using\r\n // ln(a10^b) = ln(a) + bln(10).\r\n\r\n // max n is 21 (gives 0.9, 1.0 or 1.1) (9e15 / 21 = 4.2e14).\r\n //while (c0 < 9 && c0 != 1 \|\| c0 == 1 && c.charAt(1) > 1) {\r\n // max n is 6 (gives 0.7 - 1.3)\r\n while (c0 < 7 && c0 != 1 \|\| c0 == 1 && c.charAt(1) > 3) {\r\n x = x.times(y);\r\n c = digitsToString(x.d);\r\n c0 = c.charAt(0);\r\n n++;\r\n }\r\n\r\n e = x.e;\r\n\r\n if (c0 > 1) {\r\n x = new Ctor('0.' + c);\r\n e++;\r\n } else {\r\n x = new Ctor(c0 + '.' + c.slice(1));\r\n }\r\n } else {\r\n\r\n // The argument reduction method above may result in overflow if the argument y is a massive\r\n // number with exponent >= 1500000000000000 (9e15 / 6 = 1.5e15), so instead recall this\r\n // function using ln(x10^e) = ln(x) + eln(10).\r\n t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n x = naturalLogarithm(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n Ctor.precision = pr;\r\n\r\n return sd == null ? finalise(x, pr, rm, external = true) : x;\r\n }\r\n\r\n // x1 is x reduced to a value near 1.\r\n x1 = x;\r\n\r\n // Taylor series.\r\n // ln(y) = ln((1 + x)/(1 - x)) = 2(x + x^3/3 + x^5/5 + x^7/7 + ...)\r\n // where x = (y - 1)/(y + 1) (\|x\| < 1)\r\n sum = numerator = x = divide(x.minus(1), x.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = 3;\r\n\r\n for (;;) {\r\n numerator = finalise(numerator.times(x2), wpr, 1);\r\n t = sum.plus(divide(numerator, new Ctor(denominator), wpr, 1));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n sum = sum.times(2);\r\n\r\n // Reverse the argument reduction. Check that e is not 0 because, besides preventing an\r\n // unnecessary calculation, -0 + 0 = +0 and to ensure correct rounding -0 needs to stay -0.\r\n if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n sum = divide(sum, new Ctor(n), wpr, 1);\r\n\r\n // Is rm > 3 and the first 4 rounding digits 4999, or rm < 4 (or the summation has\r\n // been repeated previously) and the first 4 rounding digits 9999?\r\n // If so, restart the summation with a higher precision, otherwise\r\n // e.g. with precision: 12, rounding: 1\r\n // ln(135520028.6126091714265381533) = 18.7246299999 when it should be 18.72463.\r\n // `wpr - guard` is the index of first rounding digit.\r\n if (sd == null) {\r\n if (checkRoundingDigits(sum.d, wpr - guard, rm, rep)) {\r\n Ctor.precision = wpr += guard;\r\n t = numerator = x = divide(x1.minus(1), x1.plus(1), wpr, 1);\r\n x2 = finalise(x.times(x), wpr, 1);\r\n denominator = rep = 1;\r\n } else {\r\n return finalise(sum, Ctor.precision = pr, rm, external = true);\r\n }\r\n } else {\r\n Ctor.precision = pr;\r\n return sum;\r\n }\r\n }\r\n\r\n sum = t;\r\n denominator += 2;\r\n }\r\n}\r\n\r\n\r\n// ±Infinity, NaN.\r\nfunction nonFiniteToString(x) {\r\n // Unsigned.\r\n return String(x.s * x.s / 0);\r\n}\r\n\r\n\r\n/\r\n Parse the value of a new Decimal `x` from string `str`.\r\n /\r\nfunction parseDecimal(x, str) {\r\n var e, i, len;\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 // 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 - 1) === 48; --len);\r\n str = str.slice(i, len);\r\n\r\n if (str) {\r\n len -= i;\r\n x.e = e = e - i - 1;\r\n x.d = [];\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 word of the digits array.\r\n i = (e + 1) % LOG_BASE;\r\n if (e < 0) i += LOG_BASE;\r\n\r\n if (i < len) {\r\n if (i) x.d.push(+str.slice(0, i));\r\n for (len -= LOG_BASE; i < len;) x.d.push(+str.slice(i, i += LOG_BASE));\r\n str = str.slice(i);\r\n i = LOG_BASE - str.length;\r\n } else {\r\n i -= len;\r\n }\r\n\r\n for (; i--;) str += '0';\r\n x.d.push(+str);\r\n\r\n if (external) {\r\n\r\n // Overflow?\r\n if (x.e > x.constructor.maxE) {\r\n\r\n // Infinity.\r\n x.d = null;\r\n x.e = NaN;\r\n\r\n // Underflow?\r\n } else if (x.e < x.constructor.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n // x.constructor.underflow = true;\r\n } // else x.constructor.underflow = false;\r\n }\r\n } else {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n * Parse the value of a new Decimal `x` from a string `str`, which is not a decimal value.\r\n /\r\nfunction parseOther(x, str) {\r\n var base, Ctor, divisor, i, isFloat, len, p, xd, xe;\r\n\r\n if (str.indexOf('_') > -1) {\r\n str = str.replace(/(\\d)_(?=\\d)/g, '$1');\r\n if (isDecimal.test(str)) return parseDecimal(x, str);\r\n } else if (str === 'Infinity' \|\| str === 'NaN') {\r\n if (!+str) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return x;\r\n }\r\n\r\n if (isHex.test(str)) {\r\n base = 16;\r\n str = str.toLowerCase();\r\n } else if (isBinary.test(str)) {\r\n base = 2;\r\n } else if (isOctal.test(str)) {\r\n base = 8;\r\n } else {\r\n throw Error(invalidArgument + str);\r\n }\r\n\r\n // Is there a binary exponent part?\r\n i = str.search(/p/i);\r\n\r\n if (i > 0) {\r\n p = +str.slice(i + 1);\r\n str = str.substring(2, i);\r\n } else {\r\n str = str.slice(2);\r\n }\r\n\r\n // Convert `str` as an integer then divide the result by `base` raised to a power such that the\r\n // fraction part will be restored.\r\n i = str.indexOf('.');\r\n isFloat = i >= 0;\r\n Ctor = x.constructor;\r\n\r\n if (isFloat) {\r\n str = str.replace('.', '');\r\n len = str.length;\r\n i = len - i;\r\n\r\n // log[10](16) = 1.2041... , log[10](88) = 1.9444....\r\n divisor = intPow(Ctor, new Ctor(base), i, i 2);\r\n }\r\n\r\n xd = convertBase(str, base, BASE);\r\n xe = xd.length - 1;\r\n\r\n // Remove trailing zeros.\r\n for (i = xe; xd[i] === 0; --i) xd.pop();\r\n if (i < 0) return new Ctor(x.s * 0);\r\n x.e = getBase10Exponent(xd, xe);\r\n x.d = xd;\r\n external = false;\r\n\r\n // At what precision to perform the division to ensure exact conversion?\r\n // maxDecimalIntegerPartDigitCount = ceil(log[10](b) * otherBaseIntegerPartDigitCount)\r\n // log[10](2) = 0.30103, log[10](8) = 0.90309, log[10](16) = 1.20412\r\n // E.g. ceil(1.2 * 3) = 4, so up to 4 decimal digits are needed to represent 3 hex int digits.\r\n // maxDecimalFractionPartDigitCount = {Hex:4\|Oct:3\|Bin:1} * otherBaseFractionPartDigitCount\r\n // Therefore using 4 * the number of digits of str will always be enough.\r\n if (isFloat) x = divide(x, divisor, len * 4);\r\n\r\n // Multiply by the binary exponent part if present.\r\n if (p) x = x.times(Math.abs(p) < 54 ? mathpow(2, p) : Decimal.pow(2, p));\r\n external = true;\r\n\r\n return x;\r\n}\r\n\r\n\r\n/\r\n sin(x) = x - x^3/3! + x^5/5! - ...\r\n * \|x\| < pi/2\r\n \r\n /\r\nfunction sine(Ctor, x) {\r\n var k,\r\n len = x.d.length;\r\n\r\n if (len < 3) {\r\n return x.isZero() ? x : taylorSeries(Ctor, 2, x, x);\r\n }\r\n\r\n // Argument reduction: sin(5x) = 16sin^5(x) - 20sin^3(x) + 5sin(x)\r\n // i.e. sin(x) = 16sin^5(x/5) - 20sin^3(x/5) + 5sin(x/5)\r\n // and sin(x) = sin(x/5)(5 + sin^2(x/5)(16sin^2(x/5) - 20))\r\n\r\n // Estimate the optimum number of times to use the argument reduction.\r\n k = 1.4 * Math.sqrt(len);\r\n k = k > 16 ? 16 : k \| 0;\r\n\r\n x = x.times(1 / tinyPow(5, k));\r\n x = taylorSeries(Ctor, 2, x, x);\r\n\r\n // Reverse argument reduction\r\n var sin2_x,\r\n d5 = new Ctor(5),\r\n d16 = new Ctor(16),\r\n d20 = new Ctor(20);\r\n for (; k--;) {\r\n sin2_x = x.times(x);\r\n x = x.times(d5.plus(sin2_x.times(d16.times(sin2_x).minus(d20))));\r\n }\r\n\r\n return x;\r\n}\r\n\r\n\r\n// Calculate Taylor series for `cos`, `cosh`, `sin` and `sinh`.\r\nfunction taylorSeries(Ctor, n, x, y, isHyperbolic) {\r\n var j, t, u, x2,\r\n i = 1,\r\n pr = Ctor.precision,\r\n k = Math.ceil(pr / LOG_BASE);\r\n\r\n external = false;\r\n x2 = x.times(x);\r\n u = new Ctor(y);\r\n\r\n for (;;) {\r\n t = divide(u.times(x2), new Ctor(n++ * n++), pr, 1);\r\n u = isHyperbolic ? y.plus(t) : y.minus(t);\r\n y = divide(t.times(x2), new Ctor(n++ * n++), pr, 1);\r\n t = u.plus(y);\r\n\r\n if (t.d[k] !== void 0) {\r\n for (j = k; t.d[j] === u.d[j] && j--;);\r\n if (j == -1) break;\r\n }\r\n\r\n j = u;\r\n u = y;\r\n y = t;\r\n t = j;\r\n i++;\r\n }\r\n\r\n external = true;\r\n t.d.length = k + 1;\r\n\r\n return t;\r\n}\r\n\r\n\r\n// Exponent e must be positive and non-zero.\r\nfunction tinyPow(b, e) {\r\n var n = b;\r\n while (--e) n = b;\r\n return n;\r\n}\r\n\r\n\r\n// Return the absolute value of `x` reduced to less than or equal to half pi.\r\nfunction toLessThanHalfPi(Ctor, x) {\r\n var t,\r\n isNeg = x.s < 0,\r\n pi = getPi(Ctor, Ctor.precision, 1),\r\n halfPi = pi.times(0.5);\r\n\r\n x = x.abs();\r\n\r\n if (x.lte(halfPi)) {\r\n quadrant = isNeg ? 4 : 1;\r\n return x;\r\n }\r\n\r\n t = x.divToInt(pi);\r\n\r\n if (t.isZero()) {\r\n quadrant = isNeg ? 3 : 2;\r\n } else {\r\n x = x.minus(t.times(pi));\r\n\r\n // 0 <= x < pi\r\n if (x.lte(halfPi)) {\r\n quadrant = isOdd(t) ? (isNeg ? 2 : 3) : (isNeg ? 4 : 1);\r\n return x;\r\n }\r\n\r\n quadrant = isOdd(t) ? (isNeg ? 1 : 4) : (isNeg ? 3 : 2);\r\n }\r\n\r\n return x.minus(pi).abs();\r\n}\r\n\r\n\r\n/\r\n * Return the value of Decimal `x` as a string in base `baseOut`.\r\n \r\n If the optional `sd` argument is present include a binary exponent suffix.\r\n /\r\nfunction toStringBinary(x, baseOut, sd, rm) {\r\n var base, e, i, k, len, roundUp, str, xd, y,\r\n Ctor = x.constructor,\r\n isExp = sd !== void 0;\r\n\r\n if (isExp) {\r\n checkInt32(sd, 1, MAX_DIGITS);\r\n if (rm === void 0) rm = Ctor.rounding;\r\n else checkInt32(rm, 0, 8);\r\n } else {\r\n sd = Ctor.precision;\r\n rm = Ctor.rounding;\r\n }\r\n\r\n if (!x.isFinite()) {\r\n str = nonFiniteToString(x);\r\n } else {\r\n str = finiteToString(x);\r\n i = str.indexOf('.');\r\n\r\n // Use exponential notation according to `toExpPos` and `toExpNeg`? No, but if required:\r\n // maxBinaryExponent = floor((decimalExponent + 1) log[2](10))\r\n // minBinaryExponent = floor(decimalExponent * log[2](10))\r\n // log[2](10) = 3.321928094887362347870319429489390175864\r\n\r\n if (isExp) {\r\n base = 2;\r\n if (baseOut == 16) {\r\n sd = sd * 4 - 3;\r\n } else if (baseOut == 8) {\r\n sd = sd * 3 - 2;\r\n }\r\n } else {\r\n base = baseOut;\r\n }\r\n\r\n // Convert the number as an integer then divide the result by its base raised to a power such\r\n // that the fraction part will be restored.\r\n\r\n // Non-integer.\r\n if (i >= 0) {\r\n str = str.replace('.', '');\r\n y = new Ctor(1);\r\n y.e = str.length - i;\r\n y.d = convertBase(finiteToString(y), 10, base);\r\n y.e = y.d.length;\r\n }\r\n\r\n xd = convertBase(str, 10, base);\r\n e = len = xd.length;\r\n\r\n // Remove trailing zeros.\r\n for (; xd[--len] == 0;) xd.pop();\r\n\r\n if (!xd[0]) {\r\n str = isExp ? '0p+0' : '0';\r\n } else {\r\n if (i < 0) {\r\n e--;\r\n } else {\r\n x = new Ctor(x);\r\n x.d = xd;\r\n x.e = e;\r\n x = divide(x, y, sd, rm, 0, base);\r\n xd = x.d;\r\n e = x.e;\r\n roundUp = inexact;\r\n }\r\n\r\n // The rounding digit, i.e. the digit after the digit that may be rounded up.\r\n i = xd[sd];\r\n k = base / 2;\r\n roundUp = roundUp \|\| xd[sd + 1] !== void 0;\r\n\r\n roundUp = rm < 4\r\n ? (i !== void 0 \|\| roundUp) && (rm === 0 \|\| rm === (x.s < 0 ? 3 : 2))\r\n : i > k \|\| i === k && (rm === 4 \|\| roundUp \|\| rm === 6 && xd[sd - 1] & 1 \|\|\r\n rm === (x.s < 0 ? 8 : 7));\r\n\r\n xd.length = sd;\r\n\r\n if (roundUp) {\r\n\r\n // Rounding up may mean the previous digit has to be rounded up and so on.\r\n for (; ++xd[--sd] > base - 1;) {\r\n xd[sd] = 0;\r\n if (!sd) {\r\n ++e;\r\n xd.unshift(1);\r\n }\r\n }\r\n }\r\n\r\n // Determine trailing zeros.\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // E.g. [4, 11, 15] becomes 4bf.\r\n for (i = 0, str = ''; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n\r\n // Add binary exponent suffix?\r\n if (isExp) {\r\n if (len > 1) {\r\n if (baseOut == 16 \|\| baseOut == 8) {\r\n i = baseOut == 16 ? 4 : 3;\r\n for (--len; len % i; len++) str += '0';\r\n xd = convertBase(str, base, baseOut);\r\n for (len = xd.length; !xd[len - 1]; --len);\r\n\r\n // xd[0] will always be be 1\r\n for (i = 1, str = '1.'; i < len; i++) str += NUMERALS.charAt(xd[i]);\r\n } else {\r\n str = str.charAt(0) + '.' + str.slice(1);\r\n }\r\n }\r\n\r\n str = str + (e < 0 ? 'p' : 'p+') + e;\r\n } else if (e < 0) {\r\n for (; ++e;) str = '0' + str;\r\n str = '0.' + str;\r\n } else {\r\n if (++e > len) for (e -= len; e-- ;) str += '0';\r\n else if (e < len) str = str.slice(0, e) + '.' + str.slice(e);\r\n }\r\n }\r\n\r\n str = (baseOut == 16 ? '0x' : baseOut == 2 ? '0b' : baseOut == 8 ? '0o' : '') + str;\r\n }\r\n\r\n return x.s < 0 ? '-' + str : str;\r\n}\r\n\r\n\r\n// Does not strip trailing zeros.\r\nfunction truncate(arr, len) {\r\n if (arr.length > len) {\r\n arr.length = len;\r\n return true;\r\n }\r\n}\r\n\r\n\r\n// Decimal methods\r\n\r\n\r\n/\r\n abs\r\n * acos\r\n * acosh\r\n * add\r\n * asin\r\n * asinh\r\n * atan\r\n * atanh\r\n * atan2\r\n * cbrt\r\n * ceil\r\n * clamp\r\n * clone\r\n * config\r\n * cos\r\n * cosh\r\n * div\r\n * exp\r\n * floor\r\n * hypot\r\n * ln\r\n * log\r\n * log2\r\n * log10\r\n * max\r\n * min\r\n * mod\r\n * mul\r\n * pow\r\n * random\r\n * round\r\n * set\r\n * sign\r\n * sin\r\n * sinh\r\n * sqrt\r\n * sub\r\n * sum\r\n * tan\r\n * tanh\r\n * trunc\r\n /\r\n\r\n\r\n/\r\n * Return a new Decimal whose value is the absolute value of `x`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction abs(x) {\r\n return new this(x).abs();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arccosine in radians of `x`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction acos(x) {\r\n return new this(x).acos();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic cosine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction acosh(x) {\r\n return new this(x).acosh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sum of `x` and `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction add(x, y) {\r\n return new this(x).plus(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arcsine in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction asin(x) {\r\n return new this(x).asin();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic sine of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction asinh(x) {\r\n return new this(x).asinh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent in radians of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction atan(x) {\r\n return new this(x).atan();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the inverse of the hyperbolic tangent of `x`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction atanh(x) {\r\n return new this(x).atanh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the arctangent in radians of `y/x` in the range -pi to pi\r\n * (inclusive), rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n Domain: [-Infinity, Infinity]\r\n * Range: [-pi, pi]\r\n \r\n y {number\|string\|Decimal} The y-coordinate.\r\n * x {number\|string\|Decimal} The x-coordinate.\r\n \r\n atan2(±0, -0) = ±pi\r\n * atan2(±0, +0) = ±0\r\n * atan2(±0, -x) = ±pi for x > 0\r\n * atan2(±0, x) = ±0 for x > 0\r\n * atan2(-y, ±0) = -pi/2 for y > 0\r\n * atan2(y, ±0) = pi/2 for y > 0\r\n * atan2(±y, -Infinity) = ±pi for finite y > 0\r\n * atan2(±y, +Infinity) = ±0 for finite y > 0\r\n * atan2(±Infinity, x) = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3pi/4\r\n atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n \r\n /\r\nfunction atan2(y, x) {\r\n y = new this(y);\r\n x = new this(x);\r\n var r,\r\n pr = this.precision,\r\n rm = this.rounding,\r\n wpr = pr + 4;\r\n\r\n // Either NaN\r\n if (!y.s \|\| !x.s) {\r\n r = new this(NaN);\r\n\r\n // Both ±Infinity\r\n } else if (!y.d && !x.d) {\r\n r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n r.s = y.s;\r\n\r\n // x is ±Infinity or y is ±0\r\n } else if (!x.d \|\| y.isZero()) {\r\n r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n r.s = y.s;\r\n\r\n // y is ±Infinity or x is ±0\r\n } else if (!y.d \|\| x.isZero()) {\r\n r = getPi(this, wpr, 1).times(0.5);\r\n r.s = y.s;\r\n\r\n // Both non-zero and finite\r\n } else if (x.s < 0) {\r\n this.precision = wpr;\r\n this.rounding = 1;\r\n r = this.atan(divide(y, x, wpr, 1));\r\n x = getPi(this, wpr, 1);\r\n this.precision = pr;\r\n this.rounding = rm;\r\n r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n } else {\r\n r = this.atan(divide(y, x, wpr, 1));\r\n }\r\n\r\n return r;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction cbrt(x) {\r\n return new this(x).cbrt();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` rounded to an integer using `ROUND_CEIL`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction ceil(x) {\r\n return finalise(x = new this(x), x.e + 1, 2);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` clamped to the range delineated by `min` and `max`.\r\n \r\n x {number\|string\|Decimal}\r\n * min {number\|string\|Decimal}\r\n * max {number\|string\|Decimal}\r\n \r\n /\r\nfunction clamp(x, min, max) {\r\n return new this(x).clamp(min, max);\r\n}\r\n\r\n\r\n/\r\n Configure global settings for a Decimal constructor.\r\n \r\n `obj` is an object with one or more of the following properties,\r\n \r\n precision {number}\r\n * rounding {number}\r\n * toExpNeg {number}\r\n * toExpPos {number}\r\n * maxE {number}\r\n * minE {number}\r\n * modulo {number}\r\n * crypto {boolean\|number}\r\n * defaults {true}\r\n \r\n E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n \r\n /\r\nfunction config(obj) {\r\n if (!obj \|\| typeof obj !== 'object') throw Error(decimalError + 'Object expected');\r\n var i, p, v,\r\n useDefaults = obj.defaults === true,\r\n ps = [\r\n 'precision', 1, MAX_DIGITS,\r\n 'rounding', 0, 8,\r\n 'toExpNeg', -EXP_LIMIT, 0,\r\n 'toExpPos', 0, EXP_LIMIT,\r\n 'maxE', 0, EXP_LIMIT,\r\n 'minE', -EXP_LIMIT, 0,\r\n 'modulo', 0, 9\r\n ];\r\n\r\n for (i = 0; i < ps.length; i += 3) {\r\n if (p = ps[i], useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (mathfloor(v) === v && v >= ps[i + 1] && v <= ps[i + 2]) this[p] = v;\r\n else throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n if (p = 'crypto', useDefaults) this[p] = DEFAULTS[p];\r\n if ((v = obj[p]) !== void 0) {\r\n if (v === true \|\| v === false \|\| v === 0 \|\| v === 1) {\r\n if (v) {\r\n if (typeof crypto != 'undefined' && crypto &&\r\n (crypto.getRandomValues \|\| crypto.randomBytes)) {\r\n this[p] = true;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n } else {\r\n this[p] = false;\r\n }\r\n } else {\r\n throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n }\r\n\r\n return this;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the cosine of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction cos(x) {\r\n return new this(x).cos();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic cosine of `x`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction cosh(x) {\r\n return new this(x).cosh();\r\n}\r\n\r\n\r\n/\r\n Create and return a Decimal constructor with the same configuration properties as this Decimal\r\n * constructor.\r\n \r\n /\r\nfunction clone(obj) {\r\n var i, p, ps;\r\n\r\n /\r\n The Decimal constructor and exported function.\r\n * Return a new Decimal instance.\r\n \r\n v {number\|string\|Decimal} A numeric value.\r\n \r\n /\r\n function Decimal(v) {\r\n var e, i, t,\r\n x = this;\r\n\r\n // Decimal called without new.\r\n if (!(x instanceof Decimal)) return new Decimal(v);\r\n\r\n // Retain a reference to this Decimal constructor, and shadow Decimal.prototype.constructor\r\n // which points to Object.\r\n x.constructor = Decimal;\r\n\r\n // Duplicate.\r\n if (isDecimalInstance(v)) {\r\n x.s = v.s;\r\n\r\n if (external) {\r\n if (!v.d \|\| v.e > Decimal.maxE) {\r\n\r\n // Infinity.\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (v.e < Decimal.minE) {\r\n\r\n // Zero.\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d.slice();\r\n }\r\n } else {\r\n x.e = v.e;\r\n x.d = v.d ? v.d.slice() : v.d;\r\n }\r\n\r\n return;\r\n }\r\n\r\n t = typeof v;\r\n\r\n if (t === 'number') {\r\n if (v === 0) {\r\n x.s = 1 / v < 0 ? -1 : 1;\r\n x.e = 0;\r\n x.d = [0];\r\n return;\r\n }\r\n\r\n if (v < 0) {\r\n v = -v;\r\n x.s = -1;\r\n } else {\r\n x.s = 1;\r\n }\r\n\r\n // Fast path for small integers.\r\n if (v === ~~v && v < 1e7) {\r\n for (e = 0, i = v; i >= 10; i /= 10) e++;\r\n\r\n if (external) {\r\n if (e > Decimal.maxE) {\r\n x.e = NaN;\r\n x.d = null;\r\n } else if (e < Decimal.minE) {\r\n x.e = 0;\r\n x.d = [0];\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n } else {\r\n x.e = e;\r\n x.d = [v];\r\n }\r\n\r\n return;\r\n\r\n // Infinity, NaN.\r\n } else if (v * 0 !== 0) {\r\n if (!v) x.s = NaN;\r\n x.e = NaN;\r\n x.d = null;\r\n return;\r\n }\r\n\r\n return parseDecimal(x, v.toString());\r\n\r\n } else if (t !== 'string') {\r\n throw Error(invalidArgument + v);\r\n }\r\n\r\n // Minus sign?\r\n if ((i = v.charCodeAt(0)) === 45) {\r\n v = v.slice(1);\r\n x.s = -1;\r\n } else {\r\n // Plus sign?\r\n if (i === 43) v = v.slice(1);\r\n x.s = 1;\r\n }\r\n\r\n return isDecimal.test(v) ? parseDecimal(x, v) : parseOther(x, v);\r\n }\r\n\r\n Decimal.prototype = P;\r\n\r\n Decimal.ROUND_UP = 0;\r\n Decimal.ROUND_DOWN = 1;\r\n Decimal.ROUND_CEIL = 2;\r\n Decimal.ROUND_FLOOR = 3;\r\n Decimal.ROUND_HALF_UP = 4;\r\n Decimal.ROUND_HALF_DOWN = 5;\r\n Decimal.ROUND_HALF_EVEN = 6;\r\n Decimal.ROUND_HALF_CEIL = 7;\r\n Decimal.ROUND_HALF_FLOOR = 8;\r\n Decimal.EUCLID = 9;\r\n\r\n Decimal.config = Decimal.set = config;\r\n Decimal.clone = clone;\r\n Decimal.isDecimal = isDecimalInstance;\r\n\r\n Decimal.abs = abs;\r\n Decimal.acos = acos;\r\n Decimal.acosh = acosh; // ES6\r\n Decimal.add = add;\r\n Decimal.asin = asin;\r\n Decimal.asinh = asinh; // ES6\r\n Decimal.atan = atan;\r\n Decimal.atanh = atanh; // ES6\r\n Decimal.atan2 = atan2;\r\n Decimal.cbrt = cbrt; // ES6\r\n Decimal.ceil = ceil;\r\n Decimal.clamp = clamp;\r\n Decimal.cos = cos;\r\n Decimal.cosh = cosh; // ES6\r\n Decimal.div = div;\r\n Decimal.exp = exp;\r\n Decimal.floor = floor;\r\n Decimal.hypot = hypot; // ES6\r\n Decimal.ln = ln;\r\n Decimal.log = log;\r\n Decimal.log10 = log10; // ES6\r\n Decimal.log2 = log2; // ES6\r\n Decimal.max = max;\r\n Decimal.min = min;\r\n Decimal.mod = mod;\r\n Decimal.mul = mul;\r\n Decimal.pow = pow;\r\n Decimal.random = random;\r\n Decimal.round = round;\r\n Decimal.sign = sign; // ES6\r\n Decimal.sin = sin;\r\n Decimal.sinh = sinh; // ES6\r\n Decimal.sqrt = sqrt;\r\n Decimal.sub = sub;\r\n Decimal.sum = sum;\r\n Decimal.tan = tan;\r\n Decimal.tanh = tanh; // ES6\r\n Decimal.trunc = trunc; // ES6\r\n\r\n if (obj === void 0) obj = {};\r\n if (obj) {\r\n if (obj.defaults !== true) {\r\n ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'maxE', 'minE', 'modulo', 'crypto'];\r\n for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\r\n }\r\n }\r\n\r\n Decimal.config(obj);\r\n\r\n return Decimal;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` divided by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction div(x, y) {\r\n return new this(x).div(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural exponential of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} The power to which to raise the base of the natural log.\r\n \r\n /\r\nfunction exp(x) {\r\n return new this(x).exp();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` round to an integer using `ROUND_FLOOR`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction floor(x) {\r\n return finalise(x = new this(x), x.e + 1, 3);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of the sum of the squares of the arguments,\r\n * rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n hypot(a, b, ...) = sqrt(a^2 + b^2 + ...)\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction hypot() {\r\n var i, n,\r\n t = new this(0);\r\n\r\n external = false;\r\n\r\n for (i = 0; i < arguments.length;) {\r\n n = new this(arguments[i++]);\r\n if (!n.d) {\r\n if (n.s) {\r\n external = true;\r\n return new this(1 / 0);\r\n }\r\n t = n;\r\n } else if (t.d) {\r\n t = t.plus(n.times(n));\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return t.sqrt();\r\n}\r\n\r\n\r\n/\r\n Return true if object is a Decimal instance (where Decimal is any Decimal constructor),\r\n * otherwise return false.\r\n \r\n /\r\nfunction isDecimalInstance(obj) {\r\n return obj instanceof Decimal \|\| obj && obj.toStringTag === tag \|\| false;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the natural logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction ln(x) {\r\n return new this(x).ln();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the log of `x` to the base `y`, or to base 10 if no base\r\n * is specified, rounded to `precision` significant digits using rounding mode `rounding`.\r\n \r\n log[y](x)\r\n \r\n x {number\|string\|Decimal} The argument of the logarithm.\r\n * y {number\|string\|Decimal} The base of the logarithm.\r\n \r\n /\r\nfunction log(x, y) {\r\n return new this(x).log(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the base 2 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction log2(x) {\r\n return new this(x).log(2);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the base 10 logarithm of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction log10(x) {\r\n return new this(x).log(10);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the maximum of the arguments.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction max() {\r\n return maxOrMin(this, arguments, 'lt');\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the minimum of the arguments.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction min() {\r\n return maxOrMin(this, arguments, 'gt');\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` modulo `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction mod(x, y) {\r\n return new this(x).mod(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` multiplied by `y`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction mul(x, y) {\r\n return new this(x).mul(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` raised to the power `y`, rounded to precision\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} The base.\r\n * y {number\|string\|Decimal} The exponent.\r\n \r\n /\r\nfunction pow(x, y) {\r\n return new this(x).pow(y);\r\n}\r\n\r\n\r\n/\r\n Returns a new Decimal with a random value equal to or greater than 0 and less than 1, and with\r\n * `sd`, or `Decimal.precision` if `sd` is omitted, significant digits (or less if trailing zeros\r\n * are produced).\r\n \r\n [sd] {number} Significant digits. Integer, 0 to MAX_DIGITS inclusive.\r\n \r\n /\r\nfunction random(sd) {\r\n var d, e, k, n,\r\n i = 0,\r\n r = new this(1),\r\n rd = [];\r\n\r\n if (sd === void 0) sd = this.precision;\r\n else checkInt32(sd, 1, MAX_DIGITS);\r\n\r\n k = Math.ceil(sd / LOG_BASE);\r\n\r\n if (!this.crypto) {\r\n for (; i < k;) rd[i++] = Math.random() * 1e7 \| 0;\r\n\r\n // Browsers supporting crypto.getRandomValues.\r\n } else if (crypto.getRandomValues) {\r\n d = crypto.getRandomValues(new Uint32Array(k));\r\n\r\n for (; i < k;) {\r\n n = d[i];\r\n\r\n // 0 <= n < 4294967296\r\n // Probability n >= 4.29e9, is 4967296 / 4294967296 = 0.00116 (1 in 865).\r\n if (n >= 4.29e9) {\r\n d[i] = crypto.getRandomValues(new Uint32Array(1))[0];\r\n } else {\r\n\r\n // 0 <= n <= 4289999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd[i++] = n % 1e7;\r\n }\r\n }\r\n\r\n // Node.js supporting crypto.randomBytes.\r\n } else if (crypto.randomBytes) {\r\n\r\n // buffer\r\n d = crypto.randomBytes(k = 4);\r\n\r\n for (; i < k;) {\r\n\r\n // 0 <= n < 2147483648\r\n n = d[i] + (d[i + 1] << 8) + (d[i + 2] << 16) + ((d[i + 3] & 0x7f) << 24);\r\n\r\n // Probability n >= 2.14e9, is 7483648 / 2147483648 = 0.0035 (1 in 286).\r\n if (n >= 2.14e9) {\r\n crypto.randomBytes(4).copy(d, i);\r\n } else {\r\n\r\n // 0 <= n <= 2139999999\r\n // 0 <= (n % 1e7) <= 9999999\r\n rd.push(n % 1e7);\r\n i += 4;\r\n }\r\n }\r\n\r\n i = k / 4;\r\n } else {\r\n throw Error(cryptoUnavailable);\r\n }\r\n\r\n k = rd[--i];\r\n sd %= LOG_BASE;\r\n\r\n // Convert trailing digits to zeros according to sd.\r\n if (k && sd) {\r\n n = mathpow(10, LOG_BASE - sd);\r\n rd[i] = (k / n \| 0) n;\r\n }\r\n\r\n // Remove trailing words which are zero.\r\n for (; rd[i] === 0; i--) rd.pop();\r\n\r\n // Zero?\r\n if (i < 0) {\r\n e = 0;\r\n rd = [0];\r\n } else {\r\n e = -1;\r\n\r\n // Remove leading words which are zero and adjust exponent accordingly.\r\n for (; rd[0] === 0; e -= LOG_BASE) rd.shift();\r\n\r\n // Count the digits of the first word of rd to determine leading zeros.\r\n for (k = 1, n = rd[0]; n >= 10; n /= 10) k++;\r\n\r\n // Adjust the exponent for leading zeros of the first word of rd.\r\n if (k < LOG_BASE) e -= LOG_BASE - k;\r\n }\r\n\r\n r.e = e;\r\n r.d = rd;\r\n\r\n return r;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` rounded to an integer using rounding mode `rounding`.\r\n \r\n To emulate `Math.round`, set rounding to 7 (ROUND_HALF_CEIL).\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction round(x) {\r\n return finalise(x = new this(x), x.e + 1, this.rounding);\r\n}\r\n\r\n\r\n/\r\n Return\r\n * 1 if x > 0,\r\n * -1 if x < 0,\r\n * 0 if x is 0,\r\n * -0 if x is -0,\r\n * NaN otherwise\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction sign(x) {\r\n x = new this(x);\r\n return x.d ? (x.d[0] ? x.s : 0 * x.s) : x.s \|\| NaN;\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sine of `x`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction sin(x) {\r\n return new this(x).sin();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic sine of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction sinh(x) {\r\n return new this(x).sinh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the square root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction sqrt(x) {\r\n return new this(x).sqrt();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` minus `y`, rounded to `precision` significant digits\r\n * using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal}\r\n * y {number\|string\|Decimal}\r\n \r\n /\r\nfunction sub(x, y) {\r\n return new this(x).sub(y);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the sum of the arguments, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n Only the result is rounded, not the intermediate calculations.\r\n \r\n arguments {number\|string\|Decimal}\r\n \r\n /\r\nfunction sum() {\r\n var i = 0,\r\n args = arguments,\r\n x = new this(args[i]);\r\n\r\n external = false;\r\n for (; x.s && ++i < args.length;) x = x.plus(args[i]);\r\n external = true;\r\n\r\n return finalise(x, this.precision, this.rounding);\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the tangent of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction tan(x) {\r\n return new this(x).tan();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is the hyperbolic tangent of `x`, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n \r\n x {number\|string\|Decimal} A value in radians.\r\n \r\n /\r\nfunction tanh(x) {\r\n return new this(x).tanh();\r\n}\r\n\r\n\r\n/\r\n Return a new Decimal whose value is `x` truncated to an integer.\r\n \r\n x {number\|string\|Decimal}\r\n \r\n /\r\nfunction trunc(x) {\r\n return finalise(x = new this(x), x.e + 1, 1);\r\n}\r\n\r\n\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toString;\r\nP[Symbol.toStringTag] = 'Decimal';\r\n\r\n// Create and configure initial Decimal constructor.\r\nexport var Decimal = P.constructor = clone(DEFAULTS);\r\n\r\n// Create the internal constants from their string values.\r\nLN10 = new Decimal(LN10);\r\nPI = new Decimal(PI);\r\n\r\nexport default Decimal;\r\n","export const defaultJsonSerializer = JSON;\n//# sourceMappingURL=defaultJsonSerializer.js.map","export const uppercase = (str) => str.toUpperCase();\n/*\n Convert Headers instance into regular object\n /\nexport const HeadersInstanceToPlainObject = (headers) => {\n const o = {};\n headers.forEach((v, k) => {\n o[k] = v;\n });\n return o;\n};\n//# sourceMappingURL=helpers.js.map","export const parseRequestArgs = (documentOrOptions, variables, requestHeaders) => {\n return documentOrOptions.document\n ? documentOrOptions\n : {\n document: documentOrOptions,\n variables: variables,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRawRequestArgs = (queryOrOptions, variables, requestHeaders) => {\n return queryOrOptions.query\n ? queryOrOptions\n : {\n query: queryOrOptions,\n variables: variables,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseBatchRequestArgs = (documentsOrOptions, requestHeaders) => {\n return documentsOrOptions.documents\n ? documentsOrOptions\n : {\n documents: documentsOrOptions,\n requestHeaders: requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRequestExtendedArgs = (urlOrOptions, document, ...variablesAndRequestHeaders) => {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n return urlOrOptions.document\n ? urlOrOptions\n : {\n url: urlOrOptions,\n document: document,\n variables,\n requestHeaders,\n signal: undefined,\n };\n};\nexport const parseRawRequestExtendedArgs = (urlOrOptions, query, ...variablesAndRequestHeaders) => {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n return urlOrOptions.query\n ? urlOrOptions\n : {\n url: urlOrOptions,\n query: query,\n variables,\n requestHeaders,\n signal: undefined,\n };\n};\n//# sourceMappingURL=parseArgs.js.map","export function devAssert(condition, message) {\n const booleanCondition = Boolean(condition);\n\n if (!booleanCondition) {\n throw new Error(message);\n }\n}\n","/\n Return true if `value` is object-like. A value is object-like if it's not\n * `null` and has a `typeof` result of \"object\".\n /\nexport function isObjectLike(value) {\n return typeof value == 'object' && value !== null;\n}\n","export function invariant(condition, message) {\n const booleanCondition = Boolean(condition);\n\n if (!booleanCondition) {\n throw new Error(\n message != null ? message : 'Unexpected invariant triggered.',\n );\n }\n}\n","import { invariant } from '../jsutils/invariant.mjs';\nconst LineRegExp = /\\r\\n\|[\\n\\r]/g;\n/\n Represents a location in a Source.\n /\n\n/\n Takes a Source and a UTF-8 character offset, and returns the corresponding\n * line and column as a SourceLocation.\n /\nexport function getLocation(source, position) {\n let lastLineStart = 0;\n let line = 1;\n\n for (const match of source.body.matchAll(LineRegExp)) {\n typeof match.index === 'number' \|\| invariant(false);\n\n if (match.index >= position) {\n break;\n }\n\n lastLineStart = match.index + match[0].length;\n line += 1;\n }\n\n return {\n line,\n column: position + 1 - lastLineStart,\n };\n}\n","import { getLocation } from './location.mjs';\n\n/\n Render a helpful description of the location in the GraphQL Source document.\n /\nexport function printLocation(location) {\n return printSourceLocation(\n location.source,\n getLocation(location.source, location.start),\n );\n}\n/\n Render a helpful description of the location in the GraphQL Source document.\n /\n\nexport function printSourceLocation(source, sourceLocation) {\n const firstLineColumnOffset = source.locationOffset.column - 1;\n const body = ''.padStart(firstLineColumnOffset) + source.body;\n const lineIndex = sourceLocation.line - 1;\n const lineOffset = source.locationOffset.line - 1;\n const lineNum = sourceLocation.line + lineOffset;\n const columnOffset = sourceLocation.line === 1 ? firstLineColumnOffset : 0;\n const columnNum = sourceLocation.column + columnOffset;\n const locationStr = `${source.name}:${lineNum}:${columnNum}\\n`;\n const lines = body.split(/\\r\\n\|[\\n\\r]/g);\n const locationLine = lines[lineIndex]; // Special case for minified documents\n\n if (locationLine.length > 120) {\n const subLineIndex = Math.floor(columnNum / 80);\n const subLineColumnNum = columnNum % 80;\n const subLines = [];\n\n for (let i = 0; i < locationLine.length; i += 80) {\n subLines.push(locationLine.slice(i, i + 80));\n }\n\n return (\n locationStr +\n printPrefixedLines([\n [`${lineNum} \|`, subLines[0]],\n ...subLines.slice(1, subLineIndex + 1).map((subLine) => ['\|', subLine]),\n ['\|', '^'.padStart(subLineColumnNum)],\n ['\|', subLines[subLineIndex + 1]],\n ])\n );\n }\n\n return (\n locationStr +\n printPrefixedLines([\n // Lines specified like this: [\"prefix\", \"string\"],\n [`${lineNum - 1} \|`, lines[lineIndex - 1]],\n [`${lineNum} \|`, locationLine],\n ['\|', '^'.padStart(columnNum)],\n [`${lineNum + 1} \|`, lines[lineIndex + 1]],\n ])\n );\n}\n\nfunction printPrefixedLines(lines) {\n const existingLines = lines.filter(([_, line]) => line !== undefined);\n const padLen = Math.max(...existingLines.map(([prefix]) => prefix.length));\n return existingLines\n .map(([prefix, line]) => prefix.padStart(padLen) + (line ? ' ' + line : ''))\n .join('\\n');\n}\n","import { isObjectLike } from '../jsutils/isObjectLike.mjs';\nimport { getLocation } from '../language/location.mjs';\nimport {\n printLocation,\n printSourceLocation,\n} from '../language/printLocation.mjs';\n\nfunction toNormalizedOptions(args) {\n const firstArg = args[0];\n\n if (firstArg == null \|\| 'kind' in firstArg \|\| 'length' in firstArg) {\n return {\n nodes: firstArg,\n source: args[1],\n positions: args[2],\n path: args[3],\n originalError: args[4],\n extensions: args[5],\n };\n }\n\n return firstArg;\n}\n/\n A GraphQLError describes an Error found during the parse, validate, or\n * execute phases of performing a GraphQL operation. In addition to a message\n * and stack trace, it also includes information about the locations in a\n * GraphQL document and/or execution result that correspond to the Error.\n /\n\nexport class GraphQLError extends Error {\n /\n An array of `{ line, column }` locations within the source GraphQL document\n * which correspond to this error.\n \n Errors during validation often contain multiple locations, for example to\n * point out two things with the same name. Errors during execution include a\n * single location, the field which produced the error.\n \n Enumerable, and appears in the result of JSON.stringify().\n /\n\n /\n An array describing the JSON-path into the execution response which\n * corresponds to this error. Only included for errors during execution.\n \n Enumerable, and appears in the result of JSON.stringify().\n /\n\n /\n An array of GraphQL AST Nodes corresponding to this error.\n /\n\n /\n The source GraphQL document for the first location of this error.\n \n Note that if this Error represents more than one node, the source may not\n * represent nodes after the first node.\n /\n\n /\n An array of character offsets within the source GraphQL document\n * which correspond to this error.\n /\n\n /\n The original error thrown from a field resolver during execution.\n /\n\n /\n Extension fields to add to the formatted error.\n /\n\n /\n @deprecated Please use the `GraphQLErrorOptions` constructor overload instead.\n /\n constructor(message, ...rawArgs) {\n var _this$nodes, _nodeLocations$, _ref;\n\n const { nodes, source, positions, path, originalError, extensions } =\n toNormalizedOptions(rawArgs);\n super(message);\n this.name = 'GraphQLError';\n this.path = path !== null && path !== void 0 ? path : undefined;\n this.originalError =\n originalError !== null && originalError !== void 0\n ? originalError\n : undefined; // Compute list of blame nodes.\n\n this.nodes = undefinedIfEmpty(\n Array.isArray(nodes) ? nodes : nodes ? [nodes] : undefined,\n );\n const nodeLocations = undefinedIfEmpty(\n (_this$nodes = this.nodes) === null \|\| _this$nodes === void 0\n ? void 0\n : _this$nodes.map((node) => node.loc).filter((loc) => loc != null),\n ); // Compute locations in the source for the given nodes/positions.\n\n this.source =\n source !== null && source !== void 0\n ? source\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : (_nodeLocations$ = nodeLocations[0]) === null \|\|\n _nodeLocations$ === void 0\n ? void 0\n : _nodeLocations$.source;\n this.positions =\n positions !== null && positions !== void 0\n ? positions\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : nodeLocations.map((loc) => loc.start);\n this.locations =\n positions && source\n ? positions.map((pos) => getLocation(source, pos))\n : nodeLocations === null \|\| nodeLocations === void 0\n ? void 0\n : nodeLocations.map((loc) => getLocation(loc.source, loc.start));\n const originalExtensions = isObjectLike(\n originalError === null \|\| originalError === void 0\n ? void 0\n : originalError.extensions,\n )\n ? originalError === null \|\| originalError === void 0\n ? void 0\n : originalError.extensions\n : undefined;\n this.extensions =\n (_ref =\n extensions !== null && extensions !== void 0\n ? extensions\n : originalExtensions) !== null && _ref !== void 0\n ? _ref\n : Object.create(null); // Only properties prescribed by the spec should be enumerable.\n // Keep the rest as non-enumerable.\n\n Object.defineProperties(this, {\n message: {\n writable: true,\n enumerable: true,\n },\n name: {\n enumerable: false,\n },\n nodes: {\n enumerable: false,\n },\n source: {\n enumerable: false,\n },\n positions: {\n enumerable: false,\n },\n originalError: {\n enumerable: false,\n },\n }); // Include (non-enumerable) stack trace.\n\n / c8 ignore start /\n // FIXME: https://github.com/graphql/graphql-js/issues/2317\n\n if (\n originalError !== null &&\n originalError !== void 0 &&\n originalError.stack\n ) {\n Object.defineProperty(this, 'stack', {\n value: originalError.stack,\n writable: true,\n configurable: true,\n });\n } else if (Error.captureStackTrace) {\n Error.captureStackTrace(this, GraphQLError);\n } else {\n Object.defineProperty(this, 'stack', {\n value: Error().stack,\n writable: true,\n configurable: true,\n });\n }\n / c8 ignore stop /\n }\n\n get [Symbol.toStringTag]() {\n return 'GraphQLError';\n }\n\n toString() {\n let output = this.message;\n\n if (this.nodes) {\n for (const node of this.nodes) {\n if (node.loc) {\n output += '\\n\\n' + printLocation(node.loc);\n }\n }\n } else if (this.source && this.locations) {\n for (const location of this.locations) {\n output += '\\n\\n' + printSourceLocation(this.source, location);\n }\n }\n\n return output;\n }\n\n toJSON() {\n const formattedError = {\n message: this.message,\n };\n\n if (this.locations != null) {\n formattedError.locations = this.locations;\n }\n\n if (this.path != null) {\n formattedError.path = this.path;\n }\n\n if (this.extensions != null && Object.keys(this.extensions).length > 0) {\n formattedError.extensions = this.extensions;\n }\n\n return formattedError;\n }\n}\n\nfunction undefinedIfEmpty(array) {\n return array === undefined \|\| array.length === 0 ? undefined : array;\n}\n/\n See: https://spec.graphql.org/draft/#sec-Errors\n /\n\n/\n Prints a GraphQLError to a string, representing useful location information\n * about the error's position in the source.\n \n @deprecated Please use `error.toString` instead. Will be removed in v17\n /\nexport function printError(error) {\n return error.toString();\n}\n/\n Given a GraphQLError, format it according to the rules described by the\n * Response Format, Errors section of the GraphQL Specification.\n \n @deprecated Please use `error.toJSON` instead. Will be removed in v17\n /\n\nexport function formatError(error) {\n return error.toJSON();\n}\n","import { GraphQLError } from './GraphQLError.mjs';\n/\n Produces a GraphQLError representing a syntax error, containing useful\n * descriptive information about the syntax error's position in the source.\n /\n\nexport function syntaxError(source, position, description) {\n return new GraphQLError(`Syntax Error: ${description}`, {\n source,\n positions: [position],\n });\n}\n","/\n Contains a range of UTF-8 character offsets and token references that\n * identify the region of the source from which the AST derived.\n /\nexport class Location {\n /\n The character offset at which this Node begins.\n /\n\n /\n The character offset at which this Node ends.\n /\n\n /\n The Token at which this Node begins.\n /\n\n /\n The Token at which this Node ends.\n /\n\n /\n The Source document the AST represents.\n /\n constructor(startToken, endToken, source) {\n this.start = startToken.start;\n this.end = endToken.end;\n this.startToken = startToken;\n this.endToken = endToken;\n this.source = source;\n }\n\n get [Symbol.toStringTag]() {\n return 'Location';\n }\n\n toJSON() {\n return {\n start: this.start,\n end: this.end,\n };\n }\n}\n/\n Represents a range of characters represented by a lexical token\n * within a Source.\n /\n\nexport class Token {\n /\n The kind of Token.\n /\n\n /\n The character offset at which this Node begins.\n /\n\n /\n The character offset at which this Node ends.\n /\n\n /\n The 1-indexed line number on which this Token appears.\n /\n\n /\n The 1-indexed column number at which this Token begins.\n /\n\n /\n For non-punctuation tokens, represents the interpreted value of the token.\n \n Note: is undefined for punctuation tokens, but typed as string for\n * convenience in the parser.\n /\n\n /\n Tokens exist as nodes in a double-linked-list amongst all tokens\n * including ignored tokens. <SOF> is always the first node and <EOF>\n * the last.\n /\n constructor(kind, start, end, line, column, value) {\n this.kind = kind;\n this.start = start;\n this.end = end;\n this.line = line;\n this.column = column; // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n\n this.value = value;\n this.prev = null;\n this.next = null;\n }\n\n get [Symbol.toStringTag]() {\n return 'Token';\n }\n\n toJSON() {\n return {\n kind: this.kind,\n value: this.value,\n line: this.line,\n column: this.column,\n };\n }\n}\n/\n The list of all possible AST node types.\n /\n\n/\n @internal\n /\nexport const QueryDocumentKeys = {\n Name: [],\n Document: ['definitions'],\n OperationDefinition: [\n 'description',\n 'name',\n 'variableDefinitions',\n 'directives',\n 'selectionSet',\n ],\n VariableDefinition: [\n 'description',\n 'variable',\n 'type',\n 'defaultValue',\n 'directives',\n ],\n Variable: ['name'],\n SelectionSet: ['selections'],\n Field: ['alias', 'name', 'arguments', 'directives', 'selectionSet'],\n Argument: ['name', 'value'],\n FragmentSpread: ['name', 'directives'],\n InlineFragment: ['typeCondition', 'directives', 'selectionSet'],\n FragmentDefinition: [\n 'description',\n 'name', // Note: fragment variable definitions are deprecated and will removed in v17.0.0\n 'variableDefinitions',\n 'typeCondition',\n 'directives',\n 'selectionSet',\n ],\n IntValue: [],\n FloatValue: [],\n StringValue: [],\n BooleanValue: [],\n NullValue: [],\n EnumValue: [],\n ListValue: ['values'],\n ObjectValue: ['fields'],\n ObjectField: ['name', 'value'],\n Directive: ['name', 'arguments'],\n NamedType: ['name'],\n ListType: ['type'],\n NonNullType: ['type'],\n SchemaDefinition: ['description', 'directives', 'operationTypes'],\n OperationTypeDefinition: ['type'],\n ScalarTypeDefinition: ['description', 'name', 'directives'],\n ObjectTypeDefinition: [\n 'description',\n 'name',\n 'interfaces',\n 'directives',\n 'fields',\n ],\n FieldDefinition: ['description', 'name', 'arguments', 'type', 'directives'],\n InputValueDefinition: [\n 'description',\n 'name',\n 'type',\n 'defaultValue',\n 'directives',\n ],\n InterfaceTypeDefinition: [\n 'description',\n 'name',\n 'interfaces',\n 'directives',\n 'fields',\n ],\n UnionTypeDefinition: ['description', 'name', 'directives', 'types'],\n EnumTypeDefinition: ['description', 'name', 'directives', 'values'],\n EnumValueDefinition: ['description', 'name', 'directives'],\n InputObjectTypeDefinition: ['description', 'name', 'directives', 'fields'],\n DirectiveDefinition: ['description', 'name', 'arguments', 'locations'],\n SchemaExtension: ['directives', 'operationTypes'],\n ScalarTypeExtension: ['name', 'directives'],\n ObjectTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n InterfaceTypeExtension: ['name', 'interfaces', 'directives', 'fields'],\n UnionTypeExtension: ['name', 'directives', 'types'],\n EnumTypeExtension: ['name', 'directives', 'values'],\n InputObjectTypeExtension: ['name', 'directives', 'fields'],\n TypeCoordinate: ['name'],\n MemberCoordinate: ['name', 'memberName'],\n ArgumentCoordinate: ['name', 'fieldName', 'argumentName'],\n DirectiveCoordinate: ['name'],\n DirectiveArgumentCoordinate: ['name', 'argumentName'],\n};\nconst kindValues = new Set(Object.keys(QueryDocumentKeys));\n/\n @internal\n /\n\nexport function isNode(maybeNode) {\n const maybeKind =\n maybeNode === null \|\| maybeNode === void 0 ? void 0 : maybeNode.kind;\n return typeof maybeKind === 'string' && kindValues.has(maybeKind);\n}\n/* Name /\n\nvar OperationTypeNode;\n\n(function (OperationTypeNode) {\n OperationTypeNode['QUERY'] = 'query';\n OperationTypeNode['MUTATION'] = 'mutation';\n OperationTypeNode['SUBSCRIPTION'] = 'subscription';\n})(OperationTypeNode \|\| (OperationTypeNode = {}));\n\nexport { OperationTypeNode };\n","/\n The set of allowed directive location values.\n /\nvar DirectiveLocation;\n\n(function (DirectiveLocation) {\n DirectiveLocation['QUERY'] = 'QUERY';\n DirectiveLocation['MUTATION'] = 'MUTATION';\n DirectiveLocation['SUBSCRIPTION'] = 'SUBSCRIPTION';\n DirectiveLocation['FIELD'] = 'FIELD';\n DirectiveLocation['FRAGMENT_DEFINITION'] = 'FRAGMENT_DEFINITION';\n DirectiveLocation['FRAGMENT_SPREAD'] = 'FRAGMENT_SPREAD';\n DirectiveLocation['INLINE_FRAGMENT'] = 'INLINE_FRAGMENT';\n DirectiveLocation['VARIABLE_DEFINITION'] = 'VARIABLE_DEFINITION';\n DirectiveLocation['SCHEMA'] = 'SCHEMA';\n DirectiveLocation['SCALAR'] = 'SCALAR';\n DirectiveLocation['OBJECT'] = 'OBJECT';\n DirectiveLocation['FIELD_DEFINITION'] = 'FIELD_DEFINITION';\n DirectiveLocation['ARGUMENT_DEFINITION'] = 'ARGUMENT_DEFINITION';\n DirectiveLocation['INTERFACE'] = 'INTERFACE';\n DirectiveLocation['UNION'] = 'UNION';\n DirectiveLocation['ENUM'] = 'ENUM';\n DirectiveLocation['ENUM_VALUE'] = 'ENUM_VALUE';\n DirectiveLocation['INPUT_OBJECT'] = 'INPUT_OBJECT';\n DirectiveLocation['INPUT_FIELD_DEFINITION'] = 'INPUT_FIELD_DEFINITION';\n})(DirectiveLocation \|\| (DirectiveLocation = {}));\n\nexport { DirectiveLocation };\n/\n The enum type representing the directive location values.\n \n @deprecated Please use `DirectiveLocation`. Will be remove in v17.\n /\n","/\n The set of allowed kind values for AST nodes.\n /\nvar Kind;\n\n(function (Kind) {\n Kind['NAME'] = 'Name';\n Kind['DOCUMENT'] = 'Document';\n Kind['OPERATION_DEFINITION'] = 'OperationDefinition';\n Kind['VARIABLE_DEFINITION'] = 'VariableDefinition';\n Kind['SELECTION_SET'] = 'SelectionSet';\n Kind['FIELD'] = 'Field';\n Kind['ARGUMENT'] = 'Argument';\n Kind['FRAGMENT_SPREAD'] = 'FragmentSpread';\n Kind['INLINE_FRAGMENT'] = 'InlineFragment';\n Kind['FRAGMENT_DEFINITION'] = 'FragmentDefinition';\n Kind['VARIABLE'] = 'Variable';\n Kind['INT'] = 'IntValue';\n Kind['FLOAT'] = 'FloatValue';\n Kind['STRING'] = 'StringValue';\n Kind['BOOLEAN'] = 'BooleanValue';\n Kind['NULL'] = 'NullValue';\n Kind['ENUM'] = 'EnumValue';\n Kind['LIST'] = 'ListValue';\n Kind['OBJECT'] = 'ObjectValue';\n Kind['OBJECT_FIELD'] = 'ObjectField';\n Kind['DIRECTIVE'] = 'Directive';\n Kind['NAMED_TYPE'] = 'NamedType';\n Kind['LIST_TYPE'] = 'ListType';\n Kind['NON_NULL_TYPE'] = 'NonNullType';\n Kind['SCHEMA_DEFINITION'] = 'SchemaDefinition';\n Kind['OPERATION_TYPE_DEFINITION'] = 'OperationTypeDefinition';\n Kind['SCALAR_TYPE_DEFINITION'] = 'ScalarTypeDefinition';\n Kind['OBJECT_TYPE_DEFINITION'] = 'ObjectTypeDefinition';\n Kind['FIELD_DEFINITION'] = 'FieldDefinition';\n Kind['INPUT_VALUE_DEFINITION'] = 'InputValueDefinition';\n Kind['INTERFACE_TYPE_DEFINITION'] = 'InterfaceTypeDefinition';\n Kind['UNION_TYPE_DEFINITION'] = 'UnionTypeDefinition';\n Kind['ENUM_TYPE_DEFINITION'] = 'EnumTypeDefinition';\n Kind['ENUM_VALUE_DEFINITION'] = 'EnumValueDefinition';\n Kind['INPUT_OBJECT_TYPE_DEFINITION'] = 'InputObjectTypeDefinition';\n Kind['DIRECTIVE_DEFINITION'] = 'DirectiveDefinition';\n Kind['SCHEMA_EXTENSION'] = 'SchemaExtension';\n Kind['SCALAR_TYPE_EXTENSION'] = 'ScalarTypeExtension';\n Kind['OBJECT_TYPE_EXTENSION'] = 'ObjectTypeExtension';\n Kind['INTERFACE_TYPE_EXTENSION'] = 'InterfaceTypeExtension';\n Kind['UNION_TYPE_EXTENSION'] = 'UnionTypeExtension';\n Kind['ENUM_TYPE_EXTENSION'] = 'EnumTypeExtension';\n Kind['INPUT_OBJECT_TYPE_EXTENSION'] = 'InputObjectTypeExtension';\n Kind['TYPE_COORDINATE'] = 'TypeCoordinate';\n Kind['MEMBER_COORDINATE'] = 'MemberCoordinate';\n Kind['ARGUMENT_COORDINATE'] = 'ArgumentCoordinate';\n Kind['DIRECTIVE_COORDINATE'] = 'DirectiveCoordinate';\n Kind['DIRECTIVE_ARGUMENT_COORDINATE'] = 'DirectiveArgumentCoordinate';\n})(Kind \|\| (Kind = {}));\n\nexport { Kind };\n/\n The enum type representing the possible kind values of AST nodes.\n \n @deprecated Please use `Kind`. Will be remove in v17.\n /\n","/\n ```\n * WhiteSpace ::\n * - \"Horizontal Tab (U+0009)\"\n * - \"Space (U+0020)\"\n * ```\n * @internal\n /\nexport function isWhiteSpace(code) {\n return code === 0x0009 \|\| code === 0x0020;\n}\n/\n ```\n * Digit :: one of\n * - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * ```\n * @internal\n /\n\nexport function isDigit(code) {\n return code >= 0x0030 && code <= 0x0039;\n}\n/\n ```\n * Letter :: one of\n * - `A` `B` `C` `D` `E` `F` `G` `H` `I` `J` `K` `L` `M`\n * - `N` `O` `P` `Q` `R` `S` `T` `U` `V` `W` `X` `Y` `Z`\n * - `a` `b` `c` `d` `e` `f` `g` `h` `i` `j` `k` `l` `m`\n * - `n` `o` `p` `q` `r` `s` `t` `u` `v` `w` `x` `y` `z`\n * ```\n * @internal\n /\n\nexport function isLetter(code) {\n return (\n (code >= 0x0061 && code <= 0x007a) \|\| // A-Z\n (code >= 0x0041 && code <= 0x005a) // a-z\n );\n}\n/\n ```\n * NameStart ::\n * - Letter\n * - `_`\n * ```\n * @internal\n /\n\nexport function isNameStart(code) {\n return isLetter(code) \|\| code === 0x005f;\n}\n/\n ```\n * NameContinue ::\n * - Letter\n * - Digit\n * - `_`\n * ```\n * @internal\n /\n\nexport function isNameContinue(code) {\n return isLetter(code) \|\| isDigit(code) \|\| code === 0x005f;\n}\n","import { isWhiteSpace } from './characterClasses.mjs';\n/\n Produces the value of a block string from its parsed raw value, similar to\n * CoffeeScript's block string, Python's docstring trim or Ruby's strip_heredoc.\n \n This implements the GraphQL spec's BlockStringValue() static algorithm.\n \n @internal\n /\n\nexport function dedentBlockStringLines(lines) {\n var _firstNonEmptyLine2;\n\n let commonIndent = Number.MAX_SAFE_INTEGER;\n let firstNonEmptyLine = null;\n let lastNonEmptyLine = -1;\n\n for (let i = 0; i < lines.length; ++i) {\n var _firstNonEmptyLine;\n\n const line = lines[i];\n const indent = leadingWhitespace(line);\n\n if (indent === line.length) {\n continue; // skip empty lines\n }\n\n firstNonEmptyLine =\n (_firstNonEmptyLine = firstNonEmptyLine) !== null &&\n _firstNonEmptyLine !== void 0\n ? _firstNonEmptyLine\n : i;\n lastNonEmptyLine = i;\n\n if (i !== 0 && indent < commonIndent) {\n commonIndent = indent;\n }\n }\n\n return lines // Remove common indentation from all lines but first.\n .map((line, i) => (i === 0 ? line : line.slice(commonIndent))) // Remove leading and trailing blank lines.\n .slice(\n (_firstNonEmptyLine2 = firstNonEmptyLine) !== null &&\n _firstNonEmptyLine2 !== void 0\n ? _firstNonEmptyLine2\n : 0,\n lastNonEmptyLine + 1,\n );\n}\n\nfunction leadingWhitespace(str) {\n let i = 0;\n\n while (i < str.length && isWhiteSpace(str.charCodeAt(i))) {\n ++i;\n }\n\n return i;\n}\n/\n @internal\n /\n\nexport function isPrintableAsBlockString(value) {\n if (value === '') {\n return true; // empty string is printable\n }\n\n let isEmptyLine = true;\n let hasIndent = false;\n let hasCommonIndent = true;\n let seenNonEmptyLine = false;\n\n for (let i = 0; i < value.length; ++i) {\n switch (value.codePointAt(i)) {\n case 0x0000:\n case 0x0001:\n case 0x0002:\n case 0x0003:\n case 0x0004:\n case 0x0005:\n case 0x0006:\n case 0x0007:\n case 0x0008:\n case 0x000b:\n case 0x000c:\n case 0x000e:\n case 0x000f:\n return false;\n // Has non-printable characters\n\n case 0x000d:\n // \\r\n return false;\n // Has \\r or \\r\\n which will be replaced as \\n\n\n case 10:\n // \\n\n if (isEmptyLine && !seenNonEmptyLine) {\n return false; // Has leading new line\n }\n\n seenNonEmptyLine = true;\n isEmptyLine = true;\n hasIndent = false;\n break;\n\n case 9: // \\t\n\n case 32:\n // <space>\n hasIndent \|\| (hasIndent = isEmptyLine);\n break;\n\n default:\n hasCommonIndent && (hasCommonIndent = hasIndent);\n isEmptyLine = false;\n }\n }\n\n if (isEmptyLine) {\n return false; // Has trailing empty lines\n }\n\n if (hasCommonIndent && seenNonEmptyLine) {\n return false; // Has internal indent\n }\n\n return true;\n}\n/\n Print a block string in the indented block form by adding a leading and\n * trailing blank line. However, if a block string starts with whitespace and is\n * a single-line, adding a leading blank line would strip that whitespace.\n \n @internal\n /\n\nexport function printBlockString(value, options) {\n const escapedValue = value.replace(/\"\"\"/g, '\\\\\"\"\"'); // Expand a block string's raw value into independent lines.\n\n const lines = escapedValue.split(/\\r\\n\|[\\n\\r]/g);\n const isSingleLine = lines.length === 1; // If common indentation is found we can fix some of those cases by adding leading new line\n\n const forceLeadingNewLine =\n lines.length > 1 &&\n lines\n .slice(1)\n .every((line) => line.length === 0 \|\| isWhiteSpace(line.charCodeAt(0))); // Trailing triple quotes just looks confusing but doesn't force trailing new line\n\n const hasTrailingTripleQuotes = escapedValue.endsWith('\\\\\"\"\"'); // Trailing quote (single or double) or slash forces trailing new line\n\n const hasTrailingQuote = value.endsWith('\"') && !hasTrailingTripleQuotes;\n const hasTrailingSlash = value.endsWith('\\\\');\n const forceTrailingNewline = hasTrailingQuote \|\| hasTrailingSlash;\n const printAsMultipleLines =\n !(options !== null && options !== void 0 && options.minimize) && // add leading and trailing new lines only if it improves readability\n (!isSingleLine \|\|\n value.length > 70 \|\|\n forceTrailingNewline \|\|\n forceLeadingNewLine \|\|\n hasTrailingTripleQuotes);\n let result = ''; // Format a multi-line block quote to account for leading space.\n\n const skipLeadingNewLine = isSingleLine && isWhiteSpace(value.charCodeAt(0));\n\n if ((printAsMultipleLines && !skipLeadingNewLine) \|\| forceLeadingNewLine) {\n result += '\\n';\n }\n\n result += escapedValue;\n\n if (printAsMultipleLines \|\| forceTrailingNewline) {\n result += '\\n';\n }\n\n return '\"\"\"' + result + '\"\"\"';\n}\n","/\n An exported enum describing the different kinds of tokens that the\n * lexer emits.\n /\nvar TokenKind;\n\n(function (TokenKind) {\n TokenKind['SOF'] = '<SOF>';\n TokenKind['EOF'] = '<EOF>';\n TokenKind['BANG'] = '!';\n TokenKind['DOLLAR'] = '$';\n TokenKind['AMP'] = '&';\n TokenKind['PAREN_L'] = '(';\n TokenKind['PAREN_R'] = ')';\n TokenKind['DOT'] = '.';\n TokenKind['SPREAD'] = '...';\n TokenKind['COLON'] = ':';\n TokenKind['EQUALS'] = '=';\n TokenKind['AT'] = '@';\n TokenKind['BRACKET_L'] = '[';\n TokenKind['BRACKET_R'] = ']';\n TokenKind['BRACE_L'] = '{';\n TokenKind['PIPE'] = '\|';\n TokenKind['BRACE_R'] = '}';\n TokenKind['NAME'] = 'Name';\n TokenKind['INT'] = 'Int';\n TokenKind['FLOAT'] = 'Float';\n TokenKind['STRING'] = 'String';\n TokenKind['BLOCK_STRING'] = 'BlockString';\n TokenKind['COMMENT'] = 'Comment';\n})(TokenKind \|\| (TokenKind = {}));\n\nexport { TokenKind };\n/\n The enum type representing the token kinds values.\n \n @deprecated Please use `TokenKind`. Will be remove in v17.\n /\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Token } from './ast.mjs';\nimport { dedentBlockStringLines } from './blockString.mjs';\nimport { isDigit, isNameContinue, isNameStart } from './characterClasses.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/\n A Lexer interface which provides common properties and methods required for\n * lexing GraphQL source.\n \n @internal\n /\n\n/\n Given a Source object, creates a Lexer for that source.\n * A Lexer is a stateful stream generator in that every time\n * it is advanced, it returns the next token in the Source. Assuming the\n * source lexes, the final Token emitted by the lexer will be of kind\n * EOF, after which the lexer will repeatedly return the same EOF token\n * whenever called.\n /\nexport class Lexer {\n /\n The previously focused non-ignored token.\n /\n\n /\n The currently focused non-ignored token.\n /\n\n /\n The (1-indexed) line containing the current token.\n /\n\n /\n The character offset at which the current line begins.\n /\n constructor(source) {\n const startOfFileToken = new Token(TokenKind.SOF, 0, 0, 0, 0);\n this.source = source;\n this.lastToken = startOfFileToken;\n this.token = startOfFileToken;\n this.line = 1;\n this.lineStart = 0;\n }\n\n get [Symbol.toStringTag]() {\n return 'Lexer';\n }\n /\n Advances the token stream to the next non-ignored token.\n /\n\n advance() {\n this.lastToken = this.token;\n const token = (this.token = this.lookahead());\n return token;\n }\n /\n Looks ahead and returns the next non-ignored token, but does not change\n * the state of Lexer.\n /\n\n lookahead() {\n let token = this.token;\n\n if (token.kind !== TokenKind.EOF) {\n do {\n if (token.next) {\n token = token.next;\n } else {\n // Read the next token and form a link in the token linked-list.\n const nextToken = readNextToken(this, token.end); // @ts-expect-error next is only mutable during parsing.\n\n token.next = nextToken; // @ts-expect-error prev is only mutable during parsing.\n\n nextToken.prev = token;\n token = nextToken;\n }\n } while (token.kind === TokenKind.COMMENT);\n }\n\n return token;\n }\n}\n/\n @internal\n /\n\nexport function isPunctuatorTokenKind(kind) {\n return (\n kind === TokenKind.BANG \|\|\n kind === TokenKind.DOLLAR \|\|\n kind === TokenKind.AMP \|\|\n kind === TokenKind.PAREN_L \|\|\n kind === TokenKind.PAREN_R \|\|\n kind === TokenKind.DOT \|\|\n kind === TokenKind.SPREAD \|\|\n kind === TokenKind.COLON \|\|\n kind === TokenKind.EQUALS \|\|\n kind === TokenKind.AT \|\|\n kind === TokenKind.BRACKET_L \|\|\n kind === TokenKind.BRACKET_R \|\|\n kind === TokenKind.BRACE_L \|\|\n kind === TokenKind.PIPE \|\|\n kind === TokenKind.BRACE_R\n );\n}\n/\n A Unicode scalar value is any Unicode code point except surrogate code\n * points. In other words, the inclusive ranges of values 0x0000 to 0xD7FF and\n * 0xE000 to 0x10FFFF.\n \n SourceCharacter ::\n * - \"Any Unicode scalar value\"\n /\n\nfunction isUnicodeScalarValue(code) {\n return (\n (code >= 0x0000 && code <= 0xd7ff) \|\| (code >= 0xe000 && code <= 0x10ffff)\n );\n}\n/\n The GraphQL specification defines source text as a sequence of unicode scalar\n * values (which Unicode defines to exclude surrogate code points). However\n * JavaScript defines strings as a sequence of UTF-16 code units which may\n * include surrogates. A surrogate pair is a valid source character as it\n * encodes a supplementary code point (above U+FFFF), but unpaired surrogate\n * code points are not valid source characters.\n /\n\nfunction isSupplementaryCodePoint(body, location) {\n return (\n isLeadingSurrogate(body.charCodeAt(location)) &&\n isTrailingSurrogate(body.charCodeAt(location + 1))\n );\n}\n\nfunction isLeadingSurrogate(code) {\n return code >= 0xd800 && code <= 0xdbff;\n}\n\nfunction isTrailingSurrogate(code) {\n return code >= 0xdc00 && code <= 0xdfff;\n}\n/\n Prints the code point (or end of file reference) at a given location in a\n * source for use in error messages.\n \n Printable ASCII is printed quoted, while other points are printed in Unicode\n * code point form (ie. U+1234).\n \n @internal\n /\n\nexport function printCodePointAt(lexer, location) {\n const code = lexer.source.body.codePointAt(location);\n\n if (code === undefined) {\n return TokenKind.EOF;\n } else if (code >= 0x0020 && code <= 0x007e) {\n // Printable ASCII\n const char = String.fromCodePoint(code);\n return char === '\"' ? \"'\\\"'\" : `\"${char}\"`;\n } // Unicode code point\n\n return 'U+' + code.toString(16).toUpperCase().padStart(4, '0');\n}\n/\n Create a token with line and column location information.\n \n @internal\n /\n\nexport function createToken(lexer, kind, start, end, value) {\n const line = lexer.line;\n const col = 1 + start - lexer.lineStart;\n return new Token(kind, start, end, line, col, value);\n}\n/\n Gets the next token from the source starting at the given position.\n \n This skips over whitespace until it finds the next lexable token, then lexes\n * punctuators immediately or calls the appropriate helper function for more\n * complicated tokens.\n /\n\nfunction readNextToken(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // SourceCharacter\n\n switch (code) {\n // Ignored ::\n // - UnicodeBOM\n // - WhiteSpace\n // - LineTerminator\n // - Comment\n // - Comma\n //\n // UnicodeBOM :: \"Byte Order Mark (U+FEFF)\"\n //\n // WhiteSpace ::\n // - \"Horizontal Tab (U+0009)\"\n // - \"Space (U+0020)\"\n //\n // Comma :: ,\n case 0xfeff: // <BOM>\n\n case 0x0009: // \\t\n\n case 0x0020: // <space>\n\n case 0x002c:\n // ,\n ++position;\n continue;\n // LineTerminator ::\n // - \"New Line (U+000A)\"\n // - \"Carriage Return (U+000D)\" [lookahead != \"New Line (U+000A)\"]\n // - \"Carriage Return (U+000D)\" \"New Line (U+000A)\"\n\n case 0x000a:\n // \\n\n ++position;\n ++lexer.line;\n lexer.lineStart = position;\n continue;\n\n case 0x000d:\n // \\r\n if (body.charCodeAt(position + 1) === 0x000a) {\n position += 2;\n } else {\n ++position;\n }\n\n ++lexer.line;\n lexer.lineStart = position;\n continue;\n // Comment\n\n case 0x0023:\n // #\n return readComment(lexer, position);\n // Token ::\n // - Punctuator\n // - Name\n // - IntValue\n // - FloatValue\n // - StringValue\n //\n // Punctuator :: one of ! $ & ( ) ... : = @ [ ] { \| }\n\n case 0x0021:\n // !\n return createToken(lexer, TokenKind.BANG, position, position + 1);\n\n case 0x0024:\n // $\n return createToken(lexer, TokenKind.DOLLAR, position, position + 1);\n\n case 0x0026:\n // &\n return createToken(lexer, TokenKind.AMP, position, position + 1);\n\n case 0x0028:\n // (\n return createToken(lexer, TokenKind.PAREN_L, position, position + 1);\n\n case 0x0029:\n // )\n return createToken(lexer, TokenKind.PAREN_R, position, position + 1);\n\n case 0x002e:\n // .\n if (\n body.charCodeAt(position + 1) === 0x002e &&\n body.charCodeAt(position + 2) === 0x002e\n ) {\n return createToken(lexer, TokenKind.SPREAD, position, position + 3);\n }\n\n break;\n\n case 0x003a:\n // :\n return createToken(lexer, TokenKind.COLON, position, position + 1);\n\n case 0x003d:\n // =\n return createToken(lexer, TokenKind.EQUALS, position, position + 1);\n\n case 0x0040:\n // @\n return createToken(lexer, TokenKind.AT, position, position + 1);\n\n case 0x005b:\n // [\n return createToken(lexer, TokenKind.BRACKET_L, position, position + 1);\n\n case 0x005d:\n // ]\n return createToken(lexer, TokenKind.BRACKET_R, position, position + 1);\n\n case 0x007b:\n // {\n return createToken(lexer, TokenKind.BRACE_L, position, position + 1);\n\n case 0x007c:\n // \|\n return createToken(lexer, TokenKind.PIPE, position, position + 1);\n\n case 0x007d:\n // }\n return createToken(lexer, TokenKind.BRACE_R, position, position + 1);\n // StringValue\n\n case 0x0022:\n // \"\n if (\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022\n ) {\n return readBlockString(lexer, position);\n }\n\n return readString(lexer, position);\n } // IntValue \| FloatValue (Digit \| -)\n\n if (isDigit(code) \|\| code === 0x002d) {\n return readNumber(lexer, position, code);\n } // Name\n\n if (isNameStart(code)) {\n return readName(lexer, position);\n }\n\n throw syntaxError(\n lexer.source,\n position,\n code === 0x0027\n ? 'Unexpected single quote character (\\'), did you mean to use a double quote (\")?'\n : isUnicodeScalarValue(code) \|\| isSupplementaryCodePoint(body, position)\n ? `Unexpected character: ${printCodePointAt(lexer, position)}.`\n : `Invalid character: ${printCodePointAt(lexer, position)}.`,\n );\n }\n\n return createToken(lexer, TokenKind.EOF, bodyLength, bodyLength);\n}\n/\n Reads a comment token from the source file.\n \n ```\n * Comment :: # CommentChar* [lookahead != CommentChar]\n \n CommentChar :: SourceCharacter but not LineTerminator\n * ```\n /\n\nfunction readComment(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // LineTerminator (\\n \| \\r)\n\n if (code === 0x000a \|\| code === 0x000d) {\n break;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n break;\n }\n }\n\n return createToken(\n lexer,\n TokenKind.COMMENT,\n start,\n position,\n body.slice(start + 1, position),\n );\n}\n/\n Reads a number token from the source file, either a FloatValue or an IntValue\n * depending on whether a FractionalPart or ExponentPart is encountered.\n \n ```\n * IntValue :: IntegerPart [lookahead != {Digit, `.`, NameStart}]\n \n IntegerPart ::\n * - NegativeSign? 0\n * - NegativeSign? NonZeroDigit Digit\n \n * NegativeSign :: -\n \n NonZeroDigit :: Digit but not `0`\n \n FloatValue ::\n * - IntegerPart FractionalPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n * - IntegerPart FractionalPart [lookahead != {Digit, `.`, NameStart}]\n * - IntegerPart ExponentPart [lookahead != {Digit, `.`, NameStart}]\n \n FractionalPart :: . Digit+\n \n ExponentPart :: ExponentIndicator Sign? Digit+\n \n ExponentIndicator :: one of `e` `E`\n \n Sign :: one of + -\n * ```\n /\n\nfunction readNumber(lexer, start, firstCode) {\n const body = lexer.source.body;\n let position = start;\n let code = firstCode;\n let isFloat = false; // NegativeSign (-)\n\n if (code === 0x002d) {\n code = body.charCodeAt(++position);\n } // Zero (0)\n\n if (code === 0x0030) {\n code = body.charCodeAt(++position);\n\n if (isDigit(code)) {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid number, unexpected digit after 0: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n } else {\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // Full stop (.)\n\n if (code === 0x002e) {\n isFloat = true;\n code = body.charCodeAt(++position);\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // E e\n\n if (code === 0x0045 \|\| code === 0x0065) {\n isFloat = true;\n code = body.charCodeAt(++position); // + -\n\n if (code === 0x002b \|\| code === 0x002d) {\n code = body.charCodeAt(++position);\n }\n\n position = readDigits(lexer, position, code);\n code = body.charCodeAt(position);\n } // Numbers cannot be followed by . or NameStart\n\n if (code === 0x002e \|\| isNameStart(code)) {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid number, expected digit but got: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n\n return createToken(\n lexer,\n isFloat ? TokenKind.FLOAT : TokenKind.INT,\n start,\n position,\n body.slice(start, position),\n );\n}\n/\n Returns the new position in the source after reading one or more digits.\n /\n\nfunction readDigits(lexer, start, firstCode) {\n if (!isDigit(firstCode)) {\n throw syntaxError(\n lexer.source,\n start,\n `Invalid number, expected digit but got: ${printCodePointAt(\n lexer,\n start,\n )}.`,\n );\n }\n\n const body = lexer.source.body;\n let position = start + 1; // +1 to skip first firstCode\n\n while (isDigit(body.charCodeAt(position))) {\n ++position;\n }\n\n return position;\n}\n/\n Reads a single-quote string token from the source file.\n \n ```\n * StringValue ::\n * - `\"\"` [lookahead != `\"`]\n * - `\"` StringCharacter+ `\"`\n \n StringCharacter ::\n * - SourceCharacter but not `\"` or `\\` or LineTerminator\n * - `\\u` EscapedUnicode\n * - `\\` EscapedCharacter\n \n EscapedUnicode ::\n * - `{` HexDigit+ `}`\n * - HexDigit HexDigit HexDigit HexDigit\n \n EscapedCharacter :: one of `\"` `\\` `/` `b` `f` `n` `r` `t`\n * ```\n /\n\nfunction readString(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n let chunkStart = position;\n let value = '';\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // Closing Quote (\")\n\n if (code === 0x0022) {\n value += body.slice(chunkStart, position);\n return createToken(lexer, TokenKind.STRING, start, position + 1, value);\n } // Escape Sequence (\\)\n\n if (code === 0x005c) {\n value += body.slice(chunkStart, position);\n const escape =\n body.charCodeAt(position + 1) === 0x0075 // u\n ? body.charCodeAt(position + 2) === 0x007b // {\n ? readEscapedUnicodeVariableWidth(lexer, position)\n : readEscapedUnicodeFixedWidth(lexer, position)\n : readEscapedCharacter(lexer, position);\n value += escape.value;\n position += escape.size;\n chunkStart = position;\n continue;\n } // LineTerminator (\\n \| \\r)\n\n if (code === 0x000a \|\| code === 0x000d) {\n break;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character within String: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n }\n\n throw syntaxError(lexer.source, position, 'Unterminated string.');\n} // The string value and lexed size of an escape sequence.\n\nfunction readEscapedUnicodeVariableWidth(lexer, position) {\n const body = lexer.source.body;\n let point = 0;\n let size = 3; // Cannot be larger than 12 chars (\\u{00000000}).\n\n while (size < 12) {\n const code = body.charCodeAt(position + size++); // Closing Brace (})\n\n if (code === 0x007d) {\n // Must be at least 5 chars (\\u{0}) and encode a Unicode scalar value.\n if (size < 5 \|\| !isUnicodeScalarValue(point)) {\n break;\n }\n\n return {\n value: String.fromCodePoint(point),\n size,\n };\n } // Append this hex digit to the code point.\n\n point = (point << 4) \| readHexDigit(code);\n\n if (point < 0) {\n break;\n }\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid Unicode escape sequence: \"${body.slice(\n position,\n position + size,\n )}\".`,\n );\n}\n\nfunction readEscapedUnicodeFixedWidth(lexer, position) {\n const body = lexer.source.body;\n const code = read16BitHexCode(body, position + 2);\n\n if (isUnicodeScalarValue(code)) {\n return {\n value: String.fromCodePoint(code),\n size: 6,\n };\n } // GraphQL allows JSON-style surrogate pair escape sequences, but only when\n // a valid pair is formed.\n\n if (isLeadingSurrogate(code)) {\n // \\u\n if (\n body.charCodeAt(position + 6) === 0x005c &&\n body.charCodeAt(position + 7) === 0x0075\n ) {\n const trailingCode = read16BitHexCode(body, position + 8);\n\n if (isTrailingSurrogate(trailingCode)) {\n // JavaScript defines strings as a sequence of UTF-16 code units and\n // encodes Unicode code points above U+FFFF using a surrogate pair of\n // code units. Since this is a surrogate pair escape sequence, just\n // include both codes into the JavaScript string value. Had JavaScript\n // not been internally based on UTF-16, then this surrogate pair would\n // be decoded to retrieve the supplementary code point.\n return {\n value: String.fromCodePoint(code, trailingCode),\n size: 12,\n };\n }\n }\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid Unicode escape sequence: \"${body.slice(position, position + 6)}\".`,\n );\n}\n/\n Reads four hexadecimal characters and returns the positive integer that 16bit\n * hexadecimal string represents. For example, \"000f\" will return 15, and \"dead\"\n * will return 57005.\n \n Returns a negative number if any char was not a valid hexadecimal digit.\n /\n\nfunction read16BitHexCode(body, position) {\n // readHexDigit() returns -1 on error. ORing a negative value with any other\n // value always produces a negative value.\n return (\n (readHexDigit(body.charCodeAt(position)) << 12) \|\n (readHexDigit(body.charCodeAt(position + 1)) << 8) \|\n (readHexDigit(body.charCodeAt(position + 2)) << 4) \|\n readHexDigit(body.charCodeAt(position + 3))\n );\n}\n/\n Reads a hexadecimal character and returns its positive integer value (0-15).\n \n '0' becomes 0, '9' becomes 9\n * 'A' becomes 10, 'F' becomes 15\n * 'a' becomes 10, 'f' becomes 15\n \n Returns -1 if the provided character code was not a valid hexadecimal digit.\n \n HexDigit :: one of\n * - `0` `1` `2` `3` `4` `5` `6` `7` `8` `9`\n * - `A` `B` `C` `D` `E` `F`\n * - `a` `b` `c` `d` `e` `f`\n /\n\nfunction readHexDigit(code) {\n return code >= 0x0030 && code <= 0x0039 // 0-9\n ? code - 0x0030\n : code >= 0x0041 && code <= 0x0046 // A-F\n ? code - 0x0037\n : code >= 0x0061 && code <= 0x0066 // a-f\n ? code - 0x0057\n : -1;\n}\n/\n \| Escaped Character \| Code Point \| Character Name \|\n * \| ----------------- \| ---------- \| ---------------------------- \|\n * \| `\"` \| U+0022 \| double quote \|\n * \| `\\` \| U+005C \| reverse solidus (back slash) \|\n * \| `/` \| U+002F \| solidus (forward slash) \|\n * \| `b` \| U+0008 \| backspace \|\n * \| `f` \| U+000C \| form feed \|\n * \| `n` \| U+000A \| line feed (new line) \|\n * \| `r` \| U+000D \| carriage return \|\n * \| `t` \| U+0009 \| horizontal tab \|\n /\n\nfunction readEscapedCharacter(lexer, position) {\n const body = lexer.source.body;\n const code = body.charCodeAt(position + 1);\n\n switch (code) {\n case 0x0022:\n // \"\n return {\n value: '\\u0022',\n size: 2,\n };\n\n case 0x005c:\n // \\\n return {\n value: '\\u005c',\n size: 2,\n };\n\n case 0x002f:\n // /\n return {\n value: '\\u002f',\n size: 2,\n };\n\n case 0x0062:\n // b\n return {\n value: '\\u0008',\n size: 2,\n };\n\n case 0x0066:\n // f\n return {\n value: '\\u000c',\n size: 2,\n };\n\n case 0x006e:\n // n\n return {\n value: '\\u000a',\n size: 2,\n };\n\n case 0x0072:\n // r\n return {\n value: '\\u000d',\n size: 2,\n };\n\n case 0x0074:\n // t\n return {\n value: '\\u0009',\n size: 2,\n };\n }\n\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character escape sequence: \"${body.slice(\n position,\n position + 2,\n )}\".`,\n );\n}\n/\n Reads a block string token from the source file.\n \n ```\n * StringValue ::\n * - `\"\"\"` BlockStringCharacter* `\"\"\"`\n \n BlockStringCharacter ::\n * - SourceCharacter but not `\"\"\"` or `\\\"\"\"`\n * - `\\\"\"\"`\n * ```\n /\n\nfunction readBlockString(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let lineStart = lexer.lineStart;\n let position = start + 3;\n let chunkStart = position;\n let currentLine = '';\n const blockLines = [];\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position); // Closing Triple-Quote (\"\"\")\n\n if (\n code === 0x0022 &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022\n ) {\n currentLine += body.slice(chunkStart, position);\n blockLines.push(currentLine);\n const token = createToken(\n lexer,\n TokenKind.BLOCK_STRING,\n start,\n position + 3, // Return a string of the lines joined with U+000A.\n dedentBlockStringLines(blockLines).join('\\n'),\n );\n lexer.line += blockLines.length - 1;\n lexer.lineStart = lineStart;\n return token;\n } // Escaped Triple-Quote (\\\"\"\")\n\n if (\n code === 0x005c &&\n body.charCodeAt(position + 1) === 0x0022 &&\n body.charCodeAt(position + 2) === 0x0022 &&\n body.charCodeAt(position + 3) === 0x0022\n ) {\n currentLine += body.slice(chunkStart, position);\n chunkStart = position + 1; // skip only slash\n\n position += 4;\n continue;\n } // LineTerminator\n\n if (code === 0x000a \|\| code === 0x000d) {\n currentLine += body.slice(chunkStart, position);\n blockLines.push(currentLine);\n\n if (code === 0x000d && body.charCodeAt(position + 1) === 0x000a) {\n position += 2;\n } else {\n ++position;\n }\n\n currentLine = '';\n chunkStart = position;\n lineStart = position;\n continue;\n } // SourceCharacter\n\n if (isUnicodeScalarValue(code)) {\n ++position;\n } else if (isSupplementaryCodePoint(body, position)) {\n position += 2;\n } else {\n throw syntaxError(\n lexer.source,\n position,\n `Invalid character within String: ${printCodePointAt(\n lexer,\n position,\n )}.`,\n );\n }\n }\n\n throw syntaxError(lexer.source, position, 'Unterminated string.');\n}\n/\n Reads an alphanumeric + underscore name from the source.\n \n ```\n * Name ::\n * - NameStart NameContinue* [lookahead != NameContinue]\n * ```\n \n @internal\n /\n\nexport function readName(lexer, start) {\n const body = lexer.source.body;\n const bodyLength = body.length;\n let position = start + 1;\n\n while (position < bodyLength) {\n const code = body.charCodeAt(position);\n\n if (isNameContinue(code)) {\n ++position;\n } else {\n break;\n }\n }\n\n return createToken(\n lexer,\n TokenKind.NAME,\n start,\n position,\n body.slice(start, position),\n );\n}\n","const MAX_ARRAY_LENGTH = 10;\nconst MAX_RECURSIVE_DEPTH = 2;\n/\n Used to print values in error messages.\n /\n\nexport function inspect(value) {\n return formatValue(value, []);\n}\n\nfunction formatValue(value, seenValues) {\n switch (typeof value) {\n case 'string':\n return JSON.stringify(value);\n\n case 'function':\n return value.name ? `[function ${value.name}]` : '[function]';\n\n case 'object':\n return formatObjectValue(value, seenValues);\n\n default:\n return String(value);\n }\n}\n\nfunction formatObjectValue(value, previouslySeenValues) {\n if (value === null) {\n return 'null';\n }\n\n if (previouslySeenValues.includes(value)) {\n return '[Circular]';\n }\n\n const seenValues = [...previouslySeenValues, value];\n\n if (isJSONable(value)) {\n const jsonValue = value.toJSON(); // check for infinite recursion\n\n if (jsonValue !== value) {\n return typeof jsonValue === 'string'\n ? jsonValue\n : formatValue(jsonValue, seenValues);\n }\n } else if (Array.isArray(value)) {\n return formatArray(value, seenValues);\n }\n\n return formatObject(value, seenValues);\n}\n\nfunction isJSONable(value) {\n return typeof value.toJSON === 'function';\n}\n\nfunction formatObject(object, seenValues) {\n const entries = Object.entries(object);\n\n if (entries.length === 0) {\n return '{}';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[' + getObjectTag(object) + ']';\n }\n\n const properties = entries.map(\n ([key, value]) => key + ': ' + formatValue(value, seenValues),\n );\n return '{ ' + properties.join(', ') + ' }';\n}\n\nfunction formatArray(array, seenValues) {\n if (array.length === 0) {\n return '[]';\n }\n\n if (seenValues.length > MAX_RECURSIVE_DEPTH) {\n return '[Array]';\n }\n\n const len = Math.min(MAX_ARRAY_LENGTH, array.length);\n const remaining = array.length - len;\n const items = [];\n\n for (let i = 0; i < len; ++i) {\n items.push(formatValue(array[i], seenValues));\n }\n\n if (remaining === 1) {\n items.push('... 1 more item');\n } else if (remaining > 1) {\n items.push(`... ${remaining} more items`);\n }\n\n return '[' + items.join(', ') + ']';\n}\n\nfunction getObjectTag(object) {\n const tag = Object.prototype.toString\n .call(object)\n .replace(/^\\[object /, '')\n .replace(/]$/, '');\n\n if (tag === 'Object' && typeof object.constructor === 'function') {\n const name = object.constructor.name;\n\n if (typeof name === 'string' && name !== '') {\n return name;\n }\n }\n\n return tag;\n}\n","import { inspect } from './inspect.mjs';\n/ c8 ignore next 3 /\n\nconst isProduction =\n globalThis.process && // eslint-disable-next-line no-undef\n process.env.NODE_ENV === 'production';\n/\n A replacement for instanceof which includes an error warning when multi-realm\n * constructors are detected.\n * See: https://expressjs.com/en/advanced/best-practice-performance.html#set-node_env-to-production\n * See: https://webpack.js.org/guides/production/\n /\n\nexport const instanceOf =\n / c8 ignore next 6 /\n // FIXME: https://github.com/graphql/graphql-js/issues/2317\n isProduction\n ? function instanceOf(value, constructor) {\n return value instanceof constructor;\n }\n : function instanceOf(value, constructor) {\n if (value instanceof constructor) {\n return true;\n }\n\n if (typeof value === 'object' && value !== null) {\n var _value$constructor;\n\n // Prefer Symbol.toStringTag since it is immune to minification.\n const className = constructor.prototype[Symbol.toStringTag];\n const valueClassName = // We still need to support constructor's name to detect conflicts with older versions of this library.\n Symbol.toStringTag in value // @ts-expect-error TS bug see, https://github.com/microsoft/TypeScript/issues/38009\n ? value[Symbol.toStringTag]\n : (_value$constructor = value.constructor) === null \|\|\n _value$constructor === void 0\n ? void 0\n : _value$constructor.name;\n\n if (className === valueClassName) {\n const stringifiedValue = inspect(value);\n throw new Error(`Cannot use ${className} \"${stringifiedValue}\" from another module or realm.\n\nEnsure that there is only one instance of \"graphql\" in the node_modules\ndirectory. If different versions of \"graphql\" are the dependencies of other\nrelied on modules, use \"resolutions\" to ensure only one version is installed.\n\nhttps://yarnpkg.com/en/docs/selective-version-resolutions\n\nDuplicate \"graphql\" modules cannot be used at the same time since different\nversions may have different capabilities and behavior. The data from one\nversion used in the function from another could produce confusing and\nspurious results.`);\n }\n }\n\n return false;\n };\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { instanceOf } from '../jsutils/instanceOf.mjs';\n\n/\n A representation of source input to GraphQL. The `name` and `locationOffset` parameters are\n * optional, but they are useful for clients who store GraphQL documents in source files.\n * For example, if the GraphQL input starts at line 40 in a file named `Foo.graphql`, it might\n * be useful for `name` to be `\"Foo.graphql\"` and location to be `{ line: 40, column: 1 }`.\n * The `line` and `column` properties in `locationOffset` are 1-indexed.\n /\nexport class Source {\n constructor(\n body,\n name = 'GraphQL request',\n locationOffset = {\n line: 1,\n column: 1,\n },\n ) {\n typeof body === 'string' \|\|\n devAssert(false, `Body must be a string. Received: ${inspect(body)}.`);\n this.body = body;\n this.name = name;\n this.locationOffset = locationOffset;\n this.locationOffset.line > 0 \|\|\n devAssert(\n false,\n 'line in locationOffset is 1-indexed and must be positive.',\n );\n this.locationOffset.column > 0 \|\|\n devAssert(\n false,\n 'column in locationOffset is 1-indexed and must be positive.',\n );\n }\n\n get [Symbol.toStringTag]() {\n return 'Source';\n }\n}\n/\n Test if the given value is a Source object.\n \n @internal\n /\n\nexport function isSource(source) {\n return instanceOf(source, Source);\n}\n","import { syntaxError } from '../error/syntaxError.mjs';\nimport { Location, OperationTypeNode } from './ast.mjs';\nimport { DirectiveLocation } from './directiveLocation.mjs';\nimport { Kind } from './kinds.mjs';\nimport { isPunctuatorTokenKind, Lexer } from './lexer.mjs';\nimport { SchemaCoordinateLexer } from './schemaCoordinateLexer.mjs';\nimport { isSource, Source } from './source.mjs';\nimport { TokenKind } from './tokenKind.mjs';\n/\n Configuration options to control parser behavior\n /\n\n/\n Given a GraphQL source, parses it into a Document.\n * Throws GraphQLError if a syntax error is encountered.\n /\nexport function parse(source, options) {\n const parser = new Parser(source, options);\n const document = parser.parseDocument();\n Object.defineProperty(document, 'tokenCount', {\n enumerable: false,\n value: parser.tokenCount,\n });\n return document;\n}\n/\n Given a string containing a GraphQL value (ex. `[42]`), parse the AST for\n * that value.\n * Throws GraphQLError if a syntax error is encountered.\n \n This is useful within tools that operate upon GraphQL Values directly and\n * in isolation of complete GraphQL documents.\n \n Consider providing the results to the utility function: valueFromAST().\n /\n\nexport function parseValue(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const value = parser.parseValueLiteral(false);\n parser.expectToken(TokenKind.EOF);\n return value;\n}\n/\n Similar to parseValue(), but raises a parse error if it encounters a\n * variable. The return type will be a constant value.\n /\n\nexport function parseConstValue(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const value = parser.parseConstValueLiteral();\n parser.expectToken(TokenKind.EOF);\n return value;\n}\n/\n Given a string containing a GraphQL Type (ex. `[Int!]`), parse the AST for\n * that type.\n * Throws GraphQLError if a syntax error is encountered.\n \n This is useful within tools that operate upon GraphQL Types directly and\n * in isolation of complete GraphQL documents.\n \n Consider providing the results to the utility function: typeFromAST().\n /\n\nexport function parseType(source, options) {\n const parser = new Parser(source, options);\n parser.expectToken(TokenKind.SOF);\n const type = parser.parseTypeReference();\n parser.expectToken(TokenKind.EOF);\n return type;\n}\n/\n Given a string containing a GraphQL Schema Coordinate (ex. `Type.field`),\n * parse the AST for that schema coordinate.\n * Throws GraphQLError if a syntax error is encountered.\n \n Consider providing the results to the utility function:\n * resolveASTSchemaCoordinate(). Or calling resolveSchemaCoordinate() directly\n * with an unparsed source.\n /\n\nexport function parseSchemaCoordinate(source) {\n const sourceObj = isSource(source) ? source : new Source(source);\n const lexer = new SchemaCoordinateLexer(sourceObj);\n const parser = new Parser(source, {\n lexer,\n });\n parser.expectToken(TokenKind.SOF);\n const coordinate = parser.parseSchemaCoordinate();\n parser.expectToken(TokenKind.EOF);\n return coordinate;\n}\n/\n This class is exported only to assist people in implementing their own parsers\n * without duplicating too much code and should be used only as last resort for cases\n * such as experimental syntax or if certain features could not be contributed upstream.\n \n It is still part of the internal API and is versioned, so any changes to it are never\n * considered breaking changes. If you still need to support multiple versions of the\n * library, please use the `versionInfo` variable for version detection.\n \n @internal\n /\n\nexport class Parser {\n constructor(source, options = {}) {\n const { lexer, ..._options } = options;\n\n if (lexer) {\n this._lexer = lexer;\n } else {\n const sourceObj = isSource(source) ? source : new Source(source);\n this._lexer = new Lexer(sourceObj);\n }\n\n this._options = _options;\n this._tokenCounter = 0;\n }\n\n get tokenCount() {\n return this._tokenCounter;\n }\n /\n Converts a name lex token into a name parse node.\n /\n\n parseName() {\n const token = this.expectToken(TokenKind.NAME);\n return this.node(token, {\n kind: Kind.NAME,\n value: token.value,\n });\n } // Implements the parsing rules in the Document section.\n\n /\n Document : Definition+\n /\n\n parseDocument() {\n return this.node(this._lexer.token, {\n kind: Kind.DOCUMENT,\n definitions: this.many(\n TokenKind.SOF,\n this.parseDefinition,\n TokenKind.EOF,\n ),\n });\n }\n /\n Definition :\n * - ExecutableDefinition\n * - TypeSystemDefinition\n * - TypeSystemExtension\n \n ExecutableDefinition :\n * - OperationDefinition\n * - FragmentDefinition\n \n TypeSystemDefinition :\n * - SchemaDefinition\n * - TypeDefinition\n * - DirectiveDefinition\n \n TypeDefinition :\n * - ScalarTypeDefinition\n * - ObjectTypeDefinition\n * - InterfaceTypeDefinition\n * - UnionTypeDefinition\n * - EnumTypeDefinition\n * - InputObjectTypeDefinition\n /\n\n parseDefinition() {\n if (this.peek(TokenKind.BRACE_L)) {\n return this.parseOperationDefinition();\n } // Many definitions begin with a description and require a lookahead.\n\n const hasDescription = this.peekDescription();\n const keywordToken = hasDescription\n ? this._lexer.lookahead()\n : this._lexer.token;\n\n if (hasDescription && keywordToken.kind === TokenKind.BRACE_L) {\n throw syntaxError(\n this._lexer.source,\n this._lexer.token.start,\n 'Unexpected description, descriptions are not supported on shorthand queries.',\n );\n }\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaDefinition();\n\n case 'scalar':\n return this.parseScalarTypeDefinition();\n\n case 'type':\n return this.parseObjectTypeDefinition();\n\n case 'interface':\n return this.parseInterfaceTypeDefinition();\n\n case 'union':\n return this.parseUnionTypeDefinition();\n\n case 'enum':\n return this.parseEnumTypeDefinition();\n\n case 'input':\n return this.parseInputObjectTypeDefinition();\n\n case 'directive':\n return this.parseDirectiveDefinition();\n }\n\n switch (keywordToken.value) {\n case 'query':\n case 'mutation':\n case 'subscription':\n return this.parseOperationDefinition();\n\n case 'fragment':\n return this.parseFragmentDefinition();\n }\n\n if (hasDescription) {\n throw syntaxError(\n this._lexer.source,\n this._lexer.token.start,\n 'Unexpected description, only GraphQL definitions support descriptions.',\n );\n }\n\n switch (keywordToken.value) {\n case 'extend':\n return this.parseTypeSystemExtension();\n }\n }\n\n throw this.unexpected(keywordToken);\n } // Implements the parsing rules in the Operations section.\n\n /\n OperationDefinition :\n * - SelectionSet\n * - OperationType Name? VariableDefinitions? Directives? SelectionSet\n /\n\n parseOperationDefinition() {\n const start = this._lexer.token;\n\n if (this.peek(TokenKind.BRACE_L)) {\n return this.node(start, {\n kind: Kind.OPERATION_DEFINITION,\n operation: OperationTypeNode.QUERY,\n description: undefined,\n name: undefined,\n variableDefinitions: [],\n directives: [],\n selectionSet: this.parseSelectionSet(),\n });\n }\n\n const description = this.parseDescription();\n const operation = this.parseOperationType();\n let name;\n\n if (this.peek(TokenKind.NAME)) {\n name = this.parseName();\n }\n\n return this.node(start, {\n kind: Kind.OPERATION_DEFINITION,\n operation,\n description,\n name,\n variableDefinitions: this.parseVariableDefinitions(),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n OperationType : one of query mutation subscription\n /\n\n parseOperationType() {\n const operationToken = this.expectToken(TokenKind.NAME);\n\n switch (operationToken.value) {\n case 'query':\n return OperationTypeNode.QUERY;\n\n case 'mutation':\n return OperationTypeNode.MUTATION;\n\n case 'subscription':\n return OperationTypeNode.SUBSCRIPTION;\n }\n\n throw this.unexpected(operationToken);\n }\n /\n VariableDefinitions : ( VariableDefinition+ )\n /\n\n parseVariableDefinitions() {\n return this.optionalMany(\n TokenKind.PAREN_L,\n this.parseVariableDefinition,\n TokenKind.PAREN_R,\n );\n }\n /\n VariableDefinition : Variable : Type DefaultValue? Directives[Const]?\n /\n\n parseVariableDefinition() {\n return this.node(this._lexer.token, {\n kind: Kind.VARIABLE_DEFINITION,\n description: this.parseDescription(),\n variable: this.parseVariable(),\n type: (this.expectToken(TokenKind.COLON), this.parseTypeReference()),\n defaultValue: this.expectOptionalToken(TokenKind.EQUALS)\n ? this.parseConstValueLiteral()\n : undefined,\n directives: this.parseConstDirectives(),\n });\n }\n /\n Variable : $ Name\n /\n\n parseVariable() {\n const start = this._lexer.token;\n this.expectToken(TokenKind.DOLLAR);\n return this.node(start, {\n kind: Kind.VARIABLE,\n name: this.parseName(),\n });\n }\n /\n ```\n * SelectionSet : { Selection+ }\n * ```\n /\n\n parseSelectionSet() {\n return this.node(this._lexer.token, {\n kind: Kind.SELECTION_SET,\n selections: this.many(\n TokenKind.BRACE_L,\n this.parseSelection,\n TokenKind.BRACE_R,\n ),\n });\n }\n /\n Selection :\n * - Field\n * - FragmentSpread\n * - InlineFragment\n /\n\n parseSelection() {\n return this.peek(TokenKind.SPREAD)\n ? this.parseFragment()\n : this.parseField();\n }\n /\n Field : Alias? Name Arguments? Directives? SelectionSet?\n \n Alias : Name :\n /\n\n parseField() {\n const start = this._lexer.token;\n const nameOrAlias = this.parseName();\n let alias;\n let name;\n\n if (this.expectOptionalToken(TokenKind.COLON)) {\n alias = nameOrAlias;\n name = this.parseName();\n } else {\n name = nameOrAlias;\n }\n\n return this.node(start, {\n kind: Kind.FIELD,\n alias,\n name,\n arguments: this.parseArguments(false),\n directives: this.parseDirectives(false),\n selectionSet: this.peek(TokenKind.BRACE_L)\n ? this.parseSelectionSet()\n : undefined,\n });\n }\n /\n Arguments[Const] : ( Argument[?Const]+ )\n /\n\n parseArguments(isConst) {\n const item = isConst ? this.parseConstArgument : this.parseArgument;\n return this.optionalMany(TokenKind.PAREN_L, item, TokenKind.PAREN_R);\n }\n /\n Argument[Const] : Name : Value[?Const]\n /\n\n parseArgument(isConst = false) {\n const start = this._lexer.token;\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return this.node(start, {\n kind: Kind.ARGUMENT,\n name,\n value: this.parseValueLiteral(isConst),\n });\n }\n\n parseConstArgument() {\n return this.parseArgument(true);\n } // Implements the parsing rules in the Fragments section.\n\n /\n Corresponds to both FragmentSpread and InlineFragment in the spec.\n \n FragmentSpread : ... FragmentName Directives?\n \n InlineFragment : ... TypeCondition? Directives? SelectionSet\n /\n\n parseFragment() {\n const start = this._lexer.token;\n this.expectToken(TokenKind.SPREAD);\n const hasTypeCondition = this.expectOptionalKeyword('on');\n\n if (!hasTypeCondition && this.peek(TokenKind.NAME)) {\n return this.node(start, {\n kind: Kind.FRAGMENT_SPREAD,\n name: this.parseFragmentName(),\n directives: this.parseDirectives(false),\n });\n }\n\n return this.node(start, {\n kind: Kind.INLINE_FRAGMENT,\n typeCondition: hasTypeCondition ? this.parseNamedType() : undefined,\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n FragmentDefinition :\n * - fragment FragmentName on TypeCondition Directives? SelectionSet\n \n TypeCondition : NamedType\n /\n\n parseFragmentDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('fragment'); // Legacy support for defining variables within fragments changes\n // the grammar of FragmentDefinition:\n // - fragment FragmentName VariableDefinitions? on TypeCondition Directives? SelectionSet\n\n if (this._options.allowLegacyFragmentVariables === true) {\n return this.node(start, {\n kind: Kind.FRAGMENT_DEFINITION,\n description,\n name: this.parseFragmentName(),\n variableDefinitions: this.parseVariableDefinitions(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n\n return this.node(start, {\n kind: Kind.FRAGMENT_DEFINITION,\n description,\n name: this.parseFragmentName(),\n typeCondition: (this.expectKeyword('on'), this.parseNamedType()),\n directives: this.parseDirectives(false),\n selectionSet: this.parseSelectionSet(),\n });\n }\n /\n FragmentName : Name but not `on`\n /\n\n parseFragmentName() {\n if (this._lexer.token.value === 'on') {\n throw this.unexpected();\n }\n\n return this.parseName();\n } // Implements the parsing rules in the Values section.\n\n /\n Value[Const] :\n * - [~Const] Variable\n * - IntValue\n * - FloatValue\n * - StringValue\n * - BooleanValue\n * - NullValue\n * - EnumValue\n * - ListValue[?Const]\n * - ObjectValue[?Const]\n \n BooleanValue : one of `true` `false`\n \n NullValue : `null`\n \n EnumValue : Name but not `true`, `false` or `null`\n /\n\n parseValueLiteral(isConst) {\n const token = this._lexer.token;\n\n switch (token.kind) {\n case TokenKind.BRACKET_L:\n return this.parseList(isConst);\n\n case TokenKind.BRACE_L:\n return this.parseObject(isConst);\n\n case TokenKind.INT:\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.INT,\n value: token.value,\n });\n\n case TokenKind.FLOAT:\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.FLOAT,\n value: token.value,\n });\n\n case TokenKind.STRING:\n case TokenKind.BLOCK_STRING:\n return this.parseStringLiteral();\n\n case TokenKind.NAME:\n this.advanceLexer();\n\n switch (token.value) {\n case 'true':\n return this.node(token, {\n kind: Kind.BOOLEAN,\n value: true,\n });\n\n case 'false':\n return this.node(token, {\n kind: Kind.BOOLEAN,\n value: false,\n });\n\n case 'null':\n return this.node(token, {\n kind: Kind.NULL,\n });\n\n default:\n return this.node(token, {\n kind: Kind.ENUM,\n value: token.value,\n });\n }\n\n case TokenKind.DOLLAR:\n if (isConst) {\n this.expectToken(TokenKind.DOLLAR);\n\n if (this._lexer.token.kind === TokenKind.NAME) {\n const varName = this._lexer.token.value;\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Unexpected variable \"$${varName}\" in constant value.`,\n );\n } else {\n throw this.unexpected(token);\n }\n }\n\n return this.parseVariable();\n\n default:\n throw this.unexpected();\n }\n }\n\n parseConstValueLiteral() {\n return this.parseValueLiteral(true);\n }\n\n parseStringLiteral() {\n const token = this._lexer.token;\n this.advanceLexer();\n return this.node(token, {\n kind: Kind.STRING,\n value: token.value,\n block: token.kind === TokenKind.BLOCK_STRING,\n });\n }\n /\n ListValue[Const] :\n * - [ ]\n * - [ Value[?Const]+ ]\n /\n\n parseList(isConst) {\n const item = () => this.parseValueLiteral(isConst);\n\n return this.node(this._lexer.token, {\n kind: Kind.LIST,\n values: this.any(TokenKind.BRACKET_L, item, TokenKind.BRACKET_R),\n });\n }\n /\n ```\n * ObjectValue[Const] :\n * - { }\n * - { ObjectField[?Const]+ }\n * ```\n /\n\n parseObject(isConst) {\n const item = () => this.parseObjectField(isConst);\n\n return this.node(this._lexer.token, {\n kind: Kind.OBJECT,\n fields: this.any(TokenKind.BRACE_L, item, TokenKind.BRACE_R),\n });\n }\n /\n ObjectField[Const] : Name : Value[?Const]\n /\n\n parseObjectField(isConst) {\n const start = this._lexer.token;\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n return this.node(start, {\n kind: Kind.OBJECT_FIELD,\n name,\n value: this.parseValueLiteral(isConst),\n });\n } // Implements the parsing rules in the Directives section.\n\n /\n Directives[Const] : Directive[?Const]+\n /\n\n parseDirectives(isConst) {\n const directives = [];\n\n while (this.peek(TokenKind.AT)) {\n directives.push(this.parseDirective(isConst));\n }\n\n return directives;\n }\n\n parseConstDirectives() {\n return this.parseDirectives(true);\n }\n /\n ```\n * Directive[Const] : @ Name Arguments[?Const]?\n * ```\n /\n\n parseDirective(isConst) {\n const start = this._lexer.token;\n this.expectToken(TokenKind.AT);\n return this.node(start, {\n kind: Kind.DIRECTIVE,\n name: this.parseName(),\n arguments: this.parseArguments(isConst),\n });\n } // Implements the parsing rules in the Types section.\n\n /\n Type :\n * - NamedType\n * - ListType\n * - NonNullType\n /\n\n parseTypeReference() {\n const start = this._lexer.token;\n let type;\n\n if (this.expectOptionalToken(TokenKind.BRACKET_L)) {\n const innerType = this.parseTypeReference();\n this.expectToken(TokenKind.BRACKET_R);\n type = this.node(start, {\n kind: Kind.LIST_TYPE,\n type: innerType,\n });\n } else {\n type = this.parseNamedType();\n }\n\n if (this.expectOptionalToken(TokenKind.BANG)) {\n return this.node(start, {\n kind: Kind.NON_NULL_TYPE,\n type,\n });\n }\n\n return type;\n }\n /\n NamedType : Name\n /\n\n parseNamedType() {\n return this.node(this._lexer.token, {\n kind: Kind.NAMED_TYPE,\n name: this.parseName(),\n });\n } // Implements the parsing rules in the Type Definition section.\n\n peekDescription() {\n return this.peek(TokenKind.STRING) \|\| this.peek(TokenKind.BLOCK_STRING);\n }\n /\n Description : StringValue\n /\n\n parseDescription() {\n if (this.peekDescription()) {\n return this.parseStringLiteral();\n }\n }\n /\n ```\n * SchemaDefinition : Description? schema Directives[Const]? { OperationTypeDefinition+ }\n * ```\n /\n\n parseSchemaDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('schema');\n const directives = this.parseConstDirectives();\n const operationTypes = this.many(\n TokenKind.BRACE_L,\n this.parseOperationTypeDefinition,\n TokenKind.BRACE_R,\n );\n return this.node(start, {\n kind: Kind.SCHEMA_DEFINITION,\n description,\n directives,\n operationTypes,\n });\n }\n /\n OperationTypeDefinition : OperationType : NamedType\n /\n\n parseOperationTypeDefinition() {\n const start = this._lexer.token;\n const operation = this.parseOperationType();\n this.expectToken(TokenKind.COLON);\n const type = this.parseNamedType();\n return this.node(start, {\n kind: Kind.OPERATION_TYPE_DEFINITION,\n operation,\n type,\n });\n }\n /\n ScalarTypeDefinition : Description? scalar Name Directives[Const]?\n /\n\n parseScalarTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_DEFINITION,\n description,\n name,\n directives,\n });\n }\n /\n ObjectTypeDefinition :\n * Description?\n * type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition?\n /\n\n parseObjectTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('type');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n return this.node(start, {\n kind: Kind.OBJECT_TYPE_DEFINITION,\n description,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n ImplementsInterfaces :\n * - implements `&`? NamedType\n * - ImplementsInterfaces & NamedType\n /\n\n parseImplementsInterfaces() {\n return this.expectOptionalKeyword('implements')\n ? this.delimitedMany(TokenKind.AMP, this.parseNamedType)\n : [];\n }\n /\n ```\n * FieldsDefinition : { FieldDefinition+ }\n * ```\n /\n\n parseFieldsDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseFieldDefinition,\n TokenKind.BRACE_R,\n );\n }\n /\n FieldDefinition :\n * - Description? Name ArgumentsDefinition? : Type Directives[Const]?\n /\n\n parseFieldDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseName();\n const args = this.parseArgumentDefs();\n this.expectToken(TokenKind.COLON);\n const type = this.parseTypeReference();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.FIELD_DEFINITION,\n description,\n name,\n arguments: args,\n type,\n directives,\n });\n }\n /\n ArgumentsDefinition : ( InputValueDefinition+ )\n /\n\n parseArgumentDefs() {\n return this.optionalMany(\n TokenKind.PAREN_L,\n this.parseInputValueDef,\n TokenKind.PAREN_R,\n );\n }\n /\n InputValueDefinition :\n * - Description? Name : Type DefaultValue? Directives[Const]?\n /\n\n parseInputValueDef() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseName();\n this.expectToken(TokenKind.COLON);\n const type = this.parseTypeReference();\n let defaultValue;\n\n if (this.expectOptionalToken(TokenKind.EQUALS)) {\n defaultValue = this.parseConstValueLiteral();\n }\n\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.INPUT_VALUE_DEFINITION,\n description,\n name,\n type,\n defaultValue,\n directives,\n });\n }\n /\n InterfaceTypeDefinition :\n * - Description? interface Name Directives[Const]? FieldsDefinition?\n /\n\n parseInterfaceTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('interface');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n return this.node(start, {\n kind: Kind.INTERFACE_TYPE_DEFINITION,\n description,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n UnionTypeDefinition :\n * - Description? union Name Directives[Const]? UnionMemberTypes?\n /\n\n parseUnionTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('union');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const types = this.parseUnionMemberTypes();\n return this.node(start, {\n kind: Kind.UNION_TYPE_DEFINITION,\n description,\n name,\n directives,\n types,\n });\n }\n /\n UnionMemberTypes :\n * - = `\|`? NamedType\n * - UnionMemberTypes \| NamedType\n /\n\n parseUnionMemberTypes() {\n return this.expectOptionalToken(TokenKind.EQUALS)\n ? this.delimitedMany(TokenKind.PIPE, this.parseNamedType)\n : [];\n }\n /\n EnumTypeDefinition :\n * - Description? enum Name Directives[Const]? EnumValuesDefinition?\n /\n\n parseEnumTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('enum');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const values = this.parseEnumValuesDefinition();\n return this.node(start, {\n kind: Kind.ENUM_TYPE_DEFINITION,\n description,\n name,\n directives,\n values,\n });\n }\n /\n ```\n * EnumValuesDefinition : { EnumValueDefinition+ }\n * ```\n /\n\n parseEnumValuesDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseEnumValueDefinition,\n TokenKind.BRACE_R,\n );\n }\n /\n EnumValueDefinition : Description? EnumValue Directives[Const]?\n /\n\n parseEnumValueDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n const name = this.parseEnumValueName();\n const directives = this.parseConstDirectives();\n return this.node(start, {\n kind: Kind.ENUM_VALUE_DEFINITION,\n description,\n name,\n directives,\n });\n }\n /\n EnumValue : Name but not `true`, `false` or `null`\n /\n\n parseEnumValueName() {\n if (\n this._lexer.token.value === 'true' \|\|\n this._lexer.token.value === 'false' \|\|\n this._lexer.token.value === 'null'\n ) {\n throw syntaxError(\n this._lexer.source,\n this._lexer.token.start,\n `${getTokenDesc(\n this._lexer.token,\n )} is reserved and cannot be used for an enum value.`,\n );\n }\n\n return this.parseName();\n }\n /\n InputObjectTypeDefinition :\n * - Description? input Name Directives[Const]? InputFieldsDefinition?\n /\n\n parseInputObjectTypeDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('input');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const fields = this.parseInputFieldsDefinition();\n return this.node(start, {\n kind: Kind.INPUT_OBJECT_TYPE_DEFINITION,\n description,\n name,\n directives,\n fields,\n });\n }\n /\n ```\n * InputFieldsDefinition : { InputValueDefinition+ }\n * ```\n /\n\n parseInputFieldsDefinition() {\n return this.optionalMany(\n TokenKind.BRACE_L,\n this.parseInputValueDef,\n TokenKind.BRACE_R,\n );\n }\n /\n TypeSystemExtension :\n * - SchemaExtension\n * - TypeExtension\n \n TypeExtension :\n * - ScalarTypeExtension\n * - ObjectTypeExtension\n * - InterfaceTypeExtension\n * - UnionTypeExtension\n * - EnumTypeExtension\n * - InputObjectTypeDefinition\n /\n\n parseTypeSystemExtension() {\n const keywordToken = this._lexer.lookahead();\n\n if (keywordToken.kind === TokenKind.NAME) {\n switch (keywordToken.value) {\n case 'schema':\n return this.parseSchemaExtension();\n\n case 'scalar':\n return this.parseScalarTypeExtension();\n\n case 'type':\n return this.parseObjectTypeExtension();\n\n case 'interface':\n return this.parseInterfaceTypeExtension();\n\n case 'union':\n return this.parseUnionTypeExtension();\n\n case 'enum':\n return this.parseEnumTypeExtension();\n\n case 'input':\n return this.parseInputObjectTypeExtension();\n }\n }\n\n throw this.unexpected(keywordToken);\n }\n /\n ```\n * SchemaExtension :\n * - extend schema Directives[Const]? { OperationTypeDefinition+ }\n * - extend schema Directives[Const]\n * ```\n /\n\n parseSchemaExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('schema');\n const directives = this.parseConstDirectives();\n const operationTypes = this.optionalMany(\n TokenKind.BRACE_L,\n this.parseOperationTypeDefinition,\n TokenKind.BRACE_R,\n );\n\n if (directives.length === 0 && operationTypes.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.SCHEMA_EXTENSION,\n directives,\n operationTypes,\n });\n }\n /\n ScalarTypeExtension :\n * - extend scalar Name Directives[Const]\n /\n\n parseScalarTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('scalar');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n\n if (directives.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.SCALAR_TYPE_EXTENSION,\n name,\n directives,\n });\n }\n /\n ObjectTypeExtension :\n * - extend type Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend type Name ImplementsInterfaces? Directives[Const]\n * - extend type Name ImplementsInterfaces\n /\n\n parseObjectTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('type');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n\n if (\n interfaces.length === 0 &&\n directives.length === 0 &&\n fields.length === 0\n ) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.OBJECT_TYPE_EXTENSION,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n InterfaceTypeExtension :\n * - extend interface Name ImplementsInterfaces? Directives[Const]? FieldsDefinition\n * - extend interface Name ImplementsInterfaces? Directives[Const]\n * - extend interface Name ImplementsInterfaces\n /\n\n parseInterfaceTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('interface');\n const name = this.parseName();\n const interfaces = this.parseImplementsInterfaces();\n const directives = this.parseConstDirectives();\n const fields = this.parseFieldsDefinition();\n\n if (\n interfaces.length === 0 &&\n directives.length === 0 &&\n fields.length === 0\n ) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.INTERFACE_TYPE_EXTENSION,\n name,\n interfaces,\n directives,\n fields,\n });\n }\n /\n UnionTypeExtension :\n * - extend union Name Directives[Const]? UnionMemberTypes\n * - extend union Name Directives[Const]\n /\n\n parseUnionTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('union');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const types = this.parseUnionMemberTypes();\n\n if (directives.length === 0 && types.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.UNION_TYPE_EXTENSION,\n name,\n directives,\n types,\n });\n }\n /\n EnumTypeExtension :\n * - extend enum Name Directives[Const]? EnumValuesDefinition\n * - extend enum Name Directives[Const]\n /\n\n parseEnumTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('enum');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const values = this.parseEnumValuesDefinition();\n\n if (directives.length === 0 && values.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.ENUM_TYPE_EXTENSION,\n name,\n directives,\n values,\n });\n }\n /\n InputObjectTypeExtension :\n * - extend input Name Directives[Const]? InputFieldsDefinition\n * - extend input Name Directives[Const]\n /\n\n parseInputObjectTypeExtension() {\n const start = this._lexer.token;\n this.expectKeyword('extend');\n this.expectKeyword('input');\n const name = this.parseName();\n const directives = this.parseConstDirectives();\n const fields = this.parseInputFieldsDefinition();\n\n if (directives.length === 0 && fields.length === 0) {\n throw this.unexpected();\n }\n\n return this.node(start, {\n kind: Kind.INPUT_OBJECT_TYPE_EXTENSION,\n name,\n directives,\n fields,\n });\n }\n /\n ```\n * DirectiveDefinition :\n * - Description? directive @ Name ArgumentsDefinition? `repeatable`? on DirectiveLocations\n * ```\n /\n\n parseDirectiveDefinition() {\n const start = this._lexer.token;\n const description = this.parseDescription();\n this.expectKeyword('directive');\n this.expectToken(TokenKind.AT);\n const name = this.parseName();\n const args = this.parseArgumentDefs();\n const repeatable = this.expectOptionalKeyword('repeatable');\n this.expectKeyword('on');\n const locations = this.parseDirectiveLocations();\n return this.node(start, {\n kind: Kind.DIRECTIVE_DEFINITION,\n description,\n name,\n arguments: args,\n repeatable,\n locations,\n });\n }\n /\n DirectiveLocations :\n * - `\|`? DirectiveLocation\n * - DirectiveLocations \| DirectiveLocation\n /\n\n parseDirectiveLocations() {\n return this.delimitedMany(TokenKind.PIPE, this.parseDirectiveLocation);\n }\n /\n * DirectiveLocation :\n * - ExecutableDirectiveLocation\n * - TypeSystemDirectiveLocation\n \n ExecutableDirectiveLocation : one of\n * `QUERY`\n * `MUTATION`\n * `SUBSCRIPTION`\n * `FIELD`\n * `FRAGMENT_DEFINITION`\n * `FRAGMENT_SPREAD`\n * `INLINE_FRAGMENT`\n \n TypeSystemDirectiveLocation : one of\n * `SCHEMA`\n * `SCALAR`\n * `OBJECT`\n * `FIELD_DEFINITION`\n * `ARGUMENT_DEFINITION`\n * `INTERFACE`\n * `UNION`\n * `ENUM`\n * `ENUM_VALUE`\n * `INPUT_OBJECT`\n * `INPUT_FIELD_DEFINITION`\n /\n\n parseDirectiveLocation() {\n const start = this._lexer.token;\n const name = this.parseName();\n\n if (Object.prototype.hasOwnProperty.call(DirectiveLocation, name.value)) {\n return name;\n }\n\n throw this.unexpected(start);\n } // Schema Coordinates\n\n /\n SchemaCoordinate :\n * - Name\n * - Name . Name\n * - Name . Name ( Name : )\n * - \\@ Name\n * - \\@ Name ( Name : )\n /\n\n parseSchemaCoordinate() {\n const start = this._lexer.token;\n const ofDirective = this.expectOptionalToken(TokenKind.AT);\n const name = this.parseName();\n let memberName;\n\n if (!ofDirective && this.expectOptionalToken(TokenKind.DOT)) {\n memberName = this.parseName();\n }\n\n let argumentName;\n\n if (\n (ofDirective \|\| memberName) &&\n this.expectOptionalToken(TokenKind.PAREN_L)\n ) {\n argumentName = this.parseName();\n this.expectToken(TokenKind.COLON);\n this.expectToken(TokenKind.PAREN_R);\n }\n\n if (ofDirective) {\n if (argumentName) {\n return this.node(start, {\n kind: Kind.DIRECTIVE_ARGUMENT_COORDINATE,\n name,\n argumentName,\n });\n }\n\n return this.node(start, {\n kind: Kind.DIRECTIVE_COORDINATE,\n name,\n });\n } else if (memberName) {\n if (argumentName) {\n return this.node(start, {\n kind: Kind.ARGUMENT_COORDINATE,\n name,\n fieldName: memberName,\n argumentName,\n });\n }\n\n return this.node(start, {\n kind: Kind.MEMBER_COORDINATE,\n name,\n memberName,\n });\n }\n\n return this.node(start, {\n kind: Kind.TYPE_COORDINATE,\n name,\n });\n } // Core parsing utility functions\n\n /\n Returns a node that, if configured to do so, sets a \"loc\" field as a\n * location object, used to identify the place in the source that created a\n * given parsed object.\n /\n\n node(startToken, node) {\n if (this._options.noLocation !== true) {\n node.loc = new Location(\n startToken,\n this._lexer.lastToken,\n this._lexer.source,\n );\n }\n\n return node;\n }\n /\n Determines if the next token is of a given kind\n /\n\n peek(kind) {\n return this._lexer.token.kind === kind;\n }\n /\n If the next token is of the given kind, return that token after advancing the lexer.\n * Otherwise, do not change the parser state and throw an error.\n /\n\n expectToken(kind) {\n const token = this._lexer.token;\n\n if (token.kind === kind) {\n this.advanceLexer();\n return token;\n }\n\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Expected ${getTokenKindDesc(kind)}, found ${getTokenDesc(token)}.`,\n );\n }\n /\n If the next token is of the given kind, return \"true\" after advancing the lexer.\n * Otherwise, do not change the parser state and return \"false\".\n /\n\n expectOptionalToken(kind) {\n const token = this._lexer.token;\n\n if (token.kind === kind) {\n this.advanceLexer();\n return true;\n }\n\n return false;\n }\n /\n If the next token is a given keyword, advance the lexer.\n * Otherwise, do not change the parser state and throw an error.\n /\n\n expectKeyword(value) {\n const token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this.advanceLexer();\n } else {\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Expected \"${value}\", found ${getTokenDesc(token)}.`,\n );\n }\n }\n /\n If the next token is a given keyword, return \"true\" after advancing the lexer.\n * Otherwise, do not change the parser state and return \"false\".\n /\n\n expectOptionalKeyword(value) {\n const token = this._lexer.token;\n\n if (token.kind === TokenKind.NAME && token.value === value) {\n this.advanceLexer();\n return true;\n }\n\n return false;\n }\n /\n Helper function for creating an error when an unexpected lexed token is encountered.\n /\n\n unexpected(atToken) {\n const token =\n atToken !== null && atToken !== void 0 ? atToken : this._lexer.token;\n return syntaxError(\n this._lexer.source,\n token.start,\n `Unexpected ${getTokenDesc(token)}.`,\n );\n }\n /\n Returns a possibly empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n any(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n const nodes = [];\n\n while (!this.expectOptionalToken(closeKind)) {\n nodes.push(parseFn.call(this));\n }\n\n return nodes;\n }\n /\n Returns a list of parse nodes, determined by the parseFn.\n * It can be empty only if open token is missing otherwise it will always return non-empty list\n * that begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n optionalMany(openKind, parseFn, closeKind) {\n if (this.expectOptionalToken(openKind)) {\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n\n return [];\n }\n /\n Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list begins with a lex token of openKind and ends with a lex token of closeKind.\n * Advances the parser to the next lex token after the closing token.\n /\n\n many(openKind, parseFn, closeKind) {\n this.expectToken(openKind);\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (!this.expectOptionalToken(closeKind));\n\n return nodes;\n }\n /\n Returns a non-empty list of parse nodes, determined by the parseFn.\n * This list may begin with a lex token of delimiterKind followed by items separated by lex tokens of tokenKind.\n * Advances the parser to the next lex token after last item in the list.\n /\n\n delimitedMany(delimiterKind, parseFn) {\n this.expectOptionalToken(delimiterKind);\n const nodes = [];\n\n do {\n nodes.push(parseFn.call(this));\n } while (this.expectOptionalToken(delimiterKind));\n\n return nodes;\n }\n\n advanceLexer() {\n const { maxTokens } = this._options;\n\n const token = this._lexer.advance();\n\n if (token.kind !== TokenKind.EOF) {\n ++this._tokenCounter;\n\n if (maxTokens !== undefined && this._tokenCounter > maxTokens) {\n throw syntaxError(\n this._lexer.source,\n token.start,\n `Document contains more that ${maxTokens} tokens. Parsing aborted.`,\n );\n }\n }\n }\n}\n/\n A helper function to describe a token as a string for debugging.\n /\n\nfunction getTokenDesc(token) {\n const value = token.value;\n return getTokenKindDesc(token.kind) + (value != null ? ` \"${value}\"` : '');\n}\n/\n A helper function to describe a token kind as a string for debugging.\n /\n\nfunction getTokenKindDesc(kind) {\n return isPunctuatorTokenKind(kind) ? `\"${kind}\"` : kind;\n}\n","/\n Prints a string as a GraphQL StringValue literal. Replaces control characters\n * and excluded characters (\" U+0022 and \\\\ U+005C) with escape sequences.\n /\nexport function printString(str) {\n return `\"${str.replace(escapedRegExp, escapedReplacer)}\"`;\n} // eslint-disable-next-line no-control-regex\n\nconst escapedRegExp = /[\\x00-\\x1f\\x22\\x5c\\x7f-\\x9f]/g;\n\nfunction escapedReplacer(str) {\n return escapeSequences[str.charCodeAt(0)];\n} // prettier-ignore\n\nconst escapeSequences = [\n '\\\\u0000',\n '\\\\u0001',\n '\\\\u0002',\n '\\\\u0003',\n '\\\\u0004',\n '\\\\u0005',\n '\\\\u0006',\n '\\\\u0007',\n '\\\\b',\n '\\\\t',\n '\\\\n',\n '\\\\u000B',\n '\\\\f',\n '\\\\r',\n '\\\\u000E',\n '\\\\u000F',\n '\\\\u0010',\n '\\\\u0011',\n '\\\\u0012',\n '\\\\u0013',\n '\\\\u0014',\n '\\\\u0015',\n '\\\\u0016',\n '\\\\u0017',\n '\\\\u0018',\n '\\\\u0019',\n '\\\\u001A',\n '\\\\u001B',\n '\\\\u001C',\n '\\\\u001D',\n '\\\\u001E',\n '\\\\u001F',\n '',\n '',\n '\\\\\"',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 2F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 3F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 4F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '\\\\\\\\',\n '',\n '',\n '', // 5F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '', // 6F\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '',\n '\\\\u007F',\n '\\\\u0080',\n '\\\\u0081',\n '\\\\u0082',\n '\\\\u0083',\n '\\\\u0084',\n '\\\\u0085',\n '\\\\u0086',\n '\\\\u0087',\n '\\\\u0088',\n '\\\\u0089',\n '\\\\u008A',\n '\\\\u008B',\n '\\\\u008C',\n '\\\\u008D',\n '\\\\u008E',\n '\\\\u008F',\n '\\\\u0090',\n '\\\\u0091',\n '\\\\u0092',\n '\\\\u0093',\n '\\\\u0094',\n '\\\\u0095',\n '\\\\u0096',\n '\\\\u0097',\n '\\\\u0098',\n '\\\\u0099',\n '\\\\u009A',\n '\\\\u009B',\n '\\\\u009C',\n '\\\\u009D',\n '\\\\u009E',\n '\\\\u009F',\n];\n","import { devAssert } from '../jsutils/devAssert.mjs';\nimport { inspect } from '../jsutils/inspect.mjs';\nimport { isNode, QueryDocumentKeys } from './ast.mjs';\nimport { Kind } from './kinds.mjs';\n/\n A visitor is provided to visit, it contains the collection of\n * relevant functions to be called during the visitor's traversal.\n /\n\nexport const BREAK = Object.freeze({});\n/\n visit() will walk through an AST using a depth-first traversal, calling\n * the visitor's enter function at each node in the traversal, and calling the\n * leave function after visiting that node and all of its child nodes.\n \n By returning different values from the enter and leave functions, the\n * behavior of the visitor can be altered, including skipping over a sub-tree of\n * the AST (by returning false), editing the AST by returning a value or null\n * to remove the value, or to stop the whole traversal by returning BREAK.\n \n When using visit() to edit an AST, the original AST will not be modified, and\n * a new version of the AST with the changes applied will be returned from the\n * visit function.\n \n ```ts\n * const editedAST = visit(ast, {\n * enter(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: skip visiting this node\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * },\n * leave(node, key, parent, path, ancestors) {\n * // @return\n * // undefined: no action\n * // false: no action\n * // visitor.BREAK: stop visiting altogether\n * // null: delete this node\n * // any value: replace this node with the returned value\n * }\n * });\n * ```\n \n Alternatively to providing enter() and leave() functions, a visitor can\n * instead provide functions named the same as the kinds of AST nodes, or\n * enter/leave visitors at a named key, leading to three permutations of the\n * visitor API:\n \n 1) Named visitors triggered when entering a node of a specific kind.\n \n ```ts\n * visit(ast, {\n * Kind(node) {\n * // enter the \"Kind\" node\n * }\n * })\n * ```\n \n 2) Named visitors that trigger upon entering and leaving a node of a specific kind.\n \n ```ts\n * visit(ast, {\n * Kind: {\n * enter(node) {\n * // enter the \"Kind\" node\n * }\n * leave(node) {\n * // leave the \"Kind\" node\n * }\n * }\n * })\n * ```\n \n 3) Generic visitors that trigger upon entering and leaving any node.\n \n ```ts\n * visit(ast, {\n * enter(node) {\n * // enter any node\n * },\n * leave(node) {\n * // leave any node\n * }\n * })\n * ```\n /\n\nexport function visit(root, visitor, visitorKeys = QueryDocumentKeys) {\n const enterLeaveMap = new Map();\n\n for (const kind of Object.values(Kind)) {\n enterLeaveMap.set(kind, getEnterLeaveForKind(visitor, kind));\n }\n / eslint-disable no-undef-init /\n\n let stack = undefined;\n let inArray = Array.isArray(root);\n let keys = [root];\n let index = -1;\n let edits = [];\n let node = root;\n let key = undefined;\n let parent = undefined;\n const path = [];\n const ancestors = [];\n / eslint-enable no-undef-init /\n\n do {\n index++;\n const isLeaving = index === keys.length;\n const isEdited = isLeaving && edits.length !== 0;\n\n if (isLeaving) {\n key = ancestors.length === 0 ? undefined : path[path.length - 1];\n node = parent;\n parent = ancestors.pop();\n\n if (isEdited) {\n if (inArray) {\n node = node.slice();\n let editOffset = 0;\n\n for (const [editKey, editValue] of edits) {\n const arrayKey = editKey - editOffset;\n\n if (editValue === null) {\n node.splice(arrayKey, 1);\n editOffset++;\n } else {\n node[arrayKey] = editValue;\n }\n }\n } else {\n node = { ...node };\n\n for (const [editKey, editValue] of edits) {\n node[editKey] = editValue;\n }\n }\n }\n\n index = stack.index;\n keys = stack.keys;\n edits = stack.edits;\n inArray = stack.inArray;\n stack = stack.prev;\n } else if (parent) {\n key = inArray ? index : keys[index];\n node = parent[key];\n\n if (node === null \|\| node === undefined) {\n continue;\n }\n\n path.push(key);\n }\n\n let result;\n\n if (!Array.isArray(node)) {\n var _enterLeaveMap$get, _enterLeaveMap$get2;\n\n isNode(node) \|\| devAssert(false, `Invalid AST Node: ${inspect(node)}.`);\n const visitFn = isLeaving\n ? (_enterLeaveMap$get = enterLeaveMap.get(node.kind)) === null \|\|\n _enterLeaveMap$get === void 0\n ? void 0\n : _enterLeaveMap$get.leave\n : (_enterLeaveMap$get2 = enterLeaveMap.get(node.kind)) === null \|\|\n _enterLeaveMap$get2 === void 0\n ? void 0\n : _enterLeaveMap$get2.enter;\n result =\n visitFn === null \|\| visitFn === void 0\n ? void 0\n : visitFn.call(visitor, node, key, parent, path, ancestors);\n\n if (result === BREAK) {\n break;\n }\n\n if (result === false) {\n if (!isLeaving) {\n path.pop();\n continue;\n }\n } else if (result !== undefined) {\n edits.push([key, result]);\n\n if (!isLeaving) {\n if (isNode(result)) {\n node = result;\n } else {\n path.pop();\n continue;\n }\n }\n }\n }\n\n if (result === undefined && isEdited) {\n edits.push([key, node]);\n }\n\n if (isLeaving) {\n path.pop();\n } else {\n var _node$kind;\n\n stack = {\n inArray,\n index,\n keys,\n edits,\n prev: stack,\n };\n inArray = Array.isArray(node);\n keys = inArray\n ? node\n : (_node$kind = visitorKeys[node.kind]) !== null &&\n _node$kind !== void 0\n ? _node$kind\n : [];\n index = -1;\n edits = [];\n\n if (parent) {\n ancestors.push(parent);\n }\n\n parent = node;\n }\n } while (stack !== undefined);\n\n if (edits.length !== 0) {\n // New root\n return edits[edits.length - 1][1];\n }\n\n return root;\n}\n/\n Creates a new visitor instance which delegates to many visitors to run in\n * parallel. Each visitor will be visited for each node before moving on.\n \n If a prior visitor edits a node, no following visitors will see that node.\n /\n\nexport function visitInParallel(visitors) {\n const skipping = new Array(visitors.length).fill(null);\n const mergedVisitor = Object.create(null);\n\n for (const kind of Object.values(Kind)) {\n let hasVisitor = false;\n const enterList = new Array(visitors.length).fill(undefined);\n const leaveList = new Array(visitors.length).fill(undefined);\n\n for (let i = 0; i < visitors.length; ++i) {\n const { enter, leave } = getEnterLeaveForKind(visitors[i], kind);\n hasVisitor \|\| (hasVisitor = enter != null \|\| leave != null);\n enterList[i] = enter;\n leaveList[i] = leave;\n }\n\n if (!hasVisitor) {\n continue;\n }\n\n const mergedEnterLeave = {\n enter(...args) {\n const node = args[0];\n\n for (let i = 0; i < visitors.length; i++) {\n if (skipping[i] === null) {\n var _enterList$i;\n\n const result =\n (_enterList$i = enterList[i]) === null \|\| _enterList$i === void 0\n ? void 0\n : _enterList$i.apply(visitors[i], args);\n\n if (result === false) {\n skipping[i] = node;\n } else if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined) {\n return result;\n }\n }\n }\n },\n\n leave(...args) {\n const node = args[0];\n\n for (let i = 0; i < visitors.length; i++) {\n if (skipping[i] === null) {\n var _leaveList$i;\n\n const result =\n (_leaveList$i = leaveList[i]) === null \|\| _leaveList$i === void 0\n ? void 0\n : _leaveList$i.apply(visitors[i], args);\n\n if (result === BREAK) {\n skipping[i] = BREAK;\n } else if (result !== undefined && result !== false) {\n return result;\n }\n } else if (skipping[i] === node) {\n skipping[i] = null;\n }\n }\n },\n };\n mergedVisitor[kind] = mergedEnterLeave;\n }\n\n return mergedVisitor;\n}\n/\n Given a visitor instance and a node kind, return EnterLeaveVisitor for that kind.\n /\n\nexport function getEnterLeaveForKind(visitor, kind) {\n const kindVisitor = visitor[kind];\n\n if (typeof kindVisitor === 'object') {\n // { Kind: { enter() {}, leave() {} } }\n return kindVisitor;\n } else if (typeof kindVisitor === 'function') {\n // { Kind() {} }\n return {\n enter: kindVisitor,\n leave: undefined,\n };\n } // { enter() {}, leave() {} }\n\n return {\n enter: visitor.enter,\n leave: visitor.leave,\n };\n}\n/\n Given a visitor instance, if it is leaving or not, and a node kind, return\n * the function the visitor runtime should call.\n \n @deprecated Please use `getEnterLeaveForKind` instead. Will be removed in v17\n /\n\n/ c8 ignore next 8 /\n\nexport function getVisitFn(visitor, kind, isLeaving) {\n const { enter, leave } = getEnterLeaveForKind(visitor, kind);\n return isLeaving ? leave : enter;\n}\n","import { printBlockString } from './blockString.mjs';\nimport { printString } from './printString.mjs';\nimport { visit } from './visitor.mjs';\n/\n Converts an AST into a string, using one set of reasonable\n * formatting rules.\n /\n\nexport function print(ast) {\n return visit(ast, printDocASTReducer);\n}\nconst MAX_LINE_LENGTH = 80;\nconst printDocASTReducer = {\n Name: {\n leave: (node) => node.value,\n },\n Variable: {\n leave: (node) => '$' + node.name,\n },\n // Document\n Document: {\n leave: (node) => join(node.definitions, '\\n\\n'),\n },\n OperationDefinition: {\n leave(node) {\n const varDefs = hasMultilineItems(node.variableDefinitions)\n ? wrap('(\\n', join(node.variableDefinitions, '\\n'), '\\n)')\n : wrap('(', join(node.variableDefinitions, ', '), ')');\n const prefix =\n wrap('', node.description, '\\n') +\n join(\n [\n node.operation,\n join([node.name, varDefs]),\n join(node.directives, ' '),\n ],\n ' ',\n ); // Anonymous queries with no directives or variable definitions can use\n // the query short form.\n\n return (prefix === 'query' ? '' : prefix + ' ') + node.selectionSet;\n },\n },\n VariableDefinition: {\n leave: ({ variable, type, defaultValue, directives, description }) =>\n wrap('', description, '\\n') +\n variable +\n ': ' +\n type +\n wrap(' = ', defaultValue) +\n wrap(' ', join(directives, ' ')),\n },\n SelectionSet: {\n leave: ({ selections }) => block(selections),\n },\n Field: {\n leave({ alias, name, arguments: args, directives, selectionSet }) {\n const prefix = wrap('', alias, ': ') + name;\n let argsLine = prefix + wrap('(', join(args, ', '), ')');\n\n if (argsLine.length > MAX_LINE_LENGTH) {\n argsLine = prefix + wrap('(\\n', indent(join(args, '\\n')), '\\n)');\n }\n\n return join([argsLine, join(directives, ' '), selectionSet], ' ');\n },\n },\n Argument: {\n leave: ({ name, value }) => name + ': ' + value,\n },\n // Fragments\n FragmentSpread: {\n leave: ({ name, directives }) =>\n '...' + name + wrap(' ', join(directives, ' ')),\n },\n InlineFragment: {\n leave: ({ typeCondition, directives, selectionSet }) =>\n join(\n [\n '...',\n wrap('on ', typeCondition),\n join(directives, ' '),\n selectionSet,\n ],\n ' ',\n ),\n },\n FragmentDefinition: {\n leave: ({\n name,\n typeCondition,\n variableDefinitions,\n directives,\n selectionSet,\n description,\n }) =>\n wrap('', description, '\\n') + // Note: fragment variable definitions are experimental and may be changed\n // or removed in the future.\n `fragment ${name}${wrap('(', join(variableDefinitions, ', '), ')')} ` +\n `on ${typeCondition} ${wrap('', join(directives, ' '), ' ')}` +\n selectionSet,\n },\n // Value\n IntValue: {\n leave: ({ value }) => value,\n },\n FloatValue: {\n leave: ({ value }) => value,\n },\n StringValue: {\n leave: ({ value, block: isBlockString }) =>\n isBlockString ? printBlockString(value) : printString(value),\n },\n BooleanValue: {\n leave: ({ value }) => (value ? 'true' : 'false'),\n },\n NullValue: {\n leave: () => 'null',\n },\n EnumValue: {\n leave: ({ value }) => value,\n },\n ListValue: {\n leave: ({ values }) => '[' + join(values, ', ') + ']',\n },\n ObjectValue: {\n leave: ({ fields }) => '{' + join(fields, ', ') + '}',\n },\n ObjectField: {\n leave: ({ name, value }) => name + ': ' + value,\n },\n // Directive\n Directive: {\n leave: ({ name, arguments: args }) =>\n '@' + name + wrap('(', join(args, ', '), ')'),\n },\n // Type\n NamedType: {\n leave: ({ name }) => name,\n },\n ListType: {\n leave: ({ type }) => '[' + type + ']',\n },\n NonNullType: {\n leave: ({ type }) => type + '!',\n },\n // Type System Definitions\n SchemaDefinition: {\n leave: ({ description, directives, operationTypes }) =>\n wrap('', description, '\\n') +\n join(['schema', join(directives, ' '), block(operationTypes)], ' '),\n },\n OperationTypeDefinition: {\n leave: ({ operation, type }) => operation + ': ' + type,\n },\n ScalarTypeDefinition: {\n leave: ({ description, name, directives }) =>\n wrap('', description, '\\n') +\n join(['scalar', name, join(directives, ' ')], ' '),\n },\n ObjectTypeDefinition: {\n leave: ({ description, name, interfaces, directives, fields }) =>\n wrap('', description, '\\n') +\n join(\n [\n 'type',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n FieldDefinition: {\n leave: ({ description, name, arguments: args, type, directives }) =>\n wrap('', description, '\\n') +\n name +\n (hasMultilineItems(args)\n ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n : wrap('(', join(args, ', '), ')')) +\n ': ' +\n type +\n wrap(' ', join(directives, ' ')),\n },\n InputValueDefinition: {\n leave: ({ description, name, type, defaultValue, directives }) =>\n wrap('', description, '\\n') +\n join(\n [name + ': ' + type, wrap('= ', defaultValue), join(directives, ' ')],\n ' ',\n ),\n },\n InterfaceTypeDefinition: {\n leave: ({ description, name, interfaces, directives, fields }) =>\n wrap('', description, '\\n') +\n join(\n [\n 'interface',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n UnionTypeDefinition: {\n leave: ({ description, name, directives, types }) =>\n wrap('', description, '\\n') +\n join(\n ['union', name, join(directives, ' '), wrap('= ', join(types, ' \| '))],\n ' ',\n ),\n },\n EnumTypeDefinition: {\n leave: ({ description, name, directives, values }) =>\n wrap('', description, '\\n') +\n join(['enum', name, join(directives, ' '), block(values)], ' '),\n },\n EnumValueDefinition: {\n leave: ({ description, name, directives }) =>\n wrap('', description, '\\n') + join([name, join(directives, ' ')], ' '),\n },\n InputObjectTypeDefinition: {\n leave: ({ description, name, directives, fields }) =>\n wrap('', description, '\\n') +\n join(['input', name, join(directives, ' '), block(fields)], ' '),\n },\n DirectiveDefinition: {\n leave: ({ description, name, arguments: args, repeatable, locations }) =>\n wrap('', description, '\\n') +\n 'directive @' +\n name +\n (hasMultilineItems(args)\n ? wrap('(\\n', indent(join(args, '\\n')), '\\n)')\n : wrap('(', join(args, ', '), ')')) +\n (repeatable ? ' repeatable' : '') +\n ' on ' +\n join(locations, ' \| '),\n },\n SchemaExtension: {\n leave: ({ directives, operationTypes }) =>\n join(\n ['extend schema', join(directives, ' '), block(operationTypes)],\n ' ',\n ),\n },\n ScalarTypeExtension: {\n leave: ({ name, directives }) =>\n join(['extend scalar', name, join(directives, ' ')], ' '),\n },\n ObjectTypeExtension: {\n leave: ({ name, interfaces, directives, fields }) =>\n join(\n [\n 'extend type',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n InterfaceTypeExtension: {\n leave: ({ name, interfaces, directives, fields }) =>\n join(\n [\n 'extend interface',\n name,\n wrap('implements ', join(interfaces, ' & ')),\n join(directives, ' '),\n block(fields),\n ],\n ' ',\n ),\n },\n UnionTypeExtension: {\n leave: ({ name, directives, types }) =>\n join(\n [\n 'extend union',\n name,\n join(directives, ' '),\n wrap('= ', join(types, ' \| ')),\n ],\n ' ',\n ),\n },\n EnumTypeExtension: {\n leave: ({ name, directives, values }) =>\n join(['extend enum', name, join(directives, ' '), block(values)], ' '),\n },\n InputObjectTypeExtension: {\n leave: ({ name, directives, fields }) =>\n join(['extend input', name, join(directives, ' '), block(fields)], ' '),\n },\n // Schema Coordinates\n TypeCoordinate: {\n leave: ({ name }) => name,\n },\n MemberCoordinate: {\n leave: ({ name, memberName }) => join([name, wrap('.', memberName)]),\n },\n ArgumentCoordinate: {\n leave: ({ name, fieldName, argumentName }) =>\n join([name, wrap('.', fieldName), wrap('(', argumentName, ':)')]),\n },\n DirectiveCoordinate: {\n leave: ({ name }) => join(['@', name]),\n },\n DirectiveArgumentCoordinate: {\n leave: ({ name, argumentName }) =>\n join(['@', name, wrap('(', argumentName, ':)')]),\n },\n};\n/\n Given maybeArray, print an empty string if it is null or empty, otherwise\n * print all items together separated by separator if provided\n /\n\nfunction join(maybeArray, separator = '') {\n var _maybeArray$filter$jo;\n\n return (_maybeArray$filter$jo =\n maybeArray === null \|\| maybeArray === void 0\n ? void 0\n : maybeArray.filter((x) => x).join(separator)) !== null &&\n _maybeArray$filter$jo !== void 0\n ? _maybeArray$filter$jo\n : '';\n}\n/\n Given array, print each item on its own line, wrapped in an indented `{ }` block.\n /\n\nfunction block(array) {\n return wrap('{\\n', indent(join(array, '\\n')), '\\n}');\n}\n/\n If maybeString is not null or empty, then wrap with start and end, otherwise print an empty string.\n /\n\nfunction wrap(start, maybeString, end = '') {\n return maybeString != null && maybeString !== ''\n ? start + maybeString + end\n : '';\n}\n\nfunction indent(str) {\n return wrap(' ', str.replace(/\\n/g, '\\n '));\n}\n\nfunction hasMultilineItems(maybeArray) {\n var _maybeArray$some;\n\n // FIXME: https://github.com/graphql/graphql-js/issues/2203\n\n / c8 ignore next /\n return (_maybeArray$some =\n maybeArray === null \|\| maybeArray === void 0\n ? void 0\n : maybeArray.some((str) => str.includes('\\n'))) !== null &&\n _maybeArray$some !== void 0\n ? _maybeArray$some\n : false;\n}\n","import { parse, print } from 'graphql';\n/\n helpers\n /\nconst extractOperationName = (document) => {\n let operationName = undefined;\n const operationDefinitions = document.definitions.filter((definition) => definition.kind === `OperationDefinition`);\n if (operationDefinitions.length === 1) {\n operationName = operationDefinitions[0]?.name?.value;\n }\n return operationName;\n};\nexport const resolveRequestDocument = (document) => {\n if (typeof document === `string`) {\n let operationName = undefined;\n try {\n const parsedDocument = parse(document);\n operationName = extractOperationName(parsedDocument);\n }\n catch (err) {\n // Failed parsing the document, the operationName will be undefined\n }\n return { query: document, operationName };\n }\n const operationName = extractOperationName(document);\n return { query: print(document), operationName };\n};\n//# sourceMappingURL=resolveRequestDocument.js.map","export class ClientError extends Error {\n constructor(response, request) {\n const message = `${ClientError.extractMessage(response)}: ${JSON.stringify({\n response,\n request,\n })}`;\n super(message);\n Object.setPrototypeOf(this, ClientError.prototype);\n this.response = response;\n this.request = request;\n // this is needed as Safari doesn't support .captureStackTrace\n if (typeof Error.captureStackTrace === `function`) {\n Error.captureStackTrace(this, ClientError);\n }\n }\n static extractMessage(response) {\n return response.errors?.[0]?.message ?? `GraphQL Error (Code: ${response.status})`;\n }\n}\n//# sourceMappingURL=types.js.map","// Save global object in a variable\nvar __global__ =\n(typeof globalThis !== 'undefined' && globalThis) \|\|\n(typeof self !== 'undefined' && self) \|\|\n(typeof global !== 'undefined' && global);\n// Create an object that extends from __global__ without the fetch function\nvar __globalThis__ = (function () {\nfunction F() {\nthis.fetch = false;\nthis.DOMException = __global__.DOMException\n}\nF.prototype = __global__; // Needed for feature detection on whatwg-fetch's code\nreturn new F();\n})();\n// Wraps whatwg-fetch with a function scope to hijack the global object\n// \"globalThis\" that's going to be patched\n(function(globalThis) {\n\nvar irrelevant = (function (exports) {\n\n / eslint-disable no-prototype-builtins /\n var g =\n (typeof globalThis !== 'undefined' && globalThis) \|\|\n (typeof self !== 'undefined' && self) \|\|\n // eslint-disable-next-line no-undef\n (typeof global !== 'undefined' && global) \|\|\n {};\n\n var support = {\n searchParams: 'URLSearchParams' in g,\n iterable: 'Symbol' in g && 'iterator' in Symbol,\n blob:\n 'FileReader' in g &&\n 'Blob' in g &&\n (function() {\n try {\n new Blob();\n return true\n } catch (e) {\n return false\n }\n })(),\n formData: 'FormData' in g,\n arrayBuffer: 'ArrayBuffer' in g\n };\n\n function isDataView(obj) {\n return obj && DataView.prototype.isPrototypeOf(obj)\n }\n\n if (support.arrayBuffer) {\n var viewClasses = [\n '[object Int8Array]',\n '[object Uint8Array]',\n '[object Uint8ClampedArray]',\n '[object Int16Array]',\n '[object Uint16Array]',\n '[object Int32Array]',\n '[object Uint32Array]',\n '[object Float32Array]',\n '[object Float64Array]'\n ];\n\n var isArrayBufferView =\n ArrayBuffer.isView \|\|\n function(obj) {\n return obj && viewClasses.indexOf(Object.prototype.toString.call(obj)) > -1\n };\n }\n\n function normalizeName(name) {\n if (typeof name !== 'string') {\n name = String(name);\n }\n if (/[^a-z0-9\\-#$%&'+.^_`\|~!]/i.test(name) \|\| name === '') {\n throw new TypeError('Invalid character in header field name: \"' + name + '\"')\n }\n return name.toLowerCase()\n }\n\n function normalizeValue(value) {\n if (typeof value !== 'string') {\n value = String(value);\n }\n return value\n }\n\n // Build a destructive iterator for the value list\n function iteratorFor(items) {\n var iterator = {\n next: function() {\n var value = items.shift();\n return {done: value === undefined, value: value}\n }\n };\n\n if (support.iterable) {\n iterator[Symbol.iterator] = function() {\n return iterator\n };\n }\n\n return iterator\n }\n\n function Headers(headers) {\n this.map = {};\n\n if (headers instanceof Headers) {\n headers.forEach(function(value, name) {\n this.append(name, value);\n }, this);\n } else if (Array.isArray(headers)) {\n headers.forEach(function(header) {\n if (header.length != 2) {\n throw new TypeError('Headers constructor: expected name/value pair to be length 2, found' + header.length)\n }\n this.append(header[0], header[1]);\n }, this);\n } else if (headers) {\n Object.getOwnPropertyNames(headers).forEach(function(name) {\n this.append(name, headers[name]);\n }, this);\n }\n }\n\n Headers.prototype.append = function(name, value) {\n name = normalizeName(name);\n value = normalizeValue(value);\n var oldValue = this.map[name];\n this.map[name] = oldValue ? oldValue + ', ' + value : value;\n };\n\n Headers.prototype['delete'] = function(name) {\n delete this.map[normalizeName(name)];\n };\n\n Headers.prototype.get = function(name) {\n name = normalizeName(name);\n return this.has(name) ? this.map[name] : null\n };\n\n Headers.prototype.has = function(name) {\n return this.map.hasOwnProperty(normalizeName(name))\n };\n\n Headers.prototype.set = function(name, value) {\n this.map[normalizeName(name)] = normalizeValue(value);\n };\n\n Headers.prototype.forEach = function(callback, thisArg) {\n for (var name in this.map) {\n if (this.map.hasOwnProperty(name)) {\n callback.call(thisArg, this.map[name], name, this);\n }\n }\n };\n\n Headers.prototype.keys = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push(name);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.values = function() {\n var items = [];\n this.forEach(function(value) {\n items.push(value);\n });\n return iteratorFor(items)\n };\n\n Headers.prototype.entries = function() {\n var items = [];\n this.forEach(function(value, name) {\n items.push([name, value]);\n });\n return iteratorFor(items)\n };\n\n if (support.iterable) {\n Headers.prototype[Symbol.iterator] = Headers.prototype.entries;\n }\n\n function consumed(body) {\n if (body._noBody) return\n if (body.bodyUsed) {\n return Promise.reject(new TypeError('Already read'))\n }\n body.bodyUsed = true;\n }\n\n function fileReaderReady(reader) {\n return new Promise(function(resolve, reject) {\n reader.onload = function() {\n resolve(reader.result);\n };\n reader.onerror = function() {\n reject(reader.error);\n };\n })\n }\n\n function readBlobAsArrayBuffer(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n reader.readAsArrayBuffer(blob);\n return promise\n }\n\n function readBlobAsText(blob) {\n var reader = new FileReader();\n var promise = fileReaderReady(reader);\n var match = /charset=([A-Za-z0-9_-]+)/.exec(blob.type);\n var encoding = match ? match[1] : 'utf-8';\n reader.readAsText(blob, encoding);\n return promise\n }\n\n function readArrayBufferAsText(buf) {\n var view = new Uint8Array(buf);\n var chars = new Array(view.length);\n\n for (var i = 0; i < view.length; i++) {\n chars[i] = String.fromCharCode(view[i]);\n }\n return chars.join('')\n }\n\n function bufferClone(buf) {\n if (buf.slice) {\n return buf.slice(0)\n } else {\n var view = new Uint8Array(buf.byteLength);\n view.set(new Uint8Array(buf));\n return view.buffer\n }\n }\n\n function Body() {\n this.bodyUsed = false;\n\n this._initBody = function(body) {\n /\n fetch-mock wraps the Response object in an ES6 Proxy to\n provide useful test harness features such as flush. However, on\n ES5 browsers without fetch or Proxy support pollyfills must be used;\n the proxy-pollyfill is unable to proxy an attribute unless it exists\n on the object before the Proxy is created. This change ensures\n Response.bodyUsed exists on the instance, while maintaining the\n semantic of setting Request.bodyUsed in the constructor before\n _initBody is called.\n /\n // eslint-disable-next-line no-self-assign\n this.bodyUsed = this.bodyUsed;\n this._bodyInit = body;\n if (!body) {\n this._noBody = true;\n this._bodyText = '';\n } else if (typeof body === 'string') {\n this._bodyText = body;\n } else if (support.blob && Blob.prototype.isPrototypeOf(body)) {\n this._bodyBlob = body;\n } else if (support.formData && FormData.prototype.isPrototypeOf(body)) {\n this._bodyFormData = body;\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this._bodyText = body.toString();\n } else if (support.arrayBuffer && support.blob && isDataView(body)) {\n this._bodyArrayBuffer = bufferClone(body.buffer);\n // IE 10-11 can't handle a DataView body.\n this._bodyInit = new Blob([this._bodyArrayBuffer]);\n } else if (support.arrayBuffer && (ArrayBuffer.prototype.isPrototypeOf(body) \|\| isArrayBufferView(body))) {\n this._bodyArrayBuffer = bufferClone(body);\n } else {\n this._bodyText = body = Object.prototype.toString.call(body);\n }\n\n if (!this.headers.get('content-type')) {\n if (typeof body === 'string') {\n this.headers.set('content-type', 'text/plain;charset=UTF-8');\n } else if (this._bodyBlob && this._bodyBlob.type) {\n this.headers.set('content-type', this._bodyBlob.type);\n } else if (support.searchParams && URLSearchParams.prototype.isPrototypeOf(body)) {\n this.headers.set('content-type', 'application/x-www-form-urlencoded;charset=UTF-8');\n }\n }\n };\n\n if (support.blob) {\n this.blob = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return Promise.resolve(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(new Blob([this._bodyArrayBuffer]))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as blob')\n } else {\n return Promise.resolve(new Blob([this._bodyText]))\n }\n };\n }\n\n this.arrayBuffer = function() {\n if (this._bodyArrayBuffer) {\n var isConsumed = consumed(this);\n if (isConsumed) {\n return isConsumed\n } else if (ArrayBuffer.isView(this._bodyArrayBuffer)) {\n return Promise.resolve(\n this._bodyArrayBuffer.buffer.slice(\n this._bodyArrayBuffer.byteOffset,\n this._bodyArrayBuffer.byteOffset + this._bodyArrayBuffer.byteLength\n )\n )\n } else {\n return Promise.resolve(this._bodyArrayBuffer)\n }\n } else if (support.blob) {\n return this.blob().then(readBlobAsArrayBuffer)\n } else {\n throw new Error('could not read as ArrayBuffer')\n }\n };\n\n this.text = function() {\n var rejected = consumed(this);\n if (rejected) {\n return rejected\n }\n\n if (this._bodyBlob) {\n return readBlobAsText(this._bodyBlob)\n } else if (this._bodyArrayBuffer) {\n return Promise.resolve(readArrayBufferAsText(this._bodyArrayBuffer))\n } else if (this._bodyFormData) {\n throw new Error('could not read FormData body as text')\n } else {\n return Promise.resolve(this._bodyText)\n }\n };\n\n if (support.formData) {\n this.formData = function() {\n return this.text().then(decode)\n };\n }\n\n this.json = function() {\n return this.text().then(JSON.parse)\n };\n\n return this\n }\n\n // HTTP methods whose capitalization should be normalized\n var methods = ['CONNECT', 'DELETE', 'GET', 'HEAD', 'OPTIONS', 'PATCH', 'POST', 'PUT', 'TRACE'];\n\n function normalizeMethod(method) {\n var upcased = method.toUpperCase();\n return methods.indexOf(upcased) > -1 ? upcased : method\n }\n\n function Request(input, options) {\n if (!(this instanceof Request)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n\n options = options \|\| {};\n var body = options.body;\n\n if (input instanceof Request) {\n if (input.bodyUsed) {\n throw new TypeError('Already read')\n }\n this.url = input.url;\n this.credentials = input.credentials;\n if (!options.headers) {\n this.headers = new Headers(input.headers);\n }\n this.method = input.method;\n this.mode = input.mode;\n this.signal = input.signal;\n if (!body && input._bodyInit != null) {\n body = input._bodyInit;\n input.bodyUsed = true;\n }\n } else {\n this.url = String(input);\n }\n\n this.credentials = options.credentials \|\| this.credentials \|\| 'same-origin';\n if (options.headers \|\| !this.headers) {\n this.headers = new Headers(options.headers);\n }\n this.method = normalizeMethod(options.method \|\| this.method \|\| 'GET');\n this.mode = options.mode \|\| this.mode \|\| null;\n this.signal = options.signal \|\| this.signal \|\| (function () {\n if ('AbortController' in g) {\n var ctrl = new AbortController();\n return ctrl.signal;\n }\n }());\n this.referrer = null;\n\n if ((this.method === 'GET' \|\| this.method === 'HEAD') && body) {\n throw new TypeError('Body not allowed for GET or HEAD requests')\n }\n this._initBody(body);\n\n if (this.method === 'GET' \|\| this.method === 'HEAD') {\n if (options.cache === 'no-store' \|\| options.cache === 'no-cache') {\n // Search for a '_' parameter in the query string\n var reParamSearch = /([?&])_=[^&]/;\n if (reParamSearch.test(this.url)) {\n // If it already exists then set the value with the current time\n this.url = this.url.replace(reParamSearch, '$1_=' + new Date().getTime());\n } else {\n // Otherwise add a new '_' parameter to the end with the current time\n var reQueryString = /\\?/;\n this.url += (reQueryString.test(this.url) ? '&' : '?') + '_=' + new Date().getTime();\n }\n }\n }\n }\n\n Request.prototype.clone = function() {\n return new Request(this, {body: this._bodyInit})\n };\n\n function decode(body) {\n var form = new FormData();\n body\n .trim()\n .split('&')\n .forEach(function(bytes) {\n if (bytes) {\n var split = bytes.split('=');\n var name = split.shift().replace(/\\+/g, ' ');\n var value = split.join('=').replace(/\\+/g, ' ');\n form.append(decodeURIComponent(name), decodeURIComponent(value));\n }\n });\n return form\n }\n\n function parseHeaders(rawHeaders) {\n var headers = new Headers();\n // Replace instances of \\r\\n and \\n followed by at least one space or horizontal tab with a space\n // https://tools.ietf.org/html/rfc7230#section-3.2\n var preProcessedHeaders = rawHeaders.replace(/\\r?\\n[\\t ]+/g, ' ');\n // Avoiding split via regex to work around a common IE11 bug with the core-js 3.6.0 regex polyfill\n // https://github.com/github/fetch/issues/748\n // https://github.com/zloirock/core-js/issues/751\n preProcessedHeaders\n .split('\\r')\n .map(function(header) {\n return header.indexOf('\\n') === 0 ? header.substr(1, header.length) : header\n })\n .forEach(function(line) {\n var parts = line.split(':');\n var key = parts.shift().trim();\n if (key) {\n var value = parts.join(':').trim();\n try {\n headers.append(key, value);\n } catch (error) {\n console.warn('Response ' + error.message);\n }\n }\n });\n return headers\n }\n\n Body.call(Request.prototype);\n\n function Response(bodyInit, options) {\n if (!(this instanceof Response)) {\n throw new TypeError('Please use the \"new\" operator, this DOM object constructor cannot be called as a function.')\n }\n if (!options) {\n options = {};\n }\n\n this.type = 'default';\n this.status = options.status === undefined ? 200 : options.status;\n if (this.status < 200 \|\| this.status > 599) {\n throw new RangeError(\"Failed to construct 'Response': The status provided (0) is outside the range [200, 599].\")\n }\n this.ok = this.status >= 200 && this.status < 300;\n this.statusText = options.statusText === undefined ? '' : '' + options.statusText;\n this.headers = new Headers(options.headers);\n this.url = options.url \|\| '';\n this._initBody(bodyInit);\n }\n\n Body.call(Response.prototype);\n\n Response.prototype.clone = function() {\n return new Response(this._bodyInit, {\n status: this.status,\n statusText: this.statusText,\n headers: new Headers(this.headers),\n url: this.url\n })\n };\n\n Response.error = function() {\n var response = new Response(null, {status: 200, statusText: ''});\n response.ok = false;\n response.status = 0;\n response.type = 'error';\n return response\n };\n\n var redirectStatuses = [301, 302, 303, 307, 308];\n\n Response.redirect = function(url, status) {\n if (redirectStatuses.indexOf(status) === -1) {\n throw new RangeError('Invalid status code')\n }\n\n return new Response(null, {status: status, headers: {location: url}})\n };\n\n exports.DOMException = g.DOMException;\n try {\n new exports.DOMException();\n } catch (err) {\n exports.DOMException = function(message, name) {\n this.message = message;\n this.name = name;\n var error = Error(message);\n this.stack = error.stack;\n };\n exports.DOMException.prototype = Object.create(Error.prototype);\n exports.DOMException.prototype.constructor = exports.DOMException;\n }\n\n function fetch(input, init) {\n return new Promise(function(resolve, reject) {\n var request = new Request(input, init);\n\n if (request.signal && request.signal.aborted) {\n return reject(new exports.DOMException('Aborted', 'AbortError'))\n }\n\n var xhr = new XMLHttpRequest();\n\n function abortXhr() {\n xhr.abort();\n }\n\n xhr.onload = function() {\n var options = {\n statusText: xhr.statusText,\n headers: parseHeaders(xhr.getAllResponseHeaders() \|\| '')\n };\n // This check if specifically for when a user fetches a file locally from the file system\n // Only if the status is out of a normal range\n if (request.url.indexOf('file://') === 0 && (xhr.status < 200 \|\| xhr.status > 599)) {\n options.status = 200;\n } else {\n options.status = xhr.status;\n }\n options.url = 'responseURL' in xhr ? xhr.responseURL : options.headers.get('X-Request-URL');\n var body = 'response' in xhr ? xhr.response : xhr.responseText;\n setTimeout(function() {\n resolve(new Response(body, options));\n }, 0);\n };\n\n xhr.onerror = function() {\n setTimeout(function() {\n reject(new TypeError('Network request failed'));\n }, 0);\n };\n\n xhr.ontimeout = function() {\n setTimeout(function() {\n reject(new TypeError('Network request timed out'));\n }, 0);\n };\n\n xhr.onabort = function() {\n setTimeout(function() {\n reject(new exports.DOMException('Aborted', 'AbortError'));\n }, 0);\n };\n\n function fixUrl(url) {\n try {\n return url === '' && g.location.href ? g.location.href : url\n } catch (e) {\n return url\n }\n }\n\n xhr.open(request.method, fixUrl(request.url), true);\n\n if (request.credentials === 'include') {\n xhr.withCredentials = true;\n } else if (request.credentials === 'omit') {\n xhr.withCredentials = false;\n }\n\n if ('responseType' in xhr) {\n if (support.blob) {\n xhr.responseType = 'blob';\n } else if (\n support.arrayBuffer\n ) {\n xhr.responseType = 'arraybuffer';\n }\n }\n\n if (init && typeof init.headers === 'object' && !(init.headers instanceof Headers \|\| (g.Headers && init.headers instanceof g.Headers))) {\n var names = [];\n Object.getOwnPropertyNames(init.headers).forEach(function(name) {\n names.push(normalizeName(name));\n xhr.setRequestHeader(name, normalizeValue(init.headers[name]));\n });\n request.headers.forEach(function(value, name) {\n if (names.indexOf(name) === -1) {\n xhr.setRequestHeader(name, value);\n }\n });\n } else {\n request.headers.forEach(function(value, name) {\n xhr.setRequestHeader(name, value);\n });\n }\n\n if (request.signal) {\n request.signal.addEventListener('abort', abortXhr);\n\n xhr.onreadystatechange = function() {\n // DONE (success or failure)\n if (xhr.readyState === 4) {\n request.signal.removeEventListener('abort', abortXhr);\n }\n };\n }\n\n xhr.send(typeof request._bodyInit === 'undefined' ? null : request._bodyInit);\n })\n }\n\n fetch.polyfill = true;\n\n if (!g.fetch) {\n g.fetch = fetch;\n g.Headers = Headers;\n g.Request = Request;\n g.Response = Response;\n }\n\n exports.Headers = Headers;\n exports.Request = Request;\n exports.Response = Response;\n exports.fetch = fetch;\n\n Object.defineProperty(exports, '__esModule', { value: true });\n\n return exports;\n\n})({});\n})(__globalThis__);\n// This is a ponyfill, so...\n__globalThis__.fetch.ponyfill = true;\ndelete __globalThis__.fetch.polyfill;\n// Choose between native implementation (__global__) or custom implementation (__globalThis__)\nvar ctx = __global__.fetch ? __global__ : __globalThis__;\nexports = ctx.fetch // To enable: import fetch from 'cross-fetch'\nexports.default = ctx.fetch // For TypeScript consumers without esModuleInterop.\nexports.fetch = ctx.fetch // To enable: import {fetch} from 'cross-fetch'\nexports.Headers = ctx.Headers\nexports.Request = ctx.Request\nexports.Response = ctx.Response\nmodule.exports = exports\n","import { defaultJsonSerializer } from './defaultJsonSerializer.js';\nimport { HeadersInstanceToPlainObject, uppercase } from './helpers.js';\nimport { parseBatchRequestArgs, parseRawRequestArgs, parseRawRequestExtendedArgs, parseRequestArgs, parseRequestExtendedArgs, } from './parseArgs.js';\nimport { resolveRequestDocument } from './resolveRequestDocument.js';\nimport { ClientError, } from './types.js';\nimport crossFetch, as CrossFetch from 'cross-fetch';\nexport { ClientError, };\n/*\n Convert the given headers configuration into a plain object.\n /\nconst resolveHeaders = (headers) => {\n let oHeaders = {};\n if (headers) {\n if ((typeof Headers !== `undefined` && headers instanceof Headers) \|\|\n (CrossFetch && CrossFetch.Headers && headers instanceof CrossFetch.Headers)) {\n oHeaders = HeadersInstanceToPlainObject(headers);\n }\n else if (Array.isArray(headers)) {\n headers.forEach(([name, value]) => {\n if (name && value !== undefined) {\n oHeaders[name] = value;\n }\n });\n }\n else {\n oHeaders = headers;\n }\n }\n return oHeaders;\n};\n/\n Clean a GraphQL document to send it via a GET query\n /\nconst cleanQuery = (str) => str.replace(/([\\s,]\|#[^\\n\\r]+)+/g, ` `).trim();\n/\n Create query string for GraphQL request\n /\nconst buildRequestConfig = (params) => {\n if (!Array.isArray(params.query)) {\n const params_ = params;\n const search = [`query=${encodeURIComponent(cleanQuery(params_.query))}`];\n if (params.variables) {\n search.push(`variables=${encodeURIComponent(params_.jsonSerializer.stringify(params_.variables))}`);\n }\n if (params_.operationName) {\n search.push(`operationName=${encodeURIComponent(params_.operationName)}`);\n }\n return search.join(`&`);\n }\n if (typeof params.variables !== `undefined` && !Array.isArray(params.variables)) {\n throw new Error(`Cannot create query with given variable type, array expected`);\n }\n // Batch support\n const params_ = params;\n const payload = params.query.reduce((acc, currentQuery, index) => {\n acc.push({\n query: cleanQuery(currentQuery),\n variables: params_.variables ? params_.jsonSerializer.stringify(params_.variables[index]) : undefined,\n });\n return acc;\n }, []);\n return `query=${encodeURIComponent(params_.jsonSerializer.stringify(payload))}`;\n};\nconst createHttpMethodFetcher = (method) => async (params) => {\n const { url, query, variables, operationName, fetch, fetchOptions, middleware } = params;\n const headers = { ...params.headers };\n let queryParams = ``;\n let body = undefined;\n if (method === `POST`) {\n body = createRequestBody(query, variables, operationName, fetchOptions.jsonSerializer);\n if (typeof body === `string`) {\n // @ts-expect-error todo\n headers[`Content-Type`] = `application/json`;\n }\n }\n else {\n // @ts-expect-error todo needs ADT for TS to understand the different states\n queryParams = buildRequestConfig({\n query,\n variables,\n operationName,\n jsonSerializer: fetchOptions.jsonSerializer ?? defaultJsonSerializer,\n });\n }\n const init = {\n method,\n headers,\n body,\n ...fetchOptions,\n };\n let urlResolved = url;\n let initResolved = init;\n if (middleware) {\n const result = await Promise.resolve(middleware({ ...init, url, operationName, variables }));\n const { url: urlNew, ...initNew } = result;\n urlResolved = urlNew;\n initResolved = initNew;\n }\n if (queryParams) {\n urlResolved = `${urlResolved}?${queryParams}`;\n }\n return await fetch(urlResolved, initResolved);\n};\n/\n GraphQL Client.\n /\nexport class GraphQLClient {\n constructor(url, requestConfig = {}) {\n this.url = url;\n this.requestConfig = requestConfig;\n /\n Send a GraphQL query to the server.\n /\n this.rawRequest = async (...args) => {\n const [queryOrOptions, variables, requestHeaders] = args;\n const rawRequestOptions = parseRawRequestArgs(queryOrOptions, variables, requestHeaders);\n const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n const { url } = this;\n if (rawRequestOptions.signal !== undefined) {\n fetchOptions.signal = rawRequestOptions.signal;\n }\n const { operationName } = resolveRequestDocument(rawRequestOptions.query);\n return makeRequest({\n url,\n query: rawRequestOptions.query,\n variables: rawRequestOptions.variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(rawRequestOptions.requestHeaders),\n },\n operationName,\n fetch,\n method,\n fetchOptions,\n middleware: requestMiddleware,\n })\n .then((response) => {\n if (responseMiddleware) {\n responseMiddleware(response);\n }\n return response;\n })\n .catch((error) => {\n if (responseMiddleware) {\n responseMiddleware(error);\n }\n throw error;\n });\n };\n }\n async request(documentOrOptions, ...variablesAndRequestHeaders) {\n const [variables, requestHeaders] = variablesAndRequestHeaders;\n const requestOptions = parseRequestArgs(documentOrOptions, variables, requestHeaders);\n const { headers, fetch = crossFetch, method = `POST`, requestMiddleware, responseMiddleware, ...fetchOptions } = this.requestConfig;\n const { url } = this;\n if (requestOptions.signal !== undefined) {\n fetchOptions.signal = requestOptions.signal;\n }\n const { query, operationName } = resolveRequestDocument(requestOptions.document);\n return makeRequest({\n url,\n query,\n variables: requestOptions.variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(requestOptions.requestHeaders),\n },\n operationName,\n fetch,\n method,\n fetchOptions,\n middleware: requestMiddleware,\n })\n .then((response) => {\n if (responseMiddleware) {\n responseMiddleware(response);\n }\n return response.data;\n })\n .catch((error) => {\n if (responseMiddleware) {\n responseMiddleware(error);\n }\n throw error;\n });\n }\n // prettier-ignore\n batchRequests(documentsOrOptions, requestHeaders) {\n const batchRequestOptions = parseBatchRequestArgs(documentsOrOptions, requestHeaders);\n const { headers, ...fetchOptions } = this.requestConfig;\n if (batchRequestOptions.signal !== undefined) {\n fetchOptions.signal = batchRequestOptions.signal;\n }\n const queries = batchRequestOptions.documents.map(({ document }) => resolveRequestDocument(document).query);\n const variables = batchRequestOptions.documents.map(({ variables }) => variables);\n return makeRequest({\n url: this.url,\n query: queries,\n // @ts-expect-error TODO reconcile batch variables into system.\n variables,\n headers: {\n ...resolveHeaders(callOrIdentity(headers)),\n ...resolveHeaders(batchRequestOptions.requestHeaders),\n },\n operationName: undefined,\n fetch: this.requestConfig.fetch ?? crossFetch,\n method: this.requestConfig.method \|\| `POST`,\n fetchOptions,\n middleware: this.requestConfig.requestMiddleware,\n })\n .then((response) => {\n if (this.requestConfig.responseMiddleware) {\n this.requestConfig.responseMiddleware(response);\n }\n return response.data;\n })\n .catch((error) => {\n if (this.requestConfig.responseMiddleware) {\n this.requestConfig.responseMiddleware(error);\n }\n throw error;\n });\n }\n setHeaders(headers) {\n this.requestConfig.headers = headers;\n return this;\n }\n /\n Attach a header to the client. All subsequent requests will have this header.\n /\n setHeader(key, value) {\n const { headers } = this.requestConfig;\n if (headers) {\n // todo what if headers is in nested array form... ?\n //@ts-expect-error todo\n headers[key] = value;\n }\n else {\n this.requestConfig.headers = { [key]: value };\n }\n return this;\n }\n /\n Change the client endpoint. All subsequent requests will send to this endpoint.\n /\n setEndpoint(value) {\n this.url = value;\n return this;\n }\n}\nconst makeRequest = async (params) => {\n const { query, variables, fetchOptions } = params;\n const fetcher = createHttpMethodFetcher(uppercase(params.method ?? `post`));\n const isBatchingQuery = Array.isArray(params.query);\n const response = await fetcher(params);\n const result = await getResult(response, fetchOptions.jsonSerializer ?? defaultJsonSerializer);\n const successfullyReceivedData = Array.isArray(result)\n ? !result.some(({ data }) => !data)\n : Boolean(result.data);\n const successfullyPassedErrorPolicy = Array.isArray(result) \|\|\n !result.errors \|\|\n (Array.isArray(result.errors) && !result.errors.length) \|\|\n fetchOptions.errorPolicy === `all` \|\|\n fetchOptions.errorPolicy === `ignore`;\n if (response.ok && successfullyPassedErrorPolicy && successfullyReceivedData) {\n // @ts-expect-error TODO fixme\n const { errors: _, ...rest } = Array.isArray(result) ? result : result;\n const data = fetchOptions.errorPolicy === `ignore` ? rest : result;\n const dataEnvelope = isBatchingQuery ? { data } : data;\n // @ts-expect-error TODO\n return {\n ...dataEnvelope,\n headers: response.headers,\n status: response.status,\n };\n }\n else {\n const errorResult = typeof result === `string`\n ? {\n error: result,\n }\n : result;\n throw new ClientError(\n // @ts-expect-error TODO\n { ...errorResult, status: response.status, headers: response.headers }, { query, variables });\n }\n};\n/\n Send a GraphQL Query to the GraphQL server for execution.\n /\nexport const rawRequest = async (...args) => {\n const [urlOrOptions, query, ...variablesAndRequestHeaders] = args;\n const requestOptions = parseRawRequestExtendedArgs(urlOrOptions, query, ...variablesAndRequestHeaders);\n const client = new GraphQLClient(requestOptions.url);\n return client.rawRequest({\n ...requestOptions,\n });\n};\n// prettier-ignore\n// eslint-disable-next-line\nexport async function request(urlOrOptions, document, ...variablesAndRequestHeaders) {\n const requestOptions = parseRequestExtendedArgs(urlOrOptions, document, ...variablesAndRequestHeaders);\n const client = new GraphQLClient(requestOptions.url);\n return client.request({\n ...requestOptions,\n });\n}\n/\n Send a batch of GraphQL Document to the GraphQL server for execution.\n \n @example\n \n ```ts\n * // You can pass a raw string\n \n await batchRequests('https://foo.bar/graphql', [\n * {\n * query: `\n * {\n * query {\n * users\n * }\n * }`\n * },\n * {\n * query: `\n * {\n * query {\n * users\n * }\n * }`\n * }])\n \n // You can also pass a GraphQL DocumentNode as query. Convenient if you\n * // are using graphql-tag package.\n \n import gql from 'graphql-tag'\n \n await batchRequests('https://foo.bar/graphql', [{ query: gql`...` }])\n * ```\n /\nexport const batchRequests = async (...args) => {\n const params = parseBatchRequestsArgsExtended(args);\n const client = new GraphQLClient(params.url);\n return client.batchRequests(params);\n};\nconst parseBatchRequestsArgsExtended = (args) => {\n if (args.length === 1) {\n return args[0];\n }\n else {\n return {\n url: args[0],\n documents: args[1],\n requestHeaders: args[2],\n signal: undefined,\n };\n }\n};\nconst createRequestBody = (query, variables, operationName, jsonSerializer) => {\n const jsonSerializer_ = jsonSerializer ?? defaultJsonSerializer;\n if (!Array.isArray(query)) {\n return jsonSerializer_.stringify({ query, variables, operationName });\n }\n if (typeof variables !== `undefined` && !Array.isArray(variables)) {\n throw new Error(`Cannot create request body with given variable type, array expected`);\n }\n // Batch support\n const payload = query.reduce((acc, currentQuery, index) => {\n acc.push({ query: currentQuery, variables: variables ? variables[index] : undefined });\n return acc;\n }, []);\n return jsonSerializer_.stringify(payload);\n};\nconst getResult = async (response, jsonSerializer) => {\n let contentType;\n response.headers.forEach((value, key) => {\n if (key.toLowerCase() === `content-type`) {\n contentType = value;\n }\n });\n if (contentType &&\n (contentType.toLowerCase().startsWith(`application/json`) \|\|\n contentType.toLowerCase().startsWith(`application/graphql+json`) \|\|\n contentType.toLowerCase().startsWith(`application/graphql-response+json`))) {\n return jsonSerializer.parse(await response.text());\n }\n else {\n return response.text();\n }\n};\nconst callOrIdentity = (value) => {\n return typeof value === `function` ? value() : value;\n};\n/\n Convenience passthrough template tag to get the benefits of tooling for the gql template tag. This does not actually parse the input into a GraphQL DocumentNode like graphql-tag package does. It just returns the string with any variables given interpolated. Can save you a bit of performance and having to install another package.\n \n @example\n * ```\n * import { gql } from 'graphql-request'\n \n await request('https://foo.bar/graphql', gql`...`)\n * ```\n \n @remarks\n \n Several tools in the Node GraphQL ecosystem are hardcoded to specially treat any template tag named \"gql\". For example see this prettier issue: https://github.com/prettier/prettier/issues/4360. Using this template tag has no runtime effect beyond variable interpolation.\n /\nexport const gql = (chunks, ...variables) => {\n return chunks.reduce((acc, chunk, index) => `${acc}${chunk}${index in variables ? String(variables[index]) : ``}`, ``);\n};\nexport { GraphQLWebSocketClient } from './graphql-ws.js';\nexport { resolveRequestDocument } from './resolveRequestDocument.js';\nexport default request;\n//# sourceMappingURL=index.js.map","import { gql } from 'graphql-request'\n\n/\n Queries for the GraphQL API.\n * @public\n /\nconst queries = {\n\tgetMeta: gql`\n\t\tquery getDoctype($doctype: String!) {\n\t\t\tgetMeta(doctype: $doctype) {\n\t\t\t\tid\n\t\t\t\tname\n\t\t\t\tworkflow\n\t\t\t\tschema\n\t\t\t\tactions\n\t\t\t}\n\t\t}\n\t`,\n}\n\nexport { queries }\n","import { gql } from 'graphql-request'\n\n/\n This is the schema for the GraphQL API.\n * @public\n /\nconst typeDefs = gql`\n\ttype Doctype {\n\t\tid: ID!\n\t\tname: String!\n\t\tworkflow: String!\n\t\tschema: String!\n\t\tactions: String!\n\t}\n\n\ttype DoctypeField {\n\t\tid: ID!\n\t\tlabel: String!\n\t\tfieldtype: String\n\t\tcomponent: String\n\t\trequired: Boolean\n\t\treadonly: Boolean\n\t}\n\n\ttype DoctypeWorkflow {\n\t\tname: String!\n\t\tmachine: StateMachine!\n\t}\n\n\ttype StateMachine {\n\t\tid: ID!\n\t}\n\n\ttype DoctypeAction {\n\t\teventName: String!\n\t\tcallback: String\n\t}\n\n\ttype Query {\n\t\tgetMeta(doctype: String!): Doctype # ∪ error\n\t\tgetRecords(doctype: String!, filters: [String]): [String] # ∪ error\n\t\tgetRecord(doctype: String!, id: ID!): String # ∪ error\n\t}\n\n\ttype Mutation {\n\t\trunAction(doctype: String!, id: [ID!]!, functionName: String!): [String!]! # ∪ error\n\t}\n\n\tschema {\n\t\tquery: Query\n\t\tmutation: Mutation\n\t}\n`\n\nexport default typeDefs\n","import { Decimal } from 'decimal.js'\nimport { GraphQLClient } from 'graphql-request'\n\nimport { queries } from './queries'\nimport typeDefs from './gql/schema'\nimport type { Meta, MetaParser, MetaResponse } from './types'\n\n/\n Parse the response from the GraphQL server. Converts the stringified JSON to JSON and converts the stringified numbers to Decimal.\n * @param obj - The response from the GraphQL server\n * @returns The parsed response\n * @example\n * const response = '{\"data\":{\"getMeta\":{\"id\":\"Issue\",\"name\":\"Issue\",\"workflow\":\"{\\\"machineId\\\":null,\\\"name\\\":\\\"save\\\",\\\"id\\\":\\\"1\\\"}\",\"schema\":\"[{\\\"label\\\":\\\"Subject\\\",\\\"id\\\":\\\"1\\\"}]\",\"actions\":\"[{\\\"eventName\\\":\\\"save\\\",\\\"id\\\":\\\"1\\\"}]\"}}}'\n * const parsedResponse = metaParser(response)\n * console.log(parsedResponse)\n * /* Output: {\"id\": \"Issue\", \"name\": \"Issue\", \"workflow\": { \"machineId\": null, \"name\": \"save\", \"id\": \"1\" }, \"schema\": [{ \"label\": \"Subject\", \"id\": \"1\" }], \"actions\": [{ \"eventName\": \"save\", \"id\": \"1\" }]}\n /\nconst metaParser = (obj: string): MetaParser => {\n\treturn JSON.parse(obj, (key, value) => {\n\t\tif (typeof value === 'string') {\n\t\t\ttry {\n\t\t\t\treturn JSON.parse(value, (_key, value) => {\n\t\t\t\t\tif (typeof value === 'string' && !isNaN(Number(value))) {\n\t\t\t\t\t\treturn new Decimal(value)\n\t\t\t\t\t}\n\n\t\t\t\t\treturn value\n\t\t\t\t})\n\t\t\t} catch {\n\t\t\t\t// if the value is not a stringified JSON, return as it is\n\t\t\t\treturn value\n\t\t\t}\n\t\t} else if (!isNaN(Number(value))) {\n\t\t\treturn new Decimal(value as string \| number)\n\t\t}\n\t\treturn value\n\t})\n}\n\n/\n Get meta information for a doctype\n * @param doctype - The doctype to get meta information for\n * @param url - The URL to send the request to\n * @returns The meta information for the doctype\n * @public\n */\nconst methods = {\n\tgetMeta: async (doctype: string, url?: string): Promise<MetaResponse> => {\n\t\tconst client = new GraphQLClient(url \|\| '/graphql', {\n\t\t\tfetch: window.fetch,\n\t\t\tjsonSerializer: {\n\t\t\t\tstringify: obj => JSON.stringify(obj), // process the request object before sending; leave as default JSON\n\t\t\t\tparse: metaParser, // process the response meta object\n\t\t\t},\n\t\t})\n\n\t\tconst { getMeta } = await client.request<Meta['response'], Meta['variables']>({\n\t\t\tdocument: queries.getMeta,\n\t\t\tvariables: { doctype },\n\t\t})\n\n\t\treturn getMeta\n\t},\n}\n\nexport type { Meta, MetaParser, MetaResponse } from './types'\nexport { queries, typeDefs, methods }\n"],"names":["EXP_LIMIT","MAX_DIGITS","NUMERALS","LN10","PI","DEFAULTS","inexact","quadrant","external","decimalError","invalidArgument","precisionLimitExceeded","cryptoUnavailable","tag","mathfloor","mathpow","isBinary","isHex","isOctal","isDecimal","BASE","LOG_BASE","MAX_SAFE_INTEGER","LN10_PRECISION","PI_PRECISION","P","x","finalise","min","max","k","Ctor","y","i","j","xdL","ydL","xd","yd","xs","ys","pr","rm","cosine","toLessThanHalfPi","m","r","rep","sd","t","t3","t3plusx","digitsToString","divide","w","d","n","len","one","tinyPow","taylorSeries","cosh2_x","d8","sinh2_x","d5","d16","d20","halfPi","getPi","wpr","xsd","px","x2","base","isBase10","denominator","inf","num","arg","guard","naturalLogarithm","getLn10","checkRoundingDigits","e","xe","xLTy","getBase10Exponent","q","naturalExponential","carry","z","getPrecision","sine","s","rL","toStringBinary","dp","checkInt32","str","finiteToString","maxD","d0","d1","d2","n0","n1","yn","intPow","ws","indexOfLastWord","getZeroString","repeating","di","rd","convertBase","baseIn","baseOut","arr","arrL","strL","cos2x","multiplyInteger","temp","compare","a","b","aL","bL","subtract","cmp","logBase","more","prod","prodL","qd","rem","remL","rem0","xi","xL","yd0","yL","yz","sign","isTruncated","digits","roundUp","xdi","out","isExp","nonFiniteToString","zs","truncate","isOdd","maxOrMin","args","ltgt","pow","sum","c","c0","numerator","x1","parseDecimal","parseOther","divisor","isFloat","p","Decimal","sin2_x","isHyperbolic","u","isNeg","pi","abs","acos","acosh","add","asin","asinh","atan","atanh","atan2","cbrt","ceil","clamp","config","obj","v","useDefaults","ps","cos","cosh","clone","isDecimalInstance","div","exp","floor","hypot","ln","log","log10","log2","mod","mul","random","round","sin","sinh","sqrt","sub","tan","tanh","trunc","defaultJsonSerializer","uppercase","HeadersInstanceToPlainObject","headers","o","parseRequestArgs","documentOrOptions","variables","requestHeaders","parseRawRequestArgs","queryOrOptions","parseBatchRequestArgs","documentsOrOptions","devAssert","condition","message","isObjectLike","value","invariant","LineRegExp","getLocation","source","position","lastLineStart","line","match","printLocation","location","printSourceLocation","sourceLocation","firstLineColumnOffset","body","lineIndex","lineOffset","lineNum","columnOffset","columnNum","locationStr","lines","locationLine","subLineIndex","subLineColumnNum","subLines","printPrefixedLines","subLine","existingLines","_","padLen","prefix","toNormalizedOptions","firstArg","GraphQLError","rawArgs","_this$nodes","_nodeLocations$","_ref","nodes","positions","path","originalError","extensions","undefinedIfEmpty","nodeLocations","node","loc","pos","originalExtensions","output","formattedError","array","syntaxError","description","Location","startToken","endToken","Token","kind","start","end","column","QueryDocumentKeys","kindValues","isNode","maybeNode","maybeKind","OperationTypeNode","DirectiveLocation","Kind","isWhiteSpace","code","isDigit","isLetter","isNameStart","isNameContinue","dedentBlockStringLines","_firstNonEmptyLine2","commonIndent","firstNonEmptyLine","lastNonEmptyLine","_firstNonEmptyLine","indent","leadingWhitespace","printBlockString","options","escapedValue","isSingleLine","forceLeadingNewLine","hasTrailingTripleQuotes","hasTrailingQuote","hasTrailingSlash","forceTrailingNewline","printAsMultipleLines","result","skipLeadingNewLine","TokenKind","Lexer","startOfFileToken","token","nextToken","readNextToken","isPunctuatorTokenKind","isUnicodeScalarValue","isSupplementaryCodePoint","isLeadingSurrogate","isTrailingSurrogate","printCodePointAt","lexer","char","createToken","col","bodyLength","readComment","readBlockString","readString","readNumber","readName","firstCode","readDigits","chunkStart","escape","readEscapedUnicodeVariableWidth","readEscapedUnicodeFixedWidth","readEscapedCharacter","point","size","readHexDigit","read16BitHexCode","trailingCode","lineStart","currentLine","blockLines","MAX_ARRAY_LENGTH","MAX_RECURSIVE_DEPTH","inspect","formatValue","seenValues","formatObjectValue","previouslySeenValues","isJSONable","jsonValue","formatArray","formatObject","object","entries","getObjectTag","key","remaining","items","name","isProduction","instanceOf","constructor","_value$constructor","className","valueClassName","stringifiedValue","Source","locationOffset","isSource","parse","parser","Parser","document","_options","sourceObj","hasDescription","keywordToken","operation","operationToken","nameOrAlias","alias","isConst","item","hasTypeCondition","varName","directives","type","innerType","operationTypes","interfaces","fields","defaultValue","types","values","getTokenDesc","repeatable","locations","ofDirective","memberName","argumentName","getTokenKindDesc","atToken","openKind","parseFn","closeKind","delimiterKind","maxTokens","printString","escapedRegExp","escapedReplacer","escapeSequences","BREAK","visit","root","visitor","visitorKeys","enterLeaveMap","getEnterLeaveForKind","stack","inArray","keys","index","edits","parent","ancestors","isLeaving","isEdited","editOffset","editKey","editValue","arrayKey","_enterLeaveMap$get","_enterLeaveMap$get2","visitFn","_node$kind","kindVisitor","print","ast","printDocASTReducer","MAX_LINE_LENGTH","join","varDefs","hasMultilineItems","wrap","variable","selections","block","selectionSet","argsLine","typeCondition","variableDefinitions","isBlockString","fieldName","maybeArray","separator","_maybeArray$filter$jo","maybeString","_maybeArray$some","extractOperationName","operationName","operationDefinitions","definition","resolveRequestDocument","parsedDocument","ClientError","response","request","__global__","global","__globalThis__","F","globalThis","exports","g","support","isDataView","viewClasses","isArrayBufferView","normalizeName","normalizeValue","iteratorFor","iterator","Headers","header","oldValue","callback","thisArg","consumed","fileReaderReady","reader","resolve","reject","readBlobAsArrayBuffer","blob","promise","readBlobAsText","encoding","readArrayBufferAsText","buf","view","chars","bufferClone","Body","rejected","isConsumed","decode","methods","normalizeMethod","method","upcased","Request","input","ctrl","reParamSearch","reQueryString","form","bytes","split","parseHeaders","rawHeaders","preProcessedHeaders","parts","error","Response","bodyInit","redirectStatuses","url","status","fetch","init","xhr","abortXhr","fixUrl","names","ctx","module","resolveHeaders","oHeaders","CrossFetch","CrossFetch.Headers","cleanQuery","buildRequestConfig","params","params_","search","payload","acc","currentQuery","createHttpMethodFetcher","query","fetchOptions","middleware","queryParams","createRequestBody","urlResolved","initResolved","urlNew","initNew","GraphQLClient","requestConfig","rawRequestOptions","crossFetch","requestMiddleware","responseMiddleware","makeRequest","callOrIdentity","variablesAndRequestHeaders","requestOptions","batchRequestOptions","queries","fetcher","isBatchingQuery","getResult","successfullyReceivedData","data","successfullyPassedErrorPolicy","rest","errorResult","jsonSerializer","jsonSerializer_","contentType","gql","chunks","chunk","typeDefs","metaParser","_key","doctype","client","getMeta"],"mappings":";;;;;;;;;;;;;;;;AAcA,IAAIA,KAAY,MAIdC,KAAa,KAGbC,KAAW,oBAGXC,KAAO,sgCAGPC,KAAK,sgCAILC,KAAW;AAAA;AAAA;AAAA;AAAA;AAAA,EAOT,WAAW;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiBX,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeV,QAAQ;AAAA;AAAA;AAAA;AAAA,EAIR,UAAU;AAAA;AAAA;AAAA;AAAA,EAIV,UAAW;AAAA;AAAA;AAAA;AAAA,EAIX,MAAM,CAACL;AAAA;AAAA;AAAA;AAAA,EAIP,MAAMA;AAAA;AAAA;AAAA,EAGN,QAAQ;AAAA;AACZ,GAMEM,IAASC,GACTC,IAAW,IAEXC,KAAe,mBACfC,KAAkBD,KAAe,sBACjCE,KAAyBF,KAAe,4BACxCG,KAAoBH,KAAe,sBACnCI,KAAM,oBAENC,IAAY,KAAK,OACjBC,IAAU,KAAK,KAEfC,KAAW,8CACXC,KAAQ,0DACRC,KAAU,iDACVC,KAAY,sCAEZC,IAAO,KACPC,IAAW,GACXC,KAAmB,kBAEnBC,KAAiBpB,GAAK,SAAS,GAC/BqB,KAAepB,GAAG,SAAS,GAG3BqB,IAAI,EAAE,aAAaZ;AA0ErBY,EAAE,gBAAgBA,EAAE,MAAM,WAAY;AACpC,MAAIC,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,SAAIA,EAAE,IAAI,MAAGA,EAAE,IAAI,IACZC,EAASD,CAAC;AACnB;AAQAD,EAAE,OAAO,WAAY;AACnB,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAWAF,EAAE,YAAYA,EAAE,QAAQ,SAAUG,GAAKC,GAAK;AAC1C,MAAIC,GACFJ,IAAI,MACJK,IAAOL,EAAE;AAGX,MAFAE,IAAM,IAAIG,EAAKH,CAAG,GAClBC,IAAM,IAAIE,EAAKF,CAAG,GACd,CAACD,EAAI,KAAK,CAACC,EAAI,EAAG,QAAO,IAAIE,EAAK,GAAG;AACzC,MAAIH,EAAI,GAAGC,CAAG,EAAG,OAAM,MAAMnB,KAAkBmB,CAAG;AAClD,SAAAC,IAAIJ,EAAE,IAAIE,CAAG,GACNE,IAAI,IAAIF,IAAMF,EAAE,IAAIG,CAAG,IAAI,IAAIA,IAAM,IAAIE,EAAKL,CAAC;AACxD;AAWAD,EAAE,aAAaA,EAAE,MAAM,SAAUO,GAAG;AAClC,MAAIC,GAAGC,GAAGC,GAAKC,GACbV,IAAI,MACJW,IAAKX,EAAE,GACPY,KAAMN,IAAI,IAAIN,EAAE,YAAYM,CAAC,GAAG,GAChCO,IAAKb,EAAE,GACPc,IAAKR,EAAE;AAGT,MAAI,CAACK,KAAM,CAACC;AACV,WAAO,CAACC,KAAM,CAACC,IAAK,MAAMD,MAAOC,IAAKD,IAAKF,MAAOC,IAAK,IAAI,CAACD,IAAKE,IAAK,IAAI,IAAI;AAIhF,MAAI,CAACF,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC,EAAG,QAAOD,EAAG,CAAC,IAAIE,IAAKD,EAAG,CAAC,IAAI,CAACE,IAAK;AAGxD,MAAID,MAAOC,EAAI,QAAOD;AAGtB,MAAIb,EAAE,MAAMM,EAAE,EAAG,QAAON,EAAE,IAAIM,EAAE,IAAIO,IAAK,IAAI,IAAI;AAMjD,OAJAJ,IAAME,EAAG,QACTD,IAAME,EAAG,QAGJL,IAAI,GAAGC,IAAIC,IAAMC,IAAMD,IAAMC,GAAKH,IAAIC,GAAG,EAAED;AAC9C,QAAII,EAAGJ,CAAC,MAAMK,EAAGL,CAAC,EAAG,QAAOI,EAAGJ,CAAC,IAAIK,EAAGL,CAAC,IAAIM,IAAK,IAAI,IAAI;AAI3D,SAAOJ,MAAQC,IAAM,IAAID,IAAMC,IAAMG,IAAK,IAAI,IAAI;AACpD;AAgBAd,EAAE,SAASA,EAAE,MAAM,WAAY;AAC7B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,IAGFA,EAAE,EAAE,CAAC,KAEVe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAIL,GAC9CU,EAAK,WAAW,GAEhBL,IAAIiB,GAAOZ,GAAMa,GAAiBb,GAAML,CAAC,CAAC,GAE1CK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,KAAY,KAAKA,KAAY,IAAImB,EAAE,IAAG,IAAKA,GAAGe,GAAIC,GAAI,EAAI,KAZtD,IAAIX,EAAK,CAAC,IAHb,IAAIA,EAAK,GAAG;AAgB/B;AAmBAN,EAAE,WAAWA,EAAE,OAAO,WAAY;AAChC,MAAI,GAAGoB,GAAG,GAAGC,GAAGC,GAAK,GAAGC,GAAIC,GAAGC,GAAIC,GACjCzB,IAAI,MACJK,IAAOL,EAAE;AAEX,MAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,EAAI,QAAO,IAAIK,EAAKL,CAAC;AAoClD,OAnCAlB,IAAW,IAGX,IAAIkB,EAAE,IAAIX,EAAQW,EAAE,IAAIA,GAAG,IAAI,CAAC,GAI5B,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,SACvB,IAAI0B,EAAe1B,EAAE,CAAC,GACtB,IAAIA,EAAE,IAGF,KAAK,IAAI,EAAE,SAAS,KAAK,OAAG,KAAM,KAAK,KAAK,KAAK,KAAK,MAAM,OAChE,IAAIX,EAAQ,GAAG,IAAI,CAAC,GAGpB,IAAID,GAAW,IAAI,KAAK,CAAC,KAAK,IAAI,MAAM,IAAI,IAAI,KAAK,KAEjD,KAAK,QACP,IAAI,OAAO,KAEX,IAAI,EAAE,iBACN,IAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI,IAGvCgC,IAAI,IAAIf,EAAK,CAAC,GACde,EAAE,IAAIpB,EAAE,KAERoB,IAAI,IAAIf,EAAK,EAAE,SAAQ,CAAE,GAG3BiB,KAAM,IAAIjB,EAAK,aAAa;AAW1B,QANAkB,IAAIH,GACJI,IAAKD,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,GACvBE,IAAUD,EAAG,KAAKxB,CAAC,GACnBoB,IAAIO,EAAOF,EAAQ,KAAKzB,CAAC,EAAE,MAAMuB,CAAC,GAAGE,EAAQ,KAAKD,CAAE,GAAGF,IAAK,GAAG,CAAC,GAG5DI,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGD,CAAE,OAAO,IAAII,EAAeN,EAAE,CAAC,GAAG,MAAM,GAAGE,CAAE;AAK5E,UAJA,IAAI,EAAE,MAAMA,IAAK,GAAGA,IAAK,CAAC,GAItB,KAAK,UAAU,CAACD,KAAO,KAAK,QAAQ;AAItC,YAAI,CAACA,MACHpB,EAASsB,GAAG,IAAI,GAAG,CAAC,GAEhBA,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAGvB,CAAC,IAAG;AAC7B,UAAAoB,IAAIG;AACJ;AAAA,QACF;AAGF,QAAAD,KAAM,GACND,IAAM;AAAA,MACR,OAAO;AAIL,SAAI,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,KAAK,SAGxCpB,EAASmB,GAAG,IAAI,GAAG,CAAC,GACpBD,IAAI,CAACC,EAAE,MAAMA,CAAC,EAAE,MAAMA,CAAC,EAAE,GAAGpB,CAAC;AAG/B;AAAA,MACF;AAIJ,SAAAlB,IAAW,IAEJmB,EAASmB,GAAG,GAAGf,EAAK,UAAUc,CAAC;AACxC;AAOApB,EAAE,gBAAgBA,EAAE,KAAK,WAAY;AACnC,MAAI6B,GACFC,IAAI,KAAK,GACT,IAAI;AAEN,MAAIA,GAAG;AAML,QALAD,IAAIC,EAAE,SAAS,GACf,KAAKD,IAAIxC,EAAU,KAAK,IAAIO,CAAQ,KAAKA,GAGzCiC,IAAIC,EAAED,CAAC,GACHA,EAAG,QAAOA,IAAI,MAAM,GAAGA,KAAK,GAAI;AACpC,IAAI,IAAI,MAAG,IAAI;AAAA,EACjB;AAEA,SAAO;AACT;AAwBA7B,EAAE,YAAYA,EAAE,MAAM,SAAUO,GAAG;AACjC,SAAOqB,EAAO,MAAM,IAAI,KAAK,YAAYrB,CAAC,CAAC;AAC7C;AAQAP,EAAE,qBAAqBA,EAAE,WAAW,SAAUO,GAAG;AAC/C,MAAIN,IAAI,MACNK,IAAOL,EAAE;AACX,SAAOC,EAAS0B,EAAO3B,GAAG,IAAIK,EAAKC,CAAC,GAAG,GAAG,GAAG,CAAC,GAAGD,EAAK,WAAWA,EAAK,QAAQ;AAChF;AAOAN,EAAE,SAASA,EAAE,KAAK,SAAUO,GAAG;AAC7B,SAAO,KAAK,IAAIA,CAAC,MAAM;AACzB;AAQAP,EAAE,QAAQ,WAAY;AACpB,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQAF,EAAE,cAAcA,EAAE,KAAK,SAAUO,GAAG;AAClC,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAQAP,EAAE,uBAAuBA,EAAE,MAAM,SAAUO,GAAG;AAC5C,MAAIF,IAAI,KAAK,IAAIE,CAAC;AAClB,SAAOF,KAAK,KAAKA,MAAM;AACzB;AA4BAL,EAAE,mBAAmBA,EAAE,OAAO,WAAY;AACxC,MAAIK,GAAG0B,GAAGf,GAAIC,GAAIe,GAChB/B,IAAI,MACJK,IAAOL,EAAE,aACTgC,IAAM,IAAI3B,EAAK,CAAC;AAElB,MAAI,CAACL,EAAE,SAAQ,EAAI,QAAO,IAAIK,EAAKL,EAAE,IAAI,QAAQ,GAAG;AACpD,MAAIA,EAAE,SAAU,QAAOgC;AAEvB,EAAAjB,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC9CK,EAAK,WAAW,GAChB0B,IAAM/B,EAAE,EAAE,QAON+B,IAAM,MACR3B,IAAI,KAAK,KAAK2B,IAAM,CAAC,GACrBD,KAAK,IAAIG,GAAQ,GAAG7B,CAAC,GAAG,eAExBA,IAAI,IACJ0B,IAAI,iCAGN9B,IAAIkC,GAAa7B,GAAM,GAAGL,EAAE,MAAM8B,CAAC,GAAG,IAAIzB,EAAK,CAAC,GAAG,EAAI;AAMvD,WAHI8B,GACF5B,IAAIH,GACJgC,IAAK,IAAI/B,EAAK,CAAC,GACVE;AACL,IAAA4B,IAAUnC,EAAE,MAAMA,CAAC,GACnBA,IAAIgC,EAAI,MAAMG,EAAQ,MAAMC,EAAG,MAAMD,EAAQ,MAAMC,CAAE,CAAC,CAAC,CAAC;AAG1D,SAAOnC,EAASD,GAAGK,EAAK,YAAYU,GAAIV,EAAK,WAAWW,GAAI,EAAI;AAClE;AAiCAjB,EAAE,iBAAiBA,EAAE,OAAO,WAAY;AACtC,MAAIK,GAAGW,GAAIC,GAAIe,GACb/B,IAAI,MACJK,IAAOL,EAAE;AAEX,MAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,EAAI,QAAO,IAAIK,EAAKL,CAAC;AAQlD,MANAe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC9CK,EAAK,WAAW,GAChB0B,IAAM/B,EAAE,EAAE,QAEN+B,IAAM;AACR,IAAA/B,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,GAAG,EAAI;AAAA,OAC/B;AAWL,IAAAI,IAAI,MAAM,KAAK,KAAK2B,CAAG,GACvB3B,IAAIA,IAAI,KAAK,KAAKA,IAAI,GAEtBJ,IAAIA,EAAE,MAAM,IAAIiC,GAAQ,GAAG7B,CAAC,CAAC,GAC7BJ,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,GAAG,EAAI;AAOpC,aAJIqC,GACFC,IAAK,IAAIjC,EAAK,CAAC,GACfkC,IAAM,IAAIlC,EAAK,EAAE,GACjBmC,IAAM,IAAInC,EAAK,EAAE,GACZD;AACL,MAAAiC,IAAUrC,EAAE,MAAMA,CAAC,GACnBA,IAAIA,EAAE,MAAMsC,EAAG,KAAKD,EAAQ,MAAME,EAAI,MAAMF,CAAO,EAAE,KAAKG,CAAG,CAAC,CAAC,CAAC;AAAA,EAEpE;AAEA,SAAAnC,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASD,GAAGe,GAAIC,GAAI,EAAI;AACjC;AAmBAjB,EAAE,oBAAoBA,EAAE,OAAO,WAAY;AACzC,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAETsB,EAAO3B,EAAE,KAAI,GAAIA,EAAE,KAAI,GAAIK,EAAK,YAAYU,GAAIV,EAAK,WAAWW,CAAE,KAR/C,IAAIX,EAAKL,EAAE,CAAC;AASxC;AAsBAD,EAAE,gBAAgBA,EAAE,OAAO,WAAY;AACrC,MAAI0C,GACFzC,IAAI,MACJK,IAAOL,EAAE,aACTI,IAAIJ,EAAE,MAAM,IAAI,CAAC,GACjBe,IAAKV,EAAK,WACVW,IAAKX,EAAK;AAEZ,SAAID,MAAM,KACDA,MAAM,IAETJ,EAAE,UAAU0C,EAAMrC,GAAMU,GAAIC,CAAE,IAAI,IAAIX,EAAK,CAAC,IAE5C,IAAIA,EAAK,GAAG,IAGdL,EAAE,WAAiB0C,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,KAIxDX,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,QACNyC,IAASC,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GAE1CX,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETyB,EAAO,MAAMzC,CAAC;AACvB;AAsBAD,EAAE,0BAA0BA,EAAE,QAAQ,WAAY;AAChD,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIA,EAAE,IAAI,CAAC,IAAU,IAAIK,EAAKL,EAAE,GAAG,CAAC,IAAI,IAAI,GAAG,IAC1CA,EAAE,SAAQ,KAEfe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAI,KAAK,IAAIf,EAAE,CAAC,GAAGA,EAAE,GAAE,CAAE,IAAI,GACxDK,EAAK,WAAW,GAChBvB,IAAW,IAEXkB,IAAIA,EAAE,MAAMA,CAAC,EAAE,MAAM,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,GAErClB,IAAW,IACXuB,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,QAdiB,IAAIK,EAAKL,CAAC;AAetC;AAmBAD,EAAE,wBAAwBA,EAAE,QAAQ,WAAY;AAC9C,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAI,CAACA,EAAE,SAAQ,KAAMA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAElDe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,IAAI,KAAK,IAAI,KAAK,IAAIf,EAAE,CAAC,GAAGA,EAAE,GAAE,CAAE,IAAI,GAC5DK,EAAK,WAAW,GAChBvB,IAAW,IAEXkB,IAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAKA,CAAC,GAEpClB,IAAW,IACXuB,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE;AACX;AAsBAD,EAAE,2BAA2BA,EAAE,QAAQ,WAAY;AACjD,MAAIgB,GAAIC,GAAI2B,GAAKC,GACf5C,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,KAAK,IAAU,IAAIK,EAAKL,EAAE,IAAG,EAAG,GAAG,CAAC,IAAIA,EAAE,IAAI,IAAIA,EAAE,WAAWA,IAAI,GAAG,KAE5Ee,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVuC,IAAM5C,EAAE,MAEJ,KAAK,IAAI4C,GAAK7B,CAAE,IAAI,IAAI,CAACf,EAAE,IAAI,IAAUC,EAAS,IAAII,EAAKL,CAAC,GAAGe,GAAIC,GAAI,EAAI,KAE/EX,EAAK,YAAYsC,IAAMC,IAAM5C,EAAE,GAE/BA,IAAI2B,EAAO3B,EAAE,KAAK,CAAC,GAAG,IAAIK,EAAK,CAAC,EAAE,MAAML,CAAC,GAAG2C,IAAM5B,GAAI,CAAC,GAEvDV,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,MAENK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,MAAM,GAAG,MArBQ,IAAIK,EAAK,GAAG;AAsBxC;AAwBAN,EAAE,cAAcA,EAAE,OAAO,WAAY;AACnC,MAAI0C,GAAQrC,GACVW,GAAIC,GACJhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCI,IAAIJ,EAAE,IAAG,EAAG,IAAI,CAAC,GACjBe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAEND,MAAM,KAGJA,MAAM,KACRqC,IAASC,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GAC1CyB,EAAO,IAAIzC,EAAE,GACNyC,KAIF,IAAIpC,EAAK,GAAG,KAKrBA,EAAK,YAAYU,IAAK,GACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,IAAI,IAAIK,EAAK,CAAC,EAAE,MAAML,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC,EAAE,QAExDK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAEThB,EAAE,MAAM,CAAC;AAClB;AAqBAD,EAAE,iBAAiBA,EAAE,OAAO,WAAY;AACtC,MAAIQ,GAAGC,GAAGJ,GAAG0B,GAAGe,GAAItB,GAAGH,GAAGuB,GAAKG,GAC7B9C,IAAI,MACJK,IAAOL,EAAE,aACTe,IAAKV,EAAK,WACVW,IAAKX,EAAK;AAEZ,MAAKL,EAAE,YAOA;AAAA,QAAIA,EAAE;AACX,aAAO,IAAIK,EAAKL,CAAC;AACZ,QAAIA,EAAE,MAAM,GAAG,CAAC,KAAKe,IAAK,KAAKjB;AACpC,aAAAsB,IAAIsB,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,IAAI,GACtCI,EAAE,IAAIpB,EAAE,GACDoB;AAAA,SAZU;AACjB,QAAI,CAACpB,EAAE,EAAG,QAAO,IAAIK,EAAK,GAAG;AAC7B,QAAIU,IAAK,KAAKjB;AACZ,aAAAsB,IAAIsB,EAAMrC,GAAMU,IAAK,GAAGC,CAAE,EAAE,MAAM,GAAG,GACrCI,EAAE,IAAIpB,EAAE,GACDoB;AAAA,EAEX;AAmBA,OAXAf,EAAK,YAAYsC,IAAM5B,IAAK,IAC5BV,EAAK,WAAW,GAQhBD,IAAI,KAAK,IAAI,IAAIuC,IAAMhD,IAAW,IAAI,CAAC,GAElCY,IAAIH,GAAGG,GAAG,EAAEA,EAAG,CAAAP,IAAIA,EAAE,IAAIA,EAAE,MAAMA,CAAC,EAAE,KAAK,CAAC,EAAE,KAAI,EAAG,KAAK,CAAC,CAAC;AAW/D,OATAlB,IAAW,IAEX0B,IAAI,KAAK,KAAKmC,IAAMhD,CAAQ,GAC5BmC,IAAI,GACJgB,IAAK9C,EAAE,MAAMA,CAAC,GACdoB,IAAI,IAAIf,EAAKL,CAAC,GACd6C,IAAK7C,GAGEO,MAAM;AAOX,QANAsC,IAAKA,EAAG,MAAMC,CAAE,GAChBvB,IAAIH,EAAE,MAAMyB,EAAG,IAAIf,KAAK,CAAC,CAAC,GAE1Be,IAAKA,EAAG,MAAMC,CAAE,GAChB1B,IAAIG,EAAE,KAAKsB,EAAG,IAAIf,KAAK,CAAC,CAAC,GAErBV,EAAE,EAAEZ,CAAC,MAAM,OAAQ,MAAKD,IAAIC,GAAGY,EAAE,EAAEb,CAAC,MAAMgB,EAAE,EAAEhB,CAAC,KAAKA,MAAK;AAG/D,SAAIH,MAAGgB,IAAIA,EAAE,MAAM,KAAMhB,IAAI,CAAE,IAE/BtB,IAAW,IAEJmB,EAASmB,GAAGf,EAAK,YAAYU,GAAIV,EAAK,WAAWW,GAAI,EAAI;AAClE;AAOAjB,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC,CAAC,KAAK;AAChB;AAOAA,EAAE,YAAYA,EAAE,QAAQ,WAAY;AAClC,SAAO,CAAC,CAAC,KAAK,KAAKX,EAAU,KAAK,IAAIO,CAAQ,IAAI,KAAK,EAAE,SAAS;AACpE;AAOAI,EAAE,QAAQ,WAAY;AACpB,SAAO,CAAC,KAAK;AACf;AAOAA,EAAE,aAAaA,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOAA,EAAE,aAAaA,EAAE,QAAQ,WAAY;AACnC,SAAO,KAAK,IAAI;AAClB;AAOAA,EAAE,SAAS,WAAY;AACrB,SAAO,CAAC,CAAC,KAAK,KAAK,KAAK,EAAE,CAAC,MAAM;AACnC;AAOAA,EAAE,WAAWA,EAAE,KAAK,SAAUO,GAAG;AAC/B,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAOAP,EAAE,oBAAoBA,EAAE,MAAM,SAAUO,GAAG;AACzC,SAAO,KAAK,IAAIA,CAAC,IAAI;AACvB;AAiCAP,EAAE,YAAYA,EAAE,MAAM,SAAUgD,GAAM;AACpC,MAAIC,GAAUnB,GAAGoB,GAAa7C,GAAG8C,GAAKC,GAAK7B,GAAIF,GAC7CgC,IAAM,MACN/C,IAAO+C,EAAI,aACXrC,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVgD,IAAQ;AAGV,MAAIN,KAAQ;AACV,IAAAA,IAAO,IAAI1C,EAAK,EAAE,GAClB2C,IAAW;AAAA,OACN;AAKL,QAJAD,IAAO,IAAI1C,EAAK0C,CAAI,GACpBlB,IAAIkB,EAAK,GAGLA,EAAK,IAAI,KAAK,CAAClB,KAAK,CAACA,EAAE,CAAC,KAAKkB,EAAK,GAAG,CAAC,EAAG,QAAO,IAAI1C,EAAK,GAAG;AAEhE,IAAA2C,IAAWD,EAAK,GAAG,EAAE;AAAA,EACvB;AAKA,MAHAlB,IAAIuB,EAAI,GAGJA,EAAI,IAAI,KAAK,CAACvB,KAAK,CAACA,EAAE,CAAC,KAAKuB,EAAI,GAAG,CAAC;AACtC,WAAO,IAAI/C,EAAKwB,KAAK,CAACA,EAAE,CAAC,IAAI,SAASuB,EAAI,KAAK,IAAI,MAAMvB,IAAI,IAAI,KAAK;AAKxE,MAAImB;AACF,QAAInB,EAAE,SAAS;AACb,MAAAqB,IAAM;AAAA,SACD;AACL,WAAK9C,IAAIyB,EAAE,CAAC,GAAGzB,IAAI,OAAO,IAAI,CAAAA,KAAK;AACnC,MAAA8C,IAAM9C,MAAM;AAAA,IACd;AAyBF,MAtBAtB,IAAW,IACXwC,IAAKP,IAAKsC,GACVF,IAAMG,GAAiBF,GAAK9B,CAAE,GAC9B2B,IAAcD,IAAWO,GAAQlD,GAAMiB,IAAK,EAAE,IAAIgC,GAAiBP,GAAMzB,CAAE,GAG3EF,IAAIO,EAAOwB,GAAKF,GAAa3B,GAAI,CAAC,GAgB9BkC,GAAoBpC,EAAE,GAAGhB,IAAIW,GAAIC,CAAE;AAErC;AAME,UALAM,KAAM,IACN6B,IAAMG,GAAiBF,GAAK9B,CAAE,GAC9B2B,IAAcD,IAAWO,GAAQlD,GAAMiB,IAAK,EAAE,IAAIgC,GAAiBP,GAAMzB,CAAE,GAC3EF,IAAIO,EAAOwB,GAAKF,GAAa3B,GAAI,CAAC,GAE9B,CAAC4B,GAAK;AAGR,QAAI,CAACxB,EAAeN,EAAE,CAAC,EAAE,MAAMhB,IAAI,GAAGA,IAAI,EAAE,IAAI,KAAK,SACnDgB,IAAInB,EAASmB,GAAGL,IAAK,GAAG,CAAC;AAG3B;AAAA,MACF;AAAA,WACOyC,GAAoBpC,EAAE,GAAGhB,KAAK,IAAIY,CAAE;AAG/C,SAAAlC,IAAW,IAEJmB,EAASmB,GAAGL,GAAIC,CAAE;AAC3B;AAgDAjB,EAAE,QAAQA,EAAE,MAAM,SAAUO,GAAG;AAC7B,MAAIuB,GAAG4B,GAAG,GAAGjD,GAAGJ,GAAG2B,GAAKhB,GAAIC,GAAIL,GAAI+C,GAAIC,GAAM/C,GAC5CZ,IAAI,MACJK,IAAOL,EAAE;AAKX,MAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE;AAGb,WAAI,CAACN,EAAE,KAAK,CAACM,EAAE,IAAGA,IAAI,IAAID,EAAK,GAAG,IAGzBL,EAAE,IAAGM,EAAE,IAAI,CAACA,EAAE,IAKlBA,IAAI,IAAID,EAAKC,EAAE,KAAKN,EAAE,MAAMM,EAAE,IAAIN,IAAI,GAAG,GAEvCM;AAIT,MAAIN,EAAE,KAAKM,EAAE;AACX,WAAAA,EAAE,IAAI,CAACA,EAAE,GACFN,EAAE,KAAKM,CAAC;AASjB,MANAK,IAAKX,EAAE,GACPY,IAAKN,EAAE,GACPS,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAGN,CAACM,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC,GAAG;AAGpB,QAAIA,EAAG,CAAC,EAAG,CAAAN,EAAE,IAAI,CAACA,EAAE;AAAA,aAGXK,EAAG,CAAC,EAAG,CAAAL,IAAI,IAAID,EAAKL,CAAC;AAAA,QAIzB,QAAO,IAAIK,EAAKW,MAAO,IAAI,KAAK,CAAC;AAEtC,WAAOlC,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAAA,EAC1C;AAYA,MAPAmD,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAC5B+D,IAAKtE,EAAUY,EAAE,IAAIL,CAAQ,GAE7BgB,IAAKA,EAAG,SACRP,IAAIsD,IAAKD,GAGLrD,GAAG;AAyBL,SAxBAuD,IAAOvD,IAAI,GAEPuD,KACF9B,IAAIlB,GACJP,IAAI,CAACA,GACL2B,IAAMnB,EAAG,WAETiB,IAAIjB,GACJ6C,IAAIC,GACJ3B,IAAMpB,EAAG,SAMX,IAAI,KAAK,IAAI,KAAK,KAAKI,IAAKpB,CAAQ,GAAGoC,CAAG,IAAI,GAE1C3B,IAAI,MACNA,IAAI,GACJyB,EAAE,SAAS,IAIbA,EAAE,QAAO,GACJ,IAAIzB,GAAG,MAAM,CAAAyB,EAAE,KAAK,CAAC;AAC1B,IAAAA,EAAE,QAAO;AAAA,EAGX,OAAO;AASL,SALA,IAAIlB,EAAG,QACPoB,IAAMnB,EAAG,QACT+C,IAAO,IAAI5B,GACP4B,MAAM5B,IAAM,IAEX,IAAI,GAAG,IAAIA,GAAK;AACnB,UAAIpB,EAAG,CAAC,KAAKC,EAAG,CAAC,GAAG;AAClB,QAAA+C,IAAOhD,EAAG,CAAC,IAAIC,EAAG,CAAC;AACnB;AAAA,MACF;AAGF,IAAAR,IAAI;AAAA,EACN;AAaA,OAXIuD,MACF9B,IAAIlB,GACJA,IAAKC,GACLA,IAAKiB,GACLvB,EAAE,IAAI,CAACA,EAAE,IAGXyB,IAAMpB,EAAG,QAIJ,IAAIC,EAAG,SAASmB,GAAK,IAAI,GAAG,EAAE,EAAG,CAAApB,EAAGoB,GAAK,IAAI;AAGlD,OAAK,IAAInB,EAAG,QAAQ,IAAIR,KAAI;AAE1B,QAAIO,EAAG,EAAE,CAAC,IAAIC,EAAG,CAAC,GAAG;AACnB,WAAKJ,IAAI,GAAGA,KAAKG,EAAG,EAAEH,CAAC,MAAM,IAAI,CAAAG,EAAGH,CAAC,IAAId,IAAO;AAChD,QAAEiB,EAAGH,CAAC,GACNG,EAAG,CAAC,KAAKjB;AAAA,IACX;AAEA,IAAAiB,EAAG,CAAC,KAAKC,EAAG,CAAC;AAAA,EACf;AAGA,SAAOD,EAAG,EAAEoB,CAAG,MAAM,IAAI,CAAApB,EAAG;AAG5B,SAAOA,EAAG,CAAC,MAAM,GAAGA,EAAG,MAAK,EAAI,GAAE8C;AAGlC,SAAK9C,EAAG,CAAC,KAETL,EAAE,IAAIK,GACNL,EAAE,IAAIsD,GAAkBjD,GAAI8C,CAAC,GAEtB3E,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV,KALrB,IAAID,EAAKW,MAAO,IAAI,KAAK,CAAC;AAM/C;AA2BAjB,EAAE,SAASA,EAAE,MAAM,SAAUO,GAAG;AAC9B,MAAIuD,GACF7D,IAAI,MACJK,IAAOL,EAAE;AAKX,SAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE,KAAKA,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,IAAU,IAAID,EAAK,GAAG,IAGnD,CAACC,EAAE,KAAKN,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,IAChBC,EAAS,IAAII,EAAKL,CAAC,GAAGK,EAAK,WAAWA,EAAK,QAAQ,KAI5DvB,IAAW,IAEPuB,EAAK,UAAU,KAIjBwD,IAAIlC,EAAO3B,GAAGM,EAAE,IAAG,GAAI,GAAG,GAAG,CAAC,GAC9BuD,EAAE,KAAKvD,EAAE,KAETuD,IAAIlC,EAAO3B,GAAGM,GAAG,GAAGD,EAAK,QAAQ,CAAC,GAGpCwD,IAAIA,EAAE,MAAMvD,CAAC,GAEbxB,IAAW,IAEJkB,EAAE,MAAM6D,CAAC;AAClB;AASA9D,EAAE,qBAAqBA,EAAE,MAAM,WAAY;AACzC,SAAO+D,GAAmB,IAAI;AAChC;AAQA/D,EAAE,mBAAmBA,EAAE,KAAK,WAAY;AACtC,SAAOuD,GAAiB,IAAI;AAC9B;AAQAvD,EAAE,UAAUA,EAAE,MAAM,WAAY;AAC9B,MAAIC,IAAI,IAAI,KAAK,YAAY,IAAI;AACjC,SAAAA,EAAE,IAAI,CAACA,EAAE,GACFC,EAASD,CAAC;AACnB;AAwBAD,EAAE,OAAOA,EAAE,MAAM,SAAUO,GAAG;AAC5B,MAAIyD,GAAOlC,GAAG4B,GAAGlD,GAAGH,GAAG2B,GAAKhB,GAAIC,GAAIL,GAAIC,GACtCZ,IAAI,MACJK,IAAOL,EAAE;AAKX,MAHAM,IAAI,IAAID,EAAKC,CAAC,GAGV,CAACN,EAAE,KAAK,CAACM,EAAE;AAGb,WAAI,CAACN,EAAE,KAAK,CAACM,EAAE,IAAGA,IAAI,IAAID,EAAK,GAAG,IAMxBL,EAAE,MAAGM,IAAI,IAAID,EAAKC,EAAE,KAAKN,EAAE,MAAMM,EAAE,IAAIN,IAAI,GAAG,IAEjDM;AAIT,MAAIN,EAAE,KAAKM,EAAE;AACX,WAAAA,EAAE,IAAI,CAACA,EAAE,GACFN,EAAE,MAAMM,CAAC;AASlB,MANAK,IAAKX,EAAE,GACPY,IAAKN,EAAE,GACPS,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAGN,CAACM,EAAG,CAAC,KAAK,CAACC,EAAG,CAAC;AAIjB,WAAKA,EAAG,CAAC,MAAGN,IAAI,IAAID,EAAKL,CAAC,IAEnBlB,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAa1C,MAPAF,IAAIhB,EAAUY,EAAE,IAAIL,CAAQ,GAC5B8D,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAE5BgB,IAAKA,EAAG,SACRJ,IAAIH,IAAIqD,GAGJlD,GAAG;AAuBL,SArBIA,IAAI,KACNsB,IAAIlB,GACJJ,IAAI,CAACA,GACLwB,IAAMnB,EAAG,WAETiB,IAAIjB,GACJ6C,IAAIrD,GACJ2B,IAAMpB,EAAG,SAIXP,IAAI,KAAK,KAAKW,IAAKpB,CAAQ,GAC3BoC,IAAM3B,IAAI2B,IAAM3B,IAAI,IAAI2B,IAAM,GAE1BxB,IAAIwB,MACNxB,IAAIwB,GACJF,EAAE,SAAS,IAIbA,EAAE,QAAO,GACFtB,MAAM,CAAAsB,EAAE,KAAK,CAAC;AACrB,IAAAA,EAAE,QAAO;AAAA,EACX;AAcA,OAZAE,IAAMpB,EAAG,QACTJ,IAAIK,EAAG,QAGHmB,IAAMxB,IAAI,MACZA,IAAIwB,GACJF,IAAIjB,GACJA,IAAKD,GACLA,IAAKkB,IAIFkC,IAAQ,GAAGxD;AACd,IAAAwD,KAASpD,EAAG,EAAEJ,CAAC,IAAII,EAAGJ,CAAC,IAAIK,EAAGL,CAAC,IAAIwD,KAASrE,IAAO,GACnDiB,EAAGJ,CAAC,KAAKb;AAUX,OAPIqE,MACFpD,EAAG,QAAQoD,CAAK,GAChB,EAAEN,IAKC1B,IAAMpB,EAAG,QAAQA,EAAG,EAAEoB,CAAG,KAAK,IAAI,CAAApB,EAAG;AAE1C,SAAAL,EAAE,IAAIK,GACNL,EAAE,IAAIsD,GAAkBjD,GAAI8C,CAAC,GAEtB3E,IAAWmB,EAASK,GAAGS,GAAIC,CAAE,IAAIV;AAC1C;AASAP,EAAE,YAAYA,EAAE,KAAK,SAAUiE,GAAG;AAChC,MAAI5D,GACFJ,IAAI;AAEN,MAAIgE,MAAM,UAAUA,MAAM,CAAC,CAACA,KAAKA,MAAM,KAAKA,MAAM,EAAG,OAAM,MAAMhF,KAAkBgF,CAAC;AAEpF,SAAIhE,EAAE,KACJI,IAAI6D,GAAajE,EAAE,CAAC,GAChBgE,KAAKhE,EAAE,IAAI,IAAII,MAAGA,IAAIJ,EAAE,IAAI,MAEhCI,IAAI,KAGCA;AACT;AAQAL,EAAE,QAAQ,WAAY;AACpB,MAAIC,IAAI,MACNK,IAAOL,EAAE;AAEX,SAAOC,EAAS,IAAII,EAAKL,CAAC,GAAGA,EAAE,IAAI,GAAGK,EAAK,QAAQ;AACrD;AAkBAN,EAAE,OAAOA,EAAE,MAAM,WAAY;AAC3B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,KAAK,IAAIf,EAAE,GAAGA,EAAE,GAAE,CAAE,IAAIL,GAC9CU,EAAK,WAAW,GAEhBL,IAAIkE,GAAK7D,GAAMa,GAAiBb,GAAML,CAAC,CAAC,GAExCK,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,IAAW,IAAImB,EAAE,QAAQA,GAAGe,GAAIC,GAAI,EAAI,KAb9B,IAAIX,EAAK,GAAG;AAcxC;AAeAN,EAAE,aAAaA,EAAE,OAAO,WAAY;AAClC,MAAIoB,GAAGW,GAAGR,GAAIF,GAAGC,GAAKE,GACpBvB,IAAI,MACJ6B,IAAI7B,EAAE,GACNyD,IAAIzD,EAAE,GACNmE,IAAInE,EAAE,GACNK,IAAOL,EAAE;AAGX,MAAImE,MAAM,KAAK,CAACtC,KAAK,CAACA,EAAE,CAAC;AACvB,WAAO,IAAIxB,EAAK,CAAC8D,KAAKA,IAAI,MAAM,CAACtC,KAAKA,EAAE,CAAC,KAAK,MAAMA,IAAI7B,IAAI,KAAK;AAgCnE,OA7BAlB,IAAW,IAGXqF,IAAI,KAAK,KAAK,CAACnE,CAAC,GAIZmE,KAAK,KAAKA,KAAK,SACjBrC,IAAIJ,EAAeG,CAAC,IAEfC,EAAE,SAAS2B,KAAK,KAAK,MAAG3B,KAAK,MAClCqC,IAAI,KAAK,KAAKrC,CAAC,GACf2B,IAAIrE,GAAWqE,IAAI,KAAK,CAAC,KAAKA,IAAI,KAAKA,IAAI,IAEvCU,KAAK,QACPrC,IAAI,OAAO2B,KAEX3B,IAAIqC,EAAE,iBACNrC,IAAIA,EAAE,MAAM,GAAGA,EAAE,QAAQ,GAAG,IAAI,CAAC,IAAI2B,IAGvCrC,IAAI,IAAIf,EAAKyB,CAAC,KAEdV,IAAI,IAAIf,EAAK8D,EAAE,SAAQ,CAAE,GAG3B7C,KAAMmC,IAAIpD,EAAK,aAAa;AAQ1B,QAJAkB,IAAIH,GACJA,IAAIG,EAAE,KAAKI,EAAO3B,GAAGuB,GAAGD,IAAK,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,GAGzCI,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGD,CAAE,OAAOQ,IAAIJ,EAAeN,EAAE,CAAC,GAAG,MAAM,GAAGE,CAAE;AAK5E,UAJAQ,IAAIA,EAAE,MAAMR,IAAK,GAAGA,IAAK,CAAC,GAItBQ,KAAK,UAAU,CAACT,KAAOS,KAAK,QAAQ;AAItC,YAAI,CAACT,MACHpB,EAASsB,GAAGkC,IAAI,GAAG,CAAC,GAEhBlC,EAAE,MAAMA,CAAC,EAAE,GAAGvB,CAAC,IAAG;AACpB,UAAAoB,IAAIG;AACJ;AAAA,QACF;AAGF,QAAAD,KAAM,GACND,IAAM;AAAA,MACR,OAAO;AAIL,SAAI,CAAC,CAACS,KAAK,CAAC,CAACA,EAAE,MAAM,CAAC,KAAKA,EAAE,OAAO,CAAC,KAAK,SAGxC7B,EAASmB,GAAGqC,IAAI,GAAG,CAAC,GACpBtC,IAAI,CAACC,EAAE,MAAMA,CAAC,EAAE,GAAGpB,CAAC;AAGtB;AAAA,MACF;AAIJ,SAAAlB,IAAW,IAEJmB,EAASmB,GAAGqC,GAAGpD,EAAK,UAAUc,CAAC;AACxC;AAgBApB,EAAE,UAAUA,EAAE,MAAM,WAAY;AAC9B,MAAIgB,GAAIC,GACNhB,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAKA,EAAE,SAAQ,IACXA,EAAE,OAAM,IAAW,IAAIK,EAAKL,CAAC,KAEjCe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UACVA,EAAK,YAAYU,IAAK,IACtBV,EAAK,WAAW,GAEhBL,IAAIA,EAAE,OACNA,EAAE,IAAI,GACNA,IAAI2B,EAAO3B,GAAG,IAAIK,EAAK,CAAC,EAAE,MAAML,EAAE,MAAMA,CAAC,CAAC,EAAE,KAAI,GAAIe,IAAK,IAAI,CAAC,GAE9DV,EAAK,YAAYU,GACjBV,EAAK,WAAWW,GAETf,EAASpB,KAAY,KAAKA,KAAY,IAAImB,EAAE,IAAG,IAAKA,GAAGe,GAAIC,GAAI,EAAI,KAfhD,IAAIX,EAAK,GAAG;AAgBxC;AAwBAN,EAAE,QAAQA,EAAE,MAAM,SAAUO,GAAG;AAC7B,MAAIyD,GAAON,GAAG,GAAGrD,GAAGgB,GAAGgD,GAAI7C,GAAGd,GAAKC,GACjCV,IAAI,MACJK,IAAOL,EAAE,aACTW,IAAKX,EAAE,GACPY,KAAMN,IAAI,IAAID,EAAKC,CAAC,GAAG;AAKzB,MAHAA,EAAE,KAAKN,EAAE,GAGL,CAACW,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAM,CAACA,EAAG,CAAC;AAE/B,WAAO,IAAIP,EAAK,CAACC,EAAE,KAAKK,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAMA,KAAM,CAACA,EAAG,CAAC,KAAK,CAACD,IAI5D,MAIA,CAACA,KAAM,CAACC,IAAKN,EAAE,IAAI,IAAIA,EAAE,IAAI,CAAC;AAoBpC,OAjBAmD,IAAIrE,EAAUY,EAAE,IAAIL,CAAQ,IAAIP,EAAUkB,EAAE,IAAIX,CAAQ,GACxDc,IAAME,EAAG,QACTD,IAAME,EAAG,QAGLH,IAAMC,MACRU,IAAIT,GACJA,IAAKC,GACLA,IAAKQ,GACLgD,IAAK3D,GACLA,IAAMC,GACNA,IAAM0D,IAIRhD,IAAI,CAAA,GACJgD,IAAK3D,IAAMC,GACN,IAAI0D,GAAI,MAAM,CAAAhD,EAAE,KAAK,CAAC;AAG3B,OAAK,IAAIV,GAAK,EAAE,KAAK,KAAI;AAEvB,SADAqD,IAAQ,GACH3D,IAAIK,IAAM,GAAGL,IAAI;AACpB,MAAAmB,IAAIH,EAAEhB,CAAC,IAAIQ,EAAG,CAAC,IAAID,EAAGP,IAAI,IAAI,CAAC,IAAI2D,GACnC3C,EAAEhB,GAAG,IAAImB,IAAI7B,IAAO,GACpBqE,IAAQxC,IAAI7B,IAAO;AAGrB,IAAA0B,EAAEhB,CAAC,KAAKgB,EAAEhB,CAAC,IAAI2D,KAASrE,IAAO;AAAA,EACjC;AAGA,SAAO,CAAC0B,EAAE,EAAEgD,CAAE,IAAI,CAAAhD,EAAE,IAAG;AAEvB,SAAI2C,IAAO,EAAEN,IACRrC,EAAE,MAAK,GAEZd,EAAE,IAAIc,GACNd,EAAE,IAAIsD,GAAkBxC,GAAGqC,CAAC,GAErB3E,IAAWmB,EAASK,GAAGD,EAAK,WAAWA,EAAK,QAAQ,IAAIC;AACjE;AAaAP,EAAE,WAAW,SAAUuB,GAAIN,GAAI;AAC7B,SAAOqD,GAAe,MAAM,GAAG/C,GAAIN,CAAE;AACvC;AAaAjB,EAAE,kBAAkBA,EAAE,OAAO,SAAUuE,GAAItD,GAAI;AAC7C,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAGX,SADAA,IAAI,IAAIK,EAAKL,CAAC,GACVsE,MAAO,SAAetE,KAE1BuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAEjBf,EAASD,GAAGsE,IAAKtE,EAAE,IAAI,GAAGgB,CAAE;AACrC;AAWAjB,EAAE,gBAAgB,SAAUuE,GAAItD,GAAI;AAClC,MAAIwD,GACFxE,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsE,MAAO,SACTE,IAAMC,EAAezE,GAAG,EAAI,KAE5BuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBhB,IAAIC,EAAS,IAAII,EAAKL,CAAC,GAAGsE,IAAK,GAAGtD,CAAE,GACpCwD,IAAMC,EAAezE,GAAG,IAAMsE,IAAK,CAAC,IAG/BtE,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAmBAzE,EAAE,UAAU,SAAUuE,GAAItD,GAAI;AAC5B,MAAIwD,GAAKlE,GACPN,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsE,MAAO,SACTE,IAAMC,EAAezE,CAAC,KAEtBuE,EAAWD,GAAI,GAAG/F,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBV,IAAIL,EAAS,IAAII,EAAKL,CAAC,GAAGsE,IAAKtE,EAAE,IAAI,GAAGgB,CAAE,GAC1CwD,IAAMC,EAAenE,GAAG,IAAOgE,IAAKhE,EAAE,IAAI,CAAC,IAKtCN,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAcAzE,EAAE,aAAa,SAAU2E,GAAM;AAC7B,MAAI7C,GAAG8C,GAAIC,GAAIC,GAAIpB,GAAGrD,GAAG0B,GAAGgD,GAAIC,GAAIhE,GAAI8C,GAAGzC,GACzCpB,IAAI,MACJW,IAAKX,EAAE,GACPK,IAAOL,EAAE;AAEX,MAAI,CAACW,EAAI,QAAO,IAAIN,EAAKL,CAAC;AAU1B,MARA+E,IAAKJ,IAAK,IAAItE,EAAK,CAAC,GACpBuE,IAAKE,IAAK,IAAIzE,EAAK,CAAC,GAEpBwB,IAAI,IAAIxB,EAAKuE,CAAE,GACfnB,IAAI5B,EAAE,IAAIoC,GAAatD,CAAE,IAAIX,EAAE,IAAI,GACnCI,IAAIqD,IAAI9D,GACRkC,EAAE,EAAE,CAAC,IAAIxC,EAAQ,IAAIe,IAAI,IAAIT,IAAWS,IAAIA,CAAC,GAEzCsE,KAAQ;AAGV,IAAAA,IAAOjB,IAAI,IAAI5B,IAAIkD;AAAA,OACd;AAEL,QADAjD,IAAI,IAAIzB,EAAKqE,CAAI,GACb,CAAC5C,EAAE,MAAK,KAAMA,EAAE,GAAGiD,CAAE,EAAG,OAAM,MAAM/F,KAAkB8C,CAAC;AAC3D,IAAA4C,IAAO5C,EAAE,GAAGD,CAAC,IAAK4B,IAAI,IAAI5B,IAAIkD,IAAMjD;AAAA,EACtC;AAOA,OALAhD,IAAW,IACXgD,IAAI,IAAIzB,EAAKqB,EAAef,CAAE,CAAC,GAC/BI,IAAKV,EAAK,WACVA,EAAK,YAAYoD,IAAI9C,EAAG,SAAShB,IAAW,GAG1CkE,IAAIlC,EAAOG,GAAGD,GAAG,GAAG,GAAG,CAAC,GACxBgD,IAAKF,EAAG,KAAKd,EAAE,MAAMe,CAAE,CAAC,GACpBC,EAAG,IAAIH,CAAI,KAAK;AACpB,IAAAC,IAAKC,GACLA,IAAKC,GACLA,IAAKE,GACLA,IAAKD,EAAG,KAAKjB,EAAE,MAAMgB,CAAE,CAAC,GACxBC,IAAKD,GACLA,IAAKhD,GACLA,IAAIC,EAAE,MAAM+B,EAAE,MAAMgB,CAAE,CAAC,GACvB/C,IAAI+C;AAGN,SAAAA,IAAKlD,EAAO+C,EAAK,MAAMC,CAAE,GAAGC,GAAI,GAAG,GAAG,CAAC,GACvCE,IAAKA,EAAG,KAAKD,EAAG,MAAME,CAAE,CAAC,GACzBJ,IAAKA,EAAG,KAAKE,EAAG,MAAMD,CAAE,CAAC,GACzBE,EAAG,IAAIC,EAAG,IAAI/E,EAAE,GAGhBoB,IAAIO,EAAOoD,GAAIH,GAAInB,GAAG,CAAC,EAAE,MAAMzD,CAAC,EAAE,IAAG,EAAG,IAAI2B,EAAOmD,GAAIH,GAAIlB,GAAG,CAAC,EAAE,MAAMzD,CAAC,EAAE,IAAG,CAAE,IAAI,IAC7E,CAAC+E,GAAIH,CAAE,IAAI,CAACE,GAAIH,CAAE,GAExBtE,EAAK,YAAYU,GACjBjC,IAAW,IAEJsC;AACT;AAaArB,EAAE,gBAAgBA,EAAE,QAAQ,SAAUuB,GAAIN,GAAI;AAC5C,SAAOqD,GAAe,MAAM,IAAI/C,GAAIN,CAAE;AACxC;AAmBAjB,EAAE,YAAY,SAAUO,GAAGU,GAAI;AAC7B,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAIX,MAFAA,IAAI,IAAIK,EAAKL,CAAC,GAEVM,KAAK,MAAM;AAGb,QAAI,CAACN,EAAE,EAAG,QAAOA;AAEjB,IAAAM,IAAI,IAAID,EAAK,CAAC,GACdW,IAAKX,EAAK;AAAA,EACZ,OAAO;AASL,QARAC,IAAI,IAAID,EAAKC,CAAC,GACVU,MAAO,SACTA,IAAKX,EAAK,WAEVkE,EAAWvD,GAAI,GAAG,CAAC,GAIjB,CAAChB,EAAE,EAAG,QAAOM,EAAE,IAAIN,IAAIM;AAG3B,QAAI,CAACA,EAAE;AACL,aAAIA,EAAE,MAAGA,EAAE,IAAIN,EAAE,IACVM;AAAA,EAEX;AAGA,SAAIA,EAAE,EAAE,CAAC,KACPxB,IAAW,IACXkB,IAAI2B,EAAO3B,GAAGM,GAAG,GAAGU,GAAI,CAAC,EAAE,MAAMV,CAAC,GAClCxB,IAAW,IACXmB,EAASD,CAAC,MAIVM,EAAE,IAAIN,EAAE,GACRA,IAAIM,IAGCN;AACT;AAQAD,EAAE,WAAW,WAAY;AACvB,SAAO,CAAC;AACV;AAaAA,EAAE,UAAU,SAAUuB,GAAIN,GAAI;AAC5B,SAAOqD,GAAe,MAAM,GAAG/C,GAAIN,CAAE;AACvC;AA8CAjB,EAAE,UAAUA,EAAE,MAAM,SAAUO,GAAG;AAC/B,MAAImD,GAAGrD,GAAGW,GAAI,GAAGC,GAAImD,GACnBnE,IAAI,MACJK,IAAOL,EAAE,aACTgF,IAAK,EAAE1E,IAAI,IAAID,EAAKC,CAAC;AAGvB,MAAI,CAACN,EAAE,KAAK,CAACM,EAAE,KAAK,CAACN,EAAE,EAAE,CAAC,KAAK,CAACM,EAAE,EAAE,CAAC,EAAG,QAAO,IAAID,EAAKhB,EAAQ,CAACW,GAAGgF,CAAE,CAAC;AAIvE,MAFAhF,IAAI,IAAIK,EAAKL,CAAC,GAEVA,EAAE,GAAG,CAAC,EAAG,QAAOA;AAKpB,MAHAe,IAAKV,EAAK,WACVW,IAAKX,EAAK,UAENC,EAAE,GAAG,CAAC,EAAG,QAAOL,EAASD,GAAGe,GAAIC,CAAE;AAMtC,MAHAyC,IAAIrE,EAAUkB,EAAE,IAAIX,CAAQ,GAGxB8D,KAAKnD,EAAE,EAAE,SAAS,MAAMF,IAAI4E,IAAK,IAAI,CAACA,IAAKA,MAAOpF;AACpD,eAAIqF,GAAO5E,GAAML,GAAGI,GAAGW,CAAE,GAClBT,EAAE,IAAI,IAAI,IAAID,EAAK,CAAC,EAAE,IAAI,CAAC,IAAIJ,EAAS,GAAGc,GAAIC,CAAE;AAM1D,MAHAmD,IAAInE,EAAE,GAGFmE,IAAI,GAAG;AAGT,QAAIV,IAAInD,EAAE,EAAE,SAAS,EAAG,QAAO,IAAID,EAAK,GAAG;AAM3C,SAHKC,EAAE,EAAEmD,CAAC,IAAI,MAAM,MAAGU,IAAI,IAGvBnE,EAAE,KAAK,KAAKA,EAAE,EAAE,CAAC,KAAK,KAAKA,EAAE,EAAE,UAAU;AAC3C,aAAAA,EAAE,IAAImE,GACCnE;AAAA,EAEX;AAcA,SARAI,IAAIf,EAAQ,CAACW,GAAGgF,CAAE,GAClBvB,IAAIrD,KAAK,KAAK,CAAC,SAASA,CAAC,IACrBhB,EAAU4F,KAAM,KAAK,IAAI,OAAOtD,EAAe1B,EAAE,CAAC,CAAC,IAAI,KAAK,OAAOA,EAAE,IAAI,EAAE,IAC3E,IAAIK,EAAKD,IAAI,EAAE,EAAE,GAKjBqD,IAAIpD,EAAK,OAAO,KAAKoD,IAAIpD,EAAK,OAAO,IAAU,IAAIA,EAAKoD,IAAI,IAAIU,IAAI,IAAI,CAAC,KAE7ErF,IAAW,IACXuB,EAAK,WAAWL,EAAE,IAAI,GAMtBI,IAAI,KAAK,IAAI,KAAKqD,IAAI,IAAI,MAAM,GAGhC,IAAIK,GAAmBxD,EAAE,MAAMgD,GAAiBtD,GAAGe,IAAKX,CAAC,CAAC,GAAGW,CAAE,GAG3D,EAAE,MAGJ,IAAId,EAAS,GAAGc,IAAK,GAAG,CAAC,GAIrByC,GAAoB,EAAE,GAAGzC,GAAIC,CAAE,MACjCyC,IAAI1C,IAAK,IAGT,IAAId,EAAS6D,GAAmBxD,EAAE,MAAMgD,GAAiBtD,GAAGyD,IAAIrD,CAAC,CAAC,GAAGqD,CAAC,GAAGA,IAAI,GAAG,CAAC,GAG7E,CAAC/B,EAAe,EAAE,CAAC,EAAE,MAAMX,IAAK,GAAGA,IAAK,EAAE,IAAI,KAAK,SACrD,IAAId,EAAS,GAAGc,IAAK,GAAG,CAAC,MAK/B,EAAE,IAAIoD,GACNrF,IAAW,IACXuB,EAAK,WAAWW,GAETf,EAAS,GAAGc,GAAIC,CAAE;AAC3B;AAcAjB,EAAE,cAAc,SAAUuB,GAAIN,GAAI;AAChC,MAAIwD,GACFxE,IAAI,MACJK,IAAOL,EAAE;AAEX,SAAIsB,MAAO,SACTkD,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ,KAEpEkE,EAAWjD,GAAI,GAAG/C,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,GAExBhB,IAAIC,EAAS,IAAII,EAAKL,CAAC,GAAGsB,GAAIN,CAAE,GAChCwD,IAAMC,EAAezE,GAAGsB,KAAMtB,EAAE,KAAKA,EAAE,KAAKK,EAAK,UAAUiB,CAAE,IAGxDtB,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAiBAzE,EAAE,sBAAsBA,EAAE,OAAO,SAAUuB,GAAIN,GAAI;AACjD,MAAIhB,IAAI,MACNK,IAAOL,EAAE;AAEX,SAAIsB,MAAO,UACTA,IAAKjB,EAAK,WACVW,IAAKX,EAAK,aAEVkE,EAAWjD,GAAI,GAAG/C,EAAU,GAExByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,IAGnBf,EAAS,IAAII,EAAKL,CAAC,GAAGsB,GAAIN,CAAE;AACrC;AAUAjB,EAAE,WAAW,WAAY;AACvB,MAAIC,IAAI,MACNK,IAAOL,EAAE,aACTwE,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ;AAEtE,SAAOL,EAAE,MAAK,KAAM,CAACA,EAAE,WAAW,MAAMwE,IAAMA;AAChD;AAOAzE,EAAE,YAAYA,EAAE,QAAQ,WAAY;AAClC,SAAOE,EAAS,IAAI,KAAK,YAAY,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC;AAC3D;AAQAF,EAAE,UAAUA,EAAE,SAAS,WAAY;AACjC,MAAIC,IAAI,MACNK,IAAOL,EAAE,aACTwE,IAAMC,EAAezE,GAAGA,EAAE,KAAKK,EAAK,YAAYL,EAAE,KAAKK,EAAK,QAAQ;AAEtE,SAAOL,EAAE,MAAK,IAAK,MAAMwE,IAAMA;AACjC;AAoDA,SAAS9C,EAAeG,GAAG;AACzB,MAAItB,GAAGH,GAAG8E,GACRC,IAAkBtD,EAAE,SAAS,GAC7B2C,IAAM,IACN5C,IAAIC,EAAE,CAAC;AAET,MAAIsD,IAAkB,GAAG;AAEvB,SADAX,KAAO5C,GACFrB,IAAI,GAAGA,IAAI4E,GAAiB5E;AAC/B,MAAA2E,IAAKrD,EAAEtB,CAAC,IAAI,IACZH,IAAIT,IAAWuF,EAAG,QACd9E,MAAGoE,KAAOY,GAAchF,CAAC,IAC7BoE,KAAOU;AAGT,IAAAtD,IAAIC,EAAEtB,CAAC,GACP2E,IAAKtD,IAAI,IACTxB,IAAIT,IAAWuF,EAAG,QACd9E,MAAGoE,KAAOY,GAAchF,CAAC;AAAA,EAC/B,WAAWwB,MAAM;AACf,WAAO;AAIT,SAAOA,IAAI,OAAO,IAAI,CAAAA,KAAK;AAE3B,SAAO4C,IAAM5C;AACf;AAGA,SAAS2C,EAAWhE,GAAGL,GAAKC,GAAK;AAC/B,MAAII,MAAM,CAAC,CAACA,KAAKA,IAAIL,KAAOK,IAAIJ;AAC9B,UAAM,MAAMnB,KAAkBuB,CAAC;AAEnC;AAQA,SAASiD,GAAoB3B,GAAGtB,GAAGS,GAAIqE,GAAW;AAChD,MAAIC,GAAIlF,GAAGgB,GAAGmE;AAGd,OAAKnF,IAAIyB,EAAE,CAAC,GAAGzB,KAAK,IAAIA,KAAK,GAAI,GAAEG;AAGnC,SAAI,EAAEA,IAAI,KACRA,KAAKZ,GACL2F,IAAK,MAELA,IAAK,KAAK,MAAM/E,IAAI,KAAKZ,CAAQ,GACjCY,KAAKZ,IAMPS,IAAIf,EAAQ,IAAIM,IAAWY,CAAC,GAC5BgF,IAAK1D,EAAEyD,CAAE,IAAIlF,IAAI,GAEbiF,KAAa,OACX9E,IAAI,KACFA,KAAK,IAAGgF,IAAKA,IAAK,MAAM,IACnBhF,KAAK,MAAGgF,IAAKA,IAAK,KAAK,IAChCnE,IAAIJ,IAAK,KAAKuE,KAAM,SAASvE,IAAK,KAAKuE,KAAM,SAASA,KAAM,OAASA,KAAM,KAE3EnE,KAAKJ,IAAK,KAAKuE,IAAK,KAAKnF,KAAKY,IAAK,KAAKuE,IAAK,KAAKnF,IAAI,OACnDyB,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAM,MAAMf,EAAQ,IAAIkB,IAAI,CAAC,IAAI,MAC/CgF,KAAMnF,IAAI,KAAKmF,KAAM,OAAO1D,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAM,MAAM,IAG3DG,IAAI,KACFA,KAAK,IAAGgF,IAAKA,IAAK,MAAO,IACpBhF,KAAK,IAAGgF,IAAKA,IAAK,MAAM,IACxBhF,KAAK,MAAGgF,IAAKA,IAAK,KAAK,IAChCnE,KAAKiE,KAAarE,IAAK,MAAMuE,KAAM,QAAQ,CAACF,KAAarE,IAAK,KAAKuE,KAAM,QAEzEnE,MAAMiE,KAAarE,IAAK,MAAMuE,IAAK,KAAKnF,KACvC,CAACiF,KAAarE,IAAK,KAAMuE,IAAK,KAAKnF,IAAI,OACrCyB,EAAEyD,IAAK,CAAC,IAAIlF,IAAI,MAAO,MAAMf,EAAQ,IAAIkB,IAAI,CAAC,IAAI,GAIlDa;AACT;AAMA,SAASoE,GAAYhB,GAAKiB,GAAQC,GAAS;AAOzC,WANIlF,GACFmF,IAAM,CAAC,CAAC,GACRC,GACArF,IAAI,GACJsF,IAAOrB,EAAI,QAENjE,IAAIsF,KAAO;AAChB,SAAKD,IAAOD,EAAI,QAAQC,MAAS,CAAAD,EAAIC,CAAI,KAAKH;AAE9C,SADAE,EAAI,CAAC,KAAKnH,GAAS,QAAQgG,EAAI,OAAOjE,GAAG,CAAC,GACrCC,IAAI,GAAGA,IAAImF,EAAI,QAAQnF;AAC1B,MAAImF,EAAInF,CAAC,IAAIkF,IAAU,MACjBC,EAAInF,IAAI,CAAC,MAAM,WAAQmF,EAAInF,IAAI,CAAC,IAAI,IACxCmF,EAAInF,IAAI,CAAC,KAAKmF,EAAInF,CAAC,IAAIkF,IAAU,GACjCC,EAAInF,CAAC,KAAKkF;AAAA,EAGhB;AAEA,SAAOC,EAAI;AACb;AAQA,SAAS1E,GAAOZ,GAAML,GAAG;AACvB,MAAII,GAAG2B,GAAKzB;AAEZ,MAAIN,EAAE,SAAU,QAAOA;AAMvB,EAAA+B,IAAM/B,EAAE,EAAE,QACN+B,IAAM,MACR3B,IAAI,KAAK,KAAK2B,IAAM,CAAC,GACrBzB,KAAK,IAAI2B,GAAQ,GAAG7B,CAAC,GAAG,eAExBA,IAAI,IACJE,IAAI,iCAGND,EAAK,aAAaD,GAElBJ,IAAIkC,GAAa7B,GAAM,GAAGL,EAAE,MAAMM,CAAC,GAAG,IAAID,EAAK,CAAC,CAAC;AAGjD,WAASE,IAAIH,GAAGG,OAAM;AACpB,QAAIuF,IAAQ9F,EAAE,MAAMA,CAAC;AACrB,IAAAA,IAAI8F,EAAM,MAAMA,CAAK,EAAE,MAAMA,CAAK,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC;AAAA,EACrD;AAEA,SAAAzF,EAAK,aAAaD,GAEXJ;AACT;AAMA,IAAI2B,IAAU,4BAAY;AAGxB,WAASoE,EAAgB/F,GAAGI,GAAG2C,GAAM;AACnC,QAAIiD,GACFjC,IAAQ,GACRxD,IAAIP,EAAE;AAER,SAAKA,IAAIA,EAAE,MAAK,GAAIO;AAClB,MAAAyF,IAAOhG,EAAEO,CAAC,IAAIH,IAAI2D,GAClB/D,EAAEO,CAAC,IAAIyF,IAAOjD,IAAO,GACrBgB,IAAQiC,IAAOjD,IAAO;AAGxB,WAAIgB,KAAO/D,EAAE,QAAQ+D,CAAK,GAEnB/D;AAAA,EACT;AAEA,WAASiG,EAAQC,GAAGC,GAAGC,GAAIC,GAAI;AAC7B,QAAI9F,GAAGa;AAEP,QAAIgF,KAAMC;AACR,MAAAjF,IAAIgF,IAAKC,IAAK,IAAI;AAAA;AAElB,WAAK9F,IAAIa,IAAI,GAAGb,IAAI6F,GAAI7F;AACtB,YAAI2F,EAAE3F,CAAC,KAAK4F,EAAE5F,CAAC,GAAG;AAChB,UAAAa,IAAI8E,EAAE3F,CAAC,IAAI4F,EAAE5F,CAAC,IAAI,IAAI;AACtB;AAAA,QACF;AAIJ,WAAOa;AAAA,EACT;AAEA,WAASkF,EAASJ,GAAGC,GAAGC,GAAIrD,GAAM;AAIhC,aAHIxC,IAAI,GAGD6F;AACL,MAAAF,EAAEE,CAAE,KAAK7F,GACTA,IAAI2F,EAAEE,CAAE,IAAID,EAAEC,CAAE,IAAI,IAAI,GACxBF,EAAEE,CAAE,IAAI7F,IAAIwC,IAAOmD,EAAEE,CAAE,IAAID,EAAEC,CAAE;AAIjC,WAAO,CAACF,EAAE,CAAC,KAAKA,EAAE,SAAS,IAAI,CAAAA,EAAE;EACnC;AAEA,SAAO,SAAUlG,GAAGM,GAAGS,GAAIC,GAAIsD,GAAIvB,GAAM;AACvC,QAAIwD,GAAK9C,GAAGlD,GAAGH,GAAGoG,GAASC,GAAMC,GAAMC,GAAO9C,GAAG+C,GAAIC,GAAKC,GAAMC,GAAMzF,GAAIC,GAAGyF,IAAIC,GAAIC,IACnFC,GAAIC,GACJ/G,KAAOL,EAAE,aACTqH,KAAOrH,EAAE,KAAKM,EAAE,IAAI,IAAI,IACxBK,IAAKX,EAAE,GACPY,IAAKN,EAAE;AAGT,QAAI,CAACK,KAAM,CAACA,EAAG,CAAC,KAAK,CAACC,KAAM,CAACA,EAAG,CAAC;AAE/B,aAAO,IAAIP;AAAA;AAAA,QACT,CAACL,EAAE,KAAK,CAACM,EAAE,MAAMK,IAAKC,KAAMD,EAAG,CAAC,KAAKC,EAAG,CAAC,IAAI,CAACA,KAAM;AAAA;AAAA,UAGpDD,KAAMA,EAAG,CAAC,KAAK,KAAK,CAACC,IAAKyG,KAAO,IAAIA,KAAO;AAAA;AAAA,MAAC;AAmBjD,SAhBItE,KACFyD,IAAU,GACV/C,IAAIzD,EAAE,IAAIM,EAAE,MAEZyC,IAAOrD,GACP8G,IAAU7G,GACV8D,IAAIrE,EAAUY,EAAE,IAAIwG,CAAO,IAAIpH,EAAUkB,EAAE,IAAIkG,CAAO,IAGxDW,IAAKvG,EAAG,QACRqG,IAAKtG,EAAG,QACRkD,IAAI,IAAIxD,GAAKgH,EAAI,GACjBT,IAAK/C,EAAE,IAAI,IAINtD,IAAI,GAAGK,EAAGL,CAAC,MAAMI,EAAGJ,CAAC,KAAK,IAAIA,IAAI;AAavC,QAXIK,EAAGL,CAAC,KAAKI,EAAGJ,CAAC,KAAK,MAAIkD,KAEtB1C,KAAM,QACRO,IAAKP,IAAKV,GAAK,WACfW,IAAKX,GAAK,YACDiE,IACThD,IAAKP,KAAMf,EAAE,IAAIM,EAAE,KAAK,IAExBgB,IAAKP,GAGHO,IAAK;AACP,MAAAsF,EAAG,KAAK,CAAC,GACTH,IAAO;AAAA,SACF;AAOL,UAJAnF,IAAKA,IAAKkF,IAAU,IAAI,GACxBjG,IAAI,GAGA4G,KAAM,GAAG;AAMX,aALA/G,IAAI,GACJQ,IAAKA,EAAG,CAAC,GACTU,MAGQf,IAAI0G,KAAM7G,MAAMkB,KAAMf;AAC5B,UAAAgB,IAAInB,IAAI2C,KAAQpC,EAAGJ,CAAC,KAAK,IACzBqG,EAAGrG,CAAC,IAAIgB,IAAIX,IAAK,GACjBR,IAAImB,IAAIX,IAAK;AAGf,QAAA6F,IAAOrG,KAAKG,IAAI0G;AAAA,MAGlB,OAAO;AAiBL,aAdA7G,IAAI2C,KAAQnC,EAAG,CAAC,IAAI,KAAK,GAErBR,IAAI,MACNQ,IAAKmF,EAAgBnF,GAAIR,GAAG2C,CAAI,GAChCpC,IAAKoF,EAAgBpF,GAAIP,GAAG2C,CAAI,GAChCoE,IAAKvG,EAAG,QACRqG,IAAKtG,EAAG,SAGVqG,KAAKG,GACLN,IAAMlG,EAAG,MAAM,GAAGwG,CAAE,GACpBL,IAAOD,EAAI,QAGJC,IAAOK,IAAK,CAAAN,EAAIC,GAAM,IAAI;AAEjC,QAAAM,IAAKxG,EAAG,SACRwG,EAAG,QAAQ,CAAC,GACZF,KAAMtG,EAAG,CAAC,GAENA,EAAG,CAAC,KAAKmC,IAAO,KAAG,EAAEmE;AAEzB;AACE,UAAA9G,IAAI,GAGJmG,IAAMN,EAAQrF,GAAIiG,GAAKM,GAAIL,CAAI,GAG3BP,IAAM,KAGRQ,IAAOF,EAAI,CAAC,GACRM,KAAML,MAAMC,IAAOA,IAAOhE,KAAQ8D,EAAI,CAAC,KAAK,KAGhDzG,IAAI2G,IAAOG,KAAM,GAUb9G,IAAI,KACFA,KAAK2C,MAAM3C,IAAI2C,IAAO,IAG1B2D,IAAOX,EAAgBnF,GAAIR,GAAG2C,CAAI,GAClC4D,IAAQD,EAAK,QACbI,IAAOD,EAAI,QAGXN,IAAMN,EAAQS,GAAMG,GAAKF,GAAOG,CAAI,GAGhCP,KAAO,MACTnG,KAGAkG,EAASI,GAAMS,IAAKR,IAAQS,IAAKxG,GAAI+F,GAAO5D,CAAI,OAO9C3C,KAAK,MAAGmG,IAAMnG,IAAI,IACtBsG,IAAO9F,EAAG,UAGZ+F,IAAQD,EAAK,QACTC,IAAQG,KAAMJ,EAAK,QAAQ,CAAC,GAGhCJ,EAASO,GAAKH,GAAMI,GAAM/D,CAAI,GAG1BwD,KAAO,OACTO,IAAOD,EAAI,QAGXN,IAAMN,EAAQrF,GAAIiG,GAAKM,GAAIL,CAAI,GAG3BP,IAAM,MACRnG,KAGAkG,EAASO,GAAKM,IAAKL,IAAOM,IAAKxG,GAAIkG,GAAM/D,CAAI,KAIjD+D,IAAOD,EAAI,UACFN,MAAQ,MACjBnG,KACAyG,IAAM,CAAC,CAAC,IAIVD,EAAGrG,GAAG,IAAIH,GAGNmG,KAAOM,EAAI,CAAC,IACdA,EAAIC,GAAM,IAAInG,EAAGqG,EAAE,KAAK,KAExBH,IAAM,CAAClG,EAAGqG,EAAE,CAAC,GACbF,IAAO;AAAA,gBAGDE,OAAOC,KAAMJ,EAAI,CAAC,MAAM,WAAWvF;AAE7C,QAAAmF,IAAOI,EAAI,CAAC,MAAM;AAAA,MACpB;AAGA,MAAKD,EAAG,CAAC,KAAGA,EAAG,MAAK;AAAA,IACtB;AAGA,QAAIJ,KAAW;AACb,MAAA3C,EAAE,IAAIJ,GACN7E,KAAU6H;AAAA,SACL;AAGL,WAAKlG,IAAI,GAAGH,IAAIwG,EAAG,CAAC,GAAGxG,KAAK,IAAIA,KAAK,GAAI,CAAAG;AACzC,MAAAsD,EAAE,IAAItD,IAAIkD,IAAI+C,IAAU,GAExBvG,EAAS4D,GAAGS,IAAKvD,IAAK8C,EAAE,IAAI,IAAI9C,GAAIC,GAAIyF,CAAI;AAAA,IAC9C;AAEA,WAAO5C;AAAA,EACT;AACF;AAOC,SAAS5D,EAASD,GAAGsB,GAAIN,GAAIsG,GAAa;AACzC,MAAIC,GAAQhH,GAAGC,GAAGJ,GAAGmF,GAAIiC,GAAS5F,GAAGjB,GAAI8G,GACvCpH,IAAOL,EAAE;AAGX,EAAA0H,EAAK,KAAIpG,KAAM,MAAM;AAInB,QAHAX,IAAKX,EAAE,GAGH,CAACW,EAAI,QAAOX;AAWhB,SAAKuH,IAAS,GAAGnH,IAAIO,EAAG,CAAC,GAAGP,KAAK,IAAIA,KAAK,GAAI,CAAAmH;AAI9C,QAHAhH,IAAIe,IAAKiG,GAGLhH,IAAI;AACN,MAAAA,KAAKZ,GACLa,IAAIc,GACJM,IAAIjB,EAAG8G,IAAM,CAAC,GAGdlC,IAAK3D,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAAI,KAAK;AAAA,aAE5CiH,IAAM,KAAK,MAAMlH,IAAI,KAAKZ,CAAQ,GAClCS,IAAIO,EAAG,QACH8G,KAAOrH;AACT,UAAIkH,GAAa;AAGf,eAAOlH,OAAOqH,IAAM,CAAA9G,EAAG,KAAK,CAAC;AAC7B,QAAAiB,IAAI2D,IAAK,GACTgC,IAAS,GACThH,KAAKZ,GACLa,IAAID,IAAIZ,IAAW;AAAA,MACrB;AACE,cAAM+H;AAAA,SAEH;AAIL,WAHA9F,IAAIxB,IAAIO,EAAG8G,CAAG,GAGTF,IAAS,GAAGnH,KAAK,IAAIA,KAAK,GAAI,CAAAmH;AAGnC,MAAAhH,KAAKZ,GAILa,IAAID,IAAIZ,IAAW4H,GAGnBhC,IAAK/E,IAAI,IAAI,IAAIoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAAI,KAAK;AAAA,IAC1D;AAmBF,QAfA8G,IAAcA,KAAehG,IAAK,KAChCX,EAAG8G,IAAM,CAAC,MAAM,WAAWjH,IAAI,IAAIoB,IAAIA,IAAIvC,EAAQ,IAAIkI,IAAS/G,IAAI,CAAC,IAMvEgH,IAAUxG,IAAK,KACVuE,KAAM+B,OAAiBtG,KAAM,KAAKA,MAAOhB,EAAE,IAAI,IAAI,IAAI,MACxDuF,IAAK,KAAKA,KAAM,MAAMvE,KAAM,KAAKsG,KAAetG,KAAM;AAAA,KAGpDT,IAAI,IAAIC,IAAI,IAAIoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,CAAC,IAAI,IAAIG,EAAG8G,IAAM,CAAC,KAAK,KAAM,KACvEzG,MAAOhB,EAAE,IAAI,IAAI,IAAI,KAEvBsB,IAAK,KAAK,CAACX,EAAG,CAAC;AACjB,aAAAA,EAAG,SAAS,GACR6G,KAGFlG,KAAMtB,EAAE,IAAI,GAGZW,EAAG,CAAC,IAAItB,EAAQ,KAAKM,IAAW2B,IAAK3B,KAAYA,CAAQ,GACzDK,EAAE,IAAI,CAACsB,KAAM,KAIbX,EAAG,CAAC,IAAIX,EAAE,IAAI,GAGTA;AAiBT,QAbIO,KAAK,KACPI,EAAG,SAAS8G,GACZrH,IAAI,GACJqH,QAEA9G,EAAG,SAAS8G,IAAM,GAClBrH,IAAIf,EAAQ,IAAIM,IAAWY,CAAC,GAI5BI,EAAG8G,CAAG,IAAIjH,IAAI,KAAKoB,IAAIvC,EAAQ,IAAIkI,IAAS/G,CAAC,IAAInB,EAAQ,IAAImB,CAAC,IAAI,KAAKJ,IAAI,IAGzEoH;AACF;AAGE,YAAIC,KAAO,GAAG;AAGZ,eAAKlH,IAAI,GAAGC,IAAIG,EAAG,CAAC,GAAGH,KAAK,IAAIA,KAAK,GAAI,CAAAD;AAEzC,eADAC,IAAIG,EAAG,CAAC,KAAKP,GACRA,IAAI,GAAGI,KAAK,IAAIA,KAAK,GAAI,CAAAJ;AAG9B,UAAIG,KAAKH,MACPJ,EAAE,KACEW,EAAG,CAAC,KAAKjB,MAAMiB,EAAG,CAAC,IAAI;AAG7B;AAAA,QACF,OAAO;AAEL,cADAA,EAAG8G,CAAG,KAAKrH,GACPO,EAAG8G,CAAG,KAAK/H,EAAM;AACrB,UAAAiB,EAAG8G,GAAK,IAAI,GACZrH,IAAI;AAAA,QACN;AAKJ,SAAKG,IAAII,EAAG,QAAQA,EAAG,EAAEJ,CAAC,MAAM,IAAI,CAAAI,EAAG;EACzC;AAEA,SAAI7B,MAGEkB,EAAE,IAAIK,EAAK,QAGbL,EAAE,IAAI,MACNA,EAAE,IAAI,OAGGA,EAAE,IAAIK,EAAK,SAGpBL,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,KAKLA;AACT;AAGA,SAASyE,EAAezE,GAAG2H,GAAOrG,GAAI;AACpC,MAAI,CAACtB,EAAE,SAAQ,EAAI,QAAO4H,GAAkB5H,CAAC;AAC7C,MAAII,GACFqD,IAAIzD,EAAE,GACNwE,IAAM9C,EAAe1B,EAAE,CAAC,GACxB+B,IAAMyC,EAAI;AAEZ,SAAImD,KACErG,MAAOlB,IAAIkB,IAAKS,KAAO,IACzByC,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC,IAAIY,GAAchF,CAAC,IACjD2B,IAAM,MACfyC,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC,IAGzCA,IAAMA,KAAOxE,EAAE,IAAI,IAAI,MAAM,QAAQA,EAAE,KAC9ByD,IAAI,KACbe,IAAM,OAAOY,GAAc,CAAC3B,IAAI,CAAC,IAAIe,GACjClD,MAAOlB,IAAIkB,IAAKS,KAAO,MAAGyC,KAAOY,GAAchF,CAAC,MAC3CqD,KAAK1B,KACdyC,KAAOY,GAAc3B,IAAI,IAAI1B,CAAG,GAC5BT,MAAOlB,IAAIkB,IAAKmC,IAAI,KAAK,MAAGe,IAAMA,IAAM,MAAMY,GAAchF,CAAC,QAE5DA,IAAIqD,IAAI,KAAK1B,MAAKyC,IAAMA,EAAI,MAAM,GAAGpE,CAAC,IAAI,MAAMoE,EAAI,MAAMpE,CAAC,IAC5DkB,MAAOlB,IAAIkB,IAAKS,KAAO,MACrB0B,IAAI,MAAM1B,MAAKyC,KAAO,MAC1BA,KAAOY,GAAchF,CAAC,KAInBoE;AACT;AAIA,SAASZ,GAAkB2D,GAAQ9D,GAAG;AACpC,MAAI7B,IAAI2F,EAAO,CAAC;AAGhB,OAAM9D,KAAK9D,GAAUiC,KAAK,IAAIA,KAAK,GAAI,CAAA6B;AACvC,SAAOA;AACT;AAGA,SAASF,GAAQlD,GAAMiB,GAAIP,GAAI;AAC7B,MAAIO,IAAKzB;AAGP,UAAAf,IAAW,IACPiC,MAAIV,EAAK,YAAYU,IACnB,MAAM9B,EAAsB;AAEpC,SAAOgB,EAAS,IAAII,EAAK5B,EAAI,GAAG6C,GAAI,GAAG,EAAI;AAC7C;AAGA,SAASoB,EAAMrC,GAAMiB,GAAIN,GAAI;AAC3B,MAAIM,IAAKxB,GAAc,OAAM,MAAMb,EAAsB;AACzD,SAAOgB,EAAS,IAAII,EAAK3B,EAAE,GAAG4C,GAAIN,GAAI,EAAI;AAC5C;AAGA,SAASiD,GAAasD,GAAQ;AAC5B,MAAI3F,IAAI2F,EAAO,SAAS,GACtBxF,IAAMH,IAAIjC,IAAW;AAKvB,MAHAiC,IAAI2F,EAAO3F,CAAC,GAGRA,GAAG;AAGL,WAAOA,IAAI,MAAM,GAAGA,KAAK,GAAI,CAAAG;AAG7B,SAAKH,IAAI2F,EAAO,CAAC,GAAG3F,KAAK,IAAIA,KAAK,GAAI,CAAAG;AAAA,EACxC;AAEA,SAAOA;AACT;AAGA,SAASqD,GAAchF,GAAG;AAExB,WADIyH,IAAK,IACFzH,MAAM,CAAAyH,KAAM;AACnB,SAAOA;AACT;AAUA,SAAS5C,GAAO5E,GAAML,GAAG,GAAGe,GAAI;AAC9B,MAAIuG,GACFlG,IAAI,IAAIf,EAAK,CAAC,GAIdD,IAAI,KAAK,KAAKW,IAAKpB,IAAW,CAAC;AAIjC,OAFAb,IAAW,QAEF;AAOP,QANI,IAAI,MACNsC,IAAIA,EAAE,MAAMpB,CAAC,GACT8H,GAAS1G,EAAE,GAAGhB,CAAC,MAAGkH,IAAc,MAGtC,IAAIlI,EAAU,IAAI,CAAC,GACf,MAAM,GAAG;AAGX,UAAIgC,EAAE,EAAE,SAAS,GACbkG,KAAelG,EAAE,EAAE,CAAC,MAAM,KAAG,EAAEA,EAAE,EAAE,CAAC;AACxC;AAAA,IACF;AAEA,IAAApB,IAAIA,EAAE,MAAMA,CAAC,GACb8H,GAAS9H,EAAE,GAAGI,CAAC;AAAA,EACjB;AAEA,SAAAtB,IAAW,IAEJsC;AACT;AAGA,SAAS2G,GAAMjG,GAAG;AAChB,SAAOA,EAAE,EAAEA,EAAE,EAAE,SAAS,CAAC,IAAI;AAC/B;AAMA,SAASkG,GAAS3H,GAAM4H,GAAMC,GAAM;AAKlC,WAJI5H,GACFN,IAAI,IAAIK,EAAK4H,EAAK,CAAC,CAAC,GACpB1H,IAAI,GAEC,EAAEA,IAAI0H,EAAK;AAEhB,QADA3H,IAAI,IAAID,EAAK4H,EAAK1H,CAAC,CAAC,GACfD,EAAE;AAGA,MAAIN,EAAEkI,CAAI,EAAE5H,CAAC,MAClBN,IAAIM;AAAA,SAJI;AACR,MAAAN,IAAIM;AACJ;AAAA,IACF;AAKF,SAAON;AACT;AAkCA,SAAS8D,GAAmB9D,GAAGsB,GAAI;AACjC,MAAI2B,GAAaI,GAAO7C,GAAG2H,GAAKC,GAAK7G,GAAGoB,GACtCtB,IAAM,GACNd,IAAI,GACJH,IAAI,GACJC,IAAOL,EAAE,aACTgB,IAAKX,EAAK,UACVU,IAAKV,EAAK;AAGZ,MAAI,CAACL,EAAE,KAAK,CAACA,EAAE,EAAE,CAAC,KAAKA,EAAE,IAAI;AAE3B,WAAO,IAAIK,EAAKL,EAAE,IACbA,EAAE,EAAE,CAAC,IAAQA,EAAE,IAAI,IAAI,IAAI,QAAlB,IACVA,EAAE,IAAIA,EAAE,IAAI,IAAI,IAAIA,IAAI,GAAK;AAanC,OAVIsB,KAAM,QACRxC,IAAW,IACX6D,IAAM5B,KAEN4B,IAAMrB,GAGRC,IAAI,IAAIlB,EAAK,OAAO,GAGbL,EAAE,IAAI;AAGX,IAAAA,IAAIA,EAAE,MAAMuB,CAAC,GACbnB,KAAK;AAUP,OALAiD,IAAQ,KAAK,IAAIhE,EAAQ,GAAGe,CAAC,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,GACtDuC,KAAOU,GACPJ,IAAckF,IAAMC,IAAM,IAAI/H,EAAK,CAAC,GACpCA,EAAK,YAAYsC,OAER;AAKP,QAJAwF,IAAMlI,EAASkI,EAAI,MAAMnI,CAAC,GAAG2C,GAAK,CAAC,GACnCM,IAAcA,EAAY,MAAM,EAAE1C,CAAC,GACnCgB,IAAI6G,EAAI,KAAKzG,EAAOwG,GAAKlF,GAAaN,GAAK,CAAC,CAAC,GAEzCjB,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGoB,CAAG,MAAMjB,EAAe0G,EAAI,CAAC,EAAE,MAAM,GAAGzF,CAAG,GAAG;AAE7E,WADAnC,IAAIJ,GACGI,MAAK,CAAA4H,IAAMnI,EAASmI,EAAI,MAAMA,CAAG,GAAGzF,GAAK,CAAC;AAOjD,UAAIrB,KAAM;AAER,YAAID,IAAM,KAAKmC,GAAoB4E,EAAI,GAAGzF,IAAMU,GAAOrC,GAAIK,CAAG;AAC5D,UAAAhB,EAAK,YAAYsC,KAAO,IACxBM,IAAckF,IAAM5G,IAAI,IAAIlB,EAAK,CAAC,GAClCE,IAAI,GACJc;AAAA;AAEA,iBAAOpB,EAASmI,GAAK/H,EAAK,YAAYU,GAAIC,GAAIlC,IAAW,EAAI;AAAA;AAG/D,eAAAuB,EAAK,YAAYU,GACVqH;AAAA,IAEX;AAEA,IAAAA,IAAM7G;AAAA,EACR;AACF;AAkBA,SAAS+B,GAAiBhD,GAAGgB,GAAI;AAC/B,MAAI+G,GAAGC,GAAIrF,GAAaQ,GAAG8E,GAAWlH,GAAK+G,GAAK7G,GAAGoB,GAAK6F,GAAI1F,GAC1DhB,IAAI,GACJuB,IAAQ,IACRrD,IAAIM,GACJK,IAAKX,EAAE,GACPK,IAAOL,EAAE,aACTgB,IAAKX,EAAK,UACVU,IAAKV,EAAK;AAGZ,MAAIL,EAAE,IAAI,KAAK,CAACW,KAAM,CAACA,EAAG,CAAC,KAAK,CAACX,EAAE,KAAKW,EAAG,CAAC,KAAK,KAAKA,EAAG,UAAU;AACjE,WAAO,IAAIN,EAAKM,KAAM,CAACA,EAAG,CAAC,IAAI,SAASX,EAAE,KAAK,IAAI,MAAMW,IAAK,IAAIX,CAAC;AAcrE,MAXIsB,KAAM,QACRxC,IAAW,IACX6D,IAAM5B,KAEN4B,IAAMrB,GAGRjB,EAAK,YAAYsC,KAAOU,GACxBgF,IAAI3G,EAAef,CAAE,GACrB2H,IAAKD,EAAE,OAAO,CAAC,GAEX,KAAK,IAAI5E,IAAIzD,EAAE,CAAC,IAAI,OAAQ;AAa9B,WAAOsI,IAAK,KAAKA,KAAM,KAAKA,KAAM,KAAKD,EAAE,OAAO,CAAC,IAAI;AACnD,MAAArI,IAAIA,EAAE,MAAMM,CAAC,GACb+H,IAAI3G,EAAe1B,EAAE,CAAC,GACtBsI,IAAKD,EAAE,OAAO,CAAC,GACfvG;AAGF,IAAA2B,IAAIzD,EAAE,GAEFsI,IAAK,KACPtI,IAAI,IAAIK,EAAK,OAAOgI,CAAC,GACrB5E,OAEAzD,IAAI,IAAIK,EAAKiI,IAAK,MAAMD,EAAE,MAAM,CAAC,CAAC;AAAA,EAEtC;AAKE,WAAA9G,IAAIgC,GAAQlD,GAAMsC,IAAM,GAAG5B,CAAE,EAAE,MAAM0C,IAAI,EAAE,GAC3CzD,IAAIsD,GAAiB,IAAIjD,EAAKiI,IAAK,MAAMD,EAAE,MAAM,CAAC,CAAC,GAAG1F,IAAMU,CAAK,EAAE,KAAK9B,CAAC,GACzElB,EAAK,YAAYU,GAEVO,KAAM,OAAOrB,EAASD,GAAGe,GAAIC,GAAIlC,IAAW,EAAI,IAAIkB;AAa7D,OATAwI,IAAKxI,GAKLoI,IAAMG,IAAYvI,IAAI2B,EAAO3B,EAAE,MAAM,CAAC,GAAGA,EAAE,KAAK,CAAC,GAAG2C,GAAK,CAAC,GAC1DG,IAAK7C,EAASD,EAAE,MAAMA,CAAC,GAAG2C,GAAK,CAAC,GAChCM,IAAc,OAEL;AAIP,QAHAsF,IAAYtI,EAASsI,EAAU,MAAMzF,CAAE,GAAGH,GAAK,CAAC,GAChDpB,IAAI6G,EAAI,KAAKzG,EAAO4G,GAAW,IAAIlI,EAAK4C,CAAW,GAAGN,GAAK,CAAC,CAAC,GAEzDjB,EAAeH,EAAE,CAAC,EAAE,MAAM,GAAGoB,CAAG,MAAMjB,EAAe0G,EAAI,CAAC,EAAE,MAAM,GAAGzF,CAAG;AAc1E,UAbAyF,IAAMA,EAAI,MAAM,CAAC,GAIb3E,MAAM,MAAG2E,IAAMA,EAAI,KAAK7E,GAAQlD,GAAMsC,IAAM,GAAG5B,CAAE,EAAE,MAAM0C,IAAI,EAAE,CAAC,IACpE2E,IAAMzG,EAAOyG,GAAK,IAAI/H,EAAKyB,CAAC,GAAGa,GAAK,CAAC,GAQjCrB,KAAM;AACR,YAAIkC,GAAoB4E,EAAI,GAAGzF,IAAMU,GAAOrC,GAAIK,CAAG;AACjD,UAAAhB,EAAK,YAAYsC,KAAOU,GACxB9B,IAAIgH,IAAYvI,IAAI2B,EAAO6G,EAAG,MAAM,CAAC,GAAGA,EAAG,KAAK,CAAC,GAAG7F,GAAK,CAAC,GAC1DG,IAAK7C,EAASD,EAAE,MAAMA,CAAC,GAAG2C,GAAK,CAAC,GAChCM,IAAc5B,IAAM;AAAA;AAEpB,iBAAOpB,EAASmI,GAAK/H,EAAK,YAAYU,GAAIC,GAAIlC,IAAW,EAAI;AAAA;AAG/D,eAAAuB,EAAK,YAAYU,GACVqH;AAIX,IAAAA,IAAM7G,GACN0B,KAAe;AAAA,EACjB;AACF;AAIA,SAAS2E,GAAkB5H,GAAG;AAE5B,SAAO,OAAOA,EAAE,IAAIA,EAAE,IAAI,CAAC;AAC7B;AAMA,SAASyI,GAAazI,GAAGwE,GAAK;AAC5B,MAAIf,GAAG,GAAG1B;AAmBV,QAhBK0B,IAAIe,EAAI,QAAQ,GAAG,KAAK,OAAIA,IAAMA,EAAI,QAAQ,KAAK,EAAE,KAGrD,IAAIA,EAAI,OAAO,IAAI,KAAK,KAGvBf,IAAI,MAAGA,IAAI,IACfA,KAAK,CAACe,EAAI,MAAM,IAAI,CAAC,GACrBA,IAAMA,EAAI,UAAU,GAAG,CAAC,KACff,IAAI,MAGbA,IAAIe,EAAI,SAIL,IAAI,GAAGA,EAAI,WAAW,CAAC,MAAM,IAAI,IAAI;AAG1C,OAAKzC,IAAMyC,EAAI,QAAQA,EAAI,WAAWzC,IAAM,CAAC,MAAM,IAAI,EAAEA,EAAI;AAG7D,MAFAyC,IAAMA,EAAI,MAAM,GAAGzC,CAAG,GAElByC,GAAK;AAYP,QAXAzC,KAAO,GACP/B,EAAE,IAAIyD,IAAIA,IAAI,IAAI,GAClBzD,EAAE,IAAI,IAMN,KAAKyD,IAAI,KAAK9D,GACV8D,IAAI,MAAG,KAAK9D,IAEZ,IAAIoC,GAAK;AAEX,WADI,KAAG/B,EAAE,EAAE,KAAK,CAACwE,EAAI,MAAM,GAAG,CAAC,CAAC,GAC3BzC,KAAOpC,GAAU,IAAIoC,IAAM,CAAA/B,EAAE,EAAE,KAAK,CAACwE,EAAI,MAAM,GAAG,KAAK7E,CAAQ,CAAC;AACrE,MAAA6E,IAAMA,EAAI,MAAM,CAAC,GACjB,IAAI7E,IAAW6E,EAAI;AAAA,IACrB;AACE,WAAKzC;AAGP,WAAO,MAAM,CAAAyC,KAAO;AACpB,IAAAxE,EAAE,EAAE,KAAK,CAACwE,CAAG,GAET1F,MAGEkB,EAAE,IAAIA,EAAE,YAAY,QAGtBA,EAAE,IAAI,MACNA,EAAE,IAAI,OAGGA,EAAE,IAAIA,EAAE,YAAY,SAG7BA,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AAAA,EAId;AAGE,IAAAA,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AAGV,SAAOA;AACT;AAMA,SAAS0I,GAAW1I,GAAGwE,GAAK;AAC1B,MAAIzB,GAAM1C,GAAMsI,GAASpI,GAAGqI,GAAS7G,GAAK8G,GAAGlI,GAAI+C;AAEjD,MAAIc,EAAI,QAAQ,GAAG,IAAI;AAErB,QADAA,IAAMA,EAAI,QAAQ,gBAAgB,IAAI,GAClC/E,GAAU,KAAK+E,CAAG,EAAG,QAAOiE,GAAazI,GAAGwE,CAAG;AAAA,aAC1CA,MAAQ,cAAcA,MAAQ;AACvC,WAAK,CAACA,MAAKxE,EAAE,IAAI,MACjBA,EAAE,IAAI,KACNA,EAAE,IAAI,MACCA;AAGT,MAAIT,GAAM,KAAKiF,CAAG;AAChB,IAAAzB,IAAO,IACPyB,IAAMA,EAAI;WACDlF,GAAS,KAAKkF,CAAG;AAC1B,IAAAzB,IAAO;AAAA,WACEvD,GAAQ,KAAKgF,CAAG;AACzB,IAAAzB,IAAO;AAAA;AAEP,UAAM,MAAM/D,KAAkBwF,CAAG;AAgCnC,OA5BAjE,IAAIiE,EAAI,OAAO,IAAI,GAEfjE,IAAI,KACNsI,IAAI,CAACrE,EAAI,MAAMjE,IAAI,CAAC,GACpBiE,IAAMA,EAAI,UAAU,GAAGjE,CAAC,KAExBiE,IAAMA,EAAI,MAAM,CAAC,GAKnBjE,IAAIiE,EAAI,QAAQ,GAAG,GACnBoE,IAAUrI,KAAK,GACfF,IAAOL,EAAE,aAEL4I,MACFpE,IAAMA,EAAI,QAAQ,KAAK,EAAE,GACzBzC,IAAMyC,EAAI,QACVjE,IAAIwB,IAAMxB,GAGVoI,IAAU1D,GAAO5E,GAAM,IAAIA,EAAK0C,CAAI,GAAGxC,GAAGA,IAAI,CAAC,IAGjDI,IAAK6E,GAAYhB,GAAKzB,GAAMrD,CAAI,GAChCgE,IAAK/C,EAAG,SAAS,GAGZJ,IAAImD,GAAI/C,EAAGJ,CAAC,MAAM,GAAG,EAAEA,EAAG,CAAAI,EAAG;AAClC,SAAIJ,IAAI,IAAU,IAAIF,EAAKL,EAAE,IAAI,CAAC,KAClCA,EAAE,IAAI4D,GAAkBjD,GAAI+C,CAAE,GAC9B1D,EAAE,IAAIW,GACN7B,IAAW,IAQP8J,MAAS5I,IAAI2B,EAAO3B,GAAG2I,GAAS5G,IAAM,CAAC,IAGvC8G,MAAG7I,IAAIA,EAAE,MAAM,KAAK,IAAI6I,CAAC,IAAI,KAAKxJ,EAAQ,GAAGwJ,CAAC,IAAIC,GAAQ,IAAI,GAAGD,CAAC,CAAC,IACvE/J,IAAW,IAEJkB;AACT;AAQA,SAASkE,GAAK7D,GAAML,GAAG;AACrB,MAAII,GACF2B,IAAM/B,EAAE,EAAE;AAEZ,MAAI+B,IAAM;AACR,WAAO/B,EAAE,OAAM,IAAKA,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,CAAC;AAQpD,EAAAI,IAAI,MAAM,KAAK,KAAK2B,CAAG,GACvB3B,IAAIA,IAAI,KAAK,KAAKA,IAAI,GAEtBJ,IAAIA,EAAE,MAAM,IAAIiC,GAAQ,GAAG7B,CAAC,CAAC,GAC7BJ,IAAIkC,GAAa7B,GAAM,GAAGL,GAAGA,CAAC;AAO9B,WAJI+I,GACFzG,IAAK,IAAIjC,EAAK,CAAC,GACfkC,IAAM,IAAIlC,EAAK,EAAE,GACjBmC,IAAM,IAAInC,EAAK,EAAE,GACZD;AACL,IAAA2I,IAAS/I,EAAE,MAAMA,CAAC,GAClBA,IAAIA,EAAE,MAAMsC,EAAG,KAAKyG,EAAO,MAAMxG,EAAI,MAAMwG,CAAM,EAAE,MAAMvG,CAAG,CAAC,CAAC,CAAC;AAGjE,SAAOxC;AACT;AAIA,SAASkC,GAAa7B,GAAMyB,GAAG9B,GAAGM,GAAG0I,GAAc;AAC9C,MAACxI,GAAGe,GAAG0H,GAAGnG,GAEX/B,IAAKV,EAAK,WACVD,IAAI,KAAK,KAAKW,IAAKpB,CAAQ;AAM7B,OAJAb,IAAW,IACXgE,IAAK9C,EAAE,MAAMA,CAAC,GACdiJ,IAAI,IAAI5I,EAAKC,CAAC,OAEL;AAMP,QALAiB,IAAII,EAAOsH,EAAE,MAAMnG,CAAE,GAAG,IAAIzC,EAAKyB,MAAMA,GAAG,GAAGf,GAAI,CAAC,GAClDkI,IAAID,IAAe1I,EAAE,KAAKiB,CAAC,IAAIjB,EAAE,MAAMiB,CAAC,GACxCjB,IAAIqB,EAAOJ,EAAE,MAAMuB,CAAE,GAAG,IAAIzC,EAAKyB,MAAMA,GAAG,GAAGf,GAAI,CAAC,GAClDQ,IAAI0H,EAAE,KAAK3I,CAAC,GAERiB,EAAE,EAAEnB,CAAC,MAAM,QAAQ;AACrB,WAAKI,IAAIJ,GAAGmB,EAAE,EAAEf,CAAC,MAAMyI,EAAE,EAAEzI,CAAC,KAAKA,MAAK;AACtC,UAAIA,KAAK,GAAI;AAAA,IACf;AAEA,IAAAA,IAAIyI,GACJA,IAAI3I,GACJA,IAAIiB,GACJA,IAAIf;AAAA,EAEN;AAEA,SAAA1B,IAAW,IACXyC,EAAE,EAAE,SAASnB,IAAI,GAEVmB;AACT;AAIA,SAASU,GAAQkE,GAAG1C,GAAG;AAErB,WADI,IAAI0C,GACD,EAAE1C,IAAG,MAAK0C;AACjB,SAAO;AACT;AAIA,SAASjF,GAAiBb,GAAML,GAAG;AACjC,MAAIuB,GACF2H,IAAQlJ,EAAE,IAAI,GACdmJ,IAAKzG,EAAMrC,GAAMA,EAAK,WAAW,CAAC,GAClCoC,IAAS0G,EAAG,MAAM,GAAG;AAIvB,MAFAnJ,IAAIA,EAAE,OAEFA,EAAE,IAAIyC,CAAM;AACd,WAAA5D,IAAWqK,IAAQ,IAAI,GAChBlJ;AAKT,MAFAuB,IAAIvB,EAAE,SAASmJ,CAAE,GAEb5H,EAAE;AACJ,IAAA1C,IAAWqK,IAAQ,IAAI;AAAA,OAClB;AAIL,QAHAlJ,IAAIA,EAAE,MAAMuB,EAAE,MAAM4H,CAAE,CAAC,GAGnBnJ,EAAE,IAAIyC,CAAM;AACd,aAAA5D,IAAWkJ,GAAMxG,CAAC,IAAK2H,IAAQ,IAAI,IAAMA,IAAQ,IAAI,GAC9ClJ;AAGT,IAAAnB,IAAWkJ,GAAMxG,CAAC,IAAK2H,IAAQ,IAAI,IAAMA,IAAQ,IAAI;AAAA,EACvD;AAEA,SAAOlJ,EAAE,MAAMmJ,CAAE,EAAE,IAAG;AACxB;AAQA,SAAS9E,GAAerE,GAAG0F,GAASpE,GAAIN,GAAI;AAC1C,MAAI+B,GAAMU,GAAGlD,GAAGH,GAAG2B,GAAKyF,GAAShD,GAAK7D,GAAIL,GACxCD,IAAOL,EAAE,aACT2H,IAAQrG,MAAO;AAWjB,MATIqG,KACFpD,EAAWjD,GAAI,GAAG/C,EAAU,GACxByC,MAAO,SAAQA,IAAKX,EAAK,WACxBkE,EAAWvD,GAAI,GAAG,CAAC,MAExBM,IAAKjB,EAAK,WACVW,IAAKX,EAAK,WAGR,CAACL,EAAE;AACL,IAAAwE,IAAMoD,GAAkB5H,CAAC;AAAA,OACpB;AAoCL,SAnCAwE,IAAMC,EAAezE,CAAC,GACtBO,IAAIiE,EAAI,QAAQ,GAAG,GAOfmD,KACF5E,IAAO,GACH2C,KAAW,KACbpE,IAAKA,IAAK,IAAI,IACLoE,KAAW,MACpBpE,IAAKA,IAAK,IAAI,MAGhByB,IAAO2C,GAOLnF,KAAK,MACPiE,IAAMA,EAAI,QAAQ,KAAK,EAAE,GACzBlE,IAAI,IAAID,EAAK,CAAC,GACdC,EAAE,IAAIkE,EAAI,SAASjE,GACnBD,EAAE,IAAIkF,GAAYf,EAAenE,CAAC,GAAG,IAAIyC,CAAI,GAC7CzC,EAAE,IAAIA,EAAE,EAAE,SAGZK,IAAK6E,GAAYhB,GAAK,IAAIzB,CAAI,GAC9BU,IAAI1B,IAAMpB,EAAG,QAGNA,EAAG,EAAEoB,CAAG,KAAK,IAAI,CAAApB,EAAG;AAE3B,QAAI,CAACA,EAAG,CAAC;AACP,MAAA6D,IAAMmD,IAAQ,SAAS;AAAA,SAClB;AAyBL,UAxBIpH,IAAI,IACNkD,OAEAzD,IAAI,IAAIK,EAAKL,CAAC,GACdA,EAAE,IAAIW,GACNX,EAAE,IAAIyD,GACNzD,IAAI2B,EAAO3B,GAAGM,GAAGgB,GAAIN,GAAI,GAAG+B,CAAI,GAChCpC,IAAKX,EAAE,GACPyD,IAAIzD,EAAE,GACNwH,IAAU5I,KAIZ2B,IAAII,EAAGW,CAAE,GACTlB,IAAI2C,IAAO,GACXyE,IAAUA,KAAW7G,EAAGW,IAAK,CAAC,MAAM,QAEpCkG,IAAUxG,IAAK,KACVT,MAAM,UAAUiH,OAAaxG,MAAO,KAAKA,OAAQhB,EAAE,IAAI,IAAI,IAAI,MAChEO,IAAIH,KAAKG,MAAMH,MAAMY,MAAO,KAAKwG,KAAWxG,MAAO,KAAKL,EAAGW,IAAK,CAAC,IAAI,KACrEN,OAAQhB,EAAE,IAAI,IAAI,IAAI,KAE1BW,EAAG,SAASW,GAERkG;AAGF,eAAO,EAAE7G,EAAG,EAAEW,CAAE,IAAIyB,IAAO;AACzB,UAAApC,EAAGW,CAAE,IAAI,GACJA,MACH,EAAEmC,GACF9C,EAAG,QAAQ,CAAC;AAMlB,WAAKoB,IAAMpB,EAAG,QAAQ,CAACA,EAAGoB,IAAM,CAAC,GAAG,EAAEA,EAAI;AAG1C,WAAKxB,IAAI,GAAGiE,IAAM,IAAIjE,IAAIwB,GAAKxB,IAAK,CAAAiE,KAAOhG,GAAS,OAAOmC,EAAGJ,CAAC,CAAC;AAGhE,UAAIoH,GAAO;AACT,YAAI5F,IAAM;AACR,cAAI2D,KAAW,MAAMA,KAAW,GAAG;AAEjC,iBADAnF,IAAImF,KAAW,KAAK,IAAI,GACnB,EAAE3D,GAAKA,IAAMxB,GAAGwB,IAAO,CAAAyC,KAAO;AAEnC,iBADA7D,IAAK6E,GAAYhB,GAAKzB,GAAM2C,CAAO,GAC9B3D,IAAMpB,EAAG,QAAQ,CAACA,EAAGoB,IAAM,CAAC,GAAG,EAAEA,EAAI;AAG1C,iBAAKxB,IAAI,GAAGiE,IAAM,MAAMjE,IAAIwB,GAAKxB,IAAK,CAAAiE,KAAOhG,GAAS,OAAOmC,EAAGJ,CAAC,CAAC;AAAA,UACpE;AACE,YAAAiE,IAAMA,EAAI,OAAO,CAAC,IAAI,MAAMA,EAAI,MAAM,CAAC;AAI3C,QAAAA,IAAOA,KAAOf,IAAI,IAAI,MAAM,QAAQA;AAAA,MACtC,WAAWA,IAAI,GAAG;AAChB,eAAO,EAAEA,IAAI,CAAAe,IAAM,MAAMA;AACzB,QAAAA,IAAM,OAAOA;AAAA,MACf,WACM,EAAEf,IAAI1B,EAAK,MAAK0B,KAAK1B,GAAK0B,MAAO,CAAAe,KAAO;AAAA,UACvC,CAAIf,IAAI1B,MAAKyC,IAAMA,EAAI,MAAM,GAAGf,CAAC,IAAI,MAAMe,EAAI,MAAMf,CAAC;AAAA,IAE/D;AAEA,IAAAe,KAAOkB,KAAW,KAAK,OAAOA,KAAW,IAAI,OAAOA,KAAW,IAAI,OAAO,MAAMlB;AAAA,EAClF;AAEA,SAAOxE,EAAE,IAAI,IAAI,MAAMwE,IAAMA;AAC/B;AAIA,SAASsD,GAASnC,GAAK5D,GAAK;AAC1B,MAAI4D,EAAI,SAAS5D;AACf,WAAA4D,EAAI,SAAS5D,GACN;AAEX;AAyDA,SAASqH,GAAIpJ,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AASA,SAASqJ,GAAKrJ,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASsJ,GAAMtJ,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AAWA,SAASuJ,GAAIvJ,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,KAAKM,CAAC;AAC3B;AAUA,SAASkJ,GAAKxJ,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASyJ,GAAMzJ,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AAUA,SAAS0J,GAAK1J,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAAS2J,GAAM3J,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,MAAK;AAC1B;AA4BA,SAAS4J,GAAMtJ,GAAGN,GAAG;AACnB,EAAAM,IAAI,IAAI,KAAKA,CAAC,GACdN,IAAI,IAAI,KAAKA,CAAC;AACd,MAAIoB,GACFL,IAAK,KAAK,WACVC,IAAK,KAAK,UACV2B,IAAM5B,IAAK;AAGb,SAAI,CAACT,EAAE,KAAK,CAACN,EAAE,IACboB,IAAI,IAAI,KAAK,GAAG,IAGP,CAACd,EAAE,KAAK,CAACN,EAAE,KACpBoB,IAAIsB,EAAM,MAAMC,GAAK,CAAC,EAAE,MAAM3C,EAAE,IAAI,IAAI,OAAO,IAAI,GACnDoB,EAAE,IAAId,EAAE,KAGC,CAACN,EAAE,KAAKM,EAAE,OAAM,KACzBc,IAAIpB,EAAE,IAAI,IAAI0C,EAAM,MAAM3B,GAAIC,CAAE,IAAI,IAAI,KAAK,CAAC,GAC9CI,EAAE,IAAId,EAAE,KAGC,CAACA,EAAE,KAAKN,EAAE,OAAM,KACzBoB,IAAIsB,EAAM,MAAMC,GAAK,CAAC,EAAE,MAAM,GAAG,GACjCvB,EAAE,IAAId,EAAE,KAGCN,EAAE,IAAI,KACf,KAAK,YAAY2C,GACjB,KAAK,WAAW,GAChBvB,IAAI,KAAK,KAAKO,EAAOrB,GAAGN,GAAG2C,GAAK,CAAC,CAAC,GAClC3C,IAAI0C,EAAM,MAAMC,GAAK,CAAC,GACtB,KAAK,YAAY5B,GACjB,KAAK,WAAWC,GAChBI,IAAId,EAAE,IAAI,IAAIc,EAAE,MAAMpB,CAAC,IAAIoB,EAAE,KAAKpB,CAAC,KAEnCoB,IAAI,KAAK,KAAKO,EAAOrB,GAAGN,GAAG2C,GAAK,CAAC,CAAC,GAG7BvB;AACT;AAUA,SAASyI,GAAK7J,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AASA,SAAS8J,GAAK9J,GAAG;AACf,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAWA,SAAS+J,GAAM/J,GAAGE,GAAKC,GAAK;AAC1B,SAAO,IAAI,KAAKH,CAAC,EAAE,MAAME,GAAKC,CAAG;AACnC;AAqBA,SAAS6J,GAAOC,GAAK;AACnB,MAAI,CAACA,KAAO,OAAOA,KAAQ,SAAU,OAAM,MAAMlL,KAAe,iBAAiB;AACjF,MAAIwB,GAAGsI,GAAGqB,GACRC,IAAcF,EAAI,aAAa,IAC/BG,IAAK;AAAA,IACH;AAAA,IAAa;AAAA,IAAG7L;AAAA,IAChB;AAAA,IAAY;AAAA,IAAG;AAAA,IACf;AAAA,IAAY,CAACD;AAAA,IAAW;AAAA,IACxB;AAAA,IAAY;AAAA,IAAGA;AAAA,IACf;AAAA,IAAQ;AAAA,IAAGA;AAAA,IACX;AAAA,IAAQ,CAACA;AAAA,IAAW;AAAA,IACpB;AAAA,IAAU;AAAA,IAAG;AAAA,EACnB;AAEE,OAAKiC,IAAI,GAAGA,IAAI6J,EAAG,QAAQ7J,KAAK;AAE9B,QADIsI,IAAIuB,EAAG7J,CAAC,GAAG4J,MAAa,KAAKtB,CAAC,IAAIlK,GAASkK,CAAC,KAC3CqB,IAAID,EAAIpB,CAAC,OAAO;AACnB,UAAIzJ,EAAU8K,CAAC,MAAMA,KAAKA,KAAKE,EAAG7J,IAAI,CAAC,KAAK2J,KAAKE,EAAG7J,IAAI,CAAC,EAAG,MAAKsI,CAAC,IAAIqB;AAAA,UACjE,OAAM,MAAMlL,KAAkB6J,IAAI,OAAOqB,CAAC;AAKnD,MADIrB,IAAI,UAAUsB,MAAa,KAAKtB,CAAC,IAAIlK,GAASkK,CAAC,KAC9CqB,IAAID,EAAIpB,CAAC,OAAO;AACnB,QAAIqB,MAAM,MAAQA,MAAM,MAASA,MAAM,KAAKA,MAAM;AAChD,UAAIA;AACF,YAAI,OAAO,SAAU,OAAe,WACjC,OAAO,mBAAmB,OAAO;AAClC,eAAKrB,CAAC,IAAI;AAAA;AAEV,gBAAM,MAAM3J,EAAiB;AAAA;AAG/B,aAAK2J,CAAC,IAAI;AAAA;AAGZ,YAAM,MAAM7J,KAAkB6J,IAAI,OAAOqB,CAAC;AAI9C,SAAO;AACT;AAUA,SAASG,GAAIrK,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAASsK,GAAKtK,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAQA,SAASuK,GAAMN,GAAK;AAClB,MAAI1J,GAAGsI,GAAGuB;AASV,WAAStB,EAAQoB,GAAG;AAClB,QAAIzG,GAAGlD,GAAGgB,GACRvB,IAAI;AAGN,QAAI,EAAEA,aAAa8I,GAAU,QAAO,IAAIA,EAAQoB,CAAC;AAOjD,QAHAlK,EAAE,cAAc8I,GAGZ0B,GAAkBN,CAAC,GAAG;AACxB,MAAAlK,EAAE,IAAIkK,EAAE,GAEJpL,IACE,CAACoL,EAAE,KAAKA,EAAE,IAAIpB,EAAQ,QAGxB9I,EAAE,IAAI,KACNA,EAAE,IAAI,QACGkK,EAAE,IAAIpB,EAAQ,QAGvB9I,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,MAERA,EAAE,IAAIkK,EAAE,GACRlK,EAAE,IAAIkK,EAAE,EAAE,MAAK,MAGjBlK,EAAE,IAAIkK,EAAE,GACRlK,EAAE,IAAIkK,EAAE,IAAIA,EAAE,EAAE,MAAK,IAAKA,EAAE;AAG9B;AAAA,IACF;AAIA,QAFA3I,IAAI,OAAO2I,GAEP3I,MAAM,UAAU;AAClB,UAAI2I,MAAM,GAAG;AACX,QAAAlK,EAAE,IAAI,IAAIkK,IAAI,IAAI,KAAK,GACvBlK,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC;AACR;AAAA,MACF;AAUA,UARIkK,IAAI,KACNA,IAAI,CAACA,GACLlK,EAAE,IAAI,MAENA,EAAE,IAAI,GAIJkK,MAAM,CAAC,CAACA,KAAKA,IAAI,KAAK;AACxB,aAAKzG,IAAI,GAAGlD,IAAI2J,GAAG3J,KAAK,IAAIA,KAAK,GAAI,CAAAkD;AAErC,QAAI3E,IACE2E,IAAIqF,EAAQ,QACd9I,EAAE,IAAI,KACNA,EAAE,IAAI,QACGyD,IAAIqF,EAAQ,QACrB9I,EAAE,IAAI,GACNA,EAAE,IAAI,CAAC,CAAC,MAERA,EAAE,IAAIyD,GACNzD,EAAE,IAAI,CAACkK,CAAC,MAGVlK,EAAE,IAAIyD,GACNzD,EAAE,IAAI,CAACkK,CAAC;AAGV;AAAA,MAGF,WAAWA,IAAI,MAAM,GAAG;AACtB,QAAKA,MAAGlK,EAAE,IAAI,MACdA,EAAE,IAAI,KACNA,EAAE,IAAI;AACN;AAAA,MACF;AAEA,aAAOyI,GAAazI,GAAGkK,EAAE,SAAQ,CAAE;AAAA,IAErC,WAAW3I,MAAM;AACf,YAAM,MAAMvC,KAAkBkL,CAAC;AAIjC,YAAK3J,IAAI2J,EAAE,WAAW,CAAC,OAAO,MAC5BA,IAAIA,EAAE,MAAM,CAAC,GACblK,EAAE,IAAI,OAGFO,MAAM,OAAI2J,IAAIA,EAAE,MAAM,CAAC,IAC3BlK,EAAE,IAAI,IAGDP,GAAU,KAAKyK,CAAC,IAAIzB,GAAazI,GAAGkK,CAAC,IAAIxB,GAAW1I,GAAGkK,CAAC;AAAA,EACjE;AA2DA,MAzDApB,EAAQ,YAAY/I,GAEpB+I,EAAQ,WAAW,GACnBA,EAAQ,aAAa,GACrBA,EAAQ,aAAa,GACrBA,EAAQ,cAAc,GACtBA,EAAQ,gBAAgB,GACxBA,EAAQ,kBAAkB,GAC1BA,EAAQ,kBAAkB,GAC1BA,EAAQ,kBAAkB,GAC1BA,EAAQ,mBAAmB,GAC3BA,EAAQ,SAAS,GAEjBA,EAAQ,SAASA,EAAQ,MAAMkB,IAC/BlB,EAAQ,QAAQyB,IAChBzB,EAAQ,YAAY0B,IAEpB1B,EAAQ,MAAMM,IACdN,EAAQ,OAAOO,IACfP,EAAQ,QAAQQ,IAChBR,EAAQ,MAAMS,IACdT,EAAQ,OAAOU,IACfV,EAAQ,QAAQW,IAChBX,EAAQ,OAAOY,IACfZ,EAAQ,QAAQa,IAChBb,EAAQ,QAAQc,IAChBd,EAAQ,OAAOe,IACff,EAAQ,OAAOgB,IACfhB,EAAQ,QAAQiB,IAChBjB,EAAQ,MAAMuB,IACdvB,EAAQ,OAAOwB,IACfxB,EAAQ,MAAM2B,IACd3B,EAAQ,MAAM4B,IACd5B,EAAQ,QAAQ6B,IAChB7B,EAAQ,QAAQ8B,IAChB9B,EAAQ,KAAK+B,IACb/B,EAAQ,MAAMgC,IACdhC,EAAQ,QAAQiC,IAChBjC,EAAQ,OAAOkC,IACflC,EAAQ,MAAM3I,IACd2I,EAAQ,MAAM5I,IACd4I,EAAQ,MAAMmC,IACdnC,EAAQ,MAAMoC,IACdpC,EAAQ,MAAMX,IACdW,EAAQ,SAASqC,IACjBrC,EAAQ,QAAQsC,IAChBtC,EAAQ,OAAOzB,IACfyB,EAAQ,MAAMuC,IACdvC,EAAQ,OAAOwC,IACfxC,EAAQ,OAAOyC,IACfzC,EAAQ,MAAM0C,IACd1C,EAAQ,MAAMV,IACdU,EAAQ,MAAM2C,IACd3C,EAAQ,OAAO4C,IACf5C,EAAQ,QAAQ6C,IAEZ1B,MAAQ,WAAQA,IAAM,KACtBA,KACEA,EAAI,aAAa;AAEnB,SADAG,IAAK,CAAC,aAAa,YAAY,YAAY,YAAY,QAAQ,QAAQ,UAAU,QAAQ,GACpF7J,IAAI,GAAGA,IAAI6J,EAAG,SAAS,CAAKH,EAAI,eAAepB,IAAIuB,EAAG7J,GAAG,CAAC,MAAG0J,EAAIpB,CAAC,IAAI,KAAKA,CAAC;AAIrF,SAAAC,EAAQ,OAAOmB,CAAG,GAEXnB;AACT;AAWA,SAAS2B,GAAIzK,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAUA,SAASoK,GAAI1K,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AASA,SAAS2K,GAAM3K,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAYA,SAAS4K,KAAQ;AACf,MAAIrK,GAAGuB,GACLP,IAAI,IAAI,KAAK,CAAC;AAIhB,OAFAzC,IAAW,IAENyB,IAAI,GAAGA,IAAI,UAAU;AAExB,QADAuB,IAAI,IAAI,KAAK,UAAUvB,GAAG,CAAC,GACtBuB,EAAE;AAMA,MAAIP,EAAE,MACXA,IAAIA,EAAE,KAAKO,EAAE,MAAMA,CAAC,CAAC;AAAA,SAPb;AACR,UAAIA,EAAE;AACJ,eAAAhD,IAAW,IACJ,IAAI,KAAK,KAAK;AAEvB,MAAAyC,IAAIO;AAAA,IACN;AAKF,SAAAhD,IAAW,IAEJyC,EAAE;AACX;AAQA,SAASiJ,GAAkBP,GAAK;AAC9B,SAAOA,aAAenB,MAAWmB,KAAOA,EAAI,gBAAgB9K,MAAO;AACrE;AAUA,SAAS0L,GAAG7K,GAAG;AACb,SAAO,IAAI,KAAKA,CAAC,EAAE,GAAE;AACvB;AAaA,SAAS8K,GAAI9K,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAUA,SAAS0K,GAAKhL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,CAAC;AAC1B;AAUA,SAAS+K,GAAM/K,GAAG;AAChB,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAI,EAAE;AAC3B;AASA,SAASG,KAAM;AACb,SAAO6H,GAAS,MAAM,WAAW,IAAI;AACvC;AASA,SAAS9H,KAAM;AACb,SAAO8H,GAAS,MAAM,WAAW,IAAI;AACvC;AAWA,SAASiD,GAAIjL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS4K,GAAIlL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS6H,GAAInI,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAWA,SAAS6K,GAAO7J,GAAI;AAClB,MAAIO,GAAG4B,GAAGrD,GAAG0B,GACXvB,IAAI,GACJa,IAAI,IAAI,KAAK,CAAC,GACdmE,IAAK,CAAA;AAOP,MALIjE,MAAO,SAAQA,IAAK,KAAK,YACxBiD,EAAWjD,GAAI,GAAG/C,EAAU,GAEjC6B,IAAI,KAAK,KAAKkB,IAAK3B,CAAQ,GAEtB,KAAK;AAIH,QAAI,OAAO;AAGhB,WAFAkC,IAAI,OAAO,gBAAgB,IAAI,YAAYzB,CAAC,CAAC,GAEtCG,IAAIH;AACT,QAAA0B,IAAID,EAAEtB,CAAC,GAIHuB,KAAK,QACPD,EAAEtB,CAAC,IAAI,OAAO,gBAAgB,IAAI,YAAY,CAAC,CAAC,EAAE,CAAC,IAKnDgF,EAAGhF,GAAG,IAAIuB,IAAI;AAAA,aAKT,OAAO,aAAa;AAK7B,WAFAD,IAAI,OAAO,YAAYzB,KAAK,CAAC,GAEtBG,IAAIH;AAGT,QAAA0B,IAAID,EAAEtB,CAAC,KAAKsB,EAAEtB,IAAI,CAAC,KAAK,MAAMsB,EAAEtB,IAAI,CAAC,KAAK,QAAQsB,EAAEtB,IAAI,CAAC,IAAI,QAAS,KAGlEuB,KAAK,QACP,OAAO,YAAY,CAAC,EAAE,KAAKD,GAAGtB,CAAC,KAK/BgF,EAAG,KAAKzD,IAAI,GAAG,GACfvB,KAAK;AAIT,MAAAA,IAAIH,IAAI;AAAA,IACV;AACE,YAAM,MAAMlB,EAAiB;AAAA,MA9C7B,QAAOqB,IAAIH,IAAI,CAAAmF,EAAGhF,GAAG,IAAI,KAAK,OAAM,IAAK,MAAM;AA2DjD,OAVAH,IAAImF,EAAG,EAAEhF,CAAC,GACVe,KAAM3B,GAGFS,KAAKkB,MACPQ,IAAIzC,EAAQ,IAAIM,IAAW2B,CAAE,GAC7BiE,EAAGhF,CAAC,KAAKH,IAAI0B,IAAI,KAAKA,IAIjByD,EAAGhF,CAAC,MAAM,GAAGA,IAAK,CAAAgF,EAAG;AAG5B,MAAIhF,IAAI;AACN,IAAAkD,IAAI,GACJ8B,IAAK,CAAC,CAAC;AAAA,OACF;AAIL,SAHA9B,IAAI,IAGG8B,EAAG,CAAC,MAAM,GAAG9B,KAAK9D,EAAU,CAAA4F,EAAG;AAGtC,SAAKnF,IAAI,GAAG0B,IAAIyD,EAAG,CAAC,GAAGzD,KAAK,IAAIA,KAAK,GAAI,CAAA1B;AAGzC,IAAIA,IAAIT,MAAU8D,KAAK9D,IAAWS;AAAA,EACpC;AAEA,SAAAgB,EAAE,IAAIqC,GACNrC,EAAE,IAAImE,GAECnE;AACT;AAWA,SAASgK,GAAMpL,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,KAAK,QAAQ;AACzD;AAcA,SAASqH,GAAKrH,GAAG;AACf,SAAAA,IAAI,IAAI,KAAKA,CAAC,GACPA,EAAE,IAAKA,EAAE,EAAE,CAAC,IAAIA,EAAE,IAAI,IAAIA,EAAE,IAAKA,EAAE,KAAK;AACjD;AAUA,SAASqL,GAAIrL,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAASsL,GAAKtL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAUA,SAASuL,GAAKvL,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AAWA,SAASwL,GAAIxL,GAAGM,GAAG;AACjB,SAAO,IAAI,KAAKN,CAAC,EAAE,IAAIM,CAAC;AAC1B;AAYA,SAAS8H,KAAM;AACb,MAAI7H,IAAI,GACN0H,IAAO,WACPjI,IAAI,IAAI,KAAKiI,EAAK1H,CAAC,CAAC;AAGtB,OADAzB,IAAW,IACJkB,EAAE,KAAK,EAAEO,IAAI0H,EAAK,SAAS,CAAAjI,IAAIA,EAAE,KAAKiI,EAAK1H,CAAC,CAAC;AACpD,SAAAzB,IAAW,IAEJmB,EAASD,GAAG,KAAK,WAAW,KAAK,QAAQ;AAClD;AAUA,SAASyL,GAAIzL,GAAG;AACd,SAAO,IAAI,KAAKA,CAAC,EAAE,IAAG;AACxB;AAUA,SAAS0L,GAAK1L,GAAG;AACf,SAAO,IAAI,KAAKA,CAAC,EAAE,KAAI;AACzB;AASA,SAAS2L,GAAM3L,GAAG;AAChB,SAAOC,EAASD,IAAI,IAAI,KAAKA,CAAC,GAAGA,EAAE,IAAI,GAAG,CAAC;AAC7C;AAGAD,EAAE,uBAAO,IAAI,4BAA4B,CAAC,IAAIA,EAAE;AAChDA,EAAE,OAAO,WAAW,IAAI;AAGjB,IAAI+I,KAAU/I,EAAE,cAAcwK,GAAM5L,EAAQ;AAGnDF,KAAO,IAAIqK,GAAQrK,EAAI;AACvBC,KAAK,IAAIoK,GAAQpK,EAAE;AC/xJZ,MAAMkN,KAAwB,MCAxBC,KAAY,CAACrH,MAAQA,EAAI,YAAW,GAIpCsH,KAA+B,CAACC,MAAY;AACrD,QAAMC,IAAI,CAAA;AACV,SAAAD,EAAQ,QAAQ,CAAC7B,GAAG9J,MAAM;AACtB,IAAA4L,EAAE5L,CAAC,IAAI8J;AAAA,EACX,CAAC,GACM8B;AACX,GCVaC,KAAmB,CAACC,GAAmBC,GAAWC,MACpDF,EAAkB,WACnBA,IACA;AAAA,EACE,UAAUA;AAAA,EACV,WAAWC;AAAA,EACX,gBAAgBC;AAAA,EAChB,QAAQ;AACpB,GAEaC,KAAsB,CAACC,GAAgBH,GAAWC,MACpDE,EAAe,QAChBA,IACA;AAAA,EACE,OAAOA;AAAA,EACP,WAAWH;AAAA,EACX,gBAAgBC;AAAA,EAChB,QAAQ;AACpB,GAEaG,KAAwB,CAACC,GAAoBJ,MAC/CI,EAAmB,YACpBA,IACA;AAAA,EACE,WAAWA;AAAA,EACX,gBAAgBJ;AAAA,EAChB,QAAQ;AACpB;AC3BO,SAASK,GAAUC,GAAWC,GAAS;AAG5C,MAAI,CAFqB,EAAQD;AAG/B,UAAM,IAAI,MAAMC,CAAO;AAE3B;ACFO,SAASC,GAAaC,GAAO;AAClC,SAAO,OAAOA,KAAS,YAAYA,MAAU;AAC/C;ACNO,SAASC,GAAUJ,GAAWC,GAAS;AAG5C,MAAI,CAFqB,EAAQD;AAG/B,UAAM,IAAI;AAAA,MACoB;AAAA,IAClC;AAEA;ACPA,MAAMK,KAAa;AASZ,SAASC,GAAYC,GAAQC,GAAU;AAC5C,MAAIC,IAAgB,GAChBC,IAAO;AAEX,aAAWC,KAASJ,EAAO,KAAK,SAASF,EAAU,GAAG;AAGpD,QAFA,OAAOM,EAAM,SAAU,YAAYP,GAAU,EAAK,GAE9CO,EAAM,SAASH;AACjB;AAGF,IAAAC,IAAgBE,EAAM,QAAQA,EAAM,CAAC,EAAE,QACvCD,KAAQ;AAAA,EACV;AAEA,SAAO;AAAA,IACL,MAAAA;AAAA,IACA,QAAQF,IAAW,IAAIC;AAAA,EAC3B;AACA;ACxBO,SAASG,GAAcC,GAAU;AACtC,SAAOC;AAAA,IACLD,EAAS;AAAA,IACTP,GAAYO,EAAS,QAAQA,EAAS,KAAK;AAAA,EAC/C;AACA;AAKO,SAASC,GAAoBP,GAAQQ,GAAgB;AAC1D,QAAMC,IAAwBT,EAAO,eAAe,SAAS,GACvDU,IAAO,GAAG,SAASD,CAAqB,IAAIT,EAAO,MACnDW,IAAYH,EAAe,OAAO,GAClCI,IAAaZ,EAAO,eAAe,OAAO,GAC1Ca,IAAUL,EAAe,OAAOI,GAChCE,IAAeN,EAAe,SAAS,IAAIC,IAAwB,GACnEM,IAAYP,EAAe,SAASM,GACpCE,IAAc,GAAGhB,EAAO,IAAI,IAAIa,CAAO,IAAIE,CAAS;AAAA,GACpDE,IAAQP,EAAK,MAAM,cAAc,GACjCQ,IAAeD,EAAMN,CAAS;AAEpC,MAAIO,EAAa,SAAS,KAAK;AAC7B,UAAMC,IAAe,KAAK,MAAMJ,IAAY,EAAE,GACxCK,IAAmBL,IAAY,IAC/BM,IAAW,CAAA;AAEjB,aAAS/N,IAAI,GAAGA,IAAI4N,EAAa,QAAQ5N,KAAK;AAC5C,MAAA+N,EAAS,KAAKH,EAAa,MAAM5N,GAAGA,IAAI,EAAE,CAAC;AAG7C,WACE0N,IACAM,GAAmB;AAAA,MACjB,CAAC,GAAGT,CAAO,MAAMQ,EAAS,CAAC,CAAC;AAAA,MAC5B,GAAGA,EAAS,MAAM,GAAGF,IAAe,CAAC,EAAE,IAAI,CAACI,MAAY,CAAC,KAAKA,CAAO,CAAC;AAAA,MACtE,CAAC,KAAK,IAAI,SAASH,CAAgB,CAAC;AAAA,MACpC,CAAC,KAAKC,EAASF,IAAe,CAAC,CAAC;AAAA,IACxC,CAAO;AAAA,EAEL;AAEA,SACEH,IACAM,GAAmB;AAAA;AAAA,IAEjB,CAAC,GAAGT,IAAU,CAAC,MAAMI,EAAMN,IAAY,CAAC,CAAC;AAAA,IACzC,CAAC,GAAGE,CAAO,MAAMK,CAAY;AAAA,IAC7B,CAAC,KAAK,IAAI,SAASH,CAAS,CAAC;AAAA,IAC7B,CAAC,GAAGF,IAAU,CAAC,MAAMI,EAAMN,IAAY,CAAC,CAAC;AAAA,EAC/C,CAAK;AAEL;AAEA,SAASW,GAAmBL,GAAO;AACjC,QAAMO,IAAgBP,EAAM,OAAO,CAAC,CAACQ,GAAGtB,CAAI,MAAMA,MAAS,MAAS,GAC9DuB,IAAS,KAAK,IAAI,GAAGF,EAAc,IAAI,CAAC,CAACG,CAAM,MAAMA,EAAO,MAAM,CAAC;AACzE,SAAOH,EACJ,IAAI,CAAC,CAACG,GAAQxB,CAAI,MAAMwB,EAAO,SAASD,CAAM,KAAKvB,IAAO,MAAMA,IAAO,GAAG,EAC1E,KAAK;AAAA,CAAI;AACd;AC1DA,SAASyB,GAAoB5G,GAAM;AACjC,QAAM6G,IAAW7G,EAAK,CAAC;AAEvB,SAAI6G,KAAY,QAAQ,UAAUA,KAAY,YAAYA,IACjD;AAAA,IACL,OAAOA;AAAA,IACP,QAAQ7G,EAAK,CAAC;AAAA,IACd,WAAWA,EAAK,CAAC;AAAA,IACjB,MAAMA,EAAK,CAAC;AAAA,IACZ,eAAeA,EAAK,CAAC;AAAA,IACrB,YAAYA,EAAK,CAAC;AAAA,EACxB,IAGS6G;AACT;AAQO,MAAMC,WAAqB,MAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA8CtC,YAAYpC,MAAYqC,GAAS;AAC/B,QAAIC,GAAaC,GAAiBC;AAElC,UAAM,EAAE,OAAAC,GAAO,QAAAnC,GAAQ,WAAAoC,GAAW,MAAAC,GAAM,eAAAC,GAAe,YAAAC,EAAU,IAC/DX,GAAoBG,CAAO;AAC7B,UAAMrC,CAAO,GACb,KAAK,OAAO,gBACZ,KAAK,OAAO2C,KAA0C,QACtD,KAAK,gBACHC,KAEI,QAEN,KAAK,QAAQE;AAAA,MACX,MAAM,QAAQL,CAAK,IAAIA,IAAQA,IAAQ,CAACA,CAAK,IAAI;AAAA,IACvD;AACI,UAAMM,IAAgBD;AAAA,OACnBR,IAAc,KAAK,WAAW,QAAQA,MAAgB,SACnD,SACAA,EAAY,IAAI,CAACU,MAASA,EAAK,GAAG,EAAE,OAAO,CAACC,MAAQA,KAAO,IAAI;AAAA,IACzE;AAEI,SAAK,SACH3C,MAEIyC,KAAkB,SAEjBR,IAAkBQ,EAAc,CAAC,OAAO,QACzCR,MAAoB,SAFpB,SAIAA,EAAgB,SACtB,KAAK,YACHG,KAIIK,GAAc,IAAI,CAACE,MAAQA,EAAI,KAAK,GAC1C,KAAK,YACHP,KAAapC,IACToC,EAAU,IAAI,CAACQ,MAAQ7C,GAAYC,GAAQ4C,CAAG,CAAC,IAG/CH,GAAc,IAAI,CAACE,MAAQ5C,GAAY4C,EAAI,QAAQA,EAAI,KAAK,CAAC;AACnE,UAAME,IAAqBlD;AAAA,MAGrB2C,GAAc;AAAA,IACxB,IAGUA,GAAc,aAChB;AACJ,SAAK,cACFJ,IACCK,KAEIM,OAAwB,QAAQX,MAAS,SAC3CA,IACA,uBAAO,OAAO,IAAI,GAGxB,OAAO,iBAAiB,MAAM;AAAA,MAC5B,SAAS;AAAA,QACP,UAAU;AAAA,QACV,YAAY;AAAA,MACpB;AAAA,MACM,MAAM;AAAA,QACJ,YAAY;AAAA,MACpB;AAAA,MACM,OAAO;AAAA,QACL,YAAY;AAAA,MACpB;AAAA,MACM,QAAQ;AAAA,QACN,YAAY;AAAA,MACpB;AAAA,MACM,WAAW;AAAA,QACT,YAAY;AAAA,MACpB;AAAA,MACM,eAAe;AAAA,QACb,YAAY;AAAA,MACpB;AAAA,IACA,CAAK,GAMCI,KAAkB,QAElBA,EAAc,QAEd,OAAO,eAAe,MAAM,SAAS;AAAA,MACnC,OAAOA,EAAc;AAAA,MACrB,UAAU;AAAA,MACV,cAAc;AAAA,IACtB,CAAO,IACQ,MAAM,oBACf,MAAM,kBAAkB,MAAMR,EAAY,IAE1C,OAAO,eAAe,MAAM,SAAS;AAAA,MACnC,OAAO,MAAK,EAAG;AAAA,MACf,UAAU;AAAA,MACV,cAAc;AAAA,IACtB,CAAO;AAAA,EAGL;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,WAAW;AACT,QAAIgB,IAAS,KAAK;AAElB,QAAI,KAAK;AACP,iBAAWJ,KAAQ,KAAK;AACtB,QAAIA,EAAK,QACPI,KAAU;AAAA;AAAA,IAASzC,GAAcqC,EAAK,GAAG;AAAA,aAGpC,KAAK,UAAU,KAAK;AAC7B,iBAAWpC,KAAY,KAAK;AAC1B,QAAAwC,KAAU;AAAA;AAAA,IAASvC,GAAoB,KAAK,QAAQD,CAAQ;AAIhE,WAAOwC;AAAA,EACT;AAAA,EAEA,SAAS;AACP,UAAMC,IAAiB;AAAA,MACrB,SAAS,KAAK;AAAA,IACpB;AAEI,WAAI,KAAK,aAAa,SACpBA,EAAe,YAAY,KAAK,YAG9B,KAAK,QAAQ,SACfA,EAAe,OAAO,KAAK,OAGzB,KAAK,cAAc,QAAQ,OAAO,KAAK,KAAK,UAAU,EAAE,SAAS,MACnEA,EAAe,aAAa,KAAK,aAG5BA;AAAA,EACT;AACF;AAEA,SAASP,GAAiBQ,GAAO;AAC/B,SAAOA,MAAU,UAAaA,EAAM,WAAW,IAAI,SAAYA;AACjE;AC/NO,SAASC,EAAYjD,GAAQC,GAAUiD,GAAa;AACzD,SAAO,IAAIpB,GAAa,iBAAiBoB,CAAW,IAAI;AAAA,IACtD,QAAAlD;AAAA,IACA,WAAW,CAACC,CAAQ;AAAA,EACxB,CAAG;AACH;ACPO,MAAMkD,GAAS;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAoBpB,YAAYC,GAAYC,GAAUrD,GAAQ;AACxC,SAAK,QAAQoD,EAAW,OACxB,KAAK,MAAMC,EAAS,KACpB,KAAK,aAAaD,GAClB,KAAK,WAAWC,GAChB,KAAK,SAASrD;AAAA,EAChB;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,WAAO;AAAA,MACL,OAAO,KAAK;AAAA,MACZ,KAAK,KAAK;AAAA,IAChB;AAAA,EACE;AACF;AAMO,MAAMsD,GAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAiCjB,YAAYC,GAAMC,GAAOC,GAAKtD,GAAMuD,GAAQ9D,GAAO;AACjD,SAAK,OAAO2D,GACZ,KAAK,QAAQC,GACb,KAAK,MAAMC,GACX,KAAK,OAAOtD,GACZ,KAAK,SAASuD,GAEd,KAAK,QAAQ9D,GACb,KAAK,OAAO,MACZ,KAAK,OAAO;AAAA,EACd;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA,EAEA,SAAS;AACP,WAAO;AAAA,MACL,MAAM,KAAK;AAAA,MACX,OAAO,KAAK;AAAA,MACZ,MAAM,KAAK;AAAA,MACX,QAAQ,KAAK;AAAA,IACnB;AAAA,EACE;AACF;AAQO,MAAM+D,KAAoB;AAAA,EAC/B,MAAM,CAAA;AAAA,EACN,UAAU,CAAC,aAAa;AAAA,EACxB,qBAAqB;AAAA,IACnB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,oBAAoB;AAAA,IAClB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,UAAU,CAAC,MAAM;AAAA,EACjB,cAAc,CAAC,YAAY;AAAA,EAC3B,OAAO,CAAC,SAAS,QAAQ,aAAa,cAAc,cAAc;AAAA,EAClE,UAAU,CAAC,QAAQ,OAAO;AAAA,EAC1B,gBAAgB,CAAC,QAAQ,YAAY;AAAA,EACrC,gBAAgB,CAAC,iBAAiB,cAAc,cAAc;AAAA,EAC9D,oBAAoB;AAAA,IAClB;AAAA,IACA;AAAA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,UAAU,CAAA;AAAA,EACV,YAAY,CAAA;AAAA,EACZ,aAAa,CAAA;AAAA,EACb,cAAc,CAAA;AAAA,EACd,WAAW,CAAA;AAAA,EACX,WAAW,CAAA;AAAA,EACX,WAAW,CAAC,QAAQ;AAAA,EACpB,aAAa,CAAC,QAAQ;AAAA,EACtB,aAAa,CAAC,QAAQ,OAAO;AAAA,EAC7B,WAAW,CAAC,QAAQ,WAAW;AAAA,EAC/B,WAAW,CAAC,MAAM;AAAA,EAClB,UAAU,CAAC,MAAM;AAAA,EACjB,aAAa,CAAC,MAAM;AAAA,EACpB,kBAAkB,CAAC,eAAe,cAAc,gBAAgB;AAAA,EAChE,yBAAyB,CAAC,MAAM;AAAA,EAChC,sBAAsB,CAAC,eAAe,QAAQ,YAAY;AAAA,EAC1D,sBAAsB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,iBAAiB,CAAC,eAAe,QAAQ,aAAa,QAAQ,YAAY;AAAA,EAC1E,sBAAsB;AAAA,IACpB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,yBAAyB;AAAA,IACvB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACJ;AAAA,EACE,qBAAqB,CAAC,eAAe,QAAQ,cAAc,OAAO;AAAA,EAClE,oBAAoB,CAAC,eAAe,QAAQ,cAAc,QAAQ;AAAA,EAClE,qBAAqB,CAAC,eAAe,QAAQ,YAAY;AAAA,EACzD,2BAA2B,CAAC,eAAe,QAAQ,cAAc,QAAQ;AAAA,EACzE,qBAAqB,CAAC,eAAe,QAAQ,aAAa,WAAW;AAAA,EACrE,iBAAiB,CAAC,cAAc,gBAAgB;AAAA,EAChD,qBAAqB,CAAC,QAAQ,YAAY;AAAA,EAC1C,qBAAqB,CAAC,QAAQ,cAAc,cAAc,QAAQ;AAAA,EAClE,wBAAwB,CAAC,QAAQ,cAAc,cAAc,QAAQ;AAAA,EACrE,oBAAoB,CAAC,QAAQ,cAAc,OAAO;AAAA,EAClD,mBAAmB,CAAC,QAAQ,cAAc,QAAQ;AAAA,EAClD,0BAA0B,CAAC,QAAQ,cAAc,QAAQ;AAAA,EACzD,gBAAgB,CAAC,MAAM;AAAA,EACvB,kBAAkB,CAAC,QAAQ,YAAY;AAAA,EACvC,oBAAoB,CAAC,QAAQ,aAAa,cAAc;AAAA,EACxD,qBAAqB,CAAC,MAAM;AAAA,EAC5B,6BAA6B,CAAC,QAAQ,cAAc;AACtD,GACMC,KAAa,IAAI,IAAI,OAAO,KAAKD,EAAiB,CAAC;AAKlD,SAASE,GAAOC,GAAW;AAChC,QAAMC,IACkDD,GAAU;AAClE,SAAO,OAAOC,KAAc,YAAYH,GAAW,IAAIG,CAAS;AAClE;AAGA,IAAIC;AAAA,CAEH,SAAUA,GAAmB;AAC5B,EAAAA,EAAkB,QAAW,SAC7BA,EAAkB,WAAc,YAChCA,EAAkB,eAAkB;AACtC,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;ACvNhD,IAAIC;AAAA,CAEH,SAAUA,GAAmB;AAC5B,EAAAA,EAAkB,QAAW,SAC7BA,EAAkB,WAAc,YAChCA,EAAkB,eAAkB,gBACpCA,EAAkB,QAAW,SAC7BA,EAAkB,sBAAyB,uBAC3CA,EAAkB,kBAAqB,mBACvCA,EAAkB,kBAAqB,mBACvCA,EAAkB,sBAAyB,uBAC3CA,EAAkB,SAAY,UAC9BA,EAAkB,SAAY,UAC9BA,EAAkB,SAAY,UAC9BA,EAAkB,mBAAsB,oBACxCA,EAAkB,sBAAyB,uBAC3CA,EAAkB,YAAe,aACjCA,EAAkB,QAAW,SAC7BA,EAAkB,OAAU,QAC5BA,EAAkB,aAAgB,cAClCA,EAAkB,eAAkB,gBACpCA,EAAkB,yBAA4B;AAChD,GAAGA,OAAsBA,KAAoB,CAAA,EAAG;ACtBhD,IAAIC;AAAA,CAEH,SAAUA,GAAM;AACf,EAAAA,EAAK,OAAU,QACfA,EAAK,WAAc,YACnBA,EAAK,uBAA0B,uBAC/BA,EAAK,sBAAyB,sBAC9BA,EAAK,gBAAmB,gBACxBA,EAAK,QAAW,SAChBA,EAAK,WAAc,YACnBA,EAAK,kBAAqB,kBAC1BA,EAAK,kBAAqB,kBAC1BA,EAAK,sBAAyB,sBAC9BA,EAAK,WAAc,YACnBA,EAAK,MAAS,YACdA,EAAK,QAAW,cAChBA,EAAK,SAAY,eACjBA,EAAK,UAAa,gBAClBA,EAAK,OAAU,aACfA,EAAK,OAAU,aACfA,EAAK,OAAU,aACfA,EAAK,SAAY,eACjBA,EAAK,eAAkB,eACvBA,EAAK,YAAe,aACpBA,EAAK,aAAgB,aACrBA,EAAK,YAAe,YACpBA,EAAK,gBAAmB,eACxBA,EAAK,oBAAuB,oBAC5BA,EAAK,4BAA+B,2BACpCA,EAAK,yBAA4B,wBACjCA,EAAK,yBAA4B,wBACjCA,EAAK,mBAAsB,mBAC3BA,EAAK,yBAA4B,wBACjCA,EAAK,4BAA+B,2BACpCA,EAAK,wBAA2B,uBAChCA,EAAK,uBAA0B,sBAC/BA,EAAK,wBAA2B,uBAChCA,EAAK,+BAAkC,6BACvCA,EAAK,uBAA0B,uBAC/BA,EAAK,mBAAsB,mBAC3BA,EAAK,wBAA2B,uBAChCA,EAAK,wBAA2B,uBAChCA,EAAK,2BAA8B,0BACnCA,EAAK,uBAA0B,sBAC/BA,EAAK,sBAAyB,qBAC9BA,EAAK,8BAAiC,4BACtCA,EAAK,kBAAqB,kBAC1BA,EAAK,oBAAuB,oBAC5BA,EAAK,sBAAyB,sBAC9BA,EAAK,uBAA0B,uBAC/BA,EAAK,gCAAmC;AAC1C,GAAGA,MAASA,IAAO,CAAA,EAAG;AC9Cf,SAASC,GAAaC,GAAM;AACjC,SAAOA,MAAS,KAAUA,MAAS;AACrC;AASO,SAASC,GAAQD,GAAM;AAC5B,SAAOA,KAAQ,MAAUA,KAAQ;AACnC;AAYO,SAASE,GAASF,GAAM;AAC7B,SACGA,KAAQ,MAAUA,KAAQ;AAAA,EAC1BA,KAAQ,MAAUA,KAAQ;AAE/B;AAUO,SAASG,GAAYH,GAAM;AAChC,SAAOE,GAASF,CAAI,KAAKA,MAAS;AACpC;AAWO,SAASI,GAAeJ,GAAM;AACnC,SAAOE,GAASF,CAAI,KAAKC,GAAQD,CAAI,KAAKA,MAAS;AACrD;ACrDO,SAASK,GAAuBxD,GAAO;AAC5C,MAAIyD;AAEJ,MAAIC,IAAe,OAAO,kBACtBC,IAAoB,MACpBC,IAAmB;AAEvB,WAASvR,IAAI,GAAGA,IAAI2N,EAAM,QAAQ,EAAE3N,GAAG;AACrC,QAAIwR;AAEJ,UAAM3E,IAAOc,EAAM3N,CAAC,GACdyR,IAASC,GAAkB7E,CAAI;AAErC,IAAI4E,MAAW5E,EAAK,WAIpByE,KACGE,IAAqBF,OAAuB,QAC7CE,MAAuB,SACnBA,IACAxR,GACNuR,IAAmBvR,GAEfA,MAAM,KAAKyR,IAASJ,MACtBA,IAAeI;AAAA,EAEnB;AAEA,SAAO9D,EACJ,IAAI,CAACd,GAAM7M,MAAOA,MAAM,IAAI6M,IAAOA,EAAK,MAAMwE,CAAY,CAAE,EAC5D;AAAA,KACED,IAAsBE,OAAuB,QAC5CF,MAAwB,SACtBA,IACA;AAAA,IACJG,IAAmB;AAAA,EACzB;AACA;AAEA,SAASG,GAAkBzN,GAAK;AAC9B,MAAIjE,IAAI;AAER,SAAOA,IAAIiE,EAAI,UAAU4M,GAAa5M,EAAI,WAAWjE,CAAC,CAAC;AACrD,MAAEA;AAGJ,SAAOA;AACT;AAgFO,SAAS2R,GAAiBrF,GAAOsF,GAAS;AAC/C,QAAMC,IAAevF,EAAM,QAAQ,QAAQ,OAAO,GAE5CqB,IAAQkE,EAAa,MAAM,cAAc,GACzCC,IAAenE,EAAM,WAAW,GAEhCoE,IACJpE,EAAM,SAAS,KACfA,EACG,MAAM,CAAC,EACP,MAAM,CAACd,MAASA,EAAK,WAAW,KAAKgE,GAAahE,EAAK,WAAW,CAAC,CAAC,CAAC,GAEpEmF,IAA0BH,EAAa,SAAS,OAAO,GAEvDI,IAAmB3F,EAAM,SAAS,GAAG,KAAK,CAAC0F,GAC3CE,IAAmB5F,EAAM,SAAS,IAAI,GACtC6F,IAAuBF,KAAoBC,GAC3CE;AAAA;AAAA,IAEH,CAACN,KACAxF,EAAM,SAAS,MACf6F,KACAJ,KACAC;AAAA;AACJ,MAAIK,IAAS;AAEb,QAAMC,IAAqBR,KAAgBjB,GAAavE,EAAM,WAAW,CAAC,CAAC;AAE3E,UAAK8F,KAAwB,CAACE,KAAuBP,OACnDM,KAAU;AAAA,IAGZA,KAAUR,IAENO,KAAwBD,OAC1BE,KAAU;AAAA,IAGL,QAAQA,IAAS;AAC1B;AC7KA,IAAIE;AAAA,CAEH,SAAUA,GAAW;AACpB,EAAAA,EAAU,MAAS,SACnBA,EAAU,MAAS,SACnBA,EAAU,OAAU,KACpBA,EAAU,SAAY,KACtBA,EAAU,MAAS,KACnBA,EAAU,UAAa,KACvBA,EAAU,UAAa,KACvBA,EAAU,MAAS,KACnBA,EAAU,SAAY,OACtBA,EAAU,QAAW,KACrBA,EAAU,SAAY,KACtBA,EAAU,KAAQ,KAClBA,EAAU,YAAe,KACzBA,EAAU,YAAe,KACzBA,EAAU,UAAa,KACvBA,EAAU,OAAU,KACpBA,EAAU,UAAa,KACvBA,EAAU,OAAU,QACpBA,EAAU,MAAS,OACnBA,EAAU,QAAW,SACrBA,EAAU,SAAY,UACtBA,EAAU,eAAkB,eAC5BA,EAAU,UAAa;AACzB,GAAGA,MAAcA,IAAY,CAAA,EAAG;ACVzB,MAAMC,GAAM;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAgBjB,YAAY9F,GAAQ;AAClB,UAAM+F,IAAmB,IAAIzC,GAAMuC,EAAU,KAAK,GAAG,GAAG,GAAG,CAAC;AAC5D,SAAK,SAAS7F,GACd,KAAK,YAAY+F,GACjB,KAAK,QAAQA,GACb,KAAK,OAAO,GACZ,KAAK,YAAY;AAAA,EACnB;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,UAAU;AACR,gBAAK,YAAY,KAAK,OACP,KAAK,QAAQ,KAAK,UAAS;AAAA,EAE5C;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAY;AACV,QAAIC,IAAQ,KAAK;AAEjB,QAAIA,EAAM,SAASH,EAAU;AAC3B;AACE,YAAIG,EAAM;AACR,UAAAA,IAAQA,EAAM;AAAA,aACT;AAEL,gBAAMC,IAAYC,GAAc,MAAMF,EAAM,GAAG;AAE/C,UAAAA,EAAM,OAAOC,GAEbA,EAAU,OAAOD,GACjBA,IAAQC;AAAA,QACV;AAAA,aACOD,EAAM,SAASH,EAAU;AAGpC,WAAOG;AAAA,EACT;AACF;AAKO,SAASG,GAAsB5C,GAAM;AAC1C,SACEA,MAASsC,EAAU,QACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,OACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,OACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,SACnBtC,MAASsC,EAAU,UACnBtC,MAASsC,EAAU,MACnBtC,MAASsC,EAAU,aACnBtC,MAASsC,EAAU,aACnBtC,MAASsC,EAAU,WACnBtC,MAASsC,EAAU,QACnBtC,MAASsC,EAAU;AAEvB;AAUA,SAASO,GAAqBhC,GAAM;AAClC,SACGA,KAAQ,KAAUA,KAAQ,SAAYA,KAAQ,SAAUA,KAAQ;AAErE;AAUA,SAASiC,GAAyB3F,GAAMJ,GAAU;AAChD,SACEgG,GAAmB5F,EAAK,WAAWJ,CAAQ,CAAC,KAC5CiG,GAAoB7F,EAAK,WAAWJ,IAAW,CAAC,CAAC;AAErD;AAEA,SAASgG,GAAmBlC,GAAM;AAChC,SAAOA,KAAQ,SAAUA,KAAQ;AACnC;AAEA,SAASmC,GAAoBnC,GAAM;AACjC,SAAOA,KAAQ,SAAUA,KAAQ;AACnC;AAWO,SAASoC,GAAiBC,GAAOnG,GAAU;AAChD,QAAM8D,IAAOqC,EAAM,OAAO,KAAK,YAAYnG,CAAQ;AAEnD,MAAI8D,MAAS;AACX,WAAOyB,EAAU;AACZ,MAAIzB,KAAQ,MAAUA,KAAQ,KAAQ;AAE3C,UAAMsC,IAAO,OAAO,cAActC,CAAI;AACtC,WAAOsC,MAAS,MAAM,QAAS,IAAIA,CAAI;AAAA,EACzC;AAEA,SAAO,OAAOtC,EAAK,SAAS,EAAE,EAAE,cAAc,SAAS,GAAG,GAAG;AAC/D;AAOO,SAASuC,EAAYF,GAAOlD,GAAMC,GAAOC,GAAK7D,GAAO;AAC1D,QAAMO,IAAOsG,EAAM,MACbG,IAAM,IAAIpD,IAAQiD,EAAM;AAC9B,SAAO,IAAInD,GAAMC,GAAMC,GAAOC,GAAKtD,GAAMyG,GAAKhH,CAAK;AACrD;AASA,SAASsG,GAAcO,GAAOjD,GAAO;AACnC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD;AAEf,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,YAAQmE,GAAI;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAeV,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAAA;AAAA,MAEL,KAAK;AAEH,UAAEnE;AACF;AAAA;AAAA;AAAA;AAAA;AAAA,MAMF,KAAK;AAEH,UAAEA,GACF,EAAEwG,EAAM,MACRA,EAAM,YAAYxG;AAClB;AAAA,MAEF,KAAK;AAEH,QAAIS,EAAK,WAAWT,IAAW,CAAC,MAAM,KACpCA,KAAY,IAEZ,EAAEA,GAGJ,EAAEwG,EAAM,MACRA,EAAM,YAAYxG;AAClB;AAAA;AAAA,MAGF,KAAK;AAEH,eAAO6G,GAAYL,GAAOxG,CAAQ;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,MAUpC,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,MAAM5F,GAAUA,IAAW,CAAC;AAAA,MAElE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAAA,MAEpE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,KAAK5F,GAAUA,IAAW,CAAC;AAAA,MAEjE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,YACES,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM;AAElC,iBAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAGpE;AAAA,MAEF,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,OAAO5F,GAAUA,IAAW,CAAC;AAAA,MAEnE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,QAAQ5F,GAAUA,IAAW,CAAC;AAAA,MAEpE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,IAAI5F,GAAUA,IAAW,CAAC;AAAA,MAEhE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,WAAW5F,GAAUA,IAAW,CAAC;AAAA,MAEvE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,WAAW5F,GAAUA,IAAW,CAAC;AAAA,MAEvE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA,MAErE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,MAAM5F,GAAUA,IAAW,CAAC;AAAA,MAElE,KAAK;AAEH,eAAO0G,EAAYF,GAAOZ,EAAU,SAAS5F,GAAUA,IAAW,CAAC;AAAA;AAAA,MAGrE,KAAK;AAEH,eACES,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,KAE3B8G,GAAgBN,GAAOxG,CAAQ,IAGjC+G,GAAWP,GAAOxG,CAAQ;AAAA,IACzC;AAEI,QAAIoE,GAAQD,CAAI,KAAKA,MAAS;AAC5B,aAAO6C,GAAWR,GAAOxG,GAAUmE,CAAI;AAGzC,QAAIG,GAAYH,CAAI;AAClB,aAAO8C,GAAST,GAAOxG,CAAQ;AAGjC,UAAMgD;AAAA,MACJwD,EAAM;AAAA,MACNxG;AAAA,MACAmE,MAAS,KACL,mFACAgC,GAAqBhC,CAAI,KAAKiC,GAAyB3F,GAAMT,CAAQ,IACrE,yBAAyBuG,GAAiBC,GAAOxG,CAAQ,CAAC,MAC1D,sBAAsBuG,GAAiBC,GAAOxG,CAAQ,CAAC;AAAA,IACjE;AAAA,EACE;AAEA,SAAO0G,EAAYF,GAAOZ,EAAU,KAAKgB,GAAYA,CAAU;AACjE;AAWA,SAASC,GAAYL,GAAOjD,GAAO;AACjC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ;AAEvB,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAImE,MAAS,MAAUA,MAAS;AAC9B;AAGF,QAAIgC,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ;AAAA,EAEJ;AAEA,SAAO0G;AAAA,IACLF;AAAA,IACAZ,EAAU;AAAA,IACVrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,IAAQ,GAAGvD,CAAQ;AAAA,EAClC;AACA;AA+BA,SAASgH,GAAWR,GAAOjD,GAAO2D,GAAW;AAC3C,QAAMzG,IAAO+F,EAAM,OAAO;AAC1B,MAAIxG,IAAWuD,GACXY,IAAO+C,GACPxL,IAAU;AAMd,MAJIyI,MAAS,OACXA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAG/BmE,MAAS;AAGX,QAFAA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,GAE7BoE,GAAQD,CAAI;AACd,YAAMnB;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,6CAA6CuG;AAAA,UAC3CC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA;AAGI,IAAAA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ;AAsBjC,MAnBImE,MAAS,OACXzI,IAAU,IACVyI,IAAO1D,EAAK,WAAW,EAAET,CAAQ,GACjCA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ,KAG7BmE,MAAS,MAAUA,MAAS,SAC9BzI,IAAU,IACVyI,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAE7BmE,MAAS,MAAUA,MAAS,QAC9BA,IAAO1D,EAAK,WAAW,EAAET,CAAQ,IAGnCA,IAAWmH,GAAWX,GAAOxG,GAAUmE,CAAI,GAC3CA,IAAO1D,EAAK,WAAWT,CAAQ,IAG7BmE,MAAS,MAAUG,GAAYH,CAAI;AACrC,UAAMnB;AAAA,MACJwD,EAAM;AAAA,MACNxG;AAAA,MACA,2CAA2CuG;AAAA,QACzCC;AAAA,QACAxG;AAAA,MACR,CAAO;AAAA,IACP;AAGE,SAAO0G;AAAA,IACLF;AAAA,IACA9K,IAAUkK,EAAU,QAAQA,EAAU;AAAA,IACtCrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,GAAOvD,CAAQ;AAAA,EAC9B;AACA;AAKA,SAASmH,GAAWX,GAAOjD,GAAO2D,GAAW;AAC3C,MAAI,CAAC9C,GAAQ8C,CAAS;AACpB,UAAMlE;AAAA,MACJwD,EAAM;AAAA,MACNjD;AAAA,MACA,2CAA2CgD;AAAA,QACzCC;AAAA,QACAjD;AAAA,MACR,CAAO;AAAA,IACP;AAGE,QAAM9C,IAAO+F,EAAM,OAAO;AAC1B,MAAIxG,IAAWuD,IAAQ;AAEvB,SAAOa,GAAQ3D,EAAK,WAAWT,CAAQ,CAAC;AACtC,MAAEA;AAGJ,SAAOA;AACT;AAsBA,SAAS+G,GAAWP,GAAOjD,GAAO;AAChC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ,GACnB6D,IAAapH,GACbL,IAAQ;AAEZ,SAAOK,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAImE,MAAS;AACX,aAAAxE,KAASc,EAAK,MAAM2G,GAAYpH,CAAQ,GACjC0G,EAAYF,GAAOZ,EAAU,QAAQrC,GAAOvD,IAAW,GAAGL,CAAK;AAGxE,QAAIwE,MAAS,IAAQ;AACnB,MAAAxE,KAASc,EAAK,MAAM2G,GAAYpH,CAAQ;AACxC,YAAMqH,IACJ5G,EAAK,WAAWT,IAAW,CAAC,MAAM,MAC9BS,EAAK,WAAWT,IAAW,CAAC,MAAM,MAChCsH,GAAgCd,GAAOxG,CAAQ,IAC/CuH,GAA6Bf,GAAOxG,CAAQ,IAC9CwH,GAAqBhB,GAAOxG,CAAQ;AAC1C,MAAAL,KAAS0H,EAAO,OAChBrH,KAAYqH,EAAO,MACnBD,IAAapH;AACb;AAAA,IACF;AAEA,QAAImE,MAAS,MAAUA,MAAS;AAC9B;AAGF,QAAIgC,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ,YAAMgD;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,oCAAoCuG;AAAA,UAClCC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA,EAEE;AAEA,QAAMgD,EAAYwD,EAAM,QAAQxG,GAAU,sBAAsB;AAClE;AAEA,SAASsH,GAAgCd,GAAOxG,GAAU;AACxD,QAAMS,IAAO+F,EAAM,OAAO;AAC1B,MAAIiB,IAAQ,GACRC,IAAO;AAEX,SAAOA,IAAO,MAAI;AAChB,UAAMvD,IAAO1D,EAAK,WAAWT,IAAW0H,GAAM;AAE9C,QAAIvD,MAAS,KAAQ;AAEnB,UAAIuD,IAAO,KAAK,CAACvB,GAAqBsB,CAAK;AACzC;AAGF,aAAO;AAAA,QACL,OAAO,OAAO,cAAcA,CAAK;AAAA,QACjC,MAAAC;AAAA,MACR;AAAA,IACI;AAIA,QAFAD,IAASA,KAAS,IAAKE,GAAaxD,CAAI,GAEpCsD,IAAQ;AACV;AAAA,EAEJ;AAEA,QAAMzE;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,qCAAqCS,EAAK;AAAA,MACxCT;AAAA,MACAA,IAAW0H;AAAA,IACjB,CAAK;AAAA,EACL;AACA;AAEA,SAASH,GAA6Bf,GAAOxG,GAAU;AACrD,QAAMS,IAAO+F,EAAM,OAAO,MACpBrC,IAAOyD,GAAiBnH,GAAMT,IAAW,CAAC;AAEhD,MAAImG,GAAqBhC,CAAI;AAC3B,WAAO;AAAA,MACL,OAAO,OAAO,cAAcA,CAAI;AAAA,MAChC,MAAM;AAAA,IACZ;AAIE,MAAIkC,GAAmBlC,CAAI,KAGvB1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,KAClC;AACA,UAAM6H,IAAeD,GAAiBnH,GAAMT,IAAW,CAAC;AAExD,QAAIsG,GAAoBuB,CAAY;AAOlC,aAAO;AAAA,QACL,OAAO,OAAO,cAAc1D,GAAM0D,CAAY;AAAA,QAC9C,MAAM;AAAA,MAChB;AAAA,EAEI;AAGF,QAAM7E;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,qCAAqCS,EAAK,MAAMT,GAAUA,IAAW,CAAC,CAAC;AAAA,EAC3E;AACA;AASA,SAAS4H,GAAiBnH,GAAMT,GAAU;AAGxC,SACG2H,GAAalH,EAAK,WAAWT,CAAQ,CAAC,KAAK,KAC3C2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC,KAAK,IAC/C2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC,KAAK,IAChD2H,GAAalH,EAAK,WAAWT,IAAW,CAAC,CAAC;AAE9C;AAgBA,SAAS2H,GAAaxD,GAAM;AAC1B,SAAOA,KAAQ,MAAUA,KAAQ,KAC7BA,IAAO,KACPA,KAAQ,MAAUA,KAAQ,KAC1BA,IAAO,KACPA,KAAQ,MAAUA,KAAQ,MAC1BA,IAAO,KACP;AACN;AAcA,SAASqD,GAAqBhB,GAAOxG,GAAU;AAC7C,QAAMS,IAAO+F,EAAM,OAAO;AAG1B,UAFa/F,EAAK,WAAWT,IAAW,CAAC,GAE7B;AAAA,IACV,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,IAEI,KAAK;AAEH,aAAO;AAAA,QACL,OAAO;AAAA,QACP,MAAM;AAAA,MACd;AAAA,EACA;AAEE,QAAMgD;AAAA,IACJwD,EAAM;AAAA,IACNxG;AAAA,IACA,uCAAuCS,EAAK;AAAA,MAC1CT;AAAA,MACAA,IAAW;AAAA,IACjB,CAAK;AAAA,EACL;AACA;AAcA,SAAS8G,GAAgBN,GAAOjD,GAAO;AACrC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIqH,IAAYtB,EAAM,WAClBxG,IAAWuD,IAAQ,GACnB6D,IAAapH,GACb+H,IAAc;AAClB,QAAMC,IAAa,CAAA;AAEnB,SAAOhI,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QACEmE,MAAS,MACT1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,IAClC;AACA,MAAA+H,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CgI,EAAW,KAAKD,CAAW;AAC3B,YAAMhC,IAAQW;AAAA,QACZF;AAAA,QACAZ,EAAU;AAAA,QACVrC;AAAA,QACAvD,IAAW;AAAA;AAAA,QACXwE,GAAuBwD,CAAU,EAAE,KAAK;AAAA,CAAI;AAAA,MACpD;AACM,aAAAxB,EAAM,QAAQwB,EAAW,SAAS,GAClCxB,EAAM,YAAYsB,GACX/B;AAAA,IACT;AAEA,QACE5B,MAAS,MACT1D,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,MAClCS,EAAK,WAAWT,IAAW,CAAC,MAAM,IAClC;AACA,MAAA+H,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CoH,IAAapH,IAAW,GAExBA,KAAY;AACZ;AAAA,IACF;AAEA,QAAImE,MAAS,MAAUA,MAAS,IAAQ;AACtC,MAAA4D,KAAetH,EAAK,MAAM2G,GAAYpH,CAAQ,GAC9CgI,EAAW,KAAKD,CAAW,GAEvB5D,MAAS,MAAU1D,EAAK,WAAWT,IAAW,CAAC,MAAM,KACvDA,KAAY,IAEZ,EAAEA,GAGJ+H,IAAc,IACdX,IAAapH,GACb8H,IAAY9H;AACZ;AAAA,IACF;AAEA,QAAImG,GAAqBhC,CAAI;AAC3B,QAAEnE;AAAA,aACOoG,GAAyB3F,GAAMT,CAAQ;AAChD,MAAAA,KAAY;AAAA;AAEZ,YAAMgD;AAAA,QACJwD,EAAM;AAAA,QACNxG;AAAA,QACA,oCAAoCuG;AAAA,UAClCC;AAAA,UACAxG;AAAA,QACV,CAAS;AAAA,MACT;AAAA,EAEE;AAEA,QAAMgD,EAAYwD,EAAM,QAAQxG,GAAU,sBAAsB;AAClE;AAYO,SAASiH,GAAST,GAAOjD,GAAO;AACrC,QAAM9C,IAAO+F,EAAM,OAAO,MACpBI,IAAanG,EAAK;AACxB,MAAIT,IAAWuD,IAAQ;AAEvB,SAAOvD,IAAW4G,KAAY;AAC5B,UAAMzC,IAAO1D,EAAK,WAAWT,CAAQ;AAErC,QAAIuE,GAAeJ,CAAI;AACrB,QAAEnE;AAAA;AAEF;AAAA,EAEJ;AAEA,SAAO0G;AAAA,IACLF;AAAA,IACAZ,EAAU;AAAA,IACVrC;AAAA,IACAvD;AAAA,IACAS,EAAK,MAAM8C,GAAOvD,CAAQ;AAAA,EAC9B;AACA;ACl5BA,MAAMiI,KAAmB,IACnBC,KAAsB;AAKrB,SAASC,GAAQxI,GAAO;AAC7B,SAAOyI,GAAYzI,GAAO,EAAE;AAC9B;AAEA,SAASyI,GAAYzI,GAAO0I,GAAY;AACtC,UAAQ,OAAO1I,GAAK;AAAA,IAClB,KAAK;AACH,aAAO,KAAK,UAAUA,CAAK;AAAA,IAE7B,KAAK;AACH,aAAOA,EAAM,OAAO,aAAaA,EAAM,IAAI,MAAM;AAAA,IAEnD,KAAK;AACH,aAAO2I,GAAkB3I,GAAO0I,CAAU;AAAA,IAE5C;AACE,aAAO,OAAO1I,CAAK;AAAA,EACzB;AACA;AAEA,SAAS2I,GAAkB3I,GAAO4I,GAAsB;AACtD,MAAI5I,MAAU;AACZ,WAAO;AAGT,MAAI4I,EAAqB,SAAS5I,CAAK;AACrC,WAAO;AAGT,QAAM0I,IAAa,CAAC,GAAGE,GAAsB5I,CAAK;AAElD,MAAI6I,GAAW7I,CAAK,GAAG;AACrB,UAAM8I,IAAY9I,EAAM;AAExB,QAAI8I,MAAc9I;AAChB,aAAO,OAAO8I,KAAc,WACxBA,IACAL,GAAYK,GAAWJ,CAAU;AAAA,EAEzC,WAAW,MAAM,QAAQ1I,CAAK;AAC5B,WAAO+I,GAAY/I,GAAO0I,CAAU;AAGtC,SAAOM,GAAahJ,GAAO0I,CAAU;AACvC;AAEA,SAASG,GAAW7I,GAAO;AACzB,SAAO,OAAOA,EAAM,UAAW;AACjC;AAEA,SAASgJ,GAAaC,GAAQP,GAAY;AACxC,QAAMQ,IAAU,OAAO,QAAQD,CAAM;AAErC,SAAIC,EAAQ,WAAW,IACd,OAGLR,EAAW,SAASH,KACf,MAAMY,GAAaF,CAAM,IAAI,MAM/B,OAHYC,EAAQ;AAAA,IACzB,CAAC,CAACE,GAAKpJ,CAAK,MAAMoJ,IAAM,OAAOX,GAAYzI,GAAO0I,CAAU;AAAA,EAChE,EAC2B,KAAK,IAAI,IAAI;AACxC;AAEA,SAASK,GAAY3F,GAAOsF,GAAY;AACtC,MAAItF,EAAM,WAAW;AACnB,WAAO;AAGT,MAAIsF,EAAW,SAASH;AACtB,WAAO;AAGT,QAAMrT,IAAM,KAAK,IAAIoT,IAAkBlF,EAAM,MAAM,GAC7CiG,IAAYjG,EAAM,SAASlO,GAC3BoU,IAAQ,CAAA;AAEd,WAAS5V,IAAI,GAAGA,IAAIwB,GAAK,EAAExB;AACzB,IAAA4V,EAAM,KAAKb,GAAYrF,EAAM1P,CAAC,GAAGgV,CAAU,CAAC;AAG9C,SAAIW,MAAc,IAChBC,EAAM,KAAK,iBAAiB,IACnBD,IAAY,KACrBC,EAAM,KAAK,OAAOD,CAAS,aAAa,GAGnC,MAAMC,EAAM,KAAK,IAAI,IAAI;AAClC;AAEA,SAASH,GAAaF,GAAQ;AAC5B,QAAM3W,IAAM,OAAO,UAAU,SAC1B,KAAK2W,CAAM,EACX,QAAQ,cAAc,EAAE,EACxB,QAAQ,MAAM,EAAE;AAEnB,MAAI3W,MAAQ,YAAY,OAAO2W,EAAO,eAAgB,YAAY;AAChE,UAAMM,IAAON,EAAO,YAAY;AAEhC,QAAI,OAAOM,KAAS,YAAYA,MAAS;AACvC,aAAOA;AAAA,EAEX;AAEA,SAAOjX;AACT;AC/GA,MAAMkX,KACJ,WAAW;AACX,QAAQ,IAAI,aAAa,cAQdC;AAAA;AAAA;AAAA,EAGXD,KACI,SAAoBxJ,GAAO0J,GAAa;AACtC,WAAO1J,aAAiB0J;AAAA,EAC1B,IACA,SAAoB1J,GAAO0J,GAAa;AACtC,QAAI1J,aAAiB0J;AACnB,aAAO;AAGT,QAAI,OAAO1J,KAAU,YAAYA,MAAU,MAAM;AAC/C,UAAI2J;AAGJ,YAAMC,IAAYF,EAAY,UAAU,OAAO,WAAW,GACpDG;AAAA;AAAA,QACJ,OAAO,eAAe7J,IAClBA,EAAM,OAAO,WAAW,KACvB2J,IAAqB3J,EAAM,iBAAiB,QAC7C2J,MAAuB,SACvB,SACAA,EAAmB;AAAA;AAEzB,UAAIC,MAAcC,GAAgB;AAChC,cAAMC,IAAmBtB,GAAQxI,CAAK;AACtC,cAAM,IAAI,MAAM,cAAc4J,CAAS,KAAKE,CAAgB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,kBAWtD;AAAA,MACR;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAAA;AC7CC,MAAMC,GAAO;AAAA,EAClB,YACEjJ,GACAyI,IAAO,mBACPS,IAAiB;AAAA,IACf,MAAM;AAAA,IACN,QAAQ;AAAA,EACd,GACI;AACA,WAAOlJ,KAAS,YACdlB,GAAU,IAAO,oCAAoC4I,GAAQ1H,CAAI,CAAC,GAAG,GACvE,KAAK,OAAOA,GACZ,KAAK,OAAOyI,GACZ,KAAK,iBAAiBS,GACtB,KAAK,eAAe,OAAO,KACzBpK;AAAA,MACE;AAAA,MACA;AAAA,IACR,GACI,KAAK,eAAe,SAAS,KAC3BA;AAAA,MACE;AAAA,MACA;AAAA,IACR;AAAA,EACE;AAAA,EAEA,KAAK,OAAO,WAAW,IAAI;AACzB,WAAO;AAAA,EACT;AACF;AAOO,SAASqK,GAAS7J,GAAQ;AAC/B,SAAOqJ,GAAWrJ,GAAQ2J,EAAM;AAClC;ACjCO,SAASG,GAAM9J,GAAQkF,GAAS;AACrC,QAAM6E,IAAS,IAAIC,GAAOhK,GAAQkF,CAAO,GACnC+E,IAAWF,EAAO,cAAa;AACrC,gBAAO,eAAeE,GAAU,cAAc;AAAA,IAC5C,YAAY;AAAA,IACZ,OAAOF,EAAO;AAAA,EAClB,CAAG,GACME;AACT;AAkFO,MAAMD,GAAO;AAAA,EAClB,YAAYhK,GAAQkF,IAAU,IAAI;AAChC,UAAM,EAAE,OAAAuB,GAAO,GAAGyD,EAAQ,IAAKhF;AAE/B,QAAIuB;AACF,WAAK,SAASA;AAAA,SACT;AACL,YAAM0D,IAAYN,GAAS7J,CAAM,IAAIA,IAAS,IAAI2J,GAAO3J,CAAM;AAC/D,WAAK,SAAS,IAAI8F,GAAMqE,CAAS;AAAA,IACnC;AAEA,SAAK,WAAWD,GAChB,KAAK,gBAAgB;AAAA,EACvB;AAAA,EAEA,IAAI,aAAa;AACf,WAAO,KAAK;AAAA,EACd;AAAA;AAAA;AAAA;AAAA,EAKA,YAAY;AACV,UAAMlE,IAAQ,KAAK,YAAYH,EAAU,IAAI;AAC7C,WAAO,KAAK,KAAKG,GAAO;AAAA,MACtB,MAAM9B,EAAK;AAAA,MACX,OAAO8B,EAAM;AAAA,IACnB,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgB;AACd,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAM9B,EAAK;AAAA,MACX,aAAa,KAAK;AAAA,QAChB2B,EAAU;AAAA,QACV,KAAK;AAAA,QACLA,EAAU;AAAA,MAClB;AAAA,IACA,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAyBA,kBAAkB;AAChB,QAAI,KAAK,KAAKA,EAAU,OAAO;AAC7B,aAAO,KAAK,yBAAwB;AAGtC,UAAMuE,IAAiB,KAAK,gBAAe,GACrCC,IAAeD,IACjB,KAAK,OAAO,UAAS,IACrB,KAAK,OAAO;AAEhB,QAAIA,KAAkBC,EAAa,SAASxE,EAAU;AACpD,YAAM5C;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ,KAAK,OAAO,MAAM;AAAA,QAClB;AAAA,MACR;AAGI,QAAIoH,EAAa,SAASxE,EAAU,MAAM;AACxC,cAAQwE,EAAa,OAAK;AAAA,QACxB,KAAK;AACH,iBAAO,KAAK,sBAAqB;AAAA,QAEnC,KAAK;AACH,iBAAO,KAAK,0BAAyB;AAAA,QAEvC,KAAK;AACH,iBAAO,KAAK,0BAAyB;AAAA,QAEvC,KAAK;AACH,iBAAO,KAAK,6BAA4B;AAAA,QAE1C,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,QAErC,KAAK;AACH,iBAAO,KAAK,+BAA8B;AAAA,QAE5C,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,MAC9C;AAEM,cAAQA,EAAa,OAAK;AAAA,QACxB,KAAK;AAAA,QACL,KAAK;AAAA,QACL,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,MAC7C;AAEM,UAAID;AACF,cAAMnH;AAAA,UACJ,KAAK,OAAO;AAAA,UACZ,KAAK,OAAO,MAAM;AAAA,UAClB;AAAA,QACV;AAGM,UAAQoH,EAAa,UACd;AACH,eAAO,KAAK,yBAAwB;AAAA,IAE1C;AAEA,UAAM,KAAK,WAAWA,CAAY;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAM7G,IAAQ,KAAK,OAAO;AAE1B,QAAI,KAAK,KAAKqC,EAAU,OAAO;AAC7B,aAAO,KAAK,KAAKrC,GAAO;AAAA,QACtB,MAAMU,EAAK;AAAA,QACX,WAAWF,GAAkB;AAAA,QAC7B,aAAa;AAAA,QACb,MAAM;AAAA,QACN,qBAAqB,CAAA;AAAA,QACrB,YAAY,CAAA;AAAA,QACZ,cAAc,KAAK,kBAAiB;AAAA,MAC5C,CAAO;AAGH,UAAMd,IAAc,KAAK,iBAAgB,GACnCoH,IAAY,KAAK,mBAAkB;AACzC,QAAInB;AAEJ,WAAI,KAAK,KAAKtD,EAAU,IAAI,MAC1BsD,IAAO,KAAK,UAAS,IAGhB,KAAK,KAAK3F,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,WAAAoG;AAAA,MACA,aAAApH;AAAA,MACA,MAAAiG;AAAA,MACA,qBAAqB,KAAK,yBAAwB;AAAA,MAClD,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB;AACnB,UAAMoB,IAAiB,KAAK,YAAY1E,EAAU,IAAI;AAEtD,YAAQ0E,EAAe,OAAK;AAAA,MAC1B,KAAK;AACH,eAAOvG,GAAkB;AAAA,MAE3B,KAAK;AACH,eAAOA,GAAkB;AAAA,MAE3B,KAAK;AACH,eAAOA,GAAkB;AAAA,IACjC;AAEI,UAAM,KAAK,WAAWuG,CAAc;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA,EAKA,2BAA2B;AACzB,WAAO,KAAK;AAAA,MACV1E,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA,EAKA,0BAA0B;AACxB,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAM3B,EAAK;AAAA,MACX,aAAa,KAAK,iBAAgB;AAAA,MAClC,UAAU,KAAK,cAAa;AAAA,MAC5B,OAAO,KAAK,YAAY2B,EAAU,KAAK,GAAG,KAAK;MAC/C,cAAc,KAAK,oBAAoBA,EAAU,MAAM,IACnD,KAAK,uBAAsB,IAC3B;AAAA,MACJ,YAAY,KAAK,qBAAoB;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,gBAAgB;AACd,UAAMrC,IAAQ,KAAK,OAAO;AAC1B,gBAAK,YAAYqC,EAAU,MAAM,GAC1B,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,IAC1B,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,oBAAoB;AAClB,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMA,EAAK;AAAA,MACX,YAAY,KAAK;AAAA,QACf2B,EAAU;AAAA,QACV,KAAK;AAAA,QACLA,EAAU;AAAA,MAClB;AAAA,IACA,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,iBAAiB;AACf,WAAO,KAAK,KAAKA,EAAU,MAAM,IAC7B,KAAK,cAAa,IAClB,KAAK,WAAU;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,aAAa;AACX,UAAMrC,IAAQ,KAAK,OAAO,OACpBgH,IAAc,KAAK,UAAS;AAClC,QAAIC,GACAtB;AAEJ,WAAI,KAAK,oBAAoBtD,EAAU,KAAK,KAC1C4E,IAAQD,GACRrB,IAAO,KAAK,UAAS,KAErBA,IAAOqB,GAGF,KAAK,KAAKhH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,OAAAuG;AAAA,MACA,MAAAtB;AAAA,MACA,WAAW,KAAK,eAAe,EAAK;AAAA,MACpC,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,KAAKtD,EAAU,OAAO,IACrC,KAAK,kBAAiB,IACtB;AAAA,IACV,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,eAAe6E,GAAS;AACtB,UAAMC,IAAOD,IAAU,KAAK,qBAAqB,KAAK;AACtD,WAAO,KAAK,aAAa7E,EAAU,SAAS8E,GAAM9E,EAAU,OAAO;AAAA,EACrE;AAAA;AAAA;AAAA;AAAA,EAKA,cAAc6E,IAAU,IAAO;AAC7B,UAAMlH,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAC3B,gBAAK,YAAYtD,EAAU,KAAK,GACzB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,OAAO,KAAK,kBAAkBuB,CAAO;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA,EAEA,qBAAqB;AACnB,WAAO,KAAK,cAAc,EAAI;AAAA,EAChC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAUA,gBAAgB;AACd,UAAMlH,IAAQ,KAAK,OAAO;AAC1B,SAAK,YAAYqC,EAAU,MAAM;AACjC,UAAM+E,IAAmB,KAAK,sBAAsB,IAAI;AAExD,WAAI,CAACA,KAAoB,KAAK,KAAK/E,EAAU,IAAI,IACxC,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,kBAAiB;AAAA,MAC5B,YAAY,KAAK,gBAAgB,EAAK;AAAA,IAC9C,CAAO,IAGI,KAAK,KAAKV,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,eAAe0G,IAAmB,KAAK,eAAc,IAAK;AAAA,MAC1D,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,0BAA0B;AACxB,UAAMpH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AAKzC,WAJA,KAAK,cAAc,UAAU,GAIzB,KAAK,SAAS,iCAAiC,KAC1C,KAAK,KAAKM,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAM,KAAK,kBAAiB;AAAA,MAC5B,qBAAqB,KAAK,yBAAwB;AAAA,MAClD,gBAAgB,KAAK,cAAc,IAAI,GAAG,KAAK;MAC/C,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC5C,CAAO,IAGI,KAAK,KAAKM,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAM,KAAK,kBAAiB;AAAA,MAC5B,gBAAgB,KAAK,cAAc,IAAI,GAAG,KAAK;MAC/C,YAAY,KAAK,gBAAgB,EAAK;AAAA,MACtC,cAAc,KAAK,kBAAiB;AAAA,IAC1C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB;AAClB,QAAI,KAAK,OAAO,MAAM,UAAU;AAC9B,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,UAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAqBA,kBAAkBwH,GAAS;AACzB,UAAM1E,IAAQ,KAAK,OAAO;AAE1B,YAAQA,EAAM,MAAI;AAAA,MAChB,KAAKH,EAAU;AACb,eAAO,KAAK,UAAU6E,CAAO;AAAA,MAE/B,KAAK7E,EAAU;AACb,eAAO,KAAK,YAAY6E,CAAO;AAAA,MAEjC,KAAK7E,EAAU;AACb,oBAAK,aAAY,GACV,KAAK,KAAKG,GAAO;AAAA,UACtB,MAAM9B,EAAK;AAAA,UACX,OAAO8B,EAAM;AAAA,QACvB,CAAS;AAAA,MAEH,KAAKH,EAAU;AACb,oBAAK,aAAY,GACV,KAAK,KAAKG,GAAO;AAAA,UACtB,MAAM9B,EAAK;AAAA,UACX,OAAO8B,EAAM;AAAA,QACvB,CAAS;AAAA,MAEH,KAAKH,EAAU;AAAA,MACf,KAAKA,EAAU;AACb,eAAO,KAAK,mBAAkB;AAAA,MAEhC,KAAKA,EAAU;AAGb,gBAFA,KAAK,aAAY,GAETG,EAAM,OAAK;AAAA,UACjB,KAAK;AACH,mBAAO,KAAK,KAAKA,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO;AAAA,YACrB,CAAa;AAAA,UAEH,KAAK;AACH,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO;AAAA,YACrB,CAAa;AAAA,UAEH,KAAK;AACH,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,YACzB,CAAa;AAAA,UAEH;AACE,mBAAO,KAAK,KAAK8B,GAAO;AAAA,cACtB,MAAM9B,EAAK;AAAA,cACX,OAAO8B,EAAM;AAAA,YAC3B,CAAa;AAAA,QACb;AAAA,MAEM,KAAKH,EAAU;AACb,YAAI6E;AAGF,cAFA,KAAK,YAAY7E,EAAU,MAAM,GAE7B,KAAK,OAAO,MAAM,SAASA,EAAU,MAAM;AAC7C,kBAAMgF,IAAU,KAAK,OAAO,MAAM;AAClC,kBAAM5H;AAAA,cACJ,KAAK,OAAO;AAAA,cACZ+C,EAAM;AAAA,cACN,yBAAyB6E,CAAO;AAAA,YAC9C;AAAA,UACU;AACE,kBAAM,KAAK,WAAW7E,CAAK;AAI/B,eAAO,KAAK,cAAa;AAAA,MAE3B;AACE,cAAM,KAAK,WAAU;AAAA,IAC7B;AAAA,EACE;AAAA,EAEA,yBAAyB;AACvB,WAAO,KAAK,kBAAkB,EAAI;AAAA,EACpC;AAAA,EAEA,qBAAqB;AACnB,UAAMA,IAAQ,KAAK,OAAO;AAC1B,gBAAK,aAAY,GACV,KAAK,KAAKA,GAAO;AAAA,MACtB,MAAM9B,EAAK;AAAA,MACX,OAAO8B,EAAM;AAAA,MACb,OAAOA,EAAM,SAASH,EAAU;AAAA,IACtC,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,UAAU6E,GAAS;AACjB,UAAMC,IAAO,MAAM,KAAK,kBAAkBD,CAAO;AAEjD,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMxG,EAAK;AAAA,MACX,QAAQ,KAAK,IAAI2B,EAAU,WAAW8E,GAAM9E,EAAU,SAAS;AAAA,IACrE,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,YAAY6E,GAAS;AACnB,UAAMC,IAAO,MAAM,KAAK,iBAAiBD,CAAO;AAEhD,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAMxG,EAAK;AAAA,MACX,QAAQ,KAAK,IAAI2B,EAAU,SAAS8E,GAAM9E,EAAU,OAAO;AAAA,IACjE,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB6E,GAAS;AACxB,UAAMlH,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAC3B,gBAAK,YAAYtD,EAAU,KAAK,GACzB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,OAAO,KAAK,kBAAkBuB,CAAO;AAAA,IAC3C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgBA,GAAS;AACvB,UAAMI,IAAa,CAAA;AAEnB,WAAO,KAAK,KAAKjF,EAAU,EAAE;AAC3B,MAAAiF,EAAW,KAAK,KAAK,eAAeJ,CAAO,CAAC;AAG9C,WAAOI;AAAA,EACT;AAAA,EAEA,uBAAuB;AACrB,WAAO,KAAK,gBAAgB,EAAI;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,eAAeJ,GAAS;AACtB,UAAMlH,IAAQ,KAAK,OAAO;AAC1B,gBAAK,YAAYqC,EAAU,EAAE,GACtB,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,MACpB,WAAW,KAAK,eAAewG,CAAO;AAAA,IAC5C,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,qBAAqB;AACnB,UAAMlH,IAAQ,KAAK,OAAO;AAC1B,QAAIuH;AAEJ,QAAI,KAAK,oBAAoBlF,EAAU,SAAS,GAAG;AACjD,YAAMmF,IAAY,KAAK,mBAAkB;AACzC,WAAK,YAAYnF,EAAU,SAAS,GACpCkF,IAAO,KAAK,KAAKvH,GAAO;AAAA,QACtB,MAAMU,EAAK;AAAA,QACX,MAAM8G;AAAA,MACd,CAAO;AAAA,IACH;AACE,MAAAD,IAAO,KAAK,eAAc;AAG5B,WAAI,KAAK,oBAAoBlF,EAAU,IAAI,IAClC,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAA6G;AAAA,IACR,CAAO,IAGIA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,iBAAiB;AACf,WAAO,KAAK,KAAK,KAAK,OAAO,OAAO;AAAA,MAClC,MAAM7G,EAAK;AAAA,MACX,MAAM,KAAK,UAAS;AAAA,IAC1B,CAAK;AAAA,EACH;AAAA;AAAA,EAEA,kBAAkB;AAChB,WAAO,KAAK,KAAK2B,EAAU,MAAM,KAAK,KAAK,KAAKA,EAAU,YAAY;AAAA,EACxE;AAAA;AAAA;AAAA;AAAA,EAKA,mBAAmB;AACjB,QAAI,KAAK;AACP,aAAO,KAAK,mBAAkB;AAAA,EAElC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,QAAQ;AAC3B,UAAM4H,IAAa,KAAK,qBAAoB,GACtCG,IAAiB,KAAK;AAAA,MAC1BpF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AACI,WAAO,KAAK,KAAKrC,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,YAAA4H;AAAA,MACA,gBAAAG;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,+BAA+B;AAC7B,UAAMzH,IAAQ,KAAK,OAAO,OACpB8G,IAAY,KAAK,mBAAkB;AACzC,SAAK,YAAYzE,EAAU,KAAK;AAChC,UAAMkF,IAAO,KAAK,eAAc;AAChC,WAAO,KAAK,KAAKvH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,WAAAoG;AAAA,MACA,MAAAS;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,4BAA4B;AAC1B,UAAMvH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,QAAQ;AAC3B,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKtH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,UAAMtH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,MAAM;AACzB,UAAMiG,IAAO,KAAK,UAAS,GACrB+B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AACzC,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA+B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,WAAO,KAAK,sBAAsB,YAAY,IAC1C,KAAK,cAActF,EAAU,KAAK,KAAK,cAAc,IACrD,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,WAAO,KAAK;AAAA,MACVA,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,uBAAuB;AACrB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,UAAS,GACrBnO,IAAO,KAAK,kBAAiB;AACnC,SAAK,YAAY6K,EAAU,KAAK;AAChC,UAAMkF,IAAO,KAAK,mBAAkB,GAC9BD,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKtH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,WAAWnO;AAAA,MACX,MAAA+P;AAAA,MACA,YAAAD;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,oBAAoB;AAClB,WAAO,KAAK;AAAA,MACVjF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,qBAAqB;AACnB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,UAAS;AAC3B,SAAK,YAAYtD,EAAU,KAAK;AAChC,UAAMkF,IAAO,KAAK,mBAAkB;AACpC,QAAIK;AAEJ,IAAI,KAAK,oBAAoBvF,EAAU,MAAM,MAC3CuF,IAAe,KAAK,uBAAsB;AAG5C,UAAMN,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKtH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,MAAA4B;AAAA,MACA,cAAAK;AAAA,MACA,YAAAN;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,+BAA+B;AAC7B,UAAMtH,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,WAAW;AAC9B,UAAMiG,IAAO,KAAK,UAAS,GACrB+B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AACzC,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA+B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAA2B;AACzB,UAAM3H,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,OAAO;AAC1B,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCO,IAAQ,KAAK,sBAAqB;AACxC,WAAO,KAAK,KAAK7H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,MACA,OAAAO;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,wBAAwB;AACtB,WAAO,KAAK,oBAAoBxF,EAAU,MAAM,IAC5C,KAAK,cAAcA,EAAU,MAAM,KAAK,cAAc,IACtD,CAAA;AAAA,EACN;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,0BAA0B;AACxB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,MAAM;AACzB,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCQ,IAAS,KAAK,0BAAyB;AAC7C,WAAO,KAAK,KAAK9H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,MACA,QAAAQ;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,4BAA4B;AAC1B,WAAO,KAAK;AAAA,MACVzF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA,EAKA,2BAA2B;AACzB,UAAMrC,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB,GACnCiG,IAAO,KAAK,mBAAkB,GAC9B2B,IAAa,KAAK,qBAAoB;AAC5C,WAAO,KAAK,KAAKtH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA,EAKA,qBAAqB;AACnB,QACE,KAAK,OAAO,MAAM,UAAU,UAC5B,KAAK,OAAO,MAAM,UAAU,WAC5B,KAAK,OAAO,MAAM,UAAU;AAE5B,YAAM7H;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ,KAAK,OAAO,MAAM;AAAA,QAClB,GAAGsI;AAAA,UACD,KAAK,OAAO;AAAA,QACtB,CAAS;AAAA,MACT;AAGI,WAAO,KAAK,UAAS;AAAA,EACvB;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iCAAiC;AAC/B,UAAM/H,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,OAAO;AAC1B,UAAMiG,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,2BAA0B;AAC9C,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,YAAA2B;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,6BAA6B;AAC3B,WAAO,KAAK;AAAA,MACVtF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAeA,2BAA2B;AACzB,UAAMwE,IAAe,KAAK,OAAO,UAAS;AAE1C,QAAIA,EAAa,SAASxE,EAAU;AAClC,cAAQwE,EAAa,OAAK;AAAA,QACxB,KAAK;AACH,iBAAO,KAAK,qBAAoB;AAAA,QAElC,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,yBAAwB;AAAA,QAEtC,KAAK;AACH,iBAAO,KAAK,4BAA2B;AAAA,QAEzC,KAAK;AACH,iBAAO,KAAK,wBAAuB;AAAA,QAErC,KAAK;AACH,iBAAO,KAAK,uBAAsB;AAAA,QAEpC,KAAK;AACH,iBAAO,KAAK,8BAA6B;AAAA,MACnD;AAGI,UAAM,KAAK,WAAWA,CAAY;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASA,uBAAuB;AACrB,UAAM7G,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,QAAQ;AAC3B,UAAMsH,IAAa,KAAK,qBAAoB,GACtCG,IAAiB,KAAK;AAAA,MAC1BpF,EAAU;AAAA,MACV,KAAK;AAAA,MACLA,EAAU;AAAA,IAChB;AAEI,QAAIiF,EAAW,WAAW,KAAKG,EAAe,WAAW;AACvD,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKzH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,YAAA4G;AAAA,MACA,gBAAAG;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,2BAA2B;AACzB,UAAMzH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,QAAQ;AAC3B,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB;AAE5C,QAAIA,EAAW,WAAW;AACxB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAKtH,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAMtH,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,MAAM;AACzB,UAAM2F,IAAO,KAAK,UAAS,GACrB+B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AAEzC,QACED,EAAW,WAAW,KACtBJ,EAAW,WAAW,KACtBK,EAAO,WAAW;AAElB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA+B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,8BAA8B;AAC5B,UAAM3H,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,WAAW;AAC9B,UAAM2F,IAAO,KAAK,UAAS,GACrB+B,IAAa,KAAK,0BAAyB,GAC3CJ,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,sBAAqB;AAEzC,QACED,EAAW,WAAW,KACtBJ,EAAW,WAAW,KACtBK,EAAO,WAAW;AAElB,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA+B;AAAA,MACA,YAAAJ;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,0BAA0B;AACxB,UAAM3H,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,OAAO;AAC1B,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCO,IAAQ,KAAK,sBAAqB;AAExC,QAAIP,EAAW,WAAW,KAAKO,EAAM,WAAW;AAC9C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK7H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,MACA,OAAAO;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,yBAAyB;AACvB,UAAM7H,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,MAAM;AACzB,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCQ,IAAS,KAAK,0BAAyB;AAE7C,QAAIR,EAAW,WAAW,KAAKQ,EAAO,WAAW;AAC/C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK9H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,MACA,QAAAQ;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,gCAAgC;AAC9B,UAAM9H,IAAQ,KAAK,OAAO;AAC1B,SAAK,cAAc,QAAQ,GAC3B,KAAK,cAAc,OAAO;AAC1B,UAAM2F,IAAO,KAAK,UAAS,GACrB2B,IAAa,KAAK,qBAAoB,GACtCK,IAAS,KAAK,2BAA0B;AAE9C,QAAIL,EAAW,WAAW,KAAKK,EAAO,WAAW;AAC/C,YAAM,KAAK,WAAU;AAGvB,WAAO,KAAK,KAAK3H,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAA2B;AAAA,MACA,QAAAK;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,2BAA2B;AACzB,UAAM3H,IAAQ,KAAK,OAAO,OACpBN,IAAc,KAAK,iBAAgB;AACzC,SAAK,cAAc,WAAW,GAC9B,KAAK,YAAY2C,EAAU,EAAE;AAC7B,UAAMsD,IAAO,KAAK,UAAS,GACrBnO,IAAO,KAAK,kBAAiB,GAC7BwQ,IAAa,KAAK,sBAAsB,YAAY;AAC1D,SAAK,cAAc,IAAI;AACvB,UAAMC,IAAY,KAAK,wBAAuB;AAC9C,WAAO,KAAK,KAAKjI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,aAAAhB;AAAA,MACA,MAAAiG;AAAA,MACA,WAAWnO;AAAA,MACX,YAAAwQ;AAAA,MACA,WAAAC;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,0BAA0B;AACxB,WAAO,KAAK,cAAc5F,EAAU,MAAM,KAAK,sBAAsB;AAAA,EACvE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EA6BA,yBAAyB;AACvB,UAAMrC,IAAQ,KAAK,OAAO,OACpB2F,IAAO,KAAK,UAAS;AAE3B,QAAI,OAAO,UAAU,eAAe,KAAKlF,IAAmBkF,EAAK,KAAK;AACpE,aAAOA;AAGT,UAAM,KAAK,WAAW3F,CAAK;AAAA,EAC7B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAWA,wBAAwB;AACtB,UAAMA,IAAQ,KAAK,OAAO,OACpBkI,IAAc,KAAK,oBAAoB7F,EAAU,EAAE,GACnDsD,IAAO,KAAK,UAAS;AAC3B,QAAIwC;AAEJ,IAAI,CAACD,KAAe,KAAK,oBAAoB7F,EAAU,GAAG,MACxD8F,IAAa,KAAK,UAAS;AAG7B,QAAIC;AAWJ,YARGF,KAAeC,MAChB,KAAK,oBAAoB9F,EAAU,OAAO,MAE1C+F,IAAe,KAAK,UAAS,GAC7B,KAAK,YAAY/F,EAAU,KAAK,GAChC,KAAK,YAAYA,EAAU,OAAO,IAGhC6F,IACEE,IACK,KAAK,KAAKpI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,cAAAyC;AAAA,IACV,CAAS,IAGI,KAAK,KAAKpI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,IACR,CAAO,IACQwC,IACLC,IACK,KAAK,KAAKpI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,WAAWwC;AAAA,MACX,cAAAC;AAAA,IACV,CAAS,IAGI,KAAK,KAAKpI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,MACA,YAAAwC;AAAA,IACR,CAAO,IAGI,KAAK,KAAKnI,GAAO;AAAA,MACtB,MAAMU,EAAK;AAAA,MACX,MAAAiF;AAAA,IACN,CAAK;AAAA,EACH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,KAAK/F,GAAYV,GAAM;AACrB,WAAI,KAAK,SAAS,eAAe,OAC/BA,EAAK,MAAM,IAAIS;AAAA,MACbC;AAAA,MACA,KAAK,OAAO;AAAA,MACZ,KAAK,OAAO;AAAA,IACpB,IAGWV;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,KAAKa,GAAM;AACT,WAAO,KAAK,OAAO,MAAM,SAASA;AAAA,EACpC;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAYA,GAAM;AAChB,UAAMyC,IAAQ,KAAK,OAAO;AAE1B,QAAIA,EAAM,SAASzC;AACjB,kBAAK,aAAY,GACVyC;AAGT,UAAM/C;AAAA,MACJ,KAAK,OAAO;AAAA,MACZ+C,EAAM;AAAA,MACN,YAAY6F,GAAiBtI,CAAI,CAAC,WAAWgI,GAAavF,CAAK,CAAC;AAAA,IACtE;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAoBzC,GAAM;AAGxB,WAFc,KAAK,OAAO,MAEhB,SAASA,KACjB,KAAK,aAAY,GACV,MAGF;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc3D,GAAO;AACnB,UAAMoG,IAAQ,KAAK,OAAO;AAE1B,QAAIA,EAAM,SAASH,EAAU,QAAQG,EAAM,UAAUpG;AACnD,WAAK,aAAY;AAAA;AAEjB,YAAMqD;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ+C,EAAM;AAAA,QACN,aAAapG,CAAK,YAAY2L,GAAavF,CAAK,CAAC;AAAA,MACzD;AAAA,EAEE;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,sBAAsBpG,GAAO;AAC3B,UAAMoG,IAAQ,KAAK,OAAO;AAE1B,WAAIA,EAAM,SAASH,EAAU,QAAQG,EAAM,UAAUpG,KACnD,KAAK,aAAY,GACV,MAGF;AAAA,EACT;AAAA;AAAA;AAAA;AAAA,EAKA,WAAWkM,GAAS;AAClB,UAAM9F,IACJ8F,KAAmD,KAAK,OAAO;AACjE,WAAO7I;AAAA,MACL,KAAK,OAAO;AAAA,MACZ+C,EAAM;AAAA,MACN,cAAcuF,GAAavF,CAAK,CAAC;AAAA,IACvC;AAAA,EACE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,IAAI+F,GAAUC,GAASC,GAAW;AAChC,SAAK,YAAYF,CAAQ;AACzB,UAAM5J,IAAQ,CAAA;AAEd,WAAO,CAAC,KAAK,oBAAoB8J,CAAS;AACxC,MAAA9J,EAAM,KAAK6J,EAAQ,KAAK,IAAI,CAAC;AAG/B,WAAO7J;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAQA,aAAa4J,GAAUC,GAASC,GAAW;AACzC,QAAI,KAAK,oBAAoBF,CAAQ,GAAG;AACtC,YAAM5J,IAAQ,CAAA;AAEd;AACE,QAAAA,EAAM,KAAK6J,EAAQ,KAAK,IAAI,CAAC;AAAA,aACtB,CAAC,KAAK,oBAAoBC,CAAS;AAE5C,aAAO9J;AAAA,IACT;AAEA,WAAO,CAAA;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,KAAK4J,GAAUC,GAASC,GAAW;AACjC,SAAK,YAAYF,CAAQ;AACzB,UAAM5J,IAAQ,CAAA;AAEd;AACE,MAAAA,EAAM,KAAK6J,EAAQ,KAAK,IAAI,CAAC;AAAA,WACtB,CAAC,KAAK,oBAAoBC,CAAS;AAE5C,WAAO9J;AAAA,EACT;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,cAAc+J,GAAeF,GAAS;AACpC,SAAK,oBAAoBE,CAAa;AACtC,UAAM/J,IAAQ,CAAA;AAEd;AACE,MAAAA,EAAM,KAAK6J,EAAQ,KAAK,IAAI,CAAC;AAAA,WACtB,KAAK,oBAAoBE,CAAa;AAE/C,WAAO/J;AAAA,EACT;AAAA,EAEA,eAAe;AACb,UAAM,EAAE,WAAAgK,MAAc,KAAK,UAErBnG,IAAQ,KAAK,OAAO,QAAO;AAEjC,QAAIA,EAAM,SAASH,EAAU,QAC3B,EAAE,KAAK,eAEHsG,MAAc,UAAa,KAAK,gBAAgBA;AAClD,YAAMlJ;AAAA,QACJ,KAAK,OAAO;AAAA,QACZ+C,EAAM;AAAA,QACN,+BAA+BmG,CAAS;AAAA,MAClD;AAAA,EAGE;AACF;AAKA,SAASZ,GAAavF,GAAO;AAC3B,QAAMpG,IAAQoG,EAAM;AACpB,SAAO6F,GAAiB7F,EAAM,IAAI,KAAKpG,KAAS,OAAO,KAAKA,CAAK,MAAM;AACzE;AAKA,SAASiM,GAAiBtI,GAAM;AAC9B,SAAO4C,GAAsB5C,CAAI,IAAI,IAAIA,CAAI,MAAMA;AACrD;ACxmDO,SAAS6I,GAAY7U,GAAK;AAC/B,SAAO,IAAIA,EAAI,QAAQ8U,IAAeC,EAAe,CAAC;AACxD;AAEA,MAAMD,KAAgB;AAEtB,SAASC,GAAgB/U,GAAK;AAC5B,SAAOgV,GAAgBhV,EAAI,WAAW,CAAC,CAAC;AAC1C;AAEA,MAAMgV,KAAkB;AAAA,EACtB;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AAAA,EACA;AACF,GCtKaC,KAAQ,OAAO,OAAO,EAAE;AAgF9B,SAASC,GAAMC,GAAMC,GAASC,IAAcjJ,IAAmB;AACpE,QAAMkJ,IAAgB,oBAAI,IAAG;AAE7B,aAAWtJ,KAAQ,OAAO,OAAOW,CAAI;AACnC,IAAA2I,EAAc,IAAItJ,GAAMuJ,GAAqBH,GAASpJ,CAAI,CAAC;AAI7D,MAAIwJ,GACAC,IAAU,MAAM,QAAQN,CAAI,GAC5BO,IAAO,CAACP,CAAI,GACZQ,IAAQ,IACRC,IAAQ,CAAA,GACRzK,IAAOgK,GACP1D,GACAoE;AACJ,QAAM/K,IAAO,CAAA,GACPgL,IAAY,CAAA;AAGlB,KAAG;AACD,IAAAH;AACA,UAAMI,IAAYJ,MAAUD,EAAK,QAC3BM,IAAWD,KAAaH,EAAM,WAAW;AAE/C,QAAIG,GAAW;AAKb,UAJAtE,IAAMqE,EAAU,WAAW,IAAI,SAAYhL,EAAKA,EAAK,SAAS,CAAC,GAC/DK,IAAO0K,GACPA,IAASC,EAAU,IAAG,GAElBE;AACF,YAAIP,GAAS;AACX,UAAAtK,IAAOA,EAAK,MAAK;AACjB,cAAI8K,IAAa;AAEjB,qBAAW,CAACC,GAASC,CAAS,KAAKP,GAAO;AACxC,kBAAMQ,IAAWF,IAAUD;AAE3B,YAAIE,MAAc,QAChBhL,EAAK,OAAOiL,GAAU,CAAC,GACvBH,OAEA9K,EAAKiL,CAAQ,IAAID;AAAA,UAErB;AAAA,QACF,OAAO;AACL,UAAAhL,IAAO,EAAE,GAAGA,EAAI;AAEhB,qBAAW,CAAC+K,GAASC,CAAS,KAAKP;AACjC,YAAAzK,EAAK+K,CAAO,IAAIC;AAAA,QAEpB;AAGF,MAAAR,IAAQH,EAAM,OACdE,IAAOF,EAAM,MACbI,IAAQJ,EAAM,OACdC,IAAUD,EAAM,SAChBA,IAAQA,EAAM;AAAA,IAChB,WAAWK,GAAQ;AAIjB,UAHApE,IAAMgE,IAAUE,IAAQD,EAAKC,CAAK,GAClCxK,IAAO0K,EAAOpE,CAAG,GAEbtG,KAAS;AACX;AAGF,MAAAL,EAAK,KAAK2G,CAAG;AAAA,IACf;AAEA,QAAIrD;AAEJ,QAAI,CAAC,MAAM,QAAQjD,CAAI,GAAG;AACxB,UAAIkL,GAAoBC;AAExB,MAAAhK,GAAOnB,CAAI,KAAKlD,GAAU,IAAO,qBAAqB4I,GAAQ1F,CAAI,CAAC,GAAG;AACtE,YAAMoL,IAAUR,KACXM,IAAqBf,EAAc,IAAInK,EAAK,IAAI,OAAO,QACxDkL,MAAuB,SACrB,SACAA,EAAmB,SACpBC,IAAsBhB,EAAc,IAAInK,EAAK,IAAI,OAAO,QACzDmL,MAAwB,SACxB,SACAA,EAAoB;AAMxB,UALAlI,IAGMmI,GAAQ,KAAKnB,GAASjK,GAAMsG,GAAKoE,GAAQ/K,GAAMgL,CAAS,GAE1D1H,MAAW6G;AACb;AAGF,UAAI7G,MAAW;AACb,YAAI,CAAC2H,GAAW;AACd,UAAAjL,EAAK,IAAG;AACR;AAAA,QACF;AAAA,iBACSsD,MAAW,WACpBwH,EAAM,KAAK,CAACnE,GAAKrD,CAAM,CAAC,GAEpB,CAAC2H;AACH,YAAIzJ,GAAO8B,CAAM;AACf,UAAAjD,IAAOiD;AAAA,aACF;AACL,UAAAtD,EAAK,IAAG;AACR;AAAA,QACF;AAAA,IAGN;AAMA,QAJIsD,MAAW,UAAa4H,KAC1BJ,EAAM,KAAK,CAACnE,GAAKtG,CAAI,CAAC,GAGpB4K;AACF,MAAAjL,EAAK,IAAG;AAAA,SACH;AACL,UAAI0L;AAEJ,MAAAhB,IAAQ;AAAA,QACN,SAAAC;AAAA,QACA,OAAAE;AAAA,QACA,MAAAD;AAAA,QACA,OAAAE;AAAA,QACA,MAAMJ;AAAA,MACd,GACMC,IAAU,MAAM,QAAQtK,CAAI,GAC5BuK,IAAOD,IACHtK,KACCqL,IAAanB,EAAYlK,EAAK,IAAI,OAAO,QAC1CqL,MAAe,SACfA,IACA,CAAA,GACJb,IAAQ,IACRC,IAAQ,CAAA,GAEJC,KACFC,EAAU,KAAKD,CAAM,GAGvBA,IAAS1K;AAAA,IACX;AAAA,EACF,SAASqK,MAAU;AAEnB,SAAII,EAAM,WAAW,IAEZA,EAAMA,EAAM,SAAS,CAAC,EAAE,CAAC,IAG3BT;AACT;AAoFO,SAASI,GAAqBH,GAASpJ,GAAM;AAClD,QAAMyK,IAAcrB,EAAQpJ,CAAI;AAEhC,SAAI,OAAOyK,KAAgB,WAElBA,IACE,OAAOA,KAAgB,aAEzB;AAAA,IACL,OAAOA;AAAA,IACP,OAAO;AAAA,EACb,IAGS;AAAA,IACL,OAAOrB,EAAQ;AAAA,IACf,OAAOA,EAAQ;AAAA,EACnB;AACA;AChVO,SAASsB,GAAMC,GAAK;AACzB,SAAOzB,GAAMyB,GAAKC,EAAkB;AACtC;AACA,MAAMC,KAAkB,IAClBD,KAAqB;AAAA,EACzB,MAAM;AAAA,IACJ,OAAO,CAACzL,MAASA,EAAK;AAAA,EAC1B;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAACA,MAAS,MAAMA,EAAK;AAAA,EAChC;AAAA;AAAA,EAEE,UAAU;AAAA,IACR,OAAO,CAACA,MAAS2L,EAAK3L,EAAK,aAAa;AAAA;AAAA,CAAM;AAAA,EAClD;AAAA,EACE,qBAAqB;AAAA,IACnB,MAAMA,GAAM;AACV,YAAM4L,IAAUC,GAAkB7L,EAAK,mBAAmB,IACtD8L,EAAK;AAAA,GAAOH,EAAK3L,EAAK,qBAAqB;AAAA,CAAI,GAAG;AAAA,EAAK,IACvD8L,EAAK,KAAKH,EAAK3L,EAAK,qBAAqB,IAAI,GAAG,GAAG,GACjDf,IACJ6M,EAAK,IAAI9L,EAAK,aAAa;AAAA,CAAI,IAC/B2L;AAAA,QACE;AAAA,UACE3L,EAAK;AAAA,UACL2L,EAAK,CAAC3L,EAAK,MAAM4L,CAAO,CAAC;AAAA,UACzBD,EAAK3L,EAAK,YAAY,GAAG;AAAA,QACrC;AAAA,QACU;AAAA,MACV;AAGM,cAAQf,MAAW,UAAU,KAAKA,IAAS,OAAOe,EAAK;AAAA,IACzD;AAAA,EACJ;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,UAAA+L,GAAU,MAAA1D,GAAM,cAAAK,GAAc,YAAAN,GAAY,aAAA5H,EAAW,MAC7DsL,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BuL,IACA,OACA1D,IACAyD,EAAK,OAAOpD,CAAY,IACxBoD,EAAK,KAAKH,EAAKvD,GAAY,GAAG,CAAC;AAAA,EACrC;AAAA,EACE,cAAc;AAAA,IACZ,OAAO,CAAC,EAAE,YAAA4D,QAAiBC,EAAMD,CAAU;AAAA,EAC/C;AAAA,EACE,OAAO;AAAA,IACL,MAAM,EAAE,OAAAjE,GAAO,MAAAtB,GAAM,WAAWnO,GAAM,YAAA8P,GAAY,cAAA8D,KAAgB;AAChE,YAAMjN,IAAS6M,EAAK,IAAI/D,GAAO,IAAI,IAAItB;AACvC,UAAI0F,IAAWlN,IAAS6M,EAAK,KAAKH,EAAKrT,GAAM,IAAI,GAAG,GAAG;AAEvD,aAAI6T,EAAS,SAAST,OACpBS,IAAWlN,IAAS6M,EAAK;AAAA,GAAOzJ,GAAOsJ,EAAKrT,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAG1DqT,EAAK,CAACQ,GAAUR,EAAKvD,GAAY,GAAG,GAAG8D,CAAY,GAAG,GAAG;AAAA,IAClE;AAAA,EACJ;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,MAAAzF,GAAM,OAAAvJ,EAAK,MAAOuJ,IAAO,OAAOvJ;AAAA,EAC9C;AAAA;AAAA,EAEE,gBAAgB;AAAA,IACd,OAAO,CAAC,EAAE,MAAAuJ,GAAM,YAAA2B,EAAU,MACxB,QAAQ3B,IAAOqF,EAAK,KAAKH,EAAKvD,GAAY,GAAG,CAAC;AAAA,EACpD;AAAA,EACE,gBAAgB;AAAA,IACd,OAAO,CAAC,EAAE,eAAAgE,GAAe,YAAAhE,GAAY,cAAA8D,EAAY,MAC/CP;AAAA,MACE;AAAA,QACE;AAAA,QACAG,EAAK,OAAOM,CAAa;AAAA,QACzBT,EAAKvD,GAAY,GAAG;AAAA,QACpB8D;AAAA,MACV;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC;AAAA,MACN,MAAAzF;AAAA,MACA,eAAA2F;AAAA,MACA,qBAAAC;AAAA,MACA,YAAAjE;AAAA,MACA,cAAA8D;AAAA,MACA,aAAA1L;AAAA,IACN,MACMsL,EAAK,IAAItL,GAAa;AAAA,CAAI;AAAA;AAAA,IAE1B,YAAYiG,CAAI,GAAGqF,EAAK,KAAKH,EAAKU,GAAqB,IAAI,GAAG,GAAG,CAAC,OAC5DD,CAAa,IAAIN,EAAK,IAAIH,EAAKvD,GAAY,GAAG,GAAG,GAAG,CAAC,KAC3D8D;AAAA,EACN;AAAA;AAAA,EAEE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,OAAAhP,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,YAAY;AAAA,IACV,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,OAAAA,GAAO,OAAOoP,EAAa,MACnCA,IAAgB/J,GAAiBrF,CAAK,IAAIwM,GAAYxM,CAAK;AAAA,EACjE;AAAA,EACE,cAAc;AAAA,IACZ,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAQA,IAAQ,SAAS;AAAA,EAC5C;AAAA,EACE,WAAW;AAAA,IACT,OAAO,MAAM;AAAA,EACjB;AAAA,EACE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,OAAAA,EAAK,MAAOA;AAAA,EAC1B;AAAA,EACE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,QAAA0L,QAAa,MAAM+C,EAAK/C,GAAQ,IAAI,IAAI;AAAA,EACtD;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,QAAAH,QAAa,MAAMkD,EAAKlD,GAAQ,IAAI,IAAI;AAAA,EACtD;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,MAAAhC,GAAM,OAAAvJ,EAAK,MAAOuJ,IAAO,OAAOvJ;AAAA,EAC9C;AAAA;AAAA,EAEE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,MAAAuJ,GAAM,WAAWnO,EAAI,MAC7B,MAAMmO,IAAOqF,EAAK,KAAKH,EAAKrT,GAAM,IAAI,GAAG,GAAG;AAAA,EAClD;AAAA;AAAA,EAEE,WAAW;AAAA,IACT,OAAO,CAAC,EAAE,MAAAmO,EAAI,MAAOA;AAAA,EACzB;AAAA,EACE,UAAU;AAAA,IACR,OAAO,CAAC,EAAE,MAAA4B,EAAI,MAAO,MAAMA,IAAO;AAAA,EACtC;AAAA,EACE,aAAa;AAAA,IACX,OAAO,CAAC,EAAE,MAAAA,EAAI,MAAOA,IAAO;AAAA,EAChC;AAAA;AAAA,EAEE,kBAAkB;AAAA,IAChB,OAAO,CAAC,EAAE,aAAA7H,GAAa,YAAA4H,GAAY,gBAAAG,EAAc,MAC/CuD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL,EAAK,CAAC,UAAUA,EAAKvD,GAAY,GAAG,GAAG6D,EAAM1D,CAAc,CAAC,GAAG,GAAG;AAAA,EACxE;AAAA,EACE,yBAAyB;AAAA,IACvB,OAAO,CAAC,EAAE,WAAAX,GAAW,MAAAS,EAAI,MAAOT,IAAY,OAAOS;AAAA,EACvD;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAA7H,GAAa,MAAAiG,GAAM,YAAA2B,EAAU,MACrC0D,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL,EAAK,CAAC,UAAUlF,GAAMkF,EAAKvD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EACvD;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAA5H,GAAa,MAAAiG,GAAM,YAAA+B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MACzDqD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL;AAAA,MACE;AAAA,QACE;AAAA,QACAlF;AAAA,QACAqF,EAAK,eAAeH,EAAKnD,GAAY,KAAK,CAAC;AAAA,QAC3CmD,EAAKvD,GAAY,GAAG;AAAA,QACpB6D,EAAMxD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,iBAAiB;AAAA,IACf,OAAO,CAAC,EAAE,aAAAjI,GAAa,MAAAiG,GAAM,WAAWnO,GAAM,MAAA+P,GAAM,YAAAD,EAAU,MAC5D0D,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BiG,KACCoF,GAAkBvT,CAAI,IACnBwT,EAAK;AAAA,GAAOzJ,GAAOsJ,EAAKrT,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAC3CwT,EAAK,KAAKH,EAAKrT,GAAM,IAAI,GAAG,GAAG,KACnC,OACA+P,IACAyD,EAAK,KAAKH,EAAKvD,GAAY,GAAG,CAAC;AAAA,EACrC;AAAA,EACE,sBAAsB;AAAA,IACpB,OAAO,CAAC,EAAE,aAAA5H,GAAa,MAAAiG,GAAM,MAAA4B,GAAM,cAAAK,GAAc,YAAAN,EAAU,MACzD0D,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL;AAAA,MACE,CAAClF,IAAO,OAAO4B,GAAMyD,EAAK,MAAMpD,CAAY,GAAGiD,EAAKvD,GAAY,GAAG,CAAC;AAAA,MACpE;AAAA,IACR;AAAA,EACA;AAAA,EACE,yBAAyB;AAAA,IACvB,OAAO,CAAC,EAAE,aAAA5H,GAAa,MAAAiG,GAAM,YAAA+B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MACzDqD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL;AAAA,MACE;AAAA,QACE;AAAA,QACAlF;AAAA,QACAqF,EAAK,eAAeH,EAAKnD,GAAY,KAAK,CAAC;AAAA,QAC3CmD,EAAKvD,GAAY,GAAG;AAAA,QACpB6D,EAAMxD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAAjI,GAAa,MAAAiG,GAAM,YAAA2B,GAAY,OAAAO,EAAK,MAC5CmD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL;AAAA,MACE,CAAC,SAASlF,GAAMkF,EAAKvD,GAAY,GAAG,GAAG0D,EAAK,MAAMH,EAAKhD,GAAO,KAAK,CAAC,CAAC;AAAA,MACrE;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,aAAAnI,GAAa,MAAAiG,GAAM,YAAA2B,GAAY,QAAAQ,EAAM,MAC7CkD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL,EAAK,CAAC,QAAQlF,GAAMkF,EAAKvD,GAAY,GAAG,GAAG6D,EAAMrD,CAAM,CAAC,GAAG,GAAG;AAAA,EACpE;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAApI,GAAa,MAAAiG,GAAM,YAAA2B,EAAU,MACrC0D,EAAK,IAAItL,GAAa;AAAA,CAAI,IAAImL,EAAK,CAAClF,GAAMkF,EAAKvD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EAC3E;AAAA,EACE,2BAA2B;AAAA,IACzB,OAAO,CAAC,EAAE,aAAA5H,GAAa,MAAAiG,GAAM,YAAA2B,GAAY,QAAAK,EAAM,MAC7CqD,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1BmL,EAAK,CAAC,SAASlF,GAAMkF,EAAKvD,GAAY,GAAG,GAAG6D,EAAMxD,CAAM,CAAC,GAAG,GAAG;AAAA,EACrE;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,aAAAjI,GAAa,MAAAiG,GAAM,WAAWnO,GAAM,YAAAwQ,GAAY,WAAAC,EAAS,MACjE+C,EAAK,IAAItL,GAAa;AAAA,CAAI,IAC1B,gBACAiG,KACCoF,GAAkBvT,CAAI,IACnBwT,EAAK;AAAA,GAAOzJ,GAAOsJ,EAAKrT,GAAM;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK,IAC3CwT,EAAK,KAAKH,EAAKrT,GAAM,IAAI,GAAG,GAAG,MAClCwQ,IAAa,gBAAgB,MAC9B,SACA6C,EAAK5C,GAAW,KAAK;AAAA,EAC3B;AAAA,EACE,iBAAiB;AAAA,IACf,OAAO,CAAC,EAAE,YAAAX,GAAY,gBAAAG,EAAc,MAClCoD;AAAA,MACE,CAAC,iBAAiBA,EAAKvD,GAAY,GAAG,GAAG6D,EAAM1D,CAAc,CAAC;AAAA,MAC9D;AAAA,IACR;AAAA,EACA;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,MAAA9B,GAAM,YAAA2B,EAAU,MACxBuD,EAAK,CAAC,iBAAiBlF,GAAMkF,EAAKvD,GAAY,GAAG,CAAC,GAAG,GAAG;AAAA,EAC9D;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,MAAA3B,GAAM,YAAA+B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MAC5CkD;AAAA,MACE;AAAA,QACE;AAAA,QACAlF;AAAA,QACAqF,EAAK,eAAeH,EAAKnD,GAAY,KAAK,CAAC;AAAA,QAC3CmD,EAAKvD,GAAY,GAAG;AAAA,QACpB6D,EAAMxD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,wBAAwB;AAAA,IACtB,OAAO,CAAC,EAAE,MAAAhC,GAAM,YAAA+B,GAAY,YAAAJ,GAAY,QAAAK,EAAM,MAC5CkD;AAAA,MACE;AAAA,QACE;AAAA,QACAlF;AAAA,QACAqF,EAAK,eAAeH,EAAKnD,GAAY,KAAK,CAAC;AAAA,QAC3CmD,EAAKvD,GAAY,GAAG;AAAA,QACpB6D,EAAMxD,CAAM;AAAA,MACtB;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,MAAAhC,GAAM,YAAA2B,GAAY,OAAAO,EAAK,MAC/BgD;AAAA,MACE;AAAA,QACE;AAAA,QACAlF;AAAA,QACAkF,EAAKvD,GAAY,GAAG;AAAA,QACpB0D,EAAK,MAAMH,EAAKhD,GAAO,KAAK,CAAC;AAAA,MACvC;AAAA,MACQ;AAAA,IACR;AAAA,EACA;AAAA,EACE,mBAAmB;AAAA,IACjB,OAAO,CAAC,EAAE,MAAAlC,GAAM,YAAA2B,GAAY,QAAAQ,EAAM,MAChC+C,EAAK,CAAC,eAAelF,GAAMkF,EAAKvD,GAAY,GAAG,GAAG6D,EAAMrD,CAAM,CAAC,GAAG,GAAG;AAAA,EAC3E;AAAA,EACE,0BAA0B;AAAA,IACxB,OAAO,CAAC,EAAE,MAAAnC,GAAM,YAAA2B,GAAY,QAAAK,EAAM,MAChCkD,EAAK,CAAC,gBAAgBlF,GAAMkF,EAAKvD,GAAY,GAAG,GAAG6D,EAAMxD,CAAM,CAAC,GAAG,GAAG;AAAA,EAC5E;AAAA;AAAA,EAEE,gBAAgB;AAAA,IACd,OAAO,CAAC,EAAE,MAAAhC,EAAI,MAAOA;AAAA,EACzB;AAAA,EACE,kBAAkB;AAAA,IAChB,OAAO,CAAC,EAAE,MAAAA,GAAM,YAAAwC,QAAiB0C,EAAK,CAAClF,GAAMqF,EAAK,KAAK7C,CAAU,CAAC,CAAC;AAAA,EACvE;AAAA,EACE,oBAAoB;AAAA,IAClB,OAAO,CAAC,EAAE,MAAAxC,GAAM,WAAA8F,GAAW,cAAArD,EAAY,MACrCyC,EAAK,CAAClF,GAAMqF,EAAK,KAAKS,CAAS,GAAGT,EAAK,KAAK5C,GAAc,IAAI,CAAC,CAAC;AAAA,EACtE;AAAA,EACE,qBAAqB;AAAA,IACnB,OAAO,CAAC,EAAE,MAAAzC,EAAI,MAAOkF,EAAK,CAAC,KAAKlF,CAAI,CAAC;AAAA,EACzC;AAAA,EACE,6BAA6B;AAAA,IAC3B,OAAO,CAAC,EAAE,MAAAA,GAAM,cAAAyC,EAAY,MAC1ByC,EAAK,CAAC,KAAKlF,GAAMqF,EAAK,KAAK5C,GAAc,IAAI,CAAC,CAAC;AAAA,EACrD;AACA;AAMA,SAASyC,EAAKa,GAAYC,IAAY,IAAI;AACxC,MAAIC;AAEJ,UAAQA,IAGFF,GAAW,OAAO,CAACnc,MAAMA,CAAC,EAAE,KAAKoc,CAAS,OAAO,QACrDC,MAA0B,SACxBA,IACA;AACN;AAKA,SAAST,EAAM3L,GAAO;AACpB,SAAOwL,EAAK;AAAA,GAAOzJ,GAAOsJ,EAAKrL,GAAO;AAAA,CAAI,CAAC,GAAG;AAAA,EAAK;AACrD;AAKA,SAASwL,EAAKhL,GAAO6L,GAAa5L,IAAM,IAAI;AAC1C,SAAO4L,KAAe,QAAQA,MAAgB,KAC1C7L,IAAQ6L,IAAc5L,IACtB;AACN;AAEA,SAASsB,GAAOxN,GAAK;AACnB,SAAOiX,EAAK,MAAMjX,EAAI,QAAQ,OAAO;AAAA,GAAM,CAAC;AAC9C;AAEA,SAASgX,GAAkBW,GAAY;AACrC,MAAII;AAKJ,UAAQA,IAGFJ,GAAW,KAAK,CAAC3X,MAAQA,EAAI,SAAS;AAAA,CAAI,CAAC,OAAO,QACtD+X,MAAqB,SACnBA,IACA;AACN;AC3WA,MAAMC,KAAuB,CAACtF,MAAa;AACvC,MAAIuF;AACJ,QAAMC,IAAuBxF,EAAS,YAAY,OAAO,CAACyF,MAAeA,EAAW,SAAS,qBAAqB;AAClH,SAAID,EAAqB,WAAW,MAChCD,IAAgBC,EAAqB,CAAC,GAAG,MAAM,QAE5CD;AACX,GACaG,KAAyB,CAAC1F,MAAa;AAChD,MAAI,OAAOA,KAAa,UAAU;AAC9B,QAAIuF;AACJ,QAAI;AACA,YAAMI,IAAiB9F,GAAMG,CAAQ;AACrC,MAAAuF,IAAgBD,GAAqBK,CAAc;AAAA,IACvD,QACY;AAAA,IAEZ;AACA,WAAO,EAAE,OAAO3F,GAAU,eAAAuF,EAAa;AAAA,EAC3C;AACA,QAAMA,IAAgBD,GAAqBtF,CAAQ;AACnD,SAAO,EAAE,OAAOgE,GAAMhE,CAAQ,GAAG,eAAAuF,EAAa;AAClD;AC1BO,MAAMK,WAAoB,MAAM;AAAA,EACnC,YAAYC,GAAUC,GAAS;AAC3B,UAAMrQ,IAAU,GAAGmQ,GAAY,eAAeC,CAAQ,CAAC,KAAK,KAAK,UAAU;AAAA,MACvE,UAAAA;AAAA,MACA,SAAAC;AAAA,IACZ,CAAS,CAAC;AACF,UAAMrQ,CAAO,GACb,OAAO,eAAe,MAAMmQ,GAAY,SAAS,GACjD,KAAK,WAAWC,GAChB,KAAK,UAAUC,GAEX,OAAO,MAAM,qBAAsB,cACnC,MAAM,kBAAkB,MAAMF,EAAW;AAAA,EAEjD;AAAA,EACA,OAAO,eAAeC,GAAU;AAC5B,WAAOA,EAAS,SAAS,CAAC,GAAG,WAAW,wBAAwBA,EAAS,MAAM;AAAA,EACnF;AACJ;;;;;;;;ACjBA,QAAIE,IACH,OAAO,aAAe,OAAe,cACrC,OAAO,OAAS,OAAe,QAC/B,OAAOC,KAAW,OAAeA,IAE9BC,KAAkB,WAAY;AAClC,eAASC,IAAI;AACb,aAAK,QAAQ,IACb,KAAK,eAAeH,EAAW;AAAA,MAC/B;AACA,aAAAG,EAAE,YAAYH,GACP,IAAIG,EAAC;AAAA,IACZ,GAAC;AAGD,KAAC,SAASC,GAAY;AAEL,OAAC,SAAUC,GAAS;AAGnC,YAAIC,IACD,OAAOF,IAAe,OAAeA,KACrC,OAAO,OAAS,OAAe;AAAA,QAE/B,OAAOH,KAAW,OAAeA,MAClC,CAAA,GAEEM,IAAU;AAAA,UACZ,cAAc,qBAAqBD;AAAA,UACnC,UAAU,YAAYA,KAAK,cAAc;AAAA,UACzC,MACE,gBAAgBA,KAChB,UAAUA,MACT,WAAW;AACV,gBAAI;AACF,yBAAI,KAAI,GACD;AAAA,YACjB,QAAoB;AACV,qBAAO;AAAA,YACjB;AAAA,UACA,GAAO;AAAA,UACH,UAAU,cAAcA;AAAA,UACxB,aAAa,iBAAiBA;AAAA;AAGhC,iBAASE,EAAWxT,GAAK;AACvB,iBAAOA,KAAO,SAAS,UAAU,cAAcA,CAAG;AAAA,QACtD;AAEE,YAAIuT,EAAQ;AACV,cAAIE,IAAc;AAAA,YAChB;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,YACA;AAAA,aAGEC,IACF,YAAY,UACZ,SAAS1T,GAAK;AACZ,mBAAOA,KAAOyT,EAAY,QAAQ,OAAO,UAAU,SAAS,KAAKzT,CAAG,CAAC,IAAI;AAAA,UACjF;AAGE,iBAAS2T,EAAcxH,GAAM;AAI3B,cAHI,OAAOA,KAAS,aAClBA,IAAO,OAAOA,CAAI,IAEhB,6BAA6B,KAAKA,CAAI,KAAKA,MAAS;AACtD,kBAAM,IAAI,UAAU,8CAA8CA,IAAO,GAAG;AAE9E,iBAAOA,EAAK,YAAW;AAAA,QAC3B;AAEE,iBAASyH,EAAehR,GAAO;AAC7B,iBAAI,OAAOA,KAAU,aACnBA,IAAQ,OAAOA,CAAK,IAEfA;AAAA,QACX;AAGE,iBAASiR,EAAY3H,GAAO;AAC1B,cAAI4H,IAAW;AAAA,YACb,MAAM,WAAW;AACf,kBAAIlR,IAAQsJ,EAAM,MAAK;AACvB,qBAAO,EAAC,MAAMtJ,MAAU,QAAW,OAAOA,EAAK;AAAA,YACvD;AAAA;AAGI,iBAAI2Q,EAAQ,aACVO,EAAS,OAAO,QAAQ,IAAI,WAAW;AACrC,mBAAOA;AAAA,UACf,IAGWA;AAAA,QACX;AAEE,iBAASC,EAAQjS,GAAS;AACxB,eAAK,MAAM,CAAA,GAEPA,aAAmBiS,IACrBjS,EAAQ,QAAQ,SAASc,GAAOuJ,GAAM;AACpC,iBAAK,OAAOA,GAAMvJ,CAAK;AAAA,UAC/B,GAAS,IAAI,IACE,MAAM,QAAQd,CAAO,IAC9BA,EAAQ,QAAQ,SAASkS,GAAQ;AAC/B,gBAAIA,EAAO,UAAU;AACnB,oBAAM,IAAI,UAAU,wEAAwEA,EAAO,MAAM;AAE3G,iBAAK,OAAOA,EAAO,CAAC,GAAGA,EAAO,CAAC,CAAC;AAAA,UACxC,GAAS,IAAI,IACElS,KACT,OAAO,oBAAoBA,CAAO,EAAE,QAAQ,SAASqK,GAAM;AACzD,iBAAK,OAAOA,GAAMrK,EAAQqK,CAAI,CAAC;AAAA,UACvC,GAAS,IAAI;AAAA,QAEb;AAEE,QAAA4H,EAAQ,UAAU,SAAS,SAAS5H,GAAMvJ,GAAO;AAC/C,UAAAuJ,IAAOwH,EAAcxH,CAAI,GACzBvJ,IAAQgR,EAAehR,CAAK;AAC5B,cAAIqR,IAAW,KAAK,IAAI9H,CAAI;AAC5B,eAAK,IAAIA,CAAI,IAAI8H,IAAWA,IAAW,OAAOrR,IAAQA;AAAA,QAC1D,GAEEmR,EAAQ,UAAU,SAAY,SAAS5H,GAAM;AAC3C,iBAAO,KAAK,IAAIwH,EAAcxH,CAAI,CAAC;AAAA,QACvC,GAEE4H,EAAQ,UAAU,MAAM,SAAS5H,GAAM;AACrC,iBAAAA,IAAOwH,EAAcxH,CAAI,GAClB,KAAK,IAAIA,CAAI,IAAI,KAAK,IAAIA,CAAI,IAAI;AAAA,QAC7C,GAEE4H,EAAQ,UAAU,MAAM,SAAS5H,GAAM;AACrC,iBAAO,KAAK,IAAI,eAAewH,EAAcxH,CAAI,CAAC;AAAA,QACtD,GAEE4H,EAAQ,UAAU,MAAM,SAAS5H,GAAMvJ,GAAO;AAC5C,eAAK,IAAI+Q,EAAcxH,CAAI,CAAC,IAAIyH,EAAehR,CAAK;AAAA,QACxD,GAEEmR,EAAQ,UAAU,UAAU,SAASG,GAAUC,GAAS;AACtD,mBAAShI,KAAQ,KAAK;AACpB,YAAI,KAAK,IAAI,eAAeA,CAAI,KAC9B+H,EAAS,KAAKC,GAAS,KAAK,IAAIhI,CAAI,GAAGA,GAAM,IAAI;AAAA,QAGzD,GAEE4H,EAAQ,UAAU,OAAO,WAAW;AAClC,cAAI7H,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAOuJ,GAAM;AACjC,YAAAD,EAAM,KAAKC,CAAI;AAAA,UACrB,CAAK,GACM0H,EAAY3H,CAAK;AAAA,QAC5B,GAEE6H,EAAQ,UAAU,SAAS,WAAW;AACpC,cAAI7H,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAO;AAC3B,YAAAsJ,EAAM,KAAKtJ,CAAK;AAAA,UACtB,CAAK,GACMiR,EAAY3H,CAAK;AAAA,QAC5B,GAEE6H,EAAQ,UAAU,UAAU,WAAW;AACrC,cAAI7H,IAAQ,CAAA;AACZ,sBAAK,QAAQ,SAAStJ,GAAOuJ,GAAM;AACjC,YAAAD,EAAM,KAAK,CAACC,GAAMvJ,CAAK,CAAC;AAAA,UAC9B,CAAK,GACMiR,EAAY3H,CAAK;AAAA,QAC5B,GAEMqH,EAAQ,aACVQ,EAAQ,UAAU,OAAO,QAAQ,IAAIA,EAAQ,UAAU;AAGzD,iBAASK,EAAS1Q,GAAM;AACtB,cAAI,CAAAA,EAAK,SACT;AAAA,gBAAIA,EAAK;AACP,qBAAO,QAAQ,OAAO,IAAI,UAAU,cAAc,CAAC;AAErD,YAAAA,EAAK,WAAW;AAAA;AAAA,QACpB;AAEE,iBAAS2Q,EAAgBC,GAAQ;AAC/B,iBAAO,IAAI,QAAQ,SAASC,GAASC,GAAQ;AAC3C,YAAAF,EAAO,SAAS,WAAW;AACzB,cAAAC,EAAQD,EAAO,MAAM;AAAA,YAC7B,GACMA,EAAO,UAAU,WAAW;AAC1B,cAAAE,EAAOF,EAAO,KAAK;AAAA,YAC3B;AAAA,UACA,CAAK;AAAA,QACL;AAEE,iBAASG,EAAsBC,GAAM;AACnC,cAAIJ,IAAS,IAAI,WAAU,GACvBK,IAAUN,EAAgBC,CAAM;AACpC,iBAAAA,EAAO,kBAAkBI,CAAI,GACtBC;AAAA,QACX;AAEE,iBAASC,EAAeF,GAAM;AAC5B,cAAIJ,IAAS,IAAI,WAAU,GACvBK,IAAUN,EAAgBC,CAAM,GAChClR,IAAQ,2BAA2B,KAAKsR,EAAK,IAAI,GACjDG,IAAWzR,IAAQA,EAAM,CAAC,IAAI;AAClC,iBAAAkR,EAAO,WAAWI,GAAMG,CAAQ,GACzBF;AAAA,QACX;AAEE,iBAASG,EAAsBC,GAAK;AAIlC,mBAHIC,IAAO,IAAI,WAAWD,CAAG,GACzBE,IAAQ,IAAI,MAAMD,EAAK,MAAM,GAExB1e,IAAI,GAAGA,IAAI0e,EAAK,QAAQ1e;AAC/B,YAAA2e,EAAM3e,CAAC,IAAI,OAAO,aAAa0e,EAAK1e,CAAC,CAAC;AAExC,iBAAO2e,EAAM,KAAK,EAAE;AAAA,QACxB;AAEE,iBAASC,EAAYH,GAAK;AACxB,cAAIA,EAAI;AACN,mBAAOA,EAAI,MAAM,CAAC;AAElB,cAAIC,IAAO,IAAI,WAAWD,EAAI,UAAU;AACxC,iBAAAC,EAAK,IAAI,IAAI,WAAWD,CAAG,CAAC,GACrBC,EAAK;AAAA,QAElB;AAEE,iBAASG,IAAO;AACd,sBAAK,WAAW,IAEhB,KAAK,YAAY,SAASzR,GAAM;AAY9B,iBAAK,WAAW,KAAK,UACrB,KAAK,YAAYA,GACZA,IAGM,OAAOA,KAAS,WACzB,KAAK,YAAYA,IACR6P,EAAQ,QAAQ,KAAK,UAAU,cAAc7P,CAAI,IAC1D,KAAK,YAAYA,IACR6P,EAAQ,YAAY,SAAS,UAAU,cAAc7P,CAAI,IAClE,KAAK,gBAAgBA,IACZ6P,EAAQ,gBAAgB,gBAAgB,UAAU,cAAc7P,CAAI,IAC7E,KAAK,YAAYA,EAAK,SAAQ,IACrB6P,EAAQ,eAAeA,EAAQ,QAAQC,EAAW9P,CAAI,KAC/D,KAAK,mBAAmBwR,EAAYxR,EAAK,MAAM,GAE/C,KAAK,YAAY,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,KACxC6P,EAAQ,gBAAgB,YAAY,UAAU,cAAc7P,CAAI,KAAKgQ,EAAkBhQ,CAAI,KACpG,KAAK,mBAAmBwR,EAAYxR,CAAI,IAExC,KAAK,YAAYA,IAAO,OAAO,UAAU,SAAS,KAAKA,CAAI,KAjB3D,KAAK,UAAU,IACf,KAAK,YAAY,KAmBd,KAAK,QAAQ,IAAI,cAAc,MAC9B,OAAOA,KAAS,WAClB,KAAK,QAAQ,IAAI,gBAAgB,0BAA0B,IAClD,KAAK,aAAa,KAAK,UAAU,OAC1C,KAAK,QAAQ,IAAI,gBAAgB,KAAK,UAAU,IAAI,IAC3C6P,EAAQ,gBAAgB,gBAAgB,UAAU,cAAc7P,CAAI,KAC7E,KAAK,QAAQ,IAAI,gBAAgB,iDAAiD;AAAA,UAG5F,GAEQ6P,EAAQ,SACV,KAAK,OAAO,WAAW;AACrB,gBAAI6B,IAAWhB,EAAS,IAAI;AAC5B,gBAAIgB;AACF,qBAAOA;AAGT,gBAAI,KAAK;AACP,qBAAO,QAAQ,QAAQ,KAAK,SAAS;AAChC,gBAAI,KAAK;AACd,qBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,gBAAgB,CAAC,CAAC;AACnD,gBAAI,KAAK;AACd,oBAAM,IAAI,MAAM,sCAAsC;AAEtD,mBAAO,QAAQ,QAAQ,IAAI,KAAK,CAAC,KAAK,SAAS,CAAC,CAAC;AAAA,UAE3D,IAGI,KAAK,cAAc,WAAW;AAC5B,gBAAI,KAAK,kBAAkB;AACzB,kBAAIC,IAAajB,EAAS,IAAI;AAC9B,qBAAIiB,MAEO,YAAY,OAAO,KAAK,gBAAgB,IAC1C,QAAQ;AAAA,gBACb,KAAK,iBAAiB,OAAO;AAAA,kBAC3B,KAAK,iBAAiB;AAAA,kBACtB,KAAK,iBAAiB,aAAa,KAAK,iBAAiB;AAAA,gBACvE;AAAA,cACA,IAEiB,QAAQ,QAAQ,KAAK,gBAAgB;AAAA,YAEtD,OAAa;AAAA,kBAAI9B,EAAQ;AACjB,uBAAO,KAAK,OAAO,KAAKkB,CAAqB;AAE7C,oBAAM,IAAI,MAAM,+BAA+B;AAAA;AAAA,UAEvD,GAEI,KAAK,OAAO,WAAW;AACrB,gBAAIW,IAAWhB,EAAS,IAAI;AAC5B,gBAAIgB;AACF,qBAAOA;AAGT,gBAAI,KAAK;AACP,qBAAOR,EAAe,KAAK,SAAS;AAC/B,gBAAI,KAAK;AACd,qBAAO,QAAQ,QAAQE,EAAsB,KAAK,gBAAgB,CAAC;AAC9D,gBAAI,KAAK;AACd,oBAAM,IAAI,MAAM,sCAAsC;AAEtD,mBAAO,QAAQ,QAAQ,KAAK,SAAS;AAAA,UAE7C,GAEQvB,EAAQ,aACV,KAAK,WAAW,WAAW;AACzB,mBAAO,KAAK,OAAO,KAAK+B,EAAM;AAAA,UACtC,IAGI,KAAK,OAAO,WAAW;AACrB,mBAAO,KAAK,KAAI,EAAG,KAAK,KAAK,KAAK;AAAA,UACxC,GAEW;AAAA,QACX;AAGE,YAAIC,IAAU,CAAC,WAAW,UAAU,OAAO,QAAQ,WAAW,SAAS,QAAQ,OAAO,OAAO;AAE7F,iBAASC,GAAgBC,GAAQ;AAC/B,cAAIC,IAAUD,EAAO,YAAW;AAChC,iBAAOF,EAAQ,QAAQG,CAAO,IAAI,KAAKA,IAAUD;AAAA,QACrD;AAEE,iBAASE,EAAQC,GAAO1N,GAAS;AAC/B,cAAI,EAAE,gBAAgByN;AACpB,kBAAM,IAAI,UAAU,4FAA4F;AAGlH,UAAAzN,IAAUA,KAAW,CAAA;AACrB,cAAIxE,IAAOwE,EAAQ;AAEnB,cAAI0N,aAAiBD,GAAS;AAC5B,gBAAIC,EAAM;AACR,oBAAM,IAAI,UAAU,cAAc;AAEpC,iBAAK,MAAMA,EAAM,KACjB,KAAK,cAAcA,EAAM,aACpB1N,EAAQ,YACX,KAAK,UAAU,IAAI6L,EAAQ6B,EAAM,OAAO,IAE1C,KAAK,SAASA,EAAM,QACpB,KAAK,OAAOA,EAAM,MAClB,KAAK,SAASA,EAAM,QAChB,CAAClS,KAAQkS,EAAM,aAAa,SAC9BlS,IAAOkS,EAAM,WACbA,EAAM,WAAW;AAAA,UAEzB;AACM,iBAAK,MAAM,OAAOA,CAAK;AAiBzB,cAdA,KAAK,cAAc1N,EAAQ,eAAe,KAAK,eAAe,gBAC1DA,EAAQ,WAAW,CAAC,KAAK,aAC3B,KAAK,UAAU,IAAI6L,EAAQ7L,EAAQ,OAAO,IAE5C,KAAK,SAASsN,GAAgBtN,EAAQ,UAAU,KAAK,UAAU,KAAK,GACpE,KAAK,OAAOA,EAAQ,QAAQ,KAAK,QAAQ,MACzC,KAAK,SAASA,EAAQ,UAAU,KAAK,WAAW,WAAY;AAC1D,gBAAI,qBAAqBoL,GAAG;AAC1B,kBAAIuC,IAAO,IAAI,gBAAe;AAC9B,qBAAOA,EAAK;AAAA,YACpB;AAAA,UACA,MACI,KAAK,WAAW,OAEX,KAAK,WAAW,SAAS,KAAK,WAAW,WAAWnS;AACvD,kBAAM,IAAI,UAAU,2CAA2C;AAIjE,cAFA,KAAK,UAAUA,CAAI,IAEf,KAAK,WAAW,SAAS,KAAK,WAAW,YACvCwE,EAAQ,UAAU,cAAcA,EAAQ,UAAU,aAAY;AAEhE,gBAAI4N,IAAgB;AACpB,gBAAIA,EAAc,KAAK,KAAK,GAAG;AAE7B,mBAAK,MAAM,KAAK,IAAI,QAAQA,GAAe,UAAS,oBAAI,QAAO,SAAS;AAAA,iBACnE;AAEL,kBAAIC,IAAgB;AACpB,mBAAK,QAAQA,EAAc,KAAK,KAAK,GAAG,IAAI,MAAM,OAAO,QAAO,oBAAI,KAAI,GAAG,QAAO;AAAA,YAC5F;AAAA,UACA;AAAA,QAEA;AAEE,QAAAJ,EAAQ,UAAU,QAAQ,WAAW;AACnC,iBAAO,IAAIA,EAAQ,MAAM,EAAC,MAAM,KAAK,UAAS,CAAC;AAAA,QACnD;AAEE,iBAASL,GAAO5R,GAAM;AACpB,cAAIsS,IAAO,IAAI,SAAQ;AACvB,iBAAAtS,EACG,KAAI,EACJ,MAAM,GAAG,EACT,QAAQ,SAASuS,GAAO;AACvB,gBAAIA,GAAO;AACT,kBAAIC,IAAQD,EAAM,MAAM,GAAG,GACvB9J,IAAO+J,EAAM,MAAK,EAAG,QAAQ,OAAO,GAAG,GACvCtT,IAAQsT,EAAM,KAAK,GAAG,EAAE,QAAQ,OAAO,GAAG;AAC9C,cAAAF,EAAK,OAAO,mBAAmB7J,CAAI,GAAG,mBAAmBvJ,CAAK,CAAC;AAAA,YACzE;AAAA,UACA,CAAO,GACIoT;AAAA,QACX;AAEE,iBAASG,EAAaC,GAAY;AAChC,cAAItU,IAAU,IAAIiS,EAAO,GAGrBsC,IAAsBD,EAAW,QAAQ,gBAAgB,GAAG;AAIhE,iBAAAC,EACG,MAAM,IAAI,EACV,IAAI,SAASrC,GAAQ;AACpB,mBAAOA,EAAO,QAAQ;AAAA,CAAI,MAAM,IAAIA,EAAO,OAAO,GAAGA,EAAO,MAAM,IAAIA;AAAA,UAC9E,CAAO,EACA,QAAQ,SAAS7Q,GAAM;AACtB,gBAAImT,IAAQnT,EAAK,MAAM,GAAG,GACtB6I,IAAMsK,EAAM,MAAK,EAAG,KAAI;AAC5B,gBAAItK,GAAK;AACP,kBAAIpJ,KAAQ0T,EAAM,KAAK,GAAG,EAAE,KAAI;AAChC,kBAAI;AACF,gBAAAxU,EAAQ,OAAOkK,GAAKpJ,EAAK;AAAA,cACrC,SAAmB2T,IAAO;AACd,wBAAQ,KAAK,cAAcA,GAAM,OAAO;AAAA,cACpD;AAAA,YACA;AAAA,UACA,CAAO,GACIzU;AAAA,QACX;AAEE,QAAAqT,EAAK,KAAKQ,EAAQ,SAAS;AAE3B,iBAASa,EAASC,GAAUvO,GAAS;AACnC,cAAI,EAAE,gBAAgBsO;AACpB,kBAAM,IAAI,UAAU,4FAA4F;AAQlH,cANKtO,MACHA,IAAU,CAAA,IAGZ,KAAK,OAAO,WACZ,KAAK,SAASA,EAAQ,WAAW,SAAY,MAAMA,EAAQ,QACvD,KAAK,SAAS,OAAO,KAAK,SAAS;AACrC,kBAAM,IAAI,WAAW,0FAA0F;AAEjH,eAAK,KAAK,KAAK,UAAU,OAAO,KAAK,SAAS,KAC9C,KAAK,aAAaA,EAAQ,eAAe,SAAY,KAAK,KAAKA,EAAQ,YACvE,KAAK,UAAU,IAAI6L,EAAQ7L,EAAQ,OAAO,GAC1C,KAAK,MAAMA,EAAQ,OAAO,IAC1B,KAAK,UAAUuO,CAAQ;AAAA,QAC3B;AAEE,QAAAtB,EAAK,KAAKqB,EAAS,SAAS,GAE5BA,EAAS,UAAU,QAAQ,WAAW;AACpC,iBAAO,IAAIA,EAAS,KAAK,WAAW;AAAA,YAClC,QAAQ,KAAK;AAAA,YACb,YAAY,KAAK;AAAA,YACjB,SAAS,IAAIzC,EAAQ,KAAK,OAAO;AAAA,YACjC,KAAK,KAAK;AAAA,WACX;AAAA,QACL,GAEEyC,EAAS,QAAQ,WAAW;AAC1B,cAAI1D,IAAW,IAAI0D,EAAS,MAAM,EAAC,QAAQ,KAAK,YAAY,GAAE,CAAC;AAC/D,iBAAA1D,EAAS,KAAK,IACdA,EAAS,SAAS,GAClBA,EAAS,OAAO,SACTA;AAAA,QACX;AAEE,YAAI4D,KAAmB,CAAC,KAAK,KAAK,KAAK,KAAK,GAAG;AAE/C,QAAAF,EAAS,WAAW,SAASG,GAAKC,GAAQ;AACxC,cAAIF,GAAiB,QAAQE,CAAM,MAAM;AACvC,kBAAM,IAAI,WAAW,qBAAqB;AAG5C,iBAAO,IAAIJ,EAAS,MAAM,EAAC,QAAQI,GAAQ,SAAS,EAAC,UAAUD,EAAG,EAAC,CAAC;AAAA,QACxE,GAEEtD,EAAQ,eAAeC,EAAE;AACzB,YAAI;AACF,cAAID,EAAQ,aAAY;AAAA,QAC5B,QAAgB;AACZ,UAAAA,EAAQ,eAAe,SAAS3Q,GAASyJ,GAAM;AAC7C,iBAAK,UAAUzJ,GACf,KAAK,OAAOyJ;AACZ,gBAAIoK,IAAQ,MAAM7T,CAAO;AACzB,iBAAK,QAAQ6T,EAAM;AAAA,UACzB,GACIlD,EAAQ,aAAa,YAAY,OAAO,OAAO,MAAM,SAAS,GAC9DA,EAAQ,aAAa,UAAU,cAAcA,EAAQ;AAAA,QACzD;AAEE,iBAASwD,GAAMjB,GAAOkB,GAAM;AAC1B,iBAAO,IAAI,QAAQ,SAASvC,GAASC,GAAQ;AAC3C,gBAAIzB,IAAU,IAAI4C,EAAQC,GAAOkB,CAAI;AAErC,gBAAI/D,EAAQ,UAAUA,EAAQ,OAAO;AACnC,qBAAOyB,EAAO,IAAInB,EAAQ,aAAa,WAAW,YAAY,CAAC;AAGjE,gBAAI0D,IAAM,IAAI,eAAc;AAE5B,qBAASC,KAAW;AAClB,cAAAD,EAAI,MAAK;AAAA,YACjB;AAEM,YAAAA,EAAI,SAAS,WAAW;AACtB,kBAAI7O,IAAU;AAAA,gBACZ,YAAY6O,EAAI;AAAA,gBAChB,SAASZ,EAAaY,EAAI,sBAAqB,KAAM,EAAE;AAAA;AAIzD,cAAIhE,EAAQ,IAAI,QAAQ,SAAS,MAAM,MAAMgE,EAAI,SAAS,OAAOA,EAAI,SAAS,OAC5E7O,EAAQ,SAAS,MAEjBA,EAAQ,SAAS6O,EAAI,QAEvB7O,EAAQ,MAAM,iBAAiB6O,IAAMA,EAAI,cAAc7O,EAAQ,QAAQ,IAAI,eAAe;AAC1F,kBAAIxE,KAAO,cAAcqT,IAAMA,EAAI,WAAWA,EAAI;AAClD,yBAAW,WAAW;AACpB,gBAAAxC,EAAQ,IAAIiC,EAAS9S,IAAMwE,CAAO,CAAC;AAAA,cAC7C,GAAW,CAAC;AAAA,YACZ,GAEM6O,EAAI,UAAU,WAAW;AACvB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAI,UAAU,wBAAwB,CAAC;AAAA,cACxD,GAAW,CAAC;AAAA,YACZ,GAEMuC,EAAI,YAAY,WAAW;AACzB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAI,UAAU,2BAA2B,CAAC;AAAA,cAC3D,GAAW,CAAC;AAAA,YACZ,GAEMuC,EAAI,UAAU,WAAW;AACvB,yBAAW,WAAW;AACpB,gBAAAvC,EAAO,IAAInB,EAAQ,aAAa,WAAW,YAAY,CAAC;AAAA,cAClE,GAAW,CAAC;AAAA,YACZ;AAEM,qBAAS4D,GAAON,GAAK;AACnB,kBAAI;AACF,uBAAOA,MAAQ,MAAMrD,EAAE,SAAS,OAAOA,EAAE,SAAS,OAAOqD;AAAA,cACnE,QAAoB;AACV,uBAAOA;AAAA,cACjB;AAAA,YACA;AAoBM,gBAlBAI,EAAI,KAAKhE,EAAQ,QAAQkE,GAAOlE,EAAQ,GAAG,GAAG,EAAI,GAE9CA,EAAQ,gBAAgB,YAC1BgE,EAAI,kBAAkB,KACbhE,EAAQ,gBAAgB,WACjCgE,EAAI,kBAAkB,KAGpB,kBAAkBA,MAChBxD,EAAQ,OACVwD,EAAI,eAAe,SAEnBxD,EAAQ,gBAERwD,EAAI,eAAe,iBAInBD,KAAQ,OAAOA,EAAK,WAAY,YAAY,EAAEA,EAAK,mBAAmB/C,KAAYT,EAAE,WAAWwD,EAAK,mBAAmBxD,EAAE,UAAW;AACtI,kBAAI4D,KAAQ,CAAA;AACZ,qBAAO,oBAAoBJ,EAAK,OAAO,EAAE,QAAQ,SAAS3K,GAAM;AAC9D,gBAAA+K,GAAM,KAAKvD,EAAcxH,CAAI,CAAC,GAC9B4K,EAAI,iBAAiB5K,GAAMyH,EAAekD,EAAK,QAAQ3K,CAAI,CAAC,CAAC;AAAA,cACvE,CAAS,GACD4G,EAAQ,QAAQ,QAAQ,SAASnQ,GAAOuJ,IAAM;AAC5C,gBAAI+K,GAAM,QAAQ/K,EAAI,MAAM,MAC1B4K,EAAI,iBAAiB5K,IAAMvJ,CAAK;AAAA,cAE5C,CAAS;AAAA,YACT;AACQ,cAAAmQ,EAAQ,QAAQ,QAAQ,SAASnQ,GAAOuJ,IAAM;AAC5C,gBAAA4K,EAAI,iBAAiB5K,IAAMvJ,CAAK;AAAA,cAC1C,CAAS;AAGH,YAAImQ,EAAQ,WACVA,EAAQ,OAAO,iBAAiB,SAASiE,EAAQ,GAEjDD,EAAI,qBAAqB,WAAW;AAElC,cAAIA,EAAI,eAAe,KACrBhE,EAAQ,OAAO,oBAAoB,SAASiE,EAAQ;AAAA,YAEhE,IAGMD,EAAI,KAAK,OAAOhE,EAAQ,YAAc,MAAc,OAAOA,EAAQ,SAAS;AAAA,UAClF,CAAK;AAAA,QACL;AAEE,eAAA8D,GAAM,WAAW,IAEZvD,EAAE,UACLA,EAAE,QAAQuD,IACVvD,EAAE,UAAUS,GACZT,EAAE,UAAUqC,GACZrC,EAAE,WAAWkD,IAGfnD,EAAQ,UAAUU,GAClBV,EAAQ,UAAUsC,GAClBtC,EAAQ,WAAWmD,GACnBnD,EAAQ,QAAQwD,IAEhB,OAAO,eAAexD,GAAS,cAAc,EAAE,OAAO,IAAM,GAErDA;AAAA,MAET,GAAG,CAAA,CAAE;AAAA,IACL,GAAGH,CAAc,GAEjBA,EAAe,MAAM,WAAW,IAChC,OAAOA,EAAe,MAAM;AAE5B,QAAIiE,IAAMnE,EAAW,QAAQA,IAAaE;AAC1C,IAAAG,IAAU8D,EAAI,OACd9D,EAAA,UAAkB8D,EAAI,OACtB9D,EAAA,QAAgB8D,EAAI,OACpB9D,EAAA,UAAkB8D,EAAI,SACtB9D,EAAA,UAAkB8D,EAAI,SACtB9D,EAAA,WAAmB8D,EAAI,UACvBC,EAAA,UAAiB/D;AAAA;;;;;;UCnqBXgE,KAAiB,CAACvV,MAAY;AAChC,MAAIwV,IAAW,CAAA;AACf,SAAIxV,MACK,OAAO,UAAY,OAAeA,aAAmB,WACrDyV,MAAcC,GAAAA,WAAsB1V,aAAmB0V,GAAAA,UACxDF,IAAWzV,GAA6BC,CAAO,IAE1C,MAAM,QAAQA,CAAO,IAC1BA,EAAQ,QAAQ,CAAC,CAACqK,GAAMvJ,CAAK,MAAM;AAC/B,IAAIuJ,KAAQvJ,MAAU,WAClB0U,EAASnL,CAAI,IAAIvJ;AAAA,EAEzB,CAAC,IAGD0U,IAAWxV,IAGZwV;AACX,GAIMG,KAAa,CAACld,MAAQA,EAAI,QAAQ,uBAAuB,GAAG,EAAE,KAAI,GAIlEmd,KAAqB,CAACC,MAAW;AACnC,MAAI,CAAC,MAAM,QAAQA,EAAO,KAAK,GAAG;AAC9B,UAAMC,IAAUD,GACVE,IAAS,CAAC,SAAS,mBAAmBJ,GAAWG,EAAQ,KAAK,CAAC,CAAC,EAAE;AACxE,WAAID,EAAO,aACPE,EAAO,KAAK,aAAa,mBAAmBD,EAAQ,eAAe,UAAUA,EAAQ,SAAS,CAAC,CAAC,EAAE,GAElGA,EAAQ,iBACRC,EAAO,KAAK,iBAAiB,mBAAmBD,EAAQ,aAAa,CAAC,EAAE,GAErEC,EAAO,KAAK,GAAG;AAAA,EAC1B;AACA,MAAI,OAAOF,EAAO,YAAc,OAAe,CAAC,MAAM,QAAQA,EAAO,SAAS;AAC1E,UAAM,IAAI,MAAM,8DAA8D;AAGlF,QAAMC,IAAUD,GACVG,IAAUH,EAAO,MAAM,OAAO,CAACI,GAAKC,GAAc9H,OACpD6H,EAAI,KAAK;AAAA,IACL,OAAON,GAAWO,CAAY;AAAA,IAC9B,WAAWJ,EAAQ,YAAYA,EAAQ,eAAe,UAAUA,EAAQ,UAAU1H,CAAK,CAAC,IAAI;AAAA,EACxG,CAAS,GACM6H,IACR,CAAA,CAAE;AACL,SAAO,SAAS,mBAAmBH,EAAQ,eAAe,UAAUE,CAAO,CAAC,CAAC;AACjF,GACMG,KAA0B,CAACxC,MAAW,OAAOkC,MAAW;AAC1D,QAAM,EAAE,KAAAhB,GAAK,OAAAuB,GAAO,WAAAhW,GAAW,eAAAsQ,GAAe,OAAAqE,GAAO,cAAAsB,GAAc,YAAAC,EAAU,IAAKT,GAC5E7V,IAAU,EAAE,GAAG6V,EAAO,QAAO;AACnC,MAAIU,IAAc,IACd3U;AACJ,EAAI+R,MAAW,UACX/R,IAAO4U,GAAkBJ,GAAOhW,GAAWsQ,GAAe2F,EAAa,cAAc,GACjF,OAAOzU,KAAS,aAEhB5B,EAAQ,cAAc,IAAI,uBAK9BuW,IAAcX,GAAmB;AAAA,IAC7B,OAAAQ;AAAA,IACA,WAAAhW;AAAA,IACA,eAAAsQ;AAAA,IACA,gBAAgB2F,EAAa,kBAAkBxW;AAAA,EAC3D,CAAS;AAEL,QAAMmV,IAAO;AAAA,IACT,QAAArB;AAAA,IACA,SAAA3T;AAAA,IACA,MAAA4B;AAAA,IACA,GAAGyU;AAAA,EACX;AACI,MAAII,IAAc5B,GACd6B,IAAe1B;AACnB,MAAIsB,GAAY;AACZ,UAAMzP,IAAS,MAAM,QAAQ,QAAQyP,EAAW,EAAE,GAAGtB,GAAM,KAAAH,GAAK,eAAAnE,GAAe,WAAAtQ,EAAS,CAAE,CAAC,GACrF,EAAE,KAAKuW,GAAQ,GAAGC,EAAO,IAAK/P;AACpC,IAAA4P,IAAcE,GACdD,IAAeE;AAAA,EACnB;AACA,SAAIL,MACAE,IAAc,GAAGA,CAAW,IAAIF,CAAW,KAExC,MAAMxB,EAAM0B,GAAaC,CAAY;AAChD;AAIO,MAAMG,GAAc;AAAA,EACvB,YAAYhC,GAAKiC,IAAgB,IAAI;AACjC,SAAK,MAAMjC,GACX,KAAK,gBAAgBiC,GAIrB,KAAK,aAAa,UAAU5a,MAAS;AACjC,YAAM,CAACqE,GAAgBH,GAAWC,CAAc,IAAInE,GAC9C6a,IAAoBzW,GAAoBC,GAAgBH,GAAWC,CAAc,GACjF,EAAE,SAAAL,GAAS,OAAA+U,IAAQiC,IAAY,QAAArD,IAAS,QAAQ,mBAAAsD,GAAmB,oBAAAC,GAAoB,GAAGb,EAAY,IAAK,KAAK,eAChH,EAAE,KAAAxB,EAAG,IAAK;AAChB,MAAIkC,EAAkB,WAAW,WAC7BV,EAAa,SAASU,EAAkB;AAE5C,YAAM,EAAE,eAAArG,EAAa,IAAKG,GAAuBkG,EAAkB,KAAK;AACxE,aAAOI,GAAY;AAAA,QACf,KAAAtC;AAAA,QACA,OAAOkC,EAAkB;AAAA,QACzB,WAAWA,EAAkB;AAAA,QAC7B,SAAS;AAAA,UACL,GAAGxB,GAAe6B,GAAepX,CAAO,CAAC;AAAA,UACzC,GAAGuV,GAAewB,EAAkB,cAAc;AAAA,QACtE;AAAA,QACgB,eAAArG;AAAA,QACA,OAAAqE;AAAA,QACA,QAAApB;AAAA,QACA,cAAA0C;AAAA,QACA,YAAYY;AAAA,MAC5B,CAAa,EACI,KAAK,CAACjG,OACHkG,KACAA,EAAmBlG,CAAQ,GAExBA,EACV,EACI,MAAM,CAACyD,MAAU;AAClB,cAAIyC,KACAA,EAAmBzC,CAAK,GAEtBA;AAAA,MACV,CAAC;AAAA,IACL;AAAA,EACJ;AAAA,EACA,MAAM,QAAQtU,MAAsBkX,GAA4B;AAC5D,UAAM,CAACjX,GAAWC,CAAc,IAAIgX,GAC9BC,IAAiBpX,GAAiBC,GAAmBC,GAAWC,CAAc,GAC9E,EAAE,SAAAL,GAAS,OAAA+U,IAAQiC,IAAY,QAAArD,IAAS,QAAQ,mBAAAsD,GAAmB,oBAAAC,GAAoB,GAAGb,EAAY,IAAK,KAAK,eAChH,EAAE,KAAAxB,EAAG,IAAK;AAChB,IAAIyC,EAAe,WAAW,WAC1BjB,EAAa,SAASiB,EAAe;AAEzC,UAAM,EAAE,OAAAlB,GAAO,eAAA1F,EAAa,IAAKG,GAAuByG,EAAe,QAAQ;AAC/E,WAAOH,GAAY;AAAA,MACf,KAAAtC;AAAA,MACA,OAAAuB;AAAA,MACA,WAAWkB,EAAe;AAAA,MAC1B,SAAS;AAAA,QACL,GAAG/B,GAAe6B,GAAepX,CAAO,CAAC;AAAA,QACzC,GAAGuV,GAAe+B,EAAe,cAAc;AAAA,MAC/D;AAAA,MACY,eAAA5G;AAAA,MACA,OAAAqE;AAAA,MACA,QAAApB;AAAA,MACA,cAAA0C;AAAA,MACA,YAAYY;AAAA,IACxB,CAAS,EACI,KAAK,CAACjG,OACHkG,KACAA,EAAmBlG,CAAQ,GAExBA,EAAS,KACnB,EACI,MAAM,CAACyD,MAAU;AAClB,YAAIyC,KACAA,EAAmBzC,CAAK,GAEtBA;AAAA,IACV,CAAC;AAAA,EACL;AAAA;AAAA,EAEA,cAAchU,GAAoBJ,GAAgB;AAC9C,UAAMkX,IAAsB/W,GAAsBC,GAAoBJ,CAAc,GAC9E,EAAE,SAAAL,GAAS,GAAGqW,EAAY,IAAK,KAAK;AAC1C,IAAIkB,EAAoB,WAAW,WAC/BlB,EAAa,SAASkB,EAAoB;AAE9C,UAAMC,IAAUD,EAAoB,UAAU,IAAI,CAAC,EAAE,UAAApM,EAAQ,MAAO0F,GAAuB1F,CAAQ,EAAE,KAAK,GACpG/K,IAAYmX,EAAoB,UAAU,IAAI,CAAC,EAAE,WAAAnX,EAAS,MAAOA,CAAS;AAChF,WAAO+W,GAAY;AAAA,MACf,KAAK,KAAK;AAAA,MACV,OAAOK;AAAA;AAAA,MAEP,WAAApX;AAAA,MACA,SAAS;AAAA,QACL,GAAGmV,GAAe6B,GAAepX,CAAO,CAAC;AAAA,QACzC,GAAGuV,GAAegC,EAAoB,cAAc;AAAA,MACpE;AAAA,MACY,eAAe;AAAA,MACf,OAAO,KAAK,cAAc,SAASP;AAAA,MACnC,QAAQ,KAAK,cAAc,UAAU;AAAA,MACrC,cAAAX;AAAA,MACA,YAAY,KAAK,cAAc;AAAA,IAC3C,CAAS,EACI,KAAK,CAACrF,OACH,KAAK,cAAc,sBACnB,KAAK,cAAc,mBAAmBA,CAAQ,GAE3CA,EAAS,KACnB,EACI,MAAM,CAACyD,MAAU;AAClB,YAAI,KAAK,cAAc,sBACnB,KAAK,cAAc,mBAAmBA,CAAK,GAEzCA;AAAA,IACV,CAAC;AAAA,EACL;AAAA,EACA,WAAWzU,GAAS;AAChB,gBAAK,cAAc,UAAUA,GACtB;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,UAAUkK,GAAKpJ,GAAO;AAClB,UAAM,EAAE,SAAAd,MAAY,KAAK;AACzB,WAAIA,IAGAA,EAAQkK,CAAG,IAAIpJ,IAGf,KAAK,cAAc,UAAU,EAAE,CAACoJ,CAAG,GAAGpJ,EAAK,GAExC;AAAA,EACX;AAAA;AAAA;AAAA;AAAA,EAIA,YAAYA,GAAO;AACf,gBAAK,MAAMA,GACJ;AAAA,EACX;AACJ;AACA,MAAMqW,KAAc,OAAOtB,MAAW;AAClC,QAAM,EAAE,OAAAO,GAAO,WAAAhW,GAAW,cAAAiW,EAAY,IAAKR,GACrC4B,IAAUtB,GAAwBrW,GAAU+V,EAAO,UAAU,MAAM,CAAC,GACpE6B,IAAkB,MAAM,QAAQ7B,EAAO,KAAK,GAC5C7E,IAAW,MAAMyG,EAAQ5B,CAAM,GAC/BhP,IAAS,MAAM8Q,GAAU3G,GAAUqF,EAAa,kBAAkBxW,EAAqB,GACvF+X,IAA2B,MAAM,QAAQ/Q,CAAM,IAC/C,CAACA,EAAO,KAAK,CAAC,EAAE,MAAAgR,EAAI,MAAO,CAACA,CAAI,IAChC,EAAQhR,EAAO,MACfiR,IAAgC,MAAM,QAAQjR,CAAM,KACtD,CAACA,EAAO,UACP,MAAM,QAAQA,EAAO,MAAM,KAAK,CAACA,EAAO,OAAO,UAChDwP,EAAa,gBAAgB,SAC7BA,EAAa,gBAAgB;AACjC,MAAIrF,EAAS,MAAM8G,KAAiCF,GAA0B;AAE1E,UAAM,EAAE,QAAQjV,GAAG,GAAGoV,EAAI,KAAK,MAAM,QAAQlR,CAAM,GAAIA,IACjDgR,IAAOxB,EAAa,gBAAgB,WAAW0B,IAAOlR;AAG5D,WAAO;AAAA,MACH,GAHiB6Q,IAAkB,EAAE,MAAAG,EAAI,IAAKA;AAAA,MAI9C,SAAS7G,EAAS;AAAA,MAClB,QAAQA,EAAS;AAAA,IAC7B;AAAA,EACI,OACK;AACD,UAAMgH,IAAc,OAAOnR,KAAW,WAChC;AAAA,MACE,OAAOA;AAAA,IACvB,IACcA;AACN,UAAM,IAAIkK;AAAA;AAAA,MAEV,EAAE,GAAGiH,GAAa,QAAQhH,EAAS,QAAQ,SAASA,EAAS,QAAO;AAAA,MAAI,EAAE,OAAAoF,GAAO,WAAAhW,EAAS;AAAA,IAAE;AAAA,EAChG;AACJ,GAyEMoW,KAAoB,CAACJ,GAAOhW,GAAWsQ,GAAeuH,MAAmB;AAC3E,QAAMC,IAAkBD,KAAkBpY;AAC1C,MAAI,CAAC,MAAM,QAAQuW,CAAK;AACpB,WAAO8B,EAAgB,UAAU,EAAE,OAAA9B,GAAO,WAAAhW,GAAW,eAAAsQ,EAAa,CAAE;AAExE,MAAI,OAAOtQ,IAAc,OAAe,CAAC,MAAM,QAAQA,CAAS;AAC5D,UAAM,IAAI,MAAM,qEAAqE;AAGzF,QAAM4V,IAAUI,EAAM,OAAO,CAACH,GAAKC,GAAc9H,OAC7C6H,EAAI,KAAK,EAAE,OAAOC,GAAc,WAAW9V,IAAYA,EAAUgO,CAAK,IAAI,QAAW,GAC9E6H,IACR,CAAA,CAAE;AACL,SAAOiC,EAAgB,UAAUlC,CAAO;AAC5C,GACM2B,KAAY,OAAO3G,GAAUiH,MAAmB;AAClD,MAAIE;AAMJ,SALAnH,EAAS,QAAQ,QAAQ,CAAClQ,GAAOoJ,MAAQ;AACrC,IAAIA,EAAI,kBAAkB,mBACtBiO,IAAcrX;AAAA,EAEtB,CAAC,GACGqX,MACCA,EAAY,YAAW,EAAG,WAAW,kBAAkB,KACpDA,EAAY,YAAW,EAAG,WAAW,0BAA0B,KAC/DA,EAAY,YAAW,EAAG,WAAW,mCAAmC,KACrEF,EAAe,MAAM,MAAMjH,EAAS,KAAI,CAAE,IAG1CA,EAAS,KAAI;AAE5B,GACMoG,KAAiB,CAACtW,MACb,OAAOA,KAAU,aAAaA,EAAK,IAAKA,GAgBtCsX,KAAM,CAACC,MAAWjY,MACpBiY,EAAO,OAAO,CAACpC,GAAKqC,GAAOlK,MAAU,GAAG6H,CAAG,GAAGqC,CAAK,GAAGlK,KAAShO,IAAY,OAAOA,EAAUgO,CAAK,CAAC,IAAI,EAAE,IAAI,EAAE,GCnZnHoJ,KAAU;AAAA,EACf,SAASY;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAWV,GCZMG,KAAWH;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,GCWXI,KAAa,CAACta,MACZ,KAAK,MAAMA,GAAK,CAACgM,GAAKpJ,MAAU;AACtC,MAAI,OAAOA,KAAU;AACpB,QAAI;AACH,aAAO,KAAK,MAAMA,GAAO,CAAC2X,GAAM3X,MAC3B,OAAOA,KAAU,YAAY,CAAC,MAAM,OAAOA,CAAK,CAAC,IAC7C,IAAI/D,GAAQ+D,CAAK,IAGlBA,CACP;AAAA,IACF,QAAQ;AAEP,aAAOA;AAAA,IACR;AAAA,WACU,CAAC,MAAM,OAAOA,CAAK,CAAC;AAC9B,WAAO,IAAI/D,GAAQ+D,CAAwB;AAE5C,SAAOA;AACR,CAAC,GAUI2S,KAAU;AAAA,EACf,SAAS,OAAOiF,GAAiB7D,MAAwC;AACxE,UAAM8D,IAAS,IAAI9B,GAAchC,KAAO,YAAY;AAAA,MACnD,OAAO,OAAO;AAAA,MACd,gBAAgB;AAAA,QACf,WAAW,CAAA3W,MAAO,KAAK,UAAUA,CAAG;AAAA;AAAA,QACpC,OAAOsa;AAAA;AAAA,MAAA;AAAA,IACR,CACA,GAEK,EAAE,SAAAI,EAAA,IAAY,MAAMD,EAAO,QAA6C;AAAA,MAC7E,UAAUnB,GAAQ;AAAA,MAClB,WAAW,EAAE,SAAAkB,EAAA;AAAA,IAAQ,CACrB;AAED,WAAOE;AAAA,EACR;AACD;","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]}