reactor-c 1.0
C Runtime for Lingua Franca
Loading...
Searching...
No Matches
deque.h
Go to the documentation of this file.
1
40
41#ifndef DEQUE_H
42#define DEQUE_H
43
44#include <stddef.h> // Defines size_t
45#include <stdbool.h> // Defines bool
46#include <stdlib.h> // Defines malloc and free
47
52typedef struct deque_t {
53 struct deque_node_t* front;
54 struct deque_node_t* back;
55 size_t size;
56} deque_t;
57
64void deque_initialize(deque_t* d);
65
72bool deque_is_empty(deque_t* d);
73
81size_t deque_size(deque_t* d);
82
90void deque_push_front(deque_t* d, void* value);
91
99void deque_push_back(deque_t* d, void* value);
100
108void* deque_pop_front(deque_t* d);
109
117void* deque_pop_back(deque_t* d);
118
126void* deque_peek_back(deque_t* d);
127
135void* deque_peek_front(deque_t* d);
136
137#endif // DEQUE_H
deque_initialize
void deque_initialize(deque_t *d)
Initialize the specified deque to an empty deque.
deque_push_front
void deque_push_front(deque_t *d, void *value)
Push a value to the front of the queue.
deque_peek_back
void * deque_peek_back(deque_t *d)
Peek at the value on the front of the queue, leaving it on the queue.
deque_pop_front
void * deque_pop_front(deque_t *d)
Pop a value from the front of the queue, removing it from the queue.
deque_peek_front
void * deque_peek_front(deque_t *d)
Peek at the value on the back of the queue, leaving it on the queue.
deque_pop_back
void * deque_pop_back(deque_t *d)
Pop a value from the back of the queue, removing it from the queue.
deque_push_back
void deque_push_back(deque_t *d, void *value)
Push a value to the back of the queue.
deque_is_empty
bool deque_is_empty(deque_t *d)
Return true if the queue is empty.
deque_size
size_t deque_size(deque_t *d)
Return the size of the queue.
deque_t
A double-ended queue data structure.
Definition deque.h:52
deque_t::back
struct deque_node_t * back
Definition deque.h:54
deque_t::size
size_t size
Definition deque.h:55
deque_t::front
struct deque_node_t * front
Definition deque.h:53