(C++17) | ||||
| Sequence | ||||
(C++11) | ||||
(C++26) | ||||
(C++26) | ||||
(C++11) | ||||
| Associative | ||||
| Unordered associative | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
(C++11) | ||||
| Adaptors | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
(C++23) | ||||
| Views | ||||
(C++20) | ||||
(C++23) | ||||
| Tables | ||||
| Iterator invalidation | ||||
| Member function table | ||||
| Non-member function table |
std::unordered_multimap| Member types | ||||||
| Member functions | ||||||
| Non-member functions | ||||||
| ||||||
| Deduction guides(C++17) | ||||||
template<class...Args> iterator emplace_hint( const_iterator hint, Args&&...args); | (since C++11) (constexpr since C++26) | |
Inserts a new element into the container, usinghint as a suggestion where the element should go.
The constructor ofvalue_type (i.e.,std::pair<const Key, T>) is called with exactly the same arguments as supplied to the function, forwarded withstd::forward<Args>(args)....
If after the operation the new number of elements is greater than oldmax_load_factor() * bucket_count() a rehashing takes place.
If rehashing occurs (due to the insertion), all iterators are invalidated. Otherwise (no rehashing), iterators are not invalidated.
Contents |
| hint | - | iterator, used as a suggestion as to where to insert the new element |
| args | - | arguments to forward to the constructor of the element |
An iterator to the inserted element.
If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).
Amortized constant on average, worst case linear in the size of the container.
| This section is incomplete Reason: no example |
| constructs element in-place (public member function)[edit] | |
| inserts elementsor nodes(since C++17) (public member function)[edit] |
