Skip to content

lib: optimize priority queue #57100

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
nodejs-github-bot merged 3 commits into from
Feb 28, 2025
Merged

lib: optimize priority queue #57100

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
74de4ad
lib: optimize priority queue
gurgunday Feb 17, 2025
be07d41
coverage
gurgunday Feb 17, 2025
db55a71
remove breaking change
gurgunday Feb 23, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Next Next commit
lib: optimize priority queue
  • Loading branch information
@gurgunday
gurgunday committed Feb 26, 2025
commit 74de4ad659e16db9bb9f41cec0c10a07b0523e63
44 changes: 28 additions & 16 deletions lib/internal/priority_queue.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -47,20 +47,28 @@ module.exports = class PriorityQueue {
const setPosition = this.#setPosition;
const heap = this.#heap;
const size = this.#size;
const hsize = size >> 1;
const item = heap[pos];

while (pos * 2 <= size) {
let childIndex = pos * 2 + 1;
if (childIndex > size || compare(heap[pos * 2], heap[childIndex]) < 0)
childIndex = pos * 2;
const child = heap[childIndex];
if (compare(item, child) <= 0)
break;
while (pos <= hsize) {
let child = pos << 1;
const nextChild = child + 1;
let childItem = heap[child];

if (nextChild <= size && compare(heap[nextChild], childItem) < 0) {
child = nextChild;
childItem = heap[nextChild];
}

if (compare(item, childItem) <= 0) break;

if (setPosition !== undefined)
setPosition(child, pos);
heap[pos] = child;
pos = childIndex;
setPosition(childItem, pos);

heap[pos] = childItem;
pos = child;
}

heap[pos] = item;
if (setPosition !== undefined)
setPosition(item, pos);
Expand All @@ -73,27 +81,31 @@ module.exports = class PriorityQueue {
const item = heap[pos];

while (pos > 1) {
const parent = heap[pos / 2 | 0];
if (compare(parent, item) <= 0)
const parent = pos >> 1;
const parentItem = heap[parent];
if (compare(parentItem, item) <= 0)
break;
heap[pos] = parent;
heap[pos] = parentItem;
if (setPosition !== undefined)
setPosition(parent, pos);
pos = pos / 2 | 0;
setPosition(parentItem, pos);
pos = parent;
}

heap[pos] = item;
if (setPosition !== undefined)
setPosition(item, pos);
}

removeAt(pos) {
if (pos > this.#size) return;
Comment thread
gurgunday marked this conversation as resolved.
Outdated

const heap = this.#heap;
const size = --this.#size;
heap[pos] = heap[size + 1];
heap[size + 1] = undefined;

if (size > 0 && pos <= size) {
if (pos > 1 && this.#compare(heap[pos / 2 | 0], heap[pos]) > 0)
if (pos > 1 && this.#compare(heap[pos >> 1], heap[pos]) > 0)
this.percolateUp(pos);
else
this.percolateDown(pos);
Expand Down