std::multiset<Key,Compare,Allocator>::insert

 

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)

Metaprogramming library (C++11)

Diagnostics library

General utilities library

Strings library

Containers library

Iterators library

Ranges library (C++20)

Algorithms library

Numerics library

Localizations library

Input/output library

Filesystem library (C++17)

Regular expressions library (C++11)

Concurrency support library (C++11)

Execution support library (C++26)

Technical specifications

Symbols index

External libraries

 

Containers library

Sequence

array (C++11)

vector

vector<bool>

inplace_vector (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::multiset

Member functions

multiset::multiset multiset::~multiset         multiset::operator= multiset::get_allocator

Iterators multiset::beginmultiset::cbegin (C++11) multiset::endmultiset::cend (C++11) multiset::rbeginmultiset::crbegin (C++11)     multiset::rendmultiset::crend (C++11) Capacity multiset::size multiset::max_size multiset::empty Observers multiset::key_comp multiset::value_comp Modifiers multiset::clear multiset::erase multiset::swap multiset::extract (C++17) multiset::merge (C++17) multiset::insert multiset::insert_range (C++23) multiset::emplace (C++11) multiset::emplace_hint (C++11) Lookup multiset::count multiset::find multiset::contains (C++20) multiset::equal_range multiset::lower_bound multiset::upper_bound

Non-member functions

std::swap(std::multiset) erase_if(std::multiset) (C++20)   operator==operator<=> (C++20) operator!=operator<operator>operator<=operator>= (until C++20)(until C++20)(until C++20)(until C++20)(until C++20)

Deduction guides(C++17)

 

iterator insert( const value_type& value );	(1)
iterator insert( value_type&& value );	(2)	(since C++11)
	(3)
iterator insert( iterator pos, const value_type& value );			(until C++11)
iterator insert( const_iterator pos, const value_type& value );			(since C++11)
iterator insert( const_iterator pos, value_type&& value );		(4)	(since C++11)
template< class InputIt > void insert( InputIt first, InputIt last );		(5)
void insert( std::initializer_list<value_type> ilist );		(6)	(since C++11)
iterator insert( node_type&& nh );		(7)	(since C++17)
iterator insert( const_iterator pos, node_type&& nh );		(8)	(since C++17)

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

1,2) Inserts value. If the container has elements with equivalent key, inserts at the upper bound of that range.

3,4) Inserts value in the position as close as possible to the position just prior to pos.

5) Inserts elements from range [first, last).

6) Inserts elements from initializer list ilist.

7) If nh is an empty node handle, does nothing. Otherwise, inserts the element owned by nh into the container and returns an iterator pointing at the inserted element. If a range containing elements with keys equivalent to nh.key() exists in the container, the element is inserted at the end of that range. The behavior is undefined if nh is not empty and get_allocator() != nh.get_allocator().

8) If nh is an empty node handle, does nothing and returns the end iterator. Otherwise, inserts the element owned by nh into the container, and returns the iterator pointing to the element with key equivalent to nh.key(). The element is inserted as close as possible to the position just prior to pos. The behavior is undefined if nh is not empty and get_allocator() != nh.get_allocator().

No iterators or references are invalidated. If the insertion is successful, pointers and references to the element obtained while it is held in the node handle are invalidated, and pointers and references obtained to that element before it was extracted become valid.(since C++17)

Parameters

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
nh	-	a compatible node handle
Type requirements
- InputIt must meet the requirements of LegacyInputIterator.

Return value

1-4) An iterator to the inserted element.

5,6) (none)

7,8) End iterator if nh was empty, iterator pointing to the inserted element otherwise.

Exceptions

1-4,7,8) If an exception is thrown by any operation, the insertion has no effect.

5,6) No exception safety guarantee.

Complexity

1,2,7) O(log(size()))

3,4,8) Amortized constant if the insertion happens in the position just before pos, O(log(size())) otherwise.

5,6) O(N·log(size() + N)), where N is the number of elements to insert.

Defect reports

The following behavior-changing defect reports were applied retroactively to previously published C++ standards.

DR	Applied to	Behavior as published	Correct behavior
LWG 233	C++98	pos was just a hint, it could be totally ignored	the insertion is required to be as close as possible to the position just prior to pos
LWG 264	C++98	the complexity of overload (5) was required to be linear if the range [first, last) is sorted according to Compare	removed the linear requirement in this special case
LWG 371	C++98	the order of equivalent elements was not guaranteed to be preserved	required to be preserved

See also

emplace (C++11)	constructs element in-place (public member function)
emplace_hint (C++11)	constructs elements in-place using a hint (public member function)
inserter	creates a std::insert_iterator of type inferred from the argument (function template)