1CK_HT_NEXT(3) BSD Library Functions Manual CK_HT_NEXT(3)
2
4 ck_ht_next — iterate to next entry in hash table
5
7 Concurrency Kit (libck, -lck)
8
10 #include <ck_ht.h>
11
12 bool
13 ck_ht_next(ck_ht_t *ht, ck_ht_iterator_t *iterator,
14 ck_ht_entry_t **entry);
15
17 The ck_ht_next() function will increment the iterator object pointed to
18 by iterator to point to the next non-empty hash table entry. If
19 ck_ht_next() returns true then the pointer pointed to by entry is ini‐
20 tialized to the current hash table entry pointed to by the iterator
21 object.
22
23 It is expected that iterator has been initialized using the
24 ck_ht_iterator_init(3) function or statically initialized using
25 CK_HT_ITERATOR_INITIALIZER.
26
28 If ck_ht_next() returns true then the object pointed to by entry points
29 to a valid hash table entry. If ck_ht_next() returns false then value of
30 the object pointed to by entry is undefined.
31
33 Behavior is undefined if iterator or ht are uninitialized.
34
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_remove_spmc(3),
39 ck_ht_count(3), ck_ht_reset_spmc(3), ck_ht_reset_size_spmc(3),
40 ck_ht_entry_empty(3), ck_ht_entry_key_set(3),
41 ck_ht_entry_key_set_direct(3), ck_ht_entry_key_length(3),
42 ck_ht_entry_key(3), ck_ht_entry_set(3), ck_ht_entry_set_direct(3),
43 ck_ht_entry_key_direct(3), ck_ht_entry_value(3),
44 ck_ht_entry_value_direct(3), ck_ht_iterator_init(3)
45
46 Additional information available at http://concurrencykit.org/
47
48 March 30, 2012