1CK_HS_GROW(3)            BSD Library Functions Manual            CK_HS_GROW(3)
2

NAME

4     ck_hs_grow — enlarge hash set capacity
5

LIBRARY

7     Concurrency Kit (libck, -lck)
8

SYNOPSIS

10     #include <ck_hs.h>
11
12     bool
13     ck_hs_grow(ck_hs_t *hs, unsigned long capacity);
14

DESCRIPTION

16     The ck_hs_grow(3) function will resize the hash set in order to be able
17     to store at least the number of entries specified by capacity at a load
18     factor of one. The default hash set load factor is 0.5. If you wish to
19     minimize the likelihood of memory allocations for a hash set meant to
20     store n entries, then specify a capacity of 2n. The default behavior of
21     ck_hs is to round capacity to the next power of two if it is not already
22     a power of two.
23

RETURN VALUES

25     Upon successful completion, ck_hs_grow(3) returns true and otherwise
26     returns false on failure.
27

ERRORS

29     Behavior is undefined if hs is uninitialized. This function will only
30     return false if there are internal memory allocation failures.
31

SEE ALSO

33     ck_hs_init(3), ck_hs_move(3), ck_hs_destroy(3), CK_HS_HASH(3),
34     ck_hs_iterator_init(3), ck_hs_next(3), ck_hs_get(3), ck_hs_put(3),
35     ck_hs_put_unique(3), ck_hs_set(3), ck_hs_fas(3), ck_hs_remove(3),
36     ck_hs_rebuild(3), ck_hs_gc(3), ck_hs_count(3), ck_hs_reset(3),
37     ck_hs_reset_size(3), ck_hs_stat(3)
38
39     Additional information available at http://concurrencykit.org/
40
41                              September 17, 2012
Impressum