min-heap-typed 1.41.6 → 1.41.8

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

@@ -26,6 +26,8 @@ export declare class RedBlackTree {
     constructor();
     protected _root: RBTreeNode;
     get root(): RBTreeNode;
+    protected _size: number;
+    get size(): number;
     /**
      * The `insert` function inserts a new node with a given key into a red-black tree and fixes any
      * violations of the red-black tree properties.
@@ -33,11 +35,11 @@ export declare class RedBlackTree {
      * the RBTree.
      * @returns The function does not explicitly return anything.
      */
-    insert(key: number): void;
+    add(key: number): void;
     /**
      * The `delete` function in TypeScript is used to remove a node with a specific key from a red-black
      * tree.
-     * @param {RBTreeNode} node - The `node` parameter is of type `RBTreeNode` and represents the current
+     * @param {number} key - The `node` parameter is of type `RBTreeNode` and represents the current
      * node being processed in the delete operation.
      * @returns The `delete` function does not return anything. It has a return type of `void`.
      */
@@ -80,6 +82,7 @@ export declare class RedBlackTree {
      * @returns the predecessor of the given RBTreeNode 'x'.
      */
     getPredecessor(x: RBTreeNode): RBTreeNode;
+    clear(): void;
     print(beginRoot?: RBTreeNode): void;
     /**
      * The function performs a left rotation on a red-black tree node.

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

@@ -30,11 +30,15 @@ exports.NIL = new RBTreeNode(0);
  */
 class RedBlackTree {
     constructor() {
+        this._size = 0;
         this._root = exports.NIL;
     }
     get root() {
         return this._root;
     }
+    get size() {
+        return this._size;
+    }
     /**
      * The `insert` function inserts a new node with a given key into a red-black tree and fixes any
      * violations of the red-black tree properties.
@@ -42,7 +46,7 @@ class RedBlackTree {
      * the RBTree.
      * @returns The function does not explicitly return anything.
      */
-    insert(key) {
+    add(key) {
         const node = new RBTreeNode(key, types_1.RBTNColor.RED);
         node.left = exports.NIL;
         node.right = exports.NIL;
@@ -69,17 +73,20 @@ class RedBlackTree {
         }
         if (node.parent === null) {
             node.color = types_1.RBTNColor.BLACK;
+            this._size++;
             return;
         }
         if (node.parent.parent === null) {
+            this._size++;
             return;
         }
         this._fixInsert(node);
+        this._size++;
     }
     /**
      * The `delete` function in TypeScript is used to remove a node with a specific key from a red-black
      * tree.
-     * @param {RBTreeNode} node - The `node` parameter is of type `RBTreeNode` and represents the current
+     * @param {number} key - The `node` parameter is of type `RBTreeNode` and represents the current
      * node being processed in the delete operation.
      * @returns The `delete` function does not return anything. It has a return type of `void`.
      */
@@ -99,6 +106,7 @@ class RedBlackTree {
                 }
             }
             if (z === exports.NIL) {
+                this._size--;
                 return;
             }
             y = z;
@@ -131,6 +139,7 @@ class RedBlackTree {
             if (yOriginalColor === types_1.RBTNColor.BLACK) {
                 this._fixDelete(x);
             }
+            this._size--;
         };
         helper(this.root);
     }
@@ -219,6 +228,10 @@ class RedBlackTree {
         }
         return y;
     }
+    clear() {
+        this._root = exports.NIL;
+        this._size = 0;
+    }
     print(beginRoot = this.root) {
         const display = (root) => {
             const [lines, , ,] = _displayAux(root);

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

@@ -172,21 +172,21 @@ class AbstractGraph {
             return [];
         }
         const dfs = (cur, dest, visiting, path) => {
-            visiting.set(cur, true);
+            visiting.add(cur);
             if (cur === dest) {
                 paths.push([vertex1, ...path]);
             }
             const neighbors = this.getNeighbors(cur);
             for (const neighbor of neighbors) {
-                if (!visiting.get(neighbor)) {
+                if (!visiting.has(neighbor)) {
                     path.push(neighbor);
                     dfs(neighbor, dest, visiting, path);
-                    (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
+                    path.pop();
                 }
             }
-            visiting.set(cur, false);
+            visiting.delete(cur);
         };
-        dfs(vertex1, vertex2, new Map(), []);
+        dfs(vertex1, vertex2, new Set(), []);
         return paths;
     }
     /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.41.6",
+  "version": "1.41.8",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.41.6"
+    "data-structure-typed": "^1.41.8"
   }
 }

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

@@ -142,7 +142,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
   }
 
   protected defaultOneParamCallback = (node: N) => node.key;
-  
+
   /**
    * Creates a new instance of BinaryTreeNode with the given key and value.
    * @param {BTNKey} key - The key for the new node.

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

@@ -36,7 +36,7 @@ export class BST<V = any, N extends BSTNode<V, N> = BSTNode<V, BSTNodeNested<V>>
       }
     }
   }
-  
+
   /**
    * The function creates a new binary search tree node with the given key and value.
    * @param {BTNKey} key - The key parameter is the key value that will be associated with

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

@@ -44,6 +44,12 @@ export class RedBlackTree {
     return this._root;
   }
 
+  protected _size: number = 0;
+
+  get size(): number {
+    return this._size;
+  }
+
   /**
    * The `insert` function inserts a new node with a given key into a red-black tree and fixes any
    * violations of the red-black tree properties.
@@ -51,7 +57,7 @@ export class RedBlackTree {
    * the RBTree.
    * @returns The function does not explicitly return anything.
    */
-  insert(key: number): void {
+  add(key: number): void {
     const node: RBTreeNode = new RBTreeNode(key, RBTNColor.RED);
     node.left = NIL;
     node.right = NIL;
@@ -79,20 +85,23 @@ export class RedBlackTree {
 
     if (node.parent === null) {
       node.color = RBTNColor.BLACK;
+      this._size++;
       return;
     }
 
     if (node.parent.parent === null) {
+      this._size++;
       return;
     }
 
     this._fixInsert(node);
+    this._size++;
   }
 
   /**
    * The `delete` function in TypeScript is used to remove a node with a specific key from a red-black
    * tree.
-   * @param {RBTreeNode} node - The `node` parameter is of type `RBTreeNode` and represents the current
+   * @param {number} key - The `node` parameter is of type `RBTreeNode` and represents the current
    * node being processed in the delete operation.
    * @returns The `delete` function does not return anything. It has a return type of `void`.
    */
@@ -113,6 +122,7 @@ export class RedBlackTree {
       }
 
       if (z === NIL) {
+        this._size--;
         return;
       }
 
@@ -144,6 +154,7 @@ export class RedBlackTree {
       if (yOriginalColor === RBTNColor.BLACK) {
         this._fixDelete(x);
       }
+      this._size--;
     };
     helper(this.root);
   }
@@ -241,6 +252,11 @@ export class RedBlackTree {
     return y;
   }
 
+  clear() {
+    this._root = NIL;
+    this._size = 0;
+  }
+
   print(beginRoot: RBTreeNode = this.root) {
     const display = (root: RBTreeNode | null): void => {
       const [lines, , ,] = _displayAux(root);

package/src/data-structures/graph/abstract-graph.ts

@@ -233,8 +233,8 @@ export abstract class AbstractGraph<
       return [];
     }
 
-    const dfs = (cur: VO, dest: VO, visiting: Map<VO, boolean>, path: VO[]) => {
-      visiting.set(cur, true);
+    const dfs = (cur: VO, dest: VO, visiting: Set<VO>, path: VO[]) => {
+      visiting.add(cur);
 
       if (cur === dest) {
         paths.push([vertex1, ...path]);
@@ -242,17 +242,17 @@ export abstract class AbstractGraph<
 
       const neighbors = this.getNeighbors(cur);
       for (const neighbor of neighbors) {
-        if (!visiting.get(neighbor)) {
+        if (!visiting.has(neighbor)) {
           path.push(neighbor);
           dfs(neighbor, dest, visiting, path);
-          arrayRemove(path, (vertex: VO) => vertex === neighbor);
+          path.pop();
         }
       }
 
-      visiting.set(cur, false);
+      visiting.delete(cur);
     };
 
-    dfs(vertex1, vertex2, new Map<VO, boolean>(), []);
+    dfs(vertex1, vertex2, new Set<VO>(), []);
     return paths;
   }