@raikuxq/alg-ds 1.1.1 → 1.1.2

package/.idea/algorythmes.iml

@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="WEB_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/test" isTestSource="true" />
+      <excludeFolder url="file://$MODULE_DIR$/.tmp" />
+      <excludeFolder url="file://$MODULE_DIR$/temp" />
+      <excludeFolder url="file://$MODULE_DIR$/tmp" />
+      <excludeFolder url="file://$MODULE_DIR$/build/coverage" />
+      <excludeFolder url="file://$MODULE_DIR$/coverage" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

package/.idea/codeStyles/codeStyleConfig.xml

@@ -0,0 +1,5 @@
+<component name="ProjectCodeStyleConfiguration">
+  <state>
+    <option name="PREFERRED_PROJECT_CODE_STYLE" value="Default" />
+  </state>
+</component>

package/.idea/deployment.xml

@@ -0,0 +1,14 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="PublishConfigData">
+    <serverData>
+      <paths name="raikuhost">
+        <serverdata>
+          <mappings>
+            <mapping local="$PROJECT_DIR$" web="/" />
+          </mappings>
+        </serverdata>
+      </paths>
+    </serverData>
+  </component>
+</project>

package/.idea/inspectionProfiles/Project_Default.xml

@@ -0,0 +1,7 @@
+<component name="InspectionProjectProfileManager">
+  <profile version="1.0">
+    <option name="myName" value="Project Default" />
+    <inspection_tool class="DuplicatedCode" enabled="false" level="WEAK WARNING" enabled_by_default="false" />
+    <inspection_tool class="Eslint" enabled="true" level="WARNING" enabled_by_default="true" />
+  </profile>
+</component>

package/.idea/jsLinters/eslint.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="EslintConfiguration">
+    <option name="fix-on-save" value="true" />
+  </component>
+</project>

package/.idea/misc.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="JavaScriptSettings">
+    <option name="languageLevel" value="ES6" />
+  </component>
+</project>

package/.idea/modules.xml

@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/algorythmes.iml" filepath="$PROJECT_DIR$/.idea/algorythmes.iml" />
+    </modules>
+  </component>
+</project>

package/.idea/vcs.xml

@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>

package/lib/algotirhms.ts

@@ -0,0 +1,35 @@
+import { factorial, memoizedFactorial } from "../src/algorithms/factorial";
+import { fibonacci, memoizedFibonacci } from "../src/algorithms/fibonacci";
+import { binarySearch } from "../src/algorithms/binary-search";
+import { transposeMatrix } from "../src/algorithms/transpose-matrix";
+import { transposeDirectedGraph } from "../src/data-structures/Graph/transposing/transposeDirectedGraph";
+import BFSIterationStrategy from "../src/data-structures/Graph/strategy/BFSIterationStrategy";
+import DFSIterationStrategy from "../src/data-structures/Graph/strategy/DFSIterationStrategy";
+import DijkstraIterationStrategy from "../src/data-structures/Graph/strategy/DijkstraIterationStrategy";
+import GraphIteratorBFS from "../src/data-structures/Graph/iterator/GraphIteratorBFS";
+import GraphIteratorDFS from "../src/data-structures/Graph/iterator/GraphIteratorDFS";
+import GraphIteratorDijkstra from "../src/data-structures/Graph/iterator/GraphIteratorDijkstra";
+import { hasPath } from "../src/data-structures/Graph/searching/hasPath";
+import { shortestPath } from "../src/data-structures/Graph/searching/shortestPath";
+import { presenterAdjacencyMatrix } from "../src/data-structures/Graph/presenter/presenterAdjacencyMatrix";
+import { presenterAdjacencyLists } from "../src/data-structures/Graph/presenter/presenterAdjacencyLists";
+
+export {
+  binarySearch,
+  factorial,
+  memoizedFactorial,
+  memoizedFibonacci,
+  fibonacci,
+  transposeMatrix,
+  GraphIteratorDFS,
+  presenterAdjacencyLists,
+  presenterAdjacencyMatrix,
+  hasPath,
+  shortestPath,
+  DijkstraIterationStrategy,
+  DFSIterationStrategy,
+  BFSIterationStrategy,
+  GraphIteratorBFS,
+  GraphIteratorDijkstra,
+  transposeDirectedGraph,
+};

package/lib/constants.ts

@@ -0,0 +1,3 @@
+import { EDGE_EXISTS_STATE, EDGE_NOT_EXISTS_STATE } from "../src/constants";
+
+export { EDGE_NOT_EXISTS_STATE, EDGE_EXISTS_STATE };

package/lib/data-structures.ts

@@ -0,0 +1,23 @@
+import Queue from "../src/data-structures/Queue/Queue";
+import Stack from "../src/data-structures/Stack/Stack";
+import UndirectedGraph from "../src/data-structures/Graph/UndirectedGraph";
+import DirectedGraph from "../src/data-structures/Graph/DirectedGraph";
+import BinarySearchTree from "../src/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
+import RandBinarySearchTree from "../src/data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
+import DoubleLinkedList from "../src/data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
+import SingleLinkedList from "../src/data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
+import LoopedArray from "../src/data-structures/LoopedArray/LoopedArray";
+import HashTable from "../src/data-structures/HashTable/HashTable";
+
+export {
+  Stack,
+  Queue,
+  SingleLinkedList,
+  DoubleLinkedList,
+  RandBinarySearchTree,
+  BinarySearchTree,
+  DirectedGraph,
+  UndirectedGraph,
+  LoopedArray,
+  HashTable,
+};

package/lib/helpers.ts

@@ -0,0 +1,13 @@
+import { generateRandomGraph } from "../src/data-structures/Graph/demo/generateRandomGraph";
+import { createLinkedList } from "../src/helpers/createLinkedList";
+import { createBinaryTree } from "../src/helpers/createBinaryTree";
+import { createGraph } from "../src/helpers/createGraph";
+import { createGraphFromMatrix } from "../src/helpers/createGraphFromMatrix";
+
+export {
+  createGraph,
+  createGraphFromMatrix,
+  createBinaryTree,
+  createLinkedList,
+  generateRandomGraph,
+};

package/lib/sorts.ts

@@ -0,0 +1,7 @@
+import { bubbleSort } from "../src/algorithms/sorts/bubble-sort";
+import { selectSort } from "../src/algorithms/sorts/select-sort";
+import { mergeSort } from "../src/algorithms/sorts/merge-sort";
+import { insertionSort } from "../src/algorithms/sorts/insertion-sort";
+import { quickSort } from "../src/algorithms/sorts/quick-sort";
+
+export { bubbleSort, insertionSort, mergeSort, selectSort, quickSort };

package/lib/types.ts

@@ -0,0 +1,53 @@
+import { ArrayMatrix } from "../src/types/ArrayMatrix";
+import { EnumTreeTraversalType } from "../src/types/EnumTreeTraversalType";
+import { EnumBinarySearchTreeType } from "../src/types/EnumBinarySearchTreeType";
+import { EnumGraphTraversalType } from "../src/types/EnumGraphTraversalType";
+import { EnumGraphType } from "../src/types/EnumGraphType";
+import { EnumLinkedListType } from "../src/types/EnumLinkedListType";
+import { EnumRandomGenerationFormat } from "../src/types/EnumRandomGenerationFormat";
+import { EnumSortType } from "../src/types/EnumSortType";
+import { FnSort } from "../src/types/FnSort";
+import { FnCompareTwo } from "../src/types/FnCompareTwo";
+import { FnToMemoize } from "../src/types/FnToMemoize";
+import IArrayFacade from "../src/types/IArrayFacade";
+import IBiDirectIterator from "../src/types/IBiDirectIterator";
+import IBiDirectIterable from "../src/types/IBiDirectIterable";
+import IIterable from "../src/types/IIterable";
+import IIterator from "../src/types/IIterator";
+import IBinaryTree from "../src/types/IBinaryTree";
+import IConvertableToArray from "../src/types/IConvertableToArray";
+import IGraph from "../src/types/IGraph";
+import IGraphCreator from "../src/types/IGraphCreator";
+import IGraphIterationStrategy from "../src/types/IGraphIterationStrategy";
+import IGraphIterator from "../src/types/IGraphIterator";
+import ILinearStorage from "../src/types/ILinearStorage";
+import ILinearStorageRA from "../src/types/ILinearStorageRA";
+import ILinkedList from "../src/types/ILinkedList";
+
+export {
+  IGraph,
+  IGraphIterator,
+  IGraphIterationStrategy,
+  IIterator,
+  IIterable,
+  IGraphCreator,
+  IBiDirectIterable,
+  IBiDirectIterator,
+  EnumGraphType,
+  EnumSortType,
+  FnSort,
+  EnumGraphTraversalType,
+  EnumTreeTraversalType,
+  EnumBinarySearchTreeType,
+  IBinaryTree,
+  EnumLinkedListType,
+  ILinkedList,
+  ILinearStorage,
+  ILinearStorageRA,
+  IArrayFacade,
+  IConvertableToArray,
+  ArrayMatrix,
+  FnCompareTwo,
+  EnumRandomGenerationFormat,
+  FnToMemoize,
+};

package/{src/exports → lib}/utils.ts

@@ -1,4 +1,4 @@
-import { memoize } from "../algorithms/memoize";
+import { memoize } from "../src/algorithms/memoize";
 import {
   getMinIndex,
   getMinIndexFromIndex,
@@ -7,7 +7,7 @@ import {
   roundNumber,
   swapArrayItems,
   perfAsync,
-} from "../utils";
+} from "../src/utils";
 
 export {
   perf,

package/package.json

@@ -4,7 +4,7 @@
     "test": "jest",
     "dev": "nodemon",
     "build": "rimraf ./build && tsc",
-    "start": "npm run build && node build/main.js",
+    "start": "npm run build && node --experimental-specifier-resolution=node .build/index.js",
     "lint": "yarn eslint . --ext .ts",
     "lint:fix": "yarn eslint --fix .  --ext .ts"
   },
@@ -26,9 +26,11 @@
     "prettier": "^2.1.2",
     "rimraf": "^3.0.2",
     "ts-jest": "^26.4.1",
-    "ts-node": "^8.10.2",
+    "ts-node": "^10.7.0",
+    "ts-node-esm": "^0.0.6",
     "typescript": "^4.0.3"
   },
   "dependencies": {},
-  "version": "1.1.1"
+  "version": "1.1.2",
+  "type": "module"
 }

package/src/demo/demo.hashtable.ts

@@ -1,28 +1,28 @@
-import HashTable from "../data-structures/HashTable/HashTable";
-
-export const demoHashtable = (): void => {
-  const hashTable = new HashTable<number>(15);
-
-  // emulate 66% load
-  for (let i = 0; i < 10; i++) {
-    hashTable.set(`key${i * 2}`, i * 2);
-  }
-  console.log(hashTable);
-
-  for (let i = 10; i < 15; i++) {
-    hashTable.set(`key${i * 2}`, i * 2);
-  }
-  console.log(hashTable);
-  console.log("\n length:", hashTable.length());
-
-  hashTable.set("key4", 10000);
-  console.log("\n", hashTable.get("key4"));
-  hashTable.delete("key4");
-  console.log("\n has key4:", hashTable.has("key4"));
-  hashTable.set("key4", 20000);
-  console.log("\n has key4:", hashTable.has("key4"));
-  console.log("\n key4 value:", hashTable.get("key4"));
-  console.log("\n", hashTable);
-  hashTable.clear();
-  console.log("\n", hashTable);
-};
+import HashTable from "../data-structures/HashTable/HashTable";
+
+export const demoHashtable = (): void => {
+  const hashTable = new HashTable<number>(15);
+
+  // emulate 66% load
+  for (let i = 0; i < 10; i++) {
+    hashTable.set(`key${i * 2}`, i * 2);
+  }
+  console.log(hashTable);
+
+  for (let i = 10; i < 15; i++) {
+    hashTable.set(`key${i * 2}`, i * 2);
+  }
+  console.log(hashTable);
+  console.log("\n length:", hashTable.length());
+
+  hashTable.set("key4", 10000);
+  console.log("\n", hashTable.get("key4"));
+  hashTable.delete("key4");
+  console.log("\n has key4:", hashTable.has("key4"));
+  hashTable.set("key4", 20000);
+  console.log("\n has key4:", hashTable.has("key4"));
+  console.log("\n key4 value:", hashTable.get("key4"));
+  console.log("\n", hashTable);
+  hashTable.clear();
+  console.log("\n", hashTable);
+};

package/src/demo/performance/bst-compare.ts

@@ -1,9 +1,6 @@
 import RandBinarySearchTree from "../../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
 import BinarySearchTree from "../../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import { EnumTreeTraversalType } from "../../types/EnumTreeTraversalType";
 import IBinaryTree from "../../types/IBinaryTree";
-// eslint-disable-next-line @typescript-eslint/no-var-requires
-const util = require("util");
 
 const logTree = <T>(tree: IBinaryTree<T>) => {
   console.log("HEIGHT");
@@ -22,7 +19,7 @@ export const bstCompare = (): void => {
 
   const arraySrc = Array.from(Array(1000).keys());
 
-  arraySrc.forEach((num, index) => {
+  arraySrc.forEach((num) => {
     bstLeaf.insert(num);
     bstRand.insert(num);
   });

package/src/index.ts

@@ -1,42 +1,44 @@
-/**
- * Write your code here
- */
-// import { demoHashtable } from "./demo/demo.hashtable";
-// import { demoBst, demoBstObjects } from "./demo/demo.bst";
-// import { bstCompare } from "./demo/performance/bst-compare";
-// import { demoStack } from "./demo/demo.stack";
-// import { perfQueue, perfStack } from "./demo/performance/ds-compare";
-// import { demoLinkedList } from "./demo/demo.linked-list";
-// import { demoQueue } from "./demo/demo.queue";
-// import {
-//   demoDirectedGraph,
-//   demoGraphGenerated,
-//   demoUndirectedGraph,
-// } from "./demo/demo.graph";
-// import { demoLoopedArray } from "./demo/demo.looped-array";
-// import { compareAllSortTypes } from "./demo/performance/sort-compare";
-//
-// demoLinkedList();
-// // console.log("================================================================");
-// demoLoopedArray();
-// // console.log("================================================================");
-// demoQueue();
-// // console.log("================================================================");
-// demoStack();
-// // console.log("================================================================");
-// demoUndirectedGraph();
-// // console.log("================================================================");
-// demoDirectedGraph();
-// // console.log("================================================================");
-// demoGraphGenerated();
-// // console.log("================================================================");
-// compareAllSortTypes();
-// // console.log("===========================================================");
-// perfQueue();
-// // console.log("===========================================================");
-// perfStack();
-// // console.log("===========================================================");
-// demoBst();
-// // console.log("===========================================================");
-// bstCompare();
-// demoHashtable();
+/**
+ * Write your code here
+ */
+
+// import { demoHashtable } from "./demo/demo.hashtable";
+// import { demoBst, demoBstObjects } from "./demo/demo.bst";
+// import { bstCompare } from "./demo/performance/bst-compare";
+// import { demoStack } from "./demo/demo.stack";
+// import { perfQueue, perfStack } from "./demo/performance/ds-compare";
+// import { demoLinkedList } from "./demo/demo.linked-list";
+// import { demoQueue } from "./demo/demo.queue";
+// import {
+//   demoDirectedGraph,
+//   demoGraphGenerated,
+//   demoUndirectedGraph,
+// } from "./demo/demo.graph";
+// import { demoLoopedArray } from "./demo/demo.looped-array";
+// import { compareAllSortTypes } from "./demo/performance/sort-compare";
+//
+// demoLinkedList();
+// // console.log("================================================================");
+// demoLoopedArray();
+// // console.log("================================================================");
+// demoQueue();
+// // console.log("================================================================");
+// demoStack();
+// // console.log("================================================================");
+// demoUndirectedGraph();
+// // console.log("================================================================");
+// demoDirectedGraph();
+// // console.log("================================================================");
+// demoGraphGenerated();
+// // console.log("================================================================");
+// compareAllSortTypes();
+// // console.log("===========================================================");
+// perfQueue();
+// // console.log("===========================================================");
+// perfStack();
+// // console.log("===========================================================");
+// demoBst();
+// // console.log("===========================================================");
+// bstCompare();
+// // console.log("===========================================================");
+// demoHashtable();

package/.eslintrc.js

@@ -1,14 +0,0 @@
-module.exports = {
-  root: true,
-  parser: "@typescript-eslint/parser",
-  plugins: ["@typescript-eslint", "prettier"],
-  extends: [
-    "eslint:recommended",
-    "plugin:@typescript-eslint/recommended",
-    "plugin:prettier/recommended",
-    "prettier/@typescript-eslint",
-  ],
-  env: {
-    node: true,
-  },
-};

package/jest.config.js

@@ -1,4 +0,0 @@
-module.exports = {
-  preset: "ts-jest",
-  testEnvironment: "node",
-};

package/nodemon.json

@@ -1,6 +0,0 @@
-{
-  "watch": ["src"],
-  "ext": ".ts,.js",
-  "ignore": [],
-  "exec": "ts-node ./src/index.ts"
-}

package/src/exports/algotirhms.ts

@@ -1,35 +0,0 @@
-import { factorial, memoizedFactorial } from "../algorithms/factorial";
-import { fibonacci, memoizedFibonacci } from "../algorithms/fibonacci";
-import { binarySearch } from "../algorithms/binary-search";
-import { transposeMatrix } from "../algorithms/transpose-matrix";
-import { transposeDirectedGraph } from "../data-structures/Graph/transposing/transposeDirectedGraph";
-import BFSIterationStrategy from "../data-structures/Graph/strategy/BFSIterationStrategy";
-import DFSIterationStrategy from "../data-structures/Graph/strategy/DFSIterationStrategy";
-import DijkstraIterationStrategy from "../data-structures/Graph/strategy/DijkstraIterationStrategy";
-import GraphIteratorBFS from "../data-structures/Graph/iterator/GraphIteratorBFS";
-import GraphIteratorDFS from "../data-structures/Graph/iterator/GraphIteratorDFS";
-import GraphIteratorDijkstra from "../data-structures/Graph/iterator/GraphIteratorDijkstra";
-import { hasPath } from "../data-structures/Graph/searching/hasPath";
-import { shortestPath } from "../data-structures/Graph/searching/shortestPath";
-import { presenterAdjacencyMatrix } from "../data-structures/Graph/presenter/presenterAdjacencyMatrix";
-import { presenterAdjacencyLists } from "../data-structures/Graph/presenter/presenterAdjacencyLists";
-
-export {
-  binarySearch,
-  factorial,
-  memoizedFactorial,
-  memoizedFibonacci,
-  fibonacci,
-  transposeMatrix,
-  GraphIteratorDFS,
-  presenterAdjacencyLists,
-  presenterAdjacencyMatrix,
-  hasPath,
-  shortestPath,
-  DijkstraIterationStrategy,
-  DFSIterationStrategy,
-  BFSIterationStrategy,
-  GraphIteratorBFS,
-  GraphIteratorDijkstra,
-  transposeDirectedGraph,
-};

package/src/exports/constants.ts

@@ -1,3 +0,0 @@
-import { EDGE_EXISTS_STATE, EDGE_NOT_EXISTS_STATE } from "../constants";
-
-export { EDGE_NOT_EXISTS_STATE, EDGE_EXISTS_STATE };

package/src/exports/helpers.ts

@@ -1,13 +0,0 @@
-import { generateRandomGraph } from "../data-structures/Graph/demo/generateRandomGraph";
-import { createLinkedList } from "../helpers/createLinkedList";
-import { createBinaryTree } from "../helpers/createBinaryTree";
-import { createGraph } from "../helpers/createGraph";
-import { createGraphFromMatrix } from "../helpers/createGraphFromMatrix";
-
-export {
-  createGraph,
-  createGraphFromMatrix,
-  createBinaryTree,
-  createLinkedList,
-  generateRandomGraph,
-};

package/src/exports/main.ts

@@ -1,21 +0,0 @@
-import Queue from "../data-structures/Queue/Queue";
-import Stack from "../data-structures/Stack/Stack";
-import UndirectedGraph from "../data-structures/Graph/UndirectedGraph";
-import DirectedGraph from "../data-structures/Graph/DirectedGraph";
-import BinarySearchTree from "../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import RandBinarySearchTree from "../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
-import DoubleLinkedList from "../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
-import SingleLinkedList from "../data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
-import LoopedArray from "../data-structures/LoopedArray/LoopedArray";
-
-export {
-  Stack,
-  Queue,
-  SingleLinkedList,
-  DoubleLinkedList,
-  RandBinarySearchTree,
-  BinarySearchTree,
-  DirectedGraph,
-  UndirectedGraph,
-  LoopedArray,
-};

package/src/exports/sorts.ts

@@ -1,7 +0,0 @@
-import { bubbleSort } from "../algorithms/sorts/bubble-sort";
-import { selectSort } from "../algorithms/sorts/select-sort";
-import { mergeSort } from "../algorithms/sorts/merge-sort";
-import { insertionSort } from "../algorithms/sorts/insertion-sort";
-import { quickSort } from "../algorithms/sorts/quick-sort";
-
-export { bubbleSort, insertionSort, mergeSort, selectSort, quickSort };

package/src/exports/types.ts

@@ -1,53 +0,0 @@
-import { ArrayMatrix } from "../types/ArrayMatrix";
-import { EnumTreeTraversalType } from "../types/EnumTreeTraversalType";
-import { EnumBinarySearchTreeType } from "../types/EnumBinarySearchTreeType";
-import { EnumGraphTraversalType } from "../types/EnumGraphTraversalType";
-import { EnumGraphType } from "../types/EnumGraphType";
-import { EnumLinkedListType } from "../types/EnumLinkedListType";
-import { EnumRandomGenerationFormat } from "../types/EnumRandomGenerationFormat";
-import { EnumSortType } from "../types/EnumSortType";
-import { FnSort } from "../types/FnSort";
-import { FnCompareTwo } from "../types/FnCompareTwo";
-import { FnToMemoize } from "../types/FnToMemoize";
-import IArrayFacade from "../types/IArrayFacade";
-import IBiDirectIterator from "../types/IBiDirectIterator";
-import IBiDirectIterable from "../types/IBiDirectIterable";
-import IIterable from "../types/IIterable";
-import IIterator from "../types/IIterator";
-import IBinaryTree from "../types/IBinaryTree";
-import IConvertableToArray from "../types/IConvertableToArray";
-import IGraph from "../types/IGraph";
-import IGraphCreator from "../types/IGraphCreator";
-import IGraphIterationStrategy from "../types/IGraphIterationStrategy";
-import IGraphIterator from "../types/IGraphIterator";
-import ILinearStorage from "../types/ILinearStorage";
-import ILinearStorageRA from "../types/ILinearStorageRA";
-import ILinkedList from "../types/ILinkedList";
-
-export {
-  IGraph,
-  IGraphIterator,
-  IGraphIterationStrategy,
-  IIterator,
-  IIterable,
-  IGraphCreator,
-  IBiDirectIterable,
-  IBiDirectIterator,
-  EnumGraphType,
-  EnumSortType,
-  FnSort,
-  EnumGraphTraversalType,
-  EnumTreeTraversalType,
-  EnumBinarySearchTreeType,
-  IBinaryTree,
-  EnumLinkedListType,
-  ILinkedList,
-  ILinearStorage,
-  ILinearStorageRA,
-  IArrayFacade,
-  IConvertableToArray,
-  ArrayMatrix,
-  FnCompareTwo,
-  EnumRandomGenerationFormat,
-  FnToMemoize,
-};

package/test/unit/algorithms/binary-search.test.ts

@@ -1,25 +0,0 @@
-import { binarySearch } from "../../../src/algorithms/binary-search";
-
-describe("Binary search", () => {
-  it("should find in positive 100 elements", () => {
-    const arr: Array<number> = [];
-    for (let i = 0; i < 100; i++) arr.push(i + 1);
-    const foundElement = binarySearch(arr, 97);
-
-    expect(foundElement).toBe(96);
-  });
-
-  it("should find in negative 100 elements", () => {
-    const arr: Array<number> = [];
-    for (let i = 0; i < 100; i++) arr.push(-100 + i - 1);
-    const foundElement = binarySearch(arr, -97);
-
-    expect(foundElement).toBe(4);
-  });
-
-  it("should return null in empty list", () => {
-    const arr: Array<number> = [];
-
-    expect(binarySearch(arr, 10)).toBeNull();
-  });
-});