data-structure-typed 1.43.3 → 1.44.0

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/rb-tree.js

@@ -1,4 +1,3 @@
-"use strict";
 /**
  * data-structure-typed
  *
@@ -6,19 +5,16 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.RedBlackTree = exports.RedBlackTreeNode = void 0;
-const types_1 = require("../../types");
-const bst_1 = require("./bst");
-const binary_tree_1 = require("./binary-tree");
-class RedBlackTreeNode extends bst_1.BSTNode {
+import { RBTNColor } from '../../types';
+import { BST, BSTNode } from './bst';
+import { BinaryTreeNode } from './binary-tree';
+export class RedBlackTreeNode extends BSTNode {
     color;
-    constructor(key, value, color = types_1.RBTNColor.BLACK) {
+    constructor(key, value, color = RBTNColor.BLACK) {
         super(key, value);
         this.color = color;
     }
 }
-exports.RedBlackTreeNode = RedBlackTreeNode;
 /**
  * 1. Each node is either red or black.
  * 2. The root node is always black.
@@ -26,7 +22,7 @@ exports.RedBlackTreeNode = RedBlackTreeNode;
  * 4. Red nodes must have black children.
  * 5. Black balance: Every path from any node to each of its leaf nodes contains the same number of black nodes.
  */
-class RedBlackTree extends bst_1.BST {
+export class RedBlackTree extends BST {
     NIL = new RedBlackTreeNode(NaN);
     /**
      * The constructor function initializes a Red-Black Tree with an optional set of options.
@@ -63,7 +59,7 @@ class RedBlackTree extends bst_1.BST {
     add(keyOrNode, value) {
         let node;
         if (this.isNodeKey(keyOrNode)) {
-            node = this.createNode(keyOrNode, value, types_1.RBTNColor.RED);
+            node = this.createNode(keyOrNode, value, RBTNColor.RED);
         }
         else if (keyOrNode instanceof RedBlackTreeNode) {
             node = keyOrNode;
@@ -101,7 +97,7 @@ class RedBlackTree extends bst_1.BST {
             y.right = node;
         }
         if (node.parent === undefined) {
-            node.color = types_1.RBTNColor.BLACK;
+            node.color = RBTNColor.BLACK;
             this._size++;
             return;
         }
@@ -112,7 +108,7 @@ class RedBlackTree extends bst_1.BST {
         this._fixInsert(node);
         this._size++;
     }
-    createNode(key, value, color = types_1.RBTNColor.BLACK) {
+    createNode(key, value, color = RBTNColor.BLACK) {
         return new RedBlackTreeNode(key, value, color);
     }
     /**
@@ -183,7 +179,7 @@ class RedBlackTree extends bst_1.BST {
                 y.left.parent = y;
                 y.color = z.color;
             }
-            if (yOriginalColor === types_1.RBTNColor.BLACK) {
+            if (yOriginalColor === RBTNColor.BLACK) {
                 this._fixDelete(x);
             }
             this._size--;
@@ -221,7 +217,7 @@ class RedBlackTree extends bst_1.BST {
      * @returns a value of type `N`, `null`, or `undefined`.
      */
     getNode(identifier, callback = this._defaultOneParamCallback, beginRoot = this.root, iterationType = this.iterationType) {
-        if (identifier instanceof binary_tree_1.BinaryTreeNode)
+        if (identifier instanceof BinaryTreeNode)
             callback = (node => node);
         beginRoot = this.ensureNotKey(beginRoot);
         return this.getNodes(identifier, callback, true, beginRoot, iterationType)[0] ?? undefined;
@@ -363,32 +359,32 @@ class RedBlackTree extends bst_1.BST {
      */
     _fixDelete(x) {
         let s;
-        while (x !== this.root && x.color === types_1.RBTNColor.BLACK) {
+        while (x !== this.root && x.color === RBTNColor.BLACK) {
             if (x.parent && x === x.parent.left) {
                 s = x.parent.right;
                 if (s.color === 1) {
-                    s.color = types_1.RBTNColor.BLACK;
-                    x.parent.color = types_1.RBTNColor.RED;
+                    s.color = RBTNColor.BLACK;
+                    x.parent.color = RBTNColor.RED;
                     this._leftRotate(x.parent);
                     s = x.parent.right;
                 }
-                if (s.left !== undefined && s.left.color === types_1.RBTNColor.BLACK && s.right && s.right.color === types_1.RBTNColor.BLACK) {
-                    s.color = types_1.RBTNColor.RED;
+                if (s.left !== undefined && s.left.color === RBTNColor.BLACK && s.right && s.right.color === RBTNColor.BLACK) {
+                    s.color = RBTNColor.RED;
                     x = x.parent;
                 }
                 else {
-                    if (s.right && s.right.color === types_1.RBTNColor.BLACK) {
+                    if (s.right && s.right.color === RBTNColor.BLACK) {
                         if (s.left)
-                            s.left.color = types_1.RBTNColor.BLACK;
-                        s.color = types_1.RBTNColor.RED;
+                            s.left.color = RBTNColor.BLACK;
+                        s.color = RBTNColor.RED;
                         this._rightRotate(s);
                         s = x.parent.right;
                     }
                     if (s)
                         s.color = x.parent.color;
-                    x.parent.color = types_1.RBTNColor.BLACK;
+                    x.parent.color = RBTNColor.BLACK;
                     if (s && s.right)
-                        s.right.color = types_1.RBTNColor.BLACK;
+                        s.right.color = RBTNColor.BLACK;
                     this._leftRotate(x.parent);
                     x = this.root;
                 }
@@ -396,34 +392,34 @@ class RedBlackTree extends bst_1.BST {
             else {
                 s = x.parent.left;
                 if (s.color === 1) {
-                    s.color = types_1.RBTNColor.BLACK;
-                    x.parent.color = types_1.RBTNColor.RED;
+                    s.color = RBTNColor.BLACK;
+                    x.parent.color = RBTNColor.RED;
                     this._rightRotate(x.parent);
                     s = x.parent.left;
                 }
-                if (s && s.right && s.right.color === types_1.RBTNColor.BLACK && s.right.color === types_1.RBTNColor.BLACK) {
-                    s.color = types_1.RBTNColor.RED;
+                if (s && s.right && s.right.color === RBTNColor.BLACK && s.right.color === RBTNColor.BLACK) {
+                    s.color = RBTNColor.RED;
                     x = x.parent;
                 }
                 else {
-                    if (s && s.left && s.left.color === types_1.RBTNColor.BLACK) {
+                    if (s && s.left && s.left.color === RBTNColor.BLACK) {
                         if (s.right)
-                            s.right.color = types_1.RBTNColor.BLACK;
-                        s.color = types_1.RBTNColor.RED;
+                            s.right.color = RBTNColor.BLACK;
+                        s.color = RBTNColor.RED;
                         this._leftRotate(s);
                         s = x.parent.left;
                     }
                     if (s)
                         s.color = x.parent.color;
-                    x.parent.color = types_1.RBTNColor.BLACK;
+                    x.parent.color = RBTNColor.BLACK;
                     if (s && s.left)
-                        s.left.color = types_1.RBTNColor.BLACK;
+                        s.left.color = RBTNColor.BLACK;
                     this._rightRotate(x.parent);
                     x = this.root;
                 }
             }
         }
-        x.color = types_1.RBTNColor.BLACK;
+        x.color = RBTNColor.BLACK;
     }
     /**
      * Time Complexity: O(1)
@@ -467,9 +463,9 @@ class RedBlackTree extends bst_1.BST {
             if (k.parent.parent && k.parent === k.parent.parent.right) {
                 u = k.parent.parent.left;
                 if (u && u.color === 1) {
-                    u.color = types_1.RBTNColor.BLACK;
-                    k.parent.color = types_1.RBTNColor.BLACK;
-                    k.parent.parent.color = types_1.RBTNColor.RED;
+                    u.color = RBTNColor.BLACK;
+                    k.parent.color = RBTNColor.BLACK;
+                    k.parent.parent.color = RBTNColor.RED;
                     k = k.parent.parent;
                 }
                 else {
@@ -477,17 +473,17 @@ class RedBlackTree extends bst_1.BST {
                         k = k.parent;
                         this._rightRotate(k);
                     }
-                    k.parent.color = types_1.RBTNColor.BLACK;
-                    k.parent.parent.color = types_1.RBTNColor.RED;
+                    k.parent.color = RBTNColor.BLACK;
+                    k.parent.parent.color = RBTNColor.RED;
                     this._leftRotate(k.parent.parent);
                 }
             }
             else {
                 u = k.parent.parent.right;
                 if (u && u.color === 1) {
-                    u.color = types_1.RBTNColor.BLACK;
-                    k.parent.color = types_1.RBTNColor.BLACK;
-                    k.parent.parent.color = types_1.RBTNColor.RED;
+                    u.color = RBTNColor.BLACK;
+                    k.parent.color = RBTNColor.BLACK;
+                    k.parent.parent.color = RBTNColor.RED;
                     k = k.parent.parent;
                 }
                 else {
@@ -495,8 +491,8 @@ class RedBlackTree extends bst_1.BST {
                         k = k.parent;
                         this._leftRotate(k);
                     }
-                    k.parent.color = types_1.RBTNColor.BLACK;
-                    k.parent.parent.color = types_1.RBTNColor.RED;
+                    k.parent.color = RBTNColor.BLACK;
+                    k.parent.parent.color = RBTNColor.RED;
                     this._rightRotate(k.parent.parent);
                 }
             }
@@ -504,7 +500,6 @@ class RedBlackTree extends bst_1.BST {
                 break;
             }
         }
-        this.root.color = types_1.RBTNColor.BLACK;
+        this.root.color = RBTNColor.BLACK;
     }
 }
-exports.RedBlackTree = RedBlackTree;

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/segment-tree.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.SegmentTree = exports.SegmentTreeNode = void 0;
-class SegmentTreeNode {
+export class SegmentTreeNode {
     start = 0;
     end = 0;
     value = null;
@@ -22,8 +19,7 @@ class SegmentTreeNode {
         this.value = value || null;
     }
 }
-exports.SegmentTreeNode = SegmentTreeNode;
-class SegmentTree {
+export class SegmentTree {
     /**
      * The constructor initializes the values, start, end, and root properties of an object.
      * @param {number[]} values - An array of numbers that will be used to build a binary search tree.
@@ -179,4 +175,3 @@ class SegmentTree {
         return dfs(root, indexA, indexB);
     }
 }
-exports.SegmentTree = SegmentTree;

package/dist/mjs/{src/data-structures → data-structures}/binary-tree/tree-multimap.js

@@ -1,9 +1,6 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.TreeMultimap = exports.TreeMultimapNode = void 0;
-const types_1 = require("../../types");
-const avl_tree_1 = require("./avl-tree");
-class TreeMultimapNode extends avl_tree_1.AVLTreeNode {
+import { CP, FamilyPosition, IterationType } from '../../types';
+import { AVLTree, AVLTreeNode } from './avl-tree';
+export class TreeMultimapNode extends AVLTreeNode {
     count;
     /**
      * The constructor function initializes a BinaryTreeNode object with a key, value, and count.
@@ -20,11 +17,10 @@ class TreeMultimapNode extends avl_tree_1.AVLTreeNode {
         this.count = count;
     }
 }
-exports.TreeMultimapNode = TreeMultimapNode;
 /**
  * The only distinction between a TreeMultimap and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
  */
-class TreeMultimap extends avl_tree_1.AVLTree {
+export class TreeMultimap extends AVLTree {
     /**
      * The constructor function for a TreeMultimap class in TypeScript, which extends another class and sets an option to
      * merge duplicated values.
@@ -94,14 +90,14 @@ class TreeMultimap extends avl_tree_1.AVLTree {
             while (traversing) {
                 if (cur) {
                     if (newNode) {
-                        if (this._compare(cur.key, newNode.key) === types_1.CP.eq) {
+                        if (this._compare(cur.key, newNode.key) === CP.eq) {
                             cur.value = newNode.value;
                             cur.count += newNode.count;
                             this._count += newNode.count;
                             traversing = false;
                             inserted = cur;
                         }
-                        else if (this._compare(cur.key, newNode.key) === types_1.CP.gt) {
+                        else if (this._compare(cur.key, newNode.key) === CP.gt) {
                             // Traverse left of the node
                             if (cur.left === undefined) {
                                 //Add to the left of the current node
@@ -117,7 +113,7 @@ class TreeMultimap extends avl_tree_1.AVLTree {
                                     cur = cur.left;
                             }
                         }
-                        else if (this._compare(cur.key, newNode.key) === types_1.CP.lt) {
+                        else if (this._compare(cur.key, newNode.key) === CP.lt) {
                             // Traverse right of the node
                             if (cur.right === undefined) {
                                 //Add to the right of the current node
@@ -200,7 +196,7 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         if (sorted.length < 1)
             return false;
         this.clear();
-        if (iterationType === types_1.IterationType.RECURSIVE) {
+        if (iterationType === IterationType.RECURSIVE) {
             const buildBalanceBST = (l, r) => {
                 if (l > r)
                     return;
@@ -275,10 +271,10 @@ class TreeMultimap extends avl_tree_1.AVLTree {
                 }
                 else {
                     const { familyPosition: fp } = curr;
-                    if (fp === types_1.FamilyPosition.LEFT || fp === types_1.FamilyPosition.ROOT_LEFT) {
+                    if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
                         parent.left = curr.right;
                     }
-                    else if (fp === types_1.FamilyPosition.RIGHT || fp === types_1.FamilyPosition.ROOT_RIGHT) {
+                    else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
                         parent.right = curr.right;
                     }
                     needBalanced = parent;
@@ -395,4 +391,3 @@ class TreeMultimap extends avl_tree_1.AVLTree {
         return undefined;
     }
 }
-exports.TreeMultimap = TreeMultimap;

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) {
@@ -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;