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

NAME

4     ck_rhs_next — iterate to next entry in hash set
5

LIBRARY

7     Concurrency Kit (libck, -lck)
8

SYNOPSIS

10     #include <ck_rhs.h>
11
12     bool
13     ck_rhs_next(ck_rhs_t *hs, ck_rhs_iterator_t *iterator, void **entry);
14

DESCRIPTION

16     The ck_rhs_next(3) function will increment the iterator object pointed to
17     by iterator to point to the next non-empty hash set entry. If
18     ck_rhs_next(3) returns true then the pointer pointed to by entry is ini‐
19     tialized to the current hash set key pointed to by the iterator object.
20
21     It is expected that iterator has been initialized using the
22     ck_rhs_iterator_init(3) function or statically initialized using
23     CK_RHS_ITERATOR_INITIALIZER.
24

RETURN VALUES

26     If ck_rhs_next(3) returns true then the object pointed to by entry points
27     to a valid hash set key. If ck_rhs_next(3) returns false then the value
28     of the object pointed to by entry is undefined.
29

ERRORS

31     Behavior is undefined if iterator or hs are uninitialized.
32

SEE ALSO

34     ck_rhs_init(3), ck_rhs_move(3), ck_rhs_destroy(3), CK_RHS_HASH(3),
35     ck_rhs_iterator_init(3), ck_rhs_get(3), ck_rhs_put(3),
36     ck_rhs_put_unique(3), ck_rhs_set(3), ck_rhs_fas(3), ck_rhs_remove(3),
37     ck_rhs_grow(3), ck_rhs_rebuild(3), ck_rhs_gc(3), ck_rhs_count(3),
38     ck_rhs_reset(3), ck_rhs_reset_size(3), ck_rhs_stat(3)
39
40     Additional information available at http://concurrencykit.org/
41
42                              September 17, 2012
Impressum