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

fix recursion depth: some algorithms

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-01-12 02:39:51 +09:00
parent 830fc27394
commit cb584edb3f
14 changed files with 1443 additions and 71 deletions
Download patch file Download diff file Expand all files Collapse all files

72
libs/algorithm/test/minmax_element.cpp
View file

@ -46,6 +46,78 @@ namespace testspr {
TESTSPR_BOTH_ASSERT(result.first == sprout::begin(arr1) + 3);
TESTSPR_BOTH_ASSERT(result.second == sprout::begin(arr1) + 4);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_forward(sprout::begin(arr1)),
testspr::reduct_forward(sprout::end(arr1))
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 8);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_forward(sprout::begin(arr1)),
testspr::reduct_forward(sprout::begin(arr1) + 5)
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 4);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_forward(sprout::begin(arr1)),
testspr::reduct_forward(sprout::end(arr1)),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 8);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_forward(sprout::begin(arr1)),
testspr::reduct_forward(sprout::begin(arr1) + 5),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 4);
}
#if defined(__clang__)
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::end(arr1))
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 8);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::begin(arr1) + 5)
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 4);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::end(arr1)),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 8);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
testspr::reduct_random_access(sprout::begin(arr1)),
testspr::reduct_random_access(sprout::begin(arr1) + 5),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
TESTSPR_BOTH_ASSERT(result.second.base() == sprout::begin(arr1) + 4);
}
#endif
}
}
} // namespace testspr