equal.cpp 2.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  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/not.hpp>
  8. #include <boost/hana/not_equal.hpp>
  9. #include <laws/base.hpp>
  10. #include <support/minimal_product.hpp>
  11. namespace hana = boost::hana;
  12. template <int i>
  13. auto key() { return hana::test::ct_eq<i>{}; }
  14. template <int i>
  15. auto val() { return hana::test::ct_eq<-i>{}; }
  16. template <int i, int j>
  17. auto p() { return ::minimal_product(key<i>(), val<j>()); }
  18. int main() {
  19. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  20. hana::make_map(),
  21. hana::make_map()
  22. ));
  23. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  24. hana::make_map(p<1, 1>()),
  25. hana::make_map()
  26. )));
  27. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  28. hana::make_map(),
  29. hana::make_map(p<1, 1>())
  30. )));
  31. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  32. hana::make_map(p<1, 1>()),
  33. hana::make_map(p<1, 1>())
  34. ));
  35. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  36. hana::make_map(p<1, 1>()),
  37. hana::make_map(p<1, 2>())
  38. )));
  39. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  40. hana::make_map(p<1, 1>()),
  41. hana::make_map(p<2, 1>())
  42. )));
  43. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  44. hana::make_map(p<1, 1>()),
  45. hana::make_map(p<1, 1>(), p<2, 2>())
  46. )));
  47. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  48. hana::make_map(p<1, 1>(), p<2, 2>()),
  49. hana::make_map(p<1, 1>(), p<2, 2>())
  50. ));
  51. BOOST_HANA_CONSTANT_CHECK(hana::equal(
  52. hana::make_map(p<1, 1>(), p<2, 2>()),
  53. hana::make_map(p<2, 2>(), p<1, 1>())
  54. ));
  55. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  56. hana::make_map(p<1, 1>(), p<2, 2>()),
  57. hana::make_map(p<9, 1>(), p<2, 2>()))
  58. ));
  59. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  60. hana::make_map(p<1, 1>(), p<2, 2>()),
  61. hana::make_map(p<1, 9>(), p<2, 2>()))
  62. ));
  63. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  64. hana::make_map(p<1, 1>(), p<2, 2>()),
  65. hana::make_map(p<1, 1>(), p<9, 2>()))
  66. ));
  67. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  68. hana::make_map(p<1, 1>(), p<2, 2>()),
  69. hana::make_map(p<1, 1>(), p<2, 9>()))
  70. ));
  71. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
  72. hana::make_map(p<1, 1>(), p<2, 2>()),
  73. hana::make_map(p<1, 1>(), p<2, 2>(), p<3, 3>()))
  74. ));
  75. // operators
  76. BOOST_HANA_CONSTANT_CHECK(
  77. hana::make_map(p<2, 2>(), p<1, 1>())
  78. ==
  79. hana::make_map(p<1, 1>(), p<2, 2>())
  80. );
  81. BOOST_HANA_CONSTANT_CHECK(
  82. hana::make_map(p<1, 1>())
  83. !=
  84. hana::make_map(p<1, 1>(), p<2, 2>())
  85. );
  86. }