@raikuxq/alg-ds 1.2.4 → 2.0.0

package/lib/app/data-structures/Graph/_helpers/createGraphFromMatrix.js

@@ -1,42 +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");
-var IllegalArgumentException_1 = require("../../../exceptions/base/IllegalArgumentException");
-var utils_1 = require("../../../utils");
-/**
- * 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) {
-    if (!utils_1.checkIsArrayMatrix(matrix)) {
-        throw new IllegalArgumentException_1.default("Given array is not a matrix");
-    }
-    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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiY3JlYXRlR3JhcGhGcm9tTWF0cml4LmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vLi4vc3JjL2FwcC9kYXRhLXN0cnVjdHVyZXMvR3JhcGgvX2hlbHBlcnMvY3JlYXRlR3JhcGhGcm9tTWF0cml4LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUNBLDhEQUE2RDtBQUU3RCw2Q0FBNEM7QUFDNUMsZ0RBQXVEO0FBQ3ZELDhGQUF5RjtBQUN6Rix3Q0FBb0Q7QUFFcEQ7O0dBRUc7QUFDVSxRQUFBLHFCQUFxQixHQUFHLFVBQ25DLE1BQXVCLEVBQ3ZCLFVBQW9CLEVBQ3BCLElBQW1CO0lBRW5CLElBQUksQ0FBQywwQkFBa0IsQ0FBQyxNQUFNLENBQUMsRUFBRTtRQUMvQixNQUFNLElBQUksa0NBQXdCLENBQUMsNkJBQTZCLENBQUMsQ0FBQztLQUNuRTtJQUVELElBQU0sS0FBSyxHQUFjLHlCQUFXLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDM0MsVUFBVSxDQUFDLE9BQU8sQ0FBQyxVQUFDLFNBQVM7UUFDM0IsS0FBSyxDQUFDLFNBQVMsQ0FBQyxTQUFTLENBQUMsQ0FBQztJQUM3QixDQUFDLENBQUMsQ0FBQztJQUVILE1BQU0sQ0FBQyxPQUFPLENBQUMsVUFBQyxHQUFrQixFQUFFLFFBQWdCO1FBQ2xELEdBQUcsQ0FBQyxPQUFPLENBQUMsVUFBQyxHQUFXLEVBQUUsUUFBZ0I7WUFDeEMsSUFBTSxXQUFXLEdBQUcsTUFBTSxDQUFDLFFBQVEsQ0FBQyxDQUFDLFFBQVEsQ0FBQyxDQUFDO1lBQy9DLElBQU0sV0FBVyxHQUFHLE1BQU0sQ0FBQyxRQUFRLENBQUMsQ0FBQyxRQUFRLENBQUMsQ0FBQztZQUUvQyxJQUFJLElBQUksS0FBSyw2QkFBYSxDQUFDLFVBQVUsRUFBRTtnQkFDckMsSUFDRSxXQUFXLEtBQUssNkJBQWlCO29CQUNqQyxXQUFXLEtBQUssNkJBQWlCLEVBQ2pDO29CQUNBLEtBQUssQ0FBQyxPQUFPLENBQUMsVUFBVSxDQUFDLFFBQVEsQ0FBQyxFQUFFLFVBQVUsQ0FBQyxRQUFRLENBQUMsQ0FBQyxDQUFDO2lCQUMzRDthQUNGO1lBRUQsSUFBSSxJQUFJLEtBQUssNkJBQWEsQ0FBQyxRQUFRLEVBQUU7Z0JBQ25DLElBQUksV0FBVyxLQUFLLDZCQUFpQixFQUFFO29CQUNyQyxLQUFLLENBQUMsT0FBTyxDQUFDLFVBQVUsQ0FBQyxRQUFRLENBQUMsRUFBRSxVQUFVLENBQUMsUUFBUSxDQUFDLENBQUMsQ0FBQztpQkFDM0Q7Z0JBQ0QsSUFBSSxXQUFXLEtBQUssNkJBQWlCLEVBQUU7b0JBQ3JDLEtBQUssQ0FBQyxPQUFPLENBQUMsVUFBVSxDQUFDLFFBQVEsQ0FBQyxFQUFFLFVBQVUsQ0FBQyxRQUFRLENBQUMsQ0FBQyxDQUFDO2lCQUMzRDthQUNGO1FBQ0gsQ0FBQyxDQUFDLENBQUM7SUFDTCxDQUFDLENBQUMsQ0FBQztJQUVILE9BQU8sS0FBSyxDQUFDO0FBQ2YsQ0FBQyxDQUFDIn0=

package/lib/app/data-structures/Graph/_helpers/generateRandomGraph.d.ts

@@ -1,4 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import { EnumGraphType } from "../../../types/EnumGraphType";
-import { EnumRandomGenerationFormat } from "../../../types/EnumRandomGenerationFormat";
-export declare const generateRandomGraph: (verticesCount: number, edgesCount: number, type?: EnumGraphType, format?: EnumRandomGenerationFormat) => IGraph<string>;

package/lib/app/data-structures/Graph/_helpers/generateRandomGraph.js

@@ -1,67 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.generateRandomGraph = void 0;
-var EnumGraphType_1 = require("../../../types/EnumGraphType");
-var createGraph_1 = require("./createGraph");
-var utils_1 = require("../../../utils");
-var EnumRandomGenerationFormat_1 = require("../../../types/EnumRandomGenerationFormat");
-var ValueOutOfRangeException_1 = require("../../../exceptions/ValueOutOfRangeException");
-var getRandomVertex = function () {
-    return "_" + Math.random().toString(36).substr(2, 9);
-};
-var getPossibleEdgesCount = function (type, verticesCount) {
-    var possibleEdgesCount = verticesCount * (verticesCount - 1);
-    switch (type) {
-        case EnumGraphType_1.EnumGraphType.DIRECTED: {
-            break;
-        }
-        case EnumGraphType_1.EnumGraphType.UNDIRECTED: {
-            possibleEdgesCount = Math.floor(possibleEdgesCount / 2);
-            break;
-        }
-    }
-    return possibleEdgesCount;
-};
-var fillGraphRandomly = function (graph, format, verticesCount) {
-    switch (format) {
-        case EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.HASH: {
-            for (var i = 0; i < verticesCount; i++) {
-                graph.addVertex(getRandomVertex());
-            }
-            break;
-        }
-        case EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.NUMBERS: {
-            for (var i = 0; i < verticesCount; i++) {
-                graph.addVertex((i + 1).toString());
-            }
-            break;
-        }
-    }
-};
-exports.generateRandomGraph = function (verticesCount, edgesCount, type, format) {
-    if (type === void 0) { type = EnumGraphType_1.EnumGraphType.UNDIRECTED; }
-    if (format === void 0) { format = EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.NUMBERS; }
-    var graph = createGraph_1.createGraph(type);
-    var possibleEdgesCount = getPossibleEdgesCount(type, verticesCount);
-    if (edgesCount <= 0 || edgesCount > possibleEdgesCount) {
-        throw new ValueOutOfRangeException_1.default("Edges count must be in range between 0 and " + possibleEdgesCount);
-    }
-    fillGraphRandomly(graph, format, verticesCount);
-    var addedVertices = graph.vertices();
-    var addedEdgesCount = 0;
-    while (addedEdgesCount < edgesCount) {
-        var randomizeIndex = function () {
-            return utils_1.randomizeNumberInRange(0, addedVertices.length);
-        };
-        var randomVertexFrom = addedVertices[randomizeIndex()];
-        var randomVertexTo = addedVertices[randomizeIndex()];
-        var isEdgeAlreadyExists = graph.hasEdge(randomVertexFrom, randomVertexTo);
-        var isTheSameVertex = randomVertexFrom === randomVertexTo;
-        if (!isTheSameVertex && !isEdgeAlreadyExists) {
-            graph.addEdge(randomVertexFrom, randomVertexTo);
-            addedEdgesCount++;
-        }
-    }
-    return graph;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZ2VuZXJhdGVSYW5kb21HcmFwaC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvZGF0YS1zdHJ1Y3R1cmVzL0dyYXBoL19oZWxwZXJzL2dlbmVyYXRlUmFuZG9tR3JhcGgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQ0EsOERBQTZEO0FBQzdELDZDQUE0QztBQUM1Qyx3Q0FBd0Q7QUFDeEQsd0ZBQXVGO0FBQ3ZGLHlGQUFvRjtBQUVwRixJQUFNLGVBQWUsR0FBRztJQUN0QixPQUFPLEdBQUcsR0FBRyxJQUFJLENBQUMsTUFBTSxFQUFFLENBQUMsUUFBUSxDQUFDLEVBQUUsQ0FBQyxDQUFDLE1BQU0sQ0FBQyxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBQUM7QUFDdkQsQ0FBQyxDQUFDO0FBRUYsSUFBTSxxQkFBcUIsR0FBRyxVQUM1QixJQUFtQixFQUNuQixhQUFxQjtJQUVyQixJQUFJLGtCQUFrQixHQUFHLGFBQWEsR0FBRyxDQUFDLGFBQWEsR0FBRyxDQUFDLENBQUMsQ0FBQztJQUU3RCxRQUFRLElBQUksRUFBRTtRQUNaLEtBQUssNkJBQWEsQ0FBQyxRQUFRLENBQUMsQ0FBQztZQUMzQixNQUFNO1NBQ1A7UUFDRCxLQUFLLDZCQUFhLENBQUMsVUFBVSxDQUFDLENBQUM7WUFDN0Isa0JBQWtCLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQyxrQkFBa0IsR0FBRyxDQUFDLENBQUMsQ0FBQztZQUN4RCxNQUFNO1NBQ1A7S0FDRjtJQUVELE9BQU8sa0JBQWtCLENBQUM7QUFDNUIsQ0FBQyxDQUFDO0FBRUYsSUFBTSxpQkFBaUIsR0FBRyxVQUN4QixLQUFxQixFQUNyQixNQUFrQyxFQUNsQyxhQUFxQjtJQUVyQixRQUFRLE1BQU0sRUFBRTtRQUNkLEtBQUssdURBQTBCLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDcEMsS0FBSyxJQUFJLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBQyxHQUFHLGFBQWEsRUFBRSxDQUFDLEVBQUUsRUFBRTtnQkFDdEMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxlQUFlLEVBQUUsQ0FBQyxDQUFDO2FBQ3BDO1lBQ0QsTUFBTTtTQUNQO1FBQ0QsS0FBSyx1REFBMEIsQ0FBQyxPQUFPLENBQUMsQ0FBQztZQUN2QyxLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsYUFBYSxFQUFFLENBQUMsRUFBRSxFQUFFO2dCQUN0QyxLQUFLLENBQUMsU0FBUyxDQUFDLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxDQUFDLFFBQVEsRUFBRSxDQUFDLENBQUM7YUFDckM7WUFDRCxNQUFNO1NBQ1A7S0FDRjtBQUNILENBQUMsQ0FBQztBQUVXLFFBQUEsbUJBQW1CLEdBQUcsVUFDakMsYUFBcUIsRUFDckIsVUFBa0IsRUFDbEIsSUFBOEMsRUFDOUMsTUFBdUU7SUFEdkUscUJBQUEsRUFBQSxPQUFzQiw2QkFBYSxDQUFDLFVBQVU7SUFDOUMsdUJBQUEsRUFBQSxTQUFxQyx1REFBMEIsQ0FBQyxPQUFPO0lBRXZFLElBQU0sS0FBSyxHQUFHLHlCQUFXLENBQVMsSUFBSSxDQUFDLENBQUM7SUFDeEMsSUFBTSxrQkFBa0IsR0FBRyxxQkFBcUIsQ0FBQyxJQUFJLEVBQUUsYUFBYSxDQUFDLENBQUM7SUFFdEUsSUFBSSxVQUFVLElBQUksQ0FBQyxJQUFJLFVBQVUsR0FBRyxrQkFBa0IsRUFBRTtRQUN0RCxNQUFNLElBQUksa0NBQXdCLENBQ2hDLGdEQUE4QyxrQkFBb0IsQ0FDbkUsQ0FBQztLQUNIO0lBRUQsaUJBQWlCLENBQUMsS0FBSyxFQUFFLE1BQU0sRUFBRSxhQUFhLENBQUMsQ0FBQztJQUNoRCxJQUFNLGFBQWEsR0FBRyxLQUFLLENBQUMsUUFBUSxFQUFFLENBQUM7SUFDdkMsSUFBSSxlQUFlLEdBQUcsQ0FBQyxDQUFDO0lBRXhCLE9BQU8sZUFBZSxHQUFHLFVBQVUsRUFBRTtRQUNuQyxJQUFNLGNBQWMsR0FBRztZQUNyQixPQUFPLDhCQUFzQixDQUFDLENBQUMsRUFBRSxhQUFhLENBQUMsTUFBTSxDQUFDLENBQUM7UUFDekQsQ0FBQyxDQUFDO1FBQ0YsSUFBTSxnQkFBZ0IsR0FBRyxhQUFhLENBQUMsY0FBYyxFQUFFLENBQUMsQ0FBQztRQUN6RCxJQUFNLGNBQWMsR0FBRyxhQUFhLENBQUMsY0FBYyxFQUFFLENBQUMsQ0FBQztRQUV2RCxJQUFNLG1CQUFtQixHQUFHLEtBQUssQ0FBQyxPQUFPLENBQUMsZ0JBQWdCLEVBQUUsY0FBYyxDQUFDLENBQUM7UUFDNUUsSUFBTSxlQUFlLEdBQUcsZ0JBQWdCLEtBQUssY0FBYyxDQUFDO1FBRTVELElBQUksQ0FBQyxlQUFlLElBQUksQ0FBQyxtQkFBbUIsRUFBRTtZQUM1QyxLQUFLLENBQUMsT0FBTyxDQUFDLGdCQUFnQixFQUFFLGNBQWMsQ0FBQyxDQUFDO1lBQ2hELGVBQWUsRUFBRSxDQUFDO1NBQ25CO0tBQ0Y7SUFFRCxPQUFPLEtBQUssQ0FBQztBQUNmLENBQUMsQ0FBQyJ9

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

@@ -1,73 +0,0 @@
-import IKeyValueStorage from "../../types/IKeyValueStorage";
-/**
- * Implementation of open addressing hash table using quadratic probing
- */
-export default class HashTable<T> implements IKeyValueStorage<T> {
-    /**
-     Constants
-     */
-    private static DEFAULT_MAX_CAPACITY;
-    private static MAX_LOAD_FACTOR;
-    /**
-     * State
-     */
-    private storage;
-    private maxCapacity;
-    private storageCapacity;
-    /**
-     * Given init capacity size will be used
-     * @throws {ValueOutOfRangeException} when initial capacity value is not larger than 0
-     */
-    constructor(initialCapacity?: number);
-    /**
-     * Main-hash function
-     */
-    private hashFn;
-    /**
-     * Helper-hash function
-     */
-    private innerHashFn;
-    /**
-     * Max capacity will be increased and storage will be overwritten
-     */
-    private resizeStorage;
-    /**
-     * Will find node instance by its key
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    private findNode;
-    /**
-     * Will create new node instance and set in to storage by index
-     */
-    private addNode;
-    /**
-     * Will create new node instance and set in to storage by index
-     */
-    private updateNode;
-    /**
-     * Will insert item to hash table
-     */
-    set(key: string, data: T): void;
-    /**
-     * Will update item property isDeleted to false
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    delete(key: string): void;
-    /**
-     * Will find item in hash table
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    get(key: string): T;
-    /**
-     * Check if node with given key exists
-     */
-    has(key: string): boolean;
-    /**
-     * Added elements count
-     */
-    length(): number;
-    /**
-     * Will overwrite storage with array of null elements
-     */
-    clear(): void;
-}

package/lib/app/data-structures/HashTable/HashTable.js

@@ -1,171 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var HashTableNode_1 = require("./HashTableNode");
-var ValueOutOfRangeException_1 = require("../../exceptions/ValueOutOfRangeException");
-var IsNotFoundException_1 = require("../../exceptions/IsNotFoundException");
-/**
- * Implementation of open addressing hash table using quadratic probing
- */
-var HashTable = /** @class */ (function () {
-    /**
-     * Given init capacity size will be used
-     * @throws {ValueOutOfRangeException} when initial capacity value is not larger than 0
-     */
-    function HashTable(initialCapacity) {
-        if (initialCapacity === void 0) { initialCapacity = HashTable.DEFAULT_MAX_CAPACITY; }
-        this.storageCapacity = 0;
-        if (initialCapacity <= 0) {
-            throw new ValueOutOfRangeException_1.default("Size must be larger than 0");
-        }
-        this.maxCapacity = initialCapacity;
-        this.storage = new Array(this.maxCapacity).fill(null);
-    }
-    /**
-     * Main-hash function
-     */
-    HashTable.prototype.hashFn = function (key, number) {
-        return ((this.innerHashFn(key) + 127 * number + 365 * number * number) %
-            this.maxCapacity);
-    };
-    /**
-     * Helper-hash function
-     */
-    HashTable.prototype.innerHashFn = function (key) {
-        var length = key.length;
-        if (length === 0) {
-            return 0;
-        }
-        var substring = key.substring(0, length - 1);
-        var symbol = key.charCodeAt(length - 1);
-        return (127 * this.innerHashFn(substring) + symbol) % this.maxCapacity;
-    };
-    /**
-     * Max capacity will be increased and storage will be overwritten
-     */
-    HashTable.prototype.resizeStorage = function () {
-        this.maxCapacity *= 2;
-        var newArray = new Array(this.maxCapacity).fill(null);
-        for (var i = 0; i < this.storage.length; i++) {
-            var element = this.storage[i];
-            if (element != null) {
-                for (var j = 0; j < this.maxCapacity; j++) {
-                    var newIndex = this.hashFn(element.key, j);
-                    if (newArray[newIndex] == null) {
-                        newArray[newIndex] = element;
-                        break;
-                    }
-                }
-            }
-        }
-        return newArray;
-    };
-    /**
-     * Will find node instance by its key
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    HashTable.prototype.findNode = function (key) {
-        for (var i = 0; i < this.maxCapacity; i++) {
-            var index = this.hashFn(key, i);
-            var node = this.storage[index];
-            if ((node === null || node === void 0 ? void 0 : node.key) === key) {
-                if (node === null || node === void 0 ? void 0 : node.isDeleted) {
-                    break;
-                }
-                return node;
-            }
-        }
-        throw new IsNotFoundException_1.default("Element does not exist");
-    };
-    /**
-     * Will create new node instance and set in to storage by index
-     */
-    HashTable.prototype.addNode = function (key, data, index) {
-        this.storage[index] = new HashTableNode_1.default(key, data);
-        this.storageCapacity++;
-        var loadFactor = this.storageCapacity / this.maxCapacity;
-        if (loadFactor >= HashTable.MAX_LOAD_FACTOR) {
-            this.storage = this.resizeStorage();
-        }
-    };
-    /**
-     * Will create new node instance and set in to storage by index
-     */
-    HashTable.prototype.updateNode = function (data, index) {
-        this.storage[index].data = data;
-        this.storage[index].isDeleted = false;
-    };
-    /**
-     * Will insert item to hash table
-     */
-    HashTable.prototype.set = function (key, data) {
-        for (var i = 0; i < this.maxCapacity; i++) {
-            var index = this.hashFn(key, i);
-            var node = this.storage[index];
-            var shouldAddNode = node === null;
-            if (shouldAddNode) {
-                this.addNode(key, data, index);
-                break;
-            }
-            var shouldUpdateNode = node.key === key;
-            if (shouldUpdateNode) {
-                this.updateNode(data, index);
-                break;
-            }
-        }
-    };
-    /**
-     * Will update item property isDeleted to false
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    HashTable.prototype.delete = function (key) {
-        for (var i = 0; i < this.maxCapacity; i++) {
-            var index = this.hashFn(key, i);
-            if (this.storage[index] !== null) {
-                this.storage[index].isDeleted = true;
-                return;
-            }
-        }
-        throw new IsNotFoundException_1.default("Element does not exist");
-    };
-    /**
-     * Will find item in hash table
-     * @throws {IsNotFoundException} when element does not exist
-     */
-    HashTable.prototype.get = function (key) {
-        return this.findNode(key).data;
-    };
-    /**
-     * Check if node with given key exists
-     */
-    HashTable.prototype.has = function (key) {
-        try {
-            return Boolean(this.findNode(key));
-        }
-        catch (e) {
-            return false;
-        }
-    };
-    /**
-     * Added elements count
-     */
-    HashTable.prototype.length = function () {
-        var actualItems = this.storage.filter(function (item) {
-            return item !== null && !item.isDeleted;
-        });
-        return actualItems.length;
-    };
-    /**
-     * Will overwrite storage with array of null elements
-     */
-    HashTable.prototype.clear = function () {
-        this.storage = new Array(HashTable.DEFAULT_MAX_CAPACITY).fill(null);
-    };
-    /**
-     Constants
-     */
-    HashTable.DEFAULT_MAX_CAPACITY = 100;
-    HashTable.MAX_LOAD_FACTOR = 0.75;
-    return HashTable;
-}());
-exports.default = HashTable;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSGFzaFRhYmxlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL2FwcC9kYXRhLXN0cnVjdHVyZXMvSGFzaFRhYmxlL0hhc2hUYWJsZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOztBQUNBLGlEQUE0QztBQUM1QyxzRkFBaUY7QUFDakYsNEVBQXVFO0FBRXZFOztHQUVHO0FBQ0g7SUFjRTs7O09BR0c7SUFDSCxtQkFBbUIsZUFBd0Q7UUFBeEQsZ0NBQUEsRUFBQSxrQkFBMEIsU0FBUyxDQUFDLG9CQUFvQjtRQU5uRSxvQkFBZSxHQUFHLENBQUMsQ0FBQztRQU8xQixJQUFJLGVBQWUsSUFBSSxDQUFDLEVBQUU7WUFDeEIsTUFBTSxJQUFJLGtDQUF3QixDQUFDLDRCQUE0QixDQUFDLENBQUM7U0FDbEU7UUFDRCxJQUFJLENBQUMsV0FBVyxHQUFHLGVBQWUsQ0FBQztRQUNuQyxJQUFJLENBQUMsT0FBTyxHQUFHLElBQUksS0FBSyxDQUFDLElBQUksQ0FBQyxXQUFXLENBQUMsQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLENBQUM7SUFDeEQsQ0FBQztJQUVEOztPQUVHO0lBQ0ssMEJBQU0sR0FBZCxVQUFlLEdBQVcsRUFBRSxNQUFjO1FBQ3hDLE9BQU8sQ0FDTCxDQUFDLElBQUksQ0FBQyxXQUFXLENBQUMsR0FBRyxDQUFDLEdBQUcsR0FBRyxHQUFHLE1BQU0sR0FBRyxHQUFHLEdBQUcsTUFBTSxHQUFHLE1BQU0sQ0FBQztZQUM5RCxJQUFJLENBQUMsV0FBVyxDQUNqQixDQUFDO0lBQ0osQ0FBQztJQUVEOztPQUVHO0lBQ0ssK0JBQVcsR0FBbkIsVUFBb0IsR0FBVztRQUM3QixJQUFNLE1BQU0sR0FBVyxHQUFHLENBQUMsTUFBTSxDQUFDO1FBRWxDLElBQUksTUFBTSxLQUFLLENBQUMsRUFBRTtZQUNoQixPQUFPLENBQUMsQ0FBQztTQUNWO1FBQ0QsSUFBTSxTQUFTLEdBQUcsR0FBRyxDQUFDLFNBQVMsQ0FBQyxDQUFDLEVBQUUsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDO1FBQy9DLElBQU0sTUFBTSxHQUFHLEdBQUcsQ0FBQyxVQUFVLENBQUMsTUFBTSxHQUFHLENBQUMsQ0FBQyxDQUFDO1FBRTFDLE9BQU8sQ0FBQyxHQUFHLEdBQUcsSUFBSSxDQUFDLFdBQVcsQ0FBQyxTQUFTLENBQUMsR0FBRyxNQUFNLENBQUMsR0FBRyxJQUFJLENBQUMsV0FBVyxDQUFDO0lBQ3pFLENBQUM7SUFFRDs7T0FFRztJQUNLLGlDQUFhLEdBQXJCO1FBQ0UsSUFBSSxDQUFDLFdBQVcsSUFBSSxDQUFDLENBQUM7UUFFdEIsSUFBTSxRQUFRLEdBQUcsSUFBSSxLQUFLLENBQUMsSUFBSSxDQUFDLFdBQVcsQ0FBQyxDQUFDLElBQUksQ0FBQyxJQUFJLENBQUMsQ0FBQztRQUV4RCxLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsSUFBSSxDQUFDLE9BQU8sQ0FBQyxNQUFNLEVBQUUsQ0FBQyxFQUFFLEVBQUU7WUFDNUMsSUFBTSxPQUFPLEdBQUcsSUFBSSxDQUFDLE9BQU8sQ0FBQyxDQUFDLENBQUMsQ0FBQztZQUVoQyxJQUFJLE9BQU8sSUFBSSxJQUFJLEVBQUU7Z0JBQ25CLEtBQUssSUFBSSxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUMsR0FBRyxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUMsRUFBRSxFQUFFO29CQUN6QyxJQUFNLFFBQVEsR0FBRyxJQUFJLENBQUMsTUFBTSxDQUFDLE9BQU8sQ0FBQyxHQUFHLEVBQUUsQ0FBQyxDQUFDLENBQUM7b0JBRTdDLElBQUksUUFBUSxDQUFDLFFBQVEsQ0FBQyxJQUFJLElBQUksRUFBRTt3QkFDOUIsUUFBUSxDQUFDLFFBQVEsQ0FBQyxHQUFHLE9BQU8sQ0FBQzt3QkFFN0IsTUFBTTtxQkFDUDtpQkFDRjthQUNGO1NBQ0Y7UUFFRCxPQUFPLFFBQVEsQ0FBQztJQUNsQixDQUFDO0lBRUQ7OztPQUdHO0lBQ0ssNEJBQVEsR0FBaEIsVUFBaUIsR0FBVztRQUMxQixLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsSUFBSSxDQUFDLFdBQVcsRUFBRSxDQUFDLEVBQUUsRUFBRTtZQUN6QyxJQUFNLEtBQUssR0FBRyxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsRUFBRSxDQUFDLENBQUMsQ0FBQztZQUNsQyxJQUFNLElBQUksR0FBRyxJQUFJLENBQUMsT0FBTyxDQUFDLEtBQUssQ0FBQyxDQUFDO1lBRWpDLElBQUksQ0FBQSxJQUFJLGFBQUosSUFBSSx1QkFBSixJQUFJLENBQUUsR0FBRyxNQUFLLEdBQUcsRUFBRTtnQkFDckIsSUFBSSxJQUFJLGFBQUosSUFBSSx1QkFBSixJQUFJLENBQUUsU0FBUyxFQUFFO29CQUNuQixNQUFNO2lCQUNQO2dCQUNELE9BQU8sSUFBSSxDQUFDO2FBQ2I7U0FDRjtRQUVELE1BQU0sSUFBSSw2QkFBbUIsQ0FBQyx3QkFBd0IsQ0FBQyxDQUFDO0lBQzFELENBQUM7SUFFRDs7T0FFRztJQUNLLDJCQUFPLEdBQWYsVUFBZ0IsR0FBVyxFQUFFLElBQU8sRUFBRSxLQUFhO1FBQ2pELElBQUksQ0FBQyxPQUFPLENBQUMsS0FBSyxDQUFDLEdBQUcsSUFBSSx1QkFBYSxDQUFJLEdBQUcsRUFBRSxJQUFJLENBQUMsQ0FBQztRQUV0RCxJQUFJLENBQUMsZUFBZSxFQUFFLENBQUM7UUFDdkIsSUFBTSxVQUFVLEdBQUcsSUFBSSxDQUFDLGVBQWUsR0FBRyxJQUFJLENBQUMsV0FBVyxDQUFDO1FBRTNELElBQUksVUFBVSxJQUFJLFNBQVMsQ0FBQyxlQUFlLEVBQUU7WUFDM0MsSUFBSSxDQUFDLE9BQU8sR0FBRyxJQUFJLENBQUMsYUFBYSxFQUFFLENBQUM7U0FDckM7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSyw4QkFBVSxHQUFsQixVQUFtQixJQUFPLEVBQUUsS0FBYTtRQUN2QyxJQUFJLENBQUMsT0FBTyxDQUFDLEtBQUssQ0FBQyxDQUFDLElBQUksR0FBRyxJQUFJLENBQUM7UUFDaEMsSUFBSSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQyxTQUFTLEdBQUcsS0FBSyxDQUFDO0lBQ3hDLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFHLEdBQVYsVUFBVyxHQUFXLEVBQUUsSUFBTztRQUM3QixLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsSUFBSSxDQUFDLFdBQVcsRUFBRSxDQUFDLEVBQUUsRUFBRTtZQUN6QyxJQUFNLEtBQUssR0FBRyxJQUFJLENBQUMsTUFBTSxDQUFDLEdBQUcsRUFBRSxDQUFDLENBQUMsQ0FBQztZQUNsQyxJQUFNLElBQUksR0FBRyxJQUFJLENBQUMsT0FBTyxDQUFDLEtBQUssQ0FBQyxDQUFDO1lBRWpDLElBQU0sYUFBYSxHQUFHLElBQUksS0FBSyxJQUFJLENBQUM7WUFDcEMsSUFBSSxhQUFhLEVBQUU7Z0JBQ2pCLElBQUksQ0FBQyxPQUFPLENBQUMsR0FBRyxFQUFFLElBQUksRUFBRSxLQUFLLENBQUMsQ0FBQztnQkFDL0IsTUFBTTthQUNQO1lBRUQsSUFBTSxnQkFBZ0IsR0FBRyxJQUFJLENBQUMsR0FBRyxLQUFLLEdBQUcsQ0FBQztZQUMxQyxJQUFJLGdCQUFnQixFQUFFO2dCQUNwQixJQUFJLENBQUMsVUFBVSxDQUFDLElBQUksRUFBRSxLQUFLLENBQUMsQ0FBQztnQkFDN0IsTUFBTTthQUNQO1NBQ0Y7SUFDSCxDQUFDO0lBRUQ7OztPQUdHO0lBQ0ksMEJBQU0sR0FBYixVQUFjLEdBQVc7UUFDdkIsS0FBSyxJQUFJLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBQyxHQUFHLElBQUksQ0FBQyxXQUFXLEVBQUUsQ0FBQyxFQUFFLEVBQUU7WUFDekMsSUFBTSxLQUFLLEdBQUcsSUFBSSxDQUFDLE1BQU0sQ0FBQyxHQUFHLEVBQUUsQ0FBQyxDQUFDLENBQUM7WUFFbEMsSUFBSSxJQUFJLENBQUMsT0FBTyxDQUFDLEtBQUssQ0FBQyxLQUFLLElBQUksRUFBRTtnQkFDaEMsSUFBSSxDQUFDLE9BQU8sQ0FBQyxLQUFLLENBQUMsQ0FBQyxTQUFTLEdBQUcsSUFBSSxDQUFDO2dCQUNyQyxPQUFPO2FBQ1I7U0FDRjtRQUVELE1BQU0sSUFBSSw2QkFBbUIsQ0FBQyx3QkFBd0IsQ0FBQyxDQUFDO0lBQzFELENBQUM7SUFFRDs7O09BR0c7SUFDSSx1QkFBRyxHQUFWLFVBQVcsR0FBVztRQUNwQixPQUFPLElBQUksQ0FBQyxRQUFRLENBQUMsR0FBRyxDQUFDLENBQUMsSUFBSSxDQUFDO0lBQ2pDLENBQUM7SUFFRDs7T0FFRztJQUNJLHVCQUFHLEdBQVYsVUFBVyxHQUFXO1FBQ3BCLElBQUk7WUFDRixPQUFPLE9BQU8sQ0FBQyxJQUFJLENBQUMsUUFBUSxDQUFDLEdBQUcsQ0FBQyxDQUFDLENBQUM7U0FDcEM7UUFBQyxPQUFPLENBQUMsRUFBRTtZQUNWLE9BQU8sS0FBSyxDQUFDO1NBQ2Q7SUFDSCxDQUFDO0lBRUQ7O09BRUc7SUFDSSwwQkFBTSxHQUFiO1FBQ0UsSUFBTSxXQUFXLEdBQUcsSUFBSSxDQUFDLE9BQU8sQ0FBQyxNQUFNLENBQUMsVUFBQyxJQUFJO1lBQzNDLE9BQU8sSUFBSSxLQUFLLElBQUksSUFBSSxDQUFDLElBQUksQ0FBQyxTQUFTLENBQUM7UUFDMUMsQ0FBQyxDQUFDLENBQUM7UUFFSCxPQUFPLFdBQVcsQ0FBQyxNQUFNLENBQUM7SUFDNUIsQ0FBQztJQUVEOztPQUVHO0lBQ0kseUJBQUssR0FBWjtRQUNFLElBQUksQ0FBQyxPQUFPLEdBQUcsSUFBSSxLQUFLLENBQUMsU0FBUyxDQUFDLG9CQUFvQixDQUFDLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBQ3RFLENBQUM7SUFqTUQ7O09BRUc7SUFDWSw4QkFBb0IsR0FBRyxHQUFHLENBQUM7SUFDM0IseUJBQWUsR0FBRyxJQUFJLENBQUM7SUE4THhDLGdCQUFDO0NBQUEsQUFuTUQsSUFtTUM7a0JBbk1vQixTQUFTIn0=

package/lib/app/data-structures/HashTable/HashTableNode.d.ts

@@ -1,11 +0,0 @@
-export default class HashTableNode<T> {
-    private readonly _key;
-    private _data;
-    private _isDeleted;
-    constructor(key: string, data: T);
-    get data(): T;
-    set data(value: T);
-    get key(): string;
-    get isDeleted(): boolean;
-    set isDeleted(value: boolean);
-}

package/lib/app/data-structures/HashTable/HashTableNode.js

@@ -1,39 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var HashTableNode = /** @class */ (function () {
-    function HashTableNode(key, data) {
-        this._key = key;
-        this._data = data;
-        this._isDeleted = false;
-    }
-    Object.defineProperty(HashTableNode.prototype, "data", {
-        get: function () {
-            return this._data;
-        },
-        set: function (value) {
-            this._data = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(HashTableNode.prototype, "key", {
-        get: function () {
-            return this._key;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(HashTableNode.prototype, "isDeleted", {
-        get: function () {
-            return this._isDeleted;
-        },
-        set: function (value) {
-            this._isDeleted = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return HashTableNode;
-}());
-exports.default = HashTableNode;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiSGFzaFRhYmxlTm9kZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9hcHAvZGF0YS1zdHJ1Y3R1cmVzL0hhc2hUYWJsZS9IYXNoVGFibGVOb2RlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBQUE7SUFLRSx1QkFBbUIsR0FBVyxFQUFFLElBQU87UUFDckMsSUFBSSxDQUFDLElBQUksR0FBRyxHQUFHLENBQUM7UUFDaEIsSUFBSSxDQUFDLEtBQUssR0FBRyxJQUFJLENBQUM7UUFDbEIsSUFBSSxDQUFDLFVBQVUsR0FBRyxLQUFLLENBQUM7SUFDMUIsQ0FBQztJQUVELHNCQUFJLCtCQUFJO2FBQVI7WUFDRSxPQUFPLElBQUksQ0FBQyxLQUFLLENBQUM7UUFDcEIsQ0FBQzthQUVELFVBQVMsS0FBUTtZQUNmLElBQUksQ0FBQyxLQUFLLEdBQUcsS0FBSyxDQUFDO1FBQ3JCLENBQUM7OztPQUpBO0lBTUQsc0JBQUksOEJBQUc7YUFBUDtZQUNFLE9BQU8sSUFBSSxDQUFDLElBQUksQ0FBQztRQUNuQixDQUFDOzs7T0FBQTtJQUVELHNCQUFJLG9DQUFTO2FBQWI7WUFDRSxPQUFPLElBQUksQ0FBQyxVQUFVLENBQUM7UUFDekIsQ0FBQzthQUVELFVBQWMsS0FBYztZQUMxQixJQUFJLENBQUMsVUFBVSxHQUFHLEtBQUssQ0FBQztRQUMxQixDQUFDOzs7T0FKQTtJQUtILG9CQUFDO0FBQUQsQ0FBQyxBQTlCRCxJQThCQyJ9

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

@@ -1,134 +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 {ValueOutOfRangeException} when capacity is out of range
-     */
-    private static calculateCapacity;
-    /**
-     * Will insert node between nodeLeft and nodeRight
-     * @throws {CollectionIsFullException} when list is full
-     */
-    private insertNodeBetweenTwoNodes;
-    /**
-     * Will remove the node from its neighbors nodes links
-     * @throws {CollectionIsEmptyException} when list is empty
-     */
-    private deleteNode;
-    /**
-     * Will find node by its index
-     * @throws {CollectionIsEmptyException} when list is empty
-     * @throws {IndexOutOfBoundsException} when given index is out of range
-     */
-    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
-     * @throws {CollectionIsFullException} when there is no space available
-     */
-    unshift(value: T): void;
-    /**
-     * Push into end
-     * @throws {CollectionIsFullException} when there is no space available
-     */
-    push(value: T): void;
-    /**
-     * Push from index
-     * @throws {IndexOutOfBoundsException} when given index is out of range
-     * @throws {CollectionIsFullException} when there is no space available
-     */
-    pushFromIndex(value: T, fromIndex: number): void;
-    /**
-     * Delete node from list's end
-     * @throws {CollectionIsEmptyException} when list is empty
-     */
-    pop(): T;
-    /**
-     * Delete node from list's start and get its data
-     * @throws {CollectionIsEmptyException} when list is empty
-     */
-    shift(): T;
-    /**
-     * Delete node from list by index from start
-     * @throws {CollectionIsEmptyException} when list is empty
-     */
-    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 {CollectionIsEmptyException} when head does not exist
-     */
-    peek(): T;
-    /**
-     * Get tail element data
-     * @throws {CollectionIsEmptyException} when tail does not exists
-     */
-    peekFromStart(): T;
-    /**
-     * Get list element by index from start
-     * @throws {CollectionIsEmptyException} when list is empty
-     * @throws {IndexOutOfBoundsException} when given index is out of range
-     */
-    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 {CollectionIsFullException} 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;
-}