Contents
1
Parameters
2
Return value
3
Complexity
4
Exceptions
5
Possible implementation
6
Example
7
See also
[
edit
]
Parameters
|
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
InputIt
, 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)
.
|
Type requirements
|
-
|
-
|
-
UnaryPred
must meet the requirements of
Predicate
.
[
edit
]
Return value
|
Has
true
element
|
Has
false
element
|
all_of
|
false
|
false
|
any_of
|
false
|
false
|
none_of
|
false
|
false
[
edit
]
Complexity
1-6)
At most
std::
distance
(
first, last
)
applications of the predicate
p
.
[
edit
]
Exceptions
The overloads with a template parameter named
ExecutionPolicy
report errors as follows:
|
any_of
template<class InputIt, class UnaryPred>
constexpr bool any_of(InputIt first, InputIt last, UnaryPred p)
return std::find_if(first, last, p) != last;
|
none_of
template<class InputIt, class UnaryPred>
constexpr bool none_of(InputIt first, InputIt last, UnaryPred p)
return std::find_if(first, last, p) == last;
[edit] Example
#include <algorithm>
#include <functional>
#include <iostream>
#include <iterator>
#include <numeric>
#include <vector>
int main()
std::vector<int> v(10, 2);
std::partial_sum(v.cbegin(), v.cend(), v.begin());
std::cout << "Among the numbers: ";
std::copy(v.cbegin(), v.cend(), std::ostream_iterator<int>(std::cout, " "));
std::cout << '\n';
if (std::all_of(v.cbegin(), v.cend(), [](int i) { return i % 2 == 0; }))
std::cout << "All numbers are even\n";
if (std::none_of(v.cbegin(), v.cend(), std::bind(std::modulus<>(),
std::placeholders::_1, 2)))
std::cout << "None of them are odd\n";
struct DivisibleBy
const int d;
DivisibleBy(int n) : d(n) {}
bool operator()(int n) const { return n % d == 0; }
if (std::any_of(v.cbegin(), v.cend(), DivisibleBy(7)))
std::cout << "At least one number is divisible by 7\n";
Output:
Among the numbers: 2 4 6 8 10 12 14 16 18 20
All numbers are even
None of them are odd
At least one number is divisible by 7
[edit] See also
|
|
checks if a predicate is
true
for all, any or none of the elements in a range
(niebloid)
[edit]
Toolbox
What links here
Related changes
Upload file
Special pages
Printable version
Permanent link
Page information
Deutsch
Español
Français
Italiano
日本語
Português
Русский
中文
|