vl_queue.h

Go to the documentation of this file.

 
#ifndef VL_QUEUE_H
#define VL_QUEUE_H
 
#include "vl_pool.h"
 
typedef struct
{
    vl_pool nodes; // pool nodes
    vl_dsidx_t totalElements; // total elements in the queue.
    vl_uint16_t elementSize; // size of a single element, in bytes.
    vl_pool_idx head; // first element
    vl_pool_idx tail; // last element
} vl_queue;
 
VL_API void vlQueueInit(vl_queue* queue, vl_uint16_t elementSize);
 
VL_API void vlQueueFree(vl_queue* queue);
 
VL_API vl_queue* vlQueueNew(vl_uint16_t elementSize);
 
VL_API void vlQueueDelete(vl_queue* queue);
 
VL_API vl_queue* vlQueueClone(const vl_queue* src, vl_queue* dest);
 
VL_API void vlQueueReserve(vl_queue* queue, vl_dsidx_t n);
 
VL_API void vlQueueClear(vl_queue* queue);
 
VL_API void vlQueuePushBack(vl_queue* queue, const void* element);
 
VL_API int vlQueuePopFront(vl_queue* queue, void* element);
 
static inline vl_dsidx_t vlQueueSize(vl_queue* queue) { return queue->totalElements; }
 
#endif // VL_QUEUE_H