|
| template<class InputIterator, class Predicate> |
| InputIterator | find_if_not (InputIterator first, InputIterator last, Predicate pred) |
| | find_if_not implementation
|
| template<class InputRange, class Predicate> |
| boost::range_iterator< InputRange >::type | find_if_not (InputRange &range, Predicate pred) |
| | find_if_not implementation
|
| template<class InputRange, class Predicate> |
| boost::range_const_iterator< InputRange >::type | find_if_not (const InputRange &range, Predicate pred) |
| | find_if_not implementation
|
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 Guarantee(s)
-
◆ find_if_not() [1/3]
template<class InputIterator, class Predicate>
| InputIterator find_if_not |
( |
InputIterator | first, |
|
|
InputIterator | last, |
|
|
Predicate | pred ) |
◆ find_if_not() [2/3]
template<class InputRange, class Predicate>
| boost::range_iterator< InputRange >::type find_if_not |
( |
InputRange & | range, |
|
|
Predicate | pred ) |
◆ find_if_not() [3/3]
template<class InputRange, class Predicate>
| boost::range_const_iterator< InputRange >::type find_if_not |
( |
const InputRange & | range, |
|
|
Predicate | pred ) |