map find() function in C++ STL
The map::find() is a built-in function in C++ STL which returns an iterator or a constant iterator that refers to the position where the key is present in the map. If the key is not present in the map container, it returns an iterator or a constant iterator which refers to map.end().
Syntax:
iterator map_name.find(key)
or
constant iterator map_name.find(key)
Parameters: The function accepts one mandatory parameter key which specifies the key to be searched in the map container.
Return Value: The function returns an iterator or a constant iterator which refers to the position where the key is present in the map. If the key is not present in the map container, it returns an iterator or a constant iterator which refers to map.end().
Below is the illustration of above function:
// C++ program for illustration // of map::find() function #include <bits/stdc++.h> using namespace std; int main() { // initialize container multimap<int, int> mp; // insert elements in random order mp.insert({ 2, 30 }); mp.insert({ 1, 40 }); mp.insert({ 3, 20 }); mp.insert({ 4, 50 }); cout << "The elements from position 3 in map are : \n"; cout << "KEY\tELEMENT\n"; // find() function finds the position at which 3 is for (auto itr = mp.find(3); itr != mp.end(); itr++) cout << itr->first << '\t' << itr->second << '\n'; return 0; } |
chevron_right
filter_none
Output:
The elements from position 3 in map are : KEY ELEMENT 3 20 4 50
Recommended Posts:
- set 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
- unordered_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++
- fma() function in C++
- div() function in C++
- exp() function C++
- log() function in C++
- Find if there is a subarray with 0 sum
- string find in C++
- multimap find() in C++ STL
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.
Improved By : xj_cool
