data-structure-typed 1.43.1 → 1.44.0

package/dist/mjs/{src/data-structures → data-structures}/graph/abstract-graph.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -8,10 +5,10 @@ exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-const priority_queue_1 = require("../priority-queue");
-const queue_1 = require("../queue");
-class AbstractVertex {
+import { uuidV4 } from '../../utils';
+import { PriorityQueue } from '../priority-queue';
+import { Queue } from '../queue';
+export class AbstractVertex {
     key;
     value;
     /**
@@ -26,8 +23,7 @@ class AbstractVertex {
         this.value = value;
     }
 }
-exports.AbstractVertex = AbstractVertex;
-class AbstractEdge {
+export class AbstractEdge {
     value;
     weight;
     /**
@@ -42,15 +38,14 @@ class AbstractEdge {
     constructor(weight, value) {
         this.weight = weight !== undefined ? weight : 1;
         this.value = value;
-        this._hashCode = (0, utils_1.uuidV4)();
+        this._hashCode = uuidV4();
     }
     _hashCode;
     get hashCode() {
         return this._hashCode;
     }
 }
-exports.AbstractEdge = AbstractEdge;
-class AbstractGraph {
+export class AbstractGraph {
     _vertices = new Map();
     get vertices() {
         return this._vertices;
@@ -310,7 +305,7 @@ class AbstractGraph {
                 return null;
             }
             const visited = new Map();
-            const queue = new queue_1.Queue([vertex1]);
+            const queue = new Queue([vertex1]);
             visited.set(vertex1, true);
             let cost = 0;
             while (queue.size > 0) {
@@ -417,24 +412,24 @@ class AbstractGraph {
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      */
     /**
-    * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
-    * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
-    *
-    * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
-    * a graph without using a heap data structure.
-    * @param {VO | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
-    * vertex object or a vertex ID.
-    * @param {VO | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
-    * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
-    * identifier. If no destination is provided, the value is set to `null`.
-    * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
-    * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
-    * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
-    * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
-    * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-    * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
-    * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
-    */
+     * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
+     * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
+     *
+     * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
+     * a graph without using a heap data structure.
+     * @param {VO | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
+     * vertex object or a vertex ID.
+     * @param {VO | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
+     * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
+     * identifier. If no destination is provided, the value is set to `null`.
+     * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
+     * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
+     * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
+     * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
+     * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
+     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+     * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
+     */
     dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;
@@ -551,25 +546,25 @@ class AbstractGraph {
      * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
      */
     /**
-    * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
-    * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
-    *
-    * 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
-    * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
-    * @param {VO | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
-    * start. It can be either a vertex object or a vertex ID.
-    * @param {VO | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
-    * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
-    * will calculate the shortest paths to all other vertices from the source vertex.
-    * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
-    * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
-    * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
-    * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
-    * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-    * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
-    * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
-    */
+     * Time Complexity: O((V + E) * log(V)) - Depends on the implementation (using a binary heap).
+     * Space Complexity: O(V + E) - Depends on the implementation (using a binary heap).
+     *
+     * 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
+     * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
+     * @param {VO | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
+     * start. It can be either a vertex object or a vertex ID.
+     * @param {VO | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
+     * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
+     * will calculate the shortest paths to all other vertices from the source vertex.
+     * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
+     * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
+     * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
+     * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
+     * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
+     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+     * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
+     */
     dijkstra(src, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;
@@ -594,7 +589,7 @@ class AbstractGraph {
             if (vertexOrKey instanceof AbstractVertex)
                 distMap.set(vertexOrKey, Infinity);
         }
-        const heap = new priority_queue_1.PriorityQueue({ comparator: (a, b) => a.key - b.key });
+        const heap = new PriorityQueue({ comparator: (a, b) => a.key - b.key });
         heap.add({ key: 0, value: srcVertex });
         distMap.set(srcVertex, 0);
         preMap.set(srcVertex, null);
@@ -1042,4 +1037,3 @@ class AbstractGraph {
         return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;
     }
 }
-exports.AbstractGraph = AbstractGraph;

package/dist/mjs/{src/data-structures → data-structures}/graph/directed-graph.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -8,9 +5,9 @@ exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-const abstract_graph_1 = require("./abstract-graph");
-class DirectedVertex extends abstract_graph_1.AbstractVertex {
+import { arrayRemove } from '../../utils';
+import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
+export class DirectedVertex extends AbstractVertex {
     /**
      * The constructor function initializes a vertex with an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
@@ -22,8 +19,7 @@ class DirectedVertex extends abstract_graph_1.AbstractVertex {
         super(key, value);
     }
 }
-exports.DirectedVertex = DirectedVertex;
-class DirectedEdge extends abstract_graph_1.AbstractEdge {
+export class DirectedEdge extends AbstractEdge {
     src;
     dest;
     /**
@@ -43,8 +39,7 @@ class DirectedEdge extends abstract_graph_1.AbstractEdge {
         this.dest = dest;
     }
 }
-exports.DirectedEdge = DirectedEdge;
-class DirectedGraph extends abstract_graph_1.AbstractGraph {
+export class DirectedGraph extends AbstractGraph {
     /**
      * The constructor function initializes an instance of a class.
      */
@@ -143,11 +138,11 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
         const srcOutEdges = this._outEdgeMap.get(src);
         if (srcOutEdges) {
-            (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.dest === dest.key);
+            arrayRemove(srcOutEdges, (edge) => edge.dest === dest.key);
         }
         const destInEdges = this._inEdgeMap.get(dest);
         if (destInEdges) {
-            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key)[0] || null;
+            removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || null;
         }
         return removed;
     }
@@ -171,11 +166,11 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         if (src && dest) {
             const srcOutEdges = this._outEdgeMap.get(src);
             if (srcOutEdges && srcOutEdges.length > 0) {
-                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.key);
+                arrayRemove(srcOutEdges, (edge) => edge.src === src.key);
             }
             const destInEdges = this._inEdgeMap.get(dest);
             if (destInEdges && destInEdges.length > 0) {
-                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.dest === dest.key)[0];
+                removed = arrayRemove(destInEdges, (edge) => edge.dest === dest.key)[0];
             }
         }
         return removed;
@@ -529,4 +524,3 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         }
     }
 }
-exports.DirectedGraph = DirectedGraph;

package/dist/mjs/data-structures/graph/index.js

@@ -0,0 +1,4 @@
+export * from './abstract-graph';
+export * from './directed-graph';
+export * from './undirected-graph';
+export * from './map-graph';

package/dist/mjs/{src/data-structures → data-structures}/graph/map-graph.js

@@ -1,8 +1,5 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MapGraph = exports.MapEdge = exports.MapVertex = void 0;
-const directed_graph_1 = require("./directed-graph");
-class MapVertex extends directed_graph_1.DirectedVertex {
+import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
+export class MapVertex extends DirectedVertex {
     lat;
     long;
     /**
@@ -23,8 +20,7 @@ class MapVertex extends directed_graph_1.DirectedVertex {
         this.long = long;
     }
 }
-exports.MapVertex = MapVertex;
-class MapEdge extends directed_graph_1.DirectedEdge {
+export class MapEdge extends DirectedEdge {
     /**
      * The constructor function initializes a new instance of a class with the given source, destination, weight, and
      * value.
@@ -39,8 +35,7 @@ class MapEdge extends directed_graph_1.DirectedEdge {
         super(src, dest, weight, value);
     }
 }
-exports.MapEdge = MapEdge;
-class MapGraph extends directed_graph_1.DirectedGraph {
+export class MapGraph extends DirectedGraph {
     /**
      * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
      * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the
@@ -93,4 +88,3 @@ class MapGraph extends directed_graph_1.DirectedGraph {
         return new MapEdge(src, dest, weight, value);
     }
 }
-exports.MapGraph = MapGraph;

package/dist/mjs/{src/data-structures → data-structures}/graph/undirected-graph.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
 /**
  * data-structure-typed
  *
@@ -8,9 +5,9 @@ exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = vo
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-const utils_1 = require("../../utils");
-const abstract_graph_1 = require("./abstract-graph");
-class UndirectedVertex extends abstract_graph_1.AbstractVertex {
+import { arrayRemove } from '../../utils';
+import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
+export class UndirectedVertex extends AbstractVertex {
     /**
      * The constructor function initializes a vertex with an optional value.
      * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
@@ -22,8 +19,7 @@ class UndirectedVertex extends abstract_graph_1.AbstractVertex {
         super(key, value);
     }
 }
-exports.UndirectedVertex = UndirectedVertex;
-class UndirectedEdge extends abstract_graph_1.AbstractEdge {
+export class UndirectedEdge extends AbstractEdge {
     vertices;
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
@@ -40,8 +36,7 @@ class UndirectedEdge extends abstract_graph_1.AbstractEdge {
         this.vertices = [v1, v2];
     }
 }
-exports.UndirectedEdge = UndirectedEdge;
-class UndirectedGraph extends abstract_graph_1.AbstractGraph {
+export class UndirectedGraph extends AbstractGraph {
     /**
      * The constructor initializes a new Map object to store edges.
      */
@@ -127,11 +122,11 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         const v1Edges = this._edges.get(vertex1);
         let removed = null;
         if (v1Edges) {
-            removed = (0, utils_1.arrayRemove)(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
+            removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
         }
         const v2Edges = this._edges.get(vertex2);
         if (v2Edges) {
-            (0, utils_1.arrayRemove)(v2Edges, (e) => e.vertices.includes(vertex1.key));
+            arrayRemove(v2Edges, (e) => e.vertices.includes(vertex1.key));
         }
         return removed;
     }
@@ -299,4 +294,3 @@ class UndirectedGraph extends abstract_graph_1.AbstractGraph {
         return true;
     }
 }
-exports.UndirectedGraph = UndirectedGraph;

package/dist/mjs/{src/data-structures → data-structures}/hash/coordinate-map.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CoordinateMap = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.CoordinateMap = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class CoordinateMap extends Map {
+export class CoordinateMap extends Map {
     constructor(joint) {
         super();
         if (joint !== undefined)
@@ -59,4 +56,3 @@ class CoordinateMap extends Map {
         return super.delete(key.join(this._joint));
     }
 }
-exports.CoordinateMap = CoordinateMap;

package/dist/mjs/{src/data-structures → data-structures}/hash/coordinate-set.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.CoordinateSet = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.CoordinateSet = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class CoordinateSet extends Set {
+export class CoordinateSet extends Set {
     constructor(joint) {
         super();
         if (joint !== undefined)
@@ -49,4 +46,3 @@ class CoordinateSet extends Set {
         return super.delete(value.join(this._joint));
     }
 }
-exports.CoordinateSet = CoordinateSet;

package/dist/mjs/{src/data-structures → data-structures}/hash/hash-map.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashMap = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.HashMap = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class HashMap {
+export class HashMap {
     /**
      * The constructor initializes the properties of a hash table, including the initial capacity, load factor, capacity
      * multiplier, size, table array, and hash function.
@@ -156,4 +153,3 @@ class HashMap {
         this._table = newTable; // Again, here is this._table
     }
 }
-exports.HashMap = HashMap;

package/dist/mjs/{src/data-structures → data-structures}/hash/hash-table.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,9 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.HashTable = exports.HashTableNode = void 0;
-class HashTableNode {
+export class HashTableNode {
     key;
     value;
     next;
@@ -18,8 +15,7 @@ class HashTableNode {
         this.next = null;
     }
 }
-exports.HashTableNode = HashTableNode;
-class HashTable {
+export class HashTable {
     static DEFAULT_CAPACITY = 16;
     static LOAD_FACTOR = 0.75;
     constructor(capacity = HashTable.DEFAULT_CAPACITY, hashFn) {
@@ -240,4 +236,3 @@ class HashTable {
         this._capacity = newCapacity;
     }
 }
-exports.HashTable = HashTable;

package/dist/mjs/data-structures/hash/index.js

@@ -0,0 +1,6 @@
+export * from './hash-table';
+export * from './coordinate-map';
+export * from './coordinate-set';
+export * from './tree-map';
+export * from './tree-set';
+export * from './hash-map';

package/dist/mjs/data-structures/hash/tree-map.js

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

package/dist/mjs/data-structures/hash/tree-set.js

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

package/dist/mjs/{src/data-structures → data-structures}/heap/heap.js

@@ -1,13 +1,10 @@
-"use strict";
 /**
  * data-structure-typed
  * @author Kirk Qi
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.FibonacciHeap = exports.FibonacciHeapNode = exports.Heap = void 0;
-class Heap {
+export class Heap {
     constructor(options) {
         this._comparator = options.comparator;
         if (options.nodes && options.nodes.length > 0) {
@@ -329,8 +326,7 @@ class Heap {
             this.sinkDown(i);
     }
 }
-exports.Heap = Heap;
-class FibonacciHeapNode {
+export class FibonacciHeapNode {
     element;
     degree;
     left;
@@ -344,8 +340,7 @@ class FibonacciHeapNode {
         this.marked = false;
     }
 }
-exports.FibonacciHeapNode = FibonacciHeapNode;
-class FibonacciHeap {
+export class FibonacciHeap {
     constructor(comparator) {
         this.clear();
         this._comparator = comparator || this.defaultComparator;
@@ -685,4 +680,3 @@ class FibonacciHeap {
         }
     }
 }
-exports.FibonacciHeap = FibonacciHeap;

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

@@ -0,0 +1,3 @@
+export * from './max-heap';
+export * from './min-heap';
+export * from './heap';

package/dist/mjs/{src/data-structures → data-structures}/heap/max-heap.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,10 +5,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MaxHeap = void 0;
-const heap_1 = require("./heap");
-class MaxHeap extends heap_1.Heap {
+import { Heap } from './heap';
+export class MaxHeap extends Heap {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MaxHeap extends heap_1.Heap {
         super(options);
     }
 }
-exports.MaxHeap = MaxHeap;

package/dist/mjs/{src/data-structures → data-structures}/heap/min-heap.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,10 +5,8 @@
  * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.MinHeap = void 0;
-const heap_1 = require("./heap");
-class MinHeap extends heap_1.Heap {
+import { Heap } from './heap';
+export class MinHeap extends Heap {
     constructor(options = {
         comparator: (a, b) => {
             if (!(typeof a === 'number' && typeof b === 'number')) {
@@ -23,4 +20,3 @@ class MinHeap extends heap_1.Heap {
         super(options);
     }
 }
-exports.MinHeap = MinHeap;

package/dist/mjs/data-structures/index.js

@@ -0,0 +1,11 @@
+export * from './hash';
+export * from './linked-list';
+export * from './stack';
+export * from './queue';
+export * from './graph';
+export * from './binary-tree';
+export * from './tree';
+export * from './heap';
+export * from './priority-queue';
+export * from './matrix';
+export * from './trie';

package/dist/mjs/{src/data-structures → data-structures}/linked-list/doubly-linked-list.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.DoublyLinkedList = exports.DoublyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class DoublyLinkedListNode {
+export class DoublyLinkedListNode {
     value;
     next;
     prev;
@@ -23,8 +20,7 @@ class DoublyLinkedListNode {
         this.prev = null;
     }
 }
-exports.DoublyLinkedListNode = DoublyLinkedListNode;
-class DoublyLinkedList {
+export class DoublyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -773,4 +769,3 @@ class DoublyLinkedList {
         }
     }
 }
-exports.DoublyLinkedList = DoublyLinkedList;

package/dist/mjs/data-structures/linked-list/index.js

@@ -0,0 +1,3 @@
+export * from './singly-linked-list';
+export * from './doubly-linked-list';
+export * from './skip-linked-list';

package/dist/mjs/{src/data-structures → data-structures}/linked-list/singly-linked-list.js

@@ -1,6 +1,3 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
 /**
  * data-structure-typed
  *
@@ -8,7 +5,7 @@ exports.SinglyLinkedList = exports.SinglyLinkedListNode = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-class SinglyLinkedListNode {
+export class SinglyLinkedListNode {
     value;
     next;
     /**
@@ -21,8 +18,7 @@ class SinglyLinkedListNode {
         this.next = null;
     }
 }
-exports.SinglyLinkedListNode = SinglyLinkedListNode;
-class SinglyLinkedList {
+export class SinglyLinkedList {
     /**
      * The constructor initializes the linked list with an empty head, tail, and length.
      */
@@ -717,4 +713,3 @@ class SinglyLinkedList {
         }
     }
 }
-exports.SinglyLinkedList = SinglyLinkedList;

package/dist/mjs/{src/data-structures → data-structures}/linked-list/skip-linked-list.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,9 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.SkipList = exports.SkipListNode = void 0;
-class SkipListNode {
+export class SkipListNode {
     key;
     value;
     forward;
@@ -18,8 +15,7 @@ class SkipListNode {
         this.forward = new Array(level);
     }
 }
-exports.SkipListNode = SkipListNode;
-class SkipList {
+export class SkipList {
     /**
      * The constructor initializes a SkipList with a specified maximum level and probability.
      * @param [maxLevel=16] - The `maxLevel` parameter represents the maximum level that a skip list can have. It determines
@@ -255,4 +251,3 @@ class SkipList {
         return level;
     }
 }
-exports.SkipList = SkipList;

package/dist/mjs/data-structures/matrix/index.js

@@ -0,0 +1,4 @@
+export * from './matrix';
+export * from './vector2d';
+export * from './matrix2d';
+export * from './navigator';