Traverse reverse randomly : vector reverse_iterator « vector « C++ Tutorial

Home
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 » vector » vector reverse_iterator 
16.23.2.Traverse reverse randomly
#include <vector> 
#include <iostream> 

using namespace std; 

vector<double> makevector(int size){

  vector<double> result;
  for (int i=1; i<=size; i++) { 
    result.push_back(double(i))
  
  return result; 


void print(const vector<double>& l


  cout << "Size of vector is: " << l.size() << endl; 

  vector<double>::const_iterator i; 

  for (i=l.begin(); i!=l.end(); i++
  
    cout << (*i<< " "
  

  cout << endl; 


int main() 

  vector<double> vector1=makevector(5)
  vector<double>::iterator bi; 

  vector<double>::reverse_iterator ri; 

  ri=vector1.rbegin();          // Set iterator 
  while (ri!=vector1.rend()) cout << (*ri++<< " "
  cout << endl << endl; 

  // Traverse reverse backward 
  cout << "Traverse reverse backward" << endl; 
  ri=(vector1.rend())
  do 
  
    cout << (*--ri<< " "
  
  while (ri!=vector1.rbegin())
  cout << endl << endl; 

}
16.23.vector reverse_iterator
16.23.1.Traverse reverse backward
16.23.2.Traverse reverse randomly
16.23.3.Declare a reverse iterator to the vector of char
16.23.4.Use a reverse iterator to show the contents of v in reverse
16.23.5.Illustrating normal and reverse iteration.
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.