O2S C Library 1.8.2
Provide high-level data-structures and other fundamental tools for C projects
Loading...
Searching...
No Matches
private.h
Go to the documentation of this file.
1#pragma once
2
3/* ************************************************************************** */
4/* ____ _ _____ ____ _ _ _ _____ _ _ ____ ____ */
5/* / ___| / \ | ___| _ \ / \ | \ | | |_ _| || | | _ \/ ___| */
6/* \___ \ / _ \ | |_ | |_) | / _ \ | \| | | | | || |_| | | \___ \ */
7/* ___) / ___ \| _| | _ < / ___ \| |\ | | | |__ _| |_| |___) | */
8/* |____/_/ \_|_| |_| \_/_/ \_|_| \_| |_| |_| |____/|____/ */
9/* */
17/* ************************************************************************** */
18
19#include "o2s/deque.h"
20
21void* deque_begin(const deque_t* self);
22void* deque_end(const deque_t* self);
23
24size_t deque_offset(const deque_t* self, size_t count);
25size_t deque_distance(const deque_t* self, const void* one, const void* two);
26
27void* deque_pointer_before(const deque_t* self, void* pointer);
28void* deque_pointer_after(const deque_t* self, void* pointer);
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.
Definition internals.c:62
size_t deque_offset(const deque_t *self, size_t count)
The size in memory of count elements.
Definition internals.c:21
void * deque_pointer_before(const deque_t *self, void *pointer)
The previous slot.
Definition internals.c:54
void * deque_begin(const deque_t *self)
Pointer to the start of the underlying storage.
Definition internals.c:33
void * deque_end(const deque_t *self)
Pointer one-past-the-end of the underlying storage.
Definition internals.c:39
void * deque_pointer_after(const deque_t *self, void *pointer)
The next slot.
Definition internals.c:45
Realtime double-ended queues.
Double-ended queue.
Definition deque.h:27