mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-04 14:14:09 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix recursion depth: min_element, max_element, minmax_element

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-16 21:46:16 +09:00
parent 86f68671a1
commit 1c085cb707
10 changed files with 539 additions and 17 deletions
Download patch file Download diff file Expand all files Collapse all files

57
libs/algorithm/test/minmax.cpp Normal file
View file

@ -0,0 +1,57 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_MINMAX_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_MINMAX_CPP
#include <sprout/algorithm/minmax.hpp>
#include <sprout/array.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_minmax_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 2>{{-1, 1}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(
arr1[0],
arr1[1]
);
TESTSPR_BOTH_ASSERT(result.first == arr1[0]);
TESTSPR_BOTH_ASSERT(result.second == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(
arr1[1],
arr1[0]
);
TESTSPR_BOTH_ASSERT(result.first == arr1[0]);
TESTSPR_BOTH_ASSERT(result.second == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(
arr1[0],
arr1[1],
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first == arr1[0]);
TESTSPR_BOTH_ASSERT(result.second == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax(
arr1[1],
arr1[0],
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first == arr1[0]);
TESTSPR_BOTH_ASSERT(result.second == arr1[1]);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_minmax_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_MINMAX_CPP