itertools-ts
Version:
Extended itertools port for TypeScript and JavaScript. Provides a huge set of functions for working with iterable collections (including async ones)
786 lines • 31.2 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 __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 __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.AsyncRelatedIterable = exports.AsyncTeeIterator = exports.RelatedIterable = exports.TeeIterator = exports.NoValueMonad = exports.UsageMap = exports.MultipleIterationMode = void 0;
exports.createMultipleIterator = createMultipleIterator;
exports.createAsyncMultipleIterator = createAsyncMultipleIterator;
var exceptions_1 = require("./exceptions");
var index_1 = require("./index");
var transform_1 = require("./transform");
var MultipleIterationMode;
(function (MultipleIterationMode) {
MultipleIterationMode[MultipleIterationMode["SHORTEST"] = 0] = "SHORTEST";
MultipleIterationMode[MultipleIterationMode["LONGEST"] = 1] = "LONGEST";
MultipleIterationMode[MultipleIterationMode["STRICT_EQUAL"] = 2] = "STRICT_EQUAL";
})(MultipleIterationMode || (exports.MultipleIterationMode = MultipleIterationMode = {}));
/**
* Creates iterable instance to iterate several iterables simultaneously.
*
* @param mode shortest, longest or strict equal
* @param iterables
* @param noValueFiller
* @param iterables
*/
function createMultipleIterator(mode, noValueFiller) {
var _i, iterators, iterables_1, iterables_1_1, it_1, statuses, values, allValid, anyValid, statuses_1, statuses_1_1, status, value;
var e_1, _a, e_2, _b;
var iterables = [];
for (_i = 2; _i < arguments.length; _i++) {
iterables[_i - 2] = arguments[_i];
}
return __generator(this, function (_c) {
switch (_c.label) {
case 0:
if (iterables.length === 0) {
return [2 /*return*/];
}
iterators = [];
try {
for (iterables_1 = __values(iterables), iterables_1_1 = iterables_1.next(); !iterables_1_1.done; iterables_1_1 = iterables_1.next()) {
it_1 = iterables_1_1.value;
iterators.push((0, transform_1.toIterator)(it_1));
}
}
catch (e_1_1) { e_1 = { error: e_1_1 }; }
finally {
try {
if (iterables_1_1 && !iterables_1_1.done && (_a = iterables_1.return)) _a.call(iterables_1);
}
finally { if (e_1) throw e_1.error; }
}
_c.label = 1;
case 1:
if (!true) return [3 /*break*/, 3];
statuses = index_1.single.map(iterators, function (it) {
return it.next();
});
values = [];
allValid = true;
anyValid = false;
try {
for (statuses_1 = (e_2 = void 0, __values(statuses)), statuses_1_1 = statuses_1.next(); !statuses_1_1.done; statuses_1_1 = statuses_1.next()) {
status = statuses_1_1.value;
value = void 0;
if (status.done) {
allValid = false;
value = noValueFiller;
}
else {
anyValid = true;
value = status.value;
}
values.push(value);
}
}
catch (e_2_1) { e_2 = { error: e_2_1 }; }
finally {
try {
if (statuses_1_1 && !statuses_1_1.done && (_b = statuses_1.return)) _b.call(statuses_1);
}
finally { if (e_2) throw e_2.error; }
}
if (!allValid && anyValid) {
switch (mode) {
case MultipleIterationMode.SHORTEST:
return [3 /*break*/, 3];
case MultipleIterationMode.STRICT_EQUAL:
throw new exceptions_1.LengthError("Iterators must have equal lengths");
}
}
if (!anyValid) {
return [3 /*break*/, 3];
}
return [4 /*yield*/, values];
case 2:
_c.sent();
return [3 /*break*/, 1];
case 3: return [2 /*return*/];
}
});
}
/**
* Creates async iterable instance to iterate several iterables simultaneously.
*
* @param mode shortest, longest or strict equal
* @param iterables
* @param noValueFiller
* @param iterables
*/
function createAsyncMultipleIterator(mode, noValueFiller) {
var iterables = [];
for (var _i = 2; _i < arguments.length; _i++) {
iterables[_i - 2] = arguments[_i];
}
return __asyncGenerator(this, arguments, function createAsyncMultipleIterator_1() {
var iterators, iterables_2, iterables_2_1, it_2, statuses, iterators_1, iterators_1_1, it_3, status, e_3_1, values, allValid, anyValid, statuses_2, statuses_2_1, status, value;
var e_4, _a, e_3, _b, e_5, _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
if (!(iterables.length === 0)) return [3 /*break*/, 2];
return [4 /*yield*/, __await(void 0)];
case 1: return [2 /*return*/, _d.sent()];
case 2:
iterators = [];
try {
for (iterables_2 = __values(iterables), iterables_2_1 = iterables_2.next(); !iterables_2_1.done; iterables_2_1 = iterables_2.next()) {
it_2 = iterables_2_1.value;
iterators.push((0, transform_1.toAsyncIterator)(it_2));
}
}
catch (e_4_1) { e_4 = { error: e_4_1 }; }
finally {
try {
if (iterables_2_1 && !iterables_2_1.done && (_a = iterables_2.return)) _a.call(iterables_2);
}
finally { if (e_4) throw e_4.error; }
}
_d.label = 3;
case 3:
if (!true) return [3 /*break*/, 14];
statuses = [];
_d.label = 4;
case 4:
_d.trys.push([4, 9, 10, 11]);
iterators_1 = (e_3 = void 0, __values(iterators)), iterators_1_1 = iterators_1.next();
_d.label = 5;
case 5:
if (!!iterators_1_1.done) return [3 /*break*/, 8];
it_3 = iterators_1_1.value;
return [4 /*yield*/, __await(it_3.next())];
case 6:
status = _d.sent();
statuses.push(status);
_d.label = 7;
case 7:
iterators_1_1 = iterators_1.next();
return [3 /*break*/, 5];
case 8: return [3 /*break*/, 11];
case 9:
e_3_1 = _d.sent();
e_3 = { error: e_3_1 };
return [3 /*break*/, 11];
case 10:
try {
if (iterators_1_1 && !iterators_1_1.done && (_b = iterators_1.return)) _b.call(iterators_1);
}
finally { if (e_3) throw e_3.error; }
return [7 /*endfinally*/];
case 11:
values = [];
allValid = true;
anyValid = false;
try {
for (statuses_2 = (e_5 = void 0, __values(statuses)), statuses_2_1 = statuses_2.next(); !statuses_2_1.done; statuses_2_1 = statuses_2.next()) {
status = statuses_2_1.value;
value = void 0;
if (status.done) {
allValid = false;
value = noValueFiller;
}
else {
anyValid = true;
value = status.value;
}
values.push(value);
}
}
catch (e_5_1) { e_5 = { error: e_5_1 }; }
finally {
try {
if (statuses_2_1 && !statuses_2_1.done && (_c = statuses_2.return)) _c.call(statuses_2);
}
finally { if (e_5) throw e_5.error; }
}
if (!allValid && anyValid) {
switch (mode) {
case MultipleIterationMode.SHORTEST:
return [3 /*break*/, 14];
case MultipleIterationMode.STRICT_EQUAL:
throw new exceptions_1.LengthError("Iterators must have equal lengths");
}
}
if (!anyValid) {
return [3 /*break*/, 14];
}
return [4 /*yield*/, __await(values)];
case 12: return [4 /*yield*/, _d.sent()];
case 13:
_d.sent();
return [3 /*break*/, 3];
case 14: return [2 /*return*/];
}
});
});
}
/**
* Internal class for counting unique values usage.
*/
var UsageMap = /** @class */ (function () {
function UsageMap() {
this.addedMap = new Map();
this.deletedMap = new Map();
}
/**
* Adds new usage of value by given owner.
*
* @param value
* @param owner
*/
UsageMap.prototype.addUsage = function (value, owner) {
if (!this.addedMap.has(value)) {
this.addedMap.set(value, new Map());
}
var valueMap = this.addedMap.get(value);
if (!valueMap.has(owner)) {
valueMap.set(owner, 0);
}
valueMap.set(owner, valueMap.get(owner) + 1);
};
/**
* Removes usage of value.
*
* @param value
*/
UsageMap.prototype.deleteUsage = function (value) {
if (!this.deletedMap.has(value)) {
this.deletedMap.set(value, 1);
}
else {
this.deletedMap.set(value, this.deletedMap.get(value) + 1);
}
};
/**
* Returns owners count of given value.
*
* @param value
*/
UsageMap.prototype.getOwnersCount = function (value) {
var _a, _b;
var deletesCount = (_a = this.deletedMap.get(value)) !== null && _a !== void 0 ? _a : 0;
return index_1.Stream.of((_b = this.addedMap.get(value)) !== null && _b !== void 0 ? _b : new Map())
.map(function (datum) { return datum[1]; })
.filter(function (count) { return count > deletesCount; })
.toValue(function (carry) { return carry + 1; }, 0);
};
/**
* Returns usages count of given value.
*
* @param value
* @param maxOwnersCount
*/
UsageMap.prototype.getUsagesCount = function (value, maxOwnersCount) {
var _a, _b;
if (maxOwnersCount === void 0) { maxOwnersCount = 1; }
var deletesCount = (_a = this.deletedMap.get(value)) !== null && _a !== void 0 ? _a : 0;
var owners = index_1.Stream.of((_b = this.addedMap.get(value)) !== null && _b !== void 0 ? _b : new Map())
.map(function (pair) { return pair[1]; })
.map(function (value) { return value - deletesCount; })
.filter(function (value) { return value > 0; })
.toArray();
var _loop_1 = function () {
var minValue = index_1.reduce.toMin(owners);
owners = index_1.Stream.of(owners)
.map(function (value) { return value - minValue; })
.filter(function (value) { return value > 0; })
.toArray();
};
while (owners.length > maxOwnersCount) {
_loop_1();
}
return index_1.reduce.toSum(owners);
};
return UsageMap;
}());
exports.UsageMap = UsageMap;
/**
* No value filler monad.
*/
var NoValueMonad = /** @class */ (function () {
function NoValueMonad() {
}
return NoValueMonad;
}());
exports.NoValueMonad = NoValueMonad;
/**
* Internal tool for duplicating another iterators using cache.
*/
var TeeIterator = /** @class */ (function () {
/**
* TeeIterator constructor
*
* @param iterator
* @param relatedCount
*/
function TeeIterator(iterator, relatedCount) {
this.related = [];
this.positions = [];
this.cache = new Map();
this.lastCacheIndex = 0;
this.isValid = true;
this.iterator = iterator;
for (var i = 0; i < relatedCount; ++i) {
this.related.push(new RelatedIterable(this, i));
this.positions.push(0);
}
this.cacheNextValue();
}
/**
* Returns current value of related iterable.
*
* @param relatedIterable
*/
TeeIterator.prototype.current = function (relatedIterable) {
var index = this.getPosition(relatedIterable);
return this.cache.get(index);
};
/**
* Moves related iterable to the next element.
*
* @param relatedIterable
*/
TeeIterator.prototype.next = function (relatedIterable) {
var _a = __read([
this.getPosition(relatedIterable),
Math.min.apply(Math, __spreadArray([], __read(this.positions), false)),
Math.max.apply(Math, __spreadArray([], __read(this.positions), false)),
], 3), relPos = _a[0], minPos = _a[1], maxPos = _a[2];
if (relPos === maxPos) {
this.cacheNextValue();
}
this.positions[relatedIterable.getId()]++;
if (minPos < Math.min.apply(Math, __spreadArray([], __read(this.positions), false))) {
this.cache.delete(minPos);
}
};
/**
* Returns true if related iterable is not done.
*
* @param relatedIterable
*/
TeeIterator.prototype.valid = function (relatedIterable) {
return (this.getPosition(relatedIterable) < this.lastCacheIndex || this.isValid);
};
/**
* Returns related iterables list.
*/
TeeIterator.prototype.getRelatedIterables = function () {
return this.related;
};
/**
* Gets and caches the next element of parent iterator.
*
* @private
*/
TeeIterator.prototype.cacheNextValue = function () {
var status = this.iterator.next();
if (!status.done) {
this.cache.set(this.lastCacheIndex++, status.value);
}
this.isValid = !status.done;
};
/**
* Returns current position index of related iterable.
*
* @param related
*/
TeeIterator.prototype.getPosition = function (related) {
return this.positions[related.getId()];
};
return TeeIterator;
}());
exports.TeeIterator = TeeIterator;
/**
* Duplicated iterable.
*/
var RelatedIterable = /** @class */ (function () {
/**
* RelatedIterable constructor.
*
* @param parentIterable
* @param id
*/
function RelatedIterable(parentIterable, id) {
this.parent = parentIterable;
this.id = id;
}
/**
* Id getter.
*/
RelatedIterable.prototype.getId = function () {
return this.id;
};
/**
* Returns true if the iterator is valid.
*/
RelatedIterable.prototype.valid = function () {
return this.parent.valid(this);
};
/**
* Moves the iterator to the next element.
*/
RelatedIterable.prototype.next = function () {
var result = { value: this.current(), done: !this.valid() };
if (!result.done) {
this.parent.next(this);
}
return result;
};
/**
* Returns current value of the iterator.
*/
RelatedIterable.prototype.current = function () {
return this.parent.valid(this) ? this.parent.current(this) : undefined;
};
/**
* Aggregated iterator.
*/
RelatedIterable.prototype[Symbol.iterator] = function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!this.parent.valid(this)) return [3 /*break*/, 2];
return [4 /*yield*/, this.parent.current(this)];
case 1:
_a.sent();
this.parent.next(this);
return [3 /*break*/, 0];
case 2: return [2 /*return*/];
}
});
};
return RelatedIterable;
}());
exports.RelatedIterable = RelatedIterable;
/**
* Internal tool for duplicating another async iterators using cache.
*/
var AsyncTeeIterator = /** @class */ (function () {
/**
* AsyncTeeIterator constructor
*
* @param iterator
* @param relatedCount
*/
function AsyncTeeIterator(iterator, relatedCount) {
this.related = [];
this.positions = [];
this.cache = new Map();
this.lastCacheIndex = 0;
this.isValid = true;
this.isFirstIteration = true;
this.iterator = iterator;
for (var i = 0; i < relatedCount; ++i) {
this.related.push(new AsyncRelatedIterable(this, i));
this.positions.push(0);
}
}
/**
* Returns current value of related iterable.
*
* @param relatedIterable
*/
AsyncTeeIterator.prototype.current = function (relatedIterable) {
return __awaiter(this, void 0, void 0, function () {
var index;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!this.isFirstIteration) return [3 /*break*/, 2];
return [4 /*yield*/, this.cacheNextValue()];
case 1:
_a.sent();
_a.label = 2;
case 2:
index = this.getPosition(relatedIterable);
return [2 /*return*/, this.cache.get(index)];
}
});
});
};
/**
* Moves related iterable to the next element.
*
* @param relatedIterable
*/
AsyncTeeIterator.prototype.next = function (relatedIterable) {
return __awaiter(this, void 0, void 0, function () {
var _a, relPos, minPos, maxPos;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
_a = __read([
this.getPosition(relatedIterable),
Math.min.apply(Math, __spreadArray([], __read(this.positions), false)),
Math.max.apply(Math, __spreadArray([], __read(this.positions), false)),
], 3), relPos = _a[0], minPos = _a[1], maxPos = _a[2];
if (!(relPos === maxPos)) return [3 /*break*/, 2];
return [4 /*yield*/, this.cacheNextValue()];
case 1:
_b.sent();
_b.label = 2;
case 2:
this.positions[relatedIterable.getId()]++;
if (minPos < Math.min.apply(Math, __spreadArray([], __read(this.positions), false))) {
this.cache.delete(minPos);
}
return [2 /*return*/];
}
});
});
};
/**
* Returns true if related iterable is not done.
*
* @param relatedIterable
*/
AsyncTeeIterator.prototype.valid = function (relatedIterable) {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
if (!this.isFirstIteration) return [3 /*break*/, 2];
return [4 /*yield*/, this.cacheNextValue()];
case 1:
_a.sent();
_a.label = 2;
case 2: return [2 /*return*/, (this.getPosition(relatedIterable) < this.lastCacheIndex || this.isValid)];
}
});
});
};
/**
* Returns related iterables list.
*/
AsyncTeeIterator.prototype.getRelatedIterables = function () {
return this.related;
};
/**
* Gets and caches the next element of parent iterator.
*
* @private
*/
AsyncTeeIterator.prototype.cacheNextValue = function () {
return __awaiter(this, void 0, void 0, function () {
var status;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.iterator.next()];
case 1:
status = _a.sent();
if (!status.done) {
this.cache.set(this.lastCacheIndex++, status.value);
}
this.isFirstIteration = false;
this.isValid = !status.done;
return [2 /*return*/];
}
});
});
};
/**
* Returns current position index of related iterable.
*
* @param related
*/
AsyncTeeIterator.prototype.getPosition = function (related) {
return this.positions[related.getId()];
};
return AsyncTeeIterator;
}());
exports.AsyncTeeIterator = AsyncTeeIterator;
/**
* Duplicated async iterable.
*/
var AsyncRelatedIterable = /** @class */ (function () {
/**
* AsyncRelatedIterable constructor.
*
* @param parentIterable
* @param id
*/
function AsyncRelatedIterable(parentIterable, id) {
this.parent = parentIterable;
this.id = id;
}
/**
* Id getter.
*/
AsyncRelatedIterable.prototype.getId = function () {
return this.id;
};
/**
* Returns true if the iterator is valid.
*/
AsyncRelatedIterable.prototype.valid = function () {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, this.parent.valid(this)];
case 1: return [2 /*return*/, _a.sent()];
}
});
});
};
/**
* Moves the iterator to the next element.
*/
AsyncRelatedIterable.prototype.next = function () {
return __awaiter(this, void 0, void 0, function () {
var result;
var _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0:
_a = {};
return [4 /*yield*/, this.current()];
case 1:
_a.value = _b.sent();
return [4 /*yield*/, this.valid()];
case 2:
result = (_a.done = !(_b.sent()), _a);
if (!!result.done) return [3 /*break*/, 4];
return [4 /*yield*/, this.parent.next(this)];
case 3:
_b.sent();
_b.label = 4;
case 4: return [2 /*return*/, result];
}
});
});
};
/**
* Returns current value of the iterator.
*/
AsyncRelatedIterable.prototype.current = function () {
return __awaiter(this, void 0, void 0, function () {
var _a;
return __generator(this, function (_b) {
switch (_b.label) {
case 0: return [4 /*yield*/, this.parent.valid(this)];
case 1:
if (!(_b.sent())) return [3 /*break*/, 3];
return [4 /*yield*/, this.parent.current(this)];
case 2:
_a = _b.sent();
return [3 /*break*/, 4];
case 3:
_a = undefined;
_b.label = 4;
case 4: return [2 /*return*/, _a];
}
});
});
};
/**
* Aggregated iterator.
*/
AsyncRelatedIterable.prototype[Symbol.asyncIterator] = function () {
return __asyncGenerator(this, arguments, function _a() {
return __generator(this, function (_b) {
switch (_b.label) {
case 0: return [4 /*yield*/, __await(this.parent.valid(this))];
case 1:
if (!_b.sent()) return [3 /*break*/, 6];
return [4 /*yield*/, __await(this.parent.current(this))];
case 2: return [4 /*yield*/, __await.apply(void 0, [_b.sent()])];
case 3: return [4 /*yield*/, _b.sent()];
case 4:
_b.sent();
return [4 /*yield*/, __await(this.parent.next(this))];
case 5:
_b.sent();
return [3 /*break*/, 0];
case 6: return [2 /*return*/];
}
});
});
};
return AsyncRelatedIterable;
}());
exports.AsyncRelatedIterable = AsyncRelatedIterable;
//# sourceMappingURL=tools.js.map