循环队列的实现

#include<iostream>
using namespace std;
const int QueueSize = 1000;
class Cirqueue
{
public:
	Cirqueue()                           
	{
		front = rear = 0;
	}
	~Cirqueue() { cout << "fade"; }    
	void Aqueue(int x);                 
	int Bqueue();                      
	int Cqueue();                    
	bool Empty()                      
	{
		if (front == rear)
			return 1;
		else
			return 0;
	}
private:
	int data[QueueSize];                
	int front, rear;                   
};

void Cirqueue::Aqueue(int x)
{
	if ((rear + 1) % QueueSize == front)          
		cout << "queue is full,can't put " << x << " into it" << endl;
	else
	{
		data[rear] = x;                      
		rear = (rear + 1) % QueueSize;          
	}
}

int Cirqueue::Bqueue()                   
{
	if (Empty()) {                         
		cout << "queue is empty" << endl;
		return 0;
	}
	else
	{
		front = (front + 1) % QueueSize;     
		return data[front - 1];              
	}
}

int Cirqueue::Cqueue()
{
	if (Empty()) {
		cout << "queue is empty" << endl;
		return 0;
	}
	else
	{
		return data[(front) % QueueSize];
	}
}

int main()
{
	Cirqueue Q;
	Q.Aqueue(5);
	Q.Aqueue(9);
	Q.Aqueue(7);
	cout << Q.Bqueue() << endl;
	cout << Q.Cqueue() << endl;
	cout << Q.Bqueue() << endl;
	cout << Q.Bqueue() << endl;
	Q.Bqueue();
	return 0;
}