std::unordered_multimap::insert
From cppreference.com
< cpp | container | unordered multimap
| iterator insert( const value_type& value );
|
(1) | (since C++11) |
| template <class P>
iterator 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 InputIt >
void insert( InputIt first, InputIt last ); |
(5) | (since C++11) |
| void insert( std::initializer_list<value_type> ilist );
|
(6) | (since C++11) |
Inserts element(s) into the container.
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 |
| 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-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) |
|
| constructs elements in-place using a hint (public member function) |
|