std::unordered_multiset<Key,Hash,KeyEqual,Allocator>::emplace_hint
From cppreference.com
< cpp | container | unordered multiset
C++
Feature test macros (C++20)
Concepts library (C++20)
Metaprogramming library (C++11)
Ranges library (C++20)
Filesystem library (C++17)
Concurrency support library (C++11)
Execution control library (C++26)
Containers library
(C++17)
(C++11)
(C++26)
(C++26)
(C++11)
(C++11)
(C++11)
(C++11)
(C++11)
(C++23)
(C++23)
(C++23)
(C++23)
(C++20)
(C++23)
Tables
std::unordered_multiset (C++23)
unordered_multiset::emplace_hint
(C++17)
(C++17)
(C++20)
(until C++20)
Deduction guides (C++17)
template< class... Args >
iterator emplace_hint( const_iterator hint, Args&&... args );
(since C++11) iterator emplace_hint( const_iterator hint, Args&&... args );
(constexpr since C++26)
Inserts a new element into the container, using hint as a suggestion where the element should go.
The constructors of the key and mapped value are called with exactly the same arguments as supplied to the function, forwarded with std::forward <Args>(args)....
If after the operation the new number of elements is greater than old max_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.
[edit] Parameters
hint
-
iterator, used as a suggestion as to where to insert the new element
args
-
arguments to forward to the constructor of the element
[edit] Return value
An iterator to the inserted element.
[edit] Exceptions
If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).
[edit] Complexity
Amortized constant on average, worst case linear in the size of the container.
[edit] Example
This section is incomplete
Reason: no example
Reason: no example