graph-typed 1.54.3 → 2.0.1

package/src/data-structures/priority-queue/max-priority-queue.ts

@@ -64,10 +64,7 @@ export class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
    * @returns The `filter` method is returning a new `MaxPriorityQueue` object that contains the elements that pass
    * the filter condition specified by the `callback` function.
    */
-  override filter(
-    callback: ElementCallback<E, R, boolean, MaxPriorityQueue<E, R>>,
-    thisArg?: any
-  ): MaxPriorityQueue<E, R> {
+  override filter(callback: ElementCallback<E, R, boolean>, thisArg?: any): MaxPriorityQueue<E, R> {
     const filteredPriorityQueue = new MaxPriorityQueue<E, R>([], {
       toElementFn: this.toElementFn,
       comparator: this.comparator
@@ -104,7 +101,7 @@ export class MaxPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
    * @returns a new instance of the `MaxPriorityQueue` class with the mapped elements.
    */
   override map<EM, RM>(
-    callback: ElementCallback<E, R, EM, MaxPriorityQueue<E, R>>,
+    callback: ElementCallback<E, R, EM>,
     comparator: Comparator<EM>,
     toElementFn?: (rawElement: RM) => EM,
     thisArg?: any

package/src/data-structures/priority-queue/min-priority-queue.ts

@@ -53,10 +53,7 @@ export class MinPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
    * @returns The `filter` method is returning a new `MinPriorityQueue` object that contains the elements that pass
    * the filter condition specified by the `callback` function.
    */
-  override filter(
-    callback: ElementCallback<E, R, boolean, MinPriorityQueue<E, R>>,
-    thisArg?: any
-  ): MinPriorityQueue<E, R> {
+  override filter(callback: ElementCallback<E, R, boolean>, thisArg?: any): MinPriorityQueue<E, R> {
     const filteredPriorityQueue = new MinPriorityQueue<E, R>([], {
       toElementFn: this.toElementFn,
       comparator: this.comparator
@@ -93,7 +90,7 @@ export class MinPriorityQueue<E = any, R = any> extends PriorityQueue<E, R> {
    * @returns a new instance of the `MinPriorityQueue` class with the mapped elements.
    */
   override map<EM, RM>(
-    callback: ElementCallback<E, R, EM, MinPriorityQueue<E, R>>,
+    callback: ElementCallback<E, R, EM>,
     comparator: Comparator<EM>,
     toElementFn?: (rawElement: RM) => EM,
     thisArg?: any

package/src/data-structures/priority-queue/priority-queue.ts

@@ -55,7 +55,7 @@ export class PriorityQueue<E = any, R = any> extends Heap<E, R> {
    * @returns The `filter` method is returning a new `PriorityQueue` object that contains the elements that pass
    * the filter condition specified by the `callback` function.
    */
-  override filter(callback: ElementCallback<E, R, boolean, PriorityQueue<E, R>>, thisArg?: any): PriorityQueue<E, R> {
+  override filter(callback: ElementCallback<E, R, boolean>, thisArg?: any): PriorityQueue<E, R> {
     const filteredPriorityQueue = new PriorityQueue<E, R>([], {
       toElementFn: this.toElementFn,
       comparator: this.comparator
@@ -92,7 +92,7 @@ export class PriorityQueue<E = any, R = any> extends Heap<E, R> {
    * @returns a new instance of the `PriorityQueue` class with the mapped elements.
    */
   override map<EM, RM>(
-    callback: ElementCallback<E, R, EM, PriorityQueue<E, R>>,
+    callback: ElementCallback<E, R, EM>,
     comparator: Comparator<EM>,
     toElementFn?: (rawElement: RM) => EM,
     thisArg?: any