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.
2.	Reverse iterators and copy.
3.	Assigning deque objects.
4.	Demonstrate swap() for deque
5.	Demonstrate resize() for deque
6.	Iterator values may change.
7.	Demonstrate raw storage iterators
8.	Demonstrate a deque.
9.	Deque: push, pop, sort, find, begin, end, insert

Use reverse iterators. : Deque « Data Structure « C++

Related examples in the same category