HeapPriorityQueue<E> class

*<Null safety>*

Implemented types

Constructors

HeapPriorityQueue ([int comparison(E, E)])

Create a new priority queue. ...

Properties

comparison → Comparator<E>

The comparison being used to compare the priority of elements.
final

first → E

Returns the next element that will be returned by removeFirst. ...
read-only, override

hashCode → int

The hash code for this object. ...
read-only, inherited

isEmpty → bool

Whether the queue is empty.
read-only, override

isNotEmpty → bool

Whether the queue has any elements.
read-only, override

length → int

Number of elements in the queue.
read-only, override

runtimeType → Type

A representation of the runtime type of the object.
read-only, inherited

unorderedElements → Iterable<E>

Provides efficient access to all the elements curently in the queue. ...
read-only, override

Methods

add(E element) void

Adds element to the queue. ...
override

addAll(Iterable<E> elements) void

Adds all elements to the queue.
override

clear() void

Removes all the elements from this queue.
override

contains(E object) bool

Checks if object is in the queue. ...
override

noSuchMethod(Invocation invocation) dynamic

Invoked when a non-existent method or property is accessed. ...
inherited

remove(E element) bool

Removes an element of the queue that compares equal to element. ...
override

removeAll() Iterable<E>

Removes all the elements from this queue and returns them. ...
override

removeFirst() E

Removes and returns the element with the highest priority. ...
override

toList() List<E>

Returns a list of the elements of this queue in priority order. ...
override

toSet() Set<E>

Return a comparator based set using the comparator of this queue. ...
override

toString() String

Returns some representation of the queue. ...
override

toUnorderedList() List<E>

Returns a list of the elements of this queue in no specific order. ...
override

Operators

operator ==(Object other) bool

The equality operator. ...
inherited