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/dist/cjs/index.cjs +0 -1
- package/dist/cjs/index.cjs.map +1 -1
- package/dist/cjs-legacy/index.cjs +0 -1
- package/dist/cjs-legacy/index.cjs.map +1 -1
- package/dist/esm/index.mjs +0 -1
- package/dist/esm/index.mjs.map +1 -1
- package/dist/esm-legacy/index.mjs +0 -1
- package/dist/esm-legacy/index.mjs.map +1 -1
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +0 -1
- package/dist/umd/binary-tree-typed.js +0 -1
- package/dist/umd/binary-tree-typed.js.map +1 -1
- package/dist/umd/binary-tree-typed.min.js.map +1 -1
- package/package.json +2 -2
- package/src/data-structures/binary-tree/binary-tree.ts +0 -1
|
@@ -1487,7 +1487,6 @@ var _BinaryTree = class _BinaryTree extends IterableEntryBase {
|
|
|
1487
1487
|
* @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).
|
|
1488
1488
|
*
|
|
1489
1489
|
* @param keysNodesEntriesOrRaws - An iterable of items to set.
|
|
1490
|
-
* @param [values] - An optional parallel iterable of values.
|
|
1491
1490
|
* @returns An array of booleans indicating the success of each individual `set` operation.
|
|
1492
1491
|
*/
|
|
1493
1492
|
addMany(keysNodesEntriesOrRaws) {
|