Difference between revisions of "cpp/container/unordered multimap/insert"
From cppreference.com
< cpp | container | unordered multimap
m (hinted note doesn't make sense for non-unique containers) |
(node handle insert) |
||
| Line 28: | Line 28: | ||
{{dcl | num=6 | since=c++11 | | {{dcl | num=6 | since=c++11 | | ||
void insert( std::initializer_list<value_type> ilist ); | void insert( std::initializer_list<value_type> ilist ); | ||
| + | }} | ||
| + | {{dcl | num=7 | since=c++17 | | ||
| + | iterator insert(node_type&& nh); | ||
| + | }} | ||
| + | {{dcl | num=8 | since=c++17 | | ||
| + | iterator insert(const_iterator hint, node_type&& nh); | ||
}} | }} | ||
{{dcl end}} | {{dcl end}} | ||
| Line 40: | Line 46: | ||
@6@ inserts elements from initializer list {{tt|ilist}}. | @6@ inserts elements from initializer list {{tt|ilist}}. | ||
| + | |||
| + | {{cpp/container/node_handle_insert_desc|unordered_multimap|7|8}} | ||
{{cpp/container/note_iterator_invalidation|unordered_multimap|insert}} | {{cpp/container/note_iterator_invalidation|unordered_multimap|insert}} | ||
| Line 48: | Line 56: | ||
{{par | first, last | range of elements to insert}} | {{par | first, last | range of elements to insert}} | ||
{{par | ilist | initializer list to insert the values from}} | {{par | ilist | initializer list to insert the values from}} | ||
| + | {{par | nh | a compatible [[cpp/container/node_handle|node handle]]}} | ||
{{par hreq}} | {{par hreq}} | ||
{{par req concept | InputIt | InputIterator}} | {{par req concept | InputIt | InputIterator}} | ||
| Line 56: | Line 65: | ||
@5-6@ (none) | @5-6@ (none) | ||
| + | |||
| + | {{cpp/container/node_handle_insert_return|unordered_multimap|7|8}} | ||
===Exceptions=== | ===Exceptions=== | ||
| Line 66: | Line 77: | ||
@5-6@ Average case: {{tt|O(N)}}, where N is the number of elements to insert. Worse case: {{tt|O(N*size()+N)}} | @5-6@ Average case: {{tt|O(N)}}, where N is the number of elements to insert. Worse case: {{tt|O(N*size()+N)}} | ||
| + | |||
| + | @7-8@ Average case: {{tt|O(1)}}, worst case {{tt|O(size())}} | ||
===See also=== | ===See also=== | ||
Revision as of 14:14, 26 July 2016
| iterator insert( const value_type& value ); |
(1) | (since C++11) |
| template< class P > iterator insert( P&& value ); |
(2) | (since C++11) |
| iterator insert( value_type&& value ); |
(2) | (since C++17) |
| 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) |
| iterator insert( const_iterator hint, value_type&& value ); |
(4) | (since C++17) |
| 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) |
| iterator insert(node_type&& nh); |
(7) | (since C++17) |
| iterator insert(const_iterator hint, node_type&& nh); |
(8) | (since C++17) |
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.7) 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().
8) 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 |
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 | ||
Return value
1-4) Returns an iterator to the inserted element.
5-6) (none)
7,8) End iterator if nh was empty, iterator pointing to the inserted element otherwise.
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)7-8) Average case:
O(1), worst case O(size())See also
| constructs element in-place (public member function) | |
| constructs elements in-place using a hint (public member function) |
