data-structure-typed 1.41.7 → 1.41.9

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.41.7",
+  "version": "1.41.9",
   "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",
@@ -64,10 +64,10 @@
     "@typescript-eslint/eslint-plugin": "^6.7.4",
     "@typescript-eslint/parser": "^6.7.4",
     "auto-changelog": "^2.4.0",
-    "avl-tree-typed": "^1.41.6",
+    "avl-tree-typed": "^1.41.8",
     "benchmark": "^2.1.4",
-    "binary-tree-typed": "^1.41.6",
-    "bst-typed": "^1.41.6",
+    "binary-tree-typed": "^1.41.8",
+    "bst-typed": "^1.41.8",
     "dependency-cruiser": "^14.1.0",
     "eslint": "^8.50.0",
     "eslint-config-prettier": "^9.0.0",
@@ -75,7 +75,7 @@
     "eslint-import-resolver-typescript": "^3.6.1",
     "eslint-plugin-import": "^2.28.1",
     "fast-glob": "^3.3.1",
-    "heap-typed": "^1.41.6",
+    "heap-typed": "^1.41.8",
     "istanbul-badges-readme": "^1.8.5",
     "jest": "^29.7.0",
     "prettier": "^3.0.3",

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

@@ -1,11 +1,11 @@
 /**
  * data-structure-typed
  *
- * @author Kirk Qi
- * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import {arrayRemove, uuidV4} from '../../utils';
+import {uuidV4} from '../../utils';
 import {PriorityQueue} from '../priority-queue';
 import type {DijkstraResult, VertexKey} from '../../types';
 import {IGraph} from '../../interfaces';
@@ -223,39 +223,43 @@ export abstract class AbstractGraph<
    * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
    * It is the starting vertex for finding paths.
    * @param {VO | VertexKey} v2 - The parameter `v2` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
+   * @param limit - The count of limitation of result array.
    * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`VO[][]`).
    */
-  getAllPathsBetween(v1: VO | VertexKey, v2: VO | VertexKey): VO[][] {
+  getAllPathsBetween(v1: VO | VertexKey, v2: VO | VertexKey, limit = 1000): VO[][] {
     const paths: VO[][] = [];
     const vertex1 = this._getVertex(v1);
     const vertex2 = this._getVertex(v2);
+
     if (!(vertex1 && vertex2)) {
       return [];
     }
 
-    const dfs = (cur: VO, dest: VO, visiting: Set<VO>, path: VO[]) => {
-      visiting.add(cur);
+    const stack: { vertex: VO, path: VO[] }[] = [];
+    stack.push({ vertex: vertex1, path: [vertex1] });
+
+    while (stack.length > 0) {
+      const { vertex, path } = stack.pop()!;
 
-      if (cur === dest) {
-        paths.push([vertex1, ...path]);
+      if (vertex === vertex2) {
+        paths.push(path);
+        if (paths.length >= limit) return paths;
       }
 
-      const neighbors = this.getNeighbors(cur);
+      const neighbors = this.getNeighbors(vertex);
       for (const neighbor of neighbors) {
-        if (!visiting.has(neighbor)) {
-          path.push(neighbor);
-          dfs(neighbor, dest, visiting, path);
-          path.pop();
+        if (!path.includes(neighbor)) {
+          const newPath = [...path, neighbor];
+          stack.push({ vertex: neighbor, path: newPath });
         }
       }
-
-      visiting.delete(cur);
-    };
-
-    dfs(vertex1, vertex2, new Set<VO>(), []);
+    }
     return paths;
   }
 
+
+
+
   /**
    * The function calculates the sum of weights along a given path.
    * @param {VO[]} path - An array of vertices (VO) representing a path in a graph.
@@ -338,38 +342,43 @@ export abstract class AbstractGraph<
    * @param {boolean} [isWeight] - A boolean flag indicating whether to consider the weight of edges in finding the
    * minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set
    * to false, the function will use breadth-first search (BFS) to find the minimum path.
+   * @param isDFS - If set to true, it enforces the use of getAllPathsBetween to first obtain all possible paths,
+   * followed by iterative computation of the shortest path. This approach may result in exponential time complexity,
+   * so the default method is to use the Dijkstra algorithm to obtain the shortest weighted path.
    * @returns The function `getMinPathBetween` returns an array of vertices (`VO[]`) representing the minimum path between
    * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `null`.
    */
-  getMinPathBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean): VO[] | null {
+  getMinPathBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean, isDFS = false): VO[] | null {
     if (isWeight === undefined) isWeight = false;
 
     if (isWeight) {
-      const allPaths = this.getAllPathsBetween(v1, v2);
-      let min = Infinity;
-      let minIndex = -1;
-      let index = 0;
-      for (const path of allPaths) {
-        const pathSumWeight = this.getPathSumWeight(path);
-        if (pathSumWeight < min) {
-          min = pathSumWeight;
-          minIndex = index;
+      if (isDFS) {
+        const allPaths = this.getAllPathsBetween(v1, v2, 10000);
+        let min = Infinity;
+        let minIndex = -1;
+        let index = 0;
+        for (const path of allPaths) {
+          const pathSumWeight = this.getPathSumWeight(path);
+          if (pathSumWeight < min) {
+            min = pathSumWeight;
+            minIndex = index;
+          }
+          index++;
         }
-        index++;
+        return allPaths[minIndex] || null;
+      } else {
+        return this.dijkstra(v1, v2, true, true)?.minPath ?? [];
       }
-      return allPaths[minIndex] || null;
+
     } else {
-      // BFS
+      // DFS
       let minPath: VO[] = [];
       const vertex1 = this._getVertex(v1);
       const vertex2 = this._getVertex(v2);
-      if (!(vertex1 && vertex2)) {
-        return [];
-      }
-
-      const dfs = (cur: VO, dest: VO, visiting: Map<VO, boolean>, path: VO[]) => {
-        visiting.set(cur, true);
+      if (!(vertex1 && vertex2)) return [];
 
+      const dfs = (cur: VO, dest: VO, visiting: Set<VO>, path: VO[]) => {
+        visiting.add(cur);
         if (cur === dest) {
           minPath = [vertex1, ...path];
           return;
@@ -377,17 +386,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 minPath;
     }
   }

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)
           };
         });