Go to the source code of this file.
Data Structures | |
struct | Queue |
Functions | |
Queue * | queue_create (void) |
Create a new queue. | |
void | queue_destroy (Queue *q) |
Destroy a queue. | |
void | queue_add (Queue *q, void *item) |
Add an element to a queue. | |
void * | queue_remove (Queue *q) |
Remove an element from a queue. | |
void | queue_remove_all (Queue *q, void *item) |
Remove all instances of a given element from a queue. | |
int | queue_size (Queue *q) |
Get the size of a queue. | |
int | queue_is_empty (Queue *q) |
Check if the queue is empty. |
Implements a queue, a first in, first out data structure.