binary-tree-typed 2.5.2 → 2.6.0

package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -212,6 +212,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -268,6 +275,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -324,6 +338,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -371,6 +392,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -432,6 +460,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -476,6 +511,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -527,6 +569,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -595,6 +644,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -639,6 +695,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -683,6 +746,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -725,6 +795,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -769,6 +846,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -816,6 +900,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -824,11 +912,36 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
       * @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;
+    /**
+     * 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;
+    /**
+     * 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;
     /**
      * Reverse the list in place.
      * @remarks Time O(N), Space O(1)
@@ -860,6 +973,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -875,6 +995,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
    *     console.log([...list]); // [3, 2, 1];
      */
     reverse(): this;
+    /**
+     * Delete the first element that satisfies a predicate.
+     * @remarks Time O(N), Space O(1)
+     * @param predicate - Function (value, index, list) → boolean to decide deletion.
+     * @returns True if a match was removed.
+     */
+    deleteWhere(predicate: (value: E, index: number, list: this) => boolean): boolean;
     /**
      * Set the equality comparator used to compare values.
      * @remarks Time O(1), Space O(1)
@@ -911,6 +1038,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -960,6 +1094,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1019,6 +1160,13 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -40,7 +40,7 @@ export declare class SinglyLinkedListNode<E = any> extends LinkedListNode<E> {
  * @remarks Time O(1), Space O(1)
  * @template E
  * @template R
- * 1. Node Structure: Each node contains three parts: a data field, a pointer (or reference) to the previous node, and a pointer to the next node. This structure allows traversal of the linked list in both directions.
+ * 1. Node Structure: Each node contains two parts: a data field and a pointer (or reference) to the next node. This structure allows forward-only traversal of the linked list.
  * 2. Bidirectional Traversal: Unlike doubly linked lists, singly linked lists can be easily traversed forwards but not backwards.
  * 3. No Centralized Index: Unlike arrays, elements in a linked list are not stored contiguously, so there is no centralized index. Accessing elements in a linked list typically requires traversing from the head or tail node.
  * 4. High Efficiency in Insertion and Deletion: Adding or removing elements in a linked list does not require moving other elements, making these operations more efficient than in arrays.
@@ -261,6 +261,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -317,6 +324,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -373,6 +387,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -420,6 +441,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -503,6 +531,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -555,6 +590,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -598,6 +640,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -642,6 +691,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -687,6 +743,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -739,6 +802,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -781,6 +851,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -827,6 +904,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -924,6 +1008,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -974,6 +1065,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1043,6 +1141,13 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/linked-list/skip-linked-list.d.ts

@@ -76,6 +76,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -116,6 +123,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -157,6 +171,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -203,6 +224,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -259,6 +287,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -319,6 +354,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -363,6 +405,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -414,6 +463,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -457,6 +513,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -497,6 +560,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -538,6 +608,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -582,6 +659,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -626,6 +710,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -667,6 +758,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -708,6 +806,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -752,6 +857,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -793,6 +905,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -834,6 +953,13 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+