public member function

std::forward_list::emplace_front

<forward_list>
template <class... Args>
void emplace_front (Args&&... args);
Construct and insert element at beginning
Inserts a new element at the beginning of the forward_list, right before its current first element. This new element is constructed in place using args as the arguments for its constructor.

This effectively increases the container size by one.

A similar member function exists, push_front, which either copies or moves an existing object into the container.

Parameters

args
Arguments passed to the constructor of the new element.

Return value

none

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
// forward_list::emplace_front
#include <iostream>
#include <forward_list>

int main ()
{
  std::forward_list< std::pair<int,char> > mylist;

  mylist.emplace_front(10,'a');
  mylist.emplace_front(20,'b');
  mylist.emplace_front(30,'c');

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

  std::cout << std::endl;
  return 0;
}


Output:
mylist contains: (30,c) (20,b) (10,a) 

Complexity

Constant.

Iterator validity

All of the iterators, pointers and references remain valid after the insertion and refer to the same elements they were referring to before.

See also