Change the capacity to at least minimumCapacity and rehash.
Declared in <bdlc_flathashtable.h>
void
rehash(std::size_t minimumCapacity);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.
| Name | Description |
|---|---|
| minimumCapacity | requested lower bound on capacity |