public member function
<list>

std::list::push_back

void push_back (const value_type& val);

void push_back (const value_type& val);
void push_back (value_type&& val);
Add element at the end
Adds a new element at the end of the list container, after its current last element. The content of val is copied (or moved) to the new element.

This effectively increases the container size by one.

Parameters

val
Value to be copied (or moved) to the new element.
Member type value_type is the type of the elements in the container, defined in list as an alias of its first template parameter (T).

Return value

none

The storage for the new elements is allocated using the container's allocator, 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
 
// list::push_back
#include <iostream>
#include <list>

int main ()
{
  std::list<int> mylist;
  int myint;

  std::cout << "Please enter some integers (enter 0 to end):\n";

  do {
    std::cin >> myint;
    mylist.push_back (myint);
  } while (myint);

  std::cout << "mylist stores " << mylist.size() << " numbers.\n";

  return 0;
}

The example uses push_back to add a new element to the container each time a new integer is read.

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is modified.
No existing contained elements are accessed: concurrently accessing or modifying them is safe.

Exception safety

Strong guarantee: if an exception is thrown, there are no changes in the container.
If allocator_traits::construct is not supported with val as argument, it causes undefined behavior.

See also

list::push_front
Insert element at beginning (public member function )
list::pop_back
Delete last element (public member function )
list::insert
Insert elements (public member function )

C++