summaryrefslogtreecommitdiffstats
path: root/src/boost/libs/hana/test/builtin_array.cpp
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 18:45:59 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-07 18:45:59 +0000
commit19fcec84d8d7d21e796c7624e521b60d28ee21ed (patch)
tree42d26aa27d1e3f7c0b8bd3fd14e7d7082f5008dc /src/boost/libs/hana/test/builtin_array.cpp
parentInitial commit. (diff)
downloadceph-6d07fdb6bb33b1af39833b850bb6cf8af79fe293.tar.xz
ceph-6d07fdb6bb33b1af39833b850bb6cf8af79fe293.zip
Adding upstream version 16.2.11+ds.upstream/16.2.11+dsupstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/boost/libs/hana/test/builtin_array.cpp')
-rw-r--r--src/boost/libs/hana/test/builtin_array.cpp121
1 files changed, 121 insertions, 0 deletions
diff --git a/src/boost/libs/hana/test/builtin_array.cpp b/src/boost/libs/hana/test/builtin_array.cpp
new file mode 100644
index 000000000..f3e26957c
--- /dev/null
+++ b/src/boost/libs/hana/test/builtin_array.cpp
@@ -0,0 +1,121 @@
+// 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/any_of.hpp>
+#include <boost/hana/assert.hpp>
+#include <boost/hana/bool.hpp>
+#include <boost/hana/concept/foldable.hpp>
+#include <boost/hana/concept/searchable.hpp>
+#include <boost/hana/equal.hpp>
+#include <boost/hana/find_if.hpp>
+#include <boost/hana/functional/always.hpp>
+#include <boost/hana/functional/placeholder.hpp>
+#include <boost/hana/not.hpp>
+#include <boost/hana/optional.hpp>
+#include <boost/hana/unpack.hpp>
+
+#include <laws/base.hpp>
+#include <laws/foldable.hpp>
+#include <laws/searchable.hpp>
+
+#include <cstddef>
+namespace hana = boost::hana;
+
+
+template <typename T, std::size_t n>
+using array = T[n];
+
+int main() {
+ // We can't check the laws because builtin arrays can't be passed
+ // to functions.
+
+ //////////////////////////////////////////////////////////////////////////
+ // Foldable
+ //////////////////////////////////////////////////////////////////////////
+ {
+ int a[] = {1};
+ int b[] = {1, 2};
+ int c[] = {1, 2, 3};
+ int d[] = {1, 2, 3, 4};
+
+ // unpack
+ {
+ hana::test::_injection<0> f{};
+
+ BOOST_HANA_RUNTIME_CHECK(hana::equal(
+ hana::unpack(a, f),
+ f(1)
+ ));
+
+ BOOST_HANA_RUNTIME_CHECK(hana::equal(
+ hana::unpack(b, f),
+ f(1, 2)
+ ));
+
+ BOOST_HANA_RUNTIME_CHECK(hana::equal(
+ hana::unpack(c, f),
+ f(1, 2, 3)
+ ));
+
+ BOOST_HANA_RUNTIME_CHECK(hana::equal(
+ hana::unpack(d, f),
+ f(1, 2, 3, 4)
+ ));
+ }
+
+ static_assert(hana::Foldable<int[3]>::value, "");
+ }
+
+ //////////////////////////////////////////////////////////////////////////
+ // Searchable
+ //////////////////////////////////////////////////////////////////////////
+ {
+ // any_of
+ {
+ static_assert(
+ hana::not_(hana::any_of(array<int, 1>{0}, hana::equal.to(1)))
+ , "");
+
+ static_assert(
+ hana::any_of(array<int, 2>{0, 1}, hana::equal.to(0))
+ , "");
+ static_assert(
+ hana::any_of(array<int, 2>{0, 1}, hana::equal.to(1))
+ , "");
+ static_assert(
+ hana::not_(hana::any_of(array<int, 2>{0, 1}, hana::equal.to(2)))
+ , "");
+
+ static_assert(
+ hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(0))
+ , "");
+ static_assert(
+ hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(1))
+ , "");
+ static_assert(
+ hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(2))
+ , "");
+ static_assert(
+ hana::not_(hana::any_of(array<int, 3>{0, 1, 2}, hana::equal.to(3)))
+ , "");
+ }
+
+ // find_if
+ // Note: Because we need the predicate to return a Constant, this
+ // is incredibly not powerful.
+ {
+ static_assert(hana::equal(
+ hana::find_if(array<int, 1>{0}, hana::always(hana::true_c)),
+ hana::just(0)
+ ), "");
+
+ BOOST_HANA_CONSTANT_CHECK(hana::equal(
+ hana::find_if(array<int, 1>{0}, hana::always(hana::false_c)),
+ hana::nothing
+ ));
+ }
+
+ static_assert(hana::Searchable<int[3]>::value, "");
+ }
+}