itertools-ts
Version:
Extended itertools port for TypeScript and JavaScript. Provides a huge set of functions for working with iterable collections (including async ones)
691 lines • 28 kB
JavaScript
"use strict";
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 };
}
};
var __asyncValues = (this && this.__asyncValues) || function (o) {
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
var m = o[Symbol.asyncIterator], i;
return m ? m.call(o) : (o = typeof __values === "function" ? __values(o) : o[Symbol.iterator](), i = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i);
function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }
function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }
};
var __await = (this && this.__await) || function (v) { return this instanceof __await ? (this.v = v, this) : new __await(v); }
var __asyncGenerator = (this && this.__asyncGenerator) || function (thisArg, _arguments, generator) {
if (!Symbol.asyncIterator) throw new TypeError("Symbol.asyncIterator is not defined.");
var g = generator.apply(thisArg, _arguments || []), i, q = [];
return i = Object.create((typeof AsyncIterator === "function" ? AsyncIterator : Object).prototype), verb("next"), verb("throw"), verb("return", awaitReturn), i[Symbol.asyncIterator] = function () { return this; }, i;
function awaitReturn(f) { return function (v) { return Promise.resolve(v).then(f, reject); }; }
function verb(n, f) { if (g[n]) { i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; if (f) i[n] = f(i[n]); } }
function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }
function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }
function fulfill(value) { resume("next", value); }
function reject(value) { resume("throw", value); }
function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }
};
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));
};
var __values = (this && this.__values) || function(o) {
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
if (m) return m.call(o);
if (o && typeof o.length === "number") return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.zip = zip;
exports.zipAsync = zipAsync;
exports.zipFilled = zipFilled;
exports.zipFilledAsync = zipFilledAsync;
exports.zipLongest = zipLongest;
exports.zipLongestAsync = zipLongestAsync;
exports.zipEqual = zipEqual;
exports.zipEqualAsync = zipEqualAsync;
exports.chain = chain;
exports.chainAsync = chainAsync;
var transform_1 = require("./transform");
var tools_1 = require("./tools");
/**
* Iterate multiple iterable collections simultaneously.
*
* Make an iterator that aggregates items from multiple iterators.
* Similar to Python's zip function.
*
* For uneven lengths, iterations stops when the shortest iterable is exhausted.
*
* @param iterables
*/
function zip() {
var _i, _a, _b, values, e_1_1;
var e_1, _c;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_d.trys.push([0, 5, 6, 7]);
_a = __values(tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.SHORTEST,
undefined], __read(iterables), false))), _b = _a.next();
_d.label = 1;
case 1:
if (!!_b.done) return [3 /*break*/, 4];
values = _b.value;
return [4 /*yield*/, values];
case 2:
_d.sent();
_d.label = 3;
case 3:
_b = _a.next();
return [3 /*break*/, 1];
case 4: return [3 /*break*/, 7];
case 5:
e_1_1 = _d.sent();
e_1 = { error: e_1_1 };
return [3 /*break*/, 7];
case 6:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_1) throw e_1.error; }
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
}
/**
* Iterate multiple async iterable collections simultaneously.
*
* Make an iterator that aggregates items from multiple iterators.
* Similar to Python's zip function.
*
* For uneven lengths, iterations stops when the shortest iterable is exhausted.
*
* @param iterables
*/
function zipAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function zipAsync_1() {
var _a, _b, _c, values, e_2_1;
var _d, e_2, _e, _f;
return __generator(this, function (_g) {
switch (_g.label) {
case 0:
_g.trys.push([0, 7, 8, 13]);
_a = true, _b = __asyncValues(tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.SHORTEST,
undefined], __read(iterables), false)));
_g.label = 1;
case 1: return [4 /*yield*/, __await(_b.next())];
case 2:
if (!(_c = _g.sent(), _d = _c.done, !_d)) return [3 /*break*/, 6];
_f = _c.value;
_a = false;
values = _f;
return [4 /*yield*/, __await(values)];
case 3: return [4 /*yield*/, _g.sent()];
case 4:
_g.sent();
_g.label = 5;
case 5:
_a = true;
return [3 /*break*/, 1];
case 6: return [3 /*break*/, 13];
case 7:
e_2_1 = _g.sent();
e_2 = { error: e_2_1 };
return [3 /*break*/, 13];
case 8:
_g.trys.push([8, , 11, 12]);
if (!(!_a && !_d && (_e = _b.return))) return [3 /*break*/, 10];
return [4 /*yield*/, __await(_e.call(_b))];
case 9:
_g.sent();
_g.label = 10;
case 10: return [3 /*break*/, 12];
case 11:
if (e_2) throw e_2.error;
return [7 /*endfinally*/];
case 12: return [7 /*endfinally*/];
case 13: return [2 /*return*/];
}
});
});
}
/**
* Iterate multiple iterable collections simultaneously.
*
* Make an iterable that aggregates items from multiple iterators.
* Similar to Python's zip_longest function.
*
* Iteration continues until the longest iterable is exhausted.
* For uneven lengths, the exhausted iterables will produce `filler` value for the remaining iterations.
*
* @param filler
* @param iterables
*/
function zipFilled(filler) {
var _i, _a, _b, values, e_3_1;
var e_3, _c;
var iterables = [];
for (_i = 1; _i < arguments.length; _i++) {
iterables[_i - 1] = arguments[_i];
}
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_d.trys.push([0, 5, 6, 7]);
_a = __values(tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
filler], __read(iterables), false))), _b = _a.next();
_d.label = 1;
case 1:
if (!!_b.done) return [3 /*break*/, 4];
values = _b.value;
return [4 /*yield*/, values];
case 2:
_d.sent();
_d.label = 3;
case 3:
_b = _a.next();
return [3 /*break*/, 1];
case 4: return [3 /*break*/, 7];
case 5:
e_3_1 = _d.sent();
e_3 = { error: e_3_1 };
return [3 /*break*/, 7];
case 6:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_3) throw e_3.error; }
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
}
/**
* Iterate multiple async iterable collections simultaneously.
*
* Make an iterable that aggregates items from multiple iterators.
* Similar to Python's zip_longest function.
*
* Iteration continues until the longest iterable is exhausted.
* For uneven lengths, the exhausted iterables will produce `filler` value for the remaining iterations.
*
* @param filler
* @param iterables
*/
function zipFilledAsync(filler) {
var iterables = [];
for (var _i = 1; _i < arguments.length; _i++) {
iterables[_i - 1] = arguments[_i];
}
return __asyncGenerator(this, arguments, function zipFilledAsync_1() {
var _a, _b, _c, values, e_4_1;
var _d, e_4, _e, _f;
return __generator(this, function (_g) {
switch (_g.label) {
case 0:
_g.trys.push([0, 7, 8, 13]);
_a = true, _b = __asyncValues(tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
filler], __read(iterables), false)));
_g.label = 1;
case 1: return [4 /*yield*/, __await(_b.next())];
case 2:
if (!(_c = _g.sent(), _d = _c.done, !_d)) return [3 /*break*/, 6];
_f = _c.value;
_a = false;
values = _f;
return [4 /*yield*/, __await(values)];
case 3: return [4 /*yield*/, _g.sent()];
case 4:
_g.sent();
_g.label = 5;
case 5:
_a = true;
return [3 /*break*/, 1];
case 6: return [3 /*break*/, 13];
case 7:
e_4_1 = _g.sent();
e_4 = { error: e_4_1 };
return [3 /*break*/, 13];
case 8:
_g.trys.push([8, , 11, 12]);
if (!(!_a && !_d && (_e = _b.return))) return [3 /*break*/, 10];
return [4 /*yield*/, __await(_e.call(_b))];
case 9:
_g.sent();
_g.label = 10;
case 10: return [3 /*break*/, 12];
case 11:
if (e_4) throw e_4.error;
return [7 /*endfinally*/];
case 12: return [7 /*endfinally*/];
case 13: return [2 /*return*/];
}
});
});
}
/**
* Iterate multiple iterable collections simultaneously.
*
* Make an iterable that aggregates items from multiple iterators.
* Similar to Python's zip_longest function.
*
* Iteration continues until the longest iterable is exhausted.
* For uneven lengths, the exhausted iterables will produce `undefined` for the remaining iterations.
*
* @param iterables
*/
function zipLongest() {
var _i, _a, _b, values, e_5_1;
var e_5, _c;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_d.trys.push([0, 5, 6, 7]);
_a = __values(tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
undefined], __read(iterables), false))), _b = _a.next();
_d.label = 1;
case 1:
if (!!_b.done) return [3 /*break*/, 4];
values = _b.value;
return [4 /*yield*/, values];
case 2:
_d.sent();
_d.label = 3;
case 3:
_b = _a.next();
return [3 /*break*/, 1];
case 4: return [3 /*break*/, 7];
case 5:
e_5_1 = _d.sent();
e_5 = { error: e_5_1 };
return [3 /*break*/, 7];
case 6:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_5) throw e_5.error; }
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
}
/**
* Iterate multiple async iterable collections simultaneously.
*
* Make an iterable that aggregates items from multiple iterators.
* Similar to Python's zip_longest function.
*
* Iteration continues until the longest iterable is exhausted.
* For uneven lengths, the exhausted iterables will produce `undefined` for the remaining iterations.
*
* @param iterables
*/
function zipLongestAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function zipLongestAsync_1() {
var _a, _b, _c, values, e_6_1;
var _d, e_6, _e, _f;
return __generator(this, function (_g) {
switch (_g.label) {
case 0:
_g.trys.push([0, 7, 8, 13]);
_a = true, _b = __asyncValues(tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
undefined], __read(iterables), false)));
_g.label = 1;
case 1: return [4 /*yield*/, __await(_b.next())];
case 2:
if (!(_c = _g.sent(), _d = _c.done, !_d)) return [3 /*break*/, 6];
_f = _c.value;
_a = false;
values = _f;
return [4 /*yield*/, __await(values)];
case 3: return [4 /*yield*/, _g.sent()];
case 4:
_g.sent();
_g.label = 5;
case 5:
_a = true;
return [3 /*break*/, 1];
case 6: return [3 /*break*/, 13];
case 7:
e_6_1 = _g.sent();
e_6 = { error: e_6_1 };
return [3 /*break*/, 13];
case 8:
_g.trys.push([8, , 11, 12]);
if (!(!_a && !_d && (_e = _b.return))) return [3 /*break*/, 10];
return [4 /*yield*/, __await(_e.call(_b))];
case 9:
_g.sent();
_g.label = 10;
case 10: return [3 /*break*/, 12];
case 11:
if (e_6) throw e_6.error;
return [7 /*endfinally*/];
case 12: return [7 /*endfinally*/];
case 13: return [2 /*return*/];
}
});
});
}
/**
* Iterate multiple iterable collections of equal lengths simultaneously.
*
* Works like multi.zip() method but throws LengthException if lengths not equal,
* i.e., at least one iterator ends before the others.
*
* @param iterables
*
* @throws LengthError if iterators lengths not equal.
*/
function zipEqual() {
var _i, _a, _b, values, e_7_1;
var e_7, _c;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
_d.trys.push([0, 5, 6, 7]);
_a = __values(tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.STRICT_EQUAL,
undefined], __read(iterables), false))), _b = _a.next();
_d.label = 1;
case 1:
if (!!_b.done) return [3 /*break*/, 4];
values = _b.value;
return [4 /*yield*/, values];
case 2:
_d.sent();
_d.label = 3;
case 3:
_b = _a.next();
return [3 /*break*/, 1];
case 4: return [3 /*break*/, 7];
case 5:
e_7_1 = _d.sent();
e_7 = { error: e_7_1 };
return [3 /*break*/, 7];
case 6:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_7) throw e_7.error; }
return [7 /*endfinally*/];
case 7: return [2 /*return*/];
}
});
}
/**
* Iterate multiple async iterable collections of equal lengths simultaneously.
*
* Works like multi.zipAsync() method but throws LengthException if lengths not equal,
* i.e., at least one iterator ends before the others.
*
* @param iterables
*
* @throws LengthError if iterators lengths not equal.
*/
function zipEqualAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function zipEqualAsync_1() {
var _a, _b, _c, values, e_8_1;
var _d, e_8, _e, _f;
return __generator(this, function (_g) {
switch (_g.label) {
case 0:
_g.trys.push([0, 7, 8, 13]);
_a = true, _b = __asyncValues(tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.STRICT_EQUAL,
undefined], __read(iterables), false)));
_g.label = 1;
case 1: return [4 /*yield*/, __await(_b.next())];
case 2:
if (!(_c = _g.sent(), _d = _c.done, !_d)) return [3 /*break*/, 6];
_f = _c.value;
_a = false;
values = _f;
return [4 /*yield*/, __await(values)];
case 3: return [4 /*yield*/, _g.sent()];
case 4:
_g.sent();
_g.label = 5;
case 5:
_a = true;
return [3 /*break*/, 1];
case 6: return [3 /*break*/, 13];
case 7:
e_8_1 = _g.sent();
e_8 = { error: e_8_1 };
return [3 /*break*/, 13];
case 8:
_g.trys.push([8, , 11, 12]);
if (!(!_a && !_d && (_e = _b.return))) return [3 /*break*/, 10];
return [4 /*yield*/, __await(_e.call(_b))];
case 9:
_g.sent();
_g.label = 10;
case 10: return [3 /*break*/, 12];
case 11:
if (e_8) throw e_8.error;
return [7 /*endfinally*/];
case 12: return [7 /*endfinally*/];
case 13: return [2 /*return*/];
}
});
});
}
/**
* Chain multiple iterables together into a single iteration.
*
* Makes a single continuous sequence out of multiple sequences.
*
* @param iterables
*/
function chain() {
var _i, iterables_1, iterables_1_1, iterable, _a, _b, item, e_9_1, e_10_1;
var e_10, _c, e_9, _d;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_e) {
switch (_e.label) {
case 0:
_e.trys.push([0, 11, 12, 13]);
iterables_1 = __values(iterables), iterables_1_1 = iterables_1.next();
_e.label = 1;
case 1:
if (!!iterables_1_1.done) return [3 /*break*/, 10];
iterable = iterables_1_1.value;
_e.label = 2;
case 2:
_e.trys.push([2, 7, 8, 9]);
_a = (e_9 = void 0, __values((0, transform_1.toIterable)(iterable))), _b = _a.next();
_e.label = 3;
case 3:
if (!!_b.done) return [3 /*break*/, 6];
item = _b.value;
return [4 /*yield*/, item];
case 4:
_e.sent();
_e.label = 5;
case 5:
_b = _a.next();
return [3 /*break*/, 3];
case 6: return [3 /*break*/, 9];
case 7:
e_9_1 = _e.sent();
e_9 = { error: e_9_1 };
return [3 /*break*/, 9];
case 8:
try {
if (_b && !_b.done && (_d = _a.return)) _d.call(_a);
}
finally { if (e_9) throw e_9.error; }
return [7 /*endfinally*/];
case 9:
iterables_1_1 = iterables_1.next();
return [3 /*break*/, 1];
case 10: return [3 /*break*/, 13];
case 11:
e_10_1 = _e.sent();
e_10 = { error: e_10_1 };
return [3 /*break*/, 13];
case 12:
try {
if (iterables_1_1 && !iterables_1_1.done && (_c = iterables_1.return)) _c.call(iterables_1);
}
finally { if (e_10) throw e_10.error; }
return [7 /*endfinally*/];
case 13: return [2 /*return*/];
}
});
}
/**
* Chain multiple async iterables together into a single iteration.
*
* Makes a single continuous sequence out of multiple sequences.
*
* @param iterables
*/
function chainAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function chainAsync_1() {
var iterables_2, iterables_2_1, iterable, _a, _b, _c, item, e_11_1, e_12_1;
var e_12, _d;
var _e, e_11, _f, _g;
return __generator(this, function (_h) {
switch (_h.label) {
case 0:
_h.trys.push([0, 17, 18, 19]);
iterables_2 = __values(iterables), iterables_2_1 = iterables_2.next();
_h.label = 1;
case 1:
if (!!iterables_2_1.done) return [3 /*break*/, 16];
iterable = iterables_2_1.value;
_h.label = 2;
case 2:
_h.trys.push([2, 9, 10, 15]);
_a = true, _b = (e_11 = void 0, __asyncValues((0, transform_1.toAsyncIterable)(iterable)));
_h.label = 3;
case 3: return [4 /*yield*/, __await(_b.next())];
case 4:
if (!(_c = _h.sent(), _e = _c.done, !_e)) return [3 /*break*/, 8];
_g = _c.value;
_a = false;
item = _g;
return [4 /*yield*/, __await(item)];
case 5: return [4 /*yield*/, _h.sent()];
case 6:
_h.sent();
_h.label = 7;
case 7:
_a = true;
return [3 /*break*/, 3];
case 8: return [3 /*break*/, 15];
case 9:
e_11_1 = _h.sent();
e_11 = { error: e_11_1 };
return [3 /*break*/, 15];
case 10:
_h.trys.push([10, , 13, 14]);
if (!(!_a && !_e && (_f = _b.return))) return [3 /*break*/, 12];
return [4 /*yield*/, __await(_f.call(_b))];
case 11:
_h.sent();
_h.label = 12;
case 12: return [3 /*break*/, 14];
case 13:
if (e_11) throw e_11.error;
return [7 /*endfinally*/];
case 14: return [7 /*endfinally*/];
case 15:
iterables_2_1 = iterables_2.next();
return [3 /*break*/, 1];
case 16: return [3 /*break*/, 19];
case 17:
e_12_1 = _h.sent();
e_12 = { error: e_12_1 };
return [3 /*break*/, 19];
case 18:
try {
if (iterables_2_1 && !iterables_2_1.done && (_d = iterables_2.return)) _d.call(iterables_2);
}
finally { if (e_12) throw e_12.error; }
return [7 /*endfinally*/];
case 19: return [2 /*return*/];
}
});
});
}
//# sourceMappingURL=multi.js.map