zsysview 0.0.25 → 0.0.26

package/dist/http_api_v1-BQLGtV9G.js

@@ -0,0 +1,1008 @@
+import Te from "axios";
+import { a as De } from "./index-DXGp4B8l.js";
+function Me(y) {
+  return y && y.__esModule && Object.prototype.hasOwnProperty.call(y, "default") ? y.default : y;
+}
+var pe = { exports: {} }, Oe = { exports: {} }, _e = { exports: {} }, Ce = _e.exports, Se;
+function qe() {
+  return Se || (Se = 1, (function(y) {
+    (function($) {
+      var V, re = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, O = Math.ceil, B = Math.floor, q = "[BigNumber Error] ", _ = q + "Number primitive has more than 15 significant digits: ", W = 1e14, d = 14, C = 9007199254740991, v = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], I = 1e7, P = 1e9;
+      function z(A) {
+        var m, D, M, h = p.prototype = { constructor: p, toString: null, valueOf: null }, b = new p(1), F = 20, U = 4, Z = -7, K = 21, ue = -1e7, ie = 1e7, le = !1, ae = 1, oe = 0, de = {
+          prefix: "",
+          groupSize: 3,
+          secondaryGroupSize: 0,
+          groupSeparator: ",",
+          decimalSeparator: ".",
+          fractionGroupSize: 0,
+          fractionGroupSeparator: " ",
+          // non-breaking space
+          suffix: ""
+        }, fe = "0123456789abcdefghijklmnopqrstuvwxyz", we = !0;
+        function p(e, t) {
+          var r, l, n, o, a, i, s, f, u = this;
+          if (!(u instanceof p)) return new p(e, t);
+          if (t == null) {
+            if (e && e._isBigNumber === !0) {
+              u.s = e.s, !e.c || e.e > ie ? u.c = u.e = null : e.e < ue ? u.c = [u.e = 0] : (u.e = e.e, u.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, a = e; a >= 10; a /= 10, o++) ;
+                o > ie ? u.c = u.e = null : (u.e = o, u.c = [e]);
+                return;
+              }
+              f = String(e);
+            } else {
+              if (!re.test(f = String(e))) return M(u, f, i);
+              u.s = f.charCodeAt(0) == 45 ? (f = f.slice(1), -1) : 1;
+            }
+            (o = f.indexOf(".")) > -1 && (f = f.replace(".", "")), (a = f.search(/e/i)) > 0 ? (o < 0 && (o = a), o += +f.slice(a + 1), f = f.substring(0, a)) : o < 0 && (o = f.length);
+          } else {
+            if (N(t, 2, fe.length, "Base"), t == 10 && we)
+              return u = new p(e), ee(u, F + u.e + 1, U);
+            if (f = String(e), i = typeof e == "number") {
+              if (e * 0 != 0) return M(u, f, i, t);
+              if (u.s = 1 / e < 0 ? (f = f.slice(1), -1) : 1, p.DEBUG && f.replace(/^0\.0*|\./, "").length > 15)
+                throw Error(_ + e);
+            } else
+              u.s = f.charCodeAt(0) === 45 ? (f = f.slice(1), -1) : 1;
+            for (r = fe.slice(0, t), o = a = 0, s = f.length; a < s; a++)
+              if (r.indexOf(l = f.charAt(a)) < 0) {
+                if (l == ".") {
+                  if (a > o) {
+                    o = s;
+                    continue;
+                  }
+                } else if (!n && (f == f.toUpperCase() && (f = f.toLowerCase()) || f == f.toLowerCase() && (f = f.toUpperCase()))) {
+                  n = !0, a = -1, o = 0;
+                  continue;
+                }
+                return M(u, String(e), i, t);
+              }
+            i = !1, f = D(f, t, 10, u.s), (o = f.indexOf(".")) > -1 ? f = f.replace(".", "") : o = f.length;
+          }
+          for (a = 0; f.charCodeAt(a) === 48; a++) ;
+          for (s = f.length; f.charCodeAt(--s) === 48; ) ;
+          if (f = f.slice(a, ++s)) {
+            if (s -= a, i && p.DEBUG && s > 15 && (e > C || e !== B(e)))
+              throw Error(_ + u.s * e);
+            if ((o = o - a - 1) > ie)
+              u.c = u.e = null;
+            else if (o < ue)
+              u.c = [u.e = 0];
+            else {
+              if (u.e = o, u.c = [], a = (o + 1) % d, o < 0 && (a += d), a < s) {
+                for (a && u.c.push(+f.slice(0, a)), s -= d; a < s; )
+                  u.c.push(+f.slice(a, a += d));
+                a = d - (f = f.slice(a)).length;
+              } else
+                a -= s;
+              for (; a--; f += "0") ;
+              u.c.push(+f);
+            }
+          } else
+            u.c = [u.e = 0];
+        }
+        p.clone = z, p.ROUND_UP = 0, p.ROUND_DOWN = 1, p.ROUND_CEIL = 2, p.ROUND_FLOOR = 3, p.ROUND_HALF_UP = 4, p.ROUND_HALF_DOWN = 5, p.ROUND_HALF_EVEN = 6, p.ROUND_HALF_CEIL = 7, p.ROUND_HALF_FLOOR = 8, p.EUCLID = 9, p.config = p.set = function(e) {
+          var t, r;
+          if (e != null)
+            if (typeof e == "object") {
+              if (e.hasOwnProperty(t = "DECIMAL_PLACES") && (r = e[t], N(r, 0, P, t), F = r), e.hasOwnProperty(t = "ROUNDING_MODE") && (r = e[t], N(r, 0, 8, t), U = r), e.hasOwnProperty(t = "EXPONENTIAL_AT") && (r = e[t], r && r.pop ? (N(r[0], -P, 0, t), N(r[1], 0, P, t), Z = r[0], K = r[1]) : (N(r, -P, P, t), Z = -(K = r < 0 ? -r : r))), e.hasOwnProperty(t = "RANGE"))
+                if (r = e[t], r && r.pop)
+                  N(r[0], -P, -1, t), N(r[1], 1, P, t), ue = r[0], ie = r[1];
+                else if (N(r, -P, P, t), r)
+                  ue = -(ie = r < 0 ? -r : r);
+                else
+                  throw Error(q + t + " cannot be zero: " + r);
+              if (e.hasOwnProperty(t = "CRYPTO"))
+                if (r = e[t], r === !!r)
+                  if (r)
+                    if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+                      le = r;
+                    else
+                      throw le = !r, Error(q + "crypto unavailable");
+                  else
+                    le = r;
+                else
+                  throw Error(q + t + " not true or false: " + r);
+              if (e.hasOwnProperty(t = "MODULO_MODE") && (r = e[t], N(r, 0, 9, t), ae = r), e.hasOwnProperty(t = "POW_PRECISION") && (r = e[t], N(r, 0, P, t), oe = r), e.hasOwnProperty(t = "FORMAT"))
+                if (r = e[t], typeof r == "object") de = r;
+                else throw Error(q + t + " not an object: " + r);
+              if (e.hasOwnProperty(t = "ALPHABET"))
+                if (r = e[t], typeof r == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(r))
+                  we = r.slice(0, 10) == "0123456789", fe = r;
+                else
+                  throw Error(q + t + " invalid: " + r);
+            } else
+              throw Error(q + "Object expected: " + e);
+          return {
+            DECIMAL_PLACES: F,
+            ROUNDING_MODE: U,
+            EXPONENTIAL_AT: [Z, K],
+            RANGE: [ue, ie],
+            CRYPTO: le,
+            MODULO_MODE: ae,
+            POW_PRECISION: oe,
+            FORMAT: de,
+            ALPHABET: fe
+          };
+        }, p.isBigNumber = function(e) {
+          if (!e || e._isBigNumber !== !0) return !1;
+          if (!p.DEBUG) return !0;
+          var t, r, l = e.c, n = e.e, o = e.s;
+          e: if ({}.toString.call(l) == "[object Array]") {
+            if ((o === 1 || o === -1) && n >= -P && n <= P && n === B(n)) {
+              if (l[0] === 0) {
+                if (n === 0 && l.length === 1) return !0;
+                break e;
+              }
+              if (t = (n + 1) % d, t < 1 && (t += d), String(l[0]).length == t) {
+                for (t = 0; t < l.length; t++)
+                  if (r = l[t], r < 0 || r >= W || r !== B(r)) break e;
+                if (r !== 0) return !0;
+              }
+            }
+          } else if (l === null && n === null && (o === null || o === 1 || o === -1))
+            return !0;
+          throw Error(q + "Invalid BigNumber: " + e);
+        }, p.maximum = p.max = function() {
+          return Be(arguments, -1);
+        }, p.minimum = p.min = function() {
+          return Be(arguments, 1);
+        }, p.random = (function() {
+          var e = 9007199254740992, t = Math.random() * e & 2097151 ? function() {
+            return B(Math.random() * e);
+          } : function() {
+            return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
+          };
+          return function(r) {
+            var l, n, o, a, i, s = 0, f = [], u = new p(b);
+            if (r == null ? r = F : N(r, 0, P), a = O(r / d), le)
+              if (crypto.getRandomValues) {
+                for (l = crypto.getRandomValues(new Uint32Array(a *= 2)); s < a; )
+                  i = l[s] * 131072 + (l[s + 1] >>> 11), i >= 9e15 ? (n = crypto.getRandomValues(new Uint32Array(2)), l[s] = n[0], l[s + 1] = n[1]) : (f.push(i % 1e14), s += 2);
+                s = a / 2;
+              } else if (crypto.randomBytes) {
+                for (l = crypto.randomBytes(a *= 7); s < a; )
+                  i = (l[s] & 31) * 281474976710656 + l[s + 1] * 1099511627776 + l[s + 2] * 4294967296 + l[s + 3] * 16777216 + (l[s + 4] << 16) + (l[s + 5] << 8) + l[s + 6], i >= 9e15 ? crypto.randomBytes(7).copy(l, s) : (f.push(i % 1e14), s += 7);
+                s = a / 7;
+              } else
+                throw le = !1, Error(q + "crypto unavailable");
+            if (!le)
+              for (; s < a; )
+                i = t(), i < 9e15 && (f[s++] = i % 1e14);
+            for (a = f[--s], r %= d, a && r && (i = v[d - r], f[s] = B(a / i) * i); f[s] === 0; f.pop(), s--) ;
+            if (s < 0)
+              f = [o = 0];
+            else {
+              for (o = -1; f[0] === 0; f.splice(0, 1), o -= d) ;
+              for (s = 1, i = f[0]; i >= 10; i /= 10, s++) ;
+              s < d && (o -= d - s);
+            }
+            return u.e = o, u.c = f, u;
+          };
+        })(), p.sum = function() {
+          for (var e = 1, t = arguments, r = new p(t[0]); e < t.length; ) r = r.plus(t[e++]);
+          return r;
+        }, D = /* @__PURE__ */ (function() {
+          var e = "0123456789";
+          function t(r, l, n, o) {
+            for (var a, i = [0], s, f = 0, u = r.length; f < u; ) {
+              for (s = i.length; s--; i[s] *= l) ;
+              for (i[0] += o.indexOf(r.charAt(f++)), a = 0; a < i.length; a++)
+                i[a] > n - 1 && (i[a + 1] == null && (i[a + 1] = 0), i[a + 1] += i[a] / n | 0, i[a] %= n);
+            }
+            return i.reverse();
+          }
+          return function(r, l, n, o, a) {
+            var i, s, f, u, c, g, w, k, j = r.indexOf("."), X = F, S = U;
+            for (j >= 0 && (u = oe, oe = 0, r = r.replace(".", ""), k = new p(l), g = k.pow(r.length - j), oe = u, k.c = t(
+              L(T(g.c), g.e, "0"),
+              10,
+              n,
+              e
+            ), k.e = k.c.length), w = t(r, l, n, a ? (i = fe, e) : (i = e, fe)), f = u = w.length; w[--u] == 0; w.pop()) ;
+            if (!w[0]) return i.charAt(0);
+            if (j < 0 ? --f : (g.c = w, g.e = f, g.s = o, g = m(g, k, X, S, n), w = g.c, c = g.r, f = g.e), s = f + X + 1, j = w[s], u = n / 2, c = c || s < 0 || w[s + 1] != null, c = S < 4 ? (j != null || c) && (S == 0 || S == (g.s < 0 ? 3 : 2)) : j > u || j == u && (S == 4 || c || S == 6 && w[s - 1] & 1 || S == (g.s < 0 ? 8 : 7)), s < 1 || !w[0])
+              r = c ? L(i.charAt(1), -X, i.charAt(0)) : i.charAt(0);
+            else {
+              if (w.length = s, c)
+                for (--n; ++w[--s] > n; )
+                  w[s] = 0, s || (++f, w = [1].concat(w));
+              for (u = w.length; !w[--u]; ) ;
+              for (j = 0, r = ""; j <= u; r += i.charAt(w[j++])) ;
+              r = L(r, f, i.charAt(0));
+            }
+            return r;
+          };
+        })(), m = /* @__PURE__ */ (function() {
+          function e(l, n, o) {
+            var a, i, s, f, u = 0, c = l.length, g = n % I, w = n / I | 0;
+            for (l = l.slice(); c--; )
+              s = l[c] % I, f = l[c] / I | 0, a = w * s + f * g, i = g * s + a % I * I + u, u = (i / o | 0) + (a / I | 0) + w * f, l[c] = i % o;
+            return u && (l = [u].concat(l)), l;
+          }
+          function t(l, n, o, a) {
+            var i, s;
+            if (o != a)
+              s = o > a ? 1 : -1;
+            else
+              for (i = s = 0; i < o; i++)
+                if (l[i] != n[i]) {
+                  s = l[i] > n[i] ? 1 : -1;
+                  break;
+                }
+            return s;
+          }
+          function r(l, n, o, a) {
+            for (var i = 0; o--; )
+              l[o] -= i, i = l[o] < n[o] ? 1 : 0, l[o] = i * a + l[o] - n[o];
+            for (; !l[0] && l.length > 1; l.splice(0, 1)) ;
+          }
+          return function(l, n, o, a, i) {
+            var s, f, u, c, g, w, k, j, X, S, R, Y, he, Ne, Ae, ne, ce, te = l.s == n.s ? 1 : -1, Q = l.c, G = n.c;
+            if (!Q || !Q[0] || !G || !G[0])
+              return new p(
+                // Return NaN if either NaN, or both Infinity or 0.
+                !l.s || !n.s || (Q ? G && Q[0] == G[0] : !G) ? NaN : (
+                  // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
+                  Q && Q[0] == 0 || !G ? te * 0 : te / 0
+                )
+              );
+            for (j = new p(te), X = j.c = [], f = l.e - n.e, te = o + f + 1, i || (i = W, f = J(l.e / d) - J(n.e / d), te = te / d | 0), u = 0; G[u] == (Q[u] || 0); u++) ;
+            if (G[u] > (Q[u] || 0) && f--, te < 0)
+              X.push(1), c = !0;
+            else {
+              for (Ne = Q.length, ne = G.length, u = 0, te += 2, g = B(i / (G[0] + 1)), g > 1 && (G = e(G, g, i), Q = e(Q, g, i), ne = G.length, Ne = Q.length), he = ne, S = Q.slice(0, ne), R = S.length; R < ne; S[R++] = 0) ;
+              ce = G.slice(), ce = [0].concat(ce), Ae = G[0], G[1] >= i / 2 && Ae++;
+              do {
+                if (g = 0, s = t(G, S, ne, R), s < 0) {
+                  if (Y = S[0], ne != R && (Y = Y * i + (S[1] || 0)), g = B(Y / Ae), g > 1)
+                    for (g >= i && (g = i - 1), w = e(G, g, i), k = w.length, R = S.length; t(w, S, k, R) == 1; )
+                      g--, r(w, ne < k ? ce : G, k, i), k = w.length, s = 1;
+                  else
+                    g == 0 && (s = g = 1), w = G.slice(), k = w.length;
+                  if (k < R && (w = [0].concat(w)), r(S, w, R, i), R = S.length, s == -1)
+                    for (; t(G, S, ne, R) < 1; )
+                      g++, r(S, ne < R ? ce : G, R, i), R = S.length;
+                } else s === 0 && (g++, S = [0]);
+                X[u++] = g, S[0] ? S[R++] = Q[he] || 0 : (S = [Q[he]], R = 1);
+              } while ((he++ < Ne || S[0] != null) && te--);
+              c = S[0] != null, X[0] || X.splice(0, 1);
+            }
+            if (i == W) {
+              for (u = 1, te = X[0]; te >= 10; te /= 10, u++) ;
+              ee(j, o + (j.e = u + f * d - 1) + 1, a, c);
+            } else
+              j.e = f, j.r = +c;
+            return j;
+          };
+        })();
+        function me(e, t, r, l) {
+          var n, o, a, i, s;
+          if (r == null ? r = U : N(r, 0, 8), !e.c) return e.toString();
+          if (n = e.c[0], a = e.e, t == null)
+            s = T(e.c), s = l == 1 || l == 2 && (a <= Z || a >= K) ? x(s, a) : L(s, a, "0");
+          else if (e = ee(new p(e), t, r), o = e.e, s = T(e.c), i = s.length, l == 1 || l == 2 && (t <= o || o <= Z)) {
+            for (; i < t; s += "0", i++) ;
+            s = x(s, o);
+          } else if (t -= a + (l === 2 && o > a), s = L(s, o, "0"), o + 1 > i) {
+            if (--t > 0) for (s += "."; t--; s += "0") ;
+          } else if (t += o - i, t > 0)
+            for (o + 1 == i && (s += "."); t--; s += "0") ;
+          return e.s < 0 && n ? "-" + s : s;
+        }
+        function Be(e, t) {
+          for (var r, l, n = 1, o = new p(e[0]); n < e.length; n++)
+            l = new p(e[n]), (!l.s || (r = H(o, l)) === t || r === 0 && o.s === t) && (o = l);
+          return o;
+        }
+        function ve(e, t, r) {
+          for (var l = 1, n = t.length; !t[--n]; t.pop()) ;
+          for (n = t[0]; n >= 10; n /= 10, l++) ;
+          return (r = l + r * d - 1) > ie ? e.c = e.e = null : r < ue ? e.c = [e.e = 0] : (e.e = r, e.c = t), e;
+        }
+        M = /* @__PURE__ */ (function() {
+          var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, t = /^([^.]+)\.$/, r = /^\.([^.]+)$/, l = /^-?(Infinity|NaN)$/, n = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+          return function(o, a, i, s) {
+            var f, u = i ? a : a.replace(n, "");
+            if (l.test(u))
+              o.s = isNaN(u) ? null : u < 0 ? -1 : 1;
+            else {
+              if (!i && (u = u.replace(e, function(c, g, w) {
+                return f = (w = w.toLowerCase()) == "x" ? 16 : w == "b" ? 2 : 8, !s || s == f ? g : c;
+              }), s && (f = s, u = u.replace(t, "$1").replace(r, "0.$1")), a != u))
+                return new p(u, f);
+              if (p.DEBUG)
+                throw Error(q + "Not a" + (s ? " base " + s : "") + " number: " + a);
+              o.s = null;
+            }
+            o.c = o.e = null;
+          };
+        })();
+        function ee(e, t, r, l) {
+          var n, o, a, i, s, f, u, c = e.c, g = v;
+          if (c) {
+            e: {
+              for (n = 1, i = c[0]; i >= 10; i /= 10, n++) ;
+              if (o = t - n, o < 0)
+                o += d, a = t, s = c[f = 0], u = B(s / g[n - a - 1] % 10);
+              else if (f = O((o + 1) / d), f >= c.length)
+                if (l) {
+                  for (; c.length <= f; c.push(0)) ;
+                  s = u = 0, n = 1, o %= d, a = o - d + 1;
+                } else
+                  break e;
+              else {
+                for (s = i = c[f], n = 1; i >= 10; i /= 10, n++) ;
+                o %= d, a = o - d + n, u = a < 0 ? 0 : B(s / g[n - a - 1] % 10);
+              }
+              if (l = l || t < 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.
+              c[f + 1] != null || (a < 0 ? s : s % g[n - a - 1]), l = r < 4 ? (u || l) && (r == 0 || r == (e.s < 0 ? 3 : 2)) : u > 5 || u == 5 && (r == 4 || l || r == 6 && // Check whether the digit to the left of the rounding digit is odd.
+              (o > 0 ? a > 0 ? s / g[n - a] : 0 : c[f - 1]) % 10 & 1 || r == (e.s < 0 ? 8 : 7)), t < 1 || !c[0])
+                return c.length = 0, l ? (t -= e.e + 1, c[0] = g[(d - t % d) % d], e.e = -t || 0) : c[0] = e.e = 0, e;
+              if (o == 0 ? (c.length = f, i = 1, f--) : (c.length = f + 1, i = g[d - o], c[f] = a > 0 ? B(s / g[n - a] % g[a]) * i : 0), l)
+                for (; ; )
+                  if (f == 0) {
+                    for (o = 1, a = c[0]; a >= 10; a /= 10, o++) ;
+                    for (a = c[0] += i, i = 1; a >= 10; a /= 10, i++) ;
+                    o != i && (e.e++, c[0] == W && (c[0] = 1));
+                    break;
+                  } else {
+                    if (c[f] += i, c[f] != W) break;
+                    c[f--] = 0, i = 1;
+                  }
+              for (o = c.length; c[--o] === 0; c.pop()) ;
+            }
+            e.e > ie ? e.c = e.e = null : e.e < ue && (e.c = [e.e = 0]);
+          }
+          return e;
+        }
+        function se(e) {
+          var t, r = e.e;
+          return r === null ? e.toString() : (t = T(e.c), t = r <= Z || r >= K ? x(t, r) : L(t, r, "0"), e.s < 0 ? "-" + t : t);
+        }
+        return h.absoluteValue = h.abs = function() {
+          var e = new p(this);
+          return e.s < 0 && (e.s = 1), e;
+        }, h.comparedTo = function(e, t) {
+          return H(this, new p(e, t));
+        }, h.decimalPlaces = h.dp = function(e, t) {
+          var r, l, n, o = this;
+          if (e != null)
+            return N(e, 0, P), t == null ? t = U : N(t, 0, 8), ee(new p(o), e + o.e + 1, t);
+          if (!(r = o.c)) return null;
+          if (l = ((n = r.length - 1) - J(this.e / d)) * d, n = r[n]) for (; n % 10 == 0; n /= 10, l--) ;
+          return l < 0 && (l = 0), l;
+        }, h.dividedBy = h.div = function(e, t) {
+          return m(this, new p(e, t), F, U);
+        }, h.dividedToIntegerBy = h.idiv = function(e, t) {
+          return m(this, new p(e, t), 0, 1);
+        }, h.exponentiatedBy = h.pow = function(e, t) {
+          var r, l, n, o, a, i, s, f, u, c = this;
+          if (e = new p(e), e.c && !e.isInteger())
+            throw Error(q + "Exponent not an integer: " + se(e));
+          if (t != null && (t = new p(t)), i = e.e > 14, !c.c || !c.c[0] || c.c[0] == 1 && !c.e && c.c.length == 1 || !e.c || !e.c[0])
+            return u = new p(Math.pow(+se(c), i ? e.s * (2 - E(e)) : +se(e))), t ? u.mod(t) : u;
+          if (s = e.s < 0, t) {
+            if (t.c ? !t.c[0] : !t.s) return new p(NaN);
+            l = !s && c.isInteger() && t.isInteger(), l && (c = c.mod(t));
+          } else {
+            if (e.e > 9 && (c.e > 0 || c.e < -1 || (c.e == 0 ? c.c[0] > 1 || i && c.c[1] >= 24e7 : c.c[0] < 8e13 || i && c.c[0] <= 9999975e7)))
+              return o = c.s < 0 && E(e) ? -0 : 0, c.e > -1 && (o = 1 / o), new p(s ? 1 / o : o);
+            oe && (o = O(oe / d + 2));
+          }
+          for (i ? (r = new p(0.5), s && (e.s = 1), f = E(e)) : (n = Math.abs(+se(e)), f = n % 2), u = new p(b); ; ) {
+            if (f) {
+              if (u = u.times(c), !u.c) break;
+              o ? u.c.length > o && (u.c.length = o) : l && (u = u.mod(t));
+            }
+            if (n) {
+              if (n = B(n / 2), n === 0) break;
+              f = n % 2;
+            } else if (e = e.times(r), ee(e, e.e + 1, 1), e.e > 14)
+              f = E(e);
+            else {
+              if (n = +se(e), n === 0) break;
+              f = n % 2;
+            }
+            c = c.times(c), o ? c.c && c.c.length > o && (c.c.length = o) : l && (c = c.mod(t));
+          }
+          return l ? u : (s && (u = b.div(u)), t ? u.mod(t) : o ? ee(u, oe, U, a) : u);
+        }, h.integerValue = function(e) {
+          var t = new p(this);
+          return e == null ? e = U : N(e, 0, 8), ee(t, t.e + 1, e);
+        }, h.isEqualTo = h.eq = function(e, t) {
+          return H(this, new p(e, t)) === 0;
+        }, h.isFinite = function() {
+          return !!this.c;
+        }, h.isGreaterThan = h.gt = function(e, t) {
+          return H(this, new p(e, t)) > 0;
+        }, h.isGreaterThanOrEqualTo = h.gte = function(e, t) {
+          return (t = H(this, new p(e, t))) === 1 || t === 0;
+        }, h.isInteger = function() {
+          return !!this.c && J(this.e / d) > this.c.length - 2;
+        }, h.isLessThan = h.lt = function(e, t) {
+          return H(this, new p(e, t)) < 0;
+        }, h.isLessThanOrEqualTo = h.lte = function(e, t) {
+          return (t = H(this, new p(e, t))) === -1 || t === 0;
+        }, h.isNaN = function() {
+          return !this.s;
+        }, h.isNegative = function() {
+          return this.s < 0;
+        }, h.isPositive = function() {
+          return this.s > 0;
+        }, h.isZero = function() {
+          return !!this.c && this.c[0] == 0;
+        }, h.minus = function(e, t) {
+          var r, l, n, o, a = this, i = a.s;
+          if (e = new p(e, t), t = e.s, !i || !t) return new p(NaN);
+          if (i != t)
+            return e.s = -t, a.plus(e);
+          var s = a.e / d, f = e.e / d, u = a.c, c = e.c;
+          if (!s || !f) {
+            if (!u || !c) return u ? (e.s = -t, e) : new p(c ? a : NaN);
+            if (!u[0] || !c[0])
+              return c[0] ? (e.s = -t, e) : new p(u[0] ? a : (
+                // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
+                U == 3 ? -0 : 0
+              ));
+          }
+          if (s = J(s), f = J(f), u = u.slice(), i = s - f) {
+            for ((o = i < 0) ? (i = -i, n = u) : (f = s, n = c), n.reverse(), t = i; t--; n.push(0)) ;
+            n.reverse();
+          } else
+            for (l = (o = (i = u.length) < (t = c.length)) ? i : t, i = t = 0; t < l; t++)
+              if (u[t] != c[t]) {
+                o = u[t] < c[t];
+                break;
+              }
+          if (o && (n = u, u = c, c = n, e.s = -e.s), t = (l = c.length) - (r = u.length), t > 0) for (; t--; u[r++] = 0) ;
+          for (t = W - 1; l > i; ) {
+            if (u[--l] < c[l]) {
+              for (r = l; r && !u[--r]; u[r] = t) ;
+              --u[r], u[l] += W;
+            }
+            u[l] -= c[l];
+          }
+          for (; u[0] == 0; u.splice(0, 1), --f) ;
+          return u[0] ? ve(e, u, f) : (e.s = U == 3 ? -1 : 1, e.c = [e.e = 0], e);
+        }, h.modulo = h.mod = function(e, t) {
+          var r, l, n = this;
+          return e = new p(e, t), !n.c || !e.s || e.c && !e.c[0] ? new p(NaN) : !e.c || n.c && !n.c[0] ? new p(n) : (ae == 9 ? (l = e.s, e.s = 1, r = m(n, e, 0, 3), e.s = l, r.s *= l) : r = m(n, e, 0, ae), e = n.minus(r.times(e)), !e.c[0] && ae == 1 && (e.s = n.s), e);
+        }, h.multipliedBy = h.times = function(e, t) {
+          var r, l, n, o, a, i, s, f, u, c, g, w, k, j, X, S = this, R = S.c, Y = (e = new p(e, t)).c;
+          if (!R || !Y || !R[0] || !Y[0])
+            return !S.s || !e.s || R && !R[0] && !Y || Y && !Y[0] && !R ? e.c = e.e = e.s = null : (e.s *= S.s, !R || !Y ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
+          for (l = J(S.e / d) + J(e.e / d), e.s *= S.s, s = R.length, c = Y.length, s < c && (k = R, R = Y, Y = k, n = s, s = c, c = n), n = s + c, k = []; n--; k.push(0)) ;
+          for (j = W, X = I, n = c; --n >= 0; ) {
+            for (r = 0, g = Y[n] % X, w = Y[n] / X | 0, a = s, o = n + a; o > n; )
+              f = R[--a] % X, u = R[a] / X | 0, i = w * f + u * g, f = g * f + i % X * X + k[o] + r, r = (f / j | 0) + (i / X | 0) + w * u, k[o--] = f % j;
+            k[o] = r;
+          }
+          return r ? ++l : k.splice(0, 1), ve(e, k, l);
+        }, h.negated = function() {
+          var e = new p(this);
+          return e.s = -e.s || null, e;
+        }, h.plus = function(e, t) {
+          var r, l = this, n = l.s;
+          if (e = new p(e, t), t = e.s, !n || !t) return new p(NaN);
+          if (n != t)
+            return e.s = -t, l.minus(e);
+          var o = l.e / d, a = e.e / d, i = l.c, s = e.c;
+          if (!o || !a) {
+            if (!i || !s) return new p(n / 0);
+            if (!i[0] || !s[0]) return s[0] ? e : new p(i[0] ? l : n * 0);
+          }
+          if (o = J(o), a = J(a), i = i.slice(), n = o - a) {
+            for (n > 0 ? (a = o, r = s) : (n = -n, r = i), r.reverse(); n--; r.push(0)) ;
+            r.reverse();
+          }
+          for (n = i.length, t = s.length, n - t < 0 && (r = s, s = i, i = r, t = n), n = 0; t; )
+            n = (i[--t] = i[t] + s[t] + n) / W | 0, i[t] = W === i[t] ? 0 : i[t] % W;
+          return n && (i = [n].concat(i), ++a), ve(e, i, a);
+        }, h.precision = h.sd = function(e, t) {
+          var r, l, n, o = this;
+          if (e != null && e !== !!e)
+            return N(e, 1, P), t == null ? t = U : N(t, 0, 8), ee(new p(o), e, t);
+          if (!(r = o.c)) return null;
+          if (n = r.length - 1, l = n * d + 1, n = r[n]) {
+            for (; n % 10 == 0; n /= 10, l--) ;
+            for (n = r[0]; n >= 10; n /= 10, l++) ;
+          }
+          return e && o.e + 1 > l && (l = o.e + 1), l;
+        }, h.shiftedBy = function(e) {
+          return N(e, -C, C), this.times("1e" + e);
+        }, h.squareRoot = h.sqrt = function() {
+          var e, t, r, l, n, o = this, a = o.c, i = o.s, s = o.e, f = F + 4, u = new p("0.5");
+          if (i !== 1 || !a || !a[0])
+            return new p(!i || i < 0 && (!a || a[0]) ? NaN : a ? o : 1 / 0);
+          if (i = Math.sqrt(+se(o)), i == 0 || i == 1 / 0 ? (t = T(a), (t.length + s) % 2 == 0 && (t += "0"), i = Math.sqrt(+t), s = J((s + 1) / 2) - (s < 0 || s % 2), i == 1 / 0 ? t = "5e" + s : (t = i.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + s), r = new p(t)) : r = new p(i + ""), r.c[0]) {
+            for (s = r.e, i = s + f, i < 3 && (i = 0); ; )
+              if (n = r, r = u.times(n.plus(m(o, n, f, 1))), T(n.c).slice(0, i) === (t = T(r.c)).slice(0, i))
+                if (r.e < s && --i, t = t.slice(i - 3, i + 1), t == "9999" || !l && t == "4999") {
+                  if (!l && (ee(n, n.e + F + 2, 0), n.times(n).eq(o))) {
+                    r = n;
+                    break;
+                  }
+                  f += 4, i += 4, l = 1;
+                } else {
+                  (!+t || !+t.slice(1) && t.charAt(0) == "5") && (ee(r, r.e + F + 2, 1), e = !r.times(r).eq(o));
+                  break;
+                }
+          }
+          return ee(r, r.e + F + 1, U, e);
+        }, h.toExponential = function(e, t) {
+          return e != null && (N(e, 0, P), e++), me(this, e, t, 1);
+        }, h.toFixed = function(e, t) {
+          return e != null && (N(e, 0, P), e = e + this.e + 1), me(this, e, t);
+        }, h.toFormat = function(e, t, r) {
+          var l, n = this;
+          if (r == null)
+            e != null && t && typeof t == "object" ? (r = t, t = null) : e && typeof e == "object" ? (r = e, e = t = null) : r = de;
+          else if (typeof r != "object")
+            throw Error(q + "Argument not an object: " + r);
+          if (l = n.toFixed(e, t), n.c) {
+            var o, a = l.split("."), i = +r.groupSize, s = +r.secondaryGroupSize, f = r.groupSeparator || "", u = a[0], c = a[1], g = n.s < 0, w = g ? u.slice(1) : u, k = w.length;
+            if (s && (o = i, i = s, s = o, k -= o), i > 0 && k > 0) {
+              for (o = k % i || i, u = w.substr(0, o); o < k; o += i) u += f + w.substr(o, i);
+              s > 0 && (u += f + w.slice(o)), g && (u = "-" + u);
+            }
+            l = c ? u + (r.decimalSeparator || "") + ((s = +r.fractionGroupSize) ? c.replace(
+              new RegExp("\\d{" + s + "}\\B", "g"),
+              "$&" + (r.fractionGroupSeparator || "")
+            ) : c) : u;
+          }
+          return (r.prefix || "") + l + (r.suffix || "");
+        }, h.toFraction = function(e) {
+          var t, r, l, n, o, a, i, s, f, u, c, g, w = this, k = w.c;
+          if (e != null && (i = new p(e), !i.isInteger() && (i.c || i.s !== 1) || i.lt(b)))
+            throw Error(q + "Argument " + (i.isInteger() ? "out of range: " : "not an integer: ") + se(i));
+          if (!k) return new p(w);
+          for (t = new p(b), f = r = new p(b), l = s = new p(b), g = T(k), o = t.e = g.length - w.e - 1, t.c[0] = v[(a = o % d) < 0 ? d + a : a], e = !e || i.comparedTo(t) > 0 ? o > 0 ? t : f : i, a = ie, ie = 1 / 0, i = new p(g), s.c[0] = 0; u = m(i, t, 0, 1), n = r.plus(u.times(l)), n.comparedTo(e) != 1; )
+            r = l, l = n, f = s.plus(u.times(n = f)), s = n, t = i.minus(u.times(n = t)), i = n;
+          return n = m(e.minus(r), l, 0, 1), s = s.plus(n.times(f)), r = r.plus(n.times(l)), s.s = f.s = w.s, o = o * 2, c = m(f, l, o, U).minus(w).abs().comparedTo(
+            m(s, r, o, U).minus(w).abs()
+          ) < 1 ? [f, l] : [s, r], ie = a, c;
+        }, h.toNumber = function() {
+          return +se(this);
+        }, h.toPrecision = function(e, t) {
+          return e != null && N(e, 1, P), me(this, e, t, 2);
+        }, h.toString = function(e) {
+          var t, r = this, l = r.s, n = r.e;
+          return n === null ? l ? (t = "Infinity", l < 0 && (t = "-" + t)) : t = "NaN" : (e == null ? t = n <= Z || n >= K ? x(T(r.c), n) : L(T(r.c), n, "0") : e === 10 && we ? (r = ee(new p(r), F + n + 1, U), t = L(T(r.c), r.e, "0")) : (N(e, 2, fe.length, "Base"), t = D(L(T(r.c), n, "0"), 10, e, l, !0)), l < 0 && r.c[0] && (t = "-" + t)), t;
+        }, h.valueOf = h.toJSON = function() {
+          return se(this);
+        }, h._isBigNumber = !0, A != null && p.set(A), p;
+      }
+      function J(A) {
+        var m = A | 0;
+        return A > 0 || A === m ? m : m - 1;
+      }
+      function T(A) {
+        for (var m, D, M = 1, h = A.length, b = A[0] + ""; M < h; ) {
+          for (m = A[M++] + "", D = d - m.length; D--; m = "0" + m) ;
+          b += m;
+        }
+        for (h = b.length; b.charCodeAt(--h) === 48; ) ;
+        return b.slice(0, h + 1 || 1);
+      }
+      function H(A, m) {
+        var D, M, h = A.c, b = m.c, F = A.s, U = m.s, Z = A.e, K = m.e;
+        if (!F || !U) return null;
+        if (D = h && !h[0], M = b && !b[0], D || M) return D ? M ? 0 : -U : F;
+        if (F != U) return F;
+        if (D = F < 0, M = Z == K, !h || !b) return M ? 0 : !h ^ D ? 1 : -1;
+        if (!M) return Z > K ^ D ? 1 : -1;
+        for (U = (Z = h.length) < (K = b.length) ? Z : K, F = 0; F < U; F++) if (h[F] != b[F]) return h[F] > b[F] ^ D ? 1 : -1;
+        return Z == K ? 0 : Z > K ^ D ? 1 : -1;
+      }
+      function N(A, m, D, M) {
+        if (A < m || A > D || A !== B(A))
+          throw Error(q + (M || "Argument") + (typeof A == "number" ? A < m || A > D ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(A));
+      }
+      function E(A) {
+        var m = A.c.length - 1;
+        return J(A.e / d) == m && A.c[m] % 2 != 0;
+      }
+      function x(A, m) {
+        return (A.length > 1 ? A.charAt(0) + "." + A.slice(1) : A) + (m < 0 ? "e" : "e+") + m;
+      }
+      function L(A, m, D) {
+        var M, h;
+        if (m < 0) {
+          for (h = D + "."; ++m; h += D) ;
+          A = h + A;
+        } else if (M = A.length, ++m > M) {
+          for (h = D, m -= M; --m; h += D) ;
+          A += h;
+        } else m < M && (A = A.slice(0, m) + "." + A.slice(m));
+        return A;
+      }
+      V = z(), V.default = V.BigNumber = V, y.exports ? y.exports = V : ($ || ($ = typeof self < "u" && self ? self : window), $.BigNumber = V);
+    })(Ce);
+  })(_e)), _e.exports;
+}
+var ke;
+function Fe() {
+  return ke || (ke = 1, (function(y) {
+    var $ = qe(), V = y.exports;
+    (function() {
+      var re = /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g, O, B, q = {
+        // table of character substitutions
+        "\b": "\\b",
+        "	": "\\t",
+        "\n": "\\n",
+        "\f": "\\f",
+        "\r": "\\r",
+        '"': '\\"',
+        "\\": "\\\\"
+      }, _;
+      function W(C) {
+        return re.lastIndex = 0, re.test(C) ? '"' + C.replace(re, function(v) {
+          var I = q[v];
+          return typeof I == "string" ? I : "\\u" + ("0000" + v.charCodeAt(0).toString(16)).slice(-4);
+        }) + '"' : '"' + C + '"';
+      }
+      function d(C, v) {
+        var I, P, z, J, T = O, H, N = v[C], E = N != null && (N instanceof $ || $.isBigNumber(N));
+        switch (N && typeof N == "object" && typeof N.toJSON == "function" && (N = N.toJSON(C)), typeof _ == "function" && (N = _.call(v, C, N)), typeof N) {
+          case "string":
+            return E ? N : W(N);
+          case "number":
+            return isFinite(N) ? String(N) : "null";
+          case "boolean":
+          case "null":
+          case "bigint":
+            return String(N);
+          // If the type is 'object', we might be dealing with an object or an array or
+          // null.
+          case "object":
+            if (!N)
+              return "null";
+            if (O += B, H = [], Object.prototype.toString.apply(N) === "[object Array]") {
+              for (J = N.length, I = 0; I < J; I += 1)
+                H[I] = d(I, N) || "null";
+              return z = H.length === 0 ? "[]" : O ? `[
+` + O + H.join(`,
+` + O) + `
+` + T + "]" : "[" + H.join(",") + "]", O = T, z;
+            }
+            if (_ && typeof _ == "object")
+              for (J = _.length, I = 0; I < J; I += 1)
+                typeof _[I] == "string" && (P = _[I], z = d(P, N), z && H.push(W(P) + (O ? ": " : ":") + z));
+            else
+              Object.keys(N).forEach(function(x) {
+                var L = d(x, N);
+                L && H.push(W(x) + (O ? ": " : ":") + L);
+              });
+            return z = H.length === 0 ? "{}" : O ? `{
+` + O + H.join(`,
+` + O) + `
+` + T + "}" : "{" + H.join(",") + "}", O = T, z;
+        }
+      }
+      typeof V.stringify != "function" && (V.stringify = function(C, v, I) {
+        var P;
+        if (O = "", B = "", typeof I == "number")
+          for (P = 0; P < I; P += 1)
+            B += " ";
+        else typeof I == "string" && (B = I);
+        if (_ = v, v && typeof v != "function" && (typeof v != "object" || typeof v.length != "number"))
+          throw new Error("JSON.stringify");
+        return d("", { "": C });
+      });
+    })();
+  })(Oe)), Oe.exports;
+}
+var Ee, Ie;
+function be() {
+  if (Ie) return Ee;
+  Ie = 1;
+  var y = null;
+  const $ = /(?:_|\\u005[Ff])(?:_|\\u005[Ff])(?:p|\\u0070)(?:r|\\u0072)(?:o|\\u006[Ff])(?:t|\\u0074)(?:o|\\u006[Ff])(?:_|\\u005[Ff])(?:_|\\u005[Ff])/, V = /(?:c|\\u0063)(?:o|\\u006[Ff])(?:n|\\u006[Ee])(?:s|\\u0073)(?:t|\\u0074)(?:r|\\u0072)(?:u|\\u0075)(?:c|\\u0063)(?:t|\\u0074)(?:o|\\u006[Ff])(?:r|\\u0072)/;
+  var re = function(O) {
+    var B = {
+      strict: !1,
+      // not being strict means do not generate syntax errors for "duplicate key"
+      storeAsString: !1,
+      // toggles whether the values should be stored as BigNumber (default) or a string
+      alwaysParseAsBig: !1,
+      // toggles whether all numbers should be Big
+      useNativeBigInt: !1,
+      // toggles whether to use native BigInt instead of bignumber.js
+      protoAction: "error",
+      constructorAction: "error"
+    };
+    if (O != null) {
+      if (O.strict === !0 && (B.strict = !0), O.storeAsString === !0 && (B.storeAsString = !0), B.alwaysParseAsBig = O.alwaysParseAsBig === !0 ? O.alwaysParseAsBig : !1, B.useNativeBigInt = O.useNativeBigInt === !0 ? O.useNativeBigInt : !1, typeof O.constructorAction < "u")
+        if (O.constructorAction === "error" || O.constructorAction === "ignore" || O.constructorAction === "preserve")
+          B.constructorAction = O.constructorAction;
+        else
+          throw new Error(
+            `Incorrect value for constructorAction option, must be "error", "ignore" or undefined but passed ${O.constructorAction}`
+          );
+      if (typeof O.protoAction < "u")
+        if (O.protoAction === "error" || O.protoAction === "ignore" || O.protoAction === "preserve")
+          B.protoAction = O.protoAction;
+        else
+          throw new Error(
+            `Incorrect value for protoAction option, must be "error", "ignore" or undefined but passed ${O.protoAction}`
+          );
+    }
+    var q, _, W = {
+      '"': '"',
+      "\\": "\\",
+      "/": "/",
+      b: "\b",
+      f: "\f",
+      n: `
+`,
+      r: "\r",
+      t: "	"
+    }, d, C = function(E) {
+      throw {
+        name: "SyntaxError",
+        message: E,
+        at: q,
+        text: d
+      };
+    }, v = function(E) {
+      return E && E !== _ && C("Expected '" + E + "' instead of '" + _ + "'"), _ = d.charAt(q), q += 1, _;
+    }, I = function() {
+      var E, x = "";
+      for (_ === "-" && (x = "-", v("-")); _ >= "0" && _ <= "9"; )
+        x += _, v();
+      if (_ === ".")
+        for (x += "."; v() && _ >= "0" && _ <= "9"; )
+          x += _;
+      if (_ === "e" || _ === "E")
+        for (x += _, v(), (_ === "-" || _ === "+") && (x += _, v()); _ >= "0" && _ <= "9"; )
+          x += _, v();
+      if (E = +x, !isFinite(E))
+        C("Bad number");
+      else
+        return y == null && (y = qe()), x.length > 15 ? B.storeAsString ? x : B.useNativeBigInt ? BigInt(x) : new y(x) : B.alwaysParseAsBig ? B.useNativeBigInt ? BigInt(E) : new y(E) : E;
+    }, P = function() {
+      var E, x, L = "", A;
+      if (_ === '"')
+        for (var m = q; v(); ) {
+          if (_ === '"')
+            return q - 1 > m && (L += d.substring(m, q - 1)), v(), L;
+          if (_ === "\\") {
+            if (q - 1 > m && (L += d.substring(m, q - 1)), v(), _ === "u") {
+              for (A = 0, x = 0; x < 4 && (E = parseInt(v(), 16), !!isFinite(E)); x += 1)
+                A = A * 16 + E;
+              L += String.fromCharCode(A);
+            } else if (typeof W[_] == "string")
+              L += W[_];
+            else
+              break;
+            m = q;
+          }
+        }
+      C("Bad string");
+    }, z = function() {
+      for (; _ && _ <= " "; )
+        v();
+    }, J = function() {
+      switch (_) {
+        case "t":
+          return v("t"), v("r"), v("u"), v("e"), !0;
+        case "f":
+          return v("f"), v("a"), v("l"), v("s"), v("e"), !1;
+        case "n":
+          return v("n"), v("u"), v("l"), v("l"), null;
+      }
+      C("Unexpected '" + _ + "'");
+    }, T, H = function() {
+      var E = [];
+      if (_ === "[") {
+        if (v("["), z(), _ === "]")
+          return v("]"), E;
+        for (; _; ) {
+          if (E.push(T()), z(), _ === "]")
+            return v("]"), E;
+          v(","), z();
+        }
+      }
+      C("Bad array");
+    }, N = function() {
+      var E, x = /* @__PURE__ */ Object.create(null);
+      if (_ === "{") {
+        if (v("{"), z(), _ === "}")
+          return v("}"), x;
+        for (; _; ) {
+          if (E = P(), z(), v(":"), B.strict === !0 && Object.hasOwnProperty.call(x, E) && C('Duplicate key "' + E + '"'), $.test(E) === !0 ? B.protoAction === "error" ? C("Object contains forbidden prototype property") : B.protoAction === "ignore" ? T() : x[E] = T() : V.test(E) === !0 ? B.constructorAction === "error" ? C("Object contains forbidden constructor property") : B.constructorAction === "ignore" ? T() : x[E] = T() : x[E] = T(), z(), _ === "}")
+            return v("}"), x;
+          v(","), z();
+        }
+      }
+      C("Bad object");
+    };
+    return T = function() {
+      switch (z(), _) {
+        case "{":
+          return N();
+        case "[":
+          return H();
+        case '"':
+          return P();
+        case "-":
+          return I();
+        default:
+          return _ >= "0" && _ <= "9" ? I() : J();
+      }
+    }, function(E, x) {
+      var L;
+      return d = E + "", q = 0, _ = " ", L = T(), z(), _ && C("Syntax error"), typeof x == "function" ? (function A(m, D) {
+        var M, h = m[D];
+        return h && typeof h == "object" && Object.keys(h).forEach(function(b) {
+          M = A(h, b), M !== void 0 ? h[b] = M : delete h[b];
+        }), x.call(m, D, h);
+      })({ "": L }, "") : L;
+    };
+  };
+  return Ee = re, Ee;
+}
+var Pe;
+function Le() {
+  if (Pe) return pe.exports;
+  Pe = 1;
+  var y = Fe().stringify, $ = be();
+  return pe.exports = function(V) {
+    return {
+      parse: $(V),
+      stringify: y
+    };
+  }, pe.exports.parse = $(), pe.exports.stringify = y, pe.exports;
+}
+var Ue = Le();
+const Re = /* @__PURE__ */ Me(Ue), ge = De();
+let xe = Te.create({
+  transformResponse: [(y) => {
+    try {
+      return Re.parse(y);
+    } catch ($) {
+      throw console.error("JSON parse error:", $), $;
+    }
+  }],
+  transformRequest: [(y) => Re.stringify(y)]
+  // transformRequest: [(data) => {
+  //       return JSON.stringify(data, (_, value) => {
+  //           if (typeof value === 'bigint') {
+  //               return value.toString(); // 自动转换 BigInt
+  //           }
+  //           return value;
+  //       });
+  //   }],
+});
+xe.interceptors.request.use((y) => (console.log(ge.token.value), y.headers.authorization = "Bearer " + ge.token.value, y));
+xe.interceptors.response.use((y) => (y.data.error_code == 100 && ge.saveToken("none"), typeof y.headers.authorization < "u" && ge.saveToken(y.headers.authorization), y), (y) => Promise.reject(y));
+class ye {
+  error_code;
+  message;
+  data;
+  constructor() {
+    this.error_code = 1, this.message = "未知错误", this.data = {};
+  }
+  get IsSuccess() {
+    return this.error_code == 0;
+  }
+  static fromObject($) {
+    const V = new ye();
+    return Object.assign(V, $), V;
+  }
+}
+const je = `${window.location.protocol}//${window.location.host}/`;
+class ze {
+  //系统基础接口
+  static api_host = je;
+  //'http://localhost:1788/' //1788
+  //当前用户
+  static url_login = "api/login";
+  static url_usercenter = "api/user_center";
+  static url_change_password = "api/change_password";
+  static url_user_permission = "api/user_permission";
+  //用户管理
+  static url_user_save = "api/user_save";
+  static url_user_list = "api/user_list";
+  static url_user_export = "api/user_export";
+  static url_user_del = "api/user_del";
+  static url_user_detail = "api/user_detail";
+  static url_user_change_pwd = "api/user_change_pwd";
+  //组织架构
+  static url_department_save = "api/department_save";
+  static url_department_list = "api/department_list";
+  static url_department_del = "api/department_del";
+  static url_department_detail = "api/department_detail";
+  //职务
+  static url_position_list = "api/position_list";
+  static url_position_detail = "api/position_detail";
+  static url_position_save = "api/position_save";
+  static url_position_del = "api/position_del";
+  //系统日志
+  static url_syslog_list = "api/syslog_list";
+  static url_syslog_config_detail = "api/syslog_config_detail";
+  static url_syslog_config_save = "api/syslog_config_save";
+  //备份
+  static url_backup_start = "api/backup_start";
+  static url_backup_list = "api/backup_list";
+  static url_backup_del = "api/backup_del";
+  static url_backup_config_get = "api/backup_config_get";
+  static url_backup_config_save = "api/backup_config_save";
+  //权限
+  static url_syspermission_list = "api/permission_list";
+  static url_sysrole_list = "api/role_list";
+  static url_sysrole_del = "api/role_del";
+  static url_sysrole_save = "api/role_save";
+  static url_sysrole_detail = "api/role_detail";
+  //导出
+  static url_export_detail = "api/export_detail";
+  static url_export_file = "api/export_file";
+  // 系统
+  static url_system_publish = "api/system_publish";
+  //应用级接口==========================
+  //桌面
+  static url_desktop = "api/desktop";
+  static url_desktop_config_detail = "api/desktop_config_detail";
+  static url_desktop_config_save = "api/desktop_config_save";
+  //数据看板
+  static url_chart_weekly = "api/chart_weekly";
+  static url_chart_all = "api/chart_all";
+  static url_chart_last = "api/chart_last";
+  //事件
+  static url_event_list = "api/event_list";
+  static url_event_detail = "api/event_detail";
+  static url_event_file = "api/event_file";
+  static url_event_dispose = "api/event_dispose";
+  //规则
+  static url_rule_list = "api/rule_list";
+  static url_rule_save = "api/rule_save";
+  static url_rule_del = "api/rule_del";
+  static url_rule_detail = "api/rule_detail";
+  //时间模板
+  static url_time_list = "api/time_list";
+  static url_time_save = "api/time_save";
+  static url_time_del = "api/time_del";
+  static url_time_detail = "api/time_detail";
+  //区域
+  static url_area_save = "api/area_save";
+  static url_area_list = "api/area_list";
+  static url_area_del = "api/area_del";
+  static url_area_detail = "api/area_detail";
+  //设备
+  static url_equipment_save = "api/equipment_save";
+  static url_equipment_list = "api/equipment_list";
+  static url_equipment_detail = "api/equipment_detail";
+  static url_equipment_del = "api/equipment_del";
+  //通道画面
+  static url_channel_save = "api/channel_save";
+  static url_channel_list = "api/channel_list";
+  static url_channel_detail = "api/channel_detail";
+  static url_channel_del = "api/channel_del";
+  static GetFullApiUrl($) {
+    return this.api_host + $;
+  }
+  static async Post($, V) {
+    try {
+      let re = await xe.post(this.api_host + $, V);
+      return ye.fromObject(re.data);
+    } catch (re) {
+      return console.log(re), Promise.reject("访问服务器失败");
+    }
+  }
+  //   http_axios.interceptors.response.use(res=>{
+  //     return res
+  // },err=>{
+  //     return Promise.reject(err)
+  // })
+}
+export {
+  ze as H
+};