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

Since C++23

Inserts element(s) into the container. The order of the remaining equivalent elements is preserved.

# Declarations

iterator insert( const value_type& value )

(since C++23)

iterator insert( value_type&& value );

(since C++23)

iterator insert( const_iterator pos, const value_type& value );

(since C++23)

iterator insert( const_iterator pos, value_type&& value );

(since C++23)

template< class InputIt >
void insert( InputIt first, InputIt last );

(since C++23)

template< class InputIt >
void insert( std::sorted_equivalent_t, InputIt first, InputIt last );

(since C++23)

void insert( std::initializer_list<key_type> ilist );

(since C++23)

void insert( std::sorted_equivalent_t s, std::initializer_list<key_type> ilist );

(since C++23)

pos: iterator to the position before which the new element will be inserted
value: element value to insert
first, last: range of elements to insert
ilist: initializer list to insert the values from
s: a disambiguation tag indicating that the input sequence is sorted (with respect to key_compare)

This section is incompleteReason: no example