data-structure-typed 1.36.0 → 1.36.2

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/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/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';