1CK_RHS_REBUILD(3) BSD Library Functions Manual CK_RHS_REBUILD(3)
2
4 ck_rhs_rebuild — rebuild a hash set
5
7 Concurrency Kit (libck, -lck)
8
10 #include <ck_rhs.h>
11
12 bool
13 ck_rhs_rebuild(ck_rhs_t *hs);
14
16 The ck_rhs_rebuild(3) function will regenerate the hash set pointed to by
17 hs. This has the side-effect of pruning degradatory side-effects of
18 workloads that are delete heavy. The regenerated hash set should have
19 shorter probe sequences on average. This operation will require a signif‐
20 icant amount of memory and is free to allocate a duplicate hash set in
21 the rebuild process.
22
24 Upon successful completion, ck_rhs_rebuild(3) returns true and otherwise
25 returns false on failure.
26
28 This function will only return false if there are internal memory alloca‐
29 tion failures.
30
32 ck_rhs_init(3), ck_rhs_move(3), ck_rhs_destroy(3), CK_RHS_HASH(3),
33 ck_rhs_iterator_init(3), ck_rhs_next(3), ck_rhs_get(3), ck_rhs_put(3),
34 ck_rhs_put_unique(3), ck_rhs_set(3), ck_rhs_fas(3), ck_rhs_gc(3),
35 ck_rhs_grow(3), ck_rhs_remove(3), ck_rhs_count(3), ck_rhs_reset(3),
36 ck_rhs_reset_size(3), ck_rhs_stat(3)
37
38 Additional information available at http://concurrencykit.org/
39
40 December 7, 2013