Sprout/testspr/sprout/algorithm/partition_copy.hpp

108 lines
2.9 KiB
C++

#ifndef TESTSPR_SPROUT_ALGORITHM_PARTITION_COPY_HPP
#define TESTSPR_SPROUT_ALGORITHM_PARTITION_COPY_HPP
#include <sprout/algorithm/partition_copy.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_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) の範囲をパーティション (is_odd)
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::partition_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
partitioned,
array<int, 10>{{7, 5, 3, 4, 6, 8, 0, 0, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::partition_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr2,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
partitioned,
array<int, 3>{{7, 5, 3}}
));
}
// [2 .. 8) の範囲をパーティション (is_odd)
// 出力範囲をオーバーする場合
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::partition_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
partitioned,
array<int, 4>{{5, 3, 4, 6}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::partition_copy(
sprout::begin(arr1) + 2,
sprout::begin(arr1) + 8,
arr3,
is_odd<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
partitioned,
array<int, 2>{{5, 3}}
));
}
// [2 .. 8) の範囲をパーティション (is_odd)
// 出力範囲の切り出し
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::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>{{7, 5, 3, 4, 6, 8}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 7, 5, 3, 4, 6, 8, 0, 0}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto partitioned = sprout::fit::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>{{7, 5, 3}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(partitioned),
array<int, 10>{{0, 0, 7, 5, 3, 4, 6, 8, 0, 0}}
));
}
}
}
} // namespace testspr
#endif // #ifndef TESTSPR_SPROUT_ALGORITHM_PARTITION_COPY_HPP