Skip to content
Related Articles

Related Articles

map emplace_hint() function in C++ STL
  • Last Updated : 04 Jun, 2020

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.

Syntax:

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: Returns an iterator to the newly inserted element.
If the insertion failed because the element already exists, returns an iterator to the already existing element with the equivalent key.




// C++ program to illustrate the
// map::emplace_hint() function
#include <bits/stdc++.h>
using namespace std;
  
int main()
{
  
    // initialize container
    map<int, int> mp;
  
    // insert elements in random order
    mp.emplace_hint(mp.begin(), 2, 30); // faster
    mp.emplace_hint(mp.begin(), 1, 40); // faster
    mp.emplace_hint(mp.begin(), 3, 60); // slower
  
    // prints the elements
    cout << "\nThe map is : \n";
    cout << "KEY\tELEMENT\n";
    for (auto itr = mp.begin(); itr != mp.end(); itr++)
        cout << itr->first << "\t" << itr->second << endl;
  
    return 0;
}
Output:
The map is : 
KEY    ELEMENT
1    40
2    30
3    60
Want to learn from the best curated videos and practice problems, check out the C++ Foundation Course for Basic to Advanced C++ and C++ STL Course for foundation plus STL.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.
My Personal Notes arrow_drop_up
Recommended Articles
Page :