//t_pqueue.cpp
//test driver for class PriorityQueue

#include <assert.h>
#include <iostream.h>
#include <stdlib.h>

#include "pqueue.h"

main ()
{
	PriorityQueue<int> pq;

	assert(pq.isempty());

	// Insert 100 random values into the priority queue

	for (int i = 99; i >= 0; i--) {
		pq.insert(rand());
		assert(!pq.isempty());
	}

	assert(!pq.isempty());

	// Remove the 100 numbers, verifying they are descending

	int lastRemoved = -1;
	for (i = 0; i <100; i++) {
		int removed = pq.remove();
		assert(removed >= lastRemoved);
		lastRemoved = removed;
	}

	// The priority queue should now be empty

	assert(pq.isempty());

	return 0;
}