1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <algorithm>
// template <class InputIterator, class Predicate>
// constpexr bool // constexpr after C++17
// all_of(InputIterator first, InputIterator last, Predicate pred);
#include <algorithm>
#include <cassert>
#include "test_macros.h"
#include "test_iterators.h"
struct test1
{
TEST_CONSTEXPR bool operator()(const int& i) const
{
return i % 2 == 0;
}
};
#if TEST_STD_VER > 17
TEST_CONSTEXPR bool test_constexpr() {
int ia[] = {2, 4, 6, 8};
int ib[] = {2, 4, 5, 8};
return std::all_of(std::begin(ia), std::end(ia), test1())
&& !std::all_of(std::begin(ib), std::end(ib), test1())
;
}
#endif
int main()
{
{
int ia[] = {2, 4, 6, 8};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
assert(std::all_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia + sa), test1()) == true);
assert(std::all_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia), test1()) == true);
}
{
const int ia[] = {2, 4, 5, 8};
const unsigned sa = sizeof(ia)/sizeof(ia[0]);
assert(std::all_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia + sa), test1()) == false);
assert(std::all_of(input_iterator<const int*>(ia),
input_iterator<const int*>(ia), test1()) == true);
}
#if TEST_STD_VER > 17
static_assert(test_constexpr());
#endif
}
|
