mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-11-14 10:39:05 +00:00
54 lines
1.5 KiB
C++
54 lines
1.5 KiB
C++
#ifndef SPROUT_LIBS_ALGORITHM_TEST_MAX_ELEMENT_CPP
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_MAX_ELEMENT_CPP
|
|
|
|
#include <sprout/algorithm/max_element.hpp>
|
|
#include <sprout/array.hpp>
|
|
#include <sprout/container.hpp>
|
|
#include <testspr/tools.hpp>
|
|
|
|
namespace testspr {
|
|
static void algorithm_max_element_test() {
|
|
using namespace sprout;
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{6, 5, 7, 4, 8, 3, 9, 2, 10, 1}};
|
|
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto result = sprout::max_element(
|
|
sprout::begin(arr1),
|
|
sprout::end(arr1)
|
|
);
|
|
TESTSPR_BOTH_ASSERT(result == sprout::begin(arr1) + 8);
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto result = sprout::max_element(
|
|
sprout::begin(arr1),
|
|
sprout::begin(arr1) + 5
|
|
);
|
|
TESTSPR_BOTH_ASSERT(result == sprout::begin(arr1) + 4);
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto result = sprout::max_element(
|
|
sprout::begin(arr1),
|
|
sprout::end(arr1),
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(result == sprout::begin(arr1) + 8);
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto result = sprout::max_element(
|
|
sprout::begin(arr1),
|
|
sprout::begin(arr1) + 5,
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_BOTH_ASSERT(result == sprout::begin(arr1) + 4);
|
|
}
|
|
}
|
|
}
|
|
} // namespace testspr
|
|
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_max_element_test
|
|
# include <testspr/include_main.hpp>
|
|
#endif
|
|
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_MAX_ELEMENT_CPP
|