max-priority-queue-typed 2.5.2 → 2.5.3

package/dist/types/data-structures/binary-tree/tree-map.d.ts

@@ -192,6 +192,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -367,6 +387,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -410,6 +450,34 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
    *  //    ];
      */
     set(key: K, value: V | undefined): this;
+    /**
+     * Set multiple key-value pairs at once.
+     * @remarks Expected time O(m log n), where m is the number of entries.
+     * @param entries - Iterable of `[key, value]` tuples.
+     * @returns Array of booleans indicating whether each entry was successfully set.
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Set multiple key-value pairs
+   *  const tm = new TreeMap<number, string>();
+   *     tm.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+   *     console.log(tm.size); // 3;
+     */
+    setMany(entries: Iterable<[K, V | undefined]>): boolean[];
     /**
      * Get the value under a key.
      * @remarks Expected time O(log n)
@@ -561,6 +629,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -746,6 +834,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -931,6 +1039,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -966,6 +1094,13 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
    *     console.log(sessions.size); // 2;
      */
     delete(key: K): boolean;
+    /**
+     * Delete all entries matching a predicate.
+     * @remarks Time O(N), Space O(N)
+     * @param predicate - Function (key, value, index, map) → boolean; return true to delete.
+     * @returns True if at least one entry was deleted.
+     */
+    deleteWhere(predicate: (key: K, value: V | undefined, index: number, map: this) => boolean): boolean;
     /**
      * Remove all entries.
      
@@ -1105,6 +1240,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1272,6 +1427,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1441,6 +1616,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1609,6 +1804,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1778,6 +1993,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1949,6 +2184,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2119,6 +2374,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2287,6 +2562,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2452,6 +2747,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2617,6 +2932,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2783,6 +3118,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2950,6 +3305,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3117,6 +3492,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3176,6 +3571,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3241,6 +3640,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3290,6 +3693,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3341,6 +3748,10 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3479,6 +3890,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3648,6 +4075,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3801,6 +4244,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3954,6 +4413,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -4108,6 +4583,22 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -4193,8 +4684,16 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      * Returns keys by rank range (0-indexed, inclusive on both ends).
      * @remarks Time O(log n + k). Requires `enableOrderStatistic: true`.
      
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
-   * // Pagination with rangeByRank
+   * // Pagination by position in tree order
    *  const tree = new TreeMap<number>(
    *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
    *         { enableOrderStatistic: true }
@@ -4350,6 +4849,26 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+