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_multiset.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_MULTISET_H
24 #define BKTHOMPS_CONTAINERS_UNORDERED_MULTISET_H
25 
26 #include "_bk_defines.h"
27 
32 typedef struct internal_unordered_multiset *unordered_multiset;
33 
34 /* Starting */
36 unordered_multiset_init(size_t key_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 */
48 size_t unordered_multiset_count(unordered_multiset me, void *key);
52 
53 /* Ending */
56 
57 #endif /* BKTHOMPS_CONTAINERS_UNORDERED_MULTISET_H */
unordered_multiset unordered_multiset_destroy(unordered_multiset me)
Definition: unordered_multiset.c:511
bk_bool unordered_multiset_remove(unordered_multiset me, void *key)
Definition: unordered_multiset.c:373
bk_err unordered_multiset_rehash(unordered_multiset me)
Definition: unordered_multiset.c:140
bk_err unordered_multiset_clear(unordered_multiset me)
Definition: unordered_multiset.c:478
bk_err unordered_multiset_put(unordered_multiset me, void *key)
Definition: unordered_multiset.c:263
size_t unordered_multiset_size(unordered_multiset me)
Definition: unordered_multiset.c:172
struct internal_unordered_multiset * unordered_multiset
Definition: containers.h:555
bk_bool unordered_multiset_remove_all(unordered_multiset me, void *key)
Definition: unordered_multiset.c:433
int bk_bool
Definition: containers.h:49
int bk_err
Definition: containers.h:48
size_t unordered_multiset_count(unordered_multiset me, void *key)
Definition: unordered_multiset.c:327
bk_bool unordered_multiset_is_empty(unordered_multiset me)
Definition: unordered_multiset.c:184
struct internal_unordered_multiset * unordered_multiset
Definition: unordered_multiset.h:32
bk_bool unordered_multiset_contains(unordered_multiset me, void *key)
Definition: unordered_multiset.c:355
unordered_multiset unordered_multiset_init(size_t key_size, unsigned long(*hash)(const void *const key), int(*comparator)(const void *const one, const void *const two))