/*============================================================================= Copyright (c) 2011-2016 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_PERTITION_POINT_CPP #define SPROUT_LIBS_ALGORITHM_TEST_PERTITION_POINT_CPP #include #include #include #include namespace testspr { static void algorithm_partition_point_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}}; { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( sprout::begin(arr1), sprout::end(arr1), testspr::is_odd() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( sprout::begin(arr1), sprout::begin(arr1) + 5, testspr::is_odd() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( testspr::reduce_forward(sprout::begin(arr1)), testspr::reduce_forward(sprout::end(arr1)), testspr::is_odd() ).base(); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( testspr::reduce_forward(sprout::begin(arr1)), testspr::reduce_forward(sprout::begin(arr1) + 5), testspr::is_odd() ).base(); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( testspr::reduce_random_access(sprout::begin(arr1)), testspr::reduce_random_access(sprout::end(arr1)), testspr::is_odd() ).base(); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point( testspr::reduce_random_access(sprout::begin(arr1)), testspr::reduce_random_access(sprout::begin(arr1) + 5), testspr::is_odd() ).base(); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_partition_point_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_PERTITION_POINT_CPP