std::deque::push_back
From cppreference.com
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 |
[edit] 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).
|
[edit] Return value
(none)
[edit] Complexity
Constant.
[edit] Exceptions
If an exception is thrown, this function has no effect (strong exception guarantee).
[edit] Example
The following code uses push_back
to add several integers to a std::deque<int>:
Run this code
#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
[edit] See also
(C++11)
|
constructs elements in-place at the end (public member function) |
inserts elements to the beginning (public member function) |
|
removes the last element (public member function) |