PriorityQueue

Priority queue implementation.

Element that implemented Comparable interface.

capacity

Initial capacity.

Constructors

constructor(capacity: Int)

Creates a priority queue with the specified capacity.

fun clear()

Removes all elements from the queue.

Returns true if the queue is empty.

fun peek(): E?

Returns the element with the highest priority.

fun pop(): E?

Removes the element with the highest priority.

fun push(element: E)

Adds the specified element to the queue.

fun remove(element: E): Boolean

Removes the specified element from the queue.