lazzy.ts/generators/sort.js

Fast and lightweight library for lazy operations with iterable objects.

"use strict";
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 __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: n === "return" } : f ? f(v) : v; } : f; }
};
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 });
exports.sortAsync = exports.sort = void 0;
const binaryTree_1 = require("../common/binaryTree");
const dfs_1 = require("../common/dfs");
const node_1 = require("../common/node");
function* sort(iterator, ...comparer) {
    let x = iterator.next();
    if (x.done) {
        return x.value;
    }
    const tree = new binaryTree_1.BinaryTree(new node_1.Node(x.value));
    x = iterator.next();
    while (x.done !== true) {
        tree.add(new node_1.Node(x.value), ...comparer);
        x = iterator.next();
    }
    yield* dfs_1.dfs(tree.root);
    return x.value;
}
exports.sort = sort;
function sortAsync(iterator, ...comparer) {
    return __asyncGenerator(this, arguments, function* sortAsync_1() {
        let x = yield __await(iterator.next());
        if (x.done) {
            return yield __await(x.value);
        }
        const tree = new binaryTree_1.BinaryTree(new node_1.Node(yield __await(Promise.resolve(x.value))));
        x = yield __await(iterator.next());
        while (x.done !== true) {
            tree.add(new node_1.Node(yield __await(Promise.resolve(x.value))), ...comparer);
            x = yield __await(iterator.next());
        }
        yield __await(yield* __asyncDelegator(__asyncValues(dfs_1.dfs(tree.root))));
        return yield __await(x.value);
    });
}
exports.sortAsync = sortAsync;
//# sourceMappingURL=sort.js.map