/*
Name: Anne Dawson
Program: queuedriver.cpp
Description: This is the driver file for testing the priority queue class
inherited from the min heap class.
*/


#include <iostream.h>
#include "binaryHeap.h"
#include "priorityQueue.cpp"
#include <conio.h>
#include <stdlib.h>

int main()
{

CPriorityQueue<int> queue_a;


cout << "\nFirst testing the push function:\n";

	for(int i=0; i<10; i++)
	{
		queue_a.push(rand());
	}

cout << "\npriorityqueue currently has " << queue_a.size() << " elements\n";

	queue_a.print();

cout << "\n Now testing the return front function\n";

	cout << "top is " << queue_a.front() << endl;
	queue_a.print();

cout << "\n Now testing the push function again by inserting 3 into the queue:\n";

   queue_a.push(3);
   queue_a.print();

cout << "\n Now testing the delete Top (min) function:\n";

   queue_a.pop();
   queue_a.print();


cout << "\n Now testing isempty function by poping elements till queue is empty\n";

   while(!queue_a.isEmpty())
   {
	  queue_a.pop();
   }
   queue_a.print();

getch();

return 0;
}