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

    std::stable_sort

    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 RandomIt > void stable_sort( RandomIt first, RandomIt last );
    		 (1)
    template< class RandomIt, class Compare > void stable_sort( RandomIt first, RandomIt last, Compare comp );
    		 (2)
    Trie les lments dans l'[first, last) plage dans l'ordre croissant. L'ordre des lments gaux est assur d'tre prserv. La premire version utilise operator< de comparer les lments, la deuxime version utilise la fonction de comparaison donne comp .
    Original:
    Sorts the elements in the range [first, last) in ascending order. The order of equal elements is guaranteed to be preserved. The first version uses operator< to compare the elements, 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 -
    la plage d'lments trier
    Original:
    the range of elements to sort
    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 the first argument is less than the second.

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

    Type requirements
    -
    RandomIt must meet the requirements of ValueSwappable and RandomAccessIterator.
    -
    The type of dereferenced RandomIt must meet the requirements of MoveAssignable and MoveConstructible.

    Retourne la valeur

    (Aucun)
    Original:
    (none)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Complexit

    O(N·log2(N)), o les applications N = std::distance(first, last) de cmp. Si la mmoire supplmentaire est disponible, alors la complexit est O(N·log(N) .
    Original:
    O(N·log2(N)), where N = std::distance(first, last) applications of cmp. If additional memory is available, then the complexity is O(N·log(N).
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Notes

    Cette fonction tente d'allouer une mmoire tampon temporaire de taille gale la squence trier, gnralement en appelant std::get_temporary_buffer. Si l'allocation choue, l'algorithme moins efficace est choisi .
    Original:
    This function attempts to allocate a temporary buffer equal in size to the sequence to be sorted, typically by calling std::get_temporary_buffer. If the allocation fails, the less efficient algorithm is chosen.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Exemple

    This section is incomplete
    Reason: no example

    Voir aussi
    trie les n premiers lments d'une gamme
    Original:
    sorts the first N elements of 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]
    trie une plage dans l'ordre ascendant
    Original:
    sorts a range into ascending order
    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