deque::pop_front |
public member function |
Delete first element
Removes the first element in the deque container, effectively reducing the deque size by one.
This calls the removed element's destructor.
Parameters
none
Return value
none
Example
// deque::pop_front
#include <iostream>
#include <deque>
using namespace std;
int main ()
{
deque<int> mydeque;
int sum (0);
mydeque.push_back (100);
mydeque.push_back (200);
mydeque.push_back (300);
cout << "Popping out the elements in mydeque:";
while (!mydeque.empty())
{
cout << " " << mydeque.front();
mydeque.pop_front();
}
cout << "\nFinal size of mydeque is " << int(mydeque.size()) << endl;
return 0;
}
|
Output:
Popping out the elements in mydeque: 100 200 300 Final size of mydeque is 0
|
Complexity
Constant.
See also