iterator insert_after( const_iterator pos, const T& value ); | (1) | (since C++11) |
iterator insert_after( const_iterator pos, T&& value ); | (2) | (since C++11) |
iterator insert_after( const_iterator pos, size_type count, const T& value ); | (3) | (since C++11) |
template< class InputIt > iterator insert_after( const_iterator pos, InputIt first, InputIt last ); | (4) | (since C++11) |
iterator insert_after( const_iterator pos, std::initializer_list<T> ilist ); | (5) | (since C++11) |
Inserts elements after the specified position in the container.
value
after the element pointed to by pos
count
copies of the value
after the element pointed to by pos
[first, last)
after the element pointed to by pos
. The behavior is undefined if first
and last
are iterators into *this
. ilist
.No iterators or references are invalidated.
pos | - | element after which the content will be inserted |
value | - | element value to insert |
first, last | - | the range of elements to insert |
ilist | - | initializer list to insert the values from |
Type requirements | ||
-
InputIt must meet the requirements of InputIterator . |
pos
if count==0
.pos
if first==last
.pos
if ilist
is empty.If an exception is thrown during insert_after
there are no effects (strong exception guarantee).
count
std::distance(first, last)
ilist.size()
constructs elements in-place after an element (public member function) |
|
inserts an element to the beginning (public member function) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/forward_list/insert_after