data-structure-typed 1.41.0 → 1.41.1

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

@@ -1,5 +1,5 @@
-import { RedBlackTree, RBTreeNode } from '../../../../src';
-import {getRandomInt} from "../../../utils";
+import {RBTreeNode, RedBlackTree, SN} from '../../../../src';
+import {getRandomInt} from '../../../utils';
 
 describe('RedBlackTree', () => {
   let tree: RedBlackTree;
@@ -17,7 +17,7 @@ describe('RedBlackTree', () => {
       expect(tree.getNode(10)).toBeInstanceOf(RBTreeNode);
       expect(tree.getNode(20)).toBeInstanceOf(RBTreeNode);
       expect(tree.getNode(5)).toBeInstanceOf(RBTreeNode);
-      expect(tree.getNode(15)).toBe(tree.NIL);
+      expect(tree.getNode(15)).toBe(null);
     });
 
     test('should insert and find nodes with negative keys', () => {
@@ -36,7 +36,7 @@ describe('RedBlackTree', () => {
       tree.insert(5);
       tree.delete(20);
 
-      expect(tree.getNode(20)).toBe(tree.NIL);
+      expect(tree.getNode(20)).toBe(null);
     });
 
     test('should handle deleting a non-existent node', () => {
@@ -45,7 +45,7 @@ describe('RedBlackTree', () => {
       tree.insert(5);
       tree.delete(15);
 
-      expect(tree.getNode(15)).toBe(tree.NIL);
+      expect(tree.getNode(15)).toBe(null);
     });
   });
 
@@ -63,7 +63,7 @@ describe('RedBlackTree', () => {
 
     test('should handle an empty tree', () => {
       const minNode = tree.getLeftMost(tree.root);
-      expect(minNode).toBe(tree.NIL);
+      expect(minNode).toBe(SN);
     });
   });
 
@@ -81,7 +81,7 @@ describe('RedBlackTree', () => {
 
     test('should handle an empty tree', () => {
       const maxNode = tree.getRightMost(tree.root);
-      expect(maxNode).toBe(tree.NIL);
+      expect(maxNode).toBe(SN);
     });
   });
 
@@ -105,7 +105,7 @@ describe('RedBlackTree', () => {
 
       const node = tree.getNode(10);
       const successorNode = tree.getSuccessor(node);
-      // TODO not sure if it should be null or tree.NIL
+      // TODO not sure if it should be null or SN
       expect(successorNode).toBe(null);
     });
   });
@@ -130,13 +130,12 @@ describe('RedBlackTree', () => {
 
       const node = tree.getNode(20);
       const predecessorNode = tree.getPredecessor(node);
-      // TODO not sure if it should be tree.NIL or something else.
+      // TODO not sure if it should be SN or something else.
       expect(predecessorNode).toBe(tree.getNode(10));
     });
   });
 });
 
-
 describe('RedBlackTree', () => {
   let tree: RedBlackTree;
 
@@ -158,7 +157,7 @@ describe('RedBlackTree', () => {
     tree.insert(20);
     tree.insert(5);
     tree.delete(20);
-    expect(tree.getNode(20)).toBe(tree.NIL);
+    expect(tree.getNode(20)).toBe(null);
   });
 
   it('should get the successor of a node', () => {
@@ -210,14 +209,15 @@ describe('RedBlackTree', () => {
   });
 
   it('should fix the tree after insertion', () => {
-    for (let i = 0; i < 1000; i++) {
-      tree.insert(getRandomInt(-100, 1000));
-      tree.delete(getRandomInt(-100, 1000));
-    }
     tree.insert(1);
     tree.insert(2);
     tree.insert(5);
     tree.insert(15);
+    const node15F = tree.getNode(15);
+    expect(node15F.left).toBe(SN);
+    expect(node15F.right).toBe(SN);
+    expect(node15F.parent).toBe(tree.getNode(5));
+
     tree.insert(25);
     tree.insert(10);
     tree.insert(8);
@@ -229,14 +229,50 @@ describe('RedBlackTree', () => {
     tree.insert(50);
     tree.insert(155);
     tree.insert(225);
+    const node225F = tree.getNode(225);
+    expect(node225F.left).toBe(SN);
+    expect(node225F.right).toBe(SN);
+    expect(node225F.parent.key).toBe(155);
     tree.insert(7);
+
+    const node15S = tree.getNode(15);
+    expect(node15S.left.key).toBe(8);
+    expect(node15S.right.key).toBe(28);
+    expect(node15S).toBe(tree.root);
+    expect(node15S.parent).toBe(null);
     tree.delete(15);
+    expect(tree.root.key).toBe(22);
+    expect(tree.root.parent).toBe(null);
+
+    const node15T = tree.getNode(15);
+    expect(node15T).toBe(null);
+
     tree.insert(23);
     tree.insert(33);
     tree.insert(15);
 
+    const nodeLM = tree.getLeftMost();
+    expect(nodeLM.key).toBe(1);
+
+    const node50 = tree.getNode(50);
+    expect(node50.key).toBe(50);
+    expect(node50.left.key).toBe(33);
+    expect(node50.right).toBe(SN);
+    const node15Fo = tree.getNode(15);
+
+    expect(node15Fo.key).toBe(15);
+    expect(node15Fo.left).toBe(SN);
+    const node225S = tree.getNode(225);
+    expect(node225S.left).toBe(SN);
+    expect(node225S.right).toBe(SN);
+    expect(node225S.parent.key).toBe(155);
+    expect(tree.getNode(0)).toBe(null);
+  });
 
-    // Verify that the tree is still a valid Red-Black Tree
-    // You can add assertions to check the Red-Black Tree properties
+  it('should fix the tree after insertion and deletion', () => {
+    for (let i = 0; i < 1000; i++) {
+      tree.insert(getRandomInt(-100, 1000));
+      tree.delete(getRandomInt(-100, 1000));
+    }
   });
 });

package/test/unit/data-structures/binary-tree/tree-multiset.test.ts

@@ -23,10 +23,10 @@ describe('TreeMultiset operations test', () => {
 
     expect(treeMultiset.getHeight(6)).toBe(3);
     expect(treeMultiset.getDepth(6)).toBe(1);
-    const nodeId10 = treeMultiset.get(10);
+    const nodeId10 = treeMultiset.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultiset.get(9, node => node.value);
+    const nodeVal9 = treeMultiset.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const nodesByCount1 = treeMultiset.getNodes(1, node => node.count);
@@ -37,7 +37,7 @@ describe('TreeMultiset operations test', () => {
     const leftMost = treeMultiset.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = treeMultiset.get(15);
+    const node15 = treeMultiset.getNode(15);
     const minNodeBySpecificNode = node15 && treeMultiset.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -53,7 +53,7 @@ describe('TreeMultiset operations test', () => {
       const subTreeAdd = treeMultiset.subTreeTraverse((node: TreeMultisetNode<number>) => (node.count += 1), 15);
       expect(subTreeAdd);
     }
-    const node11 = treeMultiset.get(11);
+    const node11 = treeMultiset.getNode(11);
     expect(node11 instanceof TreeMultisetNode);
     if (node11 instanceof TreeMultisetNode) {
       const allGreaterNodesAdded = treeMultiset.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);
@@ -263,10 +263,10 @@ describe('TreeMultiset operations test recursively', () => {
 
     expect(treeMultiset.getHeight(6)).toBe(3);
     expect(treeMultiset.getDepth(6)).toBe(1);
-    const nodeId10 = treeMultiset.get(10);
+    const nodeId10 = treeMultiset.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = treeMultiset.get(9, node => node.value);
+    const nodeVal9 = treeMultiset.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const nodesByCount1 = treeMultiset.getNodes(1, node => node.count);
@@ -277,7 +277,7 @@ describe('TreeMultiset operations test recursively', () => {
     const leftMost = treeMultiset.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = treeMultiset.get(15);
+    const node15 = treeMultiset.getNode(15);
     const minNodeBySpecificNode = node15 && treeMultiset.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -293,7 +293,7 @@ describe('TreeMultiset operations test recursively', () => {
       const subTreeAdd = treeMultiset.subTreeTraverse((node: TreeMultisetNode<number>) => (node.count += 1), 15);
       expect(subTreeAdd);
     }
-    const node11 = treeMultiset.get(11);
+    const node11 = treeMultiset.getNode(11);
     expect(node11 instanceof TreeMultisetNode);
     if (node11 instanceof TreeMultisetNode) {
       const allGreaterNodesAdded = treeMultiset.lesserOrGreaterTraverse(node => (node.count += 2), CP.gt, 11);

package/test/utils/big-o.js

@@ -23,9 +23,11 @@ exports.bigO = {
   CUBED: Math.pow(exports.magnitude.SQUARED, 3) / 1000,
   FACTORIAL: 10000
 };
+
 function findPotentialN(input) {
   var longestArray = [];
   var mostProperties = {};
+
   function recurse(obj) {
     if (Array.isArray(obj)) {
       if (obj.length > longestArray.length) {
@@ -41,6 +43,7 @@ function findPotentialN(input) {
       });
     }
   }
+
   if (Array.isArray(input)) {
     input.forEach(function (item) {
       recurse(item);
@@ -51,6 +54,7 @@ function findPotentialN(input) {
   // return [longestArray, mostProperties] : [any[], { [key: string]: any }];
   return Math.max(longestArray.length, Object.keys(mostProperties).length);
 }
+
 function linearRegression(x, y) {
   var n = x.length;
   var sumX = x.reduce(function (acc, val) {
@@ -87,6 +91,7 @@ function linearRegression(x, y) {
   var rSquared = 1 - totalVariation / explainedVariation;
   return {slope: slope, intercept: intercept, rSquared: rSquared};
 }
+
 function estimateBigO(runtimes, dataSizes) {
   // Make sure the input runtimes and data sizes have the same length
   if (runtimes.length !== dataSizes.length) {
@@ -137,7 +142,9 @@ function estimateBigO(runtimes, dataSizes) {
     return complexities.join(' or ');
   }
 }
+
 var methodLogs = new Map();
+
 function logBigOMetricsWrap(fn, args, fnName) {
   var startTime = performance.now();
   var result = fn(args);
@@ -169,7 +176,9 @@ function logBigOMetricsWrap(fn, args, fnName) {
   }
   return result;
 }
+
 exports.logBigOMetricsWrap = logBigOMetricsWrap;
+
 function logBigOMetrics(target, propertyKey, descriptor) {
   var originalMethod = descriptor.value;
   descriptor.value = function () {
@@ -209,4 +218,5 @@ function logBigOMetrics(target, propertyKey, descriptor) {
   };
   return descriptor;
 }
+
 exports.logBigOMetrics = logBigOMetrics;