vl_deque.h

Go to the documentation of this file.

 
#ifndef VL_DEQUE_H
#define VL_DEQUE_H
 
#include "vl_pool.h"
 
typedef struct
{
    vl_pool nodes; // pool nodes
    vl_dsidx_t totalElements; // total elements in the deque
    vl_uint16_t elementSize; // size of a single element, in bytes.
    vl_pool_idx head; // first element
    vl_pool_idx tail; // last element
} vl_deque;
 
VL_API void vlDequeInit(vl_deque* deq, vl_uint16_t elementSize);
 
VL_API void vlDequeFree(vl_deque* deq);
 
VL_API vl_deque* vlDequeNew(vl_uint16_t elementSize);
 
VL_API void vlDequeDelete(vl_deque* deq);
 
VL_API void vlDequeClear(vl_deque* deq);
 
VL_API void vlDequeReserve(vl_deque* deque, vl_dsidx_t n);
 
VL_API vl_deque* vlDequeClone(const vl_deque* src, vl_deque* dest);
 
static inline vl_dsidx_t vlDequeSize(vl_deque* deq) { return deq->totalElements; }
 
VL_API void vlDequePushFront(vl_deque* deq, const void* val);
 
VL_API int vlDequePopFront(vl_deque* deq, void* val);
 
VL_API void vlDequePushBack(vl_deque* deq, const void* val);
 
VL_API int vlDequePopBack(vl_deque* deq, void* val);
 
#endif // VL_DEQUE_H