change name

Author: gurgunday

lib/internal/priority_queue.js

@@ -51,22 +51,22 @@ module.exports = class PriorityQueue {
     const item = heap[pos];
 
     while (pos <= hsize) {
-      let left = pos << 1;
-      const right = left + 1;
-      let child = heap[left];
+      let child = pos << 1;
+      const nextChild = child + 1;
+      let childItem = heap[child];
 
-      if (right <= size && compare(heap[right], child) < 0) {
-        left = right;
-        child = heap[right];
+      if (nextChild <= size && compare(heap[nextChild], childItem) < 0) {
+        child = nextChild;
+        childItem = heap[nextChild];
       }
 
-      if (compare(item, child) <= 0) break;
+      if (compare(item, childItem) <= 0) break;
 
       if (setPosition !== undefined)
-        setPosition(child, pos);
+        setPosition(childItem, pos);
 
-      heap[pos] = child;
-      pos = left;
+      heap[pos] = childItem;
+      pos = child;
     }
 
     heap[pos] = item;