max-priority-queue-typed 2.5.0 → 2.5.2

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

@@ -60,6 +60,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Check if empty
  *  const sl = new SkipList<number, string>();
@@ -76,6 +100,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove all entries
  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -93,6 +141,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Create independent copy
  *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -115,6 +187,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // In-memory sorted key-value store
    *  const store = new SkipList<number, string>();
@@ -147,6 +243,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Building a sorted index
    *  type Product = { id: number; name: string; price: number };
@@ -156,8 +276,8 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
    *       { id: 3, name: 'Doohickey', price: 15 }
    *     ];
    *
-   *     const index = new SkipList<number, Product>(products as any, {
-   *       toEntryFn: (p: any) => [p.price, p]
+   *     const index = new SkipList<number, Product, Product>(products, {
+   *       toEntryFn: (p: Product) => [p.price, p]
    *     });
    *
    *     // Iterate in sorted order by price
@@ -183,6 +303,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check key existence
    *  const sl = new SkipList<number, string>([[1, 'a'], [3, 'c'], [5, 'e']]);
@@ -203,6 +347,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Fast lookup with deletion
    *  const cache = new SkipList<string, number>();
@@ -230,6 +398,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Access the minimum entry
    *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -249,6 +441,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Access the maximum entry
    *  const sl = new SkipList<number, string>([[5, 'e'], [1, 'a'], [3, 'c']]);
@@ -265,6 +481,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove and return smallest
    *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -282,6 +522,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove and return largest
    *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
@@ -302,6 +566,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Least entry ≥ key
    *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -322,6 +610,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Greatest entry ≤ key
    *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -339,6 +651,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Strictly greater entry
    *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -356,6 +692,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Strictly less entry
    *  const sl = new SkipList<number, string>([[10, 'a'], [20, 'b'], [30, 'c']]);
@@ -376,6 +736,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find entries in a range
    *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c'], [4, 'd'], [5, 'e']]);
@@ -393,6 +777,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Transform entries
    *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b']]);
@@ -410,6 +818,30 @@ export declare class SkipList<K = any, V = any, R = [K, V]> extends IterableEntr
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Filter entries
    *  const sl = new SkipList<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);