data-structure-typed 1.40.0 → 1.41.1

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

@@ -1,109 +1,278 @@
-import {RBTree, RBTreeNode} from '../../../../src';
+import {RBTreeNode, RedBlackTree, SN} from '../../../../src';
+import {getRandomInt} from '../../../utils';
 
-describe('RBTreeNode', () => {
-  it('should create an instance of RBTreeNode', () => {
-    const node = new RBTreeNode<number>(1);
-    expect(node).toBeInstanceOf(RBTreeNode);
+describe('RedBlackTree', () => {
+  let tree: RedBlackTree;
+
+  beforeEach(() => {
+    tree = new RedBlackTree();
   });
 
-  it('should set and get the ID correctly', () => {
-    const node = new RBTreeNode<number>(1);
-    expect(node.key).toBe(1);
+  describe('insert and getNode', () => {
+    test('should insert and find a node in the tree', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+
+      expect(tree.getNode(10)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(20)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(5)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(15)).toBe(null);
+    });
 
-    node.key = 2;
-    expect(node.key).toBe(2);
+    test('should insert and find nodes with negative keys', () => {
+      tree.insert(-10);
+      tree.insert(-20);
+
+      expect(tree.getNode(-10)).toBeInstanceOf(RBTreeNode);
+      expect(tree.getNode(-20)).toBeInstanceOf(RBTreeNode);
+    });
   });
 
-  it('should set and get the value correctly', () => {
-    const node: RBTreeNode<number> = new RBTreeNode<number>(1, 42);
-    expect(node.value).toBe(42);
+  describe('deleteNode', () => {
+    test('should delete a node from the tree', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.delete(20);
+
+      expect(tree.getNode(20)).toBe(null);
+    });
 
-    node.value = 55;
-    expect(node.value).toBe(55);
+    test('should handle deleting a non-existent node', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.delete(15);
+
+      expect(tree.getNode(15)).toBe(null);
+    });
   });
 
-  it('should set and get the left child correctly', () => {
-    const node1 = new RBTreeNode<number>(1);
-    const node2 = new RBTreeNode<number>(2);
+  describe('minimum', () => {
+    test('should find the minimum node in the tree', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.insert(15);
+      tree.insert(3);
 
-    node1.left = node2;
+      const minNode = tree.getLeftMost(tree.root);
+      expect(minNode.key).toBe(3);
+    });
 
-    expect(node1.left).toBe(node2);
-    expect(node2.parent).toBe(node1);
+    test('should handle an empty tree', () => {
+      const minNode = tree.getLeftMost(tree.root);
+      expect(minNode).toBe(SN);
+    });
   });
 
-  it('should set and get the right child correctly', () => {
-    const node1 = new RBTreeNode<number>(1);
-    const node2 = new RBTreeNode<number>(2);
+  describe('getRightMost', () => {
+    test('should find the getRightMost node in the tree', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.insert(15);
+      tree.insert(25);
 
-    node1.right = node2;
+      const maxNode = tree.getRightMost(tree.root);
+      expect(maxNode.key).toBe(25);
+    });
 
-    expect(node1.right).toBe(node2);
-    expect(node2.parent).toBe(node1);
+    test('should handle an empty tree', () => {
+      const maxNode = tree.getRightMost(tree.root);
+      expect(maxNode).toBe(SN);
+    });
   });
 
-  it('should set and get the parent correctly', () => {
-    const node1 = new RBTreeNode<number>(1);
-    const node2 = new RBTreeNode<number>(2);
+  describe('getSuccessor', () => {
+    test('should find the getSuccessor of a node', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.insert(15);
+      tree.insert(25);
+
+      const node = tree.getNode(15);
+      const successorNode = tree.getSuccessor(node);
 
-    node1.left = node2;
+      expect(successorNode.key).toBe(20);
+    });
 
-    expect(node2.parent).toBe(node1);
-    expect(node1.left).toBe(node2);
+    test('should handle a node with no getSuccessor', () => {
+      tree.insert(10);
+      tree.insert(5);
+
+      const node = tree.getNode(10);
+      const successorNode = tree.getSuccessor(node);
+      // TODO not sure if it should be null or SN
+      expect(successorNode).toBe(null);
+    });
   });
 
-  it('should determine family position correctly', () => {
-    const root = new RBTreeNode<number>(1);
-    const leftChild = new RBTreeNode<number>(2);
-    const rightChild = new RBTreeNode<number>(3);
+  describe('getPredecessor', () => {
+    test('should find the getPredecessor of a node', () => {
+      tree.insert(10);
+      tree.insert(20);
+      tree.insert(5);
+      tree.insert(15);
+      tree.insert(25);
+
+      const node = tree.getNode(20);
+      const predecessorNode = tree.getPredecessor(node);
 
-    root.left = leftChild;
-    root.right = rightChild;
+      expect(predecessorNode.key).toBe(15);
+    });
 
-    expect(leftChild.familyPosition).toBe('LEFT');
-    expect(rightChild.familyPosition).toBe('RIGHT');
-    expect(root.familyPosition).toBe('ROOT');
+    test('should handle a node with no getPredecessor', () => {
+      tree.insert(10);
+      tree.insert(20);
+
+      const node = tree.getNode(20);
+      const predecessorNode = tree.getPredecessor(node);
+      // TODO not sure if it should be SN or something else.
+      expect(predecessorNode).toBe(tree.getNode(10));
+    });
   });
 });
 
-describe('Red-Black Tree Tests', () => {
-  let tree: RBTree<RBTreeNode<number>>;
+describe('RedBlackTree', () => {
+  let tree: RedBlackTree;
 
   beforeEach(() => {
-    tree = new RBTree<RBTreeNode<number>>();
-  });
-
-  test('Insertion and In-order Traverse', () => {
-    tree.add(5);
-    // tree.add(3);
-    // tree.add(7);
-    // tree.add(2);
-    // tree.add(4);
-    // tree.add(6);
-    // tree.add(8);
-    //
-    // const inOrderTraverse: number[] = tree.DFS('in')
-    //
-    // expect(inOrderTraverse).toEqual([2, 3, 4, 5, 6, 7, 8]);
-  });
-
-  test('Deletion', () => {
-    // tree.add(5);
-    // tree.add(3);
-    // tree.add(7);
-    // tree.add(2);
-    // tree.add(4);
-    // tree.add(6);
-    // tree.add(8);
-    //
-    // // Delete a node (e.g., 3) and check if it's gone
-    // tree.delete(3);
-    // expect(tree.has(3)).toBe(false);
-    //
-    // // Perform in-order traversal to check if the tree is still balanced
-    // const inOrderTraverse: number[] = tree.DFS('in');
-    //
-    //
-    // expect(inOrderTraverse).toEqual([2, 4, 5, 6, 7, 8]);
+    tree = new RedBlackTree();
+  });
+
+  it('should insert nodes into the tree', () => {
+    tree.insert(10);
+    expect(tree.getNode(10)).toBeDefined();
+    tree.insert(20);
+    expect(tree.getNode(20)).toBeDefined();
+    tree.insert(5);
+    expect(tree.getNode(5)).toBeDefined();
+  });
+
+  it('should delete nodes from the tree', () => {
+    tree.insert(10);
+    tree.insert(20);
+    tree.insert(5);
+    tree.delete(20);
+    expect(tree.getNode(20)).toBe(null);
+  });
+
+  it('should get the successor of a node', () => {
+    tree.insert(10);
+    tree.insert(20);
+    const node = tree.getNode(10);
+    const successor = tree.getSuccessor(node);
+    expect(successor?.key).toBe(20);
+  });
+
+  it('should get the predecessor of a node', () => {
+    tree.insert(10);
+    tree.insert(20);
+    const node = tree.getNode(20);
+    const predecessor = tree.getPredecessor(node);
+    expect(predecessor?.key).toBe(10);
+  });
+
+  it('should rotate nodes to the left', () => {
+    tree.insert(10);
+    tree.insert(20);
+    tree.insert(5);
+    const node = tree.getNode(10);
+    tree.insert(15);
+    // Verify that rotation has occurred
+    expect(node.left.key).toBe(5);
+    expect(node.right.key).toBe(20);
+  });
+
+  it('should rotate nodes to the right', () => {
+    tree.insert(10);
+    tree.insert(20);
+    tree.insert(5);
+    const node = tree.getNode(20);
+    tree.insert(25);
+    // Verify that rotation has occurred
+    expect(node.left.key).toBe(0);
+    expect(node.right.key).toBe(25);
+  });
+
+  it('should fix the tree after deletion', () => {
+    tree.insert(10);
+    tree.insert(20);
+    tree.insert(5);
+    tree.insert(15);
+    tree.delete(15);
+    // Verify that the tree is still valid
+    // You can add assertions to check the Red-Black Tree properties
+  });
+
+  it('should fix the tree after insertion', () => {
+    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);
+    tree.insert(28);
+    tree.insert(111);
+    tree.insert(12);
+    tree.delete(2);
+    tree.insert(22);
+    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);
+  });
+
+  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;