jk-vue-comps 0.2.2 → 0.2.3

package/dist/utils/math.js

@@ -1,6 +1,6 @@
-var _e = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, ge = Math.ceil, $ = Math.floor, G = "[BigNumber Error] ", me = 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 Ee(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, oe = {
+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 = {
     prefix: "",
     groupSize: 3,
     secondaryGroupSize: 0,
@@ -12,72 +12,72 @@ function Ee(a) {
     suffix: ""
   }, b = "0123456789abcdefghijklmnopqrstuvwxyz", se = !0;
   function g(e, r) {
-    var n, s, t, u, c, i, f, l, o = this;
-    if (!(o instanceof g)) return new 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) {
-        o.s = e.s, !e.c || e.e > H ? o.c = o.e = null : e.e < K ? o.c = [o.e = 0] : (o.e = e.e, o.c = e.c.slice());
+        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());
         return;
       }
       if ((i = typeof e == "number") && e * 0 == 0) {
-        if (o.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
-          for (u = 0, c = e; c >= 10; c /= 10, u++) ;
-          u > H ? o.c = o.e = null : (o.e = u, o.c = [e]);
+        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]);
           return;
         }
         l = String(e);
       } else {
-        if (!_e.test(l = String(e))) return O(o, l, i);
-        o.s = l.charCodeAt(0) == 45 ? (l = l.slice(1), -1) : 1;
+        if (!xe.test(l = String(e))) return O(u, l, i);
+        u.s = l.charCodeAt(0) == 45 ? (l = l.slice(1), -1) : 1;
       }
-      (u = l.indexOf(".")) > -1 && (l = l.replace(".", "")), (c = l.search(/e/i)) > 0 ? (u < 0 && (u = c), u += +l.slice(c + 1), l = l.substring(0, c)) : u < 0 && (u = l.length);
+      (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);
     } else {
       if (B(r, 2, b.length, "Base"), r == 10 && se)
-        return o = new g(e), q(o, S + o.e + 1, R);
+        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(o, l, i, r);
-        if (o.s = 1 / e < 0 ? (l = l.slice(1), -1) : 1, g.DEBUG && l.replace(/^0\.0*|\./, "").length > 15)
-          throw Error(me + e);
+        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
-        o.s = l.charCodeAt(0) === 45 ? (l = l.slice(1), -1) : 1;
-      for (n = b.slice(0, r), u = c = 0, f = l.length; c < f; c++)
+        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 > u) {
-              u = f;
+            if (c > o) {
+              o = f;
               continue;
             }
           } else if (!t && (l == l.toUpperCase() && (l = l.toLowerCase()) || l == l.toLowerCase() && (l = l.toUpperCase()))) {
-            t = !0, c = -1, u = 0;
+            t = !0, c = -1, o = 0;
             continue;
           }
-          return O(o, String(e), i, r);
+          return O(u, String(e), i, r);
         }
-      i = !1, l = d(l, r, 10, o.s), (u = l.indexOf(".")) > -1 ? l = l.replace(".", "") : u = l.length;
+      i = !1, l = d(l, r, 10, u.s), (o = l.indexOf(".")) > -1 ? l = l.replace(".", "") : o = l.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(me + o.s * e);
-      if ((u = u - c - 1) > H)
-        o.c = o.e = null;
-      else if (u < K)
-        o.c = [o.e = 0];
+        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];
       else {
-        if (o.e = u, o.c = [], c = (u + 1) % E, u < 0 && (c += E), c < f) {
-          for (c && o.c.push(+l.slice(0, c)), f -= E; c < f; )
-            o.c.push(+l.slice(c, c += E));
+        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;
         } else
           c -= f;
         for (; c--; l += "0") ;
-        o.c.push(+l);
+        u.c.push(+l);
       }
     } else
-      o.c = [o.e = 0];
+      u.c = [u.e = 0];
   }
-  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) {
+  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) {
     var r, n;
     if (e != null)
       if (typeof e == "object") {
@@ -100,7 +100,7 @@ function Ee(a) {
           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") oe = n;
+          if (n = e[r], typeof n == "object") ue = n;
           else throw Error(G + r + " not an object: " + n);
         if (e.hasOwnProperty(r = "ALPHABET"))
           if (n = e[r], typeof n == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(n))
@@ -117,15 +117,15 @@ function Ee(a) {
       CRYPTO: j,
       MODULO_MODE: ne,
       POW_PRECISION: J,
-      FORMAT: oe,
+      FORMAT: ue,
       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, u = e.s;
+    var r, n, s = e.c, t = e.e, o = e.s;
     e: if ({}.toString.call(s) == "[object Array]") {
-      if ((u === 1 || u === -1) && t >= -M && t <= M && t === $(t)) {
+      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;
@@ -136,13 +136,13 @@ function Ee(a) {
           if (n !== 0) return !0;
         }
       }
-    } else if (s === null && t === null && (u === null || u === 1 || u === -1))
+    } else if (s === null && t === null && (o === null || o === 1 || o === -1))
       return !0;
     throw Error(G + "Invalid BigNumber: " + e);
   }, g.maximum = g.max = function() {
-    return Ne(arguments, -1);
+    return me(arguments, -1);
   }, g.minimum = g.min = function() {
-    return Ne(arguments, 1);
+    return me(arguments, 1);
   }, g.random = (function() {
     var e = 9007199254740992, r = Math.random() * e & 2097151 ? function() {
       return $(Math.random() * e);
@@ -150,7 +150,7 @@ function Ee(a) {
       return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
     };
     return function(n) {
-      var s, t, u, c, i, f = 0, l = [], o = new g(P);
+      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)
         if (crypto.getRandomValues) {
           for (s = crypto.getRandomValues(new Uint32Array(c *= 2)); f < c; )
@@ -167,74 +167,74 @@ function Ee(a) {
           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 = [u = 0];
+        l = [o = 0];
       else {
-        for (u = -1; l[0] === 0; l.splice(0, 1), u -= E) ;
+        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 && (u -= E - f);
+        f < E && (o -= E - f);
       }
-      return o.e = u, o.c = l, o;
+      return u.e = o, u.c = l, u;
     };
   })(), 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() {
     var e = "0123456789";
-    function r(n, s, t, u) {
-      for (var c, i = [0], f, l = 0, o = n.length; l < o; ) {
+    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] += u.indexOf(n.charAt(l++)), c = 0; c < i.length; c++)
+        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);
       }
       return i.reverse();
     }
-    return function(n, s, t, u, c) {
-      var i, f, l, o, h, N, m, T, D = n.indexOf("."), L = S, A = R;
-      for (D >= 0 && (o = J, J = 0, n = n.replace(".", ""), T = new g(s), N = T.pow(n.length - D), J = o, T.c = r(
+    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"),
         10,
         t,
         e
-      ), T.e = T.c.length), m = r(n, s, t, c ? (i = b, e) : (i = e, b)), l = o = m.length; m[--o] == 0; m.pop()) ;
+      ), 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 = u, N = p(N, T, L, A, t), m = N.c, h = N.r, l = N.e), f = l + L + 1, D = m[f], o = 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 > o || D == o && (A == 4 || h || A == 6 && m[f - 1] & 1 || A == (N.s < 0 ? 8 : 7)), f < 1 || !m[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);
       else {
         if (m.length = f, h)
           for (--t; ++m[--f] > t; )
             m[f] = 0, f || (++l, m = [1].concat(m));
-        for (o = m.length; !m[--o]; ) ;
-        for (D = 0, n = ""; D <= o; n += i.charAt(m[D++])) ;
+        for (u = m.length; !m[--u]; ) ;
+        for (D = 0, n = ""; D <= u; n += i.charAt(m[D++])) ;
         n = Z(n, l, i.charAt(0));
       }
       return n;
     };
   })(), p = /* @__PURE__ */ (function() {
-    function e(s, t, u) {
-      var c, i, f, l, o = 0, h = s.length, N = t % Q, m = t / Q | 0;
+    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 + o, o = (i / u | 0) + (c / Q | 0) + m * l, s[h] = i % u;
-      return o && (s = [o].concat(s)), s;
+        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 r(s, t, u, c) {
+    function r(s, t, o, c) {
       var i, f;
-      if (u != c)
-        f = u > c ? 1 : -1;
+      if (o != c)
+        f = o > c ? 1 : -1;
       else
-        for (i = f = 0; i < u; i++)
+        for (i = f = 0; i < o; i++)
           if (s[i] != t[i]) {
             f = s[i] > t[i] ? 1 : -1;
             break;
           }
       return f;
     }
-    function n(s, t, u, c) {
-      for (var i = 0; u--; )
-        s[u] -= i, i = s[u] < t[u] ? 1 : 0, s[u] = i * c + s[u] - t[u];
+    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)) ;
     }
-    return function(s, t, u, c, i) {
-      var f, l, o, 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;
+    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 new g(
           // Return NaN if either NaN, or both Infinity or 0.
@@ -243,11 +243,11 @@ function Ee(a) {
             U && U[0] == 0 || !I ? F * 0 : F / 0
           )
         );
-      for (D = new g(F), L = D.c = [], l = s.e - t.e, F = u + l + 1, i || (i = V, l = z(s.e / E) - z(t.e / E), F = F / E | 0), o = 0; I[o] == (U[o] || 0); o++) ;
-      if (I[o] > (U[o] || 0) && l--, 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)
         L.push(1), h = !0;
       else {
-        for (ae = U.length, W = I.length, o = 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) ;
+        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++;
         do {
           if (N = 0, f = r(I, A, W, _), f < 0) {
@@ -260,36 +260,36 @@ function Ee(a) {
               for (; r(I, A, W, _) < 1; )
                 N++, n(A, W < _ ? ie : I, _, i), _ = A.length;
           } else f === 0 && (N++, A = [0]);
-          L[o++] = N, A[0] ? A[_++] = U[te] || 0 : (A = [U[te]], _ = 1);
+          L[u++] = N, A[0] ? A[_++] = U[te] || 0 : (A = [U[te]], _ = 1);
         } while ((te++ < ae || A[0] != null) && F--);
         h = A[0] != null, L[0] || L.splice(0, 1);
       }
       if (i == V) {
-        for (o = 1, F = L[0]; F >= 10; F /= 10, o++) ;
-        q(D, u + (D.e = o + l * E - 1) + 1, c, h);
+        for (u = 1, F = L[0]; F >= 10; F /= 10, u++) ;
+        q(D, o + (D.e = u + l * E - 1) + 1, c, h);
       } else
         D.e = l, D.r = +h;
       return D;
     };
   })();
   function le(e, r, n, s) {
-    var t, u, c, i, f;
+    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) ? ue(f, c) : Z(f, c, "0");
-    else if (e = q(new g(e), r, n), u = e.e, f = y(e.c), i = f.length, s == 1 || s == 2 && (r <= u || u <= C)) {
+      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 = ue(f, u);
-    } else if (r -= c + (s === 2 && u > c), f = Z(f, u, "0"), u + 1 > 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 += u - i, r > 0)
-      for (u + 1 == i && (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 Ne(e, r) {
-    for (var n, s, t = 1, u = new g(e[0]); t < e.length; t++)
-      s = new g(e[t]), (!s.s || (n = ee(u, s)) === r || n === 0 && u.s === r) && (u = s);
-    return u;
+  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 ce(e, r, n) {
     for (var s = 1, t = r.length; !r[--t]; r.pop()) ;
@@ -298,57 +298,57 @@ function Ee(a) {
   }
   O = /* @__PURE__ */ (function() {
     var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, r = /^([^.]+)\.$/, n = /^\.([^.]+)$/, s = /^-?(Infinity|NaN)$/, t = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-    return function(u, c, i, f) {
-      var l, o = i ? c : c.replace(t, "");
-      if (s.test(o))
-        u.s = isNaN(o) ? null : o < 0 ? -1 : 1;
+    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 && (o = o.replace(e, function(h, N, m) {
+        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, o = o.replace(r, "$1").replace(n, "0.$1")), c != o))
-          return new g(o, l);
+        }), 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);
-        u.s = null;
+        o.s = null;
       }
-      u.c = u.e = null;
+      o.c = o.e = null;
     };
   })();
   function q(e, r, n, s) {
-    var t, u, c, i, f, l, o, h = e.c, N = we;
+    var t, o, c, i, f, l, u, h = e.c, N = we;
     if (h) {
       e: {
         for (t = 1, i = h[0]; i >= 10; i /= 10, t++) ;
-        if (u = r - t, u < 0)
-          u += E, c = r, f = h[l = 0], o = $(f / N[t - c - 1] % 10);
-        else if (l = ge((u + 1) / E), l >= h.length)
+        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 = o = 0, t = 1, u %= E, c = u - E + 1;
+            f = u = 0, t = 1, o %= E, c = o - E + 1;
           } else
             break e;
         else {
           for (f = i = h[l], t = 1; i >= 10; i /= 10, t++) ;
-          u %= E, c = u - E + t, o = c < 0 ? 0 : $(f / N[t - c - 1] % 10);
+          o %= E, c = o - E + t, u = c < 0 ? 0 : $(f / N[t - c - 1] % 10);
         }
         if (s = s || 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 ? (o || s) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : o > 5 || o == 5 && (n == 4 || s || n == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (u > 0 ? c > 0 ? f / N[t - c] : 0 : h[l - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), r < 1 || !h[0])
+        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 (u == 0 ? (h.length = l, i = 1, l--) : (h.length = l + 1, i = N[E - u], h[l] = c > 0 ? $(f / N[t - c] % N[c]) * i : 0), s)
+        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)
           for (; ; )
             if (l == 0) {
-              for (u = 1, c = h[0]; c >= 10; c /= 10, u++) ;
+              for (o = 1, c = h[0]; c >= 10; c /= 10, o++) ;
               for (c = h[0] += i, i = 1; c >= 10; c /= 10, i++) ;
-              u != i && (e.e++, h[0] == V && (h[0] = 1));
+              o != i && (e.e++, h[0] == V && (h[0] = 1));
               break;
             } else {
               if (h[l] += i, h[l] != V) break;
               h[l--] = 0, i = 1;
             }
-        for (u = h.length; h[--u] === 0; h.pop()) ;
+        for (o = h.length; h[--o] === 0; h.pop()) ;
       }
       e.e > H ? e.c = e.e = null : e.e < K && (e.c = [e.e = 0]);
     }
@@ -356,7 +356,7 @@ function Ee(a) {
   }
   function Y(e) {
     var r, n = e.e;
-    return n === null ? e.toString() : (r = y(e.c), r = n <= C || n >= k ? ue(r, n) : Z(r, n, "0"), e.s < 0 ? "-" + r : r);
+    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 w.absoluteValue = w.abs = function() {
     var e = new g(this);
@@ -364,10 +364,10 @@ function Ee(a) {
   }, w.comparedTo = function(e, r) {
     return ee(this, new g(e, r));
   }, w.decimalPlaces = w.dp = function(e, r) {
-    var n, s, t, u = this;
+    var n, s, t, o = this;
     if (e != null)
-      return B(e, 0, M), r == null ? r = R : B(r, 0, 8), q(new g(u), e + u.e + 1, r);
-    if (!(n = u.c)) return 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;
   }, w.dividedBy = w.div = function(e, r) {
@@ -375,23 +375,23 @@ function Ee(a) {
   }, 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, u, c, i, f, l, o, h = this;
+    var n, s, t, o, c, i, f, l, u, h = this;
     if (e = new g(e), e.c && !e.isInteger())
       throw Error(G + "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 o = new g(Math.pow(+Y(h), i ? e.s * (2 - fe(e)) : +Y(e))), r ? o.mod(r) : o;
+      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) {
       if (r.c ? !r.c[0] : !r.s) return new g(NaN);
       s = !f && h.isInteger() && r.isInteger(), s && (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 u = h.s < 0 && fe(e) ? -0 : 0, h.e > -1 && (u = 1 / u), new g(f ? 1 / u : u);
-      J && (u = ge(J / E + 2));
+        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));
     }
-    for (i ? (n = new g(0.5), f && (e.s = 1), l = fe(e)) : (t = Math.abs(+Y(e)), l = t % 2), o = new g(P); ; ) {
+    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 (o = o.times(h), !o.c) break;
-        u ? o.c.length > u && (o.c.length = u) : s && (o = o.mod(r));
+        if (u = u.times(h), !u.c) break;
+        o ? u.c.length > o && (u.c.length = o) : s && (u = u.mod(r));
       }
       if (t) {
         if (t = $(t / 2), t === 0) break;
@@ -402,9 +402,9 @@ function Ee(a) {
         if (t = +Y(e), t === 0) break;
         l = t % 2;
       }
-      h = h.times(h), u ? h.c && h.c.length > u && (h.c.length = u) : s && (h = h.mod(r));
+      h = h.times(h), o ? h.c && h.c.length > o && (h.c.length = o) : s && (h = h.mod(r));
     }
-    return s ? o : (f && (o = P.div(o)), r ? o.mod(r) : u ? q(o, J, R, c) : o);
+    return s ? u : (f && (u = P.div(u)), r ? u.mod(r) : o ? q(u, J, R, c) : u);
   }, w.integerValue = function(e) {
     var r = new g(this);
     return e == null ? e = R : B(e, 0, 8), q(r, r.e + 1, e);
@@ -431,50 +431,50 @@ function Ee(a) {
   }, w.isZero = function() {
     return !!this.c && this.c[0] == 0;
   }, w.minus = function(e, r) {
-    var n, s, t, u, c = this, i = c.s;
+    var n, s, t, o, c = this, i = c.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, o = c.c, h = e.c;
+    var f = c.e / E, l = e.e / E, u = c.c, h = e.c;
     if (!f || !l) {
-      if (!o || !h) return o ? (e.s = -r, e) : new g(h ? c : NaN);
-      if (!o[0] || !h[0])
-        return h[0] ? (e.s = -r, e) : new g(o[0] ? c : (
+      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 : (
           // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
           R == 3 ? -0 : 0
         ));
     }
-    if (f = z(f), l = z(l), o = o.slice(), i = f - l) {
-      for ((u = i < 0) ? (i = -i, t = o) : (l = f, t = h), t.reverse(), r = i; r--; t.push(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();
     } else
-      for (s = (u = (i = o.length) < (r = h.length)) ? i : r, i = r = 0; r < s; r++)
-        if (o[r] != h[r]) {
-          u = o[r] < h[r];
+      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];
           break;
         }
-    if (u && (t = o, o = h, h = t, e.s = -e.s), r = (s = h.length) - (n = o.length), r > 0) for (; r--; o[n++] = 0) ;
+    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 (o[--s] < h[s]) {
-        for (n = s; n && !o[--n]; o[n] = r) ;
-        --o[n], o[s] += V;
+      if (u[--s] < h[s]) {
+        for (n = s; n && !u[--n]; u[n] = r) ;
+        --u[n], u[s] += V;
       }
-      o[s] -= h[s];
+      u[s] -= h[s];
     }
-    for (; o[0] == 0; o.splice(0, 1), --l) ;
-    return o[0] ? ce(e, o, l) : (e.s = R == 3 ? -1 : 1, e.c = [e.e = 0], e);
+    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);
   }, 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);
   }, w.multipliedBy = w.times = function(e, r) {
-    var n, s, t, u, c, i, f, l, o, h, N, m, T, D, L, A = this, _ = A.c, v = (e = new g(e, r)).c;
+    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, u = t + c; u > t; )
-        l = _[--c] % L, o = _[c] / L | 0, i = m * l + o * N, l = N * l + i % L * L + T[u] + n, n = (l / D | 0) + (i / L | 0) + m * o, T[u--] = l % D;
-      T[u] = n;
+      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;
     }
     return n ? ++s : T.splice(0, 1), ce(e, T, s);
   }, w.negated = function() {
@@ -485,45 +485,45 @@ function Ee(a) {
     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 u = s.e / E, c = e.e / E, i = s.c, f = e.c;
-    if (!u || !c) {
+    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);
     }
-    if (u = z(u), c = z(c), i = i.slice(), t = u - c) {
-      for (t > 0 ? (c = u, n = f) : (t = -t, n = i), n.reverse(); t--; n.push(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)) ;
       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);
   }, w.precision = w.sd = function(e, r) {
-    var n, s, t, u = this;
+    var n, s, t, o = this;
     if (e != null && e !== !!e)
-      return B(e, 1, M), r == null ? r = R : B(r, 0, 8), q(new g(u), e, r);
-    if (!(n = u.c)) return null;
+      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 e && u.e + 1 > s && (s = u.e + 1), s;
+    return e && o.e + 1 > s && (s = o.e + 1), s;
   }, w.shiftedBy = function(e) {
     return B(e, -pe, pe), this.times("1e" + e);
   }, w.squareRoot = w.sqrt = function() {
-    var e, r, n, s, t, u = this, c = u.c, i = u.s, f = u.e, l = S + 4, o = new g("0.5");
+    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 ? u : 1 / 0);
-    if (i = Math.sqrt(+Y(u)), 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]) {
+      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 = o.times(t.plus(p(u, t, l, 1))), y(t.c).slice(0, i) === (r = y(n.c)).slice(0, i))
+        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(u))) {
+            if (!s && (q(t, t.e + S + 2, 0), t.times(t).eq(o))) {
               n = t;
               break;
             }
             l += 4, i += 4, s = 1;
           } else {
-            (!+r || !+r.slice(1) && r.charAt(0) == "5") && (q(n, n.e + S + 2, 1), e = !n.times(n).eq(u));
+            (!+r || !+r.slice(1) && r.charAt(0) == "5") && (q(n, n.e + S + 2, 1), e = !n.times(n).eq(o));
             break;
           }
     }
@@ -535,30 +535,30 @@ function Ee(a) {
   }, w.toFormat = function(e, r, n) {
     var s, t = this;
     if (n == null)
-      e != null && r && typeof r == "object" ? (n = r, r = null) : e && typeof e == "object" ? (n = e, e = r = null) : n = oe;
+      e != null && r && typeof r == "object" ? (n = r, r = null) : e && typeof e == "object" ? (n = e, e = r = null) : n = ue;
     else if (typeof n != "object")
       throw Error(G + "Argument not an object: " + n);
     if (s = t.toFixed(e, r), t.c) {
-      var u, c = s.split("."), i = +n.groupSize, f = +n.secondaryGroupSize, l = n.groupSeparator || "", o = c[0], h = c[1], N = t.s < 0, m = N ? o.slice(1) : o, T = m.length;
-      if (f && (u = i, i = f, f = u, T -= u), i > 0 && T > 0) {
-        for (u = T % i || i, o = m.substr(0, u); u < T; u += i) o += l + m.substr(u, i);
-        f > 0 && (o += l + m.slice(u)), N && (o = "-" + o);
+      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);
       }
-      s = h ? o + (n.decimalSeparator || "") + ((f = +n.fractionGroupSize) ? h.replace(
+      s = h ? u + (n.decimalSeparator || "") + ((f = +n.fractionGroupSize) ? h.replace(
         new RegExp("\\d{" + f + "}\\B", "g"),
         "$&" + (n.fractionGroupSeparator || "")
-      ) : h) : o;
+      ) : h) : u;
     }
     return (n.prefix || "") + s + (n.suffix || "");
   }, w.toFraction = function(e) {
-    var r, n, s, t, u, c, i, f, l, o, h, N, m = this, T = m.c;
+    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), u = r.e = N.length - m.e - 1, r.c[0] = we[(c = u % E) < 0 ? E + c : c], e = !e || i.comparedTo(r) > 0 ? u > 0 ? r : l : i, c = H, H = 1 / 0, i = new g(N), f.c[0] = 0; o = p(i, r, 0, 1), t = n.plus(o.times(s)), t.comparedTo(e) != 1; )
-      n = s, s = t, l = f.plus(o.times(t = l)), f = t, r = i.minus(o.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, u = u * 2, h = p(l, s, u, R).minus(m).abs().comparedTo(
-      p(f, n, u, R).minus(m).abs()
+    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;
   }, w.toNumber = function() {
     return +Y(this);
@@ -566,7 +566,7 @@ function Ee(a) {
     return e != null && B(e, 1, M), le(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 ? ue(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;
+    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;
   }, w.valueOf = w.toJSON = function() {
     return Y(this);
   }, w._isBigNumber = !0, w[Symbol.toStringTag] = "BigNumber", w[Symbol.for("nodejs.util.inspect.custom")] = w.valueOf, a != null && g.set(a), g;
@@ -601,7 +601,7 @@ function fe(a) {
   var p = a.c.length - 1;
   return z(a.e / E) == p && a.c[p] % 2 != 0;
 }
-function ue(a, p) {
+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) {
@@ -615,63 +615,63 @@ function Z(a, p, d) {
   } else p < O && (a = a.slice(0, p) + "." + a.slice(p));
   return a;
 }
-var X = Ee();
-const Oe = X.ROUND_DOWN, de = X.ROUND_UP, De = X;
+var X = Oe();
+const de = X.ROUND_DOWN, Ae = X.ROUND_UP, Me = X;
 function x(a) {
-  if (xe(a))
+  if (Se(a))
     return X(~~a);
   if (!a)
     return X(0);
-  if (Se(a))
+  if (Be(a))
     return a.isNaN() ? X(0) : a;
   const p = X(a);
   return p.isNaN() ? X(0) : p;
 }
-function xe(a) {
+function Se(a) {
   return typeof a == "boolean";
 }
-function Se(a) {
+function Be(a) {
   return X.isBigNumber(a);
 }
-function Ie(a) {
-  return typeof a == "number" && !Be(a);
+function ve(a) {
+  return typeof a == "number" && !Te(a);
 }
-function Be(a) {
+function Te(a) {
   return a == null || a == null ? !1 : X(a).isNaN();
 }
-function Pe(a) {
+function Ue(a) {
   return a == null || a == null ? !1 : X(a).isInteger();
 }
-function Ae(a, p) {
+function Ne(a, p) {
   return x(a).isGreaterThan(x(p));
 }
-function Le(a, p) {
+function Re(a, p) {
   return x(a).isLessThan(x(p));
 }
-function Me(a, p) {
+function De(a, p) {
   return x(a).isEqualTo(x(p));
 }
-function ve(a, p) {
+function Ie(a, p) {
   return x(a).isGreaterThanOrEqualTo(x(p));
 }
-function Ue(a, p) {
+function Pe(a, p) {
   return x(a).isLessThanOrEqualTo(x(p));
 }
-function Re(a) {
+function Le(a) {
   return x(a);
 }
 function re(a) {
   return x(a).toNumber();
 }
 function Ce(a, p = !1) {
-  return re(x(a).integerValue(p ? de : Oe));
+  return re(x(a).integerValue(p ? Ae : de));
 }
 function Ge(a) {
   return x(a).toString();
 }
-function Te(a, p, d = !1) {
+function _e(a, p, d = !1) {
   const O = x(a);
-  return re(p !== void 0 ? O.decimalPlaces(p, d ? de : Oe) : O);
+  return re(p !== void 0 ? O.decimalPlaces(p, d ? Ae : de) : O);
 }
 function ke(a) {
   return x(a).toFormat();
@@ -697,7 +697,7 @@ function ye(...a) {
 function $e(...a) {
   if (a.length === 0)
     return 0;
-  const p = a.map((O) => Re(O));
+  const p = a.map((O) => Le(O));
   return p.some((O) => O.isZero()) ? 0 : p.reduce((O, w) => O.dividedBy(w)).toNumber();
 }
 function ze(a, p) {
@@ -705,35 +705,42 @@ function ze(a, p) {
 }
 function He(a, p = "%") {
   const d = x(a).times(100);
-  return `${Ae(d, 0) ? Te(d, 2) : 0}${p}`;
+  return `${Ne(d, 0) ? _e(d, 2) : 0}${p}`;
 }
 function Ve(a) {
   const p = x(a).div(100);
-  return Ae(p, 0) ? Te(p, 4) : 0;
+  return Ne(p, 0) ? _e(p, 4) : 0;
 }
+const Xe = Ne, We = Ie, Ye = Re, Ze = Pe, Je = De, Qe = Te;
 export {
-  De as BigNumber,
-  Oe as DOWN,
-  de as UP,
+  Me as BigNumber,
+  de as DOWN,
+  Ae as UP,
   qe as add,
   $e as divide,
+  Je as eq,
   He as formatRate,
+  Xe as gt,
+  We as gte,
   x as helper,
-  Se as isBigNum,
-  xe as isBool,
-  Me as isEqualTo,
-  Ae as isGreaterThan,
-  ve as isGreaterThanOrEqualTo,
-  Pe as isInt,
-  Le as isLessThan,
-  Ue as isLessThanOrEqualTo,
-  Be as isNanValue,
-  Ie as isNum,
+  Be as isBigNum,
+  Se as isBool,
+  De as isEqualTo,
+  Ne as isGreaterThan,
+  Ie as isGreaterThanOrEqualTo,
+  Ue 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,
   Fe as subtract,
-  Re as toBigNum,
-  Te as toDecimalPlaces,
+  Le as toBigNum,
+  _e as toDecimalPlaces,
   Ce as toInt,
   ke as toLocaleString,
   re as toNum,