iteragain
Version:
Javascript Iterable/Iterator/Generator-function utilities.
87 lines • 5.08 kB
JavaScript
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 = Object.create((typeof Iterator === "function" ? Iterator : Object).prototype);
return g.next = verb(0), g["throw"] = verb(1), g["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 toIterator from './toIterator';
import toArray from './toArray';
/** Calls `Promise.all` on all collected values, optionally limiting concurrent in-flight promises. */
export function promiseAll(arg_1) {
return __awaiter(this, arguments, void 0, function (arg, _a) {
var results, executing, iterator, next, _loop_1;
var _b = _a === void 0 ? {} : _a, _c = _b.concurrency, concurrency = _c === void 0 ? Infinity : _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
if (concurrency <= 0)
throw new Error('Concurrency must be positive');
if (concurrency === Infinity)
return [2 /*return*/, Promise.all(toArray(arg))];
results = [];
executing = new Set();
iterator = toIterator(arg);
_loop_1 = function () {
var promise, executingPromise;
return __generator(this, function (_e) {
switch (_e.label) {
case 0:
promise = next.value;
results.push(promise);
executingPromise = Promise.resolve(promise).finally(function () {
executing.delete(executingPromise);
});
executing.add(executingPromise);
if (!(executing.size >= concurrency)) return [3 /*break*/, 2];
return [4 /*yield*/, Promise.race(executing)];
case 1:
_e.sent();
_e.label = 2;
case 2: return [2 /*return*/];
}
});
};
_d.label = 1;
case 1:
if (!!(next = iterator.next()).done) return [3 /*break*/, 3];
return [5 /*yield**/, _loop_1()];
case 2:
_d.sent();
return [3 /*break*/, 1];
case 3: return [2 /*return*/, Promise.all(results)];
}
});
});
}
export default promiseAll;
//# sourceMappingURL=promiseAll.js.map