The std::unordered_map::rehash() is a built in function C++ STL which which sets the number of buckets in container to n or more.
void rehash( size_type s );
- If s is greater than the current buckets into the container then rehashed is done. The new bucket count can be greater than or equal to n.
- If s is less than current bucket count then there may or may not be any effect of function. It totally depends upon compiler
Parameters : It takes New number of buckets into the container.
Return type : Its return type is none.
Size of container : 3 Initial bucket count : 5 Size of container : 3 Now bucket count is : 31
Size of container : 4 Initial bucket count : 7 Size of container : 4 Now bucket count is : 23
- unordered_multiset rehash() function in C++ STL
- unordered_multimap rehash() function in C++ STL
- unordered_set rehash() function in C++ STL
- Find the Deepest Node in a Binary Tree Using Queue STL - SET 2
- Check whether two strings are anagrams of each other using unordered_map in C++
- C++ program to compare two Strings using Operator Overloading
- not1 and not2 function templates in C++ STL with Examples
- Go vs C++
- Trie Data Structure using smart pointer and OOP in C++
- Modular Exponentiation of Complex Numbers
- std::hash class in C++ STL
- Find the difference of count of equal elements on the right and the left for each element
- History of C++
- What are Forward declarations in C++
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.