一个简单的队列实现

1。 当front==rear时，队列为空

2。 当 (rear+1)%MAX_QUEUE_SIZE == front 为满

// =====================================================================================
//
//       Filename:  Queue.cpp
//
//    Description: 
//
//        Version:  1.0
//        Created:  09/24/2010 10:51:03 AM
//       Revision:  none
//       Compiler:  g++
//
//         Author:  YOUR NAME (),
//        Company: 
//
// =====================================================================================

#include    <iostream>
using namespace std;

#define MAX_QUEUE_SIZE 5

template <class C> class Queue
{
    C queue[MAX_QUEUE_SIZE];
    int rear;
    int front;
public:
    Queue():rear(0), front(0){cout << "Queue is initialized" << endl;}
    ~Queue(){ cout << "release Queue" << endl;}
    bool isFull()
    {
        if (front == (rear+1)%MAX_QUEUE_SIZE)
            return true;
        else
            return false;
    }
    bool isEmpty()
    {
        if (front == rear)
            return true;
        else
            return false;
    }
    int enQueue(C element)
    {
        if (isFull())
            return -1;

        queue[rear++] = element;
    }
    C deQueue()
    {
        if (isEmpty())
            return C(0);

        return queue[front++];
    }

};

int main()
{
    Queue<int> q;
    q.enQueue(5);
    q.enQueue(6);
    q.enQueue(7);
    q.enQueue(8);
    q.enQueue(9);
    cout << q.deQueue() << endl;
    cout << q.deQueue() << endl;
    cout << q.deQueue() << endl;
    cout << q.deQueue() << endl;
    cout << q.deQueue() << endl;
    cout << q.deQueue() << endl;
    return 0;
}