Difference between revisions of "cpp/container/unordered map/rehash"
From cppreference.com
< cpp | container | unordered map
m (1 revision: import content) |
m (langlinks) |
||
| (3 intermediate revisions by one user not shown) | |||
| Line 1: | Line 1: | ||
| − | {{cpp/container/rehash|unordered_map}} | + | {{include page|cpp/container/rehash|unordered_map}} |
| + | |||
| + | {{langlinks|de|es|fr|it|ja|pt|ru|zh}} | ||
Latest revision as of 08:14, 4 December 2021
| 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.
Contents |
[edit] Parameters
| count | - | lower bound for the new number of buckets |
[edit] Return value
(none)
[edit] Complexity
Average case linear in the size of the container, worst case quadratic.
[edit] Notes
rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor().
[edit] See also
| reserves space for at least the specified number of elements and regenerates the hash table (public member function) |
