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()

Module:  Standard C++ Library   Library:  Algorithms


Function

Local Index

No Entries

Summary

Algorithm that finds an occurrence of value in a sequence

Synopsis

#include <algorithm>

namespace std {
  template <class InputIterator, class T>
  InputIterator find(InputIterator start, 
                     InputIterator finish,
                     const T& value);
}

Description

The find() algorithm lets you search for the first occurrence of a particular value in a sequence. find() returns the first iterator i in the range [start, finish) for which the following condition holds:

*i == value.

If find() does not find a match for value, it returns the iterator finish.

Type T must be EqualityComparable.

Complexity

find() performs at most finish - start comparisons.

Example

See Also

adjacent_find(), find_first_of(), find_if()

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.