jk-vue-comps 0.2.7 → 0.2.9

package/dist/utils/math.js

@@ -1,6 +1,6 @@
-var xe = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, ge = Math.ceil, $ = Math.floor, G = "[BigNumber Error] ", Ee = G + "Number primitive has more than 15 significant digits: ", V = 1e14, E = 14, pe = 9007199254740991, we = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], Q = 1e7, M = 1e9;
-function Oe(a) {
-  var p, d, O, w = g.prototype = { constructor: g, toString: null, valueOf: null }, P = new g(1), S = 20, R = 4, C = -7, k = 21, K = -1e7, H = 1e7, j = !1, ne = 1, J = 0, ue = {
+var X = Ee(), Te = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, he = Math.ceil, V = Math.floor, q = "[BigNumber Error] ", $ = 1e14, E = 14, Oe = 9007199254740991, ge = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], J = 1e7, M = 1e9;
+function Ee(c) {
+  var p, m, d, w = g.prototype = { constructor: g, toString: null, valueOf: null }, v = new g(1), R = 20, P = 4, U = -7, k = 21, K = -1e7, y = 1e7, j = !1, ne = 1, Z = 0, oe = {
     prefix: "",
     groupSize: 3,
     secondaryGroupSize: 0,
@@ -10,353 +10,349 @@ function Oe(a) {
     fractionGroupSeparator: " ",
     // non-breaking space
     suffix: ""
-  }, b = "0123456789abcdefghijklmnopqrstuvwxyz", se = !0;
+  }, b = "0123456789abcdefghijklmnopqrstuvwxyz";
   function g(e, r) {
-    var n, s, t, o, c, i, f, l, u = this;
-    if (!(u instanceof g)) return new g(e, r);
-    if (r == null) {
-      if (e && e._isBigNumber === !0) {
-        u.s = e.s, !e.c || e.e > H ? u.c = u.e = null : e.e < K ? u.c = [u.e = 0] : (u.e = e.e, u.c = e.c.slice());
+    var n, o, f, u, l, i, t, a, s = this;
+    if (!(s instanceof g)) return new g(e, r);
+    if (a = typeof e, r == null) {
+      if (we(e)) {
+        s.s = e.s, !e.c || e.e > y ? s.c = s.e = null : e.e < K ? s.c = [s.e = 0] : (s.e = e.e, s.c = e.c.slice());
         return;
       }
-      if ((i = typeof e == "number") && e * 0 == 0) {
-        if (u.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
-          for (o = 0, c = e; c >= 10; c /= 10, o++) ;
-          o > H ? u.c = u.e = null : (u.e = o, u.c = [e]);
+      if (a == "number") {
+        if (e * 0 != 0) {
+          s.s = isNaN(e) ? null : e < 0 ? -1 : 1, s.c = s.e = null;
           return;
         }
-        l = String(e);
+        if (s.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
+          for (u = 0, l = e; l >= 10; l /= 10, u++) ;
+          u > y ? s.c = s.e = null : (s.e = u, s.c = [e]);
+          return;
+        }
+        t = String(e);
       } else {
-        if (!xe.test(l = String(e))) return O(u, l, i);
-        u.s = l.charCodeAt(0) == 45 ? (l = l.slice(1), -1) : 1;
+        if (a == "string") {
+          if (t = e, !Te.test(t))
+            return d(s, t);
+        } else if (a == "bigint")
+          t = String(e);
+        else
+          throw Error(q + "Invalid argument: " + e);
+        s.s = t.charCodeAt(0) == 45 ? (t = t.slice(1), -1) : 1;
       }
-      (o = l.indexOf(".")) > -1 && (l = l.replace(".", "")), (c = l.search(/e/i)) > 0 ? (o < 0 && (o = c), o += +l.slice(c + 1), l = l.substring(0, c)) : o < 0 && (o = l.length);
+      (u = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (l = t.search(/e/i)) > 0 ? (u < 0 && (u = l), u += +t.slice(l + 1), t = t.substring(0, l)) : u < 0 && (u = t.length);
     } else {
-      if (B(r, 2, b.length, "Base"), r == 10 && se)
-        return u = new g(e), q(u, S + u.e + 1, R);
-      if (l = String(e), i = typeof e == "number") {
-        if (e * 0 != 0) return O(u, l, i, r);
-        if (u.s = 1 / e < 0 ? (l = l.slice(1), -1) : 1, g.DEBUG && l.replace(/^0\.0*|\./, "").length > 15)
-          throw Error(Ee + e);
-      } else
-        u.s = l.charCodeAt(0) === 45 ? (l = l.slice(1), -1) : 1;
-      for (n = b.slice(0, r), o = c = 0, f = l.length; c < f; c++)
-        if (n.indexOf(s = l.charAt(c)) < 0) {
-          if (s == ".") {
-            if (c > o) {
-              o = f;
+      if (a != "string")
+        throw Error(q + "String expected: " + e);
+      for (S(r, 2, b.length, "Base"), t = e, s.s = t.charCodeAt(0) === 45 ? (t = t.slice(1), -1) : 1, n = b.slice(0, r), u = l = 0, i = t.length; l < i; l++)
+        if (n.indexOf(o = t.charAt(l)) < 0) {
+          if (o == ".") {
+            if (l > u) {
+              u = i;
               continue;
             }
-          } else if (!t && (l == l.toUpperCase() && (l = l.toLowerCase()) || l == l.toLowerCase() && (l = l.toUpperCase()))) {
-            t = !0, c = -1, o = 0;
+          } else if (!f && (t == t.toUpperCase() && (t = t.toLowerCase()) || t == t.toLowerCase() && (t = t.toUpperCase()))) {
+            f = !0, l = -1, u = 0;
             continue;
           }
-          return O(u, String(e), i, r);
+          return d(s, e, r);
         }
-      i = !1, l = d(l, r, 10, u.s), (o = l.indexOf(".")) > -1 ? l = l.replace(".", "") : o = l.length;
+      t = m(t, r, 10, s.s), (u = t.indexOf(".")) > -1 ? t = t.replace(".", "") : u = t.length;
     }
-    for (c = 0; l.charCodeAt(c) === 48; c++) ;
-    for (f = l.length; l.charCodeAt(--f) === 48; ) ;
-    if (l = l.slice(c, ++f)) {
-      if (f -= c, i && g.DEBUG && f > 15 && (e > pe || e !== $(e)))
-        throw Error(Ee + u.s * e);
-      if ((o = o - c - 1) > H)
-        u.c = u.e = null;
-      else if (o < K)
-        u.c = [u.e = 0];
+    for (l = 0; t.charCodeAt(l) === 48; l++) ;
+    for (i = t.length; t.charCodeAt(--i) === 48; ) ;
+    if (t = t.slice(l, ++i))
+      if (i -= l, u = u - l - 1, u > y)
+        s.c = s.e = null;
+      else if (u < K)
+        s.c = [s.e = 0];
       else {
-        if (u.e = o, u.c = [], c = (o + 1) % E, o < 0 && (c += E), c < f) {
-          for (c && u.c.push(+l.slice(0, c)), f -= E; c < f; )
-            u.c.push(+l.slice(c, c += E));
-          c = E - (l = l.slice(c)).length;
+        if (s.e = u, s.c = [], l = (u + 1) % E, u < 0 && (l += E), l < i) {
+          for (l && s.c.push(+t.slice(0, l)), i -= E; l < i; )
+            s.c.push(+t.slice(l, l += E));
+          l = E - (t = t.slice(l)).length;
         } else
-          c -= f;
-        for (; c--; l += "0") ;
-        u.c.push(+l);
+          l -= i;
+        for (; l--; t += "0") ;
+        s.c.push(+t);
       }
-    } else
-      u.c = [u.e = 0];
+    else
+      s.c = [s.e = 0];
   }
-  g.clone = Oe, g.ROUND_UP = 0, g.ROUND_DOWN = 1, g.ROUND_CEIL = 2, g.ROUND_FLOOR = 3, g.ROUND_HALF_UP = 4, g.ROUND_HALF_DOWN = 5, g.ROUND_HALF_EVEN = 6, g.ROUND_HALF_CEIL = 7, g.ROUND_HALF_FLOOR = 8, g.EUCLID = 9, g.config = g.set = function(e) {
+  g.clone = Ee, g.ROUND_UP = 0, g.ROUND_DOWN = 1, g.ROUND_CEIL = 2, g.ROUND_FLOOR = 3, g.ROUND_HALF_UP = 4, g.ROUND_HALF_DOWN = 5, g.ROUND_HALF_EVEN = 6, g.ROUND_HALF_CEIL = 7, g.ROUND_HALF_FLOOR = 8, g.EUCLID = 9, g.config = g.set = function(e) {
     var r, n;
     if (e != null)
       if (typeof e == "object") {
-        if (e.hasOwnProperty(r = "DECIMAL_PLACES") && (n = e[r], B(n, 0, M, r), S = n), e.hasOwnProperty(r = "ROUNDING_MODE") && (n = e[r], B(n, 0, 8, r), R = n), e.hasOwnProperty(r = "EXPONENTIAL_AT") && (n = e[r], n && n.pop ? (B(n[0], -M, 0, r), B(n[1], 0, M, r), C = n[0], k = n[1]) : (B(n, -M, M, r), C = -(k = n < 0 ? -n : n))), e.hasOwnProperty(r = "RANGE"))
+        if (e.hasOwnProperty(r = "DECIMAL_PLACES") && (n = e[r], S(n, 0, M, r), R = n), e.hasOwnProperty(r = "ROUNDING_MODE") && (n = e[r], S(n, 0, 8, r), P = n), e.hasOwnProperty(r = "EXPONENTIAL_AT") && (n = e[r], n && n.pop ? (S(n[0], -M, 0, r), S(n[1], 0, M, r), U = n[0], k = n[1]) : (S(n, -M, M, r), U = -(k = n < 0 ? -n : n))), e.hasOwnProperty(r = "RANGE"))
           if (n = e[r], n && n.pop)
-            B(n[0], -M, -1, r), B(n[1], 1, M, r), K = n[0], H = n[1];
-          else if (B(n, -M, M, r), n)
-            K = -(H = n < 0 ? -n : n);
+            S(n[0], -M, -1, r), S(n[1], 1, M, r), K = n[0], y = n[1];
+          else if (S(n, -M, M, r), n)
+            K = -(y = n < 0 ? -n : n);
           else
-            throw Error(G + r + " cannot be zero: " + n);
+            throw Error(q + r + " cannot be zero: " + n);
         if (e.hasOwnProperty(r = "CRYPTO"))
           if (n = e[r], n === !!n)
             if (n)
               if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
                 j = n;
               else
-                throw j = !n, Error(G + "crypto unavailable");
+                throw j = !n, Error(q + "crypto unavailable");
             else
               j = n;
           else
-            throw Error(G + r + " not true or false: " + n);
-        if (e.hasOwnProperty(r = "MODULO_MODE") && (n = e[r], B(n, 0, 9, r), ne = n), e.hasOwnProperty(r = "POW_PRECISION") && (n = e[r], B(n, 0, M, r), J = n), e.hasOwnProperty(r = "FORMAT"))
-          if (n = e[r], typeof n == "object") ue = n;
-          else throw Error(G + r + " not an object: " + n);
+            throw Error(q + r + " not true or false: " + n);
+        if (e.hasOwnProperty(r = "MODULO_MODE") && (n = e[r], S(n, 0, 9, r), ne = n), e.hasOwnProperty(r = "POW_PRECISION") && (n = e[r], S(n, 0, M, r), Z = n), e.hasOwnProperty(r = "FORMAT"))
+          if (n = e[r], typeof n == "object") oe = n;
+          else throw Error(q + r + " not an object: " + n);
         if (e.hasOwnProperty(r = "ALPHABET"))
           if (n = e[r], typeof n == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(n))
-            se = n.slice(0, 10) == "0123456789", b = n;
+            b = n;
           else
-            throw Error(G + r + " invalid: " + n);
+            throw Error(q + r + " invalid: " + n);
       } else
-        throw Error(G + "Object expected: " + e);
+        throw Error(q + "Object expected: " + e);
     return {
-      DECIMAL_PLACES: S,
-      ROUNDING_MODE: R,
-      EXPONENTIAL_AT: [C, k],
-      RANGE: [K, H],
+      DECIMAL_PLACES: R,
+      ROUNDING_MODE: P,
+      EXPONENTIAL_AT: [U, k],
+      RANGE: [K, y],
       CRYPTO: j,
       MODULO_MODE: ne,
-      POW_PRECISION: J,
-      FORMAT: ue,
+      POW_PRECISION: Z,
+      FORMAT: oe,
       ALPHABET: b
     };
   }, g.isBigNumber = function(e) {
-    if (!e || e._isBigNumber !== !0) return !1;
-    if (!g.DEBUG) return !0;
-    var r, n, s = e.c, t = e.e, o = e.s;
-    e: if ({}.toString.call(s) == "[object Array]") {
-      if ((o === 1 || o === -1) && t >= -M && t <= M && t === $(t)) {
-        if (s[0] === 0) {
-          if (t === 0 && s.length === 1) return !0;
-          break e;
-        }
-        if (r = (t + 1) % E, r < 1 && (r += E), String(s[0]).length == r) {
-          for (r = 0; r < s.length; r++)
-            if (n = s[r], n < 0 || n >= V || n !== $(n)) break e;
-          if (n !== 0) return !0;
-        }
-      }
-    } else if (s === null && t === null && (o === null || o === 1 || o === -1))
-      return !0;
-    throw Error(G + "Invalid BigNumber: " + e);
+    if (!we(e)) return !1;
+    var r, n, o = e.c, f = e.e, u = e.s;
+    if ({}.toString.call(o) != "[object Array]")
+      return o === null && f === null && (u === null || u === 1 || u === -1);
+    if (u !== 1 && u !== -1 || f < -M || f > M || f !== V(f))
+      return !1;
+    if (o[0] === 0)
+      return f === 0 && o.length === 1;
+    if (r = (f + 1) % E, r < 1 && (r += E), String(o[0]).length !== r)
+      return !1;
+    for (r = 0; r < o.length; r++)
+      if (n = o[r], n < 0 || n >= $ || n !== V(n)) return !1;
+    return n !== 0;
   }, g.maximum = g.max = function() {
-    return me(arguments, -1);
+    return Ne(arguments, -1);
   }, g.minimum = g.min = function() {
-    return me(arguments, 1);
+    return Ne(arguments, 1);
   }, g.random = (function() {
     var e = 9007199254740992, r = Math.random() * e & 2097151 ? function() {
-      return $(Math.random() * e);
+      return V(Math.random() * e);
     } : function() {
       return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
     };
     return function(n) {
-      var s, t, o, c, i, f = 0, l = [], u = new g(P);
-      if (n == null ? n = S : B(n, 0, M), c = ge(n / E), j)
+      var o, f, u, l, i, t = 0, a = [], s = new g(v);
+      if (n == null ? n = R : S(n, 0, M), l = he(n / E), j)
         if (crypto.getRandomValues) {
-          for (s = crypto.getRandomValues(new Uint32Array(c *= 2)); f < c; )
-            i = s[f] * 131072 + (s[f + 1] >>> 11), i >= 9e15 ? (t = crypto.getRandomValues(new Uint32Array(2)), s[f] = t[0], s[f + 1] = t[1]) : (l.push(i % 1e14), f += 2);
-          f = c / 2;
+          for (o = crypto.getRandomValues(new Uint32Array(l *= 2)); t < l; )
+            i = o[t] * 131072 + (o[t + 1] >>> 11), i >= 9e15 ? (f = crypto.getRandomValues(new Uint32Array(2)), o[t] = f[0], o[t + 1] = f[1]) : (a.push(i % 1e14), t += 2);
+          t = l / 2;
         } else if (crypto.randomBytes) {
-          for (s = crypto.randomBytes(c *= 7); f < c; )
-            i = (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], i >= 9e15 ? crypto.randomBytes(7).copy(s, f) : (l.push(i % 1e14), f += 7);
-          f = c / 7;
+          for (o = crypto.randomBytes(l *= 7); t < l; )
+            i = (o[t] & 31) * 281474976710656 + o[t + 1] * 1099511627776 + o[t + 2] * 4294967296 + o[t + 3] * 16777216 + (o[t + 4] << 16) + (o[t + 5] << 8) + o[t + 6], i >= 9e15 ? crypto.randomBytes(7).copy(o, t) : (a.push(i % 1e14), t += 7);
+          t = l / 7;
         } else
-          throw j = !1, Error(G + "crypto unavailable");
+          throw j = !1, Error(q + "crypto unavailable");
       if (!j)
-        for (; f < c; )
-          i = r(), i < 9e15 && (l[f++] = i % 1e14);
-      for (c = l[--f], n %= E, c && n && (i = we[E - n], l[f] = $(c / i) * i); l[f] === 0; l.pop(), f--) ;
-      if (f < 0)
-        l = [o = 0];
+        for (; t < l; )
+          i = r(), i < 9e15 && (a[t++] = i % 1e14);
+      for (l = a[--t], n %= E, l && n && (i = ge[E - n], a[t] = V(l / i) * i); a[t] === 0; a.pop(), t--) ;
+      if (t < 0)
+        a = [u = 0];
       else {
-        for (o = -1; l[0] === 0; l.splice(0, 1), o -= E) ;
-        for (f = 1, i = l[0]; i >= 10; i /= 10, f++) ;
-        f < E && (o -= E - f);
+        for (u = -1; a[0] === 0; a.splice(0, 1), u -= E) ;
+        for (t = 1, i = a[0]; i >= 10; i /= 10, t++) ;
+        t < E && (u -= E - t);
       }
-      return u.e = o, u.c = l, u;
+      return s.e = u, s.c = a, s;
     };
   })(), g.sum = function() {
     for (var e = 1, r = arguments, n = new g(r[0]); e < r.length; ) n = n.plus(r[e++]);
     return n;
-  }, d = /* @__PURE__ */ (function() {
+  }, m = /* @__PURE__ */ (function() {
     var e = "0123456789";
-    function r(n, s, t, o) {
-      for (var c, i = [0], f, l = 0, u = n.length; l < u; ) {
-        for (f = i.length; f--; i[f] *= s) ;
-        for (i[0] += o.indexOf(n.charAt(l++)), c = 0; c < i.length; c++)
-          i[c] > t - 1 && (i[c + 1] == null && (i[c + 1] = 0), i[c + 1] += i[c] / t | 0, i[c] %= t);
+    function r(n, o, f, u) {
+      for (var l, i = [0], t, a = 0, s = n.length; a < s; ) {
+        for (t = i.length; t--; i[t] *= o) ;
+        for (i[0] += u.indexOf(n.charAt(a++)), l = 0; l < i.length; l++)
+          i[l] > f - 1 && (i[l + 1] == null && (i[l + 1] = 0), i[l + 1] += i[l] / f | 0, i[l] %= f);
       }
       return i.reverse();
     }
-    return function(n, s, t, o, c) {
-      var i, f, l, u, h, N, m, T, D = n.indexOf("."), L = S, A = R;
-      for (D >= 0 && (u = J, J = 0, n = n.replace(".", ""), T = new g(s), N = T.pow(n.length - D), J = u, T.c = r(
-        Z(y(N.c), N.e, "0"),
+    return function(n, o, f, u, l) {
+      var i, t, a, s, h, N, O, x, B = n.indexOf("."), L = R, A = P;
+      for (B >= 0 && (s = Z, Z = 0, n = n.replace(".", ""), x = new g(o), N = x.pow(n.length - B), Z = s, x.c = r(
+        Q(z(N.c), N.e, "0"),
         10,
-        t,
+        f,
         e
-      ), T.e = T.c.length), m = r(n, s, t, c ? (i = b, e) : (i = e, b)), l = u = m.length; m[--u] == 0; m.pop()) ;
-      if (!m[0]) return i.charAt(0);
-      if (D < 0 ? --l : (N.c = m, N.e = l, N.s = o, N = p(N, T, L, A, t), m = N.c, h = N.r, l = N.e), f = l + L + 1, D = m[f], u = t / 2, h = h || f < 0 || m[f + 1] != null, h = A < 4 ? (D != null || h) && (A == 0 || A == (N.s < 0 ? 3 : 2)) : D > u || D == u && (A == 4 || h || A == 6 && m[f - 1] & 1 || A == (N.s < 0 ? 8 : 7)), f < 1 || !m[0])
-        n = h ? Z(i.charAt(1), -L, i.charAt(0)) : i.charAt(0);
+      ), x.e = x.c.length), O = r(n, o, f, l ? (i = b, e) : (i = e, b)), a = s = O.length; O[--s] == 0; O.pop()) ;
+      if (!O[0]) return i.charAt(0);
+      if (B < 0 ? --a : (N.c = O, N.e = a, N.s = u, N = p(N, x, L, A, f), O = N.c, h = N.r, a = N.e), t = a + L + 1, B = O[t], s = f / 2, h = h || t < 0 || O[t + 1] != null, h = A < 4 ? (B != null || h) && (A == 0 || A == (N.s < 0 ? 3 : 2)) : B > s || B == s && (A == 4 || h || A == 6 && O[t - 1] & 1 || A == (N.s < 0 ? 8 : 7)), t < 1 || !O[0])
+        n = h ? Q(i.charAt(1), -L, i.charAt(0)) : i.charAt(0);
       else {
-        if (m.length = f, h)
-          for (--t; ++m[--f] > t; )
-            m[f] = 0, f || (++l, m = [1].concat(m));
-        for (u = m.length; !m[--u]; ) ;
-        for (D = 0, n = ""; D <= u; n += i.charAt(m[D++])) ;
-        n = Z(n, l, i.charAt(0));
+        if (O.length = t, h)
+          for (--f; ++O[--t] > f; )
+            O[t] = 0, t || (++a, O = [1].concat(O));
+        for (s = O.length; !O[--s]; ) ;
+        for (B = 0, n = ""; B <= s; n += i.charAt(O[B++])) ;
+        n = Q(n, a, i.charAt(0));
       }
       return n;
     };
   })(), p = /* @__PURE__ */ (function() {
-    function e(s, t, o) {
-      var c, i, f, l, u = 0, h = s.length, N = t % Q, m = t / Q | 0;
-      for (s = s.slice(); h--; )
-        f = s[h] % Q, l = s[h] / Q | 0, c = m * f + l * N, i = N * f + c % Q * Q + u, u = (i / o | 0) + (c / Q | 0) + m * l, s[h] = i % o;
-      return u && (s = [u].concat(s)), s;
+    function e(o, f, u) {
+      var l, i, t, a, s = 0, h = o.length, N = f % J, O = f / J | 0;
+      for (o = o.slice(); h--; )
+        t = o[h] % J, a = o[h] / J | 0, l = O * t + a * N, i = N * t + l % J * J + s, s = (i / u | 0) + (l / J | 0) + O * a, o[h] = i % u;
+      return s && (o = [s].concat(o)), o;
     }
-    function r(s, t, o, c) {
-      var i, f;
-      if (o != c)
-        f = o > c ? 1 : -1;
+    function r(o, f, u, l) {
+      var i, t;
+      if (u != l)
+        t = u > l ? 1 : -1;
       else
-        for (i = f = 0; i < o; i++)
-          if (s[i] != t[i]) {
-            f = s[i] > t[i] ? 1 : -1;
+        for (i = t = 0; i < u; i++)
+          if (o[i] != f[i]) {
+            t = o[i] > f[i] ? 1 : -1;
             break;
           }
-      return f;
+      return t;
     }
-    function n(s, t, o, c) {
-      for (var i = 0; o--; )
-        s[o] -= i, i = s[o] < t[o] ? 1 : 0, s[o] = i * c + s[o] - t[o];
-      for (; !s[0] && s.length > 1; s.splice(0, 1)) ;
+    function n(o, f, u, l) {
+      for (var i = 0; u--; )
+        o[u] -= i, i = o[u] < f[u] ? 1 : 0, o[u] = i * l + o[u] - f[u];
+      for (; !o[0] && o.length > 1; o.splice(0, 1)) ;
     }
-    return function(s, t, o, c, i) {
-      var f, l, u, h, N, m, T, D, L, A, _, v, te, ae, he, W, ie, F = s.s == t.s ? 1 : -1, U = s.c, I = t.c;
-      if (!U || !U[0] || !I || !I[0])
+    return function(o, f, u, l, i) {
+      var t, a, s, h, N, O, x, B, L, A, T, D, ie, ce, ae, W, te, F = o.s == f.s ? 1 : -1, C = o.c, I = f.c;
+      if (!C || !C[0] || !I || !I[0])
         return new g(
           // Return NaN if either NaN, or both Infinity or 0.
-          !s.s || !t.s || (U ? I && U[0] == I[0] : !I) ? NaN : (
+          !o.s || !f.s || (C ? I && C[0] == I[0] : !I) ? NaN : (
             // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
-            U && U[0] == 0 || !I ? F * 0 : F / 0
+            C && C[0] == 0 || !I ? F * 0 : F / 0
           )
         );
-      for (D = new g(F), L = D.c = [], l = s.e - t.e, F = o + l + 1, i || (i = V, l = z(s.e / E) - z(t.e / E), F = F / E | 0), u = 0; I[u] == (U[u] || 0); u++) ;
-      if (I[u] > (U[u] || 0) && l--, F < 0)
+      for (B = new g(F), L = B.c = [], a = o.e - f.e, F = u + a + 1, i || (i = $, a = G(o.e / E) - G(f.e / E), F = F / E | 0), s = 0; I[s] == (C[s] || 0); s++) ;
+      if (I[s] > (C[s] || 0) && a--, F < 0)
         L.push(1), h = !0;
       else {
-        for (ae = U.length, W = I.length, u = 0, F += 2, N = $(i / (I[0] + 1)), N > 1 && (I = e(I, N, i), U = e(U, N, i), W = I.length, ae = U.length), te = W, A = U.slice(0, W), _ = A.length; _ < W; A[_++] = 0) ;
-        ie = I.slice(), ie = [0].concat(ie), he = I[0], I[1] >= i / 2 && he++;
+        for (ce = C.length, W = I.length, s = 0, F += 2, N = V(i / (I[0] + 1)), N > 1 && (I = e(I, N, i), C = e(C, N, i), W = I.length, ce = C.length), ie = W, A = C.slice(0, W), T = A.length; T < W; A[T++] = 0) ;
+        te = I.slice(), te = [0].concat(te), ae = I[0], I[1] >= i / 2 && ae++;
         do {
-          if (N = 0, f = r(I, A, W, _), f < 0) {
-            if (v = A[0], W != _ && (v = v * i + (A[1] || 0)), N = $(v / he), N > 1)
-              for (N >= i && (N = i - 1), m = e(I, N, i), T = m.length, _ = A.length; r(m, A, T, _) == 1; )
-                N--, n(m, W < T ? ie : I, T, i), T = m.length, f = 1;
+          if (N = 0, t = r(I, A, W, T), t < 0) {
+            if (D = A[0], W != T && (D = D * i + (A[1] || 0)), N = V(D / ae), N > 1)
+              for (N >= i && (N = i - 1), O = e(I, N, i), x = O.length, T = A.length; r(O, A, x, T) == 1; )
+                N--, n(O, W < x ? te : I, x, i), x = O.length, t = 1;
             else
-              N == 0 && (f = N = 1), m = I.slice(), T = m.length;
-            if (T < _ && (m = [0].concat(m)), n(A, m, _, i), _ = A.length, f == -1)
-              for (; r(I, A, W, _) < 1; )
-                N++, n(A, W < _ ? ie : I, _, i), _ = A.length;
-          } else f === 0 && (N++, A = [0]);
-          L[u++] = N, A[0] ? A[_++] = U[te] || 0 : (A = [U[te]], _ = 1);
-        } while ((te++ < ae || A[0] != null) && F--);
+              N == 0 && (t = N = 1), O = I.slice(), x = O.length;
+            if (x < T && (O = [0].concat(O)), n(A, O, T, i), T = A.length, t == -1)
+              for (; r(I, A, W, T) < 1; )
+                N++, n(A, W < T ? te : I, T, i), T = A.length;
+          } else t === 0 && (N++, A = [0]);
+          L[s++] = N, A[0] ? A[T++] = C[ie] || 0 : (A = [C[ie]], T = 1);
+        } while ((ie++ < ce || A[0] != null) && F--);
         h = A[0] != null, L[0] || L.splice(0, 1);
       }
-      if (i == V) {
-        for (u = 1, F = L[0]; F >= 10; F /= 10, u++) ;
-        q(D, o + (D.e = u + l * E - 1) + 1, c, h);
+      if (i == $) {
+        for (s = 1, F = L[0]; F >= 10; F /= 10, s++) ;
+        H(B, u + (B.e = s + a * E - 1) + 1, l, h);
       } else
-        D.e = l, D.r = +h;
-      return D;
+        B.e = a, B.r = +h;
+      return B;
     };
   })();
-  function le(e, r, n, s) {
-    var t, o, c, i, f;
-    if (n == null ? n = R : B(n, 0, 8), !e.c) return e.toString();
-    if (t = e.c[0], c = e.e, r == null)
-      f = y(e.c), f = s == 1 || s == 2 && (c <= C || c >= k) ? oe(f, c) : Z(f, c, "0");
-    else if (e = q(new g(e), r, n), o = e.e, f = y(e.c), i = f.length, s == 1 || s == 2 && (r <= o || o <= C)) {
-      for (; i < r; f += "0", i++) ;
-      f = oe(f, o);
-    } else if (r -= c + (s === 2 && o > c), f = Z(f, o, "0"), o + 1 > i) {
-      if (--r > 0) for (f += "."; r--; f += "0") ;
-    } else if (r += o - i, r > 0)
-      for (o + 1 == i && (f += "."); r--; f += "0") ;
-    return e.s < 0 && t ? "-" + f : f;
+  function se(e, r, n, o) {
+    var f, u, l, i, t;
+    if (n == null ? n = P : S(n, 0, 8), !e.c) return e.toString();
+    if (f = e.c[0], l = e.e, r == null)
+      t = z(e.c), t = o == 1 || o == 2 && (l <= U || l >= k) ? ue(t, l) : Q(t, l, "0");
+    else if (e = H(new g(e), r, n), u = e.e, t = z(e.c), i = t.length, o == 1 || o == 2 && (r <= u || u <= U)) {
+      for (; i < r; t += "0", i++) ;
+      t = ue(t, u);
+    } else if (r -= l + (o === 2 && u > l), t = Q(t, u, "0"), u + 1 > i) {
+      if (--r > 0) for (t += "."; r--; t += "0") ;
+    } else if (r += u - i, r > 0)
+      for (u + 1 == i && (t += "."); r--; t += "0") ;
+    return e.s < 0 && f ? "-" + t : t;
   }
-  function me(e, r) {
-    for (var n, s, t = 1, o = new g(e[0]); t < e.length; t++)
-      s = new g(e[t]), (!s.s || (n = ee(o, s)) === r || n === 0 && o.s === r) && (o = s);
-    return o;
+  function we(e) {
+    return e instanceof g || !!e && e._isBigNumber === !0;
   }
-  function ce(e, r, n) {
-    for (var s = 1, t = r.length; !r[--t]; r.pop()) ;
-    for (t = r[0]; t >= 10; t /= 10, s++) ;
-    return (n = s + n * E - 1) > H ? e.c = e.e = null : n < K ? e.c = [e.e = 0] : (e.e = n, e.c = r), e;
+  function Ne(e, r) {
+    for (var n, o, f = 1, u = new g(e[0]); f < e.length; f++)
+      o = new g(e[f]), (!o.s || (n = ee(u, o)) === r || n === 0 && u.s === r) && (u = o);
+    return u;
   }
-  O = /* @__PURE__ */ (function() {
-    var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, r = /^([^.]+)\.$/, n = /^\.([^.]+)$/, s = /^-?(Infinity|NaN)$/, t = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-    return function(o, c, i, f) {
-      var l, u = i ? c : c.replace(t, "");
-      if (s.test(u))
-        o.s = isNaN(u) ? null : u < 0 ? -1 : 1;
-      else {
-        if (!i && (u = u.replace(e, function(h, N, m) {
-          return l = (m = m.toLowerCase()) == "x" ? 16 : m == "b" ? 2 : 8, !f || f == l ? N : h;
-        }), f && (l = f, u = u.replace(r, "$1").replace(n, "0.$1")), c != u))
-          return new g(u, l);
-        if (g.DEBUG)
-          throw Error(G + "Not a" + (f ? " base " + f : "") + " number: " + c);
-        o.s = null;
+  function le(e, r, n) {
+    for (var o = 1, f = r.length; !r[--f]; r.pop()) ;
+    for (f = r[0]; f >= 10; f /= 10, o++) ;
+    return (n = o + n * E - 1) > y ? e.c = e.e = null : n < K ? e.c = [e.e = 0] : (e.e = n, e.c = r), e;
+  }
+  d = /* @__PURE__ */ (function() {
+    var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, r = /^([^.]+)\.$/, n = /^\.([^.]+)$/, o = /^-?(Infinity|NaN)$/, f = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+    return function(u, l, i) {
+      var t, a = l.replace(f, "");
+      if (o.test(a)) {
+        u.s = isNaN(a) ? null : a < 0 ? -1 : 1, u.c = u.e = null;
+        return;
       }
-      o.c = o.e = null;
+      if (a = a.replace(e, function(s, h, N) {
+        return t = (N = N.toLowerCase()) == "x" ? 16 : N == "b" ? 2 : 8, !i || i == t ? h : s;
+      }), i && (t = i, a = a.replace(r, "$1").replace(n, "0.$1")), l != a) return new g(a, t);
+      throw Error(q + "Not a" + (i ? " base " + i : "") + " number: " + l);
     };
   })();
-  function q(e, r, n, s) {
-    var t, o, c, i, f, l, u, h = e.c, N = we;
+  function H(e, r, n, o) {
+    var f, u, l, i, t, a, s, h = e.c, N = ge;
     if (h) {
       e: {
-        for (t = 1, i = h[0]; i >= 10; i /= 10, t++) ;
-        if (o = r - t, o < 0)
-          o += E, c = r, f = h[l = 0], u = $(f / N[t - c - 1] % 10);
-        else if (l = ge((o + 1) / E), l >= h.length)
-          if (s) {
-            for (; h.length <= l; h.push(0)) ;
-            f = u = 0, t = 1, o %= E, c = o - E + 1;
+        for (f = 1, i = h[0]; i >= 10; i /= 10, f++) ;
+        if (u = r - f, u < 0)
+          u += E, l = r, t = h[a = 0], s = V(t / N[f - l - 1] % 10);
+        else if (a = he((u + 1) / E), a >= h.length)
+          if (o) {
+            for (; h.length <= a; h.push(0)) ;
+            t = s = 0, f = 1, u %= E, l = u - E + 1;
           } else
             break e;
         else {
-          for (f = i = h[l], t = 1; i >= 10; i /= 10, t++) ;
-          o %= E, c = o - E + t, u = c < 0 ? 0 : $(f / N[t - c - 1] % 10);
+          for (t = i = h[a], f = 1; i >= 10; i /= 10, f++) ;
+          u %= E, l = u - E + f, s = l < 0 ? 0 : V(t / N[f - l - 1] % 10);
         }
-        if (s = s || r < 0 || // Are there any non-zero digits after the rounding digit?
+        if (o = o || r < 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.
-        h[l + 1] != null || (c < 0 ? f : f % N[t - c - 1]), s = n < 4 ? (u || s) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : u > 5 || u == 5 && (n == 4 || s || n == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (o > 0 ? c > 0 ? f / N[t - c] : 0 : h[l - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), r < 1 || !h[0])
-          return h.length = 0, s ? (r -= e.e + 1, h[0] = N[(E - r % E) % E], e.e = -r || 0) : h[0] = e.e = 0, e;
-        if (o == 0 ? (h.length = l, i = 1, l--) : (h.length = l + 1, i = N[E - o], h[l] = c > 0 ? $(f / N[t - c] % N[c]) * i : 0), s)
+        h[a + 1] != null || (l < 0 ? t : t % N[f - l - 1]), o = n < 4 ? (s || o) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : s > 5 || s == 5 && (n == 4 || o || n == 6 && // Check whether the digit to the left of the rounding digit is odd.
+        (u > 0 ? l > 0 ? t / N[f - l] : 0 : h[a - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), r < 1 || !h[0])
+          return h.length = 0, o ? (r -= e.e + 1, h[0] = N[(E - r % E) % E], e.e = -r || 0) : h[0] = e.e = 0, e;
+        if (u == 0 ? (h.length = a, i = 1, a--) : (h.length = a + 1, i = N[E - u], h[a] = l > 0 ? V(t / N[f - l] % N[l]) * i : 0), o)
           for (; ; )
-            if (l == 0) {
-              for (o = 1, c = h[0]; c >= 10; c /= 10, o++) ;
-              for (c = h[0] += i, i = 1; c >= 10; c /= 10, i++) ;
-              o != i && (e.e++, h[0] == V && (h[0] = 1));
+            if (a == 0) {
+              for (u = 1, l = h[0]; l >= 10; l /= 10, u++) ;
+              for (l = h[0] += i, i = 1; l >= 10; l /= 10, i++) ;
+              u != i && (e.e++, h[0] == $ && (h[0] = 1));
               break;
             } else {
-              if (h[l] += i, h[l] != V) break;
-              h[l--] = 0, i = 1;
+              if (h[a] += i, h[a] != $) break;
+              h[a--] = 0, i = 1;
             }
-        for (o = h.length; h[--o] === 0; h.pop()) ;
+        for (u = h.length; h[--u] === 0; h.pop()) ;
       }
-      e.e > H ? e.c = e.e = null : e.e < K && (e.c = [e.e = 0]);
+      e.e > y ? e.c = e.e = null : e.e < K && (e.c = [e.e = 0]);
     }
     return e;
   }
   function Y(e) {
     var r, n = e.e;
-    return n === null ? e.toString() : (r = y(e.c), r = n <= C || n >= k ? oe(r, n) : Z(r, n, "0"), e.s < 0 ? "-" + r : r);
+    return n === null ? e.toString() : (r = z(e.c), r = n <= U || n >= k ? ue(r, n) : Q(r, n, "0"), e.s < 0 ? "-" + r : r);
   }
   return w.absoluteValue = w.abs = function() {
     var e = new g(this);
@@ -364,50 +360,50 @@ function Oe(a) {
   }, w.comparedTo = function(e, r) {
     return ee(this, new g(e, r));
   }, w.decimalPlaces = w.dp = function(e, r) {
-    var n, s, t, o = this;
+    var n, o, f, u = this;
     if (e != null)
-      return B(e, 0, M), r == null ? r = R : B(r, 0, 8), q(new g(o), e + o.e + 1, r);
-    if (!(n = o.c)) return null;
-    if (s = ((t = n.length - 1) - z(this.e / E)) * E, t = n[t]) for (; t % 10 == 0; t /= 10, s--) ;
-    return s < 0 && (s = 0), s;
+      return S(e, 0, M), r == null ? r = P : S(r, 0, 8), H(new g(u), e + u.e + 1, r);
+    if (!(n = u.c)) return null;
+    if (o = ((f = n.length - 1) - G(this.e / E)) * E, f = n[f]) for (; f % 10 == 0; f /= 10, o--) ;
+    return o < 0 && (o = 0), o;
   }, w.dividedBy = w.div = function(e, r) {
-    return p(this, new g(e, r), S, R);
+    return p(this, new g(e, r), R, P);
   }, w.dividedToIntegerBy = w.idiv = function(e, r) {
     return p(this, new g(e, r), 0, 1);
   }, w.exponentiatedBy = w.pow = function(e, r) {
-    var n, s, t, o, c, i, f, l, u, h = this;
+    var n, o, f, u, l, i, t, a, s, h = this;
     if (e = new g(e), e.c && !e.isInteger())
-      throw Error(G + "Exponent not an integer: " + Y(e));
+      throw Error(q + "Exponent not an integer: " + Y(e));
     if (r != null && (r = new g(r)), i = e.e > 14, !h.c || !h.c[0] || h.c[0] == 1 && !h.e && h.c.length == 1 || !e.c || !e.c[0])
-      return u = new g(Math.pow(+Y(h), i ? e.s * (2 - fe(e)) : +Y(e))), r ? u.mod(r) : u;
-    if (f = e.s < 0, r) {
+      return s = new g(Math.pow(+Y(h), i ? e.s * (2 - fe(e)) : +Y(e))), r ? s.mod(r) : s;
+    if (t = e.s < 0, r) {
       if (r.c ? !r.c[0] : !r.s) return new g(NaN);
-      s = !f && h.isInteger() && r.isInteger(), s && (h = h.mod(r));
+      o = !t && h.isInteger() && r.isInteger(), o && (h = h.mod(r));
     } else {
       if (e.e > 9 && (h.e > 0 || h.e < -1 || (h.e == 0 ? h.c[0] > 1 || i && h.c[1] >= 24e7 : h.c[0] < 8e13 || i && h.c[0] <= 9999975e7)))
-        return o = h.s < 0 && fe(e) ? -0 : 0, h.e > -1 && (o = 1 / o), new g(f ? 1 / o : o);
-      J && (o = ge(J / E + 2));
+        return u = h.s < 0 && fe(e) ? -0 : 0, h.e > -1 && (u = 1 / u), new g(t ? 1 / u : u);
+      Z && (u = he(Z / E + 2));
     }
-    for (i ? (n = new g(0.5), f && (e.s = 1), l = fe(e)) : (t = Math.abs(+Y(e)), l = t % 2), u = new g(P); ; ) {
-      if (l) {
-        if (u = u.times(h), !u.c) break;
-        o ? u.c.length > o && (u.c.length = o) : s && (u = u.mod(r));
+    for (i ? (n = new g(0.5), t && (e.s = 1), a = fe(e)) : (f = Math.abs(+Y(e)), a = f % 2), s = new g(v); ; ) {
+      if (a) {
+        if (s = s.times(h), !s.c) break;
+        u ? s.c.length > u && (s.c.length = u) : o && (s = s.mod(r));
       }
-      if (t) {
-        if (t = $(t / 2), t === 0) break;
-        l = t % 2;
-      } else if (e = e.times(n), q(e, e.e + 1, 1), e.e > 14)
-        l = fe(e);
+      if (f) {
+        if (f = V(f / 2), f === 0) break;
+        a = f % 2;
+      } else if (e = e.times(n), H(e, e.e + 1, 1), e.e > 14)
+        a = fe(e);
       else {
-        if (t = +Y(e), t === 0) break;
-        l = t % 2;
+        if (f = +Y(e), f === 0) break;
+        a = f % 2;
       }
-      h = h.times(h), o ? h.c && h.c.length > o && (h.c.length = o) : s && (h = h.mod(r));
+      h = h.times(h), u ? h.c && h.c.length > u && (h.c.length = u) : o && (h = h.mod(r));
     }
-    return s ? u : (f && (u = P.div(u)), r ? u.mod(r) : o ? q(u, J, R, c) : u);
+    return o ? s : (t && (s = v.div(s)), r ? s.mod(r) : u ? H(s, Z, P, l) : s);
   }, w.integerValue = function(e) {
     var r = new g(this);
-    return e == null ? e = R : B(e, 0, 8), q(r, r.e + 1, e);
+    return e == null ? e = P : S(e, 0, 8), H(r, r.e + 1, e);
   }, w.isEqualTo = w.eq = function(e, r) {
     return ee(this, new g(e, r)) === 0;
   }, w.isFinite = function() {
@@ -417,7 +413,7 @@ function Oe(a) {
   }, w.isGreaterThanOrEqualTo = w.gte = function(e, r) {
     return (r = ee(this, new g(e, r))) === 1 || r === 0;
   }, w.isInteger = function() {
-    return !!this.c && z(this.e / E) > this.c.length - 2;
+    return !!this.c && G(this.e / E) > this.c.length - 2;
   }, w.isLessThan = w.lt = function(e, r) {
     return ee(this, new g(e, r)) < 0;
   }, w.isLessThanOrEqualTo = w.lte = function(e, r) {
@@ -431,319 +427,325 @@ function Oe(a) {
   }, w.isZero = function() {
     return !!this.c && this.c[0] == 0;
   }, w.minus = function(e, r) {
-    var n, s, t, o, c = this, i = c.s;
+    var n, o, f, u, l = this, i = l.s;
     if (e = new g(e, r), r = e.s, !i || !r) return new g(NaN);
     if (i != r)
-      return e.s = -r, c.plus(e);
-    var f = c.e / E, l = e.e / E, u = c.c, h = e.c;
-    if (!f || !l) {
-      if (!u || !h) return u ? (e.s = -r, e) : new g(h ? c : NaN);
-      if (!u[0] || !h[0])
-        return h[0] ? (e.s = -r, e) : new g(u[0] ? c : (
+      return e.s = -r, l.plus(e);
+    var t = l.e / E, a = e.e / E, s = l.c, h = e.c;
+    if (!t || !a) {
+      if (!s || !h) return s ? (e.s = -r, e) : new g(h ? l : NaN);
+      if (!s[0] || !h[0])
+        return h[0] ? (e.s = -r, e) : new g(s[0] ? l : (
           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
-          R == 3 ? -0 : 0
+          P == 3 ? -0 : 0
         ));
     }
-    if (f = z(f), l = z(l), u = u.slice(), i = f - l) {
-      for ((o = i < 0) ? (i = -i, t = u) : (l = f, t = h), t.reverse(), r = i; r--; t.push(0)) ;
-      t.reverse();
+    if (t = G(t), a = G(a), s = s.slice(), i = t - a) {
+      for ((u = i < 0) ? (i = -i, f = s) : (a = t, f = h), f.reverse(), r = i; r--; f.push(0)) ;
+      f.reverse();
     } else
-      for (s = (o = (i = u.length) < (r = h.length)) ? i : r, i = r = 0; r < s; r++)
-        if (u[r] != h[r]) {
-          o = u[r] < h[r];
+      for (o = (u = (i = s.length) < (r = h.length)) ? i : r, i = r = 0; r < o; r++)
+        if (s[r] != h[r]) {
+          u = s[r] < h[r];
           break;
         }
-    if (o && (t = u, u = h, h = t, e.s = -e.s), r = (s = h.length) - (n = u.length), r > 0) for (; r--; u[n++] = 0) ;
-    for (r = V - 1; s > i; ) {
-      if (u[--s] < h[s]) {
-        for (n = s; n && !u[--n]; u[n] = r) ;
-        --u[n], u[s] += V;
+    if (u && (f = s, s = h, h = f, e.s = -e.s), r = (o = h.length) - (n = s.length), r > 0) for (; r--; s[n++] = 0) ;
+    for (r = $ - 1; o > i; ) {
+      if (s[--o] < h[o]) {
+        for (n = o; n && !s[--n]; s[n] = r) ;
+        --s[n], s[o] += $;
       }
-      u[s] -= h[s];
+      s[o] -= h[o];
     }
-    for (; u[0] == 0; u.splice(0, 1), --l) ;
-    return u[0] ? ce(e, u, l) : (e.s = R == 3 ? -1 : 1, e.c = [e.e = 0], e);
+    for (; s[0] == 0; s.splice(0, 1), --a) ;
+    return s[0] ? le(e, s, a) : (e.s = P == 3 ? -1 : 1, e.c = [e.e = 0], e);
   }, w.modulo = w.mod = function(e, r) {
-    var n, s, t = this;
-    return e = new g(e, r), !t.c || !e.s || e.c && !e.c[0] ? new g(NaN) : !e.c || t.c && !t.c[0] ? new g(t) : (ne == 9 ? (s = e.s, e.s = 1, n = p(t, e, 0, 3), e.s = s, n.s *= s) : n = p(t, e, 0, ne), e = t.minus(n.times(e)), !e.c[0] && ne == 1 && (e.s = t.s), e);
+    var n, o, f = this;
+    return e = new g(e, r), !f.c || !e.s || e.c && !e.c[0] ? new g(NaN) : !e.c || f.c && !f.c[0] ? new g(f) : (ne == 9 ? (o = e.s, e.s = 1, n = p(f, e, 0, 3), e.s = o, n.s *= o) : n = p(f, e, 0, ne), e = f.minus(n.times(e)), !e.c[0] && ne == 1 && (e.s = f.s), e);
   }, w.multipliedBy = w.times = function(e, r) {
-    var n, s, t, o, c, i, f, l, u, h, N, m, T, D, L, A = this, _ = A.c, v = (e = new g(e, r)).c;
-    if (!_ || !v || !_[0] || !v[0])
-      return !A.s || !e.s || _ && !_[0] && !v || v && !v[0] && !_ ? e.c = e.e = e.s = null : (e.s *= A.s, !_ || !v ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
-    for (s = z(A.e / E) + z(e.e / E), e.s *= A.s, f = _.length, h = v.length, f < h && (T = _, _ = v, v = T, t = f, f = h, h = t), t = f + h, T = []; t--; T.push(0)) ;
-    for (D = V, L = Q, t = h; --t >= 0; ) {
-      for (n = 0, N = v[t] % L, m = v[t] / L | 0, c = f, o = t + c; o > t; )
-        l = _[--c] % L, u = _[c] / L | 0, i = m * l + u * N, l = N * l + i % L * L + T[o] + n, n = (l / D | 0) + (i / L | 0) + m * u, T[o--] = l % D;
-      T[o] = n;
+    var n, o, f, u, l, i, t, a, s, h, N, O, x, B, L, A = this, T = A.c, D = (e = new g(e, r)).c;
+    if (!T || !D || !T[0] || !D[0])
+      return !A.s || !e.s || T && !T[0] && !D || D && !D[0] && !T ? e.c = e.e = e.s = null : (e.s *= A.s, !T || !D ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
+    for (o = G(A.e / E) + G(e.e / E), e.s *= A.s, t = T.length, h = D.length, t < h && (x = T, T = D, D = x, f = t, t = h, h = f), f = t + h, x = []; f--; x.push(0)) ;
+    for (B = $, L = J, f = h; --f >= 0; ) {
+      for (n = 0, N = D[f] % L, O = D[f] / L | 0, l = t, u = f + l; u > f; )
+        a = T[--l] % L, s = T[l] / L | 0, i = O * a + s * N, a = N * a + i % L * L + x[u] + n, n = (a / B | 0) + (i / L | 0) + O * s, x[u--] = a % B;
+      x[u] = n;
     }
-    return n ? ++s : T.splice(0, 1), ce(e, T, s);
+    return n ? ++o : x.splice(0, 1), le(e, x, o);
   }, w.negated = function() {
     var e = new g(this);
     return e.s = -e.s || null, e;
   }, w.plus = function(e, r) {
-    var n, s = this, t = s.s;
-    if (e = new g(e, r), r = e.s, !t || !r) return new g(NaN);
-    if (t != r)
-      return e.s = -r, s.minus(e);
-    var o = s.e / E, c = e.e / E, i = s.c, f = e.c;
-    if (!o || !c) {
-      if (!i || !f) return new g(t / 0);
-      if (!i[0] || !f[0]) return f[0] ? e : new g(i[0] ? s : t * 0);
+    var n, o = this, f = o.s;
+    if (e = new g(e, r), r = e.s, !f || !r) return new g(NaN);
+    if (f != r)
+      return e.s = -r, o.minus(e);
+    var u = o.e / E, l = e.e / E, i = o.c, t = e.c;
+    if (!u || !l) {
+      if (!i || !t) return new g(f / 0);
+      if (!i[0] || !t[0]) return t[0] ? e : new g(i[0] ? o : f * 0);
     }
-    if (o = z(o), c = z(c), i = i.slice(), t = o - c) {
-      for (t > 0 ? (c = o, n = f) : (t = -t, n = i), n.reverse(); t--; n.push(0)) ;
+    if (u = G(u), l = G(l), i = i.slice(), f = u - l) {
+      for (f > 0 ? (l = u, n = t) : (f = -f, n = i), n.reverse(); f--; n.push(0)) ;
       n.reverse();
     }
-    for (t = i.length, r = f.length, t - r < 0 && (n = f, f = i, i = n, r = t), t = 0; r; )
-      t = (i[--r] = i[r] + f[r] + t) / V | 0, i[r] = V === i[r] ? 0 : i[r] % V;
-    return t && (i = [t].concat(i), ++c), ce(e, i, c);
+    for (f = i.length, r = t.length, f - r < 0 && (n = t, t = i, i = n, r = f), f = 0; r; )
+      f = (i[--r] = i[r] + t[r] + f) / $ | 0, i[r] = $ === i[r] ? 0 : i[r] % $;
+    return f && (i = [f].concat(i), ++l), le(e, i, l);
   }, w.precision = w.sd = function(e, r) {
-    var n, s, t, o = this;
+    var n, o, f, u = this;
     if (e != null && e !== !!e)
-      return B(e, 1, M), r == null ? r = R : B(r, 0, 8), q(new g(o), e, r);
-    if (!(n = o.c)) return null;
-    if (t = n.length - 1, s = t * E + 1, t = n[t]) {
-      for (; t % 10 == 0; t /= 10, s--) ;
-      for (t = n[0]; t >= 10; t /= 10, s++) ;
+      return S(e, 1, M), r == null ? r = P : S(r, 0, 8), H(new g(u), e, r);
+    if (!(n = u.c)) return null;
+    if (f = n.length - 1, o = f * E + 1, f = n[f]) {
+      for (; f % 10 == 0; f /= 10, o--) ;
+      for (f = n[0]; f >= 10; f /= 10, o++) ;
     }
-    return e && o.e + 1 > s && (s = o.e + 1), s;
+    return e && u.e + 1 > o && (o = u.e + 1), o;
   }, w.shiftedBy = function(e) {
-    return B(e, -pe, pe), this.times("1e" + e);
+    return S(e, -Oe, Oe), this.times("1e" + e);
   }, w.squareRoot = w.sqrt = function() {
-    var e, r, n, s, t, o = this, c = o.c, i = o.s, f = o.e, l = S + 4, u = new g("0.5");
-    if (i !== 1 || !c || !c[0])
-      return new g(!i || i < 0 && (!c || c[0]) ? NaN : c ? o : 1 / 0);
-    if (i = Math.sqrt(+Y(o)), i == 0 || i == 1 / 0 ? (r = y(c), (r.length + f) % 2 == 0 && (r += "0"), i = Math.sqrt(+r), f = z((f + 1) / 2) - (f < 0 || f % 2), i == 1 / 0 ? r = "5e" + f : (r = i.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + f), n = new g(r)) : n = new g(i + ""), n.c[0]) {
-      for (f = n.e, i = f + l, i < 3 && (i = 0); ; )
-        if (t = n, n = u.times(t.plus(p(o, t, l, 1))), y(t.c).slice(0, i) === (r = y(n.c)).slice(0, i))
-          if (n.e < f && --i, r = r.slice(i - 3, i + 1), r == "9999" || !s && r == "4999") {
-            if (!s && (q(t, t.e + S + 2, 0), t.times(t).eq(o))) {
-              n = t;
+    var e, r, n, o, f, u = this, l = u.c, i = u.s, t = u.e, a = R + 4, s = new g("0.5");
+    if (i !== 1 || !l || !l[0])
+      return new g(!i || i < 0 && (!l || l[0]) ? NaN : l ? u : 1 / 0);
+    if (i = Math.sqrt(+Y(u)), i == 0 || i == 1 / 0 ? (r = z(l), (r.length + t) % 2 == 0 && (r += "0"), i = Math.sqrt(+r), t = G((t + 1) / 2) - (t < 0 || t % 2), i == 1 / 0 ? r = "5e" + t : (r = i.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + t), n = new g(r)) : n = new g(i + ""), n.c[0]) {
+      for (t = n.e, i = t + a, i < 3 && (i = 0); ; )
+        if (f = n, n = s.times(f.plus(p(u, f, a, 1))), z(f.c).slice(0, i) === (r = z(n.c)).slice(0, i))
+          if (n.e < t && --i, r = r.slice(i - 3, i + 1), r == "9999" || !o && r == "4999") {
+            if (!o && (H(f, f.e + R + 2, 0), f.times(f).eq(u))) {
+              n = f;
               break;
             }
-            l += 4, i += 4, s = 1;
+            a += 4, i += 4, o = 1;
           } else {
-            (!+r || !+r.slice(1) && r.charAt(0) == "5") && (q(n, n.e + S + 2, 1), e = !n.times(n).eq(o));
+            (!+r || !+r.slice(1) && r.charAt(0) == "5") && (H(n, n.e + R + 2, 1), e = !n.times(n).eq(u));
             break;
           }
     }
-    return q(n, n.e + S + 1, R, e);
+    return H(n, n.e + R + 1, P, e);
   }, w.toExponential = function(e, r) {
-    return e != null && (B(e, 0, M), e++), le(this, e, r, 1);
+    return e != null && (S(e, 0, M), e++), se(this, e, r, 1);
   }, w.toFixed = function(e, r) {
-    return e != null && (B(e, 0, M), e = e + this.e + 1), le(this, e, r);
+    return e != null && (S(e, 0, M), e = e + this.e + 1), se(this, e, r);
   }, w.toFormat = function(e, r, n) {
-    var s, t = this;
+    var o, f = this;
     if (n == null)
-      e != null && r && typeof r == "object" ? (n = r, r = null) : e && typeof e == "object" ? (n = e, e = r = null) : n = ue;
+      e != null && r && typeof r == "object" ? (n = r, r = null) : e && typeof e == "object" ? (n = e, e = r = null) : n = oe;
     else if (typeof n != "object")
-      throw Error(G + "Argument not an object: " + n);
-    if (s = t.toFixed(e, r), t.c) {
-      var o, c = s.split("."), i = +n.groupSize, f = +n.secondaryGroupSize, l = n.groupSeparator || "", u = c[0], h = c[1], N = t.s < 0, m = N ? u.slice(1) : u, T = m.length;
-      if (f && (o = i, i = f, f = o, T -= o), i > 0 && T > 0) {
-        for (o = T % i || i, u = m.substr(0, o); o < T; o += i) u += l + m.substr(o, i);
-        f > 0 && (u += l + m.slice(o)), N && (u = "-" + u);
+      throw Error(q + "Argument not an object: " + n);
+    if (o = f.toFixed(e, r), f.c) {
+      var u, l = o.split("."), i = +n.groupSize, t = +n.secondaryGroupSize, a = n.groupSeparator || "", s = l[0], h = l[1], N = f.s < 0, O = N ? s.slice(1) : s, x = O.length;
+      if (t && (u = i, i = t, t = u, x -= u), i > 0 && x > 0) {
+        for (u = x % i || i, s = O.substr(0, u); u < x; u += i) s += a + O.substr(u, i);
+        t > 0 && (s += a + O.slice(u)), N && (s = "-" + s);
       }
-      s = h ? u + (n.decimalSeparator || "") + ((f = +n.fractionGroupSize) ? h.replace(
-        new RegExp("\\d{" + f + "}\\B", "g"),
+      o = h ? s + (n.decimalSeparator || "") + ((t = +n.fractionGroupSize) ? h.replace(
+        new RegExp("\\d{" + t + "}\\B", "g"),
         "$&" + (n.fractionGroupSeparator || "")
-      ) : h) : u;
+      ) : h) : s;
     }
-    return (n.prefix || "") + s + (n.suffix || "");
+    return (n.prefix || "") + o + (n.suffix || "");
   }, w.toFraction = function(e) {
-    var r, n, s, t, o, c, i, f, l, u, h, N, m = this, T = m.c;
-    if (e != null && (i = new g(e), !i.isInteger() && (i.c || i.s !== 1) || i.lt(P)))
-      throw Error(G + "Argument " + (i.isInteger() ? "out of range: " : "not an integer: ") + Y(i));
-    if (!T) return new g(m);
-    for (r = new g(P), l = n = new g(P), s = f = new g(P), N = y(T), o = r.e = N.length - m.e - 1, r.c[0] = we[(c = o % E) < 0 ? E + c : c], e = !e || i.comparedTo(r) > 0 ? o > 0 ? r : l : i, c = H, H = 1 / 0, i = new g(N), f.c[0] = 0; u = p(i, r, 0, 1), t = n.plus(u.times(s)), t.comparedTo(e) != 1; )
-      n = s, s = t, l = f.plus(u.times(t = l)), f = t, r = i.minus(u.times(t = r)), i = t;
-    return t = p(e.minus(n), s, 0, 1), f = f.plus(t.times(l)), n = n.plus(t.times(s)), f.s = l.s = m.s, o = o * 2, h = p(l, s, o, R).minus(m).abs().comparedTo(
-      p(f, n, o, R).minus(m).abs()
-    ) < 1 ? [l, s] : [f, n], H = c, h;
+    var r, n, o, f, u, l, i, t, a, s, h, N, O = this, x = O.c;
+    if (e != null && (i = new g(e), !i.isInteger() && (i.c || i.s !== 1) || i.lt(v)))
+      throw Error(q + "Argument " + (i.isInteger() ? "out of range: " : "not an integer: ") + Y(i));
+    if (!x) return new g(O);
+    for (r = new g(v), a = n = new g(v), o = t = new g(v), N = z(x), u = r.e = N.length - O.e - 1, r.c[0] = ge[(l = u % E) < 0 ? E + l : l], e = !e || i.comparedTo(r) > 0 ? u > 0 ? r : a : i, l = y, y = 1 / 0, i = new g(N), t.c[0] = 0; s = p(i, r, 0, 1), f = n.plus(s.times(o)), f.comparedTo(e) != 1; )
+      n = o, o = f, a = t.plus(s.times(f = a)), t = f, r = i.minus(s.times(f = r)), i = f;
+    return f = p(e.minus(n), o, 0, 1), t = t.plus(f.times(a)), n = n.plus(f.times(o)), t.s = a.s = O.s, u = u * 2, h = p(a, o, u, P).minus(O).abs().comparedTo(
+      p(t, n, u, P).minus(O).abs()
+    ) < 1 ? [a, o] : [t, n], y = l, h;
   }, w.toNumber = function() {
     return +Y(this);
+  }, w.toObject = function() {
+    var e = this;
+    return {
+      c: e.c ? e.c.slice() : null,
+      e: e.e,
+      s: e.s
+    };
   }, w.toPrecision = function(e, r) {
-    return e != null && B(e, 1, M), le(this, e, r, 2);
+    return e != null && S(e, 1, M), se(this, e, r, 2);
   }, w.toString = function(e) {
-    var r, n = this, s = n.s, t = n.e;
-    return t === null ? s ? (r = "Infinity", s < 0 && (r = "-" + r)) : r = "NaN" : (e == null ? r = t <= C || t >= k ? oe(y(n.c), t) : Z(y(n.c), t, "0") : e === 10 && se ? (n = q(new g(n), S + t + 1, R), r = Z(y(n.c), n.e, "0")) : (B(e, 2, b.length, "Base"), r = d(Z(y(n.c), t, "0"), 10, e, s, !0)), s < 0 && n.c[0] && (r = "-" + r)), r;
+    var r, n = this, o = n.s, f = n.e;
+    return f === null ? o ? (r = "Infinity", o < 0 && (r = "-" + r)) : r = "NaN" : (e == null ? r = f <= U || f >= k ? ue(z(n.c), f) : Q(z(n.c), f, "0") : (S(e, 2, b.length, "Base"), r = m(Q(z(n.c), f, "0"), 10, e, o, !0)), o < 0 && n.c[0] && (r = "-" + r)), r;
   }, w.valueOf = w.toJSON = function() {
     return Y(this);
-  }, w._isBigNumber = !0, w[Symbol.toStringTag] = "BigNumber", w[/* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom")] = w.valueOf, a != null && g.set(a), g;
+  }, w._isBigNumber = !0, c != null && g.set(c), g;
 }
-function z(a) {
-  var p = a | 0;
-  return a > 0 || a === p ? p : p - 1;
+function G(c) {
+  var p = c | 0;
+  return c > 0 || c === p ? p : p - 1;
 }
-function y(a) {
-  for (var p, d, O = 1, w = a.length, P = a[0] + ""; O < w; ) {
-    for (p = a[O++] + "", d = E - p.length; d--; p = "0" + p) ;
-    P += p;
+function z(c) {
+  for (var p, m, d = 1, w = c.length, v = c[0] + ""; d < w; ) {
+    for (p = c[d++] + "", m = E - p.length; m--; p = "0" + p) ;
+    v += p;
   }
-  for (w = P.length; P.charCodeAt(--w) === 48; ) ;
-  return P.slice(0, w + 1 || 1);
-}
-function ee(a, p) {
-  var d, O, w = a.c, P = p.c, S = a.s, R = p.s, C = a.e, k = p.e;
-  if (!S || !R) return null;
-  if (d = w && !w[0], O = P && !P[0], d || O) return d ? O ? 0 : -R : S;
-  if (S != R) return S;
-  if (d = S < 0, O = C == k, !w || !P) return O ? 0 : !w ^ d ? 1 : -1;
-  if (!O) return C > k ^ d ? 1 : -1;
-  for (R = (C = w.length) < (k = P.length) ? C : k, S = 0; S < R; S++) if (w[S] != P[S]) return w[S] > P[S] ^ d ? 1 : -1;
-  return C == k ? 0 : C > k ^ d ? 1 : -1;
-}
-function B(a, p, d, O) {
-  if (a < p || a > d || a !== $(a))
-    throw Error(G + (O || "Argument") + (typeof a == "number" ? a < p || a > d ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(a));
-}
-function fe(a) {
-  var p = a.c.length - 1;
-  return z(a.e / E) == p && a.c[p] % 2 != 0;
-}
-function oe(a, p) {
-  return (a.length > 1 ? a.charAt(0) + "." + a.slice(1) : a) + (p < 0 ? "e" : "e+") + p;
-}
-function Z(a, p, d) {
-  var O, w;
+  for (w = v.length; v.charCodeAt(--w) === 48; ) ;
+  return v.slice(0, w + 1 || 1);
+}
+function ee(c, p) {
+  var m, d, w = c.c, v = p.c, R = c.s, P = p.s, U = c.e, k = p.e;
+  if (!R || !P) return null;
+  if (m = w && !w[0], d = v && !v[0], m || d) return m ? d ? 0 : -P : R;
+  if (R != P) return R;
+  if (m = R < 0, d = U == k, !w || !v) return d ? 0 : !w ^ m ? 1 : -1;
+  if (!d) return U > k ^ m ? 1 : -1;
+  for (P = (U = w.length) < (k = v.length) ? U : k, R = 0; R < P; R++) if (w[R] != v[R]) return w[R] > v[R] ^ m ? 1 : -1;
+  return U == k ? 0 : U > k ^ m ? 1 : -1;
+}
+function S(c, p, m, d) {
+  if (c < p || c > m || c !== V(c))
+    throw Error(q + (d || "Argument") + (typeof c == "number" ? c < p || c > m ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(c));
+}
+function fe(c) {
+  var p = c.c.length - 1;
+  return G(c.e / E) == p && c.c[p] % 2 != 0;
+}
+function ue(c, p) {
+  return (c.length > 1 ? c.charAt(0) + "." + c.slice(1) : c) + (p < 0 ? "e" : "e+") + p;
+}
+function Q(c, p, m) {
+  var d, w;
   if (p < 0) {
-    for (w = d + "."; ++p; w += d) ;
-    a = w + a;
-  } else if (O = a.length, ++p > O) {
-    for (w = d, p -= O; --p; w += d) ;
-    a += w;
-  } else p < O && (a = a.slice(0, p) + "." + a.slice(p));
-  return a;
-}
-var X = Oe();
-const de = X.ROUND_DOWN, Ae = X.ROUND_UP, Me = X;
-function x(a) {
-  if (Se(a))
-    return X(~~a);
-  if (!a)
+    for (w = m + "."; ++p; w += m) ;
+    c = w + c;
+  } else if (d = c.length, ++p > d) {
+    for (w = m, p -= d; --p; w += m) ;
+    c += w;
+  } else p < d && (c = c.slice(0, p) + "." + c.slice(p));
+  return c;
+}
+const me = X.ROUND_DOWN, de = X.ROUND_UP, Le = X;
+function _(c) {
+  if (_e(c))
+    return X(~~c);
+  if (!c)
     return X(0);
-  if (Be(a))
-    return a.isNaN() ? X(0) : a;
-  const p = X(a);
+  if (Se(c))
+    return c.isNaN() ? X(0) : c;
+  const p = X(c);
   return p.isNaN() ? X(0) : p;
 }
-function Se(a) {
-  return typeof a == "boolean";
+function _e(c) {
+  return typeof c == "boolean";
 }
-function Be(a) {
-  return X.isBigNumber(a);
+function Se(c) {
+  return X.isBigNumber(c);
 }
-function ve(a) {
-  return typeof a == "number" && !Te(a);
+function Me(c) {
+  return typeof c == "number" && !Ae(c);
 }
-function Te(a) {
-  return a == null || a == null ? !1 : X(a).isNaN();
+function Ae(c) {
+  return c == null || c == null ? !1 : X(c).isNaN();
 }
-function Ue(a) {
-  return a == null || a == null ? !1 : X(a).isInteger();
+function De(c) {
+  return c == null || c == null ? !1 : X(c).isInteger();
 }
-function Ne(a, p) {
-  return x(a).isGreaterThan(x(p));
+function pe(c, p) {
+  return _(c).isGreaterThan(_(p));
 }
-function Re(a, p) {
-  return x(a).isLessThan(x(p));
+function Re(c, p) {
+  return _(c).isLessThan(_(p));
 }
-function De(a, p) {
-  return x(a).isEqualTo(x(p));
+function Be(c, p) {
+  return _(c).isEqualTo(_(p));
 }
-function Ie(a, p) {
-  return x(a).isGreaterThanOrEqualTo(x(p));
+function Ie(c, p) {
+  return _(c).isGreaterThanOrEqualTo(_(p));
 }
-function Pe(a, p) {
-  return x(a).isLessThanOrEqualTo(x(p));
+function Pe(c, p) {
+  return _(c).isLessThanOrEqualTo(_(p));
 }
-function Le(a) {
-  return x(a);
+function ve(c) {
+  return _(c);
 }
-function re(a) {
-  return x(a).toNumber();
+function re(c) {
+  return _(c).toNumber();
 }
-function Ce(a, p = !1) {
-  return re(x(a).integerValue(p ? Ae : de));
+function Ce(c, p = !1) {
+  return re(_(c).integerValue(p ? de : me));
 }
-function Ge(a) {
-  return x(a).toString();
+function Ue(c) {
+  return _(c).toString();
 }
-function _e(a, p, d = !1) {
-  const O = x(a);
-  return re(p !== void 0 ? O.decimalPlaces(p, d ? Ae : de) : O);
+function xe(c, p, m = !1) {
+  const d = _(c);
+  return re(p !== void 0 ? d.decimalPlaces(p, m ? de : me) : d);
 }
-function ke(a) {
-  return x(a).toFormat();
+function qe(c) {
+  return _(c).toFormat();
 }
-function qe(...a) {
-  if (a.length === 0)
+function ke(...c) {
+  if (c.length === 0)
     return 0;
-  const p = a.reduce((d, O) => x(d).plus(x(O)), 0);
+  const p = c.reduce((m, d) => _(m).plus(_(d)), 0);
   return re(p);
 }
-function Fe(...a) {
-  if (a.length === 0)
+function Fe(...c) {
+  if (c.length === 0)
     return 0;
-  const p = a.reduce((d, O) => x(d).minus(x(O)));
+  const p = c.reduce((m, d) => _(m).minus(_(d)));
   return re(p);
 }
-function ye(...a) {
-  if (a.length === 0)
+function Ge(...c) {
+  if (c.length === 0)
     return 0;
-  const p = a.reduce((d, O) => x(d).times(x(O)), 1);
+  const p = c.reduce((m, d) => _(m).times(_(d)), 1);
   return re(p);
 }
-function $e(...a) {
-  if (a.length === 0)
+function ye(...c) {
+  if (c.length === 0)
     return 0;
-  const p = a.map((O) => Le(O));
-  return p.some((O) => O.isZero()) ? 0 : p.reduce((O, w) => O.dividedBy(w)).toNumber();
+  const p = c.map((d) => ve(d));
+  return p.some((d) => d.isZero()) ? 0 : p.reduce((d, w) => d.dividedBy(w)).toNumber();
 }
-function ze(a, p) {
-  return re(x(a).pow(x(p)));
+function $e(c, p) {
+  return re(_(c).pow(_(p)));
 }
-function He(a, p = "%") {
-  const d = x(a).times(100);
-  return `${Ne(d, 0) ? _e(d, 2) : 0}${p}`;
+function ze(c, p = "%") {
+  const m = _(c).times(100);
+  return `${pe(m, 0) ? xe(m, 2) : 0}${p}`;
 }
-function Ve(a) {
-  const p = x(a).div(100);
-  return Ne(p, 0) ? _e(p, 4) : 0;
+function Ve(c) {
+  const p = _(c).div(100);
+  return pe(p, 0) ? xe(p, 4) : 0;
 }
-const Xe = Ne, We = Ie, Ye = Re, Ze = Pe, Je = De, Qe = Te;
+const Xe = pe, He = Ie, We = Re, Ye = Pe, Ze = Be, Je = Ae;
 export {
-  Me as BigNumber,
-  de as DOWN,
-  Ae as UP,
-  qe as add,
-  $e as divide,
-  Je as eq,
-  He as formatRate,
+  Le as BigNumber,
+  me as DOWN,
+  de as UP,
+  ke as add,
+  ye as divide,
+  Ze as eq,
+  ze as formatRate,
   Xe as gt,
-  We as gte,
-  x as helper,
-  Be as isBigNum,
-  Se as isBool,
-  De as isEqualTo,
-  Ne as isGreaterThan,
+  He as gte,
+  _ as helper,
+  Se as isBigNum,
+  _e as isBool,
+  Be as isEqualTo,
+  pe as isGreaterThan,
   Ie as isGreaterThanOrEqualTo,
-  Ue as isInt,
+  De as isInt,
   Re as isLessThan,
   Pe as isLessThanOrEqualTo,
-  Qe as isNan,
-  Te as isNanValue,
-  ve as isNum,
-  Ye as lt,
-  Ze as lte,
-  ye as multiply,
-  ze as power,
+  Je as isNan,
+  Ae as isNanValue,
+  Me as isNum,
+  We as lt,
+  Ye as lte,
+  Ge as multiply,
+  $e as power,
   Fe as subtract,
-  Le as toBigNum,
-  _e as toDecimalPlaces,
+  ve as toBigNum,
+  xe as toDecimalPlaces,
   Ce as toInt,
-  ke as toLocaleString,
+  qe as toLocaleString,
   re as toNum,
-  Ge as toString,
+  Ue as toString,
   Ve as unFormatRate
 };