Boost C++ Libraries Home Libraries People FAQ More

PrevUpHomeNext
find_first_of
Prototype

template<class SinglePassRange1, class ForwardRange2>
typename range_iterator<SinglePassRange1>::type
find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2);

template<
    class SinglePassRange1,
    class ForwardRange2,
    class BinaryPredicate
    >
typename range_iterator<SinglePassRange1>::type
find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);

template<
    range_return_value re,
    class SinglePassRange1,
    class ForwardRange2
    >
typename range_return<SinglePassRange1, re>::type
find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2);

template<
    range_return_value re,
    class SinglePassRange1,
    class ForwardRange2,
    class BinaryPredicate
    >
typename range_return<SinglePassRange1, re>::type
find_first_of(SinglePassRange1& rng1, const ForwardRange2& rng2, BinaryPredicate pred);

Description

The versions of find_first_of that return an iterator, return an iterator to the first occurrence in rng1 of any of the elements in rng2. Equality is determined by operator== for non-predicate versions of find_first_of, and by satisfying pred in the predicate versions.

The versions of find_first_of that return a range_return, defines found in the same manner as the returned iterator described above.

Definition

Defined in the header file boost/range/algorithm/find_first_of.hpp

Requirements

For the non-predicate versions:

For the predicate versions:

Complexity

At most distance(rng1) * distance(rng2) comparisons.


PrevUpHomeNext