Difference between revisions of "cpp/container/unordered multimap/insert"
From cppreference.com
< cpp | container | unordered multimap
m (r2.7.3) (Robot: Adding de, es, fr, it, ja, pt, ru, zh) |
(use {{include page}}) |
||
| Line 1: | Line 1: | ||
| − | {{cpp/container/insert assoc|unordered_multimap}} | + | {{include page|cpp/container/insert assoc|unordered_multimap}} |
[[de:cpp/container/unordered multimap/insert]] | [[de:cpp/container/unordered multimap/insert]] | ||
Revision as of 06:48, 9 June 2013
| 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. The overload 2) is equivalent to emplace(std::forward<P>(value)) and only participates in overload resolution if std::is_constructible<value_type, P&&>::value == true.3-4) inserts
value, using hint as a non-binding suggestion to where the search should start. The overload 4) is equivalent to emplace_hint(hint, std::forward<P>(value)) and only participates in overload resolution if std::is_constructible<value_type, P&&>::value == true.5) inserts elements from range
[first, last).6) inserts elements from initializer list
ilist.If after the operation the new number of elements is greater than old max_load_factor() * bucket_count() a rehashing takes place.
If rehashing occurs (due to the insertion), all iterators are invalidated. Otherwise (no rehashing), iterators are not invalidated. 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.(since C++17)
Contents |
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 LegacyInputIterator.
| ||
Return value
1-4) Returns an iterator to the inserted element.
5-6) (none)
Exceptions
1-4) If an exception is thrown by any operation, the insertion has no effect.
| This section is incomplete Reason: cases 5-6 |
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)See also
| constructs element in-place (public member function) | |
| constructs elements in-place using a hint (public member function) |
