Espaces de noms
Variantes

    std::distance

    De cppreference.com
    See More

    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++
     
    Bibliothèque Iterator
    Primitives Iterator
    Original:
    Iterator primitives
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    iterator_traits
    input_iterator_tag
    output_iterator_tag
    forward_iterator_tag
    bidirectional_iterator_tag
    random_access_iterator_tag
    iterator
    Adaptateurs Iterator
    Original:
    Iterator adaptors
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    reverse_iterator
    Itérateurs de flux
    Original:
    Stream iterators
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    istream_iterator
    ostream_iterator
    istreambuf_iterator
    ostreambuf_iterator
    Opérations Iterator
    Original:
    Iterator operations
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    advance
    distance
    prev (C++11)
    next (C++11)
    Gamme d'accès
    Original:
    Range access
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    begin (C++11)
    end (C++11)
     
    <tbody> </tbody>
    Déclaré dans l'en-tête <iterator>
    template< class InputIt > typename std::iterator_traits<InputIt>::difference_type distance( InputIt first, InputIt last );
    Retourne le nombre d'éléments entre first et last .
    Original:
    Returns the number of elements 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.
    Le comportement est indéfini si last n'est pas accessible depuis first par (éventuellement plusieurs fois) incrémentation first .
    Original:
    The behavior is undefined if last is not reachable from first by (possibly repeatedly) incrementing first.
    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 -
    itérateur pointant sur le premier élément
    Original:
    iterator pointing to the first element
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    last -
    itérateur pointant sur le dernier élément
    Original:
    iterator pointing to the last element
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Type requirements
    -
    InputIt must meet the requirements of InputIterator. The operation is more efficient if InputIt additionally meets the requirements of RandomAccessIterator

    Retourne la valeur

    Le nombre d'éléments entre first et last .
    Original:
    The number of elements 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.

    Complexité

    Linéaire .
    Original:
    Linear.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.
    Toutefois, si InputIt répond en outre aux exigences de RandomAccessIterator, la complexité est constante .
    Original:
    However, if InputIt additionally meets the requirements of RandomAccessIterator, complexity is constant.
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    Exemple

    #include <iostream>
#include <iterator>
#include <vector>

int main() 
{
    std::vector<int> v{ 3, 1, 4 };

    auto distance = std::distance(v.begin(), v.end());

    std::cout << distance << '\n';
}

    Résultat : 

    3

    Voir aussi
    avance un itérateur par distance donnée
    Original:
    advances an iterator by given distance
    The text has been machine-translated via Google Translate.
    You can help to correct and verify the translation. Click here for instructions.

    (fonction) [edit]