data-structure-typed 1.50.9 → 1.51.1

package/test/integration/avl-tree.test.ts

@@ -1,4 +1,4 @@
-import { AVLTree, CP } from 'avl-tree-typed';
+import { AVLTree } from 'avl-tree-typed';
 
 describe('AVL Tree Test', () => {
   it('should perform various operations on a AVL Tree', () => {
@@ -40,17 +40,17 @@ describe('AVL Tree Test', () => {
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;
-    node15 && tree.dfs(node => (subTreeSum += node.key), 'in', 15);
+    node15 && tree.dfs(node => (subTreeSum += node.key), 'IN', 15);
     expect(subTreeSum).toBe(70);
 
     let lesserSum = 0;
-    tree.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+    tree.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
     expect(lesserSum).toBe(45);
 
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
     expect(node15?.value).toBe(15);
 
-    const dfs = tree.dfs(node => node, 'in');
+    const dfs = tree.dfs(node => node, 'IN');
     expect(dfs[0].key).toBe(1);
     expect(dfs[dfs.length - 1].key).toBe(16);
 

package/test/integration/bst.test.ts

@@ -1,4 +1,4 @@
-import { BST, BSTNode, CP } from 'bst-typed';
+import { BST, BSTNode } from 'bst-typed';
 
 describe('Individual package BST operations test', () => {
   it('should perform various operations on a Binary Search Tree with numeric values', () => {
@@ -34,11 +34,11 @@ describe('Individual package BST operations test', () => {
     expect(minNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;
-    node15 && bst.dfs(node => (subTreeSum += node.key), 'in', 15);
+    node15 && bst.dfs(node => (subTreeSum += node.key), 'IN', 15);
     expect(subTreeSum).toBe(70);
 
     let lesserSum = 0;
-    bst.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+    bst.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
     expect(lesserSum).toBe(45);
 
     expect(node15).toBeInstanceOf(BSTNode);
@@ -46,7 +46,7 @@ describe('Individual package BST operations test', () => {
     const node11 = bst.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = bst.dfs(node => node, 'in');
+    const dfsInorderNodes = bst.dfs(node => node, 'IN');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 
@@ -231,11 +231,11 @@ describe('Individual package BST operations test', () => {
     expect(minNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;
-    node15 && objBST.dfs(node => (subTreeSum += node.key), 'in', node15);
+    node15 && objBST.dfs(node => (subTreeSum += node.key), 'IN', node15);
     expect(subTreeSum).toBe(70);
 
     let lesserSum = 0;
-    objBST.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+    objBST.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
     expect(lesserSum).toBe(45);
 
     expect(node15).toBeInstanceOf(BSTNode);
@@ -243,7 +243,7 @@ describe('Individual package BST operations test', () => {
     const node11 = objBST.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = objBST.dfs(node => node, 'in');
+    const dfsInorderNodes = objBST.dfs(node => node, 'IN');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 

package/test/integration/index.html

@@ -28,14 +28,14 @@
     const n = 1000000;
     const startEn = performance.now();
     for (let i = 0; i < n; i++) {
-      queue.enqueue(i);
+      queue.push(i);
     }
     console.log((performance.now() - startEn).toFixed(2), `Queue ${n.toLocaleString()} enqueue `);
     let last = 0;
     const startTime = performance.now();
 
     for (let i = 0; i < n; i++) {
-      last = queue.dequeue();
+      last = queue.shift();
     }
 
     console.log((performance.now() - startTime).toFixed(2), `Queue ${n.toLocaleString()} dequeue `);

package/test/unit/data-structures/binary-tree/tree-multi-map.test.ts

@@ -45,6 +45,7 @@ describe('TreeMultiMap operations test1', () => {
     expect(tmm.getMinHeight()).toBe(-1);
 
     tmm.addMany([1, 6, 7, 2, 3, 4, 9, 11, 8, 5, 10, 12, 16, 14, 13, 15]);
+    // tmm.print()
     expect(tmm.getHeight()).toBe(5);
     expect(tmm.getMinHeight()).toBe(2);
   });

package/test/utils/big-o.ts

@@ -205,3 +205,15 @@ export function logBigOMetrics(target: any, propertyKey: string, descriptor: Pro
 
   return descriptor;
 }
+
+export const logPerf = function (fn: (...args: any[]) => any, args: any[], thisArg?: any) {
+  const start = performance.now();
+  if (thisArg) {
+    if (args && args.length > 0) fn.apply(thisArg, args);
+    else fn.apply(thisArg);
+  } else {
+    if (args && args.length > 0) fn(...args);
+    else fn();
+  }
+  console.log(`function running cost : ${(performance.now() - start).toFixed(2)} ms`);
+};