Sets the capacity to the actual number of items in the PriorityQueue, if that is less than 90 percent of current capacity. Returns a string that represents the current object.

Returns the minimal element from the PriorityQueue without removing it. Removes and returns the minimal element from the PriorityQueue - that is, the element with the lowest priority value.Īdds the specified element with associated priority to the PriorityQueue.Īdds the specified element with associated priority to the PriorityQueue, and immediately removes the minimal element, returning the result.Įnqueues a sequence of elements pairs to the PriorityQueue, all associated with the specified priority.Įnqueues a sequence of element-priority pairs to the PriorityQueue.Įnsures that the PriorityQueue can hold up to capacity items without further expansion of its backing storage.ĭetermines whether the specified object is equal to the current object.Ĭreates a shallow copy of the current Object. Removes all items from the PriorityQueue.

Gets a collection that enumerates the elements of the queue in an unordered manner. Gets the number of elements contained in the PriorityQueue. Gets the priority comparer used by the PriorityQueue. Initializes a new instance of the PriorityQueue class with the specified initial capacity and custom priority comparer. Initializes a new instance of the PriorityQueue class with the specified initial capacity. Initializes a new instance of the PriorityQueue class that is populated with the specified elements and priorities, and with the specified custom priority comparer.

Initializes a new instance of the PriorityQueue class that is populated with the specified elements and priorities. Initializes a new instance of the PriorityQueue class with the specified custom priority comparer. Initializes a new instance of the PriorityQueue class. Note that the type does not guarantee first-in-first-out semantics for elements of equal priority. Elements with the lowest priority are dequeued first. Each element is enqueued with an associated priority that determines the dequeue order. Implements an array-backed, quaternary min-heap.

Priority queue kotlin