Overview of std::map’s Insertion / Emplacement Methods in C++17

Today’s guest post is written by @walletfox, one of the hitchhikers in the C++ galaxy, trying to navigate its dark corners by writing articles, creating Mostly Harmless cheat sheets and observing the following rules: “Don’t panic! Always carry a cheat sheet next to the towel. So long and thanks for all the fish.”.

Interested in writing on Fluent C++ too? Submit your post!

—

TL;DR Go ahead and try out the C++17 emplacement / insertion methods. They offer a tangible improvement in terms of expressiveness and code safety.

Here are examples of code using them.

—

C++17 introduced two new insertion / emplacement methods for std::map , namely try_emplace() and insert_or_assign() .

At first sight, this might seem like a cause for concern. Why new insertion methods? Don’t we have already plenty of them?

Nevertheless, by studying the problem closer we might come to the conclusion that the introduction of the new methods try_emplace() and insert_or_assign() makes a convincing case and that they bring us closer to more expressive and safer code.

To understand how we ended up with this pool of insertion / emplacement methods, we are going to use a simple map<int, std::string> . Later on, we are going to look at a more complex scenario with std::map<int, A> where A is a struct with two member variables ( std::string , int ).

For logging purposes I have provided all the special member functions for the struct A . In production, we should apply The Rule of Zero (C++ Core Guidelines, C.20: If you can avoid defining default operations, do) and let the compiler generate the special member functions for us.

Unless stated otherwise, the code was compiled with gcc 9.0.0. and clang 8.0.0, -O2 (HEAD at the time of writing).

struct A { std::string name; int age; // introduced for logging purposes only A(){ std::cout << "Default ctor. "; } //explicit A(std::string const& s, int x):name(s), age(x){ std::cout << "Ctor. "; } A(A const& a):name(a.name),age(a.age){ std::cout << "Copy ctor. "; } A(A && a) noexcept :name(std::move(a.name)),age(std::move(a.age)){ std::cout << "Move ctor. "; } A& operator=(A const& a){ std::cout << "Copy assign. "; name = a.name; age = a.age; return *this; } A& operator=(A && a) noexcept { std::cout << "Move assign. "; name = std::move(a.name); age = std::move(a.age); return *this; } ~A() noexcept { std::cout << "Dtor. "; } }; 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 struct A { std :: string name ; int age ; // introduced for logging purposes only A ( ) { std :: cout << "Default ctor. " ; } //explicit A ( std :: string const & s , int x ) : name ( s ) , age ( x ) { std :: cout << "Ctor. " ; } A ( A const & a ) : name ( a . name ) , age ( a . age ) { std :: cout << "Copy ctor. " ; } A ( A && a ) noexcept : name ( std :: move ( a . name ) ) , age ( std :: move ( a . age ) ) { std :: cout << "Move ctor. " ; } A & operator = ( A const & a ) { std :: cout << "Copy assign. " ; name = a . name ; age = a . age ; return * this ; } A & operator = ( A && a ) noexcept { std :: cout << "Move assign. " ; name = std :: move ( a . name ) ; age = std :: move ( a . age ) ; return * this ; } ~ A ( ) noexcept { std :: cout << "Dtor. " ; } } ;

Pre-C++11 days: operator[] and insert()

Before we can discuss how exactly the new C++17 methods try_emplace() and insert_or_assign() bring improvement, we are going to travel back to pre-C++11 times when all we had was operator[] and insert() .

The selling point of operator[] was its simplicity of use, which unlike insert() didn’t need to use std::make_pair() or other verbose constructs to pass around function arguments.

// C++03 style std::map<int, std::string> m; m[1] = "Ann"; // C++03 style std::map<int, std::string> m; m.insert(std::make_pair(1, "Ann")); 1 2 3 4 5 6 7 // C++03 style std :: map < int , std :: string > m ; m [ 1 ] = "Ann" ; // C++03 style std :: map < int , std :: string > m ; m . insert ( std :: make_pair ( 1 , "Ann" ) ) ;

operator[]

insert()

operator[]

insert()

// C++11 style further ahead auto m = std::map<int, std::string>{{1, "Ann"}}; m[1] = "Ben"; assert(m.at(1) == "Ben"); auto m = std::map<int, std::string>{{1, "Ann"}}; m.insert({1,"Ben"}); assert(m.at(1) == "Ann"); 1 2 3 4 5 6 7 8 // C++11 style further ahead auto m = std :: map < int , std :: string > { { 1 , "Ann" } } ; m [ 1 ] = "Ben" ; assert ( m . at ( 1 ) == "Ben" ) ; auto m = std :: map < int , std :: string > { { 1 , "Ann" } } ; m . insert ( { 1 , "Ben" } ) ; assert ( m . at ( 1 ) == "Ann" ) ;

value_type

operator[]

DefaultConstructible

value_type

struct A

insert()

operator[]

// Ctor. Default ctor. Move assign. Dtor. Dtor. auto m = std::map<int, A> {}; m[1] = A("Ann", 63); // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. auto m = std::map<int, A> {}; m.insert({1, A("Ann", 63)}); 1 2 3 4 5 6 7 // Ctor. Default ctor. Move assign. Dtor. Dtor. auto m = std :: map < int , A > { } ; m [ 1 ] = A ( "Ann" , 63 ) ; // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. auto m = std :: map < int , A > { } ; m . insert ( { 1 , A ( "Ann" , 63 ) } ) ;

operator[]

insert()

pair<iterator, bool>

Convenience aside, what is more important,differs fromin how it handles a situation when an element with the given key already exists in the map. Whilesimply overwrites the corresponding value,doesn’t.Another important difference lies in the requirements on the, namely,requires a, which means that if we explicitly or implicitly disable the default constructor of the, the code won’t compile. Notice that, unlikecalls different special member functions, i.e. the call to the default constructor is followed by the call to copy/move assignment operator.Last but not least, these methods differ in the return information they provide. With, we have no way of finding out whether the insertion actually took place, unless we perform a prior lookup. On the other hand,returns athat provides us with this information.

Most recently, this has been simplified thanks to structured bindings introduced in C++17.

// C++17 structured bindings style auto[it, ins] = m.insert({2, "Ann"}); 1 2 // C++17 structured bindings style auto [ it , ins ] = m . insert ( { 2 , "Ann" } ) ;

C++11: move semantics and in-place construction

Further down the road, we got C++11 which introduced move semantics, and both operator[] and insert() , i.e. the original insertion methods, benefited from this in terms of performance. In addition, C++11 introduced emplace() which has the same functionality as insert() but additionally, enables in-place construction.

In-place construction is a technique that bypasses construction and destruction of temporaries by constructing the objects directly in the map. A notable attraction of emplace () is that we can do away either with std::make_pair() or the extra pair of {} that needed to be used with insert() . Emplacement is accomplished via perfect forwarding and variadic templates.

The jury is still out on whether emplace () should be generally preferred to insert() . The potential performance gain is dependent on the types involved and specific library implementations. While Scott Meyers is in favor of emplace() (Effective Modern C++, Item 42, what a coincidence!), other C++ experts/guidelines are in favor of insert() , most notably Bjarne Stroustrup and Abseil Common Libraries. The reason for that is code safety.

Clang-tidy uses a mixed approach with a general preference for emplacement with the exception of std::unique_ptr and std::shared_ptr where emplacement could lead to memory leaks:

// might leak if allocation fails due to insufficient memory for an object A std::map<int, std::unique_ptr<A>> m; m.emplace(1, std::make_unique<A>("Ann",63)); 1 2 3 // might leak if allocation fails due to insufficient memory for an object A std :: map < int , std :: unique_ptr < A >> m ; m . emplace ( 1 , std :: make_unique < A > ( "Ann" , 63 ) ) ;

Let’s get back to our example and study the effect of different insertion/emplacement constructs. Though this will provide us with some observations, keep in mind that this is a specific example. The types and specific libraries involved are likely to cause differences and it would be counterproductive to make general conclusions. If in doubt, measure.

auto m = std::map<int, A> {}; // (1) Ctor. Copy ctor. Move ctor. Dtor. Dtor. Dtor. m.insert({1, {"Ann", 63}}); // (2) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m.insert(std::make_pair(1, A("Ann", 63))); // (3) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m.insert({1, A("Ann", 63)}); // (4) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m.emplace(std::make_pair(1, A("Ann", 63))): // (5) Ctor. Move ctor. Dtor. Dtor. m.emplace(1, A("Ann", 63)): // (6) Doesn't compile. That is why try_emplace of C++17 is of interest // m.emplace(1, "Ann", 63); // (7) Ctor. Dtor. m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple("Ann", 63)); 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 auto m = std :: map < int , A > { } ; // (1) Ctor. Copy ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( { 1 , { "Ann" , 63 } } ) ; // (2) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( std :: make_pair ( 1 , A ( "Ann" , 63 ) ) ) ; // (3) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( { 1 , A ( "Ann" , 63 ) } ) ; // (4) Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m . emplace ( std :: make_pair ( 1 , A ( "Ann" , 63 ) ) ) : // (5) Ctor. Move ctor. Dtor. Dtor. m . emplace ( 1 , A ( "Ann" , 63 ) ) : // (6) Doesn't compile. That is why try_emplace of C++17 is of interest // m.emplace(1, "Ann", 63); // (7) Ctor. Dtor. m . emplace ( std :: piecewise_construct , std :: forward_as_tuple ( 1 ) , std :: forward_as_tuple ( "Ann" , 63 ) ) ;

Now that we have listed some common alternatives, notice that scenario (1) resulted in a copy constructor call with both compilers. This is because of copy-list-initialization.

// (1) Ctor. Copy ctor. Move ctor. Dtor. Dtor. Dtor. m.insert({1, {"Ann", 63}}); 1 2 // (1) Ctor. Copy ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( { 1 , { "Ann" , 63 } } ) ;

If performance is of concern, we can disable this alternative by marking the multi-argument constructor of struct A explicit. This code will then fail to compile:

explicit A(std::string const& s, int x):name(s), age(x){ std::cout << "Ctor. "; } // won't compile now, copy-list-initialization prevented m.insert({1, {"Ann", 63}}); 1 2 3 4 5 6 explicit A ( std :: string const & s , int x ) : name ( s ) , age ( x ) { std :: cout << "Ctor. " ; } // won't compile now, copy-list-initialization prevented m . insert ( { 1 , { "Ann" , 63 } } ) ;

It appears that omitting make_pair() with emplace() in case (5) helped us dispense with one move construction, but we can do even better—this is demonstrated in case (7) where we passed std::piecewise_construct and std::forward_as_tuple as arguments to emplace() resulting in a single constructor and destructor call, completely avoiding intermediate copies and moves!

The verbosity of emplacement with piecewise construct is off-putting, therefore you might appreciate C++17’s try_emplace() which will do away with the gobbledegook. This is going to be demonstrated in the next section.

For reasons of completeness, I am also listing scenarios where we move from L-values. As you can see, contrary to the previous example, we don’t get the same benefit with emplace() and piecewise construct as before.

auto m = std::map<int, A> {}; auto a = A("Ann", 63); // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m.insert(std::make_pair(1, std::move(a))); // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m.insert({1, std::move(a)}); // Ctor. Move ctor. Dtor. Dtor. m.emplace(1, std::move(a)); // Ctor. Move ctor. Dtor. Dtor. m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple(std::move(a))); 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 auto m = std :: map < int , A > { } ; auto a = A ( "Ann" , 63 ) ; // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( std :: make_pair ( 1 , std :: move ( a ) ) ) ; // Ctor. Move ctor. Move ctor. Dtor. Dtor. Dtor. m . insert ( { 1 , std :: move ( a ) } ) ; // Ctor. Move ctor. Dtor. Dtor. m . emplace ( 1 , std :: move ( a ) ) ; // Ctor. Move ctor. Dtor. Dtor. m . emplace ( std :: piecewise_construct , std :: forward_as_tuple ( 1 ) , std :: forward_as_tuple ( std :: move ( a ) ) ) ;

C++17: try_emplace() and insert_or_assign() as a solution to double lookup

Now we have enough background to understand the rationale behind the introduction of the new methods. try_emplace() and insert_or_assign() differ in their respective functionalities, but they do have something in common—they are both a solution to a redundant search that had to be performed in pre-C++17 days to provide safety or additional information.

try_emplace()

try_emplace() is a safer successor of insert() or emplace() . In line with insert() and emplace() , try_emplace() doesn’t modify values for already inserted elements. However, on top of that, it prevents stealing from original arguments that happens both with insert() and emplace() in case of a failed insertion.

This is demonstrated in the snippet below. An element with key 1 is already in the map, as a result p1 won’t be inserted. That doesn’t prevent emplace() from plundering the pointer p:

auto m = std::map<int, std::unique_ptr<A>> {}; m.emplace(1, std::make_unique<A>("Ann",63)); auto p = std::make_unique<A>("John",47); // p won't be inserted m.emplace(1, std::move(p)); //but it still might get plundered!!! assert(p != nullptr); // this will most likely fail 1 2 3 4 5 6 7 8 9 auto m = std :: map < int , std :: unique_ptr < A >> { } ; m . emplace ( 1 , std :: make_unique < A > ( "Ann" , 63 ) ) ; auto p = std :: make_unique < A > ( "John" , 47 ) ; // p won't be inserted m . emplace ( 1 , std :: move ( p ) ) ; //but it still might get plundered!!! assert ( p != nullptr ) ; // this will most likely fail

In the pre C++17 days this issue could have been only solved with a prior lookup, with find() .

auto it = m.find(1); // call emplace only if key doesn’t exist if (it == m.end()) { it = m.emplace(1, std::move(p)).first; } assert(p != nullptr); 1 2 3 4 5 6 auto it = m . find ( 1 ) ; // call emplace only if key doesn’t exist if ( it == m . end ( ) ) { it = m . emplace ( 1 , std :: move ( p ) ) . first ; } assert ( p != nullptr ) ;

This lookup is no longer necessary. try_emplace() makes sure that the argument remains untouched in case it wasn’t inserted:

m.try_emplace(1, std::move(p)); // no plundering in case insertion failed assert(p != nullptr); 1 2 3 m . try_emplace ( 1 , std :: move ( p ) ) ; // no plundering in case insertion failed assert ( p != nullptr ) ;

Although this is the primary purpose of try_emplace() , there are some other important advantages. As already mentioned in the previous section, try_emplace() simplifies the original emplace() that had to use pair’s piecewise constructor:

// before C++17 auto m = std::map<int, A> {}; m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple("Ann", 63)); 1 2 3 4 5 // before C++17 auto m = std :: map < int , A > { } ; m . emplace ( std :: piecewise_construct , std :: forward_as_tuple ( 1 ) , std :: forward_as_tuple ( "Ann" , 63 ) ) ;

and dispenses with its verbosity in the following way:

// C++17 auto m = std::map<int, A> {}; m.try_emplace(1, “Ann”, 63); 1 2 3 // C++17 auto m = std :: map < int , A > { } ; m . try_emplace ( 1 , “ Ann ” , 63 ) ;

At first sight, using try_emplace() in this way might seem rather user unfriendly due to the nonexistent boundary between the key and the value. However, if used in this way, try_emplace() solves another issue of emplace() , namely that objects were created even though they weren’t actually used.

Specifically, the map below already contains the key 1 with value {“Ann”, 63} , thus a {“Ben”, 47} object doesn’t need to be generated, because emplace() doesn’t modify values for already existing keys.

// std::map m with the original object auto m = std::map<int, A> {}; m.emplace(1, A("Ann", 63)); // doesn't generate a redundant object m.try_emplace(1, "Ben", 47); 1 2 3 4 5 6 // std::map m with the original object auto m = std :: map < int , A > { } ; m . emplace ( 1 , A ( "Ann" , 63 ) ) ; // doesn't generate a redundant object m . try_emplace ( 1 , "Ben" , 47 ) ;

Nonetheless, we shouldn’t blindly replace all occurrences of emplace() with try_emplace() without adjusting the argument list first. The try_emplace() that uses A ’s constructor below generates a redundant object just like its emplace() counterparts:

// Ctor. Dtor. - redundant object m.try_emplace(1, A("Ben", 47)); // Ctor. Move ctor. Dtor. Dtor. - redundant object m.emplace(1, A("Ben", 47)); // Ctor. Dtor. - redundant object m.emplace(std::piecewise_construct, std::forward_as_tuple(1), std::forward_as_tuple("Ben", 47)); 1 2 3 4 5 6 7 8 9 10 // Ctor. Dtor. - redundant object m . try_emplace ( 1 , A ( "Ben" , 47 ) ) ; // Ctor. Move ctor. Dtor. Dtor. - redundant object m . emplace ( 1 , A ( "Ben" , 47 ) ) ; // Ctor. Dtor. - redundant object m . emplace ( std :: piecewise_construct , std :: forward_as_tuple ( 1 ) , std :: forward_as_tuple ( "Ben" , 47 ) ) ;

insert_or_assign()

insert_or_assign() is a “smarter” successor of operator[] . Just like operator[] it modifies values if supplied with a key that is already present in the map. However, unlike operator[] , insert_or_assign() doesn’t require default constructibility of the value_type . On top of that, it returns a pair<iterator, bool> . The bool is true when insertion took place and false in case of assignment.

Again, this information was unavailable for operator[] without a prior lookup with the help of find() as demonstrated below. The map already contains an element with the key 1 , thus this won’t be an insertion but an update.

auto m = std::map<int, std::unique_ptr<A>> {}; m[1] = std::make_unique<A>("Ann",63); auto p = std::make_unique<A>("John",47); auto key = int{1}; auto ins = bool{false}; auto it = m.find(key); if(it == m.end()){ ins = true; } m[key] = std::move(p); assert(ins == false); 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 auto m = std :: map < int , std :: unique_ptr < A >> { } ; m [ 1 ] = std :: make_unique < A > ( "Ann" , 63 ) ; auto p = std :: make_unique < A > ( "John" , 47 ) ; auto key = int { 1 } ; auto ins = bool { false } ; auto it = m . find ( key ) ; if ( it == m . end ( ) ) { ins = true ; } m [ key ] = std :: move ( p ) ; assert ( ins == false ) ;

The code contains a lot of boilerplate that can result both in errors and performance inefficiencies only for the sole purpose of insert or update identification. Luckily, with insert_or_assign() we can skip all of it and simply write:

auto[it, ins] = m.insert_or_assign(1, std::move(p)); assert(ins == false); 1 2 auto [ it , ins ] = m . insert_or_assign ( 1 , std :: move ( p ) ) ; assert ( ins == false ) ;

Difficulties with inferring from names

At present, it is difficult to conclude whether the new C++17 methods express clearly their intent and functionality. If you have a look at the original proposal, try_emplace() is being referred to as emplace_stable() , while insert_or_assign() is being referred to as emplace_or_update() .

At the moment it might seem confusing but with more frequent use we are bound to get it right and hopefully, we will be able to link the new names to the correct functionalities.

Summary

Remember that:

insert() , emplace() and try_emplace() don’t overwrite values for existing keys. On the other hand, operator[] and insert_or_assign() overwrite them.

, and don’t overwrite values for existing keys. On the other hand, and overwrite them. emplace() may be susceptible to memory leaks if allocation fails.

may be susceptible to memory leaks if allocation fails. try_emplace() doesn’t steal from original arguments if insertion fails. This is in contrast to emplace() and insert() .

doesn’t steal from original arguments if insertion fails. This is in contrast to and try_emplace() doesn’t generate redundant objects in case insertion didn’t take place. This is in contrast to emplace() .

doesn’t generate redundant objects in case insertion didn’t take place. This is in contrast to . try_emplace() offers a simplified piecewise construction. On the other hand, emplace() has to use std::piecewise_construct , std::forward_as_tuple .

offers a simplified piecewise construction. On the other hand, has to use , . insert_or_assign() doesn’t require default constructibility. On the other hand, operator[] does.

doesn’t require default constructibility. On the other hand, does. insert_or_assign() returns information on whether insertion or assignment took place. This is in contrast to operator[] .

The author is grateful to Jonathan Boccara for hosting, formatting and editing the post and Ricardo Nabinger Sanchez for proofreading.

You will also like

Share this post! Don't want to miss out ?