배열 큐 (Array Queue)

#pragma once

const int MAX = 100;

class ArrayQueue
{
private:
	int *m_queue;
	int m_front;
	int m_tail;
	int m_max;
	int m_size;

public:
	ArrayQueue(int _max = MAX);
	~ArrayQueue();

	void EnQueue(int _item);
	int DeQueue();
	bool IsEmpty();
	bool IsFull();
	int GetFront();
	int GetSize();

};

ArrayQueue.h

 

 

 

 

 

#include "ArrayQueue.h"

ArrayQueue::ArrayQueue(int _max)
{
	m_front = 0;
	m_tail = 0;
	m_max = _max;
	m_size = 0;
	m_queue = new int[_max];

}

ArrayQueue::~ArrayQueue()
{
	delete[] m_queue;

}

void ArrayQueue::EnQueue(int _item)
{
	m_queue[m_tail++] = _item;
	m_size++;

}

int ArrayQueue::DeQueue()
{
	int temp;

	temp = m_queue[m_front++];
	m_size--;

	return temp;

}

bool ArrayQueue::IsEmpty()
{
	return m_size == 0;

}

bool ArrayQueue::IsFull()
{
	return m_size = m_max;

}

int ArrayQueue::GetFront()
{
	return m_queue[m_front];

}

int ArrayQueue::GetSize()
{
	return m_size;

}

ArrayQueue.cpp