Difference between revisions of "cpp/algorithm/minmax element"
m (Text replace - "===Equivalent function===" to "===Possible implementation===") |
m (Text replace - "{{cpp|" to "{{c|") |
||
| Line 16: | Line 16: | ||
{{ddcl list end}} | {{ddcl list end}} | ||
| − | Finds the greatest and the smallest element in the range {{tt|[first, last)}}. The first version uses {{ | + | Finds the greatest and the smallest element in the range {{tt|[first, last)}}. The first version uses {{c|operator<}} to compare the values, the second version uses the given comparison function {{tt|comp}}. |
===Parameters=== | ===Parameters=== | ||
| Line 25: | Line 25: | ||
===Return value=== | ===Return value=== | ||
| − | a pair consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second. Returns {{ | + | a pair consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second. Returns {{c|std::make_pair(first, first)}} if the range is empty. If several elements are equivalent to the smallest element, the iterator to the first such element is returned. If several elements are equivalent to the largest element, the iterator to the last such element is returned. |
===Complexity=== | ===Complexity=== | ||
| − | At most {{math|max(floor(3/2(N−1)), 0)}} applications of the predicate, where {{ | + | At most {{math|max(floor(3/2(N−1)), 0)}} applications of the predicate, where {{c|N {{=}} std::distance(first, last)}}. |
===Possible implementation=== | ===Possible implementation=== | ||
Revision as of 11:59, 19 April 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 >std::pair<ForwardIterator,ForwardIterator>
<td > (1) </td> <td class="t-dcl-nopad"> </td> </tr> <tr class="t-dcl ">
<td >std::pair<ForwardIterator,ForwardIterator>
minmax_element( ForwardIterator first, ForwardIterator last,
<td > (2) </td> <td class="t-dcl-nopad"> </td> </tr> Template:ddcl list end
Finds the greatest and the smallest element in the range [first, last). The first version uses operator< 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
a pair consisting of an iterator to the smallest element as the first element and an iterator to the greatest element as the second. Returns std::make_pair(first, first) if the range is empty. If several elements are equivalent to the smallest element, the iterator to the first such element is returned. If several elements are equivalent to the largest element, the iterator to the last such element is returned.
Complexity
At most max(floor(3/2(N−1)), 0) applications of the predicate, where N = std::distance(first, last).
