#ifndef SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP #define SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP #include #include #include #include namespace testspr { static void algorithm_binary_search_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}}; { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( sprout::begin(arr1), sprout::end(arr1), 7 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( sprout::begin(arr1), sprout::begin(arr1) + 5, 7, testspr::less() ); TESTSPR_BOTH_ASSERT(!result); } #if defined(__clang__) { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( testspr::reduct_forward(sprout::begin(arr1)), testspr::reduct_forward(sprout::end(arr1)), 7 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( testspr::reduct_forward(sprout::begin(arr1)), testspr::reduct_forward(sprout::begin(arr1) + 5), 7, testspr::less() ); TESTSPR_BOTH_ASSERT(!result); } #endif #if defined(__clang__) { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( testspr::reduct_random_access(sprout::begin(arr1)), testspr::reduct_random_access(sprout::end(arr1)), 7 ); TESTSPR_BOTH_ASSERT(result); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search( testspr::reduct_random_access(sprout::begin(arr1)), testspr::reduct_random_access(sprout::begin(arr1) + 5), 7, testspr::less() ); TESTSPR_BOTH_ASSERT(!result); } #endif } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_binary_search_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP