data-structure-typed 1.36.0 → 1.36.2

package/lib/data-structures/binary-tree/b-tree.d.ts

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

package/lib/data-structures/binary-tree/b-tree.js

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

package/lib/data-structures/binary-tree/splay-tree.d.ts

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

package/lib/data-structures/binary-tree/splay-tree.js

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

package/lib/data-structures/binary-tree/two-three-tree.d.ts

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

package/lib/data-structures/binary-tree/two-three-tree.js

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

package/lib/data-structures/hash/pair.d.ts

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

package/lib/data-structures/hash/pair.js

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

package/lib/interfaces/abstract-binary-tree.d.ts

@@ -1,7 +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/lib/interfaces/abstract-graph.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/avl-tree.d.ts

@@ -1,7 +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/lib/interfaces/avl-tree.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/bst.d.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/lib/interfaces/bst.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/directed-graph.d.ts

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

package/lib/interfaces/directed-graph.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/rb-tree.d.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/lib/interfaces/rb-tree.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/tree-multiset.d.ts

@@ -1,6 +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/lib/interfaces/tree-multiset.js

@@ -1 +0,0 @@
-export {};

package/lib/interfaces/undirected-graph.d.ts

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

package/lib/interfaces/undirected-graph.js

@@ -1 +0,0 @@
-export {};

package/lib/types/data-structures/abstract-binary-tree.d.ts

@@ -1,34 +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 declare enum LoopType {
-    ITERATIVE = "ITERATIVE",
-    RECURSIVE = "RECURSIVE"
-}
-export declare 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/lib/types/data-structures/abstract-binary-tree.js

@@ -1,21 +0,0 @@
-/**
- * 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 var LoopType;
-(function (LoopType) {
-    LoopType["ITERATIVE"] = "ITERATIVE";
-    LoopType["RECURSIVE"] = "RECURSIVE";
-})(LoopType || (LoopType = {}));
-export var FamilyPosition;
-(function (FamilyPosition) {
-    FamilyPosition["ROOT"] = "ROOT";
-    FamilyPosition["LEFT"] = "LEFT";
-    FamilyPosition["RIGHT"] = "RIGHT";
-    FamilyPosition["ROOT_LEFT"] = "ROOT_LEFT";
-    FamilyPosition["ROOT_RIGHT"] = "ROOT_RIGHT";
-    FamilyPosition["ISOLATED"] = "ISOLATED";
-    FamilyPosition["MAL_NODE"] = "MAL_NODE";
-})(FamilyPosition || (FamilyPosition = {}));

package/lib/types/data-structures/priority-queue.d.ts

@@ -1,7 +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/lib/types/data-structures/priority-queue.js

@@ -1 +0,0 @@
-export {};

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

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