77 #define QUEUE(name) LIST(name) 137 return *queue == NULL ? true :
false;
static void * queue_peek(queue_t queue)
Returns the front element of the queue, without removing it.
static void queue_enqueue(queue_t queue, void *element)
Adds an element to the tail of the queue.
static void * queue_dequeue(queue_t queue)
Removes the element at the front of the queue.
void ** list_t
The linked list type.
list_t queue_t
The queue data type.
Linked list manipulation routines.
void * list_head(list_t list)
Get a pointer to the first element of a list.
static bool queue_is_empty(queue_t queue)
Check if a queue is empty.
void list_add(list_t list, void *item)
Add an item at the end of a list.
void list_init(list_t list)
Initialize a list.
static void queue_init(queue_t queue)
Initialise a queue.
void * list_pop(list_t list)
Remove the first object on a list.