max-priority-queue-typed 2.5.3 → 2.6.0

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

@@ -84,6 +84,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
    
    
    
@@ -128,6 +131,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
    
    
    
@@ -173,6 +179,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
    
    
    
@@ -223,6 +232,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -283,6 +295,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -347,6 +362,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -395,6 +413,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -450,6 +471,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -497,6 +521,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -541,6 +568,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -586,6 +616,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -634,6 +667,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -682,6 +718,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -727,6 +766,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -772,6 +814,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -820,6 +865,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -865,6 +913,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      
@@ -910,6 +961,9 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
      
      
      

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

@@ -177,6 +177,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -245,6 +248,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -305,6 +311,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -374,6 +383,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -426,6 +438,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -493,6 +508,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -556,6 +574,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      
@@ -612,6 +633,9 @@ export declare class Matrix {
      
      
      
+     
+     
+     
      
      
      

package/dist/types/data-structures/queue/deque.d.ts

@@ -227,7 +227,10 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
     peek(): E | undefined;
     /**
    * Deque peek at both ends
-   * @example
+  
+   
+   
+    * @example
  * // Deque peek at both ends
  *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
  *
@@ -282,6 +285,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -344,6 +350,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -407,6 +416,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -457,6 +469,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -508,6 +523,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -580,6 +598,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -627,6 +648,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -675,6 +699,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -772,6 +799,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -859,6 +889,53 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
    *     }
    *     console.log(backward); // ['D', 'C', 'B', 'A'];
      */
+    /**
+     * Find the last value matching a predicate (scans back-to-front).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+     * @param predicate - Function called with (value, index, deque).
+     * @returns Matching value or undefined.
+      * @example
+   * // Find last matching value
+   *  const d = new Deque([1, 2, 3, 4, 5]);
+   *     console.log(d.findLast(v => v > 2)); // 5;
+   *     console.log(d.findLast(v => v % 2 === 0)); // 4;
+     */
+    findLast(predicate: (value: E, index: number, deque: this) => boolean): E | undefined;
+    /**
+     * Find the index of the last value matching a predicate (scans back-to-front).
+     * @remarks Provided for familiarity when migrating from Array. Time O(n), Space O(1).
+     * @param predicate - Function called with (value, index, deque).
+     * @returns Matching index, or -1 if not found.
+      * @example
+   * // Find last matching index
+   *  const d = new Deque([10, 20, 30, 20, 10]);
+   *     console.log(d.findLastIndex(v => v === 20)); // 3;
+   *     console.log(d.findLastIndex(v => v === 10)); // 4;
+     */
+    findLastIndex(predicate: (value: E, index: number, deque: this) => boolean): number;
+    /**
+   * Deque for...of iteration and reverse
+  
+   
+    * @example
+ * // Deque for...of iteration and reverse
+ *  const deque = new Deque<string>(['A', 'B', 'C', 'D']);
+ *
+ *     // Iterate forward
+ *     const forward: string[] = [];
+ *     for (const item of deque) {
+ *       forward.push(item);
+ *     }
+ *     console.log(forward); // ['A', 'B', 'C', 'D'];
+ *
+ *     // Reverse the deque
+ *     deque.reverse();
+ *     const backward: string[] = [];
+ *     for (const item of deque) {
+ *       backward.push(item);
+ *     }
+ *     console.log(backward); // ['D', 'C', 'B', 'A'];
+   */
     reverse(): this;
     /**
      * Deduplicate consecutive equal elements in-place.
@@ -918,6 +995,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -969,6 +1049,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -1021,6 +1104,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -1081,6 +1167,9 @@ export declare class Deque<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      

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

@@ -162,6 +162,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -214,6 +217,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -284,6 +290,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -348,6 +357,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -410,6 +422,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -467,6 +482,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -515,6 +533,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -599,6 +620,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -646,6 +670,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -705,6 +732,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -757,6 +787,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -809,6 +842,9 @@ export declare class Queue<E = any, R = any> extends LinearBase<E, R> {
      
      
      
+     
+     
+     
      
      
      

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

@@ -184,6 +184,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -244,6 +247,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -295,6 +301,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -346,6 +355,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -405,6 +417,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -473,6 +488,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -535,6 +553,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -583,6 +604,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -635,6 +659,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
      
      
      
@@ -695,6 +722,9 @@ export declare class Stack<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+