/*============================================================================= Copyright (c) 2011-2019 Bolero MURAKAMI https://github.com/bolero-MURAKAMI/Sprout Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) =============================================================================*/ #ifndef SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP #define SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP #include #include #include #include namespace testspr { static void algorithm_all_of_equal_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{1, 1, 1, 1, 1, 10, 10, 10, 10, 10}}; { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( sprout::begin(arr1), sprout::end(arr1), 1 ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( sprout::begin(arr1), sprout::begin(arr1) + 5, 1 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( testspr::reduce_input(sprout::begin(arr1)), testspr::reduce_input(sprout::end(arr1)), 1 ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( testspr::reduce_input(sprout::begin(arr1)), testspr::reduce_input(sprout::begin(arr1) + 5), 1 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( testspr::reduce_random_access(sprout::begin(arr1)), testspr::reduce_random_access(sprout::end(arr1)), 1 ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::all_of_equal( testspr::reduce_random_access(sprout::begin(arr1)), testspr::reduce_random_access(sprout::begin(arr1) + 5), 1 ); TESTSPR_BOTH_ASSERT(result); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_all_of_equal_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_ALL_OF_EQUAL_CPP