151 "The queue contains %u elements with a capacity of %u.\n",
156 for (int32_t i = 0; i <
queue->
size; i++)
158 printf(
"Index: %d, Value %f\n", i,
queue->
data[i]);
165 uint32_t capacity = 4u;
queue_value_t BackQueue(myqueue_t *queue)
Last element of the Queue.
void PrintQueue(myqueue_t *queue)
Print the whole queue.
void PushQueue(myqueue_t *queue, queue_value_t value)
Put new data in the Queue object.
myqueue_t * FreeQueue(myqueue_t *queue)
Delete Queue object.
bool QueueIsEmpty(myqueue_t *queue)
Check if Queue is empty.
myqueue_t * CreateQueue(uint32_t capacity)
Create a Queue object.
queue_value_t PopQueue(myqueue_t *queue)
Delete data from Queue object.
queue_value_t FrontQueue(myqueue_t *queue)
First value of the Queue.
bool QueueIsFull(myqueue_t *queue)
Check if Queue is full.