@raikuxq/alg-ds 1.1.2 → 1.1.5

package/src/demo/demo.linked-list.ts

@@ -1,78 +0,0 @@
-import DoubleLinkedList from "../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
-import ILinkedList from "../types/ILinkedList";
-
-export const demoLinkedList = (): void => {
-  console.log("\nEmpty linked list created");
-  const list: ILinkedList<string> = new DoubleLinkedList<string>();
-
-  list.push("John");
-  list.push("Mary");
-  console.log("\nJohn and Mary were added");
-  console.log(list.getAsArray());
-
-  list.push("Kate");
-  console.log("\nKate was added to end");
-  console.log(list.getAsArray());
-
-  console.log("\nChecking is list has John: ");
-  console.log(list.has("John"));
-
-  list.shift();
-  console.log("\nDeleting first element... ");
-  console.log("\nChecking is list has John: ");
-  console.log(list.has("John"));
-  console.log(list.getAsArray());
-
-  list.pop();
-  console.log("\nDeleting last element... ");
-  console.log("\nCheck is list has Kate: ");
-  console.log(list.has("Kate"));
-  console.log(list.getAsArray());
-
-  list.push("Bob");
-  list.push("Elon");
-  console.log("\nAdding Bob и Elon: ");
-  console.log(list.getAsArray());
-
-  list.unshift("Dan");
-  console.log("\nAdding Dan to start: ");
-  console.log(list.getAsArray());
-
-  list.deleteFromIndex(2);
-  console.log("\nDelete item by index 2: ");
-  console.log(list.getAsArray());
-
-  list.pushFromIndex("Sam", 2);
-  console.log("\nAdding Sam by index 2: ");
-  console.log(list.getAsArray());
-
-  console.log("\nCheck if head and tail correctly linked with each other");
-  console.log(list);
-
-  console.log("\nArray length is: ");
-  console.log(list.length());
-
-  console.log("\nPeek last element: ");
-  console.log(list.peek());
-
-  console.log("\nPeek first element: ");
-  console.log(list.peekFromStart());
-
-  console.log("\nPeek by index 2: ");
-  console.log(list.peekByIndex(2));
-
-  list.reverse();
-  console.log("\nReversing list... ");
-  console.log("\nReversed list: ");
-  console.log(list.getAsArray());
-
-  console.log("\nCheck if head and tail correctly linked with each other");
-  console.log(list);
-
-  list.clear();
-  console.log("\nClear list... ");
-
-  console.log("\nCheck is list empty:");
-  console.log(list.isEmpty());
-  console.log(list.getAsArray());
-};

package/src/demo/demo.looped-array.ts

@@ -1,104 +0,0 @@
-import LoopedArray from "../data-structures/LoopedArray/LoopedArray";
-import IArrayFacade from "../types/IArrayFacade";
-
-export const demoLoopedArray = (): void => {
-  console.log("LoopedArray instance was created with capacity = 4");
-  const loopedArray: IArrayFacade<string> = new LoopedArray<string>(4);
-
-  loopedArray.push("John");
-  loopedArray.push("Mary");
-  console.log("\nJohn and Mary were added");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("Kate");
-  console.log("\nKate was added to end");
-  console.log(loopedArray.getAsArray());
-
-  console.log("\nChecking is array has John: ");
-  console.log(loopedArray.has("John"));
-
-  loopedArray.shift();
-  console.log("\nDeleting first element... ");
-  console.log("\nChecking is array has John: ");
-  console.log(loopedArray.has("John"));
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.pop();
-  console.log("\nDeleting last element... ");
-  console.log("\nCheck is array has Kate: ");
-  console.log(loopedArray.has("Kate"));
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("Bob");
-  loopedArray.push("Elon");
-  console.log("\nAdding Bob и Elon: ");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.unshift("Dan");
-  console.log("\nAdding Dan to start: ");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.deleteFromIndex(2);
-  console.log("\nDelete item by index 2: ");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.pushFromIndex("Sam", 2);
-  console.log("\nAdding Sam by index 2: ");
-  console.log(loopedArray.getAsArray());
-
-  console.log("\nArray length is: ");
-  console.log(loopedArray.length());
-
-  console.log("\nPeek last element: ");
-  console.log(loopedArray.peek());
-
-  console.log("\nPeek first element: ");
-  console.log(loopedArray.peekFromStart());
-
-  console.log("\nPeek by index 2: ");
-  console.log(loopedArray.peekByIndex(2));
-
-  loopedArray.reverse();
-  console.log("\nReversing array... ");
-  console.log("\nReversed array: ");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("OW_END_1");
-  console.log("\nAdding to end when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("OW_END_2");
-  console.log("\nAdding to end when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("OW_END_3");
-  console.log("\nAdding to end when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.push("OW_END_4");
-  console.log("\nAdding to end when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.unshift("OW_START_1");
-  console.log("\nAdding to start when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.unshift("OW_START_2");
-  console.log("\nAdding to start when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.unshift("OW_START_3");
-  console.log("\nAdding to start when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.unshift("OW_START_4");
-  console.log("\nAdding to start when array is full");
-  console.log(loopedArray.getAsArray());
-
-  loopedArray.clear();
-  console.log("\nClear array... ");
-
-  console.log("\nCheck is array empty:");
-  console.log(loopedArray.isEmpty());
-  console.log(loopedArray.getAsArray());
-};

package/src/demo/demo.queue.ts

@@ -1,40 +0,0 @@
-import Queue from "../data-structures/Queue/Queue";
-import ILinearStorage from "../types/ILinearStorage";
-
-export const demoQueue = (): void => {
-  console.log("\nEmpty queue created");
-  const queue: ILinearStorage<string> = new Queue<string>();
-
-  queue.push("John");
-  queue.push("Mary");
-  console.log("\nJohn and Mary were added");
-  console.log("\n*John > Mary*");
-  console.log("\nQueue peek element:");
-  console.log(queue.peek());
-
-  queue.push("Kate");
-  console.log("\nKate was added to end");
-  console.log("\n*John > Mary > Kate*");
-  console.log("\nQueue peek element:");
-  console.log(queue.peek());
-
-  console.log("\nChecking is queue has John: ");
-  console.log(queue.has("John"));
-
-  queue.pop();
-  console.log("\nPop element... ");
-  console.log("\nCheck is queue has John: ");
-  console.log(queue.has("John"));
-  console.log("\n*Mary > Kate*");
-  console.log("\nQueue peek element:");
-  console.log(queue.peek());
-
-  console.log("\nArray length is: ");
-  console.log(queue.length());
-
-  queue.clear();
-  console.log("\nClear queue... ");
-
-  console.log("\nCheck is queue empty:");
-  console.log(queue.isEmpty());
-};

package/src/demo/demo.stack.ts

@@ -1,40 +0,0 @@
-import ILinearStorage from "../types/ILinearStorage";
-import Stack from "../data-structures/Stack/Stack";
-
-export const demoStack = (): void => {
-  console.log("\nEmpty stack created");
-  const stack: ILinearStorage<string> = new Stack<string>();
-
-  stack.push("John");
-  stack.push("Mary");
-  console.log("\nJohn and Mary were added");
-  console.log("\n*John > Mary*");
-  console.log("\nStack peek element:");
-  console.log(stack.peek());
-
-  stack.push("Kate");
-  console.log("\nKate was added to end");
-  console.log("\n*John > Mary > Kate*");
-  console.log("\nStack peek element:");
-  console.log(stack.peek());
-
-  console.log("\nChecking is stack has John: ");
-  console.log(stack.has("John"));
-
-  stack.pop();
-  console.log("\nPop element... ");
-  console.log("\nCheck is stack has Kate: ");
-  console.log(stack.has("Kate"));
-  console.log("\n*John > Mary*");
-  console.log("\nStack peek element:");
-  console.log(stack.peek());
-
-  console.log("\nArray length is: ");
-  console.log(stack.length());
-
-  stack.clear();
-  console.log("\nClear stack... ");
-
-  console.log("\nCheck is stack empty:");
-  console.log(stack.isEmpty());
-};

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

@@ -1,35 +0,0 @@
-import RandBinarySearchTree from "../../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
-import BinarySearchTree from "../../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import IBinaryTree from "../../types/IBinaryTree";
-
-const logTree = <T>(tree: IBinaryTree<T>) => {
-  console.log("HEIGHT");
-  console.log(tree.height());
-  console.log("LENGTH");
-  console.log(tree.length());
-  console.log("MAX");
-  console.log(tree.max());
-  console.log("MIN");
-  console.log(tree.min());
-};
-
-export const bstCompare = (): void => {
-  const bstLeaf = new BinarySearchTree<number>();
-  const bstRand = new RandBinarySearchTree<number>();
-
-  const arraySrc = Array.from(Array(1000).keys());
-
-  arraySrc.forEach((num) => {
-    bstLeaf.insert(num);
-    bstRand.insert(num);
-  });
-
-  console.log(
-    "***************************LEAF TREE*****************************"
-  );
-  logTree<number>(bstLeaf);
-  console.log(
-    "\n\n\n***************************RAND TREE*****************************"
-  );
-  logTree<number>(bstRand);
-};

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

@@ -1,58 +0,0 @@
-import Queue from "../../data-structures/Queue/Queue";
-import Stack from "../../data-structures/Stack/Stack";
-import ILinearStorage from "../../types/ILinearStorage";
-import { perf, roundNumber } from "../../utils";
-
-export const pushToLinearDS = (
-  linearDS: ILinearStorage<string>,
-  elementsCount: number,
-  item: string
-): void => {
-  for (let i = 0; i < elementsCount; i++) {
-    linearDS.push(`${item}_${i}`);
-  }
-};
-
-export const perfLinearDS = (linearDS: ILinearStorage<string>): void => {
-  let elementsCount = 50;
-
-  while (elementsCount <= 5000000) {
-    pushToLinearDS(linearDS, elementsCount, "qwerty");
-
-    const perfPush = perf(() => {
-      linearDS.push("qwerty");
-    });
-    const perfPeek = perf(() => {
-      linearDS.peek();
-    });
-
-    const perfPop = perf(() => {
-      linearDS.pop();
-    });
-    const perfHas = perf(() => {
-      linearDS.has(`qwerty_${elementsCount - 10}`);
-    });
-
-    console.log(`N: ${elementsCount} push: ${roundNumber(perfPush)}ms`);
-    console.log(`N: ${elementsCount} peek: ${roundNumber(perfPeek)}ms`);
-    console.log(`N: ${elementsCount} pop: ${roundNumber(perfPop)}ms`);
-    console.log(`N: ${elementsCount} has: ${roundNumber(perfHas)}ms`);
-    console.log("=========================");
-
-    elementsCount *= 10;
-  }
-};
-
-export const perfQueue = (): void => {
-  console.log(`QUEUE PERFORMANCE TEST:`);
-  const queue: ILinearStorage<string> = new Queue<string>();
-
-  perfLinearDS(queue);
-};
-
-export const perfStack = (): void => {
-  console.log(`STACK PERFORMANCE TEST:`);
-  const stack: ILinearStorage<string> = new Stack<string>();
-
-  perfLinearDS(stack);
-};

package/src/demo/performance/hash-table.compare.ts

@@ -1,40 +0,0 @@
-import { perf, roundNumber } from "../../utils";
-import IKeyValueStorage from "../../types/IKeyValueStorage";
-import HashTable from "../../data-structures/HashTable/HashTable";
-
-export const pushToStorage = (
-  linearDS: IKeyValueStorage<number>,
-  elementsCount: number
-): void => {
-  for (let i = 0; i < elementsCount; i++) {
-    linearDS.set(`key${i}`, i);
-  }
-};
-
-export const perfHashTable = (): void => {
-  console.log(`HASHTABLE PERFORMANCE TEST:`);
-  const hashTable: IKeyValueStorage<number> = new HashTable<number>();
-  let elementsCount = 50;
-
-  while (elementsCount <= 5000000) {
-    pushToStorage(hashTable, elementsCount);
-
-    const perfSet = perf(() => {
-      hashTable.set(`key${elementsCount}`, elementsCount);
-    });
-    const perfGet = perf(() => {
-      hashTable.get(`key${elementsCount}`);
-    });
-
-    const perfHas = perf(() => {
-      hashTable.has(`key${elementsCount - 10}`);
-    });
-
-    console.log(`N: ${elementsCount} set: ${roundNumber(perfSet)}ms`);
-    console.log(`N: ${elementsCount} get: ${roundNumber(perfGet)}ms`);
-    console.log(`N: ${elementsCount} has: ${roundNumber(perfHas)}ms`);
-    console.log("=========================");
-
-    elementsCount *= 10;
-  }
-};

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

@@ -1,60 +0,0 @@
-import { FnSort } from "../../types/FnSort";
-import { mergeSort } from "../../algorithms/sorts/merge-sort";
-import { insertionSort } from "../../algorithms/sorts/insertion-sort";
-import { bubbleSort } from "../../algorithms/sorts/bubble-sort";
-import { quickSort } from "../../algorithms/sorts/quick-sort";
-import { selectSort } from "../../algorithms/sorts/select-sort";
-import { perf } from "../../utils";
-
-export const randomizeArray = (length: number, max: number): Array<number> =>
-  new Array(length).fill(0).map(() => Math.round(Math.random() * max));
-
-export const sortCompare = (
-  sortFn: FnSort,
-  n: number,
-  callsNumber: number
-): void => {
-  let totalTime = 0;
-
-  for (let i = 0; i < callsNumber; i++) {
-    const generatedArr = randomizeArray(n, 1000);
-    const perfResult = perf(() => {
-      sortFn(generatedArr);
-    });
-    totalTime += perfResult;
-  }
-
-  const averageTime = totalTime / callsNumber;
-
-  console.log(`N: ${n} = ${averageTime}ms`);
-};
-
-export const sortCompareRunner = (
-  sortFn: FnSort,
-  callsNumber: number
-): void => {
-  sortCompare(sortFn, 5, callsNumber);
-  sortCompare(sortFn, 50, callsNumber);
-  sortCompare(sortFn, 500, callsNumber);
-  sortCompare(sortFn, 5000, callsNumber);
-  sortCompare(sortFn, 50000, callsNumber);
-};
-
-export const compareAllSortTypes = (): void => {
-  const callsNumber = 10;
-
-  console.log(`MERGE SORT:`);
-  sortCompareRunner(mergeSort, callsNumber);
-
-  console.log(`QUICK SORT:`);
-  sortCompareRunner(quickSort, callsNumber);
-
-  console.log(`SELECTION SORT:`);
-  sortCompareRunner(selectSort, callsNumber);
-
-  console.log(`BUBBLE SORT:`);
-  sortCompareRunner(bubbleSort, callsNumber);
-
-  console.log(`INSERTION SORT:`);
-  sortCompareRunner(insertionSort, callsNumber);
-};

package/src/helpers/createBinaryTree.ts

@@ -1,24 +0,0 @@
-import { EnumBinarySearchTreeType } from "../types/EnumBinarySearchTreeType";
-import BinarySearchTree from "../data-structures/BinaryTree/BinarySearchTree/BinarySearchTree";
-import RandBinarySearchTree from "../data-structures/BinaryTree/RandBinarySearchTree/RandBinarySearchTree";
-import IBinaryTree from "../types/IBinaryTree";
-
-/**
- * Returns binary tree by type
- */
-export const createBinaryTree = <T>(
-  type: EnumBinarySearchTreeType
-): IBinaryTree<T> => {
-  let binaryTree: IBinaryTree<T>;
-
-  switch (type) {
-    case EnumBinarySearchTreeType.BST:
-      binaryTree = new BinarySearchTree();
-      break;
-    case EnumBinarySearchTreeType.RANDOMIZED_BST:
-      binaryTree = new RandBinarySearchTree();
-      break;
-  }
-
-  return binaryTree;
-};

package/src/helpers/createGraph.ts

@@ -1,24 +0,0 @@
-import IGraph from "../types/IGraph";
-import DirectedGraph from "../data-structures/Graph/DirectedGraph";
-import UndirectedGraph from "../data-structures/Graph/UndirectedGraph";
-import { EnumGraphType } from "../types/EnumGraphType";
-
-/**
- * Returns graph by type
- */
-export const createGraph = <T>(type: EnumGraphType): IGraph<T> => {
-  let graph: IGraph<T>;
-
-  switch (type) {
-    case EnumGraphType.Directed:
-      graph = new DirectedGraph();
-      break;
-    case EnumGraphType.Undirected:
-      graph = new UndirectedGraph();
-      break;
-    default:
-      throw new Error("Invalid graph type");
-  }
-
-  return graph;
-};

package/src/helpers/createGraphFromMatrix.ts

@@ -1,47 +0,0 @@
-import IGraph from "../types/IGraph";
-import { EnumGraphType } from "../types/EnumGraphType";
-import { ArrayMatrix } from "../types/ArrayMatrix";
-import { createGraph } from "./createGraph";
-import { EDGE_EXISTS_STATE } from "../constants";
-
-/**
- * Creates a graph from N*N matrix that contains 1 in case of edge exists or 0 in case it does not
- */
-export const createGraphFromMatrix = <T>(
-  matrix: ArrayMatrix,
-  fieldsList: Array<T>,
-  type: EnumGraphType
-): IGraph<T> => {
-  const graph: IGraph<T> = createGraph(type);
-
-  fieldsList.forEach((fieldName) => {
-    graph.addVertex(fieldName);
-  });
-
-  matrix.forEach((row: Array<number>, rowIndex: number) => {
-    row.forEach((col: number, colIndex: number) => {
-      const rowColState = matrix[rowIndex][colIndex];
-      const colRowState = matrix[colIndex][rowIndex];
-
-      if (type === EnumGraphType.Undirected) {
-        if (
-          rowColState === EDGE_EXISTS_STATE &&
-          colRowState === EDGE_EXISTS_STATE
-        ) {
-          graph.addEdge(fieldsList[rowIndex], fieldsList[colIndex]);
-        }
-      }
-
-      if (type === EnumGraphType.Directed) {
-        if (rowColState === EDGE_EXISTS_STATE) {
-          graph.addEdge(fieldsList[rowIndex], fieldsList[colIndex]);
-        }
-        if (colRowState === EDGE_EXISTS_STATE) {
-          graph.addEdge(fieldsList[colIndex], fieldsList[rowIndex]);
-        }
-      }
-    });
-  });
-
-  return graph;
-};

package/src/helpers/createLinkedList.ts

@@ -1,24 +0,0 @@
-import { EnumLinkedListType } from "../types/EnumLinkedListType";
-import DoubleLinkedList from "../data-structures/LinkedList/DoubleLinkedList/DoubleLinkedList";
-import SingleLinkedList from "../data-structures/LinkedList/SingleLinkedList/SingleLinkedList";
-import ILinkedList from "../types/ILinkedList";
-
-export const createLinkedList = <T>(
-  type: EnumLinkedListType,
-  capacity?: number
-): ILinkedList<T> => {
-  let linkedList: ILinkedList<T>;
-
-  switch (type) {
-    case EnumLinkedListType.DOUBLE:
-      linkedList = new DoubleLinkedList(capacity);
-      break;
-    case EnumLinkedListType.SINGLE:
-      linkedList = new SingleLinkedList(capacity);
-      break;
-    default:
-      throw new Error("Invalid list type");
-  }
-
-  return linkedList;
-};

package/src/index.ts

@@ -1,44 +0,0 @@
-/**
- * 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/src/types/ArrayMatrix.ts

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

package/src/types/EnumBinarySearchTreeType.ts

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

package/src/types/EnumGraphTraversalType.ts

@@ -1,5 +0,0 @@
-export enum EnumGraphTraversalType {
-  BFS = "Breadth first traversal",
-  DFS = "Deep first traversal",
-  DIJKSTRA = "Dijkstra traversal",
-}

package/src/types/EnumGraphType.ts

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

package/src/types/EnumLinkedListType.ts

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

package/src/types/EnumRandomGenerationFormat.ts

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

package/src/types/EnumSortType.ts

@@ -1,7 +0,0 @@
-export enum EnumSortType {
-  Quick = "Quick",
-  Merge = "Merge",
-  Selection = "Selection",
-  Bubble = "Bubble",
-  Insertion = "Insertion",
-}

package/src/types/EnumTreeTraversalType.ts

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