data-structure-typed 1.48.8 → 1.48.9

package/benchmark/report.json

@@ -1,490 +1,55 @@
 {
-  "avl-tree": {
-    "benchmarks": [
-      {
-        "test name": "10,000 add randomly",
-        "time taken (ms)": "51.22",
-        "executions per sec": "19.52",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "10,000 add & delete randomly",
-        "time taken (ms)": "110.40",
-        "executions per sec": "9.06",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "10,000 addMany",
-        "time taken (ms)": "58.39",
-        "executions per sec": "17.13",
-        "sample deviation": "6.35e-4"
-      },
-      {
-        "test name": "10,000 get",
-        "time taken (ms)": "50.59",
-        "executions per sec": "19.77",
-        "sample deviation": "3.87e-4"
-      }
-    ],
-    "testName": "avl-tree"
-  },
   "binary-tree": {
     "benchmarks": [
       {
         "test name": "1,000 add randomly",
-        "time taken (ms)": "13.83",
-        "executions per sec": "72.29",
-        "sample deviation": "1.19e-4"
+        "time taken (ms)": "17.61",
+        "executions per sec": "56.79",
+        "sample deviation": "4.75e-4"
       },
       {
         "test name": "1,000 add & delete randomly",
-        "time taken (ms)": "21.49",
-        "executions per sec": "46.54",
-        "sample deviation": "2.34e-4"
+        "time taken (ms)": "23.21",
+        "executions per sec": "43.08",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 addMany",
-        "time taken (ms)": "15.93",
-        "executions per sec": "62.78",
-        "sample deviation": "1.27e-4"
+        "time taken (ms)": "17.89",
+        "executions per sec": "55.90",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 get",
-        "time taken (ms)": "18.19",
-        "executions per sec": "54.98",
-        "sample deviation": "1.79e-4"
+        "time taken (ms)": "17.71",
+        "executions per sec": "56.47",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 has",
-        "time taken (ms)": "18.20",
-        "executions per sec": "54.93",
-        "sample deviation": "1.71e-4"
+        "time taken (ms)": "17.15",
+        "executions per sec": "58.30",
+        "sample deviation": "2.88e-4"
       },
       {
         "test name": "1,000 dfs",
-        "time taken (ms)": "161.79",
-        "executions per sec": "6.18",
-        "sample deviation": "7.45e-4"
+        "time taken (ms)": "161.44",
+        "executions per sec": "6.19",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 bfs",
-        "time taken (ms)": "56.68",
-        "executions per sec": "17.64",
-        "sample deviation": "4.77e-4"
+        "time taken (ms)": "57.53",
+        "executions per sec": "17.38",
+        "sample deviation": "0.00"
       },
       {
         "test name": "1,000 morris",
-        "time taken (ms)": "262.64",
-        "executions per sec": "3.81",
+        "time taken (ms)": "258.22",
+        "executions per sec": "3.87",
         "sample deviation": "0.00"
       }
     ],
     "testName": "binary-tree"
-  },
-  "bst": {
-    "benchmarks": [
-      {
-        "test name": "10,000 add randomly",
-        "time taken (ms)": "51.51",
-        "executions per sec": "19.41",
-        "sample deviation": "8.70e-4"
-      },
-      {
-        "test name": "10,000 add & delete randomly",
-        "time taken (ms)": "114.09",
-        "executions per sec": "8.76",
-        "sample deviation": "9.66e-4"
-      },
-      {
-        "test name": "10,000 addMany",
-        "time taken (ms)": "47.86",
-        "executions per sec": "20.90",
-        "sample deviation": "2.77e-4"
-      },
-      {
-        "test name": "10,000 get",
-        "time taken (ms)": "51.93",
-        "executions per sec": "19.26",
-        "sample deviation": "6.56e-4"
-      }
-    ],
-    "testName": "bst"
-  },
-  "rb-tree": {
-    "benchmarks": [
-      {
-        "test name": "100,000 add",
-        "time taken (ms)": "86.63",
-        "executions per sec": "11.54",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "100,000 add & delete randomly",
-        "time taken (ms)": "218.88",
-        "executions per sec": "4.57",
-        "sample deviation": "0.01"
-      },
-      {
-        "test name": "100,000 getNode",
-        "time taken (ms)": "261.16",
-        "executions per sec": "3.83",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "100,000 add & iterator",
-        "time taken (ms)": "117.64",
-        "executions per sec": "8.50",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "rb-tree"
-  },
-  "comparison": {
-    "benchmarks": [
-      {
-        "test name": "SRC PQ 10,000 add",
-        "time taken (ms)": "0.14",
-        "executions per sec": "6949.20",
-        "sample deviation": "1.53e-6"
-      },
-      {
-        "test name": "CJS PQ 10,000 add",
-        "time taken (ms)": "0.14",
-        "executions per sec": "6943.68",
-        "sample deviation": "1.74e-6"
-      },
-      {
-        "test name": "MJS PQ 10,000 add",
-        "time taken (ms)": "0.57",
-        "executions per sec": "1758.40",
-        "sample deviation": "6.26e-6"
-      },
-      {
-        "test name": "SRC PQ 10,000 add & pop",
-        "time taken (ms)": "3.40",
-        "executions per sec": "293.94",
-        "sample deviation": "3.50e-5"
-      },
-      {
-        "test name": "CJS PQ 10,000 add & pop",
-        "time taken (ms)": "3.42",
-        "executions per sec": "292.69",
-        "sample deviation": "5.34e-5"
-      },
-      {
-        "test name": "MJS PQ 10,000 add & pop",
-        "time taken (ms)": "3.30",
-        "executions per sec": "303.01",
-        "sample deviation": "3.97e-5"
-      }
-    ],
-    "testName": "comparison"
-  },
-  "directed-graph": {
-    "benchmarks": [
-      {
-        "test name": "1,000 addVertex",
-        "time taken (ms)": "0.10",
-        "executions per sec": "9930.74",
-        "sample deviation": "1.11e-6"
-      },
-      {
-        "test name": "1,000 addEdge",
-        "time taken (ms)": "6.13",
-        "executions per sec": "163.19",
-        "sample deviation": "1.84e-4"
-      },
-      {
-        "test name": "1,000 getVertex",
-        "time taken (ms)": "0.05",
-        "executions per sec": "2.15e+4",
-        "sample deviation": "5.00e-7"
-      },
-      {
-        "test name": "1,000 getEdge",
-        "time taken (ms)": "23.57",
-        "executions per sec": "42.43",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "tarjan",
-        "time taken (ms)": "252.05",
-        "executions per sec": "3.97",
-        "sample deviation": "0.03"
-      },
-      {
-        "test name": "tarjan all",
-        "time taken (ms)": "221.15",
-        "executions per sec": "4.52",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "topologicalSort",
-        "time taken (ms)": "181.07",
-        "executions per sec": "5.52",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "directed-graph"
-  },
-  "hash-map": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 set",
-        "time taken (ms)": "122.90",
-        "executions per sec": "8.14",
-        "sample deviation": "0.04"
-      },
-      {
-        "test name": "Native Map 1,000,000 set",
-        "time taken (ms)": "215.97",
-        "executions per sec": "4.63",
-        "sample deviation": "0.02"
-      },
-      {
-        "test name": "Native Set 1,000,000 add",
-        "time taken (ms)": "179.11",
-        "executions per sec": "5.58",
-        "sample deviation": "0.02"
-      },
-      {
-        "test name": "1,000,000 set & get",
-        "time taken (ms)": "123.10",
-        "executions per sec": "8.12",
-        "sample deviation": "0.04"
-      },
-      {
-        "test name": "Native Map 1,000,000 set & get",
-        "time taken (ms)": "271.80",
-        "executions per sec": "3.68",
-        "sample deviation": "0.02"
-      },
-      {
-        "test name": "Native Set 1,000,000 add & has",
-        "time taken (ms)": "176.65",
-        "executions per sec": "5.66",
-        "sample deviation": "0.02"
-      },
-      {
-        "test name": "1,000,000 ObjKey set & get",
-        "time taken (ms)": "341.97",
-        "executions per sec": "2.92",
-        "sample deviation": "0.07"
-      },
-      {
-        "test name": "Native Map 1,000,000 ObjKey set & get",
-        "time taken (ms)": "316.86",
-        "executions per sec": "3.16",
-        "sample deviation": "0.04"
-      },
-      {
-        "test name": "Native Set 1,000,000 ObjKey add & has",
-        "time taken (ms)": "285.14",
-        "executions per sec": "3.51",
-        "sample deviation": "0.06"
-      }
-    ],
-    "testName": "hash-map"
-  },
-  "heap": {
-    "benchmarks": [
-      {
-        "test name": "100,000 add & pop",
-        "time taken (ms)": "80.37",
-        "executions per sec": "12.44",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "100,000 add & dfs",
-        "time taken (ms)": "36.20",
-        "executions per sec": "27.63",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "10,000 fib add & pop",
-        "time taken (ms)": "362.24",
-        "executions per sec": "2.76",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "heap"
-  },
-  "doubly-linked-list": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 push",
-        "time taken (ms)": "216.09",
-        "executions per sec": "4.63",
-        "sample deviation": "0.06"
-      },
-      {
-        "test name": "1,000,000 unshift",
-        "time taken (ms)": "220.68",
-        "executions per sec": "4.53",
-        "sample deviation": "0.02"
-      },
-      {
-        "test name": "1,000,000 unshift & shift",
-        "time taken (ms)": "172.93",
-        "executions per sec": "5.78",
-        "sample deviation": "0.04"
-      },
-      {
-        "test name": "1,000,000 insertBefore",
-        "time taken (ms)": "332.25",
-        "executions per sec": "3.01",
-        "sample deviation": "0.08"
-      }
-    ],
-    "testName": "doubly-linked-list"
-  },
-  "singly-linked-list": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 push & shift",
-        "time taken (ms)": "222.99",
-        "executions per sec": "4.48",
-        "sample deviation": "0.10"
-      },
-      {
-        "test name": "10,000 push & pop",
-        "time taken (ms)": "214.82",
-        "executions per sec": "4.66",
-        "sample deviation": "0.01"
-      },
-      {
-        "test name": "10,000 insertBefore",
-        "time taken (ms)": "251.24",
-        "executions per sec": "3.98",
-        "sample deviation": "0.01"
-      }
-    ],
-    "testName": "singly-linked-list"
-  },
-  "max-priority-queue": {
-    "benchmarks": [
-      {
-        "test name": "10,000 refill & poll",
-        "time taken (ms)": "8.91",
-        "executions per sec": "112.19",
-        "sample deviation": "1.57e-4"
-      }
-    ],
-    "testName": "max-priority-queue"
-  },
-  "priority-queue": {
-    "benchmarks": [
-      {
-        "test name": "100,000 add & pop",
-        "time taken (ms)": "101.70",
-        "executions per sec": "9.83",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "priority-queue"
-  },
-  "deque": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 push",
-        "time taken (ms)": "13.80",
-        "executions per sec": "72.47",
-        "sample deviation": "1.56e-4"
-      },
-      {
-        "test name": "1,000,000 push & pop",
-        "time taken (ms)": "22.72",
-        "executions per sec": "44.02",
-        "sample deviation": "2.02e-4"
-      },
-      {
-        "test name": "100,000 push & shift",
-        "time taken (ms)": "2.35",
-        "executions per sec": "425.67",
-        "sample deviation": "5.80e-5"
-      },
-      {
-        "test name": "Native Array 100,000 push & shift",
-        "time taken (ms)": "2511.14",
-        "executions per sec": "0.40",
-        "sample deviation": "0.36"
-      },
-      {
-        "test name": "100,000 unshift & shift",
-        "time taken (ms)": "2.23",
-        "executions per sec": "447.89",
-        "sample deviation": "3.30e-4"
-      },
-      {
-        "test name": "Native Array 100,000 unshift & shift",
-        "time taken (ms)": "4140.23",
-        "executions per sec": "0.24",
-        "sample deviation": "0.33"
-      }
-    ],
-    "testName": "deque"
-  },
-  "queue": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 push",
-        "time taken (ms)": "43.65",
-        "executions per sec": "22.91",
-        "sample deviation": "0.01"
-      },
-      {
-        "test name": "100,000 push & shift",
-        "time taken (ms)": "4.99",
-        "executions per sec": "200.28",
-        "sample deviation": "9.54e-5"
-      },
-      {
-        "test name": "Native Array 100,000 push & shift",
-        "time taken (ms)": "2335.63",
-        "executions per sec": "0.43",
-        "sample deviation": "0.33"
-      },
-      {
-        "test name": "Native Array 100,000 push & pop",
-        "time taken (ms)": "4.39",
-        "executions per sec": "227.81",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "queue"
-  },
-  "stack": {
-    "benchmarks": [
-      {
-        "test name": "1,000,000 push",
-        "time taken (ms)": "45.38",
-        "executions per sec": "22.04",
-        "sample deviation": "0.01"
-      },
-      {
-        "test name": "1,000,000 push & pop",
-        "time taken (ms)": "49.52",
-        "executions per sec": "20.19",
-        "sample deviation": "0.01"
-      }
-    ],
-    "testName": "stack"
-  },
-  "trie": {
-    "benchmarks": [
-      {
-        "test name": "100,000 push",
-        "time taken (ms)": "42.99",
-        "executions per sec": "23.26",
-        "sample deviation": "0.00"
-      },
-      {
-        "test name": "100,000 getWords",
-        "time taken (ms)": "89.78",
-        "executions per sec": "11.14",
-        "sample deviation": "0.00"
-      }
-    ],
-    "testName": "trie"
   }
 }

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

@@ -37,10 +37,6 @@ export declare class BinaryTreeNode<K = any, V = any, N extends BinaryTreeNode<K
  * 3. Depth and Height: Depth is the number of edges from the root to a node; height is the maximum depth in the tree.
  * 4. Subtrees: Each child of a node forms the root of a subtree.
  * 5. Leaf Nodes: Nodes without children are leaves.
- * 6. Internal Nodes: Nodes with at least one child are internal.
- * 7. Balanced Trees: The heights of the left and right subtrees of any node differ by no more than one.
- * 8. Full Trees: Every node has either 0 or 2 children.
- * 9. Complete Trees: All levels are fully filled except possibly the last, filled from left to right.
  */
 export declare class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = BinaryTreeNode<K, V, BinaryTreeNodeNested<K, V>>, TREE extends BinaryTree<K, V, N, TREE> = BinaryTree<K, V, N, BinaryTreeNested<K, V, N>>> extends IterableEntryBase<K, V | undefined> implements IBinaryTree<K, V, N, TREE> {
     iterationType: IterationType;

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

@@ -65,10 +65,6 @@ exports.BinaryTreeNode = BinaryTreeNode;
  * 3. Depth and Height: Depth is the number of edges from the root to a node; height is the maximum depth in the tree.
  * 4. Subtrees: Each child of a node forms the root of a subtree.
  * 5. Leaf Nodes: Nodes without children are leaves.
- * 6. Internal Nodes: Nodes with at least one child are internal.
- * 7. Balanced Trees: The heights of the left and right subtrees of any node differ by no more than one.
- * 8. Full Trees: Every node has either 0 or 2 children.
- * 9. Complete Trees: All levels are fully filled except possibly the last, filled from left to right.
  */
 class BinaryTree extends base_1.IterableEntryBase {
     /**
@@ -196,44 +192,50 @@ class BinaryTree extends base_1.IterableEntryBase {
      * @returns The function `add` returns either a node (`N`), `null`, or `undefined`.
      */
     add(keyOrNodeOrEntry, value) {
-        let inserted;
         const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
         if (newNode === undefined)
             return;
-        // TODO There are still some problems with the way duplicate nodes are handled
-        if (newNode !== null && this.has(newNode.key))
-            return undefined;
-        const _bfs = (root, newNode) => {
-            const queue = new queue_1.Queue([root]);
-            while (queue.size > 0) {
-                const cur = queue.shift();
-                if (newNode && cur.key === newNode.key) {
-                    this._replaceNode(cur, newNode);
-                    return newNode;
-                }
-                const inserted = this._addTo(newNode, cur);
-                if (inserted !== undefined)
-                    return inserted;
-                if (cur.left)
-                    queue.push(cur.left);
-                if (cur.right)
-                    queue.push(cur.right);
+        // If the tree is empty, directly set the new node as the root node
+        if (!this.root) {
+            this._root = newNode;
+            this._size = 1;
+            return newNode;
+        }
+        const queue = new queue_1.Queue([this.root]);
+        let potentialParent; // Record the parent node of the potential insertion location
+        while (queue.size > 0) {
+            const cur = queue.shift();
+            if (!cur)
+                continue;
+            // Check for duplicate keys when newNode is not null
+            if (newNode !== null && cur.key === newNode.key) {
+                this._replaceNode(cur, newNode);
+                return newNode; // If duplicate keys are found, no insertion is performed
+            }
+            // Record the first possible insertion location found
+            if (potentialParent === undefined && (cur.left === undefined || cur.right === undefined)) {
+                potentialParent = cur;
+            }
+            // Continue traversing the left and right subtrees
+            if (cur.left !== null) {
+                cur.left && queue.push(cur.left);
+            }
+            if (cur.right !== null) {
+                cur.right && queue.push(cur.right);
             }
-        };
-        if (this.root) {
-            inserted = _bfs(this.root, newNode);
         }
-        else {
-            this._setRoot(newNode);
-            if (newNode) {
-                this._size = 1;
+        // At the end of the traversal, if the insertion position is found, insert
+        if (potentialParent) {
+            if (potentialParent.left === undefined) {
+                potentialParent.left = newNode;
             }
-            else {
-                this._size = 0;
+            else if (potentialParent.right === undefined) {
+                potentialParent.right = newNode;
             }
-            inserted = this.root;
+            this._size++;
+            return newNode;
         }
-        return inserted;
+        return undefined; // If the insertion position cannot be found, return undefined
     }
     /**
      * Time Complexity: O(k log n) - O(k * n)