The methods of the PriorityQueue class are listed below. For a complete list of PriorityQueue class members, see the PriorityQueue Members topic.
![]() | Should be called when the Object at top changes values. Still log(n) worst case, but it's at least twice as fast to { pq.top().change(); pq.adjustTop(); }instead of { o = pq.pop(); o.change(); pq.push(o); } |
![]() | Removes all entries from the PriorityQueue. |
![]() | Determines whether the specified Object is equal to the current Object. |
![]() | Serves as a hash function for a particular type, suitable for use in hashing algorithms and data structures like a hash table. |
![]() | Gets the Type of the current instance. |
![]() | Adds element to the PriorityQueue in log(size) time if either the PriorityQueue is not full, or not lessThan(element, top()). |
![]() | Determines the ordering of objects in this priority queue. Subclasses must define this one method. |
![]() | Removes and returns the least element of the PriorityQueue in log(size) time. |
![]() | Adds an Object to a PriorityQueue in log(size) time. If one tries to add more objects than maxSize from initialize a RuntimeException (ArrayIndexOutOfBound) is thrown. |
![]() | Returns the number of elements currently stored in the PriorityQueue. |
![]() | Returns the least element of the PriorityQueue in constant time. |
![]() | Returns a String that represents the current Object. |
![]() | Allows an Object to attempt to free resources and perform other cleanup operations before the Object is reclaimed by garbage collection. |
![]() | Creates a shallow copy of the current Object. |
![]() | Subclass constructors must call this. |