max-priority-queue-typed 2.5.3 → 2.6.0

package/dist/types/data-structures/graph/undirected-graph.d.ts

@@ -206,6 +206,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -268,6 +271,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -338,6 +344,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -402,6 +411,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -452,6 +464,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
    
    
    
+   
+   
+   
    
    
    
@@ -549,6 +564,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -614,6 +632,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -667,6 +688,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      
@@ -719,6 +743,9 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
      
      
      

package/dist/types/data-structures/hash/hash-map.d.ts

@@ -169,6 +169,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -216,6 +219,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -310,6 +316,12 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
+     
+     
+     
      
      
      
@@ -375,6 +387,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -426,6 +441,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -493,6 +511,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -545,6 +566,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -602,6 +626,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -656,6 +683,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      
@@ -710,6 +740,9 @@ export declare class HashMap<K = any, V = any, R = [K, V]> extends IterableEntry
      
      
      
+     
+     
+     
      
      
      

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

@@ -200,6 +200,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -282,6 +285,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -340,6 +346,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -422,6 +431,9 @@ export declare 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 {
@@ -494,6 +506,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -596,6 +611,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -645,6 +663,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -687,6 +708,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -735,6 +759,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -795,6 +822,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -851,6 +881,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -899,6 +932,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -951,6 +987,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -1003,6 +1042,9 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      

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

@@ -220,6 +220,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -280,6 +283,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -340,6 +346,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -391,6 +400,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -456,6 +468,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -504,6 +519,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -559,6 +577,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -631,6 +652,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -679,6 +703,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -727,6 +754,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -773,6 +803,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -821,6 +854,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -876,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)
@@ -920,6 +981,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -982,6 +1046,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -1035,6 +1102,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -1098,6 +1168,9 @@ export declare class DoublyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      

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

@@ -269,6 +269,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -329,6 +332,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -389,6 +395,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -440,6 +449,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -527,6 +539,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -583,6 +598,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -630,6 +648,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -678,6 +699,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -727,6 +751,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -783,6 +810,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -829,6 +859,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -879,6 +912,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -980,6 +1016,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -1034,6 +1073,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+     
      
      
      
@@ -1107,6 +1149,9 @@ export declare class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase
      
      
      
+     
+     
+