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.
unordered_map.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_UNORDERED_MAP_H
24 #define BKTHOMPS_CONTAINERS_UNORDERED_MAP_H
25 
26 #include "_bk_defines.h"
27 
32 typedef struct internal_unordered_map *unordered_map;
33 
34 /* Starting */
35 unordered_map unordered_map_init(size_t key_size,
36  size_t value_size,
37  unsigned long (*hash)(const void *const key),
38  int (*comparator)(const void *const one,
39  const void *const two));
40 
41 /* Utility */
45 
46 /* Accessing */
47 bk_err unordered_map_put(unordered_map me, void *key, void *value);
48 bk_bool unordered_map_get(void *value, unordered_map me, void *key);
51 
52 /* Ending */
55 
56 #endif /* BKTHOMPS_CONTAINERS_UNORDERED_MAP_H */
bk_bool unordered_map_contains(unordered_map me, void *key)
Definition: unordered_map.c:355
struct internal_unordered_map * unordered_map
Definition: containers.h:480
bk_err unordered_map_put(unordered_map me, void *key, void *value)
Definition: unordered_map.c:269
bk_err unordered_map_clear(unordered_map me)
Definition: unordered_map.c:419
struct internal_unordered_map * unordered_map
Definition: unordered_map.h:32
bk_err unordered_map_rehash(unordered_map me)
Definition: unordered_map.c:144
unordered_map unordered_map_destroy(unordered_map me)
Definition: unordered_map.c:450
size_t unordered_map_size(unordered_map me)
Definition: unordered_map.c:176
int bk_bool
Definition: containers.h:49
bk_bool unordered_map_is_empty(unordered_map me)
Definition: unordered_map.c:188
bk_bool unordered_map_get(void *value, unordered_map me, void *key)
Definition: unordered_map.c:328
bk_bool unordered_map_remove(unordered_map me, void *key)
Definition: unordered_map.c:380
unordered_map unordered_map_init(size_t key_size, size_t value_size, unsigned long(*hash)(const void *const key), int(*comparator)(const void *const one, const void *const two))
int bk_err
Definition: containers.h:48