|
LAR Library
1.14
|
A double-ended queue of void* elements.
More...
#include <larlib/base.h>
Go to the source code of this file.
Typedefs | |
| typedef struct deque_t | deque_t |
| Opaque type for a double-ended queue. More... | |
Functions | |
| deque_t * | dequeCreate (int sizeHint) |
Create a new deque with space reserved for at least sizeHint elements. More... | |
| void | dequeDestroy (deque_t *d) |
| Destroy a deque created with dequeCreate(). More... | |
| int | dequePushBack (deque_t *d, void *p) |
| Add an element to the "back" of a deque. More... | |
| int | dequePopBack (deque_t *d) |
| Remove the last element of a queue. More... | |
| int | dequePushFront (deque_t *d, void *p) |
| Add an element on the "back" of a deque. More... | |
| int | dequePopFront (deque_t *d) |
| Remove the last element of a queue. More... | |
| int | dequeLength (const deque_t *d) |
| Return the number of elements inside a deque. More... | |
| void * | dequeGet (const deque_t *d, int i) |
| Return the i'th element on a queue. More... | |
| void * | dequeGetFront (const deque_t *d) |
| Return the first element on a deque. More... | |
| void * | dequeGetBack (const deque_t *d) |
| Return the last element on a deque. More... | |
| void * | dequeSet (deque_t *d, int i, void *p) |
| Change the value of the i'th element on a deque. More... | |
| int | dequeInsert (deque_t *d, int i, void *p) |
| Insert an element at any position inside the deque. More... | |
| int | dequeRemove (deque_t *d, int i) |
| Remove an element at any position inside the deque. More... | |
Detailed Description
A double-ended queue of void* elements.
Generated on Mon Mar 27 2017 15:42:52 for LAR Library by
1.8.9.1