Namespaces
Variants
Views
Actions

std::unordered_map::insert

From cppreference.com
std::pair<iterator,bool> insert( const value_type& value );
(1) (since C++11)
template <class P>
std::pair<iterator, bool> insert( P&& value );
(2) (since C++11)
iterator insert( const_iterator hint, const value_type& value );
(3) (since C++11)
template <class P>
iterator insert( const_iterator hint, P&& value );
(4) (since C++11)
template <class InputIterator>
void insert( InputIterator first, InputIterator last );
(5) (since C++11)
void insert( std::initializer_list<value_type> ilist );
(6) (since C++11)

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

1-2) inserts value.

3-4) inserts value, using hint as a non-binding suggestion to where the search should start.

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

6) inserts elements from initializer list ilist.

If rehashing occurs due to the insertion, all iterators are invalidated. Otherwise iterators are not affected. References are not invalidated. Rehashing occurs only if the new number of elements is higher than max_load_factor()*bucket_count().

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 an iterator to the inserted element (or to the element that prevented the insertion) and a bool denoting whether the insertion took place.

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

5-6) none.

[edit] Complexity

1-4) Average case: O(1), worst case O(size())

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

[edit] See also

constructs element in-place
(public member function) [edit]
constructs elements in-place using a hint
(public member function) [edit]