PriorityQueueT Methods

Clears and empties queue.

Take the first element out of the queue and return it. the first element is the one with the largest key.

Add a new element to the queue, with the given priority

Determines whether the specified object is equal to the current object.

Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection.

Serves as a hash function for a particular type.

Gets the Type of the current instance.

Creates a shallow copy of the current Object.

Copies the elements of the priority queue to a new array, sorts it and returns it in priority order.

This is an O(n log(n)) operation

Returns a string that represents the current object.