| deque::push_back |
public member function |
void push_back ( const T& x ); |
|
Add element at the end
Adds a new element at the end of the deque container, after its current last element. The content of this new element is initialized to a copy of x.
This effectively increases the container size by one and invalidates all iterators to the deque, but has no effect on the validity of references to elements of the deque.
Parameters
- x
- Value to be copied to the new element.
T is the first template parameter (the type of the elements stored in the deque container).
Return value
none
Example
// deque::push_back
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
deque<int> mydeque;
int myint;
cout << "Please enter some integers (enter 0 to end):\n";
do {
cin >> myint;
mydeque.push_back (myint);
} while (myint);
cout << "mydeque stores " << (int) mydeque.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.
See also
