fill heap[0] and heap[1] to prevent proto chain lookup

Author: gurgunday

lib/internal/priority_queue.js

@@ -21,6 +21,7 @@ module.exports = class PriorityQueue {
       this.#compare = comparator;
     if (setPosition !== undefined)
       this.#setPosition = setPosition;
+    this.#heap[0] = this.#heap[1] = undefined;
   }
 
   insert(value) {