function template
<algorithm>
std::all_oftemplate <class InputIterator, class UnaryPredicate> bool all_of (InputIterator first, InputIterator last, UnaryPredicate pred);
Test condition on all elements in range
Returnstrue
if pred returns true
for all the elements in the range [first,last)
or if the range is empty, and false
otherwise.
The behavior of this function template is equivalent to:
1
2
3
4
5
6
7
8
9
template<class InputIterator, class UnaryPredicate>
bool all_of (InputIterator first, InputIterator last, UnaryPredicate pred)
{
while (first!=last) {
if (!pred(*first)) return false;
++first;
}
return true;
}
[first,last)
, which contains all the elements between first and last, including the element pointed by first but not the element pointed by last.
bool
. The value returned indicates whether the element fulfills the condition checked by this function.
true
if pred returns true
for all the elements in the range or if the range is empty, and false
otherwise.
1
2
3
4
5
6
7
8
9
10
11
12
13
// all_of example
#include <iostream> // std::cout
#include <algorithm> // std::all_of
#include <array> // std::array
int main () {
std::array<int,8> foo = {3,5,7,11,13,17,19,23};
if ( std::all_of(foo.begin(), foo.end(), [](int i){return i%2;}) )
std::cout << "All the elements are odd numbers.\n";
return 0;
}
All the elements are odd numbers.
[first,last)
are accessed (once at most).
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4