UNPKG

geninq

Version:

A JavaScript version of the Linq library for Generators

87 lines (86 loc) 4.46 kB
"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 __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]); } }; Object.defineProperty(exports, "__esModule", { value: true }); const utils_1 = require("./utils"); require("./select"); require("./array"); const safe_type_1 = require("@paulpopat/safe-type"); function BuildArguments(args) { const default_key_selector = (i) => i; const default_comparitor = (a, b) => { (0, safe_type_1.Assert)((0, safe_type_1.IsUnion)(safe_type_1.IsString, safe_type_1.IsNumber), a); (0, safe_type_1.Assert)((0, safe_type_1.IsUnion)(safe_type_1.IsString, safe_type_1.IsNumber), b); return a > b; }; if (args.length === 0) { return { key_selector: default_key_selector, comparitor: default_comparitor, descending: false, }; } return (0, safe_type_1.PatternMatch)((0, safe_type_1.IsTuple)(safe_type_1.IsString), (0, safe_type_1.IsTuple)(safe_type_1.IsFunction, safe_type_1.IsString), (0, safe_type_1.IsTuple)(safe_type_1.IsFunction, safe_type_1.IsFunction, safe_type_1.IsString), (0, safe_type_1.IsTuple)(safe_type_1.IsFunction), (0, safe_type_1.IsTuple)(safe_type_1.IsFunction, safe_type_1.IsFunction))(([descending]) => ({ key_selector: default_key_selector, comparitor: default_comparitor, descending: descending != null, }), ([key_selector, descending]) => ({ key_selector, comparitor: default_comparitor, descending: descending != null, }), ([key_selector, comparitor, descending]) => ({ key_selector, comparitor, descending: descending != null, }), ([key_selector]) => ({ key_selector, comparitor: default_comparitor, descending: false, }), ([key_selector, comparitor]) => ({ key_selector, comparitor, descending: false, }))([...args]); } (0, utils_1.Build)("order_by", function* () { const m = BuildArguments(arguments); let new_subject = this.select((i) => [m.key_selector(i), i]) .array() .sort(([a], [b]) => (m.comparitor(a, b) ? 1 : -1)); if (m.descending) { new_subject = new_subject.reverse(); } for (const item of new_subject) { yield item[1]; } }, function () { return __asyncGenerator(this, arguments, function* () { const m = BuildArguments(arguments); let new_subject = (yield __await(this.select((i) => __awaiter(this, void 0, void 0, function* () { return [yield m.key_selector(i), i]; })).array())).sort(([a], [b]) => (m.comparitor(a, b) ? 1 : -1)); if (m.descending) { new_subject = new_subject.reverse(); } for (const item of new_subject) { yield yield __await(item[1]); } }); });