#ifndef QUEUE_CPP
#define QUEUE_CPP

#include <iostream>
using std::cout;

template<typename C>
QueueNode<C>::QueueNode()
:next(0)
{}

template<typename C>
QueueNode<C>::QueueNode(C item, QueueNode<C>* n = 0)
:data(item), next(n)
{}

template<typename C>
QueueNode<C>* QueueNode<C>::GetNext()
{ return next; }

template<typename C>
C& QueueNode<C>::GetItem()
{ return data; }

template<typename C>
void QueueNode<C>::SetNext(QueueNode<C>* n)
{ next = n; }

template<typename C>
void QueueNode<C>::SetItem(C item)
{ data = item; }

////////////////////////////////////////////////////////////

template<typename C>
Queue<C>::Queue()
:head(0), tail(0)
{}

template<typename C>
void Queue<C>::Dump()
{
	if(head == 0)
	{
		cout << "Empty\n";
		return;
	}
	QueueNode<C>* p = head;
	while(p)
	{
		cout << "(" << p->GetItem().r1 << ", " << p->GetItem().c1 << ") (" << p->GetItem().r2 << ", " << p->GetItem().c2 << ")\n";
		p=p->GetNext();
	}
}

template<typename C>
void Queue<C>::Enqueue(C item)
{
	QueueNode<C>* ptr = new QueueNode<C>(item, 0);

	if(head == 0)
	{
		head = tail = ptr;
	}
	else
	{
		tail->SetNext(ptr);
		tail = ptr;
	}
}

template<typename C>
C Queue<C>::Dequeue()
{
	QueueNode<C>* temp = head;
	head = head->GetNext();
	C c = temp->GetItem();
	delete temp;
	return c;
}

template<typename C>
C& Queue<C>::Peek()
{ return head->GetItem(); }

template<typename C>
bool Queue<C>::Empty()
{ return head == 0; }

template<typename C>
Queue<C>::~Queue()
{ delete head; }

#endif