Sprout/libs/algorithm/test/stable_partition.cpp

84 lines
2.5 KiB
C++
Raw Normal View History

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)
=============================================================================*/
#ifndef SPROUT_LIBS_ALGORITHM_TEST_STABLE_PARTITION_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_STABLE_PARTITION_CPP
2011-12-23 11:59:33 +00:00
#include <sprout/algorithm/stable_partition.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
2011-12-23 11:59:33 +00:00
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_stable_partition_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
2014-07-02 13:16:29 +00:00
// partition (odd)
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::stable_partition(
arr1,
testspr::is_odd<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
partitioned,
array<int, 10>{{1, 3, 5, 7, 9, 2, 4, 6, 8, 10}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::stable_partition(
arr1,
testspr::is_odd<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
partitioned,
array<int, 5>{{1, 3, 5, 7, 9}}
));
}
2014-07-02 13:16:29 +00:00
// partition (odd)
// from sub range
2011-12-23 11:59:33 +00:00
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::stable_partition(
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
partitioned,
array<int, 6>{{3, 5, 7, 4, 6, 8}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 2, 3, 5, 7, 4, 6, 8, 9, 10}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::stable_partition(
sprout::sub(arr1, 2, 8),
testspr::is_odd<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
2011-12-23 11:59:33 +00:00
partitioned,
array<int, 3>{{3, 5, 7}}
));
TESTSPR_BOTH_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
2011-12-23 11:59:33 +00:00
array<int, 10>{{1, 2, 3, 5, 7, 4, 6, 8, 9, 10}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_stable_partition_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_STABLE_PARTITION_CPP