2013-08-08 09:54:33 +00:00
|
|
|
/*=============================================================================
|
2015-01-11 17:03:30 +00:00
|
|
|
Copyright (c) 2011-2015 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)
|
|
|
|
=============================================================================*/
|
2012-12-15 08:41:20 +00:00
|
|
|
#ifndef SPROUT_LIBS_ALGORITHM_TEST_PERTITION_POINT_CPP
|
|
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_PERTITION_POINT_CPP
|
|
|
|
|
|
|
|
#include <sprout/algorithm/partition_point.hpp>
|
|
|
|
#include <sprout/array.hpp>
|
|
|
|
#include <sprout/container.hpp>
|
|
|
|
#include <testspr/tools.hpp>
|
|
|
|
|
|
|
|
namespace testspr {
|
|
|
|
static void algorithm_partition_point_test() {
|
|
|
|
using namespace sprout;
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}};
|
|
|
|
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
|
|
|
sprout::begin(arr1),
|
|
|
|
sprout::end(arr1),
|
|
|
|
testspr::is_odd<int>()
|
|
|
|
);
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
|
|
|
sprout::begin(arr1),
|
|
|
|
sprout::begin(arr1) + 5,
|
|
|
|
testspr::is_odd<int>()
|
|
|
|
);
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
2013-01-10 17:55:19 +00:00
|
|
|
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
2015-05-11 01:34:12 +00:00
|
|
|
testspr::reduce_forward(sprout::begin(arr1)),
|
|
|
|
testspr::reduce_forward(sprout::end(arr1)),
|
2013-01-10 17:55:19 +00:00
|
|
|
testspr::is_odd<int>()
|
|
|
|
).base();
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
2015-05-11 01:34:12 +00:00
|
|
|
testspr::reduce_forward(sprout::begin(arr1)),
|
|
|
|
testspr::reduce_forward(sprout::begin(arr1) + 5),
|
2013-01-10 17:55:19 +00:00
|
|
|
testspr::is_odd<int>()
|
|
|
|
).base();
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
|
|
|
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
2015-05-11 01:34:12 +00:00
|
|
|
testspr::reduce_random_access(sprout::begin(arr1)),
|
|
|
|
testspr::reduce_random_access(sprout::end(arr1)),
|
2013-01-10 17:55:19 +00:00
|
|
|
testspr::is_odd<int>()
|
|
|
|
).base();
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
|
|
|
{
|
|
|
|
SPROUT_STATIC_CONSTEXPR auto found = sprout::partition_point(
|
2015-05-11 01:34:12 +00:00
|
|
|
testspr::reduce_random_access(sprout::begin(arr1)),
|
|
|
|
testspr::reduce_random_access(sprout::begin(arr1) + 5),
|
2013-01-10 17:55:19 +00:00
|
|
|
testspr::is_odd<int>()
|
|
|
|
).base();
|
|
|
|
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
|
|
|
|
}
|
2012-12-15 08:41:20 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} // namespace testspr
|
|
|
|
|
|
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
|
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_partition_point_test
|
|
|
|
# include <testspr/include_main.hpp>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_PERTITION_POINT_CPP
|