c++利用循环数组建立FIFO模板队列

可直接编译运行，其中status()方法效果如图：

 #include <iostream>
 using std::cout;

 template<typename T>
 class Queue
 {
     public:
         Queue(int maxn=):m_size(),MAXN(maxn),m_front(),m_rear(){head=new T[maxn];}
         int size()const{return m_size;}
         bool empty()const{return m_size==?false:true;}
         T front()const{return m_size?head[m_front]:T();}
         T back()const{return m_size?head[m_rear]:T();}
         bool clear(){m_size=m_front=m_rear=;delete []head;}
         bool push(const T&);
         T pop();
         void status();
     private:
         int MAXN;
         int m_front,m_rear;
         T *head;
         int m_size;
 };

 int main()
 {
     Queue<char> q;
     for(int i=;i<;i++)
         q.push('a'+i);
     q.status();
     cout<<"\nq.pop()="<<q.pop()<<"\n";

     return ;
 }

 template<typename T>
 bool Queue<T>::push(const T& t)
 {
     if( ==m_size && NULL == head )
     {head=new T[MAXN];m_rear=m_front=;}
     if(m_size>=MAXN)return false;
     else
     {
         head[m_rear]=t;
         m_rear=(m_rear+)%MAXN;
         m_size++;
         return true;
     }
 }

 template<typename T>
 T Queue<T>::pop()
 {
     if( ==m_size )return T();
     else
     {
         int save=m_front;
         m_front=(m_front+)%MAXN;
         m_size--;
         return head[save];
     }
 }

 template<typename T>
 void Queue<T>::status()
 {
     cout<<"队尾  |  <<push\n";
     for(int i=;i<m_size;i++)
     {
         if(m_size-==i)cout<<"队首  |"<<head[(m_rear-i-)%MAXN]<<"| >>pop\n";
         else cout<<"      |"<<head[(m_rear-i-)%MAXN]<<"|\n";
     }
 }