union.cpp 2.1 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182
  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. #include <boost/hana/assert.hpp>
  5. #include <boost/hana/equal.hpp>
  6. #include <boost/hana/map.hpp>
  7. #include <boost/hana/union.hpp>
  8. #include <laws/base.hpp>
  9. #include <support/minimal_product.hpp>
  10. namespace hana = boost::hana;
  11. template <int i>
  12. auto key() { return hana::test::ct_eq<i>{}; }
  13. template <int i>
  14. auto val() { return hana::test::ct_eq<-i>{}; }
  15. template <int i, int j>
  16. auto p() { return ::minimal_product(key<i>(), val<j>()); }
  17. int main() {
  18. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  19. hana::union_(
  20. hana::make_map(),
  21. hana::make_map()
  22. ),
  23. hana::make_map()
  24. ));
  25. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  26. hana::union_(
  27. hana::make_map(
  28. p<1, 1>()
  29. ),
  30. hana::make_map()
  31. ),
  32. hana::make_map(p<1, 1>())
  33. ));
  34. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  35. hana::union_(
  36. hana::make_map(),
  37. hana::make_map(p<1, 1>())
  38. ),
  39. hana::make_map(p<1, 1>())
  40. ));
  41. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  42. hana::union_(
  43. hana::make_map(p<1, 1>()),
  44. hana::make_map(p<1, 1>())
  45. ),
  46. hana::make_map(p<1, 1>())
  47. ));
  48. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  49. hana::union_(
  50. hana::make_map(p<1, 2>()),
  51. hana::make_map(p<1, 3>())
  52. ),
  53. hana::make_map(p<1, 3>())
  54. ));
  55. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  56. hana::union_(
  57. hana::make_map(p<1, 10>(),
  58. p<2, 20>(),
  59. p<3, 30>()),
  60. hana::make_map(p<4, 40>(),
  61. p<5, 50>(),
  62. p<1, 100>())
  63. ),
  64. hana::make_map(p<2, 20>(),
  65. p<3, 30>(),
  66. p<4, 40>(),
  67. p<5, 50>(),
  68. p<1, 100>())
  69. ));
  70. }