STL deque: push_back(), push_front(), pop_back(), pop_front() : deque push « deque « C++ Tutorial

1. C++ Tutorial
2. deque
3. deque push

#include <deque>
 #include <iostream>
 #include <algorithm>

 int main ()
 {
     using namespace std;

     deque <int> dqIntegers;

     dqIntegers.push_back (3);
     dqIntegers.push_back (4);
     dqIntegers.push_back (5);

     dqIntegers.push_front (2);
     dqIntegers.push_front (1);
     dqIntegers.push_front (0);

     for ( size_t nCount = 0; nCount < dqIntegers.size (); ++ nCount ){
         cout << "Element [" << nCount << "] = ";
         cout << dqIntegers [nCount] << endl;
     }

     // Erase an element at the top
     dqIntegers.pop_front ();

     // Erase an element at the bottom
     dqIntegers.pop_back ();

     deque <int>::iterator iElementLocator;
     for ( iElementLocator = dqIntegers.begin (); iElementLocator != dqIntegers.end (); ++ iElementLocator )
     {
         size_t nOffset = distance (dqIntegers.begin (), iElementLocator);
         cout<<"Element [" << nOffset << "] = " << *iElementLocator<<endl;
     }

     return 0;
}