the queue element
a function to compare tasks
Type: the internal queue to store elements
A function to compare tasks
Returns a new blank internal queue to store elements
The internal queue to store elements
An index of the last element from the queue
The first element in the queue
Number of elements in the queue
Returns an iterator over the queue elements
Clears the queue
Creates a new queue based on the current one and returns it
Pushes the last queue element to the top
Removes the head element from the queue and returns it
Adds a new element to the queue
Alias to pop
Pushes the first queue element down
Alias to push
Returns an iterator over the queue elements
Implementation of an ordered queue data structure based on a binary heap