From 1d47e3aa120539e053ffa41293f3f756b9d07844 Mon Sep 17 00:00:00 2001
From: mattkae <mattkae@protonmail.com>
Date: Sun, 16 Jan 2022 18:32:50 -0500
Subject: Successful beginnings of the winter theme

---
 themes/List.h | 222 ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 222 insertions(+)
 create mode 100644 themes/List.h

(limited to 'themes/List.h')

diff --git a/themes/List.h b/themes/List.h
new file mode 100644
index 0000000..00a466a
--- /dev/null
+++ b/themes/List.h
@@ -0,0 +1,222 @@
+#pragma once
+#include <cstdlib>
+#include <cstring>
+#include "Logger.h"
+
+#define FOREACH(list)												\
+	for (size_t idx = 0; idx < list.numElements; idx++) \
+		if (auto value = list.getValue(idx)) \
+		
+
+template <typename T>
+struct List {
+	T* data = nullptr;
+	size_t capacity = 0;
+	size_t numElements = 0;
+	bool growDynamically = true;
+
+	void allocate(size_t size);
+	void add(T* element);
+	void add(T& element);
+	void add(T&& element);
+	bool grow(size_t newSize);
+	void set(T* value, size_t index);
+	void remove(size_t index);
+	void clear();
+	void deallocate();
+	bool isEmpty() {
+		return data == nullptr || numElements == 0;
+	}
+	T* getValue(int index) const;
+	T& operator[](int idx) const;
+	void binarySort(int (*f)(T *first, T* second));
+	void setFromArray(T* arry, int size) {
+	    allocate(size);
+		memcpy(data, arry, size * sizeof(T));
+		numElements = size;
+	}
+	void remove(int index) {
+		if (index >= numElements) {
+			logger_error("Cannot remove element at index: %d", index);
+			return;
+		}
+
+		
+		if (index == numElements - 1) {
+			numElements--;
+			return;
+		}
+		
+		memmove(data[index], data[index + 1], sizeof(T) * (numElements - index));
+		numElements--;
+	}
+};
+
+template <typename T>
+void List<T>::allocate(size_t size) {
+	if (size == 0 || size == capacity) {
+		numElements = 0;
+		return;
+	}
+
+	if (data != nullptr) {
+		deallocate();
+	}
+
+	data = static_cast<T*>(malloc(sizeof(T) * size));
+	capacity = size;
+	numElements = 0;
+}
+
+template <typename T>
+bool List<T>::grow(size_t newSize) {
+	if (!growDynamically) {
+		return false;
+	}
+
+	if (newSize == 0) {
+		return false;
+	}
+
+	T* newData = static_cast<T*>(malloc(sizeof(T) * newSize));
+
+	if (data != nullptr) {
+		memcpy(newData, data, numElements * sizeof(T));
+		delete data;
+	}
+
+	data = newData;
+	capacity = newSize;
+	return true;
+}
+
+template <typename T>
+void List<T>::set(T* value, size_t index) {
+	if (index >= capacity && !grow(index * 2)) {
+		return;
+	}
+
+	memcpy(&data[index], value, sizeof(T));
+}
+
+template <typename T>
+void List<T>::add(T* element) {
+	if (data == nullptr) {
+		allocate(2);
+	}
+
+	if (element == nullptr) {
+		logger_error("Element not defined");
+		return;
+	}
+
+	size_t newNumElements = numElements + 1;
+	if (newNumElements > capacity) {
+		if (!grow(2 * capacity)) {
+			logger_error("Trying to add to list but unable to grow the array");
+			return;
+		}
+	}
+
+	memcpy(&data[numElements], element, sizeof(T));
+	numElements = newNumElements;
+}
+
+template <typename T>
+void List<T>::add(T& element) {
+	if (data == nullptr) {
+		allocate(2);
+	}
+
+	size_t newNumElements = numElements + 1;
+	if (newNumElements > capacity) {
+		if (!grow(2 * capacity)) {
+			logger_error("Trying to add to list but unable to grow the array");
+			return;
+		}
+	}
+
+	memcpy(&data[numElements], &element, sizeof(T));
+	numElements = newNumElements;
+}
+
+template <typename T>
+void List<T>::add(T&& element) {
+	if (data == nullptr) {
+		allocate(2);
+	}
+
+	size_t newNumElements = numElements + 1;
+	if (newNumElements > capacity) {
+		if (!grow(2 * capacity)) {
+			logger_error("Trying to add to list but unable to grow the array");
+			return;
+		}
+	}
+
+	memcpy(&data[numElements], &element, sizeof(T));
+	numElements = newNumElements;
+}
+
+template <typename T>
+void List<T>::remove(size_t idx) {
+	if (idx >= numElements) {
+		logger_error("Index is outside of the list: %d >= %d", idx, numElements);
+		return;
+	}
+
+	for (; idx < numElements - 1; idx++) {
+		data[idx] = data[idx + 1];
+	}
+
+	numElements--;
+}
+
+template <typename T>
+void List<T>::deallocate() {
+	if (data != nullptr) {
+		free(data);
+		data = nullptr;
+	}
+
+	capacity = 0;
+	numElements = 0;
+}
+
+template <typename T>
+void List<T>::clear() {
+	numElements = 0;
+}
+
+template <typename T>
+T* List<T>::getValue(int idx) const {
+	return &data[idx];
+}
+
+template <typename T>
+T& List<T>::operator[](int idx) const {
+	return data[idx];
+}
+
+template <typename T>
+void List<T>::binarySort(int (*f)(T *first, T* second)) {
+	if (data == nullptr) {
+		return;
+	}
+
+	for (size_t idx = 0; idx < numElements - 1; idx++) {
+		int minIdx = idx;
+		T firstValue = data[idx];
+
+		for (int innerIdx = idx + 1; innerIdx < numElements; innerIdx++) {\
+			T secondValue = data[innerIdx];
+			if (f(&firstValue, &secondValue) > 0) {
+				minIdx= innerIdx;
+			}
+		}
+
+		T temp = data[minIdx];
+		memmove(&data[minIdx], &data[idx], sizeof(T));
+		memmove(&data[idx], &temp, sizeof(T));
+	}
+}
-- 
cgit v1.2.1