@raikuxq/alg-ds 1.1.5 → 1.1.6

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

@@ -1,125 +0,0 @@
-import AbstractLinkedNode from "./AbstractLinkedNode";
-import ILinkedList from "../../../types/ILinkedList";
-export default abstract class AbstractLinkedList<T> implements ILinkedList<T> {
-    protected readonly _capacity: number;
-    protected _length: number;
-    protected _head: AbstractLinkedNode<T> | null;
-    protected _tail: AbstractLinkedNode<T> | null;
-    /**
-     * Create empty instance
-     */
-    protected constructor(capacity?: number);
-    /**
-     * Will calculate real capacity value
-     * @throws when capacity <= 0
-     */
-    private static calculateCapacity;
-    /**
-     * Will insert node between nodeLeft and nodeRight
-     * @throws when list is full
-     */
-    private insertNodeBetweenTwoNodes;
-    /**
-     * Will remove the node from its neighbors nodes links
-     * @throws when node does not exist
-     */
-    private deleteNode;
-    /**
-     * Will find node by its index
-     * @throws when node was not found
-     */
-    protected getNodeByIndex(index: number): AbstractLinkedNode<T>;
-    /**
-     * Will set links between target, left and right siblings
-     */
-    protected abstract insertNodeBetweenTwoNodesImpl(nodeToPush: AbstractLinkedNode<T>, nodeLeft: AbstractLinkedNode<T>, nodeRight: AbstractLinkedNode<T>): void;
-    /**
-     * Will unset itself links and its neighbors links
-     */
-    protected abstract deleteNodeImpl(node: AbstractLinkedNode<T>): void;
-    /**
-     * Update head link
-     */
-    protected abstract popImpl(): void;
-    /**
-     * Update tail link
-     */
-    protected abstract shiftImpl(): void;
-    /**
-     * Will create empty node instance
-     */
-    protected abstract createNode(value: T): AbstractLinkedNode<T>;
-    /**
-     * Push into start
-     */
-    unshift(value: T): void;
-    /**
-     * Push into end
-     */
-    push(value: T): void;
-    /**
-     * Push from index
-     */
-    pushFromIndex(value: T, fromIndex: number): void;
-    /**
-     * Delete node from list's end
-     */
-    pop(): T;
-    /**
-     * Delete node from list's start and get its data
-     */
-    shift(): T;
-    /**
-     * Delete node from list by index from start
-     */
-    deleteFromIndex(fromIndex: number): T;
-    /**
-     * List length
-     */
-    length(): number;
-    /**
-     * Is list empty
-     */
-    isEmpty(): boolean;
-    /**
-     * Is list full
-     */
-    isFull(): boolean;
-    /**
-     * Check if element exists in list
-     */
-    has(item: T): boolean;
-    /**
-     * Get head element data
-     * @throws Error when head does not exist
-     */
-    peek(): T;
-    /**
-     * Get tail element data
-     * @throws Error when tail does not exists
-     */
-    peekFromStart(): T;
-    /**
-     * Get list element by index from start
-     * @throws when element does not exist
-     */
-    peekByIndex(index: number): T;
-    /**
-     * Remove all elements from list
-     */
-    clear(): void;
-    /**
-     * Get elements as an array
-     */
-    getAsArray(): Array<T>;
-    /**
-     * Add elements to list from array
-     * @throws when list is full
-     * */
-    pushFromArray(elements: Array<T>): void;
-    /**
-     * Reverse list nodes links and swap head with tail
-     * @example "4>7>10" will be reversed to "10>7>4"
-     */
-    abstract reverse(): void;
-}

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

@@ -1,236 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var AbstractLinkedList = /** @class */ (function () {
-    /**
-     * Create empty instance
-     */
-    function AbstractLinkedList(capacity) {
-        this._capacity = AbstractLinkedList.calculateCapacity(capacity);
-        this._head = null;
-        this._tail = null;
-        this._length = 0;
-    }
-    /**
-     * Will calculate real capacity value
-     * @throws when capacity <= 0
-     */
-    AbstractLinkedList.calculateCapacity = function (capacity) {
-        if (capacity === undefined) {
-            return Number.MAX_VALUE;
-        }
-        if (capacity <= 0) {
-            throw new Error("Capacity must be larger than 0");
-        }
-        return capacity;
-    };
-    /**
-     * Will insert node between nodeLeft and nodeRight
-     * @throws when list is full
-     */
-    AbstractLinkedList.prototype.insertNodeBetweenTwoNodes = function (targetNode, leftNode, rightNode) {
-        if (this.isFull()) {
-            throw new Error("List is full, no more space available");
-        }
-        if (this._head === null) {
-            this._head = targetNode;
-        }
-        if (this._tail === null) {
-            this._tail = targetNode;
-        }
-        if (!leftNode) {
-            leftNode = this._tail;
-        }
-        if (!rightNode) {
-            rightNode = this._head;
-        }
-        this.insertNodeBetweenTwoNodesImpl(targetNode, leftNode, rightNode);
-        this._length++;
-    };
-    /**
-     * Will remove the node from its neighbors nodes links
-     * @throws when node does not exist
-     */
-    AbstractLinkedList.prototype.deleteNode = function (node) {
-        if (node === null) {
-            throw new Error("Node should be existed");
-        }
-        this.deleteNodeImpl(node);
-        this._length--;
-        if (this.isEmpty()) {
-            this.clear();
-        }
-        return node;
-    };
-    /**
-     * Will find node by its index
-     * @throws when node was not found
-     */
-    AbstractLinkedList.prototype.getNodeByIndex = function (index) {
-        if (this.isEmpty()) {
-            throw new Error("List is empty");
-        }
-        if (this._length < index) {
-            throw new Error("Index exceed list length");
-        }
-        var currentNode = this._tail;
-        var counter = 0;
-        while (currentNode && counter < index) {
-            currentNode = currentNode.next;
-            counter++;
-        }
-        if (currentNode === null) {
-            throw new Error("Node does not exist");
-        }
-        return currentNode;
-    };
-    /**
-     * Push into start
-     */
-    AbstractLinkedList.prototype.unshift = function (value) {
-        var node = this.createNode(value);
-        this.insertNodeBetweenTwoNodes(node, this._head, this._tail);
-        this._tail = node;
-    };
-    /**
-     * Push into end
-     */
-    AbstractLinkedList.prototype.push = function (value) {
-        var node = this.createNode(value);
-        this.insertNodeBetweenTwoNodes(node, this._head, this._tail);
-        this._head = node;
-    };
-    /**
-     * Push from index
-     */
-    AbstractLinkedList.prototype.pushFromIndex = function (value, fromIndex) {
-        var isIndexNotInRange = fromIndex < 0 || fromIndex > this._length;
-        var shouldPushAsFirst = this.isEmpty() && fromIndex === 0;
-        if (isIndexNotInRange) {
-            throw new Error("index must be in range between 0 and list length");
-        }
-        if (shouldPushAsFirst) {
-            this.push(value);
-        }
-        else {
-            var node = this.createNode(value);
-            var nodeLeft = this.getNodeByIndex(fromIndex - 1);
-            var nodeRight = this.getNodeByIndex(fromIndex);
-            this.insertNodeBetweenTwoNodes(node, nodeLeft, nodeRight);
-        }
-    };
-    /**
-     * Delete node from list's end
-     */
-    AbstractLinkedList.prototype.pop = function () {
-        var deletedNode = this.deleteNode(this._head);
-        this.popImpl();
-        return deletedNode.data;
-    };
-    /**
-     * Delete node from list's start and get its data
-     */
-    AbstractLinkedList.prototype.shift = function () {
-        var deletedNode = this.deleteNode(this._tail);
-        this.shiftImpl();
-        return deletedNode.data;
-    };
-    /**
-     * Delete node from list by index from start
-     */
-    AbstractLinkedList.prototype.deleteFromIndex = function (fromIndex) {
-        var nodeToDelete = this.getNodeByIndex(fromIndex);
-        var deletedNode = this.deleteNode(nodeToDelete);
-        return deletedNode.data;
-    };
-    /**
-     * List length
-     */
-    AbstractLinkedList.prototype.length = function () {
-        return this._length;
-    };
-    /**
-     * Is list empty
-     */
-    AbstractLinkedList.prototype.isEmpty = function () {
-        return this._length === 0;
-    };
-    /**
-     * Is list full
-     */
-    AbstractLinkedList.prototype.isFull = function () {
-        return this._length >= this._capacity;
-    };
-    /**
-     * Check if element exists in list
-     */
-    AbstractLinkedList.prototype.has = function (item) {
-        return this.getAsArray().includes(item);
-    };
-    /**
-     * Get head element data
-     * @throws Error when head does not exist
-     */
-    AbstractLinkedList.prototype.peek = function () {
-        if (!this._head) {
-            throw new Error("Head does not exist");
-        }
-        return this._head.data;
-    };
-    /**
-     * Get tail element data
-     * @throws Error when tail does not exists
-     */
-    AbstractLinkedList.prototype.peekFromStart = function () {
-        if (!this._tail) {
-            throw new Error("Tail does not exist");
-        }
-        return this._tail.data;
-    };
-    /**
-     * Get list element by index from start
-     * @throws when element does not exist
-     */
-    AbstractLinkedList.prototype.peekByIndex = function (index) {
-        var node = this.getNodeByIndex(index);
-        return node.data;
-    };
-    /**
-     * Remove all elements from list
-     */
-    AbstractLinkedList.prototype.clear = function () {
-        this._head = null;
-        this._tail = null;
-        this._length = 0;
-    };
-    /**
-     * Get elements as an array
-     */
-    AbstractLinkedList.prototype.getAsArray = function () {
-        var array = [];
-        var currentNode = this._tail;
-        var counter = 0;
-        while (currentNode && counter < this._length) {
-            if (currentNode)
-                array.push(currentNode.data);
-            currentNode = currentNode.next;
-            counter++;
-        }
-        return array;
-    };
-    /**
-     * Add elements to list from array
-     * @throws when list is full
-     * */
-    AbstractLinkedList.prototype.pushFromArray = function (elements) {
-        var _this = this;
-        elements.forEach(function (element) {
-            if (_this.isFull()) {
-                throw new Error("List is full, no more space available");
-            }
-            _this.push(element);
-        });
-    };
-    return AbstractLinkedList;
-}());
-exports.default = AbstractLinkedList;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiQWJzdHJhY3RMaW5rZWRMaXN0LmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL2RhdGEtc3RydWN0dXJlcy9MaW5rZWRMaXN0L0Fic3RyYWN0TGlua2VkTGlzdC9BYnN0cmFjdExpbmtlZExpc3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7QUFHQTtJQU1FOztPQUVHO0lBQ0gsNEJBQXNCLFFBQWlCO1FBQ3JDLElBQUksQ0FBQyxTQUFTLEdBQUcsa0JBQWtCLENBQUMsaUJBQWlCLENBQUMsUUFBUSxDQUFDLENBQUM7UUFDaEUsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLENBQUM7UUFDbEIsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLENBQUM7UUFDbEIsSUFBSSxDQUFDLE9BQU8sR0FBRyxDQUFDLENBQUM7SUFDbkIsQ0FBQztJQUVEOzs7T0FHRztJQUNZLG9DQUFpQixHQUFoQyxVQUFpQyxRQUFpQjtRQUNoRCxJQUFJLFFBQVEsS0FBSyxTQUFTLEVBQUU7WUFDMUIsT0FBTyxNQUFNLENBQUMsU0FBUyxDQUFDO1NBQ3pCO1FBQ0QsSUFBSSxRQUFRLElBQUksQ0FBQyxFQUFFO1lBQ2pCLE1BQU0sSUFBSSxLQUFLLENBQUMsZ0NBQWdDLENBQUMsQ0FBQztTQUNuRDtRQUVELE9BQU8sUUFBUSxDQUFDO0lBQ2xCLENBQUM7SUFFRDs7O09BR0c7SUFDSyxzREFBeUIsR0FBakMsVUFDRSxVQUFpQyxFQUNqQyxRQUFzQyxFQUN0QyxTQUF1QztRQUV2QyxJQUFJLElBQUksQ0FBQyxNQUFNLEVBQUUsRUFBRTtZQUNqQixNQUFNLElBQUksS0FBSyxDQUFDLHVDQUF1QyxDQUFDLENBQUM7U0FDMUQ7UUFDRCxJQUFJLElBQUksQ0FBQyxLQUFLLEtBQUssSUFBSSxFQUFFO1lBQ3ZCLElBQUksQ0FBQyxLQUFLLEdBQUcsVUFBVSxDQUFDO1NBQ3pCO1FBQ0QsSUFBSSxJQUFJLENBQUMsS0FBSyxLQUFLLElBQUksRUFBRTtZQUN2QixJQUFJLENBQUMsS0FBSyxHQUFHLFVBQVUsQ0FBQztTQUN6QjtRQUNELElBQUksQ0FBQyxRQUFRLEVBQUU7WUFDYixRQUFRLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQztTQUN2QjtRQUNELElBQUksQ0FBQyxTQUFTLEVBQUU7WUFDZCxTQUFTLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQztTQUN4QjtRQUVELElBQUksQ0FBQyw2QkFBNkIsQ0FBQyxVQUFVLEVBQUUsUUFBUSxFQUFFLFNBQVMsQ0FBQyxDQUFDO1FBQ3BFLElBQUksQ0FBQyxPQUFPLEVBQUUsQ0FBQztJQUNqQixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ssdUNBQVUsR0FBbEIsVUFDRSxJQUFrQztRQUVsQyxJQUFJLElBQUksS0FBSyxJQUFJLEVBQUU7WUFDakIsTUFBTSxJQUFJLEtBQUssQ0FBQyx3QkFBd0IsQ0FBQyxDQUFDO1NBQzNDO1FBQ0QsSUFBSSxDQUFDLGNBQWMsQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUMxQixJQUFJLENBQUMsT0FBTyxFQUFFLENBQUM7UUFFZixJQUFJLElBQUksQ0FBQyxPQUFPLEVBQUUsRUFBRTtZQUNsQixJQUFJLENBQUMsS0FBSyxFQUFFLENBQUM7U0FDZDtRQUNELE9BQU8sSUFBSSxDQUFDO0lBQ2QsQ0FBQztJQUVEOzs7T0FHRztJQUNPLDJDQUFjLEdBQXhCLFVBQXlCLEtBQWE7UUFDcEMsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLEtBQUssQ0FBQyxlQUFlLENBQUMsQ0FBQztTQUNsQztRQUNELElBQUksSUFBSSxDQUFDLE9BQU8sR0FBRyxLQUFLLEVBQUU7WUFDeEIsTUFBTSxJQUFJLEtBQUssQ0FBQywwQkFBMEIsQ0FBQyxDQUFDO1NBQzdDO1FBRUQsSUFBSSxXQUFXLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQztRQUM3QixJQUFJLE9BQU8sR0FBRyxDQUFDLENBQUM7UUFFaEIsT0FBTyxXQUFXLElBQUksT0FBTyxHQUFHLEtBQUssRUFBRTtZQUNyQyxXQUFXLEdBQUcsV0FBVyxDQUFDLElBQUksQ0FBQztZQUMvQixPQUFPLEVBQUUsQ0FBQztTQUNYO1FBRUQsSUFBSSxXQUFXLEtBQUssSUFBSSxFQUFFO1lBQ3hCLE1BQU0sSUFBSSxLQUFLLENBQUMscUJBQXFCLENBQUMsQ0FBQztTQUN4QztRQUVELE9BQU8sV0FBVyxDQUFDO0lBQ3JCLENBQUM7SUErQkQ7O09BRUc7SUFDSSxvQ0FBTyxHQUFkLFVBQWUsS0FBUTtRQUNyQixJQUFNLElBQUksR0FBRyxJQUFJLENBQUMsVUFBVSxDQUFDLEtBQUssQ0FBQyxDQUFDO1FBQ3BDLElBQUksQ0FBQyx5QkFBeUIsQ0FBQyxJQUFJLEVBQUUsSUFBSSxDQUFDLEtBQUssRUFBRSxJQUFJLENBQUMsS0FBSyxDQUFDLENBQUM7UUFDN0QsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLENBQUM7SUFDcEIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksaUNBQUksR0FBWCxVQUFZLEtBQVE7UUFDbEIsSUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLFVBQVUsQ0FBQyxLQUFLLENBQUMsQ0FBQztRQUNwQyxJQUFJLENBQUMseUJBQXlCLENBQUMsSUFBSSxFQUFFLElBQUksQ0FBQyxLQUFLLEVBQUUsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO1FBQzdELElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO0lBQ3BCLENBQUM7SUFFRDs7T0FFRztJQUNJLDBDQUFhLEdBQXBCLFVBQXFCLEtBQVEsRUFBRSxTQUFpQjtRQUM5QyxJQUFNLGlCQUFpQixHQUFHLFNBQVMsR0FBRyxDQUFDLElBQUksU0FBUyxHQUFHLElBQUksQ0FBQyxPQUFPLENBQUM7UUFDcEUsSUFBTSxpQkFBaUIsR0FBRyxJQUFJLENBQUMsT0FBTyxFQUFFLElBQUksU0FBUyxLQUFLLENBQUMsQ0FBQztRQUU1RCxJQUFJLGlCQUFpQixFQUFFO1lBQ3JCLE1BQU0sSUFBSSxLQUFLLENBQUMsa0RBQWtELENBQUMsQ0FBQztTQUNyRTtRQUNELElBQUksaUJBQWlCLEVBQUU7WUFDckIsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsQ0FBQztTQUNsQjthQUFNO1lBQ0wsSUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLFVBQVUsQ0FBQyxLQUFLLENBQUMsQ0FBQztZQUNwQyxJQUFNLFFBQVEsR0FBRyxJQUFJLENBQUMsY0FBYyxDQUFDLFNBQVMsR0FBRyxDQUFDLENBQUMsQ0FBQztZQUNwRCxJQUFNLFNBQVMsR0FBRyxJQUFJLENBQUMsY0FBYyxDQUFDLFNBQVMsQ0FBQyxDQUFDO1lBQ2pELElBQUksQ0FBQyx5QkFBeUIsQ0FBQyxJQUFJLEVBQUUsUUFBUSxFQUFFLFNBQVMsQ0FBQyxDQUFDO1NBQzNEO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksZ0NBQUcsR0FBVjtRQUNFLElBQU0sV0FBVyxHQUFHLElBQUksQ0FBQyxVQUFVLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO1FBQ2hELElBQUksQ0FBQyxPQUFPLEVBQUUsQ0FBQztRQUNmLE9BQU8sV0FBVyxDQUFDLElBQUksQ0FBQztJQUMxQixDQUFDO0lBRUQ7O09BRUc7SUFDSSxrQ0FBSyxHQUFaO1FBQ0UsSUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLFVBQVUsQ0FBQyxJQUFJLENBQUMsS0FBSyxDQUFDLENBQUM7UUFDaEQsSUFBSSxDQUFDLFNBQVMsRUFBRSxDQUFDO1FBQ2pCLE9BQU8sV0FBVyxDQUFDLElBQUksQ0FBQztJQUMxQixDQUFDO0lBRUQ7O09BRUc7SUFDSSw0Q0FBZSxHQUF0QixVQUF1QixTQUFpQjtRQUN0QyxJQUFNLFlBQVksR0FBRyxJQUFJLENBQUMsY0FBYyxDQUFDLFNBQVMsQ0FBQyxDQUFDO1FBQ3BELElBQU0sV0FBVyxHQUFHLElBQUksQ0FBQyxVQUFVLENBQUMsWUFBWSxDQUFDLENBQUM7UUFDbEQsT0FBTyxXQUFXLENBQUMsSUFBSSxDQUFDO0lBQzFCLENBQUM7SUFFRDs7T0FFRztJQUNJLG1DQUFNLEdBQWI7UUFDRSxPQUFPLElBQUksQ0FBQyxPQUFPLENBQUM7SUFDdEIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksb0NBQU8sR0FBZDtRQUNFLE9BQU8sSUFBSSxDQUFDLE9BQU8sS0FBSyxDQUFDLENBQUM7SUFDNUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksbUNBQU0sR0FBYjtRQUNFLE9BQU8sSUFBSSxDQUFDLE9BQU8sSUFBSSxJQUFJLENBQUMsU0FBUyxDQUFDO0lBQ3hDLENBQUM7SUFFRDs7T0FFRztJQUNJLGdDQUFHLEdBQVYsVUFBVyxJQUFPO1FBQ2hCLE9BQU8sSUFBSSxDQUFDLFVBQVUsRUFBRSxDQUFDLFFBQVEsQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUMxQyxDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksaUNBQUksR0FBWDtRQUNFLElBQUksQ0FBQyxJQUFJLENBQUMsS0FBSyxFQUFFO1lBQ2YsTUFBTSxJQUFJLEtBQUssQ0FBQyxxQkFBcUIsQ0FBQyxDQUFDO1NBQ3hDO1FBRUQsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLElBQUksQ0FBQztJQUN6QixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksMENBQWEsR0FBcEI7UUFDRSxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssRUFBRTtZQUNmLE1BQU0sSUFBSSxLQUFLLENBQUMscUJBQXFCLENBQUMsQ0FBQztTQUN4QztRQUVELE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLENBQUM7SUFDekIsQ0FBQztJQUVEOzs7T0FHRztJQUNJLHdDQUFXLEdBQWxCLFVBQW1CLEtBQWE7UUFDOUIsSUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLGNBQWMsQ0FBQyxLQUFLLENBQUMsQ0FBQztRQUN4QyxPQUFPLElBQUksQ0FBQyxJQUFJLENBQUM7SUFDbkIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksa0NBQUssR0FBWjtRQUNFLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO1FBQ2xCLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO1FBQ2xCLElBQUksQ0FBQyxPQUFPLEdBQUcsQ0FBQyxDQUFDO0lBQ25CLENBQUM7SUFFRDs7T0FFRztJQUNJLHVDQUFVLEdBQWpCO1FBQ0UsSUFBTSxLQUFLLEdBQWEsRUFBRSxDQUFDO1FBQzNCLElBQUksV0FBVyxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDN0IsSUFBSSxPQUFPLEdBQUcsQ0FBQyxDQUFDO1FBRWhCLE9BQU8sV0FBVyxJQUFJLE9BQU8sR0FBRyxJQUFJLENBQUMsT0FBTyxFQUFFO1lBQzVDLElBQUksV0FBVztnQkFBRSxLQUFLLENBQUMsSUFBSSxDQUFDLFdBQVcsQ0FBQyxJQUFJLENBQUMsQ0FBQztZQUU5QyxXQUFXLEdBQUcsV0FBVyxDQUFDLElBQUksQ0FBQztZQUMvQixPQUFPLEVBQUUsQ0FBQztTQUNYO1FBRUQsT0FBTyxLQUFLLENBQUM7SUFDZixDQUFDO0lBRUQ7OztTQUdLO0lBQ0UsMENBQWEsR0FBcEIsVUFBcUIsUUFBa0I7UUFBdkMsaUJBT0M7UUFOQyxRQUFRLENBQUMsT0FBTyxDQUFDLFVBQUMsT0FBVTtZQUMxQixJQUFJLEtBQUksQ0FBQyxNQUFNLEVBQUUsRUFBRTtnQkFDakIsTUFBTSxJQUFJLEtBQUssQ0FBQyx1Q0FBdUMsQ0FBQyxDQUFDO2FBQzFEO1lBQ0QsS0FBSSxDQUFDLElBQUksQ0FBQyxPQUFPLENBQUMsQ0FBQztRQUNyQixDQUFDLENBQUMsQ0FBQztJQUNMLENBQUM7SUFPSCx5QkFBQztBQUFELENBQUMsQUFsVEQsSUFrVEMifQ==

package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedNode.d.ts

@@ -1,20 +0,0 @@
-export default abstract class AbstractLinkedNode<T> {
-    protected _next: AbstractLinkedNode<T> | null;
-    protected readonly _data: T;
-    /**
-     * Will create empty node
-     */
-    protected constructor(data: T, next?: AbstractLinkedNode<T> | null);
-    /**
-     * Get data of node
-     */
-    get data(): T;
-    /**
-     * Get next node link
-     */
-    get next(): AbstractLinkedNode<T> | null;
-    /**
-     * Set next node link
-     */
-    set next(value: AbstractLinkedNode<T> | null);
-}

package/lib/data-structures/LinkedList/AbstractLinkedList/AbstractLinkedNode.js

@@ -1,41 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var AbstractLinkedNode = /** @class */ (function () {
-    /**
-     * Will create empty node
-     */
-    function AbstractLinkedNode(data, next) {
-        if (next === void 0) { next = null; }
-        this._data = data;
-        this._next = next;
-    }
-    Object.defineProperty(AbstractLinkedNode.prototype, "data", {
-        /**
-         * Get data of node
-         */
-        get: function () {
-            return this._data;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractLinkedNode.prototype, "next", {
-        /**
-         * Get next node link
-         */
-        get: function () {
-            return this._next;
-        },
-        /**
-         * Set next node link
-         */
-        set: function (value) {
-            this._next = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return AbstractLinkedNode;
-}());
-exports.default = AbstractLinkedNode;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiQWJzdHJhY3RMaW5rZWROb2RlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL2RhdGEtc3RydWN0dXJlcy9MaW5rZWRMaXN0L0Fic3RyYWN0TGlua2VkTGlzdC9BYnN0cmFjdExpbmtlZE5vZGUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7QUFBQTtJQUlFOztPQUVHO0lBQ0gsNEJBQXNCLElBQU8sRUFBRSxJQUF5QztRQUF6QyxxQkFBQSxFQUFBLFdBQXlDO1FBQ3RFLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO1FBQ2xCLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO0lBQ3BCLENBQUM7SUFLRCxzQkFBVyxvQ0FBSTtRQUhmOztXQUVHO2FBQ0g7WUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDcEIsQ0FBQzs7O09BQUE7SUFLRCxzQkFBVyxvQ0FBSTtRQUhmOztXQUVHO2FBQ0g7WUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDcEIsQ0FBQztRQUVEOztXQUVHO2FBQ0gsVUFBZ0IsS0FBbUM7WUFDakQsSUFBSSxDQUFDLEtBQUssR0FBRyxLQUFLLENBQUM7UUFDckIsQ0FBQzs7O09BUEE7SUFRSCx5QkFBQztBQUFELENBQUMsQUFoQ0QsSUFnQ0MifQ==

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

@@ -1,48 +0,0 @@
-import IBiDirectIterator from "../../../types/IBiDirectIterator";
-import IBiDirectIterable from "../../../types/IBiDirectIterable";
-import AbstractLinkedList from "../AbstractLinkedList/AbstractLinkedList";
-import DoubleLinkedNode from "./DoubleLinkedNode";
-/**
- * Linear data structure
- * Each node has next and prev sibling
- * Head and tail are linked to each other
- */
-export default class DoubleLinkedList<T> extends AbstractLinkedList<T> implements IBiDirectIterable<T> {
-    /**
-     * Override types
-     */
-    protected _head: DoubleLinkedNode<T> | null;
-    protected _tail: DoubleLinkedNode<T> | null;
-    /**
-     * @inheritDoc
-     */
-    constructor(capacity?: number);
-    /**
-     * @inheritDoc
-     */
-    protected createNode(value: T): DoubleLinkedNode<T>;
-    /**
-     * @inheritDoc
-     */
-    protected insertNodeBetweenTwoNodesImpl(targetNode: DoubleLinkedNode<T>, leftNode: DoubleLinkedNode<T>, rightNode: DoubleLinkedNode<T>): void;
-    /**
-     * @inheritDoc
-     */
-    protected deleteNodeImpl(node: DoubleLinkedNode<T>): void;
-    /**
-     * @inheritDoc
-     */
-    protected popImpl(): void;
-    /**
-     * @inheritDoc
-     */
-    protected shiftImpl(): void;
-    /**
-     * @inheritDoc
-     */
-    reverse(): void;
-    /**
-     * List iterator
-     */
-    iterator(fromIndex?: number): IBiDirectIterator<T>;
-}

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

@@ -1,150 +0,0 @@
-"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 DoubleLinkedNode_1 = require("./DoubleLinkedNode");
-/**
- * Linear data structure
- * Each node has next and prev sibling
- * Head and tail are linked to each other
- */
-var DoubleLinkedList = /** @class */ (function (_super) {
-    __extends(DoubleLinkedList, _super);
-    /**
-     * @inheritDoc
-     */
-    function DoubleLinkedList(capacity) {
-        var _this = _super.call(this, capacity) || this;
-        _this._head = null;
-        _this._tail = null;
-        return _this;
-    }
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.createNode = function (value) {
-        return new DoubleLinkedNode_1.default(value);
-    };
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.insertNodeBetweenTwoNodesImpl = function (targetNode, leftNode, rightNode) {
-        targetNode.next = rightNode;
-        targetNode.prev = leftNode;
-        if (targetNode.prev) {
-            targetNode.prev.next = targetNode;
-        }
-        if (targetNode.next) {
-            targetNode.next.prev = targetNode;
-        }
-    };
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.deleteNodeImpl = function (node) {
-        node.prev.next = node.next;
-        node.next.prev = node.prev;
-        node.next = null;
-        node.prev = null;
-    };
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.popImpl = function () {
-        var _a;
-        this._head = ((_a = this._tail) === null || _a === void 0 ? void 0 : _a.prev) || null;
-    };
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.shiftImpl = function () {
-        var _a;
-        this._tail = ((_a = this._head) === null || _a === void 0 ? void 0 : _a.next) || null;
-    };
-    /**
-     * @inheritDoc
-     */
-    DoubleLinkedList.prototype.reverse = function () {
-        var currentNode = this._tail;
-        var i = 0;
-        while (currentNode && i < this._length) {
-            var newPrev = currentNode.next;
-            var newNext = currentNode.prev;
-            currentNode.prev = newPrev;
-            currentNode.next = newNext;
-            i++;
-            currentNode = newNext;
-        }
-        if (currentNode) {
-            this._tail = currentNode.next;
-            this._head = currentNode;
-        }
-    };
-    /**
-     * List iterator
-     */
-    DoubleLinkedList.prototype.iterator = function (fromIndex) {
-        if (fromIndex === void 0) { fromIndex = 0; }
-        var head = this._head;
-        var tail = this._tail;
-        var activeNode = this.getNodeByIndex(fromIndex);
-        var iterator = {
-            /**
-             * @inheritDoc
-             */
-            current: function () {
-                return activeNode.data;
-            },
-            /**
-             * @inheritDoc
-             */
-            hasNext: function () {
-                return Boolean(activeNode.next) && activeNode !== head;
-            },
-            /**
-             * @inheritDoc
-             */
-            hasPrev: function () {
-                return Boolean(activeNode.prev) && activeNode !== tail;
-            },
-            /**
-             * @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;
-            },
-            /**
-             * @inheritDoc
-             * @throws when prev element does not exists
-             */
-            prev: function () {
-                if (!iterator.hasPrev()) {
-                    throw new Error("Prev element does not exist");
-                }
-                activeNode = activeNode.prev;
-                return activeNode.data;
-            },
-        };
-        return iterator;
-    };
-    return DoubleLinkedList;
-}(AbstractLinkedList_1.default));
-exports.default = DoubleLinkedList;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRG91YmxlTGlua2VkTGlzdC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvTGlua2VkTGlzdC9Eb3VibGVMaW5rZWRMaXN0L0RvdWJsZUxpbmtlZExpc3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7O0FBRUEsK0VBQTBFO0FBQzFFLHVEQUFrRDtBQUVsRDs7OztHQUlHO0FBQ0g7SUFDVSxvQ0FBcUI7SUFRN0I7O09BRUc7SUFDSCwwQkFBbUIsUUFBaUI7UUFBcEMsWUFDRSxrQkFBTSxRQUFRLENBQUMsU0FHaEI7UUFGQyxLQUFJLENBQUMsS0FBSyxHQUFHLElBQUksQ0FBQztRQUNsQixLQUFJLENBQUMsS0FBSyxHQUFHLElBQUksQ0FBQzs7SUFDcEIsQ0FBQztJQUVEOztPQUVHO0lBQ08scUNBQVUsR0FBcEIsVUFBcUIsS0FBUTtRQUMzQixPQUFPLElBQUksMEJBQWdCLENBQUksS0FBSyxDQUFDLENBQUM7SUFDeEMsQ0FBQztJQUVEOztPQUVHO0lBQ08sd0RBQTZCLEdBQXZDLFVBQ0UsVUFBK0IsRUFDL0IsUUFBNkIsRUFDN0IsU0FBOEI7UUFFOUIsVUFBVSxDQUFDLElBQUksR0FBRyxTQUFTLENBQUM7UUFDNUIsVUFBVSxDQUFDLElBQUksR0FBRyxRQUFRLENBQUM7UUFFM0IsSUFBSSxVQUFVLENBQUMsSUFBSSxFQUFFO1lBQ25CLFVBQVUsQ0FBQyxJQUFJLENBQUMsSUFBSSxHQUFHLFVBQVUsQ0FBQztTQUNuQztRQUNELElBQUksVUFBVSxDQUFDLElBQUksRUFBRTtZQUNuQixVQUFVLENBQUMsSUFBSSxDQUFDLElBQUksR0FBRyxVQUFVLENBQUM7U0FDbkM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDTyx5Q0FBYyxHQUF4QixVQUF5QixJQUF5QjtRQUNoRCxJQUFLLENBQUMsSUFBSyxDQUFDLElBQUksR0FBRyxJQUFLLENBQUMsSUFBSSxDQUFDO1FBQzlCLElBQUssQ0FBQyxJQUFLLENBQUMsSUFBSSxHQUFHLElBQUssQ0FBQyxJQUFJLENBQUM7UUFDOUIsSUFBSyxDQUFDLElBQUksR0FBRyxJQUFJLENBQUM7UUFDbEIsSUFBSyxDQUFDLElBQUksR0FBRyxJQUFJLENBQUM7SUFDcEIsQ0FBQztJQUVEOztPQUVHO0lBQ08sa0NBQU8sR0FBakI7O1FBQ0UsSUFBSSxDQUFDLEtBQUssR0FBRyxPQUFBLElBQUksQ0FBQyxLQUFLLDBDQUFFLElBQUksS0FBSSxJQUFJLENBQUM7SUFDeEMsQ0FBQztJQUVEOztPQUVHO0lBQ08sb0NBQVMsR0FBbkI7O1FBQ0UsSUFBSSxDQUFDLEtBQUssR0FBRyxPQUFBLElBQUksQ0FBQyxLQUFLLDBDQUFFLElBQUksS0FBSSxJQUFJLENBQUM7SUFDeEMsQ0FBQztJQUVEOztPQUVHO0lBQ0ksa0NBQU8sR0FBZDtRQUNFLElBQUksV0FBVyxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDN0IsSUFBSSxDQUFDLEdBQUcsQ0FBQyxDQUFDO1FBRVYsT0FBTyxXQUFXLElBQUksQ0FBQyxHQUFHLElBQUksQ0FBQyxPQUFPLEVBQUU7WUFDdEMsSUFBTSxPQUFPLEdBQUcsV0FBVyxDQUFDLElBQUksQ0FBQztZQUNqQyxJQUFNLE9BQU8sR0FBRyxXQUFXLENBQUMsSUFBSSxDQUFDO1lBRWpDLFdBQVcsQ0FBQyxJQUFJLEdBQUcsT0FBTyxDQUFDO1lBQzNCLFdBQVcsQ0FBQyxJQUFJLEdBQUcsT0FBTyxDQUFDO1lBRTNCLENBQUMsRUFBRSxDQUFDO1lBQ0osV0FBVyxHQUFHLE9BQU8sQ0FBQztTQUN2QjtRQUVELElBQUksV0FBVyxFQUFFO1lBQ2YsSUFBSSxDQUFDLEtBQUssR0FBRyxXQUFXLENBQUMsSUFBSSxDQUFDO1lBQzlCLElBQUksQ0FBQyxLQUFLLEdBQUcsV0FBVyxDQUFDO1NBQzFCO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksbUNBQVEsR0FBZixVQUFnQixTQUFhO1FBQWIsMEJBQUEsRUFBQSxhQUFhO1FBQzNCLElBQU0sSUFBSSxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDeEIsSUFBTSxJQUFJLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQztRQUN4QixJQUFJLFVBQVUsR0FBRyxJQUFJLENBQUMsY0FBYyxDQUFDLFNBQVMsQ0FBd0IsQ0FBQztRQUV2RSxJQUFNLFFBQVEsR0FBeUI7WUFDckM7O2VBRUc7WUFDSCxPQUFPLEVBQUU7Z0JBQ1AsT0FBTyxVQUFVLENBQUMsSUFBSSxDQUFDO1lBQ3pCLENBQUM7WUFDRDs7ZUFFRztZQUNILE9BQU8sRUFBUDtnQkFDRSxPQUFPLE9BQU8sQ0FBQyxVQUFVLENBQUMsSUFBSSxDQUFDLElBQUksVUFBVSxLQUFLLElBQUksQ0FBQztZQUN6RCxDQUFDO1lBQ0Q7O2VBRUc7WUFDSCxPQUFPLEVBQVA7Z0JBQ0UsT0FBTyxPQUFPLENBQUMsVUFBVSxDQUFDLElBQUksQ0FBQyxJQUFJLFVBQVUsS0FBSyxJQUFJLENBQUM7WUFDekQsQ0FBQztZQUNEOzs7ZUFHRztZQUNILElBQUksRUFBRTtnQkFDSixJQUFJLENBQUMsUUFBUSxDQUFDLE9BQU8sRUFBRSxFQUFFO29CQUN2QixNQUFNLElBQUksS0FBSyxDQUFDLDZCQUE2QixDQUFDLENBQUM7aUJBQ2hEO2dCQUNELFVBQVUsR0FBRyxVQUFVLENBQUMsSUFBSyxDQUFDO2dCQUM5QixPQUFPLFVBQVUsQ0FBQyxJQUFJLENBQUM7WUFDekIsQ0FBQztZQUNEOzs7ZUFHRztZQUNILElBQUksRUFBRTtnQkFDSixJQUFJLENBQUMsUUFBUSxDQUFDLE9BQU8sRUFBRSxFQUFFO29CQUN2QixNQUFNLElBQUksS0FBSyxDQUFDLDZCQUE2QixDQUFDLENBQUM7aUJBQ2hEO2dCQUNELFVBQVUsR0FBRyxVQUFVLENBQUMsSUFBSyxDQUFDO2dCQUM5QixPQUFPLFVBQVUsQ0FBQyxJQUFJLENBQUM7WUFDekIsQ0FBQztTQUNGLENBQUM7UUFFRixPQUFPLFFBQVEsQ0FBQztJQUNsQixDQUFDO0lBQ0gsdUJBQUM7QUFBRCxDQUFDLEFBakpELENBQ1UsNEJBQWtCLEdBZ0ozQiJ9

package/lib/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedNode.d.ts

@@ -1,25 +0,0 @@
-import AbstractLinkedNode from "../AbstractLinkedList/AbstractLinkedNode";
-export default class DoubleLinkedNode<T> extends AbstractLinkedNode<T> {
-    protected _prev: DoubleLinkedNode<T> | null;
-    protected _next: DoubleLinkedNode<T> | null;
-    /**
-     * Will create empty node
-     */
-    constructor(data: T, next?: DoubleLinkedNode<T> | null, prev?: DoubleLinkedNode<T> | null);
-    /**
-     * Set previous node link
-     */
-    set prev(value: DoubleLinkedNode<T> | null);
-    /**
-     * Get previous node link
-     */
-    get prev(): DoubleLinkedNode<T> | null;
-    /**
-     * @inheritDoc
-     */
-    set next(value: DoubleLinkedNode<T> | null);
-    /**
-     * @inheritDoc
-     */
-    get next(): DoubleLinkedNode<T> | null;
-}