/** * A Java interface for the Priority Queue ADT.
* Note that the relative priority of elements is defined by the compareTo() * method defined for the type of items stored in the queue. In other words, * the priority of an item is equal to the value of the item.
* Note that this interface defines a *max* priority queue; the item with the
* highest priority is what comes out of the queue. The easiest way to get a
* *min* priority queue is to separate priorities and values (in a
* PriorityPair), and negate the priorities that you use.
*
* @see PriorityPair
* @see DefaultPriorityPairImplementation
*
* @param