| Data Structures Lerax
                   v3.0-101-gb1f7
                 Opinionated Data Structures & Algorithms | 
Go to the source code of this file.
| Data Structures | |
| struct | ListDouble | 
| A node in a doubly linked list.  More... | |
| Macros | |
| #define | EMPTY_LIST_DOUBLE (ListDouble*) 0 | 
| Typedefs | |
| typedef struct ListDouble | ListDouble | 
| A doubly linked list. | |
| Functions | |
| ListDouble * | list_double_create (void) | 
| Creates an empty doubly linked list. | |
| int | list_double_empty (ListDouble *l) | 
| Checks if a doubly linked list is empty. | |
| ListDouble * | list_double_insert (ListDouble *l, int data) | 
| Inserts a new element at the beginning of a doubly linked list. | |
| ListDouble * | list_double_remove (ListDouble *l, int data) | 
| Removes an element from a doubly linked list. | |
| ListDouble * | list_double_search (ListDouble *l, int data) | 
| Searches for an element in a doubly linked list. | |
| void | list_double_print (ListDouble *l) | 
| Prints the elements of a doubly linked list to the console. | |
| void | list_double_println (ListDouble *l) | 
| Prints the elements of a doubly linked list to the console, followed by a newline character. | |
| void | list_double_free (ListDouble *l) | 
| Frees the memory allocated for a doubly linked list. | |
| ListDouble * | list_double__new_node (int data) | 
| Creates a new node for a doubly linked list. | |
| #define EMPTY_LIST_DOUBLE (ListDouble*) 0 | 
| typedef struct ListDouble ListDouble | 
A doubly linked list.
A ListDouble is a pointer to the first node in the list. An empty list is represented by a null pointer.