![]() |
O2S C Library 1.8.2
Provide high-level data-structures and other fundamental tools for C projects
|
Expose the state of a deque. More...
Go to the source code of this file.
Functions | |
| size_t | deque_count (const deque_t *self) |
| The number of elements currently held in the queue. | |
| size_t | deque_capacity (const deque_t *self) |
| The maximum number of elements that can be stored. | |
| void * | deque_first (const deque_t *self) |
| The current first element in the queue. | |
| void * | deque_last (const deque_t *self) |
| The current last element in the queue. | |
| bool | deque_is_empty (const deque_t *self) |
| True if no elements are currently stored. | |
| bool | deque_is_full (const deque_t *self) |
| True if the queue reached its maximum capacity. | |
| void * | deque_get (const deque_t *self, size_t index) |
| The element of the element at an arbitrary index. | |
Expose the state of a deque.
Definition in file getters.c.
| void * deque_first | ( | const deque_t * | self | ) |
| void * deque_get | ( | const deque_t * | self, |
| size_t | index ) |