mirror of
https://github.com/bolero-MURAKAMI/Sprout
synced 2024-11-12 21:09:01 +00:00
0ceabb5b9b
fix binomial_distribution
136 lines
3.6 KiB
C++
136 lines
3.6 KiB
C++
#ifndef SPROUT_LIBS_ALGORITHM_TEST_MAKE_PARTIAL_HEAP_CPP
|
|
#define SPROUT_LIBS_ALGORITHM_TEST_MAKE_PARTIAL_HEAP_CPP
|
|
|
|
#include <sprout/algorithm/make_partial_heap.hpp>
|
|
#include <sprout/array.hpp>
|
|
#include <sprout/sub_array.hpp>
|
|
#include <sprout/container.hpp>
|
|
#include <testspr/tools.hpp>
|
|
|
|
namespace testspr {
|
|
static void algorithm_make_partial_heap_test() {
|
|
using namespace sprout;
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 7, 8, 6, 9, 2, 5, 3, 4, 1}};
|
|
|
|
// ヒープ作成
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_partial_heap(
|
|
arr1,
|
|
sprout::begin(arr1) + 5
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 10>{{5, 4, 1, 3, 2, 10, 9, 8, 7, 6}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_partial_heap(
|
|
arr1,
|
|
sprout::begin(arr1) + 5
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 5>{{5, 4, 1, 3, 2}}
|
|
));
|
|
}
|
|
// ヒープ作成
|
|
// 範囲の切り出し
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_partial_heap(
|
|
sprout::sub(arr1, 2, 10),
|
|
sprout::begin(arr1) + 5
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 8>{{3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
sprout::get_internal(heap),
|
|
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_partial_heap(
|
|
sprout::sub(arr1, 2, 10),
|
|
sprout::begin(arr1) + 5
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 3>{{3, 1, 2}}
|
|
));
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
sprout::get_internal(heap),
|
|
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
}
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 7, 8, 6, 9, 2, 5, 3, 4, 1}};
|
|
|
|
// ヒープ作成
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_partial_heap(
|
|
arr1,
|
|
sprout::begin(arr1) + 5,
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 10>{{5, 4, 1, 3, 2, 10, 9, 8, 7, 6}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_partial_heap(
|
|
arr1,
|
|
sprout::begin(arr1) + 5,
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 5>{{5, 4, 1, 3, 2}}
|
|
));
|
|
}
|
|
// ヒープ作成
|
|
// 範囲の切り出し
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::make_partial_heap(
|
|
sprout::sub(arr1, 2, 10),
|
|
sprout::begin(arr1) + 5,
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 8>{{3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
sprout::get_internal(heap),
|
|
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
}
|
|
{
|
|
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::make_partial_heap(
|
|
sprout::sub(arr1, 2, 10),
|
|
sprout::begin(arr1) + 5,
|
|
testspr::less<int>()
|
|
);
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
heap,
|
|
array<int, 3>{{3, 1, 2}}
|
|
));
|
|
TESTSPR_DOUBLE_ASSERT(testspr::equal(
|
|
sprout::get_internal(heap),
|
|
array<int, 10>{{10, 7, 3, 1, 2, 9, 8, 6, 5, 4}}
|
|
));
|
|
}
|
|
}
|
|
}
|
|
} // namespace testspr
|
|
|
|
#ifndef TESTSPR_CPP_INCLUDE
|
|
# define TESTSPR_TEST_FUNCTION testspr::algorithm_make_partial_heap_test
|
|
# include <testspr/include_main.hpp>
|
|
#endif
|
|
|
|
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_MAKE_PARTIAL_HEAP_CPP
|
|
|