Use reverse iterators. : Deque « Data Structure « 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++ » Data Structure » DequeScreenshots 
Use reverse iterators.
Use reverse iterators.


#include <iostream>
#include <deque>
using namespace std;

int main()
{
  deque<int> dequeObject;
  deque<int>::reverse_iterator rp;
  int i;

  for(i = 0; i <10; i++
     dequeObject.push_back(i);

  cout << "Contents printed backward:\n";
  rp = dequeObject.rbegin();
  while(rp != dequeObject.rend()) {
    cout << *rp << " ";
    rp++;
  }
  cout << "\n\n";

  cout << "Contents printed forward:\n";
  rp = dequeObject.rend();
  while(rp != dequeObject.rbegin()) {
    rp--;
    cout << *rp << " ";
  }

  return 0;
}



           
       
Related examples in the same category
1.One way to reverse-copy a deque.One way to reverse-copy a deque.
2.Reverse iterators and copy.Reverse iterators and copy.
3.Assigning deque objects.Assigning deque objects.
4.Demonstrate swap() for dequeDemonstrate swap() for deque
5.Demonstrate resize() for dequeDemonstrate resize() for deque
6.Iterator values may change.Iterator values may change.
7.Demonstrate raw storage iteratorsDemonstrate raw storage iterators
8.Demonstrate a deque.Demonstrate a deque.
9.Deque: push, pop, sort, find, begin, end, insertDeque: push, pop, sort, find, begin, end, insert
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.