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

Rehash this map to at least the specified `minimumCapacity`&period;

== Synopsis

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

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

== Description

Change the capacity of this map 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 &grave;0 &equals;&equals; minimumCapacity` and `0 &equals;&equals; size()&grave;, the map is returned to the default constructed state&period; After this call, `load&lowbar;factor()` will be less than or equal to `max&lowbar;load&lowbar;factor()` and all iterators, pointers, and references to elements of this map are invalidated&period;

== Parameters

[cols="1,4"]
|===
| Name| Description
| *minimumCapacity*
| minimum capacity after rehashing
|===


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