aboutsummaryrefslogtreecommitdiff
path: root/src/linked_list.c
diff options
context:
space:
mode:
authorMikkel Thestrup <mithe24@student.sdu.dk>2025-12-01 10:30:03 +0100
committerMikkel Thestrup <mithe24@student.sdu.dk>2025-12-01 10:30:24 +0100
commitf4ea7131029351cebc0a7de2e46d459dcb18b777 (patch)
treeb843752ae937f9da2ade6c10a94fdae7aca98cd3 /src/linked_list.c
parentc645866ceb7688b6b426144577d332c1d733b69d (diff)
downloadcycle-detector-f4ea7131029351cebc0a7de2e46d459dcb18b777.tar.gz
cycle-detector-f4ea7131029351cebc0a7de2e46d459dcb18b777.zip
fixed inline if-else statements
Diffstat (limited to 'src/linked_list.c')
-rw-r--r--src/linked_list.c27
1 files changed, 18 insertions, 9 deletions
diff --git a/src/linked_list.c b/src/linked_list.c
index 0a6850d..2e290e9 100644
--- a/src/linked_list.c
+++ b/src/linked_list.c
@@ -3,7 +3,8 @@
LinkedList *linked_list_new(void) {
LinkedList *ll = (LinkedList *)malloc(sizeof(LinkedList));
- if (!ll) return NULL;
+ if (!ll)
+ return NULL;
ll->head = NULL;
ll->tail = NULL;
@@ -27,7 +28,8 @@ void linked_list_delete(LinkedList *ll) {
LinkedListNode *linked_list_append(LinkedList *ll, void *elem) {
LinkedListNode *new_node = (LinkedListNode *)malloc(sizeof(LinkedListNode));
- if (!new_node) return NULL;
+ if (!new_node)
+ return NULL;
new_node->data = elem;
new_node->next = NULL;
@@ -46,7 +48,8 @@ LinkedListNode *linked_list_append(LinkedList *ll, void *elem) {
}
void *linked_list_popfront(LinkedList *ll) {
- if (!ll->head) return NULL;
+ if (!ll->head)
+ return NULL;
void *elem = ll->head->data;
LinkedListNode *node = ll->head;
@@ -58,13 +61,15 @@ void *linked_list_popfront(LinkedList *ll) {
}
LinkedListNode *linked_list_find(LinkedList *ll, void *elem) {
- if (!ll->head) return NULL;
+ if (!ll->head)
+ return NULL;
LinkedListNode *node = ll->head;
while (node) {
/* !NOTE should use a given comparator function
* instead of '==' operator */
- if (node->data == elem) return node;
+ if (node->data == elem)
+ return node;
node = node->next;
}
@@ -74,11 +79,15 @@ LinkedListNode *linked_list_find(LinkedList *ll, void *elem) {
void *linked_list_remove(LinkedList *ll, LinkedListNode *node) {
void *elem = node->data;
- if (node->prev) node->prev->next = node->next;
- else ll->head = node->next;
+ if (node->prev)
+ node->prev->next = node->next;
+ else
+ ll->head = node->next;
- if (node->next) node->next->prev = node->prev;
- else ll->tail = node->prev;
+ if (node->next)
+ node->next->prev = node->prev;
+ else
+ ll->tail = node->prev;
free(node);
ll->size--;