循环队列

#include
using namespace std;

template
class RQueue
{
private:
unsigned int size;
int head;
int rear;
T* data_buff;
public:
RQueue() :size(10), head(0), rear(0)
{
data_buff = new T[size];
}
RQueue(int s) :size(s), head(0), rear(0)
{
data_buff = new T[size];
}
~RQueue()
{
delete [] data_buff;
}
void enqueue(T data)
{
if (isfull())
{
cout << “Error: This RQueue is full” << endl;
cout << “File Path =” << FILE`` << endl;
cout << “Function Name =” << FUNCTION << endl;
cout << “Line =” << LINE << endl;
throw bad_exception();
}
data_buff[rear] = data;
rear = (rear + 1) % size;
}
void dequeue()
{
if (isempty())
{
cout << “Error: This RQueue is empty” << endl;
cout << “File Path =” << FILE << endl;
cout << “Function Name =” << FUNCTION << endl;
cout << “Line =” << LINE << endl;
throw bad_exception();
}
data_buff[head] = 0;
head++;
}
T getHeadElem()
{
if (isempty())
{
cout << “Error: This RQueue is empty” << endl;
cout << “File Path =” << FILE << endl;
cout << “Function Name =” << FUNCTION << endl;
cout << “Line =” << LINE << endl;
throw bad_exception();
}
return data_buff[head];
}
unsigned int elem_available()
{
int temp;
if (rear > head)
temp = rear - head;
else
temp = size - head + rear;
return temp;
}
bool isempty()
{
return head == rear ? true : false;
}
bool isfull()
{
return head == (rear + 1) % size ? true : false;
}
void show()
{
for (int i = 0; i < elem_available()?
{
cout << data_buff[(i+head)%size]<<" ";
i = (i + 1) % size;
}
cout << endl;
}
};

作者：shuoyueqishilove
来源：CSDN
原文：https://blog.csdn.net/shuoyueqishilove/article/details/80498432