std::multiset<Key,Compare,Allocator>::emplace_hint
From cppreference.com
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::multiset
(C++11)
(C++11)
(C++11)
(C++17)
(C++17)
(C++23)
(C++11)
multiset::emplace_hint
(C++11)
(C++20)
(until C++20)(until C++20)(until C++20)(until 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 as close as possible to the position just before hint.
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)....
No iterators or references are invalidated.
[edit] Parameters
hint
-
iterator to the position before which the new element will be inserted
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
Logarithmic in the size of the container in general, but amortized constant if the new element is inserted just before hint.
[edit] Example
This section is incomplete
Reason: no example
Reason: no example