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.
deque.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_DEQUE_H
24 #define BKTHOMPS_CONTAINERS_DEQUE_H
25 
26 #include "_bk_defines.h"
27 
31 typedef struct internal_deque *deque;
32 
33 /* Starting */
34 deque deque_init(size_t data_size);
35 
36 /* Utility */
37 size_t deque_size(deque me);
40 void deque_copy_to_array(void *arr, deque me);
41 bk_err deque_add_all(deque me, void *arr, size_t size);
42 
43 /* Adding */
44 bk_err deque_push_front(deque me, void *data);
45 bk_err deque_push_back(deque me, void *data);
46 
47 /* Removing */
48 bk_err deque_pop_front(void *data, deque me);
49 bk_err deque_pop_back(void *data, deque me);
50 
51 /* Setting */
52 bk_err deque_set_first(deque me, void *data);
53 bk_err deque_set_at(deque me, size_t index, void *data);
54 bk_err deque_set_last(deque me, void *data);
55 
56 /* Getting */
57 bk_err deque_get_first(void *data, deque me);
58 bk_err deque_get_at(void *data, deque me, size_t index);
59 bk_err deque_get_last(void *data, deque me);
60 
61 /* Ending */
64 
65 #endif /* BKTHOMPS_CONTAINERS_DEQUE_H */
bk_err deque_set_at(deque me, size_t index, void *data)
Definition: deque.c:517
bk_err deque_add_all(deque me, void *arr, size_t size)
Definition: deque.c:211
bk_err deque_get_first(void *data, deque me)
Definition: deque.c:561
bk_err deque_get_last(void *data, deque me)
Definition: deque.c:606
bk_err deque_get_at(void *data, deque me, size_t index)
Definition: deque.c:580
bk_err deque_set_last(deque me, void *data)
Definition: deque.c:543
bk_err deque_push_front(deque me, void *data)
Definition: deque.c:293
bk_err deque_pop_back(void *data, deque me)
Definition: deque.c:471
size_t deque_size(deque me)
Definition: deque.c:101
int bk_bool
Definition: containers.h:49
struct internal_deque * deque
Definition: deque.h:31
bk_bool deque_is_empty(deque me)
Definition: deque.c:113
struct internal_deque * deque
Definition: containers.h:87
bk_err deque_pop_front(void *data, deque me)
Definition: deque.c:443
int bk_err
Definition: containers.h:48
deque deque_destroy(deque me)
Definition: deque.c:656
bk_err deque_set_first(deque me, void *data)
Definition: deque.c:498
bk_err deque_clear(deque me)
Definition: deque.c:619
void deque_copy_to_array(void *arr, deque me)
Definition: deque.c:167
deque deque_init(size_t data_size)
Definition: deque.c:51
bk_err deque_push_back(deque me, void *data)
Definition: deque.c:372
bk_err deque_trim(deque me)
Definition: deque.c:127