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

    std::transform

    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 InputIt, class OutputIt, class UnaryOperation > OutputIt transform( InputIt first1, InputIt last1, OutputIt d_first, UnaryOperation unary_op );
    		 (1)
    template< class InputIt1, class InputIt2, class OutputIt, class BinaryOperation > OutputIt transform( InputIt1 first1, InputIt1 last1, InputIt2 first2, OutputIt d_first, BinaryOperation binary_op );
    		 (2)
    std::transform applique la fonction donne un large et stocke le rsultat dans une autre gamme, partir de d_first .
    Original:
    std::transform applies the given function to a range and stores the result in another range, beginning at d_first.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Dans la premire version unary_op opration unaire est applique la plage dfinie par [first1, last1). Dans la deuxime version de la binary_op opration binaire est appliqu des paires d'lments de deux gammes: l'une dfinie par [first1, last1) et l'autre commenant first2 .
    Original:
    In the first version unary operation unary_op is applied to the range defined by [first1, last1). In the second version the binary operation binary_op is applied to pairs of elements from two ranges: one defined by [first1, last1) and the other beginning at first2.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Paramtres

    first1, last1 -
    la premire gamme d'lments transformer
    Original:
    the first range of elements to transform
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    first2 -
    le dbut de la seconde gamme d'lments de transformation
    Original:
    the beginning of the second range of elements to transform
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    d_first -
    le dbut de la plage de destination, peut tre gal ou first1 first2
    Original:
    the beginning of the destination range, may be equal to first1 or first2
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unary_op - unary operation function object that will be applied.

    The signature of the function should be equivalent to the following:

    Ret fun(const Type &a);

    The signature does not need to have const &.
    The type Type must be such that an object of type InputIt can be dereferenced and then implicitly converted to Type. The type Ret must be such that an object of type OutputIt can be dereferenced and assigned a value of type Ret.

    binary_op - binary operation function object that will be applied.

    The signature of the function should be equivalent to the following:

    Ret fun(const Type1 &a, const Type2 &b);

    The signature does not need to have const &.
    The types Type1 and Type2 must be such that objects of types InputIt1 and InputIt2 can be dereferenced and then implicitly converted to Type1 and Type2 respectively. The type Ret must be such that an object of type OutputIt can be dereferenced and assigned a value of type Ret.

    Type requirements
    -
    InputIt must meet the requirements of InputIterator.
    -
    InputIt1 must meet the requirements of InputIterator.
    -
    InputIt2 must meet the requirements of InputIterator.
    -
    OutputIt must meet the requirements of OutputIterator.

    Retourne la valeur

    itrateur de sortie de l'lment aprs le dernier lment transform .
    Original:
    output iterator to the element past the last element transformed.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Complexit

    1)

    exactement std::distance(first1, last1) applications de unary_op
    Original:
    exactly std::distance(first1, last1) applications of unary_op
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    2)

    exactement std::distance(first1, last1) applications de binary_op
    Original:
    exactly std::distance(first1, last1) applications of binary_op
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Exigences

    unary_op et binary_op n'ont pas d'effets secondaires. (avant C++11)
    Original:
    unary_op and binary_op have no side effects. (avant C++11)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    unary_op et binary_op n'invalident pas les itrateurs, y compris les itrateurs de fin, ou de modifier les lments des gammes concernes. (depuis C++11)
    Original:
    unary_op and binary_op do not invalidate any iterators, including the end iterators, or modify any elements of the ranges involved. (depuis C++11)
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Le but de ces exigences est de permettre des implmentations parallles ou out-of-order de std::transform. Pour appliquer une fonction une squence dans l'ordre, utiliser std::for_each .
    Original:
    The intent of these requirements is to allow parallel or out-of-order implementations of std::transform. To apply a function to a sequence in-order, use std::for_each.
    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 InputIt, class OutputIt, class UnaryOperation>
OutputIt transform(InputIt first1, InputIt last1, OutputIt d_first, 
                   UnaryOperation unary_op)
{
    while (first1 != last1) {
        *d_first++ = unary_op(*first1++);
    }
    return d_first;
}
    Second version 
    template<class InputIt1, class InputIt2, 
         class OutputIt, class BinaryOperation>
OutputIt transform(InputIt first1, InputIt last1, InputIt first2, 
                   OutputIt d_first, BinaryOperation binary_op)
{
    while (first1 != last1) {
        *d_first++ = binary_op(*first1++, *first2++);
    }
    return d_first;
}

    Exemple

    Le code suivant utilise transformer pour convertir une chane en majuscules l'aide de la fonction toupper:
    Original:
    The following code uses transform to convert a string to uppercase using the toupper function:
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    #include <string>
#include <cctype>
#include <algorithm>
#include <iostream>
 
int main()
{
    std::string s("hello");
    std::transform(s.begin(), s.end(), s.begin(), (int (*)(int))std::toupper);
    std::cout << s;
 }

    Rsultat : 

    HELLO

    Voir aussi
    applique une fonction une srie d'lments
    Original:
    applies a function to a range of 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