queue.cpp

王红梅编《数据结构》大多数的实验源码。内附详细的实验报告。

#include "Queue.h"

template <class T>
Queue<T>::Queue()
{
	front = 0;
	rear = 0;
}

template <class T>
void Queue<T>::EnQueue(T x)
{
	if ( (rear + 1) % QUEUE_SIZE == front )
		throw "上溢";
	rear = (rear + 1) % QUEUE_SIZE;
	data[rear] = x;
}

template <class T>
T Queue<T>::DeQueue()
{
	if (front == rear)
		throw "下溢";
	front = (front + 1) % QUEUE_SIZE;
	return data[front];
}

template <class T>
bool Queue<T>::Empty() const
{
	if (front == rear)
		return true;
	return false;
}