Generic find algorithm with input iterators associated with io streams : find « STL Algorithms Non modifying sequence operations « C++






Generic find algorithm with input iterators associated with io streams

  
 
#include <iostream>
#include <cassert>
#include <algorithm>
#include <list>
#include <iterator>
using namespace std; 

int main() 
{
  cout << "Type some characters, including an 'x' followed\n"
    << "by at least one nonwhite-space character: " << flush;

  istream_iterator<char> in(cin);
  istream_iterator<char> eos;
  find(in, eos, 'x');

  cout << "The first nonwhite-space character following\n"
       << "the first 'x' was '" << *(++in) << "'." << endl;
  
  return 0;
}

 /* 
Type some characters, including an 'x' followed
by at least one nonwhite-space character: x is before y
The first nonwhite-space character following
the first 'x' was 'i'.

 */       
    
  








Related examples in the same category

1.Use find to search an element in a container
2.find an element in a list
3.Find the maximum element in a range in a list
4.Locate first occurrence of a value in a vector
5.Using find with normal iteration
6.Demonstrating generic find algorithm with an array
7.Generic find algorithm: use find function to find an element in an array
8.Use find algorithm to find an element in a list
9.Use istream_iterator and find
10.Use assert to check the find method
11.find and display v in lowest 20th percentile
12.find and display v in highest 20th percentile
13.find and display sorted v in lowest 20th percentile
14.find and display sorted v in highest 20th percentile