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.
priority_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_PRIORITY_QUEUE_H
24 #define BKTHOMPS_CONTAINERS_PRIORITY_QUEUE_H
25 
26 #include "_bk_defines.h"
27 
32 typedef struct internal_priority_queue *priority_queue;
33 
34 /* Starting */
35 priority_queue priority_queue_init(size_t data_size,
36  int (*comparator)(const void *const one,
37  const void *const two));
38 
39 /* Utility */
42 
43 /* Adding */
45 
46 /* Removing */
48 
49 /* Getting */
51 
52 /* Ending */
55 
56 #endif /* BKTHOMPS_CONTAINERS_PRIORITY_QUEUE_H */
bk_err priority_queue_push(priority_queue me, void *data)
Definition: priority_queue.c:104
bk_bool priority_queue_front(void *data, priority_queue me)
Definition: priority_queue.c:219
struct internal_priority_queue * priority_queue
Definition: priority_queue.h:32
priority_queue priority_queue_destroy(priority_queue me)
Definition: priority_queue.c:246
struct internal_priority_queue * priority_queue
Definition: containers.h:341
bk_bool priority_queue_is_empty(priority_queue me)
Definition: priority_queue.c:85
bk_err priority_queue_clear(priority_queue me)
Definition: priority_queue.c:232
bk_bool priority_queue_pop(void *data, priority_queue me)
Definition: priority_queue.c:152
int bk_bool
Definition: containers.h:49
priority_queue priority_queue_init(size_t data_size, int(*comparator)(const void *const one, const void *const two))
int bk_err
Definition: containers.h:48
size_t priority_queue_size(priority_queue me)
Definition: priority_queue.c:73