data-structure-typed 1.51.2 → 1.51.4

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.51.2",
+  "version": "1.51.4",
   "description": "Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack. Benchmark compared with C++ STL. API aligned with ES6 and Java.util. Usability is comparable to Python",
   "main": "dist/cjs/index.js",
   "module": "dist/mjs/index.js",
@@ -66,11 +66,11 @@
     "@typescript-eslint/eslint-plugin": "^6.7.4",
     "@typescript-eslint/parser": "^6.7.4",
     "auto-changelog": "^2.4.0",
-    "avl-tree-typed": "^1.51.1",
+    "avl-tree-typed": "^1.51.3",
     "benchmark": "^2.1.4",
-    "binary-tree-typed": "^1.51.1",
-    "bst-typed": "^1.51.1",
-    "data-structure-typed": "^1.51.1",
+    "binary-tree-typed": "^1.51.3",
+    "bst-typed": "^1.51.3",
+    "data-structure-typed": "^1.51.3",
     "dependency-cruiser": "^14.1.0",
     "doctoc": "^2.2.1",
     "eslint": "^8.50.0",
@@ -79,7 +79,7 @@
     "eslint-import-resolver-typescript": "^3.6.1",
     "eslint-plugin-import": "^2.28.1",
     "fast-glob": "^3.3.1",
-    "heap-typed": "^1.51.1",
+    "heap-typed": "^1.51.3",
     "istanbul-badges-readme": "^1.8.5",
     "jest": "^29.7.0",
     "js-sdsl": "^4.4.2",
@@ -92,54 +92,17 @@
     "typescript": "^5.3.2"
   },
   "keywords": [
-    "data structure",
-    "data structures",
-    "datastructure",
-    "datastructures",
     "data",
     "structure",
     "structures",
-    "min",
-    "max",
-    "heap",
-    "priority",
-    "queue",
-    "min heap",
-    "min-heap",
-    "max heap",
-    "max-heap",
-    "priority queue",
-    "priority-queue",
-    "max priority queue",
-    "max-priority-queue",
-    "min priority queue",
-    "min-priority-queue",
-    "binary search tree",
-    "binary-search-tree",
-    "BST",
-    "binary tree",
-    "binary-tree",
-    "red black tree",
-    "red black tree",
-    "red-black-tree",
-    "rb tree",
-    "trie",
-    "prefix tree",
-    "prefix-tree",
-    "avl tree",
-    "avl-tree",
-    "tree set",
-    "tree-set",
-    "tree multiset",
-    "tree-multiset",
-    "tree map",
-    "tree-map",
-    "tree multimap",
-    "tree-multimap",
-    "binary indexed tree",
-    "binary-indexed-tree",
-    "segment tree",
-    "segment-tree",
+    "data structure",
+    "datastructure",
+    "data-structure",
+    "data structures",
+    "datastructures",
+    "data-structures",
+    "in data structures",
+    "in data structure",
     "binary",
     "depth",
     "breadth",
@@ -149,7 +112,7 @@
     "avl",
     "red",
     "black",
-    "red black",
+    "redblack",
     "RB",
     "segment",
     "prefix",
@@ -159,26 +122,18 @@
     "set",
     "multiset",
     "multimap",
+    "directed",
+    "undirected",
+    "graph",
+    "min",
+    "max",
+    "heap",
+    "priority",
+    "queue",
     "singly",
     "doubly",
     "linked",
     "list",
-    "linked list",
-    "linked-list",
-    "singly linked list",
-    "singly-linked-list",
-    "doubly linked list",
-    "doubly-linked-list",
-    "javascript data structure",
-    "javascript data structures",
-    "typescript data structures",
-    "js data structure",
-    "js data structures",
-    "data-structure",
-    "data-structures",
-    "directed",
-    "undirected",
-    "graph",
     "js",
     "ts",
     "javascript",
@@ -195,6 +150,7 @@
     "Python",
     "collections",
     "Python Collections",
+    "pythoncollections",
     "python-collections",
     "C#",
     "System.Collections.Generic",
@@ -202,6 +158,43 @@
     "java.util",
     "Java",
     "util",
+    "binary search tree",
+    "binarysearchtree",
+    "binary-search-tree",
+    "BST",
+    "binary tree",
+    "binarytree",
+    "binary-tree",
+    "red black tree",
+    "redblacktree",
+    "redblack tree",
+    "red-black-tree",
+    "redblack-tree",
+    "trie",
+    "prefix tree",
+    "prefixtree",
+    "prefix-tree",
+    "avl tree",
+    "avltree",
+    "avl-tree",
+    "tree set",
+    "treeset",
+    "tree-set",
+    "tree multiset",
+    "treemultiset",
+    "tree-multiset",
+    "tree map",
+    "treemap",
+    "tree-map",
+    "tree multimap",
+    "treemultimap",
+    "tree-multimap",
+    "binary indexed tree",
+    "binaryindexedtree",
+    "binary-indexed-tree",
+    "segment tree",
+    "segmenttree",
+    "segment-tree",
     "sort",
     "sorted",
     "order",
@@ -210,31 +203,61 @@
     "morris",
     "Morris",
     "bellman ford",
+    "bellmanford",
     "bellman-ford",
     "dijkstra",
     "Dijkstra",
     "floyd warshall",
+    "floydwarshall",
     "floyd-warshall",
     "tarjan",
     "tarjan's",
     "dfs",
     "depth first Search",
+    "depthfirstSearch",
     "depth-first-Search",
     "bfs",
     "breadth first search",
+    "breadthfirstsearch",
     "dfs iterative",
     "recursive",
     "iterative",
     "directed graph",
+    "directedgraph",
     "directed-graph",
     "undirected graph",
+    "undirectedgraph",
     "undirected-graph",
+    "min heap",
+    "minheap",
+    "min-heap",
+    "max heap",
+    "maxheap",
+    "max-heap",
+    "priority queue",
+    "priorityqueue",
+    "priority-queue",
+    "max priority queue",
+    "maxpriorityqueue",
+    "max-priority-queue",
+    "min priority queue",
+    "minpriorityqueue",
+    "min-priority-queue",
     "hash",
     "map",
-    "hashmap",
     "hash map",
+    "hashmap",
     "hash-map",
     "deque",
+    "linked list",
+    "linkedlist",
+    "linked-list",
+    "singly linked list",
+    "singlylinkedlist",
+    "singly-linked-list",
+    "doubly linked list",
+    "doublylinkedlist",
+    "doubly-linked-list",
     "stack",
     "CommonJS",
     "ES6",

package/src/data-structures/binary-tree/binary-tree.ts

@@ -316,8 +316,8 @@ export class BinaryTree<
    * @returns a boolean value.
    */
   isRealNode(node: KeyOrNodeOrEntry<K, V, NODE>): node is NODE {
-    if (!this.isNode(node)) return false;
-    return node !== this.NIL;
+    if (node === this.NIL || node === null || node === undefined) return false;
+    return this.isNode(node);
   }
 
   /**

package/src/data-structures/binary-tree/bst.ts

@@ -695,7 +695,7 @@ export class BST<
     if (!current) return undefined;
 
     if (this._variant === 'STANDARD') {
-      // For BSTVariant.MIN, find the rightmost node
+      // For 'STANDARD', find the rightmost node
       while (current.right !== undefined) {
         current = current.right;
       }

package/src/data-structures/index.ts

@@ -4,9 +4,9 @@ export * from './stack';
 export * from './queue';
 export * from './graph';
 export * from './binary-tree';
-export * from './tree';
 export * from './heap';
 export * from './priority-queue';
 export * from './matrix';
 export * from './trie';
 export * from './base';
+export * from './tree';

package/src/utils/index.ts

@@ -1 +1,2 @@
 export * from './utils';
+export * from './number';

package/src/utils/number.ts

@@ -0,0 +1,9 @@
+export function toBinaryString(num: number, digit = 32) {
+  // Convert number to binary string
+  let binaryString = (num >>> 0).toString(2); // Use the unsigned right shift operator to ensure you get a binary representation of a 32-bit unsigned integer
+
+  // Use pad Start to ensure the string length is 32 bits
+  binaryString = binaryString.padStart(digit, '0');
+
+  return binaryString;
+}

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

@@ -1,39 +0,0 @@
-import { TreeNode } from '../../../../src';
-
-describe('TreeNode', () => {
-  it('should create a TreeNode with the given key and value', () => {
-    const node = new TreeNode<string>('1', 'Node 1');
-    expect(node.key).toBe('1');
-    expect(node.value).toBe('Node 1');
-    expect(node.children).toEqual([]);
-  });
-
-  it('should add children to the TreeNode', () => {
-    const parentNode = new TreeNode<string>('1', 'Parent Node');
-    const child1 = new TreeNode<string>('2', 'Child 1');
-    const child2 = new TreeNode<string>('3', 'Child 2');
-
-    parentNode.addChildren([child1, child2]);
-
-    expect(parentNode.children).toEqual([child1, child2]);
-  });
-
-  it('should calculate the height of the tree correctly', () => {
-    const rootNode = new TreeNode<string>('1', 'Root Node');
-    const child1 = new TreeNode<string>('2', 'Child 1');
-    const child2 = new TreeNode<string>('3', 'Child 2');
-    const grandchild1 = new TreeNode<string>('4', 'Grandchild 1');
-    const grandchild2 = new TreeNode<string>('5', 'Grandchild 2');
-
-    rootNode.addChildren([child1, child2]);
-    child1.addChildren([grandchild1]);
-    child2.addChildren([grandchild2]);
-
-    expect(rootNode.getHeight()).toBe(2); // Height of the tree should be 2
-  });
-
-  it('should handle nodes without children when calculating height', () => {
-    const rootNode = new TreeNode<string>('1', 'Root Node');
-    expect(rootNode.getHeight()).toBe(0); // Height of a single node should be 0
-  });
-});