@raikuxq/alg-ds 1.1.5 → 1.2.0

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/Queue/Queue.js

@@ -1,83 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var DoubleLinkedList_1 = require("../LinkedList/DoubleLinkedList/DoubleLinkedList");
-/**
- * FIFO data structure
- */
-var Queue = /** @class */ (function () {
-    /**
-     * Create a queue instance
-     */
-    function Queue(capacity) {
-        this._list = new DoubleLinkedList_1.default(capacity);
-    }
-    /**
-     * Get first element in queue (without deleting)
-     * @throws when list is empty
-     */
-    Queue.prototype.peek = function () {
-        if (this.isEmpty()) {
-            throw new Error("Cannot peek when list is empty");
-        }
-        return this._list.peek();
-    };
-    /**
-     * Add element to queue
-     * @throws when list is full
-     */
-    Queue.prototype.push = function (item) {
-        if (this._list.isFull()) {
-            throw new Error("Cannot push when queue is full");
-        }
-        this._list.unshift(item);
-    };
-    /**
-     * Delete first element in queue
-     * @throws when list is empty
-     */
-    Queue.prototype.pop = function () {
-        if (this.isEmpty()) {
-            throw new Error("Cannot pop when list is empty");
-        }
-        return this._list.pop();
-    };
-    /**
-     * Check if element exists in list
-     */
-    Queue.prototype.has = function (item) {
-        return this._list.has(item);
-    };
-    /**
-     * Is queue empty
-     */
-    Queue.prototype.isEmpty = function () {
-        return this._list.isEmpty();
-    };
-    /**
-     * Is stack full
-     */
-    Queue.prototype.isFull = function () {
-        return this._list.isFull();
-    };
-    /**
-     * Remove all elements in queue
-     */
-    Queue.prototype.clear = function () {
-        this._list.clear();
-    };
-    /**
-     * Queue length
-     */
-    Queue.prototype.length = function () {
-        return this._list.length();
-    };
-    /**
-     * Reverse queue
-     */
-    Queue.prototype.reverse = function () {
-        this._list.reverse();
-    };
-    return Queue;
-}());
-exports.default = Queue;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiUXVldWUuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvZGF0YS1zdHJ1Y3R1cmVzL1F1ZXVlL1F1ZXVlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBQUEsb0ZBQStFO0FBSS9FOztHQUVHO0FBQ0g7SUFHRTs7T0FFRztJQUNILGVBQW1CLFFBQWlCO1FBQ2xDLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSwwQkFBZ0IsQ0FBSSxRQUFRLENBQUMsQ0FBQztJQUNqRCxDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksb0JBQUksR0FBWDtRQUNFLElBQUksSUFBSSxDQUFDLE9BQU8sRUFBRSxFQUFFO1lBQ2xCLE1BQU0sSUFBSSxLQUFLLENBQUMsZ0NBQWdDLENBQUMsQ0FBQztTQUNuRDtRQUNELE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLEVBQUUsQ0FBQztJQUMzQixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksb0JBQUksR0FBWCxVQUFZLElBQU87UUFDakIsSUFBSSxJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sRUFBRSxFQUFFO1lBQ3ZCLE1BQU0sSUFBSSxLQUFLLENBQUMsZ0NBQWdDLENBQUMsQ0FBQztTQUNuRDtRQUNELElBQUksQ0FBQyxLQUFLLENBQUMsT0FBTyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQzNCLENBQUM7SUFFRDs7O09BR0c7SUFDSSxtQkFBRyxHQUFWO1FBQ0UsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLEtBQUssQ0FBQywrQkFBK0IsQ0FBQyxDQUFDO1NBQ2xEO1FBQ0QsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLEdBQUcsRUFBRSxDQUFDO0lBQzFCLENBQUM7SUFFRDs7T0FFRztJQUNJLG1CQUFHLEdBQVYsVUFBVyxJQUFPO1FBQ2hCLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDOUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUJBQU8sR0FBZDtRQUNFLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxPQUFPLEVBQUUsQ0FBQztJQUM5QixDQUFDO0lBRUQ7O09BRUc7SUFDSSxzQkFBTSxHQUFiO1FBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sRUFBRSxDQUFDO0lBQzdCLENBQUM7SUFFRDs7T0FFRztJQUNJLHFCQUFLLEdBQVo7UUFDRSxJQUFJLENBQUMsS0FBSyxDQUFDLEtBQUssRUFBRSxDQUFDO0lBQ3JCLENBQUM7SUFFRDs7T0FFRztJQUNJLHNCQUFNLEdBQWI7UUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsTUFBTSxFQUFFLENBQUM7SUFDN0IsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUJBQU8sR0FBZDtRQUNFLElBQUksQ0FBQyxLQUFLLENBQUMsT0FBTyxFQUFFLENBQUM7SUFDdkIsQ0FBQztJQUNILFlBQUM7QUFBRCxDQUFDLEFBcEZELElBb0ZDIn0=

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

@@ -1,83 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var DoubleLinkedList_1 = require("../LinkedList/DoubleLinkedList/DoubleLinkedList");
-/**
- * LIFO data structure
- */
-var Stack = /** @class */ (function () {
-    /**
-     * Create a stack instance
-     */
-    function Stack(capacity) {
-        this._list = new DoubleLinkedList_1.default(capacity);
-    }
-    /**
-     * Get stack top element
-     * @throws when list is empty
-     */
-    Stack.prototype.peek = function () {
-        if (this.isEmpty()) {
-            throw new Error("Cannot peek when list is empty");
-        }
-        return this._list.peek();
-    };
-    /**
-     * Add element to stack head
-     * @throws when list is full
-     */
-    Stack.prototype.push = function (item) {
-        if (this.isFull()) {
-            throw new Error("Stack is full");
-        }
-        this._list.push(item);
-    };
-    /**
-     * Remove element from stack head
-     * @throws when list is empty
-     */
-    Stack.prototype.pop = function () {
-        if (this.isEmpty()) {
-            throw new Error("Cannot pop when stack is empty");
-        }
-        return this._list.pop();
-    };
-    /**
-     * Check if element exists in list
-     */
-    Stack.prototype.has = function (item) {
-        return this._list.has(item);
-    };
-    /**
-     * Is stack empty
-     */
-    Stack.prototype.isEmpty = function () {
-        return this._list.isEmpty();
-    };
-    /**
-     * Is stack full
-     */
-    Stack.prototype.isFull = function () {
-        return this._list.isFull();
-    };
-    /**
-     * Remove all elements in stack
-     */
-    Stack.prototype.clear = function () {
-        this._list.clear();
-    };
-    /**
-     * Queue length
-     */
-    Stack.prototype.length = function () {
-        return this._list.length();
-    };
-    /**
-     * Reverse stack
-     */
-    Stack.prototype.reverse = function () {
-        this._list.reverse();
-    };
-    return Stack;
-}());
-exports.default = Stack;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU3RhY2suanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi9zcmMvZGF0YS1zdHJ1Y3R1cmVzL1N0YWNrL1N0YWNrLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBQUEsb0ZBQStFO0FBSS9FOztHQUVHO0FBQ0g7SUFHRTs7T0FFRztJQUNILGVBQW1CLFFBQWlCO1FBQ2xDLElBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSwwQkFBZ0IsQ0FBQyxRQUFRLENBQUMsQ0FBQztJQUM5QyxDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksb0JBQUksR0FBWDtRQUNFLElBQUksSUFBSSxDQUFDLE9BQU8sRUFBRSxFQUFFO1lBQ2xCLE1BQU0sSUFBSSxLQUFLLENBQUMsZ0NBQWdDLENBQUMsQ0FBQztTQUNuRDtRQUNELE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLEVBQUUsQ0FBQztJQUMzQixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksb0JBQUksR0FBWCxVQUFZLElBQU87UUFDakIsSUFBSSxJQUFJLENBQUMsTUFBTSxFQUFFLEVBQUU7WUFDakIsTUFBTSxJQUFJLEtBQUssQ0FBQyxlQUFlLENBQUMsQ0FBQztTQUNsQztRQUNELElBQUksQ0FBQyxLQUFLLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQ3hCLENBQUM7SUFFRDs7O09BR0c7SUFDSSxtQkFBRyxHQUFWO1FBQ0UsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLEtBQUssQ0FBQyxnQ0FBZ0MsQ0FBQyxDQUFDO1NBQ25EO1FBQ0QsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLEdBQUcsRUFBRSxDQUFDO0lBQzFCLENBQUM7SUFFRDs7T0FFRztJQUNJLG1CQUFHLEdBQVYsVUFBVyxJQUFPO1FBQ2hCLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDOUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUJBQU8sR0FBZDtRQUNFLE9BQU8sSUFBSSxDQUFDLEtBQUssQ0FBQyxPQUFPLEVBQUUsQ0FBQztJQUM5QixDQUFDO0lBRUQ7O09BRUc7SUFDSSxzQkFBTSxHQUFiO1FBQ0UsT0FBTyxJQUFJLENBQUMsS0FBSyxDQUFDLE1BQU0sRUFBRSxDQUFDO0lBQzdCLENBQUM7SUFFRDs7T0FFRztJQUNJLHFCQUFLLEdBQVo7UUFDRSxJQUFJLENBQUMsS0FBSyxDQUFDLEtBQUssRUFBRSxDQUFDO0lBQ3JCLENBQUM7SUFFRDs7T0FFRztJQUNJLHNCQUFNLEdBQWI7UUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUMsTUFBTSxFQUFFLENBQUM7SUFDN0IsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUJBQU8sR0FBZDtRQUNFLElBQUksQ0FBQyxLQUFLLENBQUMsT0FBTyxFQUFFLENBQUM7SUFDdkIsQ0FBQztJQUNILFlBQUM7QUFBRCxDQUFDLEFBcEZELElBb0ZDIn0=

package/lib/helpers/createBinaryTree.d.ts

@@ -1,6 +0,0 @@
-import { EnumBinarySearchTreeType } from "../types/EnumBinarySearchTreeType";
-import IBinaryTree from "../types/IBinaryTree";
-/**
- * Returns binary tree by type
- */
-export declare const createBinaryTree: <T>(type: EnumBinarySearchTreeType) => IBinaryTree<T>;

package/lib/helpers/createBinaryTree.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createBinaryTree = void 0;
-var EnumBinarySearchTreeType_1 = require("../types/EnumBinarySearchTreeType");
-var BinarySearchTree_1 = require("../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree");
-var RandBinarySearchTree_1 = require("../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree");
-/**
- * Returns binary tree by type
- */
-exports.createBinaryTree = function (type) {
-    var binaryTree;
-    switch (type) {
-        case EnumBinarySearchTreeType_1.EnumBinarySearchTreeType.BST:
-            binaryTree = new BinarySearchTree_1.default();
-            break;
-        case EnumBinarySearchTreeType_1.EnumBinarySearchTreeType.RANDOMIZED_BST:
-            binaryTree = new RandBinarySearchTree_1.default();
-            break;
-    }
-    return binaryTree;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlQmluYXJ5VHJlZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9oZWxwZXJzL2NyZWF0ZUJpbmFyeVRyZWUudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEsOEVBQTZFO0FBQzdFLG9HQUErRjtBQUMvRixnSEFBMkc7QUFHM0c7O0dBRUc7QUFDVSxRQUFBLGdCQUFnQixHQUFHLFVBQzlCLElBQThCO0lBRTlCLElBQUksVUFBMEIsQ0FBQztJQUUvQixRQUFRLElBQUksRUFBRTtRQUNaLEtBQUssbURBQXdCLENBQUMsR0FBRztZQUMvQixVQUFVLEdBQUcsSUFBSSwwQkFBZ0IsRUFBRSxDQUFDO1lBQ3BDLE1BQU07UUFDUixLQUFLLG1EQUF3QixDQUFDLGNBQWM7WUFDMUMsVUFBVSxHQUFHLElBQUksOEJBQW9CLEVBQUUsQ0FBQztZQUN4QyxNQUFNO0tBQ1Q7SUFFRCxPQUFPLFVBQVUsQ0FBQztBQUNwQixDQUFDLENBQUMifQ==

package/lib/helpers/createGraph.d.ts

@@ -1,6 +0,0 @@
-import IGraph from "../types/IGraph";
-import { EnumGraphType } from "../types/EnumGraphType";
-/**
- * Returns graph by type
- */
-export declare const createGraph: <T>(type: EnumGraphType) => IGraph<T>;

package/lib/helpers/createGraph.js

@@ -1,24 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createGraph = void 0;
-var DirectedGraph_1 = require("../data-structures/Graph/DirectedGraph");
-var UndirectedGraph_1 = require("../data-structures/Graph/UndirectedGraph");
-var EnumGraphType_1 = require("../types/EnumGraphType");
-/**
- * Returns graph by type
- */
-exports.createGraph = function (type) {
-    var graph;
-    switch (type) {
-        case EnumGraphType_1.EnumGraphType.Directed:
-            graph = new DirectedGraph_1.default();
-            break;
-        case EnumGraphType_1.EnumGraphType.Undirected:
-            graph = new UndirectedGraph_1.default();
-            break;
-        default:
-            throw new Error("Invalid graph type");
-    }
-    return graph;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlR3JhcGguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvaGVscGVycy9jcmVhdGVHcmFwaC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFDQSx3RUFBbUU7QUFDbkUsNEVBQXVFO0FBQ3ZFLHdEQUF1RDtBQUV2RDs7R0FFRztBQUNVLFFBQUEsV0FBVyxHQUFHLFVBQUksSUFBbUI7SUFDaEQsSUFBSSxLQUFnQixDQUFDO0lBRXJCLFFBQVEsSUFBSSxFQUFFO1FBQ1osS0FBSyw2QkFBYSxDQUFDLFFBQVE7WUFDekIsS0FBSyxHQUFHLElBQUksdUJBQWEsRUFBRSxDQUFDO1lBQzVCLE1BQU07UUFDUixLQUFLLDZCQUFhLENBQUMsVUFBVTtZQUMzQixLQUFLLEdBQUcsSUFBSSx5QkFBZSxFQUFFLENBQUM7WUFDOUIsTUFBTTtRQUNSO1lBQ0UsTUFBTSxJQUFJLEtBQUssQ0FBQyxvQkFBb0IsQ0FBQyxDQUFDO0tBQ3pDO0lBRUQsT0FBTyxLQUFLLENBQUM7QUFDZixDQUFDLENBQUMifQ==

package/lib/helpers/createGraphFromMatrix.d.ts

@@ -1,7 +0,0 @@
-import IGraph from "../types/IGraph";
-import { EnumGraphType } from "../types/EnumGraphType";
-import { ArrayMatrix } from "../types/ArrayMatrix";
-/**
- * Creates a graph from N*N matrix that contains 1 in case of edge exists or 0 in case it does not
- */
-export declare const createGraphFromMatrix: <T>(matrix: ArrayMatrix, fieldsList: T[], type: EnumGraphType) => IGraph<T>;

package/lib/helpers/createGraphFromMatrix.js

@@ -1,37 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createGraphFromMatrix = void 0;
-var EnumGraphType_1 = require("../types/EnumGraphType");
-var createGraph_1 = require("./createGraph");
-var constants_1 = require("../constants");
-/**
- * Creates a graph from N*N matrix that contains 1 in case of edge exists or 0 in case it does not
- */
-exports.createGraphFromMatrix = function (matrix, fieldsList, type) {
-    var graph = createGraph_1.createGraph(type);
-    fieldsList.forEach(function (fieldName) {
-        graph.addVertex(fieldName);
-    });
-    matrix.forEach(function (row, rowIndex) {
-        row.forEach(function (col, colIndex) {
-            var rowColState = matrix[rowIndex][colIndex];
-            var colRowState = matrix[colIndex][rowIndex];
-            if (type === EnumGraphType_1.EnumGraphType.Undirected) {
-                if (rowColState === constants_1.EDGE_EXISTS_STATE &&
-                    colRowState === constants_1.EDGE_EXISTS_STATE) {
-                    graph.addEdge(fieldsList[rowIndex], fieldsList[colIndex]);
-                }
-            }
-            if (type === EnumGraphType_1.EnumGraphType.Directed) {
-                if (rowColState === constants_1.EDGE_EXISTS_STATE) {
-                    graph.addEdge(fieldsList[rowIndex], fieldsList[colIndex]);
-                }
-                if (colRowState === constants_1.EDGE_EXISTS_STATE) {
-                    graph.addEdge(fieldsList[colIndex], fieldsList[rowIndex]);
-                }
-            }
-        });
-    });
-    return graph;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlR3JhcGhGcm9tTWF0cml4LmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL2hlbHBlcnMvY3JlYXRlR3JhcGhGcm9tTWF0cml4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUNBLHdEQUF1RDtBQUV2RCw2Q0FBNEM7QUFDNUMsMENBQWlEO0FBRWpEOztHQUVHO0FBQ1UsUUFBQSxxQkFBcUIsR0FBRyxVQUNuQyxNQUFtQixFQUNuQixVQUFvQixFQUNwQixJQUFtQjtJQUVuQixJQUFNLEtBQUssR0FBYyx5QkFBVyxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRTNDLFVBQVUsQ0FBQyxPQUFPLENBQUMsVUFBQyxTQUFTO1FBQzNCLEtBQUssQ0FBQyxTQUFTLENBQUMsU0FBUyxDQUFDLENBQUM7SUFDN0IsQ0FBQyxDQUFDLENBQUM7SUFFSCxNQUFNLENBQUMsT0FBTyxDQUFDLFVBQUMsR0FBa0IsRUFBRSxRQUFnQjtRQUNsRCxHQUFHLENBQUMsT0FBTyxDQUFDLFVBQUMsR0FBVyxFQUFFLFFBQWdCO1lBQ3hDLElBQU0sV0FBVyxHQUFHLE1BQU0sQ0FBQyxRQUFRLENBQUMsQ0FBQyxRQUFRLENBQUMsQ0FBQztZQUMvQyxJQUFNLFdBQVcsR0FBRyxNQUFNLENBQUMsUUFBUSxDQUFDLENBQUMsUUFBUSxDQUFDLENBQUM7WUFFL0MsSUFBSSxJQUFJLEtBQUssNkJBQWEsQ0FBQyxVQUFVLEVBQUU7Z0JBQ3JDLElBQ0UsV0FBVyxLQUFLLDZCQUFpQjtvQkFDakMsV0FBVyxLQUFLLDZCQUFpQixFQUNqQztvQkFDQSxLQUFLLENBQUMsT0FBTyxDQUFDLFVBQVUsQ0FBQyxRQUFRLENBQUMsRUFBRSxVQUFVLENBQUMsUUFBUSxDQUFDLENBQUMsQ0FBQztpQkFDM0Q7YUFDRjtZQUVELElBQUksSUFBSSxLQUFLLDZCQUFhLENBQUMsUUFBUSxFQUFFO2dCQUNuQyxJQUFJLFdBQVcsS0FBSyw2QkFBaUIsRUFBRTtvQkFDckMsS0FBSyxDQUFDLE9BQU8sQ0FBQyxVQUFVLENBQUMsUUFBUSxDQUFDLEVBQUUsVUFBVSxDQUFDLFFBQVEsQ0FBQyxDQUFDLENBQUM7aUJBQzNEO2dCQUNELElBQUksV0FBVyxLQUFLLDZCQUFpQixFQUFFO29CQUNyQyxLQUFLLENBQUMsT0FBTyxDQUFDLFVBQVUsQ0FBQyxRQUFRLENBQUMsRUFBRSxVQUFVLENBQUMsUUFBUSxDQUFDLENBQUMsQ0FBQztpQkFDM0Q7YUFDRjtRQUNILENBQUMsQ0FBQyxDQUFDO0lBQ0wsQ0FBQyxDQUFDLENBQUM7SUFFSCxPQUFPLEtBQUssQ0FBQztBQUNmLENBQUMsQ0FBQyJ9

package/lib/helpers/createLinkedList.d.ts

@@ -1,3 +0,0 @@
-import { EnumLinkedListType } from "../types/EnumLinkedListType";
-import ILinkedList from "../types/ILinkedList";
-export declare const createLinkedList: <T>(type: EnumLinkedListType, capacity?: number | undefined) => ILinkedList<T>;

package/lib/helpers/createLinkedList.js

@@ -1,21 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createLinkedList = void 0;
-var EnumLinkedListType_1 = require("../types/EnumLinkedListType");
-var DoubleLinkedList_1 = require("../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList");
-var SingleLinkedList_1 = require("../data-structures/LinkedList/SingleLinkedList/SingleLinkedList");
-exports.createLinkedList = function (type, capacity) {
-    var linkedList;
-    switch (type) {
-        case EnumLinkedListType_1.EnumLinkedListType.DOUBLE:
-            linkedList = new DoubleLinkedList_1.default(capacity);
-            break;
-        case EnumLinkedListType_1.EnumLinkedListType.SINGLE:
-            linkedList = new SingleLinkedList_1.default(capacity);
-            break;
-        default:
-            throw new Error("Invalid list type");
-    }
-    return linkedList;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlTGlua2VkTGlzdC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy9oZWxwZXJzL2NyZWF0ZUxpbmtlZExpc3QudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEsa0VBQWlFO0FBQ2pFLG9HQUErRjtBQUMvRixvR0FBK0Y7QUFHbEYsUUFBQSxnQkFBZ0IsR0FBRyxVQUM5QixJQUF3QixFQUN4QixRQUFpQjtJQUVqQixJQUFJLFVBQTBCLENBQUM7SUFFL0IsUUFBUSxJQUFJLEVBQUU7UUFDWixLQUFLLHVDQUFrQixDQUFDLE1BQU07WUFDNUIsVUFBVSxHQUFHLElBQUksMEJBQWdCLENBQUMsUUFBUSxDQUFDLENBQUM7WUFDNUMsTUFBTTtRQUNSLEtBQUssdUNBQWtCLENBQUMsTUFBTTtZQUM1QixVQUFVLEdBQUcsSUFBSSwwQkFBZ0IsQ0FBQyxRQUFRLENBQUMsQ0FBQztZQUM1QyxNQUFNO1FBQ1I7WUFDRSxNQUFNLElBQUksS0FBSyxDQUFDLG1CQUFtQixDQUFDLENBQUM7S0FDeEM7SUFFRCxPQUFPLFVBQVUsQ0FBQztBQUNwQixDQUFDLENBQUMifQ==

package/lib/types/ArrayMatrix.d.ts

@@ -1 +0,0 @@
-export declare type ArrayMatrix = Array<Array<number>>;

package/lib/types/ArrayMatrix.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiQXJyYXlNYXRyaXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvdHlwZXMvQXJyYXlNYXRyaXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IiJ9