1 files changed, 97 insertions, 0 deletions
diff --git a/src/boost/libs/hana/test/map/equal.cpp b/src/boost/libs/hana/test/map/equal.cpp
new file mode 100644
index 00000000..c12be4e4
--- /dev/null
+++ b/src/boost/libs/hana/test/map/equal.cpp
@@ -0,0 +1,97 @@
+// Copyright Louis Dionne 2013-2017
+// Distributed under the Boost Software License, Version 1.0.
+// (See accompanying file LICENSE.md or copy at http://boost.org/LICENSE_1_0.txt)
+
+#include <boost/hana/assert.hpp>
+#include <boost/hana/equal.hpp>
+#include <boost/hana/map.hpp>
+#include <boost/hana/not.hpp>
+#include <boost/hana/not_equal.hpp>
+
+#include <laws/base.hpp>
+#include <support/minimal_product.hpp>
+namespace hana = boost::hana;
+
+
+template <int i>
+auto key() { return hana::test::ct_eq<i>{}; }
+
+template <int i>
+auto val() { return hana::test::ct_eq<-i>{}; }
+
+template <int i, int j>
+auto p() { return ::minimal_product(key<i>(), val<j>()); }
+
+int main() {
+    BOOST_HANA_CONSTANT_CHECK(hana::equal(
+        hana::make_map(),
+        hana::make_map()
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>()),
+        hana::make_map()
+    )));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(),
+        hana::make_map(p<1, 1>())
+    )));
+
+    BOOST_HANA_CONSTANT_CHECK(hana::equal(
+        hana::make_map(p<1, 1>()),
+        hana::make_map(p<1, 1>())
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>()),
+        hana::make_map(p<1, 2>())
+    )));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>()),
+        hana::make_map(p<2, 1>())
+    )));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>()),
+        hana::make_map(p<1, 1>(), p<2, 2>())
+    )));
+
+    BOOST_HANA_CONSTANT_CHECK(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<1, 1>(), p<2, 2>())
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<2, 2>(), p<1, 1>())
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<9, 1>(), p<2, 2>()))
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<1, 9>(), p<2, 2>()))
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<1, 1>(), p<9, 2>()))
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<1, 1>(), p<2, 9>()))
+    ));
+    BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::equal(
+        hana::make_map(p<1, 1>(), p<2, 2>()),
+        hana::make_map(p<1, 1>(), p<2, 2>(), p<3, 3>()))
+    ));
+
+    // operators
+    BOOST_HANA_CONSTANT_CHECK(
+        hana::make_map(p<2, 2>(), p<1, 1>())
+            ==
+        hana::make_map(p<1, 1>(), p<2, 2>())
+    );
+
+    BOOST_HANA_CONSTANT_CHECK(
+        hana::make_map(p<1, 1>())
+            !=
+        hana::make_map(p<1, 1>(), p<2, 2>())
+    );
+}