npm - @burdenoff/microfe-planmagnet - Versions diffs - 2026.1008.1 → 2026.1008.3 - Mend

@burdenoff/microfe-planmagnet 2026.1008.1 → 2026.1008.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 (1970) hide show

package/dist/node_modules/decimal.js-light/decimal.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"decimal.js","names":[],"sources":["../../../node_modules/decimal.js-light/decimal.js"],"sourcesContent":["/*! decimal.js-light v2.5.1 https://github.com/MikeMcl/decimal.js-light/LICENCE */\r\n;(function (globalScope) {\r\n 'use strict';\r\n\r\n\r\n /*\r\n * decimal.js-light v2.5.1\r\n * An arbitrary-precision Decimal type for JavaScript.\r\n * https://github.com/MikeMcl/decimal.js-light\r\n * Copyright (c) 2020 Michael Mclaughlin <M8ch88l@gmail.com>\r\n * MIT Expat Licence\r\n */\r\n\r\n\r\n // ----------------------------------- EDITABLE DEFAULTS ------------------------------------ //\r\n\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 var MAX_DIGITS = 1e9, // 0 to 1e9\r\n\r\n\r\n // The initial configuration properties of the Decimal constructor.\r\n Decimal = {\r\n\r\n // These values must be integers within the stated ranges (inclusive).\r\n // Most of these values can be changed during run-time using `Decimal.config`.\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 by default by `toInteger`, `toDecimalPlaces`, `toExponential`,\r\n // `toFixed`, `toPrecision` and `toSignificantDigits`.\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 exponent value at and beneath which `toString` returns exponential notation.\r\n // JavaScript numbers: -7\r\n toExpNeg: -7, // 0 to -MAX_E\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 MAX_E\r\n\r\n // The natural logarithm of 10.\r\n // 115 digits\r\n LN10: '2.302585092994045684017991454684364207601101488628772976033327900967572609677352480235997205089598298341967784042286'\r\n },\r\n\r\n\r\n // ----------------------------------- END OF EDITABLE DEFAULTS ------------------------------- //\r\n\r\n\r\n external = true,\r\n\r\n decimalError = '[DecimalError] ',\r\n invalidArgument = decimalError + 'Invalid argument: ',\r\n exponentOutOfRange = decimalError + 'Exponent out of range: ',\r\n\r\n mathfloor = Math.floor,\r\n mathpow = Math.pow,\r\n\r\n isDecimal = /^(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i,\r\n\r\n ONE,\r\n BASE = 1e7,\r\n LOG_BASE = 7,\r\n MAX_SAFE_INTEGER = 9007199254740991,\r\n MAX_E = mathfloor(MAX_SAFE_INTEGER / LOG_BASE), // 1286742750677284\r\n\r\n // Decimal.prototype object\r\n P = {};\r\n\r\n\r\n // Decimal prototype methods\r\n\r\n\r\n /*\r\n * absoluteValue abs\r\n * comparedTo cmp\r\n * decimalPlaces dp\r\n * dividedBy div\r\n * dividedToIntegerBy idiv\r\n * equals eq\r\n * exponent\r\n * greaterThan gt\r\n * greaterThanOrEqualTo gte\r\n * isInteger isint\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 * 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 * squareRoot sqrt\r\n * times mul\r\n * toDecimalPlaces todp\r\n * toExponential\r\n * toFixed\r\n * toInteger toint\r\n * toNumber\r\n * toPower pow\r\n * toPrecision\r\n * toSignificantDigits tosd\r\n * toString\r\n * valueOf val\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\n P.absoluteValue = P.abs = function () {\r\n var x = new this.constructor(this);\r\n if (x.s) x.s = 1;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return\r\n * 1 if the value of this 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 *\r\n */\r\n P.comparedTo = P.cmp = function (y) {\r\n var i, j, xdL, ydL,\r\n x = this;\r\n\r\n y = new x.constructor(y);\r\n\r\n // Signs differ?\r\n if (x.s !== y.s) return x.s || -y.s;\r\n\r\n // Compare exponents.\r\n if (x.e !== y.e) return x.e > y.e ^ x.s < 0 ? 1 : -1;\r\n\r\n xdL = x.d.length;\r\n ydL = y.d.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 (x.d[i] !== y.d[i]) return x.d[i] > y.d[i] ^ x.s < 0 ? 1 : -1;\r\n }\r\n\r\n // Compare lengths.\r\n return xdL === ydL ? 0 : xdL > ydL ^ x.s < 0 ? 1 : -1;\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\n P.decimalPlaces = P.dp = function () {\r\n var x = this,\r\n w = x.d.length - 1,\r\n dp = (w - x.e) * LOG_BASE;\r\n\r\n // Subtract the number of trailing zeros of the last word.\r\n w = x.d[w];\r\n if (w) for (; w % 10 == 0; w /= 10) dp--;\r\n\r\n return dp < 0 ? 0 : dp;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal divided by `y`, truncated to\r\n * `precision` significant digits.\r\n *\r\n */\r\n P.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`, truncated to `precision` significant digits.\r\n *\r\n */\r\n P.dividedToIntegerBy = P.idiv = function (y) {\r\n var x = this,\r\n Ctor = x.constructor;\r\n return round(divide(x, new Ctor(y), 0, 1), Ctor.precision);\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\n P.equals = P.eq = function (y) {\r\n return !this.cmp(y);\r\n };\r\n\r\n\r\n /*\r\n * Return the (base 10) exponent value of this Decimal (this.e is the base 10000000 exponent).\r\n *\r\n */\r\n P.exponent = function () {\r\n return getBase10Exponent(this);\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\n P.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\n P.greaterThanOrEqualTo = P.gte = 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 an integer, otherwise return false.\r\n *\r\n */\r\n P.isInteger = P.isint = function () {\r\n return this.e > this.d.length - 2;\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\n P.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\n P.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, otherwise return false.\r\n *\r\n */\r\n P.isZero = 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 less than `y`, otherwise return false.\r\n *\r\n */\r\n P.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\n P.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, truncated to\r\n * `precision` significant digits.\r\n *\r\n * If no base is specified, return log[10](x).\r\n *\r\n * log[base](x) = ln(x) / ln(base)\r\n *\r\n * The maximum error of the result is 1 ulp (unit in the last place).\r\n *\r\n * [base] {number|string|Decimal} The base of the logarithm.\r\n *\r\n */\r\n P.logarithm = P.log = function (base) {\r\n var r,\r\n x = this,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision,\r\n wpr = pr + 5;\r\n\r\n // Default base is 10.\r\n if (base === void 0) {\r\n base = new Ctor(10);\r\n } else {\r\n base = new Ctor(base);\r\n\r\n // log[-b](x) = NaN\r\n // log[0](x) = NaN\r\n // log[1](x) = NaN\r\n if (base.s < 1 || base.eq(ONE)) throw Error(decimalError + 'NaN');\r\n }\r\n\r\n // log[b](-x) = NaN\r\n // log[b](0) = -Infinity\r\n if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n // log[b](1) = 0\r\n if (x.eq(ONE)) return new Ctor(0);\r\n\r\n external = false;\r\n r = divide(ln(x, wpr), ln(base, wpr), wpr);\r\n external = true;\r\n\r\n return round(r, pr);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal minus `y`, truncated to\r\n * `precision` significant digits.\r\n *\r\n */\r\n P.minus = P.sub = function (y) {\r\n var x = this;\r\n y = new x.constructor(y);\r\n return x.s == y.s ? subtract(x, y) : add(x, (y.s = -y.s, y));\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, truncated to\r\n * `precision` significant digits.\r\n *\r\n */\r\n P.modulo = P.mod = function (y) {\r\n var q,\r\n x = this,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision;\r\n\r\n y = new Ctor(y);\r\n\r\n // x % 0 = NaN\r\n if (!y.s) throw Error(decimalError + 'NaN');\r\n\r\n // Return x if x is 0.\r\n if (!x.s) return round(new Ctor(x), pr);\r\n\r\n // Prevent rounding of intermediate calculations.\r\n external = false;\r\n q = divide(x, y, 0, 1).times(y);\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, truncated to `precision`\r\n * significant digits.\r\n *\r\n */\r\n P.naturalExponential = P.exp = function () {\r\n return exp(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 * truncated to `precision` significant digits.\r\n *\r\n */\r\n P.naturalLogarithm = P.ln = function () {\r\n return ln(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\n P.negated = P.neg = function () {\r\n var x = new this.constructor(this);\r\n x.s = -x.s || 0;\r\n return x;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal plus `y`, truncated to\r\n * `precision` significant digits.\r\n *\r\n */\r\n P.plus = P.add = function (y) {\r\n var x = this;\r\n y = new x.constructor(y);\r\n return x.s == y.s ? add(x, y) : subtract(x, (y.s = -y.s, 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\n P.precision = P.sd = function (z) {\r\n var e, sd, w,\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 e = getBase10Exponent(x) + 1;\r\n w = x.d.length - 1;\r\n sd = w * LOG_BASE + 1;\r\n w = x.d[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) sd--;\r\n\r\n // Add the number of digits of the first word.\r\n for (w = x.d[0]; w >= 10; w /= 10) sd++;\r\n }\r\n\r\n return z && e > sd ? e : sd;\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the square root of this Decimal, truncated to `precision`\r\n * significant digits.\r\n *\r\n */\r\n P.squareRoot = P.sqrt = function () {\r\n var e, n, pr, r, s, t, wpr,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n // Negative or zero?\r\n if (x.s < 1) {\r\n if (!x.s) return new Ctor(0);\r\n\r\n // sqrt(-x) = NaN\r\n throw Error(decimalError + 'NaN');\r\n }\r\n\r\n e = getBase10Exponent(x);\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(x.d);\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 pr = Ctor.precision;\r\n s = wpr = pr + 3;\r\n\r\n // Newton-Raphson iteration.\r\n for (;;) {\r\n t = r;\r\n r = t.plus(divide(x, t, wpr + 2)).times(0.5);\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === (n = digitsToString(r.d)).slice(0, wpr)) {\r\n n = n.slice(wpr - 3, wpr + 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 (s == wpr && 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 round(t, pr + 1, 0);\r\n\r\n if (t.times(t).eq(x)) {\r\n r = t;\r\n break;\r\n }\r\n } else if (n != '9999') {\r\n break;\r\n }\r\n\r\n wpr += 4;\r\n }\r\n }\r\n\r\n external = true;\r\n\r\n return round(r, pr);\r\n };\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the value of this Decimal times `y`, truncated to\r\n * `precision` significant digits.\r\n *\r\n */\r\n P.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 // Return 0 if either is 0.\r\n if (!x.s || !y.s) return new Ctor(0);\r\n\r\n y.s *= x.s;\r\n e = x.e + y.e;\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 = e;\r\n\r\n return external ? round(y, Ctor.precision) : y;\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\n P.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 round(x, dp + getBase10Exponent(x) + 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\n P.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 = toString(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 = round(new Ctor(x), dp + 1, rm);\r\n str = toString(x, true, dp + 1);\r\n }\r\n\r\n return 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\n P.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) return toString(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 y = round(new Ctor(x), dp + getBase10Exponent(x) + 1, rm);\r\n str = toString(y.abs(), false, dp + getBase10Exponent(y) + 1);\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 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\n P.toInteger = P.toint = function () {\r\n var x = this,\r\n Ctor = x.constructor;\r\n return round(new Ctor(x), getBase10Exponent(x) + 1, Ctor.rounding);\r\n };\r\n\r\n\r\n /*\r\n * Return the value of this Decimal converted to a number primitive.\r\n *\r\n */\r\n P.toNumber = function () {\r\n return +this;\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`,\r\n * truncated to `precision` significant digits.\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n * x^y = exp(y*ln(x))\r\n *\r\n * The maximum error is 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\n P.toPower = P.pow = function (y) {\r\n var e, k, pr, r, sign, yIsInt,\r\n x = this,\r\n Ctor = x.constructor,\r\n guard = 12,\r\n yn = +(y = new Ctor(y));\r\n\r\n // pow(x, 0) = 1\r\n if (!y.s) return new Ctor(ONE);\r\n\r\n x = new Ctor(x);\r\n\r\n // pow(0, y > 0) = 0\r\n // pow(0, y < 0) = Infinity\r\n if (!x.s) {\r\n if (y.s < 1) throw Error(decimalError + 'Infinity');\r\n return x;\r\n }\r\n\r\n // pow(1, y) = 1\r\n if (x.eq(ONE)) return x;\r\n\r\n pr = Ctor.precision;\r\n\r\n // pow(x, 1) = x\r\n if (y.eq(ONE)) return round(x, pr);\r\n\r\n e = y.e;\r\n k = y.d.length - 1;\r\n yIsInt = e >= k;\r\n sign = x.s;\r\n\r\n if (!yIsInt) {\r\n\r\n // pow(x < 0, y non-integer) = NaN\r\n if (sign < 0) throw Error(decimalError + 'NaN');\r\n\r\n // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n } else if ((k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n r = new Ctor(ONE);\r\n\r\n // Max k of 9007199254740991 takes 53 loop iterations.\r\n // Maximum digits array length; leaves [28, 34] guard digits.\r\n e = Math.ceil(pr / LOG_BASE + 4);\r\n\r\n external = false;\r\n\r\n for (;;) {\r\n if (k % 2) {\r\n r = r.times(x);\r\n truncate(r.d, e);\r\n }\r\n\r\n k = mathfloor(k / 2);\r\n if (k === 0) break;\r\n\r\n x = x.times(x);\r\n truncate(x.d, e);\r\n }\r\n\r\n external = true;\r\n\r\n return y.s < 0 ? new Ctor(ONE).div(r) : round(r, pr);\r\n }\r\n\r\n // Result is negative if x is negative and the last digit of integer y is odd.\r\n sign = sign < 0 && y.d[Math.max(e, k)] & 1 ? -1 : 1;\r\n\r\n x.s = 1;\r\n external = false;\r\n r = y.times(ln(x, pr + guard));\r\n external = true;\r\n r = exp(r);\r\n r.s = sign;\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 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\n P.toPrecision = function (sd, rm) {\r\n var e, str,\r\n x = this,\r\n Ctor = x.constructor;\r\n\r\n if (sd === void 0) {\r\n e = getBase10Exponent(x);\r\n str = toString(x, e <= Ctor.toExpNeg || 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 = round(new Ctor(x), sd, rm);\r\n e = getBase10Exponent(x);\r\n str = toString(x, sd <= e || e <= Ctor.toExpNeg, sd);\r\n }\r\n\r\n return 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 */\r\n P.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 round(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\n P.toString = P.valueOf = P.val = P.toJSON = function () {\r\n var x = this,\r\n e = getBase10Exponent(x),\r\n Ctor = x.constructor;\r\n\r\n return toString(x, e <= Ctor.toExpNeg || e >= Ctor.toExpPos);\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 * add P.minus, P.plus\r\n * checkInt32 P.todp, P.toExponential, P.toFixed, P.toPrecision, P.tosd\r\n * digitsToString P.log, P.sqrt, P.pow, toString, exp, ln\r\n * divide P.div, P.idiv, P.log, P.mod, P.sqrt, exp, ln\r\n * exp P.exp, P.pow\r\n * getBase10Exponent P.exponent, P.sd, P.toint, P.sqrt, P.todp, P.toFixed, P.toPrecision,\r\n * P.toString, divide, round, toString, exp, ln\r\n * getLn10 P.log, ln\r\n * getZeroString digitsToString, toString\r\n * ln P.log, P.ln, P.pow, exp\r\n * parseDecimal Decimal\r\n * round P.abs, P.idiv, P.log, P.minus, P.mod, P.neg, P.plus, P.toint, P.sqrt,\r\n * P.times, P.todp, P.toExponential, P.toFixed, P.pow, P.toPrecision, P.tosd,\r\n * divide, getLn10, exp, ln\r\n * subtract P.minus, P.plus\r\n * toString P.toExponential, P.toFixed, P.toPrecision, P.toString, P.valueOf\r\n * truncate P.pow\r\n *\r\n * Throws: P.log, P.mod, P.sd, P.sqrt, P.pow, checkInt32, divide, round,\r\n * getLn10, exp, ln, parseDecimal, Decimal, config\r\n */\r\n\r\n\r\n function add(x, y) {\r\n var carry, d, e, i, k, len, xd, yd,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision;\r\n\r\n // If either is zero...\r\n if (!x.s || !y.s) {\r\n\r\n // Return x if y is zero.\r\n // Return y if y is non-zero.\r\n if (!y.s) y = new Ctor(x);\r\n return external ? round(y, pr) : y;\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n\r\n // x and y are finite, non-zero numbers with the same sign.\r\n\r\n k = x.e;\r\n e = y.e;\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 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 = e;\r\n\r\n return external ? round(y, pr) : y;\r\n }\r\n\r\n\r\n function 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 function 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\n var divide = (function () {\r\n\r\n // Assumes non-zero x and k, and hence non-zero result.\r\n function multiplyInteger(x, k) {\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) {\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, dp) {\r\n var cmp, e, i, k, prod, prodL, q, qd, rem, remL, rem0, sd, t, xi, xL, yd0, 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 0?\r\n if (!x.s) return new Ctor(x);\r\n if (!y.s) throw Error(decimalError + 'Division by zero');\r\n\r\n e = x.e - y.e;\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 for (i = 0; yd[i] == (xd[i] || 0); ) ++i;\r\n if (yd[i] > (xd[i] || 0)) --e;\r\n\r\n if (pr == null) {\r\n sd = pr = Ctor.precision;\r\n } else if (dp) {\r\n sd = pr + (getBase10Exponent(x) - getBase10Exponent(y)) + 1;\r\n } else {\r\n sd = pr;\r\n }\r\n\r\n if (sd < 0) return new Ctor(0);\r\n\r\n // Convert precision in number of base 10 digits to base 1e7 digits.\r\n sd = sd / LOG_BASE + 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 // 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);\r\n xd = multiplyInteger(xd, k);\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);\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);\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);\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);\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\r\n // Leading zero?\r\n if (!qd[0]) qd.shift();\r\n\r\n q.e = e;\r\n\r\n return round(q, dp ? pr + getBase10Exponent(q) + 1 : pr);\r\n };\r\n })();\r\n\r\n\r\n /*\r\n * Return a new Decimal whose value is the natural exponential of `x` truncated to `sd`\r\n * significant 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 * (Math object integer min/max: Math.exp(709) = 8.2e+307, Math.exp(-745) = 5e-324)\r\n *\r\n * exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n */\r\n function exp(x, sd) {\r\n var denominator, guard, pow, sum, t, wpr,\r\n i = 0,\r\n k = 0,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision;\r\n\r\n if (getBase10Exponent(x) > 16) throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n\r\n // exp(0) = 1\r\n if (!x.s) return new Ctor(ONE);\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 (x.abs().gte(0.1)) {\r\n x = x.times(t); // x = x / 2^5\r\n k += 5;\r\n }\r\n\r\n // Estimate the precision increase 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(ONE);\r\n Ctor.precision = wpr;\r\n\r\n for (;;) {\r\n pow = round(pow.times(x), wpr);\r\n denominator = denominator.times(++i);\r\n t = sum.plus(divide(pow, denominator, wpr));\r\n\r\n if (digitsToString(t.d).slice(0, wpr) === digitsToString(sum.d).slice(0, wpr)) {\r\n while (k--) sum = round(sum.times(sum), wpr);\r\n Ctor.precision = pr;\r\n return sd == null ? (external = true, round(sum, pr)) : sum;\r\n }\r\n\r\n sum = t;\r\n }\r\n }\r\n\r\n\r\n // Calculate the base 10 exponent from the base 1e7 exponent.\r\n function getBase10Exponent(x) {\r\n var e = x.e * LOG_BASE,\r\n w = x.d[0];\r\n\r\n // Add the number of digits of the first word of the digits array.\r\n for (; w >= 10; w /= 10) e++;\r\n return e;\r\n }\r\n\r\n\r\n function getLn10(Ctor, sd, pr) {\r\n\r\n if (sd > Ctor.LN10.sd()) {\r\n\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(decimalError + 'LN10 precision limit exceeded');\r\n }\r\n\r\n return round(new Ctor(Ctor.LN10), sd);\r\n }\r\n\r\n\r\n function 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 natural logarithm of `x` truncated to `sd` significant\r\n * digits.\r\n *\r\n * ln(n) is non-terminating (n != 1)\r\n *\r\n */\r\n function ln(y, sd) {\r\n var c, c0, denominator, e, numerator, sum, t, wpr, 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 pr = Ctor.precision;\r\n\r\n // ln(-x) = NaN\r\n // ln(0) = -Infinity\r\n if (x.s < 1) throw Error(decimalError + (x.s ? 'NaN' : '-Infinity'));\r\n\r\n // ln(1) = 0\r\n if (x.eq(ONE)) return new Ctor(0);\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 if (x.eq(10)) {\r\n if (sd == null) external = true;\r\n return getLn10(Ctor, wpr);\r\n }\r\n\r\n wpr += guard;\r\n Ctor.precision = wpr;\r\n c = digitsToString(xd);\r\n c0 = c.charAt(0);\r\n e = getBase10Exponent(x);\r\n\r\n if (Math.abs(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(a*10^b) = ln(a) + b*ln(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 = getBase10Exponent(x);\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(x*10^e) = ln(x) + e*ln(10).\r\n t = getLn10(Ctor, wpr + 2, pr).times(e + '');\r\n x = ln(new Ctor(c0 + '.' + c.slice(1)), wpr - guard).plus(t);\r\n\r\n Ctor.precision = pr;\r\n return sd == null ? (external = true, round(x, pr)) : x;\r\n }\r\n\r\n // x is reduced to a value near 1.\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(ONE), x.plus(ONE), wpr);\r\n x2 = round(x.times(x), wpr);\r\n denominator = 3;\r\n\r\n for (;;) {\r\n numerator = round(numerator.times(x2), wpr);\r\n t = sum.plus(divide(numerator, new Ctor(denominator), wpr));\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.\r\n if (e !== 0) sum = sum.plus(getLn10(Ctor, wpr + 2, pr).times(e + ''));\r\n sum = divide(sum, new Ctor(n), wpr);\r\n\r\n Ctor.precision = pr;\r\n return sd == null ? (external = true, round(sum, pr)) : sum;\r\n }\r\n\r\n sum = t;\r\n denominator += 2;\r\n }\r\n }\r\n\r\n\r\n /*\r\n * Parse the value of a new Decimal `x` from string `str`.\r\n */\r\n function 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 e = e - i - 1;\r\n x.e = mathfloor(e / LOG_BASE);\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 && (x.e > MAX_E || x.e < -MAX_E)) throw Error(exponentOutOfRange + e);\r\n } else {\r\n\r\n // Zero.\r\n x.s = 0;\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 * Round `x` to `sd` significant digits, using rounding mode `rm` if present (truncate otherwise).\r\n */\r\n function round(x, sd, rm) {\r\n var i, j, k, n, rd, doRound, w, xdi,\r\n xd = x.d;\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 which contains the rounding digit, a base 1e7 number.\r\n // xdi: the index of w within xd.\r\n // n: 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 (n = 1, k = xd[0]; k >= 10; k /= 10) n++;\r\n i = sd - n;\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 } else {\r\n xdi = Math.ceil((i + 1) / LOG_BASE);\r\n k = xd.length;\r\n if (xdi >= k) return x;\r\n w = k = xd[xdi];\r\n\r\n // Get the number of digits of w.\r\n for (n = 1; k >= 10; k /= 10) n++;\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 - n.\r\n j = i - LOG_BASE + n;\r\n }\r\n\r\n if (rm !== void 0) {\r\n k = mathpow(10, n - j - 1);\r\n\r\n // Get the rounding digit at index j of w.\r\n rd = w / k % 10 | 0;\r\n\r\n // Are there any non-zero digits after the rounding digit?\r\n doRound = sd < 0 || xd[xdi + 1] !== void 0 || w % k;\r\n\r\n // The expression `w % mathpow(10, n - j - 1)` returns all the digits of w to the right of the\r\n // digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression will give\r\n // 714.\r\n\r\n doRound = rm < 4\r\n ? (rd || doRound) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n : rd > 5 || rd == 5 && (rm == 4 || doRound || 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, n - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n rm == (x.s < 0 ? 8 : 7));\r\n }\r\n\r\n if (sd < 1 || !xd[0]) {\r\n if (doRound) {\r\n k = getBase10Exponent(x);\r\n xd.length = 1;\r\n\r\n // Convert sd to decimal places.\r\n sd = sd - k - 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 = mathfloor(-sd / LOG_BASE) || 0;\r\n } else {\r\n xd.length = 1;\r\n\r\n // Zero.\r\n xd[0] = x.e = x.s = 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, n - j) % mathpow(10, j) | 0) * k : 0;\r\n }\r\n\r\n if (doRound) {\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 if ((xd[0] += k) == BASE) {\r\n xd[0] = 1;\r\n ++x.e;\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 if (external && (x.e > MAX_E || x.e < -MAX_E)) {\r\n throw Error(exponentOutOfRange + getBase10Exponent(x));\r\n }\r\n\r\n return x;\r\n }\r\n\r\n\r\n function subtract(x, y) {\r\n var d, e, i, j, k, len, xd, xe, xLTy, yd,\r\n Ctor = x.constructor,\r\n pr = Ctor.precision;\r\n\r\n // Return y negated if x is zero.\r\n // Return x if y is zero and x is non-zero.\r\n if (!x.s || !y.s) {\r\n if (y.s) y.s = -y.s;\r\n else y = new Ctor(x);\r\n return external ? round(y, pr) : y;\r\n }\r\n\r\n xd = x.d;\r\n yd = y.d;\r\n\r\n // x and y are non-zero numbers with the same sign.\r\n\r\n e = y.e;\r\n xe = x.e;\r\n xd = xd.slice();\r\n k = xe - e;\r\n\r\n // If 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 zeros\r\n // needing to be prepended, but this can be avoided while still ensuring correct rounding by\r\n // 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 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(0);\r\n\r\n y.d = xd;\r\n y.e = e;\r\n\r\n //return external && xd.length >= pr / LOG_BASE ? round(y, pr) : y;\r\n return external ? round(y, pr) : y;\r\n }\r\n\r\n\r\n function toString(x, isExp, sd) {\r\n var k,\r\n e = getBase10Exponent(x),\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 + (e < 0 ? 'e' : 'e+') + 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 x.s < 0 ? '-' + str : str;\r\n }\r\n\r\n\r\n // Does not strip trailing zeros.\r\n function 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 * clone\r\n * config/set\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\n function 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 * value {number|string|Decimal} A numeric value.\r\n *\r\n */\r\n function Decimal(value) {\r\n var x = this;\r\n\r\n // Decimal called without new.\r\n if (!(x instanceof Decimal)) return new Decimal(value);\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 (value instanceof Decimal) {\r\n x.s = value.s;\r\n x.e = value.e;\r\n x.d = (value = value.d) ? value.slice() : value;\r\n return;\r\n }\r\n\r\n if (typeof value === 'number') {\r\n\r\n // Reject Infinity/NaN.\r\n if (value * 0 !== 0) {\r\n throw Error(invalidArgument + value);\r\n }\r\n\r\n if (value > 0) {\r\n x.s = 1;\r\n } else if (value < 0) {\r\n value = -value;\r\n x.s = -1;\r\n } else {\r\n x.s = 0;\r\n x.e = 0;\r\n x.d = [0];\r\n return;\r\n }\r\n\r\n // Fast path for small integers.\r\n if (value === ~~value && value < 1e7) {\r\n x.e = 0;\r\n x.d = [value];\r\n return;\r\n }\r\n\r\n return parseDecimal(x, value.toString());\r\n } else if (typeof value !== 'string') {\r\n throw Error(invalidArgument + value);\r\n }\r\n\r\n // Minus sign?\r\n if (value.charCodeAt(0) === 45) {\r\n value = value.slice(1);\r\n x.s = -1;\r\n } else {\r\n x.s = 1;\r\n }\r\n\r\n if (isDecimal.test(value)) parseDecimal(x, value);\r\n else throw Error(invalidArgument + value);\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\r\n Decimal.clone = clone;\r\n Decimal.config = Decimal.set = config;\r\n\r\n if (obj === void 0) obj = {};\r\n if (obj) {\r\n ps = ['precision', 'rounding', 'toExpNeg', 'toExpPos', 'LN10'];\r\n for (i = 0; i < ps.length;) if (!obj.hasOwnProperty(p = ps[i++])) obj[p] = this[p];\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 * 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 *\r\n * E.g. Decimal.config({ precision: 20, rounding: 4 })\r\n *\r\n */\r\n function config(obj) {\r\n if (!obj || typeof obj !== 'object') {\r\n throw Error(decimalError + 'Object expected');\r\n }\r\n var i, p, v,\r\n ps = [\r\n 'precision', 1, MAX_DIGITS,\r\n 'rounding', 0, 8,\r\n 'toExpNeg', -1 / 0, 0,\r\n 'toExpPos', 0, 1 / 0\r\n ];\r\n\r\n for (i = 0; i < ps.length; i += 3) {\r\n if ((v = obj[p = ps[i]]) !== 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 ((v = obj[p = 'LN10']) !== void 0) {\r\n if (v == Math.LN10) this[p] = new this(v);\r\n else throw Error(invalidArgument + p + ': ' + v);\r\n }\r\n\r\n return this;\r\n }\r\n\r\n\r\n // Create and configure initial Decimal constructor.\r\n Decimal = clone(Decimal);\r\n\r\n Decimal['default'] = Decimal.Decimal = Decimal;\r\n\r\n // Internal constant.\r\n ONE = new Decimal(1);\r\n\r\n\r\n // Export.\r\n\r\n\r\n // AMD.\r\n if (typeof define == 'function' && define.amd) {\r\n define(function () {\r\n return Decimal;\r\n });\r\n\r\n // Node and other environments that support module.exports.\r\n } else if (typeof module != 'undefined' && module.exports) {\r\n module.exports = Decimal;\r\n\r\n // Browser.\r\n } else {\r\n if (!globalScope) {\r\n globalScope = typeof self != 'undefined' && self && self.self == self\r\n ? self : Function('return this')();\r\n }\r\n\r\n globalScope.Decimal = Decimal;\r\n }\r\n})(this);\r\n"],"x_google_ignoreList":[0],"mappings":";;;AACC,EAAC,SAAU,GAAa;EAkBvB,IAAI,IAAa,KAIf,IAAU;GAOR,WAAW;GAkBX,UAAU;GAIV,UAAU;GAIV,UAAW;GAIX,MAAM;GACP,EAMD,IAAW,IAEX,IAAe,mBACf,IAAkB,IAAe,sBACjC,IAAqB,IAAe,2BAEpC,IAAY,KAAK,OACjB,IAAU,KAAK,KAEf,IAAY,sCAEZ,GACA,IAAO,KACP,IAAW,GACX,IAAmB,kBACnB,IAAQ,EAAU,IAAmB,EAAS,EAG9C,IAAI,EAAE;AA4xBR,EA3uBA,EAAE,gBAAgB,EAAE,MAAM,WAAY;GACpC,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAElC,UADA,AAAS,EAAE,MAAI,GACR;KAWT,EAAE,aAAa,EAAE,MAAM,SAAU,GAAG;GAClC,IAAI,GAAG,GAAG,GAAK,GACb,IAAI;AAKN,OAHA,IAAI,IAAI,EAAE,YAAY,EAAE,EAGpB,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,KAAK,CAAC,EAAE;AAGlC,OAAI,EAAE,MAAM,EAAE,EAAG,QAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,IAAI;AAMlD,QAJA,IAAM,EAAE,EAAE,QACV,IAAM,EAAE,EAAE,QAGL,IAAI,GAAG,IAAI,IAAM,IAAM,IAAM,GAAK,IAAI,GAAG,EAAE,EAC9C,KAAI,EAAE,EAAE,OAAO,EAAE,EAAE,GAAI,QAAO,EAAE,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,IAAI,IAAI,IAAI;AAIhE,UAAO,MAAQ,IAAM,IAAI,IAAM,IAAM,EAAE,IAAI,IAAI,IAAI;KAQrD,EAAE,gBAAgB,EAAE,KAAK,WAAY;GACnC,IAAI,IAAI,MACN,IAAI,EAAE,EAAE,SAAS,GACjB,KAAM,IAAI,EAAE,KAAK;AAInB,OADA,IAAI,EAAE,EAAE,IACJ,EAAG,QAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAEpC,UAAO,IAAK,IAAI,IAAI;KAStB,EAAE,YAAY,EAAE,MAAM,SAAU,GAAG;AACjC,UAAO,EAAO,MAAM,IAAI,KAAK,YAAY,EAAE,CAAC;KAS9C,EAAE,qBAAqB,EAAE,OAAO,SAAU,GAAG;GAC3C,IAAI,IAAI,MACN,IAAO,EAAE;AACX,UAAO,EAAM,EAAO,GAAG,IAAI,EAAK,EAAE,EAAE,GAAG,EAAE,EAAE,EAAK,UAAU;KAQ5D,EAAE,SAAS,EAAE,KAAK,SAAU,GAAG;AAC7B,UAAO,CAAC,KAAK,IAAI,EAAE;KAQrB,EAAE,WAAW,WAAY;AACvB,UAAO,EAAkB,KAAK;KAShC,EAAE,cAAc,EAAE,KAAK,SAAU,GAAG;AAClC,UAAO,KAAK,IAAI,EAAE,GAAG;KASvB,EAAE,uBAAuB,EAAE,MAAM,SAAU,GAAG;AAC5C,UAAO,KAAK,IAAI,EAAE,IAAI;KAQxB,EAAE,YAAY,EAAE,QAAQ,WAAY;AAClC,UAAO,KAAK,IAAI,KAAK,EAAE,SAAS;KAQlC,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,UAAO,KAAK,IAAI;KAQlB,EAAE,aAAa,EAAE,QAAQ,WAAY;AACnC,UAAO,KAAK,IAAI;KAQlB,EAAE,SAAS,WAAY;AACrB,UAAO,KAAK,MAAM;KAQpB,EAAE,WAAW,EAAE,KAAK,SAAU,GAAG;AAC/B,UAAO,KAAK,IAAI,EAAE,GAAG;KAQvB,EAAE,oBAAoB,EAAE,MAAM,SAAU,GAAG;AACzC,UAAO,KAAK,IAAI,EAAE,GAAG;KAiBvB,EAAE,YAAY,EAAE,MAAM,SAAU,GAAM;GACpC,IAAI,GACF,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAK,WACV,IAAM,IAAK;AAGb,OAAI,MAAS,KAAK,EAChB,KAAO,IAAI,EAAK,GAAG;YAEnB,IAAO,IAAI,EAAK,EAAK,EAKjB,EAAK,IAAI,KAAK,EAAK,GAAG,EAAI,CAAE,OAAM,MAAM,IAAe,MAAM;AAKnE,OAAI,EAAE,IAAI,EAAG,OAAM,MAAM,KAAgB,EAAE,IAAI,QAAQ,aAAa;AASpE,UANI,EAAE,GAAG,EAAI,GAAS,IAAI,EAAK,EAAE,IAEjC,IAAW,IACX,IAAI,EAAO,EAAG,GAAG,EAAI,EAAE,EAAG,GAAM,EAAI,EAAE,EAAI,EAC1C,IAAW,IAEJ,EAAM,GAAG,EAAG;KASrB,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;GAC7B,IAAI,IAAI;AAER,UADA,IAAI,IAAI,EAAE,YAAY,EAAE,EACjB,EAAE,KAAK,EAAE,IAAI,EAAS,GAAG,EAAE,GAAG,EAAI,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,GAAG;KAS9D,EAAE,SAAS,EAAE,MAAM,SAAU,GAAG;GAC9B,IAAI,GACF,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAK;AAKZ,OAHA,IAAI,IAAI,EAAK,EAAE,EAGX,CAAC,EAAE,EAAG,OAAM,MAAM,IAAe,MAAM;AAU3C,UAPK,EAAE,KAGP,IAAW,IACX,IAAI,EAAO,GAAG,GAAG,GAAG,EAAE,CAAC,MAAM,EAAE,EAC/B,IAAW,IAEJ,EAAE,MAAM,EAAE,IAPA,EAAM,IAAI,EAAK,EAAE,EAAE,EAAG;KAiBzC,EAAE,qBAAqB,EAAE,MAAM,WAAY;AACzC,UAAO,EAAI,KAAK;KASlB,EAAE,mBAAmB,EAAE,KAAK,WAAY;AACtC,UAAO,EAAG,KAAK;KASjB,EAAE,UAAU,EAAE,MAAM,WAAY;GAC9B,IAAI,IAAI,IAAI,KAAK,YAAY,KAAK;AAElC,UADA,EAAE,IAAI,CAAC,EAAE,KAAK,GACP;KAST,EAAE,OAAO,EAAE,MAAM,SAAU,GAAG;GAC5B,IAAI,IAAI;AAER,UADA,IAAI,IAAI,EAAE,YAAY,EAAE,EACjB,EAAE,KAAK,EAAE,IAAI,EAAI,GAAG,EAAE,GAAG,EAAS,IAAI,EAAE,IAAI,CAAC,EAAE,GAAG,GAAG;KAU9D,EAAE,YAAY,EAAE,KAAK,SAAU,GAAG;GAChC,IAAI,GAAG,GAAI,GACT,IAAI;AAEN,OAAI,MAAM,KAAK,KAAK,MAAM,CAAC,CAAC,KAAK,MAAM,KAAK,MAAM,EAAG,OAAM,MAAM,IAAkB,EAAE;AAQrF,OANA,IAAI,EAAkB,EAAE,GAAG,GAC3B,IAAI,EAAE,EAAE,SAAS,GACjB,IAAK,IAAI,IAAW,GACpB,IAAI,EAAE,EAAE,IAGJ,GAAG;AAGL,WAAO,IAAI,MAAM,GAAG,KAAK,GAAI;AAG7B,SAAK,IAAI,EAAE,EAAE,IAAI,KAAK,IAAI,KAAK,GAAI;;AAGrC,UAAO,KAAK,IAAI,IAAK,IAAI;KAS3B,EAAE,aAAa,EAAE,OAAO,WAAY;GAClC,IAAI,GAAG,GAAG,GAAI,GAAG,GAAG,GAAG,GACrB,IAAI,MACJ,IAAO,EAAE;AAGX,OAAI,EAAE,IAAI,GAAG;AACX,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAG5B,UAAM,MAAM,IAAe,MAAM;;AAiCnC,QA9BA,IAAI,EAAkB,EAAE,EACxB,IAAW,IAGX,IAAI,KAAK,KAAK,CAAC,EAAE,EAIb,KAAK,KAAK,KAAK,YACjB,IAAI,EAAe,EAAE,EAAE,GAClB,EAAE,SAAS,KAAK,KAAK,MAAG,KAAK,MAClC,IAAI,KAAK,KAAK,EAAE,EAChB,IAAI,GAAW,IAAI,KAAK,EAAE,IAAI,IAAI,KAAK,IAAI,IAEvC,KAAK,WACP,IAAI,OAAO,KAEX,IAAI,EAAE,eAAe,EACrB,IAAI,EAAE,MAAM,GAAG,EAAE,QAAQ,IAAI,GAAG,EAAE,GAAG,IAGvC,IAAI,IAAI,EAAK,EAAE,IAEf,IAAI,IAAI,EAAK,EAAE,UAAU,CAAC,EAG5B,IAAK,EAAK,WACV,IAAI,IAAM,IAAK,IAOb,KAHA,IAAI,GACJ,IAAI,EAAE,KAAK,EAAO,GAAG,GAAG,IAAM,EAAE,CAAC,CAAC,MAAM,GAAI,EAExC,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,MAAM,IAAI,EAAe,EAAE,EAAE,EAAE,MAAM,GAAG,EAAI,EAAE;AAKjF,QAJA,IAAI,EAAE,MAAM,IAAM,GAAG,IAAM,EAAE,EAIzB,KAAK,KAAO,KAAK,QAMnB;SAFA,EAAM,GAAG,IAAK,GAAG,EAAE,EAEf,EAAE,MAAM,EAAE,CAAC,GAAG,EAAE,EAAE;AACpB,UAAI;AACJ;;eAEO,KAAK,OACd;AAGF,SAAO;;AAMX,UAFA,IAAW,IAEJ,EAAM,GAAG,EAAG;KASrB,EAAE,QAAQ,EAAE,MAAM,SAAU,GAAG;GAC7B,IAAI,GAAO,GAAG,GAAG,GAAG,GAAG,GAAI,GAAG,GAAK,GACjC,IAAI,MACJ,IAAO,EAAE,aACT,IAAK,EAAE,GACP,KAAM,IAAI,IAAI,EAAK,EAAE,EAAE;AAGzB,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAoBpC,QAlBA,EAAE,KAAK,EAAE,GACT,IAAI,EAAE,IAAI,EAAE,GACZ,IAAM,EAAG,QACT,IAAM,EAAG,QAGL,IAAM,MACR,IAAI,GACJ,IAAK,GACL,IAAK,GACL,IAAK,GACL,IAAM,GACN,IAAM,IAIR,IAAI,EAAE,EACN,IAAK,IAAM,GACN,IAAI,GAAI,KAAM,GAAE,KAAK,EAAE;AAG5B,QAAK,IAAI,GAAK,EAAE,KAAK,IAAI;AAEvB,SADA,IAAQ,GACH,IAAI,IAAM,GAAG,IAAI,GAGpB,CAFA,IAAI,EAAE,KAAK,EAAG,KAAK,EAAG,IAAI,IAAI,KAAK,GACnC,EAAE,OAAO,IAAI,IAAO,GACpB,IAAQ,IAAI,IAAO;AAGrB,MAAE,MAAM,EAAE,KAAK,KAAS,IAAO;;AAIjC,UAAO,CAAC,EAAE,EAAE,IAAM,GAAE,KAAK;AAQzB,UANI,IAAO,EAAE,IACR,EAAE,OAAO,EAEd,EAAE,IAAI,GACN,EAAE,IAAI,GAEC,IAAW,EAAM,GAAG,EAAK,UAAU,GAAG;KAc/C,EAAE,kBAAkB,EAAE,OAAO,SAAU,GAAI,GAAI;GAC7C,IAAI,IAAI,MACN,IAAO,EAAE;AAUX,UARA,IAAI,IAAI,EAAK,EAAE,EACX,MAAO,KAAK,IAAU,KAE1B,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAElB,EAAM,GAAG,IAAK,EAAkB,EAAE,GAAG,GAAG,EAAG;KAYpD,EAAE,gBAAgB,SAAU,GAAI,GAAI;GAClC,IAAI,GACF,IAAI,MACJ,IAAO,EAAE;AAcX,UAZI,MAAO,KAAK,IACd,IAAM,EAAS,GAAG,GAAK,IAEvB,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,IAAK,GAAG,EAAG,EAClC,IAAM,EAAS,GAAG,IAAM,IAAK,EAAE,GAG1B;KAoBT,EAAE,UAAU,SAAU,GAAI,GAAI;GAC5B,IAAI,GAAK,GACP,IAAI,MACJ,IAAO,EAAE;AAcX,UAZI,MAAO,KAAK,IAAU,EAAS,EAAE,IAErC,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,IAAK,EAAkB,EAAE,GAAG,GAAG,EAAG,EACzD,IAAM,EAAS,EAAE,KAAK,EAAE,IAAO,IAAK,EAAkB,EAAE,GAAG,EAAE,EAItD,EAAE,OAAO,IAAI,CAAC,EAAE,QAAQ,GAAG,MAAM,IAAM;KAShD,EAAE,YAAY,EAAE,QAAQ,WAAY;GAClC,IAAI,IAAI,MACN,IAAO,EAAE;AACX,UAAO,EAAM,IAAI,EAAK,EAAE,EAAE,EAAkB,EAAE,GAAG,GAAG,EAAK,SAAS;KAQpE,EAAE,WAAW,WAAY;AACvB,UAAO,CAAC;KAiBV,EAAE,UAAU,EAAE,MAAM,SAAU,GAAG;GAC/B,IAAI,GAAG,GAAG,GAAI,GAAG,GAAM,GACrB,IAAI,MACJ,IAAO,EAAE,aACT,IAAQ,IACR,IAAK,EAAE,IAAI,IAAI,EAAK,EAAE;AAGxB,OAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAI;AAM9B,OAJA,IAAI,IAAI,EAAK,EAAE,EAIX,CAAC,EAAE,GAAG;AACR,QAAI,EAAE,IAAI,EAAG,OAAM,MAAM,IAAe,WAAW;AACnD,WAAO;;AAIT,OAAI,EAAE,GAAG,EAAI,CAAE,QAAO;AAKtB,OAHA,IAAK,EAAK,WAGN,EAAE,GAAG,EAAI,CAAE,QAAO,EAAM,GAAG,EAAG;AAOlC,OALA,IAAI,EAAE,GACN,IAAI,EAAE,EAAE,SAAS,GACjB,IAAS,KAAK,GACd,IAAO,EAAE,GAEL,CAAC;QAGC,IAAO,EAAG,OAAM,MAAM,IAAe,MAAM;eAGrC,IAAI,IAAK,IAAI,CAAC,IAAK,MAAO,GAAkB;AAStD,SARA,IAAI,IAAI,EAAK,EAAI,EAIjB,IAAI,KAAK,KAAK,IAAK,IAAW,EAAE,EAEhC,IAAW,IAGL,IAAI,MACN,IAAI,EAAE,MAAM,EAAE,EACd,EAAS,EAAE,GAAG,EAAE,GAGlB,IAAI,EAAU,IAAI,EAAE,EAChB,MAAM,GAGV,CADA,IAAI,EAAE,MAAM,EAAE,EACd,EAAS,EAAE,GAAG,EAAE;AAKlB,WAFA,IAAW,IAEJ,EAAE,IAAI,IAAI,IAAI,EAAK,EAAI,CAAC,IAAI,EAAE,GAAG,EAAM,GAAG,EAAG;;AAatD,UATA,IAAO,IAAO,KAAK,EAAE,EAAE,KAAK,IAAI,GAAG,EAAE,IAAI,IAAI,KAAK,GAElD,EAAE,IAAI,GACN,IAAW,IACX,IAAI,EAAE,MAAM,EAAG,GAAG,IAAK,EAAM,CAAC,EAC9B,IAAW,IACX,IAAI,EAAI,EAAE,EACV,EAAE,IAAI,GAEC;KAeT,EAAE,cAAc,SAAU,GAAI,GAAI;GAChC,IAAI,GAAG,GACL,IAAI,MACJ,IAAO,EAAE;AAgBX,UAdI,MAAO,KAAK,KACd,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAS,GAAG,KAAK,EAAK,YAAY,KAAK,EAAK,SAAS,KAE3D,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,EAEzB,IAAI,EAAM,IAAI,EAAK,EAAE,EAAE,GAAI,EAAG,EAC9B,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAS,GAAG,KAAM,KAAK,KAAK,EAAK,UAAU,EAAG,GAG/C;KAaT,EAAE,sBAAsB,EAAE,OAAO,SAAU,GAAI,GAAI;GACjD,IAAI,IAAI,MACN,IAAO,EAAE;AAYX,UAVI,MAAO,KAAK,KACd,IAAK,EAAK,WACV,IAAK,EAAK,aAEV,EAAW,GAAI,GAAG,EAAW,EAEzB,MAAO,KAAK,IAAG,IAAK,EAAK,WACxB,EAAW,GAAI,GAAG,EAAE,GAGpB,EAAM,IAAI,EAAK,EAAE,EAAE,GAAI,EAAG;KAWnC,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,WAAY;GACtD,IAAI,IAAI,MACN,IAAI,EAAkB,EAAE,EACxB,IAAO,EAAE;AAEX,UAAO,EAAS,GAAG,KAAK,EAAK,YAAY,KAAK,EAAK,SAAS;;EA+B9D,SAAS,EAAI,GAAG,GAAG;GACjB,IAAI,GAAO,GAAG,GAAG,GAAG,GAAG,GAAK,GAAI,GAC9B,IAAO,EAAE,aACT,IAAK,EAAK;AAGZ,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAKb,QADK,EAAE,MAAG,IAAI,IAAI,EAAK,EAAE,GAClB,IAAW,EAAM,GAAG,EAAG,GAAG;AAcnC,OAXA,IAAK,EAAE,GACP,IAAK,EAAE,GAIP,IAAI,EAAE,GACN,IAAI,EAAE,GACN,IAAK,EAAG,OAAO,EACf,IAAI,IAAI,GAGJ,GAAG;AAsBL,SArBI,IAAI,KACN,IAAI,GACJ,IAAI,CAAC,GACL,IAAM,EAAG,WAET,IAAI,GACJ,IAAI,GACJ,IAAM,EAAG,SAIX,IAAI,KAAK,KAAK,IAAK,EAAS,EAC5B,IAAM,IAAI,IAAM,IAAI,IAAI,IAAM,GAE1B,IAAI,MACN,IAAI,GACJ,EAAE,SAAS,IAIb,EAAE,SAAS,EACJ,KAAM,GAAE,KAAK,EAAE;AACtB,MAAE,SAAS;;AAeb,QAZA,IAAM,EAAG,QACT,IAAI,EAAG,QAGH,IAAM,IAAI,MACZ,IAAI,GACJ,IAAI,GACJ,IAAK,GACL,IAAK,IAIF,IAAQ,GAAG,GAEd,CADA,KAAS,EAAG,EAAE,KAAK,EAAG,KAAK,EAAG,KAAK,KAAS,IAAO,GACnD,EAAG,MAAM;AAUX,QAPI,MACF,EAAG,QAAQ,EAAM,EACjB,EAAE,IAKC,IAAM,EAAG,QAAQ,EAAG,EAAE,MAAQ,GAAI,GAAG,KAAK;AAK/C,UAHA,EAAE,IAAI,GACN,EAAE,IAAI,GAEC,IAAW,EAAM,GAAG,EAAG,GAAG;;EAInC,SAAS,EAAW,GAAG,GAAK,GAAK;AAC/B,OAAI,MAAM,CAAC,CAAC,KAAK,IAAI,KAAO,IAAI,EAC9B,OAAM,MAAM,IAAkB,EAAE;;EAKpC,SAAS,EAAe,GAAG;GACzB,IAAI,GAAG,GAAG,GACR,IAAkB,EAAE,SAAS,GAC7B,IAAM,IACN,IAAI,EAAE;AAER,OAAI,IAAkB,GAAG;AAEvB,SADA,KAAO,GACF,IAAI,GAAG,IAAI,GAAiB,IAI/B,CAHA,IAAK,EAAE,KAAK,IACZ,IAAI,IAAW,EAAG,QACd,MAAG,KAAO,EAAc,EAAE,GAC9B,KAAO;AAMT,IAHA,IAAI,EAAE,IACN,IAAK,IAAI,IACT,IAAI,IAAW,EAAG,QACd,MAAG,KAAO,EAAc,EAAE;cACrB,MAAM,EACf,QAAO;AAIT,UAAO,IAAI,MAAO,GAAI,MAAK;AAE3B,UAAO,IAAM;;EAIf,IAAI,KAAU,WAAY;GAGxB,SAAS,EAAgB,GAAG,GAAG;IAC7B,IAAI,GACF,IAAQ,GACR,IAAI,EAAE;AAER,SAAK,IAAI,EAAE,OAAO,EAAE,KAGlB,CAFA,IAAO,EAAE,KAAK,IAAI,GAClB,EAAE,KAAK,IAAO,IAAO,GACrB,IAAQ,IAAO,IAAO;AAKxB,WAFI,KAAO,EAAE,QAAQ,EAAM,EAEpB;;GAGT,SAAS,EAAQ,GAAG,GAAG,GAAI,GAAI;IAC7B,IAAI,GAAG;AAEP,QAAI,KAAM,EACR,KAAI,IAAK,IAAK,IAAI;QAElB,MAAK,IAAI,IAAI,GAAG,IAAI,GAAI,IACtB,KAAI,EAAE,MAAM,EAAE,IAAI;AAChB,SAAI,EAAE,KAAK,EAAE,KAAK,IAAI;AACtB;;AAKN,WAAO;;GAGT,SAAS,EAAS,GAAG,GAAG,GAAI;AAI1B,SAHA,IAAI,IAAI,GAGD,KAGL,CAFA,EAAE,MAAO,GACT,IAAI,IAAE,KAAM,EAAE,KACd,EAAE,KAAM,IAAI,IAAO,EAAE,KAAM,EAAE;AAI/B,WAAO,CAAC,EAAE,MAAM,EAAE,SAAS,GAAI,GAAE,OAAO;;AAG1C,UAAO,SAAU,GAAG,GAAG,GAAI,GAAI;IAC7B,IAAI,GAAK,GAAG,GAAG,GAAG,GAAM,GAAO,GAAG,GAAI,GAAK,GAAM,GAAM,GAAI,GAAG,GAAI,GAAI,GAAK,GAAI,GAC7E,IAAO,EAAE,aACT,IAAO,EAAE,KAAK,EAAE,IAAI,IAAI,IACxB,IAAK,EAAE,GACP,IAAK,EAAE;AAGT,QAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAE;AAC5B,QAAI,CAAC,EAAE,EAAG,OAAM,MAAM,IAAe,mBAAmB;AASxD,SAPA,IAAI,EAAE,IAAI,EAAE,GACZ,IAAK,EAAG,QACR,IAAK,EAAG,QACR,IAAI,IAAI,EAAK,EAAK,EAClB,IAAK,EAAE,IAAI,EAAE,EAGR,IAAI,GAAG,EAAG,OAAO,EAAG,MAAM,IAAM,GAAE;AAWvC,QAVI,EAAG,MAAM,EAAG,MAAM,MAAI,EAAE,GAE5B,AAKE,IALE,KAAM,OACH,IAAK,EAAK,YACN,IACJ,KAAM,EAAkB,EAAE,GAAG,EAAkB,EAAE,IAAI,IAErD,GAGH,IAAK,EAAG,QAAO,IAAI,EAAK,EAAE;AAO9B,QAJA,IAAK,IAAK,IAAW,IAAI,GACzB,IAAI,GAGA,KAAM,EAMR,MALA,IAAI,GACJ,IAAK,EAAG,IACR,MAGQ,IAAI,KAAM,MAAM,KAAM,IAG5B,CAFA,IAAI,IAAI,KAAQ,EAAG,MAAM,IACzB,EAAG,KAAK,IAAI,IAAK,GACjB,IAAI,IAAI,IAAK;SAIV;AAiBL,UAdA,IAAI,KAAQ,EAAG,KAAK,KAAK,GAErB,IAAI,MACN,IAAK,EAAgB,GAAI,EAAE,EAC3B,IAAK,EAAgB,GAAI,EAAE,EAC3B,IAAK,EAAG,QACR,IAAK,EAAG,SAGV,IAAK,GACL,IAAM,EAAG,MAAM,GAAG,EAAG,EACrB,IAAO,EAAI,QAGJ,IAAO,GAAK,GAAI,OAAU;AAMjC,KAJA,IAAK,EAAG,OAAO,EACf,EAAG,QAAQ,EAAE,EACb,IAAM,EAAG,IAEL,EAAG,MAAM,IAAO,KAAG,EAAE;AAEzB;AAmFE,MAlFA,IAAI,GAGJ,IAAM,EAAQ,GAAI,GAAK,GAAI,EAAK,EAG5B,IAAM,KAGR,IAAO,EAAI,IACP,KAAM,MAAM,IAAO,IAAO,KAAQ,EAAI,MAAM,KAGhD,IAAI,IAAO,IAAM,GAUb,IAAI,KACF,KAAK,MAAM,IAAI,IAAO,IAG1B,IAAO,EAAgB,GAAI,EAAE,EAC7B,IAAQ,EAAK,QACb,IAAO,EAAI,QAGX,IAAM,EAAQ,GAAM,GAAK,GAAO,EAAK,EAGjC,KAAO,MACT,KAGA,EAAS,GAAM,IAAK,IAAQ,IAAK,GAAI,EAAM,MAOzC,KAAK,MAAG,IAAM,IAAI,IACtB,IAAO,EAAG,OAAO,GAGnB,IAAQ,EAAK,QACT,IAAQ,KAAM,EAAK,QAAQ,EAAE,EAGjC,EAAS,GAAK,GAAM,EAAK,EAGrB,KAAO,OACT,IAAO,EAAI,QAGX,IAAM,EAAQ,GAAI,GAAK,GAAI,EAAK,EAG5B,IAAM,MACR,KAGA,EAAS,GAAK,IAAK,IAAO,IAAK,GAAI,EAAK,IAI5C,IAAO,EAAI,UACF,MAAQ,MACjB,KACA,IAAM,CAAC,EAAE,GAIX,EAAG,OAAO,GAGN,KAAO,EAAI,KACb,EAAI,OAAU,EAAG,MAAO,KAExB,IAAM,CAAC,EAAG,GAAI,EACd,IAAO;aAGD,MAAO,KAAM,EAAI,OAAO,KAAK,MAAM;;AAQ/C,WAJK,EAAG,MAAI,EAAG,OAAO,EAEtB,EAAE,IAAI,GAEC,EAAM,GAAG,IAAK,IAAK,EAAkB,EAAE,GAAG,IAAI,EAAG;;MAExD;EAyBJ,SAAS,EAAI,GAAG,GAAI;GAClB,IAAI,GAAa,GAAO,GAAK,GAAK,GAAG,GACnC,IAAI,GACJ,IAAI,GACJ,IAAO,EAAE,aACT,IAAK,EAAK;AAEZ,OAAI,EAAkB,EAAE,GAAG,GAAI,OAAM,MAAM,IAAqB,EAAkB,EAAE,CAAC;AAGrF,OAAI,CAAC,EAAE,EAAG,QAAO,IAAI,EAAK,EAAI;AAW9B,QATI,KAAM,QACR,IAAW,IACX,IAAM,KAEN,IAAM,GAGR,IAAI,IAAI,EAAK,OAAQ,EAEd,EAAE,KAAK,CAAC,IAAI,GAAI,EAErB,CADA,IAAI,EAAE,MAAM,EAAE,EACd,KAAK;AASP,QALA,IAAQ,KAAK,IAAI,EAAQ,GAAG,EAAE,CAAC,GAAG,KAAK,OAAO,IAAI,IAAI,GACtD,KAAO,GACP,IAAc,IAAM,IAAM,IAAI,EAAK,EAAI,EACvC,EAAK,YAAY,KAER;AAKP,QAJA,IAAM,EAAM,EAAI,MAAM,EAAE,EAAE,EAAI,EAC9B,IAAc,EAAY,MAAM,EAAE,EAAE,EACpC,IAAI,EAAI,KAAK,EAAO,GAAK,GAAa,EAAI,CAAC,EAEvC,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,KAAK,EAAe,EAAI,EAAE,CAAC,MAAM,GAAG,EAAI,EAAE;AAC7E,YAAO,KAAK,KAAM,EAAM,EAAI,MAAM,EAAI,EAAE,EAAI;AAE5C,YADA,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAK,EAAG,IAAI;;AAG1D,QAAM;;;EAMV,SAAS,EAAkB,GAAG;AAK5B,QAJA,IAAI,IAAI,EAAE,IAAI,GACZ,IAAI,EAAE,EAAE,IAGH,KAAK,IAAI,KAAK,GAAI;AACzB,UAAO;;EAIT,SAAS,EAAQ,GAAM,GAAI,GAAI;AAE7B,OAAI,IAAK,EAAK,KAAK,IAAI,CAMrB,OAFA,IAAW,IACP,MAAI,EAAK,YAAY,IACnB,MAAM,IAAe,gCAAgC;AAG7D,UAAO,EAAM,IAAI,EAAK,EAAK,KAAK,EAAE,EAAG;;EAIvC,SAAS,EAAc,GAAG;AAExB,QADA,IAAI,IAAK,IACF,KAAM,MAAM;AACnB,UAAO;;EAWT,SAAS,EAAG,GAAG,GAAI;GACjB,IAAI,GAAG,GAAI,GAAa,GAAG,GAAW,GAAK,GAAG,GAAK,GACjD,IAAI,GACJ,IAAQ,IACR,IAAI,GACJ,IAAK,EAAE,GACP,IAAO,EAAE,aACT,IAAK,EAAK;AAIZ,OAAI,EAAE,IAAI,EAAG,OAAM,MAAM,KAAgB,EAAE,IAAI,QAAQ,aAAa;AAGpE,OAAI,EAAE,GAAG,EAAI,CAAE,QAAO,IAAI,EAAK,EAAE;AASjC,OAPI,KAAM,QACR,IAAW,IACX,IAAM,KAEN,IAAM,GAGJ,EAAE,GAAG,GAAG,CAEV,QADI,MAAY,IAAW,KACpB,EAAQ,GAAM,EAAI;AAS3B,OANA,KAAO,GACP,EAAK,YAAY,GACjB,IAAI,EAAe,EAAG,EACtB,IAAK,EAAE,OAAO,EAAE,EAChB,IAAI,EAAkB,EAAE,EAEpB,KAAK,IAAI,EAAE,GAAG,iBAAQ;AAaxB,WAAO,IAAK,KAAK,KAAM,KAAK,KAAM,KAAK,EAAE,OAAO,EAAE,GAAG,GAInD,CAHA,IAAI,EAAE,MAAM,EAAE,EACd,IAAI,EAAe,EAAE,EAAE,EACvB,IAAK,EAAE,OAAO,EAAE,EAChB;AAKF,IAFA,IAAI,EAAkB,EAAE,EAEpB,IAAK,KACP,IAAI,IAAI,EAAK,OAAO,EAAE,EACtB,OAEA,IAAI,IAAI,EAAK,IAAK,MAAM,EAAE,MAAM,EAAE,CAAC;SAWrC,QAJA,IAAI,EAAQ,GAAM,IAAM,GAAG,EAAG,CAAC,MAAM,IAAI,GAAG,EAC5C,IAAI,EAAG,IAAI,EAAK,IAAK,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAM,EAAM,CAAC,KAAK,EAAE,EAE5D,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAG,EAAG,IAAI;AAYxD,QAJA,IAAM,IAAY,IAAI,EAAO,EAAE,MAAM,EAAI,EAAE,EAAE,KAAK,EAAI,EAAE,EAAI,EAC5D,IAAK,EAAM,EAAE,MAAM,EAAE,EAAE,EAAI,EAC3B,IAAc,KAEL;AAIP,QAHA,IAAY,EAAM,EAAU,MAAM,EAAG,EAAE,EAAI,EAC3C,IAAI,EAAI,KAAK,EAAO,GAAW,IAAI,EAAK,EAAY,EAAE,EAAI,CAAC,EAEvD,EAAe,EAAE,EAAE,CAAC,MAAM,GAAG,EAAI,KAAK,EAAe,EAAI,EAAE,CAAC,MAAM,GAAG,EAAI,CAQ3E,QAPA,IAAM,EAAI,MAAM,EAAE,EAGd,MAAM,MAAG,IAAM,EAAI,KAAK,EAAQ,GAAM,IAAM,GAAG,EAAG,CAAC,MAAM,IAAI,GAAG,CAAC,GACrE,IAAM,EAAO,GAAK,IAAI,EAAK,EAAE,EAAE,EAAI,EAEnC,EAAK,YAAY,GACV,KAAM,QAAQ,IAAW,IAAM,EAAM,GAAK,EAAG,IAAI;AAI1D,IADA,IAAM,GACN,KAAe;;;EAQnB,SAAS,EAAa,GAAG,GAAK;GAC5B,IAAI,GAAG,GAAG;AAmBV,SAhBK,IAAI,EAAI,QAAQ,IAAI,IAAI,OAAI,IAAM,EAAI,QAAQ,KAAK,GAAG,IAGtD,IAAI,EAAI,OAAO,KAAK,IAAI,KAGvB,IAAI,MAAG,IAAI,IACf,KAAK,CAAC,EAAI,MAAM,IAAI,EAAE,EACtB,IAAM,EAAI,UAAU,GAAG,EAAE,IAChB,IAAI,MAGb,IAAI,EAAI,SAIL,IAAI,GAAG,EAAI,WAAW,EAAE,KAAK,IAAK,GAAE;AAGzC,QAAK,IAAM,EAAI,QAAQ,EAAI,WAAW,IAAM,EAAE,KAAK,IAAK,GAAE;AAG1D,OAFA,IAAM,EAAI,MAAM,GAAG,EAAI,EAEnB,GAAK;AAaP,QAZA,KAAO,GACP,IAAI,IAAI,IAAI,GACZ,EAAE,IAAI,EAAU,IAAI,EAAS,EAC7B,EAAE,IAAI,EAAE,EAMR,KAAK,IAAI,KAAK,GACV,IAAI,MAAG,KAAK,IAEZ,IAAI,GAAK;AAEX,UADI,KAAG,EAAE,EAAE,KAAK,CAAC,EAAI,MAAM,GAAG,EAAE,CAAC,EAC5B,KAAO,GAAU,IAAI,GAAM,GAAE,EAAE,KAAK,CAAC,EAAI,MAAM,GAAG,KAAK,EAAS,CAAC;AAEtE,KADA,IAAM,EAAI,MAAM,EAAE,EAClB,IAAI,IAAW,EAAI;UAEnB,MAAK;AAGP,WAAO,KAAM,MAAO;AAGpB,QAFA,EAAE,EAAE,KAAK,CAAC,EAAI,EAEV,MAAa,EAAE,IAAI,KAAS,EAAE,IAAI,CAAC,GAAQ,OAAM,MAAM,IAAqB,EAAE;SAMlF,CAFA,EAAE,IAAI,GACN,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAE;AAGX,UAAO;;EAOR,SAAS,EAAM,GAAG,GAAI,GAAI;GACzB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAI,GAAS,GAAG,GAC9B,IAAK,EAAE;AAWT,QAAK,IAAI,GAAG,IAAI,EAAG,IAAI,KAAK,IAAI,KAAK,GAAI;AAIzC,OAHA,IAAI,IAAK,GAGL,IAAI,EAGN,CAFA,KAAK,GACL,IAAI,GACJ,IAAI,EAAG,IAAM;QACR;AAGL,QAFA,IAAM,KAAK,MAAM,IAAI,KAAK,EAAS,EACnC,IAAI,EAAG,QACH,KAAO,EAAG,QAAO;AAIrB,SAHA,IAAI,IAAI,EAAG,IAGN,IAAI,GAAG,KAAK,IAAI,KAAK,GAAI;AAO9B,IAJA,KAAK,GAIL,IAAI,IAAI,IAAW;;AAyBrB,OAtBI,MAAO,KAAK,MACd,IAAI,EAAQ,IAAI,IAAI,IAAI,EAAE,EAG1B,IAAK,IAAI,IAAI,KAAK,GAGlB,IAAU,IAAK,KAAK,EAAG,IAAM,OAAO,KAAK,KAAK,IAAI,GAMlD,IAAU,IAAK,KACV,KAAM,OAAa,KAAM,KAAK,MAAO,EAAE,IAAI,IAAI,IAAI,MACpD,IAAK,KAAK,KAAM,MAAM,KAAM,KAAK,KAAW,KAAM,MAGhD,IAAI,IAAI,IAAI,IAAI,IAAI,EAAQ,IAAI,IAAI,EAAE,GAAG,IAAI,EAAG,IAAM,MAAM,KAAM,KAClE,MAAO,EAAE,IAAI,IAAI,IAAI,MAGzB,IAAK,KAAK,CAAC,EAAG,GAkBhB,QAjBI,KACF,IAAI,EAAkB,EAAE,EACxB,EAAG,SAAS,GAGZ,IAAK,IAAK,IAAI,GAGd,EAAG,KAAK,EAAQ,KAAK,IAAW,IAAK,KAAY,EAAS,EAC1D,EAAE,IAAI,EAAU,CAAC,IAAK,EAAS,IAAI,MAEnC,EAAG,SAAS,GAGZ,EAAG,KAAK,EAAE,IAAI,EAAE,IAAI,IAGf;AAiBT,OAbI,KAAK,KACP,EAAG,SAAS,GACZ,IAAI,GACJ,QAEA,EAAG,SAAS,IAAM,GAClB,IAAI,EAAQ,IAAI,IAAW,EAAE,EAI7B,EAAG,KAAO,IAAI,KAAK,IAAI,EAAQ,IAAI,IAAI,EAAE,GAAG,EAAQ,IAAI,EAAE,GAAG,KAAK,IAAI,IAGpE,EACF,SAGE,KAAI,KAAO,GAAG;AACZ,KAAK,EAAG,MAAM,MAAM,MAClB,EAAG,KAAK,GACR,EAAE,EAAE;AAGN;UACK;AAEL,QADA,EAAG,MAAQ,GACP,EAAG,MAAQ,EAAM;AAErB,IADA,EAAG,OAAS,GACZ,IAAI;;AAMV,QAAK,IAAI,EAAG,QAAQ,EAAG,EAAE,OAAO,GAAI,GAAG,KAAK;AAE5C,OAAI,MAAa,EAAE,IAAI,KAAS,EAAE,IAAI,CAAC,GACrC,OAAM,MAAM,IAAqB,EAAkB,EAAE,CAAC;AAGxD,UAAO;;EAIT,SAAS,EAAS,GAAG,GAAG;GACtB,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAK,GAAI,GAAI,GAAM,GACpC,IAAO,EAAE,aACT,IAAK,EAAK;AAIZ,OAAI,CAAC,EAAE,KAAK,CAAC,EAAE,EAGb,QAFI,EAAE,IAAG,EAAE,IAAI,CAAC,EAAE,IACb,IAAI,IAAI,EAAK,EAAE,EACb,IAAW,EAAM,GAAG,EAAG,GAAG;AAcnC,OAXA,IAAK,EAAE,GACP,IAAK,EAAE,GAIP,IAAI,EAAE,GACN,IAAK,EAAE,GACP,IAAK,EAAG,OAAO,EACf,IAAI,IAAK,GAGL,GAAG;AAyBL,SAxBA,IAAO,IAAI,GAEP,KACF,IAAI,GACJ,IAAI,CAAC,GACL,IAAM,EAAG,WAET,IAAI,GACJ,IAAI,GACJ,IAAM,EAAG,SAMX,IAAI,KAAK,IAAI,KAAK,KAAK,IAAK,EAAS,EAAE,EAAI,GAAG,GAE1C,IAAI,MACN,IAAI,GACJ,EAAE,SAAS,IAIb,EAAE,SAAS,EACN,IAAI,GAAG,KAAM,GAAE,KAAK,EAAE;AAC3B,MAAE,SAAS;UAGN;AASL,SALA,IAAI,EAAG,QACP,IAAM,EAAG,QACT,IAAO,IAAI,GACP,MAAM,IAAM,IAEX,IAAI,GAAG,IAAI,GAAK,IACnB,KAAI,EAAG,MAAM,EAAG,IAAI;AAClB,SAAO,EAAG,KAAK,EAAG;AAClB;;AAIJ,QAAI;;AAcN,QAXI,MACF,IAAI,GACJ,IAAK,GACL,IAAK,GACL,EAAE,IAAI,CAAC,EAAE,IAGX,IAAM,EAAG,QAIJ,IAAI,EAAG,SAAS,GAAK,IAAI,GAAG,EAAE,EAAG,GAAG,OAAS;AAGlD,QAAK,IAAI,EAAG,QAAQ,IAAI,IAAI;AAC1B,QAAI,EAAG,EAAE,KAAK,EAAG,IAAI;AACnB,UAAK,IAAI,GAAG,KAAK,EAAG,EAAE,OAAO,GAAI,GAAG,KAAK,IAAO;AAEhD,KADA,EAAE,EAAG,IACL,EAAG,MAAM;;AAGX,MAAG,MAAM,EAAG;;AAId,UAAO,EAAG,EAAE,OAAS,GAAI,GAAG,KAAK;AAGjC,UAAO,EAAG,OAAO,GAAG,EAAG,OAAO,CAAE,GAAE;AASlC,UANK,EAAG,MAER,EAAE,IAAI,GACN,EAAE,IAAI,GAGC,IAAW,EAAM,GAAG,EAAG,GAAG,KANd,IAAI,EAAK,EAAE;;EAUhC,SAAS,EAAS,GAAG,GAAO,GAAI;GAC9B,IAAI,GACF,IAAI,EAAkB,EAAE,EACxB,IAAM,EAAe,EAAE,EAAE,EACzB,IAAM,EAAI;AAwBZ,UAtBI,KACE,MAAO,IAAI,IAAK,KAAO,IACzB,IAAM,EAAI,OAAO,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAAG,EAAc,EAAE,GAClD,IAAM,MACf,IAAM,EAAI,OAAO,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAG1C,IAAM,KAAO,IAAI,IAAI,MAAM,QAAQ,KAC1B,IAAI,KACb,IAAM,OAAO,EAAc,CAAC,IAAI,EAAE,GAAG,GACjC,MAAO,IAAI,IAAK,KAAO,MAAG,KAAO,EAAc,EAAE,KAC5C,KAAK,KACd,KAAO,EAAc,IAAI,IAAI,EAAI,EAC7B,MAAO,IAAI,IAAK,IAAI,KAAK,MAAG,IAAM,IAAM,MAAM,EAAc,EAAE,OAE7D,IAAI,IAAI,KAAK,MAAK,IAAM,EAAI,MAAM,GAAG,EAAE,GAAG,MAAM,EAAI,MAAM,EAAE,GAC7D,MAAO,IAAI,IAAK,KAAO,MACrB,IAAI,MAAM,MAAK,KAAO,MAC1B,KAAO,EAAc,EAAE,IAIpB,EAAE,IAAI,IAAI,MAAM,IAAM;;EAK/B,SAAS,EAAS,GAAK,GAAK;AAC1B,OAAI,EAAI,SAAS,EAEf,QADA,EAAI,SAAS,GACN;;EAmBX,SAAS,EAAM,GAAK;GAClB,IAAI,GAAG,GAAG;GASV,SAAS,EAAQ,GAAO;IACtB,IAAI,IAAI;AAGR,QAAI,EAAE,aAAa,GAAU,QAAO,IAAI,EAAQ,EAAM;AAOtD,QAHA,EAAE,cAAc,GAGZ,aAAiB,GAAS;AAG5B,KAFA,EAAE,IAAI,EAAM,GACZ,EAAE,IAAI,EAAM,GACZ,EAAE,KAAK,IAAQ,EAAM,KAAK,EAAM,OAAO,GAAG;AAC1C;;AAGF,QAAI,OAAO,KAAU,UAAU;AAG7B,SAAI,IAAQ,KAAM,EAChB,OAAM,MAAM,IAAkB,EAAM;AAGtC,SAAI,IAAQ,EACV,GAAE,IAAI;cACG,IAAQ,EAEjB,CADA,IAAQ,CAAC,GACT,EAAE,IAAI;UACD;AAGL,MAFA,EAAE,IAAI,GACN,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAE;AACT;;AAIF,SAAI,MAAU,CAAC,CAAC,KAAS,IAAQ,KAAK;AAEpC,MADA,EAAE,IAAI,GACN,EAAE,IAAI,CAAC,EAAM;AACb;;AAGF,YAAO,EAAa,GAAG,EAAM,UAAU,CAAC;eAC/B,OAAO,KAAU,SAC1B,OAAM,MAAM,IAAkB,EAAM;AAWtC,QAPI,EAAM,WAAW,EAAE,KAAK,MAC1B,IAAQ,EAAM,MAAM,EAAE,EACtB,EAAE,IAAI,MAEN,EAAE,IAAI,GAGJ,EAAU,KAAK,EAAM,CAAE,GAAa,GAAG,EAAM;QAC5C,OAAM,MAAM,IAAkB,EAAM;;AAmB3C,OAhBA,EAAQ,YAAY,GAEpB,EAAQ,WAAW,GACnB,EAAQ,aAAa,GACrB,EAAQ,aAAa,GACrB,EAAQ,cAAc,GACtB,EAAQ,gBAAgB,GACxB,EAAQ,kBAAkB,GAC1B,EAAQ,kBAAkB,GAC1B,EAAQ,kBAAkB,GAC1B,EAAQ,mBAAmB,GAE3B,EAAQ,QAAQ,GAChB,EAAQ,SAAS,EAAQ,MAAM,GAE3B,MAAQ,KAAK,MAAG,IAAM,EAAE,GACxB,EAEF,MADA,IAAK;IAAC;IAAa;IAAY;IAAY;IAAY;IAAO,EACzD,IAAI,GAAG,IAAI,EAAG,QAAS,CAAK,EAAI,eAAe,IAAI,EAAG,KAAK,KAAE,EAAI,KAAK,KAAK;AAKlF,UAFA,EAAQ,OAAO,EAAI,EAEZ;;EAiBT,SAAS,EAAO,GAAK;AACnB,OAAI,CAAC,KAAO,OAAO,KAAQ,SACzB,OAAM,MAAM,IAAe,kBAAkB;GAE/C,IAAI,GAAG,GAAG,GACR,IAAK;IACH;IAAa;IAAG;IAChB;IAAY;IAAG;IACf;IAAY;IAAQ;IACpB;IAAY;IAAG;IAChB;AAEH,QAAK,IAAI,GAAG,IAAI,EAAG,QAAQ,KAAK,EAC9B,MAAK,IAAI,EAAI,IAAI,EAAG,SAAS,KAAK,EAChC,KAAI,EAAU,EAAE,KAAK,KAAK,KAAK,EAAG,IAAI,MAAM,KAAK,EAAG,IAAI,GAAI,MAAK,KAAK;OACjE,OAAM,MAAM,IAAkB,IAAI,OAAO,EAAE;AAIpD,QAAK,IAAI,EAAI,IAAI,aAAa,KAAK,EAC/B,KAAI,KAAK,KAAK,KAAM,MAAK,KAAK,IAAI,KAAK,EAAE;OACpC,OAAM,MAAM,IAAkB,IAAI,OAAO,EAAE;AAGpD,UAAO;;AAiBT,EAZA,IAAU,EAAM,EAAQ,EAExB,EAAQ,UAAa,EAAQ,UAAU,GAGvC,IAAM,IAAI,EAAQ,EAAE,EAOhB,OAAO,UAAU,cAAc,OAAO,MACxC,OAAO,WAAY;AACjB,UAAO;IACP,GAGc,MAAU,UAAe,EAAO,UAChD,EAAO,UAAU,KAIjB,AACE,MAAc,OAAO,OAAQ,OAAe,QAAQ,KAAK,QAAQ,OAC7D,OAAO,SAAS,cAAc,EAAE,EAGtC,EAAY,UAAU;MAElB"}

package/dist/node_modules/eventemitter3/index.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.js","names":[],"sources":["../../../node_modules/eventemitter3/index.js"],"sourcesContent":["'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n Events.prototype = Object.create(null);\n\n //\n // This hack is needed because the `__proto__` property is still inherited in\n // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n //\n if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n this.fn = fn;\n this.context = context;\n this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n if (typeof fn !== 'function') {\n throw new TypeError('The listener must be a function');\n }\n\n var listener = new EE(fn, context || emitter, once)\n , evt = prefix ? prefix + event : event;\n\n if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n else emitter._events[evt] = [emitter._events[evt], listener];\n\n return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n if (--emitter._eventsCount === 0) emitter._events = new Events();\n else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n this._events = new Events();\n this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n var names = []\n , events\n , name;\n\n if (this._eventsCount === 0) return names;\n\n for (name in (events = this._events)) {\n if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n }\n\n if (Object.getOwnPropertySymbols) {\n return names.concat(Object.getOwnPropertySymbols(events));\n }\n\n return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n var evt = prefix ? prefix + event : event\n , handlers = this._events[evt];\n\n if (!handlers) return [];\n if (handlers.fn) return [handlers.fn];\n\n for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n ee[i] = handlers[i].fn;\n }\n\n return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n var evt = prefix ? prefix + event : event\n , listeners = this._events[evt];\n\n if (!listeners) return 0;\n if (listeners.fn) return 1;\n return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return false;\n\n var listeners = this._events[evt]\n , len = arguments.length\n , args\n , i;\n\n if (listeners.fn) {\n if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n switch (len) {\n case 1: return listeners.fn.call(listeners.context), true;\n case 2: return listeners.fn.call(listeners.context, a1), true;\n case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n }\n\n for (i = 1, args = new Array(len -1); i < len; i++) {\n args[i - 1] = arguments[i];\n }\n\n listeners.fn.apply(listeners.context, args);\n } else {\n var length = listeners.length\n , j;\n\n for (i = 0; i < length; i++) {\n if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n switch (len) {\n case 1: listeners[i].fn.call(listeners[i].context); break;\n case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n default:\n if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n args[j - 1] = arguments[j];\n }\n\n listeners[i].fn.apply(listeners[i].context, args);\n }\n }\n }\n\n return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n var evt = prefix ? prefix + event : event;\n\n if (!this._events[evt]) return this;\n if (!fn) {\n clearEvent(this, evt);\n return this;\n }\n\n var listeners = this._events[evt];\n\n if (listeners.fn) {\n if (\n listeners.fn === fn &&\n (!once || listeners.once) &&\n (!context || listeners.context === context)\n ) {\n clearEvent(this, evt);\n }\n } else {\n for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n if (\n listeners[i].fn !== fn ||\n (once && !listeners[i].once) ||\n (context && listeners[i].context !== context)\n ) {\n events.push(listeners[i]);\n }\n }\n\n //\n // Reset the array, or remove it completely if we have no more listeners.\n //\n if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n else clearEvent(this, evt);\n }\n\n return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n var evt;\n\n if (event) {\n evt = prefix ? prefix + event : event;\n if (this._events[evt]) clearEvent(this, evt);\n } else {\n this._events = new Events();\n this._eventsCount = 0;\n }\n\n return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n module.exports = EventEmitter;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;CAEA,IAAI,IAAM,OAAO,UAAU,gBACvB,IAAS;CASb,SAAS,IAAS;AASlB,CAAI,OAAO,WACT,EAAO,YAAY,OAAO,OAAO,KAAK,EAMjC,IAAI,GAAQ,CAAC,cAAW,IAAS;CAYxC,SAAS,EAAG,GAAI,GAAS,GAAM;AAG7B,EAFA,KAAK,KAAK,GACV,KAAK,UAAU,GACf,KAAK,OAAO,KAAQ;;CActB,SAAS,EAAY,GAAS,GAAO,GAAI,GAAS,GAAM;AACtD,MAAI,OAAO,KAAO,WAChB,OAAU,UAAU,kCAAkC;EAGxD,IAAI,IAAW,IAAI,EAAG,GAAI,KAAW,GAAS,EAAK,EAC/C,IAAM,IAAS,IAAS,IAAQ;AAMpC,SAJK,EAAQ,QAAQ,KACX,EAAQ,QAAQ,GAAK,KAC1B,EAAQ,QAAQ,KAAO,CAAC,EAAQ,QAAQ,IAAM,EAAS,GADzB,EAAQ,QAAQ,GAAK,KAAK,EAAS,IAD3C,EAAQ,QAAQ,KAAO,GAAU,EAAQ,iBAI7D;;CAUT,SAAS,EAAW,GAAS,GAAK;AAChC,EAAI,EAAE,EAAQ,iBAAiB,IAAG,EAAQ,UAAU,IAAI,GAAQ,GAC3D,OAAO,EAAQ,QAAQ;;CAU9B,SAAS,IAAe;AAEtB,EADA,KAAK,UAAU,IAAI,GAAQ,EAC3B,KAAK,eAAe;;AAgPtB,CAtOA,EAAa,UAAU,aAAa,WAAsB;EACxD,IAAI,IAAQ,EAAE,EACV,GACA;AAEJ,MAAI,KAAK,iBAAiB,EAAG,QAAO;AAEpC,OAAK,KAAS,IAAS,KAAK,QAC1B,CAAI,EAAI,KAAK,GAAQ,EAAK,IAAE,EAAM,KAAK,IAAS,EAAK,MAAM,EAAE,GAAG,EAAK;AAOvE,SAJI,OAAO,wBACF,EAAM,OAAO,OAAO,sBAAsB,EAAO,CAAC,GAGpD;IAUT,EAAa,UAAU,YAAY,SAAmB,GAAO;EAC3D,IAAI,IAAM,IAAS,IAAS,IAAQ,GAChC,IAAW,KAAK,QAAQ;AAE5B,MAAI,CAAC,EAAU,QAAO,EAAE;AACxB,MAAI,EAAS,GAAI,QAAO,CAAC,EAAS,GAAG;AAErC,OAAK,IAAI,IAAI,GAAG,IAAI,EAAS,QAAQ,IAAS,MAAM,EAAE,EAAE,IAAI,GAAG,IAC7D,GAAG,KAAK,EAAS,GAAG;AAGtB,SAAO;IAUT,EAAa,UAAU,gBAAgB,SAAuB,GAAO;EACnE,IAAI,IAAM,IAAS,IAAS,IAAQ,GAChC,IAAY,KAAK,QAAQ;AAI7B,SAFK,IACD,EAAU,KAAW,IAClB,EAAU,SAFM;IAYzB,EAAa,UAAU,OAAO,SAAc,GAAO,GAAI,GAAI,GAAI,GAAI,GAAI;EACrE,IAAI,IAAM,IAAS,IAAS,IAAQ;AAEpC,MAAI,CAAC,KAAK,QAAQ,GAAM,QAAO;EAE/B,IAAI,IAAY,KAAK,QAAQ,IACzB,IAAM,UAAU,QAChB,GACA;AAEJ,MAAI,EAAU,IAAI;AAGhB,WAFI,EAAU,QAAM,KAAK,eAAe,GAAO,EAAU,IAAI,KAAA,GAAW,GAAK,EAErE,GAAR;IACE,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,QAAQ,EAAE;IACrD,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,SAAS,EAAG,EAAE;IACzD,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,SAAS,GAAI,EAAG,EAAE;IAC7D,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,SAAS,GAAI,GAAI,EAAG,EAAE;IACjE,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,SAAS,GAAI,GAAI,GAAI,EAAG,EAAE;IACrE,KAAK,EAAG,QAAO,EAAU,GAAG,KAAK,EAAU,SAAS,GAAI,GAAI,GAAI,GAAI,EAAG,EAAE;;AAG3E,QAAK,IAAI,GAAG,IAAW,MAAM,IAAK,EAAE,EAAE,IAAI,GAAK,IAC7C,GAAK,IAAI,KAAK,UAAU;AAG1B,KAAU,GAAG,MAAM,EAAU,SAAS,EAAK;SACtC;GACL,IAAI,IAAS,EAAU,QACnB;AAEJ,QAAK,IAAI,GAAG,IAAI,GAAQ,IAGtB,SAFI,EAAU,GAAG,QAAM,KAAK,eAAe,GAAO,EAAU,GAAG,IAAI,KAAA,GAAW,GAAK,EAE3E,GAAR;IACE,KAAK;AAAG,OAAU,GAAG,GAAG,KAAK,EAAU,GAAG,QAAQ;AAAE;IACpD,KAAK;AAAG,OAAU,GAAG,GAAG,KAAK,EAAU,GAAG,SAAS,EAAG;AAAE;IACxD,KAAK;AAAG,OAAU,GAAG,GAAG,KAAK,EAAU,GAAG,SAAS,GAAI,EAAG;AAAE;IAC5D,KAAK;AAAG,OAAU,GAAG,GAAG,KAAK,EAAU,GAAG,SAAS,GAAI,GAAI,EAAG;AAAE;IAChE;AACE,SAAI,CAAC,EAAM,MAAK,IAAI,GAAG,IAAW,MAAM,IAAK,EAAE,EAAE,IAAI,GAAK,IACxD,GAAK,IAAI,KAAK,UAAU;AAG1B,OAAU,GAAG,GAAG,MAAM,EAAU,GAAG,SAAS,EAAK;;;AAKzD,SAAO;IAYT,EAAa,UAAU,KAAK,SAAY,GAAO,GAAI,GAAS;AAC1D,SAAO,EAAY,MAAM,GAAO,GAAI,GAAS,GAAM;IAYrD,EAAa,UAAU,OAAO,SAAc,GAAO,GAAI,GAAS;AAC9D,SAAO,EAAY,MAAM,GAAO,GAAI,GAAS,GAAK;IAapD,EAAa,UAAU,iBAAiB,SAAwB,GAAO,GAAI,GAAS,GAAM;EACxF,IAAI,IAAM,IAAS,IAAS,IAAQ;AAEpC,MAAI,CAAC,KAAK,QAAQ,GAAM,QAAO;AAC/B,MAAI,CAAC,EAEH,QADA,EAAW,MAAM,EAAI,EACd;EAGT,IAAI,IAAY,KAAK,QAAQ;AAE7B,MAAI,EAAU,IAEV,EAAU,OAAO,MAChB,CAAC,KAAQ,EAAU,UACnB,CAAC,KAAW,EAAU,YAAY,MAEnC,EAAW,MAAM,EAAI;OAElB;AACL,QAAK,IAAI,IAAI,GAAG,IAAS,EAAE,EAAE,IAAS,EAAU,QAAQ,IAAI,GAAQ,IAClE,EACE,EAAU,GAAG,OAAO,KACnB,KAAQ,CAAC,EAAU,GAAG,QACtB,KAAW,EAAU,GAAG,YAAY,MAErC,EAAO,KAAK,EAAU,GAAG;AAO7B,GAAI,EAAO,SAAQ,KAAK,QAAQ,KAAO,EAAO,WAAW,IAAI,EAAO,KAAK,IACpE,EAAW,MAAM,EAAI;;AAG5B,SAAO;IAUT,EAAa,UAAU,qBAAqB,SAA4B,GAAO;EAC7E,IAAI;AAUJ,SARI,KACF,IAAM,IAAS,IAAS,IAAQ,GAC5B,KAAK,QAAQ,MAAM,EAAW,MAAM,EAAI,KAE5C,KAAK,UAAU,IAAI,GAAQ,EAC3B,KAAK,eAAe,IAGf;IAMT,EAAa,UAAU,MAAM,EAAa,UAAU,gBACpD,EAAa,UAAU,cAAc,EAAa,UAAU,IAK5D,EAAa,WAAW,GAKxB,EAAa,eAAe,GAKD,MAAvB,WACF,EAAO,UAAU"}

package/dist/node_modules/fast-equals/dist/es/index.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/fast-equals/dist/es/index.mjs"],"sourcesContent":["const { getOwnPropertyNames, getOwnPropertySymbols } = Object;\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst { hasOwnProperty } = Object.prototype;\n/**\n * Combine two comparators into a single comparators.\n */\nfunction combineComparators(comparatorA, comparatorB) {\n return function isEqual(a, b, state) {\n return comparatorA(a, b, state) && comparatorB(a, b, state);\n };\n}\n/**\n * Wrap the provided `areItemsEqual` method to manage the circular state, allowing\n * for circular references to be safely included in the comparison without creating\n * stack overflows.\n */\nfunction createIsCircular(areItemsEqual) {\n return function isCircular(a, b, state) {\n if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n return areItemsEqual(a, b, state);\n }\n const { cache } = state;\n const cachedA = cache.get(a);\n const cachedB = cache.get(b);\n if (cachedA && cachedB) {\n return cachedA === b && cachedB === a;\n }\n cache.set(a, b);\n cache.set(b, a);\n const result = areItemsEqual(a, b, state);\n cache.delete(a);\n cache.delete(b);\n return result;\n };\n}\n/**\n * Get the `@@toStringTag` of the value, if it exists.\n */\nfunction getShortTag(value) {\n return value != null ? value[Symbol.toStringTag] : undefined;\n}\n/**\n * Get the properties to strictly examine, which include both own properties that are\n * not enumerable and symbol properties.\n */\nfunction getStrictProperties(object) {\n return getOwnPropertyNames(object).concat(getOwnPropertySymbols(object));\n}\n/**\n * Whether the object contains the property passed as an own property.\n */\nconst hasOwn = \n// eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\nObject.hasOwn || ((object, property) => hasOwnProperty.call(object, property));\n/**\n * Whether the values passed are strictly equal or both NaN.\n */\nfunction sameValueZeroEqual(a, b) {\n return a === b || (!a && !b && a !== a && b !== b);\n}\n\nconst PREACT_VNODE = '__v';\nconst PREACT_OWNER = '__o';\nconst REACT_OWNER = '_owner';\nconst { getOwnPropertyDescriptor, keys } = Object;\n/**\n * Whether the array buffers are equal in value.\n */\nfunction areArrayBuffersEqual(a, b) {\n return a.byteLength === b.byteLength && areTypedArraysEqual(new Uint8Array(a), new Uint8Array(b));\n}\n/**\n * Whether the arrays are equal in value.\n */\nfunction areArraysEqual(a, b, state) {\n let index = a.length;\n if (b.length !== index) {\n return false;\n }\n while (index-- > 0) {\n if (!state.equals(a[index], b[index], index, index, a, b, state)) {\n return false;\n }\n }\n return true;\n}\n/**\n * Whether the dataviews are equal in value.\n */\nfunction areDataViewsEqual(a, b) {\n return (a.byteLength === b.byteLength\n && areTypedArraysEqual(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)));\n}\n/**\n * Whether the dates passed are equal in value.\n */\nfunction areDatesEqual(a, b) {\n return sameValueZeroEqual(a.getTime(), b.getTime());\n}\n/**\n * Whether the errors passed are equal in value.\n */\nfunction areErrorsEqual(a, b) {\n return a.name === b.name && a.message === b.message && a.cause === b.cause && a.stack === b.stack;\n}\n/**\n * Whether the functions passed are equal in value.\n */\nfunction areFunctionsEqual(a, b) {\n return a === b;\n}\n/**\n * Whether the `Map`s are equal in value.\n */\nfunction areMapsEqual(a, b, state) {\n const size = a.size;\n if (size !== b.size) {\n return false;\n }\n if (!size) {\n return true;\n }\n const matchedIndices = new Array(size);\n const aIterable = a.entries();\n let aResult;\n let bResult;\n let index = 0;\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n while ((aResult = aIterable.next())) {\n if (aResult.done) {\n break;\n }\n const bIterable = b.entries();\n let hasMatch = false;\n let matchIndex = 0;\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n while ((bResult = bIterable.next())) {\n if (bResult.done) {\n break;\n }\n if (matchedIndices[matchIndex]) {\n matchIndex++;\n continue;\n }\n const aEntry = aResult.value;\n const bEntry = bResult.value;\n if (state.equals(aEntry[0], bEntry[0], index, matchIndex, a, b, state)\n && state.equals(aEntry[1], bEntry[1], aEntry[0], bEntry[0], a, b, state)) {\n hasMatch = matchedIndices[matchIndex] = true;\n break;\n }\n matchIndex++;\n }\n if (!hasMatch) {\n return false;\n }\n index++;\n }\n return true;\n}\n/**\n * Whether the numbers are equal in value.\n */\nconst areNumbersEqual = sameValueZeroEqual;\n/**\n * Whether the objects are equal in value.\n */\nfunction areObjectsEqual(a, b, state) {\n const properties = keys(a);\n let index = properties.length;\n if (keys(b).length !== index) {\n return false;\n }\n // Decrementing `while` showed faster results than either incrementing or\n // decrementing `for` loop and than an incrementing `while` loop. Declarative\n // methods like `some` / `every` were not used to avoid incurring the garbage\n // cost of anonymous callbacks.\n while (index-- > 0) {\n if (!isPropertyEqual(a, b, state, properties[index])) {\n return false;\n }\n }\n return true;\n}\n/**\n * Whether the objects are equal in value with strict property checking.\n */\nfunction areObjectsEqualStrict(a, b, state) {\n const properties = getStrictProperties(a);\n let index = properties.length;\n if (getStrictProperties(b).length !== index) {\n return false;\n }\n let property;\n let descriptorA;\n let descriptorB;\n // Decrementing `while` showed faster results than either incrementing or\n // decrementing `for` loop and than an incrementing `while` loop. Declarative\n // methods like `some` / `every` were not used to avoid incurring the garbage\n // cost of anonymous callbacks.\n while (index-- > 0) {\n property = properties[index];\n if (!isPropertyEqual(a, b, state, property)) {\n return false;\n }\n descriptorA = getOwnPropertyDescriptor(a, property);\n descriptorB = getOwnPropertyDescriptor(b, property);\n if ((descriptorA || descriptorB)\n && (!descriptorA\n || !descriptorB\n || descriptorA.configurable !== descriptorB.configurable\n || descriptorA.enumerable !== descriptorB.enumerable\n || descriptorA.writable !== descriptorB.writable)) {\n return false;\n }\n }\n return true;\n}\n/**\n * Whether the primitive wrappers passed are equal in value.\n */\nfunction arePrimitiveWrappersEqual(a, b) {\n return sameValueZeroEqual(a.valueOf(), b.valueOf());\n}\n/**\n * Whether the regexps passed are equal in value.\n */\nfunction areRegExpsEqual(a, b) {\n return a.source === b.source && a.flags === b.flags;\n}\n/**\n * Whether the `Set`s are equal in value.\n */\nfunction areSetsEqual(a, b, state) {\n const size = a.size;\n if (size !== b.size) {\n return false;\n }\n if (!size) {\n return true;\n }\n const matchedIndices = new Array(size);\n const aIterable = a.values();\n let aResult;\n let bResult;\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n while ((aResult = aIterable.next())) {\n if (aResult.done) {\n break;\n }\n const bIterable = b.values();\n let hasMatch = false;\n let matchIndex = 0;\n // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n while ((bResult = bIterable.next())) {\n if (bResult.done) {\n break;\n }\n if (!matchedIndices[matchIndex]\n && state.equals(aResult.value, bResult.value, aResult.value, bResult.value, a, b, state)) {\n hasMatch = matchedIndices[matchIndex] = true;\n break;\n }\n matchIndex++;\n }\n if (!hasMatch) {\n return false;\n }\n }\n return true;\n}\n/**\n * Whether the TypedArray instances are equal in value.\n */\nfunction areTypedArraysEqual(a, b) {\n let index = a.byteLength;\n if (b.byteLength !== index || a.byteOffset !== b.byteOffset) {\n return false;\n }\n while (index-- > 0) {\n if (a[index] !== b[index]) {\n return false;\n }\n }\n return true;\n}\n/**\n * Whether the URL instances are equal in value.\n */\nfunction areUrlsEqual(a, b) {\n return (a.hostname === b.hostname\n && a.pathname === b.pathname\n && a.protocol === b.protocol\n && a.port === b.port\n && a.hash === b.hash\n && a.username === b.username\n && a.password === b.password);\n}\nfunction isPropertyEqual(a, b, state, property) {\n if ((property === REACT_OWNER || property === PREACT_OWNER || property === PREACT_VNODE)\n && (a.$$typeof || b.$$typeof)) {\n return true;\n }\n return hasOwn(b, property) && state.equals(a[property], b[property], property, property, a, b, state);\n}\n\nconst ARRAY_BUFFER_TAG = '[object ArrayBuffer]';\nconst ARGUMENTS_TAG = '[object Arguments]';\nconst BOOLEAN_TAG = '[object Boolean]';\nconst DATA_VIEW_TAG = '[object DataView]';\nconst DATE_TAG = '[object Date]';\nconst ERROR_TAG = '[object Error]';\nconst MAP_TAG = '[object Map]';\nconst NUMBER_TAG = '[object Number]';\nconst OBJECT_TAG = '[object Object]';\nconst REG_EXP_TAG = '[object RegExp]';\nconst SET_TAG = '[object Set]';\nconst STRING_TAG = '[object String]';\nconst TYPED_ARRAY_TAGS = {\n '[object Int8Array]': true,\n '[object Uint8Array]': true,\n '[object Uint8ClampedArray]': true,\n '[object Int16Array]': true,\n '[object Uint16Array]': true,\n '[object Int32Array]': true,\n '[object Uint32Array]': true,\n '[object Float16Array]': true,\n '[object Float32Array]': true,\n '[object Float64Array]': true,\n '[object BigInt64Array]': true,\n '[object BigUint64Array]': true,\n};\nconst URL_TAG = '[object URL]';\n// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Create a comparator method based on the type-specific equality comparators passed.\n */\nfunction createEqualityComparator({ areArrayBuffersEqual, areArraysEqual, areDataViewsEqual, areDatesEqual, areErrorsEqual, areFunctionsEqual, areMapsEqual, areNumbersEqual, areObjectsEqual, arePrimitiveWrappersEqual, areRegExpsEqual, areSetsEqual, areTypedArraysEqual, areUrlsEqual, unknownTagComparators, }) {\n /**\n * compare the value of the two objects and return true if they are equivalent in values\n */\n return function comparator(a, b, state) {\n // If the items are strictly equal, no need to do a value comparison.\n if (a === b) {\n return true;\n }\n // If either of the items are nullish and fail the strictly equal check\n // above, then they must be unequal.\n if (a == null || b == null) {\n return false;\n }\n const type = typeof a;\n if (type !== typeof b) {\n return false;\n }\n if (type !== 'object') {\n if (type === 'number') {\n return areNumbersEqual(a, b, state);\n }\n if (type === 'function') {\n return areFunctionsEqual(a, b, state);\n }\n // If a primitive value that is not strictly equal, it must be unequal.\n return false;\n }\n const constructor = a.constructor;\n // Checks are listed in order of commonality of use-case:\n // 1. Common complex object types (plain object, array)\n // 2. Common data values (date, regexp)\n // 3. Less-common complex object types (map, set)\n // 4. Less-common data values (promise, primitive wrappers)\n // Inherently this is both subjective and assumptive, however\n // when reviewing comparable libraries in the wild this order\n // appears to be generally consistent.\n // Constructors should match, otherwise there is potential for false positives\n // between class and subclass or custom object and POJO.\n if (constructor !== b.constructor) {\n return false;\n }\n // `isPlainObject` only checks against the object's own realm. Cross-realm\n // comparisons are rare, and will be handled in the ultimate fallback, so\n // we can avoid capturing the string tag.\n if (constructor === Object) {\n return areObjectsEqual(a, b, state);\n }\n // `isArray()` works on subclasses and is cross-realm, so we can avoid capturing\n // the string tag or doing an `instanceof` check.\n if (Array.isArray(a)) {\n return areArraysEqual(a, b, state);\n }\n // Try to fast-path equality checks for other complex object types in the\n // same realm to avoid capturing the string tag. Strict equality is used\n // instead of `instanceof` because it is more performant for the common\n // use-case. If someone is subclassing a native class, it will be handled\n // with the string tag comparison.\n if (constructor === Date) {\n return areDatesEqual(a, b, state);\n }\n if (constructor === RegExp) {\n return areRegExpsEqual(a, b, state);\n }\n if (constructor === Map) {\n return areMapsEqual(a, b, state);\n }\n if (constructor === Set) {\n return areSetsEqual(a, b, state);\n }\n // Since this is a custom object, capture the string tag to determing its type.\n // This is reasonably performant in modern environments like v8 and SpiderMonkey.\n const tag = toString.call(a);\n if (tag === DATE_TAG) {\n return areDatesEqual(a, b, state);\n }\n // For RegExp, the properties are not enumerable, and therefore will give false positives if\n // tested like a standard object.\n if (tag === REG_EXP_TAG) {\n return areRegExpsEqual(a, b, state);\n }\n if (tag === MAP_TAG) {\n return areMapsEqual(a, b, state);\n }\n if (tag === SET_TAG) {\n return areSetsEqual(a, b, state);\n }\n if (tag === OBJECT_TAG) {\n // The exception for value comparison is custom `Promise`-like class instances. These should\n // be treated the same as standard `Promise` objects, which means strict equality, and if\n // it reaches this point then that strict equality comparison has already failed.\n return typeof a.then !== 'function' && typeof b.then !== 'function' && areObjectsEqual(a, b, state);\n }\n // If a URL tag, it should be tested explicitly. Like RegExp, the properties are not\n // enumerable, and therefore will give false positives if tested like a standard object.\n if (tag === URL_TAG) {\n return areUrlsEqual(a, b, state);\n }\n // If an error tag, it should be tested explicitly. Like RegExp, the properties are not\n // enumerable, and therefore will give false positives if tested like a standard object.\n if (tag === ERROR_TAG) {\n return areErrorsEqual(a, b, state);\n }\n // If an arguments tag, it should be treated as a standard object.\n if (tag === ARGUMENTS_TAG) {\n return areObjectsEqual(a, b, state);\n }\n if (TYPED_ARRAY_TAGS[tag]) {\n return areTypedArraysEqual(a, b, state);\n }\n if (tag === ARRAY_BUFFER_TAG) {\n return areArrayBuffersEqual(a, b, state);\n }\n if (tag === DATA_VIEW_TAG) {\n return areDataViewsEqual(a, b, state);\n }\n // As the penultimate fallback, check if the values passed are primitive wrappers. This\n // is very rare in modern JS, which is why it is deprioritized compared to all other object\n // types.\n if (tag === BOOLEAN_TAG || tag === NUMBER_TAG || tag === STRING_TAG) {\n return arePrimitiveWrappersEqual(a, b, state);\n }\n if (unknownTagComparators) {\n let unknownTagComparator = unknownTagComparators[tag];\n if (!unknownTagComparator) {\n const shortTag = getShortTag(a);\n if (shortTag) {\n unknownTagComparator = unknownTagComparators[shortTag];\n }\n }\n // If the custom config has an unknown tag comparator that matches the captured tag or the\n // @@toStringTag, it is the source of truth for whether the values are equal.\n if (unknownTagComparator) {\n return unknownTagComparator(a, b, state);\n }\n }\n // If not matching any tags that require a specific type of comparison, then we hard-code false because\n // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\n // - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\n // comparison that can be made.\n // - For types that can be introspected, but rarely have requirements to be compared\n // (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\n // use-cases (may be included in a future release, if requested enough).\n // - For types that can be introspected but do not have an objective definition of what\n // equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\n // In all cases, these decisions should be reevaluated based on changes to the language and\n // common development practices.\n return false;\n };\n}\n/**\n * Create the configuration object used for building comparators.\n */\nfunction createEqualityComparatorConfig({ circular, createCustomConfig, strict, }) {\n let config = {\n areArrayBuffersEqual,\n areArraysEqual: strict ? areObjectsEqualStrict : areArraysEqual,\n areDataViewsEqual,\n areDatesEqual: areDatesEqual,\n areErrorsEqual: areErrorsEqual,\n areFunctionsEqual: areFunctionsEqual,\n areMapsEqual: strict ? combineComparators(areMapsEqual, areObjectsEqualStrict) : areMapsEqual,\n areNumbersEqual: areNumbersEqual,\n areObjectsEqual: strict ? areObjectsEqualStrict : areObjectsEqual,\n arePrimitiveWrappersEqual: arePrimitiveWrappersEqual,\n areRegExpsEqual: areRegExpsEqual,\n areSetsEqual: strict ? combineComparators(areSetsEqual, areObjectsEqualStrict) : areSetsEqual,\n areTypedArraysEqual: strict\n ? combineComparators(areTypedArraysEqual, areObjectsEqualStrict)\n : areTypedArraysEqual,\n areUrlsEqual: areUrlsEqual,\n unknownTagComparators: undefined,\n };\n if (createCustomConfig) {\n config = Object.assign({}, config, createCustomConfig(config));\n }\n if (circular) {\n const areArraysEqual = createIsCircular(config.areArraysEqual);\n const areMapsEqual = createIsCircular(config.areMapsEqual);\n const areObjectsEqual = createIsCircular(config.areObjectsEqual);\n const areSetsEqual = createIsCircular(config.areSetsEqual);\n config = Object.assign({}, config, {\n areArraysEqual,\n areMapsEqual,\n areObjectsEqual,\n areSetsEqual,\n });\n }\n return config;\n}\n/**\n * Default equality comparator pass-through, used as the standard `isEqual` creator for\n * use inside the built comparator.\n */\nfunction createInternalEqualityComparator(compare) {\n return function (a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, state) {\n return compare(a, b, state);\n };\n}\n/**\n * Create the `isEqual` function used by the consuming application.\n */\nfunction createIsEqual({ circular, comparator, createState, equals, strict }) {\n if (createState) {\n return function isEqual(a, b) {\n const { cache = circular ? new WeakMap() : undefined, meta } = createState();\n return comparator(a, b, {\n cache,\n equals,\n meta,\n strict,\n });\n };\n }\n if (circular) {\n return function isEqual(a, b) {\n return comparator(a, b, {\n cache: new WeakMap(),\n equals,\n meta: undefined,\n strict,\n });\n };\n }\n const state = {\n cache: undefined,\n equals,\n meta: undefined,\n strict,\n };\n return function isEqual(a, b) {\n return comparator(a, b, state);\n };\n}\n\n/**\n * Whether the items passed are deeply-equal in value.\n */\nconst deepEqual = createCustomEqual();\n/**\n * Whether the items passed are deeply-equal in value based on strict comparison.\n */\nconst strictDeepEqual = createCustomEqual({ strict: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references.\n */\nconst circularDeepEqual = createCustomEqual({ circular: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularDeepEqual = createCustomEqual({\n circular: true,\n strict: true,\n});\n/**\n * Whether the items passed are shallowly-equal in value.\n */\nconst shallowEqual = createCustomEqual({\n createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value based on strict comparison\n */\nconst strictShallowEqual = createCustomEqual({\n strict: true,\n createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references.\n */\nconst circularShallowEqual = createCustomEqual({\n circular: true,\n createInternalComparator: () => sameValueZeroEqual,\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references,\n * based on strict comparison.\n */\nconst strictCircularShallowEqual = createCustomEqual({\n circular: true,\n createInternalComparator: () => sameValueZeroEqual,\n strict: true,\n});\n/**\n * Create a custom equality comparison method.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `RegExp.prototype.flags` out of the box.\n */\nfunction createCustomEqual(options = {}) {\n const { circular = false, createInternalComparator: createCustomInternalComparator, createState, strict = false, } = options;\n const config = createEqualityComparatorConfig(options);\n const comparator = createEqualityComparator(config);\n const equals = createCustomInternalComparator\n ? createCustomInternalComparator(comparator)\n : createInternalEqualityComparator(comparator);\n return createIsEqual({ circular, comparator, createState, equals, strict });\n}\n\nexport { circularDeepEqual, circularShallowEqual, createCustomEqual, deepEqual, sameValueZeroEqual, shallowEqual, strictCircularDeepEqual, strictCircularShallowEqual, strictDeepEqual, strictShallowEqual };\n//# sourceMappingURL=index.mjs.map\n"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAM,EAAE,wBAAqB,6BAA0B,QAEjD,EAAE,sBAAmB,OAAO;AAIlC,SAAS,EAAmB,GAAa,GAAa;AAClD,QAAO,SAAiB,GAAG,GAAG,GAAO;AACjC,SAAO,EAAY,GAAG,GAAG,EAAM,IAAI,EAAY,GAAG,GAAG,EAAM;;;AAQnE,SAAS,EAAiB,GAAe;AACrC,QAAO,SAAoB,GAAG,GAAG,GAAO;AACpC,MAAI,CAAC,KAAK,CAAC,KAAK,OAAO,KAAM,YAAY,OAAO,KAAM,SAClD,QAAO,EAAc,GAAG,GAAG,EAAM;EAErC,IAAM,EAAE,aAAU,GACZ,IAAU,EAAM,IAAI,EAAE,EACtB,IAAU,EAAM,IAAI,EAAE;AAC5B,MAAI,KAAW,EACX,QAAO,MAAY,KAAK,MAAY;AAGxC,EADA,EAAM,IAAI,GAAG,EAAE,EACf,EAAM,IAAI,GAAG,EAAE;EACf,IAAM,IAAS,EAAc,GAAG,GAAG,EAAM;AAGzC,SAFA,EAAM,OAAO,EAAE,EACf,EAAM,OAAO,EAAE,EACR;;;AAMf,SAAS,EAAY,GAAO;AACxB,QAAO,IAAsB,OAAO;;AAMxC,SAAS,EAAoB,GAAQ;AACjC,QAAO,EAAoB,EAAO,CAAC,OAAO,EAAsB,EAAO,CAAC;;AAK5E,IAAM,IAEN,OAAO,YAAY,GAAQ,MAAa,EAAe,KAAK,GAAQ,EAAS;AAI7E,SAAS,EAAmB,GAAG,GAAG;AAC9B,QAAO,MAAM,KAAM,CAAC,KAAK,CAAC,KAAK,MAAM,KAAK,MAAM;;AAGpD,IAAM,IAAe,OACf,IAAe,OACf,IAAc,UACd,EAAE,6BAA0B,YAAS;AAI3C,SAAS,EAAqB,GAAG,GAAG;AAChC,QAAO,EAAE,eAAe,EAAE,cAAc,EAAoB,IAAI,WAAW,EAAE,EAAE,IAAI,WAAW,EAAE,CAAC;;AAKrG,SAAS,EAAe,GAAG,GAAG,GAAO;CACjC,IAAI,IAAQ,EAAE;AACd,KAAI,EAAE,WAAW,EACb,QAAO;AAEX,QAAO,MAAU,GACb,KAAI,CAAC,EAAM,OAAO,EAAE,IAAQ,EAAE,IAAQ,GAAO,GAAO,GAAG,GAAG,EAAM,CAC5D,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAkB,GAAG,GAAG;AAC7B,QAAQ,EAAE,eAAe,EAAE,cACpB,EAAoB,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,IAAI,WAAW,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,CAAC;;AAK1I,SAAS,EAAc,GAAG,GAAG;AACzB,QAAO,EAAmB,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC;;AAKvD,SAAS,EAAe,GAAG,GAAG;AAC1B,QAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,EAAE;;AAKhG,SAAS,EAAkB,GAAG,GAAG;AAC7B,QAAO,MAAM;;AAKjB,SAAS,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAM,IAAO,EAAE;AACf,KAAI,MAAS,EAAE,KACX,QAAO;AAEX,KAAI,CAAC,EACD,QAAO;CAEX,IAAM,IAAqB,MAAM,EAAK,EAChC,IAAY,EAAE,SAAS,EACzB,GACA,GACA,IAAQ;AAEZ,SAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;EAIjC,IAAM,IAAY,EAAE,SAAS,EACzB,IAAW,IACX,IAAa;AAEjB,UAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;AAIjC,OAAI,EAAe,IAAa;AAC5B;AACA;;GAEJ,IAAM,IAAS,EAAQ,OACjB,IAAS,EAAQ;AACvB,OAAI,EAAM,OAAO,EAAO,IAAI,EAAO,IAAI,GAAO,GAAY,GAAG,GAAG,EAAM,IAC/D,EAAM,OAAO,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,EAAO,IAAI,GAAG,GAAG,EAAM,EAAE;AAC1E,QAAW,EAAe,KAAc;AACxC;;AAEJ;;AAEJ,MAAI,CAAC,EACD,QAAO;AAEX;;AAEJ,QAAO;;AAKX,IAAM,IAAkB;AAIxB,SAAS,EAAgB,GAAG,GAAG,GAAO;CAClC,IAAM,IAAa,EAAK,EAAE,EACtB,IAAQ,EAAW;AACvB,KAAI,EAAK,EAAE,CAAC,WAAW,EACnB,QAAO;AAMX,QAAO,MAAU,GACb,KAAI,CAAC,EAAgB,GAAG,GAAG,GAAO,EAAW,GAAO,CAChD,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAsB,GAAG,GAAG,GAAO;CACxC,IAAM,IAAa,EAAoB,EAAE,EACrC,IAAQ,EAAW;AACvB,KAAI,EAAoB,EAAE,CAAC,WAAW,EAClC,QAAO;CAEX,IAAI,GACA,GACA;AAKJ,QAAO,MAAU,GAOb,KANA,IAAW,EAAW,IAClB,CAAC,EAAgB,GAAG,GAAG,GAAO,EAAS,KAG3C,IAAc,EAAyB,GAAG,EAAS,EACnD,IAAc,EAAyB,GAAG,EAAS,GAC9C,KAAe,OACZ,CAAC,KACE,CAAC,KACD,EAAY,iBAAiB,EAAY,gBACzC,EAAY,eAAe,EAAY,cACvC,EAAY,aAAa,EAAY,WAC5C,QAAO;AAGf,QAAO;;AAKX,SAAS,EAA0B,GAAG,GAAG;AACrC,QAAO,EAAmB,EAAE,SAAS,EAAE,EAAE,SAAS,CAAC;;AAKvD,SAAS,EAAgB,GAAG,GAAG;AAC3B,QAAO,EAAE,WAAW,EAAE,UAAU,EAAE,UAAU,EAAE;;AAKlD,SAAS,EAAa,GAAG,GAAG,GAAO;CAC/B,IAAM,IAAO,EAAE;AACf,KAAI,MAAS,EAAE,KACX,QAAO;AAEX,KAAI,CAAC,EACD,QAAO;CAEX,IAAM,IAAqB,MAAM,EAAK,EAChC,IAAY,EAAE,QAAQ,EACxB,GACA;AAEJ,SAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;EAIjC,IAAM,IAAY,EAAE,QAAQ,EACxB,IAAW,IACX,IAAa;AAEjB,UAAQ,IAAU,EAAU,MAAM,KAC1B,GAAQ,OADqB;AAIjC,OAAI,CAAC,EAAe,MACb,EAAM,OAAO,EAAQ,OAAO,EAAQ,OAAO,EAAQ,OAAO,EAAQ,OAAO,GAAG,GAAG,EAAM,EAAE;AAC1F,QAAW,EAAe,KAAc;AACxC;;AAEJ;;AAEJ,MAAI,CAAC,EACD,QAAO;;AAGf,QAAO;;AAKX,SAAS,EAAoB,GAAG,GAAG;CAC/B,IAAI,IAAQ,EAAE;AACd,KAAI,EAAE,eAAe,KAAS,EAAE,eAAe,EAAE,WAC7C,QAAO;AAEX,QAAO,MAAU,GACb,KAAI,EAAE,OAAW,EAAE,GACf,QAAO;AAGf,QAAO;;AAKX,SAAS,EAAa,GAAG,GAAG;AACxB,QAAQ,EAAE,aAAa,EAAE,YAClB,EAAE,aAAa,EAAE,YACjB,EAAE,aAAa,EAAE,YACjB,EAAE,SAAS,EAAE,QACb,EAAE,SAAS,EAAE,QACb,EAAE,aAAa,EAAE,YACjB,EAAE,aAAa,EAAE;;AAE5B,SAAS,EAAgB,GAAG,GAAG,GAAO,GAAU;AAK5C,SAJK,MAAa,KAAe,MAAa,KAAgB,MAAa,OACnE,EAAE,YAAY,EAAE,YACb,KAEJ,EAAO,GAAG,EAAS,IAAI,EAAM,OAAO,EAAE,IAAW,EAAE,IAAW,GAAU,GAAU,GAAG,GAAG,EAAM;;AAGzG,IAAM,IAAmB,wBACnB,IAAgB,sBAChB,IAAc,oBACd,IAAgB,qBAChB,IAAW,iBACX,IAAY,kBACZ,IAAU,gBACV,IAAa,mBACb,IAAa,mBACb,IAAc,mBACd,IAAU,gBACV,IAAa,mBACb,IAAmB;CACrB,sBAAsB;CACtB,uBAAuB;CACvB,8BAA8B;CAC9B,uBAAuB;CACvB,wBAAwB;CACxB,uBAAuB;CACvB,wBAAwB;CACxB,yBAAyB;CACzB,yBAAyB;CACzB,yBAAyB;CACzB,0BAA0B;CAC1B,2BAA2B;CAC9B,EACK,IAAU,gBAEV,IAAW,OAAO,UAAU;AAIlC,SAAS,EAAyB,EAAE,yBAAsB,mBAAgB,sBAAmB,kBAAe,mBAAgB,sBAAmB,iBAAc,oBAAiB,oBAAiB,8BAA2B,oBAAiB,iBAAc,wBAAqB,iBAAc,4BAA0B;AAIlT,QAAO,SAAoB,GAAG,GAAG,GAAO;AAEpC,MAAI,MAAM,EACN,QAAO;AAIX,MAAI,KAAK,QAAQ,KAAK,KAClB,QAAO;EAEX,IAAM,IAAO,OAAO;AACpB,MAAI,MAAS,OAAO,EAChB,QAAO;AAEX,MAAI,MAAS,SAQT,QAPI,MAAS,WACF,EAAgB,GAAG,GAAG,EAAM,GAEnC,MAAS,aACF,EAAkB,GAAG,GAAG,EAAM,GAGlC;EAEX,IAAM,IAAc,EAAE;AAWtB,MAAI,MAAgB,EAAE,YAClB,QAAO;AAKX,MAAI,MAAgB,OAChB,QAAO,EAAgB,GAAG,GAAG,EAAM;AAIvC,MAAI,MAAM,QAAQ,EAAE,CAChB,QAAO,EAAe,GAAG,GAAG,EAAM;AAOtC,MAAI,MAAgB,KAChB,QAAO,EAAc,GAAG,GAAG,EAAM;AAErC,MAAI,MAAgB,OAChB,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,MAAgB,IAChB,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAgB,IAChB,QAAO,EAAa,GAAG,GAAG,EAAM;EAIpC,IAAM,IAAM,EAAS,KAAK,EAAE;AAC5B,MAAI,MAAQ,EACR,QAAO,EAAc,GAAG,GAAG,EAAM;AAIrC,MAAI,MAAQ,EACR,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAEpC,MAAI,MAAQ,EAIR,QAAO,OAAO,EAAE,QAAS,cAAc,OAAO,EAAE,QAAS,cAAc,EAAgB,GAAG,GAAG,EAAM;AAIvG,MAAI,MAAQ,EACR,QAAO,EAAa,GAAG,GAAG,EAAM;AAIpC,MAAI,MAAQ,EACR,QAAO,EAAe,GAAG,GAAG,EAAM;AAGtC,MAAI,MAAQ,EACR,QAAO,EAAgB,GAAG,GAAG,EAAM;AAEvC,MAAI,EAAiB,GACjB,QAAO,EAAoB,GAAG,GAAG,EAAM;AAE3C,MAAI,MAAQ,EACR,QAAO,EAAqB,GAAG,GAAG,EAAM;AAE5C,MAAI,MAAQ,EACR,QAAO,EAAkB,GAAG,GAAG,EAAM;AAKzC,MAAI,MAAQ,KAAe,MAAQ,KAAc,MAAQ,EACrD,QAAO,EAA0B,GAAG,GAAG,EAAM;AAEjD,MAAI,GAAuB;GACvB,IAAI,IAAuB,EAAsB;AACjD,OAAI,CAAC,GAAsB;IACvB,IAAM,IAAW,EAAY,EAAE;AAC/B,IAAI,MACA,IAAuB,EAAsB;;AAKrD,OAAI,EACA,QAAO,EAAqB,GAAG,GAAG,EAAM;;AAchD,SAAO;;;AAMf,SAAS,EAA+B,EAAE,aAAU,uBAAoB,aAAW;CAC/E,IAAI,IAAS;EACT;EACA,gBAAgB,IAAS,IAAwB;EACjD;EACe;EACC;EACG;EACnB,cAAc,IAAS,EAAmB,GAAc,EAAsB,GAAG;EAChE;EACjB,iBAAiB,IAAS,IAAwB;EACvB;EACV;EACjB,cAAc,IAAS,EAAmB,GAAc,EAAsB,GAAG;EACjF,qBAAqB,IACf,EAAmB,GAAqB,EAAsB,GAC9D;EACQ;EACd,uBAAuB,KAAA;EAC1B;AAID,KAHI,MACA,IAAS,OAAO,OAAO,EAAE,EAAE,GAAQ,EAAmB,EAAO,CAAC,GAE9D,GAAU;EACV,IAAM,IAAiB,EAAiB,EAAO,eAAe,EACxD,IAAe,EAAiB,EAAO,aAAa,EACpD,IAAkB,EAAiB,EAAO,gBAAgB,EAC1D,IAAe,EAAiB,EAAO,aAAa;AAC1D,MAAS,OAAO,OAAO,EAAE,EAAE,GAAQ;GAC/B;GACA;GACA;GACA;GACH,CAAC;;AAEN,QAAO;;AAMX,SAAS,EAAiC,GAAS;AAC/C,QAAO,SAAU,GAAG,GAAG,GAAc,GAAc,GAAU,GAAU,GAAO;AAC1E,SAAO,EAAQ,GAAG,GAAG,EAAM;;;AAMnC,SAAS,EAAc,EAAE,aAAU,eAAY,gBAAa,WAAQ,aAAU;AAC1E,KAAI,EACA,QAAO,SAAiB,GAAG,GAAG;EAC1B,IAAM,EAAE,WAAQ,oBAAW,IAAI,SAAS,GAAG,KAAA,GAAW,YAAS,GAAa;AAC5E,SAAO,EAAW,GAAG,GAAG;GACpB;GACA;GACA;GACA;GACH,CAAC;;AAGV,KAAI,EACA,QAAO,SAAiB,GAAG,GAAG;AAC1B,SAAO,EAAW,GAAG,GAAG;GACpB,uBAAO,IAAI,SAAS;GACpB;GACA,MAAM,KAAA;GACN;GACH,CAAC;;CAGV,IAAM,IAAQ;EACV,OAAO,KAAA;EACP;EACA,MAAM,KAAA;EACN;EACH;AACD,QAAO,SAAiB,GAAG,GAAG;AAC1B,SAAO,EAAW,GAAG,GAAG,EAAM;;;AAOtC,IAAM,IAAY,GAAmB;AAIb,EAAkB,EAAE,QAAQ,IAAM,CAAC,EAIjC,EAAkB,EAAE,UAAU,IAAM,CAAC,EAK/B,EAAkB;CAC9C,UAAU;CACV,QAAQ;CACX,CAAC,EAImB,EAAkB,EACnC,gCAAgC,GACnC,CAAC,EAIyB,EAAkB;CACzC,QAAQ;CACR,gCAAgC;CACnC,CAAC,EAI2B,EAAkB;CAC3C,UAAU;CACV,gCAAgC;CACnC,CAAC,EAKiC,EAAkB;CACjD,UAAU;CACV,gCAAgC;CAChC,QAAQ;CACX,CAAC;AASF,SAAS,EAAkB,IAAU,EAAE,EAAE;CACrC,IAAM,EAAE,cAAW,IAAO,0BAA0B,GAAgC,gBAAa,YAAS,OAAW,GAE/G,IAAa,EADJ,EAA+B,EAAQ,CACH;AAInD,QAAO,EAAc;EAAE;EAAU;EAAY;EAAa,QAH3C,IACT,EAA+B,EAAW,GAC1C,EAAiC,EAAW;EACgB;EAAQ,CAAC"}

package/dist/node_modules/fflate/esm/browser.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"browser.js","names":[],"sources":["../../../../node_modules/fflate/esm/browser.js"],"sourcesContent":["// DEFLATE is a complex format; to read this code, you should probably check the RFC first:\n// https://tools.ietf.org/html/rfc1951\n// You may also wish to take a look at the guide I made about this program:\n// https://gist.github.com/101arrowz/253f31eb5abc3d9275ab943003ffecad\n// Some of the following code is similar to that of UZIP.js:\n// https://github.com/photopea/UZIP.js\n// However, the vast majority of the codebase has diverged from UZIP.js to increase performance and reduce bundle size.\n// Sometimes 0 will appear where -1 would be more appropriate. This is because using a uint\n// is better for memory in most engines (I *think*).\nvar ch2 = {};\nvar wk = (function (c, id, msg, transfer, cb) {\n var w = new Worker(ch2[id] || (ch2[id] = URL.createObjectURL(new Blob([\n c + ';addEventListener(\"error\",function(e){e=e.error;postMessage({$e$:[e.message,e.code,e.stack]})})'\n ], { type: 'text/javascript' }))));\n w.onmessage = function (e) {\n var d = e.data, ed = d.$e$;\n if (ed) {\n var err = new Error(ed[0]);\n err['code'] = ed[1];\n err.stack = ed[2];\n cb(err, null);\n }\n else\n cb(null, d);\n };\n w.postMessage(msg, transfer);\n return w;\n});\n\n// aliases for shorter compressed code (most minifers don't do this)\nvar u8 = Uint8Array, u16 = Uint16Array, i32 = Int32Array;\n// fixed length extra bits\nvar fleb = new u8([0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, /* unused */ 0, 0, /* impossible */ 0]);\n// fixed distance extra bits\nvar fdeb = new u8([0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, /* unused */ 0, 0]);\n// code length index map\nvar clim = new u8([16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15]);\n// get base, reverse index map from extra bits\nvar freb = function (eb, start) {\n var b = new u16(31);\n for (var i = 0; i < 31; ++i) {\n b[i] = start += 1 << eb[i - 1];\n }\n // numbers here are at max 18 bits\n var r = new i32(b[30]);\n for (var i = 1; i < 30; ++i) {\n for (var j = b[i]; j < b[i + 1]; ++j) {\n r[j] = ((j - b[i]) << 5) | i;\n }\n }\n return { b: b, r: r };\n};\nvar _a = freb(fleb, 2), fl = _a.b, revfl = _a.r;\n// we can ignore the fact that the other numbers are wrong; they never happen anyway\nfl[28] = 258, revfl[258] = 28;\nvar _b = freb(fdeb, 0), fd = _b.b, revfd = _b.r;\n// map of value to reverse (assuming 16 bits)\nvar rev = new u16(32768);\nfor (var i = 0; i < 32768; ++i) {\n // reverse table algorithm from SO\n var x = ((i & 0xAAAA) >> 1) | ((i & 0x5555) << 1);\n x = ((x & 0xCCCC) >> 2) | ((x & 0x3333) << 2);\n x = ((x & 0xF0F0) >> 4) | ((x & 0x0F0F) << 4);\n rev[i] = (((x & 0xFF00) >> 8) | ((x & 0x00FF) << 8)) >> 1;\n}\n// create huffman tree from u8 \"map\": index -> code length for code index\n// mb (max bits) must be at most 15\n// TODO: optimize/split up?\nvar hMap = (function (cd, mb, r) {\n var s = cd.length;\n // index\n var i = 0;\n // u16 \"map\": index -> # of codes with bit length = index\n var l = new u16(mb);\n // length of cd must be 288 (total # of codes)\n for (; i < s; ++i) {\n if (cd[i])\n ++l[cd[i] - 1];\n }\n // u16 \"map\": index -> minimum code for bit length = index\n var le = new u16(mb);\n for (i = 1; i < mb; ++i) {\n le[i] = (le[i - 1] + l[i - 1]) << 1;\n }\n var co;\n if (r) {\n // u16 \"map\": index -> number of actual bits, symbol for code\n co = new u16(1 << mb);\n // bits to remove for reverser\n var rvb = 15 - mb;\n for (i = 0; i < s; ++i) {\n // ignore 0 lengths\n if (cd[i]) {\n // num encoding both symbol and bits read\n var sv = (i << 4) | cd[i];\n // free bits\n var r_1 = mb - cd[i];\n // start value\n var v = le[cd[i] - 1]++ << r_1;\n // m is end value\n for (var m = v | ((1 << r_1) - 1); v <= m; ++v) {\n // every 16 bit value starting with the code yields the same result\n co[rev[v] >> rvb] = sv;\n }\n }\n }\n }\n else {\n co = new u16(s);\n for (i = 0; i < s; ++i) {\n if (cd[i]) {\n co[i] = rev[le[cd[i] - 1]++] >> (15 - cd[i]);\n }\n }\n }\n return co;\n});\n// fixed length tree\nvar flt = new u8(288);\nfor (var i = 0; i < 144; ++i)\n flt[i] = 8;\nfor (var i = 144; i < 256; ++i)\n flt[i] = 9;\nfor (var i = 256; i < 280; ++i)\n flt[i] = 7;\nfor (var i = 280; i < 288; ++i)\n flt[i] = 8;\n// fixed distance tree\nvar fdt = new u8(32);\nfor (var i = 0; i < 32; ++i)\n fdt[i] = 5;\n// fixed length map\nvar flm = /*#__PURE__*/ hMap(flt, 9, 0), flrm = /*#__PURE__*/ hMap(flt, 9, 1);\n// fixed distance map\nvar fdm = /*#__PURE__*/ hMap(fdt, 5, 0), fdrm = /*#__PURE__*/ hMap(fdt, 5, 1);\n// find max of array\nvar max = function (a) {\n var m = a[0];\n for (var i = 1; i < a.length; ++i) {\n if (a[i] > m)\n m = a[i];\n }\n return m;\n};\n// read d, starting at bit p and mask with m\nvar bits = function (d, p, m) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8)) >> (p & 7)) & m;\n};\n// read d, starting at bit p continuing for at least 16 bits\nvar bits16 = function (d, p) {\n var o = (p / 8) | 0;\n return ((d[o] | (d[o + 1] << 8) | (d[o + 2] << 16)) >> (p & 7));\n};\n// get end of byte\nvar shft = function (p) { return ((p + 7) / 8) | 0; };\n// typed array slice - allows garbage collector to free original reference,\n// while being more compatible than .slice\nvar slc = function (v, s, e) {\n if (s == null || s < 0)\n s = 0;\n if (e == null || e > v.length)\n e = v.length;\n // can't use .constructor in case user-supplied\n return new u8(v.subarray(s, e));\n};\n/**\n * Codes for errors generated within this library\n */\nexport var FlateErrorCode = {\n UnexpectedEOF: 0,\n InvalidBlockType: 1,\n InvalidLengthLiteral: 2,\n InvalidDistance: 3,\n StreamFinished: 4,\n NoStreamHandler: 5,\n InvalidHeader: 6,\n NoCallback: 7,\n InvalidUTF8: 8,\n ExtraFieldTooLong: 9,\n InvalidDate: 10,\n FilenameTooLong: 11,\n StreamFinishing: 12,\n InvalidZipData: 13,\n UnknownCompressionMethod: 14\n};\n// error codes\nvar ec = [\n 'unexpected EOF',\n 'invalid block type',\n 'invalid length/literal',\n 'invalid distance',\n 'stream finished',\n 'no stream handler',\n , // determined by compression function\n 'no callback',\n 'invalid UTF-8 data',\n 'extra field too long',\n 'date not in range 1980-2099',\n 'filename too long',\n 'stream finishing',\n 'invalid zip data'\n // determined by unknown compression method\n];\n;\nvar err = function (ind, msg, nt) {\n var e = new Error(msg || ec[ind]);\n e.code = ind;\n if (Error.captureStackTrace)\n Error.captureStackTrace(e, err);\n if (!nt)\n throw e;\n return e;\n};\n// expands raw DEFLATE data\nvar inflt = function (dat, st, buf, dict) {\n // source length dict length\n var sl = dat.length, dl = dict ? dict.length : 0;\n if (!sl || st.f && !st.l)\n return buf || new u8(0);\n var noBuf = !buf;\n // have to estimate size\n var resize = noBuf || st.i != 2;\n // no state\n var noSt = st.i;\n // Assumes roughly 33% compression ratio average\n if (noBuf)\n buf = new u8(sl * 3);\n // ensure buffer can fit at least l elements\n var cbuf = function (l) {\n var bl = buf.length;\n // need to increase size to fit\n if (l > bl) {\n // Double or set to necessary, whichever is greater\n var nbuf = new u8(Math.max(bl * 2, l));\n nbuf.set(buf);\n buf = nbuf;\n }\n };\n // last chunk bitpos bytes\n var final = st.f || 0, pos = st.p || 0, bt = st.b || 0, lm = st.l, dm = st.d, lbt = st.m, dbt = st.n;\n // total bits\n var tbts = sl * 8;\n do {\n if (!lm) {\n // BFINAL - this is only 1 when last chunk is next\n final = bits(dat, pos, 1);\n // type: 0 = no compression, 1 = fixed huffman, 2 = dynamic huffman\n var type = bits(dat, pos + 1, 3);\n pos += 3;\n if (!type) {\n // go to end of byte boundary\n var s = shft(pos) + 4, l = dat[s - 4] | (dat[s - 3] << 8), t = s + l;\n if (t > sl) {\n if (noSt)\n err(0);\n break;\n }\n // ensure size\n if (resize)\n cbuf(bt + l);\n // Copy over uncompressed data\n buf.set(dat.subarray(s, t), bt);\n // Get new bitpos, update byte count\n st.b = bt += l, st.p = pos = t * 8, st.f = final;\n continue;\n }\n else if (type == 1)\n lm = flrm, dm = fdrm, lbt = 9, dbt = 5;\n else if (type == 2) {\n // literal lengths\n var hLit = bits(dat, pos, 31) + 257, hcLen = bits(dat, pos + 10, 15) + 4;\n var tl = hLit + bits(dat, pos + 5, 31) + 1;\n pos += 14;\n // length+distance tree\n var ldt = new u8(tl);\n // code length tree\n var clt = new u8(19);\n for (var i = 0; i < hcLen; ++i) {\n // use index map to get real code\n clt[clim[i]] = bits(dat, pos + i * 3, 7);\n }\n pos += hcLen * 3;\n // code lengths bits\n var clb = max(clt), clbmsk = (1 << clb) - 1;\n // code lengths map\n var clm = hMap(clt, clb, 1);\n for (var i = 0; i < tl;) {\n var r = clm[bits(dat, pos, clbmsk)];\n // bits read\n pos += r & 15;\n // symbol\n var s = r >> 4;\n // code length to copy\n if (s < 16) {\n ldt[i++] = s;\n }\n else {\n // copy count\n var c = 0, n = 0;\n if (s == 16)\n n = 3 + bits(dat, pos, 3), pos += 2, c = ldt[i - 1];\n else if (s == 17)\n n = 3 + bits(dat, pos, 7), pos += 3;\n else if (s == 18)\n n = 11 + bits(dat, pos, 127), pos += 7;\n while (n--)\n ldt[i++] = c;\n }\n }\n // length tree distance tree\n var lt = ldt.subarray(0, hLit), dt = ldt.subarray(hLit);\n // max length bits\n lbt = max(lt);\n // max dist bits\n dbt = max(dt);\n lm = hMap(lt, lbt, 1);\n dm = hMap(dt, dbt, 1);\n }\n else\n err(1);\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n }\n // Make sure the buffer can hold this + the largest possible addition\n // Maximum chunk size (practically, theoretically infinite) is 2^17\n if (resize)\n cbuf(bt + 131072);\n var lms = (1 << lbt) - 1, dms = (1 << dbt) - 1;\n var lpos = pos;\n for (;; lpos = pos) {\n // bits read, code\n var c = lm[bits16(dat, pos) & lms], sym = c >> 4;\n pos += c & 15;\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n if (!c)\n err(2);\n if (sym < 256)\n buf[bt++] = sym;\n else if (sym == 256) {\n lpos = pos, lm = null;\n break;\n }\n else {\n var add = sym - 254;\n // no extra bits needed if less\n if (sym > 264) {\n // index\n var i = sym - 257, b = fleb[i];\n add = bits(dat, pos, (1 << b) - 1) + fl[i];\n pos += b;\n }\n // dist\n var d = dm[bits16(dat, pos) & dms], dsym = d >> 4;\n if (!d)\n err(3);\n pos += d & 15;\n var dt = fd[dsym];\n if (dsym > 3) {\n var b = fdeb[dsym];\n dt += bits16(dat, pos) & (1 << b) - 1, pos += b;\n }\n if (pos > tbts) {\n if (noSt)\n err(0);\n break;\n }\n if (resize)\n cbuf(bt + 131072);\n var end = bt + add;\n if (bt < dt) {\n var shift = dl - dt, dend = Math.min(dt, end);\n if (shift + bt < 0)\n err(3);\n for (; bt < dend; ++bt)\n buf[bt] = dict[shift + bt];\n }\n for (; bt < end; ++bt)\n buf[bt] = buf[bt - dt];\n }\n }\n st.l = lm, st.p = lpos, st.b = bt, st.f = final;\n if (lm)\n final = 1, st.m = lbt, st.d = dm, st.n = dbt;\n } while (!final);\n // don't reallocate for streams or user buffers\n return bt != buf.length && noBuf ? slc(buf, 0, bt) : buf.subarray(0, bt);\n};\n// starting at p, write the minimum number of bits that can hold v to d\nvar wbits = function (d, p, v) {\n v <<= p & 7;\n var o = (p / 8) | 0;\n d[o] |= v;\n d[o + 1] |= v >> 8;\n};\n// starting at p, write the minimum number of bits (>8) that can hold v to d\nvar wbits16 = function (d, p, v) {\n v <<= p & 7;\n var o = (p / 8) | 0;\n d[o] |= v;\n d[o + 1] |= v >> 8;\n d[o + 2] |= v >> 16;\n};\n// creates code lengths from a frequency table\nvar hTree = function (d, mb) {\n // Need extra info to make a tree\n var t = [];\n for (var i = 0; i < d.length; ++i) {\n if (d[i])\n t.push({ s: i, f: d[i] });\n }\n var s = t.length;\n var t2 = t.slice();\n if (!s)\n return { t: et, l: 0 };\n if (s == 1) {\n var v = new u8(t[0].s + 1);\n v[t[0].s] = 1;\n return { t: v, l: 1 };\n }\n t.sort(function (a, b) { return a.f - b.f; });\n // after i2 reaches last ind, will be stopped\n // freq must be greater than largest possible number of symbols\n t.push({ s: -1, f: 25001 });\n var l = t[0], r = t[1], i0 = 0, i1 = 1, i2 = 2;\n t[0] = { s: -1, f: l.f + r.f, l: l, r: r };\n // efficient algorithm from UZIP.js\n // i0 is lookbehind, i2 is lookahead - after processing two low-freq\n // symbols that combined have high freq, will start processing i2 (high-freq,\n // non-composite) symbols instead\n // see https://reddit.com/r/photopea/comments/ikekht/uzipjs_questions/\n while (i1 != s - 1) {\n l = t[t[i0].f < t[i2].f ? i0++ : i2++];\n r = t[i0 != i1 && t[i0].f < t[i2].f ? i0++ : i2++];\n t[i1++] = { s: -1, f: l.f + r.f, l: l, r: r };\n }\n var maxSym = t2[0].s;\n for (var i = 1; i < s; ++i) {\n if (t2[i].s > maxSym)\n maxSym = t2[i].s;\n }\n // code lengths\n var tr = new u16(maxSym + 1);\n // max bits in tree\n var mbt = ln(t[i1 - 1], tr, 0);\n if (mbt > mb) {\n // more algorithms from UZIP.js\n // TODO: find out how this code works (debt)\n // ind debt\n var i = 0, dt = 0;\n // left cost\n var lft = mbt - mb, cst = 1 << lft;\n t2.sort(function (a, b) { return tr[b.s] - tr[a.s] || a.f - b.f; });\n for (; i < s; ++i) {\n var i2_1 = t2[i].s;\n if (tr[i2_1] > mb) {\n dt += cst - (1 << (mbt - tr[i2_1]));\n tr[i2_1] = mb;\n }\n else\n break;\n }\n dt >>= lft;\n while (dt > 0) {\n var i2_2 = t2[i].s;\n if (tr[i2_2] < mb)\n dt -= 1 << (mb - tr[i2_2]++ - 1);\n else\n ++i;\n }\n for (; i >= 0 && dt; --i) {\n var i2_3 = t2[i].s;\n if (tr[i2_3] == mb) {\n --tr[i2_3];\n ++dt;\n }\n }\n mbt = mb;\n }\n return { t: new u8(tr), l: mbt };\n};\n// get the max length and assign length codes\nvar ln = function (n, l, d) {\n return n.s == -1\n ? Math.max(ln(n.l, l, d + 1), ln(n.r, l, d + 1))\n : (l[n.s] = d);\n};\n// length codes generation\nvar lc = function (c) {\n var s = c.length;\n // Note that the semicolon was intentional\n while (s && !c[--s])\n ;\n var cl = new u16(++s);\n // ind num streak\n var cli = 0, cln = c[0], cls = 1;\n var w = function (v) { cl[cli++] = v; };\n for (var i = 1; i <= s; ++i) {\n if (c[i] == cln && i != s)\n ++cls;\n else {\n if (!cln && cls > 2) {\n for (; cls > 138; cls -= 138)\n w(32754);\n if (cls > 2) {\n w(cls > 10 ? ((cls - 11) << 5) | 28690 : ((cls - 3) << 5) | 12305);\n cls = 0;\n }\n }\n else if (cls > 3) {\n w(cln), --cls;\n for (; cls > 6; cls -= 6)\n w(8304);\n if (cls > 2)\n w(((cls - 3) << 5) | 8208), cls = 0;\n }\n while (cls--)\n w(cln);\n cls = 1;\n cln = c[i];\n }\n }\n return { c: cl.subarray(0, cli), n: s };\n};\n// calculate the length of output from tree, code lengths\nvar clen = function (cf, cl) {\n var l = 0;\n for (var i = 0; i < cl.length; ++i)\n l += cf[i] * cl[i];\n return l;\n};\n// writes a fixed block\n// returns the new bit pos\nvar wfblk = function (out, pos, dat) {\n // no need to write 00 as type: TypedArray defaults to 0\n var s = dat.length;\n var o = shft(pos + 2);\n out[o] = s & 255;\n out[o + 1] = s >> 8;\n out[o + 2] = out[o] ^ 255;\n out[o + 3] = out[o + 1] ^ 255;\n for (var i = 0; i < s; ++i)\n out[o + i + 4] = dat[i];\n return (o + 4 + s) * 8;\n};\n// writes a block\nvar wblk = function (dat, out, final, syms, lf, df, eb, li, bs, bl, p) {\n wbits(out, p++, final);\n ++lf[256];\n var _a = hTree(lf, 15), dlt = _a.t, mlb = _a.l;\n var _b = hTree(df, 15), ddt = _b.t, mdb = _b.l;\n var _c = lc(dlt), lclt = _c.c, nlc = _c.n;\n var _d = lc(ddt), lcdt = _d.c, ndc = _d.n;\n var lcfreq = new u16(19);\n for (var i = 0; i < lclt.length; ++i)\n ++lcfreq[lclt[i] & 31];\n for (var i = 0; i < lcdt.length; ++i)\n ++lcfreq[lcdt[i] & 31];\n var _e = hTree(lcfreq, 7), lct = _e.t, mlcb = _e.l;\n var nlcc = 19;\n for (; nlcc > 4 && !lct[clim[nlcc - 1]]; --nlcc)\n ;\n var flen = (bl + 5) << 3;\n var ftlen = clen(lf, flt) + clen(df, fdt) + eb;\n var dtlen = clen(lf, dlt) + clen(df, ddt) + eb + 14 + 3 * nlcc + clen(lcfreq, lct) + 2 * lcfreq[16] + 3 * lcfreq[17] + 7 * lcfreq[18];\n if (bs >= 0 && flen <= ftlen && flen <= dtlen)\n return wfblk(out, p, dat.subarray(bs, bs + bl));\n var lm, ll, dm, dl;\n wbits(out, p, 1 + (dtlen < ftlen)), p += 2;\n if (dtlen < ftlen) {\n lm = hMap(dlt, mlb, 0), ll = dlt, dm = hMap(ddt, mdb, 0), dl = ddt;\n var llm = hMap(lct, mlcb, 0);\n wbits(out, p, nlc - 257);\n wbits(out, p + 5, ndc - 1);\n wbits(out, p + 10, nlcc - 4);\n p += 14;\n for (var i = 0; i < nlcc; ++i)\n wbits(out, p + 3 * i, lct[clim[i]]);\n p += 3 * nlcc;\n var lcts = [lclt, lcdt];\n for (var it = 0; it < 2; ++it) {\n var clct = lcts[it];\n for (var i = 0; i < clct.length; ++i) {\n var len = clct[i] & 31;\n wbits(out, p, llm[len]), p += lct[len];\n if (len > 15)\n wbits(out, p, (clct[i] >> 5) & 127), p += clct[i] >> 12;\n }\n }\n }\n else {\n lm = flm, ll = flt, dm = fdm, dl = fdt;\n }\n for (var i = 0; i < li; ++i) {\n var sym = syms[i];\n if (sym > 255) {\n var len = (sym >> 18) & 31;\n wbits16(out, p, lm[len + 257]), p += ll[len + 257];\n if (len > 7)\n wbits(out, p, (sym >> 23) & 31), p += fleb[len];\n var dst = sym & 31;\n wbits16(out, p, dm[dst]), p += dl[dst];\n if (dst > 3)\n wbits16(out, p, (sym >> 5) & 8191), p += fdeb[dst];\n }\n else {\n wbits16(out, p, lm[sym]), p += ll[sym];\n }\n }\n wbits16(out, p, lm[256]);\n return p + ll[256];\n};\n// deflate options (nice << 13) | chain\nvar deo = /*#__PURE__*/ new i32([65540, 131080, 131088, 131104, 262176, 1048704, 1048832, 2114560, 2117632]);\n// empty\nvar et = /*#__PURE__*/ new u8(0);\n// compresses data into a raw DEFLATE buffer\nvar dflt = function (dat, lvl, plvl, pre, post, st) {\n var s = st.z || dat.length;\n var o = new u8(pre + s + 5 * (1 + Math.ceil(s / 7000)) + post);\n // writing to this writes to the output buffer\n var w = o.subarray(pre, o.length - post);\n var lst = st.l;\n var pos = (st.r || 0) & 7;\n if (lvl) {\n if (pos)\n w[0] = st.r >> 3;\n var opt = deo[lvl - 1];\n var n = opt >> 13, c = opt & 8191;\n var msk_1 = (1 << plvl) - 1;\n // prev 2-byte val map curr 2-byte val map\n var prev = st.p || new u16(32768), head = st.h || new u16(msk_1 + 1);\n var bs1_1 = Math.ceil(plvl / 3), bs2_1 = 2 * bs1_1;\n var hsh = function (i) { return (dat[i] ^ (dat[i + 1] << bs1_1) ^ (dat[i + 2] << bs2_1)) & msk_1; };\n // 24576 is an arbitrary number of maximum symbols per block\n // 424 buffer for last block\n var syms = new i32(25000);\n // length/literal freq distance freq\n var lf = new u16(288), df = new u16(32);\n // l/lcnt exbits index l/lind waitdx blkpos\n var lc_1 = 0, eb = 0, i = st.i || 0, li = 0, wi = st.w || 0, bs = 0;\n for (; i + 2 < s; ++i) {\n // hash value\n var hv = hsh(i);\n // index mod 32768 previous index mod\n var imod = i & 32767, pimod = head[hv];\n prev[imod] = pimod;\n head[hv] = imod;\n // We always should modify head and prev, but only add symbols if\n // this data is not yet processed (\"wait\" for wait index)\n if (wi <= i) {\n // bytes remaining\n var rem = s - i;\n if ((lc_1 > 7000 || li > 24576) && (rem > 423 || !lst)) {\n pos = wblk(dat, w, 0, syms, lf, df, eb, li, bs, i - bs, pos);\n li = lc_1 = eb = 0, bs = i;\n for (var j = 0; j < 286; ++j)\n lf[j] = 0;\n for (var j = 0; j < 30; ++j)\n df[j] = 0;\n }\n // len dist chain\n var l = 2, d = 0, ch_1 = c, dif = imod - pimod & 32767;\n if (rem > 2 && hv == hsh(i - dif)) {\n var maxn = Math.min(n, rem) - 1;\n var maxd = Math.min(32767, i);\n // max possible length\n // not capped at dif because decompressors implement \"rolling\" index population\n var ml = Math.min(258, rem);\n while (dif <= maxd && --ch_1 && imod != pimod) {\n if (dat[i + l] == dat[i + l - dif]) {\n var nl = 0;\n for (; nl < ml && dat[i + nl] == dat[i + nl - dif]; ++nl)\n ;\n if (nl > l) {\n l = nl, d = dif;\n // break out early when we reach \"nice\" (we are satisfied enough)\n if (nl > maxn)\n break;\n // now, find the rarest 2-byte sequence within this\n // length of literals and search for that instead.\n // Much faster than just using the start\n var mmd = Math.min(dif, nl - 2);\n var md = 0;\n for (var j = 0; j < mmd; ++j) {\n var ti = i - dif + j & 32767;\n var pti = prev[ti];\n var cd = ti - pti & 32767;\n if (cd > md)\n md = cd, pimod = ti;\n }\n }\n }\n // check the previous match\n imod = pimod, pimod = prev[imod];\n dif += imod - pimod & 32767;\n }\n }\n // d will be nonzero only when a match was found\n if (d) {\n // store both dist and len data in one int32\n // Make sure this is recognized as a len/dist with 28th bit (2^28)\n syms[li++] = 268435456 | (revfl[l] << 18) | revfd[d];\n var lin = revfl[l] & 31, din = revfd[d] & 31;\n eb += fleb[lin] + fdeb[din];\n ++lf[257 + lin];\n ++df[din];\n wi = i + l;\n ++lc_1;\n }\n else {\n syms[li++] = dat[i];\n ++lf[dat[i]];\n }\n }\n }\n for (i = Math.max(i, wi); i < s; ++i) {\n syms[li++] = dat[i];\n ++lf[dat[i]];\n }\n pos = wblk(dat, w, lst, syms, lf, df, eb, li, bs, i - bs, pos);\n if (!lst) {\n st.r = (pos & 7) | w[(pos / 8) | 0] << 3;\n // shft(pos) now 1 less if pos & 7 != 0\n pos -= 7;\n st.h = head, st.p = prev, st.i = i, st.w = wi;\n }\n }\n else {\n for (var i = st.w || 0; i < s + lst; i += 65535) {\n // end\n var e = i + 65535;\n if (e >= s) {\n // write final block\n w[(pos / 8) | 0] = lst;\n e = s;\n }\n pos = wfblk(w, pos + 1, dat.subarray(i, e));\n }\n st.i = s;\n }\n return slc(o, 0, pre + shft(pos) + post);\n};\n// CRC32 table\nvar crct = /*#__PURE__*/ (function () {\n var t = new Int32Array(256);\n for (var i = 0; i < 256; ++i) {\n var c = i, k = 9;\n while (--k)\n c = ((c & 1) && -306674912) ^ (c >>> 1);\n t[i] = c;\n }\n return t;\n})();\n// CRC32\nvar crc = function () {\n var c = -1;\n return {\n p: function (d) {\n // closures have awful performance\n var cr = c;\n for (var i = 0; i < d.length; ++i)\n cr = crct[(cr & 255) ^ d[i]] ^ (cr >>> 8);\n c = cr;\n },\n d: function () { return ~c; }\n };\n};\n// Adler32\nvar adler = function () {\n var a = 1, b = 0;\n return {\n p: function (d) {\n // closures have awful performance\n var n = a, m = b;\n var l = d.length | 0;\n for (var i = 0; i != l;) {\n var e = Math.min(i + 2655, l);\n for (; i < e; ++i)\n m += n += d[i];\n n = (n & 65535) + 15 * (n >> 16), m = (m & 65535) + 15 * (m >> 16);\n }\n a = n, b = m;\n },\n d: function () {\n a %= 65521, b %= 65521;\n return (a & 255) << 24 | (a & 0xFF00) << 8 | (b & 255) << 8 | (b >> 8);\n }\n };\n};\n;\n// deflate with opts\nvar dopt = function (dat, opt, pre, post, st) {\n if (!st) {\n st = { l: 1 };\n if (opt.dictionary) {\n var dict = opt.dictionary.subarray(-32768);\n var newDat = new u8(dict.length + dat.length);\n newDat.set(dict);\n newDat.set(dat, dict.length);\n dat = newDat;\n st.w = dict.length;\n }\n }\n return dflt(dat, opt.level == null ? 6 : opt.level, opt.mem == null ? (st.l ? Math.ceil(Math.max(8, Math.min(13, Math.log(dat.length))) * 1.5) : 20) : (12 + opt.mem), pre, post, st);\n};\n// Walmart object spread\nvar mrg = function (a, b) {\n var o = {};\n for (var k in a)\n o[k] = a[k];\n for (var k in b)\n o[k] = b[k];\n return o;\n};\n// worker clone\n// This is possibly the craziest part of the entire codebase, despite how simple it may seem.\n// The only parameter to this function is a closure that returns an array of variables outside of the function scope.\n// We're going to try to figure out the variable names used in the closure as strings because that is crucial for workerization.\n// We will return an object mapping of true variable name to value (basically, the current scope as a JS object).\n// The reason we can't just use the original variable names is minifiers mangling the toplevel scope.\n// This took me three weeks to figure out how to do.\nvar wcln = function (fn, fnStr, td) {\n var dt = fn();\n var st = fn.toString();\n var ks = st.slice(st.indexOf('[') + 1, st.lastIndexOf(']')).replace(/\\s+/g, '').split(',');\n for (var i = 0; i < dt.length; ++i) {\n var v = dt[i], k = ks[i];\n if (typeof v == 'function') {\n fnStr += ';' + k + '=';\n var st_1 = v.toString();\n if (v.prototype) {\n // for global objects\n if (st_1.indexOf('[native code]') != -1) {\n var spInd = st_1.indexOf(' ', 8) + 1;\n fnStr += st_1.slice(spInd, st_1.indexOf('(', spInd));\n }\n else {\n fnStr += st_1;\n for (var t in v.prototype)\n fnStr += ';' + k + '.prototype.' + t + '=' + v.prototype[t].toString();\n }\n }\n else\n fnStr += st_1;\n }\n else\n td[k] = v;\n }\n return fnStr;\n};\nvar ch = [];\n// clone bufs\nvar cbfs = function (v) {\n var tl = [];\n for (var k in v) {\n if (v[k].buffer) {\n tl.push((v[k] = new v[k].constructor(v[k])).buffer);\n }\n }\n return tl;\n};\n// use a worker to execute code\nvar wrkr = function (fns, init, id, cb) {\n if (!ch[id]) {\n var fnStr = '', td_1 = {}, m = fns.length - 1;\n for (var i = 0; i < m; ++i)\n fnStr = wcln(fns[i], fnStr, td_1);\n ch[id] = { c: wcln(fns[m], fnStr, td_1), e: td_1 };\n }\n var td = mrg({}, ch[id].e);\n return wk(ch[id].c + ';onmessage=function(e){for(var k in e.data)self[k]=e.data[k];onmessage=' + init.toString() + '}', id, td, cbfs(td), cb);\n};\n// base async inflate fn\nvar bInflt = function () { return [u8, u16, i32, fleb, fdeb, clim, fl, fd, flrm, fdrm, rev, ec, hMap, max, bits, bits16, shft, slc, err, inflt, inflateSync, pbf, gopt]; };\nvar bDflt = function () { return [u8, u16, i32, fleb, fdeb, clim, revfl, revfd, flm, flt, fdm, fdt, rev, deo, et, hMap, wbits, wbits16, hTree, ln, lc, clen, wfblk, wblk, shft, slc, dflt, dopt, deflateSync, pbf]; };\n// gzip extra\nvar gze = function () { return [gzh, gzhl, wbytes, crc, crct]; };\n// gunzip extra\nvar guze = function () { return [gzs, gzl]; };\n// zlib extra\nvar zle = function () { return [zlh, wbytes, adler]; };\n// unzlib extra\nvar zule = function () { return [zls]; };\n// post buf\nvar pbf = function (msg) { return postMessage(msg, [msg.buffer]); };\n// get opts\nvar gopt = function (o) { return o && {\n out: o.size && new u8(o.size),\n dictionary: o.dictionary\n}; };\n// async helper\nvar cbify = function (dat, opts, fns, init, id, cb) {\n var w = wrkr(fns, init, id, function (err, dat) {\n w.terminate();\n cb(err, dat);\n });\n w.postMessage([dat, opts], opts.consume ? [dat.buffer] : []);\n return function () { w.terminate(); };\n};\n// auto stream\nvar astrm = function (strm) {\n strm.ondata = function (dat, final) { return postMessage([dat, final], [dat.buffer]); };\n return function (ev) {\n if (ev.data[0]) {\n strm.push(ev.data[0], ev.data[1]);\n postMessage([ev.data[0].length]);\n }\n else\n strm.flush(ev.data[1]);\n };\n};\n// async stream attach\nvar astrmify = function (fns, strm, opts, init, id, flush, ext) {\n var t;\n var w = wrkr(fns, init, id, function (err, dat) {\n if (err)\n w.terminate(), strm.ondata.call(strm, err);\n else if (!Array.isArray(dat))\n ext(dat);\n else if (dat.length == 1) {\n strm.queuedSize -= dat[0];\n if (strm.ondrain)\n strm.ondrain(dat[0]);\n }\n else {\n if (dat[1])\n w.terminate();\n strm.ondata.call(strm, err, dat[0], dat[1]);\n }\n });\n w.postMessage(opts);\n strm.queuedSize = 0;\n strm.push = function (d, f) {\n if (!strm.ondata)\n err(5);\n if (t)\n strm.ondata(err(4, 0, 1), null, !!f);\n strm.queuedSize += d.length;\n // can fail for cross-realm Uint8Array, but ok - only a small performance penalty\n w.postMessage([d, t = f], d.buffer instanceof ArrayBuffer ? [d.buffer] : []);\n };\n strm.terminate = function () { w.terminate(); };\n if (flush) {\n strm.flush = function (sync) { w.postMessage([0, sync]); };\n }\n};\n// read 2 bytes\nvar b2 = function (d, b) { return d[b] | (d[b + 1] << 8); };\n// read 4 bytes\nvar b4 = function (d, b) { return (d[b] | (d[b + 1] << 8) | (d[b + 2] << 16) | (d[b + 3] << 24)) >>> 0; };\n// read 8 bytes\nvar b8 = function (d, b) { return b4(d, b) + (b4(d, b + 4) * 4294967296); };\n// write bytes\nvar wbytes = function (d, b, v) {\n for (; v; ++b)\n d[b] = v, v >>>= 8;\n};\n// gzip header\nvar gzh = function (c, o) {\n var fn = o.filename;\n c[0] = 31, c[1] = 139, c[2] = 8, c[8] = o.level < 2 ? 4 : o.level == 9 ? 2 : 0, c[9] = 3; // assume Unix\n if (o.mtime != 0)\n wbytes(c, 4, Math.floor(new Date(o.mtime || Date.now()) / 1000));\n if (fn) {\n c[3] = 8;\n for (var i = 0; i <= fn.length; ++i)\n c[i + 10] = fn.charCodeAt(i);\n }\n};\n// gzip footer: -8 to -4 = CRC, -4 to -0 is length\n// gzip start\nvar gzs = function (d) {\n if (d[0] != 31 || d[1] != 139 || d[2] != 8)\n err(6, 'invalid gzip data');\n var flg = d[3];\n var st = 10;\n if (flg & 4)\n st += (d[10] | d[11] << 8) + 2;\n for (var zs = (flg >> 3 & 1) + (flg >> 4 & 1); zs > 0; zs -= !d[st++])\n ;\n return st + (flg & 2);\n};\n// gzip length\nvar gzl = function (d) {\n var l = d.length;\n return (d[l - 4] | d[l - 3] << 8 | d[l - 2] << 16 | d[l - 1] << 24) >>> 0;\n};\n// gzip header length\nvar gzhl = function (o) { return 10 + (o.filename ? o.filename.length + 1 : 0); };\n// zlib header\nvar zlh = function (c, o) {\n var lv = o.level, fl = lv == 0 ? 0 : lv < 6 ? 1 : lv == 9 ? 3 : 2;\n c[0] = 120, c[1] = (fl << 6) | (o.dictionary && 32);\n c[1] |= 31 - ((c[0] << 8) | c[1]) % 31;\n if (o.dictionary) {\n var h = adler();\n h.p(o.dictionary);\n wbytes(c, 2, h.d());\n }\n};\n// zlib start\nvar zls = function (d, dict) {\n if ((d[0] & 15) != 8 || (d[0] >> 4) > 7 || ((d[0] << 8 | d[1]) % 31))\n err(6, 'invalid zlib data');\n if ((d[1] >> 5 & 1) == +!dict)\n err(6, 'invalid zlib data: ' + (d[1] & 32 ? 'need' : 'unexpected') + ' dictionary');\n return (d[1] >> 3 & 4) + 2;\n};\nfunction StrmOpt(opts, cb) {\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n return opts;\n}\n/**\n * Streaming DEFLATE compression\n */\nvar Deflate = /*#__PURE__*/ (function () {\n function Deflate(opts, cb) {\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n this.o = opts || {};\n this.s = { l: 0, i: 32768, w: 32768, z: 32768 };\n // Buffer length must always be 0 mod 32768 for index calculations to be correct when modifying head and prev\n // 98304 = 32768 (lookback) + 65536 (common chunk size)\n this.b = new u8(98304);\n if (this.o.dictionary) {\n var dict = this.o.dictionary.subarray(-32768);\n this.b.set(dict, 32768 - dict.length);\n this.s.i = 32768 - dict.length;\n }\n }\n Deflate.prototype.p = function (c, f) {\n this.ondata(dopt(c, this.o, 0, 0, this.s), f);\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Deflate.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (this.s.l)\n err(4);\n var endLen = chunk.length + this.s.z;\n if (endLen > this.b.length) {\n if (endLen > 2 * this.b.length - 32768) {\n var newBuf = new u8(endLen & -32768);\n newBuf.set(this.b.subarray(0, this.s.z));\n this.b = newBuf;\n }\n var split = this.b.length - this.s.z;\n this.b.set(chunk.subarray(0, split), this.s.z);\n this.s.z = this.b.length;\n this.p(this.b, false);\n this.b.set(this.b.subarray(-32768));\n this.b.set(chunk.subarray(split), 32768);\n this.s.z = chunk.length - split + 32768;\n this.s.i = 32766, this.s.w = 32768;\n }\n else {\n this.b.set(chunk, this.s.z);\n this.s.z += chunk.length;\n }\n this.s.l = final & 1;\n if (this.s.z > this.s.w + 8191 || final) {\n this.p(this.b, final || false);\n this.s.w = this.s.i, this.s.i -= 2;\n }\n if (final) {\n // cleanup unneeded buffers/state to reduce memory usage\n this.s = this.o = {};\n this.b = et;\n }\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * deflated output for small inputs.\n * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible. A separate DEFLATE stream may be concatenated\n * with the current output after a sync flush.\n */\n Deflate.prototype.flush = function (sync) {\n if (!this.ondata)\n err(5);\n if (this.s.l)\n err(4);\n this.p(this.b, false);\n this.s.w = this.s.i, this.s.i -= 2;\n // could technically skip writing the type-0 block for (this.s.r & 7) == 0,\n // but the deterministic trailer (00 00 FF FF) is useful in some situations\n if (sync) {\n var c = new u8(6);\n c[0] = this.s.r >> 3;\n // write empty, non-final type-0 block\n var ep = wfblk(c, this.s.r, et);\n this.s.r = 0;\n this.ondata(c.subarray(0, ep >> 3), false);\n }\n };\n return Deflate;\n}());\nexport { Deflate };\n/**\n * Asynchronous streaming DEFLATE compression\n */\nvar AsyncDeflate = /*#__PURE__*/ (function () {\n function AsyncDeflate(opts, cb) {\n astrmify([\n bDflt,\n function () { return [astrm, Deflate]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Deflate(ev.data);\n onmessage = astrm(strm);\n }, 6, 1);\n }\n return AsyncDeflate;\n}());\nexport { AsyncDeflate };\nexport function deflate(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n ], function (ev) { return pbf(deflateSync(ev.data[0], ev.data[1])); }, 0, cb);\n}\n/**\n * Compresses data with DEFLATE without any wrapper\n * @param data The data to compress\n * @param opts The compression options\n * @returns The deflated version of the data\n */\nexport function deflateSync(data, opts) {\n return dopt(data, opts || {}, 0, 0);\n}\n/**\n * Streaming DEFLATE decompression\n */\nvar Inflate = /*#__PURE__*/ (function () {\n function Inflate(opts, cb) {\n // no StrmOpt here to avoid adding to workerizer\n if (typeof opts == 'function')\n cb = opts, opts = {};\n this.ondata = cb;\n var dict = opts && opts.dictionary && opts.dictionary.subarray(-32768);\n this.s = { i: 0, b: dict ? dict.length : 0 };\n this.o = new u8(32768);\n this.p = new u8(0);\n if (dict)\n this.o.set(dict);\n }\n Inflate.prototype.e = function (c) {\n if (!this.ondata)\n err(5);\n if (this.d)\n err(4);\n if (!this.p.length)\n this.p = c;\n else if (c.length) {\n var n = new u8(this.p.length + c.length);\n n.set(this.p), n.set(c, this.p.length), this.p = n;\n }\n };\n Inflate.prototype.c = function (final) {\n this.s.i = +(this.d = final || false);\n var bts = this.s.b;\n var dt = inflt(this.p, this.s, this.o);\n this.ondata(slc(dt, bts, this.s.b), this.d);\n this.o = slc(dt, this.s.b - 32768), this.s.b = this.o.length;\n this.p = slc(this.p, (this.s.p / 8) | 0), this.s.p &= 7;\n };\n /**\n * Pushes a chunk to be inflated\n * @param chunk The chunk to push\n * @param final Whether this is the final chunk\n */\n Inflate.prototype.push = function (chunk, final) {\n this.e(chunk), this.c(final);\n };\n return Inflate;\n}());\nexport { Inflate };\n/**\n * Asynchronous streaming DEFLATE decompression\n */\nvar AsyncInflate = /*#__PURE__*/ (function () {\n function AsyncInflate(opts, cb) {\n astrmify([\n bInflt,\n function () { return [astrm, Inflate]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Inflate(ev.data);\n onmessage = astrm(strm);\n }, 7, 0);\n }\n return AsyncInflate;\n}());\nexport { AsyncInflate };\nexport function inflate(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt\n ], function (ev) { return pbf(inflateSync(ev.data[0], gopt(ev.data[1]))); }, 1, cb);\n}\nexport function inflateSync(data, opts) {\n return inflt(data, { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// before you yell at me for not just using extends, my reason is that TS inheritance is hard to workerize.\n/**\n * Streaming GZIP compression\n */\nvar Gzip = /*#__PURE__*/ (function () {\n function Gzip(opts, cb) {\n this.c = crc();\n this.l = 0;\n this.v = 1;\n Deflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be GZIPped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Gzip.prototype.push = function (chunk, final) {\n this.c.p(chunk);\n this.l += chunk.length;\n Deflate.prototype.push.call(this, chunk, final);\n };\n Gzip.prototype.p = function (c, f) {\n var raw = dopt(c, this.o, this.v && gzhl(this.o), f && 8, this.s);\n if (this.v)\n gzh(raw, this.o), this.v = 0;\n if (f)\n wbytes(raw, raw.length - 8, this.c.d()), wbytes(raw, raw.length - 4, this.l);\n this.ondata(raw, f);\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * GZIPped output for small inputs.\n * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Gzip.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\n };\n return Gzip;\n}());\nexport { Gzip };\n/**\n * Asynchronous streaming GZIP compression\n */\nvar AsyncGzip = /*#__PURE__*/ (function () {\n function AsyncGzip(opts, cb) {\n astrmify([\n bDflt,\n gze,\n function () { return [astrm, Deflate, Gzip]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Gzip(ev.data);\n onmessage = astrm(strm);\n }, 8, 1);\n }\n return AsyncGzip;\n}());\nexport { AsyncGzip };\nexport function gzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n gze,\n function () { return [gzipSync]; }\n ], function (ev) { return pbf(gzipSync(ev.data[0], ev.data[1])); }, 2, cb);\n}\n/**\n * Compresses data with GZIP\n * @param data The data to compress\n * @param opts The compression options\n * @returns The gzipped version of the data\n */\nexport function gzipSync(data, opts) {\n if (!opts)\n opts = {};\n var c = crc(), l = data.length;\n c.p(data);\n var d = dopt(data, opts, gzhl(opts), 8), s = d.length;\n return gzh(d, opts), wbytes(d, s - 8, c.d()), wbytes(d, s - 4, l), d;\n}\n/**\n * Streaming single or multi-member GZIP decompression\n */\nvar Gunzip = /*#__PURE__*/ (function () {\n function Gunzip(opts, cb) {\n this.v = 1;\n this.r = 0;\n Inflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be GUNZIPped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Gunzip.prototype.push = function (chunk, final) {\n Inflate.prototype.e.call(this, chunk);\n this.r += chunk.length;\n if (this.v) {\n var p = this.p.subarray(this.v - 1);\n var s = p.length > 3 ? gzs(p) : 4;\n if (s > p.length) {\n if (!final)\n return;\n }\n else if (this.v > 1 && this.onmember) {\n this.onmember(this.r - p.length);\n }\n this.p = p.subarray(s), this.v = 0;\n }\n // necessary to prevent TS from using the closure value\n // This allows for workerization to function correctly\n Inflate.prototype.c.call(this, 0);\n // process concatenated GZIP\n if (this.s.f && !this.s.l) {\n this.v = shft(this.s.p) + 9;\n this.s = { i: 0 };\n this.o = new u8(0);\n this.push(new u8(0), final);\n }\n else if (final) {\n Inflate.prototype.c.call(this, final);\n }\n };\n return Gunzip;\n}());\nexport { Gunzip };\n/**\n * Asynchronous streaming single or multi-member GZIP decompression\n */\nvar AsyncGunzip = /*#__PURE__*/ (function () {\n function AsyncGunzip(opts, cb) {\n var _this = this;\n astrmify([\n bInflt,\n guze,\n function () { return [astrm, Inflate, Gunzip]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Gunzip(ev.data);\n strm.onmember = function (offset) { return postMessage(offset); };\n onmessage = astrm(strm);\n }, 9, 0, function (offset) { return _this.onmember && _this.onmember(offset); });\n }\n return AsyncGunzip;\n}());\nexport { AsyncGunzip };\nexport function gunzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt,\n guze,\n function () { return [gunzipSync]; }\n ], function (ev) { return pbf(gunzipSync(ev.data[0], ev.data[1])); }, 3, cb);\n}\nexport function gunzipSync(data, opts) {\n var st = gzs(data);\n if (st + 8 > data.length)\n err(6, 'invalid gzip data');\n return inflt(data.subarray(st, -8), { i: 2 }, opts && opts.out || new u8(gzl(data)), opts && opts.dictionary);\n}\n/**\n * Streaming Zlib compression\n */\nvar Zlib = /*#__PURE__*/ (function () {\n function Zlib(opts, cb) {\n this.c = adler();\n this.v = 1;\n Deflate.call(this, opts, cb);\n }\n /**\n * Pushes a chunk to be zlibbed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Zlib.prototype.push = function (chunk, final) {\n this.c.p(chunk);\n Deflate.prototype.push.call(this, chunk, final);\n };\n Zlib.prototype.p = function (c, f) {\n var raw = dopt(c, this.o, this.v && (this.o.dictionary ? 6 : 2), f && 4, this.s);\n if (this.v)\n zlh(raw, this.o), this.v = 0;\n if (f)\n wbytes(raw, raw.length - 4, this.c.d());\n this.ondata(raw, f);\n };\n /**\n * Flushes buffered uncompressed data. Useful to immediately retrieve the\n * zlibbed output for small inputs.\n * @param sync Whether to flush to a byte boundary. A sync flush takes 4-5\n * extra bytes, but guarantees all pushed data is immediately\n * decompressible.\n */\n Zlib.prototype.flush = function (sync) {\n Deflate.prototype.flush.call(this, sync);\n };\n return Zlib;\n}());\nexport { Zlib };\n/**\n * Asynchronous streaming Zlib compression\n */\nvar AsyncZlib = /*#__PURE__*/ (function () {\n function AsyncZlib(opts, cb) {\n astrmify([\n bDflt,\n zle,\n function () { return [astrm, Deflate, Zlib]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Zlib(ev.data);\n onmessage = astrm(strm);\n }, 10, 1);\n }\n return AsyncZlib;\n}());\nexport { AsyncZlib };\nexport function zlib(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bDflt,\n zle,\n function () { return [zlibSync]; }\n ], function (ev) { return pbf(zlibSync(ev.data[0], ev.data[1])); }, 4, cb);\n}\n/**\n * Compress data with Zlib\n * @param data The data to compress\n * @param opts The compression options\n * @returns The zlib-compressed version of the data\n */\nexport function zlibSync(data, opts) {\n if (!opts)\n opts = {};\n var a = adler();\n a.p(data);\n var d = dopt(data, opts, opts.dictionary ? 6 : 2, 4);\n return zlh(d, opts), wbytes(d, d.length - 4, a.d()), d;\n}\n/**\n * Streaming Zlib decompression\n */\nvar Unzlib = /*#__PURE__*/ (function () {\n function Unzlib(opts, cb) {\n Inflate.call(this, opts, cb);\n this.v = opts && opts.dictionary ? 2 : 1;\n }\n /**\n * Pushes a chunk to be unzlibbed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Unzlib.prototype.push = function (chunk, final) {\n Inflate.prototype.e.call(this, chunk);\n if (this.v) {\n if (this.p.length < 6 && !final)\n return;\n this.p = this.p.subarray(zls(this.p, this.v - 1)), this.v = 0;\n }\n if (final) {\n if (this.p.length < 4)\n err(6, 'invalid zlib data');\n this.p = this.p.subarray(0, -4);\n }\n // necessary to prevent TS from using the closure value\n // This allows for workerization to function correctly\n Inflate.prototype.c.call(this, final);\n };\n return Unzlib;\n}());\nexport { Unzlib };\n/**\n * Asynchronous streaming Zlib decompression\n */\nvar AsyncUnzlib = /*#__PURE__*/ (function () {\n function AsyncUnzlib(opts, cb) {\n astrmify([\n bInflt,\n zule,\n function () { return [astrm, Inflate, Unzlib]; }\n ], this, StrmOpt.call(this, opts, cb), function (ev) {\n var strm = new Unzlib(ev.data);\n onmessage = astrm(strm);\n }, 11, 0);\n }\n return AsyncUnzlib;\n}());\nexport { AsyncUnzlib };\nexport function unzlib(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return cbify(data, opts, [\n bInflt,\n zule,\n function () { return [unzlibSync]; }\n ], function (ev) { return pbf(unzlibSync(ev.data[0], gopt(ev.data[1]))); }, 5, cb);\n}\nexport function unzlibSync(data, opts) {\n return inflt(data.subarray(zls(data, opts && opts.dictionary), -4), { i: 2 }, opts && opts.out, opts && opts.dictionary);\n}\n// Default algorithm for compression (used because having a known output size allows faster decompression)\nexport { gzip as compress, AsyncGzip as AsyncCompress };\nexport { gzipSync as compressSync, Gzip as Compress };\n/**\n * Streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar Decompress = /*#__PURE__*/ (function () {\n function Decompress(opts, cb) {\n this.o = StrmOpt.call(this, opts, cb) || {};\n this.G = Gunzip;\n this.I = Inflate;\n this.Z = Unzlib;\n }\n // init substream\n // overriden by AsyncDecompress\n Decompress.prototype.i = function () {\n var _this = this;\n this.s.ondata = function (dat, final) {\n _this.ondata(dat, final);\n };\n };\n /**\n * Pushes a chunk to be decompressed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Decompress.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (!this.s) {\n if (this.p && this.p.length) {\n var n = new u8(this.p.length + chunk.length);\n n.set(this.p), n.set(chunk, this.p.length);\n }\n else\n this.p = chunk;\n if (this.p.length > 2) {\n this.s = (this.p[0] == 31 && this.p[1] == 139 && this.p[2] == 8)\n ? new this.G(this.o)\n : ((this.p[0] & 15) != 8 || (this.p[0] >> 4) > 7 || ((this.p[0] << 8 | this.p[1]) % 31))\n ? new this.I(this.o)\n : new this.Z(this.o);\n this.i();\n this.s.push(this.p, final);\n this.p = null;\n }\n }\n else\n this.s.push(chunk, final);\n };\n return Decompress;\n}());\nexport { Decompress };\n/**\n * Asynchronous streaming GZIP, Zlib, or raw DEFLATE decompression\n */\nvar AsyncDecompress = /*#__PURE__*/ (function () {\n function AsyncDecompress(opts, cb) {\n Decompress.call(this, opts, cb);\n this.queuedSize = 0;\n this.G = AsyncGunzip;\n this.I = AsyncInflate;\n this.Z = AsyncUnzlib;\n }\n AsyncDecompress.prototype.i = function () {\n var _this = this;\n this.s.ondata = function (err, dat, final) {\n _this.ondata(err, dat, final);\n };\n this.s.ondrain = function (size) {\n _this.queuedSize -= size;\n if (_this.ondrain)\n _this.ondrain(size);\n };\n };\n /**\n * Pushes a chunk to be decompressed\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n AsyncDecompress.prototype.push = function (chunk, final) {\n this.queuedSize += chunk.length;\n Decompress.prototype.push.call(this, chunk, final);\n };\n return AsyncDecompress;\n}());\nexport { AsyncDecompress };\nexport function decompress(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n ? gunzip(data, opts, cb)\n : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n ? inflate(data, opts, cb)\n : unzlib(data, opts, cb);\n}\n/**\n * Expands compressed GZIP, Zlib, or raw DEFLATE data, automatically detecting the format\n * @param data The data to decompress\n * @param opts The decompression options\n * @returns The decompressed version of the data\n */\nexport function decompressSync(data, opts) {\n return (data[0] == 31 && data[1] == 139 && data[2] == 8)\n ? gunzipSync(data, opts)\n : ((data[0] & 15) != 8 || (data[0] >> 4) > 7 || ((data[0] << 8 | data[1]) % 31))\n ? inflateSync(data, opts)\n : unzlibSync(data, opts);\n}\n// flatten a directory structure\nvar fltn = function (d, p, t, o) {\n for (var k in d) {\n var val = d[k], n = p + k, op = o;\n if (Array.isArray(val))\n op = mrg(o, val[1]), val = val[0];\n if (ArrayBuffer.isView(val))\n t[n] = [val, op];\n else {\n t[n += '/'] = [new u8(0), op];\n fltn(val, n, t, o);\n }\n }\n};\n// text encoder\nvar te = typeof TextEncoder != 'undefined' && /*#__PURE__*/ new TextEncoder();\n// text decoder\nvar td = typeof TextDecoder != 'undefined' && /*#__PURE__*/ new TextDecoder();\n// text decoder stream\nvar tds = 0;\ntry {\n td.decode(et, { stream: true });\n tds = 1;\n}\ncatch (e) { }\n// decode UTF8\nvar dutf8 = function (d) {\n for (var r = '', i = 0;;) {\n var c = d[i++];\n var eb = (c > 127) + (c > 223) + (c > 239);\n if (i + eb > d.length)\n return { s: r, r: slc(d, i - 1) };\n if (!eb)\n r += String.fromCharCode(c);\n else if (eb == 3) {\n c = ((c & 15) << 18 | (d[i++] & 63) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63)) - 65536,\n r += String.fromCharCode(55296 | (c >> 10), 56320 | (c & 1023));\n }\n else if (eb & 1)\n r += String.fromCharCode((c & 31) << 6 | (d[i++] & 63));\n else\n r += String.fromCharCode((c & 15) << 12 | (d[i++] & 63) << 6 | (d[i++] & 63));\n }\n};\n/**\n * Streaming UTF-8 decoding\n */\nvar DecodeUTF8 = /*#__PURE__*/ (function () {\n /**\n * Creates a UTF-8 decoding stream\n * @param cb The callback to call whenever data is decoded\n */\n function DecodeUTF8(cb) {\n this.ondata = cb;\n if (tds)\n this.t = new TextDecoder();\n else\n this.p = et;\n }\n /**\n * Pushes a chunk to be decoded from UTF-8 binary\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n DecodeUTF8.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n final = !!final;\n if (this.t) {\n this.ondata(this.t.decode(chunk, { stream: true }), final);\n if (final) {\n if (this.t.decode().length)\n err(8);\n this.t = null;\n }\n return;\n }\n if (!this.p)\n err(4);\n var dat = new u8(this.p.length + chunk.length);\n dat.set(this.p);\n dat.set(chunk, this.p.length);\n var _a = dutf8(dat), s = _a.s, r = _a.r;\n if (final) {\n if (r.length)\n err(8);\n this.p = null;\n }\n else\n this.p = r;\n this.ondata(s, final);\n };\n return DecodeUTF8;\n}());\nexport { DecodeUTF8 };\n/**\n * Streaming UTF-8 encoding\n */\nvar EncodeUTF8 = /*#__PURE__*/ (function () {\n /**\n * Creates a UTF-8 decoding stream\n * @param cb The callback to call whenever data is encoded\n */\n function EncodeUTF8(cb) {\n this.ondata = cb;\n }\n /**\n * Pushes a chunk to be encoded to UTF-8\n * @param chunk The string data to push\n * @param final Whether this is the last chunk\n */\n EncodeUTF8.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n if (this.d)\n err(4);\n this.ondata(strToU8(chunk), this.d = final || false);\n };\n return EncodeUTF8;\n}());\nexport { EncodeUTF8 };\n/**\n * Converts a string into a Uint8Array for use with compression/decompression methods\n * @param str The string to encode\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n * not need to be true unless decoding a binary string.\n * @returns The string encoded in UTF-8/Latin-1 binary\n */\nexport function strToU8(str, latin1) {\n if (latin1) {\n var ar_1 = new u8(str.length);\n for (var i = 0; i < str.length; ++i)\n ar_1[i] = str.charCodeAt(i);\n return ar_1;\n }\n if (te)\n return te.encode(str);\n var l = str.length;\n var ar = new u8(str.length + (str.length >> 1));\n var ai = 0;\n var w = function (v) { ar[ai++] = v; };\n for (var i = 0; i < l; ++i) {\n if (ai + 5 > ar.length) {\n var n = new u8(ai + 8 + ((l - i) << 1));\n n.set(ar);\n ar = n;\n }\n var c = str.charCodeAt(i);\n if (c < 128 || latin1)\n w(c);\n else if (c < 2048)\n w(192 | (c >> 6)), w(128 | (c & 63));\n else if (c > 55295 && c < 57344)\n c = 65536 + (c & 1023 << 10) | (str.charCodeAt(++i) & 1023),\n w(240 | (c >> 18)), w(128 | ((c >> 12) & 63)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n else\n w(224 | (c >> 12)), w(128 | ((c >> 6) & 63)), w(128 | (c & 63));\n }\n return slc(ar, 0, ai);\n}\n/**\n * Converts a Uint8Array to a string\n * @param dat The data to decode to string\n * @param latin1 Whether or not to interpret the data as Latin-1. This should\n * not need to be true unless encoding to binary string.\n * @returns The original UTF-8/Latin-1 string\n */\nexport function strFromU8(dat, latin1) {\n if (latin1) {\n var r = '';\n for (var i = 0; i < dat.length; i += 16384)\n r += String.fromCharCode.apply(null, dat.subarray(i, i + 16384));\n return r;\n }\n else if (td) {\n return td.decode(dat);\n }\n else {\n var _a = dutf8(dat), s = _a.s, r = _a.r;\n if (r.length)\n err(8);\n return s;\n }\n}\n;\n// deflate bit flag\nvar dbf = function (l) { return l == 1 ? 3 : l < 6 ? 2 : l == 9 ? 1 : 0; };\n// skip local zip header\nvar slzh = function (d, b) { return b + 30 + b2(d, b + 26) + b2(d, b + 28); };\n// read zip header\nvar zh = function (d, b, z) {\n var fnl = b2(d, b + 28), efl = b2(d, b + 30), fn = strFromU8(d.subarray(b + 46, b + 46 + fnl), !(b2(d, b + 8) & 2048)), es = b + 46 + fnl;\n var _a = z64hs(d, es, efl, z, b4(d, b + 20), b4(d, b + 24), b4(d, b + 42)), sc = _a[0], su = _a[1], off = _a[2];\n return [b2(d, b + 10), sc, su, fn, es + efl + b2(d, b + 32), off];\n};\n// read zip64 header sizes\nvar z64hs = function (d, b, l, z, sc, su, off) {\n var nsc = sc == 4294967295, nsu = su == 4294967295, noff = off == 4294967295, e = b + l;\n var nf = nsc + nsu + noff;\n if (z && nf) {\n for (; b + 4 < e; b += 4 + b2(d, b + 2)) {\n if (b2(d, b) == 1) {\n return [\n nsc ? b8(d, b + 4 + 8 * nsu) : sc,\n nsu ? b8(d, b + 4) : su,\n noff ? b8(d, b + 4 + 8 * (nsu + nsc)) : off,\n 1\n ];\n }\n }\n // z == 2 for unknown whether or not zip64\n if (z < 2)\n err(13);\n }\n return [sc, su, off, 0];\n};\n// extra field length\nvar exfl = function (ex) {\n var le = 0;\n if (ex) {\n for (var k in ex) {\n var l = ex[k].length;\n if (l > 65535)\n err(9);\n le += l + 4;\n }\n }\n return le;\n};\n// write zip header\nvar wzh = function (d, b, f, fn, u, c, ce, co) {\n var fl = fn.length, ex = f.extra, col = co && co.length;\n var exl = exfl(ex);\n wbytes(d, b, ce != null ? 0x2014B50 : 0x4034B50), b += 4;\n if (ce != null)\n d[b++] = 20, d[b++] = f.os;\n d[b] = 20, b += 2; // spec compliance? what's that?\n d[b++] = (f.flag << 1) | (c < 0 && 8), d[b++] = u && 8;\n d[b++] = f.compression & 255, d[b++] = f.compression >> 8;\n var dt = new Date(f.mtime == null ? Date.now() : f.mtime), y = dt.getFullYear() - 1980;\n if (y < 0 || y > 119)\n err(10);\n wbytes(d, b, (y << 25) | ((dt.getMonth() + 1) << 21) | (dt.getDate() << 16) | (dt.getHours() << 11) | (dt.getMinutes() << 5) | (dt.getSeconds() >> 1)), b += 4;\n if (c != -1) {\n wbytes(d, b, f.crc);\n wbytes(d, b + 4, c < 0 ? -c - 2 : c);\n wbytes(d, b + 8, f.size);\n }\n wbytes(d, b + 12, fl);\n wbytes(d, b + 14, exl), b += 16;\n if (ce != null) {\n wbytes(d, b, col);\n wbytes(d, b + 6, f.attrs);\n wbytes(d, b + 10, ce), b += 14;\n }\n d.set(fn, b);\n b += fl;\n if (exl) {\n for (var k in ex) {\n var exf = ex[k], l = exf.length;\n wbytes(d, b, +k);\n wbytes(d, b + 2, l);\n d.set(exf, b + 4), b += 4 + l;\n }\n }\n if (col)\n d.set(co, b), b += col;\n return b;\n};\n// write zip footer (end of central directory)\nvar wzf = function (o, b, c, d, e) {\n wbytes(o, b, 0x6054B50); // skip disk\n wbytes(o, b + 8, c);\n wbytes(o, b + 10, c);\n wbytes(o, b + 12, d);\n wbytes(o, b + 16, e);\n};\n/**\n * A pass-through stream to keep data uncompressed in a ZIP archive.\n */\nvar ZipPassThrough = /*#__PURE__*/ (function () {\n /**\n * Creates a pass-through stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n */\n function ZipPassThrough(filename) {\n this.filename = filename;\n this.c = crc();\n this.size = 0;\n this.compression = 0;\n }\n /**\n * Processes a chunk and pushes to the output stream. You can override this\n * method in a subclass for custom behavior, but by default this passes\n * the data through. You must call this.ondata(err, chunk, final) at some\n * point in this method.\n * @param chunk The chunk to process\n * @param final Whether this is the last chunk\n */\n ZipPassThrough.prototype.process = function (chunk, final) {\n this.ondata(null, chunk, final);\n };\n /**\n * Pushes a chunk to be added. If you are subclassing this with a custom\n * compression algorithm, note that you must push data from the source\n * file only, pre-compression.\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n ZipPassThrough.prototype.push = function (chunk, final) {\n if (!this.ondata)\n err(5);\n this.c.p(chunk);\n this.size += chunk.length;\n if (final)\n this.crc = this.c.d();\n // we shouldn't really do this cast, but properly handling ArrayBufferLike\n // makes the API unergonomic with Buffer\n this.process(chunk, final || false);\n };\n return ZipPassThrough;\n}());\nexport { ZipPassThrough };\n// I don't extend because TypeScript extension adds 1kB of runtime bloat\n/**\n * Streaming DEFLATE compression for ZIP archives. Prefer using AsyncZipDeflate\n * for better performance\n */\nvar ZipDeflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n * @param opts The compression options\n */\n function ZipDeflate(filename, opts) {\n var _this = this;\n if (!opts)\n opts = {};\n ZipPassThrough.call(this, filename);\n this.d = new Deflate(opts, function (dat, final) {\n _this.ondata(null, dat, final);\n });\n this.compression = 8;\n this.flag = dbf(opts.level);\n }\n ZipDeflate.prototype.process = function (chunk, final) {\n try {\n this.d.push(chunk, final);\n }\n catch (e) {\n this.ondata(e, null, final);\n }\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n ZipDeflate.prototype.push = function (chunk, final) {\n ZipPassThrough.prototype.push.call(this, chunk, final);\n };\n return ZipDeflate;\n}());\nexport { ZipDeflate };\n/**\n * Asynchronous streaming DEFLATE compression for ZIP archives\n */\nvar AsyncZipDeflate = /*#__PURE__*/ (function () {\n /**\n * Creates an asynchronous DEFLATE stream that can be added to ZIP archives\n * @param filename The filename to associate with this data stream\n * @param opts The compression options\n */\n function AsyncZipDeflate(filename, opts) {\n var _this = this;\n if (!opts)\n opts = {};\n ZipPassThrough.call(this, filename);\n this.d = new AsyncDeflate(opts, function (err, dat, final) {\n _this.ondata(err, dat, final);\n });\n this.compression = 8;\n this.flag = dbf(opts.level);\n this.terminate = this.d.terminate;\n }\n AsyncZipDeflate.prototype.process = function (chunk, final) {\n this.d.push(chunk, final);\n };\n /**\n * Pushes a chunk to be deflated\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n AsyncZipDeflate.prototype.push = function (chunk, final) {\n ZipPassThrough.prototype.push.call(this, chunk, final);\n };\n return AsyncZipDeflate;\n}());\nexport { AsyncZipDeflate };\n// TODO: Better tree shaking\n/**\n * A zippable archive to which files can incrementally be added\n */\nvar Zip = /*#__PURE__*/ (function () {\n /**\n * Creates an empty ZIP archive to which files can be added\n * @param cb The callback to call whenever data for the generated ZIP archive\n * is available\n */\n function Zip(cb) {\n this.ondata = cb;\n this.u = [];\n this.d = 1;\n }\n /**\n * Adds a file to the ZIP archive\n * @param file The file stream to add\n */\n Zip.prototype.add = function (file) {\n var _this = this;\n if (!this.ondata)\n err(5);\n // finishing or finished\n if (this.d & 2)\n this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, false);\n else {\n var f = strToU8(file.filename), fl_1 = f.length;\n var com = file.comment, o = com && strToU8(com);\n var u = fl_1 != file.filename.length || (o && (com.length != o.length));\n var hl_1 = fl_1 + exfl(file.extra) + 30;\n if (fl_1 > 65535)\n this.ondata(err(11, 0, 1), null, false);\n var header = new u8(hl_1);\n wzh(header, 0, file, f, u, -1);\n var chks_1 = [header];\n var pAll_1 = function () {\n for (var _i = 0, chks_2 = chks_1; _i < chks_2.length; _i++) {\n var chk = chks_2[_i];\n _this.ondata(null, chk, false);\n }\n chks_1 = [];\n };\n var tr_1 = this.d;\n this.d = 0;\n var ind_1 = this.u.length;\n var uf_1 = mrg(file, {\n f: f,\n u: u,\n o: o,\n t: function () {\n if (file.terminate)\n file.terminate();\n },\n r: function () {\n pAll_1();\n if (tr_1) {\n var nxt = _this.u[ind_1 + 1];\n if (nxt)\n nxt.r();\n else\n _this.d = 1;\n }\n tr_1 = 1;\n }\n });\n var cl_1 = 0;\n file.ondata = function (err, dat, final) {\n if (err) {\n _this.ondata(err, dat, final);\n _this.terminate();\n }\n else {\n cl_1 += dat.length;\n chks_1.push(dat);\n if (final) {\n var dd = new u8(16);\n wbytes(dd, 0, 0x8074B50);\n wbytes(dd, 4, file.crc);\n wbytes(dd, 8, cl_1);\n wbytes(dd, 12, file.size);\n chks_1.push(dd);\n uf_1.c = cl_1, uf_1.b = hl_1 + cl_1 + 16, uf_1.crc = file.crc, uf_1.size = file.size;\n if (tr_1)\n uf_1.r();\n tr_1 = 1;\n }\n else if (tr_1)\n pAll_1();\n }\n };\n this.u.push(uf_1);\n }\n };\n /**\n * Ends the process of adding files and prepares to emit the final chunks.\n * This *must* be called after adding all desired files for the resulting\n * ZIP file to work properly.\n */\n Zip.prototype.end = function () {\n var _this = this;\n if (this.d & 2) {\n this.ondata(err(4 + (this.d & 1) * 8, 0, 1), null, true);\n return;\n }\n if (this.d)\n this.e();\n else\n this.u.push({\n r: function () {\n if (!(_this.d & 1))\n return;\n _this.u.splice(-1, 1);\n _this.e();\n },\n t: function () { }\n });\n this.d = 3;\n };\n Zip.prototype.e = function () {\n var bt = 0, l = 0, tl = 0;\n for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n var f = _a[_i];\n tl += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0);\n }\n var out = new u8(tl + 22);\n for (var _b = 0, _c = this.u; _b < _c.length; _b++) {\n var f = _c[_b];\n wzh(out, bt, f, f.f, f.u, -f.c - 2, l, f.o);\n bt += 46 + f.f.length + exfl(f.extra) + (f.o ? f.o.length : 0), l += f.b;\n }\n wzf(out, bt, this.u.length, tl, l);\n this.ondata(null, out, true);\n this.d = 2;\n };\n /**\n * A method to terminate any internal workers used by the stream. Subsequent\n * calls to add() will fail.\n */\n Zip.prototype.terminate = function () {\n for (var _i = 0, _a = this.u; _i < _a.length; _i++) {\n var f = _a[_i];\n f.t();\n }\n this.d = 2;\n };\n return Zip;\n}());\nexport { Zip };\nexport function zip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n var r = {};\n fltn(data, '', r, opts);\n var k = Object.keys(r);\n var lft = k.length, o = 0, tot = 0;\n var slft = lft, files = new Array(lft);\n var term = [];\n var tAll = function () {\n for (var i = 0; i < term.length; ++i)\n term[i]();\n };\n var cbd = function (a, b) {\n mt(function () { cb(a, b); });\n };\n mt(function () { cbd = cb; });\n var cbf = function () {\n var out = new u8(tot + 22), oe = o, cdl = tot - o;\n tot = 0;\n for (var i = 0; i < slft; ++i) {\n var f = files[i];\n try {\n var l = f.c.length;\n wzh(out, tot, f, f.f, f.u, l);\n var badd = 30 + f.f.length + exfl(f.extra);\n var loc = tot + badd;\n out.set(f.c, loc);\n wzh(out, o, f, f.f, f.u, l, tot, f.m), o += 16 + badd + (f.m ? f.m.length : 0), tot = loc + l;\n }\n catch (e) {\n return cbd(e, null);\n }\n }\n wzf(out, o, files.length, cdl, oe);\n cbd(null, out);\n };\n if (!lft)\n cbf();\n var _loop_1 = function (i) {\n var fn = k[i];\n var _a = r[fn], file = _a[0], p = _a[1];\n var c = crc(), size = file.length;\n c.p(file);\n var f = strToU8(fn), s = f.length;\n var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n var exl = exfl(p.extra);\n var compression = p.level == 0 ? 0 : 8;\n var cbl = function (e, d) {\n if (e) {\n tAll();\n cbd(e, null);\n }\n else {\n var l = d.length;\n files[i] = mrg(p, {\n size: size,\n crc: c.d(),\n c: d,\n f: f,\n m: m,\n u: s != fn.length || (m && (com.length != ms)),\n compression: compression\n });\n o += 30 + s + exl + l;\n tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n if (!--lft)\n cbf();\n }\n };\n if (s > 65535)\n cbl(err(11, 0, 1), null);\n if (!compression)\n cbl(null, file);\n else if (size < 160000) {\n try {\n cbl(null, deflateSync(file, p));\n }\n catch (e) {\n cbl(e, null);\n }\n }\n else\n term.push(deflate(file, p, cbl));\n };\n // Cannot use lft because it can decrease\n for (var i = 0; i < slft; ++i) {\n _loop_1(i);\n }\n return tAll;\n}\n/**\n * Synchronously creates a ZIP file. Prefer using `zip` for better performance\n * with more than one file.\n * @param data The directory structure for the ZIP archive\n * @param opts The main options, merged with per-file options\n * @returns The generated ZIP archive\n */\nexport function zipSync(data, opts) {\n if (!opts)\n opts = {};\n var r = {};\n var files = [];\n fltn(data, '', r, opts);\n var o = 0;\n var tot = 0;\n for (var fn in r) {\n var _a = r[fn], file = _a[0], p = _a[1];\n var compression = p.level == 0 ? 0 : 8;\n var f = strToU8(fn), s = f.length;\n var com = p.comment, m = com && strToU8(com), ms = m && m.length;\n var exl = exfl(p.extra);\n if (s > 65535)\n err(11);\n var d = compression ? deflateSync(file, p) : file, l = d.length;\n var c = crc();\n c.p(file);\n files.push(mrg(p, {\n size: file.length,\n crc: c.d(),\n c: d,\n f: f,\n m: m,\n u: s != fn.length || (m && (com.length != ms)),\n o: o,\n compression: compression\n }));\n o += 30 + s + exl + l;\n tot += 76 + 2 * (s + exl) + (ms || 0) + l;\n }\n var out = new u8(tot + 22), oe = o, cdl = tot - o;\n for (var i = 0; i < files.length; ++i) {\n var f = files[i];\n wzh(out, f.o, f, f.f, f.u, f.c.length);\n var badd = 30 + f.f.length + exfl(f.extra);\n out.set(f.c, f.o + badd);\n wzh(out, o, f, f.f, f.u, f.c.length, f.o, f.m), o += 16 + badd + (f.m ? f.m.length : 0);\n }\n wzf(out, o, files.length, cdl, oe);\n return out;\n}\n/**\n * Streaming pass-through decompression for ZIP archives\n */\nvar UnzipPassThrough = /*#__PURE__*/ (function () {\n function UnzipPassThrough() {\n }\n UnzipPassThrough.prototype.push = function (chunk, final) {\n // same as ZipPassThrough: cast to retain Buffer ergonomics\n this.ondata(null, chunk, final);\n };\n UnzipPassThrough.compression = 0;\n return UnzipPassThrough;\n}());\nexport { UnzipPassThrough };\n/**\n * Streaming DEFLATE decompression for ZIP archives. Prefer AsyncZipInflate for\n * better performance.\n */\nvar UnzipInflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE decompression that can be used in ZIP archives\n */\n function UnzipInflate() {\n var _this = this;\n this.i = new Inflate(function (dat, final) {\n _this.ondata(null, dat, final);\n });\n }\n UnzipInflate.prototype.push = function (chunk, final) {\n try {\n this.i.push(chunk, final);\n }\n catch (e) {\n this.ondata(e, null, final);\n }\n };\n UnzipInflate.compression = 8;\n return UnzipInflate;\n}());\nexport { UnzipInflate };\n/**\n * Asynchronous streaming DEFLATE decompression for ZIP archives\n */\nvar AsyncUnzipInflate = /*#__PURE__*/ (function () {\n /**\n * Creates a DEFLATE decompression that can be used in ZIP archives\n */\n function AsyncUnzipInflate(_, sz) {\n var _this = this;\n if (sz < 320000) {\n this.i = new Inflate(function (dat, final) {\n _this.ondata(null, dat, final);\n });\n }\n else {\n this.i = new AsyncInflate(function (err, dat, final) {\n _this.ondata(err, dat, final);\n });\n this.terminate = this.i.terminate;\n }\n }\n AsyncUnzipInflate.prototype.push = function (chunk, final) {\n if (this.i.terminate)\n chunk = slc(chunk, 0);\n this.i.push(chunk, final);\n };\n AsyncUnzipInflate.compression = 8;\n return AsyncUnzipInflate;\n}());\nexport { AsyncUnzipInflate };\n/**\n * A ZIP archive decompression stream that emits files as they are discovered\n */\nvar Unzip = /*#__PURE__*/ (function () {\n /**\n * Creates a ZIP decompression stream\n * @param cb The callback to call whenever a file in the ZIP archive is found\n */\n function Unzip(cb) {\n this.onfile = cb;\n this.k = [];\n this.o = {\n 0: UnzipPassThrough\n };\n this.p = et;\n }\n /**\n * Pushes a chunk to be unzipped\n * @param chunk The chunk to push\n * @param final Whether this is the last chunk\n */\n Unzip.prototype.push = function (chunk, final) {\n var _this = this;\n if (!this.onfile)\n err(5);\n if (!this.p)\n err(4);\n if (this.c > 0) {\n var len = Math.min(this.c, chunk.length);\n var toAdd = chunk.subarray(0, len);\n this.c -= len;\n if (this.d)\n this.d.push(toAdd, !this.c);\n else\n this.k[0].push(toAdd);\n chunk = chunk.subarray(len);\n if (chunk.length)\n return this.push(chunk, final);\n }\n else {\n var f = 0, i = 0, is = void 0, buf = void 0;\n if (!this.p.length)\n buf = chunk;\n else if (!chunk.length)\n buf = this.p;\n else {\n buf = new u8(this.p.length + chunk.length);\n buf.set(this.p), buf.set(chunk, this.p.length);\n }\n var l = buf.length, oc = this.c, add = oc && this.d;\n var _loop_2 = function () {\n var sig = b4(buf, i);\n if (sig == 0x4034B50) {\n f = 1, is = i;\n this_1.d = null;\n this_1.c = 0;\n var bf = b2(buf, i + 6), cmp_1 = b2(buf, i + 8), u = bf & 2048, dd = bf & 8, fnl = b2(buf, i + 26), es = b2(buf, i + 28);\n if (l > i + 30 + fnl + es) {\n var chks_3 = [];\n this_1.k.unshift(chks_3);\n f = 2;\n var lsc = b4(buf, i + 18), lsu = b4(buf, i + 22);\n var fn_1 = strFromU8(buf.subarray(i + 30, i += 30 + fnl), !u);\n var _a = z64hs(buf, i, es, 2, lsc, lsu, 0), sc_1 = _a[0], su_1 = _a[1], z64 = _a[3];\n if (dd)\n sc_1 = -1 - z64;\n i += es;\n this_1.c = sc_1;\n var d_1;\n var file_1 = {\n name: fn_1,\n compression: cmp_1,\n start: function () {\n if (!file_1.ondata)\n err(5);\n if (!sc_1)\n file_1.ondata(null, et, true);\n else {\n var ctr = _this.o[cmp_1];\n if (!ctr)\n file_1.ondata(err(14, 'unknown compression type ' + cmp_1, 1), null, false);\n d_1 = sc_1 < 0 ? new ctr(fn_1) : new ctr(fn_1, sc_1, su_1);\n d_1.ondata = function (err, dat, final) { file_1.ondata(err, dat, final); };\n for (var _i = 0, chks_4 = chks_3; _i < chks_4.length; _i++) {\n var dat = chks_4[_i];\n d_1.push(dat, false);\n }\n if (_this.k[0] == chks_3 && _this.c)\n _this.d = d_1;\n else\n d_1.push(et, true);\n }\n },\n terminate: function () {\n if (d_1 && d_1.terminate)\n d_1.terminate();\n }\n };\n if (sc_1 >= 0)\n file_1.size = sc_1, file_1.originalSize = su_1;\n this_1.onfile(file_1);\n }\n return \"break\";\n }\n else if (oc) {\n if (sig == 0x8074B50) {\n is = i += 12 + (oc == -2 && 8), f = 3, this_1.c = 0;\n return \"break\";\n }\n else if (sig == 0x2014B50) {\n is = i -= 4, f = 3, this_1.c = 0;\n return \"break\";\n }\n }\n };\n var this_1 = this;\n for (; i < l - 4; ++i) {\n var state_1 = _loop_2();\n if (state_1 === \"break\")\n break;\n }\n this.p = et;\n if (oc < 0) {\n var dat = f ? buf.subarray(0, is - 12 - (oc == -2 && 8) - (b4(buf, is - 16) == 0x8074B50 && 4)) : buf.subarray(0, i);\n if (add)\n add.push(dat, !!f);\n else\n this.k[+(f == 2)].push(dat);\n }\n if (f & 2)\n return this.push(buf.subarray(i), final);\n this.p = buf.subarray(i);\n }\n if (final) {\n if (this.c)\n err(13);\n this.p = null;\n }\n };\n /**\n * Registers a decoder with the stream, allowing for files compressed with\n * the compression type provided to be expanded correctly\n * @param decoder The decoder constructor\n */\n Unzip.prototype.register = function (decoder) {\n this.o[decoder.compression] = decoder;\n };\n return Unzip;\n}());\nexport { Unzip };\nvar mt = typeof queueMicrotask == 'function' ? queueMicrotask : typeof setTimeout == 'function' ? setTimeout : function (fn) { fn(); };\nexport function unzip(data, opts, cb) {\n if (!cb)\n cb = opts, opts = {};\n if (typeof cb != 'function')\n err(7);\n var term = [];\n var tAll = function () {\n for (var i = 0; i < term.length; ++i)\n term[i]();\n };\n var files = {};\n var cbd = function (a, b) {\n mt(function () { cb(a, b); });\n };\n mt(function () { cbd = cb; });\n var e = data.length - 22;\n for (; b4(data, e) != 0x6054B50; --e) {\n if (!e || data.length - e > 65558) {\n cbd(err(13, 0, 1), null);\n return tAll;\n }\n }\n ;\n var lft = b2(data, e + 8);\n if (lft) {\n var c = lft;\n var o = b4(data, e + 16);\n var z = b4(data, e - 20) == 0x7064B50;\n if (z) {\n var ze = b4(data, e - 12);\n z = b4(data, ze) == 0x6064B50;\n if (z) {\n c = lft = b4(data, ze + 32);\n o = b4(data, ze + 48);\n }\n }\n var fltr = opts && opts.filter;\n var _loop_3 = function (i) {\n var _a = zh(data, o, z), c_1 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n o = no;\n var cbl = function (e, d) {\n if (e) {\n tAll();\n cbd(e, null);\n }\n else {\n if (d)\n files[fn] = d;\n if (!--lft)\n cbd(null, files);\n }\n };\n if (!fltr || fltr({\n name: fn,\n size: sc,\n originalSize: su,\n compression: c_1\n })) {\n if (!c_1)\n cbl(null, slc(data, b, b + sc));\n else if (c_1 == 8) {\n var infl = data.subarray(b, b + sc);\n // Synchronously decompress under 512KB, or barely-compressed data\n if (su < 524288 || sc > 0.8 * su) {\n try {\n cbl(null, inflateSync(infl, { out: new u8(su) }));\n }\n catch (e) {\n cbl(e, null);\n }\n }\n else\n term.push(inflate(infl, { size: su }, cbl));\n }\n else\n cbl(err(14, 'unknown compression type ' + c_1, 1), null);\n }\n else\n cbl(null, null);\n };\n for (var i = 0; i < c; ++i) {\n _loop_3(i);\n }\n }\n else\n cbd(null, {});\n return tAll;\n}\n/**\n * Synchronously decompresses a ZIP archive. Prefer using `unzip` for better\n * performance with more than one file.\n * @param data The raw compressed ZIP file\n * @param opts The ZIP extraction options\n * @returns The decompressed files\n */\nexport function unzipSync(data, opts) {\n var files = {};\n var e = data.length - 22;\n for (; b4(data, e) != 0x6054B50; --e) {\n if (!e || data.length - e > 65558)\n err(13);\n }\n ;\n var c = b2(data, e + 8);\n if (!c)\n return {};\n var o = b4(data, e + 16);\n var z = b4(data, e - 20) == 0x7064B50;\n if (z) {\n var ze = b4(data, e - 12);\n z = b4(data, ze) == 0x6064B50;\n if (z) {\n c = b4(data, ze + 32);\n o = b4(data, ze + 48);\n }\n }\n var fltr = opts && opts.filter;\n for (var i = 0; i < c; ++i) {\n var _a = zh(data, o, z), c_2 = _a[0], sc = _a[1], su = _a[2], fn = _a[3], no = _a[4], off = _a[5], b = slzh(data, off);\n o = no;\n if (!fltr || fltr({\n name: fn,\n size: sc,\n originalSize: su,\n compression: c_2\n })) {\n if (!c_2)\n files[fn] = slc(data, b, b + sc);\n else if (c_2 == 8)\n files[fn] = inflateSync(data.subarray(b, b + sc), { out: new u8(su) });\n else\n err(14, 'unknown compression type ' + c_2);\n }\n }\n return files;\n}\n"],"x_google_ignoreList":[0],"mappings":";AASA,IAAI,IAAM,EAAE,EACR,KAAM,SAAU,GAAG,GAAI,GAAK,GAAU,GAAI;CAC1C,IAAI,IAAI,IAAI,OAAO,EAAI,OAAQ,EAAI,KAAM,IAAI,gBAAgB,IAAI,KAAK,CAClE,IAAI,oGACP,EAAE,EAAE,MAAM,mBAAmB,CAAC,CAAC,EAAE;AAalC,QAZA,EAAE,YAAY,SAAU,GAAG;EACvB,IAAI,IAAI,EAAE,MAAM,IAAK,EAAE;AACvB,MAAI,GAAI;GACJ,IAAI,IAAU,MAAM,EAAG,GAAG;AAG1B,GAFA,EAAI,OAAU,EAAG,IACjB,EAAI,QAAQ,EAAG,IACf,EAAG,GAAK,KAAK;QAGb,GAAG,MAAM,EAAE;IAEnB,EAAE,YAAY,GAAK,EAAS,EACrB;IAIP,IAAK,YAAY,IAAM,aAAa,IAAM,YAE1C,IAAO,IAAI,EAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAgB;CAAG;CAAoB;CAAE,CAAC,EAE7I,IAAO,IAAI,EAAG;CAAC;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAI;CAAiB;CAAG;CAAE,CAAC,EAEpI,IAAO,IAAI,EAAG;CAAC;CAAI;CAAI;CAAI;CAAG;CAAG;CAAG;CAAG;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAI;CAAG;CAAG,CAAC,EAEjF,IAAO,SAAU,GAAI,GAAO;AAE5B,MAAK,IADD,IAAI,IAAI,EAAI,GAAG,EACV,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,GAAE,KAAK,KAAS,KAAK,EAAG,IAAI;AAIhC,MAAK,IADD,IAAI,IAAI,EAAI,EAAE,IAAI,EACb,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,MAAK,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,EAC/B,GAAE,KAAO,IAAI,EAAE,MAAO,IAAK;AAGnC,QAAO;EAAK;EAAM;EAAG;GAErB,IAAK,EAAK,GAAM,EAAE,EAAE,IAAK,EAAG,GAAG,IAAQ,EAAG;AAE9C,EAAG,MAAM,KAAK,EAAM,OAAO;AAC3B,IAAI,IAAK,EAAK,GAAM,EAAE;AAAO,EAAG;AAGhC,KAAK,IAH8B,IAAQ,EAAG,GAE1C,IAAM,IAAI,EAAI,MAAM,EACf,IAAI,GAAG,IAAI,OAAO,EAAE,GAAG;CAE5B,IAAI,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW;AAG/C,CAFA,KAAM,IAAI,UAAW,KAAO,IAAI,UAAW,GAC3C,KAAM,IAAI,UAAW,KAAO,IAAI,SAAW,GAC3C,EAAI,OAAQ,IAAI,UAAW,KAAO,IAAI,QAAW,MAAO;;AAwD5D,KAAK,IAnDD,KAAQ,SAAU,GAAI,GAAI,GAAG;AAO7B,MANA,IAAI,IAAI,EAAG,QAEP,IAAI,GAEJ,IAAI,IAAI,EAAI,EAAG,EAEZ,IAAI,GAAG,EAAE,EACZ,CAAI,EAAG,MACH,EAAE,EAAE,EAAG,KAAK;CAGpB,IAAI,IAAK,IAAI,EAAI,EAAG;AACpB,MAAK,IAAI,GAAG,IAAI,GAAI,EAAE,EAClB,GAAG,KAAM,EAAG,IAAI,KAAK,EAAE,IAAI,MAAO;CAEtC,IAAI;AACJ,KAAI,GAAG;AAEH,MAAK,IAAI,EAAI,KAAK,EAAG;EAErB,IAAI,IAAM,KAAK;AACf,OAAK,IAAI,GAAG,IAAI,GAAG,EAAE,EAEjB,KAAI,EAAG,GAQH,MAAK,IAND,IAAM,KAAK,IAAK,EAAG,IAEnB,IAAM,IAAK,EAAG,IAEd,IAAI,EAAG,EAAG,KAAK,QAAQ,GAElB,IAAI,KAAM,KAAK,KAAO,GAAI,KAAK,GAAG,EAAE,EAEzC,GAAG,EAAI,MAAM,KAAO;OAOhC,MADA,IAAK,IAAI,EAAI,EAAE,EACV,IAAI,GAAG,IAAI,GAAG,EAAE,EACjB,CAAI,EAAG,OACH,EAAG,KAAK,EAAI,EAAG,EAAG,KAAK,SAAU,KAAK,EAAG;AAIrD,QAAO;IAGP,IAAM,IAAI,EAAG,IAAI,EACZ,IAAI,GAAG,IAAI,KAAK,EAAE,EACvB,GAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,GAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,GAAI,KAAK;AACb,KAAK,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,EACzB,GAAI,KAAK;AAGb,KAAK,IADD,IAAM,IAAI,EAAG,GAAG,EACX,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,GAAI,KAAK;AAEb,IAAI,IAAoB,kBAAK,GAAK,GAAG,EAAE,EAEnC,IAAoB,kBAAK,GAAK,GAAG,EAAE,EAqBnC,IAAO,SAAU,GAAG;AAAE,SAAS,IAAI,KAAK,IAAK;GAG7C,IAAM,SAAU,GAAG,GAAG,GAAG;AAMzB,SALI,KAAK,QAAQ,IAAI,OACjB,IAAI,KACJ,KAAK,QAAQ,IAAI,EAAE,YACnB,IAAI,EAAE,SAEH,IAAI,EAAG,EAAE,SAAS,GAAG,EAAE,CAAC;GAuB/B,IAAK;CACL;CACA;CACA;CACA;CACA;CACA;;CAEA;CACA;CACA;CACA;CACA;CACA;CACA;CAEH,EAEG,IAAM,SAAU,GAAK,GAAK,GAAI;CAC9B,IAAI,IAAQ,MAAM,KAAO,EAAG,GAAK;AAIjC,KAHA,EAAE,OAAO,GACL,MAAM,qBACN,MAAM,kBAAkB,GAAG,EAAI,EAC/B,CAAC,EACD,OAAM;AACV,QAAO;GAwLP,IAAQ,SAAU,GAAG,GAAG,GAAG;AAC3B,OAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;AAElB,CADA,EAAE,MAAM,GACR,EAAE,IAAI,MAAM,KAAK;GAGjB,IAAU,SAAU,GAAG,GAAG,GAAG;AAC7B,OAAM,IAAI;CACV,IAAI,IAAK,IAAI,IAAK;AAGlB,CAFA,EAAE,MAAM,GACR,EAAE,IAAI,MAAM,KAAK,GACjB,EAAE,IAAI,MAAM,KAAK;GAGjB,IAAQ,SAAU,GAAG,GAAI;AAGzB,MAAK,IADD,IAAI,EAAE,EACD,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC5B,CAAI,EAAE,MACF,EAAE,KAAK;EAAE,GAAG;EAAG,GAAG,EAAE;EAAI,CAAC;CAEjC,IAAI,IAAI,EAAE,QACN,IAAK,EAAE,OAAO;AAClB,KAAI,CAAC,EACD,QAAO;EAAE,GAAG;EAAI,GAAG;EAAG;AAC1B,KAAI,KAAK,GAAG;EACR,IAAI,IAAI,IAAI,EAAG,EAAE,GAAG,IAAI,EAAE;AAE1B,SADA,EAAE,EAAE,GAAG,KAAK,GACL;GAAE,GAAG;GAAG,GAAG;GAAG;;AAKzB,CAHA,EAAE,KAAK,SAAU,GAAG,GAAG;AAAE,SAAO,EAAE,IAAI,EAAE;GAAK,EAG7C,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG;EAAO,CAAC;CAC3B,IAAI,IAAI,EAAE,IAAI,IAAI,EAAE,IAAI,IAAK,GAAG,IAAK,GAAG,IAAK;AAO7C,MANA,EAAE,KAAK;EAAE,GAAG;EAAI,GAAG,EAAE,IAAI,EAAE;EAAM;EAAM;EAAG,EAMnC,KAAM,IAAI,GAGb,CAFA,IAAI,EAAE,EAAE,GAAI,IAAI,EAAE,GAAI,IAAI,MAAO,MACjC,IAAI,EAAE,KAAM,KAAM,EAAE,GAAI,IAAI,EAAE,GAAI,IAAI,MAAO,MAC7C,EAAE,OAAQ;EAAE,GAAG;EAAI,GAAG,EAAE,IAAI,EAAE;EAAM;EAAM;EAAG;AAGjD,MAAK,IADD,IAAS,EAAG,GAAG,GACV,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,CAAI,EAAG,GAAG,IAAI,MACV,IAAS,EAAG,GAAG;CAGvB,IAAI,IAAK,IAAI,EAAI,IAAS,EAAE,EAExB,IAAM,EAAG,EAAE,IAAK,IAAI,GAAI,EAAE;AAC9B,KAAI,IAAM,GAAI;EAIV,IAAI,IAAI,GAAG,IAAK,GAEZ,IAAM,IAAM,GAAI,IAAM,KAAK;AAE/B,OADA,EAAG,KAAK,SAAU,GAAG,GAAG;AAAE,UAAO,EAAG,EAAE,KAAK,EAAG,EAAE,MAAM,EAAE,IAAI,EAAE;IAAK,EAC5D,IAAI,GAAG,EAAE,GAAG;GACf,IAAI,IAAO,EAAG,GAAG;AACjB,OAAI,EAAG,KAAQ,EAEX,CADA,KAAM,KAAO,KAAM,IAAM,EAAG,KAC5B,EAAG,KAAQ;OAGX;;AAGR,OADA,MAAO,GACA,IAAK,IAAG;GACX,IAAI,IAAO,EAAG,GAAG;AACjB,GAAI,EAAG,KAAQ,IACX,KAAM,KAAM,IAAK,EAAG,OAAU,IAE9B,EAAE;;AAEV,SAAO,KAAK,KAAK,GAAI,EAAE,GAAG;GACtB,IAAI,IAAO,EAAG,GAAG;AACjB,GAAI,EAAG,MAAS,MACZ,EAAE,EAAG,IACL,EAAE;;AAGV,MAAM;;AAEV,QAAO;EAAE,GAAG,IAAI,EAAG,EAAG;EAAE,GAAG;EAAK;GAGhC,IAAK,SAAU,GAAG,GAAG,GAAG;AACxB,QAAO,EAAE,KAAK,KACR,KAAK,IAAI,EAAG,EAAE,GAAG,GAAG,IAAI,EAAE,EAAE,EAAG,EAAE,GAAG,GAAG,IAAI,EAAE,CAAC,GAC7C,EAAE,EAAE,KAAK;GAGhB,IAAK,SAAU,GAAG;AAGlB,MAFA,IAAI,IAAI,EAAE,QAEH,KAAK,CAAC,EAAE,EAAE;AAMjB,MAAK,IAJD,IAAK,IAAI,EAAI,EAAE,EAAE,EAEjB,IAAM,GAAG,IAAM,EAAE,IAAI,IAAM,GAC3B,IAAI,SAAU,GAAG;AAAE,IAAG,OAAS;IAC1B,IAAI,GAAG,KAAK,GAAG,EAAE,EACtB,KAAI,EAAE,MAAM,KAAO,KAAK,EACpB,GAAE;MACD;AACD,MAAI,CAAC,KAAO,IAAM,GAAG;AACjB,UAAO,IAAM,KAAK,KAAO,IACrB,GAAE,MAAM;AACZ,GAAI,IAAM,MACN,EAAE,IAAM,KAAO,IAAM,MAAO,IAAK,QAAU,IAAM,KAAM,IAAK,MAAM,EAClE,IAAM;aAGL,IAAM,GAAG;AAEd,QADA,EAAE,EAAI,EAAE,EAAE,GACH,IAAM,GAAG,KAAO,EACnB,GAAE,KAAK;AACX,GAAI,IAAM,MACN,EAAI,IAAM,KAAM,IAAK,KAAK,EAAE,IAAM;;AAE1C,SAAO,KACH,GAAE,EAAI;AAEV,EADA,IAAM,GACN,IAAM,EAAE;;AAGhB,QAAO;EAAE,GAAG,EAAG,SAAS,GAAG,EAAI;EAAE,GAAG;EAAG;GAGvC,IAAO,SAAU,GAAI,GAAI;AAEzB,MAAK,IADD,IAAI,GACC,IAAI,GAAG,IAAI,EAAG,QAAQ,EAAE,EAC7B,MAAK,EAAG,KAAK,EAAG;AACpB,QAAO;GAIP,KAAQ,SAAU,GAAK,GAAK,GAAK;CAEjC,IAAI,IAAI,EAAI,QACR,IAAI,EAAK,IAAM,EAAE;AAIrB,CAHA,EAAI,KAAK,IAAI,KACb,EAAI,IAAI,KAAK,KAAK,GAClB,EAAI,IAAI,KAAK,EAAI,KAAK,KACtB,EAAI,IAAI,KAAK,EAAI,IAAI,KAAK;AAC1B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,GAAI,IAAI,IAAI,KAAK,EAAI;AACzB,SAAQ,IAAI,IAAI,KAAK;GAGrB,IAAO,SAAU,GAAK,GAAK,GAAO,GAAM,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAG;AAEnE,CADA,EAAM,GAAK,KAAK,EAAM,EACtB,EAAE,EAAG;AAML,MAAK,IALD,IAAK,EAAM,GAAI,GAAG,EAAE,IAAM,EAAG,GAAG,IAAM,EAAG,GACzC,IAAK,EAAM,GAAI,GAAG,EAAE,IAAM,EAAG,GAAG,IAAM,EAAG,GACzC,IAAK,EAAG,EAAI,EAAE,IAAO,EAAG,GAAG,KAAM,EAAG,GACpC,IAAK,EAAG,EAAI,EAAE,IAAO,EAAG,GAAG,IAAM,EAAG,GACpC,IAAS,IAAI,EAAI,GAAG,EACf,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,EAC/B,GAAE,EAAO,EAAK,KAAK;AACvB,MAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,EAC/B,GAAE,EAAO,EAAK,KAAK;AAGvB,MAFA,IAAI,IAAK,EAAM,GAAQ,EAAE,EAAE,IAAM,EAAG,GAAG,IAAO,EAAG,GAC7C,IAAO,IACJ,IAAO,KAAK,CAAC,EAAI,EAAK,IAAO,KAAK,EAAE;CAE3C,IAAI,IAAQ,IAAK,KAAM,GACnB,IAAQ,EAAK,GAAI,EAAI,GAAG,EAAK,GAAI,EAAI,GAAG,GACxC,IAAQ,EAAK,GAAI,EAAI,GAAG,EAAK,GAAI,EAAI,GAAG,IAAK,KAAK,IAAI,IAAO,EAAK,GAAQ,EAAI,GAAG,IAAI,EAAO,MAAM,IAAI,EAAO,MAAM,IAAI,EAAO;AAClI,KAAI,KAAM,KAAK,KAAQ,KAAS,KAAQ,EACpC,QAAO,GAAM,GAAK,GAAG,EAAI,SAAS,GAAI,IAAK,EAAG,CAAC;CACnD,IAAI,GAAI,GAAI,GAAI;AAEhB,KADA,EAAM,GAAK,GAAG,KAAK,IAAQ,GAAO,EAAE,KAAK,GACrC,IAAQ,GAAO;AACf,MAAK,EAAK,GAAK,GAAK,EAAE,EAAE,IAAK,GAAK,IAAK,EAAK,GAAK,GAAK,EAAE,EAAE,IAAK;EAC/D,IAAI,KAAM,EAAK,GAAK,GAAM,EAAE;AAI5B,EAHA,EAAM,GAAK,GAAG,KAAM,IAAI,EACxB,EAAM,GAAK,IAAI,GAAG,IAAM,EAAE,EAC1B,EAAM,GAAK,IAAI,IAAI,IAAO,EAAE,EAC5B,KAAK;AACL,OAAK,IAAI,IAAI,GAAG,IAAI,GAAM,EAAE,EACxB,GAAM,GAAK,IAAI,IAAI,GAAG,EAAI,EAAK,IAAI;AACvC,OAAK,IAAI;AAET,OAAK,IADD,KAAO,CAAC,GAAM,EAAK,EACd,IAAK,GAAG,IAAK,GAAG,EAAE,EAEvB,MAAK,IADD,IAAO,GAAK,IACP,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,GAAG;GAClC,IAAI,IAAM,EAAK,KAAK;AAEpB,GADA,EAAM,GAAK,GAAG,GAAI,GAAK,EAAE,KAAK,EAAI,IAC9B,IAAM,OACN,EAAM,GAAK,GAAI,EAAK,MAAM,IAAK,IAAI,EAAE,KAAK,EAAK,MAAM;;OAKjE,KAAK,GAAK,IAAK,GAAK,IAAK,GAAK,IAAK;AAEvC,MAAK,IAAI,IAAI,GAAG,IAAI,GAAI,EAAE,GAAG;EACzB,IAAI,IAAM,EAAK;AACf,MAAI,IAAM,KAAK;GACX,IAAI,IAAO,KAAO,KAAM;AAExB,GADA,EAAQ,GAAK,GAAG,EAAG,IAAM,KAAK,EAAE,KAAK,EAAG,IAAM,MAC1C,IAAM,MACN,EAAM,GAAK,GAAI,KAAO,KAAM,GAAG,EAAE,KAAK,EAAK;GAC/C,IAAI,IAAM,IAAM;AAEhB,GADA,EAAQ,GAAK,GAAG,EAAG,GAAK,EAAE,KAAK,EAAG,IAC9B,IAAM,MACN,EAAQ,GAAK,GAAI,KAAO,IAAK,KAAK,EAAE,KAAK,EAAK;QAGlD,GAAQ,GAAK,GAAG,EAAG,GAAK,EAAE,KAAK,EAAG;;AAI1C,QADA,EAAQ,GAAK,GAAG,EAAG,KAAK,EACjB,IAAI,EAAG;GAGd,qBAAoB,IAAI,EAAI;CAAC;CAAO;CAAQ;CAAQ;CAAQ;CAAQ;CAAS;CAAS;CAAS;CAAQ,CAAC,EAExG,oBAAmB,IAAI,EAAG,EAAE,EAE5B,IAAO,SAAU,GAAK,GAAK,GAAM,GAAK,GAAM,GAAI;CAChD,IAAI,IAAI,EAAG,KAAK,EAAI,QAChB,IAAI,IAAI,EAAG,IAAM,IAAI,KAAK,IAAI,KAAK,KAAK,IAAI,IAAK,IAAI,EAAK,EAE1D,IAAI,EAAE,SAAS,GAAK,EAAE,SAAS,EAAK,EACpC,IAAM,EAAG,GACT,KAAO,EAAG,KAAK,KAAK;AACxB,KAAI,GAAK;AACL,EAAI,MACA,EAAE,KAAK,EAAG,KAAK;AAenB,OAdA,IAAI,IAAM,GAAI,IAAM,IAChB,IAAI,KAAO,IAAI,IAAI,IAAM,MACzB,KAAS,KAAK,KAAQ,GAEtB,IAAO,EAAG,KAAK,IAAI,EAAI,MAAM,EAAE,IAAO,EAAG,KAAK,IAAI,EAAI,IAAQ,EAAE,EAChE,IAAQ,KAAK,KAAK,IAAO,EAAE,EAAE,IAAQ,IAAI,GACzC,IAAM,SAAU,GAAG;AAAE,WAAQ,EAAI,KAAM,EAAI,IAAI,MAAM,IAAU,EAAI,IAAI,MAAM,KAAU;KAGvF,IAAO,IAAI,EAAI,KAAM,EAErB,IAAK,IAAI,EAAI,IAAI,EAAE,IAAK,IAAI,EAAI,GAAG,EAEnC,IAAO,GAAG,IAAK,GAAG,IAAI,EAAG,KAAK,GAAG,IAAK,GAAG,IAAK,EAAG,KAAK,GAAG,IAAK,GAC3D,IAAI,IAAI,GAAG,EAAE,GAAG;GAEnB,IAAI,IAAK,EAAI,EAAE,EAEX,IAAO,IAAI,OAAO,IAAQ,EAAK;AAKnC,OAJA,EAAK,KAAQ,GACb,EAAK,KAAM,GAGP,KAAM,GAAG;IAET,IAAI,IAAM,IAAI;AACd,SAAK,IAAO,OAAQ,IAAK,WAAW,IAAM,OAAO,CAAC,IAAM;AAEpD,KADA,IAAM,EAAK,GAAK,GAAG,GAAG,GAAM,GAAI,GAAI,GAAI,GAAI,GAAI,IAAI,GAAI,EAAI,EAC5D,IAAK,IAAO,IAAK,GAAG,IAAK;AACzB,UAAK,IAAI,IAAI,GAAG,IAAI,KAAK,EAAE,EACvB,GAAG,KAAK;AACZ,UAAK,IAAI,IAAI,GAAG,IAAI,IAAI,EAAE,EACtB,GAAG,KAAK;;IAGhB,IAAI,IAAI,GAAG,IAAI,GAAG,IAAO,GAAG,IAAM,IAAO,IAAQ;AACjD,QAAI,IAAM,KAAK,KAAM,EAAI,IAAI,EAAI,CAM7B,MALA,IAAI,IAAO,KAAK,IAAI,GAAG,EAAI,GAAG,GAC1B,KAAO,KAAK,IAAI,OAAO,EAAE,EAGzB,KAAK,KAAK,IAAI,KAAK,EAAI,EACpB,KAAO,MAAQ,EAAE,KAAQ,KAAQ,IAAO;AAC3C,SAAI,EAAI,IAAI,MAAM,EAAI,IAAI,IAAI,IAAM;AAEhC,WADA,IAAI,IAAK,GACF,IAAK,MAAM,EAAI,IAAI,MAAO,EAAI,IAAI,IAAK,IAAM,EAAE;AAEtD,UAAI,IAAK,GAAG;AAGR,WAFA,IAAI,GAAI,IAAI,GAER,IAAK,EACL;AAMJ,YAAK,IAFD,IAAM,KAAK,IAAI,GAAK,IAAK,EAAE,EAC3B,IAAK,GACA,IAAI,GAAG,IAAI,GAAK,EAAE,GAAG;QAC1B,IAAI,IAAK,IAAI,IAAM,IAAI,OAEnB,IAAK,IADC,EAAK,KACK;AACpB,QAAI,IAAK,MACL,IAAK,GAAI,IAAQ;;;;AAMjC,KADA,IAAO,GAAO,IAAQ,EAAK,IAC3B,KAAO,IAAO,IAAQ;;AAI9B,QAAI,GAAG;AAGH,OAAK,OAAQ,YAAa,EAAM,MAAM,KAAM,EAAM;KAClD,IAAI,KAAM,EAAM,KAAK,IAAI,KAAM,EAAM,KAAK;AAK1C,KAJA,KAAM,EAAK,MAAO,EAAK,KACvB,EAAE,EAAG,MAAM,KACX,EAAE,EAAG,KACL,IAAK,IAAI,GACT,EAAE;UAIF,CADA,EAAK,OAAQ,EAAI,IACjB,EAAE,EAAG,EAAI;;;AAIrB,OAAK,IAAI,KAAK,IAAI,GAAG,EAAG,EAAE,IAAI,GAAG,EAAE,EAE/B,CADA,EAAK,OAAQ,EAAI,IACjB,EAAE,EAAG,EAAI;AAGb,EADA,IAAM,EAAK,GAAK,GAAG,GAAK,GAAM,GAAI,GAAI,GAAI,GAAI,GAAI,IAAI,GAAI,EAAI,EACzD,MACD,EAAG,IAAK,IAAM,IAAK,EAAG,IAAM,IAAK,MAAM,GAEvC,KAAO,GACP,EAAG,IAAI,GAAM,EAAG,IAAI,GAAM,EAAG,IAAI,GAAG,EAAG,IAAI;QAG9C;AACD,OAAK,IAAI,IAAI,EAAG,KAAK,GAAG,IAAI,IAAI,GAAK,KAAK,OAAO;GAE7C,IAAI,KAAI,IAAI;AAMZ,GALI,MAAK,MAEL,EAAG,IAAM,IAAK,KAAK,GACnB,KAAI,IAER,IAAM,GAAM,GAAG,IAAM,GAAG,EAAI,SAAS,GAAG,GAAE,CAAC;;AAE/C,IAAG,IAAI;;AAEX,QAAO,EAAI,GAAG,GAAG,IAAM,EAAK,EAAI,GAAG,EAAK;GAGxC,IAAqB,iBAAC,WAAY;AAElC,MAAK,IADD,IAAI,IAAI,WAAW,IAAI,EAClB,IAAI,GAAG,IAAI,KAAK,EAAE,GAAG;AAE1B,OADA,IAAI,IAAI,GAAG,IAAI,GACR,EAAE,GACL,MAAM,IAAI,KAAM,cAAe,MAAM;AACzC,IAAE,KAAK;;AAEX,QAAO;IACP,EAEA,IAAM,WAAY;CAClB,IAAI,IAAI;AACR,QAAO;EACH,GAAG,SAAU,GAAG;AAGZ,QAAK,IADD,IAAK,GACA,IAAI,GAAG,IAAI,EAAE,QAAQ,EAAE,EAC5B,KAAK,EAAM,IAAK,MAAO,EAAE,MAAO,MAAO;AAC3C,OAAI;;EAER,GAAG,WAAY;AAAE,UAAO,CAAC;;EAC5B;GA0BD,IAAO,SAAU,GAAK,GAAK,GAAK,GAAM,GAAI;AAC1C,KAAI,CAAC,MACD,IAAK,EAAE,GAAG,GAAG,EACT,EAAI,aAAY;EAChB,IAAI,IAAO,EAAI,WAAW,SAAS,OAAO,EACtC,IAAS,IAAI,EAAG,EAAK,SAAS,EAAI,OAAO;AAI7C,EAHA,EAAO,IAAI,EAAK,EAChB,EAAO,IAAI,GAAK,EAAK,OAAO,EAC5B,IAAM,GACN,EAAG,IAAI,EAAK;;AAGpB,QAAO,EAAK,GAAK,EAAI,SAAS,OAAO,IAAI,EAAI,OAAO,EAAI,OAAO,OAAQ,EAAG,IAAI,KAAK,KAAK,KAAK,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,IAAI,EAAI,OAAO,CAAC,CAAC,GAAG,IAAI,GAAG,KAAO,KAAK,EAAI,KAAM,GAAK,GAAM,EAAG;GAGrL,IAAM,SAAU,GAAG,GAAG;CACtB,IAAI,IAAI,EAAE;AACV,MAAK,IAAI,KAAK,EACV,GAAE,KAAK,EAAE;AACb,MAAK,IAAI,KAAK,EACV,GAAE,KAAK,EAAE;AACb,QAAO;GASP,IAAO,SAAU,GAAI,GAAO,GAAI;AAIhC,MAAK,IAHD,IAAK,GAAI,EACT,IAAK,EAAG,UAAU,EAClB,IAAK,EAAG,MAAM,EAAG,QAAQ,IAAI,GAAG,GAAG,EAAG,YAAY,IAAI,CAAC,CAAC,QAAQ,QAAQ,GAAG,CAAC,MAAM,IAAI,EACjF,IAAI,GAAG,IAAI,EAAG,QAAQ,EAAE,GAAG;EAChC,IAAI,IAAI,EAAG,IAAI,IAAI,EAAG;AACtB,MAAI,OAAO,KAAK,YAAY;AACxB,QAAS,MAAM,IAAI;GACnB,IAAI,IAAO,EAAE,UAAU;AACvB,OAAI,EAAE,UAEF,KAAI,EAAK,QAAQ,gBAAgB,IAAI,IAAI;IACrC,IAAI,IAAQ,EAAK,QAAQ,KAAK,EAAE,GAAG;AACnC,SAAS,EAAK,MAAM,GAAO,EAAK,QAAQ,KAAK,EAAM,CAAC;SAIpD,MAAK,IAAI,KADT,KAAS,GACK,EAAE,UACZ,MAAS,MAAM,IAAI,gBAAgB,IAAI,MAAM,EAAE,UAAU,GAAG,UAAU;OAI9E,MAAS;QAGb,GAAG,KAAK;;AAEhB,QAAO;GAEP,IAAK,EAAE,EAEP,IAAO,SAAU,GAAG;CACpB,IAAI,IAAK,EAAE;AACX,MAAK,IAAI,KAAK,EACV,CAAI,EAAE,GAAG,UACL,EAAG,MAAM,EAAE,KAAK,IAAI,EAAE,GAAG,YAAY,EAAE,GAAG,EAAE,OAAO;AAG3D,QAAO;GAGP,IAAO,SAAU,GAAK,GAAM,GAAI,GAAI;AACpC,KAAI,CAAC,EAAG,IAAK;AAET,OAAK,IADD,IAAQ,IAAI,IAAO,EAAE,EAAE,IAAI,EAAI,SAAS,GACnC,IAAI,GAAG,IAAI,GAAG,EAAE,EACrB,KAAQ,EAAK,EAAI,IAAI,GAAO,EAAK;AACrC,IAAG,KAAM;GAAE,GAAG,EAAK,EAAI,IAAI,GAAO,EAAK;GAAE,GAAG;GAAM;;CAEtD,IAAI,IAAK,EAAI,EAAE,EAAE,EAAG,GAAI,EAAE;AAC1B,QAAO,EAAG,EAAG,GAAI,IAAI,4EAA4E,EAAK,UAAU,GAAG,KAAK,GAAI,GAAI,EAAK,EAAG,EAAE,EAAG;GAI7I,IAAQ,WAAY;AAAE,QAAO;EAAC;EAAI;EAAK;EAAK;EAAM;EAAM;EAAM;EAAO;EAAO;EAAK;EAAK;EAAK;EAAK;EAAK;EAAK;EAAI;EAAM;EAAO;EAAS;EAAO;EAAI;EAAI;EAAM;EAAO;EAAM;EAAM;EAAK;EAAM;EAAM;EAAa;EAAI;GAU9M,IAAM,SAAU,GAAK;AAAE,QAAO,YAAY,GAAK,CAAC,EAAI,OAAO,CAAC;GAO5D,IAAQ,SAAU,GAAK,GAAM,GAAK,GAAM,GAAI,GAAI;CAChD,IAAI,IAAI,EAAK,GAAK,GAAM,GAAI,SAAU,GAAK,GAAK;AAE5C,EADA,EAAE,WAAW,EACb,EAAG,GAAK,EAAI;GACd;AAEF,QADA,EAAE,YAAY,CAAC,GAAK,EAAK,EAAE,EAAK,UAAU,CAAC,EAAI,OAAO,GAAG,EAAE,CAAC,EACrD,WAAY;AAAE,IAAE,WAAW;;GAwDlC,IAAS,SAAU,GAAG,GAAG,GAAG;AAC5B,QAAO,GAAG,EAAE,EACR,GAAE,KAAK,GAAG,OAAO;;AAuKzB,SAAgB,EAAQ,GAAM,GAAM,GAAI;AAKpC,QAJK,MACD,IAAK,GAAM,IAAO,EAAE,GACpB,OAAO,KAAM,cACb,EAAI,EAAE,EACH,EAAM,GAAM,GAAM,CACrB,EACH,EAAE,SAAU,GAAI;AAAE,SAAO,EAAI,EAAY,EAAG,KAAK,IAAI,EAAG,KAAK,GAAG,CAAC;IAAK,GAAG,EAAG;;AAQjF,SAAgB,EAAY,GAAM,GAAM;AACpC,QAAO,EAAK,GAAM,KAAQ,EAAE,EAAE,GAAG,EAAE;;AAmfvC,IAAI,KAAO,SAAU,GAAG,GAAG,GAAG,GAAG;AAC7B,MAAK,IAAI,KAAK,GAAG;EACb,IAAI,IAAM,EAAE,IAAI,IAAI,IAAI,GAAG,IAAK;AAGhC,EAFI,MAAM,QAAQ,EAAI,KAClB,IAAK,EAAI,GAAG,EAAI,GAAG,EAAE,IAAM,EAAI,KAC/B,YAAY,OAAO,EAAI,GACvB,EAAE,KAAK,CAAC,GAAK,EAAG,IAEhB,EAAE,KAAK,OAAO,CAAC,IAAI,EAAG,EAAE,EAAE,EAAG,EAC7B,GAAK,GAAK,GAAG,GAAG,EAAE;;GAK1B,KAAK,OAAO,cAAe,uBAA6B,IAAI,aAAa,EAEzE,IAAK,OAAO,cAAe,uBAA6B,IAAI,aAAa;AAG7E,IAAI;AACA,GAAG,OAAO,GAAI,EAAE,QAAQ,IAAM,CAAC;QAGzB;AAwGV,SAAgB,EAAQ,GAAK,GAAQ;AACjC,KAAI,GAAQ;AAER,OAAK,IADD,IAAO,IAAI,EAAG,EAAI,OAAO,EACpB,IAAI,GAAG,IAAI,EAAI,QAAQ,EAAE,EAC9B,GAAK,KAAK,EAAI,WAAW,EAAE;AAC/B,SAAO;;AAEX,KAAI,GACA,QAAO,GAAG,OAAO,EAAI;AAKzB,MAAK,IAJD,IAAI,EAAI,QACR,IAAK,IAAI,EAAG,EAAI,UAAU,EAAI,UAAU,GAAG,EAC3C,IAAK,GACL,IAAI,SAAU,GAAG;AAAE,IAAG,OAAQ;IACzB,IAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AACxB,MAAI,IAAK,IAAI,EAAG,QAAQ;GACpB,IAAI,IAAI,IAAI,EAAG,IAAK,KAAM,IAAI,KAAM,GAAG;AAEvC,GADA,EAAE,IAAI,EAAG,EACT,IAAK;;EAET,IAAI,IAAI,EAAI,WAAW,EAAE;AACzB,EAAI,IAAI,OAAO,IACX,EAAE,EAAE,GACC,IAAI,QACT,EAAE,MAAO,KAAK,EAAG,EAAE,EAAE,MAAO,IAAI,GAAI,IAC/B,IAAI,SAAS,IAAI,SACtB,IAAI,SAAS,IAAI,WAAe,EAAI,WAAW,EAAE,EAAE,GAAG,MAClD,EAAE,MAAO,KAAK,GAAI,EAAE,EAAE,MAAQ,KAAK,KAAM,GAAI,EAAE,EAAE,MAAQ,KAAK,IAAK,GAAI,EAAE,EAAE,MAAO,IAAI,GAAI,KAE9F,EAAE,MAAO,KAAK,GAAI,EAAE,EAAE,MAAQ,KAAK,IAAK,GAAI,EAAE,EAAE,MAAO,IAAI,GAAI;;AAEvE,QAAO,EAAI,GAAI,GAAG,EAAG;;AA2DzB,IAAI,IAAO,SAAU,GAAI;CACrB,IAAI,IAAK;AACT,KAAI,EACA,MAAK,IAAI,KAAK,GAAI;EACd,IAAI,IAAI,EAAG,GAAG;AAGd,EAFI,IAAI,SACJ,EAAI,EAAE,EACV,KAAM,IAAI;;AAGlB,QAAO;GAGP,IAAM,SAAU,GAAG,GAAG,GAAG,GAAI,GAAG,GAAG,GAAI,GAAI;CAC3C,IAAI,IAAK,EAAG,QAAQ,IAAK,EAAE,OAAO,IAAM,KAAM,EAAG,QAC7C,IAAM,EAAK,EAAG;AAMlB,CALA,EAAO,GAAG,GAAG,KAAM,OAAmB,WAAZ,SAAsB,EAAE,KAAK,GACnD,KAAM,SACN,EAAE,OAAO,IAAI,EAAE,OAAO,EAAE,KAC5B,EAAE,KAAK,IAAI,KAAK,GAChB,EAAE,OAAQ,EAAE,QAAQ,KAAM,IAAI,KAAK,IAAI,EAAE,OAAO,KAAK,GACrD,EAAE,OAAO,EAAE,cAAc,KAAK,EAAE,OAAO,EAAE,eAAe;CACxD,IAAI,IAAK,IAAI,KAAK,EAAE,SAAS,OAAO,KAAK,KAAK,GAAG,EAAE,MAAM,EAAE,IAAI,EAAG,aAAa,GAAG;AAkBlF,MAjBI,IAAI,KAAK,IAAI,QACb,EAAI,GAAG,EACX,EAAO,GAAG,GAAI,KAAK,KAAQ,EAAG,UAAU,GAAG,KAAM,KAAO,EAAG,SAAS,IAAI,KAAO,EAAG,UAAU,IAAI,KAAO,EAAG,YAAY,IAAI,IAAM,EAAG,YAAY,IAAI,EAAG,EAAE,KAAK,GACzJ,KAAK,OACL,EAAO,GAAG,GAAG,EAAE,IAAI,EACnB,EAAO,GAAG,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EACpC,EAAO,GAAG,IAAI,GAAG,EAAE,KAAK,GAE5B,EAAO,GAAG,IAAI,IAAI,EAAG,EACrB,EAAO,GAAG,IAAI,IAAI,EAAI,EAAE,KAAK,IACzB,KAAM,SACN,EAAO,GAAG,GAAG,EAAI,EACjB,EAAO,GAAG,IAAI,GAAG,EAAE,MAAM,EACzB,EAAO,GAAG,IAAI,IAAI,EAAG,EAAE,KAAK,KAEhC,EAAE,IAAI,GAAI,EAAE,EACZ,KAAK,GACD,EACA,MAAK,IAAI,KAAK,GAAI;EACd,IAAI,IAAM,EAAG,IAAI,IAAI,EAAI;AAGzB,EAFA,EAAO,GAAG,GAAG,CAAC,EAAE,EAChB,EAAO,GAAG,IAAI,GAAG,EAAE,EACnB,EAAE,IAAI,GAAK,IAAI,EAAE,EAAE,KAAK,IAAI;;AAKpC,QAFI,MACA,EAAE,IAAI,GAAI,EAAE,EAAE,KAAK,IAChB;GAGP,IAAM,SAAU,GAAG,GAAG,GAAG,GAAG,GAAG;AAK/B,CAJA,EAAO,GAAG,GAAG,UAAU,EACvB,EAAO,GAAG,IAAI,GAAG,EAAE,EACnB,EAAO,GAAG,IAAI,IAAI,EAAE,EACpB,EAAO,GAAG,IAAI,IAAI,EAAE,EACpB,EAAO,GAAG,IAAI,IAAI,EAAE;;AAiRxB,SAAgB,GAAI,GAAM,GAAM,GAAI;AAGhC,CAFK,MACD,IAAK,GAAM,IAAO,EAAE,GACpB,OAAO,KAAM,cACb,EAAI,EAAE;CACV,IAAI,IAAI,EAAE;AACV,IAAK,GAAM,IAAI,GAAG,EAAK;CACvB,IAAI,IAAI,OAAO,KAAK,EAAE,EAClB,IAAM,EAAE,QAAQ,IAAI,GAAG,IAAM,GAC7B,IAAO,GAAK,IAAY,MAAM,EAAI,EAClC,IAAO,EAAE,EACT,IAAO,WAAY;AACnB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAK,QAAQ,EAAE,EAC/B,GAAK,IAAI;IAEb,IAAM,SAAU,GAAG,GAAG;AACtB,KAAG,WAAY;AAAE,KAAG,GAAG,EAAE;IAAI;;AAEjC,IAAG,WAAY;AAAE,MAAM;GAAM;CAC7B,IAAI,IAAM,WAAY;EAClB,IAAI,IAAM,IAAI,EAAG,IAAM,GAAG,EAAE,IAAK,GAAG,IAAM,IAAM;AAChD,MAAM;AACN,OAAK,IAAI,IAAI,GAAG,IAAI,GAAM,EAAE,GAAG;GAC3B,IAAI,IAAI,EAAM;AACd,OAAI;IACA,IAAI,IAAI,EAAE,EAAE;AACZ,MAAI,GAAK,GAAK,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE;IAC7B,IAAI,IAAO,KAAK,EAAE,EAAE,SAAS,EAAK,EAAE,MAAM,EACtC,IAAM,IAAM;AAEhB,IADA,EAAI,IAAI,EAAE,GAAG,EAAI,EACjB,EAAI,GAAK,GAAG,GAAG,EAAE,GAAG,EAAE,GAAG,GAAG,GAAK,EAAE,EAAE,EAAE,KAAK,KAAK,KAAQ,EAAE,IAAI,EAAE,EAAE,SAAS,IAAI,IAAM,IAAM;YAEzF,GAAG;AACN,WAAO,EAAI,GAAG,KAAK;;;AAI3B,EADA,EAAI,GAAK,GAAG,EAAM,QAAQ,GAAK,EAAG,EAClC,EAAI,MAAM,EAAI;;AAElB,CAAK,KACD,GAAK;AAgDT,MAAK,IA/CD,IAAU,SAAU,GAAG;EACvB,IAAI,IAAK,EAAE,IACP,IAAK,EAAE,IAAK,IAAO,EAAG,IAAI,IAAI,EAAG,IACjC,IAAI,GAAK,EAAE,IAAO,EAAK;AAC3B,IAAE,EAAE,EAAK;EACT,IAAI,IAAI,EAAQ,EAAG,EAAE,IAAI,EAAE,QACvB,IAAM,EAAE,SAAS,IAAI,KAAO,EAAQ,EAAI,EAAE,IAAK,KAAK,EAAE,QACtD,IAAM,EAAK,EAAE,MAAM,EACnB,IAAc,EAAE,SAAS,IAAI,IAAI,GACjC,IAAM,SAAU,GAAG,GAAG;AACtB,OAAI,EAEA,CADA,GAAM,EACN,EAAI,GAAG,KAAK;QAEX;IACD,IAAI,IAAI,EAAE;AAYV,IAXA,EAAM,KAAK,EAAI,GAAG;KACR;KACN,KAAK,EAAE,GAAG;KACV,GAAG;KACA;KACA;KACH,GAAG,KAAK,EAAG,UAAW,KAAM,EAAI,UAAU;KAC7B;KAChB,CAAC,EACF,KAAK,KAAK,IAAI,IAAM,GACpB,KAAO,KAAK,KAAK,IAAI,MAAQ,KAAM,KAAK,GACnC,EAAE,KACH,GAAK;;;AAKjB,MAFI,IAAI,SACJ,EAAI,EAAI,IAAI,GAAG,EAAE,EAAE,KAAK,EACxB,CAAC,EACD,GAAI,MAAM,EAAK;WACV,IAAO,KACZ,KAAI;AACA,KAAI,MAAM,EAAY,GAAM,EAAE,CAAC;WAE5B,GAAG;AACN,KAAI,GAAG,KAAK;;MAIhB,GAAK,KAAK,EAAQ,GAAM,GAAG,EAAI,CAAC;IAG/B,IAAI,GAAG,IAAI,GAAM,EAAE,EACxB,GAAQ,EAAE;AAEd,QAAO;;AAgRX,IAAI,KAAK,OAAO,kBAAkB,aAAa,iBAAiB,OAAO,cAAc,aAAa,aAAa,SAAU,GAAI;AAAE,IAAI"}

package/dist/node_modules/internmap/src/index.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.js","names":[],"sources":["../../../../node_modules/internmap/src/index.js"],"sourcesContent":["export class InternMap extends Map {\n constructor(entries, key = keyof) {\n super();\n Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n if (entries != null) for (const [key, value] of entries) this.set(key, value);\n }\n get(key) {\n return super.get(intern_get(this, key));\n }\n has(key) {\n return super.has(intern_get(this, key));\n }\n set(key, value) {\n return super.set(intern_set(this, key), value);\n }\n delete(key) {\n return super.delete(intern_delete(this, key));\n }\n}\n\nexport class InternSet extends Set {\n constructor(values, key = keyof) {\n super();\n Object.defineProperties(this, {_intern: {value: new Map()}, _key: {value: key}});\n if (values != null) for (const value of values) this.add(value);\n }\n has(value) {\n return super.has(intern_get(this, value));\n }\n add(value) {\n return super.add(intern_set(this, value));\n }\n delete(value) {\n return super.delete(intern_delete(this, value));\n }\n}\n\nfunction intern_get({_intern, _key}, value) {\n const key = _key(value);\n return _intern.has(key) ? _intern.get(key) : value;\n}\n\nfunction intern_set({_intern, _key}, value) {\n const key = _key(value);\n if (_intern.has(key)) return _intern.get(key);\n _intern.set(key, value);\n return value;\n}\n\nfunction intern_delete({_intern, _key}, value) {\n const key = _key(value);\n if (_intern.has(key)) {\n value = _intern.get(key);\n _intern.delete(key);\n }\n return value;\n}\n\nfunction keyof(value) {\n return value !== null && typeof value === \"object\" ? value.valueOf() : value;\n}\n"],"x_google_ignoreList":[0],"mappings":";AAAA,IAAa,IAAb,cAA+B,IAAI;CACjC,YAAY,GAAS,IAAM,GAAO;AAGhC,MAFA,OAAO,EACP,OAAO,iBAAiB,MAAM;GAAC,SAAS,EAAC,uBAAO,IAAI,KAAK,EAAC;GAAE,MAAM,EAAC,OAAO,GAAI;GAAC,CAAC,EAC5E,KAAW,KAAM,MAAK,IAAM,CAAC,GAAK,MAAU,EAAS,MAAK,IAAI,GAAK,EAAM;;CAE/E,IAAI,GAAK;AACP,SAAO,MAAM,IAAI,EAAW,MAAM,EAAI,CAAC;;CAEzC,IAAI,GAAK;AACP,SAAO,MAAM,IAAI,EAAW,MAAM,EAAI,CAAC;;CAEzC,IAAI,GAAK,GAAO;AACd,SAAO,MAAM,IAAI,EAAW,MAAM,EAAI,EAAE,EAAM;;CAEhD,OAAO,GAAK;AACV,SAAO,MAAM,OAAO,EAAc,MAAM,EAAI,CAAC;;;AAqBjD,SAAS,EAAW,EAAC,YAAS,WAAO,GAAO;CAC1C,IAAM,IAAM,EAAK,EAAM;AACvB,QAAO,EAAQ,IAAI,EAAI,GAAG,EAAQ,IAAI,EAAI,GAAG;;AAG/C,SAAS,EAAW,EAAC,YAAS,WAAO,GAAO;CAC1C,IAAM,IAAM,EAAK,EAAM;AAGvB,QAFI,EAAQ,IAAI,EAAI,GAAS,EAAQ,IAAI,EAAI,IAC7C,EAAQ,IAAI,GAAK,EAAM,EAChB;;AAGT,SAAS,EAAc,EAAC,YAAS,WAAO,GAAO;CAC7C,IAAM,IAAM,EAAK,EAAM;AAKvB,QAJI,EAAQ,IAAI,EAAI,KAClB,IAAQ,EAAQ,IAAI,EAAI,EACxB,EAAQ,OAAO,EAAI,GAEd;;AAGT,SAAS,EAAM,GAAO;AACpB,QAAyB,OAAO,KAAU,YAAnC,IAA8C,EAAM,SAAS,GAAG"}