std::multiset<Key,Compare,Allocator>::insert
Min standard notice:
Inserts element(s) into the container. The order of the remaining equivalent elements is preserved.
# Declarations
iterator insert( const value_type& value );
iterator insert( value_type&& value );
(since C++11)
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 );
(since C++11)
template< class InputIt >
void insert( InputIt first, InputIt last );
void insert( std::initializer_list<value_type> ilist );
(since C++11)
iterator insert( node_type&& nh );
(since C++17)
iterator insert( const_iterator pos, node_type&& nh );
(since C++17)
# Parameters
pos: iterator to the position before which the new element will be insertedvalue: element value to insertfirst, last: range of elements to insertilist: initializer list to insert the values fromnh: a compatible node handle
# Example
This section is incompleteReason: no example
# Defect reports
| 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 tobe as close as possible to theposition just prior to pos |
| LWG 264 | C++98 | the complexity of overload (5) was required to be linear ifthe range [first, last) is sorted according to Compare | removed the linear requirementin this special case |
| LWG 371 | C++98 | the order of equivalent elements was not guaranteed to be preserved | required to be preserved |