data-structure-typed 1.36.1 → 1.36.3

package/dist/data-structures/binary-tree/aa-tree.d.ts

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

package/dist/data-structures/binary-tree/aa-tree.js

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AaTree = void 0;
-class AaTree {
-}
-exports.AaTree = AaTree;
-//# sourceMappingURL=aa-tree.js.map

package/dist/data-structures/binary-tree/aa-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"aa-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/aa-tree.ts"],"names":[],"mappings":";;;AAAA,MAAa,MAAM;CAAG;AAAtB,wBAAsB"}

package/dist/data-structures/binary-tree/abstract-binary-tree.d.ts

@@ -1,21 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import type { AbstractBinaryTreeNodeNested, BinaryTreeNodeKey } from '../../types';
-import { IAbstractBinaryTree, IAbstractBinaryTreeNode } from '../../interfaces';
-export declare abstract class AbstractBinaryTreeNode<V = any, FAMILY extends AbstractBinaryTreeNode<V, FAMILY> = AbstractBinaryTreeNodeNested<V>> implements IAbstractBinaryTreeNode<V, FAMILY> {
-    /**
-     * The constructor function initializes a BinaryTreeNode object with a key and an optional value.
-     * @param {V} [val] - The "val" parameter is an optional parameter of type V. It represents the value that will be
-     * stored in the binary tree node. If no value is provided, it will be set to undefined.
-     */
-    protected constructor(val?: V);
-    val: V | undefined;
-}
-export declare abstract class AbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N> = AbstractBinaryTreeNode> implements IAbstractBinaryTree<N> {
-    abstract createNode(key: BinaryTreeNodeKey, val?: N['val']): N | null;
-}

package/dist/data-structures/binary-tree/abstract-binary-tree.js

@@ -1,25 +0,0 @@
-"use strict";
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AbstractBinaryTree = exports.AbstractBinaryTreeNode = void 0;
-class AbstractBinaryTreeNode {
-    /**
-     * The constructor function initializes a BinaryTreeNode object with a key and an optional value.
-     * @param {V} [val] - The "val" parameter is an optional parameter of type V. It represents the value that will be
-     * stored in the binary tree node. If no value is provided, it will be set to undefined.
-     */
-    constructor(val) {
-        this.val = val;
-    }
-}
-exports.AbstractBinaryTreeNode = AbstractBinaryTreeNode;
-class AbstractBinaryTree {
-}
-exports.AbstractBinaryTree = AbstractBinaryTree;
-//# sourceMappingURL=abstract-binary-tree.js.map

package/dist/data-structures/binary-tree/abstract-binary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-binary-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/abstract-binary-tree.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAKH,MAAsB,sBAAsB;IAK1C;;;;OAIG;IACH,YAAsB,GAAO;QAC3B,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;IACjB,CAAC;CAGF;AAfD,wDAeC;AAED,MAAsB,kBAAkB;CAIvC;AAJD,gDAIC"}

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

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

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

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BTree = void 0;
-class BTree {
-}
-exports.BTree = BTree;
-//# sourceMappingURL=b-tree.js.map

package/dist/data-structures/binary-tree/b-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"b-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/b-tree.ts"],"names":[],"mappings":";;;AAAA,MAAa,KAAK;CAAG;AAArB,sBAAqB"}

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

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

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

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SplayTree = void 0;
-class SplayTree {
-}
-exports.SplayTree = SplayTree;
-//# sourceMappingURL=splay-tree.js.map

package/dist/data-structures/binary-tree/splay-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"splay-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/splay-tree.ts"],"names":[],"mappings":";;;AAAA,MAAa,SAAS;CAAG;AAAzB,8BAAyB"}

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

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

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

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TwoThreeTree = void 0;
-class TwoThreeTree {
-}
-exports.TwoThreeTree = TwoThreeTree;
-//# sourceMappingURL=two-three-tree.js.map

package/dist/data-structures/binary-tree/two-three-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"two-three-tree.js","sourceRoot":"","sources":["../../../src/data-structures/binary-tree/two-three-tree.ts"],"names":[],"mappings":";;;AAAA,MAAa,YAAY;CAAG;AAA5B,oCAA4B"}

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

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

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

@@ -1,7 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Pair = void 0;
-class Pair {
-}
-exports.Pair = Pair;
-//# sourceMappingURL=pair.js.map

package/dist/data-structures/hash/pair.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pair.js","sourceRoot":"","sources":["../../../src/data-structures/hash/pair.ts"],"names":[],"mappings":";;;AAAA,MAAa,IAAI;CAAG;AAApB,oBAAoB"}

package/dist/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/dist/interfaces/abstract-binary-tree.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=abstract-binary-tree.js.map

package/dist/interfaces/abstract-binary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-binary-tree.js","sourceRoot":"","sources":["../../src/interfaces/abstract-binary-tree.ts"],"names":[],"mappings":""}

package/dist/interfaces/abstract-graph.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=abstract-graph.js.map

package/dist/interfaces/abstract-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-graph.js","sourceRoot":"","sources":["../../src/interfaces/abstract-graph.ts"],"names":[],"mappings":""}

package/dist/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/dist/interfaces/avl-tree.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=avl-tree.js.map

package/dist/interfaces/avl-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"avl-tree.js","sourceRoot":"","sources":["../../src/interfaces/avl-tree.ts"],"names":[],"mappings":""}

package/dist/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/dist/interfaces/bst.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bst.js","sourceRoot":"","sources":["../../src/interfaces/bst.ts"],"names":[],"mappings":""}

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

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

package/dist/interfaces/directed-graph.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=directed-graph.js.map

package/dist/interfaces/directed-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"directed-graph.js","sourceRoot":"","sources":["../../src/interfaces/directed-graph.ts"],"names":[],"mappings":""}

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

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=rb-tree.js.map

package/dist/interfaces/rb-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"rb-tree.js","sourceRoot":"","sources":["../../src/interfaces/rb-tree.ts"],"names":[],"mappings":""}

package/dist/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/dist/interfaces/tree-multiset.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=tree-multiset.js.map

package/dist/interfaces/tree-multiset.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tree-multiset.js","sourceRoot":"","sources":["../../src/interfaces/tree-multiset.ts"],"names":[],"mappings":""}

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

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

package/dist/interfaces/undirected-graph.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=undirected-graph.js.map

package/dist/interfaces/undirected-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"undirected-graph.js","sourceRoot":"","sources":["../../src/interfaces/undirected-graph.ts"],"names":[],"mappings":""}

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

@@ -1,32 +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 = {};

package/dist/types/data-structures/abstract-binary-tree.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.FamilyPosition = exports.LoopType = void 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).
- */
-var LoopType;
-(function (LoopType) {
-    LoopType["ITERATIVE"] = "ITERATIVE";
-    LoopType["RECURSIVE"] = "RECURSIVE";
-})(LoopType || (exports.LoopType = LoopType = {}));
-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 || (exports.FamilyPosition = FamilyPosition = {}));
-//# sourceMappingURL=abstract-binary-tree.js.map

package/dist/types/data-structures/abstract-binary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"abstract-binary-tree.js","sourceRoot":"","sources":["../../../src/types/data-structures/abstract-binary-tree.ts"],"names":[],"mappings":";;;AAEA;;;;;GAKG;AAEH,IAAY,QAGX;AAHD,WAAY,QAAQ;IAClB,mCAAuB,CAAA;IACvB,mCAAuB,CAAA;AACzB,CAAC,EAHW,QAAQ,wBAAR,QAAQ,QAGnB;AAED,IAAY,cAQX;AARD,WAAY,cAAc;IACxB,+BAAa,CAAA;IACb,+BAAa,CAAA;IACb,iCAAe,CAAA;IACf,yCAAuB,CAAA;IACvB,2CAAyB,CAAA;IACzB,uCAAqB,CAAA;IACrB,uCAAqB,CAAA;AACvB,CAAC,EARW,cAAc,8BAAd,cAAc,QAQzB"}

package/dist/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/dist/types/data-structures/priority-queue.js

@@ -1,3 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-//# sourceMappingURL=priority-queue.js.map

package/dist/types/data-structures/priority-queue.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.js","sourceRoot":"","sources":["../../../src/types/data-structures/priority-queue.ts"],"names":[],"mappings":""}

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

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

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

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

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

@@ -1,21 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-import type { AbstractBinaryTreeNodeNested, BinaryTreeNodeKey } from '../../types';
-import { IAbstractBinaryTree, IAbstractBinaryTreeNode } from '../../interfaces';
-export declare abstract class AbstractBinaryTreeNode<V = any, FAMILY extends AbstractBinaryTreeNode<V, FAMILY> = AbstractBinaryTreeNodeNested<V>> implements IAbstractBinaryTreeNode<V, FAMILY> {
-    /**
-     * The constructor function initializes a BinaryTreeNode object with a key and an optional value.
-     * @param {V} [val] - The "val" parameter is an optional parameter of type V. It represents the value that will be
-     * stored in the binary tree node. If no value is provided, it will be set to undefined.
-     */
-    protected constructor(val?: V);
-    val: V | undefined;
-}
-export declare abstract class AbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N> = AbstractBinaryTreeNode> implements IAbstractBinaryTree<N> {
-    abstract createNode(key: BinaryTreeNodeKey, val?: N['val']): N | null;
-}

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

@@ -1,19 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-export class AbstractBinaryTreeNode {
-    /**
-     * The constructor function initializes a BinaryTreeNode object with a key and an optional value.
-     * @param {V} [val] - The "val" parameter is an optional parameter of type V. It represents the value that will be
-     * stored in the binary tree node. If no value is provided, it will be set to undefined.
-     */
-    constructor(val) {
-        this.val = val;
-    }
-}
-export class AbstractBinaryTree {
-}

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,32 +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 = {};

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 {}

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

@@ -1,33 +0,0 @@
-/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
- * @license MIT License
- */
-
-import type {AbstractBinaryTreeNodeNested, BinaryTreeNodeKey} from '../../types';
-import {IAbstractBinaryTree, IAbstractBinaryTreeNode} from '../../interfaces';
-
-export abstract class AbstractBinaryTreeNode<
-  V = any,
-  FAMILY extends AbstractBinaryTreeNode<V, FAMILY> = AbstractBinaryTreeNodeNested<V>
-> implements IAbstractBinaryTreeNode<V, FAMILY>
-{
-  /**
-   * The constructor function initializes a BinaryTreeNode object with a key and an optional value.
-   * @param {V} [val] - The "val" parameter is an optional parameter of type V. It represents the value that will be
-   * stored in the binary tree node. If no value is provided, it will be set to undefined.
-   */
-  protected constructor(val?: V) {
-    this.val = val;
-  }
-
-  val: V | undefined;
-}
-
-export abstract class AbstractBinaryTree<N extends AbstractBinaryTreeNode<N['val'], N> = AbstractBinaryTreeNode>
-  implements IAbstractBinaryTree<N>
-{
-  abstract createNode(key: BinaryTreeNodeKey, val?: N['val']): N | null;
-}

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 {}