#ifndef SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP #define SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP #include #include #include #include namespace testspr { static void algorithm_search_n_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{1, 2, 3, 5, 5, 5, 5, 8, 9, 10}}; { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::end(arr1), 2, 5 ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::end(arr1), 4, 5 ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::begin(arr1) + 5, 2, 5 ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::begin(arr1) + 5, 4, 5 ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::end(arr1), 2, 5, testspr::equal_to() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::end(arr1), 4, 5, testspr::equal_to() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::begin(arr1) + 5, 2, 5, testspr::equal_to() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 3); } { SPROUT_STATIC_CONSTEXPR auto found = sprout::search_n( sprout::begin(arr1), sprout::begin(arr1) + 5, 4, 5, testspr::equal_to() ); TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_search_n_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_SEARCH_N_CPP