gdsl
1.6
|
Go to the source code of this file.
Typedefs | |
typedef _gdsl_node_t | _gdsl_list_t |
GDSL low-level doubly-linked list type. | |
Functions | |
_gdsl_list_t | _gdsl_list_alloc (const gdsl_element_t E) |
Create a new low-level list. | |
void | _gdsl_list_free (_gdsl_list_t L, const gdsl_free_func_t FREE_F) |
Destroy a low-level list. | |
bool | _gdsl_list_is_empty (const _gdsl_list_t L) |
Check if a low-level list is empty. | |
ulong | _gdsl_list_get_size (const _gdsl_list_t L) |
Get the size of a low-level list. | |
void | _gdsl_list_link (_gdsl_list_t L1, _gdsl_list_t L2) |
Link two low-level lists together. | |
void | _gdsl_list_insert_after (_gdsl_list_t L, _gdsl_list_t PREV) |
Insert a low-level list after another one. | |
void | _gdsl_list_insert_before (_gdsl_list_t L, _gdsl_list_t SUCC) |
Insert a low-level list before another one. | |
void | _gdsl_list_remove (_gdsl_node_t NODE) |
Remove a node from a low-level list. | |
_gdsl_list_t | _gdsl_list_search (_gdsl_list_t L, const gdsl_compare_func_t COMP_F, void *VALUE) |
Search for a particular node in a low-level list. | |
_gdsl_list_t | _gdsl_list_map_forward (const _gdsl_list_t L, const _gdsl_node_map_func_t MAP_F, void *USER_DATA) |
Parse a low-level list in forward order. | |
_gdsl_list_t | _gdsl_list_map_backward (const _gdsl_list_t L, const _gdsl_node_map_func_t MAP_F, void *USER_DATA) |
Parse a low-level list in backward order. | |
void | _gdsl_list_write (const _gdsl_list_t L, const _gdsl_node_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Write all nodes of a low-level list to a file. | |
void | _gdsl_list_write_xml (const _gdsl_list_t L, const _gdsl_node_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Write all nodes of a low-level list to a file into XML. | |
void | _gdsl_list_dump (const _gdsl_list_t L, const _gdsl_node_write_func_t WRITE_F, FILE *OUTPUT_FILE, void *USER_DATA) |
Dump the internal structure of a low-level list to a file. |