Class MysteryPriorityQueueImplementation<T extends java.lang.Comparable<? super T>>

java.lang.Object

MysteryPriorityQueueImplementation<T>

Type Parameters:

T - the type of data the queue stores.

All Implemented Interfaces:

PriorityQueue<T>

public class MysteryPriorityQueueImplementation<T extends java.lang.Comparable<? super T>>
extends java.lang.Object
implements PriorityQueue<T>

A mysterious implementation of 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.

See also PriorityPair and DefaultPriorityPairImplementation for the tools that let you separate the priority of each entry from its value.

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, and negate the priorities that you use.

Constructor Summary

Constructors

Constructor and Description
MysteryPriorityQueueImplementation() Constructs an empty priority queue.

Method Summary

Modifier and Type	Method and Description
void	add(T entry) Adds an item to the queue.
void	clear() Removes all items from the queue.
boolean	isEmpty() Returns true if the queue is empty.
T	peek() Returns the maximum item in the queue, without removing it.
T	remove() Removes the maximum item from the queue, and returns it.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

MysteryPriorityQueueImplementation

public MysteryPriorityQueueImplementation()

Constructs an empty priority queue.

Method Detail

add

public void add(T entry)

Description copied from interface: PriorityQueue

Adds an item to the queue.

Specified by:

add in interface PriorityQueue<T extends java.lang.Comparable<? super T>>

remove

public T remove()

Description copied from interface: PriorityQueue

Removes the maximum item from the queue, and returns it.

Specified by:

remove in interface PriorityQueue<T extends java.lang.Comparable<? super T>>

Returns:

null if the queue is empty.

peek

public T peek()

Description copied from interface: PriorityQueue

Returns the maximum item in the queue, without removing it.

Specified by:

peek in interface PriorityQueue<T extends java.lang.Comparable<? super T>>

Returns:

null if the queue is empty.

isEmpty

public boolean isEmpty()

Description copied from interface: PriorityQueue

Returns true if the queue is empty.

Specified by:

isEmpty in interface PriorityQueue<T extends java.lang.Comparable<? super T>>

clear

public void clear()

Description copied from interface: PriorityQueue

Removes all items from the queue.

Specified by:

clear in interface PriorityQueue<T extends java.lang.Comparable<? super T>>