void rehash( size_type count ); | (since C++11) |
Changes the number of buckets to a value n that is not less than count and satisfies n >= size() / max_load_factor(), then rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed.
| count | - | lower bound for the new number of buckets |
(none).
Average case linear in the size of the container, worst case quadratic.
rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor().
|
(C++11) | reserves space for at least the specified number of elements and regenerates the hash table (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/container/unordered_set/rehash