Namespaces
Variants
Views
Actions

std::minmax

From cppreference.com
 
 
 
Defined in header <algorithm>
template< class T >
std::pair<const T&,const T&> minmax( const T& a, const T& b );
(1) (since C++11)
template< class T, class Compare >
std::pair<const T&,const T&> minmax( const T& a, const T& b, Compare comp );
(2) (since C++11)
template< class T >
std::pair<T,T> minmax( std::initializer_list ilist);
(3) (since C++11)
template< class T, class Compare >
std::pair<T,T> minmax( std::initializer_list ilist, Compare comp );
(4) (since C++11)

1-2) Returns the smaller and the greater of the two values.

3-4) Returns the smallest and the greatest of the values in initializer list ilist.

The (1,3) versions use operator< to compare the values, the (2,4) versions use the given comparison function comp.

Contents

[edit] Parameters

a, b - the values to compare
ilist - initializer list with the values to compare
cmp - comparison function which returns ​true if if a is less than b.

The signature of the comparison function should be equivalent to the following:

bool cmp(const Type1 &a, const Type2 &b);

The signature does not need to have const &, but the function must not modify the objects passed to it.
The types  Type1 and  Type2 must be such that an object of type T can be implicitly converted to both of them. ​

[edit] Return value

1-2) Returns the result of std::make_pair(a, b) if a<b or if a is equivalent to b. Returns the result of std::make_pair(b, a) if b<a.

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.

[edit] Complexity

1-2) Constant

3-4) Linear in ilist.size()

[edit] Possible implementation

[edit] Example

[edit] See also

returns the smaller of two elements
(function template) [edit]
returns the larger of two elements
(function template) [edit]