linked list node More...
Typedefs | |
typedef typedefCGUL_BEGIN_C struct cgul_list_node * | cgul_list_node_t |
Functions | |
CGUL_EXPORT void * | cgul_list_node__get_value (cgul_exception_t *cex, cgul_list_node_t n) |
CGUL_EXPORT void | cgul_list_node__set_value (cgul_exception_t *cex, cgul_list_node_t n, const void *value) |
CGUL_EXPORT cgul_list_node_t | cgul_list_node__get_prev (cgul_exception_t *cex, cgul_list_node_t n) |
CGUL_EXPORT cgul_list_node_t | cgul_list_node__get_next (cgul_exception_t *cex, cgul_list_node_t n) |
This class implements a linked list node which holds one value.
typedef typedefCGUL_BEGIN_C struct cgul_list_node* cgul_list_node_t |
Opaque pointer to a cgul_list_node
instance.
CGUL_EXPORT void* cgul_list_node__get_value | ( | cgul_exception_t * | cex, |
cgul_list_node_t | n | ||
) |
Return the value stored in the node.
[in] | cex | c-style exception |
[in] | n | cgul_list_node instance |
n
Referenced by cgul_list_cxx::foldl(), cgul_list_cxx::foldr(), and cgul_list_node_cxx::get_value().
CGUL_EXPORT void cgul_list_node__set_value | ( | cgul_exception_t * | cex, |
cgul_list_node_t | n, | ||
const void * | value | ||
) |
Set the value to be stored in the node.
[in] | cex | c-style exception |
[in] | n | cgul_list_node instance |
[in] | value | value to be stored in the node |
Referenced by cgul_list_node_cxx::set_value().
CGUL_EXPORT cgul_list_node_t cgul_list_node__get_prev | ( | cgul_exception_t * | cex, |
cgul_list_node_t | n | ||
) |
Return the previous node. You can use this method to iterate over the list. When there are no more nodes, NULL
is returned. You can use cgul_list__get_back()
to get the last node in a cgul_list
in order to start iterating. A cgul_list_node__set_prev()
exists, but it is private.
[in] | cex | c-style exception |
[in] | n | cgul_list_node instance |
Referenced by cgul_list_cxx::foldr(), and cgul_list_node_cxx::get_prev().
CGUL_EXPORT cgul_list_node_t cgul_list_node__get_next | ( | cgul_exception_t * | cex, |
cgul_list_node_t | n | ||
) |
Return the next node. You can use this method to iterate over the list. When there are no more nodes, NULL
is returned. You can use cgul_list__get_front()
to get the first node in a cgul_list
in order to start iterating. A cgul_list_node__set_next()
exists, but it is private.
[in] | cex | c-style exception |
[in] | n | cgul_list_node instance |
Referenced by cgul_list_cxx::foldl(), cgul_list_node_cxx::get_next(), and cgul_list_cxx::traverse_range().