Rogue Wave banner
Previous fileTop of DocumentContentsIndex pageNext file
Standard C++ Library Module Reference Guide
Rogue Wave web site:  Home Page  |  Main Documentation Page

find_if()

Module:  Standard C++ Library   Library:  Algorithms


Function

Local Index

No Entries

Summary

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

Synopsis

#include <algorithm>

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

Description

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.

Complexity

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

Example

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

Copyright (c) 1994-2006 Rogue Wave Software, a Quovadx Division.
Licensed under the Apache License, Version 2.0.
Contact Rogue Wave about documentation or support issues. You can also seek help from other developers through the Apache stdcxx community (see below).

For more information on the Rogue Wave Standard C++ Library under open source, see Section 1.2 of the user's guide.