itertools-ts
Version:
Extended itertools port for TypeScript and JavaScript. Provides a huge set of functions for working with iterable collections (including async ones)
442 lines • 20 kB
JavaScript
"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 = 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 __await = (this && this.__await) || function (v) { return this instanceof __await ? (this.v = v, this) : new __await(v); }
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 __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 __asyncDelegator = (this && this.__asyncDelegator) || function (o) {
var i, p;
return i = {}, verb("next"), verb("throw", function (e) { throw e; }), verb("return"), i[Symbol.iterator] = function () { return this; }, i;
function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }
};
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.");
};
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));
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.cartesianProduct = cartesianProduct;
exports.cartesianProductAsync = cartesianProductAsync;
exports.permutations = permutations;
exports.permutationsAsync = permutationsAsync;
exports.combinations = combinations;
exports.combinationsAsync = combinationsAsync;
var transform_1 = require("./transform");
var single_1 = require("./single");
var exceptions_1 = require("./exceptions");
/**
* Iterates cartesian product of given iterables.
*
* @param iterables
*/
function cartesianProduct() {
var _i, _a, _b, item, e_1_1, arrays, toIterate, toIterate_1, toIterate_1_1, item, e_2_1;
var e_1, _c, e_2, _d;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_e) {
switch (_e.label) {
case 0:
if (iterables.length === 0) {
return [2 /*return*/];
}
if (!(iterables.length === 1)) return [3 /*break*/, 9];
_e.label = 1;
case 1:
_e.trys.push([1, 6, 7, 8]);
_a = __values((0, transform_1.toIterable)(iterables[0])), _b = _a.next();
_e.label = 2;
case 2:
if (!!_b.done) return [3 /*break*/, 5];
item = _b.value;
return [4 /*yield*/, [item]];
case 3:
_e.sent();
_e.label = 4;
case 4:
_b = _a.next();
return [3 /*break*/, 2];
case 5: return [3 /*break*/, 8];
case 6:
e_1_1 = _e.sent();
e_1 = { error: e_1_1 };
return [3 /*break*/, 8];
case 7:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_1) throw e_1.error; }
return [7 /*endfinally*/];
case 8: return [2 /*return*/];
case 9:
arrays = (0, transform_1.toArray)((0, single_1.map)(iterables, function (iterable) { return (0, transform_1.toArray)(iterable); }));
toIterate = arrays.reduce(function (acc, set) {
return acc.flatMap(function (x) { return set.map(function (y) { return __spreadArray(__spreadArray([], __read(x), false), [y], false); }); });
}, [[]]);
_e.label = 10;
case 10:
_e.trys.push([10, 15, 16, 17]);
toIterate_1 = __values(toIterate), toIterate_1_1 = toIterate_1.next();
_e.label = 11;
case 11:
if (!!toIterate_1_1.done) return [3 /*break*/, 14];
item = toIterate_1_1.value;
return [4 /*yield*/, item];
case 12:
_e.sent();
_e.label = 13;
case 13:
toIterate_1_1 = toIterate_1.next();
return [3 /*break*/, 11];
case 14: return [3 /*break*/, 17];
case 15:
e_2_1 = _e.sent();
e_2 = { error: e_2_1 };
return [3 /*break*/, 17];
case 16:
try {
if (toIterate_1_1 && !toIterate_1_1.done && (_d = toIterate_1.return)) _d.call(toIterate_1);
}
finally { if (e_2) throw e_2.error; }
return [7 /*endfinally*/];
case 17: return [2 /*return*/];
}
});
}
/**
* Iterates cartesian product of given async iterables.
*
* @param iterables
*/
function cartesianProductAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function cartesianProductAsync_1() {
var _a, _b, _c, item, e_3_1, arrays, toIterate, toIterate_2, toIterate_2_1, item, e_4_1;
var e_4, _d;
var _this = this;
var _e, e_3, _f, _g;
return __generator(this, function (_h) {
switch (_h.label) {
case 0:
if (!(iterables.length === 0)) return [3 /*break*/, 2];
return [4 /*yield*/, __await(void 0)];
case 1: return [2 /*return*/, _h.sent()];
case 2:
if (!(iterables.length === 1)) return [3 /*break*/, 18];
_h.label = 3;
case 3:
_h.trys.push([3, 10, 11, 16]);
_a = true, _b = __asyncValues((0, transform_1.toAsyncIterable)(iterables[0]));
_h.label = 4;
case 4: return [4 /*yield*/, __await(_b.next())];
case 5:
if (!(_c = _h.sent(), _e = _c.done, !_e)) return [3 /*break*/, 9];
_g = _c.value;
_a = false;
item = _g;
return [4 /*yield*/, __await([item])];
case 6: return [4 /*yield*/, _h.sent()];
case 7:
_h.sent();
_h.label = 8;
case 8:
_a = true;
return [3 /*break*/, 4];
case 9: return [3 /*break*/, 16];
case 10:
e_3_1 = _h.sent();
e_3 = { error: e_3_1 };
return [3 /*break*/, 16];
case 11:
_h.trys.push([11, , 14, 15]);
if (!(!_a && !_e && (_f = _b.return))) return [3 /*break*/, 13];
return [4 /*yield*/, __await(_f.call(_b))];
case 12:
_h.sent();
_h.label = 13;
case 13: return [3 /*break*/, 15];
case 14:
if (e_3) throw e_3.error;
return [7 /*endfinally*/];
case 15: return [7 /*endfinally*/];
case 16: return [4 /*yield*/, __await(void 0)];
case 17: return [2 /*return*/, _h.sent()];
case 18: return [4 /*yield*/, __await((0, transform_1.toArrayAsync)((0, single_1.mapAsync)(iterables, function (iterable) { return __awaiter(_this, void 0, void 0, function () { return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, (0, transform_1.toArrayAsync)(iterable)];
case 1: return [2 /*return*/, _a.sent()];
}
}); }); })))];
case 19:
arrays = _h.sent();
toIterate = arrays.reduce(function (acc, set) {
return acc.flatMap(function (x) { return set.map(function (y) { return __spreadArray(__spreadArray([], __read(x), false), [y], false); }); });
}, [[]]);
_h.label = 20;
case 20:
_h.trys.push([20, 26, 27, 28]);
toIterate_2 = __values(toIterate), toIterate_2_1 = toIterate_2.next();
_h.label = 21;
case 21:
if (!!toIterate_2_1.done) return [3 /*break*/, 25];
item = toIterate_2_1.value;
return [4 /*yield*/, __await(item)];
case 22: return [4 /*yield*/, _h.sent()];
case 23:
_h.sent();
_h.label = 24;
case 24:
toIterate_2_1 = toIterate_2.next();
return [3 /*break*/, 21];
case 25: return [3 /*break*/, 28];
case 26:
e_4_1 = _h.sent();
e_4 = { error: e_4_1 };
return [3 /*break*/, 28];
case 27:
try {
if (toIterate_2_1 && !toIterate_2_1.done && (_d = toIterate_2.return)) _d.call(toIterate_2);
}
finally { if (e_4) throw e_4.error; }
return [7 /*endfinally*/];
case 28: return [2 /*return*/];
}
});
});
}
/**
* Iterates all permutations of given iterable.
*
* @param data
* @param length
*/
function permutations(data, length) {
function generate(current, remaining) {
var i, nextCurrent, nextRemaining;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!(current.length === length)) return [3 /*break*/, 2];
return [4 /*yield*/, current.slice()];
case 1:
_a.sent();
return [3 /*break*/, 6];
case 2:
i = 0;
_a.label = 3;
case 3:
if (!(i < remaining.length)) return [3 /*break*/, 6];
nextCurrent = __spreadArray(__spreadArray([], __read(current), false), [remaining[i]], false);
nextRemaining = remaining.slice(0, i).concat(remaining.slice(i + 1));
return [5 /*yield**/, __values(generate(nextCurrent, nextRemaining))];
case 4:
_a.sent();
_a.label = 5;
case 5:
i++;
return [3 /*break*/, 3];
case 6: return [2 /*return*/];
}
});
}
var items;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (length < 0) {
throw new exceptions_1.InvalidArgumentError("Parameter 'length' cannot be negative");
}
items = (0, transform_1.toArray)(data);
return [5 /*yield**/, __values(generate([], items))];
case 1:
_a.sent();
return [2 /*return*/];
}
});
}
/**
* Iterates all permutations of given async iterable.
*
* @param data
* @param length
*/
function permutationsAsync(data, length) {
return __asyncGenerator(this, arguments, function permutationsAsync_1() {
var _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
_a = permutations;
return [4 /*yield*/, __await((0, transform_1.toArrayAsync)(data))];
case 1: return [5 /*yield**/, __values(__asyncDelegator.apply(void 0, [__asyncValues.apply(void 0, [_a.apply(void 0, [_b.sent(), length])])]))];
case 2: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
case 3:
_b.sent();
return [2 /*return*/];
}
});
});
}
/**
* Iterates all combinations of given iterable.
*
* @param data
* @param length
*/
function combinations(data, length) {
var items, n, indices, i, j;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (length < 0) {
throw new exceptions_1.InvalidArgumentError("Parameter 'length' cannot be negative");
}
items = (0, transform_1.toArray)(data);
n = items.length;
if (!(length === 0)) return [3 /*break*/, 2];
return [4 /*yield*/, []];
case 1:
_a.sent();
return [2 /*return*/];
case 2:
if (length > n || length < 0) {
return [2 /*return*/];
}
indices = Array.from({ length: length }, function (_, i) { return i; });
return [4 /*yield*/, indices.map(function (i) { return items[i]; })];
case 3:
_a.sent();
_a.label = 4;
case 4:
if (!true) return [3 /*break*/, 6];
i = length - 1;
// Let's find the index that can be incremented
while (i >= 0 && indices[i] === i + n - length) {
i--;
}
if (i < 0) {
return [3 /*break*/, 6]; // All combinations have been generated
}
indices[i]++;
for (j = i + 1; j < length; j++) {
indices[j] = indices[j - 1] + 1;
}
return [4 /*yield*/, indices.map(function (i) { return items[i]; })];
case 5:
_a.sent();
return [3 /*break*/, 4];
case 6: return [2 /*return*/];
}
});
}
/**
* Iterates all combinations of given async iterable.
*
* @param data
* @param length
*/
function combinationsAsync(data, length) {
return __asyncGenerator(this, arguments, function combinationsAsync_1() {
var _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
_a = combinations;
return [4 /*yield*/, __await((0, transform_1.toArrayAsync)(data))];
case 1: return [5 /*yield**/, __values(__asyncDelegator.apply(void 0, [__asyncValues.apply(void 0, [_a.apply(void 0, [_b.sent(), length])])]))];
case 2: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
case 3:
_b.sent();
return [2 /*return*/];
}
});
});
}
//# sourceMappingURL=combinatorics.js.map