Namespaces
Variants
Views
Actions

std::deque::push_back

From cppreference.com
< cpp‎ | container‎ | deque
Revision as of 21:30, 2 November 2012 by P12bot (Talk | contribs)

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.

All iterators, including the past-the-end iterator, are invalidated. No references are invalidated.

Contents

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, this function has no effect (strong exception guarantee).


Example

The following code uses push_back to add several integers to a std::deque<int>:

#include <deque>
#include <iostream>
 
int main()
{
    std::deque<int> numbers;
 
    numbers.push_back(42);
    numbers.push_back(314159); 
 
    for (int i : numbers) { // c++11 range-based for loop
        std::cout << i << '\n';
    } 
 
    return 0;
}

Output:

42
314159

See also

constructs elements in-place at the end
(public member function) [edit]
inserts elements to the beginning
(public member function) [edit]
removes the last element
(public member function) [edit]