max-priority-queue-typed 2.5.2 → 2.5.3

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

@@ -191,6 +191,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -361,6 +381,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -395,6 +435,34 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
    *     console.log(tags.last()); // 'typescript';
      */
     add(key: K): this;
+    /**
+     * Add multiple keys at once.
+     * @remarks Expected time O(m log n), where m is the number of keys.
+     * @param keys - Iterable of keys to add.
+     * @returns Array of booleans indicating whether each key was newly added.
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Add multiple keys
+   *  const ts = new TreeSet<number>();
+   *     ts.addMany([5, 3, 7, 1, 9]);
+   *     console.log(ts.size); // 5;
+     */
+    addMany(keys: Iterable<K>): boolean[];
     /**
      * Test whether a key exists.
      * @remarks Expected time O(log n)
@@ -546,6 +614,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -727,6 +815,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -757,6 +865,13 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
    *     console.log([...nums]); // [1, 3, 7, 9];
      */
     delete(key: K): boolean;
+    /**
+     * Delete all keys matching a predicate.
+     * @remarks Time O(N), Space O(N)
+     * @param predicate - Function (key, index, set) → boolean; return true to delete.
+     * @returns True if at least one key was deleted.
+     */
+    deleteWhere(predicate: (key: K, index: number, set: this) => boolean): boolean;
     /**
      * Remove all keys.
      
@@ -896,6 +1011,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1063,6 +1198,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1231,6 +1386,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1399,6 +1574,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1568,6 +1763,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1739,6 +1954,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1909,6 +2144,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2077,6 +2332,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2243,6 +2518,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2408,6 +2703,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2573,6 +2888,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2741,6 +3076,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2908,6 +3263,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2967,6 +3342,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3033,6 +3412,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3077,6 +3460,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3123,6 +3510,10 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
      
      
      
@@ -3255,6 +3646,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3409,6 +3816,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3555,6 +3978,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3699,6 +4138,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3846,6 +4301,22 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3915,8 +4386,16 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      * Returns elements 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 TreeSet<number>(
    *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
    *         { enableOrderStatistic: true }
@@ -4072,6 +4551,26 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+