xto-fronted 0.4.97 → 0.4.98

package/dist/user-Qd_jMBaH.js

@@ -0,0 +1,1150 @@
+import { ref as Pe } from "vue";
+import Je from "axios";
+import { Message as ue } from "@xto/feedback";
+const Ae = Pe(""), Oe = Pe(""), ye = Pe("");
+function vr(a) {
+  a.appId && (Ae.value = a.appId), a.clientId && (Oe.value = a.clientId), a.apiBaseUrl && (ye.value = a.apiBaseUrl);
+}
+function Ve() {
+  if (Ae.value)
+    return Ae.value;
+  try {
+    return "";
+  } catch {
+    return "";
+  }
+}
+function Nr() {
+  if (Oe.value)
+    return Oe.value;
+  try {
+    return "";
+  } catch {
+    return "";
+  }
+}
+function Ar() {
+  if (ye.value)
+    return ye.value;
+  try {
+    return "";
+  } catch {
+    return "";
+  }
+}
+const Or = {
+  appId: Ae,
+  clientId: Oe,
+  apiBaseUrl: ye
+}, we = "xto_", je = (a) => ({
+  get(g) {
+    const m = a.getItem(we + g);
+    if (!m) return null;
+    try {
+      return JSON.parse(m);
+    } catch {
+      return m;
+    }
+  },
+  set(g, m) {
+    if (m == null) {
+      a.removeItem(we + g);
+      return;
+    }
+    const w = typeof m == "string" ? m : JSON.stringify(m);
+    a.setItem(we + g, w);
+  },
+  remove(g) {
+    a.removeItem(we + g);
+  },
+  clear() {
+    Object.keys(a).forEach((m) => {
+      m.startsWith(we) && a.removeItem(m);
+    });
+  }
+}), Ee = je(window.localStorage), ve = je(window.sessionStorage), z = {
+  get: Ee.get,
+  set: Ee.set,
+  remove: Ee.remove,
+  clear: Ee.clear
+}, yr = {
+  get: ve.get,
+  set: ve.set,
+  remove: ve.remove,
+  clear: ve.clear
+}, Ue = "token", De = "token_type", Me = "refresh_token", Ce = "expires_time", Le = "refresh_time", Fe = "code", $e = () => z.get(Ue), Ye = (a) => {
+  z.set(Ue, a);
+}, We = () => z.get(De), Qe = (a) => {
+  z.set(De, a);
+}, xr = () => z.get(Me), Ze = (a) => {
+  z.set(Me, a);
+}, er = () => z.get(Ce), rr = (a) => {
+  z.set(Ce, a);
+}, _r = () => z.get(Le), tr = (a) => {
+  z.set(Le, a);
+}, Br = () => z.get(Fe), nr = (a) => {
+  z.set(Fe, a);
+}, Sr = (a) => {
+  Ye(a.access_token), Qe(a.token_type || "Bearer"), Ze(a.refresh_token), rr(a.expires_time), tr(a.refresh_time), a.code && nr(a.code);
+}, ke = () => {
+  z.remove(Ue), z.remove(De), z.remove(Me), z.remove(Ce), z.remove(Le), z.remove(Fe);
+}, ir = () => {
+  const a = er();
+  return a ? Date.now() > a : !0;
+}, Ir = () => !!$e() && !ir();
+var sr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function or(a) {
+  return a && a.__esModule && Object.prototype.hasOwnProperty.call(a, "default") ? a.default : a;
+}
+var xe = { exports: {} }, Ge = { exports: {} }, qe = { exports: {} };
+(function(a) {
+  (function(g) {
+    var m, w = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, D = Math.ceil, C = Math.floor, U = "[BigNumber Error] ", _ = U + "Number primitive has more than 15 significant digits: ", X = 1e14, A = 14, L = 9007199254740991, J = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], S = 1e7, R = 1e9;
+    function re(O) {
+      var x, F, q, d = p.prototype = { constructor: p, toString: null, valueOf: null }, H = new p(1), M = 20, j = 4, Z = -7, ee = 21, ae = -1e7, ie = 1e7, he = !1, ge = 1, ce = 0, _e = {
+        prefix: "",
+        groupSize: 3,
+        secondaryGroupSize: 0,
+        groupSeparator: ",",
+        decimalSeparator: ".",
+        fractionGroupSize: 0,
+        fractionGroupSeparator: " ",
+        // non-breaking space
+        suffix: ""
+      }, pe = "0123456789abcdefghijklmnopqrstuvwxyz", Be = !0;
+      function p(e, r) {
+        var t, u, i, o, l, n, s, c, f = this;
+        if (!(f instanceof p)) return new p(e, r);
+        if (r == null) {
+          if (e && e._isBigNumber === !0) {
+            f.s = e.s, !e.c || e.e > ie ? f.c = f.e = null : e.e < ae ? f.c = [f.e = 0] : (f.e = e.e, f.c = e.c.slice());
+            return;
+          }
+          if ((n = typeof e == "number") && e * 0 == 0) {
+            if (f.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
+              for (o = 0, l = e; l >= 10; l /= 10, o++) ;
+              o > ie ? f.c = f.e = null : (f.e = o, f.c = [e]);
+              return;
+            }
+            c = String(e);
+          } else {
+            if (!w.test(c = String(e))) return q(f, c, n);
+            f.s = c.charCodeAt(0) == 45 ? (c = c.slice(1), -1) : 1;
+          }
+          (o = c.indexOf(".")) > -1 && (c = c.replace(".", "")), (l = c.search(/e/i)) > 0 ? (o < 0 && (o = l), o += +c.slice(l + 1), c = c.substring(0, l)) : o < 0 && (o = c.length);
+        } else {
+          if (v(r, 2, pe.length, "Base"), r == 10 && Be)
+            return f = new p(e), te(f, M + f.e + 1, j);
+          if (c = String(e), n = typeof e == "number") {
+            if (e * 0 != 0) return q(f, c, n, r);
+            if (f.s = 1 / e < 0 ? (c = c.slice(1), -1) : 1, p.DEBUG && c.replace(/^0\.0*|\./, "").length > 15)
+              throw Error(_ + e);
+          } else
+            f.s = c.charCodeAt(0) === 45 ? (c = c.slice(1), -1) : 1;
+          for (t = pe.slice(0, r), o = l = 0, s = c.length; l < s; l++)
+            if (t.indexOf(u = c.charAt(l)) < 0) {
+              if (u == ".") {
+                if (l > o) {
+                  o = s;
+                  continue;
+                }
+              } else if (!i && (c == c.toUpperCase() && (c = c.toLowerCase()) || c == c.toLowerCase() && (c = c.toUpperCase()))) {
+                i = !0, l = -1, o = 0;
+                continue;
+              }
+              return q(f, String(e), n, r);
+            }
+          n = !1, c = F(c, r, 10, f.s), (o = c.indexOf(".")) > -1 ? c = c.replace(".", "") : o = c.length;
+        }
+        for (l = 0; c.charCodeAt(l) === 48; l++) ;
+        for (s = c.length; c.charCodeAt(--s) === 48; ) ;
+        if (c = c.slice(l, ++s)) {
+          if (s -= l, n && p.DEBUG && s > 15 && (e > L || e !== C(e)))
+            throw Error(_ + f.s * e);
+          if ((o = o - l - 1) > ie)
+            f.c = f.e = null;
+          else if (o < ae)
+            f.c = [f.e = 0];
+          else {
+            if (f.e = o, f.c = [], l = (o + 1) % A, o < 0 && (l += A), l < s) {
+              for (l && f.c.push(+c.slice(0, l)), s -= A; l < s; )
+                f.c.push(+c.slice(l, l += A));
+              l = A - (c = c.slice(l)).length;
+            } else
+              l -= s;
+            for (; l--; c += "0") ;
+            f.c.push(+c);
+          }
+        } else
+          f.c = [f.e = 0];
+      }
+      p.clone = re, 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 r, t;
+        if (e != null)
+          if (typeof e == "object") {
+            if (e.hasOwnProperty(r = "DECIMAL_PLACES") && (t = e[r], v(t, 0, R, r), M = t), e.hasOwnProperty(r = "ROUNDING_MODE") && (t = e[r], v(t, 0, 8, r), j = t), e.hasOwnProperty(r = "EXPONENTIAL_AT") && (t = e[r], t && t.pop ? (v(t[0], -R, 0, r), v(t[1], 0, R, r), Z = t[0], ee = t[1]) : (v(t, -R, R, r), Z = -(ee = t < 0 ? -t : t))), e.hasOwnProperty(r = "RANGE"))
+              if (t = e[r], t && t.pop)
+                v(t[0], -R, -1, r), v(t[1], 1, R, r), ae = t[0], ie = t[1];
+              else if (v(t, -R, R, r), t)
+                ae = -(ie = t < 0 ? -t : t);
+              else
+                throw Error(U + r + " cannot be zero: " + t);
+            if (e.hasOwnProperty(r = "CRYPTO"))
+              if (t = e[r], t === !!t)
+                if (t)
+                  if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
+                    he = t;
+                  else
+                    throw he = !t, Error(U + "crypto unavailable");
+                else
+                  he = t;
+              else
+                throw Error(U + r + " not true or false: " + t);
+            if (e.hasOwnProperty(r = "MODULO_MODE") && (t = e[r], v(t, 0, 9, r), ge = t), e.hasOwnProperty(r = "POW_PRECISION") && (t = e[r], v(t, 0, R, r), ce = t), e.hasOwnProperty(r = "FORMAT"))
+              if (t = e[r], typeof t == "object") _e = t;
+              else throw Error(U + r + " not an object: " + t);
+            if (e.hasOwnProperty(r = "ALPHABET"))
+              if (t = e[r], typeof t == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(t))
+                Be = t.slice(0, 10) == "0123456789", pe = t;
+              else
+                throw Error(U + r + " invalid: " + t);
+          } else
+            throw Error(U + "Object expected: " + e);
+        return {
+          DECIMAL_PLACES: M,
+          ROUNDING_MODE: j,
+          EXPONENTIAL_AT: [Z, ee],
+          RANGE: [ae, ie],
+          CRYPTO: he,
+          MODULO_MODE: ge,
+          POW_PRECISION: ce,
+          FORMAT: _e,
+          ALPHABET: pe
+        };
+      }, p.isBigNumber = function(e) {
+        if (!e || e._isBigNumber !== !0) return !1;
+        if (!p.DEBUG) return !0;
+        var r, t, u = e.c, i = e.e, o = e.s;
+        e: if ({}.toString.call(u) == "[object Array]") {
+          if ((o === 1 || o === -1) && i >= -R && i <= R && i === C(i)) {
+            if (u[0] === 0) {
+              if (i === 0 && u.length === 1) return !0;
+              break e;
+            }
+            if (r = (i + 1) % A, r < 1 && (r += A), String(u[0]).length == r) {
+              for (r = 0; r < u.length; r++)
+                if (t = u[r], t < 0 || t >= X || t !== C(t)) break e;
+              if (t !== 0) return !0;
+            }
+          }
+        } else if (u === null && i === null && (o === null || o === 1 || o === -1))
+          return !0;
+        throw Error(U + "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, r = Math.random() * e & 2097151 ? function() {
+          return C(Math.random() * e);
+        } : function() {
+          return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
+        };
+        return function(t) {
+          var u, i, o, l, n, s = 0, c = [], f = new p(H);
+          if (t == null ? t = M : v(t, 0, R), l = D(t / A), he)
+            if (crypto.getRandomValues) {
+              for (u = crypto.getRandomValues(new Uint32Array(l *= 2)); s < l; )
+                n = u[s] * 131072 + (u[s + 1] >>> 11), n >= 9e15 ? (i = crypto.getRandomValues(new Uint32Array(2)), u[s] = i[0], u[s + 1] = i[1]) : (c.push(n % 1e14), s += 2);
+              s = l / 2;
+            } else if (crypto.randomBytes) {
+              for (u = crypto.randomBytes(l *= 7); s < l; )
+                n = (u[s] & 31) * 281474976710656 + u[s + 1] * 1099511627776 + u[s + 2] * 4294967296 + u[s + 3] * 16777216 + (u[s + 4] << 16) + (u[s + 5] << 8) + u[s + 6], n >= 9e15 ? crypto.randomBytes(7).copy(u, s) : (c.push(n % 1e14), s += 7);
+              s = l / 7;
+            } else
+              throw he = !1, Error(U + "crypto unavailable");
+          if (!he)
+            for (; s < l; )
+              n = r(), n < 9e15 && (c[s++] = n % 1e14);
+          for (l = c[--s], t %= A, l && t && (n = J[A - t], c[s] = C(l / n) * n); c[s] === 0; c.pop(), s--) ;
+          if (s < 0)
+            c = [o = 0];
+          else {
+            for (o = -1; c[0] === 0; c.splice(0, 1), o -= A) ;
+            for (s = 1, n = c[0]; n >= 10; n /= 10, s++) ;
+            s < A && (o -= A - s);
+          }
+          return f.e = o, f.c = c, f;
+        };
+      }(), p.sum = function() {
+        for (var e = 1, r = arguments, t = new p(r[0]); e < r.length; ) t = t.plus(r[e++]);
+        return t;
+      }, F = /* @__PURE__ */ function() {
+        var e = "0123456789";
+        function r(t, u, i, o) {
+          for (var l, n = [0], s, c = 0, f = t.length; c < f; ) {
+            for (s = n.length; s--; n[s] *= u) ;
+            for (n[0] += o.indexOf(t.charAt(c++)), l = 0; l < n.length; l++)
+              n[l] > i - 1 && (n[l + 1] == null && (n[l + 1] = 0), n[l + 1] += n[l] / i | 0, n[l] %= i);
+          }
+          return n.reverse();
+        }
+        return function(t, u, i, o, l) {
+          var n, s, c, f, h, E, N, T, $ = t.indexOf("."), K = M, I = j;
+          for ($ >= 0 && (f = ce, ce = 0, t = t.replace(".", ""), T = new p(u), E = T.pow(t.length - $), ce = f, T.c = r(
+            V(B(E.c), E.e, "0"),
+            10,
+            i,
+            e
+          ), T.e = T.c.length), N = r(t, u, i, l ? (n = pe, e) : (n = e, pe)), c = f = N.length; N[--f] == 0; N.pop()) ;
+          if (!N[0]) return n.charAt(0);
+          if ($ < 0 ? --c : (E.c = N, E.e = c, E.s = o, E = x(E, T, K, I, i), N = E.c, h = E.r, c = E.e), s = c + K + 1, $ = N[s], f = i / 2, h = h || s < 0 || N[s + 1] != null, h = I < 4 ? ($ != null || h) && (I == 0 || I == (E.s < 0 ? 3 : 2)) : $ > f || $ == f && (I == 4 || h || I == 6 && N[s - 1] & 1 || I == (E.s < 0 ? 8 : 7)), s < 1 || !N[0])
+            t = h ? V(n.charAt(1), -K, n.charAt(0)) : n.charAt(0);
+          else {
+            if (N.length = s, h)
+              for (--i; ++N[--s] > i; )
+                N[s] = 0, s || (++c, N = [1].concat(N));
+            for (f = N.length; !N[--f]; ) ;
+            for ($ = 0, t = ""; $ <= f; t += n.charAt(N[$++])) ;
+            t = V(t, c, n.charAt(0));
+          }
+          return t;
+        };
+      }(), x = /* @__PURE__ */ function() {
+        function e(u, i, o) {
+          var l, n, s, c, f = 0, h = u.length, E = i % S, N = i / S | 0;
+          for (u = u.slice(); h--; )
+            s = u[h] % S, c = u[h] / S | 0, l = N * s + c * E, n = E * s + l % S * S + f, f = (n / o | 0) + (l / S | 0) + N * c, u[h] = n % o;
+          return f && (u = [f].concat(u)), u;
+        }
+        function r(u, i, o, l) {
+          var n, s;
+          if (o != l)
+            s = o > l ? 1 : -1;
+          else
+            for (n = s = 0; n < o; n++)
+              if (u[n] != i[n]) {
+                s = u[n] > i[n] ? 1 : -1;
+                break;
+              }
+          return s;
+        }
+        function t(u, i, o, l) {
+          for (var n = 0; o--; )
+            u[o] -= n, n = u[o] < i[o] ? 1 : 0, u[o] = n * l + u[o] - i[o];
+          for (; !u[0] && u.length > 1; u.splice(0, 1)) ;
+        }
+        return function(u, i, o, l, n) {
+          var s, c, f, h, E, N, T, $, K, I, P, Y, me, Te, Re, oe, de, ne = u.s == i.s ? 1 : -1, Q = u.c, G = i.c;
+          if (!Q || !Q[0] || !G || !G[0])
+            return new p(
+              // Return NaN if either NaN, or both Infinity or 0.
+              !u.s || !i.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 ? ne * 0 : ne / 0
+              )
+            );
+          for ($ = new p(ne), K = $.c = [], c = u.e - i.e, ne = o + c + 1, n || (n = X, c = y(u.e / A) - y(i.e / A), ne = ne / A | 0), f = 0; G[f] == (Q[f] || 0); f++) ;
+          if (G[f] > (Q[f] || 0) && c--, ne < 0)
+            K.push(1), h = !0;
+          else {
+            for (Te = Q.length, oe = G.length, f = 0, ne += 2, E = C(n / (G[0] + 1)), E > 1 && (G = e(G, E, n), Q = e(Q, E, n), oe = G.length, Te = Q.length), me = oe, I = Q.slice(0, oe), P = I.length; P < oe; I[P++] = 0) ;
+            de = G.slice(), de = [0].concat(de), Re = G[0], G[1] >= n / 2 && Re++;
+            do {
+              if (E = 0, s = r(G, I, oe, P), s < 0) {
+                if (Y = I[0], oe != P && (Y = Y * n + (I[1] || 0)), E = C(Y / Re), E > 1)
+                  for (E >= n && (E = n - 1), N = e(G, E, n), T = N.length, P = I.length; r(N, I, T, P) == 1; )
+                    E--, t(N, oe < T ? de : G, T, n), T = N.length, s = 1;
+                else
+                  E == 0 && (s = E = 1), N = G.slice(), T = N.length;
+                if (T < P && (N = [0].concat(N)), t(I, N, P, n), P = I.length, s == -1)
+                  for (; r(G, I, oe, P) < 1; )
+                    E++, t(I, oe < P ? de : G, P, n), P = I.length;
+              } else s === 0 && (E++, I = [0]);
+              K[f++] = E, I[0] ? I[P++] = Q[me] || 0 : (I = [Q[me]], P = 1);
+            } while ((me++ < Te || I[0] != null) && ne--);
+            h = I[0] != null, K[0] || K.splice(0, 1);
+          }
+          if (n == X) {
+            for (f = 1, ne = K[0]; ne >= 10; ne /= 10, f++) ;
+            te($, o + ($.e = f + c * A - 1) + 1, l, h);
+          } else
+            $.e = c, $.r = +h;
+          return $;
+        };
+      }();
+      function Se(e, r, t, u) {
+        var i, o, l, n, s;
+        if (t == null ? t = j : v(t, 0, 8), !e.c) return e.toString();
+        if (i = e.c[0], l = e.e, r == null)
+          s = B(e.c), s = u == 1 || u == 2 && (l <= Z || l >= ee) ? se(s, l) : V(s, l, "0");
+        else if (e = te(new p(e), r, t), o = e.e, s = B(e.c), n = s.length, u == 1 || u == 2 && (r <= o || o <= Z)) {
+          for (; n < r; s += "0", n++) ;
+          s = se(s, o);
+        } else if (r -= l + (u === 2 && o > l), s = V(s, o, "0"), o + 1 > n) {
+          if (--r > 0) for (s += "."; r--; s += "0") ;
+        } else if (r += o - n, r > 0)
+          for (o + 1 == n && (s += "."); r--; s += "0") ;
+        return e.s < 0 && i ? "-" + s : s;
+      }
+      function be(e, r) {
+        for (var t, u, i = 1, o = new p(e[0]); i < e.length; i++)
+          u = new p(e[i]), (!u.s || (t = k(o, u)) === r || t === 0 && o.s === r) && (o = u);
+        return o;
+      }
+      function Ie(e, r, t) {
+        for (var u = 1, i = r.length; !r[--i]; r.pop()) ;
+        for (i = r[0]; i >= 10; i /= 10, u++) ;
+        return (t = u + t * A - 1) > ie ? e.c = e.e = null : t < ae ? e.c = [e.e = 0] : (e.e = t, e.c = r), e;
+      }
+      q = /* @__PURE__ */ function() {
+        var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, r = /^([^.]+)\.$/, t = /^\.([^.]+)$/, u = /^-?(Infinity|NaN)$/, i = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
+        return function(o, l, n, s) {
+          var c, f = n ? l : l.replace(i, "");
+          if (u.test(f))
+            o.s = isNaN(f) ? null : f < 0 ? -1 : 1;
+          else {
+            if (!n && (f = f.replace(e, function(h, E, N) {
+              return c = (N = N.toLowerCase()) == "x" ? 16 : N == "b" ? 2 : 8, !s || s == c ? E : h;
+            }), s && (c = s, f = f.replace(r, "$1").replace(t, "0.$1")), l != f))
+              return new p(f, c);
+            if (p.DEBUG)
+              throw Error(U + "Not a" + (s ? " base " + s : "") + " number: " + l);
+            o.s = null;
+          }
+          o.c = o.e = null;
+        };
+      }();
+      function te(e, r, t, u) {
+        var i, o, l, n, s, c, f, h = e.c, E = J;
+        if (h) {
+          e: {
+            for (i = 1, n = h[0]; n >= 10; n /= 10, i++) ;
+            if (o = r - i, o < 0)
+              o += A, l = r, s = h[c = 0], f = C(s / E[i - l - 1] % 10);
+            else if (c = D((o + 1) / A), c >= h.length)
+              if (u) {
+                for (; h.length <= c; h.push(0)) ;
+                s = f = 0, i = 1, o %= A, l = o - A + 1;
+              } else
+                break e;
+            else {
+              for (s = n = h[c], i = 1; n >= 10; n /= 10, i++) ;
+              o %= A, l = o - A + i, f = l < 0 ? 0 : C(s / E[i - l - 1] % 10);
+            }
+            if (u = u || 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[c + 1] != null || (l < 0 ? s : s % E[i - l - 1]), u = t < 4 ? (f || u) && (t == 0 || t == (e.s < 0 ? 3 : 2)) : f > 5 || f == 5 && (t == 4 || u || t == 6 && // Check whether the digit to the left of the rounding digit is odd.
+            (o > 0 ? l > 0 ? s / E[i - l] : 0 : h[c - 1]) % 10 & 1 || t == (e.s < 0 ? 8 : 7)), r < 1 || !h[0])
+              return h.length = 0, u ? (r -= e.e + 1, h[0] = E[(A - r % A) % A], e.e = -r || 0) : h[0] = e.e = 0, e;
+            if (o == 0 ? (h.length = c, n = 1, c--) : (h.length = c + 1, n = E[A - o], h[c] = l > 0 ? C(s / E[i - l] % E[l]) * n : 0), u)
+              for (; ; )
+                if (c == 0) {
+                  for (o = 1, l = h[0]; l >= 10; l /= 10, o++) ;
+                  for (l = h[0] += n, n = 1; l >= 10; l /= 10, n++) ;
+                  o != n && (e.e++, h[0] == X && (h[0] = 1));
+                  break;
+                } else {
+                  if (h[c] += n, h[c] != X) break;
+                  h[c--] = 0, n = 1;
+                }
+            for (o = h.length; h[--o] === 0; h.pop()) ;
+          }
+          e.e > ie ? e.c = e.e = null : e.e < ae && (e.c = [e.e = 0]);
+        }
+        return e;
+      }
+      function fe(e) {
+        var r, t = e.e;
+        return t === null ? e.toString() : (r = B(e.c), r = t <= Z || t >= ee ? se(r, t) : V(r, t, "0"), e.s < 0 ? "-" + r : r);
+      }
+      return d.absoluteValue = d.abs = function() {
+        var e = new p(this);
+        return e.s < 0 && (e.s = 1), e;
+      }, d.comparedTo = function(e, r) {
+        return k(this, new p(e, r));
+      }, d.decimalPlaces = d.dp = function(e, r) {
+        var t, u, i, o = this;
+        if (e != null)
+          return v(e, 0, R), r == null ? r = j : v(r, 0, 8), te(new p(o), e + o.e + 1, r);
+        if (!(t = o.c)) return null;
+        if (u = ((i = t.length - 1) - y(this.e / A)) * A, i = t[i]) for (; i % 10 == 0; i /= 10, u--) ;
+        return u < 0 && (u = 0), u;
+      }, d.dividedBy = d.div = function(e, r) {
+        return x(this, new p(e, r), M, j);
+      }, d.dividedToIntegerBy = d.idiv = function(e, r) {
+        return x(this, new p(e, r), 0, 1);
+      }, d.exponentiatedBy = d.pow = function(e, r) {
+        var t, u, i, o, l, n, s, c, f, h = this;
+        if (e = new p(e), e.c && !e.isInteger())
+          throw Error(U + "Exponent not an integer: " + fe(e));
+        if (r != null && (r = new p(r)), n = e.e > 14, !h.c || !h.c[0] || h.c[0] == 1 && !h.e && h.c.length == 1 || !e.c || !e.c[0])
+          return f = new p(Math.pow(+fe(h), n ? e.s * (2 - W(e)) : +fe(e))), r ? f.mod(r) : f;
+        if (s = e.s < 0, r) {
+          if (r.c ? !r.c[0] : !r.s) return new p(NaN);
+          u = !s && h.isInteger() && r.isInteger(), u && (h = h.mod(r));
+        } else {
+          if (e.e > 9 && (h.e > 0 || h.e < -1 || (h.e == 0 ? h.c[0] > 1 || n && h.c[1] >= 24e7 : h.c[0] < 8e13 || n && h.c[0] <= 9999975e7)))
+            return o = h.s < 0 && W(e) ? -0 : 0, h.e > -1 && (o = 1 / o), new p(s ? 1 / o : o);
+          ce && (o = D(ce / A + 2));
+        }
+        for (n ? (t = new p(0.5), s && (e.s = 1), c = W(e)) : (i = Math.abs(+fe(e)), c = i % 2), f = new p(H); ; ) {
+          if (c) {
+            if (f = f.times(h), !f.c) break;
+            o ? f.c.length > o && (f.c.length = o) : u && (f = f.mod(r));
+          }
+          if (i) {
+            if (i = C(i / 2), i === 0) break;
+            c = i % 2;
+          } else if (e = e.times(t), te(e, e.e + 1, 1), e.e > 14)
+            c = W(e);
+          else {
+            if (i = +fe(e), i === 0) break;
+            c = i % 2;
+          }
+          h = h.times(h), o ? h.c && h.c.length > o && (h.c.length = o) : u && (h = h.mod(r));
+        }
+        return u ? f : (s && (f = H.div(f)), r ? f.mod(r) : o ? te(f, ce, j, l) : f);
+      }, d.integerValue = function(e) {
+        var r = new p(this);
+        return e == null ? e = j : v(e, 0, 8), te(r, r.e + 1, e);
+      }, d.isEqualTo = d.eq = function(e, r) {
+        return k(this, new p(e, r)) === 0;
+      }, d.isFinite = function() {
+        return !!this.c;
+      }, d.isGreaterThan = d.gt = function(e, r) {
+        return k(this, new p(e, r)) > 0;
+      }, d.isGreaterThanOrEqualTo = d.gte = function(e, r) {
+        return (r = k(this, new p(e, r))) === 1 || r === 0;
+      }, d.isInteger = function() {
+        return !!this.c && y(this.e / A) > this.c.length - 2;
+      }, d.isLessThan = d.lt = function(e, r) {
+        return k(this, new p(e, r)) < 0;
+      }, d.isLessThanOrEqualTo = d.lte = function(e, r) {
+        return (r = k(this, new p(e, r))) === -1 || r === 0;
+      }, d.isNaN = function() {
+        return !this.s;
+      }, d.isNegative = function() {
+        return this.s < 0;
+      }, d.isPositive = function() {
+        return this.s > 0;
+      }, d.isZero = function() {
+        return !!this.c && this.c[0] == 0;
+      }, d.minus = function(e, r) {
+        var t, u, i, o, l = this, n = l.s;
+        if (e = new p(e, r), r = e.s, !n || !r) return new p(NaN);
+        if (n != r)
+          return e.s = -r, l.plus(e);
+        var s = l.e / A, c = e.e / A, f = l.c, h = e.c;
+        if (!s || !c) {
+          if (!f || !h) return f ? (e.s = -r, e) : new p(h ? l : NaN);
+          if (!f[0] || !h[0])
+            return h[0] ? (e.s = -r, e) : new p(f[0] ? l : (
+              // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
+              j == 3 ? -0 : 0
+            ));
+        }
+        if (s = y(s), c = y(c), f = f.slice(), n = s - c) {
+          for ((o = n < 0) ? (n = -n, i = f) : (c = s, i = h), i.reverse(), r = n; r--; i.push(0)) ;
+          i.reverse();
+        } else
+          for (u = (o = (n = f.length) < (r = h.length)) ? n : r, n = r = 0; r < u; r++)
+            if (f[r] != h[r]) {
+              o = f[r] < h[r];
+              break;
+            }
+        if (o && (i = f, f = h, h = i, e.s = -e.s), r = (u = h.length) - (t = f.length), r > 0) for (; r--; f[t++] = 0) ;
+        for (r = X - 1; u > n; ) {
+          if (f[--u] < h[u]) {
+            for (t = u; t && !f[--t]; f[t] = r) ;
+            --f[t], f[u] += X;
+          }
+          f[u] -= h[u];
+        }
+        for (; f[0] == 0; f.splice(0, 1), --c) ;
+        return f[0] ? Ie(e, f, c) : (e.s = j == 3 ? -1 : 1, e.c = [e.e = 0], e);
+      }, d.modulo = d.mod = function(e, r) {
+        var t, u, i = this;
+        return e = new p(e, r), !i.c || !e.s || e.c && !e.c[0] ? new p(NaN) : !e.c || i.c && !i.c[0] ? new p(i) : (ge == 9 ? (u = e.s, e.s = 1, t = x(i, e, 0, 3), e.s = u, t.s *= u) : t = x(i, e, 0, ge), e = i.minus(t.times(e)), !e.c[0] && ge == 1 && (e.s = i.s), e);
+      }, d.multipliedBy = d.times = function(e, r) {
+        var t, u, i, o, l, n, s, c, f, h, E, N, T, $, K, I = this, P = I.c, Y = (e = new p(e, r)).c;
+        if (!P || !Y || !P[0] || !Y[0])
+          return !I.s || !e.s || P && !P[0] && !Y || Y && !Y[0] && !P ? e.c = e.e = e.s = null : (e.s *= I.s, !P || !Y ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
+        for (u = y(I.e / A) + y(e.e / A), e.s *= I.s, s = P.length, h = Y.length, s < h && (T = P, P = Y, Y = T, i = s, s = h, h = i), i = s + h, T = []; i--; T.push(0)) ;
+        for ($ = X, K = S, i = h; --i >= 0; ) {
+          for (t = 0, E = Y[i] % K, N = Y[i] / K | 0, l = s, o = i + l; o > i; )
+            c = P[--l] % K, f = P[l] / K | 0, n = N * c + f * E, c = E * c + n % K * K + T[o] + t, t = (c / $ | 0) + (n / K | 0) + N * f, T[o--] = c % $;
+          T[o] = t;
+        }
+        return t ? ++u : T.splice(0, 1), Ie(e, T, u);
+      }, d.negated = function() {
+        var e = new p(this);
+        return e.s = -e.s || null, e;
+      }, d.plus = function(e, r) {
+        var t, u = this, i = u.s;
+        if (e = new p(e, r), r = e.s, !i || !r) return new p(NaN);
+        if (i != r)
+          return e.s = -r, u.minus(e);
+        var o = u.e / A, l = e.e / A, n = u.c, s = e.c;
+        if (!o || !l) {
+          if (!n || !s) return new p(i / 0);
+          if (!n[0] || !s[0]) return s[0] ? e : new p(n[0] ? u : i * 0);
+        }
+        if (o = y(o), l = y(l), n = n.slice(), i = o - l) {
+          for (i > 0 ? (l = o, t = s) : (i = -i, t = n), t.reverse(); i--; t.push(0)) ;
+          t.reverse();
+        }
+        for (i = n.length, r = s.length, i - r < 0 && (t = s, s = n, n = t, r = i), i = 0; r; )
+          i = (n[--r] = n[r] + s[r] + i) / X | 0, n[r] = X === n[r] ? 0 : n[r] % X;
+        return i && (n = [i].concat(n), ++l), Ie(e, n, l);
+      }, d.precision = d.sd = function(e, r) {
+        var t, u, i, o = this;
+        if (e != null && e !== !!e)
+          return v(e, 1, R), r == null ? r = j : v(r, 0, 8), te(new p(o), e, r);
+        if (!(t = o.c)) return null;
+        if (i = t.length - 1, u = i * A + 1, i = t[i]) {
+          for (; i % 10 == 0; i /= 10, u--) ;
+          for (i = t[0]; i >= 10; i /= 10, u++) ;
+        }
+        return e && o.e + 1 > u && (u = o.e + 1), u;
+      }, d.shiftedBy = function(e) {
+        return v(e, -L, L), this.times("1e" + e);
+      }, d.squareRoot = d.sqrt = function() {
+        var e, r, t, u, i, o = this, l = o.c, n = o.s, s = o.e, c = M + 4, f = new p("0.5");
+        if (n !== 1 || !l || !l[0])
+          return new p(!n || n < 0 && (!l || l[0]) ? NaN : l ? o : 1 / 0);
+        if (n = Math.sqrt(+fe(o)), n == 0 || n == 1 / 0 ? (r = B(l), (r.length + s) % 2 == 0 && (r += "0"), n = Math.sqrt(+r), s = y((s + 1) / 2) - (s < 0 || s % 2), n == 1 / 0 ? r = "5e" + s : (r = n.toExponential(), r = r.slice(0, r.indexOf("e") + 1) + s), t = new p(r)) : t = new p(n + ""), t.c[0]) {
+          for (s = t.e, n = s + c, n < 3 && (n = 0); ; )
+            if (i = t, t = f.times(i.plus(x(o, i, c, 1))), B(i.c).slice(0, n) === (r = B(t.c)).slice(0, n))
+              if (t.e < s && --n, r = r.slice(n - 3, n + 1), r == "9999" || !u && r == "4999") {
+                if (!u && (te(i, i.e + M + 2, 0), i.times(i).eq(o))) {
+                  t = i;
+                  break;
+                }
+                c += 4, n += 4, u = 1;
+              } else {
+                (!+r || !+r.slice(1) && r.charAt(0) == "5") && (te(t, t.e + M + 2, 1), e = !t.times(t).eq(o));
+                break;
+              }
+        }
+        return te(t, t.e + M + 1, j, e);
+      }, d.toExponential = function(e, r) {
+        return e != null && (v(e, 0, R), e++), Se(this, e, r, 1);
+      }, d.toFixed = function(e, r) {
+        return e != null && (v(e, 0, R), e = e + this.e + 1), Se(this, e, r);
+      }, d.toFormat = function(e, r, t) {
+        var u, i = this;
+        if (t == null)
+          e != null && r && typeof r == "object" ? (t = r, r = null) : e && typeof e == "object" ? (t = e, e = r = null) : t = _e;
+        else if (typeof t != "object")
+          throw Error(U + "Argument not an object: " + t);
+        if (u = i.toFixed(e, r), i.c) {
+          var o, l = u.split("."), n = +t.groupSize, s = +t.secondaryGroupSize, c = t.groupSeparator || "", f = l[0], h = l[1], E = i.s < 0, N = E ? f.slice(1) : f, T = N.length;
+          if (s && (o = n, n = s, s = o, T -= o), n > 0 && T > 0) {
+            for (o = T % n || n, f = N.substr(0, o); o < T; o += n) f += c + N.substr(o, n);
+            s > 0 && (f += c + N.slice(o)), E && (f = "-" + f);
+          }
+          u = h ? f + (t.decimalSeparator || "") + ((s = +t.fractionGroupSize) ? h.replace(
+            new RegExp("\\d{" + s + "}\\B", "g"),
+            "$&" + (t.fractionGroupSeparator || "")
+          ) : h) : f;
+        }
+        return (t.prefix || "") + u + (t.suffix || "");
+      }, d.toFraction = function(e) {
+        var r, t, u, i, o, l, n, s, c, f, h, E, N = this, T = N.c;
+        if (e != null && (n = new p(e), !n.isInteger() && (n.c || n.s !== 1) || n.lt(H)))
+          throw Error(U + "Argument " + (n.isInteger() ? "out of range: " : "not an integer: ") + fe(n));
+        if (!T) return new p(N);
+        for (r = new p(H), c = t = new p(H), u = s = new p(H), E = B(T), o = r.e = E.length - N.e - 1, r.c[0] = J[(l = o % A) < 0 ? A + l : l], e = !e || n.comparedTo(r) > 0 ? o > 0 ? r : c : n, l = ie, ie = 1 / 0, n = new p(E), s.c[0] = 0; f = x(n, r, 0, 1), i = t.plus(f.times(u)), i.comparedTo(e) != 1; )
+          t = u, u = i, c = s.plus(f.times(i = c)), s = i, r = n.minus(f.times(i = r)), n = i;
+        return i = x(e.minus(t), u, 0, 1), s = s.plus(i.times(c)), t = t.plus(i.times(u)), s.s = c.s = N.s, o = o * 2, h = x(c, u, o, j).minus(N).abs().comparedTo(
+          x(s, t, o, j).minus(N).abs()
+        ) < 1 ? [c, u] : [s, t], ie = l, h;
+      }, d.toNumber = function() {
+        return +fe(this);
+      }, d.toPrecision = function(e, r) {
+        return e != null && v(e, 1, R), Se(this, e, r, 2);
+      }, d.toString = function(e) {
+        var r, t = this, u = t.s, i = t.e;
+        return i === null ? u ? (r = "Infinity", u < 0 && (r = "-" + r)) : r = "NaN" : (e == null ? r = i <= Z || i >= ee ? se(B(t.c), i) : V(B(t.c), i, "0") : e === 10 && Be ? (t = te(new p(t), M + i + 1, j), r = V(B(t.c), t.e, "0")) : (v(e, 2, pe.length, "Base"), r = F(V(B(t.c), i, "0"), 10, e, u, !0)), u < 0 && t.c[0] && (r = "-" + r)), r;
+      }, d.valueOf = d.toJSON = function() {
+        return fe(this);
+      }, d._isBigNumber = !0, O != null && p.set(O), p;
+    }
+    function y(O) {
+      var x = O | 0;
+      return O > 0 || O === x ? x : x - 1;
+    }
+    function B(O) {
+      for (var x, F, q = 1, d = O.length, H = O[0] + ""; q < d; ) {
+        for (x = O[q++] + "", F = A - x.length; F--; x = "0" + x) ;
+        H += x;
+      }
+      for (d = H.length; H.charCodeAt(--d) === 48; ) ;
+      return H.slice(0, d + 1 || 1);
+    }
+    function k(O, x) {
+      var F, q, d = O.c, H = x.c, M = O.s, j = x.s, Z = O.e, ee = x.e;
+      if (!M || !j) return null;
+      if (F = d && !d[0], q = H && !H[0], F || q) return F ? q ? 0 : -j : M;
+      if (M != j) return M;
+      if (F = M < 0, q = Z == ee, !d || !H) return q ? 0 : !d ^ F ? 1 : -1;
+      if (!q) return Z > ee ^ F ? 1 : -1;
+      for (j = (Z = d.length) < (ee = H.length) ? Z : ee, M = 0; M < j; M++) if (d[M] != H[M]) return d[M] > H[M] ^ F ? 1 : -1;
+      return Z == ee ? 0 : Z > ee ^ F ? 1 : -1;
+    }
+    function v(O, x, F, q) {
+      if (O < x || O > F || O !== C(O))
+        throw Error(U + (q || "Argument") + (typeof O == "number" ? O < x || O > F ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(O));
+    }
+    function W(O) {
+      var x = O.c.length - 1;
+      return y(O.e / A) == x && O.c[x] % 2 != 0;
+    }
+    function se(O, x) {
+      return (O.length > 1 ? O.charAt(0) + "." + O.slice(1) : O) + (x < 0 ? "e" : "e+") + x;
+    }
+    function V(O, x, F) {
+      var q, d;
+      if (x < 0) {
+        for (d = F + "."; ++x; d += F) ;
+        O = d + O;
+      } else if (q = O.length, ++x > q) {
+        for (d = F, x -= q; --x; d += F) ;
+        O += d;
+      } else x < q && (O = O.slice(0, x) + "." + O.slice(x));
+      return O;
+    }
+    m = re(), m.default = m.BigNumber = m, a.exports ? a.exports = m : (g || (g = typeof self < "u" && self ? self : window), g.BigNumber = m);
+  })(sr);
+})(qe);
+var He = qe.exports;
+(function(a) {
+  var g = He, m = a.exports;
+  (function() {
+    var w = /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g, D, C, U = {
+      // table of character substitutions
+      "\b": "\\b",
+      "	": "\\t",
+      "\n": "\\n",
+      "\f": "\\f",
+      "\r": "\\r",
+      '"': '\\"',
+      "\\": "\\\\"
+    }, _;
+    function X(L) {
+      return w.lastIndex = 0, w.test(L) ? '"' + L.replace(w, function(J) {
+        var S = U[J];
+        return typeof S == "string" ? S : "\\u" + ("0000" + J.charCodeAt(0).toString(16)).slice(-4);
+      }) + '"' : '"' + L + '"';
+    }
+    function A(L, J) {
+      var S, R, re, y, B = D, k, v = J[L], W = v != null && (v instanceof g || g.isBigNumber(v));
+      switch (v && typeof v == "object" && typeof v.toJSON == "function" && (v = v.toJSON(L)), typeof _ == "function" && (v = _.call(J, L, v)), typeof v) {
+        case "string":
+          return W ? v : X(v);
+        case "number":
+          return isFinite(v) ? String(v) : "null";
+        case "boolean":
+        case "null":
+        case "bigint":
+          return String(v);
+        case "object":
+          if (!v)
+            return "null";
+          if (D += C, k = [], Object.prototype.toString.apply(v) === "[object Array]") {
+            for (y = v.length, S = 0; S < y; S += 1)
+              k[S] = A(S, v) || "null";
+            return re = k.length === 0 ? "[]" : D ? `[
+` + D + k.join(`,
+` + D) + `
+` + B + "]" : "[" + k.join(",") + "]", D = B, re;
+          }
+          if (_ && typeof _ == "object")
+            for (y = _.length, S = 0; S < y; S += 1)
+              typeof _[S] == "string" && (R = _[S], re = A(R, v), re && k.push(X(R) + (D ? ": " : ":") + re));
+          else
+            Object.keys(v).forEach(function(se) {
+              var V = A(se, v);
+              V && k.push(X(se) + (D ? ": " : ":") + V);
+            });
+          return re = k.length === 0 ? "{}" : D ? `{
+` + D + k.join(`,
+` + D) + `
+` + B + "}" : "{" + k.join(",") + "}", D = B, re;
+      }
+    }
+    typeof m.stringify != "function" && (m.stringify = function(L, J, S) {
+      var R;
+      if (D = "", C = "", typeof S == "number")
+        for (R = 0; R < S; R += 1)
+          C += " ";
+      else typeof S == "string" && (C = S);
+      if (_ = J, J && typeof J != "function" && (typeof J != "object" || typeof J.length != "number"))
+        throw new Error("JSON.stringify");
+      return A("", { "": L });
+    });
+  })();
+})(Ge);
+var fr = Ge.exports, Ne = null;
+const ur = /(?:_|\\u005[Ff])(?:_|\\u005[Ff])(?:p|\\u0070)(?:r|\\u0072)(?:o|\\u006[Ff])(?:t|\\u0074)(?:o|\\u006[Ff])(?:_|\\u005[Ff])(?:_|\\u005[Ff])/, cr = /(?: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 lr = function(a) {
+  var g = {
+    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 (a != null) {
+    if (a.strict === !0 && (g.strict = !0), a.storeAsString === !0 && (g.storeAsString = !0), g.alwaysParseAsBig = a.alwaysParseAsBig === !0 ? a.alwaysParseAsBig : !1, g.useNativeBigInt = a.useNativeBigInt === !0 ? a.useNativeBigInt : !1, typeof a.constructorAction < "u")
+      if (a.constructorAction === "error" || a.constructorAction === "ignore" || a.constructorAction === "preserve")
+        g.constructorAction = a.constructorAction;
+      else
+        throw new Error(
+          `Incorrect value for constructorAction option, must be "error", "ignore" or undefined but passed ${a.constructorAction}`
+        );
+    if (typeof a.protoAction < "u")
+      if (a.protoAction === "error" || a.protoAction === "ignore" || a.protoAction === "preserve")
+        g.protoAction = a.protoAction;
+      else
+        throw new Error(
+          `Incorrect value for protoAction option, must be "error", "ignore" or undefined but passed ${a.protoAction}`
+        );
+  }
+  var m, w, D = {
+    '"': '"',
+    "\\": "\\",
+    "/": "/",
+    b: "\b",
+    f: "\f",
+    n: `
+`,
+    r: "\r",
+    t: "	"
+  }, C, U = function(y) {
+    throw {
+      name: "SyntaxError",
+      message: y,
+      at: m,
+      text: C
+    };
+  }, _ = function(y) {
+    return y && y !== w && U("Expected '" + y + "' instead of '" + w + "'"), w = C.charAt(m), m += 1, w;
+  }, X = function() {
+    var y, B = "";
+    for (w === "-" && (B = "-", _("-")); w >= "0" && w <= "9"; )
+      B += w, _();
+    if (w === ".")
+      for (B += "."; _() && w >= "0" && w <= "9"; )
+        B += w;
+    if (w === "e" || w === "E")
+      for (B += w, _(), (w === "-" || w === "+") && (B += w, _()); w >= "0" && w <= "9"; )
+        B += w, _();
+    if (y = +B, !isFinite(y))
+      U("Bad number");
+    else
+      return Ne == null && (Ne = He), B.length > 15 ? g.storeAsString ? B : g.useNativeBigInt ? BigInt(B) : new Ne(B) : g.alwaysParseAsBig ? g.useNativeBigInt ? BigInt(y) : new Ne(y) : y;
+  }, A = function() {
+    var y, B, k = "", v;
+    if (w === '"')
+      for (var W = m; _(); ) {
+        if (w === '"')
+          return m - 1 > W && (k += C.substring(W, m - 1)), _(), k;
+        if (w === "\\") {
+          if (m - 1 > W && (k += C.substring(W, m - 1)), _(), w === "u") {
+            for (v = 0, B = 0; B < 4 && (y = parseInt(_(), 16), !!isFinite(y)); B += 1)
+              v = v * 16 + y;
+            k += String.fromCharCode(v);
+          } else if (typeof D[w] == "string")
+            k += D[w];
+          else
+            break;
+          W = m;
+        }
+      }
+    U("Bad string");
+  }, L = function() {
+    for (; w && w <= " "; )
+      _();
+  }, J = function() {
+    switch (w) {
+      case "t":
+        return _("t"), _("r"), _("u"), _("e"), !0;
+      case "f":
+        return _("f"), _("a"), _("l"), _("s"), _("e"), !1;
+      case "n":
+        return _("n"), _("u"), _("l"), _("l"), null;
+    }
+    U("Unexpected '" + w + "'");
+  }, S, R = function() {
+    var y = [];
+    if (w === "[") {
+      if (_("["), L(), w === "]")
+        return _("]"), y;
+      for (; w; ) {
+        if (y.push(S()), L(), w === "]")
+          return _("]"), y;
+        _(","), L();
+      }
+    }
+    U("Bad array");
+  }, re = function() {
+    var y, B = /* @__PURE__ */ Object.create(null);
+    if (w === "{") {
+      if (_("{"), L(), w === "}")
+        return _("}"), B;
+      for (; w; ) {
+        if (y = A(), L(), _(":"), g.strict === !0 && Object.hasOwnProperty.call(B, y) && U('Duplicate key "' + y + '"'), ur.test(y) === !0 ? g.protoAction === "error" ? U("Object contains forbidden prototype property") : g.protoAction === "ignore" ? S() : B[y] = S() : cr.test(y) === !0 ? g.constructorAction === "error" ? U("Object contains forbidden constructor property") : g.constructorAction === "ignore" ? S() : B[y] = S() : B[y] = S(), L(), w === "}")
+          return _("}"), B;
+        _(","), L();
+      }
+    }
+    U("Bad object");
+  };
+  return S = function() {
+    switch (L(), w) {
+      case "{":
+        return re();
+      case "[":
+        return R();
+      case '"':
+        return A();
+      case "-":
+        return X();
+      default:
+        return w >= "0" && w <= "9" ? X() : J();
+    }
+  }, function(y, B) {
+    var k;
+    return C = y + "", m = 0, w = " ", k = S(), L(), w && U("Syntax error"), typeof B == "function" ? function v(W, se) {
+      var V, O = W[se];
+      return O && typeof O == "object" && Object.keys(O).forEach(function(x) {
+        V = v(O, x), V !== void 0 ? O[x] = V : delete O[x];
+      }), B.call(W, se, O);
+    }({ "": k }, "") : k;
+  };
+}, ar = lr, Ke = fr.stringify, Xe = ar;
+xe.exports = function(a) {
+  return {
+    parse: Xe(a),
+    stringify: Ke
+  };
+};
+xe.exports.parse = Xe();
+xe.exports.stringify = Ke;
+var hr = xe.exports;
+const pr = /* @__PURE__ */ or(hr), gr = pr({ storeAsString: !0 });
+let ze;
+function Tr(a) {
+  ze = a, le && (le.defaults.baseURL = a);
+}
+const dr = () => {
+  const a = Je.create({
+    timeout: 3e4,
+    headers: {
+      "Content-Type": "application/json"
+    },
+    // 使用 json-bigint 解析响应数据，避免大整数精度丢失
+    transformResponse: [
+      (g) => {
+        if (typeof g == "string")
+          try {
+            return gr.parse(g);
+          } catch {
+            return g;
+          }
+        return g;
+      }
+    ]
+  });
+  return a.interceptors.request.use(
+    (g) => {
+      const m = ze || void 0;
+      m && !g.baseURL && (g.baseURL = m);
+      const w = $e(), D = We() || "Bearer";
+      return w && (g.headers.Authorization = `${D} ${w}`), g;
+    },
+    (g) => Promise.reject(g)
+  ), a.interceptors.response.use(
+    (g) => {
+      const { data: m } = g;
+      return m.code === 200 || m.code === 0 ? m.data : m.code === 9121 ? (ue.error("登录已过期，请重新登录"), ke(), window.location.href = "/login", Promise.reject(new Error(m.message || "EXPIRED OR INVALID TOKEN"))) : (ue.error(m.message || "请求失败"), Promise.reject(new Error(m.message || "请求失败")));
+    },
+    (g) => {
+      var w;
+      const { response: m } = g;
+      if (m) {
+        const { data: D } = m;
+        if ((D == null ? void 0 : D.code) === 9121)
+          return ue.error("登录已过期，请重新登录"), ke(), window.location.href = "/login", Promise.reject(g);
+        switch (m.status) {
+          case 401:
+            ue.error("登录已过期，请重新登录"), ke(), window.location.href = "/login";
+            break;
+          case 403:
+            ue.error("没有权限访问");
+            break;
+          case 404:
+            ue.error("请求资源不存在");
+            break;
+          case 500:
+            ue.error("服务器错误");
+            break;
+          default:
+            ue.error(((w = m.data) == null ? void 0 : w.message) || "请求失败");
+        }
+      } else
+        ue.error("网络连接失败");
+      return Promise.reject(g);
+    }
+  ), a;
+}, le = dr(), b = {
+  get(a, g) {
+    return le.get(a, g);
+  },
+  post(a, g, m) {
+    return le.post(a, g, m);
+  },
+  put(a, g, m) {
+    return le.put(a, g, m);
+  },
+  patch(a, g, m) {
+    return le.patch(a, g, m);
+  },
+  delete(a, g) {
+    return le.delete(a, g);
+  },
+  // 文件下载 - 返回 Blob 对象
+  download(a, g) {
+    return le.get(a, { ...g, responseType: "blob" });
+  }
+};
+function Rr(a) {
+  return b.post("/user/v1.0/login/by-domain", a);
+}
+function kr() {
+  return b.put("/user/v1.0/user/logout");
+}
+function Pr() {
+  return b.get("/user/v1.0/user/get-me");
+}
+function Ur(a) {
+  return b.post("/user/v1.0/refresh", { refreshToken: a });
+}
+function Dr(a) {
+  return b.get("/role/list", { params: a });
+}
+function Mr(a) {
+  return b.get(`/role/${a}`);
+}
+function Cr(a) {
+  return b.post("/role", a);
+}
+function Lr(a, g) {
+  return b.put(`/role/${a}`, g);
+}
+function Fr(a) {
+  return b.delete(`/role/${a}`);
+}
+function br(a, g) {
+  return b.patch(`/role/${a}/status`, { status: g });
+}
+function jr() {
+  return b.get("/user/v1.0/menu/list");
+}
+function $r(a) {
+  const g = a || Ve();
+  return b.get(`/user/v1.0/menu/get-menu?appId=${g}`);
+}
+function Gr(a) {
+  return b.post("/menu", a);
+}
+function qr(a, g) {
+  return b.put(`/menu/${a}`, g);
+}
+function Hr(a) {
+  return b.delete(`/menu/${a}`);
+}
+function Kr(a) {
+  return b.get("/user/list", { params: a });
+}
+function Xr(a) {
+  return b.get(`/user/${a}`);
+}
+function zr(a) {
+  return b.post("/user", a);
+}
+function Jr(a, g) {
+  return b.put(`/user/${a}`, g);
+}
+function Vr(a) {
+  return b.delete(`/user/${a}`);
+}
+function Yr(a) {
+  return b.post("/user/batch-delete", { ids: a });
+}
+function Wr(a, g) {
+  return b.patch(`/user/${a}/status`, { status: g });
+}
+function Qr(a) {
+  return b.post(`/user/${a}/reset-password`);
+}
+export {
+  ke as A,
+  Sr as B,
+  Nr as C,
+  Ve as D,
+  vr as E,
+  Ar as F,
+  Or as G,
+  Br as H,
+  _r as I,
+  xr as J,
+  er as K,
+  We as L,
+  b as M,
+  ir as N,
+  Ee as O,
+  yr as P,
+  ve as Q,
+  Tr as R,
+  nr as S,
+  tr as T,
+  Ze as U,
+  Ye as V,
+  rr as W,
+  Qe as X,
+  Cr as a,
+  Yr as b,
+  Gr as c,
+  zr as d,
+  Hr as e,
+  Fr as f,
+  Vr as g,
+  jr as h,
+  $r as i,
+  Mr as j,
+  Dr as k,
+  Xr as l,
+  Pr as m,
+  Kr as n,
+  Rr as o,
+  kr as p,
+  Qr as q,
+  Ur as r,
+  Lr as s,
+  br as t,
+  qr as u,
+  Jr as v,
+  Wr as w,
+  z as x,
+  $e as y,
+  Ir as z
+};