find_if_not
[find]
|
Functions |
| template<class InputRange , class Predicate > |
boost::range_const_iterator
< InputRange >::type | find_if_not (const InputRange &range, Predicate pred) |
| template<class InputRange , class Predicate > |
boost::range_iterator
< InputRange >::type | find_if_not (InputRange &range, Predicate pred) |
| template<class InputIterator , class Predicate > |
| InputIterator | find_if_not (InputIterator first, InputIterator last, Predicate pred) |
Detailed Description
find_if_not is similar to
find_if, except
find_if_not will return the first iterator
i in the range
[first, last) for which
pred(*i) is
false. Returns
last if no such iterator exists.
- Requirements:
-
- Complexity Guarantees:
-
Function Documentation
| boost::range_const_iterator<InputRange>::type adobe::find_if_not |
( |
const InputRange & |
range, |
|
|
Predicate |
pred | |
|
) |
| | |
find_if_not implementation
Definition at line 104 of file find.hpp.
| boost::range_iterator<InputRange>::type adobe::find_if_not |
( |
InputRange & |
range, |
|
|
Predicate |
pred | |
|
) |
| | |
find_if_not implementation
Definition at line 92 of file find.hpp.
| InputIterator adobe::find_if_not |
( |
InputIterator |
first, |
|
|
InputIterator |
last, |
|
|
Predicate |
pred | |
|
) |
| | |
find_if_not implementation
Definition at line 80 of file find.hpp.