C++-顺序循环队列

main.c

#include <iostream>
#include "Queue.h"
using namespace std;

int main()
{
	Queue<char> q(5);

	q.Push('A');
	q.Push('B');
	q.Push('C');
	cout << q.Front() << ", " << q.Rear() << endl;
	q.Push('D');
	q.Push('E');
	cout << q.Front() << ", " << q.Rear() << endl;
	q.Push('F');
	q.Push('G');
	cout << q.Front() << ", " << q.Rear() << endl;
	return 0;
}

queue.h

#ifndef _QUEUE_H
#define _QUEUE_H

template<class T>
class Queue
{
public:
	Queue(int queueCapacity = 10);
	bool IsEmpty() const;
	T& Front() const;
	T& Rear() const;
	void Push(const T& item);
	void Pop();
private:
	T* queue;
	int front;
	int rear;
	int capacity;
};

template<class T>
Queue<T>::Queue(int queueCapacity) :capacity(queueCapacity)
{
	if (capacity < 1) throw "Queue capacity must be > 0";
	queue = new T[capacity];
	front = rear = 0;
}
template<class T>
inline bool Queue<T>::IsEmpty() const
{
	return front == rear;
}
template<class T>
void Queue<T>::Push(const T& item)
{
	if ((rear + 1) % capacity == front)//队列满了
	{
		//加倍
		T* newQueue = new T[2 * capacity];
		int start = (front + 1) % capacity;
		if (start < 2)	//没有回转
			std::copy(queue + start, queue + start + capacity - 1, newQueue);
		else
		{
			std::copy(queue + start, queue + capacity, newQueue);
			std::copy(queue, queue + rear + 1, newQueue + capacity - start);
		}
		
		front = 2 * capacity - 1;
		rear = capacity - 2;
		capacity *= 2;
		delete[] queue;
		queue = newQueue;
	}
	//if (rear == capacity - 1)
	//	rear = 0;
	//else
	//	rear++;
	rear = (rear + 1) % capacity;
	queue[rear] = item;
}
template<class T>
inline T& Queue<T>::Front() const
{
	if (IsEmpty()) throw "Queue is empty. No front element";
	return queue[(front+1)%capacity];	//队首的位置是空的，加一为第一个数据
}
template<class T>
inline T& Queue<T>::Rear() const
{
	if (IsEmpty()) throw "Queue is empty. No rear element";
	return queue[rear];
}
template<class T>
void Queue<T>::Pop()
{
	if (IsEmpty()) throw "Queue is empty, cannot delete.";
	front = (front + 1) % capacity;	//向后移动队首
	queue[front].~T();
}
#endif // _QUEUE_H