#include <lib/utils/include/linked_list.h>
Data Fields | |
struct struct_linked_list_node_t * | head |
struct struct_linked_list_node_t * | tail |
int(* | cmp_func )(const void *const data_a, const void *const data_b) |
uint32_t | length |
This structure defines a simple linked list. It can store any type of elements, provided that there is a suitable comparison function for the type of the data used.
Definition at line 70 of file linked_list.h.
struct struct_linked_list_node_t* struct_linked_list_t::head [read] |
Pointer to the head of the linked list.
Definition at line 74 of file linked_list.h.
struct struct_linked_list_node_t* struct_linked_list_t::tail [read] |
Pointer to the tail of the linked list.
Definition at line 78 of file linked_list.h.
int(* struct_linked_list_t::cmp_func)(const void *const data_a, const void *const data_b) |
Pointer to the comparison function used to compare the node data. This function, which take two pointers to the data to compare, should return:
data_a
and data_b
are the same. data_a
is greater than the data pointed by data_b
. data_a
is less than the data pointed by data_b
. uint32_t struct_linked_list_t::length |
Number of nodes composing the linked list.
Definition at line 93 of file linked_list.h.