npm - @raikuxq/alg-ds - Versions diffs - 1.1.2 → 1.1.5 - Mend

@@ -1,65 +0,0 @@
-import { performance } from "perf_hooks";
-/**
- * Will find min value in the whole array and return its index
- */
-export const getMinIndex = (arr: Array<number>): number => {
-  return arr.reduce((minIndex, item, index): number => {
-    return item < arr[minIndex] ? index : minIndex;
-  }, 0);
-};
-/**
- * Will find min value in range between fromIndex and end of array
- */
-export const getMinIndexFromIndex = (
-  arr: Array<number>,
-  fromIndex: number
-): number => {
-  return fromIndex + getMinIndex(arr.slice(fromIndex));
-};
-/**
- * Will swap two items in array
- * @example swapArrayItems([2,3,5], 1, 2) -> [2,5,3]
- */
-export const swapArrayItems = <T>(
-  arr: Array<T>,
-  leftIndex: number,
-  rightIndex: number
-): void => {
-  if (leftIndex !== rightIndex) {
-    const temp: T = arr[leftIndex];
-    arr[leftIndex] = arr[rightIndex];
-    arr[rightIndex] = temp;
-  }
-};
-/**
- * Get random number in range
- */
-export const randomizeNumberInRange = (min: number, max: number): number =>
-  Math.floor(Math.random() * (max - min)) + min;
-/**
- * Round number to 3 digits after
- */
-export const roundNumber = (num: number): number =>
-  Math.round(num * 1000) / 1000;
-/**
- * Get time execution of function
- */
-export const perf = (fn: () => void): number => {
-  const perfStart = performance.now();
-  fn();
-  const perfEnd = performance.now();
-  return perfEnd - perfStart;
-};
-/**
- * Get time execution of function
- */
-export const perfAsync = async (fn: () => void): Promise<number> => {
-  return Promise.resolve(perf(fn));
-};

@@ -1,12 +0,0 @@
-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;
-}

@@ -1,13 +0,0 @@
-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>;
-}

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

@@ -1,16 +0,0 @@
-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;
-}

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

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

	@@ -1 +0,0 @@
1	- export type FnSort = (arg: Array<number>) => Array<number>;

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

@@ -1,13 +0,0 @@
-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;
-}

@@ -1,14 +0,0 @@
-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;
-}

@@ -1,8 +0,0 @@
-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;
-}

@@ -1,11 +0,0 @@
-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;
-}

@raikuxq/alg-ds 1.1.2 → 1.1.5