max-priority-queue-typed 2.5.3 → 2.6.0

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

@@ -331,6 +331,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -404,6 +407,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -482,6 +488,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -542,6 +551,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -671,6 +683,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -740,6 +755,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -794,6 +812,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -854,6 +875,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -920,6 +944,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -995,6 +1022,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -1045,6 +1075,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -1101,6 +1134,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -1351,6 +1387,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -1411,6 +1450,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    
@@ -1501,6 +1543,9 @@ export class SinglyLinkedList<E = any, R = any> extends LinearLinkedBase<E, R, S
    
    
    
+   
+   
+   
    
    
    

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

@@ -169,6 +169,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -216,6 +219,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -266,6 +272,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -325,6 +334,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -414,6 +426,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -482,6 +497,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -533,6 +551,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -609,6 +630,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -660,6 +684,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -713,6 +740,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -764,6 +794,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -818,6 +851,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -877,6 +913,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -936,6 +975,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -992,6 +1034,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -1054,6 +1099,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -1131,6 +1179,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    
@@ -1188,6 +1239,9 @@ export class SkipList<K = any, V = any, R = [K, V]> extends IterableEntryBase<K,
    
    
    
+   
+   
+   
    
    
    

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

@@ -224,6 +224,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -297,6 +300,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -367,6 +373,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -461,6 +470,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -538,6 +550,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -637,6 +652,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -723,6 +741,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    
@@ -853,6 +874,9 @@ export class Matrix {
    
    
    
+   
+   
+   
    
    
    

package/src/data-structures/queue/deque.ts

@@ -314,7 +314,10 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
 
     /**
    * Deque peek at both ends
-   * @example
+  
+   
+   
+    * @example
  * // Deque peek at both ends
  *  const deque = new Deque<number>([10, 20, 30, 40, 50]);
  *
@@ -373,6 +376,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -451,6 +457,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -533,6 +542,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -602,6 +614,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -672,6 +687,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -787,6 +805,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -838,6 +859,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -893,6 +917,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1121,6 +1148,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1242,6 +1272,66 @@ export 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 {
+    for (let i = this.length - 1; i >= 0; i--) {
+      const val = this.at(i)!;
+      if (predicate(val, i, this)) return val;
+    }
+    return 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 {
+    for (let i = this.length - 1; i >= 0; i--) {
+      if (predicate(this.at(i)!, i, this)) return i;
+    }
+    return -1;
+  }
+
+    /**
+   * 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 {
     this._buckets.reverse().forEach(function (bucket) {
       bucket.reverse();
@@ -1342,6 +1432,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1419,6 +1512,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1479,6 +1575,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -1561,6 +1660,9 @@ export class Deque<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    

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

@@ -192,6 +192,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -248,6 +251,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -333,6 +339,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -401,6 +410,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -478,6 +490,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -543,6 +558,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -601,6 +619,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -724,6 +745,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -776,6 +800,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -857,6 +884,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -916,6 +946,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+   
    
    
    
@@ -979,6 +1012,9 @@ export class Queue<E = any, R = any> extends LinearBase<E, R> {
    
    
    
+   
+   
+