1CK_HS_PUT(3) BSD Library Functions Manual CK_HS_PUT(3)
2
4 ck_hs_put — store unique key into a hash set
5
7 Concurrency Kit (libck, -lck)
8
10 #include <ck_hs.h>
11
12 bool
13 ck_hs_put(ck_hs_t *hs, unsigned long hash, const void *key);
14
16 The ck_hs_put(3) function will store the key specified by the key argu‐
17 ment in the hash set pointed to by the hs argument. The key specified by
18 key is expected to have the hash value specified by the hash argument
19 (which was previously generated using the CK_HS_HASH(3) macro).
20
21 If the call to ck_hs_put(3) was successful then the key specified by key
22 was successfully stored in the hash set pointed to by hs. The function
23 will fail if a key with an equivalent value to key is already present in
24 the hash set. For replacement semantics, please see the ck_hs_set(3)
25 function.
26
28 Upon successful completion, ck_hs_put(3) returns true and otherwise
29 returns false on failure.
30
32 Behavior is undefined if key or hs are uninitialized. The function will
33 also return false if the hash set could not be enlarged to accomodate key
34 insertion.
35
37 ck_hs_init(3), ck_hs_move(3), ck_hs_destroy(3), CK_HS_HASH(3),
38 ck_hs_iterator_init(3), ck_hs_next(3), ck_hs_put_unique(3), ck_hs_get(3),
39 ck_hs_set(3), ck_hs_fas(3), ck_hs_remove(3), ck_hs_grow(3),
40 ck_hs_rebuild(3), ck_hs_gc(3), ck_hs_count(3), ck_hs_reset(3),
41 ck_hs_reset_size(3), ck_hs_stat(3)
42
43 Additional information available at http://concurrencykit.org/
44
45 September 17, 2012