refactoring: lists

Author: 20centaurifux

list.c

@@ -390,7 +390,7 @@ _list_find(const List *list, ListItem *offset, void const *data)
 }
 
 bool
-list_contains(const List *list, void *data)
+list_contains(const List *list, const void *data)
 {
 	assert(list != NULL);
 	assert(list->compare != NULL);

list.h

@@ -187,7 +187,7 @@ void *list_pop(List *list);
  *
  * Tests if a list contains the specified data.
  */
-bool list_contains(const List *list, void *data);
+bool list_contains(const List *list, const void *data);
 
 /**
  *\param list a List

slist.c

@@ -378,7 +378,7 @@ _slist_find(const SList *list, SListItem *offset, void const *data)
 }
 
 bool
-slist_contains(const SList *list, void *data)
+slist_contains(const SList *list, const void *data)
 {
 	assert(list != NULL);
 	assert(list->compare != NULL);

slist.h

@@ -178,7 +178,7 @@ void *slist_pop(SList *list);
  *
  * Tests if a list contains the specified data.
  */
-bool slist_contains(const SList *list, void *data);
+bool slist_contains(const SList *list, const void *data);
 
 /**
  *\param list a SList

stack.c

@@ -52,7 +52,7 @@ stack_pop(Stack *stack, void **data)
 }
 
 bool
-stack_head(Stack *stack, void **data)
+stack_head(const Stack *stack, void **data)
 {
 	assert(stack != NULL);
 	assert(data != NULL);

stack.h

@@ -85,7 +85,7 @@ typedef SList StackItem;
  *
  * Gets first element from stack without removing it.
  */
-bool stack_head(Stack *stack, void **data);
+bool stack_head(const Stack *stack, void **data);
 
 /**
  *\param stack a Stack