#ifndef cqueueVector
#define cqueueVector
#include"cqueue.h"
#include "assert.h"
template<class T>class vector;
template<class T>class queueVector:public queue<T>
{
	public:
		queueVector(unsigned int size);
		queueVector(queueVector & v);
		virtual void deleteAllValues();
		virtual T dequeue();
		virtual void enqueue(T value);
		virtual T front();
		virtual int isEmpty()const;
	protected:
		vector<T>data;
		unsigned int max;
		unsigned int nextSlot;
		unsigned int nextUse;
};

template<class T>
queueVector<T>::queueVector(queueVector & v)
{
}

template<class T>
queueVector<T>::queueVector(unsigned int size):max(size),data(size)
{
	deleteAllValues();
}

template<class T>
void queueVector<T>::deleteAllValues()
{
	nextSlot=0;
	nextUse=0;
}

template<class T>
int queueVector<T>::isEmpty()const
{
	return nextSlot==nextUse;
}

template<class T>
void queueVector<T>::enqueue(T val)
{
	data[nextSlot++]=val;
	if(nextSlot>=max)
		nextSlot=0;
	assert(nextSlot!=nextUse);
}

template<class T>T queueVector<T>::front()
{
	assert(!isEmpty());
	return data[nextUse];
}

template<class T>T queueVector<T>::dequeue()
{
	assert(!isEmpty());
	int dataloc=nextUse;
	nextUse++;
		if(nextUse>=max)
			nextUse=0;
		return data[dataloc];
}
#endif