Espaces de noms
Variantes
Affichages
Actions

std::minmax

De cppreference.com
< cpp‎ | algorithm

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.

Click here for the English version of this page

 
C++
 
Bibliothèque d'algorithmes
Fonctions
Original:
Functions
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Non-modification de la séquence des opérations
Original:
Non-modifying sequence operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Modification de la séquence des opérations
Original:
Modifying sequence operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Des opérations de partitionnement
Original:
Partitioning operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Opérations de tri (sur les gammes triés)
Original:
Sorting operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
is_sorted (C++11)
is_sorted_until (C++11)
sort
Opérations binaires de recherche (sur les gammes triés)
Original:
Binary search operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Définir les opérations (sur les gammes triés)
Original:
Set operations (on sorted ranges)
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Opérations Heap
Original:
Heap operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Minimum / maximum de fonctionnement
Original:
Minimum/maximum operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
max
max_element
min
min_element
minmax (C++11)
minmax_element (C++11)
Opérations numériques
Original:
Numeric operations
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Bibliothèque C
Original:
C library
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
 
Déclaré dans l'en-tête <algorithm>
template< class T >
std::pair<const T&,const T&> minmax( const T& a, const T& b );
 (1) (depuis C++11)
template< class T, class Compare >
std::pair<const T&,const T&> minmax( const T& a, const T& b, Compare comp );
 (2) (depuis C++11)
template< class T >
std::pair<T,T> minmax( std::initializer_list<T> ilist);
 (3) (depuis C++11)
template< class T, class Compare >
std::pair<T,T> minmax( std::initializer_list<T> ilist, Compare comp );
 (4) (depuis C++11)
1-2)
Retourne le plus petit et le plus grand des deux valeurs .
Original:
Returns the smaller and the greater of the two values.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
3-4)
Retourne la liste la plus petite et la plus grande des valeurs dans l'initialiseur ilist .
Original:
Returns the smallest and the greatest of the values in initializer list ilist.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
Les versions (1,3) operator< utiliser pour comparer les valeurs, tandis que les versions (2,4) utiliser la fonction de comparaison donnée comp .
Original:
The (1,3) versions use operator< to compare the values, whereas the (2,4) versions use 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.

Sommaire

[modifier] Paramètres

a, b -
les valeurs de comparaison
Original:
the values to compare
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
ilist -
initialiseur liste avec les valeurs à comparer
Original:
initializer list with the values to compare
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
comp - 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.
The types Type1 and Type2 must be such that an object of type T can be implicitly converted to both of them. ​

Type requirements
-
T must meet the requirements of LessThanComparable. for the overloads (1) and (3)
-
T must meet the requirements of CopyConstructible. for the overloads (3) and (4)

[modifier] Retourne la valeur

1-2)
Retourne le résultat de std::make_pair(a, b) si a<b ou si a est équivalent à b. Retourne le résultat de std::make_pair(b, a) si b<a .
Original:
Returns the result of std::make_pair(a, b) if a<b or if a is equivalent to b. Returns the result of std::make_pair(b, a) if b<a.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
3-4)
Une paire avec la plus petite valeur dans ilist que le premier élément et le plus grand que le second. Si plusieurs éléments sont équivalentes à la plus petite, l'élément le plus à gauche telle est retourné. Si plusieurs éléments sont équivalentes au plus grand, l'élément le plus à droite par exemple est retourné .
Original:
A pair with the smallest value in ilist as the first element and the greatest as the second. If several elements are equivalent to the smallest, the leftmost such element is returned. If several elements are equivalent to the largest, the rightmost 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.

[modifier] Complexité

1-2)
Constante
Original:
Constant
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
3-4)
Linéaire dans ilist.size()
Original:
Linear in ilist.size()
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.

[modifier] Mise en œuvre possible

First version 
template<class T> 
std::pair<const T&,const T&> minmax(const T& a, const T& b)
{
    return (b < a) ? std::make_pair(b, a)
                   : std::make_pair(a, b);
}
Second version 
template<class T, class Compare> 
std::pair<const T&,const T&> minmax(const T& a, const T& b, Compare comp)
{
    return comp(b, a) ? std::make_pair(b, a)
                      : std::make_pair(a, b);
}
Third version 
template< class T >
std::pair<T,T> minmax( std::initializer_list ilist)
{
    auto p = std::minmax_element(ilist.begin(), ilist.end());
    return std::make_pair(*p.first, *p.second);
}
Fourth version 
template< class T, class Compare >
std::pair<T,T> minmax( std::initializer_list ilist, Compare comp )
{
    auto p = std::minmax_element(ilist.begin(), ilist.end(), comp);
    return std::make_pair(*p.first, *p.second);
}

[modifier] Exemple

#include <algorithm>
#include <iostream>
#include <vector>
#include <cstdlib>
#include <ctime>
 
int main()
{
    std::vector<int> v {3, 1, 4, 1, 5, 9, 2, 6}; 
    std::srand(std::time(0));
    std::pair<int,int> bounds = std::minmax(std::rand() % v.size(),
                                            std::rand() % v.size());
 
    std::cout << "v[" << bounds.first << "," << bounds.second << "]: ";
    for (int i = bounds.first; i < bounds.second; ++i) {
        std::cout << v[i] << ' ';
    }
    std::cout << '\n';
}

Résultat possible : 

v[2,7]: 4 1 5 9 2

[modifier] Voir aussi
retourne le plus petit des deux éléments
Original:
returns the smaller of two elements
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) [edit]
retourne le plus grand des deux éléments
Original:
returns the larger of two elements
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) [edit]
Récupérée de « https://fr.cppreference.com/mwiki/index.php?title=cpp/algorithm/minmax&oldid=47526 »