*<Null safety>*
Implemented types
HeapPriorityQueue ([int comparison(E, E)])
Create a new priority queue. ...
The comparison being used to compare the priority of elements.
final
Returns the next element that will be returned by removeFirst. ...
read-only, override
The hash code for this object. ...
read-only, inherited
Whether the queue is empty.
read-only, override
Whether the queue has any elements.
read-only, override
Number of elements in the queue.
read-only, override
A representation of the runtime type of the object.
read-only, inherited
Provides efficient access to all the elements curently in the queue. ...
read-only, override
Adds element to the queue. ...
override
Adds all elements to the queue.
override
Removes all the elements from this queue.
override
Checks if object is in the queue. ...
override
Invoked when a non-existent method or property is accessed. ...
inherited
Removes an element of the queue that compares equal to element. ...
override
Removes all the elements from this queue and returns them. ...
override
Removes and returns the element with the highest priority. ...
override
Returns a list of the elements of this queue in priority order. ...
override
Return a comparator based set using the comparator of this queue. ...
override
Returns some representation of the queue. ...
override
Returns a list of the elements of this queue in no specific order. ...
override
The equality operator. ...
inherited