std::unordered_multimap<Key,T,Hash,KeyEqual,Allocator>::emplace
| template< class... Args > iterator emplace( Args&&... args ); |
(since C++11) | |
Inserts a new element into the container constructed in-place with the given args .
Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations.
The constructor of the new element (i.e. std::pair<const Key, T>) is called with exactly the same arguments as supplied to emplace, forwarded via std::forward<Args>(args)....
If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is greater than max_load_factor() * bucket_count().
Parameters
| args | - | arguments to forward to the constructor of the element |
Return value
Returns an iterator to the inserted element.
Exceptions
If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).
Complexity
Amortized constant on average, worst case linear in the size of the container.
Example
#include <iostream> #include <string> #include <utility> #include <unordered_map> int main() { std::unordered_multimap<std::string, std::string> m; // uses pair's move constructor m.emplace(std::make_pair(std::string("a"), std::string("a"))); // uses pair's converting move constructor m.emplace(std::make_pair("b", "abcd")); // uses pair's template constructor m.emplace("d", "ddd"); // uses pair's piecewise constructor m.emplace(std::piecewise_construct, std::forward_as_tuple("c"), std::forward_as_tuple(10, 'c')); for (const auto& p : m) std::cout << p.first << " => " << p.second << '\n'; }
Possible output:
a => a b => abcd c => cccccccccc d => ddd
See also
| (C++11) |
constructs elements in-place using a hint (public member function) |
| (C++11) |
inserts elements or nodes (since C++17) (public member function) |