Define iterator for deque : deque iterator « Deque « C++

1. C++
2. Deque
3. deque iterator

Define iterator for deque

 
 

// Demonstrating the generic find algorithm with a deque
#include <iostream>
#include <cassert>
#include <deque>
#include <algorithm>  // For find
using namespace std;


int main()
{
  int x[5] = {1, 2, 3, 4, 5};

  deque<int> deque1(&x[0], &x[5]);

  // Search for the first occurrence of the letter e:
  deque<int>::iterator i;

  cout.precision(10);

  for (i = deque1.begin(); i != deque1.end(); ++i)
    cout << *i << endl;
  return 0;
}

/* 
1
2
3
4
5

 */        
  

Related examples in the same category