data-structure-typed 1.21.2 → 1.21.3

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

@@ -5,9 +5,9 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeNodeId, BinaryTreeNodeNested, BinaryTreeOptions } from '../types';
+import type { BinaryTreeNodeId, BinaryTreeNodeNested, BinaryTreeOptions } from '../../types';
 import { AbstractBinaryTree, AbstractBinaryTreeNode } from './abstract-binary-tree';
-import { IBinaryTree, IBinaryTreeNode } from '../interfaces';
+import { IBinaryTree, IBinaryTreeNode } from '../../interfaces';
 export declare class BinaryTreeNode<T = any, NEIGHBOR extends BinaryTreeNode<T, NEIGHBOR> = BinaryTreeNodeNested<T>> extends AbstractBinaryTreeNode<T, NEIGHBOR> implements IBinaryTreeNode<T, NEIGHBOR> {
     constructor(id: BinaryTreeNodeId, val?: T);
 }

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

@@ -5,10 +5,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeNodeId, BinaryTreeNodePropertyName, BSTComparator, BSTNodeNested, BSTOptions } from '../types';
-import { CP } from '../types';
+import type { BinaryTreeNodeId, BinaryTreeNodePropertyName, BSTComparator, BSTNodeNested, BSTOptions } from '../../types';
+import { CP } from '../../types';
 import { BinaryTree, BinaryTreeNode } from './binary-tree';
-import { IBST, IBSTNode } from '../interfaces';
+import { IBST, IBSTNode } from '../../interfaces';
 export declare class BSTNode<T = any, NEIGHBOR extends BSTNode<T, NEIGHBOR> = BSTNodeNested<T>> extends BinaryTreeNode<T, NEIGHBOR> implements IBSTNode<T, NEIGHBOR> {
     constructor(id: BinaryTreeNodeId, val?: T);
 }

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

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BST = exports.BSTNode = void 0;
-const types_1 = require("../types");
+const types_1 = require("../../types");
 const binary_tree_1 = require("./binary-tree");
 class BSTNode extends binary_tree_1.BinaryTreeNode {
     constructor(id, val) {

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

@@ -1,5 +1,5 @@
-import { BinaryTreeNodeId, RBColor, RBTreeNodeNested, RBTreeOptions } from '../types';
-import { IRBTree, IRBTreeNode } from '../interfaces/rb-tree';
+import { BinaryTreeNodeId, RBColor, RBTreeNodeNested, RBTreeOptions } from '../../types';
+import { IRBTree, IRBTreeNode } from '../../interfaces/rb-tree';
 import { BST, BSTNode } from './bst';
 export declare class RBTreeNode<T = any, NEIGHBOR extends RBTreeNode<T, NEIGHBOR> = RBTreeNodeNested<T>> extends BSTNode<T, NEIGHBOR> implements IRBTreeNode<T, NEIGHBOR> {
     constructor(id: BinaryTreeNodeId, val?: T, color?: RBColor);

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

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.RBTree = exports.RBTreeNode = void 0;
-const types_1 = require("../types");
+const types_1 = require("../../types");
 const bst_1 = require("./bst");
 class RBTreeNode extends bst_1.BSTNode {
     constructor(id, val, color = types_1.RBColor.RED) {

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { SegmentTreeNodeVal } from '../types';
+import type { SegmentTreeNodeVal } from '../../types';
 export declare class SegmentTreeNode {
     constructor(start: number, end: number, sum: number, val?: SegmentTreeNodeVal | null);
     private _start;

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

@@ -5,9 +5,9 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeNodeId, TreeMultisetNodeNested, TreeMultisetOptions } from '../types';
-import { BinaryTreeDeletedResult, DFSOrderPattern, NodeOrPropertyName } from '../types';
-import { ITreeMultiset, ITreeMultisetNode } from '../interfaces';
+import type { BinaryTreeNodeId, TreeMultisetNodeNested, TreeMultisetOptions } from '../../types';
+import { BinaryTreeDeletedResult, DFSOrderPattern, NodeOrPropertyName } from '../../types';
+import { ITreeMultiset, ITreeMultisetNode } from '../../interfaces';
 import { AVLTree, AVLTreeNode } from './avl-tree';
 export declare class TreeMultisetNode<T = any, NEIGHBOR extends TreeMultisetNode<T, NEIGHBOR> = TreeMultisetNodeNested<T>> extends AVLTreeNode<T, NEIGHBOR> implements ITreeMultisetNode<T, NEIGHBOR> {
     /**

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

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.TreeMultiset = exports.TreeMultisetNode = void 0;
-const types_1 = require("../types");
+const types_1 = require("../../types");
 const avl_tree_1 = require("./avl-tree");
 class TreeMultisetNode extends avl_tree_1.AVLTreeNode {
     /**

package/dist/data-structures/graph/abstract-graph.d.ts

@@ -1,5 +1,5 @@
-import type { DijkstraResult, VertexId } from '../types';
-import { IAbstractGraph } from '../interfaces';
+import type { DijkstraResult, VertexId } from '../../types';
+import { IAbstractGraph } from '../../interfaces';
 export declare abstract class AbstractVertex<T = any> {
     /**
      * The function is a protected constructor that takes an id and an optional value as parameters.
@@ -173,7 +173,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
     /**
      * Dijkstra algorithm time: O(VE) space: O(V + E)
      * /
-
+  
      /**
      * Dijkstra algorithm time: O(VE) space: O(V + E)
      * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
@@ -200,7 +200,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
      * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
      *
      * /
-
+  
      /**
      * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
      * The `dijkstra` function implements Dijkstra's algorithm to find the shortest path between a source vertex and an
@@ -223,7 +223,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
      * BellmanFord time:O(VE) space:O(V)
      * one to rest pairs
      * /
-
+  
      /**
      * BellmanFord time:O(VE) space:O(V)
      * one to rest pairs
@@ -251,7 +251,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
     /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      * /
-
+  
      /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
@@ -271,7 +271,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
      * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
      * all pairs
      * /
-
+  
      /**
      * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
      * all pairs
@@ -294,7 +294,7 @@ export declare abstract class AbstractGraph<V extends AbstractVertex<any> = Abst
      * Tarjan solve the bi-connected components of undirected graphs;
      * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
      * /
-
+  
      /**
      * Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs.
      * Tarjan can find cycles in directed or undirected graph

package/dist/data-structures/graph/abstract-graph.js

@@ -357,7 +357,7 @@ class AbstractGraph {
     /**
      * Dijkstra algorithm time: O(VE) space: O(V + E)
      * /
-
+  
      /**
      * Dijkstra algorithm time: O(VE) space: O(V + E)
      * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
@@ -484,7 +484,7 @@ class AbstractGraph {
      * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
      *
      * /
-
+  
      /**
      * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
      * The `dijkstra` function implements Dijkstra's algorithm to find the shortest path between a source vertex and an
@@ -608,7 +608,7 @@ class AbstractGraph {
      * BellmanFord time:O(VE) space:O(V)
      * one to rest pairs
      * /
-
+  
      /**
      * BellmanFord time:O(VE) space:O(V)
      * one to rest pairs
@@ -713,7 +713,7 @@ class AbstractGraph {
     /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      * /
-
+  
      /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      * Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative.
@@ -733,7 +733,7 @@ class AbstractGraph {
      * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
      * all pairs
      * /
-
+  
      /**
      * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
      * all pairs
@@ -783,7 +783,7 @@ class AbstractGraph {
      * Tarjan solve the bi-connected components of undirected graphs;
      * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
      * /
-
+  
      /**
      * Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs.
      * Tarjan can find cycles in directed or undirected graph

package/dist/data-structures/graph/directed-graph.d.ts

@@ -1,6 +1,6 @@
 import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
-import type { VertexId } from '../types';
-import { IDirectedGraph } from '../interfaces';
+import type { VertexId } from '../../types';
+import { IDirectedGraph } from '../../interfaces';
 export declare class DirectedVertex<T = number> extends AbstractVertex<T> {
     /**
      * The constructor function initializes a vertex with an optional value.

package/dist/data-structures/graph/map-graph.d.ts

@@ -1,4 +1,4 @@
-import { MapGraphCoordinate, VertexId } from '../types';
+import { MapGraphCoordinate, VertexId } from '../../types';
 import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
 export declare class MapVertex<T = any> extends DirectedVertex<T> {
     /**

package/dist/data-structures/graph/undirected-graph.d.ts

@@ -1,6 +1,6 @@
 import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
-import type { VertexId } from '../types';
-import { IUNDirectedGraph } from '../interfaces';
+import type { VertexId } from '../../types';
+import { IUNDirectedGraph } from '../../interfaces';
 export declare class UndirectedVertex<T = number> extends AbstractVertex<T> {
     /**
      * The constructor function initializes a vertex with an optional value.

package/dist/data-structures/heap/heap.d.ts

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from '../priority-queue';
-import type { HeapOptions } from '../types';
+import type { HeapOptions } from '../../types';
 export declare class HeapItem<T = number> {
     /**
      * The constructor function initializes an instance of a class with a priority and a value.

package/dist/data-structures/heap/heap.js

@@ -9,7 +9,7 @@ class HeapItem {
      * @param {T | null} [val=null] - The `val` parameter is of type `T | null`, which means it can accept a value of type
      * `T` or `null`.
      */
-    constructor(priority = NaN, val = null) {
+    constructor(priority = Number.MAX_SAFE_INTEGER, val = null) {
         this._val = val;
         this._priority = priority;
     }

package/dist/data-structures/heap/max-heap.d.ts

@@ -7,7 +7,7 @@
  */
 import { Heap, HeapItem } from './heap';
 import { PriorityQueue } from '../priority-queue';
-import type { HeapOptions } from '../types';
+import type { HeapOptions } from '../../types';
 /**
  * @class MaxHeap
  * @extends Heap

package/dist/data-structures/heap/min-heap.d.ts

@@ -7,7 +7,7 @@
  */
 import { Heap, HeapItem } from './heap';
 import { PriorityQueue } from '../priority-queue';
-import type { HeapOptions } from '../types';
+import type { HeapOptions } from '../../types';
 /**
  * @class MinHeap
  * @extends Heap

package/dist/data-structures/index.d.ts

@@ -9,5 +9,3 @@ export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
-export * from './interfaces';
-export * from './types';

package/dist/data-structures/index.js

@@ -25,5 +25,3 @@ __exportStar(require("./heap"), exports);
 __exportStar(require("./priority-queue"), exports);
 __exportStar(require("./matrix"), exports);
 __exportStar(require("./trie"), exports);
-__exportStar(require("./interfaces"), exports);
-__exportStar(require("./types"), exports);

package/dist/data-structures/matrix/navigator.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { Direction, NavigatorParams, Turning } from '../types';
+import type { Direction, NavigatorParams, Turning } from '../../types';
 export declare class Character {
     direction: Direction;
     turn: () => Character;

package/dist/data-structures/priority-queue/max-priority-queue.d.ts

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { PriorityQueueOptions } from '../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MaxPriorityQueue<T = number> extends PriorityQueue<T> {
     constructor(options?: Omit<PriorityQueueOptions<number>, 'comparator'>);
     constructor(options: PriorityQueueOptions<T>);

package/dist/data-structures/priority-queue/min-priority-queue.d.ts

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 import { PriorityQueue } from './priority-queue';
-import type { PriorityQueueOptions } from '../types';
+import type { PriorityQueueOptions } from '../../types';
 export declare class MinPriorityQueue<T = number> extends PriorityQueue<T> {
     constructor(options?: Omit<PriorityQueueOptions<number>, 'comparator'>);
     constructor(options: PriorityQueueOptions<T>);

package/dist/data-structures/priority-queue/priority-queue.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions } from '../types';
+import type { PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions } from '../../types';
 export declare class PriorityQueue<T = number> {
     /**
      * The constructor initializes a priority queue with the given options, including an array of nodes and a comparator

package/dist/index.d.ts

@@ -1,2 +1,4 @@
 export * from './data-structures';
 export * from './utils';
+export * from './interfaces';
+export * from './types';

package/dist/index.js

@@ -16,3 +16,5 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./data-structures"), exports);
 __exportStar(require("./utils"), exports);
+__exportStar(require("./interfaces"), exports);
+__exportStar(require("./types"), exports);

package/dist/{data-structures/interfaces → interfaces}/abstract-binary-tree.d.ts

@@ -1,5 +1,5 @@
 import { AbstractBinaryTreeNodeProperties, AbstractBinaryTreeNodeProperty, BinaryTreeDeletedResult, BinaryTreeNodeId, BinaryTreeNodePropertyName, DFSOrderPattern, FamilyPosition, LoopType, NodeOrPropertyName } from '../types';
-import { AbstractBinaryTreeNode } from '../binary-tree';
+import { AbstractBinaryTreeNode } from '../data-structures';
 export interface IAbstractBinaryTreeNode<T, NEIGHBOR extends IAbstractBinaryTreeNode<T, NEIGHBOR>> {
     get id(): BinaryTreeNodeId;
     set id(v: BinaryTreeNodeId);

package/dist/{data-structures/interfaces → interfaces}/avl-tree.d.ts

@@ -1,4 +1,4 @@
-import { AVLTreeNode } from '../binary-tree';
+import { AVLTreeNode } from '../data-structures';
 import { IBST, IBSTNode } from './bst';
 import { BinaryTreeDeletedResult, BinaryTreeNodeId } from '../types';
 export interface IAVLTreeNode<T, NEIGHBOR extends IAVLTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {

package/dist/{data-structures/interfaces → interfaces}/binary-tree.d.ts

@@ -1,4 +1,4 @@
-import { BinaryTreeNode } from '../binary-tree';
+import { BinaryTreeNode } from '../data-structures';
 import { IAbstractBinaryTree, IAbstractBinaryTreeNode } from './abstract-binary-tree';
 export interface IBinaryTreeNode<T, NEIGHBOR extends IBinaryTreeNode<T, NEIGHBOR>> extends IAbstractBinaryTreeNode<T, NEIGHBOR> {
 }

package/dist/{data-structures/interfaces → interfaces}/bst.d.ts

@@ -1,4 +1,4 @@
-import { BSTNode } from '../binary-tree';
+import { BSTNode } from '../data-structures';
 import { IBinaryTree, IBinaryTreeNode } from './binary-tree';
 import { BinaryTreeDeletedResult, BinaryTreeNodeId, BinaryTreeNodePropertyName } from '../types';
 export interface IBSTNode<T, NEIGHBOR extends IBSTNode<T, NEIGHBOR>> extends IBinaryTreeNode<T, NEIGHBOR> {

package/dist/{data-structures/interfaces → interfaces}/rb-tree.d.ts

@@ -1,4 +1,4 @@
-import { RBTreeNode } from '../binary-tree';
+import { RBTreeNode } from '../data-structures';
 import { IBST, IBSTNode } from './bst';
 import { BinaryTreeNodeId } from '../types';
 export interface IRBTreeNode<T, NEIGHBOR extends IRBTreeNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {

package/dist/{data-structures/interfaces → interfaces}/tree-multiset.d.ts

@@ -1,4 +1,4 @@
-import { TreeMultisetNode } from '../binary-tree';
+import { TreeMultisetNode } from '../data-structures';
 import { IBSTNode } from './bst';
 import { IAVLTree } from './avl-tree';
 export interface ITreeMultisetNode<T, NEIGHBOR extends ITreeMultisetNode<T, NEIGHBOR>> extends IBSTNode<T, NEIGHBOR> {

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

@@ -1,4 +1,4 @@
-import { AbstractBinaryTreeNode } from '../binary-tree';
+import { AbstractBinaryTreeNode } from '../../data-structures/binary-tree';
 /**
  * Enum representing different loop types.
  *

package/dist/{data-structures/types → types/data-structures}/avl-tree.d.ts

@@ -1,4 +1,4 @@
-import { AVLTreeNode } from '../binary-tree';
+import { AVLTreeNode } from '../../data-structures/binary-tree';
 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/dist/{data-structures/types → types/data-structures}/binary-tree.d.ts

@@ -1,4 +1,4 @@
-import { BinaryTreeNode } from '../binary-tree';
+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/dist/{data-structures/types → types/data-structures}/bst.d.ts

@@ -1,4 +1,4 @@
-import { BSTNode } from '../binary-tree';
+import { BSTNode } from '../../data-structures/binary-tree';
 import type { BinaryTreeOptions } from './binary-tree';
 import { BinaryTreeNodeId } from './abstract-binary-tree';
 export type BSTComparator = (a: BinaryTreeNodeId, b: BinaryTreeNodeId) => number;

package/dist/{data-structures/types → types/data-structures}/index.d.ts

@@ -13,4 +13,3 @@ export * from './heap';
 export * from './singly-linked-list';
 export * from './doubly-linked-list';
 export * from './navigator';
-export * from './helpers';

package/dist/{data-structures/types → types/data-structures}/index.js

@@ -29,4 +29,3 @@ __exportStar(require("./heap"), exports);
 __exportStar(require("./singly-linked-list"), exports);
 __exportStar(require("./doubly-linked-list"), exports);
 __exportStar(require("./navigator"), exports);
-__exportStar(require("./helpers"), exports);

package/dist/{data-structures/types → types/data-structures}/rb-tree.d.ts

@@ -1,5 +1,5 @@
 import { BinaryTreeOptions } from './binary-tree';
-import { RBTreeNode } from '../binary-tree';
+import { RBTreeNode } from '../../data-structures/binary-tree';
 export declare enum RBColor {
     RED = "RED",
     BLACK = "BLACK"

package/dist/{data-structures/types → types/data-structures}/tree-multiset.d.ts

@@ -1,4 +1,4 @@
-import { TreeMultisetNode } from '../binary-tree';
+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, 'isMergeDuplicatedNodeById'> & {};

package/dist/types/index.d.ts

@@ -0,0 +1,3 @@
+export * from './data-structures';
+export * from './helpers';
+export * from './utils';

package/dist/types/index.js

@@ -0,0 +1,19 @@
+"use strict";
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./data-structures"), exports);
+__exportStar(require("./helpers"), exports);
+__exportStar(require("./utils"), exports);

package/dist/utils/index.d.ts

@@ -1,3 +1 @@
 export * from './utils';
-export * from './types';
-export * from './validate-type';

package/dist/utils/index.js

@@ -15,5 +15,3 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
 };
 Object.defineProperty(exports, "__esModule", { value: true });
 __exportStar(require("./utils"), exports);
-__exportStar(require("./types"), exports);
-__exportStar(require("./validate-type"), exports);

package/dist/utils/utils.d.ts

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { Thunk, ToThunkFn, TrlAsyncFn, TrlFn } from './types';
+import type { Thunk, ToThunkFn, TrlAsyncFn, TrlFn } from '../types';
 export declare const uuidV4: () => string;
 export declare const arrayRemove: <T>(array: T[], predicate: (item: T, index: number, array: T[]) => boolean) => T[];
 export declare const THUNK_SYMBOL: unique symbol;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.21.2",
+  "version": "1.21.3",
   "description": "Javascript & TypeScript Data Structure Library, meticulously crafted to empower developers with a versatile set of essential data structures. Our library includes a wide range of data structures, such as Binary Tree, AVL Tree, Binary Search Tree (BST), Tree Multiset, Segment Tree, Binary Indexed Tree, Graph, Directed Graph, Undirected Graph, Singly Linked List, Hash, CoordinateSet, CoordinateMap, Heap, Doubly Linked List, Priority Queue, Max Priority Queue, Min Priority Queue, Queue, ObjectDeque, ArrayDeque, Stack, and Trie. Each data structure is thoughtfully designed and implemented using TypeScript to provide efficient, reliable, and easy-to-use solutions for your programming needs. Whether you're optimizing algorithms, managing data, or enhancing performance, our TypeScript Data Structure Library is your go-to resource. Elevate your coding experience with these fundamental building blocks for software development.",
   "main": "dist/index.js",
   "module": "dist/index.js",
@@ -8,9 +8,9 @@
   "scripts": {
     "build": "rm -rf dist && npx tsc && npm run build:browser",
     "build:browser": "webpack",
+    "build:docs": "typedoc --out docs ./src",
     "test": "jest",
     "update:test-deps": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed --save-dev",
-    "build:docs": "typedoc --out docs ./src",
     "deps:check": "dependency-cruiser src",
     "build:publish": "npm run test && npm run build && npm run build:docs && npm publish"
   },
@@ -61,35 +61,32 @@
   "devDependencies": {
     "@types/jest": "^29.5.3",
     "@types/node": "^20.4.9",
-    "avl-tree-typed": "^1.21.0",
-    "binary-tree-typed": "^1.21.0",
-    "bst-typed": "^1.21.0",
+    "avl-tree-typed": "^1.21.2",
+    "binary-tree-typed": "^1.21.2",
+    "bst-typed": "^1.21.2",
     "dependency-cruiser": "^13.1.2",
-    "deque-typed": "^1.21.0",
-    "directed-graph-typed": "^1.21.0",
-    "doubly-linked-list-typed": "^1.21.0",
-    "graph-typed": "^1.21.0",
-    "heap-typed": "^1.21.0",
+    "deque-typed": "^1.21.2",
+    "directed-graph-typed": "^1.21.2",
+    "doubly-linked-list-typed": "^1.21.2",
+    "graph-typed": "^1.21.2",
+    "heap-typed": "^1.21.2",
     "jest": "^29.6.2",
-    "linked-list-typed": "^1.21.0",
-    "max-heap-typed": "^1.21.0",
-    "max-priority-queue-typed": "^1.21.0",
-    "min-heap-typed": "^1.21.0",
-    "min-priority-queue-typed": "^1.21.0",
-    "priority-queue-typed": "^1.21.0",
-    "singly-linked-list-typed": "^1.21.0",
-    "stack-typed": "^1.21.0",
-    "tree-multiset-typed": "^1.21.0",
-    "trie-typed": "^1.21.0",
+    "linked-list-typed": "^1.21.2",
+    "max-heap-typed": "^1.21.2",
+    "max-priority-queue-typed": "^1.21.2",
+    "min-heap-typed": "^1.21.2",
+    "min-priority-queue-typed": "^1.21.2",
+    "priority-queue-typed": "^1.21.2",
+    "singly-linked-list-typed": "^1.21.2",
+    "stack-typed": "^1.21.2",
+    "tree-multiset-typed": "^1.21.2",
+    "trie-typed": "^1.21.2",
     "ts-jest": "^29.1.1",
     "ts-loader": "^9.4.4",
     "typedoc": "^0.24.8",
     "typescript": "^4.9.5",
-    "undirected-graph-typed": "^1.21.0",
+    "undirected-graph-typed": "^1.21.2",
     "webpack": "^5.88.2",
     "webpack-cli": "^5.1.4"
-  },
-  "dependencies": {
-    "zod": "^3.22.2"
   }
 }