Search the sequence [ first1 , last1 ) for an element that is contained in the set [ first2 , last2 ). Return an iterator for the sequence [ first1 , last1 ) to the first element in the matching set, or last1 if a match is not found.

Declaration


  
#include <algorithm>

template< class ForwardIterator1, class ForwardIterator2 >
ForwardIterator1 find_first_of
  (
  ForwardIterator1 first1,
  ForwardIterator1 last1,
  ForwardIterator2 first2,
  ForwardIterator2 last2
  );

template
  <
  class ForwardIterator1,
  class ForwardIterator2,
  class BinaryPredicate
  >
ForwardIterator1 find_first_of
  (
  ForwardIterator1 first1,
  ForwardIterator1 last1,
  ForwardIterator2 first2,
  ForwardIterator2 last2,
  BinaryPredicate predicate
  );

Complexity

At most ( last - first ) * ( last2 - first2 ) applications of predicate will occur.

Example <ospace/osstd/examples/find1st1.cpp>


    #include <iostream>
#include <algorithm>

char phrase[ 12 ] = "Texas Fight";
const char vowels[ 11 ] = "AEIOUaeiou";

void
main()
  {
  char* end = find_first_of( phrase, phrase + 12, vowels, vowels + 11 );

  if ( end == phrase + 12 )
    cout << "No vowels found.\n";
  else
    cout << "The first vowel is \"" << *end << "\"\n";

  }

The first vowel is "e"

Example <ospace/osstd/examples/find1st2.cpp>


    #include <iostream>
#include <ctype.h>
#include <algorithm>

char phrase[ 10 ] = "Go Big Red";
const char vowels[ 6 ] = "AEIOU";

bool
match_nocase( const char& a, const char& b )
  {
  return toupper( a ) == b;
  }

void
main()
  {
  char* end = find_first_of
    (
    phrase,
    phrase + 12,
    vowels,
    vowels + 6,
    match_nocase
    );

  if ( end == phrase + 12 )
    cout << "No vowels found.\n";
  else
    cout << "The first vowel is \"" << *end << "\"\n";
   }

The first vowel is "o"

find_first_of

Library

Declaration

Complexity

Example <ospace/osstd/examples/find1st1.cpp>

Example <ospace/osstd/examples/find1st2.cpp>