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

fix rexursion depth: is_pertitioned, partition_point, is_sorted, is_sorted_until

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-15 17:41:20 +09:00
parent d6914ddd72
commit eea1c2bbc1
12 changed files with 410 additions and 50 deletions
Download patch file Download diff file Expand all files Collapse all files

40
libs/algorithm/test/partition_point.cpp Normal file
View file

@ -0,0 +1,40 @@
#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);
}
}
}
} // 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