mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-04 14:14:09 +00:00
fix recursion depth: some algorithms
This commit is contained in:
bolero-MURAKAMI
parent
830fc27394
commit
cb584edb3f
14 changed files with 1443 additions and 71 deletions
432
libs/algorithm/test/tristate_lexicographical_compare.cpp
Normal file
432
libs/algorithm/test/tristate_lexicographical_compare.cpp
Normal file
|
|
@ -0,0 +1,432 @@
|
|||
#ifndef SPROUT_LIBS_ALGORITHM_TEST_TRISTATE_LEXICOGRAPHICAL_COMPARE_CPP
|
||||
#define SPROUT_LIBS_ALGORITHM_TEST_TRISTATE_LEXICOGRAPHICAL_COMPARE_CPP
|
||||
|
||||
#include <sprout/algorithm/tristate_lexicographical_compare.hpp>
|
||||
#include <sprout/array.hpp>
|
||||
#include <sprout/container.hpp>
|
||||
#include <testspr/tools.hpp>
|
||||
|
||||
namespace testspr {
|
||||
static void algorithm_tristate_lexicographical_compare_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>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
|
||||
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 1, 2, 3}};
|
||||
SPROUT_STATIC_CONSTEXPR auto arr4 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 11, 12, 13}};
|
||||
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr2),
|
||||
sprout::end(arr2)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr3),
|
||||
sprout::end(arr3)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr4),
|
||||
sprout::end(arr4)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr2),
|
||||
sprout::end(arr2)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr3),
|
||||
sprout::end(arr3)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr4),
|
||||
sprout::end(arr4)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr2),
|
||||
sprout::begin(arr2) + 5
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr2),
|
||||
sprout::end(arr2),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr3),
|
||||
sprout::end(arr3),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr4),
|
||||
sprout::end(arr4),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr2),
|
||||
sprout::end(arr2),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr3),
|
||||
sprout::end(arr3),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::begin(arr1) + 5,
|
||||
sprout::begin(arr4),
|
||||
sprout::end(arr4),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
sprout::begin(arr1),
|
||||
sprout::end(arr1),
|
||||
sprout::begin(arr2),
|
||||
sprout::begin(arr2) + 5,
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
|
||||
#if defined(__clang__)
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::end(arr2))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr3)),
|
||||
testspr::reduct_input(sprout::end(arr3))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr4)),
|
||||
testspr::reduct_input(sprout::end(arr4))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::end(arr2))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr3)),
|
||||
testspr::reduct_input(sprout::end(arr3))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr4)),
|
||||
testspr::reduct_input(sprout::end(arr4))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::begin(arr2) + 5)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::end(arr2)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr3)),
|
||||
testspr::reduct_input(sprout::end(arr3)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr4)),
|
||||
testspr::reduct_input(sprout::end(arr4)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::end(arr2)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr3)),
|
||||
testspr::reduct_input(sprout::end(arr3)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_input(sprout::begin(arr4)),
|
||||
testspr::reduct_input(sprout::end(arr4)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_input(sprout::begin(arr1)),
|
||||
testspr::reduct_input(sprout::end(arr1)),
|
||||
testspr::reduct_input(sprout::begin(arr2)),
|
||||
testspr::reduct_input(sprout::begin(arr2) + 5),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
#endif
|
||||
|
||||
#if defined(__clang__)
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::end(arr2))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr3)),
|
||||
testspr::reduct_random_access(sprout::end(arr3))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr4)),
|
||||
testspr::reduct_random_access(sprout::end(arr4))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::end(arr2))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr3)),
|
||||
testspr::reduct_random_access(sprout::end(arr3))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr4)),
|
||||
testspr::reduct_random_access(sprout::end(arr4))
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2) + 5)
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::end(arr2)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result == 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr3)),
|
||||
testspr::reduct_random_access(sprout::end(arr3)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr4)),
|
||||
testspr::reduct_random_access(sprout::end(arr4)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::end(arr2)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr3)),
|
||||
testspr::reduct_random_access(sprout::end(arr3)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduct_random_access(sprout::begin(arr4)),
|
||||
testspr::reduct_random_access(sprout::end(arr4)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result < 0);
|
||||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::tristate_lexicographical_compare(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2)),
|
||||
testspr::reduct_random_access(sprout::begin(arr2) + 5),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result > 0);
|
||||
}
|
||||
#endif
|
||||
}
|
||||
}
|
||||
} // namespace testspr
|
||||
|
||||
#ifndef TESTSPR_CPP_INCLUDE
|
||||
# define TESTSPR_TEST_FUNCTION testspr::algorithm_tristate_lexicographical_compare_test
|
||||
# include <testspr/include_main.hpp>
|
||||
#endif
|
||||
|
||||
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_TRISTATE_LEXICOGRAPHICAL_COMPARE_CPP
|
||||
Loading…
Add table
Add a link
Reference in a new issue