Namespaces
Variants
Views
Actions

Difference between revisions of "cpp/algorithm/all any none of"

From cppreference.com
< cpp‎ | algorithm
(line too long)
(indent properly)
Line 91: Line 91:
 
     }
 
     }
 
     if (std::none_of(v.begin(), v.end(), std::bind(std::modulus<int>(),  
 
     if (std::none_of(v.begin(), v.end(), std::bind(std::modulus<int>(),  
                                        std::placeholder::_1, 2))) {
+
                                                  std::placeholder::_1, 2))) {
 
         std::cout << "None of them are odd\n";
 
         std::cout << "None of them are odd\n";
 
     }
 
     }

Revision as of 17:13, 3 April 2012

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>
Defined in header <algorithm>
</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<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).

Contents

Parameters

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). ​

Return value

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.

Complexity

At most last - first applications of the predicate

Possible implementation

Template:eq fun cpp

Example

Template:example cpp