#ifndef _PRIQUEUE_H
#define _PRIQUEUE_H

#include "ListClass.h"

//	priqueue.h
//	11.3.98
//	G. Volger
//	Priority queue header class

template <class type>
class PriorityQueue
{
	public:
		PriorityQueue();
		~PriorityQueue();
		void Enqueue(const type & x);
		void Dequeue(type & x);
		bool isEmpty() const;
		void makeEmpty();
	private:
		List<type> pq;
};

#include "PriQueue.cpp"

#endif

/*

PriorityQueue()
// post: Does nothing, but must have for other reasons!

~PriorityQueue();
// post: Does nothing

void Enqueue(const type & x)
// post: Adds item x to queue by it's priority

void Dequeue(type & x)
// post: First item with the lowest priority in the queue
//       is removed and returned

bool isEmpty() const
// post: Returns true if the queue is empty, otherwise false

void makeEmpty()
// post: Removes all items from the queue

*/