data-structure-typed 1.50.7 → 1.50.8

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

@@ -1,12 +1,4 @@
-import {
-  BinaryTreeNode,
-  BSTNode,
-  CP,
-  IterationType,
-  RedBlackTreeNode,
-  TreeMultiMap,
-  TreeMultiMapNode
-} from '../../../../src';
+import { BinaryTreeNode, BSTNode, RedBlackTreeNode, TreeMultiMap, TreeMultiMapNode } from '../../../../src';
 import { isDebugTest } from '../../../config';
 import { getRandomInt } from '../../../utils';
 
@@ -40,7 +32,7 @@ describe('TreeMultiMap count', () => {
       [2, 2],
       [3, 3]
     ]);
-    tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 1);
+    tmm.lesserOrGreaterTraverse(node => (node.count += 2), 'GT', 1);
     expect(tmm.getMutableCount()).toBe(7);
     expect(tmm.count).toBe(3);
   });
@@ -159,7 +151,7 @@ describe('TreeMultiMap operations test1', () => {
     node15 && tmm.dfs(node => (subTreeSum += node.key), 'pre', 15);
     expect(subTreeSum).toBe(45);
     let lesserSum = 0;
-    tmm.lesserOrGreaterTraverse((node: TreeMultiMapNode<number>) => (lesserSum += node.key), CP.lt, 10);
+    tmm.lesserOrGreaterTraverse((node: TreeMultiMapNode<number>) => (lesserSum += node.key), 'LT', 10);
     expect(lesserSum).toBe(45);
 
     expect(node15 instanceof TreeMultiMapNode);
@@ -170,7 +162,7 @@ describe('TreeMultiMap operations test1', () => {
     const node11 = tmm.getNode(11);
     expect(node11 instanceof TreeMultiMapNode);
     if (node11 instanceof TreeMultiMapNode) {
-      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
+      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), 'GT', 11);
       expect(allGreaterNodesAdded);
     }
 
@@ -357,7 +349,7 @@ describe('TreeMultiMap operations test1', () => {
 
 describe('TreeMultiMap operations test recursively1', () => {
   it('should perform various operations on a Binary Search Tree with numeric values1', () => {
-    const tmm = new TreeMultiMap<number>([], { iterationType: IterationType.RECURSIVE });
+    const tmm = new TreeMultiMap<number>([], { iterationType: 'RECURSIVE' });
 
     expect(tmm instanceof TreeMultiMap);
     tmm.add([11, 11]);
@@ -421,7 +413,7 @@ describe('TreeMultiMap operations test recursively1', () => {
         lesserSum += node.key;
         return node.key;
       },
-      CP.lt,
+      'LT',
       10
     );
     expect(lesserSum).toBe(45);
@@ -434,7 +426,7 @@ describe('TreeMultiMap operations test recursively1', () => {
     const node11 = tmm.getNode(11);
     expect(node11 instanceof TreeMultiMapNode);
     if (node11 instanceof TreeMultiMapNode) {
-      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
+      const allGreaterNodesAdded = tmm.lesserOrGreaterTraverse(node => (node.count += 2), 'GT', 11);
       expect(allGreaterNodesAdded);
     }