std::multiset insert() method

since C++17

// (1) Non const version only
iterator insert( const value_type& value );

// (2) Non const version only
iterator insert( value_type&& value );

// (3) Non const version only
iterator insert( const_iterator hint, const value_type& value );

// (4) Non const version only
iterator insert( const_iterator hint, value_type&& value );

// (5) Non const  version only
template< class InputIt >
void insert( InputIt first, InputIt last );

// (6) Non const  version only
void insert( std::initializer_list<value_type> ilist );

// (7) Non const  version only
iterator insert( node_type&& nh );

// (8) Non const  version only
iterator insert( const_iterator hint, node_type&& nh );

since C++11

// (1) Non const version only
iterator insert( const value_type& value );

// (2) Non const version only
iterator insert( value_type&& value );

// (3) Non const version only
iterator insert( const_iterator hint, const value_type& value );

// (4) Non const version only
iterator insert( const_iterator hint, value_type&& value );

// (5) Non const  version only
template< class InputIt >
void insert( InputIt first, InputIt last );

// (6) Non const  version only
void insert( std::initializer_list<value_type> ilist );

until C++11

// (1) Non const version only
iterator insert( const value_type& value );

// (3) Non const version only
iterator insert( const_iterator hint, const value_type& value );

// (5) Non const  version only
template< class InputIt >
void insert( InputIt first, InputIt last );

Inserts element(s) into the container, if the container doesn't already contain an element with an equivalent key.

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

• (3-4)

  since C++11

  Inserts value in the position as close as possible, just prior, to hint.

  until C++11

  Inserts value in the position as close as possible to hint.

• (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, if the container doesn't already contain an element with a key equivalent to nh.key(). 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, if the container doesn't already contain an element with a key equivalent to n.key(), and returns the iterator pointing to the element with key equivalent to nh.key() (regardless of whether the insert succeeded or failed). If the insertion succeeds, nh is moved from, otherwise it retains ownership of the element. The element is inserted as close as possible to the position just prior to hint. The behavior is undefined if nh is not empty and get_allocator() != nh.get_allocator().

since C++17

No iterators or references are invalidated.

until C++11

Invalidation

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.

Parameters

• hint
  since C++11

  iterator to the position before which the new element will be inserted

  until C++11

  iterator, used as a suggestion as to where to start the search
• value - element value to insert
• first, last - the range of elements to insert
• ilist - initializer list to insert the values from
• nh - a compatible node handle

Type requirements

• (5) - InputIt must meet the requirements of LegacyInputIterator.

Return value

• (1-4) Returns an iterator to the inserted element.
• (5-6) (none)
• (7-8) End iterator if nh is empty, iterator pointing to the inserted element otherwise.

Complexity

• (1-2) Logarithmic in the size of the container - O(log size()).
• (3-4)
  since C++11

  Amortized constant if the insertion happens in the position just before the hint - O(1).
  Logarithmic in the size of the container otherwise - O(log size()).

  until C++11

  Amortized constant if the insertion happens in the position just after the hint - O(1).
  Logarithmic in the size of the container otherwise - O(log size()).
• (5-6) O(N * log(size() + N)), where N is the number of elements to insert.
• (7) Logarithmic in the size of the container - O(log size()).
• (8)
  Amortized constant if the insertion happens in the position just before the hint - O(1).
  Logarithmic in the size of the container otherwise - O(log size()).

Exceptions

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

important

This section requires improvement. You can help by editing this doc page.

Example

important

This section requires improvement. You can help by editing this doc page.