Go to the documentation of this file.
33 #ifndef __ANX_LIST_H__
34 #define __ANX_LIST_H__
AnxList * anx_list_clone_with(AnxList *list, AnxCloneFunc clone)
Clone a list using a custom clone function.
AnxList * anx_list_free_with(AnxList *list, AnxFreeFunc free_func)
Free a list, using a given function to free each data element.
AnxList * anx_list_clone(AnxList *list)
Clone a list using the default clone function.
AnxList * anx_list_find(AnxList *list, void *data)
Find the first node containing given data in a list.
AnxList * anx_list_prepend(AnxList *list, void *data)
Prepend a new node to a list containing given data.
AnxList * anx_list_tail(AnxList *list)
Return the tail element of a list.
void *(* AnxCloneFunc)(void *data)
Signature of a cloning function.
Definition: anx_core.h:51
AnxList * anx_list_add_after(AnxList *list, void *data, AnxList *node)
Add a new node containing given data after a given node.
void *(* AnxFreeFunc)(void *data)
Signature of a freeing function.
Definition: anx_core.h:56
AnxList * anx_list_remove(AnxList *list, AnxList *node)
Remove a node from a list.
AnxList * anx_list_free(AnxList *list)
Free a list, using anx_free() to free each data element.
int anx_list_length(AnxList *list)
Query the number of items in a list.
Definition: anx_list.h:47
int anx_list_is_singleton(AnxList *list)
Query if the list is singleton, ie.
AnxList * anx_list_add_before(AnxList *list, void *data, AnxList *node)
Add a new node containing given data before a given node.
AnxList * anx_list_append(AnxList *list, void *data)
Append a new node to a list containing given data.
AnxList * anx_list_new(void)
Create a new list.
int anx_list_is_empty(AnxList *list)
Query if a list is empty, ie.