Bidirectional random access iterators : vector access « 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 access 
16.25.5.Bidirectional random access iterators
#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; 

  // Traverse random 
  cout << "Traverse random" << endl; 
  bi=vector1.begin()
  cout << *bi << " ";                // First element 
  cout << *(bi+=3<< " ";     // 1+3 is 4th element 
  cout << *(bi-=1<< " ";     // 4-1 is third element 
  cout << bi[-1<< " ";             // 3-1 is second element 
  cout << bi[1<< endl << endl;   // 3+1 is fourth element 

  // Create bidirectional iterator 
  vector<double>::reverse_iterator ri; 

 
  // Traverse reverse random 
  cout << "Traverse reverse random" << endl; 
  cout << *ri << " ";               // First element 
  cout << *(ri+=3<< " ";        // 1+3 is 4th element 
  cout << *(ri-=1<< " ";        // 4-1 is third element 
  cout << ri[-1<< " ";          // 3-1 is second element 
  cout << ri[1<< endl << endl;  // 3+1 is fourth element 

}
16.25.vector access
16.25.1.Random access of a vector
16.25.2.the use of the subscripting operator
16.25.3.Checked and Unchecked Access of a Vector
16.25.4.access field for vector
16.25.5.Bidirectional random access iterators
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.