list.pop_front(): remove element from front : list push pop « list « C++ Tutorial






#include <iostream>
using std::cout;
using std::endl;

#include <list>      // list class-template definition
#include <algorithm> // copy algorithm
#include <iterator>  // ostream_iterator

int main()
{
   int array[ 4 ] = { 2, 6, 4, 8 };
   std::list< int > values;      // create list of ints
   std::list< int > otherValues; // create list of ints
   std::ostream_iterator< int > output( cout, " " );

   // insert items in values
   values.push_front( 1 );
   values.push_front( 3 );
   values.push_back( 4 );
   values.push_back( 2 );

   cout << "values contains: ";
   std::copy( values.begin(), values.end(), output );

   values.pop_front(); // remove element from front

   cout << "\n\nvalues contains: ";
   std::copy( values.begin(), values.end(), output );

   cout << endl;
   return 0;
}
values contains: 3 1 4 2

values contains: 1 4 2








17.11.list push pop
17.11.1.list: push_back and push_front
17.11.2.list: push_back, front, empty and pop_front
17.11.3.Add some data by push_front
17.11.4.Demonstrating the difference between push_back() and push_front()
17.11.5.list.pop_front(): remove element from front
17.11.6.difference between push_back() and push_front()
17.11.7.list.pop_back(): remove element from back