1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
hi(find) hi(find_if) hi(find_if_not)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototypes:
itemization(
itt(InputIterator find([ExecPol,] InputIterator first,
InputIterator last, Type const &value);)
itt(InputIterator find_if([ExecPol,] InputIterator first,
InputIterator last, Predicate pred);)
itt(InputIterator find_if_not([ExecPol,] InputIterator first,
InputIterator last, Predicate pred);)
)
it() Description:
itemization(
it() The first prototype: element tt(value) is searched for in the
elements reached from the iterator range rangett(first, last). An iterator
pointing to the first element found is returned. If the element was not found,
tt(last) is returned. The tt(operator==) of the underlying data type is used
to compare the elements.
it() The second prototype returns an iterator pointing to the
first element reached from the iterator range rangett(first, last) for which
the (unary) predicate tt(pred) returns tt(true). If the element was not found,
tt(last) is returned.
it() The third prototype returns an iterator pointing to the first
element reached from the iterator range rangett(first, last) for which the
(unary) predicate tt(pred) returns tt(false). If the element was not found,
tt(last) is returned. Thus, tt(pred) defines what is considered acceptable, in
which case tt(find_if_not) returns an iterator to the first element that
isn't.
)
it() Example:
verbinclude(-a examples/find.cc)
)
|
