@ledgerhq/live-promise 0.0.1

package/.eslintrc.js

@@ -0,0 +1,57 @@
+module.exports = {
+  parser: "@typescript-eslint/parser",
+  env: {
+    browser: true,
+    es6: true,
+    node: true,
+    jest: true,
+  },
+  extends: [
+    "eslint:recommended",
+    "plugin:@typescript-eslint/eslint-recommended",
+    "plugin:@typescript-eslint/recommended",
+    "prettier",
+  ],
+  globals: {
+    Atomics: "readonly",
+    SharedArrayBuffer: "readonly",
+  },
+  plugins: ["@typescript-eslint", "prettier"],
+  rules: {
+    "no-console": ["error", { allow: ["warn", "error"] }],
+    "linebreak-style": ["error", "unix"],
+    semi: ["error", "always"],
+    "no-unused-vars": "off",
+    "import/prefer-default-export": 0,
+    "no-plusplus": 0,
+    "no-underscore-dangle": 0,
+    "prefer-template": 0,
+    "no-await-in-loop": 0,
+    "no-restricted-syntax": 0,
+    "consistent-return": 0,
+    "no-lonely-if": 0,
+    "no-use-before-define": 0,
+    "no-nested-ternary": 0,
+    "import/no-cycle": 0,
+    "no-multi-assign": 0,
+    "guard-for-in": 0,
+    "no-continue": 0,
+    "lines-between-class-members": 0,
+    "prefer-destructuring": 0,
+    "prettier/prettier": "error",
+    "@typescript-eslint/no-use-before-define": "off",
+    "@typescript-eslint/no-unused-vars": ["error", { argsIgnorePattern: "^_" }],
+    "@typescript-eslint/no-empty-function": "off",
+    "@typescript-eslint/no-namespace": ["error", { allowDeclarations: true }],
+    "@typescript-eslint/no-explicit-any": 0,
+    "@typescript-eslint/ban-types": [
+      "error",
+      {
+        extendDefaults: true,
+        types: {
+          "{}": false,
+        },
+      },
+    ],
+  },
+};

package/.turbo/turbo-build.log

@@ -0,0 +1,4 @@
+
+> @ledgerhq/live-promise@0.0.1 build /home/runner/work/ledger-live/ledger-live/libs/promise
+> tsc && tsc -m ES6 --outDir lib-es
+

package/jest.config.js

@@ -0,0 +1,10 @@
+/** @type {import('ts-jest/dist/types').InitialOptionsTsJest} */
+module.exports = {
+  preset: 'ts-jest',
+  testEnvironment: 'node',
+  testPathIgnorePatterns: [
+    "lib/",
+    "lib-es/"
+  ]
+};
+

package/lib/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./promise";
+//# sourceMappingURL=index.d.ts.map

package/lib/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC"}

package/lib/index.js

@@ -0,0 +1,18 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+exports.__esModule = true;
+__exportStar(require("./promise"), exports);
+//# sourceMappingURL=index.js.map

package/lib/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,4CAA0B"}

package/lib/promise.d.ts

@@ -0,0 +1,21 @@
+export declare const delay: (ms: number) => Promise<void>;
+declare const defaults: {
+    maxRetry: number;
+    interval: number;
+    intervalMultiplicator: number;
+    context: string;
+};
+export declare function retry<A>(f: () => Promise<A>, options?: Partial<typeof defaults>): Promise<A>;
+type Job<R, A extends Array<any>> = (...args: A) => Promise<R>;
+export declare const atomicQueue: <R, A extends any[]>(job: Job<R, A>, queueIdentifier?: (...args: A) => string) => Job<R, A>;
+export declare function execAndWaitAtLeast<A>(ms: number, cb: () => Promise<A>): Promise<A>;
+/**
+ * promiseAllBatched(n, items, i => f(i))
+ * is essentially like
+ * Promise.all(items.map(i => f(i)))
+ * but with a guarantee that it will not create more than n concurrent call to f
+ * where f is a function that returns a promise
+ */
+export declare function promiseAllBatched<A, B>(batch: number, items: Array<A>, fn: (arg0: A, arg1: number) => Promise<B>): Promise<B[]>;
+export {};
+//# sourceMappingURL=promise.d.ts.map

package/lib/promise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.d.ts","sourceRoot":"","sources":["../src/promise.ts"],"names":[],"mappings":"AACA,eAAO,MAAM,KAAK,OAAQ,MAAM,KAAG,QAAQ,IAAI,CACR,CAAC;AACxC,QAAA,MAAM,QAAQ;;;;;CAKb,CAAC;AACF,wBAAgB,KAAK,CAAC,CAAC,EACrB,CAAC,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACnB,OAAO,CAAC,EAAE,OAAO,CAAC,OAAO,QAAQ,CAAC,GACjC,OAAO,CAAC,CAAC,CAAC,CA0BZ;AACD,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;AAC/D,eAAO,MAAM,WAAW,yEAEW,MAAM,cAUxC,CAAC;AACF,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACnB,OAAO,CAAC,CAAC,CAAC,CAOZ;AAED;;;;;;GAMG;AACH,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAC1C,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EACf,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GACxC,OAAO,CAAC,CAAC,EAAE,CAAC,CAwBd"}

package/lib/promise.js

@@ -0,0 +1,187 @@
+"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);
+};
+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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
+    }
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+exports.__esModule = true;
+exports.promiseAllBatched = exports.execAndWaitAtLeast = exports.atomicQueue = exports.retry = exports.delay = void 0;
+var logs_1 = require("@ledgerhq/logs");
+var delay = function (ms) {
+    return new Promise(function (f) { return setTimeout(f, ms); });
+};
+exports.delay = delay;
+var defaults = {
+    maxRetry: 4,
+    interval: 300,
+    intervalMultiplicator: 1.5,
+    context: ""
+};
+function retry(f, options) {
+    var _a = __assign(__assign({}, defaults), options), maxRetry = _a.maxRetry, interval = _a.interval, intervalMultiplicator = _a.intervalMultiplicator, context = _a.context;
+    function rec(remainingTry, i) {
+        var result = f();
+        if (remainingTry <= 0) {
+            return result;
+        }
+        // In case of failure, wait the interval, retry the action
+        return result["catch"](function (e) {
+            (0, logs_1.log)("promise-retry", context + " failed. " + remainingTry + " retry remain. " + String(e));
+            return (0, exports.delay)(i).then(function () {
+                return rec(remainingTry - 1, i * intervalMultiplicator);
+            });
+        });
+    }
+    return rec(maxRetry, interval);
+}
+exports.retry = retry;
+var atomicQueue = function (job, queueIdentifier) {
+    if (queueIdentifier === void 0) { queueIdentifier = function () { return ""; }; }
+    var queues = {};
+    return function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var id = queueIdentifier.apply(void 0, __spreadArray([], __read(args), false));
+        var queue = queues[id] || Promise.resolve();
+        var p = queue.then(function () { return job.apply(void 0, __spreadArray([], __read(args), false)); });
+        queues[id] = p["catch"](function () { });
+        return p;
+    };
+};
+exports.atomicQueue = atomicQueue;
+function execAndWaitAtLeast(ms, cb) {
+    var startTime = Date.now();
+    return cb().then(function (r) {
+        var remaining = ms - (Date.now() - startTime);
+        if (remaining <= 0)
+            return r;
+        return (0, exports.delay)(remaining).then(function () { return r; });
+    });
+}
+exports.execAndWaitAtLeast = execAndWaitAtLeast;
+/**
+ * promiseAllBatched(n, items, i => f(i))
+ * is essentially like
+ * Promise.all(items.map(i => f(i)))
+ * but with a guarantee that it will not create more than n concurrent call to f
+ * where f is a function that returns a promise
+ */
+function promiseAllBatched(batch, items, fn) {
+    return __awaiter(this, void 0, void 0, function () {
+        function step() {
+            return __awaiter(this, void 0, void 0, function () {
+                var first, item, index, _a, _b;
+                return __generator(this, function (_c) {
+                    switch (_c.label) {
+                        case 0:
+                            if (queue.length === 0)
+                                return [2 /*return*/];
+                            first = queue.shift();
+                            if (!first) return [3 /*break*/, 2];
+                            item = first.item, index = first.index;
+                            _a = data;
+                            _b = index;
+                            return [4 /*yield*/, fn(item, index)];
+                        case 1:
+                            _a[_b] = _c.sent();
+                            _c.label = 2;
+                        case 2: return [4 /*yield*/, step()];
+                        case 3:
+                            _c.sent(); // each time an item redeem, we schedule another one
+                            return [2 /*return*/];
+                    }
+                });
+            });
+        }
+        var data, queue;
+        return __generator(this, function (_a) {
+            switch (_a.label) {
+                case 0:
+                    data = Array(items.length);
+                    queue = items.map(function (item, index) { return ({
+                        item: item,
+                        index: index
+                    }); });
+                    // initially, we schedule <batch> items in parallel
+                    return [4 /*yield*/, Promise.all(Array(Math.min(batch, items.length))
+                            .fill(function () { return undefined; })
+                            .map(step))];
+                case 1:
+                    // initially, we schedule <batch> items in parallel
+                    _a.sent();
+                    return [2 /*return*/, data];
+            }
+        });
+    });
+}
+exports.promiseAllBatched = promiseAllBatched;
+//# sourceMappingURL=promise.js.map

package/lib/promise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.js","sourceRoot":"","sources":["../src/promise.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,uCAAqC;AAC9B,IAAM,KAAK,GAAG,UAAC,EAAU;IAC9B,OAAA,IAAI,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,EAAjB,CAAiB,CAAC;AAArC,CAAqC,CAAC;AAD3B,QAAA,KAAK,SACsB;AACxC,IAAM,QAAQ,GAAG;IACf,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,GAAG;IACb,qBAAqB,EAAE,GAAG;IAC1B,OAAO,EAAE,EAAE;CACZ,CAAC;AACF,SAAgB,KAAK,CACnB,CAAmB,EACnB,OAAkC;IAE5B,IAAA,2BACD,QAAQ,GACR,OAAO,CACX,EAHO,QAAQ,cAAA,EAAE,QAAQ,cAAA,EAAE,qBAAqB,2BAAA,EAAE,OAAO,aAGzD,CAAC;IAEF,SAAS,GAAG,CAAC,YAAoB,EAAE,CAAS;QAC1C,IAAM,MAAM,GAAG,CAAC,EAAE,CAAC;QAEnB,IAAI,YAAY,IAAI,CAAC,EAAE;YACrB,OAAO,MAAM,CAAC;SACf;QAED,0DAA0D;QAC1D,OAAO,MAAM,CAAC,OAAK,CAAA,CAAC,UAAC,CAAC;YACpB,IAAA,UAAG,EACD,eAAe,EACf,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,iBAAiB,GAAG,MAAM,CAAC,CAAC,CAAC,CACrE,CAAC;YACF,OAAO,IAAA,aAAK,EAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACnB,OAAA,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,CAAC;YAAhD,CAAgD,CACjD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACjC,CAAC;AA7BD,sBA6BC;AAEM,IAAM,WAAW,GAAG,UACzB,GAAc,EACd,eAAkD;IAAlD,gCAAA,EAAA,gCAAgD,OAAA,EAAE,EAAF,CAAE;IAElD,IAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,OAAO;QAAC,cAAO;aAAP,UAAO,EAAP,qBAAO,EAAP,IAAO;YAAP,yBAAO;;QACb,IAAM,EAAE,GAAG,eAAe,wCAAI,IAAI,UAAC,CAAC;QACpC,IAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,cAAM,OAAA,GAAG,wCAAI,IAAI,YAAX,CAAY,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAK,CAAA,CAAC,cAAO,CAAC,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC,CAAC;AAZW,QAAA,WAAW,eAYtB;AACF,SAAgB,kBAAkB,CAChC,EAAU,EACV,EAAoB;IAEpB,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC;QACjB,IAAM,SAAS,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;QAChD,IAAI,SAAS,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7B,OAAO,IAAA,aAAK,EAAC,SAAS,CAAC,CAAC,IAAI,CAAC,cAAM,OAAA,CAAC,EAAD,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC;AAVD,gDAUC;AAED;;;;;;GAMG;AACH,SAAsB,iBAAiB,CACrC,KAAa,EACb,KAAe,EACf,EAAyC;;QAQzC,SAAe,IAAI;;;;;;4BACjB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gCAAE,sBAAO;4BACzB,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;iCACxB,KAAK,EAAL,wBAAK;4BACC,IAAI,GAAY,KAAK,KAAjB,EAAE,KAAK,GAAK,KAAK,MAAV,CAAW;4BAC9B,KAAA,IAAI,CAAA;4BAAC,KAAA,KAAK,CAAA;4BAAI,qBAAM,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAA;;4BAAnC,MAAW,GAAG,SAAqB,CAAC;;gCAEtC,qBAAM,IAAI,EAAE,EAAA;;4BAAZ,SAAY,CAAC,CAAC,oDAAoD;;;;;SACnE;;;;;oBAdK,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;oBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAC,IAAI,EAAE,KAAK,IAAK,OAAA,CAAC;wBACxC,IAAI,MAAA;wBACJ,KAAK,OAAA;qBACN,CAAC,EAHuC,CAGvC,CAAC,CAAC;oBAYJ,mDAAmD;oBACnD,qBAAM,OAAO,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;6BACjC,IAAI,CAAC,cAAM,OAAA,SAAS,EAAT,CAAS,CAAC;6BACrB,GAAG,CAAC,IAAI,CAAC,CACb,EAAA;;oBALD,mDAAmD;oBACnD,SAIC,CAAC;oBACF,sBAAO,IAAI,EAAC;;;;CACb;AA5BD,8CA4BC"}

package/lib/promise.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=promise.test.d.ts.map

package/lib/promise.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.test.d.ts","sourceRoot":"","sources":["../src/promise.test.ts"],"names":[],"mappings":""}

package/lib/promise.test.js

@@ -0,0 +1,72 @@
+"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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
+    }
+};
+exports.__esModule = true;
+var promise_1 = require("./promise");
+test("promiseAllBatched", function () { return __awaiter(void 0, void 0, void 0, function () {
+    var promisifyIdPlusOne, p, _a, _b, _c, _d, _e;
+    return __generator(this, function (_f) {
+        switch (_f.label) {
+            case 0:
+                promisifyIdPlusOne = function (a) { return Promise.resolve(a + 1); };
+                p = (0, promise_1.promiseAllBatched)(5, [], promisifyIdPlusOne);
+                expect(typeof p.then).toBe("function");
+                _a = expect;
+                return [4 /*yield*/, p];
+            case 1:
+                _a.apply(void 0, [_f.sent()]).toEqual([]);
+                _b = expect;
+                return [4 /*yield*/, (0, promise_1.promiseAllBatched)(5, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 2:
+                _b.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _c = expect;
+                return [4 /*yield*/, (0, promise_1.promiseAllBatched)(1, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 3:
+                _c.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _d = expect;
+                return [4 /*yield*/, (0, promise_1.promiseAllBatched)(10, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 4:
+                _d.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _e = expect;
+                return [4 /*yield*/, (0, promise_1.promiseAllBatched)(2, Array(6).fill(0), function (_, i) { return Promise.resolve(i); })];
+            case 5:
+                _e.apply(void 0, [_f.sent()]).toEqual([0, 1, 2, 3, 4, 5]);
+                return [2 /*return*/];
+        }
+    });
+}); });
+//# sourceMappingURL=promise.test.js.map

package/lib/promise.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.test.js","sourceRoot":"","sources":["../src/promise.test.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,qCAA8C;AAC9C,IAAI,CAAC,mBAAmB,EAAE;;;;;gBAClB,kBAAkB,GAAG,UAAC,CAAS,IAAK,OAAA,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAtB,CAAsB,CAAC;gBAE3D,CAAC,GAAG,IAAA,2BAAiB,EAAC,CAAC,EAAE,EAAE,EAAE,kBAAkB,CAAC,CAAC;gBACvD,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,KAAA,MAAM,CAAA;gBAAC,qBAAM,CAAC,EAAA;;gBAAd,kBAAO,SAAO,EAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBAC5B,KAAA,MAAM,CAAA;gBACJ,qBAAM,IAAA,2BAAiB,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD1E,kBACE,SAAwE,EACzE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,IAAA,2BAAiB,EAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD1E,kBACE,SAAwE,EACzE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,IAAA,2BAAiB,EAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD3E,kBACE,SAAyE,EAC1E,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,IAAA,2BAAiB,EAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,EAAA;;gBAD5E,kBACE,SAA0E,EAC3E,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;;KAC/B,CAAC,CAAC"}

package/lib-es/index.d.ts

@@ -0,0 +1,2 @@
+export * from "./promise";
+//# sourceMappingURL=index.d.ts.map

package/lib-es/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC"}

package/lib-es/index.js

@@ -0,0 +1,2 @@
+export * from "./promise";
+//# sourceMappingURL=index.js.map

package/lib-es/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,WAAW,CAAC"}

package/lib-es/promise.d.ts

@@ -0,0 +1,21 @@
+export declare const delay: (ms: number) => Promise<void>;
+declare const defaults: {
+    maxRetry: number;
+    interval: number;
+    intervalMultiplicator: number;
+    context: string;
+};
+export declare function retry<A>(f: () => Promise<A>, options?: Partial<typeof defaults>): Promise<A>;
+type Job<R, A extends Array<any>> = (...args: A) => Promise<R>;
+export declare const atomicQueue: <R, A extends any[]>(job: Job<R, A>, queueIdentifier?: (...args: A) => string) => Job<R, A>;
+export declare function execAndWaitAtLeast<A>(ms: number, cb: () => Promise<A>): Promise<A>;
+/**
+ * promiseAllBatched(n, items, i => f(i))
+ * is essentially like
+ * Promise.all(items.map(i => f(i)))
+ * but with a guarantee that it will not create more than n concurrent call to f
+ * where f is a function that returns a promise
+ */
+export declare function promiseAllBatched<A, B>(batch: number, items: Array<A>, fn: (arg0: A, arg1: number) => Promise<B>): Promise<B[]>;
+export {};
+//# sourceMappingURL=promise.d.ts.map

package/lib-es/promise.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.d.ts","sourceRoot":"","sources":["../src/promise.ts"],"names":[],"mappings":"AACA,eAAO,MAAM,KAAK,OAAQ,MAAM,KAAG,QAAQ,IAAI,CACR,CAAC;AACxC,QAAA,MAAM,QAAQ;;;;;CAKb,CAAC;AACF,wBAAgB,KAAK,CAAC,CAAC,EACrB,CAAC,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACnB,OAAO,CAAC,EAAE,OAAO,CAAC,OAAO,QAAQ,CAAC,GACjC,OAAO,CAAC,CAAC,CAAC,CA0BZ;AACD,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC,SAAS,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC;AAC/D,eAAO,MAAM,WAAW,yEAEW,MAAM,cAUxC,CAAC;AACF,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,EAAE,EAAE,MAAM,EACV,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GACnB,OAAO,CAAC,CAAC,CAAC,CAOZ;AAED;;;;;;GAMG;AACH,wBAAsB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAC1C,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EACf,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GACxC,OAAO,CAAC,CAAC,EAAE,CAAC,CAwBd"}

package/lib-es/promise.js

@@ -0,0 +1,179 @@
+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);
+};
+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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
+    }
+};
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+import { log } from "@ledgerhq/logs";
+export var delay = function (ms) {
+    return new Promise(function (f) { return setTimeout(f, ms); });
+};
+var defaults = {
+    maxRetry: 4,
+    interval: 300,
+    intervalMultiplicator: 1.5,
+    context: ""
+};
+export function retry(f, options) {
+    var _a = __assign(__assign({}, defaults), options), maxRetry = _a.maxRetry, interval = _a.interval, intervalMultiplicator = _a.intervalMultiplicator, context = _a.context;
+    function rec(remainingTry, i) {
+        var result = f();
+        if (remainingTry <= 0) {
+            return result;
+        }
+        // In case of failure, wait the interval, retry the action
+        return result["catch"](function (e) {
+            log("promise-retry", context + " failed. " + remainingTry + " retry remain. " + String(e));
+            return delay(i).then(function () {
+                return rec(remainingTry - 1, i * intervalMultiplicator);
+            });
+        });
+    }
+    return rec(maxRetry, interval);
+}
+export var atomicQueue = function (job, queueIdentifier) {
+    if (queueIdentifier === void 0) { queueIdentifier = function () { return ""; }; }
+    var queues = {};
+    return function () {
+        var args = [];
+        for (var _i = 0; _i < arguments.length; _i++) {
+            args[_i] = arguments[_i];
+        }
+        var id = queueIdentifier.apply(void 0, __spreadArray([], __read(args), false));
+        var queue = queues[id] || Promise.resolve();
+        var p = queue.then(function () { return job.apply(void 0, __spreadArray([], __read(args), false)); });
+        queues[id] = p["catch"](function () { });
+        return p;
+    };
+};
+export function execAndWaitAtLeast(ms, cb) {
+    var startTime = Date.now();
+    return cb().then(function (r) {
+        var remaining = ms - (Date.now() - startTime);
+        if (remaining <= 0)
+            return r;
+        return delay(remaining).then(function () { return r; });
+    });
+}
+/**
+ * promiseAllBatched(n, items, i => f(i))
+ * is essentially like
+ * Promise.all(items.map(i => f(i)))
+ * but with a guarantee that it will not create more than n concurrent call to f
+ * where f is a function that returns a promise
+ */
+export function promiseAllBatched(batch, items, fn) {
+    return __awaiter(this, void 0, void 0, function () {
+        function step() {
+            return __awaiter(this, void 0, void 0, function () {
+                var first, item, index, _a, _b;
+                return __generator(this, function (_c) {
+                    switch (_c.label) {
+                        case 0:
+                            if (queue.length === 0)
+                                return [2 /*return*/];
+                            first = queue.shift();
+                            if (!first) return [3 /*break*/, 2];
+                            item = first.item, index = first.index;
+                            _a = data;
+                            _b = index;
+                            return [4 /*yield*/, fn(item, index)];
+                        case 1:
+                            _a[_b] = _c.sent();
+                            _c.label = 2;
+                        case 2: return [4 /*yield*/, step()];
+                        case 3:
+                            _c.sent(); // each time an item redeem, we schedule another one
+                            return [2 /*return*/];
+                    }
+                });
+            });
+        }
+        var data, queue;
+        return __generator(this, function (_a) {
+            switch (_a.label) {
+                case 0:
+                    data = Array(items.length);
+                    queue = items.map(function (item, index) { return ({
+                        item: item,
+                        index: index
+                    }); });
+                    // initially, we schedule <batch> items in parallel
+                    return [4 /*yield*/, Promise.all(Array(Math.min(batch, items.length))
+                            .fill(function () { return undefined; })
+                            .map(step))];
+                case 1:
+                    // initially, we schedule <batch> items in parallel
+                    _a.sent();
+                    return [2 /*return*/, data];
+            }
+        });
+    });
+}
+//# sourceMappingURL=promise.js.map

package/lib-es/promise.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.js","sourceRoot":"","sources":["../src/promise.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,gBAAgB,CAAC;AACrC,MAAM,CAAC,IAAM,KAAK,GAAG,UAAC,EAAU;IAC9B,OAAA,IAAI,OAAO,CAAC,UAAC,CAAC,IAAK,OAAA,UAAU,CAAC,CAAC,EAAE,EAAE,CAAC,EAAjB,CAAiB,CAAC;AAArC,CAAqC,CAAC;AACxC,IAAM,QAAQ,GAAG;IACf,QAAQ,EAAE,CAAC;IACX,QAAQ,EAAE,GAAG;IACb,qBAAqB,EAAE,GAAG;IAC1B,OAAO,EAAE,EAAE;CACZ,CAAC;AACF,MAAM,UAAU,KAAK,CACnB,CAAmB,EACnB,OAAkC;IAE5B,IAAA,2BACD,QAAQ,GACR,OAAO,CACX,EAHO,QAAQ,cAAA,EAAE,QAAQ,cAAA,EAAE,qBAAqB,2BAAA,EAAE,OAAO,aAGzD,CAAC;IAEF,SAAS,GAAG,CAAC,YAAoB,EAAE,CAAS;QAC1C,IAAM,MAAM,GAAG,CAAC,EAAE,CAAC;QAEnB,IAAI,YAAY,IAAI,CAAC,EAAE;YACrB,OAAO,MAAM,CAAC;SACf;QAED,0DAA0D;QAC1D,OAAO,MAAM,CAAC,OAAK,CAAA,CAAC,UAAC,CAAC;YACpB,GAAG,CACD,eAAe,EACf,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,iBAAiB,GAAG,MAAM,CAAC,CAAC,CAAC,CACrE,CAAC;YACF,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;gBACnB,OAAA,GAAG,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,GAAG,qBAAqB,CAAC;YAAhD,CAAgD,CACjD,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAED,OAAO,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;AACjC,CAAC;AAED,MAAM,CAAC,IAAM,WAAW,GAAG,UACzB,GAAc,EACd,eAAkD;IAAlD,gCAAA,EAAA,gCAAgD,OAAA,EAAE,EAAF,CAAE;IAElD,IAAM,MAAM,GAAwB,EAAE,CAAC;IACvC,OAAO;QAAC,cAAO;aAAP,UAAO,EAAP,qBAAO,EAAP,IAAO;YAAP,yBAAO;;QACb,IAAM,EAAE,GAAG,eAAe,wCAAI,IAAI,UAAC,CAAC;QACpC,IAAM,KAAK,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,EAAE,CAAC;QAC9C,IAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,cAAM,OAAA,GAAG,wCAAI,IAAI,YAAX,CAAY,CAAC,CAAC;QACzC,MAAM,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,OAAK,CAAA,CAAC,cAAO,CAAC,CAAC,CAAC;QAC/B,OAAO,CAAC,CAAC;IACX,CAAC,CAAC;AACJ,CAAC,CAAC;AACF,MAAM,UAAU,kBAAkB,CAChC,EAAU,EACV,EAAoB;IAEpB,IAAM,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,OAAO,EAAE,EAAE,CAAC,IAAI,CAAC,UAAC,CAAC;QACjB,IAAM,SAAS,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,SAAS,CAAC,CAAC;QAChD,IAAI,SAAS,IAAI,CAAC;YAAE,OAAO,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,cAAM,OAAA,CAAC,EAAD,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAgB,iBAAiB,CACrC,KAAa,EACb,KAAe,EACf,EAAyC;;QAQzC,SAAe,IAAI;;;;;;4BACjB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;gCAAE,sBAAO;4BACzB,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;iCACxB,KAAK,EAAL,wBAAK;4BACC,IAAI,GAAY,KAAK,KAAjB,EAAE,KAAK,GAAK,KAAK,MAAV,CAAW;4BAC9B,KAAA,IAAI,CAAA;4BAAC,KAAA,KAAK,CAAA;4BAAI,qBAAM,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAA;;4BAAnC,MAAW,GAAG,SAAqB,CAAC;;gCAEtC,qBAAM,IAAI,EAAE,EAAA;;4BAAZ,SAAY,CAAC,CAAC,oDAAoD;;;;;SACnE;;;;;oBAdK,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;oBAC3B,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,UAAC,IAAI,EAAE,KAAK,IAAK,OAAA,CAAC;wBACxC,IAAI,MAAA;wBACJ,KAAK,OAAA;qBACN,CAAC,EAHuC,CAGvC,CAAC,CAAC;oBAYJ,mDAAmD;oBACnD,qBAAM,OAAO,CAAC,GAAG,CACf,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;6BACjC,IAAI,CAAC,cAAM,OAAA,SAAS,EAAT,CAAS,CAAC;6BACrB,GAAG,CAAC,IAAI,CAAC,CACb,EAAA;;oBALD,mDAAmD;oBACnD,SAIC,CAAC;oBACF,sBAAO,IAAI,EAAC;;;;CACb"}

package/lib-es/promise.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=promise.test.d.ts.map

package/lib-es/promise.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.test.d.ts","sourceRoot":"","sources":["../src/promise.test.ts"],"names":[],"mappings":""}

package/lib-es/promise.test.js

@@ -0,0 +1,70 @@
+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 (g && (g = 0, op[0] && (_ = 0)), _) 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 };
+    }
+};
+import { promiseAllBatched } from "./promise";
+test("promiseAllBatched", function () { return __awaiter(void 0, void 0, void 0, function () {
+    var promisifyIdPlusOne, p, _a, _b, _c, _d, _e;
+    return __generator(this, function (_f) {
+        switch (_f.label) {
+            case 0:
+                promisifyIdPlusOne = function (a) { return Promise.resolve(a + 1); };
+                p = promiseAllBatched(5, [], promisifyIdPlusOne);
+                expect(typeof p.then).toBe("function");
+                _a = expect;
+                return [4 /*yield*/, p];
+            case 1:
+                _a.apply(void 0, [_f.sent()]).toEqual([]);
+                _b = expect;
+                return [4 /*yield*/, promiseAllBatched(5, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 2:
+                _b.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _c = expect;
+                return [4 /*yield*/, promiseAllBatched(1, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 3:
+                _c.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _d = expect;
+                return [4 /*yield*/, promiseAllBatched(10, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)];
+            case 4:
+                _d.apply(void 0, [_f.sent()]).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+                _e = expect;
+                return [4 /*yield*/, promiseAllBatched(2, Array(6).fill(0), function (_, i) { return Promise.resolve(i); })];
+            case 5:
+                _e.apply(void 0, [_f.sent()]).toEqual([0, 1, 2, 3, 4, 5]);
+                return [2 /*return*/];
+        }
+    });
+}); });
+//# sourceMappingURL=promise.test.js.map

package/lib-es/promise.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"promise.test.js","sourceRoot":"","sources":["../src/promise.test.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,WAAW,CAAC;AAC9C,IAAI,CAAC,mBAAmB,EAAE;;;;;gBAClB,kBAAkB,GAAG,UAAC,CAAS,IAAK,OAAA,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,EAAtB,CAAsB,CAAC;gBAE3D,CAAC,GAAG,iBAAiB,CAAC,CAAC,EAAE,EAAE,EAAE,kBAAkB,CAAC,CAAC;gBACvD,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBACvC,KAAA,MAAM,CAAA;gBAAC,qBAAM,CAAC,EAAA;;gBAAd,kBAAO,SAAO,EAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBAC5B,KAAA,MAAM,CAAA;gBACJ,qBAAM,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD1E,kBACE,SAAwE,EACzE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD1E,kBACE,SAAwE,EACzE,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,iBAAiB,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,kBAAkB,CAAC,EAAA;;gBAD3E,kBACE,SAAyE,EAC1E,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACpC,KAAA,MAAM,CAAA;gBACJ,qBAAM,iBAAiB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,UAAC,CAAC,EAAE,CAAC,IAAK,OAAA,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAlB,CAAkB,CAAC,EAAA;;gBAD5E,kBACE,SAA0E,EAC3E,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;;;KAC/B,CAAC,CAAC"}

package/package.json

@@ -0,0 +1,50 @@
+{
+  "name": "@ledgerhq/live-promise",
+  "version": "0.0.1",
+  "description": "Ledger Live Promise utilities",
+  "keywords": [
+    "Ledger"
+  ],
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/LedgerHQ/ledger-live.git"
+  },
+  "bugs": {
+    "url": "https://github.com/LedgerHQ/ledger-live/issues"
+  },
+  "homepage": "https://github.com/LedgerHQ/ledger-live/tree/develop/libs/promise",
+  "publishConfig": {
+    "access": "public"
+  },
+  "main": "lib/index.js",
+  "module": "lib-es/index.js",
+  "types": "lib/index.d.ts",
+  "license": "Apache-2.0",
+  "dependencies": {
+    "@ledgerhq/logs": "^6.10.1"
+  },
+  "devDependencies": {
+    "@types/jest": "^29.2.4",
+    "@typescript-eslint/eslint-plugin": "^5.46.1",
+    "@typescript-eslint/parser": "^5.46.1",
+    "eslint": "^7.32.0",
+    "eslint-config-prettier": "^8.3.0",
+    "eslint-config-typescript": "^3.0.0",
+    "eslint-formatter-pretty": "^3.0.1",
+    "eslint-plugin-prettier": "^3.4.0",
+    "eslint-plugin-typescript": "^0.14.0",
+    "jest": "^28.1.1",
+    "prettier": "^2.8.1",
+    "ts-jest": "^28.0.5",
+    "typescript": "^4.9.4"
+  },
+  "scripts": {
+    "clean": "rimraf lib lib-es",
+    "build": "tsc && tsc -m ES6 --outDir lib-es",
+    "prewatch": "pnpm build",
+    "watch": "tsc --watch",
+    "lint": "eslint ./src --no-error-on-unmatched-pattern --ext .ts,.tsx",
+    "lint:fix": "pnpm lint --fix",
+    "test": "jest"
+  }
+}

package/src/index.ts

@@ -0,0 +1 @@
+export * from "./promise";

package/src/promise.test.ts

@@ -0,0 +1,20 @@
+import { promiseAllBatched } from "./promise";
+test("promiseAllBatched", async () => {
+  const promisifyIdPlusOne = (a: number) => Promise.resolve(a + 1);
+
+  const p = promiseAllBatched(5, [], promisifyIdPlusOne);
+  expect(typeof p.then).toBe("function");
+  expect(await p).toEqual([]);
+  expect(
+    await promiseAllBatched(5, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)
+  ).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+  expect(
+    await promiseAllBatched(1, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)
+  ).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+  expect(
+    await promiseAllBatched(10, [1, 2, 3, 4, 5, 6, 7, 8], promisifyIdPlusOne)
+  ).toEqual([2, 3, 4, 5, 6, 7, 8, 9]);
+  expect(
+    await promiseAllBatched(2, Array(6).fill(0), (_, i) => Promise.resolve(i))
+  ).toEqual([0, 1, 2, 3, 4, 5]);
+});

package/src/promise.ts

@@ -0,0 +1,101 @@
+import { log } from "@ledgerhq/logs";
+export const delay = (ms: number): Promise<void> =>
+  new Promise((f) => setTimeout(f, ms));
+const defaults = {
+  maxRetry: 4,
+  interval: 300,
+  intervalMultiplicator: 1.5,
+  context: "",
+};
+export function retry<A>(
+  f: () => Promise<A>,
+  options?: Partial<typeof defaults>
+): Promise<A> {
+  const { maxRetry, interval, intervalMultiplicator, context } = {
+    ...defaults,
+    ...options,
+  };
+
+  function rec(remainingTry: number, i: number): Promise<A> {
+    const result = f();
+
+    if (remainingTry <= 0) {
+      return result;
+    }
+
+    // In case of failure, wait the interval, retry the action
+    return result.catch((e) => {
+      log(
+        "promise-retry",
+        context + " failed. " + remainingTry + " retry remain. " + String(e)
+      );
+      return delay(i).then(() =>
+        rec(remainingTry - 1, i * intervalMultiplicator)
+      );
+    });
+  }
+
+  return rec(maxRetry, interval);
+}
+type Job<R, A extends Array<any>> = (...args: A) => Promise<R>;
+export const atomicQueue = <R, A extends Array<any>>(
+  job: Job<R, A>,
+  queueIdentifier: (...args: A) => string = () => ""
+): Job<R, A> => {
+  const queues: Record<string, any> = {};
+  return (...args) => {
+    const id = queueIdentifier(...args);
+    const queue = queues[id] || Promise.resolve();
+    const p = queue.then(() => job(...args));
+    queues[id] = p.catch(() => {});
+    return p;
+  };
+};
+export function execAndWaitAtLeast<A>(
+  ms: number,
+  cb: () => Promise<A>
+): Promise<A> {
+  const startTime = Date.now();
+  return cb().then((r) => {
+    const remaining = ms - (Date.now() - startTime);
+    if (remaining <= 0) return r;
+    return delay(remaining).then(() => r);
+  });
+}
+
+/**
+ * promiseAllBatched(n, items, i => f(i))
+ * is essentially like
+ * Promise.all(items.map(i => f(i)))
+ * but with a guarantee that it will not create more than n concurrent call to f
+ * where f is a function that returns a promise
+ */
+export async function promiseAllBatched<A, B>(
+  batch: number,
+  items: Array<A>,
+  fn: (arg0: A, arg1: number) => Promise<B>
+): Promise<B[]> {
+  const data = Array(items.length);
+  const queue = items.map((item, index) => ({
+    item,
+    index,
+  }));
+
+  async function step() {
+    if (queue.length === 0) return;
+    const first = queue.shift();
+    if (first) {
+      const { item, index } = first;
+      data[index] = await fn(item, index);
+    }
+    await step(); // each time an item redeem, we schedule another one
+  }
+
+  // initially, we schedule <batch> items in parallel
+  await Promise.all(
+    Array(Math.min(batch, items.length))
+      .fill(() => undefined)
+      .map(step)
+  );
+  return data;
+}

package/tsconfig.json

@@ -0,0 +1,20 @@
+{
+  "compilerOptions": {
+    "declaration": true,
+    "declarationMap": true,
+    "sourceMap": true,
+    "strict": true,
+    "noImplicitAny": false,
+    "noImplicitThis": false,
+    "allowSyntheticDefaultImports": true,
+    "esModuleInterop": true,
+    "skipLibCheck": true,
+    "forceConsistentCasingInFileNames": true,
+    "moduleResolution": "node",
+    "downlevelIteration": true,
+    "resolveJsonModule": true,
+    "lib": ["es2020", "dom"],
+    "outDir": "lib"
+  },
+  "include": ["src/**/*"]
+}