@technobuddha/library/priority-queue/priority-queue.cjs

A large library of useful functions

"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 __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) {
    for (var i = 0, il = from.length, j = to.length; i < il; i++, j++)
        to[j] = from[i];
    return to;
};
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 });
exports.PriorityQueue = void 0;
/**
 * A simple priority queue
 */
var PriorityQueue = /** @class */ (function () {
    /**
     * @param comparator Function to compare two elements and puts them in priority order.  Takes two elements as arguments and returns a number greater, less
     * then or equal to zero.
     * @param contents Initial contents of the queue
     */
    function PriorityQueue(comparator, contents) {
        this.comparator = comparator;
        this.contents = Array.from(contents !== null && contents !== void 0 ? contents : []);
        this.sorted = false;
    }
    PriorityQueue.prototype.sort = function () {
        this.contents.sort(this.comparator);
        this.sorted = true;
    };
    /**
     * Add an element to the queue
     * @param o element to be added
     */
    PriorityQueue.prototype.push = function () {
        var _a;
        var o = [];
        for (var _i = 0; _i < arguments.length; _i++) {
            o[_i] = arguments[_i];
        }
        (_a = this.contents).push.apply(_a, __spreadArray([], __read(o)));
        this.sorted = false;
    };
    /**
     * Return and remove the highest priority item from the queue
     *
     * @returns queue element
     */
    PriorityQueue.prototype.pop = function () {
        if (!this.sorted)
            this.sort();
        return this.contents.shift();
    };
    /**
     * Iterate through all elements in the queue
     *
     * @returns generator function
     */
    PriorityQueue.prototype[Symbol.iterator] = function () {
        return __generator(this, function (_a) {
            switch (_a.label) {
                case 0:
                    if (!this.sorted)
                        this.sort();
                    return [5 /*yield**/, __values(this.contents)];
                case 1:
                    _a.sent();
                    return [2 /*return*/];
            }
        });
    };
    Object.defineProperty(PriorityQueue.prototype, "size", {
        /**
         * Determine the number of items in the queue
         *
         * @returns number of element in the queue
         */
        get: function () {
            return this.contents.length;
        },
        enumerable: false,
        configurable: true
    });
    /**
     * Transform all elements in the queue
     *
     * @param f Function to transforme each element of the queue
     * @returns array of transformed queue elements
     */
    PriorityQueue.prototype.map = function (f) {
        if (!this.sorted)
            this.sort();
        // eslint-disable-next-line unicorn/no-array-callback-reference
        return this.contents.map(f);
    };
    /**
     * Change the function used to order the queue
     *
     * @param newComparator function to compare elements of the queue
     */
    PriorityQueue.prototype.reorder = function (newComparator) {
        this.comparator = newComparator;
        this.sorted = false;
    };
    return PriorityQueue;
}());
exports.PriorityQueue = PriorityQueue;
exports.default = PriorityQueue;