std::unordered_map::insert

From Cppreference

Jump to: navigation, search
std::pair<iterator,bool> insert( const value_type& value );
(1) (C++11 feature)
template <class P>
std::pair<iterator, bool> insert( P&& value );
(2) (C++11 feature)
iterator insert( const_iterator hint, const value_type& value );
(3) (C++11 feature)
template <class P>
iterator insert( const_iterator hint, P&& value );
(4) (C++11 feature)
template <class InputIterator>
void insert( InputIterator first, InputIterator last );
(5) (C++11 feature)
void insert( std::initializer_list<value_type> ilist );
(6) (C++11 feature)

Inserts elements to the container.

1-2) inserts value.

3-4) inserts value, using hint as a suggestion where the element should go.

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

6) inserts elements from initializer list ilist.

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

[edit] Return value

1-2) returns a pair consisting of a bool denoting whether the insertion took place and an iterator to the inserted element.

3-4) returns an iterator to the inserted element or to the element, that prevented the insertion.

5-6) none.

[edit] Complexity

[edit] See also

emplace
constructs element in-place
(public member function)
emplace_hint
constructs elements in-place using a hint
(public member function)