std::minmax( ) algorithm
- od C++14
- od C++11
// (1)
template< class T >
constexpr std::pair<const T&, const T&> minmax( const T& a, const T& b );
// (2)
template< class T, class Compare >
constexpr std::pair<const T&, const T&> minmax( const T& a, const T& b,
Compare comp );
// (3)
template< class T >
constexpr std::pair<T, T> minmax( std::initializer_list<T> ilist);
// (4)
template< class T, class Compare >
constexpr std::pair<T, T> minmax( std::initializer_list<T> ilist, Compare comp );
// (1)
template< class T >
std::pair<const T&, const T&> minmax( const T& a, const T& b );
// (2)
template< class T, class Compare >
std::pair<const T&, const T&> minmax( const T& a, const T& b,
Compare comp );
// (3)
template< class T >
std::pair<T, T> minmax( std::initializer_list<T> ilist);
// (4)
template< class T, class Compare >
std::pair<T, T> minmax( std::initializer_list<T> ilist, Compare comp );
Returns the lowest and the greatest of the given values.
-
(1 - 2) Returns references to the smaller and the greater of
a
andb
.- (1) Uses
operator<
. - (2) Uses the given comparison function
comp
.
- (1) Uses
-
(3 - 4) Returns the smallest and the greatest of the values in initializer list
ilist
.- (3) Uses
operator<
. - (4) Uses the given comparison function
comp
.
- (3) Uses
Parameters
a b | The values to compare. |
ilist | Initializer list with the values to compare. |
cmp | Comparison function object (i.e. an object that satisfies the requirements of Compare) which returns
While the signature does not need to have The types |
Type requirements
-
(1, 3):
T
LessThanComparable -
(3 - 4):
T
CopyConstructible
Return value
-
(1 - 2)
- If
a < b
ora == b
, returns the result ofstd::pair<const T&, const T&>(a, b)
- Otherwise, returns
std::pair<const T&, const T&>(b, a)
.
- If
-
(3 - 4) A pair with the smallest value in
ilist
as the first element and the greatest as the second.
If several elements are equivalent to the smallest, the leftmost such element is returned.
If several elements are equivalent to the largest, the rightmost such element is returned.
Complexity
- (1 - 2) Exactly one comparison.
- (3 - 4) At most
ilist.size() * 3 / 2
comparisons.
Exceptions
(none)
Possible implementation
minmax (1)
template<class T>
constexpr std::pair<const T&, const T&> minmax(const T& a, const T& b)
{
return (b < a) ? std::pair<const T&, const T&>(b, a)
: std::pair<const T&, const T&>(a, b);
}
minmax (2)
template<class T, class Compare>
constexpr std::pair<const T&, const T&> minmax(const T& a, const T& b, Compare comp)
{
return comp(b, a) ? std::pair<const T&, const T&>(b, a)
: std::pair<const T&, const T&>(a, b);
}
minmax (3)
template<class T>
constexpr std::pair<T, T> minmax(std::initializer_list<T> ilist)
{
auto p = std::minmax_element(ilist.begin(), ilist.end());
return std::pair(*p.first, *p.second);
}
minmax (4)
template<class T, class Compare>
constexpr std::pair<T, T> minmax(std::initializer_list<T> ilist, Compare comp)
{
auto p = std::minmax_element(ilist.begin(), ilist.end(), comp);
return std::pair(*p.first, *p.second);
}
Notes
For overloads (1 - 2), if one of the parameters is a temporary, the reference returned becomes a dangling reference at the end of the full expression that contains the call to minmax:
int n = 1;
auto p = std::minmax(n, n + 1);
int m = p.first; // ok
int x = p.second; // undefined behavior
// Note that structured bindings have the same issue
auto [mm, xx] = std::minmax(n, n + 1);
xx; // undefined behavior
Examples
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <vector>
int main()
{
std::vector<int> v {3, 1, 4, 1, 5, 9, 2, 6};
std::srand(std::time(0));
std::pair<int, int> bounds = std::minmax(std::rand() % v.size(),
std::rand() % v.size());
std::cout << "v[" << bounds.first << "," << bounds.second << "]: ";
for (int i = bounds.first; i < bounds.second; ++i)
std::cout << v[i] << ' ';
std::cout << '\n';
}
v[2,7]: 4 1 5 9 2
Hover to see the original license.