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

Change the capacity of this table to at least a capacity that can accommodate the specified `numEntries` (accounting for the load factor invariant), and redistribute all the contained elements into a new sequence of entries, according to their hash values. If `0 == numEntries` and `0 == size()`, the table is returned to the zero‐capacity state. After this call, `load_factor()` will be less than or equal to `max_load_factor()`. Note that this method is effectively equivalent to: ` rehash(bsl::ceil(numEntries / max_load_factor())) `

== Synopsis

Declared in `<bdlc_flathashtable.h>`

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


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