The map::emplace_hint() is a built-in function in C++ STL which inserts the key and its element in the map container with a given hint. It effectively increases the container size by one as map is the container that stores keys with the element value. The hint provided does not affect the position to be entered, it only increases the speed of insertion as it points to the position from where the search for the ordering is to be started. It inserts in the same order which is followed by the container. It works similarly to map::emplace() function but is at times faster then it if the user provides position accurately. It does not insert the key with the element if it is already present in the map container as the map stores unique key only.
map_name.emplace_hint(position, key, element)
Parameters: The function accepts three mandatory parameters key which are described as below:
- key – specifies the key to be inserted in the map container.
- element – specifies the element to the key which is to be inserted in the map container.
- position – specifies the position from where the search operation for the ordering is to be started, hence making the insertion faster.
Return Value: The function does not return anything.
The map is : KEY ELEMENT 1 40 2 30 3 60
- Function Overloading vs Function Overriding in C++
- What happens when a virtual function is called inside a non-virtual function in C++
- fma() function in C++
- exp() function C++
- log() function in C++
- div() function in C++
- set find() function in C++ STL
- set insert() function in C++ STL
- set upper_bound() function in C++ STL
- set lower_bound() function in C++ STL
- set equal_range() function in C++ STL
- map upper_bound() function in C++ STL
- set max_size() function in C++ STL
- set count() function in C++ STL
- set emplace_hint() function 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 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.