| 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 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 minmax_element_result<ranges::borrowed_iterator_t<R>> minmax_element( R&& r, Comp comp = {}, Proj proj = {} ); |
(2) | (since C++20) |
| Helper types |
||
| template< class I > using minmax_element_result = ranges::min_max_result<I>; |
(3) | (since C++20) |
[first, last).r as the source range, as if using ranges::begin(r) as first and ranges::end(r) as last.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 | - | iterator-sentinel pair denoting the range to examine |
| r | - | the range to examine |
| comp | - | comparison to apply to the projected elements |
| proj | - | projection to apply to the elements. |
Return value
An object consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second. Returns {first, first} if the range is empty. If several elements are equivalent to the smallest element, the iterator to the first such element is returned. If several elements are equivalent to the largest element, the iterator to the last such element is returned.
Complexity
At most std::max(std::floor(1.5 * (N − 1)), 0.0) applications of the comparison and twice as many applications of the projection, where N = ranges::distance(first, last).
Possible implementation
|
Example
#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";
}min = 1, at [2]
max = 9, at [7]See also
| (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) |
| (C++11) |
returns the smallest and the largest elements in a range (function template) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.