a39d2fb90c
Also, add automatic unit tests for any_of, all_of and none_of. This commit also makes it easier to add new automatic unit tests by documenting a small shell script. Commit triggered by http://stackoverflow.com/q/42012512/627587
121 lines
3.9 KiB
C++
121 lines
3.9 KiB
C++
// 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)
|
|
|
|
#ifndef BOOST_HANA_TEST_AUTO_ALL_OF_HPP
|
|
#define BOOST_HANA_TEST_AUTO_ALL_OF_HPP
|
|
|
|
#include <boost/hana/all_of.hpp>
|
|
#include <boost/hana/assert.hpp>
|
|
#include <boost/hana/bool.hpp>
|
|
#include <boost/hana/equal.hpp>
|
|
#include <boost/hana/not.hpp>
|
|
|
|
#include "test_case.hpp"
|
|
#include <laws/base.hpp>
|
|
|
|
|
|
TestCase test_all_of{[]{
|
|
namespace hana = boost::hana;
|
|
using hana::test::ct_eq;
|
|
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(),
|
|
[](auto) { return hana::false_c; }
|
|
));
|
|
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}),
|
|
[](auto) { return hana::true_c; }
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}),
|
|
[](auto) { return hana::false_c; }
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<999>{})
|
|
)));
|
|
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}),
|
|
[](auto) { return hana::true_c; }
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}),
|
|
[](auto) { return hana::false_c; }
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}, ct_eq<2>{}),
|
|
[](auto) { return hana::true_c; }
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}, ct_eq<2>{}),
|
|
[](auto) { return hana::false_c; }
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<0>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
|
|
BOOST_HANA_CONSTANT_CHECK(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<0>{}, ct_eq<0>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<999>{}, ct_eq<0>{}, ct_eq<0>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<999>{}, ct_eq<0>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<0>{}, ct_eq<999>{}, ct_eq<0>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
BOOST_HANA_CONSTANT_CHECK(hana::not_(hana::all_of(
|
|
MAKE_TUPLE(ct_eq<0>{}, ct_eq<0>{}, ct_eq<0>{}, ct_eq<999>{}),
|
|
hana::equal.to(ct_eq<0>{})
|
|
)));
|
|
|
|
// Make sure `all_of` short-circuits with runtime predicates
|
|
// See http://stackoverflow.com/q/42012512/627587
|
|
{
|
|
{
|
|
int counter = 0;
|
|
auto tuple = MAKE_TUPLE(ct_eq<0>{}, ct_eq<1>{});
|
|
hana::all_of(tuple, [&](auto) { ++counter; return false; });
|
|
BOOST_HANA_RUNTIME_CHECK(counter == 1);
|
|
}
|
|
{
|
|
int counter = 0;
|
|
auto tuple = MAKE_TUPLE(ct_eq<0>{}, ct_eq<999>{}, ct_eq<0>{});
|
|
hana::all_of(tuple, [&](auto x) -> bool {
|
|
++counter;
|
|
return hana::equal(x, ct_eq<0>{});
|
|
});
|
|
BOOST_HANA_RUNTIME_CHECK(counter == 2);
|
|
}
|
|
}
|
|
}};
|
|
|
|
#endif // !BOOST_HANA_TEST_AUTO_ALL_OF_HPP
|