Deployed the page to Github Pages.

node_modules/exponential-backoff/LICENSE

@@ -0,0 +1,202 @@
+
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.

node_modules/exponential-backoff/README.md

@@ -0,0 +1,89 @@
+# exponential-backoff
+
+A utility that allows retrying a function with an exponential delay between attempts.
+
+## Installation
+
+```
+npm i exponential-backoff
+```
+
+## Usage
+
+The `backOff<T>` function takes a promise-returning function to retry, and an optional `BackOffOptions` object. It returns a `Promise<T>`.
+
+```ts
+function backOff<T>(
+  request: () => Promise<T>,
+  options?: BackOffOptions
+): Promise<T>;
+```
+
+Here is an example retrying a function that calls a hypothetical weather endpoint:
+
+```js
+import { backOff } from "exponential-backoff";
+
+function getWeather() {
+  return fetch("weather-endpoint");
+}
+
+async function main() {
+  try {
+    const response = await backOff(() => getWeather());
+    // process response
+  } catch (e) {
+    // handle error
+  }
+}
+
+main();
+```
+
+Migrating across major versions? Here are our [breaking changes](https://github.com/coveo/exponential-backoff/tree/master/doc/migration-guide.md).
+
+### `BackOffOptions`
+
+- `delayFirstAttempt?: boolean`
+
+  Decides whether the `startingDelay` should be applied before the first call. If `false`, the first call will occur without a delay.
+
+  Default value is `false`.
+
+- `jitter?: JitterType | string`
+
+  Decides whether a [jitter](https://aws.amazon.com/blogs/architecture/exponential-backoff-and-jitter/) should be applied to the delay. Possible values are `full` and `none`.
+
+  Default value is `none`.
+
+- `maxDelay?: number`
+
+  The maximum delay, in milliseconds, between two consecutive attempts.
+
+  Default value is `Infinity`.
+
+- `numOfAttempts?: number`
+
+  The maximum number of times to attempt the function.
+
+  Default value is `10`.
+
+  Minimum value is `1`.
+
+- `retry?: (e: any, attemptNumber: number) => boolean | Promise<boolean>`
+
+  The `retry` function can be used to run logic after every failed attempt (e.g. logging a message, assessing the last error, etc.). It is called with the last error and the upcoming attempt number. Returning `true` will retry the function as long as the `numOfAttempts` has not been exceeded. Returning `false` will end the execution.
+
+  Default value is a function that always returns `true`.
+
+- `startingDelay?: number`
+
+  The delay, in milliseconds, before executing the function for the first time.
+
+  Default value is `100` ms.
+
+- `timeMultiple?: number`
+
+  The `startingDelay` is multiplied by the `timeMultiple` to increase the delay between reattempts.
+
+  Default value is `2`.

node_modules/exponential-backoff/dist/backoff.d.ts

@@ -0,0 +1,3 @@
+import { IBackOffOptions, BackoffOptions } from "./options";
+export { BackoffOptions, IBackOffOptions };
+export declare function backOff<T>(request: () => Promise<T>, options?: BackoffOptions): Promise<T>;

node_modules/exponential-backoff/dist/backoff.js

@@ -0,0 +1,118 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    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: 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 (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var options_1 = require("./options");
+var delay_factory_1 = require("./delay/delay.factory");
+function backOff(request, options) {
+    if (options === void 0) { options = {}; }
+    return __awaiter(this, void 0, void 0, function () {
+        var sanitizedOptions, backOff;
+        return __generator(this, function (_a) {
+            switch (_a.label) {
+                case 0:
+                    sanitizedOptions = options_1.getSanitizedOptions(options);
+                    backOff = new BackOff(request, sanitizedOptions);
+                    return [4 /*yield*/, backOff.execute()];
+                case 1: return [2 /*return*/, _a.sent()];
+            }
+        });
+    });
+}
+exports.backOff = backOff;
+var BackOff = /** @class */ (function () {
+    function BackOff(request, options) {
+        this.request = request;
+        this.options = options;
+        this.attemptNumber = 0;
+    }
+    BackOff.prototype.execute = function () {
+        return __awaiter(this, void 0, void 0, function () {
+            var e_1, shouldRetry;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        if (!!this.attemptLimitReached) return [3 /*break*/, 7];
+                        _a.label = 1;
+                    case 1:
+                        _a.trys.push([1, 4, , 6]);
+                        return [4 /*yield*/, this.applyDelay()];
+                    case 2:
+                        _a.sent();
+                        return [4 /*yield*/, this.request()];
+                    case 3: return [2 /*return*/, _a.sent()];
+                    case 4:
+                        e_1 = _a.sent();
+                        this.attemptNumber++;
+                        return [4 /*yield*/, this.options.retry(e_1, this.attemptNumber)];
+                    case 5:
+                        shouldRetry = _a.sent();
+                        if (!shouldRetry || this.attemptLimitReached) {
+                            throw e_1;
+                        }
+                        return [3 /*break*/, 6];
+                    case 6: return [3 /*break*/, 0];
+                    case 7: throw new Error("Something went wrong.");
+                }
+            });
+        });
+    };
+    Object.defineProperty(BackOff.prototype, "attemptLimitReached", {
+        get: function () {
+            return this.attemptNumber >= this.options.numOfAttempts;
+        },
+        enumerable: true,
+        configurable: true
+    });
+    BackOff.prototype.applyDelay = function () {
+        return __awaiter(this, void 0, void 0, function () {
+            var delay;
+            return __generator(this, function (_a) {
+                switch (_a.label) {
+                    case 0:
+                        delay = delay_factory_1.DelayFactory(this.options, this.attemptNumber);
+                        return [4 /*yield*/, delay.apply()];
+                    case 1:
+                        _a.sent();
+                        return [2 /*return*/];
+                }
+            });
+        });
+    };
+    return BackOff;
+}());
+//# sourceMappingURL=backoff.js.map

node_modules/exponential-backoff/dist/backoff.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"backoff.js","sourceRoot":"","sources":["../src/backoff.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,qCAImB;AACnB,uDAAqD;AAIrD,SAAsB,OAAO,CAC3B,OAAyB,EACzB,OAA4B;IAA5B,wBAAA,EAAA,YAA4B;;;;;;oBAEtB,gBAAgB,GAAG,6BAAmB,CAAC,OAAO,CAAC,CAAC;oBAChD,OAAO,GAAG,IAAI,OAAO,CAAC,OAAO,EAAE,gBAAgB,CAAC,CAAC;oBAEhD,qBAAM,OAAO,CAAC,OAAO,EAAE,EAAA;wBAA9B,sBAAO,SAAuB,EAAC;;;;CAChC;AARD,0BAQC;AAED;IAGE,iBACU,OAAyB,EACzB,OAAwB;QADxB,YAAO,GAAP,OAAO,CAAkB;QACzB,YAAO,GAAP,OAAO,CAAiB;QAJ1B,kBAAa,GAAG,CAAC,CAAC;IAKvB,CAAC;IAES,yBAAO,GAApB;;;;;;6BACS,CAAC,IAAI,CAAC,mBAAmB;;;;wBAE5B,qBAAM,IAAI,CAAC,UAAU,EAAE,EAAA;;wBAAvB,SAAuB,CAAC;wBACjB,qBAAM,IAAI,CAAC,OAAO,EAAE,EAAA;4BAA3B,sBAAO,SAAoB,EAAC;;;wBAE5B,IAAI,CAAC,aAAa,EAAE,CAAC;wBACD,qBAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAC,EAAE,IAAI,CAAC,aAAa,CAAC,EAAA;;wBAA7D,WAAW,GAAG,SAA+C;wBAEnE,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,mBAAmB,EAAE;4BAC5C,MAAM,GAAC,CAAC;yBACT;;;4BAIL,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;;;;KAC1C;IAED,sBAAY,wCAAmB;aAA/B;YACE,OAAO,IAAI,CAAC,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC;QAC1D,CAAC;;;OAAA;IAEa,4BAAU,GAAxB;;;;;;wBACQ,KAAK,GAAG,4BAAY,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;wBAC7D,qBAAM,KAAK,CAAC,KAAK,EAAE,EAAA;;wBAAnB,SAAmB,CAAC;;;;;KACrB;IACH,cAAC;AAAD,CAAC,AAlCD,IAkCC"}

node_modules/exponential-backoff/dist/delay/always/always.delay.d.ts

@@ -0,0 +1,3 @@
+import { Delay } from "../delay.base";
+export declare class AlwaysDelay extends Delay {
+}

node_modules/exponential-backoff/dist/delay/always/always.delay.js

@@ -0,0 +1,25 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var delay_base_1 = require("../delay.base");
+var AlwaysDelay = /** @class */ (function (_super) {
+    __extends(AlwaysDelay, _super);
+    function AlwaysDelay() {
+        return _super !== null && _super.apply(this, arguments) || this;
+    }
+    return AlwaysDelay;
+}(delay_base_1.Delay));
+exports.AlwaysDelay = AlwaysDelay;
+//# sourceMappingURL=always.delay.js.map

node_modules/exponential-backoff/dist/delay/always/always.delay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"always.delay.js","sourceRoot":"","sources":["../../../src/delay/always/always.delay.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AAAA,4CAAsC;AAEtC;IAAiC,+BAAK;IAAtC;;IAAwC,CAAC;IAAD,kBAAC;AAAD,CAAC,AAAzC,CAAiC,kBAAK,GAAG;AAA5B,kCAAW"}

node_modules/exponential-backoff/dist/delay/delay.base.d.ts

@@ -0,0 +1,12 @@
+import { IDelay } from "./delay.interface";
+import { IBackOffOptions } from "../options";
+export declare abstract class Delay implements IDelay {
+    private options;
+    protected attempt: number;
+    constructor(options: IBackOffOptions);
+    apply(): Promise<unknown>;
+    setAttemptNumber(attempt: number): void;
+    private readonly jitteredDelay;
+    private readonly delay;
+    protected readonly numOfDelayedAttempts: number;
+}

node_modules/exponential-backoff/dist/delay/delay.base.js

@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var jitter_factory_1 = require("../jitter/jitter.factory");
+var Delay = /** @class */ (function () {
+    function Delay(options) {
+        this.options = options;
+        this.attempt = 0;
+    }
+    Delay.prototype.apply = function () {
+        var _this = this;
+        return new Promise(function (resolve) { return setTimeout(resolve, _this.jitteredDelay); });
+    };
+    Delay.prototype.setAttemptNumber = function (attempt) {
+        this.attempt = attempt;
+    };
+    Object.defineProperty(Delay.prototype, "jitteredDelay", {
+        get: function () {
+            var jitter = jitter_factory_1.JitterFactory(this.options);
+            return jitter(this.delay);
+        },
+        enumerable: true,
+        configurable: true
+    });
+    Object.defineProperty(Delay.prototype, "delay", {
+        get: function () {
+            var constant = this.options.startingDelay;
+            var base = this.options.timeMultiple;
+            var power = this.numOfDelayedAttempts;
+            var delay = constant * Math.pow(base, power);
+            return Math.min(delay, this.options.maxDelay);
+        },
+        enumerable: true,
+        configurable: true
+    });
+    Object.defineProperty(Delay.prototype, "numOfDelayedAttempts", {
+        get: function () {
+            return this.attempt;
+        },
+        enumerable: true,
+        configurable: true
+    });
+    return Delay;
+}());
+exports.Delay = Delay;
+//# sourceMappingURL=delay.base.js.map

node_modules/exponential-backoff/dist/delay/delay.base.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delay.base.js","sourceRoot":"","sources":["../../src/delay/delay.base.ts"],"names":[],"mappings":";;AAEA,2DAAyD;AAEzD;IAEE,eAAoB,OAAwB;QAAxB,YAAO,GAAP,OAAO,CAAiB;QADlC,YAAO,GAAG,CAAC,CAAC;IACyB,CAAC;IAEzC,qBAAK,GAAZ;QAAA,iBAEC;QADC,OAAO,IAAI,OAAO,CAAC,UAAA,OAAO,IAAI,OAAA,UAAU,CAAC,OAAO,EAAE,KAAI,CAAC,aAAa,CAAC,EAAvC,CAAuC,CAAC,CAAC;IACzE,CAAC;IAEM,gCAAgB,GAAvB,UAAwB,OAAe;QACrC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACzB,CAAC;IAED,sBAAY,gCAAa;aAAzB;YACE,IAAM,MAAM,GAAG,8BAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC3C,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5B,CAAC;;;OAAA;IAED,sBAAY,wBAAK;aAAjB;YACE,IAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC;YAC5C,IAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC;YACvC,IAAM,KAAK,GAAG,IAAI,CAAC,oBAAoB,CAAC;YACxC,IAAM,KAAK,GAAG,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAE/C,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC;;;OAAA;IAED,sBAAc,uCAAoB;aAAlC;YACE,OAAO,IAAI,CAAC,OAAO,CAAC;QACtB,CAAC;;;OAAA;IACH,YAAC;AAAD,CAAC,AA7BD,IA6BC;AA7BqB,sBAAK"}

node_modules/exponential-backoff/dist/delay/delay.factory.d.ts

@@ -0,0 +1,3 @@
+import { IBackOffOptions } from "../options";
+import { IDelay } from "./delay.interface";
+export declare function DelayFactory(options: IBackOffOptions, attempt: number): IDelay;

node_modules/exponential-backoff/dist/delay/delay.factory.js

@@ -0,0 +1,17 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var skip_first_delay_1 = require("./skip-first/skip-first.delay");
+var always_delay_1 = require("./always/always.delay");
+function DelayFactory(options, attempt) {
+    var delay = initDelayClass(options);
+    delay.setAttemptNumber(attempt);
+    return delay;
+}
+exports.DelayFactory = DelayFactory;
+function initDelayClass(options) {
+    if (!options.delayFirstAttempt) {
+        return new skip_first_delay_1.SkipFirstDelay(options);
+    }
+    return new always_delay_1.AlwaysDelay(options);
+}
+//# sourceMappingURL=delay.factory.js.map

node_modules/exponential-backoff/dist/delay/delay.factory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delay.factory.js","sourceRoot":"","sources":["../../src/delay/delay.factory.ts"],"names":[],"mappings":";;AACA,kEAA+D;AAC/D,sDAAoD;AAGpD,SAAgB,YAAY,CAAC,OAAwB,EAAE,OAAe;IAClE,IAAM,KAAK,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACtC,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;IAChC,OAAO,KAAK,CAAC;AACjB,CAAC;AAJD,oCAIC;AAED,SAAS,cAAc,CAAC,OAAwB;IAC5C,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE;QAC5B,OAAO,IAAI,iCAAc,CAAC,OAAO,CAAC,CAAC;KACtC;IAED,OAAO,IAAI,0BAAW,CAAC,OAAO,CAAC,CAAC;AACpC,CAAC"}

node_modules/exponential-backoff/dist/delay/delay.interface.d.ts

@@ -0,0 +1,4 @@
+export interface IDelay {
+    apply: () => Promise<unknown>;
+    setAttemptNumber: (attempt: number) => void;
+}

node_modules/exponential-backoff/dist/delay/delay.interface.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=delay.interface.js.map

node_modules/exponential-backoff/dist/delay/delay.interface.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"delay.interface.js","sourceRoot":"","sources":["../../src/delay/delay.interface.ts"],"names":[],"mappings":""}

node_modules/exponential-backoff/dist/delay/skip-first/skip-first.delay.d.ts

@@ -0,0 +1,6 @@
+import { Delay } from "../delay.base";
+export declare class SkipFirstDelay extends Delay {
+    apply(): Promise<unknown>;
+    private readonly isFirstAttempt;
+    protected readonly numOfDelayedAttempts: number;
+}

node_modules/exponential-backoff/dist/delay/skip-first/skip-first.delay.js

@@ -0,0 +1,82 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    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: 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 (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var delay_base_1 = require("../delay.base");
+var SkipFirstDelay = /** @class */ (function (_super) {
+    __extends(SkipFirstDelay, _super);
+    function SkipFirstDelay() {
+        return _super !== null && _super.apply(this, arguments) || this;
+    }
+    SkipFirstDelay.prototype.apply = function () {
+        return __awaiter(this, void 0, void 0, function () {
+            return __generator(this, function (_a) {
+                return [2 /*return*/, this.isFirstAttempt ? true : _super.prototype.apply.call(this)];
+            });
+        });
+    };
+    Object.defineProperty(SkipFirstDelay.prototype, "isFirstAttempt", {
+        get: function () {
+            return this.attempt === 0;
+        },
+        enumerable: true,
+        configurable: true
+    });
+    Object.defineProperty(SkipFirstDelay.prototype, "numOfDelayedAttempts", {
+        get: function () {
+            return this.attempt - 1;
+        },
+        enumerable: true,
+        configurable: true
+    });
+    return SkipFirstDelay;
+}(delay_base_1.Delay));
+exports.SkipFirstDelay = SkipFirstDelay;
+//# sourceMappingURL=skip-first.delay.js.map

node_modules/exponential-backoff/dist/delay/skip-first/skip-first.delay.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skip-first.delay.js","sourceRoot":"","sources":["../../../src/delay/skip-first/skip-first.delay.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,4CAAsC;AAEtC;IAAoC,kCAAK;IAAzC;;IAYA,CAAC;IAXgB,8BAAK,GAAlB;;;gBACI,sBAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,iBAAM,KAAK,WAAE,EAAC;;;KACrD;IAED,sBAAY,0CAAc;aAA1B;YACI,OAAO,IAAI,CAAC,OAAO,KAAK,CAAC,CAAC;QAC9B,CAAC;;;OAAA;IAED,sBAAc,gDAAoB;aAAlC;YACI,OAAO,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC;QAC5B,CAAC;;;OAAA;IACL,qBAAC;AAAD,CAAC,AAZD,CAAoC,kBAAK,GAYxC;AAZY,wCAAc"}

node_modules/exponential-backoff/dist/jitter/full/full.jitter.d.ts

@@ -0,0 +1 @@
+export declare function fullJitter(delay: number): number;

node_modules/exponential-backoff/dist/jitter/full/full.jitter.js

@@ -0,0 +1,8 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function fullJitter(delay) {
+    var jitteredDelay = Math.random() * delay;
+    return Math.round(jitteredDelay);
+}
+exports.fullJitter = fullJitter;
+//# sourceMappingURL=full.jitter.js.map

node_modules/exponential-backoff/dist/jitter/full/full.jitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"full.jitter.js","sourceRoot":"","sources":["../../../src/jitter/full/full.jitter.ts"],"names":[],"mappings":";;AAAA,SAAgB,UAAU,CAAC,KAAa;IACpC,IAAM,aAAa,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC;IAC5C,OAAO,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;AACrC,CAAC;AAHD,gCAGC"}

node_modules/exponential-backoff/dist/jitter/jitter.factory.d.ts

@@ -0,0 +1,3 @@
+import { IBackOffOptions } from "../options";
+export declare type Jitter = (delay: number) => number;
+export declare function JitterFactory(options: IBackOffOptions): Jitter;

node_modules/exponential-backoff/dist/jitter/jitter.factory.js

@@ -0,0 +1,15 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var full_jitter_1 = require("./full/full.jitter");
+var no_jitter_1 = require("./no/no.jitter");
+function JitterFactory(options) {
+    switch (options.jitter) {
+        case "full":
+            return full_jitter_1.fullJitter;
+        case "none":
+        default:
+            return no_jitter_1.noJitter;
+    }
+}
+exports.JitterFactory = JitterFactory;
+//# sourceMappingURL=jitter.factory.js.map

node_modules/exponential-backoff/dist/jitter/jitter.factory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"jitter.factory.js","sourceRoot":"","sources":["../../src/jitter/jitter.factory.ts"],"names":[],"mappings":";;AACA,kDAAgD;AAChD,4CAA0C;AAI1C,SAAgB,aAAa,CAAC,OAAwB;IACpD,QAAQ,OAAO,CAAC,MAAM,EAAE;QACtB,KAAK,MAAM;YACT,OAAO,wBAAU,CAAC;QAEpB,KAAK,MAAM,CAAC;QACZ;YACE,OAAO,oBAAQ,CAAC;KACnB;AACH,CAAC;AATD,sCASC"}

node_modules/exponential-backoff/dist/jitter/no/no.jitter.d.ts

@@ -0,0 +1 @@
+export declare function noJitter(delay: number): number;

node_modules/exponential-backoff/dist/jitter/no/no.jitter.js

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+function noJitter(delay) {
+    return delay;
+}
+exports.noJitter = noJitter;
+//# sourceMappingURL=no.jitter.js.map

node_modules/exponential-backoff/dist/jitter/no/no.jitter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"no.jitter.js","sourceRoot":"","sources":["../../../src/jitter/no/no.jitter.ts"],"names":[],"mappings":";;AAAA,SAAgB,QAAQ,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC;AACjB,CAAC;AAFD,4BAEC"}

node_modules/exponential-backoff/dist/options.d.ts

@@ -0,0 +1,12 @@
+export declare type JitterType = "none" | "full";
+export declare type BackoffOptions = Partial<IBackOffOptions>;
+export interface IBackOffOptions {
+    delayFirstAttempt: boolean;
+    jitter: JitterType;
+    maxDelay: number;
+    numOfAttempts: number;
+    retry: (e: any, attemptNumber: number) => boolean | Promise<boolean>;
+    startingDelay: number;
+    timeMultiple: number;
+}
+export declare function getSanitizedOptions(options: BackoffOptions): IBackOffOptions;

node_modules/exponential-backoff/dist/options.js

@@ -0,0 +1,31 @@
+"use strict";
+var __assign = (this && this.__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];
+        }
+        return t;
+    };
+    return __assign.apply(this, arguments);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var defaultOptions = {
+    delayFirstAttempt: false,
+    jitter: "none",
+    maxDelay: Infinity,
+    numOfAttempts: 10,
+    retry: function () { return true; },
+    startingDelay: 100,
+    timeMultiple: 2
+};
+function getSanitizedOptions(options) {
+    var sanitized = __assign(__assign({}, defaultOptions), options);
+    if (sanitized.numOfAttempts < 1) {
+        sanitized.numOfAttempts = 1;
+    }
+    return sanitized;
+}
+exports.getSanitizedOptions = getSanitizedOptions;
+//# sourceMappingURL=options.js.map

node_modules/exponential-backoff/dist/options.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"options.js","sourceRoot":"","sources":["../src/options.ts"],"names":[],"mappings":";;;;;;;;;;;;;AAcA,IAAM,cAAc,GAAoB;IACtC,iBAAiB,EAAE,KAAK;IACxB,MAAM,EAAE,MAAM;IACd,QAAQ,EAAE,QAAQ;IAClB,aAAa,EAAE,EAAE;IACjB,KAAK,EAAE,cAAM,OAAA,IAAI,EAAJ,CAAI;IACjB,aAAa,EAAE,GAAG;IAClB,YAAY,EAAE,CAAC;CAChB,CAAC;AAEF,SAAgB,mBAAmB,CAAC,OAAuB;IACzD,IAAM,SAAS,yBAAyB,cAAc,GAAK,OAAO,CAAE,CAAC;IAErE,IAAI,SAAS,CAAC,aAAa,GAAG,CAAC,EAAE;QAC/B,SAAS,CAAC,aAAa,GAAG,CAAC,CAAC;KAC7B;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AARD,kDAQC"}

node_modules/exponential-backoff/package.json

@@ -0,0 +1,61 @@
+{
+  "name": "exponential-backoff",
+  "version": "3.1.1",
+  "description": "A utility that allows retrying a function with an exponential delay between attempts.",
+  "files": [
+    "dist/"
+  ],
+  "main": "dist/backoff.js",
+  "types": "dist/backoff.d.ts",
+  "scripts": {
+    "build": "tsc",
+    "test": "jest",
+    "test:watch": "jest --watch"
+  },
+  "husky": {
+    "hooks": {
+      "pre-commit": "lint-staged"
+    }
+  },
+  "lint-staged": {
+    "*.{ts,json,md}": [
+      "prettier --write",
+      "git add"
+    ]
+  },
+  "jest": {
+    "transform": {
+      "^.+\\.ts$": "ts-jest"
+    },
+    "testRegex": "\\.spec\\.ts$",
+    "moduleFileExtensions": [
+      "ts",
+      "js"
+    ]
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/coveo/exponential-backoff.git"
+  },
+  "keywords": [
+    "exponential",
+    "backoff",
+    "retry"
+  ],
+  "author": "Sami Sayegh",
+  "license": "Apache-2.0",
+  "bugs": {
+    "url": "https://github.com/coveo/exponential-backoff/issues"
+  },
+  "homepage": "https://github.com/coveo/exponential-backoff#readme",
+  "devDependencies": {
+    "@types/jest": "^24.0.18",
+    "@types/node": "^10.14.21",
+    "husky": "^3.0.9",
+    "jest": "^24.9.0",
+    "lint-staged": "^9.4.2",
+    "prettier": "^1.18.2",
+    "ts-jest": "^24.1.0",
+    "typescript": "^3.6.4"
+  }
+}