Print the contents in reverse order using reverse_iterator and functions rbegin() and rend() : deque iterator « deque « 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 » deque » deque iterator

22.6.5.Print the contents in reverse order using reverse_iterator and functions rbegin() and rend()

#include <deque>

#include <iostream>



using namespace std;

typedef deque<int> INTDEQUE;



int main(void)

{

   INTDEQUE A;

   A.push_back(1);

   A.push_back(2);

   A.push_back(3);

   A.push_back(4);

   A.push_back(5);



   INTDEQUE::reverse_iterator rpi;

   for(rpi = A.rbegin(); rpi != A.rend(); rpi++)

      cout << *rpi << " ";

   cout<< endl;

}

22.6.deque iterator
	22.6.1.	Define iterator for deque
	22.6.2.	deque::iterator and deque::reverse_iterator
	22.6.3.	Using the Front of a Deque
	22.6.4.	Use iterator and reverse_iterator with deque
	22.6.5.	Print the contents in reverse order using reverse_iterator and functions rbegin() and rend()
	22.6.6.	Create an empty deque and then assign it a sequence that is the reverse of deque
	22.6.7.	Use insert iterator adaptors to insert one deque into another by way of the copy() algorithm.

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.