binary-tree-typed 2.2.8 → 2.4.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -451,7 +451,6 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
451
451
  * @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).
452
452
  *
453
453
  * @param keysNodesEntriesOrRaws - An iterable of items to set.
454
- * @param [values] - An optional parallel iterable of values.
455
454
  * @returns An array of booleans indicating the success of each individual `set` operation.
456
455
  */
457
456
  addMany(keysNodesEntriesOrRaws: Iterable<K | BinaryTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined | R>): boolean[];
@@ -1494,7 +1494,6 @@ var binaryTreeTyped = (() => {
1494
1494
  * @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).
1495
1495
  *
1496
1496
  * @param keysNodesEntriesOrRaws - An iterable of items to set.
1497
- * @param [values] - An optional parallel iterable of values.
1498
1497
  * @returns An array of booleans indicating the success of each individual `set` operation.
1499
1498
  */
1500
1499
  addMany(keysNodesEntriesOrRaws) {