heap-typed 1.49.4 → 1.49.6

package/src/data-structures/base/iterable-base.ts

@@ -1,7 +1,6 @@
-import { ElementCallback, EntryCallback, ReduceElementCallback, ReduceEntryCallback } from "../../types";
+import { ElementCallback, EntryCallback, ReduceElementCallback, ReduceEntryCallback } from '../../types';
 
 export abstract class IterableEntryBase<K = any, V = any> {
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -147,7 +146,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      callbackfn.call(thisArg, value, key, index++, this)
+      callbackfn.call(thisArg, value, key, index++, this);
     }
   }
 
@@ -176,7 +175,7 @@ export abstract class IterableEntryBase<K = any, V = any> {
     let index = 0;
     for (const item of this) {
       const [key, value] = item;
-      accumulator = callbackfn(accumulator, value, key, index++, this)
+      accumulator = callbackfn(accumulator, value, key, index++, this);
     }
     return accumulator;
   }
@@ -193,14 +192,13 @@ export abstract class IterableEntryBase<K = any, V = any> {
    * Space Complexity: O(n)
    */
   print(): void {
-    console.log([...this])
+    console.log([...this]);
   }
 
   protected abstract _getIterator(...args: any[]): IterableIterator<[K, V]>;
 }
 
 export abstract class IterableElementBase<V> {
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(1)
@@ -310,7 +308,7 @@ export abstract class IterableElementBase<V> {
   forEach(callbackfn: ElementCallback<V, void>, thisArg?: any): void {
     let index = 0;
     for (const item of this) {
-      callbackfn.call(thisArg, item as V, index++, this)
+      callbackfn.call(thisArg, item as V, index++, this);
     }
   }
 
@@ -335,18 +333,17 @@ export abstract class IterableElementBase<V> {
     let accumulator = initialValue;
     let index = 0;
     for (const item of this) {
-      accumulator = callbackfn(accumulator, item as V, index++, this)
+      accumulator = callbackfn(accumulator, item as V, index++, this);
     }
     return accumulator;
   }
 
-
   /**
    * Time Complexity: O(n)
    * Space Complexity: O(n)
    */
   print(): void {
-    console.log([...this])
+    console.log([...this]);
   }
 
   protected abstract _getIterator(...args: any[]): IterableIterator<V>;

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

@@ -13,12 +13,15 @@ import type {
   BinaryTreeDeleteResult,
   BSTNKeyOrNode,
   BTNCallback,
-  BTNExemplar,
-  BTNKeyOrNode
+  KeyOrNodeOrEntry
 } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 
-export class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNodeNested<K, V>> extends BSTNode<K, V, N> {
+export class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNodeNested<K, V>> extends BSTNode<
+  K,
+  V,
+  N
+> {
   height: number;
 
   constructor(key: K, value?: V) {
@@ -36,22 +39,26 @@ export class AVLTreeNode<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLT
  * 6. Complex Insertions and Deletions: Due to rebalancing, these operations are more complex than in a regular BST.
  * 7. Path Length: The path length from the root to any leaf is longer compared to an unbalanced BST, but shorter than a linear chain of nodes.
  */
-export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>, TREE extends AVLTree<K, V, N, TREE> = AVLTree<K, V, N, AVLTreeNested<K, V, N>>>
+export class AVLTree<
+  K = any,
+  V = any,
+  N extends AVLTreeNode<K, V, N> = AVLTreeNode<K, V, AVLTreeNodeNested<K, V>>,
+  TREE extends AVLTree<K, V, N, TREE> = AVLTree<K, V, N, AVLTreeNested<K, V, N>>
+>
   extends BST<K, V, N, TREE>
   implements IBinaryTree<K, V, N, TREE> {
-
   /**
-   * The constructor function initializes an AVLTree object with optional elements and options.
-   * @param [elements] - The `elements` parameter is an optional iterable of `BTNExemplar<K, V, N>`
-   * objects. It represents a collection of elements that will be added to the AVL tree during
+   * The constructor function initializes an AVLTree object with optional nodes and options.
+   * @param [nodes] - The `nodes` parameter is an optional iterable of `KeyOrNodeOrEntry<K, V, N>`
+   * objects. It represents a collection of nodes that will be added to the AVL tree during
    * initialization.
    * @param [options] - The `options` parameter is an optional object that allows you to customize the
    * behavior of the AVL tree. It is of type `Partial<AVLTreeOptions>`, which means that you can
    * provide only a subset of the properties defined in the `AVLTreeOptions` interface.
    */
-  constructor(elements?: Iterable<BTNExemplar<K, V, N>>, options?: Partial<AVLTreeOptions<K>>) {
+  constructor(nodes?: Iterable<KeyOrNodeOrEntry<K, V, N>>, options?: Partial<AVLTreeOptions<K>>) {
     super([], options);
-    if (elements) super.addMany(elements);
+    if (nodes) super.addMany(nodes);
   }
 
   /**
@@ -77,17 +84,18 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   override createTree(options?: AVLTreeOptions<K>): TREE {
     return new AVLTree<K, V, N, TREE>([], {
       iterationType: this.iterationType,
-      variant: this.variant, ...options
+      variant: this.variant,
+      ...options
     }) as TREE;
   }
 
   /**
-   * The function checks if an exemplar is an instance of AVLTreeNode.
-   * @param exemplar - The `exemplar` parameter is of type `BTNExemplar<K, V, N>`.
-   * @returns a boolean value indicating whether the exemplar is an instance of the AVLTreeNode class.
+   * The function checks if an keyOrNodeOrEntry is an instance of AVLTreeNode.
+   * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter is of type `KeyOrNodeOrEntry<K, V, N>`.
+   * @returns a boolean value indicating whether the keyOrNodeOrEntry is an instance of the AVLTreeNode class.
    */
-  override isNode(exemplar: BTNExemplar<K, V, N>): exemplar is N {
-    return exemplar instanceof AVLTreeNode;
+  override isNode(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, N>): keyOrNodeOrEntry is N {
+    return keyOrNodeOrEntry instanceof AVLTreeNode;
   }
 
   /**
@@ -96,19 +104,19 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
    * data type.
    * @returns a boolean value indicating whether the potentialKey is of type number or not.
    */
-  override isNotNodeInstance(potentialKey: BTNKeyOrNode<K, N>): potentialKey is K {
-    return !(potentialKey instanceof AVLTreeNode)
+  override isNotNodeInstance(potentialKey: KeyOrNodeOrEntry<K, V, N>): potentialKey is K {
+    return !(potentialKey instanceof AVLTreeNode);
   }
 
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
+   * logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity. constant space, as it doesn't use additional data structures that scale with input size.
    */
 
-
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
    *
    * The function overrides the add method of a binary tree node and balances the tree after inserting
    * a new node.
@@ -118,21 +126,21 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
    * being added to the binary tree.
    * @returns The method is returning either the inserted node or undefined.
    */
-  override add(keyOrNodeOrEntry: BTNExemplar<K, V, N>, value?: V): N | undefined {
-    if (keyOrNodeOrEntry === null) return undefined;
+  override add(keyOrNodeOrEntry: KeyOrNodeOrEntry<K, V, N>, value?: V): boolean {
+    if (keyOrNodeOrEntry === null) return false;
     const inserted = super.add(keyOrNodeOrEntry, value);
-    if (inserted) this._balancePath(inserted);
+    if (inserted) this._balancePath(keyOrNodeOrEntry);
     return inserted;
   }
 
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
    */
 
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The delete method of the superclass (BST) has logarithmic time complexity.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
    *
    * The function overrides the delete method of a binary tree, performs the deletion, and then
    * balances the tree if necessary.
@@ -159,7 +167,6 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
     return deletedResults;
   }
 
-
   /**
    * The `_swapProperties` function swaps the key, value, and height properties between two nodes in a binary
    * tree.
@@ -196,13 +203,14 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as it performs a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
+   * constant time, as it performs a fixed number of operations. constant space, as it only uses a constant amount of memory.
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as it performs a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The function calculates the balance factor of a node in a binary tree.
    * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
@@ -220,13 +228,14 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as it performs a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
+   * constant time, as it performs a fixed number of operations. constant space, as it only uses a constant amount of memory.
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as it performs a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as it only uses a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The function updates the height of a node in a binary tree based on the heights of its left and
    * right children.
@@ -242,20 +251,22 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
+   * logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root. constant space, as it doesn't use additional data structures that scale with input size.
    */
 
   /**
-   * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The method traverses the path from the inserted node to the root.
-   * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
+   * Time Complexity: O(log n)
+   * Space Complexity: O(1)
    *
    * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
    * to restore balance in an AVL tree after inserting a node.
    * @param {N} node - The `node` parameter in the `_balancePath` function represents the node in the
    * AVL tree that needs to be balanced.
    */
-  protected _balancePath(node: N): void {
+  protected _balancePath(node: KeyOrNodeOrEntry<K, V, N>): void {
+    node = this.ensureNode(node);
     const path = this.getPathToRoot(node, false); // first O(log n) + O(log n)
     for (let i = 0; i < path.length; i++) {
       // second O(log n)
@@ -295,13 +306,14 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
+   * constant time, as these methods perform a fixed number of operations. constant space, as they only use a constant amount of memory.
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
    * @param {N} A - A is a node in a binary tree.
@@ -333,13 +345,13 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The `_balanceLR` function performs a left-right rotation to balance a binary tree.
    * @param {N} A - A is a node in a binary tree.
@@ -389,13 +401,13 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The function `_balanceRR` performs a right-right rotation to balance a binary tree.
    * @param {N} A - A is a node in a binary tree.
@@ -432,13 +444,13 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   }
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    */
 
   /**
-   * Time Complexity: O(1) - constant time, as these methods perform a fixed number of operations.
-   * Space Complexity: O(1) - constant space, as they only use a constant amount of memory.
+   * Time Complexity: O(1)
+   * Space Complexity: O(1)
    *
    * The function `_balanceRL` performs a right-left rotation to balance a binary tree.
    * @param {N} A - A is a node in a binary tree.
@@ -489,6 +501,6 @@ export class AVLTree<K = any, V = any, N extends AVLTreeNode<K, V, N> = AVLTreeN
   protected _replaceNode(oldNode: N, newNode: N): N {
     newNode.height = oldNode.height;
 
-    return super._replaceNode(oldNode, newNode)
+    return super._replaceNode(oldNode, newNode);
   }
 }