std::multiset::insert

From cppreference.com
iterator insert( const value_type& value );
(1)
iterator insert( value_type&& value );
(2) (since C++11)
iterator insert( iterator hint, const value_type& value );
iterator insert( const_iterator hint, const value_type& value );
(3) (until C++11)
(since C++11)
iterator insert( const_iterator hint, 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)

Inserts element(s) into the container.

1-2) inserts value. If the container has elements with equivalent key, inserts at the upper bound of that range.(since C++11)

3-4) inserts value in the position as close as possible, just prior(since C++11), to hint.

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

6) inserts elements from initializer list ilist.

No iterators or references are invalidated.

Contents

[edit] Parameters

hint - iterator, used as a suggestion as to where to insert the content
value - element value to insert
first, last - range of elements to insert
ilist - initializer list to insert the values from
Type requirements
-
InputIt must meet the requirements of InputIterator.

[edit] Return value

1-2) returns an iterator to the inserted element.

3-4) returns an iterator to the inserted element.

5-6) none.

[edit] Complexity

1-2) Logarithmic in the size of the container, O(log(size())).

3-4) Amortized constant if the insertion happens in the position just after(until C++11)/before(since C++11) the hint, logarithmic in the size of the container otherwise.

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

[edit] See also

(C++11)
constructs element in-place
(public member function)
(C++11)
constructs elements in-place using a hint
(public member function)