std::all_of, std::any_of, std::none_of

<td>

Defined in header <algorithm>

</td>

<td >

template< class InputIterator, class UnaryPredicate >
bool all_of( InputIterator first, InputIterator last, UnaryPredicate p );

</td>

<td > (1) </td> <td > (since C++11) </td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class UnaryPredicate >
bool any_of( InputIterator first, InputIterator last, UnaryPredicate p );

</td>

<td > (2) </td> <td > (since C++11) </td> </tr> <tr class="t-dcl ">

<td >

template< class InputIterator, class UnaryPredicate >
bool none_of( InputIterator first, InputIterator last, UnaryPredicate p );

</td>

<td > (3) </td> <td > (since C++11) </td> </tr> Template:ddcl list end

1) Checks if unary predicate p returns Template:cpp for all elements in the range [first, last).

2) Checks if unary predicate p returns Template:cpp for at least one element in the range [first, last).

3) Checks if unary predicate p returns Template:cpp for no elements in the range [first, last).

first, last	-	the range of elements to examine
p	-	unary predicate . The expression p(v) must be convertible to bool for every argument `v` of type (possibly const) `VT`, where `VT` is the value type of `InputIterator`, regardless of value category, and must not modify `v`. Thus, a parameter type of VT&is not allowed, nor is VT unless for `VT` a move is equivalent to a copy(since C++11).

1) Template:cpp if unary predicate returns Template:cpp for all elements in the range, Template:cpp otherwise. Returns Template:cpp if the range is empty.

2) Template:cpp if unary predicate returns Template:cpp for at least one element in the range, Template:cpp otherwise. Returns Template:cpp if the range is empty.

3) Template:cpp if unary predicate returns Template:cpp for no elements in the range, Template:cpp otherwise. Returns Template:cpp if the range is empty.

At most last - first applications of the predicate

Contents