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

move textspr/sprout/* -> libs/<libname>/test/*

Browse source 
fix binomial_distribution
This commit is contained in:
bolero-MURAKAMI 2012-05-19 18:46:38 +09:00
parent 237ec76266
commit 0ceabb5b9b
107 changed files with 1228 additions and 840 deletions
Download patch file Download diff file Expand all files Collapse all files

128
libs/algorithm/test/push_heap.cpp Normal file
View file

@ -0,0 +1,128 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_PUSH_HEAP_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_PUSH_HEAP_CPP
#include <sprout/algorithm/push_heap.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_push_heap_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 8, 9, 6, 4, 5, 3, 1, 2, 7}};
// ヒープにプッシュ
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
arr1
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
}
// ヒープにプッシュ
// 範囲の切り出し
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
sprout::sub(arr1, 2, 10)
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
}
}
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{10, 8, 9, 6, 4, 5, 3, 1, 2, 7}};
// ヒープにプッシュ
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
arr1,
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 10>{{10, 8, 9, 6, 7, 5, 3, 1, 2, 4}}
));
}
// ヒープにプッシュ
// 範囲の切り出し
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::push_heap(
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
}
{
SPROUT_STATIC_CONSTEXPR auto heap = sprout::fit::push_heap(
sprout::sub(arr1, 2, 10),
testspr::less<int>()
);
TESTSPR_DOUBLE_ASSERT(testspr::equal(
heap,
array<int, 8>{{9, 7, 4, 6, 3, 1, 2, 5}}
));
TESTSPR_DOUBLE_ASSERT(testspr::equal(
sprout::get_internal(heap),
array<int, 10>{{10, 8, 9, 7, 4, 6, 3, 1, 2, 5}}
));
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_push_heap_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_PUSH_HEAP_CPP