Xiqual 0.7.2
In file include/lists.h:typedef struct List
Linked list structure.
-
Node* head
- First Node in List
-
Node* tail
- Last Node in List
-
ulong size
- Number of items in List
-
void (*destructor)(void* )
- A destructor callback for items (optional)
Documentation
Linked list structure.
The first Node will not have a previous Node pointer,
and the last will have no next Node pointer. Use the
list_makecircular() function to make it loop.
Node* head
-
First Node in List
Node* tail
-
Last Node in List
ulong size
-
Number of items in List
void (*destructor)(void* )
-
A destructor callback for items (optional)
- Author:
- Ronny Bangsund
- See Also:
- Node, list_new(), list_add(), list_insert()
Alphabetic index
This page was generated with the help of DOC++.