unordered_multiset find() function in C++STL
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.
Syntax:
unordered_multiset_name.find(val)
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:
Program 1:
#include <bits/stdc++.h>
using namespace std;
int main()
{
unordered_multiset< int > sample;
sample.insert(100);
sample.insert(100);
sample.insert(100);
sample.insert(200);
sample.insert(500);
sample.insert(500);
sample.insert(600);
auto it = sample.find(500);
if (it != sample.end())
cout << *it << endl;
else
cout << "500 not found\n" ;
it = sample.find(300);
if (it != sample.end())
cout << *it << endl;
else
cout << "300 not found\n" ;
it = sample.find(100);
if (it != sample.end())
cout << *it << endl;
else
cout << "100 not found\n" ;
return 0;
}
|
Output:
500
300 not found
100
Program 2:
#include <bits/stdc++.h>
using namespace std;
int main()
{
unordered_multiset< char > sample;
sample.insert( 'a' );
sample.insert( 'a' );
sample.insert( 'b' );
sample.insert( 'c' );
sample.insert( 'd' );
sample.insert( 'd' );
sample.insert( 'd' );
auto it = sample.find( 'a' );
if (it != sample.end())
cout << *it << endl;
else
cout << "a not found\n" ;
it = sample.find( 'z' );
if (it != sample.end())
cout << *it << endl;
else
cout << "z not found\n" ;
return 0;
}
|
Last Updated :
02 Aug, 2018
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...