tstruct/dist/Queue/Queue.js

Data structures & basic algorithms library

"use strict";
Object.defineProperty(exports, "__esModule", { value: true });
exports.Queue = void 0;
var LinkedList_1 = require("../LinkedList/LinkedList");
var Queue = (function () {
    function Queue() {
        this._list = new LinkedList_1.LinkedList();
    }
    Queue.prototype.enqueue = function (item) {
        this._list.add(item);
    };
    Queue.prototype.dequeue = function () {
        var val = this._list.get(0);
        this._list.remove(0);
        return val;
    };
    Queue.prototype.peek = function () {
        return this._list.get(0);
    };
    Object.defineProperty(Queue.prototype, "isEmpty", {
        get: function () {
            return this._list.size == 0;
        },
        enumerable: false,
        configurable: true
    });
    Object.defineProperty(Queue.prototype, "size", {
        get: function () {
            return this._list.size;
        },
        enumerable: false,
        configurable: true
    });
    Queue.prototype[Symbol.iterator] = function () {
        return this._list[Symbol.iterator]();
    };
    return Queue;
}());
exports.Queue = Queue;