@usync/oauth2 0.0.1

package/README.md

@@ -0,0 +1,7 @@
+# @usync/oauth2
+
+[![NPM](https://img.shields.io/npm/v/@usync/oauth2.svg)](https://npm.im/@usync/oauth2)
+![License](https://img.shields.io/npm/l/@usync/oauth2.svg)
+[![jsDocs.io](https://img.shields.io/badge/jsDocs.io-reference-blue)](https://www.jsdocs.io/package/@usync/oauth2)
+
+Handling OAuth2 login and generate access tokens.

package/dist/common.d.ts

@@ -0,0 +1,7 @@
+export declare const OAUTH2_NEED_REFRESH = 1;
+export declare const OAUTH2_AUTH_ERROR = 2;
+export declare const OAUTH2_UNAUTHORIZED = 3;
+export declare class OAuth2Error extends Error {
+    code: number;
+    constructor(code: number, message?: string);
+}

package/dist/index.d.ts

@@ -0,0 +1,7 @@
+import { OAuth2Authorizer } from './providers';
+import { IOAuth2Account, IOAuth2Options } from './types';
+export * from './common';
+export * from './providers';
+export * from './types';
+export declare function getAuthorizer(options: IOAuth2Options, auth: IOAuth2Account): import("./providers").DropboxAuthorizer | import("./providers").GoogleAuthorizer | import("./providers").MicrosoftAuthorizer;
+export declare function ensureAccessToken(authorizer: OAuth2Authorizer, handleOAuth2?: (url: string) => Promise<string>): Promise<string>;

package/dist/index.js

@@ -0,0 +1,963 @@
+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;
+}
+function H(_) {
+  var p = _ | 0;
+  return _ > 0 || _ === p ? p : p - 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 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 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 se(_) {
+  var p = _.c.length - 1;
+  return H(_.e / E) == p && _.c[p] % 2 != 0;
+}
+function oe(_, p) {
+  return (_.length > 1 ? _.charAt(0) + "." + _.slice(1) : _) + (p < 0 ? "e" : "e+") + p;
+}
+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 _;
+}
+Ie();
+const Le = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+let Pe;
+function De() {
+  return Pe ||= Le.slice(0, -2) + "-_", Pe;
+}
+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;
+}
+function Be(_) {
+  return Ce(_, De(), !1);
+}
+function ke() {
+  return ye(8);
+}
+function Oe() {
+  return ye(64);
+}
+async function Ee(_) {
+  const p = "S256", m = await crypto.subtle.digest(
+    "SHA-256",
+    new TextEncoder().encode(_)
+  );
+  return {
+    codeChallenge: Be(new Uint8Array(m)),
+    codeChallengeMethod: p
+  };
+}
+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;
+  }
+}
+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/"
+};
+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](_);
+}
+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;
+}
+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
+};

package/dist/providers/base.d.ts

@@ -0,0 +1,9 @@
+import { IOAuth2Options } from '../types';
+export declare abstract class OAuth2Authorizer {
+    protected options: IOAuth2Options;
+    abstract buildAuthUrl(): Promise<string>;
+    abstract finishAuth(url: URL): Promise<string>;
+    abstract refreshToken(): Promise<string>;
+    constructor(options: IOAuth2Options);
+    getToken(): Promise<string>;
+}

package/dist/providers/dropbox.d.ts

@@ -0,0 +1,13 @@
+import { OAuth2Authorizer } from './base.ts';
+export declare class DropboxAuthorizer extends OAuth2Authorizer {
+    private session;
+    /**
+     * Ref: https://www.dropbox.com/developers/documentation/http/documentation
+     */
+    static Scopes: {
+        account: string;
+    };
+    buildAuthUrl(): Promise<string>;
+    finishAuth(url: URL): Promise<string>;
+    refreshToken(): Promise<string>;
+}

package/dist/providers/google.d.ts

@@ -0,0 +1,18 @@
+import { OAuth2Authorizer } from './base.ts';
+/**
+ * Ref: https://developers.google.com/identity/protocols/oauth2/web-server
+ */
+export declare class GoogleAuthorizer extends OAuth2Authorizer {
+    private session;
+    /**
+     * Ref: https://developers.google.com/identity/protocols/oauth2/scopes
+     */
+    static Scopes: {
+        account: string;
+        'drive.appdata': string;
+        imap: string;
+    };
+    buildAuthUrl(): Promise<string>;
+    finishAuth(url: URL): Promise<string>;
+    refreshToken(): Promise<string>;
+}

package/dist/providers/index.d.ts

@@ -0,0 +1,10 @@
+import { DropboxAuthorizer } from './dropbox';
+import { GoogleAuthorizer } from './google';
+import { MicrosoftAuthorizer } from './microsoft';
+export * from './base';
+export { DropboxAuthorizer, GoogleAuthorizer, MicrosoftAuthorizer };
+export declare const OAuth2Authorizers: {
+    dropbox: typeof DropboxAuthorizer;
+    google: typeof GoogleAuthorizer;
+    microsoft: typeof MicrosoftAuthorizer;
+};

package/dist/providers/microsoft.d.ts

@@ -0,0 +1,15 @@
+import { OAuth2Authorizer } from './base.ts';
+/**
+ * Ref: https://learn.microsoft.com/en-us/entra/identity-platform/v2-oauth2-auth-code-flow
+ */
+export declare class MicrosoftAuthorizer extends OAuth2Authorizer {
+    private session;
+    static 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: string;
+        onedrive: string;
+    };
+    buildAuthUrl(): Promise<string>;
+    finishAuth(url: URL): Promise<string>;
+    refreshToken(): Promise<string>;
+}

package/dist/types.d.ts

@@ -0,0 +1,16 @@
+import { OAuth2Authorizers } from './providers';
+export interface IStorage {
+    get<T>(key: string): Promise<T | undefined>;
+    set<T>(key: string, value: T): Promise<void>;
+}
+export interface IOAuth2Options {
+    clientId: string;
+    clientSecret: string;
+    redirectUrl: string;
+    storage: IStorage;
+    scope?: string;
+}
+export interface IOAuth2Account {
+    provider: keyof typeof OAuth2Authorizers;
+    user: string;
+}

package/dist/util.d.ts

@@ -0,0 +1,13 @@
+export declare function getState(): string;
+/**
+ * Ref: https://datatracker.ietf.org/doc/html/rfc7636#section-4.1
+ * high-entropy cryptographic random STRING using the
+ * unreserved characters [A-Z] / [a-z] / [0-9] / "-" / "." / "_" / "~"
+ * from Section 2.3 of [RFC3986], with a minimum length of 43 characters
+ * and a maximum length of 128 characters.
+ */
+export declare function getCodeVerifier(): string;
+export declare function getCodeChallenge(codeVerifier: string): Promise<{
+    codeChallenge: string;
+    codeChallengeMethod: string;
+}>;

package/package.json

@@ -0,0 +1,27 @@
+{
+  "name": "@usync/oauth2",
+  "version": "0.0.1",
+  "type": "module",
+  "exports": {
+    ".": {
+      "import": "./dist/index.js",
+      "types": "./dist/index.d.ts"
+    }
+  },
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public",
+    "registry": "https://registry.npmjs.org/"
+  },
+  "dependencies": {
+    "nanoid": "^5.1.6"
+  },
+  "scripts": {
+    "clean": "del-cli dist tsconfig.tsbuildinfo",
+    "build:types": "tsc",
+    "build:js": "vite build",
+    "build": "pnpm clean && pnpm /^build:/"
+  }
+}