std::min

Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">

<td>

Defined in header <algorithm>

</td>

<td></td> <td></td> </tr> <tr class="t-dcl ">

<td >

template< class T >
const T& min( const T& a, const T& b );

</td>

<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">

<td >

template< class T, class Compare >
const T& min( const T& a, const T& b, Compare comp );

</td>

<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end

Returns the lesser of two values. The first version uses Template:cpp to compare the values, the second version uses the given comparison function comp.

a, b	-	the values to compare
cmp	-	comparison function object (i.e. an object that satisfies the requirements of Compare) 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); 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 value category (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.

Template:returns The smaller of a and b.

Template:eq fun cpp Template:example cpp Template:cpp/algorithm/dcl list min elementTemplate:cpp/algorithm/dcl list max