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

NAME

4     ck_ht_remove_spmc — resize a hash table if necessary
5

LIBRARY

7     Concurrency Kit (libck, -lck)
8

SYNOPSIS

10     #include <ck_ht.h>
11
12     bool
13     ck_ht_remove_spmc(ck_ht_t *ht, ck_ht_hash_t h, ck_ht_entry_t *entry);
14

DESCRIPTION

16     The ck_ht_remove_spmc() function will remove the key-value pair associ‐
17     ated with the key specified by the entry argument.
18
19     If ht was created with CK_HT_MODE_BYTESTRING then entry must have been
20     initialized with the ck_ht_entry_set_key(3) or ck_ht_entry_set(3) func‐
21     tions. If ht was created with CK_HT_MODE_DIRECT then entry must have been
22     initialized with the ck_ht_entry_key_set_direct(3) or
23     ck_ht_entry_set_direct(3) functions.
24
25     It is expected that h was initialized with ck_ht_hash(3) if ht was cre‐
26     ated with CK_HT_MODE_BYTESTRING. If ht was initialized with
27     CK_HT_MODE_DIRECT then it is expected that h was initialized with the
28     ck_ht_hash_direct(3) function.
29

RETURN VALUES

31     If successful, entry will contain the key-value pair that was found in
32     the hash table and ck_ht_remove_spmc() will return true. If the entry
33     could not be found then ck_ht_remove_spmc() will return false.
34

SEE ALSO

36     ck_ht_stat(3), ck_ht_init(3), ck_ht_destroy(3), ck_ht_hash(3),
37     ck_ht_hash_direct(3), ck_ht_set_spmc(3), ck_ht_put_spmc(3), ck_ht_gc(3),
38     ck_ht_get_spmc(3), ck_ht_grow_spmc(3), ck_ht_reset_spmc(3),
39     ck_ht_reset_size_spmc(3), ck_ht_count(3), ck_ht_entry_empty(3),
40     ck_ht_entry_key_set(3), ck_ht_entry_key_set_direct(3),
41     ck_ht_entry_key(3), ck_ht_entry_key_length(3), ck_ht_entry_value(3),
42     ck_ht_entry_set(3), ck_ht_entry_set_direct(3), ck_ht_entry_key_direct(3),
43     ck_ht_entry_value_direct(3), ck_ht_iterator_init(3), ck_ht_next(3)
44
45     Additional information available at http://concurrencykit.org/
46
47                                March 29, 2012
Impressum