From a0749400f5381944facc8f19ed6ff076c152e745 Mon Sep 17 00:00:00 2001
From: Nathan Singer <nathan.r.singer@gmx.com>
Date: Fri, 6 Jun 2025 12:49:41 -0400
Subject: [PATCH] adds a todo'

---
 libc/queue/queue.c | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/libc/queue/queue.c b/libc/queue/queue.c
index 2064fe0..c41729b 100644
--- a/libc/queue/queue.c
+++ b/libc/queue/queue.c
@@ -16,7 +16,7 @@ void init_queue(queue *q)
 bool queue_is_empty(queue *q) 
 {
 	bool empty = q->front == q->rear - 1;
-	if (empty)
+	if (empty) // This allows us to continuously reuse the queue when it empties. Ideally i'd like to switch to a heap implementation... TODO
 		init_queue(q);
 	return empty;
 }