data-structure-typed 1.40.0-rc → 1.40.0

package/src/data-structures/binary-tree/b-tree.ts

@@ -1 +0,0 @@
-export class BTree {}

package/src/data-structures/binary-tree/splay-tree.ts

@@ -1 +0,0 @@
-export class SplayTree {}

package/src/data-structures/binary-tree/two-three-tree.ts

@@ -1 +0,0 @@
-export class TwoThreeTree {}

package/src/data-structures/hash/pair.ts

@@ -1 +0,0 @@
-export class Pair {}

package/src/interfaces/abstract-binary-tree.ts

@@ -1,8 +0,0 @@
-import {BinaryTreeNodeKey} from '../types';
-import {AbstractBinaryTreeNode} from '../data-structures';
-
-export interface IAbstractBinaryTreeNode<T, NEIGHBOR extends IAbstractBinaryTreeNode<T, NEIGHBOR>> {}
-
-export interface IAbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N>> {
-  createNode(key: BinaryTreeNodeKey, val?: N['val'], count?: number): N | null;
-}

package/src/interfaces/abstract-graph.ts

@@ -1,7 +0,0 @@
-import {VertexKey} from '../types';
-
-export interface IAbstractGraph<V, E> {
-  createVertex(key: VertexKey, val?: V): V;
-
-  createEdge(srcOrV1: VertexKey | string, destOrV2: VertexKey | string, weight?: number, val?: E): E;
-}

package/src/interfaces/avl-tree.ts

@@ -1,8 +0,0 @@
-import {AVLTreeNode} from '../data-structures';
-import {IBST, IBSTNode} from './bst';
-
-export interface IAVLTreeNode<T, NEIGHBOR extends IAVLTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {
-  height: number;
-}
-
-export interface IAVLTree<N extends AVLTreeNode<N['val'], N>> extends IBST<N> {}

package/src/interfaces/bst.ts

@@ -1,6 +0,0 @@
-import {BSTNode} from '../data-structures';
-import {IBinaryTree, IBinaryTreeNode} from './binary-tree';
-
-export interface IBSTNode<T, NEIGHBOR extends IBSTNode<T, NEIGHBOR>> extends IBinaryTreeNode<T, NEIGHBOR> {}
-
-export interface IBST<N extends BSTNode<N['val'], N>> extends IBinaryTree<N> {}

package/src/interfaces/directed-graph.ts

@@ -1,3 +0,0 @@
-import {IAbstractGraph} from './abstract-graph';
-
-export interface IDirectedGraph<V, E> extends IAbstractGraph<V, E> {}

package/src/interfaces/rb-tree.ts

@@ -1,6 +0,0 @@
-import {RBTreeNode} from '../data-structures';
-import {IBST, IBSTNode} from './bst';
-
-export interface IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {}
-
-export interface IRBTree<N extends RBTreeNode<N['val'], N>> extends IBST<N> {}

package/src/interfaces/tree-multiset.ts

@@ -1,7 +0,0 @@
-import {TreeMultisetNode} from '../data-structures';
-import {IAVLTree, IAVLTreeNode} from './avl-tree';
-
-export interface ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>>
-  extends IAVLTreeNode<T, NEIGHBOR> {}
-
-export interface ITreeMultiset<N extends TreeMultisetNode<N['val'], N>> extends IAVLTree<N> {}

package/src/interfaces/undirected-graph.ts

@@ -1,3 +0,0 @@
-import {IAbstractGraph} from './abstract-graph';
-
-export interface IUNDirectedGraph<V, E> extends IAbstractGraph<V, E> {}

package/src/types/data-structures/abstract-binary-tree.ts

@@ -1,49 +0,0 @@
-import {AbstractBinaryTreeNode} from '../../data-structures';
-
-/**
- * Enum representing different loop types.
- *
- * - `iterative`: Indicates the iterative loop type (with loops that use iterations).
- * - `recursive`: Indicates the recursive loop type (with loops that call themselves).
- */
-
-export enum LoopType {
-  ITERATIVE = 'ITERATIVE',
-  RECURSIVE = 'RECURSIVE'
-}
-
-export enum FamilyPosition {
-  ROOT = 'ROOT',
-  LEFT = 'LEFT',
-  RIGHT = 'RIGHT',
-  ROOT_LEFT = 'ROOT_LEFT',
-  ROOT_RIGHT = 'ROOT_RIGHT',
-  ISOLATED = 'ISOLATED',
-  MAL_NODE = 'MAL_NODE'
-}
-
-export type BinaryTreeNodePropertyName = 'key' | 'val';
-
-export type NodeOrPropertyName = 'node' | BinaryTreeNodePropertyName;
-
-export type DFSOrderPattern = 'in' | 'pre' | 'post';
-
-export type BinaryTreeNodeKey = number;
-
-export type BinaryTreeDeletedResult<N> = { deleted: N | null | undefined; needBalanced: N | null };
-
-export type AbstractBinaryTreeNodeProperty<N extends AbstractBinaryTreeNode<N['val'], N>> =
-  | N['val']
-  | N
-  | number
-  | BinaryTreeNodeKey;
-
-
-export type AbstractBinaryTreeNodeProperties<N extends AbstractBinaryTreeNode<N['val'], N>> =
-  AbstractBinaryTreeNodeProperty<N>[];
-
-export type AbstractBinaryTreeNodeNested<T> = AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
-
-export type AbstractBinaryTreeOptions = {
-  loopType?: LoopType
-};

package/src/types/data-structures/abstract-graph.ts

@@ -1,11 +0,0 @@
-export type VertexKey = string | number;
-export type EdgeKey = string;
-export type DijkstraResult<V> = {
-  distMap: Map<V, number>;
-  distPaths?: Map<V, V[]>;
-  preMap: Map<V, V | null>;
-  seen: Set<V>;
-  paths: V[][];
-  minDist: number;
-  minPath: V[];
-} | null;

package/src/types/data-structures/avl-tree.ts

@@ -1,5 +0,0 @@
-import {AVLTreeNode} from '../../data-structures';
-import {BSTOptions} from './bst';
-
-export type AVLTreeNodeNested<T> = AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-export type AVLTreeOptions = BSTOptions & {};

package/src/types/data-structures/binary-tree.ts

@@ -1,5 +0,0 @@
-import {BinaryTreeNode} from '../../data-structures/binary-tree';
-import {AbstractBinaryTreeOptions} from './abstract-binary-tree';
-
-export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-export type BinaryTreeOptions = AbstractBinaryTreeOptions & {}

package/src/types/data-structures/bst.ts

@@ -1,13 +0,0 @@
-import {BSTNode} from '../../data-structures/binary-tree';
-import type {BinaryTreeOptions} from './binary-tree';
-import {BinaryTreeNodeKey} from './abstract-binary-tree';
-
-export type BSTComparator = (a: BinaryTreeNodeKey, b: BinaryTreeNodeKey) => number;
-
-// prettier-ignore
-export type BSTNodeNested<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-export type BSTOptions = BinaryTreeOptions & {
-  comparator?: BSTComparator,
-}
-
-export enum CP {lt = 'lt', eq = 'eq', gt = 'gt'}

package/src/types/data-structures/heap.ts

@@ -1,5 +0,0 @@
-export type HeapOptions<T> = {
-  priorityExtractor?: (element: T) => number;
-  // TODO there is an idea that support chaining which is for conveniently using the data structure
-  // isChaining? : boolean
-};

package/src/types/data-structures/navigator.ts

@@ -1,13 +0,0 @@
-export type Direction = 'up' | 'right' | 'down' | 'left';
-export type Turning = {[key in Direction]: Direction};
-
-export type NavigatorParams<T = any> = {
-  matrix: T[][];
-  turning: Turning;
-  onMove: (cur: [number, number]) => void;
-  init: {
-    cur: [number, number];
-    charDir: Direction;
-    VISITED: T;
-  };
-};

package/src/types/data-structures/priority-queue.ts

@@ -1,9 +0,0 @@
-export type PriorityQueueComparator<T> = (a: T, b: T) => number;
-
-export type PriorityQueueOptions<T> = {
-  nodes?: T[];
-  isFix?: boolean;
-  comparator: PriorityQueueComparator<T>;
-};
-
-export type PriorityQueueDFSOrderPattern = 'pre' | 'in' | 'post';

package/src/types/data-structures/rb-tree.ts

@@ -1,8 +0,0 @@
-import {BinaryTreeOptions} from './binary-tree';
-import {RBTreeNode} from '../../data-structures/binary-tree';
-
-export enum RBColor { RED = 'RED', BLACK = 'BLACK'}
-
-export type RBTreeNodeNested<T> = RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-
-export type RBTreeOptions = BinaryTreeOptions & {}

package/src/types/data-structures/tree-multiset.ts

@@ -1,6 +0,0 @@
-import {TreeMultisetNode} from '../../data-structures/binary-tree';
-import {AVLTreeOptions} from './avl-tree';
-
-export type TreeMultisetNodeNested<T> = TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-
-export type TreeMultisetOptions = Omit<AVLTreeOptions, 'isMergeDuplicatedNodeByKey'> & {}

package/test/utils/magnitude.ts

@@ -1,21 +0,0 @@
-const orderReducedBy = 2; // reduction of magnitude's order compared to the baseline magnitude
-
-export const magnitude = {
-  CONSTANT: Math.floor(Number.MAX_SAFE_INTEGER / Math.pow(10, orderReducedBy)),
-  LOG_N: Math.pow(10, 9 - orderReducedBy),
-  LINEAR: Math.pow(10, 6 - orderReducedBy),
-  N_LOG_N: Math.pow(10, 5 - orderReducedBy),
-  SQUARED: Math.pow(10, 4 - orderReducedBy),
-  CUBED: Math.pow(10, 3 - orderReducedBy),
-  FACTORIAL: 20 - orderReducedBy
-};
-
-export const bigO = {
-  CONSTANT: magnitude.CONSTANT / 100000,
-  LOG_N: Math.log2(magnitude.LOG_N) / 1000,
-  LINEAR: magnitude.LINEAR / 1000,
-  N_LOG_N: (magnitude.N_LOG_N * Math.log2(magnitude.LOG_N)) / 1000,
-  SQUARED: Math.pow(magnitude.SQUARED, 2) / 1000,
-  CUBED: Math.pow(magnitude.SQUARED, 3) / 1000,
-  FACTORIAL: 10000
-};