3.2. [-] fx_test_queue¶

#include <fx_test/queue.h>
// in libfx_test

void fx_test_queue_init(fx_test_queue_t *q, size_t cap);
// initialize queue

void fx_test_queue_free(fx_test_queue_t *q);
// release resources which uses by queue

void fx_test_queue_push(fx_test_queue_t *q, void *item);
// add item into back of queue

void *fx_test_queue_front(fx_test_queue_t *q);
// get item in front of queue

void fx_test_queue_pop(fx_test_queue_t *q);
// remove an item in front of queue

void fx_test_queue_clear(fx_test_queue_t *q);
// make queue is empty

bool fx_test_queue_empty(fx_test_queue_t *q);
// check queue is empty or not

bool fx_test_queue_full(fx_test_queue_t *q);
// check queue is full or not

// target: initialize, push, front, pop and free queue

#include <fx_test/queue.h>              // use queue APIs

fx_test_queue_t q;                      // initialize
fx_test_queue_init(&q, 128);

int one = 1;
int two = 2;
int three = 3;
fx_test_queue_push(&q, &one);           // push items to front
fx_test_queue_push(&q, &two);
fx_test_queue_push(&q, &three);

int *item;
item = fx_test_queue_front(&q);         // get front item
fx_test_queue_pop(&q);                  // remove front item

fx_test_free(&q);                       // release resources