mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-04 14:14:09 +00:00
rename unfold -> recurrence, add-new unfold
This commit is contained in:
parent
a9308ae3ee
commit
b1b7a9fefc
19 changed files with 585 additions and 174 deletions
80
libs/algorithm/test/recurrence.cpp
Normal file
80
libs/algorithm/test/recurrence.cpp
Normal file
|
@ -0,0 +1,80 @@
|
|||
#ifndef SPROUT_LIBS_ALGORITHM_TEST_RECURRENCE_CPP
|
||||
#define SPROUT_LIBS_ALGORITHM_TEST_RECURRENCE_CPP
|
||||
|
||||
#include <sprout/algorithm/recurrence.hpp>
|
||||
#include <sprout/array.hpp>
|
||||
#include <sprout/sub_array.hpp>
|
||||
#include <sprout/container.hpp>
|
||||
#include <testspr/tools.hpp>
|
||||
|
||||
namespace testspr {
|
||||
static void algorithm_recurrence_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 recurrenced = sprout::recurrence(
|
||||
arr1,
|
||||
testspr::x2<int>(),
|
||||
2
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
recurrenced,
|
||||
array<int, 10>{{2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}}
|
||||
));
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto recurrenced = sprout::fit::recurrence(
|
||||
arr1,
|
||||
testspr::x2<int>(),
|
||||
2
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
recurrenced,
|
||||
array<int, 10>{{2, 4, 8, 16, 32, 64, 128, 256, 512, 1024}}
|
||||
));
|
||||
}
|
||||
// 生成
|
||||
// 範囲の切り出し
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto recurrenced = sprout::recurrence(
|
||||
sprout::sub(arr1, 2, 8),
|
||||
testspr::x2<int>(),
|
||||
2
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
recurrenced,
|
||||
array<int, 6>{{2, 4, 8, 16, 32, 64}}
|
||||
));
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
sprout::get_internal(recurrenced),
|
||||
array<int, 10>{{1, 2, 2, 4, 8, 16, 32, 64, 9, 10}}
|
||||
));
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto recurrenced = sprout::fit::recurrence(
|
||||
sprout::sub(arr1, 2, 8),
|
||||
testspr::x2<int>(),
|
||||
2
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
recurrenced,
|
||||
array<int, 6>{{2, 4, 8, 16, 32, 64}}
|
||||
));
|
||||
TESTSPR_BOTH_ASSERT(testspr::equal(
|
||||
sprout::get_internal(recurrenced),
|
||||
array<int, 10>{{1, 2, 2, 4, 8, 16, 32, 64, 9, 10}}
|
||||
));
|
||||
}
|
||||
}
|
||||
}
|
||||
} // namespace testspr
|
||||
|
||||
#ifndef TESTSPR_CPP_INCLUDE
|
||||
# define TESTSPR_TEST_FUNCTION testspr::algorithm_recurrence_test
|
||||
# include <testspr/include_main.hpp>
|
||||
#endif
|
||||
|
||||
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_RECURRENCE_CPP
|
Loading…
Add table
Add a link
Reference in a new issue