std::flat_multiset<Key,Compare,KeyContainer>::emplace

 

C++

Compiler support

Freestanding and hosted

Language

Standard library

Standard library headers

Named requirements

Feature test macros (C++20)

Language support library

Concepts library (C++20)

Diagnostics library

Memory management library

Metaprogramming library (C++11)

General utilities library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Strings library

Text processing library

Numerics library

Date and time library

Input/output library

Filesystem library (C++17)

Concurrency support library (C++11)

Execution control library (C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

node-handle (C++17)

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (C++26)

hive (C++26)

deque

forward_list (C++11)

list

Associative

set

multiset

map

multimap

Unordered associative

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

Adaptors

stack

queue

priority_queue

flat_set (C++23)

flat_multiset (C++23)

flat_map (C++23)

flat_multimap (C++23)

Views

span (C++20)

mdspan (C++23)

Tables

Iterator invalidation

Member function table

Non-member function table

 

std::flat_multiset

Member types

Member functions

flat_multiset::flat_multiset   flat_multiset::operator= Iterators flat_multiset::beginflat_multiset::cbegin flat_multiset::endflat_multiset::cend flat_multiset::rbeginflat_multiset::crbegin flat_multiset::rendflat_multiset::crend Capacity flat_multiset::size flat_multiset::max_size flat_multiset::empty Observers flat_multiset::key_comp flat_multiset::value_comp Modifiers flat_multiset::clear flat_multiset::insert flat_multiset::insert_range flat_multiset::emplace flat_multiset::emplace_hint flat_multiset::erase flat_multiset::swap flat_multiset::extract flat_multiset::replace Lookup flat_multiset::count flat_multiset::find flat_multiset::contains flat_multiset::equal_range flat_multiset::lower_bound flat_multiset::upper_bound

Non-member functions

swap(std::flat_multiset) erase_if(std::flat_multiset)    operator==operator<=>

Helper classes

uses_allocator<std::flat_multiset>

Tags

sorted_equivalent         sorted_equivalent_t

Deduction guides

 

template< class... Args > iterator emplace( Args&&... args );		(since C++23) (constexpr since C++26)

Inserts a new element into the container constructed in-place with the given args.

First, initializes an object t of type value_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.

Parameters

args

-

arguments to forward to the constructor of the element

Return value

An iterator to the inserted element.

Exceptions

If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).

Complexity

Logarithmic in the size of the container.

Notes

Careful use of emplace allows the new element to be constructed while avoiding unnecessary copy or move operations.

Example

See also

emplace_hint	constructs elements in-place using a hint (public member function)
insert	inserts elements (public member function)

Follow Lee on X/Twitter - Father, Husband, Serial builder creating AI, crypto, games & web tools. We are friends :) AI Will Come To Life!

Check out: eBank.nz (Art Generator) | Netwrck.com (AI Tools) | Text-Generator.io (AI API) | BitBank.nz (Crypto AI) | ReadingTime (Kids Reading) | RewordGame | BigMultiplayerChess | WebFiddle | How.nz | Helix AI Assistant