Difference between revisions of "cpp/container/multimap/insert"
From cppreference.com
(subst:) |
|||
| Line 2: | Line 2: | ||
{{cpp/container/multimap/navbar}} | {{cpp/container/multimap/navbar}} | ||
{{dcl begin}} | {{dcl begin}} | ||
| − | {{dcl | num=1 | + | {{dcl | num=1 | |
| − | + | iterator insert( const value_type& value ); | |
| − | + | ||
| − | + | ||
| − | + | ||
}} | }} | ||
{{dcl | num=2 | since=c++11 | | {{dcl | num=2 | since=c++11 | | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
template< class P > | template< class P > | ||
iterator insert( P&& value ); | iterator insert( P&& value ); | ||
}} | }} | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
{{dcl rev begin | num=3}} | {{dcl rev begin | num=3}} | ||
{{dcl | until=c++11 | | {{dcl | until=c++11 | | ||
| Line 35: | Line 17: | ||
}} | }} | ||
{{dcl rev end}} | {{dcl rev end}} | ||
| − | |||
{{dcl | num=4 | since=c++11 | | {{dcl | num=4 | since=c++11 | | ||
| − | |||
| − | |||
| − | |||
| − | |||
template< class P > | template< class P > | ||
iterator insert( const_iterator hint, P&& value ); | iterator insert( const_iterator hint, P&& value ); | ||
}} | }} | ||
| − | + | {{dcl | num=5 | | |
| − | {{dcl | num=5 | + | |
template< class InputIt > | template< class InputIt > | ||
void insert( InputIt first, InputIt last ); | void insert( InputIt first, InputIt last ); | ||
| Line 54: | Line 30: | ||
{{dcl end}} | {{dcl end}} | ||
| − | + | Inserts element(s) into the container. | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | @1-2@ inserts {{tt|value}}. | + | @1-2@ inserts {{tt|value}}. If the container has elements with equivalent key, inserts at the upper bound of that range.{{mark since c++11}} The overload (2) is equivalent to {{c|emplace(std::forward<P>(value))}} and only participates in overload resolution if {{c|std::is_constructible<value_type, P&&>::value {{==}} true}}. |
| − | + | ||
| − | + | | @3-4@ inserts {{tt|value}} in the position as close as possible, just prior{{mark since c++11}}, to {{tt|hint}}. The overload (4) is equivalent to {{c|emplace_hint(hint, std::forward<P>(value))}} and only participates in overload resolution if {{c|std::is_constructible<value_type, P&&>::value {{==}} true}}. | |
| − | | @3-4@ inserts {{tt|value}} in the position as close as possible, just prior{{mark since c++11}}, to {{tt|hint}}. | + | |
| − | + | ||
| − | + | ||
| − | + | ||
@5@ inserts elements from range {{tt|[first, last)}}. | @5@ inserts elements from range {{tt|[first, last)}}. | ||
| Line 84: | Line 52: | ||
===Return value=== | ===Return value=== | ||
| − | + | @1-4@ Returns an iterator to the inserted element. | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
@5-6@ (none) | @5-6@ (none) | ||
| Line 99: | Line 62: | ||
===Complexity=== | ===Complexity=== | ||
| − | + | @1-2@ Logarithmic in the size of the container, {{tt|O(log(size()))}}. | |
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
| − | + | ||
{{rev begin}} | {{rev begin}} | ||
| Line 116: | Line 74: | ||
@5-6@ {{tt|O(N*log(size() + N))}}, where N is the number of elements to insert. | @5-6@ {{tt|O(N*log(size() + N))}}, where N is the number of elements to insert. | ||
| − | |||
===See also=== | ===See also=== | ||
Revision as of 14:35, 28 August 2013
| iterator insert( const value_type& value ); |
(1) | |
| template< class P > iterator insert( P&& value ); |
(2) | (since C++11) |
| (3) | ||
| iterator insert( iterator hint, const value_type& value ); |
(until C++11) | |
| iterator insert( const_iterator hint, const value_type& value ); |
(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) | |
| void insert( std::initializer_list<value_type> ilist ); |
(6) | (since C++11) |
Inserts element(s) into the container.
1-2) inserts
value. If the container has elements with equivalent key, inserts at the upper bound of that range.(since C++11) 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 in the position as close as possible, just prior(since C++11), to hint. 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.No iterators or references are 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 | ||
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-2) Logarithmic in the size of the container,
O(log(size())).|
3-4) Amortized constant if the insertion happens in the position just after the hint, logarithmic in the size of the container otherwise.
|
(until C++11) |
|
3-4) Amortized constant if the insertion happens in the position just before the hint, logarithmic in the size of the container otherwise.
|
(since C++11) |
5-6)
O(N*log(size() + N)), where N is the number of elements to insert.See also
| (C++11) |
constructs element in-place (public member function) |
| (C++11) |
constructs elements in-place using a hint (public member function) |
