Go to the source code of this file.
Data Structures | |
| struct | dyn_fifo |
| Dynamic first in first out positive integer queue. More... | |
Typedefs | |
| typedef dyn_fifo | dyn_fifo_t |
| Type definition of the dynamic fifo queue. | |
Functions | |
| int | dyn_fifo_destroy (dyn_fifo_t *fifo) |
| Clears and destroys the queue. | |
| int | dyn_fifo_initialize (dyn_fifo_t *fifo, int size) |
| Initializes the dynamic queue. | |
| int | dyn_fifo_pop (dyn_fifo_t *fifo) |
| Returns and excludes the first item in the queue. | |
| int | dyn_fifo_push (dyn_fifo_t *fifo, int value, int max_size) |
| Appends a new item to the queue end. | |
| int | dyn_fifo_value (dyn_fifo_t *fifo) |
| Returns and keeps the first item in the queue. | |
Possitive integer values only.
Definition in file dynamic_fifo.h.
1.4.7