@usync/oauth2 0.0.1 → 0.0.3

package/dist/index.js

@@ -1,963 +1,922 @@
-import { nanoid as ye } from "nanoid";
-const ve = 1, Y = 2, ne = 3;
-class D extends Error {
-  constructor(p, m) {
-    super(m || `OAuth2Error: code=${p}`), this.code = p;
-  }
-}
-var Re = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, pe = Math.ceil, V = Math.floor, B = "[BigNumber Error] ", Ue = B + "Number primitive has more than 15 significant digits: ", $ = 1e14, E = 14, de = 9007199254740991, we = [1, 10, 100, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13], J = 1e7, I = 1e9;
-function Ie(_) {
-  var p, m, w, h = d.prototype = { constructor: d, toString: null, valueOf: null }, g = new d(1), A = 20, N = 4, C = -7, M = 21, Q = -1e7, j = 1e7, K = !1, te = 1, Z = 0, ce = {
-    prefix: "",
-    groupSize: 3,
-    secondaryGroupSize: 0,
-    groupSeparator: ",",
-    decimalSeparator: ".",
-    fractionGroupSize: 0,
-    fractionGroupSeparator: " ",
-    // non-breaking space
-    suffix: ""
-  }, b = "0123456789abcdefghijklmnopqrstuvwxyz", fe = !0;
-  function d(e, t) {
-    var i, f, r, o, l, n, s, a, c = this;
-    if (!(c instanceof d)) return new d(e, t);
-    if (t == null) {
-      if (e && e._isBigNumber === !0) {
-        c.s = e.s, !e.c || e.e > j ? c.c = c.e = null : e.e < Q ? c.c = [c.e = 0] : (c.e = e.e, c.c = e.c.slice());
-        return;
-      }
-      if ((n = typeof e == "number") && e * 0 == 0) {
-        if (c.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
-          for (o = 0, l = e; l >= 10; l /= 10, o++) ;
-          o > j ? c.c = c.e = null : (c.e = o, c.c = [e]);
-          return;
-        }
-        a = String(e);
-      } else {
-        if (!Re.test(a = String(e))) return w(c, a, n);
-        c.s = a.charCodeAt(0) == 45 ? (a = a.slice(1), -1) : 1;
-      }
-      (o = a.indexOf(".")) > -1 && (a = a.replace(".", "")), (l = a.search(/e/i)) > 0 ? (o < 0 && (o = l), o += +a.slice(l + 1), a = a.substring(0, l)) : o < 0 && (o = a.length);
-    } else {
-      if (U(t, 2, b.length, "Base"), t == 10 && fe)
-        return c = new d(e), F(c, A + c.e + 1, N);
-      if (a = String(e), n = typeof e == "number") {
-        if (e * 0 != 0) return w(c, a, n, t);
-        if (c.s = 1 / e < 0 ? (a = a.slice(1), -1) : 1, d.DEBUG && a.replace(/^0\.0*|\./, "").length > 15)
-          throw Error(Ue + e);
-      } else
-        c.s = a.charCodeAt(0) === 45 ? (a = a.slice(1), -1) : 1;
-      for (i = b.slice(0, t), o = l = 0, s = a.length; l < s; l++)
-        if (i.indexOf(f = a.charAt(l)) < 0) {
-          if (f == ".") {
-            if (l > o) {
-              o = s;
-              continue;
-            }
-          } else if (!r && (a == a.toUpperCase() && (a = a.toLowerCase()) || a == a.toLowerCase() && (a = a.toUpperCase()))) {
-            r = !0, l = -1, o = 0;
-            continue;
-          }
-          return w(c, String(e), n, t);
-        }
-      n = !1, a = m(a, t, 10, c.s), (o = a.indexOf(".")) > -1 ? a = a.replace(".", "") : o = a.length;
-    }
-    for (l = 0; a.charCodeAt(l) === 48; l++) ;
-    for (s = a.length; a.charCodeAt(--s) === 48; ) ;
-    if (a = a.slice(l, ++s)) {
-      if (s -= l, n && d.DEBUG && s > 15 && (e > de || e !== V(e)))
-        throw Error(Ue + c.s * e);
-      if ((o = o - l - 1) > j)
-        c.c = c.e = null;
-      else if (o < Q)
-        c.c = [c.e = 0];
-      else {
-        if (c.e = o, c.c = [], l = (o + 1) % E, o < 0 && (l += E), l < s) {
-          for (l && c.c.push(+a.slice(0, l)), s -= E; l < s; )
-            c.c.push(+a.slice(l, l += E));
-          l = E - (a = a.slice(l)).length;
-        } else
-          l -= s;
-        for (; l--; a += "0") ;
-        c.c.push(+a);
-      }
-    } else
-      c.c = [c.e = 0];
-  }
-  d.clone = Ie, d.ROUND_UP = 0, d.ROUND_DOWN = 1, d.ROUND_CEIL = 2, d.ROUND_FLOOR = 3, d.ROUND_HALF_UP = 4, d.ROUND_HALF_DOWN = 5, d.ROUND_HALF_EVEN = 6, d.ROUND_HALF_CEIL = 7, d.ROUND_HALF_FLOOR = 8, d.EUCLID = 9, d.config = d.set = function(e) {
-    var t, i;
-    if (e != null)
-      if (typeof e == "object") {
-        if (e.hasOwnProperty(t = "DECIMAL_PLACES") && (i = e[t], U(i, 0, I, t), A = i), e.hasOwnProperty(t = "ROUNDING_MODE") && (i = e[t], U(i, 0, 8, t), N = i), e.hasOwnProperty(t = "EXPONENTIAL_AT") && (i = e[t], i && i.pop ? (U(i[0], -I, 0, t), U(i[1], 0, I, t), C = i[0], M = i[1]) : (U(i, -I, I, t), C = -(M = i < 0 ? -i : i))), e.hasOwnProperty(t = "RANGE"))
-          if (i = e[t], i && i.pop)
-            U(i[0], -I, -1, t), U(i[1], 1, I, t), Q = i[0], j = i[1];
-          else if (U(i, -I, I, t), i)
-            Q = -(j = i < 0 ? -i : i);
-          else
-            throw Error(B + t + " cannot be zero: " + i);
-        if (e.hasOwnProperty(t = "CRYPTO"))
-          if (i = e[t], i === !!i)
-            if (i)
-              if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes))
-                K = i;
-              else
-                throw K = !i, Error(B + "crypto unavailable");
-            else
-              K = i;
-          else
-            throw Error(B + t + " not true or false: " + i);
-        if (e.hasOwnProperty(t = "MODULO_MODE") && (i = e[t], U(i, 0, 9, t), te = i), e.hasOwnProperty(t = "POW_PRECISION") && (i = e[t], U(i, 0, I, t), Z = i), e.hasOwnProperty(t = "FORMAT"))
-          if (i = e[t], typeof i == "object") ce = i;
-          else throw Error(B + t + " not an object: " + i);
-        if (e.hasOwnProperty(t = "ALPHABET"))
-          if (i = e[t], typeof i == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(i))
-            fe = i.slice(0, 10) == "0123456789", b = i;
-          else
-            throw Error(B + t + " invalid: " + i);
-      } else
-        throw Error(B + "Object expected: " + e);
-    return {
-      DECIMAL_PLACES: A,
-      ROUNDING_MODE: N,
-      EXPONENTIAL_AT: [C, M],
-      RANGE: [Q, j],
-      CRYPTO: K,
-      MODULO_MODE: te,
-      POW_PRECISION: Z,
-      FORMAT: ce,
-      ALPHABET: b
-    };
-  }, d.isBigNumber = function(e) {
-    if (!e || e._isBigNumber !== !0) return !1;
-    if (!d.DEBUG) return !0;
-    var t, i, f = e.c, r = e.e, o = e.s;
-    e: if ({}.toString.call(f) == "[object Array]") {
-      if ((o === 1 || o === -1) && r >= -I && r <= I && r === V(r)) {
-        if (f[0] === 0) {
-          if (r === 0 && f.length === 1) return !0;
-          break e;
-        }
-        if (t = (r + 1) % E, t < 1 && (t += E), String(f[0]).length == t) {
-          for (t = 0; t < f.length; t++)
-            if (i = f[t], i < 0 || i >= $ || i !== V(i)) break e;
-          if (i !== 0) return !0;
-        }
-      }
-    } else if (f === null && r === null && (o === null || o === 1 || o === -1))
-      return !0;
-    throw Error(B + "Invalid BigNumber: " + e);
-  }, d.maximum = d.max = function() {
-    return xe(arguments, -1);
-  }, d.minimum = d.min = function() {
-    return xe(arguments, 1);
-  }, d.random = (function() {
-    var e = 9007199254740992, t = Math.random() * e & 2097151 ? function() {
-      return V(Math.random() * e);
-    } : function() {
-      return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
-    };
-    return function(i) {
-      var f, r, o, l, n, s = 0, a = [], c = new d(g);
-      if (i == null ? i = A : U(i, 0, I), l = pe(i / E), K)
-        if (crypto.getRandomValues) {
-          for (f = crypto.getRandomValues(new Uint32Array(l *= 2)); s < l; )
-            n = f[s] * 131072 + (f[s + 1] >>> 11), n >= 9e15 ? (r = crypto.getRandomValues(new Uint32Array(2)), f[s] = r[0], f[s + 1] = r[1]) : (a.push(n % 1e14), s += 2);
-          s = l / 2;
-        } else if (crypto.randomBytes) {
-          for (f = crypto.randomBytes(l *= 7); s < l; )
-            n = (f[s] & 31) * 281474976710656 + f[s + 1] * 1099511627776 + f[s + 2] * 4294967296 + f[s + 3] * 16777216 + (f[s + 4] << 16) + (f[s + 5] << 8) + f[s + 6], n >= 9e15 ? crypto.randomBytes(7).copy(f, s) : (a.push(n % 1e14), s += 7);
-          s = l / 7;
-        } else
-          throw K = !1, Error(B + "crypto unavailable");
-      if (!K)
-        for (; s < l; )
-          n = t(), n < 9e15 && (a[s++] = n % 1e14);
-      for (l = a[--s], i %= E, l && i && (n = we[E - i], a[s] = V(l / n) * n); a[s] === 0; a.pop(), s--) ;
-      if (s < 0)
-        a = [o = 0];
-      else {
-        for (o = -1; a[0] === 0; a.splice(0, 1), o -= E) ;
-        for (s = 1, n = a[0]; n >= 10; n /= 10, s++) ;
-        s < E && (o -= E - s);
-      }
-      return c.e = o, c.c = a, c;
-    };
-  })(), d.sum = function() {
-    for (var e = 1, t = arguments, i = new d(t[0]); e < t.length; ) i = i.plus(t[e++]);
-    return i;
-  }, m = /* @__PURE__ */ (function() {
-    var e = "0123456789";
-    function t(i, f, r, o) {
-      for (var l, n = [0], s, a = 0, c = i.length; a < c; ) {
-        for (s = n.length; s--; n[s] *= f) ;
-        for (n[0] += o.indexOf(i.charAt(a++)), l = 0; l < n.length; l++)
-          n[l] > r - 1 && (n[l + 1] == null && (n[l + 1] = 0), n[l + 1] += n[l] / r | 0, n[l] %= r);
-      }
-      return n.reverse();
-    }
-    return function(i, f, r, o, l) {
-      var n, s, a, c, u, k, O, S, P = i.indexOf("."), v = A, T = N;
-      for (P >= 0 && (c = Z, Z = 0, i = i.replace(".", ""), S = new d(f), k = S.pow(i.length - P), Z = c, S.c = t(
-        W(q(k.c), k.e, "0"),
-        10,
-        r,
-        e
-      ), S.e = S.c.length), O = t(i, f, r, l ? (n = b, e) : (n = e, b)), a = c = O.length; O[--c] == 0; O.pop()) ;
-      if (!O[0]) return n.charAt(0);
-      if (P < 0 ? --a : (k.c = O, k.e = a, k.s = o, k = p(k, S, v, T, r), O = k.c, u = k.r, a = k.e), s = a + v + 1, P = O[s], c = r / 2, u = u || s < 0 || O[s + 1] != null, u = T < 4 ? (P != null || u) && (T == 0 || T == (k.s < 0 ? 3 : 2)) : P > c || P == c && (T == 4 || u || T == 6 && O[s - 1] & 1 || T == (k.s < 0 ? 8 : 7)), s < 1 || !O[0])
-        i = u ? W(n.charAt(1), -v, n.charAt(0)) : n.charAt(0);
-      else {
-        if (O.length = s, u)
-          for (--r; ++O[--s] > r; )
-            O[s] = 0, s || (++a, O = [1].concat(O));
-        for (c = O.length; !O[--c]; ) ;
-        for (P = 0, i = ""; P <= c; i += n.charAt(O[P++])) ;
-        i = W(i, a, n.charAt(0));
-      }
-      return i;
-    };
-  })(), p = /* @__PURE__ */ (function() {
-    function e(f, r, o) {
-      var l, n, s, a, c = 0, u = f.length, k = r % J, O = r / J | 0;
-      for (f = f.slice(); u--; )
-        s = f[u] % J, a = f[u] / J | 0, l = O * s + a * k, n = k * s + l % J * J + c, c = (n / o | 0) + (l / J | 0) + O * a, f[u] = n % o;
-      return c && (f = [c].concat(f)), f;
-    }
-    function t(f, r, o, l) {
-      var n, s;
-      if (o != l)
-        s = o > l ? 1 : -1;
-      else
-        for (n = s = 0; n < o; n++)
-          if (f[n] != r[n]) {
-            s = f[n] > r[n] ? 1 : -1;
-            break;
-          }
-      return s;
-    }
-    function i(f, r, o, l) {
-      for (var n = 0; o--; )
-        f[o] -= n, n = f[o] < r[o] ? 1 : 0, f[o] = n * l + f[o] - r[o];
-      for (; !f[0] && f.length > 1; f.splice(0, 1)) ;
-    }
-    return function(f, r, o, l, n) {
-      var s, a, c, u, k, O, S, P, v, T, x, R, re, he, ue, z, ie, G = f.s == r.s ? 1 : -1, L = f.c, y = r.c;
-      if (!L || !L[0] || !y || !y[0])
-        return new d(
-          // Return NaN if either NaN, or both Infinity or 0.
-          !f.s || !r.s || (L ? y && L[0] == y[0] : !y) ? NaN : (
-            // Return ±0 if x is ±0 or y is ±Infinity, or return ±Infinity as y is ±0.
-            L && L[0] == 0 || !y ? G * 0 : G / 0
-          )
-        );
-      for (P = new d(G), v = P.c = [], a = f.e - r.e, G = o + a + 1, n || (n = $, a = H(f.e / E) - H(r.e / E), G = G / E | 0), c = 0; y[c] == (L[c] || 0); c++) ;
-      if (y[c] > (L[c] || 0) && a--, G < 0)
-        v.push(1), u = !0;
-      else {
-        for (he = L.length, z = y.length, c = 0, G += 2, k = V(n / (y[0] + 1)), k > 1 && (y = e(y, k, n), L = e(L, k, n), z = y.length, he = L.length), re = z, T = L.slice(0, z), x = T.length; x < z; T[x++] = 0) ;
-        ie = y.slice(), ie = [0].concat(ie), ue = y[0], y[1] >= n / 2 && ue++;
-        do {
-          if (k = 0, s = t(y, T, z, x), s < 0) {
-            if (R = T[0], z != x && (R = R * n + (T[1] || 0)), k = V(R / ue), k > 1)
-              for (k >= n && (k = n - 1), O = e(y, k, n), S = O.length, x = T.length; t(O, T, S, x) == 1; )
-                k--, i(O, z < S ? ie : y, S, n), S = O.length, s = 1;
-            else
-              k == 0 && (s = k = 1), O = y.slice(), S = O.length;
-            if (S < x && (O = [0].concat(O)), i(T, O, x, n), x = T.length, s == -1)
-              for (; t(y, T, z, x) < 1; )
-                k++, i(T, z < x ? ie : y, x, n), x = T.length;
-          } else s === 0 && (k++, T = [0]);
-          v[c++] = k, T[0] ? T[x++] = L[re] || 0 : (T = [L[re]], x = 1);
-        } while ((re++ < he || T[0] != null) && G--);
-        u = T[0] != null, v[0] || v.splice(0, 1);
-      }
-      if (n == $) {
-        for (c = 1, G = v[0]; G >= 10; G /= 10, c++) ;
-        F(P, o + (P.e = c + a * E - 1) + 1, l, u);
-      } else
-        P.e = a, P.r = +u;
-      return P;
-    };
-  })();
-  function ae(e, t, i, f) {
-    var r, o, l, n, s;
-    if (i == null ? i = N : U(i, 0, 8), !e.c) return e.toString();
-    if (r = e.c[0], l = e.e, t == null)
-      s = q(e.c), s = f == 1 || f == 2 && (l <= C || l >= M) ? oe(s, l) : W(s, l, "0");
-    else if (e = F(new d(e), t, i), o = e.e, s = q(e.c), n = s.length, f == 1 || f == 2 && (t <= o || o <= C)) {
-      for (; n < t; s += "0", n++) ;
-      s = oe(s, o);
-    } else if (t -= l + (f === 2 && o > l), s = W(s, o, "0"), o + 1 > n) {
-      if (--t > 0) for (s += "."; t--; s += "0") ;
-    } else if (t += o - n, t > 0)
-      for (o + 1 == n && (s += "."); t--; s += "0") ;
-    return e.s < 0 && r ? "-" + s : s;
-  }
-  function xe(e, t) {
-    for (var i, f, r = 1, o = new d(e[0]); r < e.length; r++)
-      f = new d(e[r]), (!f.s || (i = ee(o, f)) === t || i === 0 && o.s === t) && (o = f);
-    return o;
-  }
-  function le(e, t, i) {
-    for (var f = 1, r = t.length; !t[--r]; t.pop()) ;
-    for (r = t[0]; r >= 10; r /= 10, f++) ;
-    return (i = f + i * E - 1) > j ? e.c = e.e = null : i < Q ? e.c = [e.e = 0] : (e.e = i, e.c = t), e;
-  }
-  w = /* @__PURE__ */ (function() {
-    var e = /^(-?)0([xbo])(?=\w[\w.]*$)/i, t = /^([^.]+)\.$/, i = /^\.([^.]+)$/, f = /^-?(Infinity|NaN)$/, r = /^\s*\+(?=[\w.])|^\s+|\s+$/g;
-    return function(o, l, n, s) {
-      var a, c = n ? l : l.replace(r, "");
-      if (f.test(c))
-        o.s = isNaN(c) ? null : c < 0 ? -1 : 1;
-      else {
-        if (!n && (c = c.replace(e, function(u, k, O) {
-          return a = (O = O.toLowerCase()) == "x" ? 16 : O == "b" ? 2 : 8, !s || s == a ? k : u;
-        }), s && (a = s, c = c.replace(t, "$1").replace(i, "0.$1")), l != c))
-          return new d(c, a);
-        if (d.DEBUG)
-          throw Error(B + "Not a" + (s ? " base " + s : "") + " number: " + l);
-        o.s = null;
-      }
-      o.c = o.e = null;
-    };
-  })();
-  function F(e, t, i, f) {
-    var r, o, l, n, s, a, c, u = e.c, k = we;
-    if (u) {
-      e: {
-        for (r = 1, n = u[0]; n >= 10; n /= 10, r++) ;
-        if (o = t - r, o < 0)
-          o += E, l = t, s = u[a = 0], c = V(s / k[r - l - 1] % 10);
-        else if (a = pe((o + 1) / E), a >= u.length)
-          if (f) {
-            for (; u.length <= a; u.push(0)) ;
-            s = c = 0, r = 1, o %= E, l = o - E + 1;
-          } else
-            break e;
-        else {
-          for (s = n = u[a], r = 1; n >= 10; n /= 10, r++) ;
-          o %= E, l = o - E + r, c = l < 0 ? 0 : V(s / k[r - l - 1] % 10);
-        }
-        if (f = f || 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.
-        u[a + 1] != null || (l < 0 ? s : s % k[r - l - 1]), f = i < 4 ? (c || f) && (i == 0 || i == (e.s < 0 ? 3 : 2)) : c > 5 || c == 5 && (i == 4 || f || i == 6 && // Check whether the digit to the left of the rounding digit is odd.
-        (o > 0 ? l > 0 ? s / k[r - l] : 0 : u[a - 1]) % 10 & 1 || i == (e.s < 0 ? 8 : 7)), t < 1 || !u[0])
-          return u.length = 0, f ? (t -= e.e + 1, u[0] = k[(E - t % E) % E], e.e = -t || 0) : u[0] = e.e = 0, e;
-        if (o == 0 ? (u.length = a, n = 1, a--) : (u.length = a + 1, n = k[E - o], u[a] = l > 0 ? V(s / k[r - l] % k[l]) * n : 0), f)
-          for (; ; )
-            if (a == 0) {
-              for (o = 1, l = u[0]; l >= 10; l /= 10, o++) ;
-              for (l = u[0] += n, n = 1; l >= 10; l /= 10, n++) ;
-              o != n && (e.e++, u[0] == $ && (u[0] = 1));
-              break;
-            } else {
-              if (u[a] += n, u[a] != $) break;
-              u[a--] = 0, n = 1;
-            }
-        for (o = u.length; u[--o] === 0; u.pop()) ;
-      }
-      e.e > j ? e.c = e.e = null : e.e < Q && (e.c = [e.e = 0]);
-    }
-    return e;
-  }
-  function X(e) {
-    var t, i = e.e;
-    return i === null ? e.toString() : (t = q(e.c), t = i <= C || i >= M ? oe(t, i) : W(t, i, "0"), e.s < 0 ? "-" + t : t);
-  }
-  return h.absoluteValue = h.abs = function() {
-    var e = new d(this);
-    return e.s < 0 && (e.s = 1), e;
-  }, h.comparedTo = function(e, t) {
-    return ee(this, new d(e, t));
-  }, h.decimalPlaces = h.dp = function(e, t) {
-    var i, f, r, o = this;
-    if (e != null)
-      return U(e, 0, I), t == null ? t = N : U(t, 0, 8), F(new d(o), e + o.e + 1, t);
-    if (!(i = o.c)) return null;
-    if (f = ((r = i.length - 1) - H(this.e / E)) * E, r = i[r]) for (; r % 10 == 0; r /= 10, f--) ;
-    return f < 0 && (f = 0), f;
-  }, h.dividedBy = h.div = function(e, t) {
-    return p(this, new d(e, t), A, N);
-  }, h.dividedToIntegerBy = h.idiv = function(e, t) {
-    return p(this, new d(e, t), 0, 1);
-  }, h.exponentiatedBy = h.pow = function(e, t) {
-    var i, f, r, o, l, n, s, a, c, u = this;
-    if (e = new d(e), e.c && !e.isInteger())
-      throw Error(B + "Exponent not an integer: " + X(e));
-    if (t != null && (t = new d(t)), n = e.e > 14, !u.c || !u.c[0] || u.c[0] == 1 && !u.e && u.c.length == 1 || !e.c || !e.c[0])
-      return c = new d(Math.pow(+X(u), n ? e.s * (2 - se(e)) : +X(e))), t ? c.mod(t) : c;
-    if (s = e.s < 0, t) {
-      if (t.c ? !t.c[0] : !t.s) return new d(NaN);
-      f = !s && u.isInteger() && t.isInteger(), f && (u = u.mod(t));
-    } else {
-      if (e.e > 9 && (u.e > 0 || u.e < -1 || (u.e == 0 ? u.c[0] > 1 || n && u.c[1] >= 24e7 : u.c[0] < 8e13 || n && u.c[0] <= 9999975e7)))
-        return o = u.s < 0 && se(e) ? -0 : 0, u.e > -1 && (o = 1 / o), new d(s ? 1 / o : o);
-      Z && (o = pe(Z / E + 2));
-    }
-    for (n ? (i = new d(0.5), s && (e.s = 1), a = se(e)) : (r = Math.abs(+X(e)), a = r % 2), c = new d(g); ; ) {
-      if (a) {
-        if (c = c.times(u), !c.c) break;
-        o ? c.c.length > o && (c.c.length = o) : f && (c = c.mod(t));
-      }
-      if (r) {
-        if (r = V(r / 2), r === 0) break;
-        a = r % 2;
-      } else if (e = e.times(i), F(e, e.e + 1, 1), e.e > 14)
-        a = se(e);
-      else {
-        if (r = +X(e), r === 0) break;
-        a = r % 2;
-      }
-      u = u.times(u), o ? u.c && u.c.length > o && (u.c.length = o) : f && (u = u.mod(t));
-    }
-    return f ? c : (s && (c = g.div(c)), t ? c.mod(t) : o ? F(c, Z, N, l) : c);
-  }, h.integerValue = function(e) {
-    var t = new d(this);
-    return e == null ? e = N : U(e, 0, 8), F(t, t.e + 1, e);
-  }, h.isEqualTo = h.eq = function(e, t) {
-    return ee(this, new d(e, t)) === 0;
-  }, h.isFinite = function() {
-    return !!this.c;
-  }, h.isGreaterThan = h.gt = function(e, t) {
-    return ee(this, new d(e, t)) > 0;
-  }, h.isGreaterThanOrEqualTo = h.gte = function(e, t) {
-    return (t = ee(this, new d(e, t))) === 1 || t === 0;
-  }, h.isInteger = function() {
-    return !!this.c && H(this.e / E) > this.c.length - 2;
-  }, h.isLessThan = h.lt = function(e, t) {
-    return ee(this, new d(e, t)) < 0;
-  }, h.isLessThanOrEqualTo = h.lte = function(e, t) {
-    return (t = ee(this, new d(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 i, f, r, o, l = this, n = l.s;
-    if (e = new d(e, t), t = e.s, !n || !t) return new d(NaN);
-    if (n != t)
-      return e.s = -t, l.plus(e);
-    var s = l.e / E, a = e.e / E, c = l.c, u = e.c;
-    if (!s || !a) {
-      if (!c || !u) return c ? (e.s = -t, e) : new d(u ? l : NaN);
-      if (!c[0] || !u[0])
-        return u[0] ? (e.s = -t, e) : new d(c[0] ? l : (
-          // IEEE 754 (2008) 6.3: n - n = -0 when rounding to -Infinity
-          N == 3 ? -0 : 0
-        ));
-    }
-    if (s = H(s), a = H(a), c = c.slice(), n = s - a) {
-      for ((o = n < 0) ? (n = -n, r = c) : (a = s, r = u), r.reverse(), t = n; t--; r.push(0)) ;
-      r.reverse();
-    } else
-      for (f = (o = (n = c.length) < (t = u.length)) ? n : t, n = t = 0; t < f; t++)
-        if (c[t] != u[t]) {
-          o = c[t] < u[t];
-          break;
-        }
-    if (o && (r = c, c = u, u = r, e.s = -e.s), t = (f = u.length) - (i = c.length), t > 0) for (; t--; c[i++] = 0) ;
-    for (t = $ - 1; f > n; ) {
-      if (c[--f] < u[f]) {
-        for (i = f; i && !c[--i]; c[i] = t) ;
-        --c[i], c[f] += $;
-      }
-      c[f] -= u[f];
-    }
-    for (; c[0] == 0; c.splice(0, 1), --a) ;
-    return c[0] ? le(e, c, a) : (e.s = N == 3 ? -1 : 1, e.c = [e.e = 0], e);
-  }, h.modulo = h.mod = function(e, t) {
-    var i, f, r = this;
-    return e = new d(e, t), !r.c || !e.s || e.c && !e.c[0] ? new d(NaN) : !e.c || r.c && !r.c[0] ? new d(r) : (te == 9 ? (f = e.s, e.s = 1, i = p(r, e, 0, 3), e.s = f, i.s *= f) : i = p(r, e, 0, te), e = r.minus(i.times(e)), !e.c[0] && te == 1 && (e.s = r.s), e);
-  }, h.multipliedBy = h.times = function(e, t) {
-    var i, f, r, o, l, n, s, a, c, u, k, O, S, P, v, T = this, x = T.c, R = (e = new d(e, t)).c;
-    if (!x || !R || !x[0] || !R[0])
-      return !T.s || !e.s || x && !x[0] && !R || R && !R[0] && !x ? e.c = e.e = e.s = null : (e.s *= T.s, !x || !R ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
-    for (f = H(T.e / E) + H(e.e / E), e.s *= T.s, s = x.length, u = R.length, s < u && (S = x, x = R, R = S, r = s, s = u, u = r), r = s + u, S = []; r--; S.push(0)) ;
-    for (P = $, v = J, r = u; --r >= 0; ) {
-      for (i = 0, k = R[r] % v, O = R[r] / v | 0, l = s, o = r + l; o > r; )
-        a = x[--l] % v, c = x[l] / v | 0, n = O * a + c * k, a = k * a + n % v * v + S[o] + i, i = (a / P | 0) + (n / v | 0) + O * c, S[o--] = a % P;
-      S[o] = i;
-    }
-    return i ? ++f : S.splice(0, 1), le(e, S, f);
-  }, h.negated = function() {
-    var e = new d(this);
-    return e.s = -e.s || null, e;
-  }, h.plus = function(e, t) {
-    var i, f = this, r = f.s;
-    if (e = new d(e, t), t = e.s, !r || !t) return new d(NaN);
-    if (r != t)
-      return e.s = -t, f.minus(e);
-    var o = f.e / E, l = e.e / E, n = f.c, s = e.c;
-    if (!o || !l) {
-      if (!n || !s) return new d(r / 0);
-      if (!n[0] || !s[0]) return s[0] ? e : new d(n[0] ? f : r * 0);
-    }
-    if (o = H(o), l = H(l), n = n.slice(), r = o - l) {
-      for (r > 0 ? (l = o, i = s) : (r = -r, i = n), i.reverse(); r--; i.push(0)) ;
-      i.reverse();
-    }
-    for (r = n.length, t = s.length, r - t < 0 && (i = s, s = n, n = i, t = r), r = 0; t; )
-      r = (n[--t] = n[t] + s[t] + r) / $ | 0, n[t] = $ === n[t] ? 0 : n[t] % $;
-    return r && (n = [r].concat(n), ++l), le(e, n, l);
-  }, h.precision = h.sd = function(e, t) {
-    var i, f, r, o = this;
-    if (e != null && e !== !!e)
-      return U(e, 1, I), t == null ? t = N : U(t, 0, 8), F(new d(o), e, t);
-    if (!(i = o.c)) return null;
-    if (r = i.length - 1, f = r * E + 1, r = i[r]) {
-      for (; r % 10 == 0; r /= 10, f--) ;
-      for (r = i[0]; r >= 10; r /= 10, f++) ;
-    }
-    return e && o.e + 1 > f && (f = o.e + 1), f;
-  }, h.shiftedBy = function(e) {
-    return U(e, -de, de), this.times("1e" + e);
-  }, h.squareRoot = h.sqrt = function() {
-    var e, t, i, f, r, o = this, l = o.c, n = o.s, s = o.e, a = A + 4, c = new d("0.5");
-    if (n !== 1 || !l || !l[0])
-      return new d(!n || n < 0 && (!l || l[0]) ? NaN : l ? o : 1 / 0);
-    if (n = Math.sqrt(+X(o)), n == 0 || n == 1 / 0 ? (t = q(l), (t.length + s) % 2 == 0 && (t += "0"), n = Math.sqrt(+t), s = H((s + 1) / 2) - (s < 0 || s % 2), n == 1 / 0 ? t = "5e" + s : (t = n.toExponential(), t = t.slice(0, t.indexOf("e") + 1) + s), i = new d(t)) : i = new d(n + ""), i.c[0]) {
-      for (s = i.e, n = s + a, n < 3 && (n = 0); ; )
-        if (r = i, i = c.times(r.plus(p(o, r, a, 1))), q(r.c).slice(0, n) === (t = q(i.c)).slice(0, n))
-          if (i.e < s && --n, t = t.slice(n - 3, n + 1), t == "9999" || !f && t == "4999") {
-            if (!f && (F(r, r.e + A + 2, 0), r.times(r).eq(o))) {
-              i = r;
-              break;
-            }
-            a += 4, n += 4, f = 1;
-          } else {
-            (!+t || !+t.slice(1) && t.charAt(0) == "5") && (F(i, i.e + A + 2, 1), e = !i.times(i).eq(o));
-            break;
-          }
-    }
-    return F(i, i.e + A + 1, N, e);
-  }, h.toExponential = function(e, t) {
-    return e != null && (U(e, 0, I), e++), ae(this, e, t, 1);
-  }, h.toFixed = function(e, t) {
-    return e != null && (U(e, 0, I), e = e + this.e + 1), ae(this, e, t);
-  }, h.toFormat = function(e, t, i) {
-    var f, r = this;
-    if (i == null)
-      e != null && t && typeof t == "object" ? (i = t, t = null) : e && typeof e == "object" ? (i = e, e = t = null) : i = ce;
-    else if (typeof i != "object")
-      throw Error(B + "Argument not an object: " + i);
-    if (f = r.toFixed(e, t), r.c) {
-      var o, l = f.split("."), n = +i.groupSize, s = +i.secondaryGroupSize, a = i.groupSeparator || "", c = l[0], u = l[1], k = r.s < 0, O = k ? c.slice(1) : c, S = O.length;
-      if (s && (o = n, n = s, s = o, S -= o), n > 0 && S > 0) {
-        for (o = S % n || n, c = O.substr(0, o); o < S; o += n) c += a + O.substr(o, n);
-        s > 0 && (c += a + O.slice(o)), k && (c = "-" + c);
-      }
-      f = u ? c + (i.decimalSeparator || "") + ((s = +i.fractionGroupSize) ? u.replace(
-        new RegExp("\\d{" + s + "}\\B", "g"),
-        "$&" + (i.fractionGroupSeparator || "")
-      ) : u) : c;
-    }
-    return (i.prefix || "") + f + (i.suffix || "");
-  }, h.toFraction = function(e) {
-    var t, i, f, r, o, l, n, s, a, c, u, k, O = this, S = O.c;
-    if (e != null && (n = new d(e), !n.isInteger() && (n.c || n.s !== 1) || n.lt(g)))
-      throw Error(B + "Argument " + (n.isInteger() ? "out of range: " : "not an integer: ") + X(n));
-    if (!S) return new d(O);
-    for (t = new d(g), a = i = new d(g), f = s = new d(g), k = q(S), o = t.e = k.length - O.e - 1, t.c[0] = we[(l = o % E) < 0 ? E + l : l], e = !e || n.comparedTo(t) > 0 ? o > 0 ? t : a : n, l = j, j = 1 / 0, n = new d(k), s.c[0] = 0; c = p(n, t, 0, 1), r = i.plus(c.times(f)), r.comparedTo(e) != 1; )
-      i = f, f = r, a = s.plus(c.times(r = a)), s = r, t = n.minus(c.times(r = t)), n = r;
-    return r = p(e.minus(i), f, 0, 1), s = s.plus(r.times(a)), i = i.plus(r.times(f)), s.s = a.s = O.s, o = o * 2, u = p(a, f, o, N).minus(O).abs().comparedTo(
-      p(s, i, o, N).minus(O).abs()
-    ) < 1 ? [a, f] : [s, i], j = l, u;
-  }, h.toNumber = function() {
-    return +X(this);
-  }, h.toPrecision = function(e, t) {
-    return e != null && U(e, 1, I), ae(this, e, t, 2);
-  }, h.toString = function(e) {
-    var t, i = this, f = i.s, r = i.e;
-    return r === null ? f ? (t = "Infinity", f < 0 && (t = "-" + t)) : t = "NaN" : (e == null ? t = r <= C || r >= M ? oe(q(i.c), r) : W(q(i.c), r, "0") : e === 10 && fe ? (i = F(new d(i), A + r + 1, N), t = W(q(i.c), i.e, "0")) : (U(e, 2, b.length, "Base"), t = m(W(q(i.c), r, "0"), 10, e, f, !0)), f < 0 && i.c[0] && (t = "-" + t)), t;
-  }, h.valueOf = h.toJSON = function() {
-    return X(this);
-  }, h._isBigNumber = !0, h[Symbol.toStringTag] = "BigNumber", h[/* @__PURE__ */ Symbol.for("nodejs.util.inspect.custom")] = h.valueOf, _ != null && d.set(_), d;
+import { nanoid as e } from "nanoid";
+//#region src/common.ts
+var t = 1, n = 2, r = 3, i = class extends Error {
+	constructor(e, t) {
+		super(t || `OAuth2Error: code=${e}`), this.code = e;
+	}
+};
+h();
+//#endregion
+//#region ../../node_modules/.pnpm/bignumber.js@11.1.1/node_modules/bignumber.js/dist/bignumber.mjs
+var a = /^-?(?:\d+(?:\.\d*)?|\.\d+)(?:e[+-]?\d+)?$/i, o = Math.ceil, s = Math.floor, c = "[BigNumber Error] ", l = 0x5af3107a4000, u = 14, d = 9007199254740991, f = [
+	1,
+	10,
+	100,
+	1e3,
+	1e4,
+	1e5,
+	1e6,
+	1e7,
+	1e8,
+	1e9,
+	1e10,
+	1e11,
+	0xe8d4a51000,
+	0x9184e72a000
+], p = 1e7, m = 1e9;
+function h(e) {
+	var t, n, r = /^(-?)0([xbo])(?=[^.])/i, i = /^-?(Infinity|NaN)$/, w = /^\s*\+(?!-)|^\s+|\s+$/g, T = z.prototype = {
+		constructor: z,
+		toString: null,
+		valueOf: null
+	}, E = new z(1), D = 20, O = 4, k = -7, A = 21, j = -1e7, M = 1e7, N = !1, P = !0, F = 1, I = 0, L = {
+		prefix: "",
+		negativeSign: "-",
+		positiveSign: "",
+		groupSeparator: ",",
+		groupSize: 3,
+		secondaryGroupSize: 0,
+		decimalSeparator: ".",
+		fractionGroupSeparator: "",
+		fractionGroupSize: 0,
+		suffix: ""
+	}, R = "0123456789abcdefghijklmnopqrstuvwxyz";
+	function z(e, t) {
+		var n, o, s, l, u = this;
+		if (!(u instanceof z)) return new z(e, t);
+		if (l = typeof e, t == null) {
+			if (U(e)) {
+				u.s = e.s, !e.c || e.e > M ? u.c = u.e = null : e.e < j ? u.c = [u.e = 0] : (u.e = e.e, u.c = e.c.slice());
+				return;
+			}
+			if (l == "number") {
+				if (e * 0 != 0) {
+					u.s = isNaN(e) ? null : e < 0 ? -1 : 1, u.c = u.e = null;
+					return;
+				}
+				if (u.s = 1 / e < 0 ? (e = -e, -1) : 1, e === ~~e) {
+					for (n = 0, o = e; o >= 10; o /= 10, n++);
+					n > M ? u.c = u.e = null : (u.e = n, u.c = [e]);
+					return;
+				}
+				return B(u, String(e));
+			}
+			if (l == "bigint") return u.s = e < 0 ? (e = -e, -1) : 1, B(u, String(e));
+			if (l == "string") s = e;
+			else {
+				if (P) throw Error(c + "BigNumber, string, number, or BigInt expected: " + e);
+				s = String(e);
+			}
+			if (a.test(s)) return u.s = s.charCodeAt(0) == 45 ? (s = s.slice(1), -1) : 1, B(u, s);
+			if (s = s.replace(w, ""), i.test(s)) {
+				u.s = isNaN(s) ? null : s < 0 ? -1 : 1, u.c = u.e = null;
+				return;
+			}
+			if (s = s.replace(r, function(e, n, r) {
+				return t = (r = r.toLowerCase()) == "x" ? 16 : r == "b" ? 2 : 8, n;
+			}), t) return V(u, s, t, e);
+			if (s = s.replace(/(\d)_(?=\d)/g, "$1"), a.test(s)) return u.s = s.charCodeAt(0) == 45 ? (s = s.slice(1), -1) : 1, B(u, s);
+			if (P) throw Error(c + "Not a number: " + e);
+			u.s = u.c = u.e = null;
+		} else {
+			if (l != "string") {
+				if (P) throw Error(c + "String expected: " + e);
+				e = String(e);
+			}
+			y(t, 2, R.length, "Base"), V(u, e.replace(w, ""), t, e);
+		}
+	}
+	z.clone = h, z.ROUND_UP = 0, z.ROUND_DOWN = 1, z.ROUND_CEIL = 2, z.ROUND_FLOOR = 3, z.ROUND_HALF_UP = 4, z.ROUND_HALF_DOWN = 5, z.ROUND_HALF_EVEN = 6, z.ROUND_HALF_CEIL = 7, z.ROUND_HALF_FLOOR = 8, z.EUCLID = 9, z.config = z.set = function(e) {
+		var t, n;
+		if (e != null) if (typeof e == "object") {
+			if (e.hasOwnProperty(t = "DECIMAL_PLACES") && (D = y(e[t], 0, m, t)), e.hasOwnProperty(t = "ROUNDING_MODE") && (O = y(e[t], 0, 8, t)), e.hasOwnProperty(t = "EXPONENTIAL_AT") && (n = e[t], b(n) ? (y(n[0], -m, 0, t), y(n[1], 0, m, t), k = n[0], A = n[1]) : k = -(A = y(n, -m, m, t) < 0 ? -n : n)), e.hasOwnProperty(t = "RANGE")) if (n = e[t], n) b(n) ? (y(n[0], -m, -1, t), y(n[1], 1, m, t), j = n[0], M = n[1]) : j = -(M = y(n, -m, m, t) < 0 ? -n : n);
+			else throw Error(c + t + " cannot be zero: " + n);
+			if (e.hasOwnProperty(t = "CRYPTO")) if (n = e[t], n === !!n) if (n) if (typeof crypto < "u" && crypto && (crypto.getRandomValues || crypto.randomBytes)) N = n;
+			else throw N = !n, Error(c + "crypto unavailable");
+			else N = n;
+			else throw Error(c + t + " not true or false: " + n);
+			if (e.hasOwnProperty(t = "STRICT")) if (n = e[t], n === !!n) P = n;
+			else throw Error(c + t + " not true or false: " + n);
+			if (e.hasOwnProperty(t = "MODULO_MODE") && (F = y(e[t], 0, 9, t)), e.hasOwnProperty(t = "POW_PRECISION") && (I = y(e[t], 0, m, t)), e.hasOwnProperty(t = "FORMAT")) if (n = e[t], typeof n == "object") for (t in n) n.hasOwnProperty(t) && L.hasOwnProperty(t) && (L[t] = n[t]);
+			else throw Error(c + t + " not an object: " + n);
+			if (e.hasOwnProperty(t = "ALPHABET")) if (n = e[t], typeof n == "string" && !/^.?$|[+\-.\s]|(.).*\1/.test(n)) R = n;
+			else throw Error(c + t + " invalid: " + n);
+		} else throw Error(c + "Object expected: " + e);
+		return {
+			DECIMAL_PLACES: D,
+			ROUNDING_MODE: O,
+			EXPONENTIAL_AT: [k, A],
+			RANGE: [j, M],
+			CRYPTO: N,
+			STRICT: P,
+			MODULO_MODE: F,
+			POW_PRECISION: I,
+			FORMAT: L,
+			ALPHABET: R
+		};
+	}, z.fromFormat = function(e, t) {
+		if (typeof e != "string") throw Error(c + "Not a string: " + e);
+		if (t == null) t = L;
+		else if (typeof t != "object") throw Error(c + "Argument not an object: " + t);
+		else t = K(t);
+		var n, r, i, a, o = t.negativeSign || "-", s = t.positiveSign || "", l = t.prefix || "", u = t.suffix || "", d = t.groupSeparator || "", f = t.decimalSeparator || ".", p = t.fractionGroupSeparator || "";
+		if (l && e.indexOf(l) === 0 && (e = e.slice(l.length)), u && e.lastIndexOf(u) === e.length - u.length && (e = e.slice(0, -u.length)), o && e.indexOf(o) === 0 ? (e = e.slice(o.length), r = !0) : s && e.indexOf(s) === 0 && (e = e.slice(s.length)), n = e.indexOf(f), n < 0) {
+			if (d) for (; e.indexOf(d) > -1;) e = e.replace(d, "");
+		} else {
+			if (i = e.slice(0, n), a = e.slice(n + f.length), d) for (; i.indexOf(d) > -1;) i = i.replace(d, "");
+			if (p) for (; a.indexOf(p) > -1;) a = a.replace(p, "");
+			e = i + "." + a;
+		}
+		return new z(r ? "-" + e : e);
+	}, z.isBigNumber = function(e) {
+		if (!U(e)) return !1;
+		var t, n, r = e.c, i = e.e, a = e.s;
+		if (!b(r)) return r === null && i === null && (a === null || a === 1 || a === -1);
+		if (a !== 1 && a !== -1 || i < -m || i > m || i !== s(i)) return !1;
+		if (r[0] === 0) return i === 0 && r.length === 1;
+		if (t = (i + 1) % u, t < 1 && (t += u), String(r[0]).length !== t) return !1;
+		for (t = 0; t < r.length; t++) if (n = r[t], n < 0 || n >= l || n !== s(n)) return !1;
+		return n !== 0;
+	}, z.maximum = z.max = function() {
+		return W(arguments, -1);
+	}, z.minimum = z.min = function() {
+		return W(arguments, 1);
+	}, z.random = (function() {
+		var e = 9007199254740992, t = Math.random() * e & 2097151 ? function() {
+			return s(Math.random() * e);
+		} : function() {
+			return (Math.random() * 1073741824 | 0) * 8388608 + (Math.random() * 8388608 | 0);
+		};
+		return function(e) {
+			var n, r, i, a, l, d = 0, p = [], h = new z(E);
+			if (e = e == null ? D : y(e, 0, m), a = o(e / u), N) if (crypto.getRandomValues) {
+				for (n = crypto.getRandomValues(new Uint32Array(a *= 2)); d < a;) l = n[d] * 131072 + (n[d + 1] >>> 11), l >= 9e15 ? (r = crypto.getRandomValues(new Uint32Array(2)), n[d] = r[0], n[d + 1] = r[1]) : (p.push(l % 0x5af3107a4000), d += 2);
+				d = a / 2;
+			} else if (crypto.randomBytes) {
+				for (n = crypto.randomBytes(a *= 7); d < a;) l = (n[d] & 31) * 281474976710656 + n[d + 1] * 1099511627776 + n[d + 2] * 4294967296 + n[d + 3] * 16777216 + (n[d + 4] << 16) + (n[d + 5] << 8) + n[d + 6], l >= 9e15 ? crypto.randomBytes(7).copy(n, d) : (p.push(l % 0x5af3107a4000), d += 7);
+				d = a / 7;
+			} else throw N = !1, Error(c + "crypto unavailable");
+			if (!N) for (; d < a;) l = t(), l < 9e15 && (p[d++] = l % 0x5af3107a4000);
+			for (a = p[--d], e %= u, a && e && (l = f[u - e], p[d] = s(a / l) * l); p[d] === 0; p.pop(), d--);
+			if (d < 0) p = [i = 0];
+			else {
+				for (i = -1; p[0] === 0; p.splice(0, 1), i -= u);
+				for (d = 1, l = p[0]; l >= 10; l /= 10, d++);
+				d < u && (i -= u - d);
+			}
+			return h.e = i, h.c = p, h;
+		};
+	})(), z.sum = function() {
+		for (var e = 0, t = new z(0); e < arguments.length;) t = t.plus(arguments[e++]);
+		return t;
+	};
+	function B(e, t) {
+		var n, r, i;
+		for ((n = t.indexOf(".")) > -1 && (t = t.replace(".", "")), (r = t.search(/e/i)) > 0 ? (n < 0 && (n = r), n += +t.slice(r + 1), t = t.substring(0, r)) : n < 0 && (n = t.length), r = 0; t.charCodeAt(r) === 48; r++);
+		for (i = t.length; t.charCodeAt(--i) === 48;);
+		if (t = t.slice(r, ++i)) if (i -= r, n = n - r - 1, n > M) e.c = e.e = null;
+		else if (n < j) e.c = [e.e = 0];
+		else {
+			if (e.e = n, e.c = [], r = (n + 1) % u, n < 0 && (r += u), r < i) {
+				for (r && e.c.push(+t.slice(0, r)), i -= u; r < i;) e.c.push(+t.slice(r, r += u));
+				r = u - (t = t.slice(r)).length;
+			} else r -= i;
+			for (; r--; t += "0");
+			e.c.push(+t);
+		}
+		else e.c = [e.e = 0];
+	}
+	function V(e, t, r, i) {
+		var a, o, s = R.slice(0, r), l = 0, u = "", d = !1, f = !1, p = !1;
+		for (e.s = t.charCodeAt(0) === 45 ? (t = t.slice(1), -1) : 1, o = t.length; l < o; l++) {
+			if (a = t.charAt(l), s.indexOf(a) >= 0) {
+				u += a, f = !0;
+				continue;
+			}
+			if (a == "_") {
+				if (f && l + 1 < o) {
+					f = !1;
+					continue;
+				}
+			} else if (a == ".") {
+				if (l == 0 || !d && f) {
+					if (l + 1 == o) break;
+					l == 0 && (u = "0"), u += a, d = !0, f = !1;
+					continue;
+				}
+			} else if (!p && (t == t.toUpperCase() && s == s.toLowerCase() && (t = t.toLowerCase()) || t == t.toLowerCase() && s == s.toUpperCase() && (t = t.toUpperCase()))) {
+				l = -1, u = "", p = !0, d = f = !1;
+				continue;
+			}
+			if (P) throw Error(c + "Not a base " + r + " number: " + i);
+			e.s = e.c = e.e = null;
+			return;
+		}
+		B(e, n(u, r, 10, e.s));
+	}
+	n = (function() {
+		var e = "0123456789";
+		function n(e, t, n, r) {
+			for (var i, a = [0], o, s = 0, c = e.length; s < c;) {
+				for (o = a.length; o--; a[o] *= t);
+				for (a[0] += r.indexOf(e.charAt(s++)), i = 0; i < a.length; i++) a[i] > n - 1 && (a[i + 1] ?? (a[i + 1] = 0), a[i + 1] += a[i] / n | 0, a[i] %= n);
+			}
+			return a.reverse();
+		}
+		return function(r, i, a, o, s) {
+			var c, l, u, d, f, p, m, h, g = r.indexOf("."), v = D, y = O;
+			for (g >= 0 && (d = I, I = 0, r = r.replace(".", ""), h = new z(i), p = h.pow(r.length - g), I = d, h.c = n(C(_(p.c), p.e, "0"), 10, a, e), h.e = h.c.length), m = n(r, i, a, s ? (c = R, e) : (c = e, R)), u = d = m.length; m[--d] == 0; m.pop());
+			if (!m[0]) return c.charAt(0);
+			if (g < 0 ? --u : (p.c = m, p.e = u, p.s = o, p = t(p, h, v, y, a), m = p.c, f = p.r, u = p.e), l = u + v + 1, g = m[l], d = a / 2, f = f || l < 0 || m[l + 1] != null, f = y < 4 ? (g != null || f) && (y == 0 || y == (p.s < 0 ? 3 : 2)) : g > d || g == d && (y == 4 || f || y == 6 && m[l - 1] & 1 || y == (p.s < 0 ? 8 : 7)), l < 1 || !m[0]) r = f ? C(c.charAt(1), -v, c.charAt(0)) : c.charAt(0);
+			else {
+				if (l < m.length && (m.length = l), f) for (--a; ++m[--l] > a;) m[l] = 0, l || (++u, m = [1].concat(m));
+				for (d = m.length; !m[--d];);
+				for (g = 0, r = ""; g <= d; r += c.charAt(m[g++]));
+				r = C(r, u, c.charAt(0));
+			}
+			return r;
+		};
+	})(), t = (function() {
+		function e(e, t, n) {
+			var r, i, a, o, s = 0, c = e.length, l = t % p, u = t / p | 0;
+			for (e = e.slice(); c--;) a = e[c] % p, o = e[c] / p | 0, r = u * a + o * l, i = l * a + r % p * p + s, s = (i / n | 0) + (r / p | 0) + u * o, e[c] = i % n;
+			return s && (e = [s].concat(e)), e;
+		}
+		function t(e, t, n, r) {
+			var i, a;
+			if (n != r) a = n > r ? 1 : -1;
+			else for (i = a = 0; i < n; i++) if (e[i] != t[i]) {
+				a = e[i] > t[i] ? 1 : -1;
+				break;
+			}
+			return a;
+		}
+		function n(e, t, n, r) {
+			for (var i = 0; n--;) e[n] -= i, i = +(e[n] < t[n]), e[n] = i * r + e[n] - t[n];
+			for (; !e[0] && e.length > 1; e.splice(0, 1));
+		}
+		return function(r, i, a, o, c) {
+			var d, f, p, m, h, _, v, y, b, x, S, C, w, T, E, D, O, k = r.s == i.s ? 1 : -1, A = r.c, j = i.c;
+			if (!A || !A[0] || !j || !j[0]) return new z(!r.s || !i.s || (A ? j && A[0] == j[0] : !j) ? NaN : A && A[0] == 0 || !j ? k * 0 : k / 0);
+			for (y = new z(k), b = y.c = [], f = r.e - i.e, k = a + f + 1, c || (c = l, f = g(r.e / u) - g(i.e / u), k = k / u | 0), p = 0; j[p] == (A[p] || 0); p++);
+			if (j[p] > (A[p] || 0) && f--, k < 0) b.push(1), m = !0;
+			else {
+				for (T = A.length, D = j.length, p = 0, k += 2, h = s(c / (j[0] + 1)), h > 1 && (j = e(j, h, c), A = e(A, h, c), D = j.length, T = A.length), w = D, x = A.slice(0, D), S = x.length; S < D; x[S++] = 0);
+				O = j.slice(), O = [0].concat(O), E = j[0], j[1] >= c / 2 && E++;
+				do {
+					if (h = 0, d = t(j, x, D, S), d < 0) {
+						if (C = x[0], D != S && (C = C * c + (x[1] || 0)), h = s(C / E), h > 1) for (h >= c && (h = c - 1), _ = e(j, h, c), v = _.length, S = x.length; t(_, x, v, S) == 1;) h--, n(_, D < v ? O : j, v, c), v = _.length, d = 1;
+						else h == 0 && (d = h = 1), _ = j.slice(), v = _.length;
+						if (v < S && (_ = [0].concat(_)), n(x, _, S, c), S = x.length, d == -1) for (; t(j, x, D, S) < 1;) h++, n(x, D < S ? O : j, S, c), S = x.length;
+					} else d === 0 && (h++, x = [0]);
+					b[p++] = h, x[0] ? x[S++] = A[w] || 0 : (x = [A[w]], S = 1);
+				} while ((w++ < T || x[0] != null) && k--);
+				m = x[0] != null, b[0] || b.splice(0, 1);
+			}
+			if (c == l) {
+				for (p = 1, k = b[0]; k >= 10; k /= 10, p++);
+				q(y, a + (y.e = p + f * u - 1) + 1, o, m);
+			} else y.e = f, y.r = +m;
+			return y;
+		};
+	})();
+	function H(e, t, n, r) {
+		var i, a, o, s, c;
+		if (n = n == null ? O : y(n, 0, 8), !e.c) return e.toString();
+		if (i = e.c[0], o = e.e, t == null) c = _(e.c), c = r == 1 || r == 2 && (o <= k || o >= A) ? S(c, o) : C(c, o, "0");
+		else if (e = q(new z(e), t, n), a = e.e, c = _(e.c), s = c.length, r == 1 || r == 2 && (t <= a || a <= k)) {
+			for (; s < t; c += "0", s++);
+			c = S(c, a);
+		} else if (t -= o + (r === 2 && a > o), c = C(c, a, "0"), a + 1 > s) {
+			if (--t > 0) for (c += "."; t--; c += "0");
+		} else if (t += a - s, t > 0) for (a + 1 == s && (c += "."); t--; c += "0");
+		return e.s < 0 && i ? "-" + c : c;
+	}
+	function U(e) {
+		return e instanceof z || !!e && e._isBigNumber === !0;
+	}
+	function W(e, t) {
+		for (var n, r, i = 1, a = new z(e[0]); i < e.length; i++) r = new z(e[i]), (!r.s || (n = v(a, r)) === t || n === 0 && a.s === t) && (a = r);
+		return a;
+	}
+	function G(e, t, n) {
+		for (var r = 1, i = t.length; !t[--i]; t.pop());
+		for (i = t[0]; i >= 10; i /= 10, r++);
+		return (n = r + n * u - 1) > M ? e.c = e.e = null : n < j ? e.c = [e.e = 0] : (e.e = n, e.c = t), e;
+	}
+	function K(e) {
+		var t, n = {};
+		for (t in L) L.hasOwnProperty(t) && (n[t] = e.hasOwnProperty(t) ? e[t] : L[t]);
+		return n;
+	}
+	function q(e, t, n, r) {
+		var i, a, c, d, p, m, h, g = e.c, _ = f;
+		if (g) {
+			out: {
+				for (i = 1, d = g[0]; d >= 10; d /= 10, i++);
+				if (a = t - i, a < 0) a += u, c = t, p = g[m = 0], h = s(p / _[i - c - 1] % 10);
+				else if (m = o((a + 1) / u), m >= g.length) if (r) {
+					for (; g.length <= m; g.push(0));
+					p = h = 0, i = 1, a %= u, c = a - u + 1;
+				} else break out;
+				else {
+					for (p = d = g[m], i = 1; d >= 10; d /= 10, i++);
+					a %= u, c = a - u + i, h = c < 0 ? 0 : s(p / _[i - c - 1] % 10);
+				}
+				if (r = r || t < 0 || g[m + 1] != null || (c < 0 ? p : p % _[i - c - 1]), r = n < 4 ? (h || r) && (n == 0 || n == (e.s < 0 ? 3 : 2)) : h > 5 || h == 5 && (n == 4 || r || n == 6 && (a > 0 ? c > 0 ? p / _[i - c] : 0 : g[m - 1]) % 10 & 1 || n == (e.s < 0 ? 8 : 7)), t < 1 || !g[0]) return g.length = 0, r ? (t -= e.e + 1, g[0] = _[(u - t % u) % u], e.e = -t || 0) : g[0] = e.e = 0, e;
+				if (a == 0 ? (g.length = m, d = 1, m--) : (g.length = m + 1, d = _[u - a], g[m] = c > 0 ? s(p / _[i - c] % _[c]) * d : 0), r) for (;;) if (m == 0) {
+					for (a = 1, c = g[0]; c >= 10; c /= 10, a++);
+					for (c = g[0] += d, d = 1; c >= 10; c /= 10, d++);
+					a != d && (e.e++, g[0] == l && (g[0] = 1));
+					break;
+				} else {
+					if (g[m] += d, g[m] != l) break;
+					g[m--] = 0, d = 1;
+				}
+				for (a = g.length; g[--a] === 0; g.pop());
+			}
+			e.e > M ? e.c = e.e = null : e.e < j && (e.c = [e.e = 0]);
+		}
+		return e;
+	}
+	function J(e) {
+		var t, n = e.e;
+		return n === null ? e.toString() : (t = _(e.c), t = n <= k || n >= A ? S(t, n) : C(t, n, "0"), e.s < 0 ? "-" + t : t);
+	}
+	return T.absoluteValue = T.abs = function() {
+		var e = new z(this);
+		return e.s < 0 && (e.s = 1), e;
+	}, T.comparedTo = function(e, t) {
+		return v(this, new z(e, t));
+	}, T.decimalPlaces = T.dp = function(e, t) {
+		var n, r, i, a = this;
+		if (e != null) return q(new z(a), y(e, -m, m) + a.e + 1, t == null ? O : y(t, 0, 8));
+		if (!(n = a.c)) return null;
+		if (r = ((i = n.length - 1) - g(this.e / u)) * u, i = n[i]) for (; i % 10 == 0; i /= 10, r--);
+		return r < 0 && (r = 0), r;
+	}, T.dividedBy = T.div = function(e, n) {
+		return t(this, new z(e, n), D, O);
+	}, T.dividedToIntegerBy = T.idiv = function(e, n) {
+		return t(this, new z(e, n), 0, 1);
+	}, T.exponentiatedBy = T.pow = function(e, t) {
+		var n, r, i, a, l, d, f, p, m, h = this;
+		if (e = new z(e), e.c && !e.isInteger()) throw Error(c + "Exponent not an integer: " + J(e));
+		if (t != null && (t = new z(t)), d = e.e > 14, !h.c || !h.c[0] || h.c[0] == 1 && !h.e && h.c.length == 1 || !e.c || !e.c[0]) return m = new z(J(h) ** (d ? e.s * (2 - x(e)) : +J(e))), t ? m.mod(t) : m;
+		if (f = e.s < 0, t) {
+			if (t.c ? !t.c[0] : !t.s) return new z(NaN);
+			r = !f && h.isInteger() && t.isInteger(), r && (h = h.mod(t));
+		} else if (e.e > 9 && (h.e > 0 || h.e < -1 || (h.e == 0 ? h.c[0] > 1 || d && h.c[1] >= 24e7 : h.c[0] < 8e13 || d && h.c[0] <= 9999975e7))) return a = h.s < 0 && x(e) ? -0 : 0, h.e > -1 && (a = 1 / a), new z(f ? 1 / a : a);
+		else I && (a = o(I / u + 2));
+		for (d ? (n = new z(.5), f && (e.s = 1), p = x(e)) : (i = Math.abs(+J(e)), p = i % 2), m = new z(E);;) {
+			if (p) {
+				if (m = m.times(h), !m.c) break;
+				a ? m.c.length > a && (m.c.length = a) : r && (m = m.mod(t));
+			}
+			if (i) {
+				if (i = s(i / 2), i === 0) break;
+				p = i % 2;
+			} else if (e = e.times(n), q(e, e.e + 1, 1), e.e > 14) p = x(e);
+			else {
+				if (i = +J(e), i === 0) break;
+				p = i % 2;
+			}
+			h = h.times(h), a ? h.c && h.c.length > a && (h.c.length = a) : r && (h = h.mod(t));
+		}
+		return r ? m : (f && (m = E.div(m)), t ? m.mod(t) : a ? q(m, I, O, l) : m);
+	}, T.integerValue = function(e) {
+		var t = new z(this);
+		return q(t, t.e + 1, e == null ? O : y(e, 0, 8));
+	}, T.isEqualTo = T.eq = function(e, t) {
+		return v(this, new z(e, t)) === 0;
+	}, T.isFinite = function() {
+		return !!this.c;
+	}, T.isGreaterThan = T.gt = function(e, t) {
+		return v(this, new z(e, t)) > 0;
+	}, T.isGreaterThanOrEqualTo = T.gte = function(e, t) {
+		return (t = v(this, new z(e, t))) === 1 || t === 0;
+	}, T.isInteger = function() {
+		return !!this.c && g(this.e / u) > this.c.length - 2;
+	}, T.isLessThan = T.lt = function(e, t) {
+		return v(this, new z(e, t)) < 0;
+	}, T.isLessThanOrEqualTo = T.lte = function(e, t) {
+		return (t = v(this, new z(e, t))) === -1 || t === 0;
+	}, T.isNaN = function() {
+		return !this.s;
+	}, T.isNegative = function() {
+		return this.s < 0;
+	}, T.isPositive = function() {
+		return this.s > 0;
+	}, T.isZero = function() {
+		return !!this.c && this.c[0] == 0;
+	}, T.minus = function(e, t) {
+		var n, r, i, a, o = this, s = o.s;
+		if (e = new z(e, t), t = e.s, !s || !t) return new z(NaN);
+		if (s != t) return e.s = -t, o.plus(e);
+		var c = o.e / u, d = e.e / u, f = o.c, p = e.c;
+		if (!c || !d) {
+			if (!f || !p) return f ? (e.s = -t, e) : new z(p ? o : NaN);
+			if (!f[0] || !p[0]) return p[0] ? (e.s = -t, e) : new z(f[0] ? o : O == 3 ? -0 : 0);
+		}
+		if (c = g(c), d = g(d), f = f.slice(), s = c - d) {
+			for ((a = s < 0) ? (s = -s, i = f) : (d = c, i = p), i.reverse(), t = s; t--; i.push(0));
+			i.reverse();
+		} else for (r = (a = (s = f.length) < (t = p.length)) ? s : t, s = t = 0; t < r; t++) if (f[t] != p[t]) {
+			a = f[t] < p[t];
+			break;
+		}
+		if (a && (i = f, f = p, p = i, e.s = -e.s), t = (r = p.length) - (n = f.length), t > 0) for (; t--; f[n++] = 0);
+		for (t = l - 1; r > s;) {
+			if (f[--r] < p[r]) {
+				for (n = r; n && !f[--n]; f[n] = t);
+				--f[n], f[r] += l;
+			}
+			f[r] -= p[r];
+		}
+		for (; f[0] == 0; f.splice(0, 1), --d);
+		return f[0] ? G(e, f, d) : (e.s = O == 3 ? -1 : 1, e.c = [e.e = 0], e);
+	}, T.modulo = T.mod = function(e, n) {
+		var r, i, a = this;
+		return e = new z(e, n), !a.c || !e.s || e.c && !e.c[0] ? new z(NaN) : !e.c || a.c && !a.c[0] ? new z(a) : (F == 9 ? (i = e.s, e.s = 1, r = t(a, e, 0, 3), e.s = i, r.s *= i) : r = t(a, e, 0, F), e = a.minus(r.times(e)), !e.c[0] && F == 1 && (e.s = a.s), e);
+	}, T.multipliedBy = T.times = function(e, t) {
+		var n, r, i, a, o, s, c, d, f, m, h, _, v, y, b, x = this, S = x.c, C = (e = new z(e, t)).c;
+		if (!S || !C || !S[0] || !C[0]) return !x.s || !e.s || S && !S[0] && !C || C && !C[0] && !S ? e.c = e.e = e.s = null : (e.s *= x.s, !S || !C ? e.c = e.e = null : (e.c = [0], e.e = 0)), e;
+		for (r = g(x.e / u) + g(e.e / u), e.s *= x.s, c = S.length, m = C.length, c < m && (v = S, S = C, C = v, i = c, c = m, m = i), i = c + m, v = []; i--; v.push(0));
+		for (y = l, b = p, i = m; --i >= 0;) {
+			for (n = 0, h = C[i] % b, _ = C[i] / b | 0, o = c, a = i + o; a > i;) d = S[--o] % b, f = S[o] / b | 0, s = _ * d + f * h, d = h * d + s % b * b + v[a] + n, n = (d / y | 0) + (s / b | 0) + _ * f, v[a--] = d % y;
+			v[a] = n;
+		}
+		return n ? ++r : v.splice(0, 1), G(e, v, r);
+	}, T.negated = function() {
+		var e = new z(this);
+		return e.s = -e.s || null, e;
+	}, T.plus = function(e, t) {
+		var n, r = this, i = r.s;
+		if (e = new z(e, t), t = e.s, !i || !t) return new z(NaN);
+		if (i != t) return e.s = -t, r.minus(e);
+		var a = r.e / u, o = e.e / u, s = r.c, c = e.c;
+		if (!a || !o) {
+			if (!s || !c) return new z(i / 0);
+			if (!s[0] || !c[0]) return c[0] ? e : new z(s[0] ? r : i * 0);
+		}
+		if (a = g(a), o = g(o), s = s.slice(), i = a - o) {
+			for (i > 0 ? (o = a, n = c) : (i = -i, n = s), n.reverse(); i--; n.push(0));
+			n.reverse();
+		}
+		for (i = s.length, t = c.length, i - t < 0 && (n = c, c = s, s = n, t = i), i = 0; t;) i = (s[--t] = s[t] + c[t] + i) / l | 0, s[t] = l === s[t] ? 0 : s[t] % l;
+		return i && (s = [i].concat(s), ++o), G(e, s, o);
+	}, T.precision = T.sd = function(e, t) {
+		var n, r, i, a = this;
+		if (e != null && e !== !!e) return q(new z(a), y(e, 1, m), t == null ? O : y(t, 0, 8));
+		if (!(n = a.c)) return null;
+		if (i = n.length - 1, r = i * u + 1, i = n[i]) {
+			for (; i % 10 == 0; i /= 10, r--);
+			for (i = n[0]; i >= 10; i /= 10, r++);
+		}
+		return e && a.e + 1 > r && (r = a.e + 1), r;
+	}, T.shiftedBy = function(e) {
+		return this.times("1e" + y(e, -d, d));
+	}, T.squareRoot = T.sqrt = function() {
+		var e, n, r, i, a, o = this, s = o.c, c = o.s, l = o.e, u = D + 4, d = new z("0.5");
+		if (c !== 1 || !s || !s[0]) return new z(!c || c < 0 && (!s || s[0]) ? NaN : s ? o : Infinity);
+		if (c = Math.sqrt(+J(o)), c == 0 || c == Infinity ? (n = _(s), (n.length + l) % 2 == 0 && (n += "0"), c = Math.sqrt(+n), l = g((l + 1) / 2) - (l < 0 || l % 2), c == Infinity ? n = "5e" + l : (n = c.toExponential(), n = n.slice(0, n.indexOf("e") + 1) + l), r = new z(n)) : r = new z(c + ""), r.c[0]) {
+			for (l = r.e, c = l + u, c < 3 && (c = 0);;) if (a = r, r = d.times(a.plus(t(o, a, u, 1))), _(a.c).slice(0, c) === (n = _(r.c)).slice(0, c)) if (r.e < l && --c, n = n.slice(c - 3, c + 1), n == "9999" || !i && n == "4999") {
+				if (!i && (q(a, a.e + D + 2, 0), a.times(a).eq(o))) {
+					r = a;
+					break;
+				}
+				u += 4, c += 4, i = 1;
+			} else {
+				(!+n || !+n.slice(1) && n.charAt(0) == "5") && (q(r, r.e + D + 2, 1), e = !r.times(r).eq(o));
+				break;
+			}
+		}
+		return q(r, r.e + D + 1, O, e);
+	}, typeof BigInt == "function" && (T.toBigInt = function(e) {
+		var t = this;
+		return t.c ? BigInt(H(t, t.e + 1, e)) : null;
+	}), T.toExponential = function(e, t) {
+		return H(this, e == null ? e : y(e, 0, m) + 1, t, 1);
+	}, T.toFixed = function(e, t) {
+		return H(this, e == null ? e : y(e, -m, m) + this.e + 1, t);
+	}, T.toFormat = function(e, t, n) {
+		var r, i, a, o = this;
+		if (n == null) n = L, e != null && (t == null ? typeof e == "object" && !b(e) && (n = K(e), e = t = null) : typeof t == "object" && (n = K(t), t = null));
+		else if (typeof n != "object") throw Error(c + "Argument not an object: " + n);
+		else n = K(n);
+		if (e != null) if (b(e) && e.length <= 2) {
+			if (r = e[0], i = e[1], e = o.dp(), i != null && e > y(i, 0, m) && (e = i), r != null && y(r, 0, m) !== 0) {
+				if (i != null && r > i) throw Error(c + "Minimum must not exceed maximum");
+				e < r && (e = r);
+			}
+		} else y(e, -m, m);
+		if (a = o.toFixed(e, t), o.s < 0 && (a = a.slice(1)), o.c) {
+			var s, l = a.split("."), u = +n.groupSize, d = +n.secondaryGroupSize, f = n.groupSeparator || "", p = l[0], h = l[1], g = p.length;
+			if (d && (s = u, u = d, d = s, g -= s), u > 0 && g > 0) {
+				for (s = g % u || u, a = p.substr(0, s); s < g; s += u) a += f + p.substr(s, u);
+				d > 0 && (a += f + p.slice(s));
+			}
+			h && (s = +n.fractionGroupSize, s && (h = h.replace(RegExp("\\d{" + s + "}\\B", "g"), "$&" + (n.fractionGroupSeparator || ""))), a += (n.decimalSeparator || "") + h);
+		}
+		return (n.prefix || "") + (o.s < 0 ? n.negativeSign || "" : o.s > 0 && n.positiveSign || "") + a + (n.suffix || "");
+	}, T.toFraction = function(e) {
+		var n, r, i, a, o, s, l, d, p, m, h, g, v = this, y = v.c;
+		if (e != null && (l = new z(e), !l.isInteger() && (l.c || l.s !== 1) || l.lt(E))) throw Error(c + "Argument " + (l.isInteger() ? "out of range: " : "not an integer: ") + J(l));
+		if (!y) return [new z(v.s || 0), new z(0)];
+		for (n = new z(E), p = r = new z(E), i = d = new z(E), g = _(y), o = n.e = g.length - v.e - 1, n.c[0] = f[(s = o % u) < 0 ? u + s : s], e = !e || l.comparedTo(n) > 0 ? o > 0 ? n : p : l, s = M, M = Infinity, l = new z(g), d.c[0] = 0; m = t(l, n, 0, 1), a = r.plus(m.times(i)), a.comparedTo(e) != 1;) r = i, i = a, p = d.plus(m.times(a = p)), d = a, n = l.minus(m.times(a = n)), l = a;
+		return a = t(e.minus(r), i, 0, 1), d = d.plus(a.times(p)), r = r.plus(a.times(i)), d.s = p.s = v.s, o *= 2, h = t(p, i, o, O).minus(v).abs().comparedTo(t(d, r, o, O).minus(v).abs()) < 1 ? [p, i] : [d, r], M = s, h;
+	}, T.toNumber = function() {
+		return +J(this);
+	}, T.toObject = function() {
+		var e = this;
+		return {
+			c: e.c ? e.c.slice() : null,
+			e: e.e,
+			s: e.s
+		};
+	}, T.toPrecision = function(e, t) {
+		return H(this, e == null ? e : y(e, 1, m), t, 2);
+	}, T.toString = function(e) {
+		var t, r = this, i = r.s, a = r.e;
+		return a === null ? i ? (t = "Infinity", i < 0 && (t = "-" + t)) : t = "NaN" : (e == null ? t = a <= k || a >= A ? S(_(r.c), a) : C(_(r.c), a, "0") : (y(e, 2, R.length, "Base"), t = n(C(_(r.c), a, "0"), 10, e, i, !0)), i < 0 && r.c[0] && (t = "-" + t)), t;
+	}, T.valueOf = T.toJSON = function() {
+		return J(this);
+	}, T._isBigNumber = !0, e != null && z.set(e), z;
 }
-function H(_) {
-  var p = _ | 0;
-  return _ > 0 || _ === p ? p : p - 1;
+function g(e) {
+	var t = e | 0;
+	return e > 0 || e === t ? t : t - 1;
 }
-function q(_) {
-  for (var p, m, w = 1, h = _.length, g = _[0] + ""; w < h; ) {
-    for (p = _[w++] + "", m = E - p.length; m--; p = "0" + p) ;
-    g += p;
-  }
-  for (h = g.length; g.charCodeAt(--h) === 48; ) ;
-  return g.slice(0, h + 1 || 1);
+function _(e) {
+	for (var t, n, r = 1, i = e.length, a = e[0] + ""; r < i;) {
+		for (t = e[r++] + "", n = u - t.length; n--; t = "0" + t);
+		a += t;
+	}
+	for (i = a.length; a.charCodeAt(--i) === 48;);
+	return a.slice(0, i + 1 || 1);
 }
-function ee(_, p) {
-  var m, w, h = _.c, g = p.c, A = _.s, N = p.s, C = _.e, M = p.e;
-  if (!A || !N) return null;
-  if (m = h && !h[0], w = g && !g[0], m || w) return m ? w ? 0 : -N : A;
-  if (A != N) return A;
-  if (m = A < 0, w = C == M, !h || !g) return w ? 0 : !h ^ m ? 1 : -1;
-  if (!w) return C > M ^ m ? 1 : -1;
-  for (N = (C = h.length) < (M = g.length) ? C : M, A = 0; A < N; A++) if (h[A] != g[A]) return h[A] > g[A] ^ m ? 1 : -1;
-  return C == M ? 0 : C > M ^ m ? 1 : -1;
+function v(e, t) {
+	var n, r, i = e.c, a = t.c, o = e.s, s = t.s, c = e.e, l = t.e;
+	if (!o || !s) return null;
+	if (n = i && !i[0], r = a && !a[0], n || r) return n ? r ? 0 : -s : o;
+	if (o != s) return o;
+	if (n = o < 0, r = c == l, !i || !a) return r ? 0 : !i ^ n ? 1 : -1;
+	if (!r) return c > l ^ n ? 1 : -1;
+	for (s = (c = i.length) < (l = a.length) ? c : l, o = 0; o < s; o++) if (i[o] != a[o]) return i[o] > a[o] ^ n ? 1 : -1;
+	return c == l ? 0 : c > l ^ n ? 1 : -1;
 }
-function U(_, p, m, w) {
-  if (_ < p || _ > m || _ !== V(_))
-    throw Error(B + (w || "Argument") + (typeof _ == "number" ? _ < p || _ > m ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(_));
+function y(e, t, n, r) {
+	if (e < t || e > n || e !== s(e)) throw Error(c + (r || "Argument") + (typeof e == "number" ? e < t || e > n ? " out of range: " : " not an integer: " : " not a primitive number: ") + String(e));
+	return e;
 }
-function se(_) {
-  var p = _.c.length - 1;
-  return H(_.e / E) == p && _.c[p] % 2 != 0;
+function b(e) {
+	return {}.toString.call(e) == "[object Array]";
 }
-function oe(_, p) {
-  return (_.length > 1 ? _.charAt(0) + "." + _.slice(1) : _) + (p < 0 ? "e" : "e+") + p;
+function x(e) {
+	var t = e.c.length - 1;
+	return g(e.e / u) == t && e.c[t] % 2 != 0;
 }
-function W(_, p, m) {
-  var w, h;
-  if (p < 0) {
-    for (h = m + "."; ++p; h += m) ;
-    _ = h + _;
-  } else if (w = _.length, ++p > w) {
-    for (h = m, p -= w; --p; h += m) ;
-    _ += h;
-  } else p < w && (_ = _.slice(0, p) + "." + _.slice(p));
-  return _;
+function S(e, t) {
+	return (e.length > 1 ? e.charAt(0) + "." + e.slice(1) : e) + (t < 0 ? "e" : "e+") + t;
 }
-Ie();
-const Le = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-let Pe;
-function De() {
-  return Pe ||= Le.slice(0, -2) + "-_", Pe;
+function C(e, t, n) {
+	var r, i;
+	if (t < 0) {
+		for (i = n + "."; ++t; i += n);
+		e = i + e;
+	} else if (r = e.length, ++t > r) {
+		for (i = n, t -= r; --t; i += n);
+		e += i;
+	} else t < r && (e = e.slice(0, t) + "." + e.slice(t));
+	return e;
 }
-function Ce(_, p, m) {
-  let w = "", h = 0;
-  for (; h < _.length; ) {
-    const g = _[h++], A = _[h++], N = _[h++];
-    if (w += p[g >> 2], w += p[(g & 3) << 4 | (A || 0) >> 4], A == null || (w += p[(A & 15) << 2 | (N || 0) >> 6]), N == null)
-      break;
-    w += p[N & 63];
-  }
-  return w;
+//#endregion
+//#region ../../node_modules/.pnpm/@gera2ld+common@0.0.5/node_modules/@gera2ld/common/dist/index.js
+var w = "=", T = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/", E;
+function D() {
+	return E ||= T.slice(0, -2) + "-_", E;
 }
-function Be(_) {
-  return Ce(_, De(), !1);
+function O(e, t, n) {
+	let r = "", i = 0;
+	for (; i < e.length;) {
+		let a = e[i++], o = e[i++], s = e[i++];
+		if (r += t[a >> 2], r += t[(a & 3) << 4 | (o || 0) >> 4], o == null ? n && (r += w) : r += t[(o & 15) << 2 | (s || 0) >> 6], s == null) {
+			n && (r += w);
+			break;
+		}
+		r += t[s & 63];
+	}
+	return r;
 }
-function ke() {
-  return ye(8);
+function k(e) {
+	return O(e, D(), !1);
 }
-function Oe() {
-  return ye(64);
+new Uint8Array([13, 10]);
+//#endregion
+//#region src/util.ts
+function A() {
+	return e(8);
 }
-async function Ee(_) {
-  const p = "S256", m = await crypto.subtle.digest(
-    "SHA-256",
-    new TextEncoder().encode(_)
-  );
-  return {
-    codeChallenge: Be(new Uint8Array(m)),
-    codeChallengeMethod: p
-  };
+function j() {
+	return e(64);
 }
-class Ae {
-  constructor(p) {
-    this.options = p;
-  }
-  async getToken() {
-    const p = await this.options.storage.get("accessToken");
-    if (!p) throw new D(ne);
-    if (p.expiresAt > Date.now())
-      throw new D(ve);
-    return p.token;
-  }
+async function M(e) {
+	let t = await crypto.subtle.digest("SHA-256", new TextEncoder().encode(e));
+	return {
+		codeChallenge: k(new Uint8Array(t)),
+		codeChallengeMethod: "S256"
+	};
 }
-const Ne = class Ne extends Ae {
-  async buildAuthUrl() {
-    this.session = {
-      state: ke(),
-      codeVerifier: Oe()
-    };
-    const { codeChallenge: p, codeChallengeMethod: m } = await Ee(
-      this.session.codeVerifier
-    ), w = new URL("https://www.dropbox.com/oauth2/authorize");
-    return Object.entries({
-      client_id: this.options.clientId,
-      code_challenge: p,
-      code_challenge_method: m,
-      redirect_uri: this.options.redirectUrl,
-      response_type: "code",
-      token_access_type: "offline",
-      scope: this.options.scope,
-      state: this.session.state
-    }).forEach(([h, g]) => {
-      g && w.searchParams.set(h, g);
-    }), w.href;
-  }
-  async finishAuth(p) {
-    if (!this.session || this.session.state !== p.searchParams.get("state"))
-      throw new D(Y, "state doesn't match");
-    const m = p.searchParams.get("code");
-    if (!m) throw new D(Y, "Invalid code");
-    const w = new URLSearchParams();
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      code: m,
-      code_verifier: this.session.codeVerifier,
-      grant_type: "authorization_code",
-      redirect_uri: this.options.redirectUrl
-    }).forEach(([A, N]) => {
-      w.append(A, N);
-    });
-    const h = await fetch("https://api.dropbox.com/oauth2/token", {
-      method: "POST",
-      body: w
-    }), g = await h.json();
-    if (!h.ok) throw { status: h.status, data: g };
-    if (!g.refresh_token)
-      throw new D(Y, "Failed to get refresh_token");
-    return await this.options.storage.set("refreshToken", g.refresh_token), await this.options.storage.set("accessToken", {
-      token: g.access_token,
-      expiresAt: Date.now() + g.expires_in * 1e3
-    }), g.access_token;
-  }
-  async refreshToken() {
-    const p = new URLSearchParams(), m = await this.options.storage.get("refreshToken");
-    if (!m)
-      throw new D(ne, "Invalid refresh token");
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      grant_type: "refresh_token",
-      refresh_token: m
-    }).forEach(([g, A]) => {
-      p.append(g, A);
-    });
-    const w = await fetch("https://api.dropbox.com/oauth2/token", {
-      method: "POST",
-      body: p
-    }), h = await w.json();
-    if (!w.ok) throw { status: w.status, data: h };
-    return await this.options.storage.set("accessToken", {
-      token: h.access_token,
-      expiresAt: Date.now() + h.expires_in * 1e3
-    }), h.access_token;
-  }
-};
-Ne.Scopes = {
-  account: "account_info.read"
-};
-let ge = Ne;
-const Te = class Te extends Ae {
-  async buildAuthUrl() {
-    this.session = {
-      state: ke(),
-      codeVerifier: Oe()
-    };
-    const { codeChallenge: p, codeChallengeMethod: m } = await Ee(
-      this.session.codeVerifier
-    ), w = new URL("https://accounts.google.com/o/oauth2/v2/auth");
-    return Object.entries({
-      access_type: "offline",
-      client_id: this.options.clientId,
-      code_challenge: p,
-      code_challenge_method: m,
-      include_granted_scopes: "true",
-      prompt: "consent",
-      redirect_uri: this.options.redirectUrl,
-      response_type: "code",
-      scope: this.options.scope,
-      state: this.session.state
-    }).forEach(([h, g]) => {
-      g && w.searchParams.set(h, g);
-    }), w.href;
-  }
-  async finishAuth(p) {
-    if (!this.session || this.session.state !== p.searchParams.get("state"))
-      throw new D(Y, "state doesn't match");
-    const m = p.searchParams.get("code");
-    if (!m) throw new D(Y, "Invalid code");
-    const w = new URLSearchParams();
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      code: m,
-      code_verifier: this.session.codeVerifier,
-      grant_type: "authorization_code",
-      redirect_uri: this.options.redirectUrl
-    }).forEach(([A, N]) => {
-      w.append(A, N);
-    });
-    const h = await fetch("https://oauth2.googleapis.com/token", {
-      method: "POST",
-      body: w
-    }), g = await h.json();
-    if (!h.ok) throw { status: h.status, data: g };
-    if (!g.refresh_token)
-      throw new D(Y, "Failed to get refresh_token");
-    return await this.options.storage.set("refreshToken", g.refresh_token), await this.options.storage.set("accessToken", {
-      token: g.access_token,
-      expiresAt: Date.now() + g.expires_in * 1e3
-    }), g.access_token;
-  }
-  async refreshToken() {
-    const p = new URLSearchParams(), m = await this.options.storage.get("refreshToken");
-    if (!m)
-      throw new D(ne, "Invalid refresh token");
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      grant_type: "refresh_token",
-      refresh_token: m
-    }).forEach(([g, A]) => {
-      p.append(g, A);
-    });
-    const w = await fetch("https://oauth2.googleapis.com/token", {
-      method: "POST",
-      body: p
-    }), h = await w.json();
-    if (!w.ok) throw { status: w.status, data: h };
-    return await this.options.storage.set("accessToken", {
-      token: h.access_token,
-      expiresAt: Date.now() + h.expires_in * 1e3
-    }), h.access_token;
-  }
-};
-Te.Scopes = {
-  account: "https://www.googleapis.com/auth/userinfo.profile",
-  "drive.appdata": "https://www.googleapis.com/auth/drive.appdata",
-  imap: "https://mail.google.com/"
+//#endregion
+//#region src/providers/base.ts
+var N = class {
+	constructor(e) {
+		this.options = e;
+	}
+	async getToken() {
+		let e = await this.options.storage.get("accessToken");
+		if (!e) throw new i(3);
+		if (e.expiresAt < Date.now()) throw new i(1);
+		return e.token;
+	}
+}, P = class extends N {
+	static {
+		this.Scopes = { account: "account_info.read" };
+	}
+	async buildAuthUrl() {
+		this.session = {
+			state: A(),
+			codeVerifier: j()
+		};
+		let { codeChallenge: e, codeChallengeMethod: t } = await M(this.session.codeVerifier), n = new URL("https://www.dropbox.com/oauth2/authorize");
+		return Object.entries({
+			client_id: this.options.clientId,
+			code_challenge: e,
+			code_challenge_method: t,
+			redirect_uri: this.options.redirectUrl,
+			response_type: "code",
+			token_access_type: "offline",
+			scope: this.options.scope,
+			state: this.session.state
+		}).forEach(([e, t]) => {
+			t && n.searchParams.set(e, t);
+		}), n.href;
+	}
+	async finishAuth(e) {
+		if (!this.session || this.session.state !== e.searchParams.get("state")) throw new i(2, "state doesn't match");
+		let t = e.searchParams.get("code");
+		if (!t) throw new i(2, "Invalid code");
+		let n = new URLSearchParams();
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			code: t,
+			code_verifier: this.session.codeVerifier,
+			grant_type: "authorization_code",
+			redirect_uri: this.options.redirectUrl
+		}).forEach(([e, t]) => {
+			n.append(e, t);
+		});
+		let r = await fetch("https://api.dropbox.com/oauth2/token", {
+			method: "POST",
+			body: n
+		}), a = await r.json();
+		if (!r.ok) throw {
+			status: r.status,
+			data: a
+		};
+		if (!a.refresh_token) throw new i(2, "Failed to get refresh_token");
+		return await this.options.storage.set("refreshToken", {
+			token: a.refresh_token,
+			scope: a.scope
+		}), await this.options.storage.set("accessToken", {
+			token: a.access_token,
+			expiresAt: Date.now() + a.expires_in * 1e3
+		}), a.access_token;
+	}
+	async refreshToken() {
+		let e = new URLSearchParams(), t = await this.options.storage.get("refreshToken");
+		if (!t) throw new i(3, "Invalid refresh token");
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			grant_type: "refresh_token",
+			refresh_token: t.token
+		}).forEach(([t, n]) => {
+			e.append(t, n);
+		});
+		let n = await fetch("https://api.dropbox.com/oauth2/token", {
+			method: "POST",
+			body: e
+		}), r = await n.json();
+		if (!n.ok) throw {
+			status: n.status,
+			data: r
+		};
+		return await this.options.storage.set("accessToken", {
+			token: r.access_token,
+			expiresAt: Date.now() + r.expires_in * 1e3
+		}), r.access_token;
+	}
+}, F = class extends N {
+	static {
+		this.Scopes = {
+			account: "https://www.googleapis.com/auth/userinfo.profile",
+			"drive.appdata": "https://www.googleapis.com/auth/drive.appdata",
+			imap: "https://mail.google.com/"
+		};
+	}
+	async buildAuthUrl() {
+		this.session = {
+			state: A(),
+			codeVerifier: j()
+		};
+		let { codeChallenge: e, codeChallengeMethod: t } = await M(this.session.codeVerifier), n = new URL("https://accounts.google.com/o/oauth2/v2/auth");
+		return Object.entries({
+			access_type: "offline",
+			client_id: this.options.clientId,
+			code_challenge: e,
+			code_challenge_method: t,
+			include_granted_scopes: "true",
+			prompt: "consent",
+			redirect_uri: this.options.redirectUrl,
+			response_type: "code",
+			scope: this.options.scope,
+			state: this.session.state
+		}).forEach(([e, t]) => {
+			t && n.searchParams.set(e, t);
+		}), n.href;
+	}
+	async finishAuth(e) {
+		if (!this.session || this.session.state !== e.searchParams.get("state")) throw new i(2, "state doesn't match");
+		let t = e.searchParams.get("code");
+		if (!t) throw new i(2, "Invalid code");
+		let n = new URLSearchParams();
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			code: t,
+			code_verifier: this.session.codeVerifier,
+			grant_type: "authorization_code",
+			redirect_uri: this.options.redirectUrl
+		}).forEach(([e, t]) => {
+			n.append(e, t);
+		});
+		let r = await fetch("https://oauth2.googleapis.com/token", {
+			method: "POST",
+			body: n
+		}), a = await r.json();
+		if (!r.ok) throw {
+			status: r.status,
+			data: a
+		};
+		if (!a.refresh_token) throw new i(2, "Failed to get refresh_token");
+		return await this.options.storage.set("refreshToken", {
+			token: a.refresh_token,
+			scope: a.scope
+		}), await this.options.storage.set("accessToken", {
+			token: a.access_token,
+			expiresAt: Date.now() + a.expires_in * 1e3
+		}), a.access_token;
+	}
+	async refreshToken() {
+		let e = new URLSearchParams(), t = await this.options.storage.get("refreshToken");
+		if (!t) throw new i(3, "Invalid refresh token");
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			grant_type: "refresh_token",
+			refresh_token: t.token,
+			scope: this.options.scope
+		}).forEach(([t, n]) => {
+			n != null && e.append(t, n);
+		});
+		let n = await fetch("https://oauth2.googleapis.com/token", {
+			method: "POST",
+			body: e
+		}), r = await n.json();
+		if (!n.ok) throw {
+			status: n.status,
+			data: r
+		};
+		return await this.options.storage.set("accessToken", {
+			token: r.access_token,
+			expiresAt: Date.now() + r.expires_in * 1e3
+		}), r.access_token;
+	}
+}, I = class extends N {
+	static {
+		this.Scopes = {
+			imap: "offline_access https://outlook.office.com/IMAP.AccessAsUser.All",
+			onedrive: "openid profile Files.ReadWrite.AppFolder offline_access"
+		};
+	}
+	async buildAuthUrl() {
+		this.session = {
+			state: A(),
+			codeVerifier: j()
+		};
+		let { codeChallenge: e, codeChallengeMethod: t } = await M(this.session.codeVerifier), n = new URL("https://login.microsoftonline.com/common/oauth2/v2.0/authorize");
+		return Object.entries({
+			client_id: this.options.clientId,
+			code_challenge: e,
+			code_challenge_method: t,
+			redirect_uri: this.options.redirectUrl,
+			response_mode: "query",
+			response_type: "code",
+			scope: this.options.scope,
+			state: this.session.state
+		}).forEach(([e, t]) => {
+			t && n.searchParams.set(e, t);
+		}), n.href;
+	}
+	async finishAuth(e) {
+		if (!this.session || this.session.state !== e.searchParams.get("state")) throw new i(2, "state doesn't match");
+		let t = e.searchParams.get("code");
+		if (!t) throw new i(2, "Invalid code");
+		let n = new URLSearchParams();
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			code: t,
+			code_verifier: this.session.codeVerifier,
+			grant_type: "authorization_code",
+			redirect_uri: this.options.redirectUrl,
+			scope: this.options.scope
+		}).forEach(([e, t]) => {
+			t && n.append(e, t);
+		});
+		let r = await fetch("https://login.microsoftonline.com/common/oauth2/v2.0/token", {
+			method: "POST",
+			body: n
+		}), a = await r.json();
+		if (!r.ok) throw {
+			status: r.status,
+			data: a
+		};
+		if (!a.refresh_token) throw new i(2, "Failed to get refresh_token");
+		return await this.options.storage.set("refreshToken", {
+			token: a.refresh_token,
+			scope: a.scope
+		}), await this.options.storage.set("accessToken", {
+			token: a.access_token,
+			expiresAt: Date.now() + a.expires_in * 1e3
+		}), a.access_token;
+	}
+	async refreshToken() {
+		let e = new URLSearchParams(), t = await this.options.storage.get("refreshToken");
+		if (!t) throw new i(3, "Invalid refresh token");
+		Object.entries({
+			client_id: this.options.clientId,
+			client_secret: this.options.clientSecret,
+			grant_type: "refresh_token",
+			refresh_token: t.token,
+			scope: this.options.scope
+		}).forEach(([t, n]) => {
+			n && e.append(t, n);
+		});
+		let n = await fetch("https://login.microsoftonline.com/common/oauth2/v2.0/token", {
+			method: "POST",
+			body: e
+		}), r = await n.json();
+		if (!n.ok) throw {
+			status: n.status,
+			data: r
+		};
+		return await this.options.storage.set("accessToken", {
+			token: r.access_token,
+			expiresAt: Date.now() + r.expires_in * 1e3
+		}), r.access_token;
+	}
+}, L = {
+	dropbox: P,
+	google: F,
+	microsoft: I
 };
-let _e = Te;
-const Se = class Se extends Ae {
-  async buildAuthUrl() {
-    this.session = {
-      state: ke(),
-      codeVerifier: Oe()
-    };
-    const { codeChallenge: p, codeChallengeMethod: m } = await Ee(
-      this.session.codeVerifier
-    ), w = new URL(
-      "https://login.microsoftonline.com/common/oauth2/v2.0/authorize"
-    );
-    return Object.entries({
-      client_id: this.options.clientId,
-      code_challenge: p,
-      code_challenge_method: m,
-      redirect_uri: this.options.redirectUrl,
-      response_mode: "query",
-      response_type: "code",
-      scope: this.options.scope,
-      state: this.session.state
-    }).forEach(([h, g]) => {
-      g && w.searchParams.set(h, g);
-    }), w.href;
-  }
-  async finishAuth(p) {
-    if (!this.session || this.session.state !== p.searchParams.get("state"))
-      throw new D(Y, "state doesn't match");
-    const m = p.searchParams.get("code");
-    if (!m) throw new D(Y, "Invalid code");
-    const w = new URLSearchParams();
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      code: m,
-      code_verifier: this.session.codeVerifier,
-      grant_type: "authorization_code",
-      redirect_uri: this.options.redirectUrl,
-      scope: this.options.scope
-    }).forEach(([A, N]) => {
-      N && w.append(A, N);
-    });
-    const h = await fetch(
-      "https://login.microsoftonline.com/common/oauth2/v2.0/token",
-      {
-        method: "POST",
-        body: w
-      }
-    ), g = await h.json();
-    if (!h.ok) throw { status: h.status, data: g };
-    if (!g.refresh_token)
-      throw new D(Y, "Failed to get refresh_token");
-    return await this.options.storage.set("refreshToken", g.refresh_token), await this.options.storage.set("accessToken", {
-      token: g.access_token,
-      expiresAt: Date.now() + g.expires_in * 1e3
-    }), g.access_token;
-  }
-  async refreshToken() {
-    const p = new URLSearchParams(), m = await this.options.storage.get("refreshToken");
-    if (!m)
-      throw new D(ne, "Invalid refresh token");
-    Object.entries({
-      client_id: this.options.clientId,
-      client_secret: this.options.clientSecret,
-      grant_type: "refresh_token",
-      refresh_token: m,
-      scope: this.options.scope
-    }).forEach(([g, A]) => {
-      A && p.append(g, A);
-    });
-    const w = await fetch(
-      "https://login.microsoftonline.com/common/oauth2/v2.0/token",
-      {
-        method: "POST",
-        body: p
-      }
-    ), h = await w.json();
-    if (!w.ok) throw { status: w.status, data: h };
-    return await this.options.storage.set("accessToken", {
-      token: h.access_token,
-      expiresAt: Date.now() + h.expires_in * 1e3
-    }), h.access_token;
-  }
-};
-Se.Scopes = {
-  /** Ref: https://learn.microsoft.com/en-us/exchange/client-developer/legacy-protocols/how-to-authenticate-an-imap-pop-smtp-application-by-using-oauth */
-  imap: "offline_access https://outlook.office.com/IMAP.AccessAsUser.All",
-  onedrive: "openid profile Files.ReadWrite.AppFolder offline_access"
-};
-let me = Se;
-const Me = {
-  dropbox: ge,
-  google: _e,
-  microsoft: me
-};
-function Ge(_, p) {
-  return new Me[p.provider](_);
+//#endregion
+//#region src/index.ts
+function R(e, t) {
+	return new L[t.provider](e);
 }
-async function qe(_, p) {
-  let m;
-  try {
-    m = await _.getToken();
-  } catch (w) {
-    if (!(w instanceof D))
-      throw w;
-    switch (w.code) {
-      case ne: {
-        if (!p) throw w;
-        const h = await _.buildAuthUrl(), g = await p(h);
-        m = await _.finishAuth(new URL(g));
-        break;
-      }
-      case ve: {
-        m = await _.refreshToken();
-        break;
-      }
-      default:
-        throw w;
-    }
-  }
-  return m;
+async function z(e, t) {
+	let n;
+	try {
+		n = await e.getToken();
+	} catch (r) {
+		if (!(r instanceof i)) throw r;
+		switch (r.code) {
+			case 3: {
+				if (!t) throw r;
+				let i = await t(await e.buildAuthUrl());
+				n = await e.finishAuth(new URL(i));
+				break;
+			}
+			case 1:
+				n = await e.refreshToken();
+				break;
+			default: throw r;
+		}
+	}
+	return n;
 }
-export {
-  ge as DropboxAuthorizer,
-  _e as GoogleAuthorizer,
-  me as MicrosoftAuthorizer,
-  Y as OAUTH2_AUTH_ERROR,
-  ve as OAUTH2_NEED_REFRESH,
-  ne as OAUTH2_UNAUTHORIZED,
-  Ae as OAuth2Authorizer,
-  Me as OAuth2Authorizers,
-  D as OAuth2Error,
-  qe as ensureAccessToken,
-  Ge as getAuthorizer
-};
+//#endregion
+export { P as DropboxAuthorizer, F as GoogleAuthorizer, I as MicrosoftAuthorizer, n as OAUTH2_AUTH_ERROR, t as OAUTH2_NEED_REFRESH, r as OAUTH2_UNAUTHORIZED, N as OAuth2Authorizer, L as OAuth2Authorizers, i as OAuth2Error, z as ensureAccessToken, R as getAuthorizer };