authhero 0.218.0 → 0.219.0

package/dist/authhero.mjs

@@ -372,10 +372,10 @@ class ma extends dc {
         return i ? (h.res = V, h.usedParams = this.getUsedParamsDetails(n), h) : V;
       }
       if (s) {
-        const V = Array.isArray(g), M = V ? [] : {}, G = V ? A : $;
+        const V = Array.isArray(g), M = V ? [] : {}, K = V ? A : $;
         for (const W in g)
           if (Object.prototype.hasOwnProperty.call(g, W)) {
-            const Z = `${G}${s}${W}`;
+            const Z = `${K}${s}${W}`;
             M[W] = this.translate(Z, {
               ...n,
               joinArrays: !1,
@@ -388,9 +388,9 @@ class ma extends dc {
       g = g.join(D), g && (g = this.extendTranslation(g, e, n, r));
     else {
       let V = !1, M = !1;
-      const G = n.count !== void 0 && !Ne(n.count), W = ma.hasDefaultValue(n), Z = G ? this.pluralResolver.getSuffix(d, n.count, n) : "", Y = n.ordinal && G ? this.pluralResolver.getSuffix(d, n.count, {
+      const K = n.count !== void 0 && !Ne(n.count), W = ma.hasDefaultValue(n), Z = K ? this.pluralResolver.getSuffix(d, n.count, n) : "", Y = n.ordinal && K ? this.pluralResolver.getSuffix(d, n.count, {
         ordinal: !1
-      }) : "", Se = G && !n.ordinal && n.count === 0, j = Se && n[`defaultValue${this.options.pluralSeparator}zero`] || n[`defaultValue${Z}`] || n[`defaultValue${Y}`] || n.defaultValue;
+      }) : "", Se = K && !n.ordinal && n.count === 0, j = Se && n[`defaultValue${this.options.pluralSeparator}zero`] || n[`defaultValue${Z}`] || n[`defaultValue${Y}`] || n.defaultValue;
       !this.isValidLookup(g) && W && (V = !0, g = j), this.isValidLookup(g) || (M = !0, g = a);
       const P = (n.missingKeyNoValueFallbackToKey || this.options.missingKeyNoValueFallbackToKey) && M ? void 0 : g, N = W && j !== g && this.options.updateMissing;
       if (M || V || N) {
@@ -407,17 +407,17 @@ class ma extends dc {
           for (let pe = 0; pe < L.length; pe++)
             k.push(L[pe]);
         else this.options.saveMissingTo === "all" ? k = this.languageUtils.toResolveHierarchy(n.lng || this.language) : k.push(n.lng || this.language);
-        const K = (pe, se, $e) => {
+        const G = (pe, se, $e) => {
           var ee;
           const Ce = W && $e !== g ? $e : P;
           this.options.missingKeyHandler ? this.options.missingKeyHandler(pe, u, se, Ce, N, n) : (ee = this.backendConnector) != null && ee.saveMissing && this.backendConnector.saveMissing(pe, u, se, Ce, N, n), this.emit("missingKey", pe, u, se, g);
         };
-        this.options.saveMissing && (this.options.saveMissingPlurals && G ? k.forEach((pe) => {
+        this.options.saveMissing && (this.options.saveMissingPlurals && K ? k.forEach((pe) => {
           const se = this.pluralResolver.getSuffixes(pe, n);
           Se && n[`defaultValue${this.options.pluralSeparator}zero`] && se.indexOf(`${this.options.pluralSeparator}zero`) < 0 && se.push(`${this.options.pluralSeparator}zero`), se.forEach(($e) => {
-            K([pe], a + $e, n[`defaultValue${$e}`] || j);
+            G([pe], a + $e, n[`defaultValue${$e}`] || j);
           });
-        }) : K(k, a, j));
+        }) : G(k, a, j));
       }
       g = this.extendTranslation(g, e, n, h, r), M && g === a && this.options.appendNamespaceToMissingKey && (g = `${u}:${a}`), (M || V) && this.options.parseMissingKeyHandler && (g = this.options.parseMissingKeyHandler(this.options.appendNamespaceToMissingKey ? `${u}:${a}` : a, V ? g : void 0));
     }
@@ -482,11 +482,11 @@ class ma extends dc {
       h.forEach((O) => {
         var D, x;
         this.isValidLookup(r) || (l = O, !nh[`${T[0]}-${O}`] && ((D = this.utils) != null && D.hasLoadedNamespace) && !((x = this.utils) != null && x.hasLoadedNamespace(l)) && (nh[`${T[0]}-${O}`] = !0, this.logger.warn(`key "${i}" for languages "${T.join(", ")}" won't get resolved as namespace "${l}" was not yet loaded`, "This means something IS WRONG in your setup. You access the t function before i18next.init / i18next.loadNamespace / i18next.changeLanguage was done. Wait for the callback or Promise to resolve before accessing it!!!")), T.forEach((q) => {
-          var G;
+          var K;
           if (this.isValidLookup(r)) return;
           a = q;
           const V = [p];
-          if ((G = this.i18nFormat) != null && G.addLookupKeys)
+          if ((K = this.i18nFormat) != null && K.addLookupKeys)
             this.i18nFormat.addLookupKeys(V, p, q, O, n);
           else {
             let W;
@@ -3187,9 +3187,9 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
         N(P);
       } else
         return new Promise(function(k, L) {
-          N(function(K, pe) {
-            if (K) {
-              L(K);
+          N(function(G, pe) {
+            if (G) {
+              L(G);
               return;
             }
             k(pe);
@@ -3201,7 +3201,7 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
       return Se(j, F);
     }, e.hash = function(j, F, P, N) {
       function k(L) {
-        typeof j == "string" && typeof F == "number" ? e.genSalt(F, function(K, pe) {
+        typeof j == "string" && typeof F == "number" ? e.genSalt(F, function(G, pe) {
           Se(j, pe, L, N);
         }) : typeof j == "string" && typeof F == "string" ? Se(j, F, L, N) : a(L.bind(this, Error("Illegal arguments: " + typeof j + ", " + typeof F)));
       }
@@ -3210,10 +3210,10 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
           throw Error("Illegal callback: " + typeof P);
         k(P);
       } else
-        return new Promise(function(L, K) {
+        return new Promise(function(L, G) {
           k(function(pe, se) {
             if (pe) {
-              K(pe);
+              G(pe);
               return;
             }
             L(se);
@@ -3239,8 +3239,8 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
           a(L.bind(this, null, !1));
           return;
         }
-        e.hash(j, F.substr(0, 29), function(K, pe) {
-          K ? L(K) : L(null, s(pe, F));
+        e.hash(j, F.substr(0, 29), function(G, pe) {
+          G ? L(G) : L(null, s(pe, F));
         }, N);
       }
       if (P) {
@@ -3248,10 +3248,10 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
           throw Error("Illegal callback: " + typeof P);
         k(P);
       } else
-        return new Promise(function(L, K) {
+        return new Promise(function(L, G) {
           k(function(pe, se) {
             if (pe) {
-              K(pe);
+              G(pe);
               return;
             }
             L(se);
@@ -3425,10 +3425,10 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
       return N.join("");
     }
     function g(j, F) {
-      var P = 0, N = j.length, k = 0, L = [], K, pe, se, $e, Ce, ee;
+      var P = 0, N = j.length, k = 0, L = [], G, pe, se, $e, Ce, ee;
       if (F <= 0)
         throw Error("Illegal len: " + F);
-      for (; P < N - 1 && k < F && (ee = j.charCodeAt(P++), K = ee < d.length ? d[ee] : -1, ee = j.charCodeAt(P++), pe = ee < d.length ? d[ee] : -1, !(K == -1 || pe == -1 || (Ce = K << 2 >>> 0, Ce |= (pe & 48) >> 4, L.push(p(Ce)), ++k >= F || P >= N) || (ee = j.charCodeAt(P++), se = ee < d.length ? d[ee] : -1, se == -1) || (Ce = (pe & 15) << 4 >>> 0, Ce |= (se & 60) >> 2, L.push(p(Ce)), ++k >= F || P >= N))); )
+      for (; P < N - 1 && k < F && (ee = j.charCodeAt(P++), G = ee < d.length ? d[ee] : -1, ee = j.charCodeAt(P++), pe = ee < d.length ? d[ee] : -1, !(G == -1 || pe == -1 || (Ce = G << 2 >>> 0, Ce |= (pe & 48) >> 4, L.push(p(Ce)), ++k >= F || P >= N) || (ee = j.charCodeAt(P++), se = ee < d.length ? d[ee] : -1, se == -1) || (Ce = (pe & 15) << 4 >>> 0, Ce |= (se & 60) >> 2, L.push(p(Ce)), ++k >= F || P >= N))); )
         ee = j.charCodeAt(P++), $e = ee < d.length ? d[ee] : -1, Ce = (se & 3) << 6 >>> 0, Ce |= $e, L.push(p(Ce)), ++k;
       var we = [];
       for (P = 0; P < k; P++)
@@ -3444,7 +3444,7 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
         }); N !== null || (N = F()) !== null; )
           N < 128 ? P(N & 127) : N < 2048 ? (P(N >> 6 & 31 | 192), P(N & 63 | 128)) : N < 65536 ? (P(N >> 12 & 15 | 224), P(N >> 6 & 63 | 128), P(N & 63 | 128)) : (P(N >> 18 & 7 | 240), P(N >> 12 & 63 | 128), P(N >> 6 & 63 | 128), P(N & 63 | 128)), N = null;
       }, j.decodeUTF8 = function(F, P) {
-        for (var N, k, L, K, pe = function(se) {
+        for (var N, k, L, G, pe = function(se) {
           se = se.slice(0, se.indexOf(null));
           var $e = Error(se.toString());
           throw $e.name = "TruncatedError", $e.bytes = se, $e;
@@ -3456,7 +3456,7 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
           else if ((N & 240) === 224)
             ((k = F()) === null || (L = F()) === null) && pe([N, k, L]), P((N & 15) << 12 | (k & 63) << 6 | L & 63);
           else if ((N & 248) === 240)
-            ((k = F()) === null || (L = F()) === null || (K = F()) === null) && pe([N, k, L, K]), P((N & 7) << 18 | (k & 63) << 12 | (L & 63) << 6 | K & 63);
+            ((k = F()) === null || (L = F()) === null || (G = F()) === null) && pe([N, k, L, G]), P((N & 7) << 18 | (k & 63) << 12 | (L & 63) << 6 | G & 63);
           else throw RangeError("Illegal starting byte: " + N);
       }, j.UTF16toUTF8 = function(F, P) {
         for (var N, k = null; (N = k !== null ? k : F()) !== null; ) {
@@ -4550,32 +4550,32 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
       1869963892
     ];
     function M(j, F, P, N) {
-      var k, L = j[F], K = j[F + 1];
-      return L ^= P[0], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[1], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[2], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[3], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[4], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[5], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[6], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[7], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[8], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[9], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[10], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[11], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[12], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[13], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[14], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], K ^= k ^ P[15], k = N[K >>> 24], k += N[256 | K >> 16 & 255], k ^= N[512 | K >> 8 & 255], k += N[768 | K & 255], L ^= k ^ P[16], j[F] = K ^ P[O + 1], j[F + 1] = L, j;
+      var k, L = j[F], G = j[F + 1];
+      return L ^= P[0], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[1], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[2], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[3], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[4], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[5], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[6], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[7], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[8], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[9], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[10], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[11], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[12], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[13], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[14], k = N[L >>> 24], k += N[256 | L >> 16 & 255], k ^= N[512 | L >> 8 & 255], k += N[768 | L & 255], G ^= k ^ P[15], k = N[G >>> 24], k += N[256 | G >> 16 & 255], k ^= N[512 | G >> 8 & 255], k += N[768 | G & 255], L ^= k ^ P[16], j[F] = G ^ P[O + 1], j[F + 1] = L, j;
     }
-    function G(j, F) {
+    function K(j, F) {
       for (var P = 0, N = 0; P < 4; ++P)
         N = N << 8 | j[F] & 255, F = (F + 1) % j.length;
       return { key: N, offp: F };
     }
     function W(j, F, P) {
-      for (var N = 0, k = [0, 0], L = F.length, K = P.length, pe, se = 0; se < L; se++)
-        pe = G(j, N), N = pe.offp, F[se] = F[se] ^ pe.key;
+      for (var N = 0, k = [0, 0], L = F.length, G = P.length, pe, se = 0; se < L; se++)
+        pe = K(j, N), N = pe.offp, F[se] = F[se] ^ pe.key;
       for (se = 0; se < L; se += 2)
         k = M(k, 0, F, P), F[se] = k[0], F[se + 1] = k[1];
-      for (se = 0; se < K; se += 2)
+      for (se = 0; se < G; se += 2)
         k = M(k, 0, F, P), P[se] = k[0], P[se + 1] = k[1];
     }
     function Z(j, F, P, N) {
-      for (var k = 0, L = [0, 0], K = P.length, pe = N.length, se, $e = 0; $e < K; $e++)
-        se = G(F, k), k = se.offp, P[$e] = P[$e] ^ se.key;
-      for (k = 0, $e = 0; $e < K; $e += 2)
-        se = G(j, k), k = se.offp, L[0] ^= se.key, se = G(j, k), k = se.offp, L[1] ^= se.key, L = M(L, 0, P, N), P[$e] = L[0], P[$e + 1] = L[1];
+      for (var k = 0, L = [0, 0], G = P.length, pe = N.length, se, $e = 0; $e < G; $e++)
+        se = K(F, k), k = se.offp, P[$e] = P[$e] ^ se.key;
+      for (k = 0, $e = 0; $e < G; $e += 2)
+        se = K(j, k), k = se.offp, L[0] ^= se.key, se = K(j, k), k = se.offp, L[1] ^= se.key, L = M(L, 0, P, N), P[$e] = L[0], P[$e + 1] = L[1];
       for ($e = 0; $e < pe; $e += 2)
-        se = G(j, k), k = se.offp, L[0] ^= se.key, se = G(j, k), k = se.offp, L[1] ^= se.key, L = M(L, 0, P, N), N[$e] = L[0], N[$e + 1] = L[1];
+        se = K(j, k), k = se.offp, L[0] ^= se.key, se = K(j, k), k = se.offp, L[1] ^= se.key, L = M(L, 0, P, N), N[$e] = L[0], N[$e + 1] = L[1];
     }
     function Y(j, F, P, N, k) {
-      var L = V.slice(), K = L.length, pe;
+      var L = V.slice(), G = L.length, pe;
       if (P < 4 || P > 31)
         if (pe = Error("Illegal number of rounds (4-31): " + P), N) {
           a(N.bind(this, pe));
@@ -4597,10 +4597,10 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
             ;
         else {
           for (Ce = 0; Ce < 64; Ce++)
-            for (ee = 0; ee < K >> 1; ee++)
+            for (ee = 0; ee < G >> 1; ee++)
               M(L, ee << 1, se, $e);
           var Xe = [];
-          for (Ce = 0; Ce < K; Ce++)
+          for (Ce = 0; Ce < G; Ce++)
             Xe.push((L[Ce] >> 24 & 255) >>> 0), Xe.push((L[Ce] >> 16 & 255) >>> 0), Xe.push((L[Ce] >> 8 & 255) >>> 0), Xe.push((L[Ce] & 255) >>> 0);
           if (N) {
             N(null, Xe);
@@ -4625,7 +4625,7 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
           return;
         } else
           throw k;
-      var L, K;
+      var L, G;
       if (F.charAt(0) !== "$" || F.charAt(1) !== "2")
         if (k = Error("Invalid salt version: " + F.substring(0, 2)), P) {
           a(P.bind(this, k));
@@ -4633,7 +4633,7 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
         } else
           throw k;
       if (F.charAt(2) === "$")
-        L = "\0", K = 3;
+        L = "\0", G = 3;
       else {
         if (L = F.charAt(2), L !== "a" && L !== "b" && L !== "y" || F.charAt(3) !== "$")
           if (k = Error("Invalid salt revision: " + F.substring(2, 4)), P) {
@@ -4641,15 +4641,15 @@ const ov = {}, av = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineP
             return;
           } else
             throw k;
-        K = 4;
+        G = 4;
       }
-      if (F.charAt(K + 2) > "$")
+      if (F.charAt(G + 2) > "$")
         if (k = Error("Missing salt rounds"), P) {
           a(P.bind(this, k));
           return;
         } else
           throw k;
-      var pe = parseInt(F.substring(K, K + 1), 10) * 10, se = parseInt(F.substring(K + 1, K + 2), 10), $e = pe + se, Ce = F.substring(K + 3, K + 25);
+      var pe = parseInt(F.substring(G, G + 1), 10) * 10, se = parseInt(F.substring(G + 1, G + 2), 10), $e = pe + se, Ce = F.substring(G + 3, G + 25);
       j += L >= "a" ? "\0" : "";
       var ee = l(j), we = g(Ce, A);
       function Un(Fe) {
@@ -6596,10 +6596,12 @@ async function Qb(t, e) {
     (V) => V.value
   );
   if (!p) {
-    const V = s.filter(
-      (G) => T.includes(G) && A.includes(G)
-    );
-    return { scopes: [
+    let V;
+    return s.length === 0 ? V = A.filter(
+      (K) => T.includes(K)
+    ) : V = s.filter(
+      (K) => T.includes(K) && A.includes(K)
+    ), { scopes: [
       .../* @__PURE__ */ new Set([...a, ...V])
     ], permissions: [] };
   }
@@ -6609,10 +6611,12 @@ async function Qb(t, e) {
     );
     return { scopes: a, permissions: V };
   }
-  const O = s.filter(
+  let O;
+  return s.length === 0 ? O = A.filter(
+    (V) => T.includes(V)
+  ) : O = s.filter(
     (V) => T.includes(V) && A.includes(V)
-  );
-  return { scopes: [
+  ), { scopes: [
     .../* @__PURE__ */ new Set([...a, ...O])
   ], permissions: [] };
 }
@@ -8523,12 +8527,12 @@ var kh;
       return ee(z) || (z = rt(z)), N(R, I, z);
     }
     e("hasMetadata", M);
-    function G(R, I, z) {
+    function K(R, I, z) {
       if (!Fe(I))
         throw new TypeError();
       return ee(z) || (z = rt(z)), k(R, I, z);
     }
-    e("hasOwnMetadata", G);
+    e("hasOwnMetadata", K);
     function W(R, I, z) {
       if (!Fe(I))
         throw new TypeError();
@@ -8538,7 +8542,7 @@ var kh;
     function Z(R, I, z) {
       if (!Fe(I))
         throw new TypeError();
-      return ee(z) || (z = rt(z)), K(R, I, z);
+      return ee(z) || (z = rt(z)), G(R, I, z);
     }
     e("getOwnMetadata", Z);
     function Y(R, I) {
@@ -8609,12 +8613,12 @@ var kh;
     function L(R, I, z) {
       var ne = k(R, I, z);
       if (ne)
-        return K(R, I, z);
+        return G(R, I, z);
       var ve = Bt(I);
       if (!we(ve))
         return L(R, ve, z);
     }
-    function K(R, I, z) {
+    function G(R, I, z) {
       var ne = _e(
         I,
         z,
@@ -19466,12 +19470,12 @@ function gl(t, e) {
         T[O] = async (...M) => {
           if (V)
             return await D.apply($, M);
-          const G = ex(
+          const K = ex(
             g,
             O,
             M,
             l
-          ), W = await n.get(G);
+          ), W = await n.get(K);
           if (W !== null)
             if (W && typeof W == "object" && "isCachedNull" in W) {
               const Y = W;
@@ -19481,13 +19485,13 @@ function gl(t, e) {
           const Z = await D.apply($, M);
           if (q >= 0)
             if (Z !== null)
-              await n.set(G, Z, q);
+              await n.set(K, Z, q);
             else {
               const Y = {
                 value: null,
                 isCachedNull: !0
               };
-              await n.set(G, Y, q);
+              await n.set(K, Y, q);
             }
           return Z;
         };
@@ -26021,17 +26025,17 @@ async function TE({
   response_type: p
 }) {
   const { env: h } = t, g = new URL(r), $ = `${g.protocol}//${g.host}`;
-  async function A(G = "Login required") {
+  async function A(K = "Login required") {
     const W = Ve(t, {
       type: qe.FAILED_SILENT_AUTH,
-      description: G
+      description: K
     });
     return await t.env.data.logs.create(e.tenant.id, W), t.html(
       Tu(
         $,
         JSON.stringify({
           error: "login_required",
-          error_description: G,
+          error_description: K,
           state: i
         })
       )
@@ -26200,7 +26204,7 @@ const IE = ["email", "sms", "Username-Password-Authentication"], OE = new be().o
     t.set("log", "authorize");
     const M = await as(e, n);
     t.set("client_id", M.client_id), t.set("tenant_id", M.tenant.id);
-    const G = {
+    const K = {
       redirect_uri: i.split("#")[0],
       // Remove fragment if present
       scope: s,
@@ -26222,13 +26226,13 @@ const IE = ["email", "sms", "Username-Password-Authentication"], OE = new be().o
       throw new E(403, {
         message: `Origin ${W} not allowed`
       });
-    if (G.redirect_uri) {
+    if (K.redirect_uri) {
       const F = M.callbacks || [];
-      if (t.var.host && (F.push(`${pl(t.env)}/*`), F.push(`${ft(t.env)}/*`)), !yf(G.redirect_uri, F, {
+      if (t.var.host && (F.push(`${pl(t.env)}/*`), F.push(`${ft(t.env)}/*`)), !yf(K.redirect_uri, F, {
         allowPathWildcards: !0
       }))
         throw new E(400, {
-          message: `Invalid redirect URI - ${G.redirect_uri}`
+          message: `Invalid redirect URI - ${K.redirect_uri}`
         });
     }
     const Z = Ii(
@@ -26259,16 +26263,16 @@ const IE = ["email", "sms", "Username-Password-Authentication"], OE = new be().o
         t,
         M,
         M.connections[0].name,
-        G
+        K
       );
     if (d && d !== "email")
-      return lg(t, M, d, G);
+      return lg(t, M, d, K);
     if (T) {
       const F = await CE(
         t,
         M.tenant.id,
         T,
-        G,
+        K,
         O
       );
       return F instanceof Response ? F : t.json(F);
@@ -26277,7 +26281,7 @@ const IE = ["email", "sms", "Username-Password-Authentication"], OE = new be().o
       ctx: t,
       client: M,
       auth0Client: D,
-      authParams: G,
+      authParams: K,
       session: Se || void 0,
       connection: d,
       login_hint: x
@@ -27992,8 +27996,8 @@ var Zs = "_hp", d8 = {
     if (n === 2 && (x.innerHTML = ""), (g || A) && T(x), !l && !a)
       return;
     let V = hi[M = x.getAttribute(q)] || (hi[M] = new Promise(
-      (G, W) => {
-        x.addEventListener("load", G), x.addEventListener("error", W);
+      (K, W) => {
+        x.addEventListener("load", K), x.addEventListener("error", W);
       }
     ));
     a && (V = V.then(a)), l && (V = V.catch(l)), V.catch(() => {
@@ -28002,8 +28006,8 @@ var Zs = "_hp", d8 = {
   if (i && d === "render") {
     const x = ca[t][0];
     if (e[x]) {
-      const q = e[x], V = hi[q] || (hi[q] = new Promise((M, G) => {
-        T(h), h.addEventListener("load", M), h.addEventListener("error", G);
+      const q = e[x], V = hi[q] || (hi[q] = new Promise((M, K) => {
+        T(h), h.addEventListener("load", M), h.addEventListener("error", K);
       }));
       $8(V);
     }
@@ -31642,7 +31646,7 @@ var $6 = {}, ri = {}, Oo = {}, bl = {};
       }, this.reduceActions[13] = function(c) {
         return new L(c[0], c[2]);
       }, this.reduceActions[15] = function(c) {
-        return new K(c[0], c[2]);
+        return new G(c[0], c[2]);
       }, this.reduceActions[16] = function(c) {
         return new pe(c[0], c[2]);
       }, this.reduceActions[18] = function(c) {
@@ -32357,13 +32361,13 @@ var $6 = {}, ri = {}, Oo = {}, bl = {};
       return "<Expression>";
     }, M.prototype.evaluate = function(c) {
       throw new Error("Could not evaluate expression.");
-    }, G.prototype = new M(), G.prototype.constructor = G, G.superclass = M.prototype;
-    function G(c) {
+    }, K.prototype = new M(), K.prototype.constructor = K, K.superclass = M.prototype;
+    function K(c) {
       arguments.length > 0 && this.init(c);
     }
-    G.prototype.init = function(c) {
+    K.prototype.init = function(c) {
       this.rhs = c;
-    }, W.prototype = new G(), W.prototype.constructor = W, W.superclass = G.prototype;
+    }, W.prototype = new K(), W.prototype.constructor = W, W.superclass = K.prototype;
     function W(c) {
       arguments.length > 0 && this.init(c);
     }
@@ -32461,15 +32465,15 @@ var $6 = {}, ri = {}, Oo = {}, bl = {};
       return this.lhs.evaluate(c).greaterthanorequal(this.rhs.evaluate(c));
     }, L.prototype.toString = function() {
       return "(" + this.lhs.toString() + " >= " + this.rhs.toString() + ")";
-    }, K.prototype = new Z(), K.prototype.constructor = K, K.superclass = Z.prototype;
-    function K(c, f) {
+    }, G.prototype = new Z(), G.prototype.constructor = G, G.superclass = Z.prototype;
+    function G(c, f) {
       arguments.length > 0 && this.init(c, f);
     }
-    K.prototype.init = function(c, f) {
-      K.superclass.init.call(this, c, f);
-    }, K.prototype.evaluate = function(c) {
+    G.prototype.init = function(c, f) {
+      G.superclass.init.call(this, c, f);
+    }, G.prototype.evaluate = function(c) {
       return this.lhs.evaluate(c).number().plus(this.rhs.evaluate(c).number());
-    }, K.prototype.toString = function() {
+    }, G.prototype.toString = function() {
       return "(" + this.lhs.toString() + " + " + this.rhs.toString() + ")";
     }, pe.prototype = new Z(), pe.prototype.constructor = pe, pe.superclass = Z.prototype;
     function pe(c, f) {
@@ -33808,7 +33812,7 @@ var $6 = {}, ri = {}, Oo = {}, bl = {};
         GreaterThanOperation: N,
         LessThanOrEqualOperation: k,
         GreaterThanOrEqualOperation: L,
-        PlusOperation: K,
+        PlusOperation: G,
         MinusOperation: pe,
         MultiplyOperation: se,
         DivOperation: $e,
@@ -33949,32 +33953,32 @@ Ae.assertIsDocumentFragmentNode = q6;
     return Array.isArray(M) && M.length > 0;
   }
   t.isArrayHasLength = r;
-  function i(M, G, W) {
-    return M.localName === G && (M.namespaceURI === W || W == null);
+  function i(M, K, W) {
+    return M.localName === K && (M.namespaceURI === W || W == null);
   }
-  function s(M, G, W, Z) {
-    return M.localName === G && (!M.namespaceURI && (Z == null ? void 0 : Z.namespaceURI) === W || W == null);
+  function s(M, K, W, Z) {
+    return M.localName === K && (!M.namespaceURI && (Z == null ? void 0 : Z.namespaceURI) === W || W == null);
   }
-  function a(M, G, W) {
+  function a(M, K, W) {
     for (let Z = 0; Z < M.attributes.length; Z++) {
       const Y = M.attributes[Z];
-      if (i(Y, G, W) || s(Y, G, W, M))
+      if (i(Y, K, W) || s(Y, K, W, M))
         return Y;
     }
     return null;
   }
   t.findAttr = a;
-  function l(M, G, W) {
+  function l(M, K, W) {
     const Z = M.documentElement ?? M, Y = [];
     for (let Se = 0; Se < Z.childNodes.length; Se++) {
       const j = Z.childNodes[Se];
-      n.isElementNode(j) && j.localName === G && (j.namespaceURI === W || W == null) && Y.push(j);
+      n.isElementNode(j) && j.localName === K && (j.namespaceURI === W || W == null) && Y.push(j);
     }
     return Y;
   }
   t.findChildren = l;
-  function u(M, G, W) {
-    return l(M, G, W);
+  function u(M, K, W) {
+    return l(M, K, W);
   }
   t.findChilds = u;
   const d = {
@@ -33991,13 +33995,13 @@ Ae.assertIsDocumentFragmentNode = q6;
     "\r": "&#xD;"
   };
   function h(M) {
-    return M.replace(/([&<"\r\n\t])/g, function(G, W) {
+    return M.replace(/([&<"\r\n\t])/g, function(K, W) {
       return d[W];
     });
   }
   t.encodeSpecialCharactersInAttribute = h;
   function g(M) {
-    return M.replace(/([&<>\r])/g, function(G, W) {
+    return M.replace(/([&<>\r])/g, function(K, W) {
       return p[W];
     });
   }
@@ -34015,53 +34019,53 @@ Ae.assertIsDocumentFragmentNode = q6;
     return Buffer.from(M.replace(/(\r\n|\r)/g, "").replace(/-----BEGIN [A-Z\x20]{1,48}-----\n?/, "").replace(/-----END [A-Z\x20]{1,48}-----\n?/, ""), "base64");
   }
   t.pemToDer = A;
-  function T(M, G) {
+  function T(M, K) {
     const W = Buffer.isBuffer(M) ? M.toString("base64").trim() : M.replace(/(\r\n|\r)/g, "").trim();
     if (t.PEM_FORMAT_REGEX.test(W))
       return $(W);
     if (t.BASE64_REGEX.test(W.replace(/ /g, ""))) {
-      if (G == null)
+      if (K == null)
         throw new Error("PEM label is required when DER is given.");
-      const Z = `-----BEGIN ${G}-----
+      const Z = `-----BEGIN ${K}-----
 ${W.replace(/ /g, "")}
------END ${G}-----`;
+-----END ${K}-----`;
       return $(Z);
     }
     throw new Error("Unknown DER format.");
   }
   t.derToPem = T;
-  function O(M, G = []) {
+  function O(M, K = []) {
     if (!n.isElementNode(M.parentNode))
-      return G;
+      return K;
     const W = M.parentNode;
     if (!W)
-      return G;
+      return K;
     if (W.attributes && W.attributes.length > 0)
       for (let Z = 0; Z < W.attributes.length; Z++) {
         const Y = W.attributes[Z];
-        Y && Y.nodeName && Y.nodeName.search(/^xmlns:?/) !== -1 && G.push({
+        Y && Y.nodeName && Y.nodeName.search(/^xmlns:?/) !== -1 && K.push({
           prefix: Y.nodeName.replace(/^xmlns:?/, ""),
           namespaceURI: Y.nodeValue || ""
         });
       }
-    return O(W, G);
+    return O(W, K);
   }
   function D(M) {
-    const G = M.attributes;
-    for (let W = 0; W < G.length; W++) {
-      const Z = G[W].nodeName;
+    const K = M.attributes;
+    for (let W = 0; W < K.length; W++) {
+      const Z = K[W].nodeName;
       if (Z.search(/^xmlns:?/) !== -1)
         return Z.replace(/^xmlns:?/, "");
     }
     return M.prefix || "";
   }
   function x(M) {
-    return M.every((G) => n.isElementNode(G));
+    return M.every((K) => n.isElementNode(K));
   }
-  function q(M, G, W) {
-    if (G == null)
+  function q(M, K, W) {
+    if (K == null)
       return [];
-    const Z = e.selectWithResolver(G, M, W);
+    const Z = e.selectWithResolver(K, M, W);
     if (!r(Z))
       return [];
     if (!x(Z))
@@ -34082,8 +34086,8 @@ ${W.replace(/ /g, "")}
     return j;
   }
   t.findAncestorNs = q;
-  function V(M, G) {
-    const W = Buffer.from(M, "base64"), Z = Buffer.from(G, "base64");
+  function V(M, K) {
+    const W = Buffer.from(M, "base64"), Z = Buffer.from(K, "base64");
     if (typeof W.equals == "function")
       return W.equals(Z);
     if (W.length !== Z.length)
@@ -37665,24 +37669,24 @@ function sS(t, e, n, r, i) {
   function s(L) {
     if (L > 65535) {
       L -= 65536;
-      var K = 55296 + (L >> 10), pe = 56320 + (L & 1023);
-      return String.fromCharCode(K, pe);
+      var G = 55296 + (L >> 10), pe = 56320 + (L & 1023);
+      return String.fromCharCode(G, pe);
     } else
       return String.fromCharCode(L);
   }
   function a(L) {
-    var K = L.slice(1, -1);
-    return Object.hasOwnProperty.call(n, K) ? n[K] : K.charAt(0) === "#" ? s(parseInt(K.substr(1).replace("x", "0x"))) : (i.error("entity not found:" + L), L);
+    var G = L.slice(1, -1);
+    return Object.hasOwnProperty.call(n, G) ? n[G] : G.charAt(0) === "#" ? s(parseInt(G.substr(1).replace("x", "0x"))) : (i.error("entity not found:" + L), L);
   }
   function l(L) {
     if (L > T) {
-      var K = t.substring(T, L).replace(/&#?\w+;/g, a);
-      g && u(T), r.characters(K, 0, L - T), T = L;
+      var G = t.substring(T, L).replace(/&#?\w+;/g, a);
+      g && u(T), r.characters(G, 0, L - T), T = L;
     }
   }
-  function u(L, K) {
-    for (; L >= p && (K = h.exec(t)); )
-      d = K.index, p = d + K[0].length, g.lineNumber++;
+  function u(L, G) {
+    for (; L >= p && (G = h.exec(t)); )
+      d = G.index, p = d + G[0].length, g.lineNumber++;
     g.columnNumber = L - d + 1;
   }
   for (var d = 0, p = 0, h = /.*(?:\r\n?|\n)|.*$/g, g = r.locator, $ = [{ currentNSMap: e }], A = {}, T = 0; ; ) {
@@ -37699,12 +37703,12 @@ function sS(t, e, n, r, i) {
         case "/":
           var j = t.indexOf(">", O + 3), q = t.substring(O + 2, j).replace(/[ \t\n\r]+$/g, ""), V = $.pop();
           j < 0 ? (q = t.substring(O + 2).replace(/[\s<].*/, ""), i.error("end tag name: " + q + " is not complete:" + V.tagName), j = O + 1 + q.length) : q.match(/\s</) && (q = q.replace(/[\s<].*/, ""), i.error("end tag name: " + q + " maybe not complete"), j = O + 1 + q.length);
-          var M = V.localNSMap, G = V.tagName == q, W = G || V.tagName && V.tagName.toLowerCase() == q.toLowerCase();
+          var M = V.localNSMap, K = V.tagName == q, W = K || V.tagName && V.tagName.toLowerCase() == q.toLowerCase();
           if (W) {
             if (r.endElement(V.uri, V.localName, q), M)
               for (var Z in M)
                 Object.prototype.hasOwnProperty.call(M, Z) && r.endPrefixMapping(Z);
-            G || i.fatalError("end tag name: " + q + " is not match the current start tagName:" + V.tagName);
+            K || i.fatalError("end tag name: " + q + " is not match the current start tagName:" + V.tagName);
           } else
             $.push(V);
           j++;
@@ -38624,34 +38628,34 @@ class Vn {
     let u;
     const d = ["append", "prepend", "before", "after"], p = n.prefix, h = n.attrs || {}, g = n.location || {}, $ = n.existingPrefixes || {};
     if (this.namespaceResolver = {
-      lookupNamespaceURI: function(G) {
-        return G ? $[G] : null;
+      lookupNamespaceURI: function(K) {
+        return K ? $[K] : null;
       }
     }, g.reference = g.reference || "/*", g.action = g.action || "append", d.indexOf(g.action) === -1) {
-      const G = new Error(`location.action option has an invalid action: ${g.action}, must be any of the following values: ${d.join(", ")}`);
+      const K = new Error(`location.action option has an invalid action: ${g.action}, must be any of the following values: ${d.join(", ")}`);
       if (i) {
-        i(G);
+        i(K);
         return;
       } else
-        throw G;
+        throw K;
     }
-    p ? (a += `:${p}`, u = `${p}:`) : u = "", Object.keys(h).forEach(function(G) {
-      G !== "xmlns" && G !== a && l.push(`${G}="${h[G]}"`);
+    p ? (a += `:${p}`, u = `${p}:`) : u = "", Object.keys(h).forEach(function(K) {
+      K !== "xmlns" && K !== a && l.push(`${K}="${h[K]}"`);
     }), l.push(`${a}="http://www.w3.org/2000/09/xmldsig#"`);
     let A = `<${u}Signature ${l.join(" ")}>`;
     A += this.createSignedInfo(s, p), A += this.getKeyInfo(p), A += `</${u}Signature>`, this.originalXmlWithIds = s.toString();
     let T = "";
-    Object.keys($).forEach(function(G) {
-      T += `xmlns:${G}="${$[G]}" `;
+    Object.keys($).forEach(function(K) {
+      T += `xmlns:${K}="${$[K]}" `;
     });
     const O = `<Dummy ${T}>${A}</Dummy>`, x = new Ir.DOMParser().parseFromString(O).documentElement.firstChild, q = Xt.select1(g.reference, s);
     if (!Ft.isNodeLike(q)) {
-      const G = new Error(`the following xpath cannot be used because it was not found: ${g.reference}`);
+      const K = new Error(`the following xpath cannot be used because it was not found: ${g.reference}`);
       if (i) {
-        i(G);
+        i(K);
         return;
       } else
-        throw G;
+        throw K;
     }
     if (g.action === "append")
       q.appendChild(x);
@@ -38669,16 +38673,16 @@ class Vn {
     this.signatureNode = x;
     const V = Re.findChildren(this.signatureNode, "SignedInfo");
     if (V.length === 0) {
-      const G = new Error("could not find SignedInfo element in the message");
+      const K = new Error("could not find SignedInfo element in the message");
       if (i) {
-        i(G);
+        i(K);
         return;
       } else
-        throw G;
+        throw K;
     }
     const M = V[0];
-    typeof i == "function" ? this.calculateSignatureValue(s, (G, W) => {
-      G ? i(G) : (this.signatureValue = W || "", x.insertBefore(this.createSignature(p), M.nextSibling), this.signatureXml = x.toString(), this.signedXml = s.toString(), i(null, this));
+    typeof i == "function" ? this.calculateSignatureValue(s, (K, W) => {
+      K ? i(K) : (this.signatureValue = W || "", x.insertBefore(this.createSignature(p), M.nextSibling), this.signatureXml = x.toString(), this.signedXml = s.toString(), i(null, this));
     }) : (this.calculateSignatureValue(s), x.insertBefore(this.createSignature(p), M.nextSibling), this.signatureXml = x.toString(), this.signedXml = s.toString());
   }
   getKeyInfo(e) {