Functions |
| template<class InputIterator , class T > |
| InputIterator | find_not (InputIterator first, InputIterator last, const T &value) |
| template<class InputRange , class T > |
boost::range_const_iterator
< InputRange >::type | find_not (const InputRange &range, const T &value) |
| template<class InputRange , class T > |
boost::range_iterator
< InputRange >::type | find_not (InputRange &range, const T &value) |
Detailed Description
find_not is similar to find, except find_not will return the first iterator i in the range [first, last) for which *i is not equal to value. Returns last if no such iterator exists.
- Requirements:
-
- Complexity Guarantees:
-
Function Documentation
| InputIterator adobe::find_not |
( |
InputIterator |
first, |
|
|
InputIterator |
last, |
|
|
const T & |
value |
|
) |
| |
| boost::range_const_iterator<InputRange>::type adobe::find_not |
( |
const InputRange & |
range, |
|
|
const T & |
value |
|
) |
| |
find_not implementation
Definition at line 139 of file find.hpp.
| boost::range_iterator<InputRange>::type adobe::find_not |
( |
InputRange & |
range, |
|
|
const T & |
value |
|
) |
| |
find_not implementation
Definition at line 127 of file find.hpp.