#ifndef cqueueList
#define cqueueLIst
#include "cqueue.h"
#include"cdoubleEndList.h"
//using namespace std;
template<class T>class doubleEndedList;
template<class T>class queueList:public queue<T>{
	public:
		queueList();
		queueList(const queueList & v);
		virtual void deleteAllValues();
		virtual T dequeue();
		virtual void enqueue(T value);
		virtual T front ()const;
		virtual int isEmpty()const;
	private:
		doubleEndedList<T>data;
};

template<class T>
queueList<T>::queueList():data(v.data)
{
}

template<class T>
queueList<T>::queueList(const queueList & v):data(v.data)
{
}

template<class T>void queueList<T>::deleteAllValues()
{
	data.deleteAllValues();
}

template<class T>T queueList<T>::dequeue()
{
	T result=data.firstElement();
	data.removeFirst();
	return result;
}

template<class T>void queueList<T>::enqueue(T value)
{
	data.addToEnd(value);
}

template<class T>T queueList<T>::front()const
{
	return data.firstElement();
}

template<class T>int queueList<T>::isEmpty()const
{
	return data.isEmpty();
}
#endif