lib: remove unused code

PR-URL: #36632
Reviewed-By: Antoine du Hamel <duhamelantoine1995@gmail.com>
Reviewed-By: Michaël Zasso <targos@protonmail.com>
Reviewed-By: Ruben Bridgewater <ruben@bridgewater.de>
Reviewed-By: Rich Trott <rtrott@gmail.com>
Reviewed-By: Yongsheng Zhang <zyszys98@gmail.com>
Reviewed-By: Benjamin Gruenbaum <benjamingr@gmail.com>

lib/internal/priority_queue.js

@@ -2,7 +2,6 @@
 
 const {
   Array,
-  ArrayPrototypeIndexOf,
   Symbol,
 } = primordials;
 
@@ -105,17 +104,6 @@ module.exports = class PriorityQueue {
     }
   }
 
-  remove(value) {
-    const heap = this[kHeap];
-    const pos = ArrayPrototypeIndexOf(heap, value);
-    if (pos < 1)
-      return false;
-
-    this.removeAt(pos);
-
-    return true;
-  }
-
   shift() {
     const heap = this[kHeap];
     const value = heap[1];

test/parallel/test-priority-queue.js

@@ -43,27 +43,6 @@ const PriorityQueue = require('internal/priority_queue');
   assert.strictEqual(queue.shift(), undefined);
 }
 
-{
-  // Checks that remove works as expected.
-  const queue = new PriorityQueue();
-  for (let i = 16; i > 0; i--)
-    queue.insert(i);
-
-  const removed = [5, 10, 15];
-  for (const id of removed)
-    assert(queue.remove(id));
-
-  assert(!queue.remove(100));
-  assert(!queue.remove(-100));
-
-  for (let i = 1; i < 17; i++) {
-    if (removed.indexOf(i) < 0)
-      assert.strictEqual(queue.shift(), i);
-  }
-
-  assert.strictEqual(queue.shift(), undefined);
-}
-
 {
   // Make a max heap with a custom sort function.
   const queue = new PriorityQueue((a, b) => b - a);