From 00b22d8682827a6e8d0098437559537a04236aa4 Mon Sep 17 00:00:00 2001
From: angeld55 <angel_dimitriev@abv.bg>
Date: Mon, 26 Apr 2021 01:11:36 +0300
Subject: sem 9/10

---
 Sem. 09/task2/Queue.hpp | 91 +++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 91 insertions(+)
 create mode 100644 Sem. 09/task2/Queue.hpp

(limited to 'Sem. 09/task2/Queue.hpp')

diff --git a/Sem. 09/task2/Queue.hpp b/Sem. 09/task2/Queue.hpp
new file mode 100644
index 0000000..1cc14c3
--- /dev/null
+++ b/Sem. 09/task2/Queue.hpp	
@@ -0,0 +1,91 @@
+#include <iostream>
+
+template <typename T>
+class Queue
+{
+	T* data;
+	size_t capacity;
+	size_t count;
+	
+	size_t head; //where to get
+	size_t tail; //last added element;
+
+	void resize(size_t newCapacity);
+public:
+	Queue();
+
+	void enqueue(const T& obj);
+	T dequeue();
+
+	size_t getCount();
+	size_t isEmpty();
+};
+
+template <typename T>
+Queue<T>::Queue()
+{
+	capacity = 4;
+	data = new T[capacity];
+
+	count = 0;
+	head = tail = 0;
+}
+
+
+
+template <typename T>
+void Queue<T>::enqueue(const T& obj)
+{
+	if (count == capacity)
+		resize(capacity * 2);
+	if (count != 0)
+		tail++;
+	
+	tail %= capacity; //so we don't get an out of range exception
+	
+	data[tail] = obj;
+
+	count++;
+}
+
+template <typename T>
+T Queue<T>::dequeue()
+{
+	if (count == 0)
+		throw std::exception("The collection is empty!");
+	
+	T toReturn = data[head];
+	(++head) %= capacity;
+	
+	count--;
+
+	return toReturn;
+}
+
+template <typename T>
+size_t Queue<T>::getCount()
+{
+	return count;
+}
+
+template <typename T>
+size_t Queue<T>::isEmpty()
+{
+	return getCount() == 0;
+}
+
+template <typename T>
+void Queue<T>::resize(size_t newCapacity)
+{
+	T* newData = new T[newCapacity];
+
+	for (int i = 0, ind = head; i < count; i++, (++ind) %= capacity)
+		newData[i] = data[ind];
+		
+	delete[] data;
+	capacity = newCapacity;
+	data = newData;
+
+	head = 0;
+	tail = count - 1;
+}
\ No newline at end of file
-- 
cgit v1.3.1-23-gd82d