@raikuxq/alg-ds 1.1.2 → 1.1.5

package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedNode.js

@@ -0,0 +1,65 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var AbstractLinkedNode_1 = require("../AbstractLinkedList/AbstractLinkedNode");
+var DoubleLinkedNode = /** @class */ (function (_super) {
+    __extends(DoubleLinkedNode, _super);
+    /**
+     * Will create empty node
+     */
+    function DoubleLinkedNode(data, next, prev) {
+        if (next === void 0) { next = null; }
+        if (prev === void 0) { prev = null; }
+        var _this = _super.call(this, data) || this;
+        _this._prev = prev;
+        _this._next = next;
+        return _this;
+    }
+    Object.defineProperty(DoubleLinkedNode.prototype, "prev", {
+        /**
+         * Get previous node link
+         */
+        get: function () {
+            return this._prev;
+        },
+        /**
+         * Set previous node link
+         */
+        set: function (value) {
+            this._prev = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Object.defineProperty(DoubleLinkedNode.prototype, "next", {
+        /**
+         * @inheritDoc
+         */
+        get: function () {
+            return this._next;
+        },
+        /**
+         * @inheritDoc
+         */
+        set: function (value) {
+            this._next = value;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return DoubleLinkedNode;
+}(AbstractLinkedNode_1.default));
+exports.default = DoubleLinkedNode;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRG91YmxlTGlua2VkTm9kZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvTGlua2VkTGlzdC9Eb3VibGVMaW5rZWRMaXN0L0RvdWJsZUxpbmtlZE5vZGUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUEsK0VBQTBFO0FBRTFFO0lBQWlELG9DQUFxQjtJQUlwRTs7T0FFRztJQUNILDBCQUNFLElBQU8sRUFDUCxJQUF1QyxFQUN2QyxJQUF1QztRQUR2QyxxQkFBQSxFQUFBLFdBQXVDO1FBQ3ZDLHFCQUFBLEVBQUEsV0FBdUM7UUFIekMsWUFLRSxrQkFBTSxJQUFJLENBQUMsU0FHWjtRQUZDLEtBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO1FBQ2xCLEtBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDOztJQUNwQixDQUFDO0lBS0Qsc0JBQVcsa0NBQUk7UUFJZjs7V0FFRzthQUNIO1lBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDO1FBQ3BCLENBQUM7UUFaRDs7V0FFRzthQUNILFVBQWdCLEtBQWlDO1lBQy9DLElBQUksQ0FBQyxLQUFLLEdBQUcsS0FBSyxDQUFDO1FBQ3JCLENBQUM7OztPQUFBO0lBWUQsc0JBQVcsa0NBQUk7UUFJZjs7V0FFRzthQUNIO1lBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDO1FBQ3BCLENBQUM7UUFaRDs7V0FFRzthQUNILFVBQWdCLEtBQWlDO1lBQy9DLElBQUksQ0FBQyxLQUFLLEdBQUcsS0FBSyxDQUFDO1FBQ3JCLENBQUM7OztPQUFBO0lBUUgsdUJBQUM7QUFBRCxDQUFDLEFBNUNELENBQWlELDRCQUFrQixHQTRDbEUifQ==

package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedList.d.ts

@@ -0,0 +1,52 @@
+import IIterator from "../../../types/IIterator";
+import IIterable from "../../../types/IIterable";
+import AbstractLinkedList from "../AbstractLinkedList/AbstractLinkedList";
+import SingleLinkedNode from "./SingleLinkedNode";
+/**
+ * Linear data structure
+ * Each node has next
+ * Head's next node is tail
+ */
+export default class SingleLinkedList<T> extends AbstractLinkedList<T> implements IIterable<T> {
+    /**
+     * Override types
+     */
+    protected _head: SingleLinkedNode<T> | null;
+    protected _tail: SingleLinkedNode<T> | null;
+    /**
+     * @inheritDoc
+     */
+    constructor(capacity?: number);
+    /**
+     * Find previous sibling of given node
+     */
+    private getPrevNode;
+    /**
+     * @inheritDoc
+     */
+    protected createNode(value: T): SingleLinkedNode<T>;
+    /**
+     * @inheritDoc
+     */
+    protected insertNodeBetweenTwoNodesImpl(targetNode: SingleLinkedNode<T>, leftNode: SingleLinkedNode<T>, rightNode: SingleLinkedNode<T>): void;
+    /**
+     * @inheritDoc
+     */
+    protected deleteNodeImpl(node: SingleLinkedNode<T>): void;
+    /**
+     * @inheritDoc
+     */
+    protected popImpl(): void;
+    /**
+     * @inheritDoc
+     */
+    protected shiftImpl(): void;
+    /**
+     * @inheritDoc
+     */
+    reverse(): void;
+    /**
+     * List iterator
+     */
+    iterator(fromIndex?: number): IIterator<T>;
+}

package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedList.js

@@ -0,0 +1,137 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var AbstractLinkedList_1 = require("../AbstractLinkedList/AbstractLinkedList");
+var SingleLinkedNode_1 = require("./SingleLinkedNode");
+/**
+ * Linear data structure
+ * Each node has next
+ * Head's next node is tail
+ */
+var SingleLinkedList = /** @class */ (function (_super) {
+    __extends(SingleLinkedList, _super);
+    /**
+     * @inheritDoc
+     */
+    function SingleLinkedList(capacity) {
+        var _this = _super.call(this, capacity) || this;
+        _this._head = null;
+        _this._tail = null;
+        return _this;
+    }
+    /**
+     * Find previous sibling of given node
+     */
+    SingleLinkedList.prototype.getPrevNode = function (node) {
+        var currentNode = this._tail;
+        while ((currentNode === null || currentNode === void 0 ? void 0 : currentNode.next) !== node) {
+            currentNode = (currentNode === null || currentNode === void 0 ? void 0 : currentNode.next) || null;
+        }
+        return currentNode;
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.createNode = function (value) {
+        return new SingleLinkedNode_1.default(value);
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.insertNodeBetweenTwoNodesImpl = function (targetNode, leftNode, rightNode) {
+        targetNode.next = rightNode;
+        if (leftNode) {
+            leftNode.next = targetNode;
+        }
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.deleteNodeImpl = function (node) {
+        this.getPrevNode(node).next = node.next;
+        node.next = null;
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.popImpl = function () {
+        this._head = this.getPrevNode(this._tail);
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.shiftImpl = function () {
+        var _a;
+        this._tail = ((_a = this._head) === null || _a === void 0 ? void 0 : _a.next) || null;
+    };
+    /**
+     * @inheritDoc
+     */
+    SingleLinkedList.prototype.reverse = function () {
+        var currentNode = this._tail;
+        var prevNode = this._head;
+        var index = 0;
+        while (index < this._length) {
+            var next = (currentNode === null || currentNode === void 0 ? void 0 : currentNode.next) || null;
+            if (currentNode) {
+                currentNode.next = prevNode;
+            }
+            index++;
+            prevNode = currentNode;
+            currentNode = next;
+        }
+        if (currentNode) {
+            this._head = currentNode;
+            this._tail = currentNode.next;
+        }
+    };
+    /**
+     * List iterator
+     */
+    SingleLinkedList.prototype.iterator = function (fromIndex) {
+        if (fromIndex === void 0) { fromIndex = 0; }
+        var head = this._head;
+        var activeNode = this.getNodeByIndex(fromIndex);
+        var iterator = {
+            /**
+             * @inheritDoc
+             */
+            current: function () {
+                return activeNode.data;
+            },
+            /**
+             * @inheritDoc
+             */
+            hasNext: function () {
+                return Boolean(activeNode.next) && activeNode !== head;
+            },
+            /**
+             * @inheritDoc
+             * @throws when next element does not exist
+             */
+            next: function () {
+                if (!iterator.hasNext()) {
+                    throw new Error("Next element does not exist");
+                }
+                activeNode = activeNode.next;
+                return activeNode.data;
+            },
+        };
+        return iterator;
+    };
+    return SingleLinkedList;
+}(AbstractLinkedList_1.default));
+exports.default = SingleLinkedList;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU2luZ2xlTGlua2VkTGlzdC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvTGlua2VkTGlzdC9TaW5nbGVMaW5rZWRMaXN0L1NpbmdsZUxpbmtlZExpc3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBRUEsK0VBQTBFO0FBQzFFLHVEQUFrRDtBQUVsRDs7OztHQUlHO0FBQ0g7SUFDVSxvQ0FBcUI7SUFRN0I7O09BRUc7SUFDSCwwQkFBbUIsUUFBaUI7UUFBcEMsWUFDRSxrQkFBTSxRQUFRLENBQUMsU0FHaEI7UUFGQyxLQUFJLENBQUMsS0FBSyxHQUFHLElBQUksQ0FBQztRQUNsQixLQUFJLENBQUMsS0FBSyxHQUFHLElBQUksQ0FBQzs7SUFDcEIsQ0FBQztJQUVEOztPQUVHO0lBQ0ssc0NBQVcsR0FBbkIsVUFDRSxJQUFnQztRQUVoQyxJQUFJLFdBQVcsR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDO1FBQzdCLE9BQU8sQ0FBQSxXQUFXLGFBQVgsV0FBVyx1QkFBWCxXQUFXLENBQUUsSUFBSSxNQUFLLElBQUksRUFBRTtZQUNqQyxXQUFXLEdBQUcsQ0FBQSxXQUFXLGFBQVgsV0FBVyx1QkFBWCxXQUFXLENBQUUsSUFBSSxLQUFJLElBQUksQ0FBQztTQUN6QztRQUNELE9BQU8sV0FBVyxDQUFDO0lBQ3JCLENBQUM7SUFFRDs7T0FFRztJQUNPLHFDQUFVLEdBQXBCLFVBQXFCLEtBQVE7UUFDM0IsT0FBTyxJQUFJLDBCQUFnQixDQUFJLEtBQUssQ0FBQyxDQUFDO0lBQ3hDLENBQUM7SUFFRDs7T0FFRztJQUNPLHdEQUE2QixHQUF2QyxVQUNFLFVBQStCLEVBQy9CLFFBQTZCLEVBQzdCLFNBQThCO1FBRTlCLFVBQVUsQ0FBQyxJQUFJLEdBQUcsU0FBUyxDQUFDO1FBRTVCLElBQUksUUFBUSxFQUFFO1lBQ1osUUFBUSxDQUFDLElBQUksR0FBRyxVQUFVLENBQUM7U0FDNUI7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDTyx5Q0FBYyxHQUF4QixVQUF5QixJQUF5QjtRQUNoRCxJQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBRSxDQUFDLElBQUksR0FBRyxJQUFJLENBQUMsSUFBSSxDQUFDO1FBQ3pDLElBQUksQ0FBQyxJQUFJLEdBQUcsSUFBSSxDQUFDO0lBQ25CLENBQUM7SUFFRDs7T0FFRztJQUNPLGtDQUFPLEdBQWpCO1FBQ0UsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLENBQUMsV0FBVyxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsQ0FBQztJQUM1QyxDQUFDO0lBRUQ7O09BRUc7SUFDTyxvQ0FBUyxHQUFuQjs7UUFDRSxJQUFJLENBQUMsS0FBSyxHQUFHLE9BQUEsSUFBSSxDQUFDLEtBQUssMENBQUUsSUFBSSxLQUFJLElBQUksQ0FBQztJQUN4QyxDQUFDO0lBRUQ7O09BRUc7SUFDSSxrQ0FBTyxHQUFkO1FBQ0UsSUFBSSxXQUFXLEdBQStCLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDekQsSUFBSSxRQUFRLEdBQStCLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDdEQsSUFBSSxLQUFLLEdBQUcsQ0FBQyxDQUFDO1FBRWQsT0FBTyxLQUFLLEdBQUcsSUFBSSxDQUFDLE9BQU8sRUFBRTtZQUMzQixJQUFNLElBQUksR0FBRyxDQUFBLFdBQVcsYUFBWCxXQUFXLHVCQUFYLFdBQVcsQ0FBRSxJQUFJLEtBQUksSUFBSSxDQUFDO1lBRXZDLElBQUksV0FBVyxFQUFFO2dCQUNmLFdBQVcsQ0FBQyxJQUFJLEdBQUcsUUFBUSxDQUFDO2FBQzdCO1lBRUQsS0FBSyxFQUFFLENBQUM7WUFDUixRQUFRLEdBQUcsV0FBVyxDQUFDO1lBQ3ZCLFdBQVcsR0FBRyxJQUFJLENBQUM7U0FDcEI7UUFFRCxJQUFJLFdBQVcsRUFBRTtZQUNmLElBQUksQ0FBQyxLQUFLLEdBQUcsV0FBVyxDQUFDO1lBQ3pCLElBQUksQ0FBQyxLQUFLLEdBQUcsV0FBVyxDQUFDLElBQUksQ0FBQztTQUMvQjtJQUNILENBQUM7SUFFRDs7T0FFRztJQUNJLG1DQUFRLEdBQWYsVUFBZ0IsU0FBYTtRQUFiLDBCQUFBLEVBQUEsYUFBYTtRQUMzQixJQUFNLElBQUksR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDO1FBQ3hCLElBQUksVUFBVSxHQUF3QixJQUFJLENBQUMsY0FBYyxDQUFDLFNBQVMsQ0FBQyxDQUFDO1FBRXJFLElBQU0sUUFBUSxHQUFpQjtZQUM3Qjs7ZUFFRztZQUNILE9BQU8sRUFBRTtnQkFDUCxPQUFPLFVBQVUsQ0FBQyxJQUFJLENBQUM7WUFDekIsQ0FBQztZQUNEOztlQUVHO1lBQ0gsT0FBTyxFQUFQO2dCQUNFLE9BQU8sT0FBTyxDQUFDLFVBQVUsQ0FBQyxJQUFJLENBQUMsSUFBSSxVQUFVLEtBQUssSUFBSSxDQUFDO1lBQ3pELENBQUM7WUFDRDs7O2VBR0c7WUFDSCxJQUFJLEVBQUU7Z0JBQ0osSUFBSSxDQUFDLFFBQVEsQ0FBQyxPQUFPLEVBQUUsRUFBRTtvQkFDdkIsTUFBTSxJQUFJLEtBQUssQ0FBQyw2QkFBNkIsQ0FBQyxDQUFDO2lCQUNoRDtnQkFDRCxVQUFVLEdBQUcsVUFBVSxDQUFDLElBQUssQ0FBQztnQkFDOUIsT0FBTyxVQUFVLENBQUMsSUFBSSxDQUFDO1lBQ3pCLENBQUM7U0FDRixDQUFDO1FBRUYsT0FBTyxRQUFRLENBQUM7SUFDbEIsQ0FBQztJQUNILHVCQUFDO0FBQUQsQ0FBQyxBQXhJRCxDQUNVLDRCQUFrQixHQXVJM0IifQ==

package/{src/data-structures/LinkedList/SingleLinkedList/SingleLinkedNode.ts → lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedNode.d.ts}

@@ -1,10 +1,7 @@
-import AbstractLinkedNode from "../AbstractLinkedList/AbstractLinkedNode";
-
-export default class SingleLinkedNode<T> extends AbstractLinkedNode<T> {
-  /**
-   * @inheritDoc
-   */
-  public constructor(data: T, next: SingleLinkedNode<T> | null = null) {
-    super(data, next);
-  }
-}
+import AbstractLinkedNode from "../AbstractLinkedList/AbstractLinkedNode";
+export default class SingleLinkedNode<T> extends AbstractLinkedNode<T> {
+    /**
+     * @inheritDoc
+     */
+    constructor(data: T, next?: SingleLinkedNode<T> | null);
+}

package/lib/data-structures/LinkedList/SingleLinkedList/SingleLinkedNode.js

@@ -0,0 +1,29 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+var AbstractLinkedNode_1 = require("../AbstractLinkedList/AbstractLinkedNode");
+var SingleLinkedNode = /** @class */ (function (_super) {
+    __extends(SingleLinkedNode, _super);
+    /**
+     * @inheritDoc
+     */
+    function SingleLinkedNode(data, next) {
+        if (next === void 0) { next = null; }
+        return _super.call(this, data, next) || this;
+    }
+    return SingleLinkedNode;
+}(AbstractLinkedNode_1.default));
+exports.default = SingleLinkedNode;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU2luZ2xlTGlua2VkTm9kZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvTGlua2VkTGlzdC9TaW5nbGVMaW5rZWRMaXN0L1NpbmdsZUxpbmtlZE5vZGUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBQUEsK0VBQTBFO0FBRTFFO0lBQWlELG9DQUFxQjtJQUNwRTs7T0FFRztJQUNILDBCQUFtQixJQUFPLEVBQUUsSUFBdUM7UUFBdkMscUJBQUEsRUFBQSxXQUF1QztlQUNqRSxrQkFBTSxJQUFJLEVBQUUsSUFBSSxDQUFDO0lBQ25CLENBQUM7SUFDSCx1QkFBQztBQUFELENBQUMsQUFQRCxDQUFpRCw0QkFBa0IsR0FPbEUifQ==

package/lib/data-structures/LoopedArray/LoopedArray.d.ts

@@ -0,0 +1,86 @@
+import IArrayFacade from "../../types/IArrayFacade";
+/**
+ * Linear data structure
+ * Facade above array
+ * After reaching full array new pushed elements will be overwritten over old elements
+ */
+export default class LoopedArray<T> implements IArrayFacade<T> {
+    private readonly _capacity;
+    private _realLength;
+    private _array;
+    /**
+     * Create empty instance
+     */
+    constructor(capacity: number);
+    /**
+     * Push into end
+     */
+    push(value: T): void;
+    /**
+     * Push into start
+     */
+    unshift(value: T): void;
+    /**
+     * Delete node from array's end
+     */
+    pop(): T;
+    /**
+     * Delete node from array's start
+     */
+    shift(): T;
+    /**
+     * Get head element data
+     * @throws Error when head does not exists
+     */
+    peek(): T;
+    /**
+     * Get tail element data
+     * @throws Error when head does not exists
+     */
+    peekFromStart(): T;
+    /**
+     * Get array element by index from start
+     * @throws when element does not exists
+     */
+    peekByIndex(index: number): T;
+    /**
+     * Push from index
+     */
+    pushFromIndex(value: T, fromIndex: number): void;
+    /**
+     * Get elements as array
+     */
+    getAsArray(): Array<T>;
+    /**
+     * Check if element exists in array
+     */
+    has(item: T): boolean;
+    /**
+     * Is array empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Is array full
+     */
+    isFull(): boolean;
+    /**
+     * List length
+     */
+    length(): number;
+    /**
+     * Remove all elements from array
+     */
+    clear(): void;
+    /**
+     * Delete node from array by index from start
+     */
+    deleteFromIndex(fromIndex: number): T;
+    /**
+     * Add elements to array from array
+     * */
+    pushFromArray(elements: Array<T>): void;
+    /**
+     * Reverse array nodes links and swap head with tail
+     */
+    reverse(): void;
+}

package/lib/data-structures/LoopedArray/LoopedArray.js

@@ -0,0 +1,161 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+/**
+ * Linear data structure
+ * Facade above array
+ * After reaching full array new pushed elements will be overwritten over old elements
+ */
+var LoopedArray = /** @class */ (function () {
+    /**
+     * Create empty instance
+     */
+    function LoopedArray(capacity) {
+        this._realLength = 0;
+        if (capacity <= 0) {
+            throw new Error("Capacity must be larger than 0");
+        }
+        this._capacity = capacity;
+        this._array = new Array(0);
+    }
+    /**
+     * Push into end
+     */
+    LoopedArray.prototype.push = function (value) {
+        if (this._realLength % this._capacity === 0) {
+            this._array = new Array(0);
+        }
+        this._realLength++;
+        if (!this.isFull()) {
+            this._array.push(value);
+        }
+        else {
+            var indexToPush = (this._realLength % this._capacity) - 1;
+            this._array.splice(indexToPush, 1, value);
+        }
+    };
+    /**
+     * Push into start
+     */
+    LoopedArray.prototype.unshift = function (value) {
+        if (this._realLength % this._capacity === 0) {
+            this._array = new Array(0);
+        }
+        this._realLength++;
+        if (!this.isFull()) {
+            this._array.unshift(value);
+        }
+        else {
+            this._array.splice(this._capacity - 1);
+            this._array.unshift(value);
+        }
+    };
+    /**
+     * Delete node from array's end
+     */
+    LoopedArray.prototype.pop = function () {
+        this._realLength--;
+        var deletedItem = this._array.pop();
+        if (deletedItem === undefined)
+            throw new Error("cannot delete last element because of it does not exists");
+        return deletedItem;
+    };
+    /**
+     * Delete node from array's start
+     */
+    LoopedArray.prototype.shift = function () {
+        this._realLength--;
+        var deletedItem = this._array.shift();
+        if (deletedItem === undefined)
+            throw new Error("cannot delete first element because of it does not exists");
+        return deletedItem;
+    };
+    /**
+     * Get head element data
+     * @throws Error when head does not exists
+     */
+    LoopedArray.prototype.peek = function () {
+        return this._array[this._array.length - 1];
+    };
+    /**
+     * Get tail element data
+     * @throws Error when head does not exists
+     */
+    LoopedArray.prototype.peekFromStart = function () {
+        return this._array[0];
+    };
+    /**
+     * Get array element by index from start
+     * @throws when element does not exists
+     */
+    LoopedArray.prototype.peekByIndex = function (index) {
+        return this._array[index];
+    };
+    /**
+     * Push from index
+     */
+    LoopedArray.prototype.pushFromIndex = function (value, fromIndex) {
+        this._array[fromIndex] = value;
+    };
+    /**
+     * Get elements as array
+     */
+    LoopedArray.prototype.getAsArray = function () {
+        return this._array;
+    };
+    /**
+     * Check if element exists in array
+     */
+    LoopedArray.prototype.has = function (item) {
+        return this._array.includes(item);
+    };
+    /**
+     * Is array empty
+     */
+    LoopedArray.prototype.isEmpty = function () {
+        return this._array.length === 0;
+    };
+    /**
+     * Is array full
+     */
+    LoopedArray.prototype.isFull = function () {
+        return this._array.length >= this._capacity;
+    };
+    /**
+     * List length
+     */
+    LoopedArray.prototype.length = function () {
+        return this._array.length;
+    };
+    /**
+     * Remove all elements from array
+     */
+    LoopedArray.prototype.clear = function () {
+        this._array = new Array(0);
+    };
+    /**
+     * Delete node from array by index from start
+     */
+    LoopedArray.prototype.deleteFromIndex = function (fromIndex) {
+        var deletedElement = this._array[fromIndex];
+        delete this._array[fromIndex];
+        return deletedElement;
+    };
+    /**
+     * Add elements to array from array
+     * */
+    LoopedArray.prototype.pushFromArray = function (elements) {
+        var _this = this;
+        elements.forEach(function (element) {
+            _this.push(element);
+        });
+    };
+    /**
+     * Reverse array nodes links and swap head with tail
+     */
+    LoopedArray.prototype.reverse = function () {
+        this._array = this._array.reverse();
+    };
+    return LoopedArray;
+}());
+exports.default = LoopedArray;
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiTG9vcGVkQXJyYXkuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvZGF0YS1zdHJ1Y3R1cmVzL0xvb3BlZEFycmF5L0xvb3BlZEFycmF5LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBRUE7Ozs7R0FJRztBQUNIO0lBS0U7O09BRUc7SUFDSCxxQkFBWSxRQUFnQjtRQU5wQixnQkFBVyxHQUFHLENBQUMsQ0FBQztRQU90QixJQUFJLFFBQVEsSUFBSSxDQUFDLEVBQUU7WUFDakIsTUFBTSxJQUFJLEtBQUssQ0FBQyxnQ0FBZ0MsQ0FBQyxDQUFDO1NBQ25EO1FBQ0QsSUFBSSxDQUFDLFNBQVMsR0FBRyxRQUFRLENBQUM7UUFDMUIsSUFBSSxDQUFDLE1BQU0sR0FBRyxJQUFJLEtBQUssQ0FBSSxDQUFDLENBQUMsQ0FBQztJQUNoQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSwwQkFBSSxHQUFYLFVBQVksS0FBUTtRQUNsQixJQUFJLElBQUksQ0FBQyxXQUFXLEdBQUcsSUFBSSxDQUFDLFNBQVMsS0FBSyxDQUFDLEVBQUU7WUFDM0MsSUFBSSxDQUFDLE1BQU0sR0FBRyxJQUFJLEtBQUssQ0FBSSxDQUFDLENBQUMsQ0FBQztTQUMvQjtRQUVELElBQUksQ0FBQyxXQUFXLEVBQUUsQ0FBQztRQUVuQixJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sRUFBRSxFQUFFO1lBQ2xCLElBQUksQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO1NBQ3pCO2FBQU07WUFDTCxJQUFNLFdBQVcsR0FBRyxDQUFDLElBQUksQ0FBQyxXQUFXLEdBQUcsSUFBSSxDQUFDLFNBQVMsQ0FBQyxHQUFHLENBQUMsQ0FBQztZQUM1RCxJQUFJLENBQUMsTUFBTSxDQUFDLE1BQU0sQ0FBQyxXQUFXLEVBQUUsQ0FBQyxFQUFFLEtBQUssQ0FBQyxDQUFDO1NBQzNDO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksNkJBQU8sR0FBZCxVQUFlLEtBQVE7UUFDckIsSUFBSSxJQUFJLENBQUMsV0FBVyxHQUFHLElBQUksQ0FBQyxTQUFTLEtBQUssQ0FBQyxFQUFFO1lBQzNDLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxLQUFLLENBQUksQ0FBQyxDQUFDLENBQUM7U0FDL0I7UUFDRCxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7UUFFbkIsSUFBSSxDQUFDLElBQUksQ0FBQyxNQUFNLEVBQUUsRUFBRTtZQUNsQixJQUFJLENBQUMsTUFBTSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQztTQUM1QjthQUFNO1lBQ0wsSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLFNBQVMsR0FBRyxDQUFDLENBQUMsQ0FBQztZQUN2QyxJQUFJLENBQUMsTUFBTSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQztTQUM1QjtJQUNILENBQUM7SUFFRDs7T0FFRztJQUNJLHlCQUFHLEdBQVY7UUFDRSxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7UUFDbkIsSUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxHQUFHLEVBQUUsQ0FBQztRQUN0QyxJQUFJLFdBQVcsS0FBSyxTQUFTO1lBQzNCLE1BQU0sSUFBSSxLQUFLLENBQ2IsMERBQTBELENBQzNELENBQUM7UUFDSixPQUFPLFdBQVcsQ0FBQztJQUNyQixDQUFDO0lBRUQ7O09BRUc7SUFDSSwyQkFBSyxHQUFaO1FBQ0UsSUFBSSxDQUFDLFdBQVcsRUFBRSxDQUFDO1FBQ25CLElBQU0sV0FBVyxHQUFHLElBQUksQ0FBQyxNQUFNLENBQUMsS0FBSyxFQUFFLENBQUM7UUFDeEMsSUFBSSxXQUFXLEtBQUssU0FBUztZQUMzQixNQUFNLElBQUksS0FBSyxDQUNiLDJEQUEyRCxDQUM1RCxDQUFDO1FBQ0osT0FBTyxXQUFXLENBQUM7SUFDckIsQ0FBQztJQUVEOzs7T0FHRztJQUNJLDBCQUFJLEdBQVg7UUFDRSxPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLEdBQUcsQ0FBQyxDQUFDLENBQUM7SUFDN0MsQ0FBQztJQUVEOzs7T0FHRztJQUNJLG1DQUFhLEdBQXBCO1FBQ0UsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQ3hCLENBQUM7SUFFRDs7O09BR0c7SUFDSCxpQ0FBVyxHQUFYLFVBQVksS0FBYTtRQUN2QixPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDNUIsQ0FBQztJQUVEOztPQUVHO0lBQ0gsbUNBQWEsR0FBYixVQUFjLEtBQVEsRUFBRSxTQUFpQjtRQUN2QyxJQUFJLENBQUMsTUFBTSxDQUFDLFNBQVMsQ0FBQyxHQUFHLEtBQUssQ0FBQztJQUNqQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSxnQ0FBVSxHQUFqQjtRQUNFLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQztJQUNyQixDQUFDO0lBRUQ7O09BRUc7SUFDSSx5QkFBRyxHQUFWLFVBQVcsSUFBTztRQUNoQixPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsUUFBUSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQ3BDLENBQUM7SUFFRDs7T0FFRztJQUNJLDZCQUFPLEdBQWQ7UUFDRSxPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxLQUFLLENBQUMsQ0FBQztJQUNsQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSw0QkFBTSxHQUFiO1FBQ0UsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDLE1BQU0sSUFBSSxJQUFJLENBQUMsU0FBUyxDQUFDO0lBQzlDLENBQUM7SUFFRDs7T0FFRztJQUNJLDRCQUFNLEdBQWI7UUFDRSxPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxDQUFDO0lBQzVCLENBQUM7SUFFRDs7T0FFRztJQUNJLDJCQUFLLEdBQVo7UUFDRSxJQUFJLENBQUMsTUFBTSxHQUFHLElBQUksS0FBSyxDQUFJLENBQUMsQ0FBQyxDQUFDO0lBQ2hDLENBQUM7SUFFRDs7T0FFRztJQUNILHFDQUFlLEdBQWYsVUFBZ0IsU0FBaUI7UUFDL0IsSUFBTSxjQUFjLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxTQUFTLENBQUMsQ0FBQztRQUM5QyxPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsU0FBUyxDQUFDLENBQUM7UUFDOUIsT0FBTyxjQUFjLENBQUM7SUFDeEIsQ0FBQztJQUVEOztTQUVLO0lBQ0wsbUNBQWEsR0FBYixVQUFjLFFBQWtCO1FBQWhDLGlCQUlDO1FBSEMsUUFBUSxDQUFDLE9BQU8sQ0FBQyxVQUFDLE9BQVU7WUFDMUIsS0FBSSxDQUFDLElBQUksQ0FBQyxPQUFPLENBQUMsQ0FBQztRQUNyQixDQUFDLENBQUMsQ0FBQztJQUNMLENBQUM7SUFFRDs7T0FFRztJQUNILDZCQUFPLEdBQVA7UUFDRSxJQUFJLENBQUMsTUFBTSxHQUFHLElBQUksQ0FBQyxNQUFNLENBQUMsT0FBTyxFQUFFLENBQUM7SUFDdEMsQ0FBQztJQUNILGtCQUFDO0FBQUQsQ0FBQyxBQTlLRCxJQThLQyJ9

package/lib/data-structures/Queue/Queue.d.ts

@@ -0,0 +1,50 @@
+import ILinearStorage from "../../types/ILinearStorage";
+/**
+ * FIFO data structure
+ */
+export default class Queue<T> implements ILinearStorage<T> {
+    private readonly _list;
+    /**
+     * Create a queue instance
+     */
+    constructor(capacity?: number);
+    /**
+     * Get first element in queue (without deleting)
+     * @throws when list is empty
+     */
+    peek(): T;
+    /**
+     * Add element to queue
+     * @throws when list is full
+     */
+    push(item: T): void;
+    /**
+     * Delete first element in queue
+     * @throws when list is empty
+     */
+    pop(): T;
+    /**
+     * Check if element exists in list
+     */
+    has(item: T): boolean;
+    /**
+     * Is queue empty
+     */
+    isEmpty(): boolean;
+    /**
+     * Is stack full
+     */
+    isFull(): boolean;
+    /**
+     * Remove all elements in queue
+     */
+    clear(): void;
+    /**
+     * Queue length
+     */
+    length(): number;
+    /**
+     * Reverse queue
+     */
+    reverse(): void;
+}