list.pop_back(): remove element from back : list push pop « List « C++

Home
C++
1.Bitset
2.Class
3.Console
4.Data Structure
5.Data Type
6.Deque
7.Development
8.File
9.Function
10.Generic
11.Language
12.List
13.Map Multimap
14.Overload
15.Pointer
16.Qt
17.Queue Stack
18.Set Multiset
19.STL Algorithms Binary search
20.STL Algorithms Heap
21.STL Algorithms Helper
22.STL Algorithms Iterator
23.STL Algorithms Merge
24.STL Algorithms Min Max
25.STL Algorithms Modifying sequence operations
26.STL Algorithms Non modifying sequence operations
27.STL Algorithms Sorting
28.STL Basics
29.String
30.Valarray
31.Vector
C / ANSI-C
C Tutorial
C++ Tutorial
Visual C++ .NET
C++ » List » list push popScreenshots 
list.pop_back(): remove element from back
 
 

#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 array264};
   std::list< int > values;      // create list of ints
   std::list< int > otherValues; // create list of ints
   std::ostream_iterator< int > outputcout, " " );

   // insert items in values
   values.push_front);
   values.push_front);
   values.push_back);
   values.push_back);

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

   values.pop_back();// remove element from back

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

   cout << endl;
   return 0;
}

 /* 
values contains: 3 1 4 2

values contains: 3 1 4

 */       
  
Related examples in the same category
1.list: push_back and push_front
2.list: push_back, front, empty and pop_front
3.Demonstrating the difference between push_back() and push_front()
4.list.pop_front(): remove element from front
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.