public member function
<forward_list>

std::forward_list::emplace_after

template <class... Args>
  iterator emplace_after (const_iterator position, Args&&... args);
Construct and insert element
The container is extended by inserting a new element after the element at position. This new element is constructed in place using args as the arguments for its construction.

This effectively increases the container size by one.

Unlike other standard sequence containers, list and forward_list objects are specifically designed to be efficient inserting and removing elements in any position, even in the middle of the sequence.

To emplace elements at the beginning of the forward_list, use member function emplace_front, or call this function with before_begin as position.

The element is constructed in-place by calling allocator_traits::construct with args forwarded.

A similar member function exists, insert_after, which either copies or moves existing objects into the container.

Parameters

position
Position in the container after which the new element is inserted.
Member type const_iterator is a forward iterator type that points to a const element.
args
Arguments forwarded to construct the new element.

Return value

An iterator that points to the newly emplaced element.

Member type iterator is a forward iterator type that points to an element.

The storage for the new element is allocated using allocator_traits<allocator_type>::construct(), which may throw exceptions on failure (for the default allocator, bad_alloc is thrown if the allocation request does not succeed).

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
// forward_list::emplace_after
#include <iostream>
#include <forward_list>

int main ()
{
  std::forward_list< std::pair<int,char> > mylist;
  auto it = mylist.before_begin();

  it = mylist.emplace_after ( it, 100, 'x' );
  it = mylist.emplace_after ( it, 200, 'y' );
  it = mylist.emplace_after ( it, 300, 'z' );

  std::cout << "mylist contains:";
  for (auto& x: mylist)
    std::cout << " (" << x.first << "," << x.second << ")";

  std::cout << '\n';
  return 0;
}

Output:
mylist contains: (100,x) (200,y) (300,z)

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is modified.
No contained elements are accessed: concurrently accessing or modifying them is safe, although iterating ranges that include position is not.

Exception safety

Strong guarantee: if an exception is thrown, there are no changes in the container.
If allocator_traits::construct is not supported with the appropriate arguments, or if position is not valid, it causes undefined behavior.

See also

  • 997351548 2018-02-20
  • 903691547 2018-02-20
  • 9127171546 2018-02-20
  • 2234751545 2018-02-20
  • 1685381544 2018-02-20
  • 911091543 2018-02-20
  • 9281021542 2018-02-20
  • 632231541 2018-02-20
  • 9751491540 2018-02-20
  • 8333621539 2018-02-20
  • 995001538 2018-02-20
  • 6477441537 2018-02-20
  • 511981536 2018-02-19
  • 2072881535 2018-02-19
  • 6024461534 2018-02-19
  • 7594061533 2018-02-19
  • 9311341532 2018-02-19
  • 4928331531 2018-02-19
  • 38561530 2018-02-19
  • 7776611529 2018-02-19