std::ranges::minmax_element, std::ranges::minmax_element_result
From cppreference.com
| Defined in header <algorithm>
|
||
| Call signature |
||
template< std::forward_iterator I, std::sentinel_for<I> S,
class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<I, Proj>> Comp = ranges::less >
constexpr ranges::minmax_element_result<I>
minmax_element( I first, S last, Comp comp = {}, Proj proj = {} );
|
(1) | (since C++20) |
template< ranges::forward_range R, class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<ranges::iterator_t<R>,
Proj>> Comp = ranges::less >
constexpr ranges::minmax_element_result<ranges::borrowed_iterator_t<R>>
minmax_element( R&& r, Comp comp = {}, Proj proj = {} );
|
(2) | (since C++20) |
template< /*execution-policy*/ Ep,
std::random_access_iterator I, std::sized_sentinel_for<I> S,
class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<I, Proj>> Comp = ranges::less >
ranges::minmax_element_result<I>
minmax_element( Ep&& policy, I first, S last,
Comp comp = {}, Proj proj = {} );
|
(3) | (since C++26) |
template< /*execution-policy*/ Ep, /*sized-random-access-range*/ R,
class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<ranges::iterator_t<R>,
Proj>> Comp = ranges::less >
ranges::minmax_element_result<ranges::borrowed_iterator_t<R>>
minmax_element( Ep&& policy, R&& r, Comp comp = {}, Proj proj = {} );
|
(4) | (since C++26) |
| Helper types |
||
template< class I >
using minmax_element_result = ranges::min_max_result<I>;
|
(5) | (since C++20) |
For the definition of /*execution-policy*/, see this page; for the definition of /*sized-random-access-range*/, see this page.
1,2) Finds the smallest and greatest element (projected by
proj) in the target range [first, last) or r, the projected values are compared using comp.3,4) Same as (1,2), but executed according to
policy.The function-like entities described on this page are algorithm function objects (informally known as niebloids), that is:
- Explicit template argument lists cannot be specified when calling any of them.
- None of them are visible to argument-dependent lookup.
- When any of them are found by normal unqualified lookup as the name to the left of the function-call operator, argument-dependent lookup is inhibited.
Parameters
| first, last | - | the iterator-sentinel pair defining the target range |
| r | - | the target range |
| comp | - | the comparator to be applied to the (projected) elements |
| proj | - | the projection to be applied to the elements |
| policy | - | the execution policy to use |
Return value
A ranges::minmax_element_result object, where:
- The data member min holds the iterator to the smallest element in the target range.
- If there are multiple smallest values,
minholds the iterator to the first one of them. - If the target range is empty,
minholdslast.
- If there are multiple smallest values,
- The data member max holds the iterator to the greatest element in the target range.
- If there are multiple greatest values,
maxholds the iterator to the last one of them. - If the target range is empty,
maxholdslast.
- If there are multiple greatest values,
Complexity
Given N as ranges::distance(first, last) or ranges::distance(r):
1,2) Exactly max(⌊
(N-1)⌋,0) applications of
| 3 |
| 2 |
comp, and twice as many applications of proj.3,4) 𝓞(N) applications of
comp, and twice as many applications of proj.Exceptions
3,4) During the execution process:
- If the temporary memory resources required for parallelization are not available, std::bad_alloc is thrown.
- If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for standard policies, std::terminate is invoked).
Possible implementation
struct minmax_element_fn
{
template<std::forward_iterator I, std::sentinel_for<I> S,
class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<I, Proj>> Comp = ranges::less>
constexpr ranges::minmax_element_result<I>
operator()(I first, S last, Comp comp = {}, Proj proj = {}) const
{
auto min = first, max = first;
if (first == last || ++first == last)
return {min, max};
if (std::invoke(comp, std::invoke(proj, *first),
std::invoke(proj, *min)))
min = first;
else
max = first;
while (++first != last)
{
auto i = first;
if (++first == last)
{
if (std::invoke(comp, std::invoke(proj, *i),
std::invoke(proj, *min)))
min = i;
else if (!(std::invoke(comp, std::invoke(proj, *i),
std::invoke(proj, *max))))
max = i;
break;
}
else
{
if (std::invoke(comp, std::invoke(proj, *first),
std::invoke(proj, *i)))
{
if (std::invoke(comp, std::invoke(proj, *first),
std::invoke(proj, *min)))
min = first;
if (!(std::invoke(comp, std::invoke(proj, *i),
std::invoke(proj, *max))))
max = i;
}
else
{
if (std::invoke(comp, std::invoke(proj, *i),
std::invoke(proj, *min)))
min = i;
if (!(std::invoke(comp, std::invoke(proj, *first),
std::invoke(proj, *max))))
max = first;
}
}
}
return {min, max};
}
template<ranges::forward_range R, class Proj = std::identity,
std::indirect_strict_weak_order
<std::projected<ranges::iterator_t<R>,
Proj>> Comp = ranges::less>
constexpr ranges::minmax_element_result<ranges::borrowed_iterator_t<R>>
operator()(R&& r, Comp comp = {}, Proj proj = {}) const
{
return (*this)(ranges::begin(r),
ranges::next(ranges::begin(r), ranges::end(r)),
std::ref(comp), std::ref(proj));
}
};
inline constexpr minmax_element_fn minmax_element;
|
Example
Run this code
#include <algorithm>
#include <iostream>
#include <iterator>
namespace ranges = std::ranges;
int main()
{
const auto v = {3, 9, 1, 4, 1, 2, 5, 9};
const auto [min, max] = ranges::minmax_element(v);
std::cout
<< "min = " << *min << ", at [" << ranges::distance(v.begin(), min) << "]\n"
<< "max = " << *max << ", at [" << ranges::distance(v.begin(), max) << "]\n";
}
Output:
min = 1, at [2]
max = 9, at [7]
See also
(C++11) |
returns the smallest and the largest elements in a range (function template) |
(C++20) |
returns the smallest element in a range (algorithm function object) |
(C++20) |
returns the largest element in a range (algorithm function object) |
(C++20) |
returns the smaller and larger of two elements (algorithm function object) |