Rehash this map to at least the specified minimumCapacity.
Synopsis
Declared in <bdlc_flathashmap.h>
void
rehash(std::size_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. If `0 == minimumCapacity` and 0 == size()`, the map is returned to the default constructed state. After this call, `load_factor() will be less than or equal to max_load_factor() and all iterators, pointers, and references to elements of this map are invalidated.
Parameters
Name |
Description |
minimumCapacity |
minimum capacity after rehashing |
Created with MrDocs