Difference between revisions of "cpp/container/unordered multimap/insert"
From cppreference.com
< cpp | container | unordered multimap
Andreas Krug (Talk | contribs) m (., fmt) |
m |
||
| (One intermediate revision by one user not shown) | |||
| Line 67: | Line 67: | ||
===Return value=== | ===Return value=== | ||
| − | @1-6@ | + | @1-6@ An iterator to the inserted element. |
@7,8@ (none) | @7,8@ (none) | ||
| Line 83: | Line 83: | ||
@1-6@ Average case: {{tt|O(1)}}, worst case {{tt|O(size())}}. | @1-6@ Average case: {{tt|O(1)}}, worst case {{tt|O(size())}}. | ||
| − | @7,8@ Average case: {{tt|O(N)}}, where N is the number of elements to insert. | + | @7,8@ Average case: {{tt|O(N)}}, where N is the number of elements to insert. Worst case: {{tt|O(N * size() + N)}}. |
@9,10@ Average case: {{tt|O(1)}}, worst case {{tt|O(size())}}. | @9,10@ Average case: {{tt|O(1)}}, worst case {{tt|O(size())}}. | ||
| Line 92: | Line 92: | ||
===Defect reports=== | ===Defect reports=== | ||
{{dr list begin}} | {{dr list begin}} | ||
| − | {{dr list item|wg=lwg|dr=2005|std=C++11|before=overloads {{v|3,6}} would only | + | {{dr list item|wg=lwg|dr=2005|std=C++11|before=overloads {{v|3,6}} would only participate in overload<br>resolution if {{tt|P}} is implicitly convertible to {{tt|value_type}}|after=only participates if {{tt|value_type}}<br>is constructible from {{tt|P&&}}}} |
{{dr list end}} | {{dr list end}} | ||
Latest revision as of 13:36, 10 January 2024
| Defined in header <unordered_map>
|
||
| iterator insert( const value_type& value ); |
(1) | (since C++11) |
| iterator insert( value_type&& value ); |
(2) | (since C++17) |
| template< class P > iterator insert( P&& value ); |
(3) | (since C++11) |
| iterator insert( const_iterator hint, const value_type& value ); |
(4) | (since C++11) |
| iterator insert( const_iterator hint, value_type&& value ); |
(5) | (since C++17) |
| template< class P > iterator insert( const_iterator hint, P&& value ); |
(6) | (since C++11) |
| template< class InputIt > void insert( InputIt first, InputIt last ); |
(7) | (since C++11) |
| void insert( std::initializer_list<value_type> ilist ); |
(8) | (since C++11) |
| iterator insert( node_type&& nh ); |
(9) | (since C++17) |
| iterator insert( const_iterator hint, node_type&& nh ); |
(10) | (since C++17) |
Inserts element(s) into the container.
1-3) Inserts value.
Overload (3) is equivalent to emplace(std::forward<P>(value)) and only participates in overload resolution if std::is_constructible<value_type, P&&>::value == true.
4-6) Inserts value, using hint as a non-binding suggestion to where the search should start.
Overload (6) 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.
7) Inserts elements from range
[first, last). If
[first, last) is not a valid range, or first and/or last are iterators into *this, the behavior is undefined.8) Inserts elements from initializer list ilist.
9) If nh is an empty node handle, does nothing. Otherwise, inserts the element owned by nh into the container and returns an iterator pointing at the inserted element. The behavior is undefined if nh is not empty and get_allocator() != nh.get_allocator().
10) If nh is an empty node handle, does nothing and returns the end iterator. Otherwise, inserts the element owned by nh into the container, and returns the iterator pointing to the element with key equivalent to nh.key(). hint is used as a non-binding suggestion to where the search should start. The behavior is undefined if nh is not empty and get_allocator() != nh.get_allocator().
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 |
[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 |
| nh | - | a compatible node handle |
| Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
| ||
[edit] Return value
1-6) An iterator to the inserted element.
7,8) (none)
9,10) End iterator if nh was empty, iterator pointing to the inserted element otherwise.
[edit] Exceptions
1-6) If an exception is thrown for any reason, these functions have no effect (strong exception safety guarantee).
7,8) No exception safety guarantee.
9,10) If an exception is thrown for any reason, these functions have no effect (strong exception safety guarantee).
[edit] Complexity
1-6) Average case:
O(1), worst case O(size()).7,8) Average case:
O(N), where N is the number of elements to insert. Worst case: O(N * size() + N).9,10) Average case:
O(1), worst case O(size()).[edit] Example
| This section is incomplete Reason: no example |
[edit] Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
| DR | Applied to | Behavior as published | Correct behavior |
|---|---|---|---|
| LWG 2005 | C++11 | overloads (3,6) would only participate in overload resolution if P is implicitly convertible to value_type
|
only participates if value_typeis constructible from P&&
|
[edit] See also
| constructs element in-place (public member function) | |
| constructs elements in-place using a hint (public member function) | |
| creates a std::insert_iterator of type inferred from the argument (function template) |
