顺序队列

template<class T>
class arrQueue:public Queue<T>
{
private:
    int msize;
    int mfront;
    int rear;
    T *qu;
public:
    arrQueue(int s)
    {
        msize=s+1;
        qu= new T[msize];
        mfront=rear=0;
    }
    ~arrQueue()
    {
        delete []qu;
    }
    void mclear()
    {
        mfront=rear;
    }
    bool enQueue(const T item)
    {
        if(((rear+1)%msize)==mfront)
        {
            cout<<wrong<<endl;
            return 0;
        }
        qu[rear]=item;
        rear=(rear+1)%mszie;
        return 1;
    }
    bool deQueue( T &item)
    {
        if(mfront=rear)
        {
            cout<<wrong<<endl;
            return 0;
        }
        item=st[mfront];
        mfront=(mfront+1)%msize;
        return 1;
    }
    bool getfront(T & item)
    {
        if(mfront=rear)
        {
            cout<<wrong<<endl;
            return 0;
        }
        item=st[mfront];
        return 1;

    }
};