data-structure-typed 1.41.7 → 1.41.8

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.41.7",
+  "version": "1.41.8",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/cjs/src/index.js",
   "module": "dist/mjs/src/index.js",

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/test/performance/data-structures/binary-tree/avl-tree.test.ts

@@ -4,17 +4,17 @@ import {getRandomIntArray, magnitude} from '../../../utils';
 
 const suite = new Benchmark.Suite();
 const avl = new AVLTree<number>();
-const {N_LOG_N} = magnitude;
-const arr = getRandomIntArray(N_LOG_N, 0, N_LOG_N, true);
+const {TEN_THOUSAND} = magnitude;
+const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
 
 suite
-  .add(`${N_LOG_N} add randomly`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} add randomly`, () => {
     avl.clear();
     for (let i = 0; i < arr.length; i++) {
       avl.add(arr[i]);
     }
   })
-  .add(`${N_LOG_N} add & delete randomly`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} add & delete randomly`, () => {
     avl.clear();
     for (let i = 0; i < arr.length; i++) {
       avl.add(arr[i]);
@@ -23,11 +23,11 @@ suite
       avl.delete(arr[i]);
     }
   })
-  .add(`${N_LOG_N} addMany`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} addMany`, () => {
     avl.clear();
     avl.addMany(arr);
   })
-  .add(`${N_LOG_N} get`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} get`, () => {
     for (let i = 0; i < arr.length; i++) {
       avl.get(arr[i]);
     }

package/test/performance/data-structures/binary-tree/binary-tree.test.ts

@@ -8,13 +8,13 @@ const {N_LOG_N} = magnitude;
 const arr = getRandomIntArray(N_LOG_N, 0, N_LOG_N, true);
 
 suite
-  .add(`${N_LOG_N} add randomly`, () => {
+  .add(`${N_LOG_N.toLocaleString()} add randomly`, () => {
     biTree.clear();
     for (let i = 0; i < arr.length; i++) {
       biTree.add(arr[i]);
     }
   })
-  .add(`${N_LOG_N} add & delete randomly`, () => {
+  .add(`${N_LOG_N.toLocaleString()} add & delete randomly`, () => {
     biTree.clear();
     for (let i = 0; i < arr.length; i++) {
       biTree.add(arr[i]);
@@ -23,22 +23,22 @@ suite
       biTree.delete(arr[i]);
     }
   })
-  .add(`${N_LOG_N} addMany`, () => {
+  .add(`${N_LOG_N.toLocaleString()} addMany`, () => {
     biTree.clear();
     biTree.addMany(arr);
   })
-  .add(`${N_LOG_N} get`, () => {
+  .add(`${N_LOG_N.toLocaleString()} get`, () => {
     for (let i = 0; i < arr.length; i++) {
       biTree.get(arr[i]);
     }
   })
-  .add(`${N_LOG_N} dfs`, () => {
+  .add(`${N_LOG_N.toLocaleString()} dfs`, () => {
     for (let i = 0; i < N_LOG_N; i++) biTree.dfs();
   })
-  .add(`${N_LOG_N} bfs`, () => {
+  .add(`${N_LOG_N.toLocaleString()} bfs`, () => {
     for (let i = 0; i < N_LOG_N; i++) biTree.bfs();
   })
-  .add(`${N_LOG_N} morris`, () => {
+  .add(`${N_LOG_N.toLocaleString()} morris`, () => {
     for (let i = 0; i < N_LOG_N; i++) biTree.morris(n => n, 'pre');
   });
 

package/test/performance/data-structures/binary-tree/bst.test.ts

@@ -4,17 +4,17 @@ import {getRandomIntArray, magnitude} from '../../../utils';
 
 const suite = new Benchmark.Suite();
 const bst = new BST<number>();
-const {N_LOG_N} = magnitude;
-const arr = getRandomIntArray(N_LOG_N, 0, N_LOG_N, true);
+const {TEN_THOUSAND} = magnitude;
+const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
 
 suite
-  .add(`${N_LOG_N} add randomly`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} add randomly`, () => {
     bst.clear();
     for (let i = 0; i < arr.length; i++) {
       bst.add(arr[i]);
     }
   })
-  .add(`${N_LOG_N} add & delete randomly`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} add & delete randomly`, () => {
     bst.clear();
     for (let i = 0; i < arr.length; i++) {
       bst.add(arr[i]);
@@ -23,11 +23,11 @@ suite
       bst.delete(arr[i]);
     }
   })
-  .add(`${N_LOG_N} addMany`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} addMany`, () => {
     bst.clear();
     bst.addMany(arr);
   })
-  .add(`${N_LOG_N} get`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} get`, () => {
     for (let i = 0; i < arr.length; i++) {
       bst.get(arr[i]);
     }

package/test/performance/data-structures/binary-tree/rb-tree.test.ts

@@ -0,0 +1,32 @@
+import {RedBlackTree} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomIntArray, magnitude} from '../../../utils';
+
+const suite = new Benchmark.Suite();
+const rbTree = new RedBlackTree();
+const {HUNDRED_THOUSAND} = magnitude;
+const arr = getRandomIntArray(HUNDRED_THOUSAND, 0, HUNDRED_THOUSAND, true);
+
+suite
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} add randomly`, () => {
+    rbTree.clear();
+    for (let i = 0; i < arr.length; i++) {
+      rbTree.add(arr[i]);
+    }
+  })
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} add & 1000 delete randomly`, () => {
+    rbTree.clear();
+    for (let i = 0; i < arr.length; i++) {
+      rbTree.add(arr[i]);
+    }
+    for (let i = 0; i < 1000; i++) {
+      rbTree.delete(arr[i]);
+    }
+  })
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} getNode`, () => {
+    for (let i = 0; i < arr.length; i++) {
+      rbTree.getNode(arr[i]);
+    }
+  });
+
+export {suite};

package/test/performance/data-structures/graph/directed-graph.test.ts

@@ -8,24 +8,24 @@ const graph = new DirectedGraph<number, number>();
 const vertexes = getRandomWords(THOUSAND);
 
 suite
-  .add(`${THOUSAND} addVertex`, () => {
+  .add(`${THOUSAND.toLocaleString()} addVertex`, () => {
     for (const v of vertexes) {
       graph.addVertex(v);
     }
   })
-  .add(`${THOUSAND} addEdge`, () => {
+  .add(`${THOUSAND.toLocaleString()} addEdge`, () => {
     for (let i = 0; i < THOUSAND; i++) {
       const v1 = vertexes[getRandomIndex(vertexes)];
       const v2 = vertexes[getRandomIndex(vertexes)];
       graph.addEdge(v1, v2);
     }
   })
-  .add(`${THOUSAND} getVertex`, () => {
+  .add(`${THOUSAND.toLocaleString()} getVertex`, () => {
     for (let i = 0; i < THOUSAND; i++) {
       graph.getVertex(vertexes[getRandomIndex(vertexes)]);
     }
   })
-  .add(`${THOUSAND} getEdge`, () => {
+  .add(`${THOUSAND.toLocaleString()} getEdge`, () => {
     for (let i = 0; i < THOUSAND; i++) {
       graph.getEdge(vertexes[getRandomIndex(vertexes)], vertexes[getRandomIndex(vertexes)]);
     }

package/test/performance/data-structures/heap/heap.test.ts

@@ -3,26 +3,26 @@ import * as Benchmark from 'benchmark';
 import {magnitude} from '../../../utils';
 
 const suite = new Benchmark.Suite();
-const {N_LOG_N} = magnitude;
+const {TEN_THOUSAND} = magnitude;
 
 suite
-  .add(`${N_LOG_N} add & pop`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
     const heap = new Heap<number>({comparator: (a, b) => b - a});
 
-    for (let i = 0; i < N_LOG_N; i++) {
+    for (let i = 0; i < TEN_THOUSAND; i++) {
       heap.add(i);
     }
 
-    for (let i = 0; i < N_LOG_N; i++) {
+    for (let i = 0; i < TEN_THOUSAND; i++) {
       heap.pop();
     }
   })
-  .add(`${N_LOG_N} fib add & pop`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} fib add & pop`, () => {
     const fbHeap = new FibonacciHeap<number>();
-    for (let i = 1; i <= N_LOG_N; i++) {
+    for (let i = 1; i <= TEN_THOUSAND; i++) {
       fbHeap.push(i);
     }
-    for (let i = 1; i <= N_LOG_N; i++) {
+    for (let i = 1; i <= TEN_THOUSAND; i++) {
       fbHeap.pop();
     }
   });

package/test/performance/data-structures/linked-list/doubly-linked-list.test.ts

@@ -3,17 +3,17 @@ import * as Benchmark from 'benchmark';
 import {magnitude} from '../../../utils';
 
 const suite = new Benchmark.Suite();
-const {LINEAR, N_LOG_N} = magnitude;
+const {LINEAR} = magnitude;
 
 suite
-  .add(`${LINEAR} unshift`, () => {
+  .add(`${LINEAR.toLocaleString()} unshift`, () => {
     const list = new DoublyLinkedList<number>();
 
     for (let i = 0; i < LINEAR; i++) {
       list.unshift(i);
     }
   })
-  .add(`${LINEAR} unshift & shift`, () => {
+  .add(`${LINEAR.toLocaleString()} unshift & shift`, () => {
     const list = new DoublyLinkedList<number>();
 
     for (let i = 0; i < LINEAR; i++) {
@@ -23,11 +23,11 @@ suite
       list.shift();
     }
   })
-  .add(`${N_LOG_N} insertBefore`, () => {
+  .add(`${LINEAR.toLocaleString()} insertBefore`, () => {
     const doublyList = new DoublyLinkedList<number>();
     let midNode: DoublyLinkedListNode | null = null;
-    const midIndex = Math.floor(N_LOG_N / 2);
-    for (let i = 0; i < N_LOG_N; i++) {
+    const midIndex = Math.floor(LINEAR / 2);
+    for (let i = 0; i < LINEAR; i++) {
       doublyList.push(i);
       if (i === midIndex) {
         midNode = doublyList.getNode(i);

package/test/performance/data-structures/linked-list/singly-linked-list.test.ts

@@ -3,25 +3,25 @@ import * as Benchmark from 'benchmark';
 import {magnitude} from '../../../utils';
 
 const suite = new Benchmark.Suite();
-const {N_LOG_N} = magnitude;
+const {TEN_THOUSAND} = magnitude;
 
 suite
-  .add(`${N_LOG_N} push & pop`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} push & pop`, () => {
     const list = new SinglyLinkedList<number>();
 
-    for (let i = 0; i < N_LOG_N; i++) {
+    for (let i = 0; i < TEN_THOUSAND; i++) {
       list.push(i);
     }
 
-    for (let i = 0; i < N_LOG_N; i++) {
+    for (let i = 0; i < TEN_THOUSAND; i++) {
       list.pop();
     }
   })
-  .add(`${N_LOG_N} insertBefore`, () => {
+  .add(`${TEN_THOUSAND.toLocaleString()} insertBefore`, () => {
     const singlyList = new SinglyLinkedList<number>();
     let midSinglyNode: SinglyLinkedListNode | null = null;
-    const midIndex = Math.floor(N_LOG_N / 2);
-    for (let i = 0; i < N_LOG_N; i++) {
+    const midIndex = Math.floor(TEN_THOUSAND / 2);
+    for (let i = 0; i < TEN_THOUSAND; i++) {
       singlyList.push(i);
       if (i === midIndex) {
         midSinglyNode = singlyList.getNode(i);

package/test/performance/data-structures/priority-queue/max-priority-queue.test.ts

@@ -5,7 +5,7 @@ import {magnitude} from '../../../utils';
 const suite = new Benchmark.Suite();
 const {TEN_THOUSAND} = magnitude;
 
-suite.add(`${TEN_THOUSAND} refill & poll`, () => {
+suite.add(`${TEN_THOUSAND.toLocaleString()} refill & poll`, () => {
   const nodes = Array.from(
     new Set<number>(Array.from(new Array(TEN_THOUSAND), () => Math.floor(Math.random() * TEN_THOUSAND * 100)))
   );

package/test/performance/data-structures/queue/deque.test.ts

@@ -6,13 +6,13 @@ export const suite = new Benchmark.Suite();
 const {LINEAR} = magnitude;
 
 suite
-  .add(`${LINEAR} push`, () => {
+  .add(`${LINEAR.toLocaleString()} push`, () => {
     const deque = new Deque<number>();
     for (let i = 0; i < LINEAR; i++) {
       deque.push(i);
     }
   })
-  .add(`${LINEAR} shift`, () => {
+  .add(`${LINEAR.toLocaleString()} shift`, () => {
     const deque = new Deque<number>();
     for (let i = 0; i < LINEAR; i++) {
       deque.push(i);

package/test/performance/data-structures/queue/queue.test.ts

@@ -6,14 +6,14 @@ const suite = new Benchmark.Suite();
 const {LINEAR} = magnitude;
 
 suite
-  .add(`${LINEAR} push`, () => {
+  .add(`${LINEAR.toLocaleString()} push`, () => {
     const queue = new Queue<number>();
 
     for (let i = 0; i < LINEAR; i++) {
       queue.push(i);
     }
   })
-  .add(`${LINEAR} push & shift`, () => {
+  .add(`${LINEAR.toLocaleString()} push & shift`, () => {
     const queue = new Queue<number>();
 
     for (let i = 0; i < LINEAR; i++) {

package/test/performance/data-structures/trie/trie.test.ts

@@ -8,12 +8,12 @@ const trie = new Trie();
 const randomWords = getRandomWords(HUNDRED_THOUSAND, false);
 
 suite
-  .add(`${HUNDRED_THOUSAND} push`, () => {
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} push`, () => {
     for (let i = 0; i < randomWords.length; i++) {
       trie.add(randomWords[i]);
     }
   })
-  .add(`${HUNDRED_THOUSAND} getWords`, () => {
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} getWords`, () => {
     for (let i = 0; i < randomWords.length; i++) {
       trie.getWords(randomWords[i]);
     }

package/test/performance/reportor.ts

@@ -126,11 +126,10 @@ function replaceMarkdownContent(startMarker: string, endMarker: string, newText:
     }
 
     // Replace the old content with the new text
-    const updatedMarkdown =
-      data.slice(0, startIndex + startMarker.length) + '\n' + newText + data.slice(endIndex);
+    const updatedMarkdown = data.slice(0, startIndex + startMarker.length) + '\n' + newText + data.slice(endIndex);
 
     // Try writing the modified content back to the file
-    fs.writeFile(filePath, updatedMarkdown, 'utf8', (err) => {
+    fs.writeFile(filePath, updatedMarkdown, 'utf8', err => {
       if (err) {
         console.error(`Unable to write to ${filePath}:`, err);
       } else {
@@ -145,7 +144,7 @@ performanceTests.forEach(item => {
   const relativeFilePath = path.relative(__dirname, file);
   const directory = path.dirname(relativeFilePath);
   const fileName = path.basename(relativeFilePath);
-  console.log(`${BG_YELLOW}Running in${END}: ${GRAY}${directory}/${END}${CYAN}${fileName}${END}`);
+  console.log(`${BG_YELLOW} Running ${END} ${GRAY}${directory}/${END}${CYAN}${fileName}${END}`);
 
   if (suite) {
     let runTime = 0;
@@ -159,8 +158,8 @@ performanceTests.forEach(item => {
             'test name': benchmark.name,
             'time taken (ms)': numberFix(benchmark.times.period * 1000, 2),
             'executions per sec': numberFix(benchmark.hz, 2),
-            'executed times': numberFix(benchmark.count, 0),
-            'sample mean (secs)': numberFix(benchmark.stats.mean, 2),
+            // 'executed times': numberFix(benchmark.count, 0),
+            // 'sample mean (secs)': numberFix(benchmark.stats.mean, 2),
             'sample deviation': numberFix(benchmark.stats.deviation, 2)
           };
         });