release: v1.52.6

zrwusa · Oct 29, 2024 · aece11b · aece11b
1 parent a29dc27
commit aece11b
Show file tree

Hide file tree

Showing 10 changed files with 146 additions and 155 deletions.
diff --git a/CHANGELOG.md b/CHANGELOG.md
@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v1.52.4](https://github.com/zrwusa/data-structure-typed/compare/v1.51.5...main) (upcoming)
+## [v1.52.6](https://github.com/zrwusa/data-structure-typed/compare/v1.51.5...main) (upcoming)
 
 ### Changes
 

diff --git a/README.md b/README.md
diff --git a/package-lock.json b/package-lock.json
diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.52.5",
+  "version": "1.52.6",
   "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.52.3",
+    "avl-tree-typed": "^1.52.5",
     "benchmark": "^2.1.4",
-    "binary-tree-typed": "^1.52.3",
-    "bst-typed": "^1.52.3",
-    "data-structure-typed": "^1.52.3",
+    "binary-tree-typed": "^1.52.5",
+    "bst-typed": "^1.52.5",
+    "data-structure-typed": "^1.52.5",
     "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.52.3",
+    "heap-typed": "^1.52.5",
     "istanbul-badges-readme": "^1.8.5",
     "jest": "^29.7.0",
     "js-sdsl": "^4.4.2",

diff --git a/src/data-structures/binary-tree/binary-tree.ts b/src/data-structures/binary-tree/binary-tree.ts
@@ -335,7 +335,7 @@ export class BinaryTree<
    * @returns a boolean value.
    */
   isRealNodeOrNull(node: R | BTNKeyOrNodeOrEntry<K, V, NODE>): node is NODE | null {
-    return this.isRealNode(node) || node === null;
+    return node === null || this.isRealNode(node);
   }
 
   /**
@@ -1843,7 +1843,7 @@ export class BinaryTree<
       if (includeNull) return this.isRealNodeOrNull(node);
       return this.isRealNode(node);
     },
-    shouldProcessRoot: (node: OptBTNOrNull<NODE>) => boolean = node => true
+    shouldProcessRoot: (node: OptBTNOrNull<NODE>) => boolean = node => this.isRealNodeOrNull(node)
   ): ReturnType<C>[] {
     beginRoot = this.ensureNode(beginRoot);
     if (!beginRoot) return [];

diff --git a/src/data-structures/tree/tree.ts b/src/data-structures/tree/tree.ts
@@ -12,6 +12,7 @@ export class TreeNode<V = any> {
   constructor(key: string, value?: V, children?: TreeNode<V>[]) {
     this._key = key;
     this._value = value || undefined;
+    if (children) this._children = children;
   }
 
   protected _key: string;

diff --git a/test/integration/all-in-one.test.ts b/test/integration/all-in-one.test.ts
@@ -19,7 +19,7 @@ describe('AVL Tree Test from data-structure-typed', () => {
     expect(getMinNodeByRoot?.key).toBe(1);
 
     const node15 = tree.getNode(15);
-    const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node15);
+    const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node => node, node15);
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;

diff --git a/test/integration/avl-tree.test.ts b/test/integration/avl-tree.test.ts
@@ -36,7 +36,7 @@ describe('AVL Tree Test', () => {
     expect(getMinNodeByRoot?.key).toBe(1);
 
     const node15 = tree.getNode(15);
-    const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node15);
+    const getMinNodeBySpecificNode = node15 && tree.getLeftMost(node => node, node15);
     expect(getMinNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;

diff --git a/test/integration/bst.test.ts b/test/integration/bst.test.ts
@@ -30,7 +30,7 @@ describe('Individual package BST operations test', () => {
     expect(leftMost?.key).toBe(1);
 
     const node15 = bst.getNode(15);
-    const minNodeBySpecificNode = node15 && bst.getLeftMost(node15);
+    const minNodeBySpecificNode = node15 && bst.getLeftMost(node => node, node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;
@@ -230,7 +230,7 @@ describe('Individual package BST operations test', () => {
       key: 15,
       keyA: 15
     });
-    const minNodeBySpecificNode = node15 && objBST.getLeftMost(node15);
+    const minNodeBySpecificNode = node15 && objBST.getLeftMost(node => node, node15);
     expect(minNodeBySpecificNode?.key).toBe(12);
 
     let subTreeSum = 0;