queuelist.h

vc当中比较容易遇到的过河问题

#ifndef cgqueueList
#define cgqueueList
#include"queue.h"
#include"doubleEndList.h"
using namespace std;
template<class T> class queue;
template<class T> class queueList :public queue<T>{
public:
//构造函数
queueList();
queueList(const queueList & V);

  //队列的操作
virtual void  deleteALLValus();
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()
{
}

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

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

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

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

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

template<class T>T queueCircularList<T>::dequeue()
{
assert(!isEmpty());
lastFree=lastFree->ptrToNextLink;
return lastFree->value;
}

template<class T>
void queueCircularList<T>::enqueue(T val)
{
if(lastFilled->ptrToNextLink==lastFree)
lastFree=lastFree->insert(val);
else{
lastFilled=lastFilled->ptrToNextLink;
lastFilled->value=val;
}
}
#endif //cgqueueList