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

add next_permutatin, prev_premutation

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-07-25 14:27:01 +09:00
parent e3511d71b0
commit a64938fad0
12 changed files with 668 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

137
libs/algorithm/test/prev_permutation.cpp Normal file
View file

@ -0,0 +1,137 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_PREV_PERMUTATION_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_PREV_PERMUTATION_CPP
#include <sprout/algorithm/prev_permutation.hpp>
#include <sprout/array.hpp>
#include <sprout/sub_array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_prev_permutation_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 4, 3, 2, 1}};
// 順列
{
SPROUT_STATIC_CONSTEXPR auto permutation = sprout::prev_permutation(
arr1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
permutation.first,
array<int, 5>{{5, 4, 3, 1, 2}}
));
TESTSPR_BOTH_ASSERT(permutation.second);
}
{
SPROUT_STATIC_CONSTEXPR auto permutation = sprout::fit::prev_permutation(
arr1
);
TESTSPR_BOTH_ASSERT(testspr::equal(
permutation.first,
array<int, 5>{{5, 4, 3, 1, 2}}
));
TESTSPR_BOTH_ASSERT(permutation.second);
}
// 順列
// 範囲の切り出し
// !!!
// {
// SPROUT_STATIC_CONSTEXPR auto permutation = sprout::prev_permutation(
// sprout::sub(arr1, 2, 4)
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// permutation.first,
// array<int, 3>{{4, 2, 3}}
// ));
// TESTSPR_BOTH_ASSERT(testspr::equal(
// sprout::get_internal(permutation.first),
// array<int, 5>{{5, 4, 2, 3, 1}}
// ));
// TESTSPR_BOTH_ASSERT(permutation.second);
// }
// {
// SPROUT_STATIC_CONSTEXPR auto permutation = sprout::fit::prev_permutation(
// sprout::sub(arr1, 2, 4)
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// permutation.first,
// array<int, 3>{{4, 2, 3}}
// ));
// TESTSPR_BOTH_ASSERT(testspr::equal(
// sprout::get_internal(permutation.first),
// array<int, 5>{{5, 4, 2, 3, 1}}
// ));
// TESTSPR_BOTH_ASSERT(permutation.second);
// }
}
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 5>{{5, 4, 3, 2, 1}};
// 順列
{
SPROUT_STATIC_CONSTEXPR auto permutation = sprout::prev_permutation(
arr1,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
permutation.first,
array<int, 5>{{5, 4, 3, 1, 2}}
));
TESTSPR_BOTH_ASSERT(permutation.second);
}
{
SPROUT_STATIC_CONSTEXPR auto permutation = sprout::fit::prev_permutation(
arr1,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(testspr::equal(
permutation.first,
array<int, 5>{{5, 4, 3, 1, 2}}
));
TESTSPR_BOTH_ASSERT(permutation.second);
}
// 順列
// 範囲の切り出し
// !!!
// {
// SPROUT_STATIC_CONSTEXPR auto permutation = sprout::prev_permutation(
// sprout::sub(arr1, 2, 4),
// testspr::less<int>()
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// permutation.first,
// array<int, 3>{{4, 2, 3}}
// ));
// TESTSPR_BOTH_ASSERT(testspr::equal(
// sprout::get_internal(permutation.first),
// array<int, 5>{{5, 4, 2, 3, 1}}
// ));
// TESTSPR_BOTH_ASSERT(permutation.second);
// }
// {
// SPROUT_STATIC_CONSTEXPR auto permutation = sprout::fit::prev_permutation(
// sprout::sub(arr1, 2, 4),
// testspr::less<int>()
// );
// TESTSPR_BOTH_ASSERT(testspr::equal(
// permutation.first,
// array<int, 3>{{4, 2, 3}}
// ));
// TESTSPR_BOTH_ASSERT(testspr::equal(
// sprout::get_internal(permutation.first),
// array<int, 5>{{5, 4, 2, 3, 1}}
// ));
// TESTSPR_BOTH_ASSERT(permutation.second);
// }
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_prev_permutation_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_PREV_PERMUTATION_CPP