顺序循环队列.docVIP

顺序循环队列 //=================================================================================== //顺序循环队列 //=================================================================================== #includeiostream using namespace std; //-------------------------------------------------------------------------------------- templatetypename T class SeQueue{ public: SeQueue(); SeQueue(int size); SeQueue(const SeQueueT x); bool operator =(const SeQueueT x); bool operator ==(const SeQueueT x); ~SeQueue(); bool Empty() const; bool Full() const; void InQueue(const T x); void DeQueue(T x); T operator[](int number); int Length() const; int Maxsize() const; int Find(const T element); int Findall(const T element,int *parameter); void Display() const; void travel(void (*Fun)(T t)); void Clear(); friend ostream operator (ostream o,const SeQueueT x){ for(int i=x.front; ix.rear; i++) { ox.queue[i%x.maxsize] ; } return o; } private: int rear,front; T *queue; int usesize; int maxsize; };//---------------------------------------------------------------------------------- templateclass T SeQueueT::SeQueue(){ rear=front=0; queue=NULL; maxsize=1; //注意这个条件，不是后面的东西不稳定 usesize=0; }//---------------------------------------------------------------------------------------- templateclass T SeQueueT::SeQueue(int size){ rear=front=0; maxsize=size; usesize=0; queue=new T[maxsize]; }//---------------------------------------------------------------------------------------- templateclass T SeQueueT::SeQueue(const SeQueueT x){ maxsize=x.maxsize; usesize=x.usesize; queue=new T[maxsize]; rear=x.rear; front=x.front; for(int i=front; irear; i++) { queue[i%maxsize]=x.queue[i%x.maxsize]; } }//---------------------------------------------------------------------------------------- templateclass T bool SeQueueT::operator =(const SeQueueT x){ if(queue!=NULL) delete[] queue; maxsiz