is_subset.cpp 1.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051
  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/is_subset.hpp>
  6. #include <boost/hana/map.hpp>
  7. #include <boost/hana/not.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::is_subset(
  19. hana::make_map(),
  20. hana::make_map()
  21. ));
  22. BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
  23. hana::make_map(),
  24. hana::make_map(p<1, 1>())
  25. ));
  26. BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
  27. hana::make_map(),
  28. hana::make_map(p<1, 1>(), p<2, 2>())
  29. ));
  30. BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
  31. hana::make_map(p<1, 1>()),
  32. hana::make_map(p<1, 1>(), p<2, 2>())
  33. ));
  34. BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
  35. hana::make_map(p<2, 2>(), p<1, 1>()),
  36. hana::make_map(p<1, 1>(), p<2, 2>())
  37. ));
  38. BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::is_subset(
  39. hana::make_map(p<3, 3>(), p<1, 1>()),
  40. hana::make_map(p<1, 1>(), p<2, 2>())
  41. )));
  42. }