// CSE 373, Winter 2013, Marty Stepp
// This interface defines an ADT for priority queues of integers
// that allow fast access/removal of the minimum element.
//
// This is not the version of PriorityQueue.java that you shoudl use for your homework 5;
// get that file from the Homework web page.

public interface PriorityQueue<E> {
	void add(E value);
	void clear();
	boolean isEmpty();
	E peek();
	E remove();
	int size();
}