mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-12-03 21:15:42 +00:00
42 lines
1.1 KiB
C++
42 lines
1.1 KiB
C++
|
#ifndef SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP
|
||
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP
|
||
|
|
|
||
|
|
#include <sprout/algorithm/upper_bound.hpp>
|
||
|
|
#include <sprout/array.hpp>
|
||
|
|
#include <sprout/container.hpp>
|
||
|
|
#include <testspr/tools.hpp>
|
||
|
|
|
||
|
|
namespace testspr {
|
||
|
|
static void algorithm_upper_bound_test() {
|
||
|
|
using namespace sprout;
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}};
|
||
|
|
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::upper_bound(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::end(arr1),
|
||
|
|
7
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 9);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::upper_bound(
|
||
|
|
sprout::begin(arr1),
|
||
|
|
sprout::begin(arr1) + 5,
|
||
|
|
7,
|
||
|
|
testspr::less<int>()
|
||
|
|
);
|
||
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|
||
|
|
} // namespace testspr
|
||
|
|
|
||
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
||
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_upper_bound_test
|
||
|
|
# include <testspr/include_main.hpp>
|
||
|
|
#endif
|
||
|
|
|
||
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP
|