std::distance

 

C++

Lenguaje

Cabeceras

Conceptos

Biblioteca de utilidades

Biblioteca de cadenas

Biblioteca de contenedores

Biblioteca de algoritmos

Biblioteca de iteradores

Biblioteca numérica

Biblioteca de entrada/salida

Biblioteca de localización

Biblioteca de expresiones regulares (C++11)

Biblioteca de operaciones atómicas (C++11)

Biblioteca de tareas/subprocesos (C++11)

 

Biblioteca Iterator

Primitivas iterador 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
Adaptadores iterador 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
Iteradores Stream 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
Operaciones iterador 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)
Rango de acceso 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)

 

Defined in header <iterator>
template< class InputIt > typename std::iterator_traits<InputIt>::difference_type     distance( InputIt first, InputIt last );

Devuelve el número de elementos entre first y 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.

El comportamiento no está definido si last no es accesible desde first por (posiblemente varias veces) incrementar 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.

Parámetros

first	-	iterador que señala al primer elemento 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	-	iterador apunta al último elemento 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

Valor de retorno

El número de elementos entre first y 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.

Complejidad

Lineal .

Original:

Linear.

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

Sin embargo, si InputIt además cumple con los requisitos de RandomAccessIterator, la complejidad es 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.

Ejemplo

#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';
}

Output:

3

Ver también

advance	avanza un iterador según distancia determinada 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. (función)