CK_RHS_GROW(3) Library Functions Manual CK_RHS_GROW(3)

ck_rhs_growenlarge hash set capacity

Concurrency Kit (libck, -lck)

#include <ck_rhs.h>

bool
ck_rhs_grow(ck_rhs_t *hs, unsigned long capacity);

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

Upon successful completion, ck_rhs_grow(3) returns true and otherwise returns false on failure.

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

ck_rhs_init(3), ck_rhs_move(3), ck_rhs_destroy(3), CK_RHS_HASH(3), ck_rhs_iterator_init(3), ck_rhs_next(3), ck_rhs_get(3), ck_rhs_put(3), ck_rhs_put_unique(3), ck_rhs_set(3), ck_rhs_fas(3), ck_rhs_remove(3), ck_rhs_rebuild(3), ck_rhs_gc(3), ck_rhs_count(3), ck_rhs_reset(3), ck_rhs_reset_size(3), ck_rhs_stat(3)

Additional information available at http://concurrencykit.org/

September 17, 2012