#ifndef SPROUT_LIBS_ALGORITHM_TEST_MINMAX_ELEMENT_CPP #define SPROUT_LIBS_ALGORITHM_TEST_MINMAX_ELEMENT_CPP #include #include #include #include namespace testspr { static void algorithm_minmax_element_test() { using namespace sprout; { SPROUT_STATIC_CONSTEXPR auto arr1 = array{{6, 5, 7, 4, 8, 3, 9, 2, 10, 1}}; { SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element( sprout::begin(arr1), sprout::end(arr1) ); TESTSPR_BOTH_ASSERT(result.first == sprout::begin(arr1) + 9); TESTSPR_BOTH_ASSERT(result.second == sprout::begin(arr1) + 8); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element( sprout::begin(arr1), sprout::begin(arr1) + 5 ); TESTSPR_BOTH_ASSERT(result.first == sprout::begin(arr1) + 3); TESTSPR_BOTH_ASSERT(result.second == sprout::begin(arr1) + 4); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element( sprout::begin(arr1), sprout::end(arr1), testspr::less() ); TESTSPR_BOTH_ASSERT(result.first == sprout::begin(arr1) + 9); TESTSPR_BOTH_ASSERT(result.second == sprout::begin(arr1) + 8); } { SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element( sprout::begin(arr1), sprout::begin(arr1) + 5, testspr::less() ); TESTSPR_BOTH_ASSERT(result.first == sprout::begin(arr1) + 3); TESTSPR_BOTH_ASSERT(result.second == sprout::begin(arr1) + 4); } } } } // namespace testspr #ifndef TESTSPR_CPP_INCLUDE # define TESTSPR_TEST_FUNCTION testspr::algorithm_minmax_element_test # include #endif #endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_MINMAX_ELEMENT_CPP