28 typedef struct _cx_deque_ cx_deque;
 
   30 typedef cxsize cx_deque_const_iterator;
 
   31 typedef cxsize cx_deque_iterator;
 
   55 cxptr 
cx_deque_assign(cx_deque *deque, cx_deque_iterator position, cxptr data);
 
   63 cxptr 
cx_deque_get(
const cx_deque *deque, cx_deque_const_iterator position);
 
   72                                 cx_deque_const_iterator position);
 
   74                                     cx_deque_const_iterator position);
 
   85 cx_deque_iterator 
cx_deque_insert(cx_deque *deque, cx_deque_iterator position,
 
   87 cx_deque_iterator 
cx_deque_erase(cx_deque *deque, cx_deque_iterator position,
 
   88                                  cx_free_func deallocate);
 
  109                      cx_deque *other, cx_deque_iterator start,
 
  110                      cx_deque_iterator end);
 
  111 void cx_deque_merge(cx_deque *deque, cx_deque *other, cx_compare_func compare);
 
  112 void cx_deque_sort(cx_deque *deque, cx_compare_func compare);
 
void cx_deque_remove(cx_deque *deque, cxcptr data)
Remove all elements with a given value from a deque. 
Definition: cxdeque.c:1474
cxsize cx_deque_max_size(const cx_deque *deque)
Get the maximum number of deque elements possible. 
Definition: cxdeque.c:929
void cx_deque_unique(cx_deque *deque, cx_compare_func compare)
Remove duplicates of consecutive elements. 
Definition: cxdeque.c:1519
cx_deque_iterator cx_deque_erase(cx_deque *deque, cx_deque_iterator position, cx_free_func deallocate)
Erase a deque element. 
Definition: cxdeque.c:1383
cxptr cx_deque_extract(cx_deque *deque, cx_deque_iterator position)
Extract a deque element. 
Definition: cxdeque.c:1447
cxsize cx_deque_size(const cx_deque *deque)
Get the actual number of deque elements. 
Definition: cxdeque.c:885
cxptr cx_deque_pop_back(cx_deque *deque)
Remove the last deque element. 
Definition: cxdeque.c:1309
void cx_deque_sort(cx_deque *deque, cx_compare_func compare)
Sort all elements of a deque using the given comparison function. 
Definition: cxdeque.c:1657
cx_deque_iterator cx_deque_next(const cx_deque *deque, cx_deque_const_iterator position)
Get an iterator for the next deque element. 
Definition: cxdeque.c:1150
cx_deque * cx_deque_new(void)
Create a new deque without any elements. 
Definition: cxdeque.c:795
void cx_deque_merge(cx_deque *deque, cx_deque *other, cx_compare_func compare)
Merge two sorted deques. 
Definition: cxdeque.c:1625
void cx_deque_push_front(cx_deque *deque, cxcptr data)
Insert data at the beginning of a deque. 
Definition: cxdeque.c:1203
cxptr cx_deque_get(const cx_deque *deque, cx_deque_const_iterator position)
Retrieve an element from a deque. 
Definition: cxdeque.c:1075
cxptr cx_deque_assign(cx_deque *deque, cx_deque_iterator position, cxptr data)
Assign data to a deque element. 
Definition: cxdeque.c:996
void cx_deque_destroy(cx_deque *deque, cx_free_func deallocate)
Destroy a deque and all its elements. 
Definition: cxdeque.c:847
void cx_deque_push_back(cx_deque *deque, cxcptr data)
Append data at the end of a deque. 
Definition: cxdeque.c:1268
void cx_deque_delete(cx_deque *deque)
Destroy a deque. 
Definition: cxdeque.c:819
cx_deque_iterator cx_deque_insert(cx_deque *deque, cx_deque_iterator position, cxcptr data)
Insert data into a deque at a given iterator position. 
Definition: cxdeque.c:1339
cx_deque_iterator cx_deque_end(const cx_deque *deque)
Get an iterator for the position after the last deque element. 
Definition: cxdeque.c:1125
cxptr cx_deque_front(const cx_deque *deque)
Get the first element of a deque. 
Definition: cxdeque.c:1026
cxptr cx_deque_pop_front(cx_deque *deque)
Remove the first deque element. 
Definition: cxdeque.c:1238
cxbool cx_deque_empty(const cx_deque *deque)
Check whether a deque is empty. 
Definition: cxdeque.c:907
void cx_deque_splice(cx_deque *deque, cx_deque_iterator position, cx_deque *other, cx_deque_iterator start, cx_deque_iterator end)
Move a range of elements in front of a given position. 
Definition: cxdeque.c:1572
cx_deque_iterator cx_deque_begin(const cx_deque *deque)
Get an iterator for the first deque element. 
Definition: cxdeque.c:1102
cxptr cx_deque_back(const cx_deque *deque)
Get the last element of a deque. 
Definition: cxdeque.c:1050
void cx_deque_clear(cx_deque *deque)
Remove all elements from a deque. 
Definition: cxdeque.c:1422
void cx_deque_reverse(cx_deque *deque)
Reverse the order of all deque elements. 
Definition: cxdeque.c:1681
void cx_deque_swap(cx_deque *deque, cx_deque *other)
Swap the data of two deques. 
Definition: cxdeque.c:953
cx_deque_iterator cx_deque_previous(const cx_deque *deque, cx_deque_const_iterator position)
Get an iterator for the previous deque element. 
Definition: cxdeque.c:1175