aboutsummaryrefslogtreecommitdiff
path: root/src/LinkedList.c
diff options
context:
space:
mode:
authorMikkel Thestrup <mithe24@student.sdu.dk>2025-11-29 22:48:49 +0100
committerMikkel Thestrup <mithe24@student.sdu.dk>2025-11-29 22:48:49 +0100
commit7a2b9870d9530c6ad080643b9fe72bb4e8e9335f (patch)
treeaa9f134d84b915e8f5f6d23a5adcd75a7a2693ab /src/LinkedList.c
parentc67dcfa1b32900fe18fc956d7fe71480c4a320d5 (diff)
downloadcycle-detector-7a2b9870d9530c6ad080643b9fe72bb4e8e9335f.tar.gz
cycle-detector-7a2b9870d9530c6ad080643b9fe72bb4e8e9335f.zip
Linked list functions changed to snake case
Diffstat (limited to 'src/LinkedList.c')
-rw-r--r--src/LinkedList.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/src/LinkedList.c b/src/LinkedList.c
index 57ac2d8..aac05d6 100644
--- a/src/LinkedList.c
+++ b/src/LinkedList.c
@@ -1,7 +1,7 @@
#include "LinkedList.h"
#include <stdlib.h>
-LinkedList *Linkedlist_new(void) {
+LinkedList *linkedlist_new(void) {
LinkedList *ll = malloc(sizeof(LinkedList));
if (!ll) return NULL;
@@ -12,7 +12,7 @@ LinkedList *Linkedlist_new(void) {
return ll;
}
-void LinkedList_delete(LinkedList *ll) {
+void linkedlist_delete(LinkedList *ll) {
LinkedListNode *node = ll->head;
LinkedListNode *next;
@@ -25,7 +25,7 @@ void LinkedList_delete(LinkedList *ll) {
free(ll);
}
-LinkedListNode *LinkedList_append(LinkedList *ll, void *elem) {
+LinkedListNode *linkedlist_append(LinkedList *ll, void *elem) {
LinkedListNode *new_node = malloc(sizeof(LinkedListNode));
if (!new_node) return NULL;
@@ -45,7 +45,7 @@ LinkedListNode *LinkedList_append(LinkedList *ll, void *elem) {
return new_node;
}
-void *LinkedList_popFront(LinkedList *ll) {
+void *linkedlist_popfront(LinkedList *ll) {
if (!ll->head) return NULL;
void *elem = ll->head->data;
@@ -57,7 +57,7 @@ void *LinkedList_popFront(LinkedList *ll) {
return elem;
}
-LinkedListNode *LinkedList_find(LinkedList *ll, void *elem) {
+LinkedListNode *linkedlist_find(LinkedList *ll, void *elem) {
if (!ll->head) return NULL;
LinkedListNode *node = ll->head;
@@ -71,7 +71,7 @@ LinkedListNode *LinkedList_find(LinkedList *ll, void *elem) {
return NULL; // Couldn't find the element
}
-void *LinkedList_remove(LinkedList *ll, LinkedListNode *node) {
+void *linkedlist_remove(LinkedList *ll, LinkedListNode *node) {
void *elem = node->data;
if (node->prev) node->prev->next = node->next;