Linked Queue API
#include "src/btstack_linked_queue.h"
typedef struct {
btstack_linked_item_t * head;
btstack_linked_item_t * tail;
} btstack_linked_queue_t;
btstack_linked_queue_empty
bool btstack_linked_queue_empty(btstack_linked_queue_t * queue);
Tests if queue is empty
Returns
- bool: true if emtpy
btstack_linked_queue_enqueue
void btstack_linked_queue_enqueue(btstack_linked_queue_t * queue, btstack_linked_item_t * item);
Append item to queue
Parameters
- queue
- item
btstack_linked_queue_dequeue
btstack_linked_item_t * btstack_linked_queue_dequeue(btstack_linked_queue_t * queue);
Pop next item from queue
Parameters
- queue
Returns
- btstack_linked_item_t *: item or NULL if queue empty
btstack_linked_queue_first
btstack_linked_item_t * btstack_linked_queue_first(btstack_linked_queue_t * queue);
Get first item from queue
Parameters
- queue
Returns
- btstack_linked_item_t *: item or NULL if queue empty