std::flat_multiset<Key,Compare,KeyContainer>::emplace
From cppreference.com
< cpp | container | flat 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::flat_multiset
flat_multiset::emplace
template< class... Args >
iterator emplace( Args&&... args );
(since C++23) iterator emplace( Args&&... args );
(constexpr since C++26)
Inserts a new element into the container constructed in-place with the given args.
First, initializes an object t of typevalue_type with std::forward <Args>(args)..., then inserts t as if by auto it = ranges::upper_bound (c, t, compare); c.insert(it, std::move(t));
This overload participates in overload resolution only if std::is_constructible_v <value_type, Args...> is true.
If value_type is not EmplaceConstructible into flat_multiset from args, the behavior is undefined.
Information on iterator invalidation is copied from here
[edit] Parameters
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.
[edit] Notes
Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations.
[edit] Example
This section is incomplete
Reason: no example
Reason: no example