std::distance

 

C++

Linguagem

Conceitos

Biblioteca de utilitários

Biblioteca cordas

Recipientes biblioteca

Biblioteca algoritmos

Biblioteca iteradores

Biblioteca numéricos

De entrada / saída da biblioteca

Biblioteca localizações

Biblioteca de expressões regulares (C++11)

Biblioteca operações atômica (C++11)

Biblioteca de suporte a discussão (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 de 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 fluxo 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
Operações 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)
Variar de acesso 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 );

Retorna o número de elementos entre first e 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.

O comportamento é indefinido se last não é acessível a partir de first por (possivelmente repetidamente) incrementando 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 apontando para o primeiro 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 apontando para o ú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

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

Complexidade

Linear.

Original:

Linear.

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

No entanto, se, adicionalmente, InputIt cumpre os requisitos da RandomAccessIterator, a complexidade é 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.

Exemplo

#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

Veja também

advance	avanços de um iterador por determinada distância 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. (função)