min-priority-queue-typed 2.1.2 → 2.2.1

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

@@ -11,15 +11,18 @@ import type {
   BinaryTreeOptions,
   CRUD,
   EntryCallback,
+  FamilyPosition,
   OptNode,
   RBTNColor,
   RedBlackTreeOptions
 } from '../../types';
-import { BST, BSTNode } from './bst';
+import { BST } from './bst';
 import { IBinaryTree } from '../../interfaces';
 
-export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
-  override parent?: RedBlackTreeNode<K, V> = undefined;
+export class RedBlackTreeNode<K = any, V = any> {
+  key: K;
+  value?: V;
+  parent?: RedBlackTreeNode<K, V> = undefined;
 
   /**
    * Create a Red-Black Tree and optionally bulk-insert items.
@@ -31,11 +34,12 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
    */
 
   constructor(key: K, value?: V, color: RBTNColor = 'BLACK') {
-    super(key, value);
-    this._color = color;
+    this.key = key;
+    this.value = value;
+    this.color = color;
   }
 
-  override _left?: RedBlackTreeNode<K, V> | null | undefined = undefined;
+  _left?: RedBlackTreeNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the left child pointer.
@@ -43,7 +47,7 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
    * @returns Left child node, or null/undefined.
    */
 
-  override get left(): RedBlackTreeNode<K, V> | null | undefined {
+  get left(): RedBlackTreeNode<K, V> | null | undefined {
     return this._left;
   }
 
@@ -54,14 +58,14 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
    * @returns void
    */
 
-  override set left(v: RedBlackTreeNode<K, V> | null | undefined) {
+  set left(v: RedBlackTreeNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._left = v;
   }
 
-  override _right?: RedBlackTreeNode<K, V> | null | undefined = undefined;
+  _right?: RedBlackTreeNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the right child pointer.
@@ -69,7 +73,7 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
    * @returns Right child node, or null/undefined.
    */
 
-  override get right(): RedBlackTreeNode<K, V> | null | undefined {
+  get right(): RedBlackTreeNode<K, V> | null | undefined {
     return this._right;
   }
 
@@ -80,12 +84,98 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
    * @returns void
    */
 
-  override set right(v: RedBlackTreeNode<K, V> | null | undefined) {
+  set right(v: RedBlackTreeNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._right = v;
   }
+
+  _height: number = 0;
+
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height(): number {
+    return this._height;
+  }
+
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value: number) {
+    this._height = value;
+  }
+
+  _color: RBTNColor = 'BLACK';
+
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color(): RBTNColor {
+    return this._color;
+  }
+
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value: RBTNColor) {
+    this._color = value;
+  }
+
+  _count: number = 1;
+
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count(): number {
+    return this._count;
+  }
+
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value: number) {
+    this._count = value;
+  }
+
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition(): FamilyPosition {
+    if (!this.parent) {
+      return this.left || this.right ? 'ROOT' : 'ISOLATED';
+    }
+
+    if (this.parent.left === this) {
+      return this.left || this.right ? 'ROOT_LEFT' : 'LEFT';
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? 'ROOT_RIGHT' : 'RIGHT';
+    }
+
+    return 'MAL_NODE';
+  }
 }
 
 /**
@@ -94,8 +184,9 @@ export class RedBlackTreeNode<K = any, V = any> extends BSTNode<K, V> {
  * @template K
  * @template V
  * @template R
- * 1. Efficient self-balancing, but not completely balanced. Compared with AVLTree, the addition and deletion efficiency is high but the query efficiency is slightly lower.
+ * 1. Efficient self-balancing, but not completely balanced. Compared with AVLTree, the addition and deletion efficiency is high, but the query efficiency is slightly lower.
  * 2. It is BST itself. Compared with Heap which is not completely ordered, RedBlackTree is completely ordered.
+ *
  * @example
  * // using Red-Black Tree as a price-based index for stock data
  *     // Define the structure of individual stock records
@@ -330,7 +421,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
 
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }
@@ -380,10 +471,10 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
    */
 
   protected _insert(node: RedBlackTreeNode<K, V>): CRUD {
-    let current = this.root;
+    let current = this.root ?? this.NIL;
     let parent: RedBlackTreeNode<K, V> | undefined = undefined;
 
-    while (this.isRealNode(current)) {
+    while (current !== this.NIL) {
       parent = current;
       const compared = this._compare(node.key, current.key);
       if (compared < 0) {
@@ -459,7 +550,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
             this._leftRotate(z);
           }
 
-          if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+          if (z && z.parent && z.parent.parent) {
             z.parent.color = 'BLACK';
             z.parent.parent.color = 'RED';
             this._rightRotate(z.parent.parent);
@@ -478,7 +569,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
             this._rightRotate(z);
           }
 
-          if (z && this.isRealNode(z.parent) && this.isRealNode(z.parent.parent)) {
+          if (z && z.parent && z.parent.parent) {
             z.parent.color = 'BLACK';
             z.parent.parent.color = 'RED';
             this._leftRotate(z.parent.parent);
@@ -575,7 +666,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     const y = x.right;
     x.right = y.left;
 
-    if (this.isRealNode(y.left)) {
+    if (y.left && y.left !== this.NIL) {
       y.left.parent = x;
     }
 
@@ -608,7 +699,7 @@ export class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R> implem
     const x = y.left;
     y.left = x.right;
 
-    if (this.isRealNode(x.right)) {
+    if (x.right && x.right !== this.NIL) {
       x.right.parent = y;
     }
 

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

@@ -11,6 +11,7 @@ import type {
   BinaryTreeOptions,
   BSTNOptKeyOrNode,
   EntryCallback,
+  FamilyPosition,
   IterationType,
   OptNode,
   RBTNColor,
@@ -19,7 +20,7 @@ import type {
 import { BSTOptions } from '../../types';
 import { BSTNode } from './bst';
 import { IBinaryTree } from '../../interfaces';
-import { RedBlackTree, RedBlackTreeNode } from './red-black-tree';
+import { RedBlackTree } from './red-black-tree';
 
 /**
  * RB-tree node with an extra 'count' field; keeps parent/child links.
@@ -27,8 +28,10 @@ import { RedBlackTree, RedBlackTreeNode } from './red-black-tree';
  * @template K
  * @template V
  */
-export class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<K, V> {
-  override parent?: TreeCounterNode<K, V> = undefined;
+export class TreeCounterNode<K = any, V = any> {
+  key: K;
+  value?: V;
+  parent?: TreeCounterNode<K, V> = undefined;
 
   /**
    * Create a tree counter node.
@@ -40,18 +43,20 @@ export class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<K, V> {
    * @returns New TreeCounterNode instance.
    */
   constructor(key: K, value?: V, count = 1, color: RBTNColor = 'BLACK') {
-    super(key, value, color);
+    this.key = key;
+    this.value = value;
+    this.color = color;
     this.count = count;
   }
 
-  override _left?: TreeCounterNode<K, V> | null | undefined = undefined;
+  _left?: TreeCounterNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
    * @returns Left child node, or null/undefined.
    */
-  override get left(): TreeCounterNode<K, V> | null | undefined {
+  get left(): TreeCounterNode<K, V> | null | undefined {
     return this._left;
   }
 
@@ -61,21 +66,21 @@ export class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<K, V> {
    * @param v - New left child node, or null/undefined.
    * @returns void
    */
-  override set left(v: TreeCounterNode<K, V> | null | undefined) {
+  set left(v: TreeCounterNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._left = v;
   }
 
-  override _right?: TreeCounterNode<K, V> | null | undefined = undefined;
+  _right?: TreeCounterNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
    * @returns Right child node, or null/undefined.
    */
-  override get right(): TreeCounterNode<K, V> | null | undefined {
+  get right(): TreeCounterNode<K, V> | null | undefined {
     return this._right;
   }
 
@@ -85,12 +90,98 @@ export class TreeCounterNode<K = any, V = any> extends RedBlackTreeNode<K, V> {
    * @param v - New right child node, or null/undefined.
    * @returns void
    */
-  override set right(v: TreeCounterNode<K, V> | null | undefined) {
+  set right(v: TreeCounterNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._right = v;
   }
+
+  _height: number = 0;
+
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height(): number {
+    return this._height;
+  }
+
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value: number) {
+    this._height = value;
+  }
+
+  _color: RBTNColor = 'BLACK';
+
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color(): RBTNColor {
+    return this._color;
+  }
+
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value: RBTNColor) {
+    this._color = value;
+  }
+
+  _count: number = 1;
+
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count(): number {
+    return this._count;
+  }
+
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value: number) {
+    this._count = value;
+  }
+
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition(): FamilyPosition {
+    if (!this.parent) {
+      return this.left || this.right ? 'ROOT' : 'ISOLATED';
+    }
+
+    if (this.parent.left === this) {
+      return this.left || this.right ? 'ROOT_LEFT' : 'LEFT';
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? 'ROOT_RIGHT' : 'RIGHT';
+    }
+
+    return 'MAL_NODE';
+  }
 }
 
 /**
@@ -348,7 +439,7 @@ export class TreeCounter<K = any, V = any, R = any> extends RedBlackTree<K, V, R
 
     let index = 0;
     for (const [key, value] of this) {
-      out.add(callback.call(thisArg, key, value, index++, this));
+      out.add(callback.call(thisArg, value, key, index++, this));
     }
     return out;
   }

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

@@ -6,7 +6,15 @@
  * @license MIT License
  */
 
-import type { BTNOptKeyOrNull, ElemOf, EntryCallback, RedBlackTreeOptions, TreeMultiMapOptions } from '../../types';
+import type {
+  BTNOptKeyOrNull,
+  ElemOf,
+  EntryCallback,
+  FamilyPosition,
+  RBTNColor,
+  RedBlackTreeOptions,
+  TreeMultiMapOptions
+} from '../../types';
 import { RedBlackTree, RedBlackTreeNode } from './red-black-tree';
 import { IBinaryTree } from '../../interfaces';
 
@@ -16,8 +24,10 @@ import { IBinaryTree } from '../../interfaces';
  * @template K
  * @template V
  */
-export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]> {
-  override parent?: TreeMultiMapNode<K, V> = undefined;
+export class TreeMultiMapNode<K = any, V = any> {
+  key: K;
+  value?: V[];
+  parent?: TreeMultiMapNode<K, V> = undefined;
 
   /**
    * Create a TreeMultiMap node with an optional value bucket.
@@ -26,18 +36,20 @@ export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]>
    * @param [value] - Initial array of values.
    * @returns New TreeMultiMapNode instance.
    */
-  constructor(key: K, value?: V[]) {
-    super(key, value);
+  constructor(key: K, value: V[] = [], color: RBTNColor = 'BLACK') {
+    this.key = key;
+    this.value = value;
+    this.color = color;
   }
 
-  override _left?: TreeMultiMapNode<K, V> | null | undefined = undefined;
+  _left?: TreeMultiMapNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the left child pointer.
    * @remarks Time O(1), Space O(1)
    * @returns Left child node, or null/undefined.
    */
-  override get left(): TreeMultiMapNode<K, V> | null | undefined {
+  get left(): TreeMultiMapNode<K, V> | null | undefined {
     return this._left;
   }
 
@@ -47,21 +59,21 @@ export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]>
    * @param v - New left child node, or null/undefined.
    * @returns void
    */
-  override set left(v: TreeMultiMapNode<K, V> | null | undefined) {
+  set left(v: TreeMultiMapNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._left = v;
   }
 
-  override _right?: TreeMultiMapNode<K, V> | null | undefined = undefined;
+  _right?: TreeMultiMapNode<K, V> | null | undefined = undefined;
 
   /**
    * Get the right child pointer.
    * @remarks Time O(1), Space O(1)
    * @returns Right child node, or null/undefined.
    */
-  override get right(): TreeMultiMapNode<K, V> | null | undefined {
+  get right(): TreeMultiMapNode<K, V> | null | undefined {
     return this._right;
   }
 
@@ -71,12 +83,98 @@ export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]>
    * @param v - New right child node, or null/undefined.
    * @returns void
    */
-  override set right(v: TreeMultiMapNode<K, V> | null | undefined) {
+  set right(v: TreeMultiMapNode<K, V> | null | undefined) {
     if (v) {
       v.parent = this;
     }
     this._right = v;
   }
+
+  _height: number = 0;
+
+  /**
+   * Gets the height of the node (used in self-balancing trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The height.
+   */
+  get height(): number {
+    return this._height;
+  }
+
+  /**
+   * Sets the height of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new height.
+   */
+  set height(value: number) {
+    this._height = value;
+  }
+
+  _color: RBTNColor = 'BLACK';
+
+  /**
+   * Gets the color of the node (used in Red-Black trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The node's color.
+   */
+  get color(): RBTNColor {
+    return this._color;
+  }
+
+  /**
+   * Sets the color of the node.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new color.
+   */
+  set color(value: RBTNColor) {
+    this._color = value;
+  }
+
+  _count: number = 1;
+
+  /**
+   * Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The subtree node count.
+   */
+  get count(): number {
+    return this._count;
+  }
+
+  /**
+   * Sets the count of nodes in the subtree.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param value - The new count.
+   */
+  set count(value: number) {
+    this._count = value;
+  }
+
+  /**
+   * Gets the position of the node relative to its parent.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @returns The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
+   */
+  get familyPosition(): FamilyPosition {
+    if (!this.parent) {
+      return this.left || this.right ? 'ROOT' : 'ISOLATED';
+    }
+
+    if (this.parent.left === this) {
+      return this.left || this.right ? 'ROOT_LEFT' : 'LEFT';
+    } else if (this.parent.right === this) {
+      return this.left || this.right ? 'ROOT_RIGHT' : 'RIGHT';
+    }
+
+    return 'MAL_NODE';
+  }
 }
 
 /**
@@ -85,6 +183,7 @@ export class TreeMultiMapNode<K = any, V = any> extends RedBlackTreeNode<K, V[]>
  * @template K
  * @template V
  * @template R
+ *
  * @example
  * // players ranked by score with their equipment
  *     type Equipment = {
@@ -274,6 +373,19 @@ export class TreeMultiMap<K = any, V = any, R = any> extends RedBlackTree<K, V[]
     return new TreeMultiMapNode<K, V>(key, this._isMapMode ? [] : value);
   }
 
+  /**
+   * Checks if the given item is a `TreeMultiMapNode` instance.
+   * @remarks Time O(1), Space O(1)
+   *
+   * @param keyNodeOrEntry - The item to check.
+   * @returns True if it's a TreeMultiMapNode, false otherwise.
+   */
+  override isNode(
+    keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined
+  ): keyNodeOrEntry is TreeMultiMapNode<K, V> {
+    return keyNodeOrEntry instanceof TreeMultiMapNode;
+  }
+
   override add(
     keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined
   ): boolean;
@@ -392,7 +504,7 @@ export class TreeMultiMap<K = any, V = any, R = any> extends RedBlackTree<K, V[]
   ): RedBlackTree<MK, MV, MR> {
     const out = this._createLike<MK, MV, MR>([], options);
     let i = 0;
-    for (const [k, v] of this) out.add(callback.call(thisArg, k, v, i++, this));
+    for (const [k, v] of this) out.add(callback.call(thisArg, v, k, i++, this));
     return out;
   }
 

package/src/data-structures/graph/abstract-graph.ts

@@ -50,11 +50,11 @@ export abstract class AbstractEdge<E = any> {
  * @example examples will be generated by unit test
  */
 export abstract class AbstractGraph<
-    V = any,
-    E = any,
-    VO extends AbstractVertex<V> = AbstractVertex<V>,
-    EO extends AbstractEdge<E> = AbstractEdge<E>
-  >
+  V = any,
+  E = any,
+  VO extends AbstractVertex<V> = AbstractVertex<V>,
+  EO extends AbstractEdge<E> = AbstractEdge<E>
+>
   extends IterableEntryBase<VertexKey, V | undefined>
   implements IGraph<V, E, VO, EO>
 {
@@ -897,7 +897,7 @@ export abstract class AbstractGraph<
     const filtered: [VertexKey, V | undefined][] = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -916,7 +916,7 @@ export abstract class AbstractGraph<
     const filtered: [VertexKey, V | undefined][] = [];
     let index = 0;
     for (const [key, value] of this) {
-      if (predicate.call(thisArg, key, value, index, this)) {
+      if (predicate.call(thisArg, value, key, index, this)) {
         filtered.push([key, value]);
       }
       index++;
@@ -928,7 +928,7 @@ export abstract class AbstractGraph<
     const mapped: T[] = [];
     let index = 0;
     for (const [key, value] of this) {
-      mapped.push(callback.call(thisArg, key, value, index, this));
+      mapped.push(callback.call(thisArg, value, key, index, this));
       index++;
     }
     return mapped;

package/src/data-structures/graph/directed-graph.ts

@@ -38,11 +38,11 @@ export class DirectedEdge<E = any> extends AbstractEdge<E> {
  * @example examples will be generated by unit test
  */
 export class DirectedGraph<
-    V = any,
-    E = any,
-    VO extends DirectedVertex<V> = DirectedVertex<V>,
-    EO extends DirectedEdge<E> = DirectedEdge<E>
-  >
+  V = any,
+  E = any,
+  VO extends DirectedVertex<V> = DirectedVertex<V>,
+  EO extends DirectedEdge<E> = DirectedEdge<E>
+>
   extends AbstractGraph<V, E, VO, EO>
   implements IGraph<V, E, VO, EO>
 {