npm - @burdenoff/microfe-vibecontrols - Versions diffs - 2026.1008.2 → 2026.1010.2 - Mend

@burdenoff/microfe-vibecontrols 2026.1008.2 → 2026.1010.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (1983) 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/graphlib/index.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.js","names":[],"sources":["../../../node_modules/graphlib/index.js"],"sourcesContent":["/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n Graph: lib.Graph,\n json: require(\"./lib/json\"),\n alg: require(\"./lib/alg\"),\n version: lib.version\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CA8BA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;EACf,OAAO,EAAI;EACX,MAAA,GAAA;EACA,KAAA,GAAA;EACA,SAAS,EAAI;EACd"}

package/dist/node_modules/graphlib/lib/alg/components.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"components.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/components.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n var visited = {};\n var cmpts = [];\n var cmpt;\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n cmpt.push(v);\n _.each(g.successors(v), dfs);\n _.each(g.predecessors(v), dfs);\n }\n\n _.each(g.nodes(), function(v) {\n cmpt = [];\n dfs(v);\n if (cmpt.length) {\n cmpts.push(cmpt);\n }\n });\n\n return cmpts;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAW,GAAG;EACrB,IAAI,IAAU,EAAE,EACZ,IAAQ,EAAE,EACV;EAEJ,SAAS,EAAI,GAAG;AACV,KAAE,IAAI,GAAS,EAAE,KACrB,EAAQ,KAAK,IACb,EAAK,KAAK,EAAE,EACZ,EAAE,KAAK,EAAE,WAAW,EAAE,EAAE,EAAI,EAC5B,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,EAAI;;AAWhC,SARA,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG;AAG5B,GAFA,IAAO,EAAE,EACT,EAAI,EAAE,EACF,EAAK,UACP,EAAM,KAAK,EAAK;IAElB,EAEK"}

package/dist/node_modules/graphlib/lib/alg/dfs.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"dfs.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/dfs.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n if (!_.isArray(vs)) {\n vs = [vs];\n }\n\n var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n var acc = [];\n var visited = {};\n _.each(vs, function(v) {\n if (!g.hasNode(v)) {\n throw new Error(\"Graph does not have node: \" + v);\n }\n\n doDfs(g, v, order === \"post\", visited, navigation, acc);\n });\n return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n if (!_.has(visited, v)) {\n visited[v] = true;\n\n if (!postorder) { acc.push(v); }\n _.each(navigation(v), function(w) {\n doDfs(g, w, postorder, visited, navigation, acc);\n });\n if (postorder) { acc.push(v); }\n }\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAUjB,SAAS,EAAI,GAAG,GAAI,GAAO;AACzB,EAAK,EAAE,QAAQ,EAAG,KAChB,IAAK,CAAC,EAAG;EAGX,IAAI,KAAc,EAAE,YAAY,GAAG,EAAE,aAAa,EAAE,WAAW,KAAK,EAAE,EAElE,IAAM,EAAE,EACR,IAAU,EAAE;AAQhB,SAPA,EAAE,KAAK,GAAI,SAAS,GAAG;AACrB,OAAI,CAAC,EAAE,QAAQ,EAAE,CACf,OAAU,MAAM,+BAA+B,EAAE;AAGnD,KAAM,GAAG,GAAG,MAAU,QAAQ,GAAS,GAAY,EAAI;IACvD,EACK;;CAGT,SAAS,EAAM,GAAG,GAAG,GAAW,GAAS,GAAY,GAAK;AACxD,EAAK,EAAE,IAAI,GAAS,EAAE,KACpB,EAAQ,KAAK,IAER,KAAa,EAAI,KAAK,EAAE,EAC7B,EAAE,KAAK,EAAW,EAAE,EAAE,SAAS,GAAG;AAChC,KAAM,GAAG,GAAG,GAAW,GAAS,GAAY,EAAI;IAChD,EACE,KAAa,EAAI,KAAK,EAAE"}

package/dist/node_modules/graphlib/lib/alg/dijkstra-all.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"dijkstra-all.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/dijkstra-all.js"],"sourcesContent":["var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n return _.transform(g.nodes(), function(acc, v) {\n acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n }, {});\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAY,GAAG,GAAY,GAAU;AAC5C,SAAO,EAAE,UAAU,EAAE,OAAO,EAAE,SAAS,GAAK,GAAG;AAC7C,KAAI,KAAK,EAAS,GAAG,GAAG,GAAY,EAAS;KAC5C,EAAE,CAAC"}

package/dist/node_modules/graphlib/lib/alg/dijkstra.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"dijkstra.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/dijkstra.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n return runDijkstra(g, String(source),\n weightFn || DEFAULT_WEIGHT_FUNC,\n edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n var results = {};\n var pq = new PriorityQueue();\n var v, vEntry;\n\n var updateNeighbors = function(edge) {\n var w = edge.v !== v ? edge.v : edge.w;\n var wEntry = results[w];\n var weight = weightFn(edge);\n var distance = vEntry.distance + weight;\n\n if (weight < 0) {\n throw new Error(\"dijkstra does not allow negative edge weights. \" +\n \"Bad edge: \" + edge + \" Weight: \" + weight);\n }\n\n if (distance < wEntry.distance) {\n wEntry.distance = distance;\n wEntry.predecessor = v;\n pq.decrease(w, distance);\n }\n };\n\n g.nodes().forEach(function(v) {\n var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n results[v] = { distance: distance };\n pq.add(v, distance);\n });\n\n while (pq.size() > 0) {\n v = pq.removeMin();\n vEntry = results[v];\n if (vEntry.distance === Number.POSITIVE_INFINITY) {\n break;\n }\n\n edgeFn(v).forEach(updateNeighbors);\n }\n\n return results;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,IAAI,IAAsB,EAAE,SAAS,EAAE;CAEvC,SAAS,EAAS,GAAG,GAAQ,GAAU,GAAQ;AAC7C,SAAO,EAAY,GAAG,OAAO,EAAO,EAClC,KAAY,GACZ,KAAU,SAAS,GAAG;AAAE,UAAO,EAAE,SAAS,EAAE;IAAI;;CAGpD,SAAS,EAAY,GAAG,GAAQ,GAAU,GAAQ;EAChD,IAAI,IAAU,EAAE,EACZ,IAAK,IAAI,GAAe,EACxB,GAAG,GAEH,IAAkB,SAAS,GAAM;GACnC,IAAI,IAAI,EAAK,MAAM,IAAa,EAAK,IAAd,EAAK,GACxB,IAAS,EAAQ,IACjB,IAAS,EAAS,EAAK,EACvB,IAAW,EAAO,WAAW;AAEjC,OAAI,IAAS,EACX,OAAU,MAAM,8DACe,IAAO,cAAc,EAAO;AAG7D,GAAI,IAAW,EAAO,aACpB,EAAO,WAAW,GAClB,EAAO,cAAc,GACrB,EAAG,SAAS,GAAG,EAAS;;AAU5B,OANA,EAAE,OAAO,CAAC,QAAQ,SAAS,GAAG;GAC5B,IAAI,IAAW,MAAM,IAAS,IAAI;AAElC,GADA,EAAQ,KAAK,EAAY,aAAU,EACnC,EAAG,IAAI,GAAG,EAAS;IACnB,EAEK,EAAG,MAAM,GAAG,MACjB,IAAI,EAAG,WAAW,EAClB,IAAS,EAAQ,IACb,EAAO,aAAa,WAIxB,GAAO,EAAE,CAAC,QAAQ,EAAgB;AAGpC,SAAO"}

package/dist/node_modules/graphlib/lib/alg/find-cycles.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"find-cycles.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/find-cycles.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n return _.filter(tarjan(g), function(cmpt) {\n return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n });\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,OAAO,EAAO,EAAE,EAAE,SAAS,GAAM;AACxC,UAAO,EAAK,SAAS,KAAM,EAAK,WAAW,KAAK,EAAE,QAAQ,EAAK,IAAI,EAAK,GAAG;IAC3E"}

package/dist/node_modules/graphlib/lib/alg/floyd-warshall.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"floyd-warshall.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/floyd-warshall.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n return runFloydWarshall(g,\n weightFn || DEFAULT_WEIGHT_FUNC,\n edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n var results = {};\n var nodes = g.nodes();\n\n nodes.forEach(function(v) {\n results[v] = {};\n results[v][v] = { distance: 0 };\n nodes.forEach(function(w) {\n if (v !== w) {\n results[v][w] = { distance: Number.POSITIVE_INFINITY };\n }\n });\n edgeFn(v).forEach(function(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var d = weightFn(edge);\n results[v][w] = { distance: d, predecessor: v };\n });\n });\n\n nodes.forEach(function(k) {\n var rowK = results[k];\n nodes.forEach(function(i) {\n var rowI = results[i];\n nodes.forEach(function(j) {\n var ik = rowI[k];\n var kj = rowK[j];\n var ij = rowI[j];\n var altDistance = ik.distance + kj.distance;\n if (altDistance < ij.distance) {\n ij.distance = altDistance;\n ij.predecessor = kj.predecessor;\n }\n });\n });\n });\n\n return results;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,IAAI,IAAsB,EAAE,SAAS,EAAE;CAEvC,SAAS,EAAc,GAAG,GAAU,GAAQ;AAC1C,SAAO,EAAiB,GACtB,KAAY,GACZ,KAAU,SAAS,GAAG;AAAE,UAAO,EAAE,SAAS,EAAE;IAAI;;CAGpD,SAAS,EAAiB,GAAG,GAAU,GAAQ;EAC7C,IAAI,IAAU,EAAE,EACZ,IAAQ,EAAE,OAAO;AAkCrB,SAhCA,EAAM,QAAQ,SAAS,GAAG;AAQxB,GAPA,EAAQ,KAAK,EAAE,EACf,EAAQ,GAAG,KAAK,EAAE,UAAU,GAAG,EAC/B,EAAM,QAAQ,SAAS,GAAG;AACxB,IAAI,MAAM,MACR,EAAQ,GAAG,KAAK,EAAE,UAAU,UAA0B;KAExD,EACF,EAAO,EAAE,CAAC,QAAQ,SAAS,GAAM;IAC/B,IAAI,IAAI,EAAK,MAAM,IAAI,EAAK,IAAI,EAAK,GACjC,IAAI,EAAS,EAAK;AACtB,MAAQ,GAAG,KAAK;KAAE,UAAU;KAAG,aAAa;KAAG;KAC/C;IACF,EAEF,EAAM,QAAQ,SAAS,GAAG;GACxB,IAAI,IAAO,EAAQ;AACnB,KAAM,QAAQ,SAAS,GAAG;IACxB,IAAI,IAAO,EAAQ;AACnB,MAAM,QAAQ,SAAS,GAAG;KACxB,IAAI,IAAK,EAAK,IACV,IAAK,EAAK,IACV,IAAK,EAAK,IACV,IAAc,EAAG,WAAW,EAAG;AACnC,KAAI,IAAc,EAAG,aACnB,EAAG,WAAW,GACd,EAAG,cAAc,EAAG;MAEtB;KACF;IACF,EAEK"}

package/dist/node_modules/graphlib/lib/alg/index.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"index.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/index.js"],"sourcesContent":["module.exports = {\n components: require(\"./components\"),\n dijkstra: require(\"./dijkstra\"),\n dijkstraAll: require(\"./dijkstra-all\"),\n findCycles: require(\"./find-cycles\"),\n floydWarshall: require(\"./floyd-warshall\"),\n isAcyclic: require(\"./is-acyclic\"),\n postorder: require(\"./postorder\"),\n preorder: require(\"./preorder\"),\n prim: require(\"./prim\"),\n tarjan: require(\"./tarjan\"),\n topsort: require(\"./topsort\")\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;AAAA,GAAO,UAAU;EACf,YAAA,GAAA;EACA,UAAA,GAAA;EACA,aAAA,GAAA;EACA,YAAA,GAAA;EACA,eAAA,GAAA;EACA,WAAA,GAAA;EACA,WAAA,GAAA;EACA,UAAA,GAAA;EACA,MAAA,GAAA;EACA,QAAA,GAAA;EACA,SAAA,GAAA;EACD"}

package/dist/node_modules/graphlib/lib/alg/is-acyclic.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"is-acyclic.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/is-acyclic.js"],"sourcesContent":["var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n try {\n topsort(g);\n } catch (e) {\n if (e instanceof topsort.CycleException) {\n return false;\n }\n throw e;\n }\n return true;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAU,GAAG;AACpB,MAAI;AACF,KAAQ,EAAE;WACH,GAAG;AACV,OAAI,aAAa,EAAQ,eACvB,QAAO;AAET,SAAM;;AAER,SAAO"}

package/dist/node_modules/graphlib/lib/alg/postorder.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"postorder.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/postorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n return dfs(g, vs, \"post\");\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAU,GAAG,GAAI;AACxB,SAAO,EAAI,GAAG,GAAI,OAAO"}

package/dist/node_modules/graphlib/lib/alg/preorder.js.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"preorder.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/preorder.js"],"sourcesContent":["var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n return dfs(g, vs, \"pre\");\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAS,GAAG,GAAI;AACvB,SAAO,EAAI,GAAG,GAAI,MAAM"}

package/dist/node_modules/graphlib/lib/alg/prim.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"prim.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/prim.js"],"sourcesContent":["var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n var result = new Graph();\n var parents = {};\n var pq = new PriorityQueue();\n var v;\n\n function updateNeighbors(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var pri = pq.priority(w);\n if (pri !== undefined) {\n var edgeWeight = weightFunc(edge);\n if (edgeWeight < pri) {\n parents[w] = v;\n pq.decrease(w, edgeWeight);\n }\n }\n }\n\n if (g.nodeCount() === 0) {\n return result;\n }\n\n _.each(g.nodes(), function(v) {\n pq.add(v, Number.POSITIVE_INFINITY);\n result.setNode(v);\n });\n\n // Start from an arbitrary node\n pq.decrease(g.nodes()[0], 0);\n\n var init = false;\n while (pq.size() > 0) {\n v = pq.removeMin();\n if (_.has(parents, v)) {\n result.setEdge(v, parents[v]);\n } else if (init) {\n throw new Error(\"Input graph is not connected: \" + g);\n } else {\n init = true;\n }\n\n g.nodeEdges(v).forEach(updateNeighbors);\n }\n\n return result;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAK,GAAG,GAAY;EAC3B,IAAI,IAAS,IAAI,GAAO,EACpB,IAAU,EAAE,EACZ,IAAK,IAAI,GAAe,EACxB;EAEJ,SAAS,EAAgB,GAAM;GAC7B,IAAI,IAAI,EAAK,MAAM,IAAI,EAAK,IAAI,EAAK,GACjC,IAAM,EAAG,SAAS,EAAE;AACxB,OAAI,MAAQ,KAAA,GAAW;IACrB,IAAI,IAAa,EAAW,EAAK;AACjC,IAAI,IAAa,MACf,EAAQ,KAAK,GACb,EAAG,SAAS,GAAG,EAAW;;;AAKhC,MAAI,EAAE,WAAW,KAAK,EACpB,QAAO;AAST,EANA,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAG;AAE5B,GADA,EAAG,IAAI,GAAG,SAAyB,EACnC,EAAO,QAAQ,EAAE;IACjB,EAGF,EAAG,SAAS,EAAE,OAAO,CAAC,IAAI,EAAE;AAG5B,OADA,IAAI,IAAO,IACJ,EAAG,MAAM,GAAG,IAAG;AAEpB,OADA,IAAI,EAAG,WAAW,EACd,EAAE,IAAI,GAAS,EAAE,CACnB,GAAO,QAAQ,GAAG,EAAQ,GAAG;YACpB,EACT,OAAU,MAAM,mCAAmC,EAAE;OAErD,KAAO;AAGT,KAAE,UAAU,EAAE,CAAC,QAAQ,EAAgB;;AAGzC,SAAO"}

package/dist/node_modules/graphlib/lib/alg/tarjan.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"tarjan.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/tarjan.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n var index = 0;\n var stack = [];\n var visited = {}; // node id -> { onStack, lowlink, index }\n var results = [];\n\n function dfs(v) {\n var entry = visited[v] = {\n onStack: true,\n lowlink: index,\n index: index++\n };\n stack.push(v);\n\n g.successors(v).forEach(function(w) {\n if (!_.has(visited, w)) {\n dfs(w);\n entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n } else if (visited[w].onStack) {\n entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n }\n });\n\n if (entry.lowlink === entry.index) {\n var cmpt = [];\n var w;\n do {\n w = stack.pop();\n visited[w].onStack = false;\n cmpt.push(w);\n } while (v !== w);\n results.push(cmpt);\n }\n }\n\n g.nodes().forEach(function(v) {\n if (!_.has(visited, v)) {\n dfs(v);\n }\n });\n\n return results;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,SAAS,EAAO,GAAG;EACjB,IAAI,IAAQ,GACR,IAAQ,EAAE,EACV,IAAU,EAAE,EACZ,IAAU,EAAE;EAEhB,SAAS,EAAI,GAAG;GACd,IAAI,IAAQ,EAAQ,KAAK;IACvB,SAAS;IACT,SAAS;IACT,OAAO;IACR;AAYD,OAXA,EAAM,KAAK,EAAE,EAEb,EAAE,WAAW,EAAE,CAAC,QAAQ,SAAS,GAAG;AAClC,IAAK,EAAE,IAAI,GAAS,EAAE,GAGX,EAAQ,GAAG,YACpB,EAAM,UAAU,KAAK,IAAI,EAAM,SAAS,EAAQ,GAAG,MAAM,KAHzD,EAAI,EAAE,EACN,EAAM,UAAU,KAAK,IAAI,EAAM,SAAS,EAAQ,GAAG,QAAQ;KAI7D,EAEE,EAAM,YAAY,EAAM,OAAO;IACjC,IAAI,IAAO,EAAE,EACT;AACJ;AAGE,KAFA,IAAI,EAAM,KAAK,EACf,EAAQ,GAAG,UAAU,IACrB,EAAK,KAAK,EAAE;WACL,MAAM;AACf,MAAQ,KAAK,EAAK;;;AAUtB,SANA,EAAE,OAAO,CAAC,QAAQ,SAAS,GAAG;AAC5B,GAAK,EAAE,IAAI,GAAS,EAAE,IACpB,EAAI,EAAE;IAER,EAEK"}

package/dist/node_modules/graphlib/lib/alg/topsort.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"topsort.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/alg/topsort.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n var visited = {};\n var stack = {};\n var results = [];\n\n function visit(node) {\n if (_.has(stack, node)) {\n throw new CycleException();\n }\n\n if (!_.has(visited, node)) {\n stack[node] = true;\n visited[node] = true;\n _.each(g.predecessors(node), visit);\n delete stack[node];\n results.push(node);\n }\n }\n\n _.each(g.sinks(), visit);\n\n if (_.size(visited) !== g.nodeCount()) {\n throw new CycleException();\n }\n\n return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAGJ,CADA,EAAO,UAAU,GACjB,EAAQ,iBAAiB;CAEzB,SAAS,EAAQ,GAAG;EAClB,IAAI,IAAU,EAAE,EACZ,IAAQ,EAAE,EACV,IAAU,EAAE;EAEhB,SAAS,EAAM,GAAM;AACnB,OAAI,EAAE,IAAI,GAAO,EAAK,CACpB,OAAM,IAAI,GAAgB;AAG5B,GAAK,EAAE,IAAI,GAAS,EAAK,KACvB,EAAM,KAAQ,IACd,EAAQ,KAAQ,IAChB,EAAE,KAAK,EAAE,aAAa,EAAK,EAAE,EAAM,EACnC,OAAO,EAAM,IACb,EAAQ,KAAK,EAAK;;AAMtB,MAFA,EAAE,KAAK,EAAE,OAAO,EAAE,EAAM,EAEpB,EAAE,KAAK,EAAQ,KAAK,EAAE,WAAW,CACnC,OAAM,IAAI,GAAgB;AAG5B,SAAO;;CAGT,SAAS,IAAiB;AAC1B,GAAe,YAAY,gBAAI,OAAO"}

package/dist/node_modules/graphlib/lib/data/priority-queue.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"priority-queue.js","names":[],"sources":["../../../../../node_modules/graphlib/lib/data/priority-queue.js"],"sourcesContent":["var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n this._arr = [];\n this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n var index = this._keyIndices[key];\n if (index !== undefined) {\n return this._arr[index].priority;\n }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n if (this.size() === 0) {\n throw new Error(\"Queue underflow\");\n }\n return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n var keyIndices = this._keyIndices;\n key = String(key);\n if (!_.has(keyIndices, key)) {\n var arr = this._arr;\n var index = arr.length;\n keyIndices[key] = index;\n arr.push({key: key, priority: priority});\n this._decrease(index);\n return true;\n }\n return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n this._swap(0, this._arr.length - 1);\n var min = this._arr.pop();\n delete this._keyIndices[min.key];\n this._heapify(0);\n return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n var index = this._keyIndices[key];\n if (priority > this._arr[index].priority) {\n throw new Error(\"New priority is greater than current priority. \" +\n \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n }\n this._arr[index].priority = priority;\n this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n var arr = this._arr;\n var l = 2 * i;\n var r = l + 1;\n var largest = i;\n if (l < arr.length) {\n largest = arr[l].priority < arr[largest].priority ? l : largest;\n if (r < arr.length) {\n largest = arr[r].priority < arr[largest].priority ? r : largest;\n }\n if (largest !== i) {\n this._swap(i, largest);\n this._heapify(largest);\n }\n }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n var arr = this._arr;\n var priority = arr[index].priority;\n var parent;\n while (index !== 0) {\n parent = index >> 1;\n if (arr[parent].priority < priority) {\n break;\n }\n this._swap(index, parent);\n index = parent;\n }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n var arr = this._arr;\n var keyIndices = this._keyIndices;\n var origArrI = arr[i];\n var origArrJ = arr[j];\n arr[i] = origArrJ;\n arr[j] = origArrI;\n keyIndices[origArrJ.key] = i;\n keyIndices[origArrI.key] = j;\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;CAAA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CASjB,SAAS,IAAgB;AAEvB,EADA,KAAK,OAAO,EAAE,EACd,KAAK,cAAc,EAAE;;AAiIvB,CA3HA,EAAc,UAAU,OAAO,WAAW;AACxC,SAAO,KAAK,KAAK;IAMnB,EAAc,UAAU,OAAO,WAAW;AACxC,SAAO,KAAK,KAAK,IAAI,SAAS,GAAG;AAAE,UAAO,EAAE;IAAO;IAMrD,EAAc,UAAU,MAAM,SAAS,GAAK;AAC1C,SAAO,EAAE,IAAI,KAAK,aAAa,EAAI;IASrC,EAAc,UAAU,WAAW,SAAS,GAAK;EAC/C,IAAI,IAAQ,KAAK,YAAY;AAC7B,MAAI,MAAU,KAAA,EACZ,QAAO,KAAK,KAAK,GAAO;IAQ5B,EAAc,UAAU,MAAM,WAAW;AACvC,MAAI,KAAK,MAAM,KAAK,EAClB,OAAU,MAAM,kBAAkB;AAEpC,SAAO,KAAK,KAAK,GAAG;IAWtB,EAAc,UAAU,MAAM,SAAS,GAAK,GAAU;EACpD,IAAI,IAAa,KAAK;AAEtB,MADA,IAAM,OAAO,EAAI,EACb,CAAC,EAAE,IAAI,GAAY,EAAI,EAAE;GAC3B,IAAI,IAAM,KAAK,MACX,IAAQ,EAAI;AAIhB,UAHA,EAAW,KAAO,GAClB,EAAI,KAAK;IAAM;IAAe;IAAS,CAAC,EACxC,KAAK,UAAU,EAAM,EACd;;AAET,SAAO;IAMT,EAAc,UAAU,YAAY,WAAW;AAC7C,OAAK,MAAM,GAAG,KAAK,KAAK,SAAS,EAAE;EACnC,IAAI,IAAM,KAAK,KAAK,KAAK;AAGzB,SAFA,OAAO,KAAK,YAAY,EAAI,MAC5B,KAAK,SAAS,EAAE,EACT,EAAI;IAUb,EAAc,UAAU,WAAW,SAAS,GAAK,GAAU;EACzD,IAAI,IAAQ,KAAK,YAAY;AAC7B,MAAI,IAAW,KAAK,KAAK,GAAO,SAC9B,OAAU,MAAM,yDACF,IAAM,WAAW,KAAK,KAAK,GAAO,WAAW,WAAW,EAAS;AAGjF,EADA,KAAK,KAAK,GAAO,WAAW,GAC5B,KAAK,UAAU,EAAM;IAGvB,EAAc,UAAU,WAAW,SAAS,GAAG;EAC7C,IAAI,IAAM,KAAK,MACX,IAAI,IAAI,GACR,IAAI,IAAI,GACR,IAAU;AACd,EAAI,IAAI,EAAI,WACV,IAAU,EAAI,GAAG,WAAW,EAAI,GAAS,WAAW,IAAI,GACpD,IAAI,EAAI,WACV,IAAU,EAAI,GAAG,WAAW,EAAI,GAAS,WAAW,IAAI,IAEtD,MAAY,MACd,KAAK,MAAM,GAAG,EAAQ,EACtB,KAAK,SAAS,EAAQ;IAK5B,EAAc,UAAU,YAAY,SAAS,GAAO;AAIlD,OAHA,IAAI,IAAM,KAAK,MACX,IAAW,EAAI,GAAO,UACtB,GACG,MAAU,MACf,IAAS,KAAS,GACd,IAAI,GAAQ,WAAW,KAI3B,CADA,KAAK,MAAM,GAAO,EAAO,EACzB,IAAQ;IAIZ,EAAc,UAAU,QAAQ,SAAS,GAAG,GAAG;EAC7C,IAAI,IAAM,KAAK,MACX,IAAa,KAAK,aAClB,IAAW,EAAI,IACf,IAAW,EAAI;AAInB,EAHA,EAAI,KAAK,GACT,EAAI,KAAK,GACT,EAAW,EAAS,OAAO,GAC3B,EAAW,EAAS,OAAO"}

package/dist/node_modules/graphlib/lib/graph.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"graph.js","names":[],"sources":["../../../../node_modules/graphlib/lib/graph.js"],"sourcesContent":["\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n// * Node id query functions should return string ids for the nodes\n// * Edge id query functions should return an \"edgeObj\", edge object, that is\n// composed of enough information to uniquely identify an edge: {v, w, name}.\n// * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n// reference edges. This is because we need a performant way to look these\n// edges up and, object properties, which have string keys, are the closest\n// we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n // Label for the graph itself\n this._label = undefined;\n\n // Defaults to be set when creating a new node\n this._defaultNodeLabelFn = _.constant(undefined);\n\n // Defaults to be set when creating a new edge\n this._defaultEdgeLabelFn = _.constant(undefined);\n\n // v -> label\n this._nodes = {};\n\n if (this._isCompound) {\n // v -> parent\n this._parent = {};\n\n // v -> children\n this._children = {};\n this._children[GRAPH_NODE] = {};\n }\n\n // v -> edgeObj\n this._in = {};\n\n // u -> v -> Number\n this._preds = {};\n\n // v -> edgeObj\n this._out = {};\n\n // v -> w -> Number\n this._sucs = {};\n\n // e -> edgeObj\n this._edgeObjs = {};\n\n // e -> label\n this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n this._label = label;\n return this;\n};\n\nGraph.prototype.graph = function() {\n return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultNodeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.nodeCount = function() {\n return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._in[v]);\n });\n};\n\nGraph.prototype.sinks = function() {\n var self = this;\n return _.filter(this.nodes(), function(v) {\n return _.isEmpty(self._out[v]);\n });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n var args = arguments;\n var self = this;\n _.each(vs, function(v) {\n if (args.length > 1) {\n self.setNode(v, value);\n } else {\n self.setNode(v);\n }\n });\n return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n if (_.has(this._nodes, v)) {\n if (arguments.length > 1) {\n this._nodes[v] = value;\n }\n return this;\n }\n\n this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n if (this._isCompound) {\n this._parent[v] = GRAPH_NODE;\n this._children[v] = {};\n this._children[GRAPH_NODE][v] = true;\n }\n this._in[v] = {};\n this._preds[v] = {};\n this._out[v] = {};\n this._sucs[v] = {};\n ++this._nodeCount;\n return this;\n};\n\nGraph.prototype.node = function(v) {\n return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode = function(v) {\n var self = this;\n if (_.has(this._nodes, v)) {\n var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n delete this._nodes[v];\n if (this._isCompound) {\n this._removeFromParentsChildList(v);\n delete this._parent[v];\n _.each(this.children(v), function(child) {\n self.setParent(child);\n });\n delete this._children[v];\n }\n _.each(_.keys(this._in[v]), removeEdge);\n delete this._in[v];\n delete this._preds[v];\n _.each(_.keys(this._out[v]), removeEdge);\n delete this._out[v];\n delete this._sucs[v];\n --this._nodeCount;\n }\n return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n if (!this._isCompound) {\n throw new Error(\"Cannot set parent in a non-compound graph\");\n }\n\n if (_.isUndefined(parent)) {\n parent = GRAPH_NODE;\n } else {\n // Coerce parent to string\n parent += \"\";\n for (var ancestor = parent;\n !_.isUndefined(ancestor);\n ancestor = this.parent(ancestor)) {\n if (ancestor === v) {\n throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n \" would create a cycle\");\n }\n }\n\n this.setNode(parent);\n }\n\n this.setNode(v);\n this._removeFromParentsChildList(v);\n this._parent[v] = parent;\n this._children[parent][v] = true;\n return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n if (this._isCompound) {\n var parent = this._parent[v];\n if (parent !== GRAPH_NODE) {\n return parent;\n }\n }\n};\n\nGraph.prototype.children = function(v) {\n if (_.isUndefined(v)) {\n v = GRAPH_NODE;\n }\n\n if (this._isCompound) {\n var children = this._children[v];\n if (children) {\n return _.keys(children);\n }\n } else if (v === GRAPH_NODE) {\n return this.nodes();\n } else if (this.hasNode(v)) {\n return [];\n }\n};\n\nGraph.prototype.predecessors = function(v) {\n var predsV = this._preds[v];\n if (predsV) {\n return _.keys(predsV);\n }\n};\n\nGraph.prototype.successors = function(v) {\n var sucsV = this._sucs[v];\n if (sucsV) {\n return _.keys(sucsV);\n }\n};\n\nGraph.prototype.neighbors = function(v) {\n var preds = this.predecessors(v);\n if (preds) {\n return _.union(preds, this.successors(v));\n }\n};\n\nGraph.prototype.isLeaf = function (v) {\n var neighbors;\n if (this.isDirected()) {\n neighbors = this.successors(v);\n } else {\n neighbors = this.neighbors(v);\n }\n return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n var copy = new this.constructor({\n directed: this._isDirected,\n multigraph: this._isMultigraph,\n compound: this._isCompound\n });\n\n copy.setGraph(this.graph());\n\n var self = this;\n _.each(this._nodes, function(value, v) {\n if (filter(v)) {\n copy.setNode(v, value);\n }\n });\n\n _.each(this._edgeObjs, function(e) {\n if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n copy.setEdge(e, self.edge(e));\n }\n });\n\n var parents = {};\n function findParent(v) {\n var parent = self.parent(v);\n if (parent === undefined || copy.hasNode(parent)) {\n parents[v] = parent;\n return parent;\n } else if (parent in parents) {\n return parents[parent];\n } else {\n return findParent(parent);\n }\n }\n\n if (this._isCompound) {\n _.each(copy.nodes(), function(v) {\n copy.setParent(v, findParent(v));\n });\n }\n\n return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n if (!_.isFunction(newDefault)) {\n newDefault = _.constant(newDefault);\n }\n this._defaultEdgeLabelFn = newDefault;\n return this;\n};\n\nGraph.prototype.edgeCount = function() {\n return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n var self = this;\n var args = arguments;\n _.reduce(vs, function(v, w) {\n if (args.length > 1) {\n self.setEdge(v, w, value);\n } else {\n self.setEdge(v, w);\n }\n return w;\n });\n return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n var v, w, name, value;\n var valueSpecified = false;\n var arg0 = arguments[0];\n\n if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n v = arg0.v;\n w = arg0.w;\n name = arg0.name;\n if (arguments.length === 2) {\n value = arguments[1];\n valueSpecified = true;\n }\n } else {\n v = arg0;\n w = arguments[1];\n name = arguments[3];\n if (arguments.length > 2) {\n value = arguments[2];\n valueSpecified = true;\n }\n }\n\n v = \"\" + v;\n w = \"\" + w;\n if (!_.isUndefined(name)) {\n name = \"\" + name;\n }\n\n var e = edgeArgsToId(this._isDirected, v, w, name);\n if (_.has(this._edgeLabels, e)) {\n if (valueSpecified) {\n this._edgeLabels[e] = value;\n }\n return this;\n }\n\n if (!_.isUndefined(name) && !this._isMultigraph) {\n throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n }\n\n // It didn't exist, so we need to create it.\n // First ensure the nodes exist.\n this.setNode(v);\n this.setNode(w);\n\n this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n // Ensure we add undirected edges in a consistent way.\n v = edgeObj.v;\n w = edgeObj.w;\n\n Object.freeze(edgeObj);\n this._edgeObjs[e] = edgeObj;\n incrementOrInitEntry(this._preds[w], v);\n incrementOrInitEntry(this._sucs[v], w);\n this._in[w][e] = edgeObj;\n this._out[v][e] = edgeObj;\n this._edgeCount++;\n return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n var e = (arguments.length === 1\n ? edgeObjToId(this._isDirected, arguments[0])\n : edgeArgsToId(this._isDirected, v, w, name));\n var edge = this._edgeObjs[e];\n if (edge) {\n v = edge.v;\n w = edge.w;\n delete this._edgeLabels[e];\n delete this._edgeObjs[e];\n decrementOrRemoveEntry(this._preds[w], v);\n decrementOrRemoveEntry(this._sucs[v], w);\n delete this._in[w][e];\n delete this._out[v][e];\n this._edgeCount--;\n }\n return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n var inV = this._in[v];\n if (inV) {\n var edges = _.values(inV);\n if (!u) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.v === u; });\n }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n var outV = this._out[v];\n if (outV) {\n var edges = _.values(outV);\n if (!w) {\n return edges;\n }\n return _.filter(edges, function(edge) { return edge.w === w; });\n }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n var inEdges = this.inEdges(v, w);\n if (inEdges) {\n return inEdges.concat(this.outEdges(v, w));\n }\n};\n\nfunction incrementOrInitEntry(map, k) {\n if (map[k]) {\n map[k]++;\n } else {\n map[k] = 1;\n }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n var v = \"\" + v_;\n var w = \"\" + w_;\n if (!isDirected && v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n var edgeObj = { v: v, w: w };\n if (name) {\n edgeObj.name = name;\n }\n return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;CAEA,IAAI,IAAA,GAAA;AAEJ,GAAO,UAAU;CAEjB,IAAI,IAAoB,MACpB,IAAa,MACb,IAAiB;CAYrB,SAAS,EAAM,GAAM;AA0CnB,EAzCA,KAAK,cAAc,EAAE,IAAI,GAAM,WAAW,GAAG,EAAK,WAAW,IAC7D,KAAK,gBAAgB,EAAE,IAAI,GAAM,aAAa,GAAG,EAAK,aAAa,IACnE,KAAK,cAAc,EAAE,IAAI,GAAM,WAAW,GAAG,EAAK,WAAW,IAG7D,KAAK,SAAS,KAAA,GAGd,KAAK,sBAAsB,EAAE,SAAS,KAAA,EAAU,EAGhD,KAAK,sBAAsB,EAAE,SAAS,KAAA,EAAU,EAGhD,KAAK,SAAS,EAAE,EAEZ,KAAK,gBAEP,KAAK,UAAU,EAAE,EAGjB,KAAK,YAAY,EAAE,EACnB,KAAK,UAAU,KAAc,EAAE,GAIjC,KAAK,MAAM,EAAE,EAGb,KAAK,SAAS,EAAE,EAGhB,KAAK,OAAO,EAAE,EAGd,KAAK,QAAQ,EAAE,EAGf,KAAK,YAAY,EAAE,EAGnB,KAAK,cAAc,EAAE;;AAqavB,CAjaA,EAAM,UAAU,aAAa,GAG7B,EAAM,UAAU,aAAa,GAK7B,EAAM,UAAU,aAAa,WAAW;AACtC,SAAO,KAAK;IAGd,EAAM,UAAU,eAAe,WAAW;AACxC,SAAO,KAAK;IAGd,EAAM,UAAU,aAAa,WAAW;AACtC,SAAO,KAAK;IAGd,EAAM,UAAU,WAAW,SAAS,GAAO;AAEzC,SADA,KAAK,SAAS,GACP;IAGT,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,KAAK;IAMd,EAAM,UAAU,sBAAsB,SAAS,GAAY;AAKzD,SAJK,EAAE,WAAW,EAAW,KAC3B,IAAa,EAAE,SAAS,EAAW,GAErC,KAAK,sBAAsB,GACpB;IAGT,EAAM,UAAU,YAAY,WAAW;AACrC,SAAO,KAAK;IAGd,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,EAAE,KAAK,KAAK,OAAO;IAG5B,EAAM,UAAU,UAAU,WAAW;EACnC,IAAI,IAAO;AACX,SAAO,EAAE,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;AACxC,UAAO,EAAE,QAAQ,EAAK,IAAI,GAAG;IAC7B;IAGJ,EAAM,UAAU,QAAQ,WAAW;EACjC,IAAI,IAAO;AACX,SAAO,EAAE,OAAO,KAAK,OAAO,EAAE,SAAS,GAAG;AACxC,UAAO,EAAE,QAAQ,EAAK,KAAK,GAAG;IAC9B;IAGJ,EAAM,UAAU,WAAW,SAAS,GAAI,GAAO;EAC7C,IAAI,IAAO,WACP,IAAO;AAQX,SAPA,EAAE,KAAK,GAAI,SAAS,GAAG;AACrB,GAAI,EAAK,SAAS,IAChB,EAAK,QAAQ,GAAG,EAAM,GAEtB,EAAK,QAAQ,EAAE;IAEjB,EACK;IAGT,EAAM,UAAU,UAAU,SAAS,GAAG,GAAO;AAmB3C,SAlBI,EAAE,IAAI,KAAK,QAAQ,EAAE,IACnB,UAAU,SAAS,MACrB,KAAK,OAAO,KAAK,IAEZ,SAGT,KAAK,OAAO,KAAK,UAAU,SAAS,IAAI,IAAQ,KAAK,oBAAoB,EAAE,EACvE,KAAK,gBACP,KAAK,QAAQ,KAAK,GAClB,KAAK,UAAU,KAAK,EAAE,EACtB,KAAK,UAAU,GAAY,KAAK,KAElC,KAAK,IAAI,KAAK,EAAE,EAChB,KAAK,OAAO,KAAK,EAAE,EACnB,KAAK,KAAK,KAAK,EAAE,EACjB,KAAK,MAAM,KAAK,EAAE,EAClB,EAAE,KAAK,YACA;IAGT,EAAM,UAAU,OAAO,SAAS,GAAG;AACjC,SAAO,KAAK,OAAO;IAGrB,EAAM,UAAU,UAAU,SAAS,GAAG;AACpC,SAAO,EAAE,IAAI,KAAK,QAAQ,EAAE;IAG9B,EAAM,UAAU,aAAc,SAAS,GAAG;EACxC,IAAI,IAAO;AACX,MAAI,EAAE,IAAI,KAAK,QAAQ,EAAE,EAAE;GACzB,IAAI,IAAa,SAAS,GAAG;AAAE,MAAK,WAAW,EAAK,UAAU,GAAG;;AAgBjE,GAfA,OAAO,KAAK,OAAO,IACf,KAAK,gBACP,KAAK,4BAA4B,EAAE,EACnC,OAAO,KAAK,QAAQ,IACpB,EAAE,KAAK,KAAK,SAAS,EAAE,EAAE,SAAS,GAAO;AACvC,MAAK,UAAU,EAAM;KACrB,EACF,OAAO,KAAK,UAAU,KAExB,EAAE,KAAK,EAAE,KAAK,KAAK,IAAI,GAAG,EAAE,EAAW,EACvC,OAAO,KAAK,IAAI,IAChB,OAAO,KAAK,OAAO,IACnB,EAAE,KAAK,EAAE,KAAK,KAAK,KAAK,GAAG,EAAE,EAAW,EACxC,OAAO,KAAK,KAAK,IACjB,OAAO,KAAK,MAAM,IAClB,EAAE,KAAK;;AAET,SAAO;IAGT,EAAM,UAAU,YAAY,SAAS,GAAG,GAAQ;AAC9C,MAAI,CAAC,KAAK,YACR,OAAU,MAAM,4CAA4C;AAG9D,MAAI,EAAE,YAAY,EAAO,CACvB,KAAS;OACJ;AAEL,QAAU;AACV,QAAK,IAAI,IAAW,GAClB,CAAC,EAAE,YAAY,EAAS,EACxB,IAAW,KAAK,OAAO,EAAS,CAChC,KAAI,MAAa,EACf,OAAU,MAAM,aAAa,IAAQ,mBAAmB,IACxC,wBAAwB;AAI5C,QAAK,QAAQ,EAAO;;AAOtB,SAJA,KAAK,QAAQ,EAAE,EACf,KAAK,4BAA4B,EAAE,EACnC,KAAK,QAAQ,KAAK,GAClB,KAAK,UAAU,GAAQ,KAAK,IACrB;IAGT,EAAM,UAAU,8BAA8B,SAAS,GAAG;AACxD,SAAO,KAAK,UAAU,KAAK,QAAQ,IAAI;IAGzC,EAAM,UAAU,SAAS,SAAS,GAAG;AACnC,MAAI,KAAK,aAAa;GACpB,IAAI,IAAS,KAAK,QAAQ;AAC1B,OAAI,MAAW,EACb,QAAO;;IAKb,EAAM,UAAU,WAAW,SAAS,GAAG;AAKrC,MAJI,EAAE,YAAY,EAAE,KAClB,IAAI,IAGF,KAAK,aAAa;GACpB,IAAI,IAAW,KAAK,UAAU;AAC9B,OAAI,EACF,QAAO,EAAE,KAAK,EAAS;aAEhB,MAAM,EACf,QAAO,KAAK,OAAO;WACV,KAAK,QAAQ,EAAE,CACxB,QAAO,EAAE;IAIb,EAAM,UAAU,eAAe,SAAS,GAAG;EACzC,IAAI,IAAS,KAAK,OAAO;AACzB,MAAI,EACF,QAAO,EAAE,KAAK,EAAO;IAIzB,EAAM,UAAU,aAAa,SAAS,GAAG;EACvC,IAAI,IAAQ,KAAK,MAAM;AACvB,MAAI,EACF,QAAO,EAAE,KAAK,EAAM;IAIxB,EAAM,UAAU,YAAY,SAAS,GAAG;EACtC,IAAI,IAAQ,KAAK,aAAa,EAAE;AAChC,MAAI,EACF,QAAO,EAAE,MAAM,GAAO,KAAK,WAAW,EAAE,CAAC;IAI7C,EAAM,UAAU,SAAS,SAAU,GAAG;AAOpC,UALI,KAAK,YAAY,GACP,KAAK,WAAW,EAAE,GAElB,KAAK,UAAU,EAAE,EAEd,WAAW;IAG9B,EAAM,UAAU,cAAc,SAAS,GAAQ;EAC7C,IAAI,IAAO,IAAI,KAAK,YAAY;GAC9B,UAAU,KAAK;GACf,YAAY,KAAK;GACjB,UAAU,KAAK;GAChB,CAAC;AAEF,IAAK,SAAS,KAAK,OAAO,CAAC;EAE3B,IAAI,IAAO;AAOX,EANA,EAAE,KAAK,KAAK,QAAQ,SAAS,GAAO,GAAG;AACrC,GAAI,EAAO,EAAE,IACX,EAAK,QAAQ,GAAG,EAAM;IAExB,EAEF,EAAE,KAAK,KAAK,WAAW,SAAS,GAAG;AACjC,GAAI,EAAK,QAAQ,EAAE,EAAE,IAAI,EAAK,QAAQ,EAAE,EAAE,IACxC,EAAK,QAAQ,GAAG,EAAK,KAAK,EAAE,CAAC;IAE/B;EAEF,IAAI,IAAU,EAAE;EAChB,SAAS,EAAW,GAAG;GACrB,IAAI,IAAS,EAAK,OAAO,EAAE;AAOzB,UANE,MAAW,KAAA,KAAa,EAAK,QAAQ,EAAO,IAC9C,EAAQ,KAAK,GACN,KACE,KAAU,IACZ,EAAQ,KAER,EAAW,EAAO;;AAU7B,SANI,KAAK,eACP,EAAE,KAAK,EAAK,OAAO,EAAE,SAAS,GAAG;AAC/B,KAAK,UAAU,GAAG,EAAW,EAAE,CAAC;IAChC,EAGG;IAKT,EAAM,UAAU,sBAAsB,SAAS,GAAY;AAKzD,SAJK,EAAE,WAAW,EAAW,KAC3B,IAAa,EAAE,SAAS,EAAW,GAErC,KAAK,sBAAsB,GACpB;IAGT,EAAM,UAAU,YAAY,WAAW;AACrC,SAAO,KAAK;IAGd,EAAM,UAAU,QAAQ,WAAW;AACjC,SAAO,EAAE,OAAO,KAAK,UAAU;IAGjC,EAAM,UAAU,UAAU,SAAS,GAAI,GAAO;EAC5C,IAAI,IAAO,MACP,IAAO;AASX,SARA,EAAE,OAAO,GAAI,SAAS,GAAG,GAAG;AAM1B,UALI,EAAK,SAAS,IAChB,EAAK,QAAQ,GAAG,GAAG,EAAM,GAEzB,EAAK,QAAQ,GAAG,EAAE,EAEb;IACP,EACK;IAOT,EAAM,UAAU,UAAU,WAAW;EACnC,IAAI,GAAG,GAAG,GAAM,GACZ,IAAiB,IACjB,IAAO,UAAU;AAsBrB,EApBI,OAAO,KAAS,YAAY,KAAiB,OAAO,KACtD,IAAI,EAAK,GACT,IAAI,EAAK,GACT,IAAO,EAAK,MACR,UAAU,WAAW,MACvB,IAAQ,UAAU,IAClB,IAAiB,QAGnB,IAAI,GACJ,IAAI,UAAU,IACd,IAAO,UAAU,IACb,UAAU,SAAS,MACrB,IAAQ,UAAU,IAClB,IAAiB,MAIrB,IAAI,KAAK,GACT,IAAI,KAAK,GACJ,EAAE,YAAY,EAAK,KACtB,IAAO,KAAK;EAGd,IAAI,IAAI,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAClD,MAAI,EAAE,IAAI,KAAK,aAAa,EAAE,CAI5B,QAHI,MACF,KAAK,YAAY,KAAK,IAEjB;AAGT,MAAI,CAAC,EAAE,YAAY,EAAK,IAAI,CAAC,KAAK,cAChC,OAAU,MAAM,oDAAoD;AAQtE,EAHA,KAAK,QAAQ,EAAE,EACf,KAAK,QAAQ,EAAE,EAEf,KAAK,YAAY,KAAK,IAAiB,IAAQ,KAAK,oBAAoB,GAAG,GAAG,EAAK;EAEnF,IAAI,IAAU,EAAc,KAAK,aAAa,GAAG,GAAG,EAAK;AAYzD,SAVA,IAAI,EAAQ,GACZ,IAAI,EAAQ,GAEZ,OAAO,OAAO,EAAQ,EACtB,KAAK,UAAU,KAAK,GACpB,EAAqB,KAAK,OAAO,IAAI,EAAE,EACvC,EAAqB,KAAK,MAAM,IAAI,EAAE,EACtC,KAAK,IAAI,GAAG,KAAK,GACjB,KAAK,KAAK,GAAG,KAAK,GAClB,KAAK,cACE;IAGT,EAAM,UAAU,OAAO,SAAS,GAAG,GAAG,GAAM;EAC1C,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAC9C,SAAO,KAAK,YAAY;IAG1B,EAAM,UAAU,UAAU,SAAS,GAAG,GAAG,GAAM;EAC7C,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK;AAC9C,SAAO,EAAE,IAAI,KAAK,aAAa,EAAE;IAGnC,EAAM,UAAU,aAAa,SAAS,GAAG,GAAG,GAAM;EAChD,IAAI,IAAK,UAAU,WAAW,IAC1B,EAAY,KAAK,aAAa,UAAU,GAAG,GAC3C,EAAa,KAAK,aAAa,GAAG,GAAG,EAAK,EAC1C,IAAO,KAAK,UAAU;AAY1B,SAXI,MACF,IAAI,EAAK,GACT,IAAI,EAAK,GACT,OAAO,KAAK,YAAY,IACxB,OAAO,KAAK,UAAU,IACtB,EAAuB,KAAK,OAAO,IAAI,EAAE,EACzC,EAAuB,KAAK,MAAM,IAAI,EAAE,EACxC,OAAO,KAAK,IAAI,GAAG,IACnB,OAAO,KAAK,KAAK,GAAG,IACpB,KAAK,eAEA;IAGT,EAAM,UAAU,UAAU,SAAS,GAAG,GAAG;EACvC,IAAI,IAAM,KAAK,IAAI;AACnB,MAAI,GAAK;GACP,IAAI,IAAQ,EAAE,OAAO,EAAI;AAIzB,UAHK,IAGE,EAAE,OAAO,GAAO,SAAS,GAAM;AAAE,WAAO,EAAK,MAAM;KAAK,GAFtD;;IAMb,EAAM,UAAU,WAAW,SAAS,GAAG,GAAG;EACxC,IAAI,IAAO,KAAK,KAAK;AACrB,MAAI,GAAM;GACR,IAAI,IAAQ,EAAE,OAAO,EAAK;AAI1B,UAHK,IAGE,EAAE,OAAO,GAAO,SAAS,GAAM;AAAE,WAAO,EAAK,MAAM;KAAK,GAFtD;;IAMb,EAAM,UAAU,YAAY,SAAS,GAAG,GAAG;EACzC,IAAI,IAAU,KAAK,QAAQ,GAAG,EAAE;AAChC,MAAI,EACF,QAAO,EAAQ,OAAO,KAAK,SAAS,GAAG,EAAE,CAAC;;CAI9C,SAAS,EAAqB,GAAK,GAAG;AACpC,EAAI,EAAI,KACN,EAAI,OAEJ,EAAI,KAAK;;CAIb,SAAS,EAAuB,GAAK,GAAG;AACtC,EAAK,EAAE,EAAI,MAAM,OAAO,EAAI;;CAG9B,SAAS,EAAa,GAAY,GAAI,GAAI,GAAM;EAC9C,IAAI,IAAI,KAAK,GACT,IAAI,KAAK;AACb,MAAI,CAAC,KAAc,IAAI,GAAG;GACxB,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;AAEN,SAAO,IAAI,IAAiB,IAAI,KACpB,EAAE,YAAY,EAAK,GAAG,IAAoB;;CAGxD,SAAS,EAAc,GAAY,GAAI,GAAI,GAAM;EAC/C,IAAI,IAAI,KAAK,GACT,IAAI,KAAK;AACb,MAAI,CAAC,KAAc,IAAI,GAAG;GACxB,IAAI,IAAM;AAEV,GADA,IAAI,GACJ,IAAI;;EAEN,IAAI,IAAW;GAAK;GAAM;GAAG;AAI7B,SAHI,MACF,EAAQ,OAAO,IAEV;;CAGT,SAAS,EAAY,GAAY,GAAS;AACxC,SAAO,EAAa,GAAY,EAAQ,GAAG,EAAQ,GAAG,EAAQ,KAAK"}

package/dist/node_modules/graphlib/lib/index.js.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"index.js","names":[],"sources":["../../../../node_modules/graphlib/lib/index.js"],"sourcesContent":["// Includes only the \"core\" of graphlib\nmodule.exports = {\n Graph: require(\"./graph\"),\n version: require(\"./version\")\n};\n"],"x_google_ignoreList":[0],"mappings":";;;;;AACA,GAAO,UAAU;EACf,OAAA,GAAA;EACA,SAAA,GAAA;EACD"}

package/dist/node_modules/graphlib/lib/json.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"json.js","names":[],"sources":["../../../../node_modules/graphlib/lib/json.js"],"sourcesContent":["var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n write: write,\n read: read\n};\n\nfunction write(g) {\n var json = {\n options: {\n directed: g.isDirected(),\n multigraph: g.isMultigraph(),\n compound: g.isCompound()\n },\n nodes: writeNodes(g),\n edges: writeEdges(g)\n };\n if (!_.isUndefined(g.graph())) {\n json.value = _.clone(g.graph());\n }\n return json;\n}\n\nfunction writeNodes(g) {\n return _.map(g.nodes(), function(v) {\n var nodeValue = g.node(v);\n var parent = g.parent(v);\n var node = { v: v };\n if (!_.isUndefined(nodeValue)) {\n node.value = nodeValue;\n }\n if (!_.isUndefined(parent)) {\n node.parent = parent;\n }\n return node;\n });\n}\n\nfunction writeEdges(g) {\n return _.map(g.edges(), function(e) {\n var edgeValue = g.edge(e);\n var edge = { v: e.v, w: e.w };\n if (!_.isUndefined(e.name)) {\n edge.name = e.name;\n }\n if (!_.isUndefined(edgeValue)) {\n edge.value = edgeValue;\n }\n return edge;\n });\n}\n\nfunction read(json) {\n var g = new Graph(json.options).setGraph(json.value);\n _.each(json.nodes, function(entry) {\n g.setNode(entry.v, entry.value);\n if (entry.parent) {\n g.setParent(entry.v, entry.parent);\n }\n });\n _.each(json.edges, function(entry) {\n g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n });\n return g;\n}\n"],"x_google_ignoreList":[0],"mappings":";;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA;AAEJ,GAAO,UAAU;EACR;EACD;EACP;CAED,SAAS,EAAM,GAAG;EAChB,IAAI,IAAO;GACT,SAAS;IACP,UAAU,EAAE,YAAY;IACxB,YAAY,EAAE,cAAc;IAC5B,UAAU,EAAE,YAAY;IACzB;GACD,OAAO,EAAW,EAAE;GACpB,OAAO,EAAW,EAAE;GACrB;AAID,SAHK,EAAE,YAAY,EAAE,OAAO,CAAC,KAC3B,EAAK,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,GAE1B;;CAGT,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAClC,IAAI,IAAY,EAAE,KAAK,EAAE,EACrB,IAAS,EAAE,OAAO,EAAE,EACpB,IAAO,EAAK,MAAG;AAOnB,UANK,EAAE,YAAY,EAAU,KAC3B,EAAK,QAAQ,IAEV,EAAE,YAAY,EAAO,KACxB,EAAK,SAAS,IAET;IACP;;CAGJ,SAAS,EAAW,GAAG;AACrB,SAAO,EAAE,IAAI,EAAE,OAAO,EAAE,SAAS,GAAG;GAClC,IAAI,IAAY,EAAE,KAAK,EAAE,EACrB,IAAO;IAAE,GAAG,EAAE;IAAG,GAAG,EAAE;IAAG;AAO7B,UANK,EAAE,YAAY,EAAE,KAAK,KACxB,EAAK,OAAO,EAAE,OAEX,EAAE,YAAY,EAAU,KAC3B,EAAK,QAAQ,IAER;IACP;;CAGJ,SAAS,EAAK,GAAM;EAClB,IAAI,IAAI,IAAI,EAAM,EAAK,QAAQ,CAAC,SAAS,EAAK,MAAM;AAUpD,SATA,EAAE,KAAK,EAAK,OAAO,SAAS,GAAO;AAEjC,GADA,EAAE,QAAQ,EAAM,GAAG,EAAM,MAAM,EAC3B,EAAM,UACR,EAAE,UAAU,EAAM,GAAG,EAAM,OAAO;IAEpC,EACF,EAAE,KAAK,EAAK,OAAO,SAAS,GAAO;AACjC,KAAE,QAAQ;IAAE,GAAG,EAAM;IAAG,GAAG,EAAM;IAAG,MAAM,EAAM;IAAM,EAAE,EAAM,MAAM;IACpE,EACK"}

package/dist/node_modules/graphlib/lib/lodash.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"lodash.js","names":[],"sources":["../../../../node_modules/graphlib/lib/lodash.js"],"sourcesContent":["/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n try {\n lodash = {\n clone: require(\"lodash/clone\"),\n constant: require(\"lodash/constant\"),\n each: require(\"lodash/each\"),\n filter: require(\"lodash/filter\"),\n has: require(\"lodash/has\"),\n isArray: require(\"lodash/isArray\"),\n isEmpty: require(\"lodash/isEmpty\"),\n isFunction: require(\"lodash/isFunction\"),\n isUndefined: require(\"lodash/isUndefined\"),\n keys: require(\"lodash/keys\"),\n map: require(\"lodash/map\"),\n reduce: require(\"lodash/reduce\"),\n size: require(\"lodash/size\"),\n transform: require(\"lodash/transform\"),\n union: require(\"lodash/union\"),\n values: require(\"lodash/values\")\n };\n } catch (e) {\n // continue regardless of error\n }\n}\n\nif (!lodash) {\n lodash = window._;\n}\n\nmodule.exports = lodash;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;;;;;;;;;;;CAEA,IAAI;AAEJ,KAAI,OAAA,KAAmB,WACrB,KAAI;AACF,MAAS;GACP,OAAA,GAAA;GACA,UAAA,GAAA;GACA,MAAA,GAAA;GACA,QAAA,GAAA;GACA,KAAA,GAAA;GACA,SAAA,GAAA;GACA,SAAA,GAAA;GACA,YAAA,GAAA;GACA,aAAA,GAAA;GACA,MAAA,GAAA;GACA,KAAA,GAAA;GACA,QAAA,GAAA;GACA,MAAA,GAAA;GACA,WAAA,GAAA;GACA,OAAA,GAAA;GACA,QAAA,GAAA;GACD;SACS;AASd,CAJA,AACE,MAAS,OAAO,GAGlB,EAAO,UAAU"}

package/dist/node_modules/graphlib/lib/version.js.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"version.js","names":[],"sources":["../../../../node_modules/graphlib/lib/version.js"],"sourcesContent":["module.exports = '2.1.8';\n"],"x_google_ignoreList":[0],"mappings":";;;AAAA,GAAO,UAAU"}

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"}

package/dist/node_modules/lodash/_DataView.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_DataView.js","names":[],"sources":["../../../node_modules/lodash/_DataView.js"],"sourcesContent":["var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAMA,GAAO,UAFH,GAAA,CAAA,GAAA,EAA2B,WAAW"}

package/dist/node_modules/lodash/_Hash.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_Hash.js","names":[],"sources":["../../../node_modules/lodash/_Hash.js"],"sourcesContent":["var hashClear = require('./_hashClear'),\n hashDelete = require('./_hashDelete'),\n hashGet = require('./_hashGet'),\n hashHas = require('./_hashHas'),\n hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CASJ,SAAS,EAAK,GAAS;EACrB,IAAI,IAAQ,IACR,IAAS,KAAW,OAAO,IAAI,EAAQ;AAG3C,OADA,KAAK,OAAO,EACL,EAAE,IAAQ,IAAQ;GACvB,IAAI,IAAQ,EAAQ;AACpB,QAAK,IAAI,EAAM,IAAI,EAAM,GAAG;;;AAWhC,CANA,EAAK,UAAU,QAAQ,GACvB,EAAK,UAAU,SAAY,GAC3B,EAAK,UAAU,MAAM,GACrB,EAAK,UAAU,MAAM,GACrB,EAAK,UAAU,MAAM,GAErB,EAAO,UAAU"}

package/dist/node_modules/lodash/_ListCache.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_ListCache.js","names":[],"sources":["../../../node_modules/lodash/_ListCache.js"],"sourcesContent":["var listCacheClear = require('./_listCacheClear'),\n listCacheDelete = require('./_listCacheDelete'),\n listCacheGet = require('./_listCacheGet'),\n listCacheHas = require('./_listCacheHas'),\n listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CASJ,SAAS,EAAU,GAAS;EAC1B,IAAI,IAAQ,IACR,IAAS,KAAW,OAAO,IAAI,EAAQ;AAG3C,OADA,KAAK,OAAO,EACL,EAAE,IAAQ,IAAQ;GACvB,IAAI,IAAQ,EAAQ;AACpB,QAAK,IAAI,EAAM,IAAI,EAAM,GAAG;;;AAWhC,CANA,EAAU,UAAU,QAAQ,GAC5B,EAAU,UAAU,SAAY,GAChC,EAAU,UAAU,MAAM,GAC1B,EAAU,UAAU,MAAM,GAC1B,EAAU,UAAU,MAAM,GAE1B,EAAO,UAAU"}

package/dist/node_modules/lodash/_Map.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_Map.js","names":[],"sources":["../../../node_modules/lodash/_Map.js"],"sourcesContent":["var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAMA,GAAO,UAFH,GAAA,CAAA,GAAA,EAAsB,MAAM"}

package/dist/node_modules/lodash/_MapCache.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_MapCache.js","names":[],"sources":["../../../node_modules/lodash/_MapCache.js"],"sourcesContent":["var mapCacheClear = require('./_mapCacheClear'),\n mapCacheDelete = require('./_mapCacheDelete'),\n mapCacheGet = require('./_mapCacheGet'),\n mapCacheHas = require('./_mapCacheHas'),\n mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n var index = -1,\n length = entries == null ? 0 : entries.length;\n\n this.clear();\n while (++index < length) {\n var entry = entries[index];\n this.set(entry[0], entry[1]);\n }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CASJ,SAAS,EAAS,GAAS;EACzB,IAAI,IAAQ,IACR,IAAS,KAAW,OAAO,IAAI,EAAQ;AAG3C,OADA,KAAK,OAAO,EACL,EAAE,IAAQ,IAAQ;GACvB,IAAI,IAAQ,EAAQ;AACpB,QAAK,IAAI,EAAM,IAAI,EAAM,GAAG;;;AAWhC,CANA,EAAS,UAAU,QAAQ,GAC3B,EAAS,UAAU,SAAY,GAC/B,EAAS,UAAU,MAAM,GACzB,EAAS,UAAU,MAAM,GACzB,EAAS,UAAU,MAAM,GAEzB,EAAO,UAAU"}

package/dist/node_modules/lodash/_Promise.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_Promise.js","names":[],"sources":["../../../node_modules/lodash/_Promise.js"],"sourcesContent":["var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAMA,GAAO,UAFH,GAAA,CAAA,GAAA,EAA0B,UAAU"}

package/dist/node_modules/lodash/_Set.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_Set.js","names":[],"sources":["../../../node_modules/lodash/_Set.js"],"sourcesContent":["var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAMA,GAAO,UAFH,GAAA,CAAA,GAAA,EAAsB,MAAM"}

package/dist/node_modules/lodash/_SetCache.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_SetCache.js","names":[],"sources":["../../../node_modules/lodash/_SetCache.js"],"sourcesContent":["var MapCache = require('./_MapCache'),\n setCacheAdd = require('./_setCacheAdd'),\n setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n var index = -1,\n length = values == null ? 0 : values.length;\n\n this.__data__ = new MapCache;\n while (++index < length) {\n this.add(values[index]);\n }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CAUJ,SAAS,EAAS,GAAQ;EACxB,IAAI,IAAQ,IACR,IAAS,KAAU,OAAO,IAAI,EAAO;AAGzC,OADA,KAAK,WAAW,IAAI,GAAQ,EACrB,EAAE,IAAQ,GACf,MAAK,IAAI,EAAO,GAAO;;AAQ3B,CAHA,EAAS,UAAU,MAAM,EAAS,UAAU,OAAO,GACnD,EAAS,UAAU,MAAM,GAEzB,EAAO,UAAU"}

package/dist/node_modules/lodash/_Stack.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_Stack.js","names":[],"sources":["../../../node_modules/lodash/_Stack.js"],"sourcesContent":["var ListCache = require('./_ListCache'),\n stackClear = require('./_stackClear'),\n stackDelete = require('./_stackDelete'),\n stackGet = require('./_stackGet'),\n stackHas = require('./_stackHas'),\n stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n var data = this.__data__ = new ListCache(entries);\n this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n"],"x_google_ignoreList":[0],"mappings":";;;;;;;;;CAAA,IAAI,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA,EACA,IAAA,GAAA;CASJ,SAAS,EAAM,GAAS;AAEtB,OAAK,QADM,KAAK,WAAW,IAAI,EAAU,EAAQ,EAChC;;AAUnB,CANA,EAAM,UAAU,QAAQ,GACxB,EAAM,UAAU,SAAY,GAC5B,EAAM,UAAU,MAAM,GACtB,EAAM,UAAU,MAAM,GACtB,EAAM,UAAU,MAAM,GAEtB,EAAO,UAAU"}

package/dist/node_modules/lodash/_Symbol.js.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"_Symbol.js","names":[],"sources":["../../../node_modules/lodash/_Symbol.js"],"sourcesContent":["var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n"],"x_google_ignoreList":[0],"mappings":";;;;AAKA,GAAO,UAFH,GAAA,CAAc"}

package/dist/node_modules/lodash/_Uint8Array.js.map DELETED Viewed

	@@ -1 +0,0 @@
1	- {"version":3,"file":"_Uint8Array.js","names":[],"sources":["../../../node_modules/lodash/_Uint8Array.js"],"sourcesContent":["var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n"],"x_google_ignoreList":[0],"mappings":";;;;AAKA,GAAO,UAFH,GAAA,CAAkB"}

package/dist/node_modules/lodash/_WeakMap.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_WeakMap.js","names":[],"sources":["../../../node_modules/lodash/_WeakMap.js"],"sourcesContent":["var getNative = require('./_getNative'),\n root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n"],"x_google_ignoreList":[0],"mappings":";;;;;AAMA,GAAO,UAFH,GAAA,CAAA,GAAA,EAA0B,UAAU"}

package/dist/node_modules/lodash/_apply.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_apply.js","names":[],"sources":["../../../node_modules/lodash/_apply.js"],"sourcesContent":["/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n switch (args.length) {\n case 0: return func.call(thisArg);\n case 1: return func.call(thisArg, args[0]);\n case 2: return func.call(thisArg, args[0], args[1]);\n case 3: return func.call(thisArg, args[0], args[1], args[2]);\n }\n return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n"],"x_google_ignoreList":[0],"mappings":";;;CAUA,SAAS,EAAM,GAAM,GAAS,GAAM;AAClC,UAAQ,EAAK,QAAb;GACE,KAAK,EAAG,QAAO,EAAK,KAAK,EAAQ;GACjC,KAAK,EAAG,QAAO,EAAK,KAAK,GAAS,EAAK,GAAG;GAC1C,KAAK,EAAG,QAAO,EAAK,KAAK,GAAS,EAAK,IAAI,EAAK,GAAG;GACnD,KAAK,EAAG,QAAO,EAAK,KAAK,GAAS,EAAK,IAAI,EAAK,IAAI,EAAK,GAAG;;AAE9D,SAAO,EAAK,MAAM,GAAS,EAAK;;AAGlC,GAAO,UAAU"}

package/dist/node_modules/lodash/_arrayEach.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"_arrayEach.js","names":[],"sources":["../../../node_modules/lodash/_arrayEach.js"],"sourcesContent":["/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n var index = -1,\n length = array == null ? 0 : array.length;\n\n while (++index < length) {\n if (iteratee(array[index], index, array) === false) {\n break;\n }\n }\n return array;\n}\n\nmodule.exports = arrayEach;\n"],"x_google_ignoreList":[0],"mappings":";;;CASA,SAAS,EAAU,GAAO,GAAU;AAIlC,OAHA,IAAI,IAAQ,IACR,IAAS,KAAS,OAAO,IAAI,EAAM,QAEhC,EAAE,IAAQ,KACX,EAAS,EAAM,IAAQ,GAAO,EAAM,KAAK;AAI/C,SAAO;;AAGT,GAAO,UAAU"}