[#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&period; If `0 &equals;&equals; minimumCapacity` and `0 &equals;&equals; size()`, the table is returned to the zero&hyphen;capacity state&period; On return, `load&lowbar;factor()` is less than or equal to `max&lowbar;load&lowbar;factor()` and all iterators, pointers, and references to elements of this `FlatHashTable` are invalidated&period;

== Synopsis

Declared in `&lt;bdlc&lowbar;flathashtable&period;h&gt;`

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


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