max-priority-queue-typed 2.2.8 → 2.3.0

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

@@ -451,7 +451,6 @@ export declare class BinaryTree<K = any, V = any, R = any> extends IterableEntry
      * @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 set.
-     * @param [values] - An optional parallel iterable of values.
      * @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>): boolean[];

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "max-priority-queue-typed",
-  "version": "2.2.8",
+  "version": "2.3.0",
   "description": "Max Priority Queue",
   "browser": "dist/umd/max-priority-queue-typed.min.js",
   "umd:main": "dist/umd/max-priority-queue-typed.min.js",
@@ -165,6 +165,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^2.2.8"
+    "data-structure-typed": "^2.3.0"
   }
 }

package/src/data-structures/binary-tree/binary-tree.ts

@@ -717,7 +717,6 @@ export class BinaryTree<K = any, V = any, R = any>
    * @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 set.
-   * @param [values] - An optional parallel iterable of values.
    * @returns An array of booleans indicating the success of each individual `set` operation.
    */
   addMany(