Dynamic first in first out positive integer queue. More...
#include <dynamic_fifo.h>
Data Fields | |
| int * | items |
| Stored item field. | |
| int | size |
| Actual field size. | |
| int | head |
| First item in the queue index. | |
| int | tail |
| Last item in the queue index. | |
| int | magic_value |
| Consistency check magic value. | |
Dynamic first in first out positive integer queue.
Possitive integer values only. The queue automatically resizes if needed.
| int dyn_fifo::head |
First item in the queue index.
| int* dyn_fifo::items |
Stored item field.
Consistency check magic value.
Referenced by dyn_fifo_is_valid().
| int dyn_fifo::size |
Actual field size.
| int dyn_fifo::tail |
Last item in the queue index.
1.6.1