CPP/Queue.cpp at main · GarGrigoryan/CPP · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
#include <iostream>
using namespace std;

template <typename T>
class Queue {
private:
	T* arr;
	int capacity;
	int front;
	int rear;
	int count;
public:
	Queue(int size = 0);
	~Queue();
	void dequeue();
	void enqueue(int);
	T getFront();
	int size();
	bool isEmpty();
	bool isFull();
};

template<typename T>
Queue<T>::Queue(int size)
{
	arr = new int[size];
	capacity = size;
	front = 0;
	rear = -1;
	count = 0;
}

template<typename T>
Queue<T>::~Queue()
{
	delete[] arr;
}

template<typename T>
void Queue<T>::dequeue()
{
	if (isEmpty())
	{
		cout << "Queue is empty!" << endl;
		return;
	}
	T item = arr[front];
	front = (front + 1) % capacity;
	count--;
	return;
}

template<typename T>
void Queue<T>::enqueue(int item)
{
	if (isFull())
	{
		cout << "Queue is full!" << endl;
	}
	rear = (rear + 1) % capacity;
	arr[rear] = item;
	count++;
	return;
}

template<typename T>
T Queue<T>::getFront()
{
	if (isEmpty())
	{
		cout << "Queue is empty!" << endl;
	}
	return arr[front];
}

template<typename T>
int Queue<T>::size()
{
	return count;
}

template<typename T>
bool Queue<T>::isEmpty()
{
	return count == 0;
}

template<typename T>
bool Queue<T>::isFull()
{
	return count == capacity;
}

int main() {
	Queue<int> myQueue(10);
	for (int i = 0; i < 10; ++i) {
		myQueue.enqueue(i);
	}
	for (int i = 0; i < 10; i++)
	{
		cout << myQueue.getFront() << endl;
		myQueue.dequeue();
	}

}