min-heap-typed 1.42.3 → 1.42.4

package/dist/data-structures/binary-tree/tree-multiset.js

@@ -52,23 +52,25 @@ class TreeMultiset extends avl_tree_1.AVLTree {
     /**
      * The `add` function adds a new node to a binary search tree, updating the count if the key already
      * exists, and balancing the tree if necessary.
-     * @param {BTNKey | N | null} keyOrNode - The `keyOrNode` parameter can be either a
+     * @param {BTNKey | N | undefined} keyOrNode - The `keyOrNode` parameter can be either a
      * `BTNKey` (which represents the key of the node to be added), a `N` (which represents a
-     * node to be added), or `null` (which represents a null node).
+     * node to be added), or `undefined` (which represents a undefined node).
      * @param [value] - The `value` parameter represents the value associated with the key that is being
      * added to the binary tree.
      * @param [count=1] - The `count` parameter represents the number of occurrences of the key/value
      * pair that will be added to the binary tree. It has a default value of 1, which means that if no
      * count is specified, the default count will be 1.
-     * @returns The function `add` returns a value of type `N | null | undefined`.
+     * @returns The function `add` returns a value of type `N | undefined | undefined`.
      */
     add(keyOrNode, value, count = 1) {
+        if (keyOrNode === null)
+            return undefined;
         let inserted = undefined, newNode;
         if (keyOrNode instanceof TreeMultisetNode) {
             newNode = this.createNode(keyOrNode.key, keyOrNode.value, keyOrNode.count);
         }
-        else if (keyOrNode === null) {
-            newNode = null;
+        else if (keyOrNode === undefined) {
+            newNode = undefined;
         }
         else {
             newNode = this.createNode(keyOrNode, value, count);
@@ -126,7 +128,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
                         }
                     }
                     else {
-                        // TODO may need to support null inserted
+                        // TODO may need to support undefined inserted
                     }
                 }
                 else {
@@ -140,8 +142,8 @@ class TreeMultiset extends avl_tree_1.AVLTree {
     }
     /**
      * The function adds a new node to a binary tree if there is an available slot in the parent node.
-     * @param {N | null} newNode - The `newNode` parameter represents the node that needs to be added to
-     * the tree. It can be either a node object (`N`) or `null`.
+     * @param {N | undefined} newNode - The `newNode` parameter represents the node that needs to be added to
+     * the tree. It can be either a node object (`N`) or `undefined`.
      * @param {N} parent - The `parent` parameter represents the parent node to which the new node will
      * be added as a child.
      * @returns The method `_addTo` returns either the `parent.left`, `parent.right`, or `undefined`.
@@ -150,7 +152,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
         if (parent) {
             if (parent.left === undefined) {
                 parent.left = newNode;
-                if (newNode !== null) {
+                if (newNode !== undefined) {
                     this._size = this.size + 1;
                     this._setCount(this.count + newNode.count);
                 }
@@ -158,7 +160,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
             }
             else if (parent.right === undefined) {
                 parent.right = newNode;
-                if (newNode !== null) {
+                if (newNode !== undefined) {
                     this._size = this.size + 1;
                     this._setCount(this.count + newNode.count);
                 }
@@ -175,12 +177,12 @@ class TreeMultiset extends avl_tree_1.AVLTree {
     /**
      * The `addMany` function adds multiple keys or nodes to a TreeMultiset and returns an array of the
      * inserted nodes.
-     * @param {(BTNKey | null)[] | (N | null)[]} keysOrNodes - An array of keys or nodes to be
+     * @param {(BTNKey | undefined)[] | (N | undefined)[]} keysOrNodes - An array of keys or nodes to be
      * added to the multiset. Each element can be either a BTNKey or a TreeMultisetNode.
      * @param {V[]} [data] - The `data` parameter is an optional array of values that correspond
      * to the keys or nodes being added to the multiset. It is used to associate additional data with
      * each key or node.
-     * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
+     * @returns The function `addMany` returns an array of `N`, `undefined`, or `undefined` values.
      */
     addMany(keysOrNodes, data) {
         const inserted = [];
@@ -190,7 +192,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
                 inserted.push(this.add(keyOrNode.key, keyOrNode.value, keyOrNode.count));
                 continue;
             }
-            if (keyOrNode === null) {
+            if (keyOrNode === undefined) {
                 inserted.push(this.add(NaN, undefined, 0));
                 continue;
             }
@@ -259,14 +261,15 @@ class TreeMultiset extends avl_tree_1.AVLTree {
      * @returns The method `delete` returns an array of `BinaryTreeDeletedResult<N>` objects.
      */
     delete(identifier, callback = this.defaultOneParamCallback, ignoreCount = false) {
+        var _a;
         const bstDeletedResult = [];
         if (!this.root)
             return bstDeletedResult;
-        const curr = this.getNode(identifier, callback);
+        const curr = (_a = this.getNode(identifier, callback)) !== null && _a !== void 0 ? _a : undefined;
         if (!curr)
             return bstDeletedResult;
-        const parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : null;
-        let needBalanced = null, orgCurrent = curr;
+        const parent = (curr === null || curr === void 0 ? void 0 : curr.parent) ? curr.parent : undefined;
+        let needBalanced = undefined, orgCurrent = curr;
         if (curr.count > 1 && !ignoreCount) {
             curr.count--;
             this._setCount(this.count - 1);
@@ -289,7 +292,7 @@ class TreeMultiset extends avl_tree_1.AVLTree {
                 }
             }
             else {
-                const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : null;
+                const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : undefined;
                 if (leftSubTreeRightMost) {
                     const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
                     orgCurrent = this._swap(curr, leftSubTreeRightMost);

package/dist/types/data-structures/binary-tree/binary-tree.d.ts

@@ -21,7 +21,7 @@ export declare enum FamilyPosition {
 export type BTNKey = number;
 export type BinaryTreeDeletedResult<N> = {
     deleted: N | null | undefined;
-    needBalanced: N | null;
+    needBalanced: N | null | undefined;
 };
 export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions = {

package/dist/types/data-structures/binary-tree/rb-tree.d.ts

@@ -1,4 +1,8 @@
+import { RBTreeNode } from '../../../data-structures';
+import { BSTOptions } from "./bst";
 export declare enum RBTNColor {
     RED = 1,
     BLACK = 0
 }
+export type RBTreeNodeNested<T> = RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
+export type RBTreeOptions = BSTOptions & {};

package/dist/types/data-structures/binary-tree/rb-tree.js

@@ -1,6 +1,4 @@
 "use strict";
-// import {BinaryTreeOptions} from './binary-tree';
-// import {RBTreeNode} from '../../../data-structures';
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.RBTNColor = void 0;
 var RBTNColor;
@@ -8,6 +6,3 @@ var RBTNColor;
     RBTNColor[RBTNColor["RED"] = 1] = "RED";
     RBTNColor[RBTNColor["BLACK"] = 0] = "BLACK";
 })(RBTNColor = exports.RBTNColor || (exports.RBTNColor = {}));
-// export type RBTreeNodeNested<T> = RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-//
-// export type RBTreeOptions = BinaryTreeOptions & {}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.42.3",
+  "version": "1.42.4",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.42.3"
+    "data-structure-typed": "^1.42.4"
   }
 }

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

@@ -49,13 +49,14 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   /**
    * The function overrides the add method of a binary tree node and balances the tree after inserting
    * a new node.
-   * @param {BTNKey | N | null} keyOrNode - The `keyOrNode` parameter can accept either a
+   * @param {BTNKey | N | undefined} keyOrNode - The `keyOrNode` parameter can accept either a
    * `BTNKey` or a `N` (which represents a node in the binary tree) or `null`.
    * @param [value] - The `value` parameter is the value that you want to assign to the new node that you
    * are adding to the binary search tree.
    * @returns The method is returning the inserted node (`N`), `null`, or `undefined`.
    */
-  override add(keyOrNode: BTNKey | N | null, value?: V): N | null | undefined {
+  override add(keyOrNode: BTNKey | N | null | undefined, value?: V): N | undefined {
+    if (keyOrNode === null) return undefined;
     const inserted = super.add(keyOrNode, value);
     if (inserted) this._balancePath(inserted);
     return inserted;
@@ -226,7 +227,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   protected _balanceLR(A: N): void {
     const parentOfA = A.parent;
     const B = A.left;
-    let C = null;
+    let C = undefined;
     if (B) {
       C = B.right;
     }
@@ -309,7 +310,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   protected _balanceRL(A: N): void {
     const parentOfA = A.parent;
     const B = A.right;
-    let C = null;
+    let C = undefined;
     if (B) {
       C = B.left;
     }