数据结构--队列Queue--循环顺序队列

bool circularQueue<T>::enqueue(const T &data)
{
    if(full())
        return false;
    else
    {
        if(empty())
        {
            m_pHead = m_pTail = 0;
            arrQ[0] = data;
            m_QueueLen++;
        }
        else if(m_pTail < m_capacity-1)
        {
            arrQ[++m_pTail] = data;
            m_QueueLen++;
        }
        else    //队列没满，但是队尾到达数组末尾了，让tail变成-1
        {
            if(m_pTail + 1 == m_capacity)
                m_pTail = -1;
            arrQ[++m_pTail] = data;
            m_QueueLen++;
        }
        return true;
    }
}

void circularQueue<T>::print() const
{
    if(empty())
        cout << "empty queue!" << endl;
    cout << "circularQueue from head to tail as follow:" << endl;
    int j = m_pHead;
    for(UINT i = 0; i < m_QueueLen; )
    {
        if(j == m_capacity)     //打印时注意下标循环跳转
            j = 0;
        cout << "No." << ++i << " elem is " << arrQ[j++] << endl;
    }
    cout << "--------------print end----------------" << endl;
}