data-structure-typed 2.5.2 → 2.5.3

package/dist/esm-legacy/binary-tree.mjs

@@ -797,6 +797,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -847,6 +851,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -861,6 +869,14 @@ var _Queue = class _Queue extends LinearBase {
   get first() {
     return this.length > 0 ? this.elements[this._offset] : void 0;
   }
+  /**
+   * Peek at the front element without removing it (alias for `first`).
+   * @remarks Time O(1), Space O(1)
+   * @returns Front element or undefined.
+   */
+  peek() {
+    return this.first;
+  }
   /**
    * Get the last element (back) without removing it.
    * @remarks Time O(1), Space O(1)
@@ -913,6 +929,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -975,6 +995,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1044,6 +1068,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1103,6 +1131,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1155,6 +1187,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1206,6 +1242,21 @@ var _Queue = class _Queue extends LinearBase {
     this._elements[this._offset + index] = newElement;
     return true;
   }
+  /**
+   * Delete the first element that satisfies a predicate.
+   * @remarks Time O(N), Space O(N)
+   * @param predicate - Function (value, index, queue) → boolean to decide deletion.
+   * @returns True if a match was removed.
+   */
+  deleteWhere(predicate) {
+    for (let i = 0; i < this.length; i++) {
+      if (predicate(this._elements[this._offset + i], i, this)) {
+        this.deleteAt(i);
+        return true;
+      }
+    }
+    return false;
+  }
   /**
    * Reverse the queue in-place by compacting then reversing.
    * @remarks Time O(N), Space O(N)
@@ -1248,6 +1299,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1294,6 +1349,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1363,6 +1422,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1416,6 +1479,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1473,6 +1540,10 @@ var _Queue = class _Queue extends LinearBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -1952,7 +2023,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   }
   /**
     * Adds a new node to the tree.
-    * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation adds the node at the first available position in a level-order (BFS) traversal. This is NOT a Binary Search Tree insertion. Time O(N), where N is the number of nodes. It must traverse level-by-level to find an empty slot. Space O(N) in the worst case for the BFS queue (e.g., a full last level).
+    * @remarks Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
     *
     * @param keyNodeOrEntry - The key, node, or entry to add.
     * @returns True if the addition was successful, false otherwise.
@@ -1981,6 +2052,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2000,7 +2075,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   }
   /**
     * Adds or updates a new node to the tree.
-    * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation sets the node at the first available position in a level-order (BFS) traversal. This is NOT a Binary Search Tree insertion. Time O(N), where N is the number of nodes. It must traverse level-by-level to find an empty slot. Space O(N) in the worst case for the BFS queue (e.g., a full last level).
+    * @remarks Time O(N) — level-order traversal to find an empty slot. Space O(N) for the BFS queue. BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
     *
     * @param keyNodeOrEntry - The key, node, or entry to set or update.
     * @param [value] - The value, if providing just a key.
@@ -2035,6 +2110,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2141,6 +2220,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2183,6 +2266,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2246,6 +2333,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2262,22 +2353,66 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     this.setMany(anotherTree, []);
   }
   /**
-   * Clears the tree and refills it with new items.
-   * @remarks Time O(N) (for `clear`) + O(N * M) (for `setMany`) = O(N * M). Space O(M) (from `setMany`).
+   * Deletes a node from the tree (internal, returns balancing metadata).
+   * @remarks Time O(N) — O(N) to find the node + O(H) for predecessor swap. Space O(1). BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
+   * @internal Used by AVL/BST subclasses that need balancing metadata after deletion.
    *
-   * @param keysNodesEntriesOrRaws - An iterable of items to set.
-   * @param [values] - An optional parallel iterable of values.
+   * @param keyNodeEntryRawOrPredicate - The node to delete.
+   * @returns An array containing deletion results with balancing metadata.
    */
-  refill(keysNodesEntriesOrRaws, values) {
-    this.clear();
-    this.setMany(keysNodesEntriesOrRaws, values);
+  _deleteInternal(keyNodeEntryRawOrPredicate) {
+    const deletedResult = [];
+    if (!this._root) return deletedResult;
+    const curr = this.getNode(keyNodeEntryRawOrPredicate);
+    if (!curr) return deletedResult;
+    const parent = curr == null ? void 0 : curr.parent;
+    let needBalanced;
+    let orgCurrent = curr;
+    if (!curr.left && !curr.right && !parent) {
+      this._setRoot(void 0);
+    } else if (curr.left) {
+      const leftSubTreeRightMost = this.getRightMost((node) => node, curr.left);
+      if (leftSubTreeRightMost) {
+        const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
+        orgCurrent = this._swapProperties(curr, leftSubTreeRightMost);
+        if (this._isMapMode) {
+          this._store.set(curr.key, curr);
+          this._store.set(leftSubTreeRightMost.key, leftSubTreeRightMost);
+        }
+        if (parentOfLeftSubTreeMax) {
+          if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost)
+            parentOfLeftSubTreeMax.right = leftSubTreeRightMost.left;
+          else parentOfLeftSubTreeMax.left = leftSubTreeRightMost.left;
+          needBalanced = parentOfLeftSubTreeMax;
+        }
+      }
+    } else if (parent) {
+      const { familyPosition: fp } = curr;
+      if (fp === "LEFT" || fp === "ROOT_LEFT") {
+        parent.left = curr.right;
+      } else if (fp === "RIGHT" || fp === "ROOT_RIGHT") {
+        parent.right = curr.right;
+      }
+      needBalanced = parent;
+    } else {
+      this._setRoot(curr.right);
+      curr.right = void 0;
+    }
+    this._size = this._size - 1;
+    deletedResult.push({ deleted: orgCurrent, needBalanced });
+    if (this._isMapMode && orgCurrent) this._store.delete(orgCurrent.key);
+    return deletedResult;
   }
   /**
     * Deletes a node from the tree.
-    * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). This implementation finds the node, and if it has two children, swaps it with the rightmost node of its left subtree (in-order predecessor) before deleting. Time O(N) in the worst case. O(N) to find the node (`getNode`) and O(H) (which is O(N) worst-case) to find the rightmost node. Space O(1) (if `getNode` is iterative, which it is).
+    * @remarks Time O(N) — O(N) to find the node + O(H) for predecessor swap. Space O(1). BST/Red-Black Tree/AVL Tree subclasses override to O(log N).
     *
     * @param keyNodeEntryRawOrPredicate - The node to delete.
-    * @returns An array containing deletion results (for compatibility with self-balancing trees).
+    * @returns True if the node was found and deleted, false otherwise.
+    
+    
+    
+    
     
     
     
@@ -2321,51 +2456,11 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   *     console.log(tree.size); // 4;
     */
   delete(keyNodeEntryRawOrPredicate) {
-    const deletedResult = [];
-    if (!this._root) return deletedResult;
-    const curr = this.getNode(keyNodeEntryRawOrPredicate);
-    if (!curr) return deletedResult;
-    const parent = curr == null ? void 0 : curr.parent;
-    let needBalanced;
-    let orgCurrent = curr;
-    if (!curr.left && !curr.right && !parent) {
-      this._setRoot(void 0);
-    } else if (curr.left) {
-      const leftSubTreeRightMost = this.getRightMost((node) => node, curr.left);
-      if (leftSubTreeRightMost) {
-        const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
-        orgCurrent = this._swapProperties(curr, leftSubTreeRightMost);
-        if (this._isMapMode) {
-          this._store.set(curr.key, curr);
-          this._store.set(leftSubTreeRightMost.key, leftSubTreeRightMost);
-        }
-        if (parentOfLeftSubTreeMax) {
-          if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost)
-            parentOfLeftSubTreeMax.right = leftSubTreeRightMost.left;
-          else parentOfLeftSubTreeMax.left = leftSubTreeRightMost.left;
-          needBalanced = parentOfLeftSubTreeMax;
-        }
-      }
-    } else if (parent) {
-      const { familyPosition: fp } = curr;
-      if (fp === "LEFT" || fp === "ROOT_LEFT") {
-        parent.left = curr.right;
-      } else if (fp === "RIGHT" || fp === "ROOT_RIGHT") {
-        parent.right = curr.right;
-      }
-      needBalanced = parent;
-    } else {
-      this._setRoot(curr.right);
-      curr.right = void 0;
-    }
-    this._size = this._size - 1;
-    deletedResult.push({ deleted: orgCurrent, needBalanced });
-    if (this._isMapMode && orgCurrent) this._store.delete(orgCurrent.key);
-    return deletedResult;
+    return this._deleteInternal(keyNodeEntryRawOrPredicate).length > 0;
   }
   /**
    * Searches the tree for nodes matching a predicate.
-   * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Performs a full DFS (pre-order) scan of the tree. Time O(N), as it may visit every node. Space O(H) for the call stack (recursive) or explicit stack (iterative), where H is the tree height (O(N) worst-case).
+   * @remarks Time O(N) — full DFS scan; may visit every node. Space O(H) for call/explicit stack (O(N) worst-case). BST subclasses with key search override to O(log N).
    *
    * @template C - The type of the callback function.
    * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
@@ -2414,7 +2509,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   }
   /**
     * Gets the first node matching a predicate.
-    * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(N) in the worst case (via `search`). Space O(H) or O(N) (via `search`).
+    * @remarks Time O(N) via `search`. Space O(H) or O(N). BST/Red-Black Tree/AVL Tree subclasses override to O(log N) for key lookups.
     *
     * @param keyNodeEntryOrPredicate - The key, node, entry, or predicate function to search for.
     * @param [startNode=this._root] - The node to start the search from.
@@ -2448,6 +2543,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2470,7 +2569,7 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
   }
   /**
     * Gets the value associated with a key.
-    * @remarks Time O(log N), For BST, Red-Black Tree, and AVL Tree subclasses, the worst-case time is O(log N). Time O(1) if in Map mode. O(N) if not in Map mode (uses `getNode`). Space O(1) if in Map mode. O(H) or O(N) otherwise.
+    * @remarks Time O(1) in Map mode, O(N) otherwise (via `getNode`). Space O(1) in Map mode, O(H) or O(N) otherwise. BST subclasses override non-Map-mode to O(log N).
     *
     * @param keyNodeEntryOrPredicate - The key, node, or entry to get the value for.
     * @param [startNode=this._root] - The node to start searching from (if not in Map mode).
@@ -2506,6 +2605,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2567,6 +2670,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2615,6 +2722,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2672,6 +2783,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2756,6 +2871,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -2817,6 +2936,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3294,6 +3417,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3346,6 +3473,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3402,6 +3533,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -3483,6 +3618,10 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -4295,6 +4434,14 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4629,6 +4776,18 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -4748,6 +4907,14 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -5039,6 +5206,10 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -5108,6 +5279,10 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -5226,6 +5401,14 @@ var _BST = class _BST extends BinaryTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -5287,12 +5470,11 @@ var _BST = class _BST extends BinaryTree {
    */
   deleteWhere(keyNodeEntryOrPredicate, onlyOne = false, startNode = this._root, iterationType = this.iterationType) {
     const toDelete = this.search(keyNodeEntryOrPredicate, onlyOne, (node) => node, startNode, iterationType);
-    let results = [];
+    let deleted = false;
     for (const node of toDelete) {
-      const deleteInfo = this.delete(node);
-      results = results.concat(deleteInfo);
+      if (this.delete(node)) deleted = true;
     }
-    return results;
+    return deleted;
   }
   /**
    * (Protected) Creates the default comparator function for keys that don't have a custom comparator.
@@ -5921,6 +6103,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -5997,6 +6187,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -6073,6 +6271,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -6149,6 +6355,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -6223,6 +6437,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -6304,6 +6526,14 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -6358,6 +6588,10 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6419,6 +6653,10 @@ var _BinaryIndexedTree = class _BinaryIndexedTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6582,6 +6820,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6654,6 +6896,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6720,6 +6966,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6793,6 +7043,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6844,6 +7098,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -6921,6 +7179,10 @@ var _SegmentTree = class _SegmentTree {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -7304,6 +7566,22 @@ var _AVLTree = class _AVLTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -7432,6 +7710,18 @@ var _AVLTree = class _AVLTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -7453,13 +7743,13 @@ var _AVLTree = class _AVLTree extends BST {
   *     console.log(avl.size); // 6;
     */
   delete(keyNodeOrEntry) {
-    const deletedResults = super.delete(keyNodeOrEntry);
+    const deletedResults = this._deleteInternal(keyNodeOrEntry);
     for (const { needBalanced } of deletedResults) {
       if (needBalanced) {
         this._balancePath(needBalanced);
       }
     }
-    return deletedResults;
+    return deletedResults.length > 0;
   }
   /**
     * Rebuilds the tree to be perfectly balanced.
@@ -7519,6 +7809,14 @@ var _AVLTree = class _AVLTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -7651,6 +7949,18 @@ var _AVLTree = class _AVLTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -8151,13 +8461,24 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     return keyNodeOrEntry instanceof RedBlackTreeNode;
   }
   /**
-   * Remove all nodes and clear the key→value store (if in map mode).
-   * @remarks Time O(n), Space O(1)
-   * @returns void
-   */
-  /**
-    * Remove all nodes and clear internal caches.
-    * @remarks Time O(n) average, Space O(1)
+    * Remove all nodes, clear the key→value store (if in map mode) and internal caches.
+    * @remarks Time O(n), Space O(1)
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -8750,6 +9071,22 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -8949,6 +9286,22 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -8975,13 +9328,12 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     */
   delete(keyNodeEntryRawOrPredicate) {
     var _a, _b, _c;
-    if (keyNodeEntryRawOrPredicate === null) return [];
-    const results = [];
+    if (keyNodeEntryRawOrPredicate === null) return false;
     let nodeToDelete;
     if (this._isPredicate(keyNodeEntryRawOrPredicate)) nodeToDelete = this.getNode(keyNodeEntryRawOrPredicate);
     else nodeToDelete = this.isRealNode(keyNodeEntryRawOrPredicate) ? keyNodeEntryRawOrPredicate : this.getNode(keyNodeEntryRawOrPredicate);
     if (!nodeToDelete) {
-      return results;
+      return false;
     }
     const willDeleteMin = nodeToDelete === this._minNode;
     const willDeleteMax = nodeToDelete === this._maxNode;
@@ -9037,8 +9389,7 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     if (originalColor === "BLACK") {
       this._deleteFixup(replacementNode);
     }
-    results.push({ deleted: nodeToDelete, needBalanced: void 0 });
-    return results;
+    return true;
   }
   /**
    * Transform entries into a like-kind red-black tree with possibly different key/value types.
@@ -9139,6 +9490,18 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -9287,6 +9650,22 @@ var _RedBlackTree = class _RedBlackTree extends BST {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -9802,6 +10181,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -10007,28 +10406,103 @@ var _TreeSet = class _TreeSet {
     
     
     
-     * @example
-  * // Unique tags with sorted order
-  *  const tags = new TreeSet<string>(['javascript', 'typescript', 'react', 'typescript', 'node']);
-  *
-  *     // Duplicates removed, sorted alphabetically
-  *     console.log([...tags]); // ['javascript', 'node', 'react', 'typescript'];
-  *     console.log(tags.size); // 4;
-  *
-  *     tags.add('angular');
-  *     console.log(tags.first()); // 'angular';
-  *     console.log(tags.last()); // 'typescript';
-    */
-  add(key) {
-    this._validateKey(key);
-    __privateGet(this, _core).set(key, void 0);
-    return this;
-  }
-  /**
-    * Test whether a key exists.
-    * @remarks Expected time O(log n)
-    
-    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+     * @example
+  * // Unique tags with sorted order
+  *  const tags = new TreeSet<string>(['javascript', 'typescript', 'react', 'typescript', 'node']);
+  *
+  *     // Duplicates removed, sorted alphabetically
+  *     console.log([...tags]); // ['javascript', 'node', 'react', 'typescript'];
+  *     console.log(tags.size); // 4;
+  *
+  *     tags.add('angular');
+  *     console.log(tags.first()); // 'angular';
+  *     console.log(tags.last()); // 'typescript';
+    */
+  add(key) {
+    this._validateKey(key);
+    __privateGet(this, _core).set(key, void 0);
+    return 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) {
+    const results = [];
+    for (const key of keys) {
+      this._validateKey(key);
+      results.push(__privateGet(this, _core).set(key, void 0));
+    }
+    return results;
+  }
+  /**
+    * Test whether a key exists.
+    * @remarks Expected time O(log n)
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -10359,6 +10833,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -10389,10 +10883,25 @@ var _TreeSet = class _TreeSet {
   *     console.log([...nums]); // [1, 3, 7, 9];
     */
   delete(key) {
-    var _a;
     this._validateKey(key);
-    const res = __privateGet(this, _core).delete(key);
-    return Array.isArray(res) && res.length > 0 && !!((_a = res[0]) == null ? void 0 : _a.deleted);
+    return __privateGet(this, _core).delete(key);
+  }
+  /**
+   * 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) {
+    let deleted = false;
+    let index = 0;
+    for (const key of this) {
+      if (predicate(key, index++, this)) {
+        this.delete(key);
+        deleted = true;
+      }
+    }
+    return deleted;
   }
   /**
     * Remove all keys.
@@ -10533,6 +11042,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -10702,6 +11231,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -10872,6 +11421,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11042,6 +11611,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11215,6 +11804,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11388,6 +11997,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11564,6 +12193,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11740,6 +12389,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -11911,6 +12580,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -12083,6 +12772,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -12276,23 +12985,63 @@ var _TreeSet = class _TreeSet {
     
     
     
-     * @example
-  * // Find entry
-  *  const ts = new TreeSet<number>([1, 2, 3]);
-  *       const found = ts.find(k => k === 2);
-  *       console.log(found); // 2;
-    */
-  find(callbackfn, thisArg) {
-    let index = 0;
-    for (const v of this) {
-      const ok = thisArg === void 0 ? callbackfn(v, index++, this) : callbackfn.call(thisArg, v, index++, this);
-      if (ok) return v;
-    }
-    return void 0;
-  }
-  /**
-    * Materialize the set into an array of keys.
-    * @remarks Time O(n), Space O(n)
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+     * @example
+  * // Find entry
+  *  const ts = new TreeSet<number>([1, 2, 3]);
+  *       const found = ts.find(k => k === 2);
+  *       console.log(found); // 2;
+    */
+  find(callbackfn, thisArg) {
+    let index = 0;
+    for (const v of this) {
+      const ok = thisArg === void 0 ? callbackfn(v, index++, this) : callbackfn.call(thisArg, v, index++, this);
+      if (ok) return v;
+    }
+    return void 0;
+  }
+  /**
+    * Materialize the set into an array of keys.
+    * @remarks Time O(n), Space O(n)
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -12599,6 +13348,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -12661,6 +13430,10 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -12729,6 +13502,10 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -12775,6 +13552,10 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -12826,6 +13607,10 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -12963,6 +13748,22 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -13120,6 +13921,22 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -13269,6 +14086,22 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -13416,6 +14249,22 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -13566,6 +14415,22 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -13655,8 +14520,16 @@ var _TreeSet = class _TreeSet {
     * 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 }
@@ -13814,6 +14687,26 @@ var _TreeSet = class _TreeSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -14068,6 +14961,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -14236,6 +15149,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -14291,6 +15224,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -14331,6 +15268,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -14527,6 +15468,30 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -14737,6 +15702,30 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -14903,6 +15892,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15138,6 +16147,30 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15169,7 +16202,7 @@ var _TreeMultiMap = class _TreeMultiMap {
     */
   delete(key) {
     this._validateKey(key);
-    return __privateGet(this, _core2).delete(key).length > 0;
+    return __privateGet(this, _core2).delete(key);
   }
   /**
     * Check if a specific value exists in a key's bucket.
@@ -15195,6 +16228,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15236,6 +16273,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15282,6 +16323,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15462,6 +16507,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15633,6 +16698,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15689,6 +16774,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15730,6 +16819,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15771,6 +16864,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -15846,6 +16943,14 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15927,6 +17032,14 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -15977,6 +17090,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -16022,6 +17139,10 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -16184,6 +17305,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -16366,6 +17507,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -16517,6 +17678,22 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -16663,6 +17840,22 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -16838,6 +18031,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17008,6 +18221,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17183,6 +18416,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17360,6 +18613,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17535,6 +18808,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17703,6 +18996,26 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -17849,6 +19162,22 @@ var _TreeMultiMap = class _TreeMultiMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -18070,8 +19399,16 @@ var _TreeMultiMap = class _TreeMultiMap {
   /**
     * Get elements by rank range
    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
-  * // Pagination with rangeByRank
+  * // Pagination by position in tree order
   *  const tree = new TreeMultiMap<number>(
   *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
   *         { enableOrderStatistic: true }
@@ -18097,6 +19434,26 @@ var _TreeMultiMap = class _TreeMultiMap {
    
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
      * @example
   * // Deep clone
@@ -18353,6 +19710,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -18530,6 +19907,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -18577,6 +19974,41 @@ var _TreeMap = class _TreeMap {
     __privateGet(this, _core3).set(key, value);
     return 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) {
+    const results = [];
+    for (const [key, value] of entries) {
+      this._validateKey(key);
+      results.push(__privateGet(this, _core3).set(key, value));
+    }
+    return results;
+  }
   /**
     * Get the value under a key.
     * @remarks Expected time O(log n)
@@ -18728,6 +20160,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -18916,6 +20368,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19104,6 +20576,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19139,10 +20631,25 @@ var _TreeMap = class _TreeMap {
   *     console.log(sessions.size); // 2;
     */
   delete(key) {
-    var _a;
     this._validateKey(key);
-    const res = __privateGet(this, _core3).delete(key);
-    return Array.isArray(res) && res.length > 0 && !!((_a = res[0]) == null ? void 0 : _a.deleted);
+    return __privateGet(this, _core3).delete(key);
+  }
+  /**
+   * 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) {
+    let deleted = false;
+    let index = 0;
+    for (const [key, value] of this) {
+      if (predicate(key, value, index++, this)) {
+        this.delete(key);
+        deleted = true;
+      }
+    }
+    return deleted;
   }
   /**
     * Remove all entries.
@@ -19283,6 +20790,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19452,6 +20979,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19625,6 +21172,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19795,6 +21362,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -19968,6 +21555,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -20141,6 +21748,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -20317,6 +21944,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -20493,6 +22140,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -20663,6 +22330,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -20835,6 +22522,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -21008,6 +22715,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -21182,6 +22909,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -21351,6 +23098,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -21414,6 +23181,10 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -21482,6 +23253,10 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -21534,6 +23309,10 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -21590,6 +23369,10 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -21733,6 +23516,22 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -21906,6 +23705,22 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -22063,6 +23878,22 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -22220,6 +24051,22 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -22378,6 +24225,22 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -22485,8 +24348,16 @@ var _TreeMap = class _TreeMap {
     * 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 }
@@ -22645,6 +24516,26 @@ var _TreeMap = class _TreeMap {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -22772,6 +24663,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -22927,6 +24822,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -23098,6 +25013,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -23154,6 +25089,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -23305,6 +25244,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -23371,6 +25330,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -23540,6 +25503,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -23607,6 +25590,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -23652,6 +25639,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -23807,6 +25798,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -23988,6 +25999,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -24043,6 +26074,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24082,6 +26117,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24246,6 +26285,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -24304,6 +26363,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24344,6 +26407,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24384,6 +26451,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24428,6 +26499,10 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
     
     
     
@@ -24558,6 +26633,22 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -24699,6 +26790,22 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -24840,6 +26947,22 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -24980,6 +27103,22 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -25150,6 +27289,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -25326,6 +27485,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -25509,6 +27688,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -25687,6 +27886,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -25917,8 +28136,16 @@ var _TreeMultiSet = class _TreeMultiSet {
   /**
     * Get elements by rank range
    
+    
+    
+    
+    
+    
+    
+    
+    
      * @example
-  * // Pagination with rangeByRank
+  * // Pagination by position in tree order
   *  const tree = new TreeMultiSet<number>(
   *         [10, 20, 30, 40, 50, 60, 70, 80, 90],
   *         { enableOrderStatistic: true }
@@ -25940,6 +28167,26 @@ var _TreeMultiSet = class _TreeMultiSet {
    
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
      * @example
   * // Deep clone
@@ -26072,6 +28319,22 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
     
     
     
@@ -26243,6 +28506,26 @@ var _TreeMultiSet = class _TreeMultiSet {
     
     
     
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+    
+