Lines Matching defs:list
14 * notice, this list of conditions and the following disclaimer.
16 * notice, this list of conditions and the following disclaimer in the
49 * notice, this list of conditions and the following disclaimer.
51 * notice, this list of conditions and the following disclaimer in the
90 /* A doubly-linked list of pointers. */
92 /* A single node in the doubly-linked list. */
96 ListNode *prev; /* previous node in list, or NULL */
97 ListNode *next; /* next node in list, or NULL */
109 /* Create or destroy a list */
111 /* Create a new list. */
113 /* Free the list nodes, but not the list itself. */
115 /* Free the list nodes, freeing the node data using the given function. */
117 /* Free the list, leaving the node data unmodified. */
122 /* Initialize a list, without memory allocation. */
124 Lst_Init(List *list)
126 list->first = NULL;
127 list->last = NULL;
130 /* Get information about a list */
133 Lst_IsEmpty(List *list)
134 { return list->first == NULL; }
139 /* Modify a list */
143 /* Place a datum at the front of the list. */
145 /* Place a datum at the end of the list. */
147 /* Remove the node from the list. */
157 /* Set the value of the node to NULL. Having NULL in a list is unusual. */
160 /* Using the list as a queue */
164 Lst_Enqueue(List *list, void *datum) {
165 Lst_Append(list, datum);