bst-typed 2.5.2 → 2.5.3

package/dist/umd/bst-typed.js

@@ -811,6 +811,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -861,6 +865,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -875,6 +883,14 @@ var bstTyped = (() => {
     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)
@@ -927,6 +943,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -989,6 +1009,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1058,6 +1082,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1117,6 +1145,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1169,6 +1201,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1220,6 +1256,21 @@ var bstTyped = (() => {
       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)
@@ -1262,6 +1313,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1308,6 +1363,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1377,6 +1436,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1430,6 +1493,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1487,6 +1554,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -1962,7 +2033,7 @@ var bstTyped = (() => {
     }
     /**
       * 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.
@@ -1991,6 +2062,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2010,7 +2085,7 @@ var bstTyped = (() => {
     }
     /**
       * 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.
@@ -2045,6 +2120,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2151,6 +2230,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2193,6 +2276,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2256,6 +2343,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2272,22 +2363,66 @@ var bstTyped = (() => {
       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.
+      
+      
+      
+      
       
       
       
@@ -2331,51 +2466,11 @@ var bstTyped = (() => {
     *     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.
@@ -2424,7 +2519,7 @@ var bstTyped = (() => {
     }
     /**
       * 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.
@@ -2458,6 +2553,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2480,7 +2579,7 @@ var bstTyped = (() => {
     }
     /**
       * 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).
@@ -2516,6 +2615,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2577,6 +2680,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2625,6 +2732,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2682,6 +2793,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2766,6 +2881,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -2827,6 +2946,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3304,6 +3427,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3356,6 +3483,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3412,6 +3543,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -3493,6 +3628,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -4301,6 +4440,14 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4635,6 +4782,18 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -4754,6 +4913,14 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -5045,6 +5212,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -5114,6 +5285,10 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
       
       
       
@@ -5232,6 +5407,14 @@ var bstTyped = (() => {
       
       
       
+      
+      
+      
+      
+      
+      
+      
+      
       
       
       
@@ -5293,12 +5476,11 @@ var bstTyped = (() => {
      */
     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.