std::list<T,Allocator>::push_back (3) - Linux Manuals

std::list<T,Allocator>::push_back: std::list<T,Allocator>::push_back

NAME

std::list<T,Allocator>::push_back - std::list<T,Allocator>::push_back

Synopsis


void push_back( const T& value ); (1)
void push_back( T&& value ); (2) (since C++11)


Appends the given element value to the end of the container.
1) The new element is initialized as a copy of value.
2) value is moved into the new element.
No iterators or references are invalidated.

Parameters


value - the value of the element to append

Type requirements


-
T must meet the requirements of CopyInsertable in order to use overload (1).
-
T must meet the requirements of MoveInsertable in order to use overload (2).

Return value


(none)

Complexity


Constant.

Exceptions


If an exception is thrown (which can be due to Allocator::allocate() or element copy/move constructor/assignment), this function has no effect (strong exception guarantee).

Example


// Run this code


  #include <list>
  #include <iostream>
  #include <iomanip>


  int main()
  {
      std::list<std::string> numbers;


      numbers.push_back("abc");
      std::string s = "def";
      numbers.push_back(std::move(s));


      std::cout << "list holds: ";
      for (auto&& i : numbers) std::cout << std::quoted(i) << ' ';
      std::cout << "\nMoved-from string holds " << std::quoted(s) << '\n';
  }

Output:


  list holds: "abc" "def"
  Moved-from string holds ""

See also


emplace_back constructs an element in-place at the end
             (public member function)
(C++11)
             inserts an element to the beginning
push_front (public member function)
             removes the last element
pop_back (public member function)