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

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

#include <iostream>
using std::cout;

template<typename T>
class Queue
{
    public:
        Queue(int maxn=1000):m_size(0),MAXN(maxn),m_front(0),m_rear(0){head=new T[maxn];}
        int size()const{return m_size;}
        bool empty()const{return m_size==0?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=0;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=0;i<10;i++)
        q.push('a'+i);
    q.status();
    cout<<"
q.pop()="<<q.pop()<<"
";


    return 0;
}


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

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

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