std::minmax_element
De cppreference.com
 [] |
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
![[]](https://upload.cppreference.com/mwiki/images/3/31/Imbox_notice.png){kind=link}
<metanoindex/>
<tbody> </tbody>| Dclar dans l'en-tte <algorithm>
|
||
template< class ForwardIt > std::pair<ForwardIt,ForwardIt> minmax_element( ForwardIt first, ForwardIt last ); |
(1) | |
template< class ForwardIt, class Compare > std::pair<ForwardIt,ForwardIt> minmax_element( ForwardIt first, ForwardIt last, Compare comp ); |
(2) | |
Trouve le plus grand et le plus petit lment dans le
[first, last) gamme. La premire version utilise operator< de comparer les valeurs, la deuxime version utilise la fonction de comparaison donne comp .Original:
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.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Paramtres
| first, last | - | itrateurs terme dfinissant la plage d'examiner
Original: forward iterators defining the range to examine The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| cmp | - | comparison function which returns true if if *a is less than *b. The signature of the comparison function should be equivalent to the following:
The signature does not need to have |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator.
| ||
Retourne la valeur
une paire constitue d'un itrateur pour que le plus petit lment du premier lment et un itrateur pour que le plus grand lment de la seconde. Retours
std::make_pair(first, first) si la plage est vide. Si plusieurs lments sont quivalentes plus petit lment, l'itrateur sur le premier lment ne soit retourn. Si plusieurs lments sont quivalents l'lment le plus important, l'itrateur sur le dernier lment tel est retourn .Original:
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.The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Complexit
la plupart des applications max(floor(3/2(N1)), 0) du prdicat, o
N = std::distance(first, last) .Original:
At most max(floor(3/2(N1)), 0) applications of the predicate, where
N = std::distance(first, last).The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Mise en uvre possible
| First version |
|---|
template<class ForwardIt>
std::pair<ForwardIt, ForwardIt>
minmax_element(ForwardIt first, ForwardIt last)
{
typedef typename std::iterator_traits<ForwardIt>::value_type value_t;
return std::minmax_element(first, last, std::less<value_t>());
}
|
| Second version |
template<class ForwardIt, class Compare>
std::pair<ForwardIt, ForwardIt>
minmax_element(ForwardIt first, ForwardIt last, Compare comp)
{
std::pair<ForwardIt, ForwardIt> result(first, first);
if (first == last) return result;
if (++first == last) return result;
if (comp(*first, *result.first)) {
result.second = result.first;
result.first = first;
} else {
result.second = first;
}
while (++first != last) {
ForwardIt i = first;
if (++first == last) {
if (comp(*i, *result.first)) result.first = i;
else if (!(comp(*i, *result.second))) result.second = i;
break;
} else {
if (comp(*first, *i)) {
if (comp(*first, *result.first)) result.first = first;
if (!(comp(*i, *result.second))) result.second = i;
} else {
if (comp(*i, *result.first)) result.first = i;
if (!(comp(*first, *result.second))) result.second = first;
}
}
}
return result;
}
|
Exemple
#include <algorithm>
#include <iostream>
#include <vector>
int main()
{
std::vector<int> v = { 3, 9, 1, 4, 2, 5, 9 };
auto result = std::minmax_element(v.begin(), v.end());
std::cout << "min element at: " << (result.first - v.begin()) << '\n';
std::cout << "max element at: " << (result.second - v.begin()) << '\n';
}
Rsultat :
min element at: 2
max element at: 6
Voir aussi
retourne le plus petit lment dans une plage Original: returns the smallest element in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |
retourne le plus grand lment dans une plage Original: returns the largest element in a range The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction gnrique) | |