@raikuxq/alg-ds 1.1.3 → 1.1.4

package/lib/index.js

@@ -0,0 +1,6 @@
+"use strict";
+/**
+ * Write your code here
+ */
+console.log("Hello world");
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5kZXguanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvaW5kZXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6IjtBQUFBOztHQUVHO0FBRUgsT0FBTyxDQUFDLEdBQUcsQ0FBQyxhQUFhLENBQUMsQ0FBQyJ9

package/lib/types/ArrayMatrix.d.ts

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

package/lib/types/ArrayMatrix.js

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

package/lib/types/EnumBinarySearchTreeType.d.ts

@@ -0,0 +1,4 @@
+export declare enum EnumBinarySearchTreeType {
+    BST = "Binary Search Tree",
+    RANDOMIZED_BST = "Randomized Binary Search Tree"
+}

package/lib/types/EnumBinarySearchTreeType.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnumBinarySearchTreeType = void 0;
+var EnumBinarySearchTreeType;
+(function (EnumBinarySearchTreeType) {
+    EnumBinarySearchTreeType["BST"] = "Binary Search Tree";
+    EnumBinarySearchTreeType["RANDOMIZED_BST"] = "Randomized Binary Search Tree";
+})(EnumBinarySearchTreeType = exports.EnumBinarySearchTreeType || (exports.EnumBinarySearchTreeType = {}));
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRW51bUJpbmFyeVNlYXJjaFRyZWVUeXBlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3R5cGVzL0VudW1CaW5hcnlTZWFyY2hUcmVlVHlwZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFBQSxJQUFZLHdCQUdYO0FBSEQsV0FBWSx3QkFBd0I7SUFDbEMsc0RBQTBCLENBQUE7SUFDMUIsNEVBQWdELENBQUE7QUFDbEQsQ0FBQyxFQUhXLHdCQUF3QixHQUF4QixnQ0FBd0IsS0FBeEIsZ0NBQXdCLFFBR25DIn0=

package/lib/types/EnumGraphType.d.ts

@@ -0,0 +1,4 @@
+export declare enum EnumGraphType {
+    Directed = "Directed",
+    Undirected = "Undirected"
+}

package/lib/types/EnumGraphType.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnumGraphType = void 0;
+var EnumGraphType;
+(function (EnumGraphType) {
+    EnumGraphType["Directed"] = "Directed";
+    EnumGraphType["Undirected"] = "Undirected";
+})(EnumGraphType = exports.EnumGraphType || (exports.EnumGraphType = {}));
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRW51bUdyYXBoVHlwZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uL3NyYy90eXBlcy9FbnVtR3JhcGhUeXBlLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBLElBQVksYUFHWDtBQUhELFdBQVksYUFBYTtJQUN2QixzQ0FBcUIsQ0FBQTtJQUNyQiwwQ0FBeUIsQ0FBQTtBQUMzQixDQUFDLEVBSFcsYUFBYSxHQUFiLHFCQUFhLEtBQWIscUJBQWEsUUFHeEIifQ==

package/lib/types/EnumLinkedListType.d.ts

@@ -0,0 +1,4 @@
+export declare enum EnumLinkedListType {
+    DOUBLE = "Double linked list",
+    SINGLE = "Single linked list"
+}

package/lib/types/EnumLinkedListType.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnumLinkedListType = void 0;
+var EnumLinkedListType;
+(function (EnumLinkedListType) {
+    EnumLinkedListType["DOUBLE"] = "Double linked list";
+    EnumLinkedListType["SINGLE"] = "Single linked list";
+})(EnumLinkedListType = exports.EnumLinkedListType || (exports.EnumLinkedListType = {}));
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRW51bUxpbmtlZExpc3RUeXBlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3R5cGVzL0VudW1MaW5rZWRMaXN0VHlwZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFBQSxJQUFZLGtCQUdYO0FBSEQsV0FBWSxrQkFBa0I7SUFDNUIsbURBQTZCLENBQUE7SUFDN0IsbURBQTZCLENBQUE7QUFDL0IsQ0FBQyxFQUhXLGtCQUFrQixHQUFsQiwwQkFBa0IsS0FBbEIsMEJBQWtCLFFBRzdCIn0=

package/lib/types/EnumRandomGenerationFormat.d.ts

@@ -0,0 +1,4 @@
+export declare enum EnumRandomGenerationFormat {
+    Numbers = "NUMBERS",
+    Hash = "HASH"
+}

package/lib/types/EnumRandomGenerationFormat.js

@@ -0,0 +1,9 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnumRandomGenerationFormat = void 0;
+var EnumRandomGenerationFormat;
+(function (EnumRandomGenerationFormat) {
+    EnumRandomGenerationFormat["Numbers"] = "NUMBERS";
+    EnumRandomGenerationFormat["Hash"] = "HASH";
+})(EnumRandomGenerationFormat = exports.EnumRandomGenerationFormat || (exports.EnumRandomGenerationFormat = {}));
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRW51bVJhbmRvbUdlbmVyYXRpb25Gb3JtYXQuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi9zcmMvdHlwZXMvRW51bVJhbmRvbUdlbmVyYXRpb25Gb3JtYXQudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEsSUFBWSwwQkFHWDtBQUhELFdBQVksMEJBQTBCO0lBQ3BDLGlEQUFtQixDQUFBO0lBQ25CLDJDQUFhLENBQUE7QUFDZixDQUFDLEVBSFcsMEJBQTBCLEdBQTFCLGtDQUEwQixLQUExQixrQ0FBMEIsUUFHckMifQ==

package/lib/types/EnumTreeTraversalType.d.ts

@@ -0,0 +1,5 @@
+export declare enum EnumTreeTraversalType {
+    InOrder = "InOrder",
+    PreOrder = "PreOrder",
+    PostOrder = "PostOrder"
+}

package/lib/types/EnumTreeTraversalType.js

@@ -0,0 +1,10 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EnumTreeTraversalType = void 0;
+var EnumTreeTraversalType;
+(function (EnumTreeTraversalType) {
+    EnumTreeTraversalType["InOrder"] = "InOrder";
+    EnumTreeTraversalType["PreOrder"] = "PreOrder";
+    EnumTreeTraversalType["PostOrder"] = "PostOrder";
+})(EnumTreeTraversalType = exports.EnumTreeTraversalType || (exports.EnumTreeTraversalType = {}));
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRW51bVRyZWVUcmF2ZXJzYWxUeXBlLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vc3JjL3R5cGVzL0VudW1UcmVlVHJhdmVyc2FsVHlwZS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFBQSxJQUFZLHFCQUlYO0FBSkQsV0FBWSxxQkFBcUI7SUFDL0IsNENBQW1CLENBQUE7SUFDbkIsOENBQXFCLENBQUE7SUFDckIsZ0RBQXVCLENBQUE7QUFDekIsQ0FBQyxFQUpXLHFCQUFxQixHQUFyQiw2QkFBcUIsS0FBckIsNkJBQXFCLFFBSWhDIn0=

package/lib/types/FnCompareTwo.d.ts

@@ -0,0 +1 @@
+export declare type FnCompareTwo<T> = (firstItem: T, secondItem: T) => boolean;

package/lib/types/FnCompareTwo.js

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

package/lib/types/FnToMemoize.d.ts

@@ -0,0 +1 @@
+export declare type FnToMemoize<Key, Value> = (...args: Array<Key>) => Value;

package/lib/types/FnToMemoize.js

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

package/lib/types/IArrayFacade.d.ts

@@ -0,0 +1,4 @@
+import ILinearStorageRA from "./ILinearStorageRA";
+import IConvertableToArray from "./IConvertableToArray";
+export default interface IArrayFacade<T> extends ILinearStorageRA<T>, IConvertableToArray<T> {
+}

package/lib/types/IArrayFacade.js

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

package/lib/types/IBiDirectIterable.d.ts

@@ -0,0 +1,5 @@
+import IBiDirectIterator from "./IBiDirectIterator";
+import IIterable from "./IIterable";
+export default interface IBiDirectIterable<T> extends IIterable<T> {
+    iterator(fromIndex?: number): IBiDirectIterator<T>;
+}

package/lib/types/IBiDirectIterable.js

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

package/lib/types/IBiDirectIterator.d.ts

@@ -0,0 +1,11 @@
+import IIterator from "./IIterator";
+export default interface IBiDirectIterator<T> extends IIterator<T> {
+    /**
+     * Will do one iteration back and returns prev item value
+     */
+    prev(): T;
+    /**
+     * Check if next element exists
+     */
+    hasPrev(): boolean;
+}

package/lib/types/IBiDirectIterator.js

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

package/lib/types/IBinaryTree.d.ts

@@ -0,0 +1,12 @@
+import { EnumTreeTraversalType } from "./EnumTreeTraversalType";
+export default interface IBinaryTree<T> {
+    has(value: T): boolean;
+    insert(value: T): void;
+    delete(value: T): void;
+    subtree(value: T): IBinaryTree<T>;
+    max(): T;
+    min(): T;
+    length(): number;
+    height(): number;
+    traverse(type: EnumTreeTraversalType): Array<T>;
+}

package/lib/types/IBinaryTree.js

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

package/lib/types/IConvertableToArray.d.ts

@@ -0,0 +1,4 @@
+export default interface IConvertableToArray<T> {
+    pushFromArray(elements: Array<T>): void;
+    getAsArray(): Array<T>;
+}

package/lib/types/IConvertableToArray.js

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

package/lib/types/IGraph.d.ts

@@ -0,0 +1,14 @@
+export default interface IGraph<T> {
+    weight(): number;
+    vertices(): Array<T>;
+    verticesCount(): number;
+    edgesCount(): number;
+    addVertex(data: T): this;
+    removeVertex(data: T): this;
+    hasVertex(data: T): boolean;
+    getVertexNeighbors(data: T): Array<T>;
+    addEdge(from: T, to: T, weight?: number): this;
+    removeEdge(from: T, to: T): this;
+    hasEdge(from: T, to: T): boolean;
+    getEdgeWeight(from: T, to: T): number;
+}

package/lib/types/IGraph.js

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

package/lib/types/IGraphIterationStrategy.d.ts

@@ -0,0 +1,5 @@
+import IGraph from "./IGraph";
+import IGraphIterator from "./IGraphIterator";
+export default interface IGraphIterationStrategy<T> {
+    createIterator(graph: IGraph<T>): IGraphIterator<T>;
+}

package/lib/types/IGraphIterationStrategy.js

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

package/lib/types/IGraphIterator.d.ts

@@ -0,0 +1,11 @@
+import IIterator from "./IIterator";
+export default interface IGraphIterator<T> extends IIterator<T> {
+    /**
+     * Get path which passed by iterator between two vertices
+     */
+    getPath(from: T, to: T): Array<T>;
+    /**
+     * Initialize iterator by passing start vertex
+     */
+    initIterator(from: T): void;
+}

package/lib/types/IGraphIterator.js

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

package/lib/types/IIterable.d.ts

@@ -0,0 +1,4 @@
+import IIterator from "./IIterator";
+export default interface IIterable<T> {
+    iterator(fromIndex?: number): IIterator<T>;
+}

package/lib/types/IIterable.js

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

package/lib/types/IIterator.d.ts

@@ -0,0 +1,14 @@
+export default interface IIterator<T> {
+    /**
+     * Will do one iteration and returns next item value
+     */
+    next(): T;
+    /**
+     * Will returns current value
+     */
+    current(): T;
+    /**
+     * Check if next element exists
+     */
+    hasNext(): boolean;
+}

package/lib/types/IIterator.js

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

package/lib/types/IKeyValueStorage.d.ts

@@ -0,0 +1,8 @@
+export default interface IKeyValueStorage<T> {
+    set(key: string, value: T): void;
+    has(key: string): boolean;
+    get(key: string): T;
+    delete(key: string): void;
+    length(): number;
+    clear(): void;
+}

package/lib/types/IKeyValueStorage.js

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

package/lib/types/ILinearStorage.d.ts

@@ -0,0 +1,11 @@
+export default interface ILinearStorage<T> {
+    peek(): T;
+    push(value: T): void;
+    pop(): T;
+    has(value: T): boolean;
+    isEmpty(): boolean;
+    isFull(): boolean;
+    length(): number;
+    clear(): void;
+    reverse(): void;
+}

package/lib/types/ILinearStorage.js

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

package/lib/types/ILinearStorageRA.d.ts

@@ -0,0 +1,13 @@
+import ILinearStorage from "./ILinearStorage";
+/**
+ * Interface extends default linear storage with methods that allows read/write operations for all storage elements
+ * RA - randomly accessible
+ */
+export default interface ILinearStorageRA<T> extends ILinearStorage<T> {
+    peekFromStart(): T;
+    peekByIndex(index: number): T;
+    unshift(value: T): void;
+    pushFromIndex(value: T, fromIndex: number): void;
+    shift(): T;
+    deleteFromIndex(fromIndex: number): T;
+}

package/lib/types/ILinearStorageRA.js

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

package/lib/types/ILinkedList.d.ts

@@ -0,0 +1,4 @@
+import ILinearStorageRA from "./ILinearStorageRA";
+import IConvertableToArray from "./IConvertableToArray";
+export default interface ILinkedList<T> extends ILinearStorageRA<T>, IConvertableToArray<T> {
+}

package/lib/types/ILinkedList.js

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

package/lib/utils.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Will find min value in the whole array and return its index
+ */
+export declare const getMinIndex: (arr: Array<number>) => number;
+/**
+ * Will find min value in range between fromIndex and end of array
+ */
+export declare const getMinIndexFromIndex: (arr: Array<number>, fromIndex: number) => number;
+/**
+ * Will swap two items in array
+ * @example swapArrayItems([2,3,5], 1, 2) -> [2,5,3]
+ */
+export declare const swapArrayItems: <T>(arr: T[], leftIndex: number, rightIndex: number) => void;
+/**
+ * Get random number in range
+ */
+export declare const randomizeNumberInRange: (min: number, max: number) => number;
+/**
+ * Round number to 3 digits after
+ */
+export declare const roundNumber: (num: number) => number;
+/**
+ * Get time execution of function
+ */
+export declare const perf: (fn: () => void) => number;
+/**
+ * Get time execution of function
+ */
+export declare const perfAsync: (fn: () => void) => Promise<number>;

package/lib/utils.js

@@ -0,0 +1,95 @@
+"use strict";
+var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
+    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
+    return new (P || (P = Promise))(function (resolve, reject) {
+        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
+        function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
+        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
+        step((generator = generator.apply(thisArg, _arguments || [])).next());
+    });
+};
+var __generator = (this && this.__generator) || function (thisArg, body) {
+    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
+    return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
+    function verb(n) { return function (v) { return step([n, v]); }; }
+    function step(op) {
+        if (f) throw new TypeError("Generator is already executing.");
+        while (_) try {
+            if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
+            if (y = 0, t) op = [op[0] & 2, t.value];
+            switch (op[0]) {
+                case 0: case 1: t = op; break;
+                case 4: _.label++; return { value: op[1], done: false };
+                case 5: _.label++; y = op[1]; op = [0]; continue;
+                case 7: op = _.ops.pop(); _.trys.pop(); continue;
+                default:
+                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
+                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
+                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
+                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
+                    if (t[2]) _.ops.pop();
+                    _.trys.pop(); continue;
+            }
+            op = body.call(thisArg, _);
+        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
+        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
+    }
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.perfAsync = exports.perf = exports.roundNumber = exports.randomizeNumberInRange = exports.swapArrayItems = exports.getMinIndexFromIndex = exports.getMinIndex = void 0;
+var perf_hooks_1 = require("perf_hooks");
+/**
+ * Will find min value in the whole array and return its index
+ */
+exports.getMinIndex = function (arr) {
+    return arr.reduce(function (minIndex, item, index) {
+        return item < arr[minIndex] ? index : minIndex;
+    }, 0);
+};
+/**
+ * Will find min value in range between fromIndex and end of array
+ */
+exports.getMinIndexFromIndex = function (arr, fromIndex) {
+    return fromIndex + exports.getMinIndex(arr.slice(fromIndex));
+};
+/**
+ * Will swap two items in array
+ * @example swapArrayItems([2,3,5], 1, 2) -> [2,5,3]
+ */
+exports.swapArrayItems = function (arr, leftIndex, rightIndex) {
+    if (leftIndex !== rightIndex) {
+        var temp = arr[leftIndex];
+        arr[leftIndex] = arr[rightIndex];
+        arr[rightIndex] = temp;
+    }
+};
+/**
+ * Get random number in range
+ */
+exports.randomizeNumberInRange = function (min, max) {
+    return Math.floor(Math.random() * (max - min)) + min;
+};
+/**
+ * Round number to 3 digits after
+ */
+exports.roundNumber = function (num) {
+    return Math.round(num * 1000) / 1000;
+};
+/**
+ * Get time execution of function
+ */
+exports.perf = function (fn) {
+    var perfStart = perf_hooks_1.performance.now();
+    fn();
+    var perfEnd = perf_hooks_1.performance.now();
+    return perfEnd - perfStart;
+};
+/**
+ * Get time execution of function
+ */
+exports.perfAsync = function (fn) { return __awaiter(void 0, void 0, void 0, function () {
+    return __generator(this, function (_a) {
+        return [2 /*return*/, Promise.resolve(exports.perf(fn))];
+    });
+}); };
+//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidXRpbHMuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi9zcmMvdXRpbHMudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7O0FBQUEseUNBQXlDO0FBRXpDOztHQUVHO0FBQ1UsUUFBQSxXQUFXLEdBQUcsVUFBQyxHQUFrQjtJQUM1QyxPQUFPLEdBQUcsQ0FBQyxNQUFNLENBQUMsVUFBQyxRQUFRLEVBQUUsSUFBSSxFQUFFLEtBQUs7UUFDdEMsT0FBTyxJQUFJLEdBQUcsR0FBRyxDQUFDLFFBQVEsQ0FBQyxDQUFDLENBQUMsQ0FBQyxLQUFLLENBQUMsQ0FBQyxDQUFDLFFBQVEsQ0FBQztJQUNqRCxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBQUM7QUFDUixDQUFDLENBQUM7QUFFRjs7R0FFRztBQUNVLFFBQUEsb0JBQW9CLEdBQUcsVUFDbEMsR0FBa0IsRUFDbEIsU0FBaUI7SUFFakIsT0FBTyxTQUFTLEdBQUcsbUJBQVcsQ0FBQyxHQUFHLENBQUMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxDQUFDLENBQUM7QUFDdkQsQ0FBQyxDQUFDO0FBRUY7OztHQUdHO0FBQ1UsUUFBQSxjQUFjLEdBQUcsVUFDNUIsR0FBYSxFQUNiLFNBQWlCLEVBQ2pCLFVBQWtCO0lBRWxCLElBQUksU0FBUyxLQUFLLFVBQVUsRUFBRTtRQUM1QixJQUFNLElBQUksR0FBTSxHQUFHLENBQUMsU0FBUyxDQUFDLENBQUM7UUFDL0IsR0FBRyxDQUFDLFNBQVMsQ0FBQyxHQUFHLEdBQUcsQ0FBQyxVQUFVLENBQUMsQ0FBQztRQUNqQyxHQUFHLENBQUMsVUFBVSxDQUFDLEdBQUcsSUFBSSxDQUFDO0tBQ3hCO0FBQ0gsQ0FBQyxDQUFDO0FBRUY7O0dBRUc7QUFDVSxRQUFBLHNCQUFzQixHQUFHLFVBQUMsR0FBVyxFQUFFLEdBQVc7SUFDN0QsT0FBQSxJQUFJLENBQUMsS0FBSyxDQUFDLElBQUksQ0FBQyxNQUFNLEVBQUUsR0FBRyxDQUFDLEdBQUcsR0FBRyxHQUFHLENBQUMsQ0FBQyxHQUFHLEdBQUc7QUFBN0MsQ0FBNkMsQ0FBQztBQUVoRDs7R0FFRztBQUNVLFFBQUEsV0FBVyxHQUFHLFVBQUMsR0FBVztJQUNyQyxPQUFBLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxHQUFHLElBQUksQ0FBQyxHQUFHLElBQUk7QUFBN0IsQ0FBNkIsQ0FBQztBQUVoQzs7R0FFRztBQUNVLFFBQUEsSUFBSSxHQUFHLFVBQUMsRUFBYztJQUNqQyxJQUFNLFNBQVMsR0FBRyx3QkFBVyxDQUFDLEdBQUcsRUFBRSxDQUFDO0lBQ3BDLEVBQUUsRUFBRSxDQUFDO0lBQ0wsSUFBTSxPQUFPLEdBQUcsd0JBQVcsQ0FBQyxHQUFHLEVBQUUsQ0FBQztJQUNsQyxPQUFPLE9BQU8sR0FBRyxTQUFTLENBQUM7QUFDN0IsQ0FBQyxDQUFDO0FBRUY7O0dBRUc7QUFDVSxRQUFBLFNBQVMsR0FBRyxVQUFPLEVBQWM7O1FBQzVDLHNCQUFPLE9BQU8sQ0FBQyxPQUFPLENBQUMsWUFBSSxDQUFDLEVBQUUsQ0FBQyxDQUFDLEVBQUM7O0tBQ2xDLENBQUMifQ==

package/package.json

@@ -38,5 +38,5 @@
     "typescript": "^4.0.3"
   },
   "dependencies": {},
-  "version": "1.1.3"
+  "version": "1.1.4"
 }