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

NAME

4     ck_hs_put_unique — unconditionally store unique key into a hash set
5

LIBRARY

7     Concurrency Kit (libck, -lck)
8

SYNOPSIS

10     #include <ck_hs.h>
11
12     bool
13     ck_hs_put_unique(ck_hs_t *hs, unsigned long hash, const void *key);
14

DESCRIPTION

16     The ck_hs_put_unique(3) function will store the key specified by the key
17     argument in the hash set pointed to by the hs argument. The key specified
18     by 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 cause undefined behavior if a key with an equivalent value is
24     already present in the hash set. For replacement semantics, please see
25     the ck_hs_set(3) function.
26

RETURN VALUES

28     Upon successful completion, ck_hs_put_unique(3) returns true and other‐
29     wise returns false on failure.
30

ERRORS

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. The function will result in undefined behavior if called for
35     an already inserted key value.
36

SEE ALSO

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_set(3), ck_hs_fas(3), ck_hs_remove(3), ck_hs_grow(3),
41     ck_hs_rebuild(3), ck_hs_gc(3), ck_hs_count(3), ck_hs_reset(3),
42     ck_hs_reset_size(3), ck_hs_stat(3)
43
44     Additional information available at http://concurrencykit.org/
45
46                               December 7, 2013
Impressum