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.
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "binary-tree-typed",
3
- "version": "2.2.8",
3
+ "version": "2.4.0",
4
4
  "description": "Binary Tree. Javascript & Typescript Data Structure.",
5
5
  "browser": "dist/umd/binary-tree-typed.min.js",
6
6
  "umd:main": "dist/umd/binary-tree-typed.min.js",
@@ -178,6 +178,6 @@
178
178
  "typescript": "^4.9.5"
179
179
  },
180
180
  "dependencies": {
181
- "data-structure-typed": "^2.2.8"
181
+ "data-structure-typed": "^2.4.0"
182
182
  }
183
183
  }
@@ -717,7 +717,6 @@ export class BinaryTree<K = any, V = any, R = any>
717
717
  * @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).
718
718
  *
719
719
  * @param keysNodesEntriesOrRaws - An iterable of items to set.
720
- * @param [values] - An optional parallel iterable of values.
721
720
  * @returns An array of booleans indicating the success of each individual `set` operation.
722
721
  */
723
722
  addMany(