itertools-ts
Version:
Extended itertools port for TypeScript and JavaScript. Provides a huge set of functions for working with iterable collections (including async ones)
848 lines • 36.7 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 __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.distinct = distinct;
exports.distinctAsync = distinctAsync;
exports.intersection = intersection;
exports.intersectionAsync = intersectionAsync;
exports.partialIntersection = partialIntersection;
exports.partialIntersectionAsync = partialIntersectionAsync;
exports.symmetricDifference = symmetricDifference;
exports.symmetricDifferenceAsync = symmetricDifferenceAsync;
exports.union = union;
exports.unionAsync = unionAsync;
exports.cartesianProduct = cartesianProduct;
exports.cartesianProductAsync = cartesianProductAsync;
var transform_1 = require("./transform");
var tools_1 = require("./tools");
var single_1 = require("./single");
var index_1 = require("./index");
/**
* Iterate only the distinct elements.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param data
* @param compareBy
*/
function distinct(data, compareBy) {
var used, data_1, data_1_1, datum, comparable, e_1_1, _a, _b, datum, comparable, e_2_1;
var e_1, _c, e_2, _d;
return __generator(this, function (_e) {
switch (_e.label) {
case 0:
used = new Set();
if (!(data instanceof Map)) return [3 /*break*/, 9];
if (compareBy === undefined) {
compareBy = function (datum) { return datum[1]; };
}
_e.label = 1;
case 1:
_e.trys.push([1, 6, 7, 8]);
data_1 = __values(data), data_1_1 = data_1.next();
_e.label = 2;
case 2:
if (!!data_1_1.done) return [3 /*break*/, 5];
datum = data_1_1.value;
comparable = compareBy(datum);
if (!!used.has(comparable)) return [3 /*break*/, 4];
return [4 /*yield*/, datum];
case 3:
_e.sent();
used.add(comparable);
_e.label = 4;
case 4:
data_1_1 = data_1.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 (data_1_1 && !data_1_1.done && (_c = data_1.return)) _c.call(data_1);
}
finally { if (e_1) throw e_1.error; }
return [7 /*endfinally*/];
case 8: return [3 /*break*/, 17];
case 9:
if (compareBy === undefined) {
compareBy = function (datum) { return datum; };
}
_e.label = 10;
case 10:
_e.trys.push([10, 15, 16, 17]);
_a = __values((0, transform_1.toIterable)(data)), _b = _a.next();
_e.label = 11;
case 11:
if (!!_b.done) return [3 /*break*/, 14];
datum = _b.value;
comparable = compareBy(datum);
if (!!used.has(comparable)) return [3 /*break*/, 13];
return [4 /*yield*/, datum];
case 12:
_e.sent();
used.add(comparable);
_e.label = 13;
case 13:
_b = _a.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 (_b && !_b.done && (_d = _a.return)) _d.call(_a);
}
finally { if (e_2) throw e_2.error; }
return [7 /*endfinally*/];
case 17: return [2 /*return*/];
}
});
}
/**
* Iterate only the distinct elements from async collection.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param data
* @param compareBy
*/
function distinctAsync(data, compareBy) {
return __asyncGenerator(this, arguments, function distinctAsync_1() {
var used, _a, _b, datum, e_3_1, _c, _d, _e, datum, comparable, e_4_1;
var e_3, _f;
var _g, e_4, _h, _j;
return __generator(this, function (_k) {
switch (_k.label) {
case 0:
used = new Set();
if (!(data instanceof Map)) return [3 /*break*/, 11];
_k.label = 1;
case 1:
_k.trys.push([1, 8, 9, 10]);
_a = __values(distinct(data, compareBy)), _b = _a.next();
_k.label = 2;
case 2:
if (!!_b.done) return [3 /*break*/, 7];
datum = _b.value;
return [4 /*yield*/, __await(datum)];
case 3: return [4 /*yield*/, __await.apply(void 0, [_k.sent()])];
case 4: return [4 /*yield*/, _k.sent()];
case 5:
_k.sent();
_k.label = 6;
case 6:
_b = _a.next();
return [3 /*break*/, 2];
case 7: return [3 /*break*/, 10];
case 8:
e_3_1 = _k.sent();
e_3 = { error: e_3_1 };
return [3 /*break*/, 10];
case 9:
try {
if (_b && !_b.done && (_f = _a.return)) _f.call(_a);
}
finally { if (e_3) throw e_3.error; }
return [7 /*endfinally*/];
case 10: return [3 /*break*/, 25];
case 11:
if (compareBy === undefined) {
compareBy = function (datum) { return datum; };
}
_k.label = 12;
case 12:
_k.trys.push([12, 19, 20, 25]);
_c = true, _d = __asyncValues((0, transform_1.toAsyncIterable)(data));
_k.label = 13;
case 13: return [4 /*yield*/, __await(_d.next())];
case 14:
if (!(_e = _k.sent(), _g = _e.done, !_g)) return [3 /*break*/, 18];
_j = _e.value;
_c = false;
datum = _j;
comparable = compareBy(datum);
if (!!used.has(comparable)) return [3 /*break*/, 17];
return [4 /*yield*/, __await(datum)];
case 15: return [4 /*yield*/, _k.sent()];
case 16:
_k.sent();
used.add(comparable);
_k.label = 17;
case 17:
_c = true;
return [3 /*break*/, 13];
case 18: return [3 /*break*/, 25];
case 19:
e_4_1 = _k.sent();
e_4 = { error: e_4_1 };
return [3 /*break*/, 25];
case 20:
_k.trys.push([20, , 23, 24]);
if (!(!_c && !_g && (_h = _d.return))) return [3 /*break*/, 22];
return [4 /*yield*/, __await(_h.call(_d))];
case 21:
_k.sent();
_k.label = 22;
case 22: return [3 /*break*/, 24];
case 23:
if (e_4) throw e_4.error;
return [7 /*endfinally*/];
case 24: return [7 /*endfinally*/];
case 25: return [2 /*return*/];
}
});
});
}
/**
* Iterates the intersection of iterables using type coercion.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function intersection() {
var _i;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(partialIntersection.apply(void 0, __spreadArray([iterables.length], __read(iterables), false)))];
case 1:
_a.sent();
return [2 /*return*/];
}
});
}
/**
* Iterates the intersection of async iterables using type coercion.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function intersectionAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function intersectionAsync_1() {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(__asyncDelegator(__asyncValues(partialIntersectionAsync.apply(void 0, __spreadArray([iterables.length], __read(iterables), false)))))];
case 1: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
case 2:
_a.sent();
return [2 /*return*/];
}
});
});
}
/**
* Iterates partial intersection of iterables.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
* If `minIntersectionCount` is 1, then multiset union rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param minIntersectionCount
* @param iterables
*/
function partialIntersection(minIntersectionCount) {
var _i, usageMap, multipleIterator, multipleIterator_1, multipleIterator_1_1, values, _a, _b, _c, owner, value, e_5_1, e_6_1;
var e_6, _d, e_5, _e;
var iterables = [];
for (_i = 1; _i < arguments.length; _i++) {
iterables[_i - 1] = arguments[_i];
}
return __generator(this, function (_f) {
switch (_f.label) {
case 0:
usageMap = new tools_1.UsageMap();
multipleIterator = tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
tools_1.NoValueMonad], __read(iterables), false));
_f.label = 1;
case 1:
_f.trys.push([1, 12, 13, 14]);
multipleIterator_1 = __values(multipleIterator), multipleIterator_1_1 = multipleIterator_1.next();
_f.label = 2;
case 2:
if (!!multipleIterator_1_1.done) return [3 /*break*/, 11];
values = multipleIterator_1_1.value;
_f.label = 3;
case 3:
_f.trys.push([3, 8, 9, 10]);
_a = (e_5 = void 0, __values((0, single_1.enumerate)(values))), _b = _a.next();
_f.label = 4;
case 4:
if (!!_b.done) return [3 /*break*/, 7];
_c = __read(_b.value, 2), owner = _c[0], value = _c[1];
if (value === tools_1.NoValueMonad) {
return [3 /*break*/, 6];
}
usageMap.addUsage(value, "".concat(owner));
if (!(usageMap.getOwnersCount(value) === minIntersectionCount)) return [3 /*break*/, 6];
return [4 /*yield*/, value];
case 5:
_f.sent();
usageMap.deleteUsage(value);
_f.label = 6;
case 6:
_b = _a.next();
return [3 /*break*/, 4];
case 7: return [3 /*break*/, 10];
case 8:
e_5_1 = _f.sent();
e_5 = { error: e_5_1 };
return [3 /*break*/, 10];
case 9:
try {
if (_b && !_b.done && (_e = _a.return)) _e.call(_a);
}
finally { if (e_5) throw e_5.error; }
return [7 /*endfinally*/];
case 10:
multipleIterator_1_1 = multipleIterator_1.next();
return [3 /*break*/, 2];
case 11: return [3 /*break*/, 14];
case 12:
e_6_1 = _f.sent();
e_6 = { error: e_6_1 };
return [3 /*break*/, 14];
case 13:
try {
if (multipleIterator_1_1 && !multipleIterator_1_1.done && (_d = multipleIterator_1.return)) _d.call(multipleIterator_1);
}
finally { if (e_6) throw e_6.error; }
return [7 /*endfinally*/];
case 14: return [2 /*return*/];
}
});
}
/**
* Iterates partial intersection of async iterables.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
* If `minIntersectionCount` is 1, then multiset union rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param minIntersectionCount
* @param iterables
*/
function partialIntersectionAsync(minIntersectionCount) {
var iterables = [];
for (var _i = 1; _i < arguments.length; _i++) {
iterables[_i - 1] = arguments[_i];
}
return __asyncGenerator(this, arguments, function partialIntersectionAsync_1() {
var usageMap, multipleIterator, _a, multipleIterator_2, multipleIterator_2_1, values, _b, _c, _d, owner, value, e_7_1, e_8_1;
var e_7, _e;
var _f, e_8, _g, _h;
return __generator(this, function (_j) {
switch (_j.label) {
case 0:
usageMap = new tools_1.UsageMap();
multipleIterator = tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
tools_1.NoValueMonad], __read(iterables), false));
_j.label = 1;
case 1:
_j.trys.push([1, 14, 15, 20]);
_a = true, multipleIterator_2 = __asyncValues(multipleIterator);
_j.label = 2;
case 2: return [4 /*yield*/, __await(multipleIterator_2.next())];
case 3:
if (!(multipleIterator_2_1 = _j.sent(), _f = multipleIterator_2_1.done, !_f)) return [3 /*break*/, 13];
_h = multipleIterator_2_1.value;
_a = false;
values = _h;
_j.label = 4;
case 4:
_j.trys.push([4, 10, 11, 12]);
_b = (e_7 = void 0, __values((0, single_1.enumerate)(values))), _c = _b.next();
_j.label = 5;
case 5:
if (!!_c.done) return [3 /*break*/, 9];
_d = __read(_c.value, 2), owner = _d[0], value = _d[1];
if (value === tools_1.NoValueMonad) {
return [3 /*break*/, 8];
}
usageMap.addUsage(value, "".concat(owner));
if (!(usageMap.getOwnersCount(value) === minIntersectionCount)) return [3 /*break*/, 8];
return [4 /*yield*/, __await(value)];
case 6: return [4 /*yield*/, _j.sent()];
case 7:
_j.sent();
usageMap.deleteUsage(value);
_j.label = 8;
case 8:
_c = _b.next();
return [3 /*break*/, 5];
case 9: return [3 /*break*/, 12];
case 10:
e_7_1 = _j.sent();
e_7 = { error: e_7_1 };
return [3 /*break*/, 12];
case 11:
try {
if (_c && !_c.done && (_e = _b.return)) _e.call(_b);
}
finally { if (e_7) throw e_7.error; }
return [7 /*endfinally*/];
case 12:
_a = true;
return [3 /*break*/, 2];
case 13: return [3 /*break*/, 20];
case 14:
e_8_1 = _j.sent();
e_8 = { error: e_8_1 };
return [3 /*break*/, 20];
case 15:
_j.trys.push([15, , 18, 19]);
if (!(!_a && !_f && (_g = multipleIterator_2.return))) return [3 /*break*/, 17];
return [4 /*yield*/, __await(_g.call(multipleIterator_2))];
case 16:
_j.sent();
_j.label = 17;
case 17: return [3 /*break*/, 19];
case 18:
if (e_8) throw e_8.error;
return [7 /*endfinally*/];
case 19: return [7 /*endfinally*/];
case 20: return [2 /*return*/];
}
});
});
}
/**
* Iterates the symmetric difference of iterables.
*
* If input iterables produce duplicate items, then multiset difference rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function symmetricDifference() {
var _i, usageMap, valuesSet, multipleIterator, multipleIterator_3, multipleIterator_3_1, values, _a, _b, _c, owner, value, valuesSet_1, valuesSet_1_1, value, _d, _e, item, e_9_1, e_10_1;
var e_11, _f, e_12, _g, e_10, _h, e_9, _j;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_k) {
switch (_k.label) {
case 0:
usageMap = new tools_1.UsageMap();
valuesSet = new Set();
multipleIterator = tools_1.createMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
tools_1.NoValueMonad], __read(iterables), false));
try {
for (multipleIterator_3 = __values(multipleIterator), multipleIterator_3_1 = multipleIterator_3.next(); !multipleIterator_3_1.done; multipleIterator_3_1 = multipleIterator_3.next()) {
values = multipleIterator_3_1.value;
try {
for (_a = (e_12 = void 0, __values((0, single_1.enumerate)(values))), _b = _a.next(); !_b.done; _b = _a.next()) {
_c = __read(_b.value, 2), owner = _c[0], value = _c[1];
if (value === tools_1.NoValueMonad) {
continue;
}
usageMap.addUsage(value, "".concat(owner));
valuesSet.add(value);
if (usageMap.getOwnersCount(value) === iterables.length) {
usageMap.deleteUsage(value);
}
}
}
catch (e_12_1) { e_12 = { error: e_12_1 }; }
finally {
try {
if (_b && !_b.done && (_g = _a.return)) _g.call(_a);
}
finally { if (e_12) throw e_12.error; }
}
}
}
catch (e_11_1) { e_11 = { error: e_11_1 }; }
finally {
try {
if (multipleIterator_3_1 && !multipleIterator_3_1.done && (_f = multipleIterator_3.return)) _f.call(multipleIterator_3);
}
finally { if (e_11) throw e_11.error; }
}
_k.label = 1;
case 1:
_k.trys.push([1, 12, 13, 14]);
valuesSet_1 = __values(valuesSet), valuesSet_1_1 = valuesSet_1.next();
_k.label = 2;
case 2:
if (!!valuesSet_1_1.done) return [3 /*break*/, 11];
value = valuesSet_1_1.value;
_k.label = 3;
case 3:
_k.trys.push([3, 8, 9, 10]);
_d = (e_9 = void 0, __values(index_1.single.repeat(value, usageMap.getUsagesCount(value)))), _e = _d.next();
_k.label = 4;
case 4:
if (!!_e.done) return [3 /*break*/, 7];
item = _e.value;
return [4 /*yield*/, item];
case 5:
_k.sent();
_k.label = 6;
case 6:
_e = _d.next();
return [3 /*break*/, 4];
case 7: return [3 /*break*/, 10];
case 8:
e_9_1 = _k.sent();
e_9 = { error: e_9_1 };
return [3 /*break*/, 10];
case 9:
try {
if (_e && !_e.done && (_j = _d.return)) _j.call(_d);
}
finally { if (e_9) throw e_9.error; }
return [7 /*endfinally*/];
case 10:
valuesSet_1_1 = valuesSet_1.next();
return [3 /*break*/, 2];
case 11: return [3 /*break*/, 14];
case 12:
e_10_1 = _k.sent();
e_10 = { error: e_10_1 };
return [3 /*break*/, 14];
case 13:
try {
if (valuesSet_1_1 && !valuesSet_1_1.done && (_h = valuesSet_1.return)) _h.call(valuesSet_1);
}
finally { if (e_10) throw e_10.error; }
return [7 /*endfinally*/];
case 14: return [2 /*return*/];
}
});
}
/**
* Iterates the symmetric difference of async iterables.
*
* If input iterables produce duplicate items, then multiset difference rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function symmetricDifferenceAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function symmetricDifferenceAsync_1() {
var usageMap, valuesSet, multipleIterator, _a, multipleIterator_4, multipleIterator_4_1, values, _b, _c, _d, owner, value, e_13_1, valuesSet_2, valuesSet_2_1, value, _e, _f, item, e_14_1, e_15_1;
var e_16, _g, e_15, _h, e_14, _j;
var _k, e_13, _l, _m;
return __generator(this, function (_o) {
switch (_o.label) {
case 0:
usageMap = new tools_1.UsageMap();
valuesSet = new Set();
multipleIterator = tools_1.createAsyncMultipleIterator.apply(void 0, __spreadArray([tools_1.MultipleIterationMode.LONGEST,
tools_1.NoValueMonad], __read(iterables), false));
_o.label = 1;
case 1:
_o.trys.push([1, 6, 7, 12]);
_a = true, multipleIterator_4 = __asyncValues(multipleIterator);
_o.label = 2;
case 2: return [4 /*yield*/, __await(multipleIterator_4.next())];
case 3:
if (!(multipleIterator_4_1 = _o.sent(), _k = multipleIterator_4_1.done, !_k)) return [3 /*break*/, 5];
_m = multipleIterator_4_1.value;
_a = false;
values = _m;
try {
for (_b = (e_16 = void 0, __values((0, single_1.enumerate)(values))), _c = _b.next(); !_c.done; _c = _b.next()) {
_d = __read(_c.value, 2), owner = _d[0], value = _d[1];
if (value === tools_1.NoValueMonad) {
continue;
}
usageMap.addUsage(value, "".concat(owner));
valuesSet.add(value);
if (usageMap.getOwnersCount(value) === iterables.length) {
usageMap.deleteUsage(value);
}
}
}
catch (e_16_1) { e_16 = { error: e_16_1 }; }
finally {
try {
if (_c && !_c.done && (_g = _b.return)) _g.call(_b);
}
finally { if (e_16) throw e_16.error; }
}
_o.label = 4;
case 4:
_a = true;
return [3 /*break*/, 2];
case 5: return [3 /*break*/, 12];
case 6:
e_13_1 = _o.sent();
e_13 = { error: e_13_1 };
return [3 /*break*/, 12];
case 7:
_o.trys.push([7, , 10, 11]);
if (!(!_a && !_k && (_l = multipleIterator_4.return))) return [3 /*break*/, 9];
return [4 /*yield*/, __await(_l.call(multipleIterator_4))];
case 8:
_o.sent();
_o.label = 9;
case 9: return [3 /*break*/, 11];
case 10:
if (e_13) throw e_13.error;
return [7 /*endfinally*/];
case 11: return [7 /*endfinally*/];
case 12:
_o.trys.push([12, 24, 25, 26]);
valuesSet_2 = __values(valuesSet), valuesSet_2_1 = valuesSet_2.next();
_o.label = 13;
case 13:
if (!!valuesSet_2_1.done) return [3 /*break*/, 23];
value = valuesSet_2_1.value;
_o.label = 14;
case 14:
_o.trys.push([14, 20, 21, 22]);
_e = (e_14 = void 0, __values(index_1.single.repeat(value, usageMap.getUsagesCount(value)))), _f = _e.next();
_o.label = 15;
case 15:
if (!!_f.done) return [3 /*break*/, 19];
item = _f.value;
return [4 /*yield*/, __await(item)];
case 16: return [4 /*yield*/, _o.sent()];
case 17:
_o.sent();
_o.label = 18;
case 18:
_f = _e.next();
return [3 /*break*/, 15];
case 19: return [3 /*break*/, 22];
case 20:
e_14_1 = _o.sent();
e_14 = { error: e_14_1 };
return [3 /*break*/, 22];
case 21:
try {
if (_f && !_f.done && (_j = _e.return)) _j.call(_e);
}
finally { if (e_14) throw e_14.error; }
return [7 /*endfinally*/];
case 22:
valuesSet_2_1 = valuesSet_2.next();
return [3 /*break*/, 13];
case 23: return [3 /*break*/, 26];
case 24:
e_15_1 = _o.sent();
e_15 = { error: e_15_1 };
return [3 /*break*/, 26];
case 25:
try {
if (valuesSet_2_1 && !valuesSet_2_1.done && (_h = valuesSet_2.return)) _h.call(valuesSet_2);
}
finally { if (e_15) throw e_15.error; }
return [7 /*endfinally*/];
case 26: return [2 /*return*/];
}
});
});
}
/**
* Iterates union of given iterables.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function union() {
var _i;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(partialIntersection.apply(void 0, __spreadArray([1], __read(iterables), false)))];
case 1:
_a.sent();
return [2 /*return*/];
}
});
}
/**
* Iterates union of given async iterables.
*
* If input iterables produce duplicate items, then multiset intersection rules apply.
*
* Always treats different instances of objects and arrays as unequal.
*
* @param iterables
*/
function unionAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function unionAsync_1() {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(__asyncDelegator(__asyncValues(partialIntersectionAsync.apply(void 0, __spreadArray([1], __read(iterables), false)))))];
case 1: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
case 2:
_a.sent();
return [2 /*return*/];
}
});
});
}
/**
* Iterates cartesian product of given iterables.
*
* @param iterables
*
* @deprecated Use `combinatorics.cartesianProduct()` instead.
*/
function cartesianProduct() {
var _i;
var iterables = [];
for (_i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(index_1.combinatorics.cartesianProduct.apply(index_1.combinatorics, __spreadArray([], __read(iterables), false)))];
case 1:
_a.sent();
return [2 /*return*/];
}
});
}
/**
* Iterates cartesian product of given async iterables.
*
* @param iterables
*
* @deprecated Use `combinatorics.cartesianProductAsync()` instead.
*/
function cartesianProductAsync() {
var iterables = [];
for (var _i = 0; _i < arguments.length; _i++) {
iterables[_i] = arguments[_i];
}
return __asyncGenerator(this, arguments, function cartesianProductAsync_1() {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [5 /*yield**/, __values(__asyncDelegator(__asyncValues(index_1.combinatorics.cartesianProductAsync.apply(index_1.combinatorics, __spreadArray([], __read(iterables), false)))))];
case 1: return [4 /*yield*/, __await.apply(void 0, [_a.sent()])];
case 2:
_a.sent();
return [2 /*return*/];
}
});
});
}
//# sourceMappingURL=set.js.map