[#BloombergLP-bdlc-FlatHashTable-rehash]
= xref:BloombergLP.adoc[BloombergLP]::xref:BloombergLP/bdlc.adoc[bdlc]::xref:BloombergLP/bdlc/FlatHashTable.adoc[FlatHashTable]::rehash
:relfileprefix: ../../../
:mrdocs:

Change the capacity of this table to at least the specified `minimumCapacity`, and redistribute all the contained elements into a new sequence of entries, according to their hash values. If `0 == minimumCapacity` and `0 == size()`, the table is returned to the zero‐capacity state. On return, `load_factor()` is less than or equal to `max_load_factor()` and all iterators, pointers, and references to elements of this `FlatHashTable` are invalidated.

== Synopsis

Declared in `<bdlc_flathashtable.h>`

[source,cpp,subs="verbatim,replacements,macros,-callouts"]
----
void
rehash(std::size_t minimumCapacity);
----


[.small]#Created with https://www.mrdocs.com[MrDocs]#