1CK_HS_FAS(3) BSD Library Functions Manual CK_HS_FAS(3)
2
4 ck_hs_fas — fetch and store key in hash set
5
7 Concurrency Kit (libck, -lck)
8
10 #include <ck_hs.h>
11
12 bool
13 ck_hs_fas(ck_hs_t *hs, unsigned long hash, const void *key,
14 void **previous);
15
17 The ck_hs_fas(3) function will fetch and store the key specified by the
18 key argument in the hash set pointed to by the hs argument. The key spec‐
19 ified by key is expected to have the hash value specified by the hash
20 argument (which was previously generated using the CK_HS_HASH(3) macro).
21
22 If the call to ck_hs_fas(3) was successful then the key specified by key
23 was successfully stored in the hash set pointed to by hs. The key must
24 already exist in the hash set, and is replaced by key and the previous
25 value is stored into the void pointer pointed to by the previous argu‐
26 ment. If the key does not exist in the hash set then the function will
27 return false and the hash set is unchanged. This function is guaranteed
28 to be stable with respect to memory usage.
29
31 Upon successful completion, ck_hs_fas(3) returns true and otherwise
32 returns false on failure.
33
35 Behavior is undefined if key or hs are uninitialized.
36
38 ck_hs_init(3), ck_hs_move(3), ck_hs_destroy(3), CK_HS_HASH(3),
39 ck_hs_iterator_init(3), ck_hs_next(3), ck_hs_get(3), ck_hs_put(3),
40 ck_hs_put_unique(3), ck_hs_remove(3), ck_hs_grow(3), ck_hs_rebuild(3),
41 ck_hs_gc(3), ck_hs_count(3), ck_hs_reset(3), ck_hs_reset_size(3),
42 ck_hs_stat(3)
43
44 Additional information available at http://concurrencykit.org/
45
46 June 20, 2013