The reverse() 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_set reserve() function in C++ STL
- unordered_multimap reserve() function in C++ STL
- How to remove arrow in dropdown in Bootstrap ?
- How to debug PHP scripts ?
- AngularJS | ng-include Directive
- How to select an element by name with jQuery?
- Sort an array according to absolute difference with given value using Functors
- acpid command in Linux with Examples
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.