The unordered_map::end() is a built-in function in C++ STL which returns an iterator pointing to the position past the last element in the container in the unordered_map container. In an unordered_map object, there is no guarantee that which specific element is considered its first element. But all the elements in the container are covered since the range goes from its begin to its end until invalidated.
Parameters : This function accepts one parameter n which is an optional parameter that specifies the bucket number. If it is set, the iterator retrieves points to the past-the-end element of a bucket, otherwise, it points to the past-the-end element of the container.
Return value: The function returns an iterator to the element past the end of the container.
Below programs illustrates the above-mentioned function:
marks bucket contains : bucket #0 contains: bucket #1 contains: bucket #2 contains: bucket #3 contains:(Aman, 37), (Rohit, 64), bucket #4 contains:(Ayush, 96),
Marks of Ayush is 96 and his bucket number is 4 Marks of Aman is 37 and his bucket number is 3 Marks of Rohit is 64 and his bucket number is 3
- Function Overloading vs Function Overriding in C++
- How to call some function before main() function in C++?
- What happens when a virtual function is called inside a non-virtual function in C++
- Difference between Virtual function and Pure virtual function in C++
- exp() function C++
- log() function in C++
- div() function in C++
- fma() function in C++
- map key_comp() function in C++ STL
- valarray abs() function in C++
- map rbegin() function in C++ STL
- valarray end() function in C++
- regex_iterator() function in C++ STL
- valarray sin() function in C++
- valarray exp() function 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 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.