| 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.
Parameters
| pos | - | iterator after which the content will be inserted |
| value | - | element value to insert |
| count | - | number of copies 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 LegacyInputIterator.
| ||
Return value
pos if count == 0.pos if first == last.pos if ilist is empty.Exceptions
If an exception is thrown for any reason, these functions have no effect (strong exception safety guarantee).
Complexity
count.std::distance(first, last).ilist.size().Example
#include <forward_list>
#include <iostream>
#include <string>
#include <vector>
void print(const std::forward_list<int>& list)
{
std::cout << "list: {";
for (char comma[3] = {'\0', ' ', '\0'}; int i : list)
{
std::cout << comma << i;
comma[0] = ',';
}
std::cout << "}\n";
}
int main()
{
std::forward_list<int> ints{1, 2, 3, 4, 5};
print(ints);
// insert_after (2)
auto beginIt = ints.begin();
ints.insert_after(beginIt, -6);
print(ints);
// insert_after (3)
auto anotherIt = beginIt;
++anotherIt;
anotherIt = ints.insert_after(anotherIt, 2, -7);
print(ints);
// insert_after (4)
const std::vector<int> v = {-8, -9, -10};
anotherIt = ints.insert_after(anotherIt, v.cbegin(), v.cend());
print(ints);
// insert_after (5)
ints.insert_after(anotherIt, {-11, -12, -13, -14});
print(ints);
}list: {1, 2, 3, 4, 5}
list: {1, -6, 2, 3, 4, 5}
list: {1, -6, -7, -7, 2, 3, 4, 5}
list: {1, -6, -7, -7, -8, -9, -10, 2, 3, 4, 5}
list: {1, -6, -7, -7, -8, -9, -10, -11, -12, -13, -14, 2, 3, 4, 5}See also
| constructs elements in-place after an element (public member function) | |
| inserts an element to the beginning (public member function) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.