Inserts elements at the specified location in the container.
value
before pos
count
copies of the value
before pos
[first, last)
before pos
. This overload has the same effect as overload (3) if InputIt is an integral type. | (until C++11) |
This overload only participates in overload resolution if InputIt qualifies as InputIterator , to avoid ambiguity with the overload (3). | (since C++11) |
first
and last
are iterators into *this
. ilist
before pos
.Causes reallocation if the new size()
is greater than the old capacity()
. If the new size()
is greater than capacity()
, all iterators and references are invalidated. Otherwise, only the iterators and references before the insertion point remain valid. The past-the-end iterator is also invalidated.
pos | - | iterator before which the content will be inserted. pos may be the end() iterator |
value | - | element value to insert |
first, last | - | the range of elements to insert, can't be iterators into container for which insert is called |
ilist | - | initializer list to insert the values from |
Type requirements | ||
-T must meet the requirements of CopyAssignable and CopyInsertable in order to use overload (1). |
||
-T must meet the requirements of MoveAssignable and MoveInsertable in order to use overload (2). |
||
-T must meet the requirements of CopyAssignable and CopyInsertable in order to use overload (3). |
||
-T must meet the requirements of EmplaceConstructible in order to use overload (4,5). |
||
-T must meet the requirements of MoveAssignable and MoveInsertable in order to use overload (4). required only if InputIt satisfies InputIterator but not ForwardIterator . (until C++17) |
||
-T must meet the requirements of Swappable , MoveAssignable , MoveConstructible and MoveInsertable in order to use overload (4,5). (since C++17) |
value
pos
if count==0
.pos
if first==last
.pos
if ilist
is empty.pos
and end of the container.count
plus linear in the distance between pos
and end of the container.std::distance(first, last)
plus linear in the distance between pos
and end of the container.ilist.size()
plus linear in the distance between pos
and end of the container.If an exception is thrown when inserting a single element at the end, and T is CopyInsertable
or std::is_nothrow_move_constructible<T>::value
is true
, there are no effects (strong exception guarantee).
#include <iostream> #include <vector> void print_vec(const std::vector<int>& vec) { for (auto x: vec) { std::cout << ' ' << x; } std::cout << '\n'; } int main () { std::vector<int> vec(3,100); print_vec(vec); auto it = vec.begin(); it = vec.insert(it, 200); print_vec(vec); vec.insert(it,2,300); print_vec(vec); // "it" no longer valid, get a new one: it = vec.begin(); std::vector<int> vec2(2,400); vec.insert(it+2, vec2.begin(), vec2.end()); print_vec(vec); int arr[] = { 501,502,503 }; vec.insert(vec.begin(), arr, arr+3); print_vec(vec); }
Output:
(C++11) | constructs element in-place (public member function) |
adds an element to the end (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/vector/insert