UNPKG

ramda-generators

Version:

A collection of lazily evaluated generators and functions to work with generators in Javascript and Typescript, following the style of Ramda's functions

163 lines 8.02 kB
"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; return g = { next: verb(0), "throw": verb(1), "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 (_) 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 = {}, verb("next"), verb("throw"), verb("return"), i[Symbol.asyncIterator] = function () { return this; }, i; function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; } 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."); }; Object.defineProperty(exports, "__esModule", { value: true }); /* eslint-disable max-len */ var ramda_1 = require("ramda"); function _splitEvery(size, gen) { var res, gen_1, gen_1_1, value, e_1_1; var e_1, _a; return __generator(this, function (_b) { switch (_b.label) { case 0: res = []; _b.label = 1; case 1: _b.trys.push([1, 7, 8, 9]); gen_1 = __values(gen), gen_1_1 = gen_1.next(); _b.label = 2; case 2: if (!!gen_1_1.done) return [3 /*break*/, 6]; value = gen_1_1.value; if (!(res.length === size)) return [3 /*break*/, 4]; return [4 /*yield*/, res]; case 3: _b.sent(); res = []; _b.label = 4; case 4: res.push(value); _b.label = 5; case 5: gen_1_1 = gen_1.next(); return [3 /*break*/, 2]; case 6: return [3 /*break*/, 9]; case 7: e_1_1 = _b.sent(); e_1 = { error: e_1_1 }; return [3 /*break*/, 9]; case 8: try { if (gen_1_1 && !gen_1_1.done && (_a = gen_1.return)) _a.call(gen_1); } finally { if (e_1) throw e_1.error; } return [7 /*endfinally*/]; case 9: return [4 /*yield*/, res]; case 10: _b.sent(); return [2 /*return*/]; } }); } function _splitEveryAsync(size, gen) { return __asyncGenerator(this, arguments, function _splitEveryAsync_1() { var res, gen_2, gen_2_1, value, e_2_1; var e_2, _a; return __generator(this, function (_b) { switch (_b.label) { case 0: res = []; _b.label = 1; case 1: _b.trys.push([1, 9, 10, 15]); gen_2 = __asyncValues(gen); _b.label = 2; case 2: return [4 /*yield*/, __await(gen_2.next())]; case 3: if (!(gen_2_1 = _b.sent(), !gen_2_1.done)) return [3 /*break*/, 8]; value = gen_2_1.value; if (!(res.length === size)) return [3 /*break*/, 6]; return [4 /*yield*/, __await(res)]; case 4: return [4 /*yield*/, _b.sent()]; case 5: _b.sent(); res = []; _b.label = 6; case 6: res.push(value); _b.label = 7; case 7: return [3 /*break*/, 2]; case 8: return [3 /*break*/, 15]; case 9: e_2_1 = _b.sent(); e_2 = { error: e_2_1 }; return [3 /*break*/, 15]; case 10: _b.trys.push([10, , 13, 14]); if (!(gen_2_1 && !gen_2_1.done && (_a = gen_2.return))) return [3 /*break*/, 12]; return [4 /*yield*/, __await(_a.call(gen_2))]; case 11: _b.sent(); _b.label = 12; case 12: return [3 /*break*/, 14]; case 13: if (e_2) throw e_2.error; return [7 /*endfinally*/]; case 14: return [7 /*endfinally*/]; case 15: return [4 /*yield*/, __await(res)]; case 16: return [4 /*yield*/, _b.sent()]; case 17: _b.sent(); return [2 /*return*/]; } }); }); } exports.splitEvery = ramda_1.curryN(2, _splitEvery); exports.splitEveryAsync = ramda_1.curryN(2, _splitEveryAsync); //# sourceMappingURL=splitEvery.js.map