---
name: "ck_hs_grow"
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_grow"
---

# ck\_hs\_grow(3)

enlarge hash set capacity

## NAME

**ck\_hs\_grow** – enlarge hash set capacity

## LIBRARY

Concurrency Kit (libck, -lck)

## SYNOPSIS

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

*bool*\

**ck\_hs\_grow**(*ck\_hs\_t \*hs*, *unsigned long capacity*);

## DESCRIPTION

The **ck\_hs\_grow**(*3*) function will resize the hash set in order to be able to store at least the number of entries specified by *capacity* at a load factor of one. The default hash set load factor is 0.5. If you wish to minimize the likelihood of memory allocations for a hash set meant to store n entries, then specify a *capacity* of 2n. The default behavior of ck\_hs is to round *capacity* to the next power of two if it is not already a power of two.

## RETURN VALUES

Upon successful completion, **ck\_hs\_grow**(*3*) returns true and otherwise returns false on failure.

## ERRORS

Behavior is undefined if *hs* is uninitialized. This function will only return false if there are internal memory allocation failures.

## 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\_next(3)](/ck_hs_next/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\_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/