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
122
123
124
125
|
// 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)
#ifndef BOOST_HANA_TEST_LAWS_RING_HPP
#define BOOST_HANA_TEST_LAWS_RING_HPP
#include <boost/hana/assert.hpp>
#include <boost/hana/bool.hpp>
#include <boost/hana/concept/comparable.hpp>
#include <boost/hana/concept/constant.hpp>
#include <boost/hana/concept/monoid.hpp>
#include <boost/hana/concept/ring.hpp>
#include <boost/hana/core/when.hpp>
#include <boost/hana/equal.hpp>
#include <boost/hana/functional/capture.hpp>
#include <boost/hana/lazy.hpp>
#include <boost/hana/mult.hpp>
#include <boost/hana/not_equal.hpp>
#include <boost/hana/one.hpp>
#include <boost/hana/plus.hpp>
#include <boost/hana/power.hpp>
#include <boost/hana/value.hpp>
#include <laws/base.hpp>
namespace boost { namespace hana { namespace test {
template <typename R, typename = when<true>>
struct TestRing : TestRing<R, laws> {
using TestRing<R, laws>::TestRing;
};
template <typename R>
struct TestRing<R, laws> {
template <typename Xs>
TestRing(Xs xs) {
#ifdef BOOST_HANA_WORKAROUND_MSVC_DECLTYPEAUTO_RETURNTYPE_662735
one<R>(); // force adding one<R>'s member function to pending temploid list
#endif
hana::for_each(xs, hana::capture(xs)([](auto xs, auto x) {
static_assert(Ring<decltype(x)>{}, "");
foreach2(xs, hana::capture(x)([](auto x, auto y, auto z) {
// associativity
BOOST_HANA_CHECK(hana::equal(
hana::mult(x, hana::mult(y, z)),
hana::mult(hana::mult(x, y), z)
));
// distributivity
BOOST_HANA_CHECK(hana::equal(
hana::mult(x, hana::plus(y, z)),
hana::plus(hana::mult(x, y), hana::mult(x, z))
));
}));
// right identity
BOOST_HANA_CHECK(hana::equal(
hana::mult(x, one<R>()), x
));
// left identity
BOOST_HANA_CHECK(hana::equal(
hana::mult(one<R>(), x), x
));
// power
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<0>),
one<R>()
));
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<1>),
x
));
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<2>),
hana::mult(x, x)
));
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<3>),
hana::mult(hana::mult(x, x), x)
));
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<4>),
hana::mult(hana::mult(hana::mult(x, x), x), x)
));
BOOST_HANA_CHECK(hana::equal(
hana::power(x, int_c<5>),
hana::mult(hana::mult(hana::mult(hana::mult(x, x), x), x), x)
));
}));
}
};
template <typename C>
struct TestRing<C, when<Constant<C>::value>>
: TestRing<C, laws>
{
template <typename Xs>
TestRing(Xs xs) : TestRing<C, laws>{xs} {
BOOST_HANA_CHECK(hana::equal(
hana::value(one<C>()),
one<typename C::value_type>()
));
foreach2(xs, [](auto x, auto y) {
BOOST_HANA_CHECK(hana::equal(
hana::mult(hana::value(x), hana::value(y)),
hana::value(hana::mult(x, y))
));
});
}
};
}}} // end namespace boost::hana::test
#endif // !BOOST_HANA_TEST_LAWS_RING_HPP
|
