buffertrack.cpp

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

#include "BufferTrack.h"
#include <iostream.h>

BufferTrack::BufferTrack()
{
	front = 0;
	rear = 0;
}

void BufferTrack::EnQueue(int carriage)
{
	if ((rear + 1) % QUEUE_SIZE == front)
		return;
	rear = (rear + 1) % QUEUE_SIZE;
	train[rear] = carriage;
}

int BufferTrack::DeQueue()
{
	if (front == rear)
		return 0;
	front = (front + 1) % QUEUE_SIZE;
	return train[front];
}

int BufferTrack::GetLast() const
{
	if (front == rear)
		return 0;
	return train[rear];
}

int BufferTrack::GetHead() const
{
	if (front == rear)
		return 0;
	return train[front + 1];
}