Update queue implementation to use ring buffer

tests/queue/test_queue.cc

@@ -1,73 +1,96 @@
 #include "wapp.h"
 #include "test_queue.h"
 
-#define SKIP 1
+#define CAPACITY 8
 
-#if !SKIP
-wapp_persist Allocator arena = {};
-wapp_persist I32Queue queue;
-#endif
+TestFuncResult test_queue_push(void) {
+	I32Queue queue = wapp_queue(i32, CAPACITY);
 
-TestFuncResult test_queue_push_back(void) {
-#if !SKIP
-	arena = wapp_mem_arena_allocator_init(MB(64));
+	for (u64 i = 0; i < CAPACITY; ++i) {
+		i32 item = (i32)i;
+		wapp_queue_push(i32, &queue, &item);
+	}
 
 	b8 result = true;
-	queue     = wapp_queue_alloc(i32, &arena, 64);
-
-	result = result && queue.items != NULL && wapp_queue_capacity(&queue) == 64 && wapp_queue_count(&queue) == 0;
-
-	i32 n1 = 1;
-	i32 n2 = 2;
-	i32 n3 = 3;
-	i32 n4 = 4;
-	i32 n5 = 5;
-
-	wapp_queue_push_back(i32, &queue, &n1);
-	result = result && wapp_queue_count(&queue) == 1;
-
-	wapp_queue_push_back(i32, &queue, &n2);
-	result = result && wapp_queue_count(&queue) == 2;
-
-	wapp_queue_push_back(i32, &queue, &n3);
-	result = result && wapp_queue_count(&queue) == 3;
-
-	wapp_queue_push_back(i32, &queue, &n4);
-	result = result && wapp_queue_count(&queue) == 4;
-
-	wapp_queue_push_back(i32, &queue, &n5);
-	result = result && wapp_queue_count(&queue) == 5;
+	for (u64 i = 0; i < CAPACITY; ++i) {
+		i32 *value = ((i32 *)(queue.items)) + i;
+		result = result && value != NULL && *value == (i32)i;
+	}
 
 	return wapp_tester_result(result);
-#else
-	return wapp_tester_result(true);
-#endif
 }
 
-TestFuncResult test_queue_pop_front(void) {
-#if !SKIP
+TestFuncResult test_queue_push_alloc(void) {
+	Allocator arena = wapp_mem_arena_allocator_init(MiB(64));
+	I32Queue queue  = wapp_queue(i32, CAPACITY);
+
+	for (u64 i = 0; i < CAPACITY; ++i) {
+		i32 item = (i32)i;
+		wapp_queue_push(i32, &queue, &item);
+	}
+
 	b8 result = true;
-	i32 num;
+	i32 item  = 8;
+	u64 new_capacity = CAPACITY * 2;
+	I32Queue *new_queue = wapp_queue_push_alloc(i32, &arena, &queue, &item);
+	if (new_queue && new_queue != &queue) {
+		queue = *new_queue;
+	}
+	u64 capacity = wapp_queue_capacity(&queue);
+	result = result && capacity == new_capacity;
 
-	wapp_queue_pop_front(i32, &queue, &num);
-	result = result && num == 1;
+	for (u64 i = 0; i < 2; ++i) {
+		wapp_queue_pop(i32, &queue);
+	}
 
-	wapp_queue_pop_front(i32, &queue, &num);
-	result = result && num == 2;
+	u64 remaining = wapp_queue_capacity(&queue) - queue.count;
+	for (u64 i = 0; i < remaining; ++i) {
+		item = remaining + i;
+		wapp_queue_push(i32, &queue, &item);
+	}
 
-	wapp_queue_pop_front(i32, &queue, &num);
-	result = result && num == 3;
+	++item;
+	new_queue = wapp_queue_push_alloc(i32, &arena, &queue, &item);
+	if (new_queue && new_queue != &queue) {
+		queue = *new_queue;
+	}
 
-	wapp_queue_pop_front(i32, &queue, &num);
-	result = result && num == 4;
+	result = result && wapp_queue_capacity(&queue) == new_capacity * 2;
 
-	wapp_queue_pop_front(i32, &queue, &num);
-	result = result && num == 5;
+	i32 *arr = (i32 *)queue.items;
+	for (u64 i = 0; i < queue.count; ++i) {
+		// NOTE (Abdelrahman): First queue value is currently 2
+		result = result && arr[i] == (i32)(2 + i);
+	}
 
 	wapp_mem_arena_allocator_destroy(&arena);
 
 	return wapp_tester_result(result);
-#else
-	return wapp_tester_result(true);
-#endif
+}
+
+TestFuncResult test_queue_pop(void) {
+	I32Queue queue = wapp_queue(i32, CAPACITY);
+	for (u64 i = 0; i < CAPACITY; ++i) {
+		i32 item = (i32)i;
+		wapp_queue_push(i32, &queue, &item);
+	}
+
+	b8 result      = true;
+	u64 half_count = queue.count / 2;
+	for (u64 i = 0; i < half_count; ++i) {
+		i32 *value = wapp_queue_pop(i32, &queue);
+		result = result && value != NULL && *value == (i32)i;
+	}
+
+	for (u64 i = 0; i < half_count; ++i) {
+		i32 item = (i32)i + CAPACITY;
+		wapp_queue_push(i32, &queue, &item);
+	}
+
+	for (u64 i = 0; i < CAPACITY; ++i) {
+		i32 *value = wapp_queue_pop(i32, &queue);
+		result = result && value != NULL && *value == (i32)half_count + (i32)i;
+	}
+
+	return wapp_tester_result(result);
 }