@ozdao/prometheus-framework 0.2.199 → 0.2.201

package/dist/prometheus-framework/node_modules/bignumber.js/bignumber.js

@@ -1,6 +1,6 @@
-var Ee = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, ce = Math.ceil, y = Math.floor, U = "[BigNumber Error] ", pe = U + "Number primitive has more than 15 significant digits: ", H = 1e14, N = 14, ae = 9007199254740991, he = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], J = 1e7, D = 1e9;
-function we(O) {
-  var E, _, R, g = h.prototype = { constructor: h, toString: null, valueOf: null }, T = new h(1), x = 20, S = 4, C = -7, k = 21, Q = -1e7, z = 1e7, Z = !1, b = 1, Y = 0, te = {
+var isNumeric = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, mathceil = Math.ceil, mathfloor = Math.floor, bignumberError = "[BigNumber Error] ", tooManyDigits = bignumberError + "Number primitive has more than 15 significant digits: ", BASE = 1e14, LOG_BASE = 14, MAX_SAFE_INTEGER = 9007199254740991, POWS_TEN = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], SQRT_BASE = 1e7, MAX = 1e9;
+function clone(configObject) {
+  var div, convertBase, parseNumeric, P = BigNumber2.prototype = { constructor: BigNumber2, toString: null, valueOf: null }, ONE = new BigNumber2(1), DECIMAL_PLACES = 20, ROUNDING_MODE = 4, TO_EXP_NEG = -7, TO_EXP_POS = 21, MIN_EXP = -1e7, MAX_EXP = 1e7, CRYPTO = false, MODULO_MODE = 1, POW_PRECISION = 0, FORMAT = {
     prefix: "",
     groupSize: 3,
     secondaryGroupSize: 0,
@@ -10,613 +10,1327 @@ function we(O) {
     fractionGroupSeparator: " ",
     // non-breaking space
     suffix: ""
-  }, K = "0123456789abcdefghijklmnopqrstuvwxyz", fe = !0;
-  function h(e, r) {
-    var i, s, t, l, c, n, f, u, o = this;
-    if (!(o instanceof h)) return new h(e, r);
-    if (r == null) {
-      if (e && e._isBigNumber === !0) {
-        o.s = e.s, !e.c || e.e > z ? o.c = o.e = null : e.e < Q ? o.c = [o.e = 0] : (o.e = e.e, o.c = e.c.slice());
+  }, ALPHABET = "0123456789abcdefghijklmnopqrstuvwxyz", alphabetHasNormalDecimalDigits = true;
+  function BigNumber2(v, b) {
+    var alphabet, c, caseChanged, e, i, isNum, len, str, x = this;
+    if (!(x instanceof BigNumber2)) return new BigNumber2(v, b);
+    if (b == null) {
+      if (v && v._isBigNumber === true) {
+        x.s = v.s;
+        if (!v.c || v.e > MAX_EXP) {
+          x.c = x.e = null;
+        } else if (v.e < MIN_EXP) {
+          x.c = [x.e = 0];
+        } else {
+          x.e = v.e;
+          x.c = v.c.slice();
+        }
         return;
       }
-      if ((n = typeof e == "number") && e * 0 == 0) {
-        if (o.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
-          for (l = 0, c = e; c >= 10; c /= 10, l++) ;
-          l > z ? o.c = o.e = null : (o.e = l, o.c = [e]);
+      if ((isNum = typeof v == "number") && v * 0 == 0) {
+        x.s = 1 / v < 0 ? (v = -v, -1) : 1;
+        if (v === ~~v) {
+          for (e = 0, i = v; i >= 10; i /= 10, e++) ;
+          if (e > MAX_EXP) {
+            x.c = x.e = null;
+          } else {
+            x.e = e;
+            x.c = [v];
+          }
           return;
         }
-        u = String(e);
+        str = String(v);
       } else {
-        if (!Ee.test(u = String(e))) return R(o, u, n);
-        o.s = u.charCodeAt(0) == 45 ? (u = u.slice(1), -1) : 1;
+        if (!isNumeric.test(str = String(v))) return parseNumeric(x, str, isNum);
+        x.s = str.charCodeAt(0) == 45 ? (str = str.slice(1), -1) : 1;
+      }
+      if ((e = str.indexOf(".")) > -1) str = str.replace(".", "");
+      if ((i = str.search(/e/i)) > 0) {
+        if (e < 0) e = i;
+        e += +str.slice(i + 1);
+        str = str.substring(0, i);
+      } else if (e < 0) {
+        e = str.length;
       }
-      (l = u.indexOf(".")) > -1 && (u = u.replace(".", "")), (c = u.search(/e/i)) > 0 ? (l < 0 && (l = c), l += +u.slice(c + 1), u = u.substring(0, c)) : l < 0 && (l = u.length);
     } else {
-      if (v(r, 2, K.length, "Base"), r == 10 && fe)
-        return o = new h(e), G(o, x + o.e + 1, S);
-      if (u = String(e), n = typeof e == "number") {
-        if (e * 0 != 0) return R(o, u, n, r);
-        if (o.s = 1 / e < 0 ? (u = u.slice(1), -1) : 1, h.DEBUG && u.replace(/^0\.0*|\./, "").length > 15)
-          throw Error(pe + e);
-      } else
-        o.s = u.charCodeAt(0) === 45 ? (u = u.slice(1), -1) : 1;
-      for (i = K.slice(0, r), l = c = 0, f = u.length; c < f; c++)
-        if (i.indexOf(s = u.charAt(c)) < 0) {
-          if (s == ".") {
-            if (c > l) {
-              l = f;
+      intCheck(b, 2, ALPHABET.length, "Base");
+      if (b == 10 && alphabetHasNormalDecimalDigits) {
+        x = new BigNumber2(v);
+        return round(x, DECIMAL_PLACES + x.e + 1, ROUNDING_MODE);
+      }
+      str = String(v);
+      if (isNum = typeof v == "number") {
+        if (v * 0 != 0) return parseNumeric(x, str, isNum, b);
+        x.s = 1 / v < 0 ? (str = str.slice(1), -1) : 1;
+        if (BigNumber2.DEBUG && str.replace(/^0\.0*|\./, "").length > 15) {
+          throw Error(tooManyDigits + v);
+        }
+      } else {
+        x.s = str.charCodeAt(0) === 45 ? (str = str.slice(1), -1) : 1;
+      }
+      alphabet = ALPHABET.slice(0, b);
+      e = i = 0;
+      for (len = str.length; i < len; i++) {
+        if (alphabet.indexOf(c = str.charAt(i)) < 0) {
+          if (c == ".") {
+            if (i > e) {
+              e = len;
+              continue;
+            }
+          } else if (!caseChanged) {
+            if (str == str.toUpperCase() && (str = str.toLowerCase()) || str == str.toLowerCase() && (str = str.toUpperCase())) {
+              caseChanged = true;
+              i = -1;
+              e = 0;
               continue;
             }
-          } else if (!t && (u == u.toUpperCase() && (u = u.toLowerCase()) || u == u.toLowerCase() && (u = u.toUpperCase()))) {
-            t = !0, c = -1, l = 0;
-            continue;
           }
-          return R(o, String(e), n, r);
-        }
-      n = !1, u = _(u, r, 10, o.s), (l = u.indexOf(".")) > -1 ? u = u.replace(".", "") : l = u.length;
-    }
-    for (c = 0; u.charCodeAt(c) === 48; c++) ;
-    for (f = u.length; u.charCodeAt(--f) === 48; ) ;
-    if (u = u.slice(c, ++f)) {
-      if (f -= c, n && h.DEBUG && f > 15 && (e > ae || e !== y(e)))
-        throw Error(pe + o.s * e);
-      if ((l = l - c - 1) > z)
-        o.c = o.e = null;
-      else if (l < Q)
-        o.c = [o.e = 0];
-      else {
-        if (o.e = l, o.c = [], c = (l + 1) % N, l < 0 && (c += N), c < f) {
-          for (c && o.c.push(+u.slice(0, c)), f -= N; c < f; )
-            o.c.push(+u.slice(c, c += N));
-          c = N - (u = u.slice(c)).length;
-        } else
-          c -= f;
-        for (; c--; u += "0") ;
-        o.c.push(+u);
-      }
-    } else
-      o.c = [o.e = 0];
+          return parseNumeric(x, String(v), isNum, b);
+        }
+      }
+      isNum = false;
+      str = convertBase(str, b, 10, x.s);
+      if ((e = str.indexOf(".")) > -1) str = str.replace(".", "");
+      else e = str.length;
+    }
+    for (i = 0; str.charCodeAt(i) === 48; i++) ;
+    for (len = str.length; str.charCodeAt(--len) === 48; ) ;
+    if (str = str.slice(i, ++len)) {
+      len -= i;
+      if (isNum && BigNumber2.DEBUG && len > 15 && (v > MAX_SAFE_INTEGER || v !== mathfloor(v))) {
+        throw Error(tooManyDigits + x.s * v);
+      }
+      if ((e = e - i - 1) > MAX_EXP) {
+        x.c = x.e = null;
+      } else if (e < MIN_EXP) {
+        x.c = [x.e = 0];
+      } else {
+        x.e = e;
+        x.c = [];
+        i = (e + 1) % LOG_BASE;
+        if (e < 0) i += LOG_BASE;
+        if (i < len) {
+          if (i) x.c.push(+str.slice(0, i));
+          for (len -= LOG_BASE; i < len; ) {
+            x.c.push(+str.slice(i, i += LOG_BASE));
+          }
+          i = LOG_BASE - (str = str.slice(i)).length;
+        } else {
+          i -= len;
+        }
+        for (; i--; str += "0") ;
+        x.c.push(+str);
+      }
+    } else {
+      x.c = [x.e = 0];
+    }
   }
-  h.clone = we, h.ROUND_UP = 0, h.ROUND_DOWN = 1, h.ROUND_CEIL = 2, h.ROUND_FLOOR = 3, h.ROUND_HALF_UP = 4, h.ROUND_HALF_DOWN = 5, h.ROUND_HALF_EVEN = 6, h.ROUND_HALF_CEIL = 7, h.ROUND_HALF_FLOOR = 8, h.EUCLID = 9, h.config = h.set = function(e) {
-    var r, i;
-    if (e != null)
-      if (typeof e == "object") {
-        if (e.hasOwnProperty(r = "DECIMAL_PLACES") && (i = e[r], v(i, 0, D, r), x = i), e.hasOwnProperty(r = "ROUNDING_MODE") && (i = e[r], v(i, 0, 8, r), S = i), e.hasOwnProperty(r = "EXPONENTIAL_AT") && (i = e[r], i && i.pop ? (v(i[0], -D, 0, r), v(i[1], 0, D, r), C = i[0], k = i[1]) : (v(i, -D, D, r), C = -(k = i < 0 ? -i : i))), e.hasOwnProperty(r = "RANGE"))
-          if (i = e[r], i && i.pop)
-            v(i[0], -D, -1, r), v(i[1], 1, D, r), Q = i[0], z = i[1];
-          else if (v(i, -D, D, r), i)
-            Q = -(z = i < 0 ? -i : i);
-          else
-            throw Error(U + r + " cannot be zero: " + i);
-        if (e.hasOwnProperty(r = "CRYPTO"))
-          if (i = e[r], i === !!i)
-            if (i)
-              if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
-                Z = i;
-              else
-                throw Z = !i, Error(U + "crypto unavailable");
-            else
-              Z = i;
-          else
-            throw Error(U + r + " not true or false: " + i);
-        if (e.hasOwnProperty(r = "MODULO_MODE") && (i = e[r], v(i, 0, 9, r), b = i), e.hasOwnProperty(r = "POW_PRECISION") && (i = e[r], v(i, 0, D, r), Y = i), e.hasOwnProperty(r = "FORMAT"))
-          if (i = e[r], typeof i == "object") te = i;
-          else throw Error(U + r + " not an object: " + i);
-        if (e.hasOwnProperty(r = "ALPHABET"))
-          if (i = e[r], typeof i == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(i))
-            fe = i.slice(0, 10) == "0123456789", K = i;
-          else
-            throw Error(U + r + " invalid: " + i);
-      } else
-        throw Error(U + "Object expected: " + e);
+  BigNumber2.clone = clone;
+  BigNumber2.ROUND_UP = 0;
+  BigNumber2.ROUND_DOWN = 1;
+  BigNumber2.ROUND_CEIL = 2;
+  BigNumber2.ROUND_FLOOR = 3;
+  BigNumber2.ROUND_HALF_UP = 4;
+  BigNumber2.ROUND_HALF_DOWN = 5;
+  BigNumber2.ROUND_HALF_EVEN = 6;
+  BigNumber2.ROUND_HALF_CEIL = 7;
+  BigNumber2.ROUND_HALF_FLOOR = 8;
+  BigNumber2.EUCLID = 9;
+  BigNumber2.config = BigNumber2.set = function(obj) {
+    var p, v;
+    if (obj != null) {
+      if (typeof obj == "object") {
+        if (obj.hasOwnProperty(p = "DECIMAL_PLACES")) {
+          v = obj[p];
+          intCheck(v, 0, MAX, p);
+          DECIMAL_PLACES = v;
+        }
+        if (obj.hasOwnProperty(p = "ROUNDING_MODE")) {
+          v = obj[p];
+          intCheck(v, 0, 8, p);
+          ROUNDING_MODE = v;
+        }
+        if (obj.hasOwnProperty(p = "EXPONENTIAL_AT")) {
+          v = obj[p];
+          if (v && v.pop) {
+            intCheck(v[0], -MAX, 0, p);
+            intCheck(v[1], 0, MAX, p);
+            TO_EXP_NEG = v[0];
+            TO_EXP_POS = v[1];
+          } else {
+            intCheck(v, -MAX, MAX, p);
+            TO_EXP_NEG = -(TO_EXP_POS = v < 0 ? -v : v);
+          }
+        }
+        if (obj.hasOwnProperty(p = "RANGE")) {
+          v = obj[p];
+          if (v && v.pop) {
+            intCheck(v[0], -MAX, -1, p);
+            intCheck(v[1], 1, MAX, p);
+            MIN_EXP = v[0];
+            MAX_EXP = v[1];
+          } else {
+            intCheck(v, -MAX, MAX, p);
+            if (v) {
+              MIN_EXP = -(MAX_EXP = v < 0 ? -v : v);
+            } else {
+              throw Error(bignumberError + p + " cannot be zero: " + v);
+            }
+          }
+        }
+        if (obj.hasOwnProperty(p = "CRYPTO")) {
+          v = obj[p];
+          if (v === !!v) {
+            if (v) {
+              if (typeof crypto != "undefined" && crypto && (crypto.getRandomValues || crypto.randomBytes)) {
+                CRYPTO = v;
+              } else {
+                CRYPTO = !v;
+                throw Error(bignumberError + "crypto unavailable");
+              }
+            } else {
+              CRYPTO = v;
+            }
+          } else {
+            throw Error(bignumberError + p + " not true or false: " + v);
+          }
+        }
+        if (obj.hasOwnProperty(p = "MODULO_MODE")) {
+          v = obj[p];
+          intCheck(v, 0, 9, p);
+          MODULO_MODE = v;
+        }
+        if (obj.hasOwnProperty(p = "POW_PRECISION")) {
+          v = obj[p];
+          intCheck(v, 0, MAX, p);
+          POW_PRECISION = v;
+        }
+        if (obj.hasOwnProperty(p = "FORMAT")) {
+          v = obj[p];
+          if (typeof v == "object") FORMAT = v;
+          else throw Error(bignumberError + p + " not an object: " + v);
+        }
+        if (obj.hasOwnProperty(p = "ALPHABET")) {
+          v = obj[p];
+          if (typeof v == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(v)) {
+            alphabetHasNormalDecimalDigits = v.slice(0, 10) == "0123456789";
+            ALPHABET = v;
+          } else {
+            throw Error(bignumberError + p + " invalid: " + v);
+          }
+        }
+      } else {
+        throw Error(bignumberError + "Object expected: " + obj);
+      }
+    }
     return {
-      DECIMAL_PLACES: x,
-      ROUNDING_MODE: S,
-      EXPONENTIAL_AT: [C, k],
-      RANGE: [Q, z],
-      CRYPTO: Z,
-      MODULO_MODE: b,
-      POW_PRECISION: Y,
-      FORMAT: te,
-      ALPHABET: K
+      DECIMAL_PLACES,
+      ROUNDING_MODE,
+      EXPONENTIAL_AT: [TO_EXP_NEG, TO_EXP_POS],
+      RANGE: [MIN_EXP, MAX_EXP],
+      CRYPTO,
+      MODULO_MODE,
+      POW_PRECISION,
+      FORMAT,
+      ALPHABET
     };
-  }, h.isBigNumber = function(e) {
-    if (!e || e._isBigNumber !== !0) return !1;
-    if (!h.DEBUG) return !0;
-    var r, i, s = e.c, t = e.e, l = e.s;
-    e: if ({}.toString.call(s) == "[object Array]") {
-      if ((l === 1 || l === -1) && t >= -D && t <= D && t === y(t)) {
-        if (s[0] === 0) {
-          if (t === 0 && s.length === 1) return !0;
-          break e;
-        }
-        if (r = (t + 1) % N, r < 1 && (r += N), String(s[0]).length == r) {
-          for (r = 0; r < s.length; r++)
-            if (i = s[r], i < 0 || i >= H || i !== y(i)) break e;
-          if (i !== 0) return !0;
-        }
-      }
-    } else if (s === null && t === null && (l === null || l === 1 || l === -1))
-      return !0;
-    throw Error(U + "Invalid BigNumber: " + e);
-  }, h.maximum = h.max = function() {
-    return ge(arguments, -1);
-  }, h.minimum = h.min = function() {
-    return ge(arguments, 1);
-  }, h.random = function() {
-    var e = 9007199254740992, r = Math.random() * e & 2097151 ? function() {
-      return y(Math.random() * e);
+  };
+  BigNumber2.isBigNumber = function(v) {
+    if (!v || v._isBigNumber !== true) return false;
+    if (!BigNumber2.DEBUG) return true;
+    var i, n, c = v.c, e = v.e, s = v.s;
+    out: if ({}.toString.call(c) == "[object Array]") {
+      if ((s === 1 || s === -1) && e >= -MAX && e <= MAX && e === mathfloor(e)) {
+        if (c[0] === 0) {
+          if (e === 0 && c.length === 1) return true;
+          break out;
+        }
+        i = (e + 1) % LOG_BASE;
+        if (i < 1) i += LOG_BASE;
+        if (String(c[0]).length == i) {
+          for (i = 0; i < c.length; i++) {
+            n = c[i];
+            if (n < 0 || n >= BASE || n !== mathfloor(n)) break out;
+          }
+          if (n !== 0) return true;
+        }
+      }
+    } else if (c === null && e === null && (s === null || s === 1 || s === -1)) {
+      return true;
+    }
+    throw Error(bignumberError + "Invalid BigNumber: " + v);
+  };
+  BigNumber2.maximum = BigNumber2.max = function() {
+    return maxOrMin(arguments, -1);
+  };
+  BigNumber2.minimum = BigNumber2.min = function() {
+    return maxOrMin(arguments, 1);
+  };
+  BigNumber2.random = function() {
+    var pow2_53 = 9007199254740992;
+    var random53bitInt = Math.random() * pow2_53 & 2097151 ? function() {
+      return mathfloor(Math.random() * pow2_53);
     } : function() {
       return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
     };
-    return function(i) {
-      var s, t, l, c, n, f = 0, u = [], o = new h(T);
-      if (i == null ? i = x : v(i, 0, D), c = ce(i / N), Z)
+    return function(dp) {
+      var a, b, e, k, v, i = 0, c = [], rand = new BigNumber2(ONE);
+      if (dp == null) dp = DECIMAL_PLACES;
+      else intCheck(dp, 0, MAX);
+      k = mathceil(dp / LOG_BASE);
+      if (CRYPTO) {
         if (crypto.getRandomValues) {
-          for (s = crypto.getRandomValues(new Uint32Array(c *= 2)); f < c; )
-            n = s[f] * 131072 + (s[f + 1] >>> 11), n >= 9e15 ? (t = crypto.getRandomValues(new Uint32Array(2)), s[f] = t[0], s[f + 1] = t[1]) : (u.push(n % 1e14), f += 2);
-          f = c / 2;
+          a = crypto.getRandomValues(new Uint32Array(k *= 2));
+          for (; i < k; ) {
+            v = a[i] * 131072 + (a[i + 1] >>> 11);
+            if (v >= 9e15) {
+              b = crypto.getRandomValues(new Uint32Array(2));
+              a[i] = b[0];
+              a[i + 1] = b[1];
+            } else {
+              c.push(v % 1e14);
+              i += 2;
+            }
+          }
+          i = k / 2;
         } else if (crypto.randomBytes) {
-          for (s = crypto.randomBytes(c *= 7); f < c; )
-            n = (s[f] & 31) * 281474976710656 + s[f + 1] * 1099511627776 + s[f + 2] * 4294967296 + s[f + 3] * 16777216 + (s[f + 4] << 16) + (s[f + 5] << 8) + s[f + 6], n >= 9e15 ? crypto.randomBytes(7).copy(s, f) : (u.push(n % 1e14), f += 7);
-          f = c / 7;
-        } else
-          throw Z = !1, Error(U + "crypto unavailable");
-      if (!Z)
-        for (; f < c; )
-          n = r(), n < 9e15 && (u[f++] = n % 1e14);
-      for (c = u[--f], i %= N, c && i && (n = he[N - i], u[f] = y(c / n) * n); u[f] === 0; u.pop(), f--) ;
-      if (f < 0)
-        u = [l = 0];
-      else {
-        for (l = -1; u[0] === 0; u.splice(0, 1), l -= N) ;
-        for (f = 1, n = u[0]; n >= 10; n /= 10, f++) ;
-        f < N && (l -= N - f);
-      }
-      return o.e = l, o.c = u, o;
+          a = crypto.randomBytes(k *= 7);
+          for (; i < k; ) {
+            v = (a[i] & 31) * 281474976710656 + a[i + 1] * 1099511627776 + a[i + 2] * 4294967296 + a[i + 3] * 16777216 + (a[i + 4] << 16) + (a[i + 5] << 8) + a[i + 6];
+            if (v >= 9e15) {
+              crypto.randomBytes(7).copy(a, i);
+            } else {
+              c.push(v % 1e14);
+              i += 7;
+            }
+          }
+          i = k / 7;
+        } else {
+          CRYPTO = false;
+          throw Error(bignumberError + "crypto unavailable");
+        }
+      }
+      if (!CRYPTO) {
+        for (; i < k; ) {
+          v = random53bitInt();
+          if (v < 9e15) c[i++] = v % 1e14;
+        }
+      }
+      k = c[--i];
+      dp %= LOG_BASE;
+      if (k && dp) {
+        v = POWS_TEN[LOG_BASE - dp];
+        c[i] = mathfloor(k / v) * v;
+      }
+      for (; c[i] === 0; c.pop(), i--) ;
+      if (i < 0) {
+        c = [e = 0];
+      } else {
+        for (e = -1; c[0] === 0; c.splice(0, 1), e -= LOG_BASE) ;
+        for (i = 1, v = c[0]; v >= 10; v /= 10, i++) ;
+        if (i < LOG_BASE) e -= LOG_BASE - i;
+      }
+      rand.e = e;
+      rand.c = c;
+      return rand;
     };
-  }(), h.sum = function() {
-    for (var e = 1, r = arguments, i = new h(r[0]); e < r.length; ) i = i.plus(r[e++]);
-    return i;
-  }, _ = /* @__PURE__ */ function() {
-    var e = "0123456789";
-    function r(i, s, t, l) {
-      for (var c, n = [0], f, u = 0, o = i.length; u < o; ) {
-        for (f = n.length; f--; n[f] *= s) ;
-        for (n[0] += l.indexOf(i.charAt(u++)), c = 0; c < n.length; c++)
-          n[c] > t - 1 && (n[c + 1] == null && (n[c + 1] = 0), n[c + 1] += n[c] / t | 0, n[c] %= t);
-      }
-      return n.reverse();
-    }
-    return function(i, s, t, l, c) {
-      var n, f, u, o, a, p, w, A, B = i.indexOf("."), M = x, m = S;
-      for (B >= 0 && (o = Y, Y = 0, i = i.replace(".", ""), A = new h(s), p = A.pow(i.length - B), Y = o, A.c = r(
-        W(q(p.c), p.e, "0"),
-        10,
-        t,
-        e
-      ), A.e = A.c.length), w = r(i, s, t, c ? (n = K, e) : (n = e, K)), u = o = w.length; w[--o] == 0; w.pop()) ;
-      if (!w[0]) return n.charAt(0);
-      if (B < 0 ? --u : (p.c = w, p.e = u, p.s = l, p = E(p, A, M, m, t), w = p.c, a = p.r, u = p.e), f = u + M + 1, B = w[f], o = t / 2, a = a || f < 0 || w[f + 1] != null, a = m < 4 ? (B != null || a) && (m == 0 || m == (p.s < 0 ? 3 : 2)) : B > o || B == o && (m == 4 || a || m == 6 && w[f - 1] & 1 || m == (p.s < 0 ? 8 : 7)), f < 1 || !w[0])
-        i = a ? W(n.charAt(1), -M, n.charAt(0)) : n.charAt(0);
-      else {
-        if (w.length = f, a)
-          for (--t; ++w[--f] > t; )
-            w[f] = 0, f || (++u, w = [1].concat(w));
-        for (o = w.length; !w[--o]; ) ;
-        for (B = 0, i = ""; B <= o; i += n.charAt(w[B++])) ;
-        i = W(i, u, n.charAt(0));
-      }
-      return i;
+  }();
+  BigNumber2.sum = function() {
+    var i = 1, args = arguments, sum = new BigNumber2(args[0]);
+    for (; i < args.length; ) sum = sum.plus(args[i++]);
+    return sum;
+  };
+  convertBase = /* @__PURE__ */ function() {
+    var decimal = "0123456789";
+    function toBaseOut(str, baseIn, baseOut, alphabet) {
+      var j, arr = [0], arrL, i = 0, len = str.length;
+      for (; i < len; ) {
+        for (arrL = arr.length; arrL--; arr[arrL] *= baseIn) ;
+        arr[0] += alphabet.indexOf(str.charAt(i++));
+        for (j = 0; j < arr.length; j++) {
+          if (arr[j] > baseOut - 1) {
+            if (arr[j + 1] == null) arr[j + 1] = 0;
+            arr[j + 1] += arr[j] / baseOut | 0;
+            arr[j] %= baseOut;
+          }
+        }
+      }
+      return arr.reverse();
+    }
+    return function(str, baseIn, baseOut, sign, callerIsToString) {
+      var alphabet, d, e, k, r, x, xc, y, i = str.indexOf("."), dp = DECIMAL_PLACES, rm = ROUNDING_MODE;
+      if (i >= 0) {
+        k = POW_PRECISION;
+        POW_PRECISION = 0;
+        str = str.replace(".", "");
+        y = new BigNumber2(baseIn);
+        x = y.pow(str.length - i);
+        POW_PRECISION = k;
+        y.c = toBaseOut(
+          toFixedPoint(coeffToString(x.c), x.e, "0"),
+          10,
+          baseOut,
+          decimal
+        );
+        y.e = y.c.length;
+      }
+      xc = toBaseOut(str, baseIn, baseOut, callerIsToString ? (alphabet = ALPHABET, decimal) : (alphabet = decimal, ALPHABET));
+      e = k = xc.length;
+      for (; xc[--k] == 0; xc.pop()) ;
+      if (!xc[0]) return alphabet.charAt(0);
+      if (i < 0) {
+        --e;
+      } else {
+        x.c = xc;
+        x.e = e;
+        x.s = sign;
+        x = div(x, y, dp, rm, baseOut);
+        xc = x.c;
+        r = x.r;
+        e = x.e;
+      }
+      d = e + dp + 1;
+      i = xc[d];
+      k = baseOut / 2;
+      r = r || d < 0 || xc[d + 1] != null;
+      r = rm < 4 ? (i != null || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : i > k || i == k && (rm == 4 || r || rm == 6 && xc[d - 1] & 1 || rm == (x.s < 0 ? 8 : 7));
+      if (d < 1 || !xc[0]) {
+        str = r ? toFixedPoint(alphabet.charAt(1), -dp, alphabet.charAt(0)) : alphabet.charAt(0);
+      } else {
+        xc.length = d;
+        if (r) {
+          for (--baseOut; ++xc[--d] > baseOut; ) {
+            xc[d] = 0;
+            if (!d) {
+              ++e;
+              xc = [1].concat(xc);
+            }
+          }
+        }
+        for (k = xc.length; !xc[--k]; ) ;
+        for (i = 0, str = ""; i <= k; str += alphabet.charAt(xc[i++])) ;
+        str = toFixedPoint(str, e, alphabet.charAt(0));
+      }
+      return str;
     };
-  }(), E = /* @__PURE__ */ function() {
-    function e(s, t, l) {
-      var c, n, f, u, o = 0, a = s.length, p = t % J, w = t / J | 0;
-      for (s = s.slice(); a--; )
-        f = s[a] % J, u = s[a] / J | 0, c = w * f + u * p, n = p * f + c % J * J + o, o = (n / l | 0) + (c / J | 0) + w * u, s[a] = n % l;
-      return o && (s = [o].concat(s)), s;
-    }
-    function r(s, t, l, c) {
-      var n, f;
-      if (l != c)
-        f = l > c ? 1 : -1;
-      else
-        for (n = f = 0; n < l; n++)
-          if (s[n] != t[n]) {
-            f = s[n] > t[n] ? 1 : -1;
+  }();
+  div = /* @__PURE__ */ function() {
+    function multiply(x, k, base) {
+      var m, temp, xlo, xhi, carry = 0, i = x.length, klo = k % SQRT_BASE, khi = k / SQRT_BASE | 0;
+      for (x = x.slice(); i--; ) {
+        xlo = x[i] % SQRT_BASE;
+        xhi = x[i] / SQRT_BASE | 0;
+        m = khi * xlo + xhi * klo;
+        temp = klo * xlo + m % SQRT_BASE * SQRT_BASE + carry;
+        carry = (temp / base | 0) + (m / SQRT_BASE | 0) + khi * xhi;
+        x[i] = temp % base;
+      }
+      if (carry) x = [carry].concat(x);
+      return x;
+    }
+    function compare2(a, b, aL, bL) {
+      var i, cmp;
+      if (aL != bL) {
+        cmp = aL > bL ? 1 : -1;
+      } else {
+        for (i = cmp = 0; i < aL; i++) {
+          if (a[i] != b[i]) {
+            cmp = a[i] > b[i] ? 1 : -1;
             break;
           }
-      return f;
+        }
+      }
+      return cmp;
     }
-    function i(s, t, l, c) {
-      for (var n = 0; l--; )
-        s[l] -= n, n = s[l] < t[l] ? 1 : 0, s[l] = n * c + s[l] - t[l];
-      for (; !s[0] && s.length > 1; s.splice(0, 1)) ;
+    function subtract(a, b, aL, base) {
+      var i = 0;
+      for (; aL--; ) {
+        a[aL] -= i;
+        i = a[aL] < b[aL] ? 1 : 0;
+        a[aL] = i * base + a[aL] - b[aL];
+      }
+      for (; !a[0] && a.length > 1; a.splice(0, 1)) ;
     }
-    return function(s, t, l, c, n) {
-      var f, u, o, a, p, w, A, B, M, m, d, P, re, se, ue, X, ee, F = s.s == t.s ? 1 : -1, L = s.c, I = t.c;
-      if (!L || !L[0] || !I || !I[0])
-        return new h(
+    return function(x, y, dp, rm, base) {
+      var cmp, e, i, more, n, prod, prodL, q, qc, rem, remL, rem0, xi, xL, yc0, yL, yz, s = x.s == y.s ? 1 : -1, xc = x.c, yc = y.c;
+      if (!xc || !xc[0] || !yc || !yc[0]) {
+        return new BigNumber2(
           // Return NaN if either NaN, or both Infinity or 0.
-          !s.s || !t.s || (L ? I && L[0] == I[0] : !I) ? NaN : (
+          !x.s || !y.s || (xc ? yc && xc[0] == yc[0] : !yc) ? NaN : (
             // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
-            L && L[0] == 0 || !I ? F * 0 : F / 0
+            xc && xc[0] == 0 || !yc ? s * 0 : s / 0
           )
         );
-      for (B = new h(F), M = B.c = [], u = s.e - t.e, F = l + u + 1, n || (n = H, u = $(s.e / N) - $(t.e / N), F = F / N | 0), o = 0; I[o] == (L[o] || 0); o++) ;
-      if (I[o] > (L[o] || 0) && u--, F < 0)
-        M.push(1), a = !0;
-      else {
-        for (se = L.length, X = I.length, o = 0, F += 2, p = y(n / (I[0] + 1)), p > 1 && (I = e(I, p, n), L = e(L, p, n), X = I.length, se = L.length), re = X, m = L.slice(0, X), d = m.length; d < X; m[d++] = 0) ;
-        ee = I.slice(), ee = [0].concat(ee), ue = I[0], I[1] >= n / 2 && ue++;
+      }
+      q = new BigNumber2(s);
+      qc = q.c = [];
+      e = x.e - y.e;
+      s = dp + e + 1;
+      if (!base) {
+        base = BASE;
+        e = bitFloor(x.e / LOG_BASE) - bitFloor(y.e / LOG_BASE);
+        s = s / LOG_BASE | 0;
+      }
+      for (i = 0; yc[i] == (xc[i] || 0); i++) ;
+      if (yc[i] > (xc[i] || 0)) e--;
+      if (s < 0) {
+        qc.push(1);
+        more = true;
+      } else {
+        xL = xc.length;
+        yL = yc.length;
+        i = 0;
+        s += 2;
+        n = mathfloor(base / (yc[0] + 1));
+        if (n > 1) {
+          yc = multiply(yc, n, base);
+          xc = multiply(xc, n, base);
+          yL = yc.length;
+          xL = xc.length;
+        }
+        xi = yL;
+        rem = xc.slice(0, yL);
+        remL = rem.length;
+        for (; remL < yL; rem[remL++] = 0) ;
+        yz = yc.slice();
+        yz = [0].concat(yz);
+        yc0 = yc[0];
+        if (yc[1] >= base / 2) yc0++;
         do {
-          if (p = 0, f = r(I, m, X, d), f < 0) {
-            if (P = m[0], X != d && (P = P * n + (m[1] || 0)), p = y(P / ue), p > 1)
-              for (p >= n && (p = n - 1), w = e(I, p, n), A = w.length, d = m.length; r(w, m, A, d) == 1; )
-                p--, i(w, X < A ? ee : I, A, n), A = w.length, f = 1;
-            else
-              p == 0 && (f = p = 1), w = I.slice(), A = w.length;
-            if (A < d && (w = [0].concat(w)), i(m, w, d, n), d = m.length, f == -1)
-              for (; r(I, m, X, d) < 1; )
-                p++, i(m, X < d ? ee : I, d, n), d = m.length;
-          } else f === 0 && (p++, m = [0]);
-          M[o++] = p, m[0] ? m[d++] = L[re] || 0 : (m = [L[re]], d = 1);
-        } while ((re++ < se || m[0] != null) && F--);
-        a = m[0] != null, M[0] || M.splice(0, 1);
-      }
-      if (n == H) {
-        for (o = 1, F = M[0]; F >= 10; F /= 10, o++) ;
-        G(B, l + (B.e = o + u * N - 1) + 1, c, a);
-      } else
-        B.e = u, B.r = +a;
-      return B;
+          n = 0;
+          cmp = compare2(yc, rem, yL, remL);
+          if (cmp < 0) {
+            rem0 = rem[0];
+            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);
+            n = mathfloor(rem0 / yc0);
+            if (n > 1) {
+              if (n >= base) n = base - 1;
+              prod = multiply(yc, n, base);
+              prodL = prod.length;
+              remL = rem.length;
+              while (compare2(prod, rem, prodL, remL) == 1) {
+                n--;
+                subtract(prod, yL < prodL ? yz : yc, prodL, base);
+                prodL = prod.length;
+                cmp = 1;
+              }
+            } else {
+              if (n == 0) {
+                cmp = n = 1;
+              }
+              prod = yc.slice();
+              prodL = prod.length;
+            }
+            if (prodL < remL) prod = [0].concat(prod);
+            subtract(rem, prod, remL, base);
+            remL = rem.length;
+            if (cmp == -1) {
+              while (compare2(yc, rem, yL, remL) < 1) {
+                n++;
+                subtract(rem, yL < remL ? yz : yc, remL, base);
+                remL = rem.length;
+              }
+            }
+          } else if (cmp === 0) {
+            n++;
+            rem = [0];
+          }
+          qc[i++] = n;
+          if (rem[0]) {
+            rem[remL++] = xc[xi] || 0;
+          } else {
+            rem = [xc[xi]];
+            remL = 1;
+          }
+        } while ((xi++ < xL || rem[0] != null) && s--);
+        more = rem[0] != null;
+        if (!qc[0]) qc.splice(0, 1);
+      }
+      if (base == BASE) {
+        for (i = 1, s = qc[0]; s >= 10; s /= 10, i++) ;
+        round(q, dp + (q.e = i + e * LOG_BASE - 1) + 1, rm, more);
+      } else {
+        q.e = e;
+        q.r = +more;
+      }
+      return q;
     };
   }();
-  function le(e, r, i, s) {
-    var t, l, c, n, f;
-    if (i == null ? i = S : v(i, 0, 8), !e.c) return e.toString();
-    if (t = e.c[0], c = e.e, r == null)
-      f = q(e.c), f = s == 1 || s == 2 && (c <= C || c >= k) ? ne(f, c) : W(f, c, "0");
-    else if (e = G(new h(e), r, i), l = e.e, f = q(e.c), n = f.length, s == 1 || s == 2 && (r <= l || l <= C)) {
-      for (; n < r; f += "0", n++) ;
-      f = ne(f, l);
-    } else if (r -= c, f = W(f, l, "0"), l + 1 > n) {
-      if (--r > 0) for (f += "."; r--; f += "0") ;
-    } else if (r += l - n, r > 0)
-      for (l + 1 == n && (f += "."); r--; f += "0") ;
-    return e.s < 0 && t ? "-" + f : f;
+  function format(n, i, rm, id) {
+    var c0, e, ne, len, str;
+    if (rm == null) rm = ROUNDING_MODE;
+    else intCheck(rm, 0, 8);
+    if (!n.c) return n.toString();
+    c0 = n.c[0];
+    ne = n.e;
+    if (i == null) {
+      str = coeffToString(n.c);
+      str = id == 1 || id == 2 && (ne <= TO_EXP_NEG || ne >= TO_EXP_POS) ? toExponential(str, ne) : toFixedPoint(str, ne, "0");
+    } else {
+      n = round(new BigNumber2(n), i, rm);
+      e = n.e;
+      str = coeffToString(n.c);
+      len = str.length;
+      if (id == 1 || id == 2 && (i <= e || e <= TO_EXP_NEG)) {
+        for (; len < i; str += "0", len++) ;
+        str = toExponential(str, e);
+      } else {
+        i -= ne;
+        str = toFixedPoint(str, e, "0");
+        if (e + 1 > len) {
+          if (--i > 0) for (str += "."; i--; str += "0") ;
+        } else {
+          i += e - len;
+          if (i > 0) {
+            if (e + 1 == len) str += ".";
+            for (; i--; str += "0") ;
+          }
+        }
+      }
+    }
+    return n.s < 0 && c0 ? "-" + str : str;
   }
-  function ge(e, r) {
-    for (var i, s, t = 1, l = new h(e[0]); t < e.length; t++)
-      s = new h(e[t]), (!s.s || (i = j(l, s)) === r || i === 0 && l.s === r) && (l = s);
-    return l;
+  function maxOrMin(args, n) {
+    var k, y, i = 1, x = new BigNumber2(args[0]);
+    for (; i < args.length; i++) {
+      y = new BigNumber2(args[i]);
+      if (!y.s || (k = compare(x, y)) === n || k === 0 && x.s === n) {
+        x = y;
+      }
+    }
+    return x;
   }
-  function oe(e, r, i) {
-    for (var s = 1, t = r.length; !r[--t]; r.pop()) ;
-    for (t = r[0]; t >= 10; t /= 10, s++) ;
-    return (i = s + i * N - 1) > z ? e.c = e.e = null : i < Q ? e.c = [e.e = 0] : (e.e = i, e.c = r), e;
+  function normalise(n, c, e) {
+    var i = 1, j = c.length;
+    for (; !c[--j]; c.pop()) ;
+    for (j = c[0]; j >= 10; j /= 10, i++) ;
+    if ((e = i + e * LOG_BASE - 1) > MAX_EXP) {
+      n.c = n.e = null;
+    } else if (e < MIN_EXP) {
+      n.c = [n.e = 0];
+    } else {
+      n.e = e;
+      n.c = c;
+    }
+    return n;
   }
-  R = /* @__PURE__ */ function() {
-    var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, r = /^([^.]+)\.$/, i = /^\.([^.]+)$/, s = /^-?(Infinity|NaN)$/, t = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-    return function(l, c, n, f) {
-      var u, o = n ? c : c.replace(t, "");
-      if (s.test(o))
-        l.s = isNaN(o) ? null : o < 0 ? -1 : 1;
-      else {
-        if (!n && (o = o.replace(e, function(a, p, w) {
-          return u = (w = w.toLowerCase()) == "x" ? 16 : w == "b" ? 2 : 8, !f || f == u ? p : a;
-        }), f && (u = f, o = o.replace(r, "$1").replace(i, "0.$1")), c != o))
-          return new h(o, u);
-        if (h.DEBUG)
-          throw Error(U + "Not a" + (f ? " base " + f : "") + " number: " + c);
-        l.s = null;
-      }
-      l.c = l.e = null;
+  parseNumeric = /* @__PURE__ */ function() {
+    var basePrefix = /^(-?)0([xbo])(?=\w[\w.]*$)/i, dotAfter = /^([^.]+)\.$/, dotBefore = /^\.([^.]+)$/, isInfinityOrNaN = /^-?(Infinity|NaN)$/, whitespaceOrPlus = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+    return function(x, str, isNum, b) {
+      var base, s = isNum ? str : str.replace(whitespaceOrPlus, "");
+      if (isInfinityOrNaN.test(s)) {
+        x.s = isNaN(s) ? null : s < 0 ? -1 : 1;
+      } else {
+        if (!isNum) {
+          s = s.replace(basePrefix, function(m, p1, p2) {
+            base = (p2 = p2.toLowerCase()) == "x" ? 16 : p2 == "b" ? 2 : 8;
+            return !b || b == base ? p1 : m;
+          });
+          if (b) {
+            base = b;
+            s = s.replace(dotAfter, "$1").replace(dotBefore, "0.$1");
+          }
+          if (str != s) return new BigNumber2(s, base);
+        }
+        if (BigNumber2.DEBUG) {
+          throw Error(bignumberError + "Not a" + (b ? " base " + b : "") + " number: " + str);
+        }
+        x.s = null;
+      }
+      x.c = x.e = null;
     };
   }();
-  function G(e, r, i, s) {
-    var t, l, c, n, f, u, o, a = e.c, p = he;
-    if (a) {
-      e: {
-        for (t = 1, n = a[0]; n >= 10; n /= 10, t++) ;
-        if (l = r - t, l < 0)
-          l += N, c = r, f = a[u = 0], o = y(f / p[t - c - 1] % 10);
-        else if (u = ce((l + 1) / N), u >= a.length)
-          if (s) {
-            for (; a.length <= u; a.push(0)) ;
-            f = o = 0, t = 1, l %= N, c = l - N + 1;
-          } else
-            break e;
-        else {
-          for (f = n = a[u], t = 1; n >= 10; n /= 10, t++) ;
-          l %= N, c = l - N + t, o = c < 0 ? 0 : y(f / p[t - c - 1] % 10);
-        }
-        if (s = s || r < 0 || // Are there any non-zero digits after the rounding digit?
+  function round(x, sd, rm, r) {
+    var d, i, j, k, n, ni, rd, xc = x.c, pows10 = POWS_TEN;
+    if (xc) {
+      out: {
+        for (d = 1, k = xc[0]; k >= 10; k /= 10, d++) ;
+        i = sd - d;
+        if (i < 0) {
+          i += LOG_BASE;
+          j = sd;
+          n = xc[ni = 0];
+          rd = mathfloor(n / pows10[d - j - 1] % 10);
+        } else {
+          ni = mathceil((i + 1) / LOG_BASE);
+          if (ni >= xc.length) {
+            if (r) {
+              for (; xc.length <= ni; xc.push(0)) ;
+              n = rd = 0;
+              d = 1;
+              i %= LOG_BASE;
+              j = i - LOG_BASE + 1;
+            } else {
+              break out;
+            }
+          } else {
+            n = k = xc[ni];
+            for (d = 1; k >= 10; k /= 10, d++) ;
+            i %= LOG_BASE;
+            j = i - LOG_BASE + d;
+            rd = j < 0 ? 0 : mathfloor(n / pows10[d - j - 1] % 10);
+          }
+        }
+        r = r || sd < 0 || // Are there any non-zero digits after the rounding digit?
         // The expression  n % pows10[d - j - 1]  returns all digits of n to the right
         // of the digit at j, e.g. if n is 908714 and j is 2, the expression gives 714.
-        a[u + 1] != null || (c < 0 ? f : f % p[t - c - 1]), s = i < 4 ? (o || s) && (i == 0 || i == (e.s < 0 ? 3 : 2)) : o > 5 || o == 5 && (i == 4 || s || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (l > 0 ? c > 0 ? f / p[t - c] : 0 : a[u - 1]) % 10 & 1 || i == (e.s < 0 ? 8 : 7)), r < 1 || !a[0])
-          return a.length = 0, s ? (r -= e.e + 1, a[0] = p[(N - r % N) % N], e.e = -r || 0) : a[0] = e.e = 0, e;
-        if (l == 0 ? (a.length = u, n = 1, u--) : (a.length = u + 1, n = p[N - l], a[u] = c > 0 ? y(f / p[t - c] % p[c]) * n : 0), s)
-          for (; ; )
-            if (u == 0) {
-              for (l = 1, c = a[0]; c >= 10; c /= 10, l++) ;
-              for (c = a[0] += n, n = 1; c >= 10; c /= 10, n++) ;
-              l != n && (e.e++, a[0] == H && (a[0] = 1));
+        xc[ni + 1] != null || (j < 0 ? n : n % pows10[d - j - 1]);
+        r = rm < 4 ? (rd || r) && (rm == 0 || rm == (x.s < 0 ? 3 : 2)) : rd > 5 || rd == 5 && (rm == 4 || r || rm == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (i > 0 ? j > 0 ? n / pows10[d - j] : 0 : xc[ni - 1]) % 10 & 1 || rm == (x.s < 0 ? 8 : 7));
+        if (sd < 1 || !xc[0]) {
+          xc.length = 0;
+          if (r) {
+            sd -= x.e + 1;
+            xc[0] = pows10[(LOG_BASE - sd % LOG_BASE) % LOG_BASE];
+            x.e = -sd || 0;
+          } else {
+            xc[0] = x.e = 0;
+          }
+          return x;
+        }
+        if (i == 0) {
+          xc.length = ni;
+          k = 1;
+          ni--;
+        } else {
+          xc.length = ni + 1;
+          k = pows10[LOG_BASE - i];
+          xc[ni] = j > 0 ? mathfloor(n / pows10[d - j] % pows10[j]) * k : 0;
+        }
+        if (r) {
+          for (; ; ) {
+            if (ni == 0) {
+              for (i = 1, j = xc[0]; j >= 10; j /= 10, i++) ;
+              j = xc[0] += k;
+              for (k = 1; j >= 10; j /= 10, k++) ;
+              if (i != k) {
+                x.e++;
+                if (xc[0] == BASE) xc[0] = 1;
+              }
               break;
             } else {
-              if (a[u] += n, a[u] != H) break;
-              a[u--] = 0, n = 1;
+              xc[ni] += k;
+              if (xc[ni] != BASE) break;
+              xc[ni--] = 0;
+              k = 1;
             }
-        for (l = a.length; a[--l] === 0; a.pop()) ;
+          }
+        }
+        for (i = xc.length; xc[--i] === 0; xc.pop()) ;
+      }
+      if (x.e > MAX_EXP) {
+        x.c = x.e = null;
+      } else if (x.e < MIN_EXP) {
+        x.c = [x.e = 0];
       }
-      e.e > z ? e.c = e.e = null : e.e < Q && (e.c = [e.e = 0]);
     }
-    return e;
+    return x;
   }
-  function V(e) {
-    var r, i = e.e;
-    return i === null ? e.toString() : (r = q(e.c), r = i <= C || i >= k ? ne(r, i) : W(r, i, "0"), e.s < 0 ? "-" + r : r);
+  function valueOf(n) {
+    var str, e = n.e;
+    if (e === null) return n.toString();
+    str = coeffToString(n.c);
+    str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(str, e) : toFixedPoint(str, e, "0");
+    return n.s < 0 ? "-" + str : str;
   }
-  return g.absoluteValue = g.abs = function() {
-    var e = new h(this);
-    return e.s < 0 && (e.s = 1), e;
-  }, g.comparedTo = function(e, r) {
-    return j(this, new h(e, r));
-  }, g.decimalPlaces = g.dp = function(e, r) {
-    var i, s, t, l = this;
-    if (e != null)
-      return v(e, 0, D), r == null ? r = S : v(r, 0, 8), G(new h(l), e + l.e + 1, r);
-    if (!(i = l.c)) return null;
-    if (s = ((t = i.length - 1) - $(this.e / N)) * N, t = i[t]) for (; t % 10 == 0; t /= 10, s--) ;
-    return s < 0 && (s = 0), s;
-  }, g.dividedBy = g.div = function(e, r) {
-    return E(this, new h(e, r), x, S);
-  }, g.dividedToIntegerBy = g.idiv = function(e, r) {
-    return E(this, new h(e, r), 0, 1);
-  }, g.exponentiatedBy = g.pow = function(e, r) {
-    var i, s, t, l, c, n, f, u, o, a = this;
-    if (e = new h(e), e.c && !e.isInteger())
-      throw Error(U + "Exponent not an integer: " + V(e));
-    if (r != null && (r = new h(r)), n = e.e > 14, !a.c || !a.c[0] || a.c[0] == 1 && !a.e && a.c.length == 1 || !e.c || !e.c[0])
-      return o = new h(Math.pow(+V(a), n ? e.s * (2 - ie(e)) : +V(e))), r ? o.mod(r) : o;
-    if (f = e.s < 0, r) {
-      if (r.c ? !r.c[0] : !r.s) return new h(NaN);
-      s = !f && a.isInteger() && r.isInteger(), s && (a = a.mod(r));
+  P.absoluteValue = P.abs = function() {
+    var x = new BigNumber2(this);
+    if (x.s < 0) x.s = 1;
+    return x;
+  };
+  P.comparedTo = function(y, b) {
+    return compare(this, new BigNumber2(y, b));
+  };
+  P.decimalPlaces = P.dp = function(dp, rm) {
+    var c, n, v, x = this;
+    if (dp != null) {
+      intCheck(dp, 0, MAX);
+      if (rm == null) rm = ROUNDING_MODE;
+      else intCheck(rm, 0, 8);
+      return round(new BigNumber2(x), dp + x.e + 1, rm);
+    }
+    if (!(c = x.c)) return null;
+    n = ((v = c.length - 1) - bitFloor(this.e / LOG_BASE)) * LOG_BASE;
+    if (v = c[v]) for (; v % 10 == 0; v /= 10, n--) ;
+    if (n < 0) n = 0;
+    return n;
+  };
+  P.dividedBy = P.div = function(y, b) {
+    return div(this, new BigNumber2(y, b), DECIMAL_PLACES, ROUNDING_MODE);
+  };
+  P.dividedToIntegerBy = P.idiv = function(y, b) {
+    return div(this, new BigNumber2(y, b), 0, 1);
+  };
+  P.exponentiatedBy = P.pow = function(n, m) {
+    var half, isModExp, i, k, more, nIsBig, nIsNeg, nIsOdd, y, x = this;
+    n = new BigNumber2(n);
+    if (n.c && !n.isInteger()) {
+      throw Error(bignumberError + "Exponent not an integer: " + valueOf(n));
+    }
+    if (m != null) m = new BigNumber2(m);
+    nIsBig = n.e > 14;
+    if (!x.c || !x.c[0] || x.c[0] == 1 && !x.e && x.c.length == 1 || !n.c || !n.c[0]) {
+      y = new BigNumber2(Math.pow(+valueOf(x), nIsBig ? n.s * (2 - isOdd(n)) : +valueOf(n)));
+      return m ? y.mod(m) : y;
+    }
+    nIsNeg = n.s < 0;
+    if (m) {
+      if (m.c ? !m.c[0] : !m.s) return new BigNumber2(NaN);
+      isModExp = !nIsNeg && x.isInteger() && m.isInteger();
+      if (isModExp) x = x.mod(m);
+    } else if (n.e > 9 && (x.e > 0 || x.e < -1 || (x.e == 0 ? x.c[0] > 1 || nIsBig && x.c[1] >= 24e7 : x.c[0] < 8e13 || nIsBig && x.c[0] <= 9999975e7))) {
+      k = x.s < 0 && isOdd(n) ? -0 : 0;
+      if (x.e > -1) k = 1 / k;
+      return new BigNumber2(nIsNeg ? 1 / k : k);
+    } else if (POW_PRECISION) {
+      k = mathceil(POW_PRECISION / LOG_BASE + 2);
+    }
+    if (nIsBig) {
+      half = new BigNumber2(0.5);
+      if (nIsNeg) n.s = 1;
+      nIsOdd = isOdd(n);
     } else {
-      if (e.e > 9 && (a.e > 0 || a.e < -1 || (a.e == 0 ? a.c[0] > 1 || n && a.c[1] >= 24e7 : a.c[0] < 8e13 || n && a.c[0] <= 9999975e7)))
-        return l = a.s < 0 && ie(e) ? -0 : 0, a.e > -1 && (l = 1 / l), new h(f ? 1 / l : l);
-      Y && (l = ce(Y / N + 2));
-    }
-    for (n ? (i = new h(0.5), f && (e.s = 1), u = ie(e)) : (t = Math.abs(+V(e)), u = t % 2), o = new h(T); ; ) {
-      if (u) {
-        if (o = o.times(a), !o.c) break;
-        l ? o.c.length > l && (o.c.length = l) : s && (o = o.mod(r));
-      }
-      if (t) {
-        if (t = y(t / 2), t === 0) break;
-        u = t % 2;
-      } else if (e = e.times(i), G(e, e.e + 1, 1), e.e > 14)
-        u = ie(e);
-      else {
-        if (t = +V(e), t === 0) break;
-        u = t % 2;
-      }
-      a = a.times(a), l ? a.c && a.c.length > l && (a.c.length = l) : s && (a = a.mod(r));
-    }
-    return s ? o : (f && (o = T.div(o)), r ? o.mod(r) : l ? G(o, Y, S, c) : o);
-  }, g.integerValue = function(e) {
-    var r = new h(this);
-    return e == null ? e = S : v(e, 0, 8), G(r, r.e + 1, e);
-  }, g.isEqualTo = g.eq = function(e, r) {
-    return j(this, new h(e, r)) === 0;
-  }, g.isFinite = function() {
+      i = Math.abs(+valueOf(n));
+      nIsOdd = i % 2;
+    }
+    y = new BigNumber2(ONE);
+    for (; ; ) {
+      if (nIsOdd) {
+        y = y.times(x);
+        if (!y.c) break;
+        if (k) {
+          if (y.c.length > k) y.c.length = k;
+        } else if (isModExp) {
+          y = y.mod(m);
+        }
+      }
+      if (i) {
+        i = mathfloor(i / 2);
+        if (i === 0) break;
+        nIsOdd = i % 2;
+      } else {
+        n = n.times(half);
+        round(n, n.e + 1, 1);
+        if (n.e > 14) {
+          nIsOdd = isOdd(n);
+        } else {
+          i = +valueOf(n);
+          if (i === 0) break;
+          nIsOdd = i % 2;
+        }
+      }
+      x = x.times(x);
+      if (k) {
+        if (x.c && x.c.length > k) x.c.length = k;
+      } else if (isModExp) {
+        x = x.mod(m);
+      }
+    }
+    if (isModExp) return y;
+    if (nIsNeg) y = ONE.div(y);
+    return m ? y.mod(m) : k ? round(y, POW_PRECISION, ROUNDING_MODE, more) : y;
+  };
+  P.integerValue = function(rm) {
+    var n = new BigNumber2(this);
+    if (rm == null) rm = ROUNDING_MODE;
+    else intCheck(rm, 0, 8);
+    return round(n, n.e + 1, rm);
+  };
+  P.isEqualTo = P.eq = function(y, b) {
+    return compare(this, new BigNumber2(y, b)) === 0;
+  };
+  P.isFinite = function() {
     return !!this.c;
-  }, g.isGreaterThan = g.gt = function(e, r) {
-    return j(this, new h(e, r)) > 0;
-  }, g.isGreaterThanOrEqualTo = g.gte = function(e, r) {
-    return (r = j(this, new h(e, r))) === 1 || r === 0;
-  }, g.isInteger = function() {
-    return !!this.c && $(this.e / N) > this.c.length - 2;
-  }, g.isLessThan = g.lt = function(e, r) {
-    return j(this, new h(e, r)) < 0;
-  }, g.isLessThanOrEqualTo = g.lte = function(e, r) {
-    return (r = j(this, new h(e, r))) === -1 || r === 0;
-  }, g.isNaN = function() {
+  };
+  P.isGreaterThan = P.gt = function(y, b) {
+    return compare(this, new BigNumber2(y, b)) > 0;
+  };
+  P.isGreaterThanOrEqualTo = P.gte = function(y, b) {
+    return (b = compare(this, new BigNumber2(y, b))) === 1 || b === 0;
+  };
+  P.isInteger = function() {
+    return !!this.c && bitFloor(this.e / LOG_BASE) > this.c.length - 2;
+  };
+  P.isLessThan = P.lt = function(y, b) {
+    return compare(this, new BigNumber2(y, b)) < 0;
+  };
+  P.isLessThanOrEqualTo = P.lte = function(y, b) {
+    return (b = compare(this, new BigNumber2(y, b))) === -1 || b === 0;
+  };
+  P.isNaN = function() {
     return !this.s;
-  }, g.isNegative = function() {
+  };
+  P.isNegative = function() {
     return this.s < 0;
-  }, g.isPositive = function() {
+  };
+  P.isPositive = function() {
     return this.s > 0;
-  }, g.isZero = function() {
+  };
+  P.isZero = function() {
     return !!this.c && this.c[0] == 0;
-  }, g.minus = function(e, r) {
-    var i, s, t, l, c = this, n = c.s;
-    if (e = new h(e, r), r = e.s, !n || !r) return new h(NaN);
-    if (n != r)
-      return e.s = -r, c.plus(e);
-    var f = c.e / N, u = e.e / N, o = c.c, a = e.c;
-    if (!f || !u) {
-      if (!o || !a) return o ? (e.s = -r, e) : new h(a ? c : NaN);
-      if (!o[0] || !a[0])
-        return a[0] ? (e.s = -r, e) : new h(o[0] ? c : (
+  };
+  P.minus = function(y, b) {
+    var i, j, t, xLTy, x = this, a = x.s;
+    y = new BigNumber2(y, b);
+    b = y.s;
+    if (!a || !b) return new BigNumber2(NaN);
+    if (a != b) {
+      y.s = -b;
+      return x.plus(y);
+    }
+    var xe = x.e / LOG_BASE, ye = y.e / LOG_BASE, xc = x.c, yc = y.c;
+    if (!xe || !ye) {
+      if (!xc || !yc) return xc ? (y.s = -b, y) : new BigNumber2(yc ? x : NaN);
+      if (!xc[0] || !yc[0]) {
+        return yc[0] ? (y.s = -b, y) : new BigNumber2(xc[0] ? x : (
           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
-          S == 3 ? -0 : 0
+          ROUNDING_MODE == 3 ? -0 : 0
         ));
+      }
     }
-    if (f = $(f), u = $(u), o = o.slice(), n = f - u) {
-      for ((l = n < 0) ? (n = -n, t = o) : (u = f, t = a), t.reverse(), r = n; r--; t.push(0)) ;
+    xe = bitFloor(xe);
+    ye = bitFloor(ye);
+    xc = xc.slice();
+    if (a = xe - ye) {
+      if (xLTy = a < 0) {
+        a = -a;
+        t = xc;
+      } else {
+        ye = xe;
+        t = yc;
+      }
       t.reverse();
-    } else
-      for (s = (l = (n = o.length) < (r = a.length)) ? n : r, n = r = 0; r < s; r++)
-        if (o[r] != a[r]) {
-          l = o[r] < a[r];
+      for (b = a; b--; t.push(0)) ;
+      t.reverse();
+    } else {
+      j = (xLTy = (a = xc.length) < (b = yc.length)) ? a : b;
+      for (a = b = 0; b < j; b++) {
+        if (xc[b] != yc[b]) {
+          xLTy = xc[b] < yc[b];
           break;
         }
-    if (l && (t = o, o = a, a = t, e.s = -e.s), r = (s = a.length) - (i = o.length), r > 0) for (; r--; o[i++] = 0) ;
-    for (r = H - 1; s > n; ) {
-      if (o[--s] < a[s]) {
-        for (i = s; i && !o[--i]; o[i] = r) ;
-        --o[i], o[s] += H;
-      }
-      o[s] -= a[s];
-    }
-    for (; o[0] == 0; o.splice(0, 1), --u) ;
-    return o[0] ? oe(e, o, u) : (e.s = S == 3 ? -1 : 1, e.c = [e.e = 0], e);
-  }, g.modulo = g.mod = function(e, r) {
-    var i, s, t = this;
-    return e = new h(e, r), !t.c || !e.s || e.c && !e.c[0] ? new h(NaN) : !e.c || t.c && !t.c[0] ? new h(t) : (b == 9 ? (s = e.s, e.s = 1, i = E(t, e, 0, 3), e.s = s, i.s *= s) : i = E(t, e, 0, b), e = t.minus(i.times(e)), !e.c[0] && b == 1 && (e.s = t.s), e);
-  }, g.multipliedBy = g.times = function(e, r) {
-    var i, s, t, l, c, n, f, u, o, a, p, w, A, B, M, m = this, d = m.c, P = (e = new h(e, r)).c;
-    if (!d || !P || !d[0] || !P[0])
-      return !m.s || !e.s || d && !d[0] && !P || P && !P[0] && !d ? e.c = e.e = e.s = null : (e.s *= m.s, !d || !P ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
-    for (s = $(m.e / N) + $(e.e / N), e.s *= m.s, f = d.length, a = P.length, f < a && (A = d, d = P, P = A, t = f, f = a, a = t), t = f + a, A = []; t--; A.push(0)) ;
-    for (B = H, M = J, t = a; --t >= 0; ) {
-      for (i = 0, p = P[t] % M, w = P[t] / M | 0, c = f, l = t + c; l > t; )
-        u = d[--c] % M, o = d[c] / M | 0, n = w * u + o * p, u = p * u + n % M * M + A[l] + i, i = (u / B | 0) + (n / M | 0) + w * o, A[l--] = u % B;
-      A[l] = i;
-    }
-    return i ? ++s : A.splice(0, 1), oe(e, A, s);
-  }, g.negated = function() {
-    var e = new h(this);
-    return e.s = -e.s || null, e;
-  }, g.plus = function(e, r) {
-    var i, s = this, t = s.s;
-    if (e = new h(e, r), r = e.s, !t || !r) return new h(NaN);
-    if (t != r)
-      return e.s = -r, s.minus(e);
-    var l = s.e / N, c = e.e / N, n = s.c, f = e.c;
-    if (!l || !c) {
-      if (!n || !f) return new h(t / 0);
-      if (!n[0] || !f[0]) return f[0] ? e : new h(n[0] ? s : t * 0);
-    }
-    if (l = $(l), c = $(c), n = n.slice(), t = l - c) {
-      for (t > 0 ? (c = l, i = f) : (t = -t, i = n), i.reverse(); t--; i.push(0)) ;
-      i.reverse();
-    }
-    for (t = n.length, r = f.length, t - r < 0 && (i = f, f = n, n = i, r = t), t = 0; r; )
-      t = (n[--r] = n[r] + f[r] + t) / H | 0, n[r] = H === n[r] ? 0 : n[r] % H;
-    return t && (n = [t].concat(n), ++c), oe(e, n, c);
-  }, g.precision = g.sd = function(e, r) {
-    var i, s, t, l = this;
-    if (e != null && e !== !!e)
-      return v(e, 1, D), r == null ? r = S : v(r, 0, 8), G(new h(l), e, r);
-    if (!(i = l.c)) return null;
-    if (t = i.length - 1, s = t * N + 1, t = i[t]) {
-      for (; t % 10 == 0; t /= 10, s--) ;
-      for (t = i[0]; t >= 10; t /= 10, s++) ;
-    }
-    return e && l.e + 1 > s && (s = l.e + 1), s;
-  }, g.shiftedBy = function(e) {
-    return v(e, -ae, ae), this.times("1e" + e);
-  }, g.squareRoot = g.sqrt = function() {
-    var e, r, i, s, t, l = this, c = l.c, n = l.s, f = l.e, u = x + 4, o = new h("0.5");
-    if (n !== 1 || !c || !c[0])
-      return new h(!n || n < 0 && (!c || c[0]) ? NaN : c ? l : 1 / 0);
-    if (n = Math.sqrt(+V(l)), n == 0 || n == 1 / 0 ? (r = q(c), (r.length + f) % 2 == 0 && (r += "0"), n = Math.sqrt(+r), f = $((f + 1) / 2) - (f < 0 || f % 2), n == 1 / 0 ? r = "5e" + f : (r = n.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + f), i = new h(r)) : i = new h(n + ""), i.c[0]) {
-      for (f = i.e, n = f + u, n < 3 && (n = 0); ; )
-        if (t = i, i = o.times(t.plus(E(l, t, u, 1))), q(t.c).slice(0, n) === (r = q(i.c)).slice(0, n))
-          if (i.e < f && --n, r = r.slice(n - 3, n + 1), r == "9999" || !s && r == "4999") {
-            if (!s && (G(t, t.e + x + 2, 0), t.times(t).eq(l))) {
-              i = t;
-              break;
+      }
+    }
+    if (xLTy) {
+      t = xc;
+      xc = yc;
+      yc = t;
+      y.s = -y.s;
+    }
+    b = (j = yc.length) - (i = xc.length);
+    if (b > 0) for (; b--; xc[i++] = 0) ;
+    b = BASE - 1;
+    for (; j > a; ) {
+      if (xc[--j] < yc[j]) {
+        for (i = j; i && !xc[--i]; xc[i] = b) ;
+        --xc[i];
+        xc[j] += BASE;
+      }
+      xc[j] -= yc[j];
+    }
+    for (; xc[0] == 0; xc.splice(0, 1), --ye) ;
+    if (!xc[0]) {
+      y.s = ROUNDING_MODE == 3 ? -1 : 1;
+      y.c = [y.e = 0];
+      return y;
+    }
+    return normalise(y, xc, ye);
+  };
+  P.modulo = P.mod = function(y, b) {
+    var q, s, x = this;
+    y = new BigNumber2(y, b);
+    if (!x.c || !y.s || y.c && !y.c[0]) {
+      return new BigNumber2(NaN);
+    } else if (!y.c || x.c && !x.c[0]) {
+      return new BigNumber2(x);
+    }
+    if (MODULO_MODE == 9) {
+      s = y.s;
+      y.s = 1;
+      q = div(x, y, 0, 3);
+      y.s = s;
+      q.s *= s;
+    } else {
+      q = div(x, y, 0, MODULO_MODE);
+    }
+    y = x.minus(q.times(y));
+    if (!y.c[0] && MODULO_MODE == 1) y.s = x.s;
+    return y;
+  };
+  P.multipliedBy = P.times = function(y, b) {
+    var c, e, i, j, k, m, xcL, xlo, xhi, ycL, ylo, yhi, zc, base, sqrtBase, x = this, xc = x.c, yc = (y = new BigNumber2(y, b)).c;
+    if (!xc || !yc || !xc[0] || !yc[0]) {
+      if (!x.s || !y.s || xc && !xc[0] && !yc || yc && !yc[0] && !xc) {
+        y.c = y.e = y.s = null;
+      } else {
+        y.s *= x.s;
+        if (!xc || !yc) {
+          y.c = y.e = null;
+        } else {
+          y.c = [0];
+          y.e = 0;
+        }
+      }
+      return y;
+    }
+    e = bitFloor(x.e / LOG_BASE) + bitFloor(y.e / LOG_BASE);
+    y.s *= x.s;
+    xcL = xc.length;
+    ycL = yc.length;
+    if (xcL < ycL) {
+      zc = xc;
+      xc = yc;
+      yc = zc;
+      i = xcL;
+      xcL = ycL;
+      ycL = i;
+    }
+    for (i = xcL + ycL, zc = []; i--; zc.push(0)) ;
+    base = BASE;
+    sqrtBase = SQRT_BASE;
+    for (i = ycL; --i >= 0; ) {
+      c = 0;
+      ylo = yc[i] % sqrtBase;
+      yhi = yc[i] / sqrtBase | 0;
+      for (k = xcL, j = i + k; j > i; ) {
+        xlo = xc[--k] % sqrtBase;
+        xhi = xc[k] / sqrtBase | 0;
+        m = yhi * xlo + xhi * ylo;
+        xlo = ylo * xlo + m % sqrtBase * sqrtBase + zc[j] + c;
+        c = (xlo / base | 0) + (m / sqrtBase | 0) + yhi * xhi;
+        zc[j--] = xlo % base;
+      }
+      zc[j] = c;
+    }
+    if (c) {
+      ++e;
+    } else {
+      zc.splice(0, 1);
+    }
+    return normalise(y, zc, e);
+  };
+  P.negated = function() {
+    var x = new BigNumber2(this);
+    x.s = -x.s || null;
+    return x;
+  };
+  P.plus = function(y, b) {
+    var t, x = this, a = x.s;
+    y = new BigNumber2(y, b);
+    b = y.s;
+    if (!a || !b) return new BigNumber2(NaN);
+    if (a != b) {
+      y.s = -b;
+      return x.minus(y);
+    }
+    var xe = x.e / LOG_BASE, ye = y.e / LOG_BASE, xc = x.c, yc = y.c;
+    if (!xe || !ye) {
+      if (!xc || !yc) return new BigNumber2(a / 0);
+      if (!xc[0] || !yc[0]) return yc[0] ? y : new BigNumber2(xc[0] ? x : a * 0);
+    }
+    xe = bitFloor(xe);
+    ye = bitFloor(ye);
+    xc = xc.slice();
+    if (a = xe - ye) {
+      if (a > 0) {
+        ye = xe;
+        t = yc;
+      } else {
+        a = -a;
+        t = xc;
+      }
+      t.reverse();
+      for (; a--; t.push(0)) ;
+      t.reverse();
+    }
+    a = xc.length;
+    b = yc.length;
+    if (a - b < 0) {
+      t = yc;
+      yc = xc;
+      xc = t;
+      b = a;
+    }
+    for (a = 0; b; ) {
+      a = (xc[--b] = xc[b] + yc[b] + a) / BASE | 0;
+      xc[b] = BASE === xc[b] ? 0 : xc[b] % BASE;
+    }
+    if (a) {
+      xc = [a].concat(xc);
+      ++ye;
+    }
+    return normalise(y, xc, ye);
+  };
+  P.precision = P.sd = function(sd, rm) {
+    var c, n, v, x = this;
+    if (sd != null && sd !== !!sd) {
+      intCheck(sd, 1, MAX);
+      if (rm == null) rm = ROUNDING_MODE;
+      else intCheck(rm, 0, 8);
+      return round(new BigNumber2(x), sd, rm);
+    }
+    if (!(c = x.c)) return null;
+    v = c.length - 1;
+    n = v * LOG_BASE + 1;
+    if (v = c[v]) {
+      for (; v % 10 == 0; v /= 10, n--) ;
+      for (v = c[0]; v >= 10; v /= 10, n++) ;
+    }
+    if (sd && x.e + 1 > n) n = x.e + 1;
+    return n;
+  };
+  P.shiftedBy = function(k) {
+    intCheck(k, -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER);
+    return this.times("1e" + k);
+  };
+  P.squareRoot = P.sqrt = function() {
+    var m, n, r, rep, t, x = this, c = x.c, s = x.s, e = x.e, dp = DECIMAL_PLACES + 4, half = new BigNumber2("0.5");
+    if (s !== 1 || !c || !c[0]) {
+      return new BigNumber2(!s || s < 0 && (!c || c[0]) ? NaN : c ? x : 1 / 0);
+    }
+    s = Math.sqrt(+valueOf(x));
+    if (s == 0 || s == 1 / 0) {
+      n = coeffToString(c);
+      if ((n.length + e) % 2 == 0) n += "0";
+      s = Math.sqrt(+n);
+      e = bitFloor((e + 1) / 2) - (e < 0 || e % 2);
+      if (s == 1 / 0) {
+        n = "5e" + e;
+      } else {
+        n = s.toExponential();
+        n = n.slice(0, n.indexOf("e") + 1) + e;
+      }
+      r = new BigNumber2(n);
+    } else {
+      r = new BigNumber2(s + "");
+    }
+    if (r.c[0]) {
+      e = r.e;
+      s = e + dp;
+      if (s < 3) s = 0;
+      for (; ; ) {
+        t = r;
+        r = half.times(t.plus(div(x, t, dp, 1)));
+        if (coeffToString(t.c).slice(0, s) === (n = coeffToString(r.c)).slice(0, s)) {
+          if (r.e < e) --s;
+          n = n.slice(s - 3, s + 1);
+          if (n == "9999" || !rep && n == "4999") {
+            if (!rep) {
+              round(t, t.e + DECIMAL_PLACES + 2, 0);
+              if (t.times(t).eq(x)) {
+                r = t;
+                break;
+              }
             }
-            u += 4, n += 4, s = 1;
+            dp += 4;
+            s += 4;
+            rep = 1;
           } else {
-            (!+r || !+r.slice(1) && r.charAt(0) == "5") && (G(i, i.e + x + 2, 1), e = !i.times(i).eq(l));
+            if (!+n || !+n.slice(1) && n.charAt(0) == "5") {
+              round(r, r.e + DECIMAL_PLACES + 2, 1);
+              m = !r.times(r).eq(x);
+            }
             break;
           }
+        }
+      }
+    }
+    return round(r, r.e + DECIMAL_PLACES + 1, ROUNDING_MODE, m);
+  };
+  P.toExponential = function(dp, rm) {
+    if (dp != null) {
+      intCheck(dp, 0, MAX);
+      dp++;
+    }
+    return format(this, dp, rm, 1);
+  };
+  P.toFixed = function(dp, rm) {
+    if (dp != null) {
+      intCheck(dp, 0, MAX);
+      dp = dp + this.e + 1;
+    }
+    return format(this, dp, rm);
+  };
+  P.toFormat = function(dp, rm, format2) {
+    var str, x = this;
+    if (format2 == null) {
+      if (dp != null && rm && typeof rm == "object") {
+        format2 = rm;
+        rm = null;
+      } else if (dp && typeof dp == "object") {
+        format2 = dp;
+        dp = rm = null;
+      } else {
+        format2 = FORMAT;
+      }
+    } else if (typeof format2 != "object") {
+      throw Error(bignumberError + "Argument not an object: " + format2);
+    }
+    str = x.toFixed(dp, rm);
+    if (x.c) {
+      var i, arr = str.split("."), g1 = +format2.groupSize, g2 = +format2.secondaryGroupSize, groupSeparator = format2.groupSeparator || "", intPart = arr[0], fractionPart = arr[1], isNeg = x.s < 0, intDigits = isNeg ? intPart.slice(1) : intPart, len = intDigits.length;
+      if (g2) {
+        i = g1;
+        g1 = g2;
+        g2 = i;
+        len -= i;
+      }
+      if (g1 > 0 && len > 0) {
+        i = len % g1 || g1;
+        intPart = intDigits.substr(0, i);
+        for (; i < len; i += g1) intPart += groupSeparator + intDigits.substr(i, g1);
+        if (g2 > 0) intPart += groupSeparator + intDigits.slice(i);
+        if (isNeg) intPart = "-" + intPart;
+      }
+      str = fractionPart ? intPart + (format2.decimalSeparator || "") + ((g2 = +format2.fractionGroupSize) ? fractionPart.replace(
+        new RegExp("\\d{" + g2 + "}\\B", "g"),
+        "$&" + (format2.fractionGroupSeparator || "")
+      ) : fractionPart) : intPart;
     }
-    return G(i, i.e + x + 1, S, e);
-  }, g.toExponential = function(e, r) {
-    return e != null && (v(e, 0, D), e++), le(this, e, r, 1);
-  }, g.toFixed = function(e, r) {
-    return e != null && (v(e, 0, D), e = e + this.e + 1), le(this, e, r);
-  }, g.toFormat = function(e, r, i) {
-    var s, t = this;
-    if (i == null)
-      e != null && r && typeof r == "object" ? (i = r, r = null) : e && typeof e == "object" ? (i = e, e = r = null) : i = te;
-    else if (typeof i != "object")
-      throw Error(U + "Argument not an object: " + i);
-    if (s = t.toFixed(e, r), t.c) {
-      var l, c = s.split("."), n = +i.groupSize, f = +i.secondaryGroupSize, u = i.groupSeparator || "", o = c[0], a = c[1], p = t.s < 0, w = p ? o.slice(1) : o, A = w.length;
-      if (f && (l = n, n = f, f = l, A -= l), n > 0 && A > 0) {
-        for (l = A % n || n, o = w.substr(0, l); l < A; l += n) o += u + w.substr(l, n);
-        f > 0 && (o += u + w.slice(l)), p && (o = "-" + o);
-      }
-      s = a ? o + (i.decimalSeparator || "") + ((f = +i.fractionGroupSize) ? a.replace(
-        new RegExp("\\d{" + f + "}\\B", "g"),
-        "$&" + (i.fractionGroupSeparator || "")
-      ) : a) : o;
-    }
-    return (i.prefix || "") + s + (i.suffix || "");
-  }, g.toFraction = function(e) {
-    var r, i, s, t, l, c, n, f, u, o, a, p, w = this, A = w.c;
-    if (e != null && (n = new h(e), !n.isInteger() && (n.c || n.s !== 1) || n.lt(T)))
-      throw Error(U + "Argument " + (n.isInteger() ? "out of range: " : "not an integer: ") + V(n));
-    if (!A) return new h(w);
-    for (r = new h(T), u = i = new h(T), s = f = new h(T), p = q(A), l = r.e = p.length - w.e - 1, r.c[0] = he[(c = l % N) < 0 ? N + c : c], e = !e || n.comparedTo(r) > 0 ? l > 0 ? r : u : n, c = z, z = 1 / 0, n = new h(p), f.c[0] = 0; o = E(n, r, 0, 1), t = i.plus(o.times(s)), t.comparedTo(e) != 1; )
-      i = s, s = t, u = f.plus(o.times(t = u)), f = t, r = n.minus(o.times(t = r)), n = t;
-    return t = E(e.minus(i), s, 0, 1), f = f.plus(t.times(u)), i = i.plus(t.times(s)), f.s = u.s = w.s, l = l * 2, a = E(u, s, l, S).minus(w).abs().comparedTo(
-      E(f, i, l, S).minus(w).abs()
-    ) < 1 ? [u, s] : [f, i], z = c, a;
-  }, g.toNumber = function() {
-    return +V(this);
-  }, g.toPrecision = function(e, r) {
-    return e != null && v(e, 1, D), le(this, e, r, 2);
-  }, g.toString = function(e) {
-    var r, i = this, s = i.s, t = i.e;
-    return t === null ? s ? (r = "Infinity", s < 0 && (r = "-" + r)) : r = "NaN" : (e == null ? r = t <= C || t >= k ? ne(q(i.c), t) : W(q(i.c), t, "0") : e === 10 && fe ? (i = G(new h(i), x + t + 1, S), r = W(q(i.c), i.e, "0")) : (v(e, 2, K.length, "Base"), r = _(W(q(i.c), t, "0"), 10, e, s, !0)), s < 0 && i.c[0] && (r = "-" + r)), r;
-  }, g.valueOf = g.toJSON = function() {
-    return V(this);
-  }, g._isBigNumber = !0, g[Symbol.toStringTag] = "BigNumber", g[Symbol.for("nodejs.util.inspect.custom")] = g.valueOf, O != null && h.set(O), h;
+    return (format2.prefix || "") + str + (format2.suffix || "");
+  };
+  P.toFraction = function(md) {
+    var d, d0, d1, d2, e, exp, n, n0, n1, q, r, s, x = this, xc = x.c;
+    if (md != null) {
+      n = new BigNumber2(md);
+      if (!n.isInteger() && (n.c || n.s !== 1) || n.lt(ONE)) {
+        throw Error(bignumberError + "Argument " + (n.isInteger() ? "out of range: " : "not an integer: ") + valueOf(n));
+      }
+    }
+    if (!xc) return new BigNumber2(x);
+    d = new BigNumber2(ONE);
+    n1 = d0 = new BigNumber2(ONE);
+    d1 = n0 = new BigNumber2(ONE);
+    s = coeffToString(xc);
+    e = d.e = s.length - x.e - 1;
+    d.c[0] = POWS_TEN[(exp = e % LOG_BASE) < 0 ? LOG_BASE + exp : exp];
+    md = !md || n.comparedTo(d) > 0 ? e > 0 ? d : n1 : n;
+    exp = MAX_EXP;
+    MAX_EXP = 1 / 0;
+    n = new BigNumber2(s);
+    n0.c[0] = 0;
+    for (; ; ) {
+      q = div(n, d, 0, 1);
+      d2 = d0.plus(q.times(d1));
+      if (d2.comparedTo(md) == 1) break;
+      d0 = d1;
+      d1 = d2;
+      n1 = n0.plus(q.times(d2 = n1));
+      n0 = d2;
+      d = n.minus(q.times(d2 = d));
+      n = d2;
+    }
+    d2 = div(md.minus(d0), d1, 0, 1);
+    n0 = n0.plus(d2.times(n1));
+    d0 = d0.plus(d2.times(d1));
+    n0.s = n1.s = x.s;
+    e = e * 2;
+    r = div(n1, d1, e, ROUNDING_MODE).minus(x).abs().comparedTo(
+      div(n0, d0, e, ROUNDING_MODE).minus(x).abs()
+    ) < 1 ? [n1, d1] : [n0, d0];
+    MAX_EXP = exp;
+    return r;
+  };
+  P.toNumber = function() {
+    return +valueOf(this);
+  };
+  P.toPrecision = function(sd, rm) {
+    if (sd != null) intCheck(sd, 1, MAX);
+    return format(this, sd, rm, 2);
+  };
+  P.toString = function(b) {
+    var str, n = this, s = n.s, e = n.e;
+    if (e === null) {
+      if (s) {
+        str = "Infinity";
+        if (s < 0) str = "-" + str;
+      } else {
+        str = "NaN";
+      }
+    } else {
+      if (b == null) {
+        str = e <= TO_EXP_NEG || e >= TO_EXP_POS ? toExponential(coeffToString(n.c), e) : toFixedPoint(coeffToString(n.c), e, "0");
+      } else if (b === 10 && alphabetHasNormalDecimalDigits) {
+        n = round(new BigNumber2(n), DECIMAL_PLACES + e + 1, ROUNDING_MODE);
+        str = toFixedPoint(coeffToString(n.c), n.e, "0");
+      } else {
+        intCheck(b, 2, ALPHABET.length, "Base");
+        str = convertBase(toFixedPoint(coeffToString(n.c), e, "0"), 10, b, s, true);
+      }
+      if (s < 0 && n.c[0]) str = "-" + str;
+    }
+    return str;
+  };
+  P.valueOf = P.toJSON = function() {
+    return valueOf(this);
+  };
+  P._isBigNumber = true;
+  P[Symbol.toStringTag] = "BigNumber";
+  P[Symbol.for("nodejs.util.inspect.custom")] = P.valueOf;
+  if (configObject != null) BigNumber2.set(configObject);
+  return BigNumber2;
 }
-function $(O) {
-  var E = O | 0;
-  return O > 0 || O === E ? E : E - 1;
+function bitFloor(n) {
+  var i = n | 0;
+  return n > 0 || n === i ? i : i - 1;
 }
-function q(O) {
-  for (var E, _, R = 1, g = O.length, T = O[0] + ""; R < g; ) {
-    for (E = O[R++] + "", _ = N - E.length; _--; E = "0" + E) ;
-    T += E;
+function coeffToString(a) {
+  var s, z, i = 1, j = a.length, r = a[0] + "";
+  for (; i < j; ) {
+    s = a[i++] + "";
+    z = LOG_BASE - s.length;
+    for (; z--; s = "0" + s) ;
+    r += s;
   }
-  for (g = T.length; T.charCodeAt(--g) === 48; ) ;
-  return T.slice(0, g + 1 || 1);
+  for (j = r.length; r.charCodeAt(--j) === 48; ) ;
+  return r.slice(0, j + 1 || 1);
 }
-function j(O, E) {
-  var _, R, g = O.c, T = E.c, x = O.s, S = E.s, C = O.e, k = E.e;
-  if (!x || !S) return null;
-  if (_ = g && !g[0], R = T && !T[0], _ || R) return _ ? R ? 0 : -S : x;
-  if (x != S) return x;
-  if (_ = x < 0, R = C == k, !g || !T) return R ? 0 : !g ^ _ ? 1 : -1;
-  if (!R) return C > k ^ _ ? 1 : -1;
-  for (S = (C = g.length) < (k = T.length) ? C : k, x = 0; x < S; x++) if (g[x] != T[x]) return g[x] > T[x] ^ _ ? 1 : -1;
-  return C == k ? 0 : C > k ^ _ ? 1 : -1;
+function compare(x, y) {
+  var a, b, xc = x.c, yc = y.c, i = x.s, j = y.s, k = x.e, l = y.e;
+  if (!i || !j) return null;
+  a = xc && !xc[0];
+  b = yc && !yc[0];
+  if (a || b) return a ? b ? 0 : -j : i;
+  if (i != j) return i;
+  a = i < 0;
+  b = k == l;
+  if (!xc || !yc) return b ? 0 : !xc ^ a ? 1 : -1;
+  if (!b) return k > l ^ a ? 1 : -1;
+  j = (k = xc.length) < (l = yc.length) ? k : l;
+  for (i = 0; i < j; i++) if (xc[i] != yc[i]) return xc[i] > yc[i] ^ a ? 1 : -1;
+  return k == l ? 0 : k > l ^ a ? 1 : -1;
 }
-function v(O, E, _, R) {
-  if (O < E || O > _ || O !== y(O))
-    throw Error(U + (R || "Argument") + (typeof O == "number" ? O < E || O > _ ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(O));
+function intCheck(n, min, max, name) {
+  if (n < min || n > max || n !== mathfloor(n)) {
+    throw Error(bignumberError + (name || "Argument") + (typeof n == "number" ? n < min || n > max ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(n));
+  }
 }
-function ie(O) {
-  var E = O.c.length - 1;
-  return $(O.e / N) == E && O.c[E] % 2 != 0;
+function isOdd(n) {
+  var k = n.c.length - 1;
+  return bitFloor(n.e / LOG_BASE) == k && n.c[k] % 2 != 0;
 }
-function ne(O, E) {
-  return (O.length > 1 ? O.charAt(0) + "." + O.slice(1) : O) + (E < 0 ? "e" : "e+") + E;
+function toExponential(str, e) {
+  return (str.length > 1 ? str.charAt(0) + "." + str.slice(1) : str) + (e < 0 ? "e" : "e+") + e;
 }
-function W(O, E, _) {
-  var R, g;
-  if (E < 0) {
-    for (g = _ + "."; ++E; g += _) ;
-    O = g + O;
-  } else if (R = O.length, ++E > R) {
-    for (g = _, E -= R; --E; g += _) ;
-    O += g;
-  } else E < R && (O = O.slice(0, E) + "." + O.slice(E));
-  return O;
+function toFixedPoint(str, e, z) {
+  var len, zs;
+  if (e < 0) {
+    for (zs = z + "."; ++e; zs += z) ;
+    str = zs + str;
+  } else {
+    len = str.length;
+    if (++e > len) {
+      for (zs = z, e -= len; --e; zs += z) ;
+      str += zs;
+    } else if (e < len) {
+      str = str.slice(0, e) + "." + str.slice(e);
+    }
+  }
+  return str;
 }
-var Ne = we();
+var BigNumber = clone();
 export {
-  Ne as BigNumber,
-  Ne as default
+  BigNumber,
+  BigNumber as default
 };
+//# sourceMappingURL=bignumber.js.map