Difference between revisions of "cpp/algorithm/min element"
m (Text replace - "<!-- ======== --> " to "") |
(→See also: +minmax) |
||
| Line 90: | Line 90: | ||
{{dcl list begin}} | {{dcl list begin}} | ||
{{dcl list template | cpp/algorithm/dcl list max_element}} | {{dcl list template | cpp/algorithm/dcl list max_element}} | ||
| + | {{dcl list template | cpp/algorithm/dcl list minmax_element}} | ||
{{dcl list template | cpp/algorithm/dcl list min}} | {{dcl list template | cpp/algorithm/dcl list min}} | ||
{{dcl list end}} | {{dcl list end}} | ||
Revision as of 04:04, 17 August 2011
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 >ForwardIterator min_element( ForwardIterator first, ForwardIterator last );
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >ForwardIterator min_element( ForwardIterator first, ForwardIterator last,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Finds the smallest element in the range [first, last). The first version uses Template:cpp to compare the values, the second version uses the given comparison function comp.
Contents |
Parameters
| first, last | - | forward iterators defining the range to examine |
| 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
Iterator to the smallest element in the range [first, last).
Complexity
linear in the distance between first and last.
