std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash (3) - Linux Manuals

std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash: std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash


std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash - std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::rehash


void rehash( size_type count ); (since C++11)

Sets the number of buckets to count and rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed. If the new number of buckets makes load factor more than maximum load factor (count < size() / max_load_factor()), then the new number of buckets is at least size() / max_load_factor().


count - new number of buckets

Return value



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().

See also

        reserves space for at least the specified number of elements.
reserve This regenerates the hash table.
        (public member function)