@aws-amplify/auth 4.6.15 → 4.6.17

package/CHANGELOG.md

@@ -3,6 +3,22 @@
 All notable changes to this project will be documented in this file.
 See [Conventional Commits](https://conventionalcommits.org) for commit guidelines.
 
+## [4.6.17](https://github.com/aws-amplify/amplify-js/compare/@aws-amplify/auth@4.6.16...@aws-amplify/auth@4.6.17) (2023-02-09)
+
+**Note:** Version bump only for package @aws-amplify/auth
+
+
+
+
+
+## [4.6.16](https://github.com/aws-amplify/amplify-js/compare/@aws-amplify/auth@4.6.15...@aws-amplify/auth@4.6.16) (2022-12-27)
+
+**Note:** Version bump only for package @aws-amplify/auth
+
+
+
+
+
 ## [4.6.15](https://github.com/aws-amplify/amplify-js/compare/@aws-amplify/auth@4.6.14...@aws-amplify/auth@4.6.15) (2022-12-14)
 
 **Note:** Version bump only for package @aws-amplify/auth

package/dist/aws-amplify-auth.js

@@ -4548,17 +4548,11 @@ var BI_RM = '0123456789abcdefghijklmnopqrstuvwxyz';
 var BI_RC = new Array();
 var rr, vv;
 rr = '0'.charCodeAt(0);
-for (vv = 0; vv <= 9; ++vv) {
-  BI_RC[rr++] = vv;
-}
+for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
 rr = 'a'.charCodeAt(0);
-for (vv = 10; vv < 36; ++vv) {
-  BI_RC[rr++] = vv;
-}
+for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
 rr = 'A'.charCodeAt(0);
-for (vv = 10; vv < 36; ++vv) {
-  BI_RC[rr++] = vv;
-}
+for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
 function int2char(n) {
   return BI_RM.charAt(n);
 }
@@ -4569,9 +4563,7 @@ function intAt(s, i) {
 
 // (protected) copy this to r
 function bnpCopyTo(r) {
-  for (var i = this.t - 1; i >= 0; --i) {
-    r[i] = this[i];
-  }
+  for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
   r.t = this.t;
   r.s = this.s;
 }
@@ -4620,9 +4612,7 @@ function bnpFromString(s, b) {
 // (protected) clamp off excess high words
 function bnpClamp() {
   var c = this.s & this.DM;
-  while (this.t > 0 && this[this.t - 1] == c) {
-    --this.t;
-  }
+  while (this.t > 0 && this[this.t - 1] == c) --this.t;
 }
 
 // (public) return string representation in given radix
@@ -4678,9 +4668,7 @@ function bnCompareTo(a) {
   var i = this.t;
   r = i - a.t;
   if (r != 0) return this.s < 0 ? -r : r;
-  while (--i >= 0) {
-    if ((r = this[i] - a[i]) != 0) return r;
-  }
+  while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;
   return 0;
 }
 
@@ -4720,21 +4708,15 @@ function bnBitLength() {
 // (protected) r = this << n*DB
 function bnpDLShiftTo(n, r) {
   var i;
-  for (i = this.t - 1; i >= 0; --i) {
-    r[i + n] = this[i];
-  }
-  for (i = n - 1; i >= 0; --i) {
-    r[i] = 0;
-  }
+  for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
+  for (i = n - 1; i >= 0; --i) r[i] = 0;
   r.t = this.t + n;
   r.s = this.s;
 }
 
 // (protected) r = this >> n*DB
 function bnpDRShiftTo(n, r) {
-  for (var i = n; i < this.t; ++i) {
-    r[i - n] = this[i];
-  }
+  for (var i = n; i < this.t; ++i) r[i - n] = this[i];
   r.t = Math.max(this.t - n, 0);
   r.s = this.s;
 }
@@ -4751,9 +4733,7 @@ function bnpLShiftTo(n, r) {
     r[i + ds + 1] = this[i] >> cbs | c;
     c = (this[i] & bm) << bs;
   }
-  for (i = ds - 1; i >= 0; --i) {
-    r[i] = 0;
-  }
+  for (i = ds - 1; i >= 0; --i) r[i] = 0;
   r[ds] = c;
   r.t = this.t + ds + 1;
   r.s = this.s;
@@ -4821,12 +4801,8 @@ function bnpMultiplyTo(a, r) {
     y = a.abs();
   var i = x.t;
   r.t = i + y.t;
-  while (--i >= 0) {
-    r[i] = 0;
-  }
-  for (i = 0; i < y.t; ++i) {
-    r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
-  }
+  while (--i >= 0) r[i] = 0;
+  for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
   r.s = 0;
   r.clamp();
   if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
@@ -4836,9 +4812,7 @@ function bnpMultiplyTo(a, r) {
 function bnpSquareTo(r) {
   var x = this.abs();
   var i = r.t = 2 * x.t;
-  while (--i >= 0) {
-    r[i] = 0;
-  }
+  while (--i >= 0) r[i] = 0;
   for (i = 0; i < x.t - 1; ++i) {
     var c = x.am(i, x[i], r, 2 * i, 0, 1);
     if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
@@ -4893,9 +4867,7 @@ function bnpDivRemTo(m, q, r) {
   BigInteger.ONE.dlShiftTo(ys, t);
   t.subTo(y, y);
   // "negative" y so we can replace sub with am later
-  while (y.t < ys) {
-    y[y.t++] = 0;
-  }
+  while (y.t < ys) y[y.t++] = 0;
   while (--j >= 0) {
     // Estimate quotient digit
     var qd = r[--i] == y0 ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
@@ -4903,9 +4875,7 @@ function bnpDivRemTo(m, q, r) {
       // Try it out
       y.dlShiftTo(j, t);
       r.subTo(t, r);
-      while (r[i] < --qd) {
-        r.subTo(t, r);
-      }
+      while (r[i] < --qd) r.subTo(t, r);
     }
   }
   if (q != null) {
@@ -5050,10 +5020,9 @@ function montRevert(x) {
 
 // x = x/R mod m (HAC 14.32)
 function montReduce(x) {
-  while (x.t <= this.mt2) {
-    // pad x so am has enough room later
-    x[x.t++] = 0;
-  }
+  while (x.t <= this.mt2)
+  // pad x so am has enough room later
+  x[x.t++] = 0;
   for (var i = 0; i < this.m.t; ++i) {
     // faster way of calculating u0 = x[i]*mp mod DV
     var j = x[i] & 0x7fff;
@@ -5370,13 +5339,13 @@ var Client = /*#__PURE__*/function () {
     var headers = {
       'Content-Type': 'application/x-amz-json-1.1',
       'X-Amz-Target': "AWSCognitoIdentityProviderService." + operation,
-      'X-Amz-User-Agent': _UserAgent__WEBPACK_IMPORTED_MODULE_1__["default"].prototype.userAgent
+      'X-Amz-User-Agent': _UserAgent__WEBPACK_IMPORTED_MODULE_1__["default"].prototype.userAgent,
+      'Cache-Control': 'no-store'
     };
     var options = Object.assign({}, this.fetchOptions, {
       headers: headers,
       method: 'POST',
       mode: 'cors',
-      cache: 'no-cache',
       body: JSON.stringify(params)
     });
     var response;
@@ -7384,8 +7353,8 @@ var CognitoUser = /*#__PURE__*/function () {
   _proto.isSessionRevocable = function isSessionRevocable(token) {
     if (token && typeof token.decodePayload === 'function') {
       try {
-        var _token$decodePayload = token.decodePayload(),
-          origin_jti = _token$decodePayload.origin_jti;
+        var _token$decodePayload2 = token.decodePayload(),
+          origin_jti = _token$decodePayload2.origin_jti;
         return !!origin_jti;
       } catch (err) {
         // Nothing to do, token doesnt have origin_jti claim
@@ -9914,9 +9883,7 @@ var __assign = undefined && undefined.__assign || function () {
   __assign = Object.assign || function (t) {
     for (var s, i = 1, n = arguments.length; i < n; i++) {
       s = arguments[i];
-      for (var p in s) {
-        if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
-      }
+      for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
     }
     return t;
   };
@@ -9977,60 +9944,58 @@ var __generator = undefined && undefined.__generator || function (thisArg, body)
   }
   function step(op) {
     if (f) throw new TypeError("Generator is already executing.");
-    while (_) {
-      try {
-        if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-        if (y = 0, t) op = [op[0] & 2, t.value];
-        switch (op[0]) {
-          case 0:
-          case 1:
+    while (_) try {
+      if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+      if (y = 0, t) op = [op[0] & 2, t.value];
+      switch (op[0]) {
+        case 0:
+        case 1:
+          t = op;
+          break;
+        case 4:
+          _.label++;
+          return {
+            value: op[1],
+            done: false
+          };
+        case 5:
+          _.label++;
+          y = op[1];
+          op = [0];
+          continue;
+        case 7:
+          op = _.ops.pop();
+          _.trys.pop();
+          continue;
+        default:
+          if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+            _ = 0;
+            continue;
+          }
+          if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+            _.label = op[1];
+            break;
+          }
+          if (op[0] === 6 && _.label < t[1]) {
+            _.label = t[1];
             t = op;
             break;
-          case 4:
-            _.label++;
-            return {
-              value: op[1],
-              done: false
-            };
-          case 5:
-            _.label++;
-            y = op[1];
-            op = [0];
-            continue;
-          case 7:
-            op = _.ops.pop();
-            _.trys.pop();
-            continue;
-          default:
-            if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
-              _ = 0;
-              continue;
-            }
-            if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
-              _.label = op[1];
-              break;
-            }
-            if (op[0] === 6 && _.label < t[1]) {
-              _.label = t[1];
-              t = op;
-              break;
-            }
-            if (t && _.label < t[2]) {
-              _.label = t[2];
-              _.ops.push(op);
-              break;
-            }
-            if (t[2]) _.ops.pop();
-            _.trys.pop();
-            continue;
-        }
-        op = body.call(thisArg, _);
-      } catch (e) {
-        op = [6, e];
-        y = 0;
-      } finally {
-        f = t = 0;
+          }
+          if (t && _.label < t[2]) {
+            _.label = t[2];
+            _.ops.push(op);
+            break;
+          }
+          if (t[2]) _.ops.pop();
+          _.trys.pop();
+          continue;
       }
+      op = body.call(thisArg, _);
+    } catch (e) {
+      op = [6, e];
+      y = 0;
+    } finally {
+      f = t = 0;
     }
     if (op[0] & 5) throw op[1];
     return {
@@ -10047,9 +10012,7 @@ var __read = undefined && undefined.__read || function (o, n) {
     ar = [],
     e;
   try {
-    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) {
-      ar.push(r.value);
-    }
+    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
   } catch (error) {
     e = {
       error: error
@@ -12578,9 +12541,7 @@ var __extends = undefined && undefined.__extends || function () {
     } instanceof Array && function (d, b) {
       d.__proto__ = b;
     } || function (d, b) {
-      for (var p in b) {
-        if (b.hasOwnProperty(p)) d[p] = b[p];
-      }
+      for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p];
     };
     return _extendStatics(d, b);
   };
@@ -12719,9 +12680,7 @@ var __assign = undefined && undefined.__assign || function () {
   __assign = Object.assign || function (t) {
     for (var s, i = 1, n = arguments.length; i < n; i++) {
       s = arguments[i];
-      for (var p in s) {
-        if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
-      }
+      for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];
     }
     return t;
   };
@@ -12782,60 +12741,58 @@ var __generator = undefined && undefined.__generator || function (thisArg, body)
   }
   function step(op) {
     if (f) throw new TypeError("Generator is already executing.");
-    while (_) {
-      try {
-        if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
-        if (y = 0, t) op = [op[0] & 2, t.value];
-        switch (op[0]) {
-          case 0:
-          case 1:
+    while (_) try {
+      if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+      if (y = 0, t) op = [op[0] & 2, t.value];
+      switch (op[0]) {
+        case 0:
+        case 1:
+          t = op;
+          break;
+        case 4:
+          _.label++;
+          return {
+            value: op[1],
+            done: false
+          };
+        case 5:
+          _.label++;
+          y = op[1];
+          op = [0];
+          continue;
+        case 7:
+          op = _.ops.pop();
+          _.trys.pop();
+          continue;
+        default:
+          if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
+            _ = 0;
+            continue;
+          }
+          if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
+            _.label = op[1];
+            break;
+          }
+          if (op[0] === 6 && _.label < t[1]) {
+            _.label = t[1];
             t = op;
             break;
-          case 4:
-            _.label++;
-            return {
-              value: op[1],
-              done: false
-            };
-          case 5:
-            _.label++;
-            y = op[1];
-            op = [0];
-            continue;
-          case 7:
-            op = _.ops.pop();
-            _.trys.pop();
-            continue;
-          default:
-            if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) {
-              _ = 0;
-              continue;
-            }
-            if (op[0] === 3 && (!t || op[1] > t[0] && op[1] < t[3])) {
-              _.label = op[1];
-              break;
-            }
-            if (op[0] === 6 && _.label < t[1]) {
-              _.label = t[1];
-              t = op;
-              break;
-            }
-            if (t && _.label < t[2]) {
-              _.label = t[2];
-              _.ops.push(op);
-              break;
-            }
-            if (t[2]) _.ops.pop();
-            _.trys.pop();
-            continue;
-        }
-        op = body.call(thisArg, _);
-      } catch (e) {
-        op = [6, e];
-        y = 0;
-      } finally {
-        f = t = 0;
+          }
+          if (t && _.label < t[2]) {
+            _.label = t[2];
+            _.ops.push(op);
+            break;
+          }
+          if (t[2]) _.ops.pop();
+          _.trys.pop();
+          continue;
       }
+      op = body.call(thisArg, _);
+    } catch (e) {
+      op = [6, e];
+      y = 0;
+    } finally {
+      f = t = 0;
     }
     if (op[0] & 5) throw op[1];
     return {
@@ -12852,9 +12809,7 @@ var __read = undefined && undefined.__read || function (o, n) {
     ar = [],
     e;
   try {
-    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) {
-      ar.push(r.value);
-    }
+    while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
   } catch (error) {
     e = {
       error: error
@@ -13131,9 +13086,7 @@ var OAuth = /** @class */function () {
     var result = '';
     var i = length;
     var chars = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';
-    for (; i > 0; --i) {
-      result += chars[Math.round(Math.random() * (chars.length - 1))];
-    }
+    for (; i > 0; --i) result += chars[Math.round(Math.random() * (chars.length - 1))];
     return result;
   };
   OAuth.prototype._generateChallenge = function (code) {