Containers
This library provides various containers. Each container has utility functions to manipulate the data it holds. This is an abstraction as to not have to manually manage and reallocate memory.
queue.h
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2017-2020 Bailey Thompson
3  *
4  * Permission is hereby granted, free of charge, to any person obtaining a copy
5  * of this software and associated documentation files (the "Software"), to deal
6  * in the Software without restriction, including without limitation the rights
7  * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
8  * copies of the Software, and to permit persons to whom the Software is
9  * furnished to do so, subject to the following conditions:
10  *
11  * The above copyright notice and this permission notice shall be included in
12  * all copies or substantial portions of the Software.
13  *
14  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
15  * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
16  * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
17  * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
18  * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
19  * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
20  * SOFTWARE.
21  */
22 
23 #ifndef BKTHOMPS_CONTAINERS_QUEUE_H
24 #define BKTHOMPS_CONTAINERS_QUEUE_H
25 
26 #include "_bk_defines.h"
27 
32 typedef struct internal_deque *queue;
33 
34 /* Starting */
35 queue queue_init(size_t data_size);
36 
37 /* Utility */
38 size_t queue_size(queue me);
41 void queue_copy_to_array(void *arr, queue me);
42 
43 /* Adding */
44 bk_err queue_push(queue me, void *data);
45 
46 /* Removing */
47 bk_bool queue_pop(void *data, queue me);
48 
49 /* Getting */
50 bk_bool queue_front(void *data, queue me);
51 bk_bool queue_back(void *data, queue me);
52 
53 /* Ending */
56 
57 #endif /* BKTHOMPS_CONTAINERS_QUEUE_H */
bk_bool queue_front(void *data, queue me)
Definition: queue.c:140
struct internal_deque * queue
Definition: queue.h:32
bk_bool queue_is_empty(queue me)
Definition: queue.c:60
struct internal_deque * queue
Definition: containers.h:375
bk_err queue_push(queue me, void *data)
Definition: queue.c:106
void queue_copy_to_array(void *arr, queue me)
Definition: queue.c:87
bk_err queue_trim(queue me)
Definition: queue.c:73
bk_bool queue_pop(void *data, queue me)
Definition: queue.c:123
int bk_bool
Definition: containers.h:49
bk_err queue_clear(queue me)
Definition: queue.c:170
bk_bool queue_back(void *data, queue me)
Definition: queue.c:157
int bk_err
Definition: containers.h:48
queue queue_destroy(queue me)
Definition: queue.c:184
queue queue_init(size_t data_size)
Definition: queue.c:35
size_t queue_size(queue me)
Definition: queue.c:47