Linked list functions changed to snake case

1 files changed, 6 insertions, 6 deletions

diff --git a/src/LinkedList.h b/src/LinkedList.h
index 57538e2..363fb21 100644
--- a/src/LinkedList.h
+++ b/src/LinkedList.h
@@ -22,29 +22,29 @@ struct LinkedListNode {
 // Allocate and initialize an empty linked list.
 // Returns: a pointer to the new linked list, or NULL on error.
 // Post: the caller owns the linked list.
-LinkedList *LinkedList_new();
+LinkedList *linkedlist_new();
 
 // Deallocate the given linked list, including all nodes
 // (but _not_ the data they point to, the user owns that).
-void LinkedList_delete(LinkedList *ll);
+void linkedlist_delete(LinkedList *ll);
 
 // Append a the given element to the list.
 // The linked list does _not_ take ownership over the element
 // (only the linked list node).
 // Returns: a pointer to the node with the new element, or NULL on error.
-LinkedListNode *LinkedList_append(LinkedList *ll, void *elem);
+LinkedListNode *linkedlist_append(LinkedList *ll, void *elem);
 
 // Remove and return the first element from the given list.
 // Pre: ll->size != 0
-void *LinkedList_popFront(LinkedList *ll);
+void *linkedlist_popfront(LinkedList *ll);
 
 // Find the linked list node containing the given element.
 // Returns: a pointer to the found node, or NULL if the element was not found.
-LinkedListNode *LinkedList_find(LinkedList *ll, void *elem);
+LinkedListNode *linkedlist_find(LinkedList *ll, void *elem);
 
 // Remove the given node from the given linked list (and deallocate it).
 // Pre: node must belong to ll
 // Returns: node->data
-void *LinkedList_remove(LinkedList *ll, LinkedListNode *node);
+void *linkedlist_remove(LinkedList *ll, LinkedListNode *node);
 
 #endif // LINKEDLIST_H