binary-tree-typed 2.2.7 → 2.3.0

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

@@ -147,7 +147,7 @@ export declare class AVLTreeCounter<K = any, V = any, R = any> extends AVLTree<K
      * @param [count] - How much to increase the node's count (default 1).
      * @returns True if inserted/updated; false if ignored.
      */
-    add(keyNodeOrEntry: K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V, count?: number): boolean;
+    set(keyNodeOrEntry: K | AVLTreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V, count?: number): boolean;
     /**
      * Delete a node (or decrement its count) and rebalance if needed.
      * @remarks Time O(log N), Space O(1)

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

@@ -132,8 +132,8 @@ export declare class AVLTreeMultiMap<K = any, V = any, R = any> extends AVLTree<
      * @returns True if it's a AVLTreeMultiMapNode, false otherwise.
      */
     isNode(keyNodeOrEntry: K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): keyNodeOrEntry is AVLTreeMultiMapNode<K, V>;
-    add(keyNodeOrEntry: K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
-    add(key: K, value: V): boolean;
+    set(keyNodeOrEntry: K | AVLTreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
+    set(key: K, value: V): boolean;
     /**
      * Delete a single value from the bucket at a given key. Removes the key if the bucket becomes empty.
      * @remarks Time O(log N), Space O(1)

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

@@ -112,7 +112,7 @@ export declare class AVLTreeNode<K = any, V = any> {
 }
 /**
  * Represents a self-balancing AVL (Adelson-Velsky and Landis) Tree.
- * This tree extends BST and performs rotations on add/delete to maintain balance.
+ * This tree extends BST and performs rotations on set/delete to maintain balance.
  *
  * @template K - The type of the key.
  * @template V - The type of the value.
@@ -145,7 +145,7 @@ export declare class AVLTreeNode<K = any, V = any> {
  *     console.log(tree.size); // 5;
  *
  *     // Add a new element
- *     tree.add(3);
+ *     tree.set(3);
  *     console.log(tree.size); // 6;
  *     console.log([...tree.keys()]); // [1, 2, 3, 5, 8, 9];
  * @example
@@ -208,7 +208,7 @@ export declare class AVLTreeNode<K = any, V = any> {
  *     console.log(universityTree.isAVLBalanced()); // true;
  *
  *     // Add more universities
- *     universityTree.add(6, { name: 'Oxford', rank: 6, students: 2000 });
+ *     universityTree.set(6, { name: 'Oxford', rank: 6, students: 2000 });
  *     console.log(universityTree.isAVLBalanced()); // true;
  *
  *     // Delete and verify balance is maintained
@@ -288,9 +288,9 @@ export declare class AVLTreeNode<K = any, V = any> {
 export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> implements IBinaryTree<K, V, R> {
     /**
      * Creates an instance of AVLTree.
-     * @remarks Time O(N log N) (from `addMany` with balanced add). Space O(N).
+     * @remarks Time O(N log N) (from `setMany` with balanced set). Space O(N).
      *
-     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to add.
+     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to set.
      * @param [options] - Configuration options for the AVL tree.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, options?: AVLTreeOptions<K, V, R>);
@@ -312,14 +312,14 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      */
     isNode(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): keyNodeOrEntry is AVLTreeNode<K, V>;
     /**
-     * Adds a new node to the AVL tree and balances the tree path.
-     * @remarks Time O(log N) (O(H) for BST add + O(H) for `_balancePath`). Space O(H) for path/recursion.
+     * Sets a new node to the AVL tree and balances the tree path.
+     * @remarks Time O(log N) (O(H) for BST set + O(H) for `_balancePath`). Space O(H) for path/recursion.
      *
-     * @param keyNodeOrEntry - The key, node, or entry to add.
+     * @param keyNodeOrEntry - The key, node, or entry to set.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
      */
-    add(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
+    set(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
      * Deletes a node from the AVL tree and re-balances the tree.
      * @remarks Time O(log N) (O(H) for BST delete + O(H) for `_balancePath`). Space O(H) for path/recursion.
@@ -339,7 +339,7 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
     perfectlyBalance(iterationType?: IterationType): boolean;
     /**
      * Creates a new AVLTree by mapping each [key, value] pair.
-     * @remarks Time O(N log N) (O(N) iteration + O(log M) `add` for each item into the new tree). Space O(N) for the new tree.
+     * @remarks Time O(N log N) (O(N) iteration + O(log M) `set` for each item into the new tree). Space O(N) for the new tree.
      *
      * @template MK - New key type.
      * @template MV - New value type.

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

@@ -113,7 +113,7 @@ export declare class BinaryTreeNode<K = any, V = any> {
  *
  * @remarks
  * This class implements a basic Binary Tree, not a Binary Search Tree.
- * The `add` operation inserts nodes level-by-level (BFS) into the first available slot.
+ * The `set` operation inserts nodes level-by-level (BFS) into the first available slot.
  *
  * @template K - The type of the key.
  * @template V - The type of the value.
@@ -145,7 +145,7 @@ export declare class BinaryTreeNode<K = any, V = any> {
  *     console.log(tree.size); // 9;
  *
  *     // Add new element
- *     tree.add(10, 'ten');
+ *     tree.set(10, 'ten');
  *     console.log(tree.size); // 10;
  * @example
  * // BinaryTree get and has operations
@@ -269,9 +269,9 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     iterationType: IterationType;
     /**
      * Creates an instance of BinaryTree.
-     * @remarks Time O(N * M), where N is the number of items in `keysNodesEntriesOrRaws` and M is the tree size at insertion time (due to O(M) `add` operation). Space O(N) for storing the nodes.
+     * @remarks Time O(N * M), where N is the number of items in `keysNodesEntriesOrRaws` and M is the tree size at insertion time (due to O(M) `set` operation). Space O(N) for storing the nodes.
      *
-     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to add.
+     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to set.
      * @param [options] - Configuration options for the tree.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, options?: BinaryTreeOptions<K, V, R>);
@@ -434,49 +434,47 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @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).
      *
      * @param keyNodeOrEntry - The key, node, or entry to add.
-     * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
      */
-    add(keyNodeOrEntry: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
+    add(keyNodeOrEntry: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
      * 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 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(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).
      *
-     * @param keyNodeOrEntry - The key, node, or entry to add or update.
+     * @param keyNodeOrEntry - The key, node, or entry to set or update.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
      */
     set(keyNodeOrEntry: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
      * Adds multiple items to the tree.
-     * @remarks Time O(N * M), where N is the number of items to add and M is the size of the tree at insertion (due to O(M) `add` operation). Space O(M) (from `add`) + O(N) (for the `inserted` array).
+     * @remarks Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add.
-     * @param [values] - An optional parallel iterable of values.
-     * @returns An array of booleans indicating the success of each individual `add` operation.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set.
+     * @returns An array of booleans indicating the success of each individual `set` operation.
      */
-    addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): boolean[];
+    addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>): boolean[];
     /**
      * Adds or updates multiple items to the tree.
-     * @remarks Time O(N * M), where N is the number of items to add and M is the size of the tree at insertion (due to O(M) `add` operation). Space O(M) (from `add`) + O(N) (for the `inserted` array).
+     * @remarks Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add or update.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set or update.
      * @param [values] - An optional parallel iterable of values.
-     * @returns An array of booleans indicating the success of each individual `add` operation.
+     * @returns An array of booleans indicating the success of each individual `set` operation.
      */
     setMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): boolean[];
     /**
-     * Merges another tree into this one by adding all its nodes.
-     * @remarks Time O(N * M), same as `addMany`, where N is the size of `anotherTree` and M is the size of this tree. Space O(M) (from `add`).
+     * Merges another tree into this one by seting all its nodes.
+     * @remarks Time O(N * M), same as `setMany`, where N is the size of `anotherTree` and M is the size of this tree. Space O(M) (from `set`).
      *
      * @param anotherTree - The tree to merge.
      */
     merge(anotherTree: BinaryTree<K, V, R>): void;
     /**
      * Clears the tree and refills it with new items.
-     * @remarks Time O(N) (for `clear`) + O(N * M) (for `addMany`) = O(N * M). Space O(M) (from `addMany`).
+     * @remarks Time O(N) (for `clear`) + O(N * M) (for `setMany`) = O(N * M). Space O(M) (from `setMany`).
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set.
      * @param [values] - An optional parallel iterable of values.
      */
     refill(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>, values?: Iterable<V | undefined>): void;
@@ -624,14 +622,14 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
     morris<C extends NodeCallback<BinaryTreeNode<K, V>>>(callback?: C, pattern?: DFSOrderPattern, startNode?: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): ReturnType<C>[];
     /**
      * Clones the tree.
-     * @remarks Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `add`, and `add` is O(M)). Space O(N) for the new tree and the BFS queue.
+     * @remarks Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `set`, and `set` is O(M)). Space O(N) for the new tree and the BFS queue.
      *
      * @returns A new, cloned instance of the tree.
      */
     clone(): this;
     /**
      * Creates a new tree containing only the entries that satisfy the predicate.
-     * @remarks Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `add` for each item). Space O(N) for the new tree.
+     * @remarks Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `set` for each item). Space O(N) for the new tree.
      *
      * @param predicate - A function to test each [key, value] pair.
      * @param [thisArg] - `this` context for the predicate.
@@ -722,8 +720,8 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      */
     protected _keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry: K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): [BinaryTreeNode<K, V> | null | undefined, V | undefined];
     /**
-     * (Protected) Helper for cloning. Performs a BFS and adds all nodes to the new tree.
-     * @remarks Time O(N * M) (O(N) BFS + O(M) `add` for each node).
+     * (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
+     * @remarks Time O(N * M) (O(N) BFS + O(M) `set` for each node).
      *
      * @param cloned - The new, empty tree instance to populate.
      */

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

@@ -145,8 +145,8 @@ export declare class BSTNode<K = any, V = any> {
  *     console.log(bst.size); // 16;
  *
  *     // Add new elements
- *     bst.add(17);
- *     bst.add(0);
+ *     bst.set(17);
+ *     bst.set(0);
  *     console.log(bst.size); // 18;
  *
  *     // Verify keys are searchable
@@ -192,7 +192,7 @@ export declare class BSTNode<K = any, V = any> {
  *
  *     // Merge datasets into a single BinarySearchTree
  *     const merged = new BST<number, string>(dataset1);
- *     merged.addMany(dataset2);
+ *     merged.setMany(dataset2);
  *     merged.merge(dataset3);
  *
  *     // Verify merged dataset is in sorted order
@@ -276,7 +276,7 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      * Creates an instance of BST.
      * @remarks Time O(N log N) or O(N^2) depending on `isBalanceAdd` in `addMany` and input order. Space O(N).
      *
-     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to add.
+     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to set.
      * @param [options] - Configuration options for the BST, including comparator.
      */
     constructor(keysNodesEntriesOrRaws?: Iterable<K | BSTNode | [K | null | undefined, V | undefined] | null | undefined | R>, options?: BSTOptions<K, V, R>);
@@ -359,24 +359,24 @@ export declare class BST<K = any, V = any, R = any> extends BinaryTree<K, V, R>
      * Adds a new node to the BST based on key comparison.
      * @remarks Time O(log N), where H is tree height. O(N) worst-case (unbalanced tree), O(log N) average. Space O(1).
      *
-     * @param keyNodeOrEntry - The key, node, or entry to add.
+     * @param keyNodeOrEntry - The key, node, or entry to set.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
      */
-    add(keyNodeOrEntry: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
+    set(keyNodeOrEntry: K | BSTNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
      * Adds multiple items to the tree.
-     * @remarks If `isBalanceAdd` is true, sorts the input and builds a balanced tree. Time O(N log N) (due to sort and balanced add).
+     * @remarks If `isBalanceAdd` is true, sorts the input and builds a balanced tree. Time O(N log N) (due to sort and balanced set).
      * If false, adds items one by one. Time O(N * H), which is O(N^2) worst-case.
      * Space O(N) for sorting and recursion/iteration stack.
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set.
      * @param [values] - An optional parallel iterable of values.
      * @param [isBalanceAdd=true] - If true, builds a balanced tree from the items.
-     * @param [iterationType=this.iterationType] - The traversal method for balanced add (recursive or iterative).
-     * @returns An array of booleans indicating the success of each individual `add` operation.
+     * @param [iterationType=this.iterationType] - The traversal method for balanced set (recursive or iterative).
+     * @returns An array of booleans indicating the success of each individual `set` operation.
      */
-    addMany(keysNodesEntriesOrRaws: Iterable<R | BTNRep<K, V, BSTNode<K, V>>>, values?: Iterable<V | undefined>, isBalanceAdd?: boolean, iterationType?: IterationType): boolean[];
+    setMany(keysNodesEntriesOrRaws: Iterable<R | BTNRep<K, V, BSTNode<K, V>>>, values?: Iterable<V | undefined>, isBalanceAdd?: boolean, iterationType?: IterationType): boolean[];
     /**
      * Returns the first key with a value >= target.
      * Equivalent to Java TreeMap.ceiling.

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

@@ -242,7 +242,7 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      * @param [value]- See parameter type for details.
      * @returns True if inserted or updated; false if ignored.
      */
-    add(keyNodeOrEntry: K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
+    set(keyNodeOrEntry: K | RedBlackTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
      * Delete a node by key/node/entry and rebalance as needed.
      * @remarks Time O(log n), Space O(1)

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

@@ -154,7 +154,7 @@ export declare class TreeCounter<K = any, V = any, R = any> extends RedBlackTree
      * @param [count] - How much to increase the node's count (default 1).
      * @returns True if inserted/updated; false if ignored.
      */
-    add(keyNodeOrEntry: K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V, count?: number): boolean;
+    set(keyNodeOrEntry: K | TreeCounterNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V, count?: number): boolean;
     /**
      * Delete a node (or decrement its count) and rebalance if needed.
      * @remarks Time O(log N), Space O(1)

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

@@ -297,8 +297,8 @@ export declare class TreeMultiMap<K = any, V = any, R = any> extends RedBlackTre
      * @returns True if it's a TreeMultiMapNode, false otherwise.
      */
     isNode(keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): keyNodeOrEntry is TreeMultiMapNode<K, V>;
-    add(keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
-    add(key: K, value: V): boolean;
+    set(keyNodeOrEntry: K | TreeMultiMapNode<K, V> | [K | null | undefined, V[] | undefined] | null | undefined): boolean;
+    set(key: K, value: V): boolean;
     /**
      * Delete a single value from the bucket at a given key. Removes the key if the bucket becomes empty.
      * @remarks Time O(log N), Space O(1)

package/dist/umd/binary-tree-typed.js

@@ -1195,9 +1195,9 @@ var binaryTreeTyped = (() => {
   var BinaryTree = class extends IterableEntryBase {
     /**
      * Creates an instance of BinaryTree.
-     * @remarks Time O(N * M), where N is the number of items in `keysNodesEntriesOrRaws` and M is the tree size at insertion time (due to O(M) `add` operation). Space O(N) for storing the nodes.
+     * @remarks Time O(N * M), where N is the number of items in `keysNodesEntriesOrRaws` and M is the tree size at insertion time (due to O(M) `set` operation). Space O(N) for storing the nodes.
      *
-     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to add.
+     * @param [keysNodesEntriesOrRaws=[]] - An iterable of items to set.
      * @param [options] - Configuration options for the tree.
      */
     constructor(keysNodesEntriesOrRaws = [], options) {
@@ -1226,7 +1226,7 @@ var binaryTreeTyped = (() => {
         if (typeof toEntryFn === "function") this._toEntryFn = toEntryFn;
         else if (toEntryFn) throw TypeError("toEntryFn must be a function type");
       }
-      if (keysNodesEntriesOrRaws) this.addMany(keysNodesEntriesOrRaws);
+      if (keysNodesEntriesOrRaws) this.setMany(keysNodesEntriesOrRaws);
     }
     /**
      * Gets whether the tree is in Map mode.
@@ -1433,10 +1433,20 @@ var binaryTreeTyped = (() => {
      * @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).
      *
      * @param keyNodeOrEntry - The key, node, or entry to add.
+     * @returns True if the addition was successful, false otherwise.
+     */
+    add(keyNodeOrEntry) {
+      return this.set(keyNodeOrEntry);
+    }
+    /**
+     * 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).
+     *
+     * @param keyNodeOrEntry - The key, node, or entry to set or update.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
      */
-    add(keyNodeOrEntry, value) {
+    set(keyNodeOrEntry, value) {
       const [newNode, newValue] = this._keyValueNodeOrEntryToNodeAndValue(keyNodeOrEntry, value);
       if (newNode === void 0) return false;
       if (!this._root) {
@@ -1480,25 +1490,24 @@ var binaryTreeTyped = (() => {
       return false;
     }
     /**
-     * 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 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).
+     * Adds multiple items to the tree.
+     * @remarks Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
      *
-     * @param keyNodeOrEntry - The key, node, or entry to add or update.
-     * @param [value] - The value, if providing just a key.
-     * @returns True if the addition was successful, false otherwise.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set.
+     * @returns An array of booleans indicating the success of each individual `set` operation.
      */
-    set(keyNodeOrEntry, value) {
-      return this.add(keyNodeOrEntry, value);
+    addMany(keysNodesEntriesOrRaws) {
+      return this.setMany(keysNodesEntriesOrRaws);
     }
     /**
-     * Adds multiple items to the tree.
-     * @remarks Time O(N * M), where N is the number of items to add and M is the size of the tree at insertion (due to O(M) `add` operation). Space O(M) (from `add`) + O(N) (for the `inserted` array).
+     * Adds or updates multiple items to the tree.
+     * @remarks Time O(N * M), where N is the number of items to set and M is the size of the tree at insertion (due to O(M) `set` operation). Space O(M) (from `set`) + O(N) (for the `inserted` array).
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set or update.
      * @param [values] - An optional parallel iterable of values.
-     * @returns An array of booleans indicating the success of each individual `add` operation.
+     * @returns An array of booleans indicating the success of each individual `set` operation.
      */
-    addMany(keysNodesEntriesOrRaws, values) {
+    setMany(keysNodesEntriesOrRaws, values) {
       const inserted = [];
       let valuesIterator;
       if (values) {
@@ -1513,40 +1522,29 @@ var binaryTreeTyped = (() => {
           }
         }
         if (this.isRaw(keyNodeEntryOrRaw)) keyNodeEntryOrRaw = this._toEntryFn(keyNodeEntryOrRaw);
-        inserted.push(this.add(keyNodeEntryOrRaw, value));
+        inserted.push(this.set(keyNodeEntryOrRaw, value));
       }
       return inserted;
     }
     /**
-     * Adds or updates multiple items to the tree.
-     * @remarks Time O(N * M), where N is the number of items to add and M is the size of the tree at insertion (due to O(M) `add` operation). Space O(M) (from `add`) + O(N) (for the `inserted` array).
-     *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add or update.
-     * @param [values] - An optional parallel iterable of values.
-     * @returns An array of booleans indicating the success of each individual `add` operation.
-     */
-    setMany(keysNodesEntriesOrRaws, values) {
-      return this.addMany(keysNodesEntriesOrRaws, values);
-    }
-    /**
-     * Merges another tree into this one by adding all its nodes.
-     * @remarks Time O(N * M), same as `addMany`, where N is the size of `anotherTree` and M is the size of this tree. Space O(M) (from `add`).
+     * Merges another tree into this one by seting all its nodes.
+     * @remarks Time O(N * M), same as `setMany`, where N is the size of `anotherTree` and M is the size of this tree. Space O(M) (from `set`).
      *
      * @param anotherTree - The tree to merge.
      */
     merge(anotherTree) {
-      this.addMany(anotherTree, []);
+      this.setMany(anotherTree, []);
     }
     /**
      * Clears the tree and refills it with new items.
-     * @remarks Time O(N) (for `clear`) + O(N * M) (for `addMany`) = O(N * M). Space O(M) (from `addMany`).
+     * @remarks Time O(N) (for `clear`) + O(N * M) (for `setMany`) = O(N * M). Space O(M) (from `setMany`).
      *
-     * @param keysNodesEntriesOrRaws - An iterable of items to add.
+     * @param keysNodesEntriesOrRaws - An iterable of items to set.
      * @param [values] - An optional parallel iterable of values.
      */
     refill(keysNodesEntriesOrRaws, values) {
       this.clear();
-      this.addMany(keysNodesEntriesOrRaws, values);
+      this.setMany(keysNodesEntriesOrRaws, values);
     }
     /**
      * Deletes a node from the tree.
@@ -2212,7 +2210,7 @@ var binaryTreeTyped = (() => {
     }
     /**
      * Clones the tree.
-     * @remarks Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `add`, and `add` is O(M)). Space O(N) for the new tree and the BFS queue.
+     * @remarks Time O(N * M), where N is the number of nodes and M is the tree size during insertion (due to `bfs` + `set`, and `set` is O(M)). Space O(N) for the new tree and the BFS queue.
      *
      * @returns A new, cloned instance of the tree.
      */
@@ -2223,7 +2221,7 @@ var binaryTreeTyped = (() => {
     }
     /**
      * Creates a new tree containing only the entries that satisfy the predicate.
-     * @remarks Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `add` for each item). Space O(N) for the new tree.
+     * @remarks Time O(N * M), where N is nodes in this tree, and M is size of the new tree during insertion (O(N) iteration + O(M) `set` for each item). Space O(N) for the new tree.
      *
      * @param predicate - A function to test each [key, value] pair.
      * @param [thisArg] - `this` context for the predicate.
@@ -2232,7 +2230,7 @@ var binaryTreeTyped = (() => {
     filter(predicate, thisArg) {
       const out = this._createInstance();
       let i = 0;
-      for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.add([k, v]);
+      for (const [k, v] of this) if (predicate.call(thisArg, v, k, i++, this)) out.set([k, v]);
       return out;
     }
     /**
@@ -2250,7 +2248,7 @@ var binaryTreeTyped = (() => {
     map(cb, options, thisArg) {
       const out = this._createLike([], options);
       let i = 0;
-      for (const [k, v] of this) out.add(cb.call(thisArg, v, k, i++, this));
+      for (const [k, v] of this) out.set(cb.call(thisArg, v, k, i++, this));
       return out;
     }
     /**
@@ -2496,18 +2494,18 @@ var binaryTreeTyped = (() => {
       return [this.createNode(keyNodeOrEntry, value), value];
     }
     /**
-     * (Protected) Helper for cloning. Performs a BFS and adds all nodes to the new tree.
-     * @remarks Time O(N * M) (O(N) BFS + O(M) `add` for each node).
+     * (Protected) Helper for cloning. Performs a BFS and sets all nodes to the new tree.
+     * @remarks Time O(N * M) (O(N) BFS + O(M) `set` for each node).
      *
      * @param cloned - The new, empty tree instance to populate.
      */
     _clone(cloned) {
       this.bfs(
         (node) => {
-          if (node === null) cloned.add(null);
+          if (node === null) cloned.set(null);
           else {
-            if (this._isMapMode) cloned.add([node.key, this._store.get(node.key)]);
-            else cloned.add([node.key, node.value]);
+            if (this._isMapMode) cloned.set([node.key, this._store.get(node.key)]);
+            else cloned.set([node.key, node.value]);
           }
         },
         this._root,