UNPKG

ts-prime

Version:

A utility library for JavaScript and Typescript.

85 lines (84 loc) 4.53 kB
"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 delay_1 = require("./delay"); /** * Function repeats provided call until it returns not null or undefined value. * If this process exceeds `maxDurationMs` function will throw * of those function calls. * * @param fn - The function to invoke. * @param maxDurationMs - Max waiting duration * @example * const result = await waitUntilDefined(() => document.body.getElementById("#app")) * @category Utility * @throws If if fn does not return not nil value in given time frame */ function waitUntilDefined(fn, maxDurationMs) { return __awaiter(this, void 0, void 0, function () { var start; var _this = this; return __generator(this, function (_a) { start = Date.now(); return [2 /*return*/, new Promise(function (resolve) { return __awaiter(_this, void 0, void 0, function () { var diff, v; return __generator(this, function (_a) { switch (_a.label) { case 0: if (!true) return [3 /*break*/, 3]; diff = Date.now() - start; if (diff > maxDurationMs) { throw new Error("Timeout after " + maxDurationMs); } v = fn(); if (!(v == null)) return [3 /*break*/, 2]; return [4 /*yield*/, delay_1.delay(1)]; case 1: _a.sent(); return [3 /*break*/, 0]; case 2: resolve(v); return [2 /*return*/]; case 3: return [2 /*return*/]; } }); }); })]; }); }); } exports.waitUntilDefined = waitUntilDefined;