std::unordered_set rehash() method
- od C++11
// Non-const version only
void rehash( size_type count );
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().
Parameters
count- new number of buckets
Return value
(none)
Complexity
Average case, linear in size of the container - O(size()).
Worst case, quadratic in the size of the container - O(size() * size()).
Exceptions
(none)
Notes
rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor().
Examples
important
This section requires improvement. You can help by editing this doc page.
This article originates from this CppReference page. It was likely altered for improvements or editors' preference. Click "Edit this page" to see all changes made to this document.
Hover to see the original license.
Hover to see the original license.