mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2024-12-25 21:35:41 +00:00
109 lines
3 KiB
C++
109 lines
3 KiB
C++
|
#ifndef TESTSPR_SPROUT_ALGORITHM_STABLE_PARTITION_COPY_HPP
|
|||
|
|
#define TESTSPR_SPROUT_ALGORITHM_STABLE_PARTITION_COPY_HPP
|
|||
|
|
|
|||
|
|
#include <sprout/algorithm/stable_partition_copy.hpp>
|
|||
|
|
#include <sprout/array.hpp>
|
|||
|
|
#include <sprout/sub_array.hpp>
|
|||
|
|
#include <sprout/fixed_container.hpp>
|
|||
|
|
#include <testspr/tools.hpp>
|
|||
|
|
|
|||
|
|
namespace testspr {
|
|||
|
|
static void algorithm_stable_partition_copy_test() {
|
|||
|
|
using namespace sprout;
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 10>{};
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 4>{};
|
|||
|
|
|
|||
|
|
// [2 .. 8) <20>͈̔͂<CD88><CD82>p<EFBFBD>[<5B>e<EFBFBD>B<EFBFBD>V<EFBFBD><56><EFBFBD><EFBFBD> (is_odd)
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
arr2,
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 10>{{3, 5, 7, 4, 6, 8, 0, 0, 0, 0}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
arr2,
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 3>{{3, 5, 7}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
// [2 .. 8) <20>͈̔͂<CD88><CD82>p<EFBFBD>[<5B>e<EFBFBD>B<EFBFBD>V<EFBFBD><56><EFBFBD><EFBFBD> (is_odd)
|
|||
|
|
// <20>o<EFBFBD>͔͈͂<CD88><CD82>I<EFBFBD>[<5B>o<EFBFBD>[<5B><><EFBFBD><EFBFBD><EFBFBD>ꍇ
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
arr3,
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 4>{{3, 5, 7, 4}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
arr3,
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 3>{{3, 5, 7}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
// [2 .. 8) <20>͈̔͂<CD88><CD82>p<EFBFBD>[<5B>e<EFBFBD>B<EFBFBD>V<EFBFBD><56><EFBFBD><EFBFBD> (is_odd)
|
|||
|
|
// <20>o<EFBFBD>͔͈͂̐<CC90><D882>o<EFBFBD><6F>
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
sprout::sub(arr2, 2, 8),
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 6>{{3, 5, 7, 4, 6, 8}}
|
|||
|
|
));
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
sprout::get_fixed(partitioned),
|
|||
|
|
array<int, 10>{{0, 0, 3, 5, 7, 4, 6, 8, 0, 0}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
{
|
|||
|
|
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::stable_partition_copy(
|
|||
|
|
sprout::begin(arr1) + 2,
|
|||
|
|
sprout::begin(arr1) + 8,
|
|||
|
|
sprout::sub(arr2, 2, 8),
|
|||
|
|
is_odd<int>()
|
|||
|
|
);
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
partitioned,
|
|||
|
|
array<int, 3>{{3, 5, 7}}
|
|||
|
|
));
|
|||
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|||
|
|
sprout::get_fixed(partitioned),
|
|||
|
|
array<int, 10>{{0, 0, 3, 5, 7, 4, 6, 8, 0, 0}}
|
|||
|
|
));
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
} // namespace testspr
|
|||
|
|
|
|||
|
|
#endif // #ifndef TESTSPR_SPROUT_ALGORITHM_STABLE_PARTITION_COPY_HPP
|
|||
|
|
|