---
name: "ck_hs_next"
section: "3"
platform: "linux"
package: "libck-dev"
version: "0.7.2-6"
release: "Debian 13 (Trixie)"
platforms: ["linux"]
url: "https://new.carta.tech/ck_hs_next"
---

# ck\_hs\_next(3)

iterate to next entry in hash set

## NAME

**ck\_hs\_next** – iterate to next entry in hash set

## LIBRARY

Concurrency Kit (libck, -lck)

## SYNOPSIS

**#include \<ck\_hs.h\>**

*bool*\

**ck\_hs\_next**(*ck\_hs\_t \*hs*, *ck\_hs\_iterator\_t \*iterator*, *void \*\*entry*);

## DESCRIPTION

The **ck\_hs\_next**(*3*) function will increment the iterator object pointed to by *iterator* to point to the next non-empty hash set entry. If **ck\_hs\_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\_hs\_iterator\_init(3)](/ck_hs_iterator_init/3.md) function or statically initialized using CK\_HS\_ITERATOR\_INITIALIZER.

## RETURN VALUES

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

## ERRORS

Behavior is undefined if *iterator* or *hs* are uninitialized.

## SEE ALSO

[ck\_hs\_init(3)](/ck_hs_init/3.md), [ck\_hs\_move(3)](/ck_hs_move/3.md), [ck\_hs\_destroy(3)](/ck_hs_destroy/3.md), [CK\_HS\_HASH(3)](/CK_HS_HASH/3.md), [ck\_hs\_iterator\_init(3)](/ck_hs_iterator_init/3.md), [ck\_hs\_get(3)](/ck_hs_get/3.md), [ck\_hs\_put(3)](/ck_hs_put/3.md), [ck\_hs\_put\_unique(3)](/ck_hs_put_unique/3.md), [ck\_hs\_set(3)](/ck_hs_set/3.md), [ck\_hs\_fas(3)](/ck_hs_fas/3.md), [ck\_hs\_remove(3)](/ck_hs_remove/3.md), [ck\_hs\_grow(3)](/ck_hs_grow/3.md), [ck\_hs\_rebuild(3)](/ck_hs_rebuild/3.md), [ck\_hs\_gc(3)](/ck_hs_gc/3.md), [ck\_hs\_count(3)](/ck_hs_count/3.md), [ck\_hs\_reset(3)](/ck_hs_reset/3.md), [ck\_hs\_reset\_size(3)](/ck_hs_reset_size/3.md), [ck\_hs\_stat(3)](/ck_hs_stat/3.md)

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