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. |
Defined in header <algorithm> | ||
template<class ForwardIt > std::pair<ForwardIt,ForwardIt> | (1) | |
template<class ForwardIt, class Compare > std::pair<ForwardIt,ForwardIt> | (2) | |
Trouve le plus grand et le plus petit élément dans le
[first, last) gamme. La première version utilise operator< de comparer les valeurs, la deuxième version utilise la fonction de comparaison donnée 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.
Sommaire |
[modifier]Paramètres
| first, last | - | itérateurs terme définissant 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: bool cmp(const Type1 &a, const Type2 &b); The signature does not need to have const&, but the function must not modify the objects passed to it. |
| Type requirements | ||
-ForwardIt must meet the requirements of ForwardIterator. | ||
[modifier]Retourne la valeur
une paire constituée d'un itérateur pour que le plus petit élément du premier élément et un itérateur pour que le plus grand élément de la seconde. Retours std::make_pair(first, first) si la plage est vide. Si plusieurs éléments sont équivalentes à plus petit élément, l'itérateur sur le premier élément ne soit retourné. Si plusieurs éléments sont équivalents à l'élément le plus important, l'itérateur sur le dernier élément 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.
[modifier]Complexité
À la plupart des applications max(floor(3/2(N−1)), 0) du prédicat, où N =std::distance(first, last) .
Original:
At most max(floor(3/2(N−1)), 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.
[modifier]Mise en œuvre possible
| First version |
|---|
template<class ForwardIt>std::pair<ForwardIt, ForwardIt> minmax_element(ForwardIt first, ForwardIt last){typedeftypenamestd::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;elseif(!(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;} |
[modifier]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';}
Résultat :
min element at: 2 max element at: 6
[modifier]Voir aussi
retourne le plus petit élément 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 générique) | |
retourne le plus grand élément 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 générique) | |
