1// Copyright Louis Dionne 2013-2022
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/is_subset.hpp>
7#include <boost/hana/map.hpp>
8#include <boost/hana/not.hpp>
9
10#include <laws/base.hpp>
11#include <support/minimal_product.hpp>
12namespace hana = boost::hana;
13
14
15template <int i>
16auto key() { return hana::test::ct_eq<i>{}; }
17
18template <int i>
19auto val() { return hana::test::ct_eq<-i>{}; }
20
21template <int i, int j>
22auto p() { return ::minimal_product(key<i>(), val<j>()); }
23
24int main() {
25 BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
26 hana::make_map(),
27 hana::make_map()
28 ));
29 BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
30 hana::make_map(),
31 hana::make_map(p<1, 1>())
32 ));
33 BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
34 hana::make_map(),
35 hana::make_map(p<1, 1>(), p<2, 2>())
36 ));
37
38 BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
39 hana::make_map(p<1, 1>()),
40 hana::make_map(p<1, 1>(), p<2, 2>())
41 ));
42
43 BOOST_HANA_CONSTANT_CHECK(hana::is_subset(
44 hana::make_map(p<2, 2>(), p<1, 1>()),
45 hana::make_map(p<1, 1>(), p<2, 2>())
46 ));
47 BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::is_subset(
48 hana::make_map(p<3, 3>(), p<1, 1>()),
49 hana::make_map(p<1, 1>(), p<2, 2>())
50 )));
51}
52

source code of boost/libs/hana/test/map/is_subset.cpp