std::{{{1}}}::insert
From cppreference.com
| iterator insert( const value_type& value ); |
(1) | (since {std}) |
| |
(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) | |
| |
(4) | (since C++11) |
| template< class InputIt > void insert( InputIt first, InputIt last ); |
(5) | (since {std}) |
| 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.| Information on iterator invalidation is copied from here |
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-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
| constructs element in-place (public member function of std::{{{1}}})
| |
| constructs elements in-place using a hint (public member function of std::{{{1}}})
|
