itertools-ts
Version:
Extended itertools port for TypeScript and JavaScript. Provides a huge set of functions for working with iterable collections (including async ones)
179 lines • 7.76 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 __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; }
};
import { toArray, toArrayAsync, toAsyncIterable, toIterable } from "./transform";
import { map, mapAsync } from "./single";
import { InvalidArgumentError } from "./exceptions";
/**
* Iterates cartesian product of given iterables.
*
* @param iterables
*/
export function* cartesianProduct(...iterables) {
if (iterables.length === 0) {
return;
}
if (iterables.length === 1) {
for (const item of toIterable(iterables[0])) {
yield [item];
}
return;
}
const arrays = toArray(map(iterables, (iterable) => toArray(iterable)));
const toIterate = arrays.reduce((acc, set) => acc.flatMap((x) => set.map((y) => [...x, y])), [[]]);
for (const item of toIterate) {
yield item;
}
}
/**
* Iterates cartesian product of given async iterables.
*
* @param iterables
*/
export function cartesianProductAsync(...iterables) {
return __asyncGenerator(this, arguments, function* cartesianProductAsync_1() {
var _a, e_1, _b, _c;
if (iterables.length === 0) {
return yield __await(void 0);
}
if (iterables.length === 1) {
try {
for (var _d = true, _e = __asyncValues(toAsyncIterable(iterables[0])), _f; _f = yield __await(_e.next()), _a = _f.done, !_a; _d = true) {
_c = _f.value;
_d = false;
const item = _c;
yield yield __await([item]);
}
}
catch (e_1_1) { e_1 = { error: e_1_1 }; }
finally {
try {
if (!_d && !_a && (_b = _e.return)) yield __await(_b.call(_e));
}
finally { if (e_1) throw e_1.error; }
}
return yield __await(void 0);
}
const arrays = yield __await(toArrayAsync(mapAsync(iterables, (iterable) => __awaiter(this, void 0, void 0, function* () { return yield toArrayAsync(iterable); }))));
const toIterate = arrays.reduce((acc, set) => acc.flatMap((x) => set.map((y) => [...x, y])), [[]]);
for (const item of toIterate) {
yield yield __await(item);
}
});
}
/**
* Iterates all permutations of given iterable.
*
* @param data
* @param length
*/
export function* permutations(data, length) {
if (length < 0) {
throw new InvalidArgumentError("Parameter 'length' cannot be negative");
}
const items = toArray(data);
function* generate(current, remaining) {
if (current.length === length) {
yield current.slice();
}
else {
for (let i = 0; i < remaining.length; i++) {
const nextCurrent = [...current, remaining[i]];
const nextRemaining = remaining.slice(0, i).concat(remaining.slice(i + 1));
yield* generate(nextCurrent, nextRemaining);
}
}
}
yield* generate([], items);
}
/**
* Iterates all permutations of given async iterable.
*
* @param data
* @param length
*/
export function permutationsAsync(data, length) {
return __asyncGenerator(this, arguments, function* permutationsAsync_1() {
yield __await(yield* __asyncDelegator(__asyncValues(permutations(yield __await(toArrayAsync(data)), length))));
});
}
/**
* Iterates all combinations of given iterable.
*
* @param data
* @param length
*/
export function* combinations(data, length) {
if (length < 0) {
throw new InvalidArgumentError("Parameter 'length' cannot be negative");
}
const items = toArray(data);
const n = items.length;
if (length === 0) {
yield [];
return;
}
if (length > n || length < 0) {
return;
}
const indices = Array.from({ length: length }, (_, i) => i);
yield indices.map((i) => items[i]);
while (true) {
let i = length - 1;
// Let's find the index that can be incremented
while (i >= 0 && indices[i] === i + n - length) {
i--;
}
if (i < 0) {
break; // All combinations have been generated
}
indices[i]++;
for (let j = i + 1; j < length; j++) {
indices[j] = indices[j - 1] + 1;
}
yield indices.map((i) => items[i]);
}
}
/**
* Iterates all combinations of given async iterable.
*
* @param data
* @param length
*/
export function combinationsAsync(data, length) {
return __asyncGenerator(this, arguments, function* combinationsAsync_1() {
yield __await(yield* __asyncDelegator(__asyncValues(combinations(yield __await(toArrayAsync(data)), length))));
});
}
//# sourceMappingURL=combinatorics.js.map