binary-tree-typed 2.5.3 → 2.6.0

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

@@ -249,6 +249,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -348,6 +351,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -442,6 +448,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -536,6 +545,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -595,6 +607,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -726,6 +741,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -824,6 +842,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -879,6 +900,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -992,6 +1016,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -1115,6 +1142,9 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
    
    
    

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

@@ -258,6 +258,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -353,6 +356,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -443,6 +449,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -557,6 +566,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -616,6 +628,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -749,6 +764,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -926,6 +944,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -1001,6 +1022,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    
@@ -1056,6 +1080,9 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/hash/hash-map.ts

@@ -204,6 +204,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -254,6 +257,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -356,6 +362,12 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
+   
+   
+   
    
    
    
@@ -432,6 +444,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -497,6 +512,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -569,6 +587,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -626,6 +647,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -702,6 +726,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -760,6 +787,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -820,6 +850,9 @@ export class HashMap<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/heap/heap.ts

@@ -220,6 +220,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -322,6 +325,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -385,6 +391,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -482,6 +491,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
 
   /**
    * @deprecated Use `pop` instead. Will be removed in a future major version.
+   
+   
+   
     * @example
  * // Heap with custom comparator (MaxHeap behavior)
  *  interface Task {
@@ -567,6 +579,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -673,6 +688,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -726,6 +744,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -774,6 +795,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -827,6 +851,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -936,6 +963,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1025,6 +1055,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1084,6 +1117,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1142,6 +1178,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1207,6 +1246,9 @@ export class Heap<E = any, R = any> extends IterableElementBase<E, R> {
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/linked-list/doubly-linked-list.ts

@@ -303,6 +303,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -378,6 +381,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -452,6 +458,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -517,6 +526,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -615,6 +627,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -670,6 +685,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -764,6 +782,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -894,6 +915,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -956,6 +980,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1020,6 +1047,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1070,6 +1100,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1124,6 +1157,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1191,13 +1227,36 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
     * @example
  * // Find value scanning from tail
  *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
- *     // getBackward scans from tail to head, returns first match
- *     const found = list.getBackward(node => node.value < 4);
+ *     // findLast scans from tail to head, returns first match
+ *     const found = list.findLast(node => node.value < 4);
  *     console.log(found); // 3;
    */
 
+  /**
+   * @deprecated Use `findLast` instead. Will be removed in a future major version.
+   */
   getBackward(
     elementNodeOrPredicate: E | DoublyLinkedListNode<E> | ((node: DoublyLinkedListNode<E>) => boolean)
+  ): E | undefined {
+    return this.findLast(elementNodeOrPredicate);
+  }
+
+  /**
+   * Find the first value matching a predicate scanning backward (tail → head).
+   * @remarks Time O(N), Space O(1)
+   * @param elementNodeOrPredicate - Element, node, or predicate to match.
+   * @returns Matching value or undefined.
+   
+   
+    * @example
+ * // Find value scanning from tail
+ *  const list = new DoublyLinkedList<number>([1, 2, 3, 4]);
+ *     // findLast scans from tail to head, returns first match
+ *     const found = list.findLast(node => node.value < 4);
+ *     console.log(found); // 3;
+   */
+  findLast(
+    elementNodeOrPredicate: E | DoublyLinkedListNode<E> | ((node: DoublyLinkedListNode<E>) => boolean)
   ): E | undefined {
     const predicate = this._ensurePredicate(elementNodeOrPredicate);
     let current = this.tail;
@@ -1208,6 +1267,23 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
     return undefined;
   }
 
+  /**
+   * Find the index of the last value matching a predicate (scans tail → head).
+   * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+   * @param predicate - Function called with (value, index, list).
+   * @returns Matching index, or -1 if not found.
+   */
+  findLastIndex(predicate: (value: E, index: number, list: this) => boolean): number {
+    let current = this.tail;
+    let index = this.length - 1;
+    while (current) {
+      if (predicate(current.value, index, this)) return index;
+      current = current.prev;
+      index--;
+    }
+    return -1;
+  }
+
   /**
    * Reverse the list in place.
    * @remarks Time O(N), Space O(1)
@@ -1247,6 +1323,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1338,6 +1417,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1397,6 +1479,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+   
    
    
    
@@ -1477,6 +1562,9 @@ export class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, D
    
    
    
+   
+   
+