From f3d06384a24e46c10eff73677da5b53f41e68da3 Mon Sep 17 00:00:00 2001
From: phfr24 <phfr24@inf.ufpr.br>
Date: Sat, 7 Mar 2026 15:46:12 -0300
Subject: [PATCH] fix sadness

---
 queue/queue.c | 80 +++++++++++++--------------------------------------
 1 file changed, 20 insertions(+), 60 deletions(-)

diff --git a/queue/queue.c b/queue/queue.c
index 13c43b4..2aed9eb 100644
--- a/queue/queue.c
+++ b/queue/queue.c
@@ -48,9 +48,7 @@ queue_destroy (struct queue_t *queue)
   struct node_t *n, *next;
 
   if (!queue)
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   n = queue->head;
 
@@ -71,14 +69,10 @@ queue_add (struct queue_t *queue, void *item)
   struct node_t *n;
 
   if (!queue || !item)
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   if (!(n = node_create ()))
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   n->item = item;
   ++queue->size;
@@ -99,14 +93,10 @@ queue_del (struct queue_t *queue, void *item)
   struct node_t *n, *prev;
 
   if (!queue || !item)
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   if (!(n = queue->head))
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   prev = NULL;
 
@@ -117,29 +107,19 @@ queue_del (struct queue_t *queue, void *item)
     }
 
   if (!n) /* not found */
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   if (prev)
-    {
-      prev->next = n->next;
-    }
+    prev->next = n->next;
 
   if (queue->head == n)
-    {
-      queue->head = n->next;
-    }
+    queue->head = n->next;
 
   if (queue->tail == n)
-    {
-      queue->tail = prev;
-    }
+    queue->tail = prev;
 
   if (queue->iterator == n)
-    {
-      queue->iterator = n->next;
-    }
+    queue->iterator = n->next;
 
   --queue->size;
   node_destroy (n);
@@ -152,14 +132,10 @@ queue_has (struct queue_t *queue, void *item)
   struct node_t *n;
 
   if (!queue || !item)
-    {
-      return false;
-    }
+    return false;
 
   if (!(n = queue->head))
-    {
-      return false;
-    }
+    return false;
 
   while (n->item != item && (n = n->next))
     ;
@@ -171,9 +147,7 @@ int
 queue_size (struct queue_t *queue)
 {
   if (!queue)
-    {
-      return ERROR;
-    }
+    return ERROR;
 
   return queue->size;
 }
@@ -182,9 +156,7 @@ void *
 queue_head (struct queue_t *queue)
 {
   if (!queue || !queue->head)
-    {
-      return NULL;
-    }
+    return NULL;
 
   queue->iterator = queue->head;
 
@@ -195,16 +167,12 @@ void *
 queue_next (struct queue_t *queue)
 {
   if (!queue || !queue->iterator)
-    {
-      return NULL;
-    }
+    return NULL;
 
   queue->iterator = queue->iterator->next;
 
   if (!queue->iterator)
-    {
-      return NULL;
-    }
+    return NULL;
 
   return queue->iterator->item;
 }
@@ -213,9 +181,7 @@ void *
 queue_item (struct queue_t *queue)
 {
   if (!queue || !queue->iterator)
-    {
-      return NULL;
-    }
+    return NULL;
 
   return queue->iterator->item;
 }
@@ -226,9 +192,7 @@ queue_print (char *name, struct queue_t *queue, void (func) (void *))
   struct node_t *n;
 
   if (!name)
-    {
-      return;
-    }
+    return;
 
   printf ("%s: ", name);
 
@@ -243,14 +207,10 @@ queue_print (char *name, struct queue_t *queue, void (func) (void *))
   for (n = queue->head; n; n = n->next)
     {
       if (func)
-        {
-          func (n->item);
-        }
+        func (n->item);
 
       else
-        {
-          fputs ("undef", stdout);
-        }
+        fputs ("undef", stdout);
 
       putchar (' ');
     }
-- 
2.52.0