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

# ck\_ht\_grow\_spmc(3)

resize a hash table if necessary

## NAME

**ck\_ht\_grow\_spmc** – resize a hash table if necessary

## LIBRARY

Concurrency Kit (libck, -lck)

## SYNOPSIS

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

*bool*\

**ck\_ht\_grow\_spmc**(*ck\_ht\_t \*ht*, *uint64\_t capacity*);

## DESCRIPTION

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

This function is safe to call in the presence of concurrent [ck\_ht\_get\_spmc(3)](/ck_ht_get_spmc/3.md) operations.

## RETURN VALUES

Upon successful completion **ck\_ht\_grow\_spmc**() returns true and otherwise returns a false value.

## ERRORS

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

## SEE ALSO

[ck\_ht\_stat(3)](/ck_ht_stat/3.md), [ck\_ht\_init(3)](/ck_ht_init/3.md), [ck\_ht\_destroy(3)](/ck_ht_destroy/3.md), [ck\_ht\_hash(3)](/ck_ht_hash/3.md), [ck\_ht\_hash\_direct(3)](/ck_ht_hash_direct/3.md), [ck\_ht\_set\_spmc(3)](/ck_ht_set_spmc/3.md), [ck\_ht\_put\_spmc(3)](/ck_ht_put_spmc/3.md), [ck\_ht\_gc(3)](/ck_ht_gc/3.md), [ck\_ht\_get\_spmc(3)](/ck_ht_get_spmc/3.md), [ck\_ht\_remove\_spmc(3)](/ck_ht_remove_spmc/3.md), [ck\_ht\_reset\_spmc(3)](/ck_ht_reset_spmc/3.md), [ck\_ht\_reset\_size\_spmc(3)](/ck_ht_reset_size_spmc/3.md), [ck\_ht\_count(3)](/ck_ht_count/3.md), [ck\_ht\_entry\_empty(3)](/ck_ht_entry_empty/3.md), [ck\_ht\_entry\_key\_set(3)](/ck_ht_entry_key_set/3.md), [ck\_ht\_entry\_key\_set\_direct(3)](/ck_ht_entry_key_set_direct/3.md), [ck\_ht\_entry\_key(3)](/ck_ht_entry_key/3.md), [ck\_ht\_entry\_key\_length(3)](/ck_ht_entry_key_length/3.md), [ck\_ht\_entry\_value(3)](/ck_ht_entry_value/3.md), [ck\_ht\_entry\_set(3)](/ck_ht_entry_set/3.md), [ck\_ht\_entry\_set\_direct(3)](/ck_ht_entry_set_direct/3.md), [ck\_ht\_entry\_key\_direct(3)](/ck_ht_entry_key_direct/3.md), [ck\_ht\_entry\_value\_direct(3)](/ck_ht_entry_value_direct/3.md), [ck\_ht\_iterator\_init(3)](/ck_ht_iterator_init/3.md), [ck\_ht\_next(3)](/ck_ht_next/3.md)

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