64 return (one > two ? one - two : two - one) / self->
type_size;
size_t deque_capacity(const deque_t *self)
The maximum number of elements that can be stored.
size_t deque_count(const deque_t *self)
The number of elements currently held in the queue.
Realtime double-ended queues.
size_t deque_distance(const deque_t *self, const void *one, const void *two)
Number of elements in the range delimited by the two provided elements.
size_t deque_offset(const deque_t *self, size_t count)
The size in memory of count elements.
void * deque_pointer_before(const deque_t *self, void *pointer)
The previous slot.
void * deque_begin(const deque_t *self)
Pointer to the start of the underlying storage.
void * deque_end(const deque_t *self)
Pointer one-past-the-end of the underlying storage.
void * deque_pointer_after(const deque_t *self, void *pointer)
The next slot.
size_t deque_room(const deque_t *self)
The remaining number of elements that can be added.
size_t type_size
Size in bytes of a single element.
void * storage
Memory area.