#include <iostream>
using namespace std;

//Implement a dynamic, templated, circular queue.
//The queue must "resize" it's array when it runs out of room.

int main()
{
	//Part 1: Implement a basic dynamic, templated, circular queue.
	queue<int> numberQueue;

	for(int i=0; i<50; i++)
		numberQueue.enqueue(i);

	for(int i=0; i<20; i++)
		cout << "Dequeing: " << numberQueue.dequeue() << endl;

	for(int i=50; i<60; i++)
		numberQueue.enqueue(i);

	while( ! numberQueue.empty() )
		cout << "Dequeing: " << numberQueue.dequeue() << endl;

	//Part 2: Implement a "moveToFront(x)" method.
	queue<string> zoo;

	zoo.enqueue("monkey");
	zoo.enqueue("zebra");
	zoo.enqueue("penquin");
	zoo.enqueue("walrus");

	cout << "Dezooing: " << zoo.dequeue() << endl; //monkey

	zoo.enqueue("snake");
	zoo.enqueue("werewolf");
	zoo.enqueue("mogwai");
	zoo.enqueue("dragon");

	zoo.moveToFront("mogwai");

	cout << "Dezooing: " << zoo.dequeue() << endl; //mogwai
	cout << "Dezooing: " << zoo.dequeue() << endl; //zebra

	zoo.moveToFront("werewolf");
	zoo.moveToFront("dragon");

	while( ! zoo.empty() )
		cout << "Dezooing: " << zoo.dequeue() << endl; //dragon werewolf penquin walrus snake


}