ck_rhs_next — iterate to next entry in hash set

       The  ck_rhs_next(3)  function  will  increment the iterator object pointed to by iterator to point to the
       next non-empty hash set entry. If ck_rhs_next(3) returns true then the pointer pointed  to  by  entry  is
       initialized to the current hash set key pointed to by the iterator object.

       It  is  expected  that  iterator  has  been  initialized  using  the  ck_rhs_iterator_init(3) function or
       statically initialized using CK_RHS_ITERATOR_INITIALIZER.

       Behavior is undefined if iterator or hs are uninitialized.

       Concurrency Kit (libck, -lck)

       ck_rhs_next — iterate to next entry in hash set

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

ck_rhs_init(3),     ck_rhs_move(3),     ck_rhs_destroy(3),    CK_RHS_HASH(3),    ck_rhs_iterator_init(3),
       ck_rhs_get(3),  ck_rhs_put(3),  ck_rhs_put_unique(3),  ck_rhs_set(3),  ck_rhs_fas(3),   ck_rhs_remove(3),
       ck_rhs_grow(3),  ck_rhs_rebuild(3), ck_rhs_gc(3), ck_rhs_count(3), ck_rhs_reset(3), ck_rhs_reset_size(3),
       ck_rhs_stat(3)

       Additional information available at http://concurrencykit.org/

                                               September 17, 2012                                 CK_RHS_NEXT(3)

#include<ck_rhs.h>boolck_rhs_next(ck_rhs_t*hs, ck_rhs_iterator_t*iterator, void**entry);