Accessing the Front and Back of a List with while loop : list begin end « list « C++ Tutorial

1.	Language Basics
2.	Data Types
3.	Operators statements
4.	Array
5.	Development
6.	Exceptions
7.	Function
8.	Structure
9.	Class
10.	Operator Overloading
11.	Pointer
12.	File Stream
13.	template
14.	STL Introduction
15.	string
16.	vector
17.	list
18.	bitset
19.	set multiset
20.	valarray
21.	queue stack
22.	deque
23.	map multimap
24.	STL Algorithms Modifying sequence operations
25.	STL Algorithms Non modifying sequence operations
26.	STL Algorithms Binary search
27.	STL Algorithms Sorting
28.	STL Algorithms Merge
29.	STL Algorithms Min Max
30.	STL Algorithms Iterator
31.	STL Algorithms Heap
32.	STL Algorithms Helper

C / ANSI-C

C Tutorial

C++

Visual C++ .NET

C++ Tutorial » list » list begin end

17.4.1.Accessing the Front and Back of a List with while loop

#include <algorithm>

#include <iostream>

#include <list>



using namespace std;



int main( )

{

   const char* name_data[] = { "A", "B","C", "D", "E","F", "G" };

   const bool girl_data[] = { true, true, false, false, true, true, true };

   const int num_graduates = sizeof( girl_data ) / sizeof( girl_data[0] );



   list< pair< string, bool > > graduate;



   while( !graduate.empty() )

   {

      cout << graduate.front().first;

      graduate.pop_front();

      if( !graduate.empty() )

      {

        cout << " and " << graduate.back().first;

        graduate.pop_back();

      }

      cout << endl;

   }

}

17.4.list begin end
	17.4.1.	Accessing the Front and Back of a List with while loop
	17.4.2.	Accessing the Front and Back of a List with for loop
	17.4.3.	end() is the pointer to the end of a list
	17.4.4.	list.begin and list.end

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.