std::reverse — cppreference.com
Espaces de noms
Variantes

    std::reverse

    De cppreference.com

    <metanoindex/>

     
    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.
    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.
     
    <tbody> </tbody>
    Déclaré dans l'en-tête <algorithm>
    template< class BidirIt > void reverse( BidirIt first, BidirIt last );
    Inverse l'ordre des éléments dans la gamme [first, last) .
    Original:
    Reverses the order of the elements in the range [first, last).
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Paramètres

    first, last -
    la plage d'éléments à inverser
    Original:
    the range of elements to reverse
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Type requirements
    -
    BidirIt must meet the requirements of BidirectionalIterator.
    -
    The type of dereferenced BidirIt must meet the requirements of Swappable.

    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.

    Mise en œuvre possible

    template<class BidirIt>
void reverse(BidirIt first, BidirIt last)
{
    while ((first != last) && (first != --last)) {
        std::swap(*first++, *last);
    }
}

    Exemple

    #include <vector>
#include <iostream>
#include <algorithm>
 
int main(int argc, char** argv)
{
    std::vector<int> v({1,2,3});
    std::reverse(std::begin(v), std::end(v));
    std::cout << v[0] << v[1] << v[2] << '\n';

    int a[] = {4, 5, 6, 7};
    std::reverse(&a[0], &a[4]);
    std::cout << a[0] << a[1] << a[2] << a[3] << '\n';
}

    Résultat : 

    321
7654

    Complexité

    linéaire de la distance entre first et last
    Original:
    linear in the distance between first and last
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Voir aussi