Boost C++ Libraries Home Libraries People FAQ More

PrevUpHomeNext
search_n
Prototype

template<class ForwardRange, class Integer, class Value>
typename range_iterator<ForwardRange>::type
search_n(ForwardRange& rng, Integer n, const Value& value);

template<class ForwardRange, class Integer, class Value>
typename range_iterator<const ForwardRange>::type
search_n(const ForwardRange& rng, Integer n, const Value& value);

template<class ForwardRange, class Integer, class Value, class BinaryPredicate>
typename range_iterator<ForwardRange>::type
search_n(ForwardRange& rng, Integer n, const Value& value,
         BinaryPredicate binary_pred);

template<class ForwardRange, class Integer, class Value, class BinaryPredicate>
typename range_iterator<const ForwardRange>::type
search_n(const ForwardRange& rng, Integer n, const Value& value,
         BinaryPredicate binary_pred);

Description

search_n searches rng for a sequence of length n equal to value where equality is determined by operator== in the non-predicate case, and by a predicate when one is supplied.

Definition

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

Requirements

For the non-predicate versions:

For the predicate versions:

Complexity

Average complexity is Linear. Worst-case complexity is quadratic.


PrevUpHomeNext