8 return list->
head == NULL;
24 if (list->
head == NULL) {
42 while (node != NULL) {
#define xfree
Old name of ruby_xfree.
PRISM_EXPORTED_FUNCTION bool pm_list_empty_p(pm_list_t *list)
Returns true if the given list is empty.
PRISM_EXPORTED_FUNCTION size_t pm_list_size(pm_list_t *list)
Returns the size of the list.
void pm_list_append(pm_list_t *list, pm_list_node_t *node)
Append a node to the given list.
PRISM_EXPORTED_FUNCTION void pm_list_free(pm_list_t *list)
Deallocate the internal state of the given list.
#define PRISM_EXPORTED_FUNCTION
By default, we compile with -fvisibility=hidden.
This struct represents an abstract linked list that provides common functionality.
struct pm_list_node * next
A pointer to the next node in the list.
This represents the overall linked list.
pm_list_node_t * tail
A pointer to the tail of the list.
pm_list_node_t * head
A pointer to the head of the list.
size_t size
The size of the list.