1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/libs/algorithm/test/max.cpp

61 lines
1.6 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2014-01-08 07:48:12 +00:00
Copyright (c) 2011-2014 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
#ifndef SPROUT_LIBS_ALGORITHM_TEST_MAX_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_MAX_CPP
#include <sprout/algorithm/max.hpp>
#include <sprout/array.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_max_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 2>{{-1, 1}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::max(
arr1[0],
arr1[1]
);
TESTSPR_BOTH_ASSERT(result == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::max(
arr1[1],
arr1[0]
);
TESTSPR_BOTH_ASSERT(result == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::max(
arr1[0],
arr1[1],
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result == arr1[1]);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::max(
arr1[1],
arr1[0],
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result == arr1[1]);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_max_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_MAX_CPP