A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://en.cppreference.com/w/cpp/algorithm/../algorithm/../container/multiset/emplace_hint.html below:

std::multiset<Key,Compare,Allocator>::emplace_hint - cppreference.com

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 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 [edit] See also constructs element in-place
(public member function) [edit] inserts elements or nodes(since C++17)
(public member function) [edit]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4