《队列_c++类模版》由会员分享，可在线阅读，更多相关《队列_c++类模版（2页珍藏版）》请在金锄头文库上搜索。
1、template class Queue private:int rear, front;/队尾, 队头指针T *elements; /队列元素数组int maxSize; /最大元素个数 public: Queue ( int sz= 10 );Queue ( ) delete elements; void EnQueue ( const T /进队bool DeQueue ( ); /退队T GetFront ( ); /取队头元素void MakeEmpty ( ) front = rear = 0; int IsEmpty ( ) const return front = rear;
2、int IsFull ( ) const return (rear+1) % maxSize = front; int Length ( ) const return (rear-front+maxSize) % maxSize; ; template Queue: Queue ( int sz ) : front (0), rear (0), maxSize (sz) elements = new TmaxSize;assert ( elements != NULL ); template void Queue:EnQueue ( const T rear = (rear+1) % maxSize;elementsrear = item; template bool Queue : DeQueue ( ) if ( IsEmpty ( ) ) return false; front = ( front+1) % maxSize;return true; template T Queue : GetFront ( ) assert ( !IsEmpty ( ) );return elements( front+1) % maxSize;
