1 // Copyright Louis Dionne 2013-2017
2 // Distributed under the Boost Software License, Version 1.0.
3 // (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
4
5 #include <boost/hana/assert.hpp>
6 #include <boost/hana/equal.hpp>
7 #include <boost/hana/map.hpp>
8 #include <boost/hana/union.hpp>
9
10 #include <laws/base.hpp>
11 #include <support/minimal_product.hpp>
12 namespace hana = boost::hana;
13
14
15 template <int i>
key()16 auto key() { return hana::test::ct_eq<i>{}; }
17
18 template <int i>
val()19 auto val() { return hana::test::ct_eq<-i>{}; }
20
21 template <int i, int j>
p()22 auto p() { return ::minimal_product(key<i>(), val<j>()); }
23
main()24 int main() {
25 BOOST_HANA_CONSTANT_CHECK(hana::equal(
26 hana::union_(
27 hana::make_map(),
28 hana::make_map()
29 ),
30 hana::make_map()
31 ));
32
33 BOOST_HANA_CONSTANT_CHECK(hana::equal(
34 hana::union_(
35 hana::make_map(
36 p<1, 1>()
37 ),
38 hana::make_map()
39 ),
40 hana::make_map(p<1, 1>())
41 ));
42
43 BOOST_HANA_CONSTANT_CHECK(hana::equal(
44 hana::union_(
45 hana::make_map(),
46 hana::make_map(p<1, 1>())
47 ),
48 hana::make_map(p<1, 1>())
49 ));
50
51 BOOST_HANA_CONSTANT_CHECK(hana::equal(
52 hana::union_(
53 hana::make_map(p<1, 1>()),
54 hana::make_map(p<1, 1>())
55 ),
56 hana::make_map(p<1, 1>())
57 ));
58
59 BOOST_HANA_CONSTANT_CHECK(hana::equal(
60 hana::union_(
61 hana::make_map(p<1, 2>()),
62 hana::make_map(p<1, 3>())
63 ),
64 hana::make_map(p<1, 3>())
65 ));
66
67 BOOST_HANA_CONSTANT_CHECK(hana::equal(
68 hana::union_(
69 hana::make_map(p<1, 10>(),
70 p<2, 20>(),
71 p<3, 30>()),
72 hana::make_map(p<4, 40>(),
73 p<5, 50>(),
74 p<1, 100>())
75 ),
76 hana::make_map(p<2, 20>(),
77 p<3, 30>(),
78 p<4, 40>(),
79 p<5, 50>(),
80 p<1, 100>())
81 ));
82 }
83