vl_queue.h

Go to the documentation of this file.

#ifndef VL_QUEUE_H
#define VL_QUEUE_H
 
#include "vl_linear_pool.h"
 
typedef struct{
    vl_linearpool         nodes;        //pool nodes
    vl_memsize_t    elementSize;        //size of a single element, in bytes.
    vl_linearpool_idx     head;         //first element
    vl_linearpool_idx     tail;         //last element
} vl_queue;
 
void        vlQueueInit(vl_queue* queue, vl_memsize_t elementSize);
 
void        vlQueueFree(vl_queue* queue);
 
vl_queue*   vlQueueNew(vl_memsize_t elementSize);
 
void        vlQueueDelete(vl_queue* queue);
 
vl_queue*        vlQueueClone(const vl_queue* src, vl_queue* dest);
 
void vlQueueReserve(vl_queue* queue, vl_memsize_t n);
 
void        vlQueueClear(vl_queue* queue);
 
void        vlQueuePushBack(vl_queue* queue, const void* element);
 
int         vlQueuePopFront(vl_queue* queue, void* element);
 
vl_dsidx_t      vlQueueSize(vl_queue* queue);
 
#endif //VL_QUEUE_H