Prism Ruby parser
|
This represents the overall linked list. More...
#include <pm_list.h>
Public Member Functions | |
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. | |
PRISM_EXPORTED_FUNCTION void | pm_list_free (pm_list_t *list) |
Deallocate the internal state of the given list. | |
Data Fields | |
size_t | size |
The size of the list. | |
pm_list_node_t * | head |
A pointer to the head of the list. | |
pm_list_node_t * | tail |
A pointer to the tail of the list. | |
This represents the overall linked list.
It keeps a pointer to the head and tail so that iteration is easy and pushing new nodes is easy.
PRISM_EXPORTED_FUNCTION bool pm_list_empty_p | ( | pm_list_t * | list | ) |
Returns true if the given list is empty.
list | The list to check. |
PRISM_EXPORTED_FUNCTION size_t pm_list_size | ( | pm_list_t * | list | ) |
Returns the size of the list.
list | The list to check. |
PRISM_EXPORTED_FUNCTION void pm_list_free | ( | pm_list_t * | list | ) |
Deallocate the internal state of the given list.
list | The list to free. |