AbstractSealedRemove all elements from the queue.
Whether an element matching the condition function exists
SealedWhether the queue is empty
SealedReorder the queue before removing and returning the highest priority element.
The front-most element of the queue after sorting,
or undefined if the queue is empty.
Remove the first element in the queue matching a given condition.
If provided, will restrict the removal to only entries matching the given condition
Whether a removal occurred
Protected AbstractreorderSort the elements currently in the queue.
Abstract class representing a Min-priority queue.
Dynamically updates ordering to always return the "highest priority" item, based on the implementation of
reorder.