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
|
// 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/assert.hpp>
#include <boost/hana/equal.hpp>
#include <boost/hana/intersection.hpp>
#include <boost/hana/map.hpp>
#include <laws/base.hpp>
#include <support/minimal_product.hpp>
namespace hana = boost::hana;
template <int i>
auto key() { return hana::test::ct_eq<i>{}; }
template <int i>
auto val() { return hana::test::ct_eq<-i>{}; }
template <int i, int j>
auto p() { return ::minimal_product(key<i>(), val<j>()); }
int main() {
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(),
hana::make_map()
),
hana::make_map()
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(p<1, 1>()),
hana::make_map()
),
hana::make_map()
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(),
hana::make_map(p<1, 1>())
),
hana::make_map()
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(p<1, 1>()),
hana::make_map(p<1, 2>())
),
hana::make_map(p<1, 1>())
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(
p<1, 2>(),
p<2, 3>()),
hana::make_map(
p<1, 3>(),
p<2, 4>(),
p<3, 5>())
),
hana::make_map(
p<1, 2>(),
p<2, 3>())
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(
p<1, 3>(),
p<2, 4>(),
p<3, 5>()),
hana::make_map(
p<1, 2>(),
p<2, 3>())
),
hana::make_map(
p<1, 3>(),
p<2, 4>())
));
BOOST_HANA_CONSTANT_CHECK(hana::equal(
hana::intersection(
hana::make_map(
p<1, 100>(),
p<2, 200>()),
hana::make_map(
p<3, 300>(),
p<4, 400>())
),
hana::make_map()
));
}
|
