Lines Matching refs: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
85 /* A doubly-linked list of pointers. */
87 /* A single node in the doubly-linked list. */
91 ListNode *prev; /* previous node in list, or NULL */
92 ListNode *next; /* next node in list, or NULL */
101 /* Free the list nodes. */
103 /* Free the list nodes, as well as each node's datum. */
108 /* Initialize a list, without memory allocation. */
110 Lst_Init(List *list)
112 list->first = NULL;
113 list->last = NULL;
116 /* Get information about a list */
119 Lst_IsEmpty(List *list)
121 return list->first == NULL;
127 /* Modify a list */
131 /* Add a datum at the head of the list. */
133 /* Add a datum at the tail of the list. */
135 /* Remove the node from the list. */
145 /* Set the value of the node to NULL. Having NULL in a list is unusual. */
148 /* Using the list as a queue */
152 Lst_Enqueue(List *list, void *datum)
154 Lst_Append(list, datum);