[ Web Proxy ]
URL:
Viewing: https://fr.cppreference.com/cpp/algorithm/min_element [Back]  [Original]
std::min_element cppreference.com
cppreference.com
Espaces de noms
Variantes

    std::min_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.

    Click here for the English version of this page

    <metanoindex/>

     
    C++
     
    Bibliothque 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 squence des oprations
    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 squence des oprations
    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 oprations 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.
    Oprations de tri (sur les gammes tris)
    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
    Oprations binaires de recherche (sur les gammes tris)
    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.
    Dfinir les oprations (sur les gammes tris)
    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.
    Oprations 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.
    Oprations numriques
    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.
    Bibliothque 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.
     
    <tbody> </tbody>
    Dclar dans l'en-tte <algorithm>
    template< class ForwardIt > ForwardIt min_element( ForwardIt first, ForwardIt last );
    		 (1)
    template< class ForwardIt, class Compare > ForwardIt min_element( ForwardIt first, ForwardIt last, Compare comp );
    		 (2)
    Trouve 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 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.

    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:

    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 ForwardIt can be dereferenced and then implicitly converted to both of them.

    Type requirements
    -
    ForwardIt must meet the requirements of ForwardIterator.

    Retourne la valeur

    Iterator pour le plus petit lment dans le [first, last) gamme. Si plusieurs lments de la gamme sont quivalents le plus petit lment, retourne l'itrateur sur le premier lment tel. Retours last si la plage est vide .
    Original:
    Iterator to the smallest element in the range [first, last). If several elements in the range are equivalent to the smallest element, returns the iterator to the first such element. Returns last if the range is empty.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Complexit

    Exactement max(N-1,0) comparaisons, o N = std::distance(first, last) .
    Original:
    Exactly max(N-1,0) comparisons, 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.

    Mise en uvre possible

    First version 
    template<class ForwardIt>
ForwardIt min_element(ForwardIt first, ForwardIt last)
{
    if (first == last) return last;

    ForwardIt smallest = first;
    ++first;
    for (; first != last; ++first) {
        if (*first < *smallest) {
            smallest = first;
        }
    }
    return smallest;
}
    Second version 
    template<class ForwardIt, class Compare>
ForwardIt min_element(ForwardIt first, ForwardIt last, 
                            Compare comp)
{
    if (first == last) return last;
    
    ForwardIt smallest = first;
    ++first;
    for (; first != last; ++first) {
        if (comp(*first, *smallest)) {
            smallest = first;
        }
    }
    return smallest;
}

    Exemple

    #include <algorithm>
#include <iostream>
#include <vector>
 
int main()
{
    std::vector<int> v{3, 1, 4, 1, 5, 9};
 
    std::vector<int>::iterator result = std::min_element(v.begin(), v.end());
    std::cout << "min element at: " << std::distance(v.begin(), result);
}

    Rsultat : 

    min element at: 1

    Voir aussi
    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) [edit]
    (C++11)
    retourne le plus petit lment et le plus important dans une gamme
    Original:
    returns the smallest and 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) [edit]
    retourne le plus petit des deux lments
    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 gnrique) [edit]
    Web Proxy Viewer  |  New URL  |  Original Page