std::distance

 

C++

Sprache

Concepts

Utilities-Bibliothek

Strings Bibliothek

Container-Bibliothek

Algorithmen-Bibliothek

Iteratoren Bibliothek

Numerik-Bibliothek

Input / Output-Bibliothek

Lokalisierungen Bibliothek

Reguläre Ausdrücke Bibliothek (C++11)

Atomare Operationen Bibliothek (C++11)

Thema Support-Bibliothek (C++11)

 

Iterator Bibliothek

Iterator Primitiven 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
Iterator Adaptern 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
Stream-Iteratoren 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
Iterator Operationen 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)
Reichen Zugang 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 );

Gibt die Anzahl der Elemente zwischen first und 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.

Das Verhalten ist undefiniert, wenn last nicht erreichbar first durch (eventuell mehrmals) Inkrementieren 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.

Parameter

first	-	Iterator, der auf dem ersten Element 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	-	Iterator, der auf dem letzten Element 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

Rückgabewert

Die Anzahl von Elementen zwischen first und 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.

Komplexität

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.

Wenn jedoch zusätzlich InputIt erfüllt die Anforderungen der RandomAccessIterator ist Komplexität konstanten .

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.

Beispiel

#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

Siehe auch

advance	Fortschritte einen Iterator gegeben durch Distanz 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. (Funktion)