#include <iostream>
using namespace std;
//模板类
template <typename T, int num>
class Queue
{
public:
Queue();
~Queue();
bool isEmpty();
bool isFull();
bool push(const T &);
bool pop(T &);
private:
T arry[num];
int front;
int rear;
};
template <typename T, int num>
Queue<T, num>::Queue()
{
front = 0;
rear = 0;
}
template <typename T, int num>
Queue<T, num>::~Queue()
{
}
template <typename T, int num>
bool Queue<T, num>::isEmpty()
{
return front == rear;
}
template <typename T, int num>
bool Queue<T, num>::isFull()
{
//假设有一个队列,有7个元素(num == 7),分别是 0 1 2 3 4 5 6;此时当rear指向起始位置0,rear对应的下标值是0
//然后此时front指向6即下标为6(front == 6)的时候,整个队列是满的,此时队列满的时候满足关系式:(front + 1)%num == rear;
//所以队列满的条件是(front + 1) % num == rear;
//以此方式,模拟队列的插入,会发现形成队列的数组的最后一个元素始终是空的
//当rear的位置在0,front的位置在6,然后5之前都有数据,当你想再插入一个数据的时候,(front + 1) % num == rear成立,满了的情况下不会插入
//所以这种结构的队列会浪费掉元素数组的一个元素的空间
return (front + 1) % num == rear;
}
template <typename T, int num>
bool Queue<T, num>::push(const T& data)
{
if (isFull() == true) return false;
int insertPos = front % num;
arry[insertPos] = data;
front = (front + 1) %num;
return true;
}
template <typename T, int num>
bool Queue<T, num>::pop( T& result)
{
if (isEmpty() == true) return false;
result = arry[rear];
rear = (rear + 1) % num;
return true;
}
int main()
{
Queue<int, 7> q; //开7个空间
cout << "刚开始队列空吗? " << q.isEmpty() << endl;
cout << "插入元素0成功与否" << q.push(0) << endl;
cout << "插入元素1成功与否" << q.push(1) << endl;
cout << "插入元素2成功与否" << q.push(2) << endl;
cout << "插入元素3成功与否" << q.push(3) << endl;
cout << "插入元素4成功与否" << q.push(4) << endl;
cout << "插入元素5成功与否" << q.push(5) << endl;
cout << "插入元素6成功与否" << q.push(6) << endl;
cout << "插入元素7成功与否" << q.push(7) << endl;
cout << "插入元素8成功与否" << q.push(8) << endl;
cout << "插入元素9成功与否" << q.push(9) << endl;
cout << "插入元素10成功与否" << q.push(10) << endl;
cout << "现在还是队列空吗? " << q.isFull() << endl;
int b1, b2;
q.pop(b1);
q.pop(b2);
cout << "队列中第一个删除的元素为: " << b1 << endl;
cout << "队列中第二个删除的元素为: " << b2 << endl;
cout << "插入元素9成功与否" << q.push(9);
cout << "插入元素10成功与否" << q.push(10);
}