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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
// Copyright Louis Dionne 2013-2017
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
#include <boost/hana/any_of.hpp>
#include <boost/hana/assert.hpp>
#include <boost/hana/bool.hpp>
#include <boost/hana/concept/foldable.hpp>
#include <boost/hana/concept/searchable.hpp>
#include <boost/hana/equal.hpp>
#include <boost/hana/find_if.hpp>
#include <boost/hana/functional/always.hpp>
#include <boost/hana/functional/placeholder.hpp>
#include <boost/hana/not.hpp>
#include <boost/hana/optional.hpp>
#include <boost/hana/unpack.hpp>
#include <laws/base.hpp>
#include <laws/foldable.hpp>
#include <laws/searchable.hpp>
#include <cstddef>
namespace hana = boost::hana;
template <typename T, std::size_t n>
using array = T[n];
int main() {
// We can't check the laws because builtin arrays can't be passed
// to functions.
//////////////////////////////////////////////////////////////////////////
// Foldable
//////////////////////////////////////////////////////////////////////////
{
int a[] = {1};
int b[] = {1, 2};
int c[] = {1, 2, 3};
int d[] = {1, 2, 3, 4};
// unpack
{
hana::test::_injection<0> f{};
BOOST_HANA_RUNTIME_CHECK(hana::equal(
hana::unpack(a, f),
f(1)
));
BOOST_HANA_RUNTIME_CHECK(hana::equal(
hana::unpack(b, f),
f(1, 2)
));
BOOST_HANA_RUNTIME_CHECK(hana::equal(
hana::unpack(c, f),
f(1, 2, 3)
));
BOOST_HANA_RUNTIME_CHECK(hana::equal(
hana::unpack(d, f),
f(1, 2, 3, 4)
));
}
static_assert(hana::Foldable<int[3]>::value, "");
}
//////////////////////////////////////////////////////////////////////////
// Searchable
//////////////////////////////////////////////////////////////////////////
{
// any_of
{
static_assert(
hana::not_(hana::any_of(array<int, 1>{0}, hana::equal.to(1)))
, "");
static_assert(
hana::any_of(array<int, 2>{0, 1}, hana::equal.to(0))
, "");
static_assert(
hana::any_of(array<int, 2>{0, 1}, hana::equal.to(1))
, "");
static_assert(
hana::not_(hana::any_of(array<int, 2>{0, 1}, hana::equal.to(2)))
, "");
static_assert(
hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(0))
, "");
static_assert(
hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(1))
, "");
static_assert(
hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(2))
, "");
static_assert(
hana::not_(hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(3)))
, "");
}
// find_if
// Note: Because we need the predicate to return a Constant, this
// is incredibly not powerful.
{
static_assert(hana::equal(
hana::find_if(array<int, 1>{0}, hana::always(hana::true_c)),
hana::just(0)
), "");
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::find_if(array<int, 1>{0}, hana::always(hana::false_c)),
hana::nothing
));
}
static_assert(hana::Searchable<int[3]>::value, "");
}
}
|
