From cppreference.com
Defined in header
template<classT>constT&min(constT&a,constT&b); (1)(constexpr since C++14)template<classT,classCompare>constT&min(constT&a,constT&b,Comparecomp); (2)(constexpr since C++14)template<classT>Tmin(std::initializer_list<T>ilist); (3)(since C++11)
(constexpr since C++14)template<classT,classCompare>Tmin(std::initializer_list<T>ilist,Comparecomp); (4)(since C++11)
(constexpr since C++14)Returns the smaller of the given values.
1,2) Returns the smaller of a and b.
1) Uses operator< to compare the values.
2) Use the comparison function comp to compare the values.
3,4) Returns the smallest of the values in initializer list ilist.
If ilist.size() is zero, or T is not
, the behavior is undefined.
3) Uses operator< to compare the values.
4) Use the comparison function comp to compare the values.
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
) which returns true if a is less than b. The signature of the comparison function should be equivalent to the following:
boolcmp(constType1&a,constType2&b);
While the signature does not need to have const&, the function must not modify the objects passed to it and must be able to accept all values of type (possibly const) Type1 and Type2 regardless of
(thus, Type1& is not allowed, nor is Type1 unless for Type1 a move is equivalent to a copy(since C++11)).
The types Type1 and Type2 must be such that an object of type T can be implicitly converted to both of them.
Return value
1,2) The smaller of a and b. If the values are equivalent, returns a.
3,4) The smallest value in ilist. If several values are equivalent to the smallest, returns the leftmost such value.
Complexity
1) Exactly one comparison using operator<.
2) Exactly one application of the comparison function comp.
3,4) Given N as ilist.size():
3) Exactly N-1 comparisons using operator<.
4) Exactly N-1 applications of the comparison function comp.
Possible implementation
template<classT>constT&min(constT&a,constT&b){return(b<a)?b:a;}
template<classT,classCompare>constT&min(constT&a,constT&b,Comparecomp){return(comp(b,a))?b:a;}
template<classT>Tmin(std::initializer_list<T>ilist){return*std::min_element(ilist.begin(),ilist.end());}
template<classT,classCompare>Tmin(std::initializer_list<T>ilist,Comparecomp){return*std::min_element(ilist.begin(),ilist.end(),comp);}Notes
Capturing the result of std::min by reference produces a dangling reference if one of the parameters is a temporary and that parameter is returned:
intn=-1;constint&r=std::min(n+2,n*2);// r is danglingExample
Run this code
#include<algorithm>#include<iostream>#include<string_view>intmain(){std::cout<<"smaller of 10 and 010 is "<<std::min(10,010)<<'\n'<<"smaller of 'd' and 'b' is '"<<std::min('d','b')<<"'\n"<<"shortest of \"foo\", \"bar\", and \"hello\" is \""<<std::min({"foo","bar","hello"},[](conststd::string_views1,conststd::string_views2){returns1.size()<s2.size();})<<"\"\n";}Output:
smaller of 10 and 010 is 8 smaller of 'd' and 'b' is 'b' shortest of "foo", "bar", and "hello" is "foo" Defect reports
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR Applied to Behavior as published Correct behavior
C++98 T was required to be
for overloads (
)not required
C++98
C++11 1. T was required to be
for
overloads (
) (C++98) and (
) (C++11)
2. the complexity requirements were missing 1. not required
2. added the requirements See also
returns the greater of the given values
(function template & algorithm function object)
(C++20)
(C++11)
returns the smaller and larger of two elements
(function template & algorithm function object)
(C++20)
returns the smallest element in a range
(function template & algorithm function object)
(C++20)
(C++17)
clamps a value between a pair of boundary values
(function template & algorithm function object)
(C++20)
(C++20)
returns the smaller of the given values
(algorithm function object)