binary-tree-typed 2.5.2 → 2.5.3

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

@@ -215,6 +215,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -271,6 +275,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -327,6 +335,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -374,6 +386,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -435,6 +451,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -479,6 +499,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -530,6 +554,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -598,6 +626,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -642,6 +674,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -686,6 +722,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -728,6 +768,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -772,6 +816,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -816,6 +864,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -863,6 +915,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -875,6 +931,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)
@@ -914,6 +977,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -963,6 +1030,10 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1022,6 +1093,10 @@ 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.
@@ -264,6 +264,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -320,6 +324,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -376,6 +384,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -423,6 +435,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -506,6 +522,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -558,6 +578,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -601,6 +625,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -645,6 +673,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -690,6 +722,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -742,6 +778,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -784,6 +824,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -830,6 +874,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -927,6 +975,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -977,6 +1029,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      
@@ -1046,6 +1102,10 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
+     
      
      
      

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

@@ -79,6 +79,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
    
    
    
@@ -119,6 +123,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
    
    
    
@@ -160,6 +168,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
    
    
    
@@ -206,6 +218,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -262,6 +278,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -322,6 +342,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -366,6 +390,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -417,6 +445,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -460,6 +492,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -500,6 +536,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -541,6 +581,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -585,6 +629,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -629,6 +677,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -670,6 +722,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -711,6 +767,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -755,6 +815,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -796,6 +860,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      
@@ -837,6 +905,10 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
      
      
      

package/dist/types/data-structures/matrix/matrix.d.ts

@@ -172,6 +172,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -236,6 +240,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -292,6 +300,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -357,6 +369,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -405,6 +421,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -468,6 +488,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -527,6 +551,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -579,6 +607,10 @@ export declare class Matrix {
      
      
      
+     
+     
+     
+