| Category: algorithms | Component type: function |
template <class InputIterator
class ForwardIterator>
InputIterator find_first_of(InputIterator first1
InputIterator last1
ForwardIterator first2
ForwardIterator last2);
template <class InputIterator
class ForwardIterator
class BinaryPredicate>
InputIterator find_first_of(InputIterator first1
InputIterator last1
ForwardIterator first2
ForwardIterator last2
BinaryPredicate comp);
The two versions of find_first_of differ in how they compare elements for equality. The first uses operator== and the second uses and arbitrary user-supplied function object comp. The first version returns the first iterator i in [first1 last1) such that for some iterator j in [first2 last2) *i == *j. The second returns the first iterator i in [first1 last1) such that for some iterator j in [first2 last2) comp(*i *j) is true. As usual both versions return last1 if no such iterator i exists.
int main()
{
const char* WS = "\t\n ";
const int n_WS = strlen(WS);
char* s1 = "This sentence contains five words.";
char* s2 = "OneWord";
char* end1 = find_first_of(s1
s1 + strlen(s1)
WS
WS + n_WS);
char* end2 = find_first_of(s2
s2 + strlen(s2)
WS
WS + n_WS);
printf("First word of s1: %.*s\n"
end1 - s1
s1);
printf("First word of s2: %.*s\n"
end2 - s2
s2);
}