@raikuxq/alg-ds 1.2.5 → 2.0.0

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

@@ -1,18 +0,0 @@
-import IIterator from "../../../types/IIterator";
-import IIterable from "../../../types/IIterable";
-import SingleLinkedList from "./SingleLinkedList";
-/**
- * @inheritDoc
- */
-export default class IterableSingleLinkedList<T> extends SingleLinkedList<T> implements IIterable<T> {
-    /**
-     * @inheritDoc
-     */
-    constructor(capacity?: number);
-    /**
-     * List iterator
-     * @throws {CollectionIsEmptyException} when list is empty
-     * @throws {IndexOutOfBoundsException} when given index is out of range
-     */
-    iterator(fromIndex?: number): IIterator<T>;
-}

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

@@ -1,68 +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 IsNotFoundException_1 = require("../../../exceptions/IsNotFoundException");
-var SingleLinkedList_1 = require("./SingleLinkedList");
-/**
- * @inheritDoc
- */
-var IterableSingleLinkedList = /** @class */ (function (_super) {
-    __extends(IterableSingleLinkedList, _super);
-    /**
-     * @inheritDoc
-     */
-    function IterableSingleLinkedList(capacity) {
-        return _super.call(this, capacity) || this;
-    }
-    /**
-     * List iterator
-     * @throws {CollectionIsEmptyException} when list is empty
-     * @throws {IndexOutOfBoundsException} when given index is out of range
-     */
-    IterableSingleLinkedList.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 {IsNotFoundException} when next element does not exist
-             */
-            next: function () {
-                if (!iterator.hasNext()) {
-                    throw new IsNotFoundException_1.default("Next element does not exist");
-                }
-                activeNode = activeNode.next;
-                return activeNode.data;
-            },
-        };
-        return iterator;
-    };
-    return IterableSingleLinkedList;
-}(SingleLinkedList_1.default));
-exports.default = IterableSingleLinkedList;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSXRlcmFibGVTaW5nbGVMaW5rZWRMaXN0LmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vLi4vc3JjL2FwcC9kYXRhLXN0cnVjdHVyZXMvTGlua2VkTGlzdC9TaW5nbGVMaW5rZWRMaXN0L0l0ZXJhYmxlU2luZ2xlTGlua2VkTGlzdC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7Ozs7Ozs7Ozs7QUFHQSwrRUFBMEU7QUFDMUUsdURBQWtEO0FBRWxEOztHQUVHO0FBQ0g7SUFDVSw0Q0FBbUI7SUFFM0I7O09BRUc7SUFDSCxrQ0FBbUIsUUFBaUI7ZUFDbEMsa0JBQU0sUUFBUSxDQUFDO0lBQ2pCLENBQUM7SUFFRDs7OztPQUlHO0lBQ0ksMkNBQVEsR0FBZixVQUFnQixTQUFhO1FBQWIsMEJBQUEsRUFBQSxhQUFhO1FBQzNCLElBQU0sSUFBSSxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDeEIsSUFBSSxVQUFVLEdBQXdCLElBQUksQ0FBQyxjQUFjLENBQUMsU0FBUyxDQUFDLENBQUM7UUFFckUsSUFBTSxRQUFRLEdBQWlCO1lBQzdCOztlQUVHO1lBQ0gsT0FBTyxFQUFFO2dCQUNQLE9BQU8sVUFBVSxDQUFDLElBQUksQ0FBQztZQUN6QixDQUFDO1lBQ0Q7O2VBRUc7WUFDSCxPQUFPLEVBQVA7Z0JBQ0UsT0FBTyxPQUFPLENBQUMsVUFBVSxDQUFDLElBQUksQ0FBQyxJQUFJLFVBQVUsS0FBSyxJQUFJLENBQUM7WUFDekQsQ0FBQztZQUNEOzs7ZUFHRztZQUNILElBQUksRUFBRTtnQkFDSixJQUFJLENBQUMsUUFBUSxDQUFDLE9BQU8sRUFBRSxFQUFFO29CQUN2QixNQUFNLElBQUksNkJBQW1CLENBQUMsNkJBQTZCLENBQUMsQ0FBQztpQkFDOUQ7Z0JBQ0QsVUFBVSxHQUFHLFVBQVUsQ0FBQyxJQUFLLENBQUM7Z0JBQzlCLE9BQU8sVUFBVSxDQUFDLElBQUksQ0FBQztZQUN6QixDQUFDO1NBQ0YsQ0FBQztRQUVGLE9BQU8sUUFBUSxDQUFDO0lBQ2xCLENBQUM7SUFDSCwrQkFBQztBQUFELENBQUMsQUEvQ0QsQ0FDVSwwQkFBZ0IsR0E4Q3pCIn0=

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

@@ -1,46 +0,0 @@
-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> {
-    /**
-     * 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;
-}

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

@@ -1,103 +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 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;
-        }
-    };
-    return SingleLinkedList;
-}(AbstractLinkedList_1.default));
-exports.default = SingleLinkedList;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU2luZ2xlTGlua2VkTGlzdC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvZGF0YS1zdHJ1Y3R1cmVzL0xpbmtlZExpc3QvU2luZ2xlTGlua2VkTGlzdC9TaW5nbGVMaW5rZWRMaXN0LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7Ozs7Ozs7OztBQUFBLCtFQUEwRTtBQUMxRSx1REFBa0Q7QUFFbEQ7Ozs7R0FJRztBQUNIO0lBQWlELG9DQUFxQjtJQU9wRTs7T0FFRztJQUNILDBCQUFtQixRQUFpQjtRQUFwQyxZQUNFLGtCQUFNLFFBQVEsQ0FBQyxTQUdoQjtRQUZDLEtBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDO1FBQ2xCLEtBQUksQ0FBQyxLQUFLLEdBQUcsSUFBSSxDQUFDOztJQUNwQixDQUFDO0lBRUQ7O09BRUc7SUFDSyxzQ0FBVyxHQUFuQixVQUNFLElBQWdDO1FBRWhDLElBQUksV0FBVyxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDN0IsT0FBTyxDQUFBLFdBQVcsYUFBWCxXQUFXLHVCQUFYLFdBQVcsQ0FBRSxJQUFJLE1BQUssSUFBSSxFQUFFO1lBQ2pDLFdBQVcsR0FBRyxDQUFBLFdBQVcsYUFBWCxXQUFXLHVCQUFYLFdBQVcsQ0FBRSxJQUFJLEtBQUksSUFBSSxDQUFDO1NBQ3pDO1FBQ0QsT0FBTyxXQUFXLENBQUM7SUFDckIsQ0FBQztJQUVEOztPQUVHO0lBQ08scUNBQVUsR0FBcEIsVUFBcUIsS0FBUTtRQUMzQixPQUFPLElBQUksMEJBQWdCLENBQUksS0FBSyxDQUFDLENBQUM7SUFDeEMsQ0FBQztJQUVEOztPQUVHO0lBQ08sd0RBQTZCLEdBQXZDLFVBQ0UsVUFBK0IsRUFDL0IsUUFBNkIsRUFDN0IsU0FBOEI7UUFFOUIsVUFBVSxDQUFDLElBQUksR0FBRyxTQUFTLENBQUM7UUFFNUIsSUFBSSxRQUFRLEVBQUU7WUFDWixRQUFRLENBQUMsSUFBSSxHQUFHLFVBQVUsQ0FBQztTQUM1QjtJQUNILENBQUM7SUFFRDs7T0FFRztJQUNPLHlDQUFjLEdBQXhCLFVBQXlCLElBQXlCO1FBQ2hELElBQUksQ0FBQyxXQUFXLENBQUMsSUFBSSxDQUFFLENBQUMsSUFBSSxHQUFHLElBQUksQ0FBQyxJQUFJLENBQUM7UUFDekMsSUFBSSxDQUFDLElBQUksR0FBRyxJQUFJLENBQUM7SUFDbkIsQ0FBQztJQUVEOztPQUVHO0lBQ08sa0NBQU8sR0FBakI7UUFDRSxJQUFJLENBQUMsS0FBSyxHQUFHLElBQUksQ0FBQyxXQUFXLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO0lBQzVDLENBQUM7SUFFRDs7T0FFRztJQUNPLG9DQUFTLEdBQW5COztRQUNFLElBQUksQ0FBQyxLQUFLLEdBQUcsT0FBQSxJQUFJLENBQUMsS0FBSywwQ0FBRSxJQUFJLEtBQUksSUFBSSxDQUFDO0lBQ3hDLENBQUM7SUFFRDs7T0FFRztJQUNJLGtDQUFPLEdBQWQ7UUFDRSxJQUFJLFdBQVcsR0FBK0IsSUFBSSxDQUFDLEtBQUssQ0FBQztRQUN6RCxJQUFJLFFBQVEsR0FBK0IsSUFBSSxDQUFDLEtBQUssQ0FBQztRQUN0RCxJQUFJLEtBQUssR0FBRyxDQUFDLENBQUM7UUFFZCxPQUFPLEtBQUssR0FBRyxJQUFJLENBQUMsT0FBTyxFQUFFO1lBQzNCLElBQU0sSUFBSSxHQUFHLENBQUEsV0FBVyxhQUFYLFdBQVcsdUJBQVgsV0FBVyxDQUFFLElBQUksS0FBSSxJQUFJLENBQUM7WUFFdkMsSUFBSSxXQUFXLEVBQUU7Z0JBQ2YsV0FBVyxDQUFDLElBQUksR0FBRyxRQUFRLENBQUM7YUFDN0I7WUFFRCxLQUFLLEVBQUUsQ0FBQztZQUNSLFFBQVEsR0FBRyxXQUFXLENBQUM7WUFDdkIsV0FBVyxHQUFHLElBQUksQ0FBQztTQUNwQjtRQUVELElBQUksV0FBVyxFQUFFO1lBQ2YsSUFBSSxDQUFDLEtBQUssR0FBRyxXQUFXLENBQUM7WUFDekIsSUFBSSxDQUFDLEtBQUssR0FBRyxXQUFXLENBQUMsSUFBSSxDQUFDO1NBQy9CO0lBQ0gsQ0FBQztJQUNILHVCQUFDO0FBQUQsQ0FBQyxBQWxHRCxDQUFpRCw0QkFBa0IsR0FrR2xFIn0=

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

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

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

@@ -1,29 +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 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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiU2luZ2xlTGlua2VkTm9kZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvZGF0YS1zdHJ1Y3R1cmVzL0xpbmtlZExpc3QvU2luZ2xlTGlua2VkTGlzdC9TaW5nbGVMaW5rZWROb2RlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7Ozs7Ozs7Ozs7Ozs7OztBQUFBLCtFQUEwRTtBQUUxRTtJQUFpRCxvQ0FBcUI7SUFDcEU7O09BRUc7SUFDSCwwQkFBbUIsSUFBTyxFQUFFLElBQXVDO1FBQXZDLHFCQUFBLEVBQUEsV0FBdUM7ZUFDakUsa0JBQU0sSUFBSSxFQUFFLElBQUksQ0FBQztJQUNuQixDQUFDO0lBQ0gsdUJBQUM7QUFBRCxDQUFDLEFBUEQsQ0FBaUQsNEJBQWtCLEdBT2xFIn0=

package/lib/app/data-structures/LinkedList/_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, isIterable?: boolean, capacity?: number | undefined) => ILinkedList<T>;

package/lib/app/data-structures/LinkedList/_helpers/createLinkedList.js

@@ -1,34 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.createLinkedList = void 0;
-var EnumLinkedListType_1 = require("../../../types/EnumLinkedListType");
-var DoubleLinkedList_1 = require("../DoubleLinkedList/DoubleLinkedList");
-var SingleLinkedList_1 = require("../SingleLinkedList/SingleLinkedList");
-var IterableDoubleLinkedList_1 = require("../DoubleLinkedList/IterableDoubleLinkedList");
-var IterableSingleLinkedList_1 = require("../SingleLinkedList/IterableSingleLinkedList");
-exports.createLinkedList = function (type, isIterable, capacity) {
-    if (isIterable === void 0) { isIterable = false; }
-    var linkedList;
-    if (isIterable) {
-        switch (type) {
-            case EnumLinkedListType_1.EnumLinkedListType.DOUBLE:
-                linkedList = new IterableDoubleLinkedList_1.default(capacity);
-                break;
-            case EnumLinkedListType_1.EnumLinkedListType.SINGLE:
-                linkedList = new IterableSingleLinkedList_1.default(capacity);
-                break;
-        }
-    }
-    else {
-        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;
-        }
-    }
-    return linkedList;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlTGlua2VkTGlzdC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvZGF0YS1zdHJ1Y3R1cmVzL0xpbmtlZExpc3QvX2hlbHBlcnMvY3JlYXRlTGlua2VkTGlzdC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFBQSx3RUFBdUU7QUFDdkUseUVBQW9FO0FBQ3BFLHlFQUFvRTtBQUNwRSx5RkFBb0Y7QUFDcEYseUZBQW9GO0FBR3ZFLFFBQUEsZ0JBQWdCLEdBQUcsVUFDOUIsSUFBd0IsRUFDeEIsVUFBa0IsRUFDbEIsUUFBaUI7SUFEakIsMkJBQUEsRUFBQSxrQkFBa0I7SUFHbEIsSUFBSSxVQUEwQixDQUFDO0lBRS9CLElBQUksVUFBVSxFQUFFO1FBQ2QsUUFBUSxJQUFJLEVBQUU7WUFDWixLQUFLLHVDQUFrQixDQUFDLE1BQU07Z0JBQzVCLFVBQVUsR0FBRyxJQUFJLGtDQUF3QixDQUFDLFFBQVEsQ0FBQyxDQUFDO2dCQUNwRCxNQUFNO1lBQ1IsS0FBSyx1Q0FBa0IsQ0FBQyxNQUFNO2dCQUM1QixVQUFVLEdBQUcsSUFBSSxrQ0FBd0IsQ0FBQyxRQUFRLENBQUMsQ0FBQztnQkFDcEQsTUFBTTtTQUNUO0tBQ0Y7U0FBTTtRQUNMLFFBQVEsSUFBSSxFQUFFO1lBQ1osS0FBSyx1Q0FBa0IsQ0FBQyxNQUFNO2dCQUM1QixVQUFVLEdBQUcsSUFBSSwwQkFBZ0IsQ0FBQyxRQUFRLENBQUMsQ0FBQztnQkFDNUMsTUFBTTtZQUNSLEtBQUssdUNBQWtCLENBQUMsTUFBTTtnQkFDNUIsVUFBVSxHQUFHLElBQUksMEJBQWdCLENBQUMsUUFBUSxDQUFDLENBQUM7Z0JBQzVDLE1BQU07U0FDVDtLQUNGO0lBRUQsT0FBTyxVQUFVLENBQUM7QUFDcEIsQ0FBQyxDQUFDIn0=

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

@@ -1,86 +0,0 @@
-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
-     * @throws {ValueOutOfRangeException} when given capacity is not valid
-     */
-    constructor(capacity: number);
-    /**
-     * Push into end
-     */
-    push(value: T): void;
-    /**
-     * Push into start
-     */
-    unshift(value: T): void;
-    /**
-     * Delete node from array's end
-     * @throws {CollectionIsEmptyException} when array is empty
-     */
-    pop(): T;
-    /**
-     * Delete node from array's start
-     * @throws {CollectionIsEmptyException} when array is empty
-     */
-    shift(): T;
-    /**
-     * Get head element data
-     */
-    peek(): T;
-    /**
-     * Get tail element data
-     */
-    peekFromStart(): T;
-    /**
-     * Get array element by index from start
-     */
-    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/app/data-structures/LoopedArray/LoopedArray.js

@@ -1,165 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var ValueOutOfRangeException_1 = require("../../exceptions/ValueOutOfRangeException");
-var CollectionIsEmptyException_1 = require("../../exceptions/CollectionIsEmptyException");
-/**
- * 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
-     * @throws {ValueOutOfRangeException} when given capacity is not valid
-     */
-    function LoopedArray(capacity) {
-        this._realLength = 0;
-        if (capacity <= 0) {
-            throw new ValueOutOfRangeException_1.default("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
-     * @throws {CollectionIsEmptyException} when array is empty
-     */
-    LoopedArray.prototype.pop = function () {
-        if (this.isEmpty()) {
-            throw new CollectionIsEmptyException_1.default("cannot delete because array is empty");
-        }
-        this._realLength--;
-        var deletedItem = this._array.pop();
-        return deletedItem;
-    };
-    /**
-     * Delete node from array's start
-     * @throws {CollectionIsEmptyException} when array is empty
-     */
-    LoopedArray.prototype.shift = function () {
-        if (this.isEmpty()) {
-            throw new CollectionIsEmptyException_1.default("cannot delete because array is empty");
-        }
-        this._realLength--;
-        var deletedItem = this._array.shift();
-        return deletedItem;
-    };
-    /**
-     * Get head element data
-     */
-    LoopedArray.prototype.peek = function () {
-        return this._array[this._array.length - 1];
-    };
-    /**
-     * Get tail element data
-     */
-    LoopedArray.prototype.peekFromStart = function () {
-        return this._array[0];
-    };
-    /**
-     * Get array element by index from start
-     */
-    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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiTG9vcGVkQXJyYXkuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi9zcmMvYXBwL2RhdGEtc3RydWN0dXJlcy9Mb29wZWRBcnJheS9Mb29wZWRBcnJheS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOztBQUNBLHNGQUFpRjtBQUVqRiwwRkFBcUY7QUFFckY7Ozs7R0FJRztBQUNIO0lBS0U7OztPQUdHO0lBQ0gscUJBQVksUUFBZ0I7UUFQcEIsZ0JBQVcsR0FBRyxDQUFDLENBQUM7UUFRdEIsSUFBSSxRQUFRLElBQUksQ0FBQyxFQUFFO1lBQ2pCLE1BQU0sSUFBSSxrQ0FBd0IsQ0FBQyxnQ0FBZ0MsQ0FBQyxDQUFDO1NBQ3RFO1FBQ0QsSUFBSSxDQUFDLFNBQVMsR0FBRyxRQUFRLENBQUM7UUFDMUIsSUFBSSxDQUFDLE1BQU0sR0FBRyxJQUFJLEtBQUssQ0FBSSxDQUFDLENBQUMsQ0FBQztJQUNoQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSwwQkFBSSxHQUFYLFVBQVksS0FBUTtRQUNsQixJQUFJLElBQUksQ0FBQyxXQUFXLEdBQUcsSUFBSSxDQUFDLFNBQVMsS0FBSyxDQUFDLEVBQUU7WUFDM0MsSUFBSSxDQUFDLE1BQU0sR0FBRyxJQUFJLEtBQUssQ0FBSSxDQUFDLENBQUMsQ0FBQztTQUMvQjtRQUVELElBQUksQ0FBQyxXQUFXLEVBQUUsQ0FBQztRQUVuQixJQUFJLENBQUMsSUFBSSxDQUFDLE1BQU0sRUFBRSxFQUFFO1lBQ2xCLElBQUksQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxDQUFDO1NBQ3pCO2FBQU07WUFDTCxJQUFNLFdBQVcsR0FBRyxDQUFDLElBQUksQ0FBQyxXQUFXLEdBQUcsSUFBSSxDQUFDLFNBQVMsQ0FBQyxHQUFHLENBQUMsQ0FBQztZQUM1RCxJQUFJLENBQUMsTUFBTSxDQUFDLE1BQU0sQ0FBQyxXQUFXLEVBQUUsQ0FBQyxFQUFFLEtBQUssQ0FBQyxDQUFDO1NBQzNDO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksNkJBQU8sR0FBZCxVQUFlLEtBQVE7UUFDckIsSUFBSSxJQUFJLENBQUMsV0FBVyxHQUFHLElBQUksQ0FBQyxTQUFTLEtBQUssQ0FBQyxFQUFFO1lBQzNDLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxLQUFLLENBQUksQ0FBQyxDQUFDLENBQUM7U0FDL0I7UUFDRCxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7UUFFbkIsSUFBSSxDQUFDLElBQUksQ0FBQyxNQUFNLEVBQUUsRUFBRTtZQUNsQixJQUFJLENBQUMsTUFBTSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQztTQUM1QjthQUFNO1lBQ0wsSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLENBQUMsSUFBSSxDQUFDLFNBQVMsR0FBRyxDQUFDLENBQUMsQ0FBQztZQUN2QyxJQUFJLENBQUMsTUFBTSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQztTQUM1QjtJQUNILENBQUM7SUFFRDs7O09BR0c7SUFDSSx5QkFBRyxHQUFWO1FBQ0UsSUFBSSxJQUFJLENBQUMsT0FBTyxFQUFFLEVBQUU7WUFDbEIsTUFBTSxJQUFJLG9DQUEwQixDQUNsQyxzQ0FBc0MsQ0FDdkMsQ0FBQztTQUNIO1FBQ0QsSUFBSSxDQUFDLFdBQVcsRUFBRSxDQUFDO1FBQ25CLElBQU0sV0FBVyxHQUFHLElBQUksQ0FBQyxNQUFNLENBQUMsR0FBRyxFQUFFLENBQUM7UUFFdEMsT0FBTyxXQUFZLENBQUM7SUFDdEIsQ0FBQztJQUVEOzs7T0FHRztJQUNJLDJCQUFLLEdBQVo7UUFDRSxJQUFJLElBQUksQ0FBQyxPQUFPLEVBQUUsRUFBRTtZQUNsQixNQUFNLElBQUksb0NBQTBCLENBQ2xDLHNDQUFzQyxDQUN2QyxDQUFDO1NBQ0g7UUFDRCxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7UUFDbkIsSUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxLQUFLLEVBQUUsQ0FBQztRQUV4QyxPQUFPLFdBQVksQ0FBQztJQUN0QixDQUFDO0lBRUQ7O09BRUc7SUFDSSwwQkFBSSxHQUFYO1FBQ0UsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDO0lBQzdDLENBQUM7SUFFRDs7T0FFRztJQUNJLG1DQUFhLEdBQXBCO1FBQ0UsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQ3hCLENBQUM7SUFFRDs7T0FFRztJQUNILGlDQUFXLEdBQVgsVUFBWSxLQUFhO1FBQ3ZCLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQyxLQUFLLENBQUMsQ0FBQztJQUM1QixDQUFDO0lBRUQ7O09BRUc7SUFDSCxtQ0FBYSxHQUFiLFVBQWMsS0FBUSxFQUFFLFNBQWlCO1FBQ3ZDLElBQUksQ0FBQyxNQUFNLENBQUMsU0FBUyxDQUFDLEdBQUcsS0FBSyxDQUFDO0lBQ2pDLENBQUM7SUFFRDs7T0FFRztJQUNJLGdDQUFVLEdBQWpCO1FBQ0UsT0FBTyxJQUFJLENBQUMsTUFBTSxDQUFDO0lBQ3JCLENBQUM7SUFFRDs7T0FFRztJQUNJLHlCQUFHLEdBQVYsVUFBVyxJQUFPO1FBQ2hCLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQyxRQUFRLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDcEMsQ0FBQztJQUVEOztPQUVHO0lBQ0ksNkJBQU8sR0FBZDtRQUNFLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLEtBQUssQ0FBQyxDQUFDO0lBQ2xDLENBQUM7SUFFRDs7T0FFRztJQUNJLDRCQUFNLEdBQWI7UUFDRSxPQUFPLElBQUksQ0FBQyxNQUFNLENBQUMsTUFBTSxJQUFJLElBQUksQ0FBQyxTQUFTLENBQUM7SUFDOUMsQ0FBQztJQUVEOztPQUVHO0lBQ0ksNEJBQU0sR0FBYjtRQUNFLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQyxNQUFNLENBQUM7SUFDNUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksMkJBQUssR0FBWjtRQUNFLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxLQUFLLENBQUksQ0FBQyxDQUFDLENBQUM7SUFDaEMsQ0FBQztJQUVEOztPQUVHO0lBQ0gscUNBQWUsR0FBZixVQUFnQixTQUFpQjtRQUMvQixJQUFNLGNBQWMsR0FBRyxJQUFJLENBQUMsTUFBTSxDQUFDLFNBQVMsQ0FBQyxDQUFDO1FBQzlDLE9BQU8sSUFBSSxDQUFDLE1BQU0sQ0FBQyxTQUFTLENBQUMsQ0FBQztRQUM5QixPQUFPLGNBQWMsQ0FBQztJQUN4QixDQUFDO0lBRUQ7O1NBRUs7SUFDTCxtQ0FBYSxHQUFiLFVBQWMsUUFBa0I7UUFBaEMsaUJBSUM7UUFIQyxRQUFRLENBQUMsT0FBTyxDQUFDLFVBQUMsT0FBVTtZQUMxQixLQUFJLENBQUMsSUFBSSxDQUFDLE9BQU8sQ0FBQyxDQUFDO1FBQ3JCLENBQUMsQ0FBQyxDQUFDO0lBQ0wsQ0FBQztJQUVEOztPQUVHO0lBQ0gsNkJBQU8sR0FBUDtRQUNFLElBQUksQ0FBQyxNQUFNLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxPQUFPLEVBQUUsQ0FBQztJQUN0QyxDQUFDO0lBQ0gsa0JBQUM7QUFBRCxDQUFDLEFBbExELElBa0xDIn0=

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

@@ -1,50 +0,0 @@
-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 {CollectionIsEmptyException} when list is empty
-     */
-    peek(): T;
-    /**
-     * Add element to queue
-     * @throws {CollectionIsFullException} when list is full
-     */
-    push(item: T): void;
-    /**
-     * Delete first element in queue
-     * @throws {CollectionIsEmptyException} 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;
-}