Previous fileTop of DocumentContentsIndex pageNext file
Apache C++ Standard Library Reference Guide


Library:  Algorithms


Local Index

No Entries


Algorithm that finds an occurrence of a value in a sequence that satisfies a specified predicate


#include <algorithm>

namespace std {
  template <class InputIterator, class Predicate>
  InputIterator find_if(InputIterator start,
                        InputIterator finish,
                        Predicate pred);


The find_if() algorithm allows you to search for the first element in a sequence that satisfies a particular condition. The sequence is defined by iterators start and finish, while the condition is defined by the third argument: a predicate function that returns a boolean value. find_if() returns the first iterator i in the range [start, finish) for which the following condition holds:

pred(*i) == true.

If no such iterator is found, find_if() returns finish.


find_if() performs at most finish-start applications of the corresponding predicate.


See Also

adjacent_find(), Algorithms, find(), find_end(), find_first_of()

Standards Conformance

ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.1.2

Previous fileTop of DocumentContentsIndex pageNext file