Standard C++ Library Class Reference

Click on the banner to return to the Class Reference home page.

find

Algorithm

Summary

Find an occurence of value in a sequence

Contents

Synopsis●

Description●

Complexity●

Example●

Warning●

See Also●

Synopsis

#include <algorithm>

template <class InputIterator, class T>

InputIterator find(InputIterator first, InputIterator last,

const T& value);

Description

The find algorithm lets you search for the first occurence of a particular value in a sequence.

find returns the first iterator i in the range [first, last) for which the following condition holds:

*i == value.

If find does not find a match for value, it returns the iterator last.