- add
Adds a new task to the priority queue.
- clear
Removes all elements from the priority queue.
- fixDown
Establishes the heap invariant (described above) in the subtree rooted at k,
which is assumed to sat
- get
Return the ith task in the priority queue, where i ranges from 1 (the head task,
which is returned b
- getMin
Return the "head task" of the priority queue. (The head task is an task with the
lowest nextExecutio
- heapify
Establishes the heap invariant (described above) in the entire tree, assuming
nothing about the orde
- isEmpty
Returns true if the priority queue contains no elements.
- removeMin
Remove the head task from the priority queue.
- rescheduleMin
Sets the nextExecutionTime associated with the head task to the specified value,
and adjusts priorit
- size
Returns the number of tasks currently on the queue.
- <init>
- fixUp
Establishes the heap invariant (described above) assuming the heap satisfies the
invariant except po