The reserve() function of unordered_multiset sets the number of buckets in the container (bucket_count) to the most appropriate to contain at least n elements.
If n is greater than the current bucket_count multiplied by the max_load_factor, the container’s bucket_count is increased and a rehash is forced.
If n is lower than that, the function may have no effect.
void reserve( size_type n );
where size_type is an unsigned integral type.
Parameters: This method accepts a mandatory parameter n which is the number of elements requested as minimum capacity.
Returns: It does not returns any value.
Below are the programs to illustrate reserve() method:
The values in unordered_multiset : 7 6 5
The values in unordered_multiset : GeeksforGeeks forGeeks Geeks
- Using std::vector::reserve whenever possible
- unordered_map reserve() in C++ STL
- unordered_multimap reserve() function in C++ STL
- unordered_set reserve() function in C++ STL
- How to Create Background Like TV Noise in a Canvas ?
- Speed up Code executions with help of Pragma in C/C++
- ES6 | RegEx
- How to Select Multiple Files using HTML Input Tag ?
- ES6 | HTML DOM
- How to get history changes notification via history.pushState() method ?
- How to check the given path is file or directory in node.js ?
- How to zoom in on a point using scale and translate ?
- How to Load External JS Scripts Dynamically in AngularJS ?
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.
Improved By : verma98