The unordered_multiset::find() is a built-in function in C++ STL which returns an iterator which points to the position which has the element val. If the element does not contain the element val, then it returns an iterator which points to a position past the last element in the container.
Parameters: The function accepts a mandatory parameter val whose position’s iterator is to be returned.
Return Value: It returns an iterator which points to the position where val is.
Below programs illustrate the above function:
500 300 not found 100
a z not found
- set find() function in C++ STL
- map find() function in C++ STL
- unordered_multimap find() function in C++ STL
- unordered_set find() function in C++ STL
- multiset find() function in C++ STL
- Function Overloading vs Function Overriding in C++
- What happens when a virtual function is called inside a non-virtual function in C++
- std::find in C++
- string find in C++
- Find if there is a subarray with 0 sum
- multimap find() in C++ STL
- unordered_map find in C++ STL
- How to find the sum of elements of an Array using STL in C++?
- How to find the sum of elements of a Vector using STL in C++?
- Find elements of an Array which are Odd and Even using STL 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.