mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-16 15:14:13 +00:00
rename reduct_iterator -> reduce_iterator
This commit is contained in:
parent
64ca12a984
commit
fc0a1817d5
46 changed files with 1413 additions and 1413 deletions
|
@ -56,24 +56,24 @@ namespace testspr {
|
|||
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
|
||||
testspr::reduct_forward(sprout::begin(arr1)),
|
||||
testspr::reduct_forward(sprout::end(arr1))
|
||||
testspr::reduce_forward(sprout::begin(arr1)),
|
||||
testspr::reduce_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::reduce_forward(sprout::begin(arr1)),
|
||||
testspr::reduce_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::reduce_forward(sprout::begin(arr1)),
|
||||
testspr::reduce_forward(sprout::end(arr1)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
|
||||
|
@ -81,8 +81,8 @@ namespace testspr {
|
|||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
|
||||
testspr::reduct_forward(sprout::begin(arr1)),
|
||||
testspr::reduct_forward(sprout::begin(arr1) + 5),
|
||||
testspr::reduce_forward(sprout::begin(arr1)),
|
||||
testspr::reduce_forward(sprout::begin(arr1) + 5),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
|
||||
|
@ -91,24 +91,24 @@ namespace testspr {
|
|||
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::end(arr1))
|
||||
testspr::reduce_random_access(sprout::begin(arr1)),
|
||||
testspr::reduce_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::reduce_random_access(sprout::begin(arr1)),
|
||||
testspr::reduce_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::reduce_random_access(sprout::begin(arr1)),
|
||||
testspr::reduce_random_access(sprout::end(arr1)),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 9);
|
||||
|
@ -116,8 +116,8 @@ namespace testspr {
|
|||
}
|
||||
{
|
||||
SPROUT_STATIC_CONSTEXPR auto result = sprout::minmax_element(
|
||||
testspr::reduct_random_access(sprout::begin(arr1)),
|
||||
testspr::reduct_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::reduce_random_access(sprout::begin(arr1)),
|
||||
testspr::reduce_random_access(sprout::begin(arr1) + 5),
|
||||
testspr::less<int>()
|
||||
);
|
||||
TESTSPR_BOTH_ASSERT(result.first.base() == sprout::begin(arr1) + 3);
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue