C++ list pop_front()

#include <iostream>
#include <list>
using namespace std;
int main()//from   w w w  .  j a va2 s  .c o m
{
   list<int> ilist;
   ilist.push_back(30);              // push items on back
   ilist.push_back(40);
   ilist.push_front(20);             // push items on front
   ilist.push_front(10);
   int size = ilist.size();          // number of items
   for(int j=0; j<size; j++)
   {
      cout << ilist.front() << ' ';  // read item from front
      ilist.pop_front();             // pop item off front
   }
   cout << endl;
   return 0;
}

#include <iostream>
#include <list>
using namespace std;
int main()/*from   w ww  . j  ava 2  s  .c o m*/
{
   int j;
   list<int> list1, list2;
   int arr1[] = { 40, 30, 20, 10 };
   int arr2[] = { 15, 20, 25, 30, 35 };
   for(j=0; j<4; j++)
      list1.push_back( arr1[j] );    // list1: 40, 30, 20, 10
   for(j=0; j<5; j++)
      list2.push_back( arr2[j] );    // list2: 15, 20, 25, 30, 35
   list1.reverse();                  // reverse list1: 10 20 30 40
   list1.merge(list2);               // merge list2 into list1
   list1.unique();                   // remove duplicate 20 and 30
   int size = list1.size();
   while( !list1.empty() )
   {
      cout << list1.front() << ' ';  // read item from front
      list1.pop_front();             // pop item off front
   }
   cout << endl;
   return 0;
}