From 502c5f5d92724169d2c639f89fc7df75b1708315 Mon Sep 17 00:00:00 2001
From: Krzosa Karol <krzosa.karol@gmail.com>
Date: Sun, 31 Dec 2023 16:46:03 +0100
Subject: [PATCH] Formatting

---
 array.hpp | 40 ++++++++++++++++++++--------------------
 1 file changed, 20 insertions(+), 20 deletions(-)

diff --git a/array.hpp b/array.hpp
index 3ca712f..a7e35dd 100644
--- a/array.hpp
+++ b/array.hpp
@@ -118,12 +118,12 @@ struct Array {
         return ref;
     }
 
-	T *alloc_multiple(int size) {
-		try_growing_to_fit_item_count(size);
-		T *result = data + len;
-		len += size;
-		return result;
-	}
+    T *alloc_multiple(int size) {
+        try_growing_to_fit_item_count(size);
+        T *result = data + len;
+        len += size;
+        return result;
+    }
 
     void add_array(T *items, int item_count) {
         for (int i = 0; i < item_count; i += 1) {
@@ -284,20 +284,20 @@ struct Array {
 
     Reverse_Iter reverse() { return {end() - 1, this}; }
 
-	void try_growing() {
-		if (len + 1 > cap) {
-			int new_size = cap * 2;
-			if (new_size < 16) new_size = 16;
+    void try_growing() {
+        if (len + 1 > cap) {
+            int new_size = cap * 2;
+            if (new_size < 16) new_size = 16;
 
-			reserve(new_size);
-		}
-	}
+            reserve(new_size);
+        }
+    }
 
-	void try_growing_to_fit_item_count(int item_count) {
-		if (len + item_count > cap) {
-			int new_size = (cap + item_count) * 2;
-			if (new_size < 16) new_size = 16;
-			reserve(new_size);
-		}
-	}
+    void try_growing_to_fit_item_count(int item_count) {
+        if (len + item_count > cap) {
+            int new_size = (cap + item_count) * 2;
+            if (new_size < 16) new_size = 16;
+            reserve(new_size);
+        }
+    }
 };