equality (1) | template <class ForwardIterator1, class ForwardIterator2> ForwardIterator1 find_first_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2); |
---|---|
predicate (2) | template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate> ForwardIterator1 find_first_of (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate pred); |
equality (1) | template <class InputIterator, class ForwardIterator> InputIterator find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2); |
---|---|
predicate (2) | template <class InputIterator, class ForwardIterator, class BinaryPredicate> InputIterator find_first_of (InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, BinaryPredicate pred); |
[first1,last1)
that matches any of the elements in [first2,last2)
. If no such element is found, the function returns last1.[first1,last1)
are sequentially compared to each of the values in [first2,last2)
using operator==
(or pred, in version (2)), until a pair matches.
|
|
[first1,last1)
, which contains all the elements between first1 and last1, including the element pointed by first1 but not the element pointed by last1.[first1,last1)
, which contains all the elements between first1 and last1, including the element pointed by first1 but not the element pointed by last1.[first2,last2)
.operator==
(with the elements of the first range as left-hand side operands, and those of the second as right-hand side operands).bool
. The value returned indicates whether the elements are considered to match in the context of this function.[first1,last1)
that is part of [first2,last2)
.[first2,last2)
is an empty range, the result is unspecified.[first2,last2)
is an empty range, the function returns last1.
|
|
The first match is: A The first match is: a |
count1*count2
(where countX is the distance between firstX and lastX): Compares elements until a match is found.[first1,last1)
, and possibly more than once in [first2,last2)
).