/*============================================================================= Copyright (c) 2011-2013 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_IS_DECREASING_CPP #define SPROUT_LIBS_ALGORITHM_TEST_IS_DECREASING_CPP #include #include #include #include namespace testspr { static void algorithm_is_decreasing_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{10, 8, 6, 4, 2, 9, 7, 5, 3, 1}}; { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( sprout::begin(arr1), sprout::end(arr1) ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( sprout::begin(arr1), sprout::begin(arr1) + 5 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( testspr::reduct_forward(sprout::begin(arr1)), testspr::reduct_forward(sprout::end(arr1)) ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( testspr::reduct_forward(sprout::begin(arr1)), testspr::reduct_forward(sprout::begin(arr1) + 5) ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( testspr::reduct_random_access(sprout::begin(arr1)), testspr::reduct_random_access(sprout::end(arr1)) ); TESTSPR_BOTH_ASSERT(!result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::is_decreasing( testspr::reduct_random_access(sprout::begin(arr1)), testspr::reduct_random_access(sprout::begin(arr1) + 5) ); TESTSPR_BOTH_ASSERT(result); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_is_decreasing_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_IS_DECREASING_CPP