std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::rehash
From cppreference.com
< cpp | container | unordered multimap
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::unordered_multimap 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.
[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().