data-structure-typed 1.41.0 → 1.41.2

package/src/data-structures/queue/queue.ts

@@ -201,7 +201,7 @@ export class Queue<E = any> {
     return new Queue(this.nodes.slice(this.offset));
   }
 
-  * [Symbol.iterator]() {
+  *[Symbol.iterator]() {
     for (const item of this.nodes) {
       yield item;
     }

package/src/types/data-structures/matrix/navigator.ts

@@ -1,6 +1,6 @@
 export type Direction = 'up' | 'right' | 'down' | 'left';
 
-export type Turning = { [key in Direction]: Direction };
+export type Turning = {[key in Direction]: Direction};
 
 export type NavigatorParams<T = any> = {
   matrix: T[][];

package/src/types/utils/utils.ts

@@ -1,5 +1,5 @@
 export type ToThunkFn = () => ReturnType<TrlFn>;
-export type Thunk = () => ReturnType<ToThunkFn> & { __THUNK__: symbol };
+export type Thunk = () => ReturnType<ToThunkFn> & {__THUNK__: symbol};
 export type TrlFn = (...args: any[]) => any;
 export type TrlAsyncFn = (...args: any[]) => any;
 

package/src/types/utils/validate-type.ts

@@ -1,6 +1,6 @@
-export type KeyValueObject = { [key: string]: any };
+export type KeyValueObject = {[key: string]: any};
 
-export type KeyValueObjectWithKey = { [key: string]: any; key: string | number | symbol };
+export type KeyValueObjectWithKey = {[key: string]: any; key: string | number | symbol};
 
 export type NonNumberNonObjectButDefined = string | boolean | symbol | null;
 

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

@@ -12,13 +12,13 @@ describe('AVL Tree Test', () => {
     expect(node6 && tree.getHeight(node6)).toBe(3);
     expect(node6 && tree.getDepth(node6)).toBe(1);
 
-    const getNodeById = tree.get(10);
-    expect(getNodeById?.key).toBe(10);
+    const getValueById = tree.get(10);
+    expect(getValueById).toBe(10);
 
     const getMinNodeByRoot = tree.getLeftMost();
     expect(getMinNodeByRoot?.key).toBe(1);
 
-    const node15 = tree.get(15);
+    const node15 = tree.getNode(15);
     const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node15);
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 

package/test/integration/bst.test.ts

@@ -20,16 +20,16 @@ describe('Individual package BST operations test', () => {
     expect(node6 && bst.getHeight(6)).toBe(2);
     expect(node6 && bst.getDepth(6)).toBe(3);
 
-    const nodeId10 = bst.get(10);
+    const nodeId10 = bst.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = bst.get(9, node => node.value);
+    const nodeVal9 = bst.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = bst.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = bst.get(15);
+    const node15 = bst.getNode(15);
     const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -43,7 +43,7 @@ describe('Individual package BST operations test', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = bst.get(11);
+    const node11 = bst.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = bst.dfs(node => node, 'in');
@@ -216,7 +216,7 @@ describe('Individual package BST operations test', () => {
 
     expect(objBST.has(6)).toBe(true);
 
-    const node6 = objBST.get(6);
+    const node6 = objBST.getNode(6);
     expect(node6 && objBST.getHeight(node6)).toBe(2);
     expect(node6 && objBST.getDepth(node6)).toBe(3);
 
@@ -229,7 +229,7 @@ describe('Individual package BST operations test', () => {
     const leftMost = objBST.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = objBST.get(15);
+    const node15 = objBST.getNode(15);
     expect(node15?.value).toEqual({key: 15, keyA: 15});
     const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
@@ -244,7 +244,7 @@ describe('Individual package BST operations test', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = objBST.get(11);
+    const node11 = objBST.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = objBST.dfs(node => node, 'in');

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

@@ -7,18 +7,18 @@ describe('AVL Tree Test', () => {
 
     for (const i of arr) tree.add(i, i);
 
-    const node6 = tree.get(6);
+    const node6 = tree.getNode(6);
 
     expect(node6 && tree.getHeight(node6)).toBe(3);
     expect(node6 && tree.getDepth(node6)).toBe(1);
 
-    const getNodeById = tree.get(10);
+    const getNodeById = tree.getNode(10);
     expect(getNodeById?.key).toBe(10);
 
     const getMinNodeByRoot = tree.getLeftMost();
     expect(getMinNodeByRoot?.key).toBe(1);
 
-    const node15 = tree.get(15);
+    const node15 = tree.getNode(15);
     const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node15);
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 
@@ -116,18 +116,18 @@ describe('AVL Tree Test recursively', () => {
 
     for (const i of arr) tree.add(i, i);
 
-    const node6 = tree.get(6);
+    const node6 = tree.getNode(6);
 
     expect(node6 && tree.getHeight(node6)).toBe(3);
     expect(node6 && tree.getDepth(node6)).toBe(1);
 
-    const getNodeById = tree.get(10);
+    const getNodeById = tree.getNode(10);
     expect(getNodeById?.key).toBe(10);
 
     const getMinNodeByRoot = tree.getLeftMost();
     expect(getMinNodeByRoot?.key).toBe(1);
 
-    const node15 = tree.get(15);
+    const node15 = tree.getNode(15);
     const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node15);
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 

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

@@ -107,7 +107,7 @@ describe('BinaryTree', () => {
     expect(tree.has(2)).toBe(true);
     expect(tree.has(3)).toBe(true);
     expect(tree.has(4)).toBe(false);
-    const node4 = tree.get(4);
+    const node4 = tree.getNode(4);
     expect(tree.has(node4)).toBe(false);
     expect(tree.has(node4, node => node)).toBe(false);
     expect(tree.has('3', node => node.value?.toString())).toBe(true);
@@ -169,13 +169,13 @@ describe('BinaryTree', () => {
       new BinaryTreeNode(4, 4)
     ]);
 
-    expect(tree.isSubtreeBST(tree.get(4), IterationType.RECURSIVE)).toBe(true);
-    expect(tree.isSubtreeBST(tree.get(4), IterationType.ITERATIVE)).toBe(true);
+    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.RECURSIVE)).toBe(true);
+    expect(tree.isSubtreeBST(tree.getNode(4), IterationType.ITERATIVE)).toBe(true);
   });
 
   it('should subTreeTraverse', () => {
     tree.addMany([4, 2, 6, 1, 3, 5, 7]);
-    expect(tree.subTreeTraverse(node => node.key, tree.get(6), IterationType.RECURSIVE)).toEqual([6, 5, 7]);
+    expect(tree.subTreeTraverse(node => node.key, tree.getNode(6), IterationType.RECURSIVE)).toEqual([6, 5, 7]);
   });
 
   it('should clear the tree', () => {
@@ -234,9 +234,9 @@ describe('BinaryTree Morris Traversal', () => {
   });
 
   it('after morris traversals should the structure of the tree be correct', () => {
-    const node1 = tree.get(1);
-    const node2 = tree.get(2);
-    const node3 = tree.get(3);
+    const node1 = tree.getNode(1);
+    const node2 = tree.getNode(2);
+    const node3 = tree.getNode(3);
     expect(node1?.left).toBe(node2);
     expect(node1?.right).toBe(node3);
   });
@@ -339,8 +339,8 @@ describe('BinaryTree', () => {
     tree.add(3, 'B');
     tree.add(7, 'C');
 
-    const nodeA = tree.get(5);
-    const nodeB = tree.get(3);
+    const nodeA = tree.getNode(5);
+    const nodeB = tree.getNode(3);
 
     expect(nodeA?.key).toBe(5);
     expect(nodeA?.value).toBe('A');
@@ -351,7 +351,7 @@ describe('BinaryTree', () => {
   it('should return null when getting a non-existent node', () => {
     tree.add(5, 'A');
 
-    const node = tree.get(3);
+    const node = tree.getNode(3);
 
     expect(node).toBe(null);
   });
@@ -421,7 +421,7 @@ describe('BinaryTree', () => {
     tree.delete(3);
 
     expect(tree.size).toBe(2);
-    expect(tree.get(3)).toBe(null);
+    expect(tree.getNode(3)).toBe(null);
   });
 
   it('should check if the tree is perfectly balanced', () => {

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

@@ -19,20 +19,20 @@ describe('BST operations test', () => {
 
     expect(bst.has(6)).toBe(true);
 
-    const node6 = bst.get(6);
+    const node6 = bst.getNode(6);
     expect(node6 && bst.getHeight(6)).toBe(2);
     expect(node6 && bst.getDepth(6)).toBe(3);
 
-    const nodeId10 = bst.get(10);
+    const nodeId10 = bst.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = bst.get(9, node => node.value);
+    const nodeVal9 = bst.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = bst.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = bst.get(15);
+    const node15 = bst.getNode(15);
     const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -46,7 +46,7 @@ describe('BST operations test', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = bst.get(11);
+    const node11 = bst.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = bst.dfs(node => node, 'in');
@@ -222,20 +222,20 @@ describe('BST operations test', () => {
 
     expect(objBST.has(6)).toBe(true);
 
-    const node6 = objBST.get(6);
+    const node6 = objBST.getNode(6);
     expect(node6 && objBST.getHeight(node6)).toBe(2);
     expect(node6 && objBST.getDepth(node6)).toBe(3);
 
-    const nodeId10 = objBST.get(10);
+    const nodeId10 = objBST.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = objBST.get(9);
+    const nodeVal9 = objBST.getNode(9);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = objBST.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = objBST.get(15);
+    const node15 = objBST.getNode(15);
     expect(node15?.value).toEqual({key: 15, keyA: 15});
     const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
@@ -250,7 +250,7 @@ describe('BST operations test', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = objBST.get(11);
+    const node11 = objBST.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = objBST.dfs(node => node, 'in');
@@ -409,20 +409,21 @@ describe('BST operations test recursively', () => {
 
     expect(bst.has(6)).toBe(true);
 
-    const node6 = bst.get(6);
+    const node6 = bst.getNode(6);
     expect(node6 && bst.getHeight(6)).toBe(2);
     expect(node6 && bst.getDepth(6)).toBe(3);
 
-    const nodeId10 = bst.get(10);
+    const nodeId10 = bst.getNode(10);
+    expect(bst.get(10)).toBe(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = bst.get(9, node => node.value);
+    const nodeVal9 = bst.getNode(9, node => node.value);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = bst.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = bst.get(15);
+    const node15 = bst.getNode(15);
     const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
@@ -436,7 +437,7 @@ describe('BST operations test recursively', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = bst.get(11);
+    const node11 = bst.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = bst.dfs(node => node, 'in');
@@ -612,20 +613,21 @@ describe('BST operations test recursively', () => {
 
     expect(objBST.has(6)).toBe(true);
 
-    const node6 = objBST.get(6);
+    const node6 = objBST.getNode(6);
+    expect(objBST.get(6)).toEqual({key: 6, keyA: 6});
     expect(node6 && objBST.getHeight(node6)).toBe(2);
     expect(node6 && objBST.getDepth(node6)).toBe(3);
 
-    const nodeId10 = objBST.get(10);
+    const nodeId10 = objBST.getNode(10);
     expect(nodeId10?.key).toBe(10);
 
-    const nodeVal9 = objBST.get(9);
+    const nodeVal9 = objBST.getNode(9);
     expect(nodeVal9?.key).toBe(9);
 
     const leftMost = objBST.getLeftMost();
     expect(leftMost?.key).toBe(1);
 
-    const node15 = objBST.get(15);
+    const node15 = objBST.getNode(15);
     expect(node15?.value).toEqual({key: 15, keyA: 15});
     const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
@@ -640,7 +642,7 @@ describe('BST operations test recursively', () => {
 
     expect(node15).toBeInstanceOf(BSTNode);
 
-    const node11 = objBST.get(11);
+    const node11 = objBST.getNode(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
     const dfsInorderNodes = objBST.dfs(node => node, 'in');

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

@@ -20,8 +20,8 @@ describe('Overall BinaryTree Test', () => {
     leftMost?.key === 1; // true
     expect(leftMost?.key).toBe(1);
     bst.delete(6);
-    bst.get(6); // null
-    expect(bst.get(6)).toBeNull();
+    bst.getNode(6); // null
+    expect(bst.getNode(6)).toBeNull();
     bst.isAVLBalanced(); // true or false
     expect(bst.isAVLBalanced()).toBe(true);
     const bfsIDs: number[] = [];