Difference between revisions of "cpp/algorithm/max"
m (Text replace - "{{cpp|" to "{{c|") |
m (r2.7.3) (Robot: Adding fr:cpp/algorithm/max, ru:cpp/algorithm/max) |
||
| Line 101: | Line 101: | ||
{{dcl list template | cpp/algorithm/dcl list max_element}} | {{dcl list template | cpp/algorithm/dcl list max_element}} | ||
{{dcl list end}} | {{dcl list end}} | ||
| + | |||
| + | [[fr:cpp/algorithm/max]] | ||
| + | [[ru:cpp/algorithm/max]] | ||
Revision as of 11:00, 4 May 2012
Template:cpp/algorithm/sidebar Template:ddcl list begin <tr class="t-dsc-header">
<td><algorithm>
<td></td> <td></td> </tr> <tr class="t-dcl ">
<td >const T& max( const T& a, const T& b );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >const T& max( const T& a, const T& b, Compare comp );
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >T max( std::initializer_list<T> ilist);
<td > (3) </td> <td > (since C++11) </td> </tr> <tr class="t-dcl ">
<td >T max( std::initializer_list<T> ilist, Compare comp );
<td > (4) </td> <td > (since C++11) </td> </tr> Template:ddcl list end
1-2) Returns the greater of the two values.
3-4) Returns 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 |
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 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) |
Return value
1-2) The greater of a and b. If they are equivalent, returns a.
3-4) The greatest value in ilist. If several values are equivalent to the greatest, returns the leftmost one.
Complexity
1-2) Constant
3-4) Linear in ilist.size()
Possible implementation
Example
#include <algorithm> #include <iostream> #include <string> int main() { std::cout << "larger of 1 and 9999: " << std::max(1, 9999) << '\n' << "larger of 'a', and 'b': " << std::max('a', 'b') << '\n' << "longest of \"foo\", \"bar\", and \"hello\": " << std::max( { "foo", "bar", "hello" }, [](const std::string& s1, const std::string& s2) { return s1.size() < s2.size(); }) << '\n'; }
Output:
larger of 1 and 9999: 9999 larger of 'a', and 'b': b longest of "foo", "bar", and "hello": hello
