std::advance

 

C++

Langage

Concepts

Bibliothèque d'utilitaires

Bibliothèque pour les chaînes de caractères

Bibliothèque de conteneurs

Bibliothèque d'algorithmes

Bibliothèque d'itérateurs

Bibliothèque pour le calcul numérique

Bibliothèque pour les entrées/sorties

Bibliothèque pour la régionalisation

Bibliothèque pour les expressions régulières (C++11)

Bibliothèque pour les opérations atomiques (C++11)

Bibliothèque pour les processus légers (threads) (C++11)

 

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
move_iterator (C++11) back_insert_iterator front_insert_iterator insert_iterator	make_move_iterator (C++11) back_inserter front_inserter inserter
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)

 

Déclaré dans l'en-tête <iterator>
template< class InputIt, class Distance > void advance( InputIt& it, Distance n );

Incréments donné itérateur it par n éléments .

Original:

Increments given iterator it by n elements.

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

Si n est négatif, l'itérateur est décrémenté. Dans ce cas, InputIt doit satisfaire aux exigences de BidirectionalIterator, sinon le comportement est indéfini .

Original:

If n is negative, the iterator is decremented. In this case, InputIt must meet the requirements of BidirectionalIterator, otherwise the behavior is undefined.

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

Paramètres

it	-	itérateur d'être avancé Original: iterator to be advanced The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions.
n	-	nombre de it éléments devraient être favorisées Original: number of elements it should be advanced 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.

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é

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 vi = v.begin();
 
    std::advance(vi, 2);
 
    std::cout << *vi << '\n';
}

Résultat :

4

Voir aussi

distance	renvoie la distance entre deux itérateurs Original: returns the distance between two iterators The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. (fonction)