std::distance
Da cppreference.com.
![]() |
Questa pagina è stata tradotta in modo automatico dalla versione in ineglese della wiki usando Google Translate.
La traduzione potrebbe contenere errori e termini strani. Muovi il puntatore sopra al testo per vedere la versione originale. Puoi aiutarci a correggere gli gli errori. Per ulteriori istruzioni clicca qui. |
Elemento definito nell'header <iterator>
|
||
template< class InputIt > typename std::iterator_traits<InputIt>::difference_type |
||
Restituisce il numero di elementi tra
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.
You can help to correct and verify the translation. Click here for instructions.
Il comportamento è indefinito se
last
non è raggiungibile da first
da (eventualmente più volte) l'incremento 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.
You can help to correct and verify the translation. Click here for instructions.
Indice |
[modifica] Parametri
first | - | iteratore che punta al primo 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 | - | iteratore che punta all'ultimo 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
|
[modifica] Valore di ritorno
Il numero di elementi tra
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.
You can help to correct and verify the translation. Click here for instructions.
[modifica] Complessità
Lineare.
Original:
Linear.
The text has been machine-translated via Google Translate.
You can help to correct and verify the translation. Click here for instructions.
You can help to correct and verify the translation. Click here for instructions.
Tuttavia, se
InputIt
soddisfa inoltre i requisiti di RandomAccessIterator
, complessità è costante.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.
You can help to correct and verify the translation. Click here for instructions.
[modifica] Esempio
#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
[modifica] Vedi anche
avanza di un iteratore per distanza data 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. (funzione) |