std::distance
提供:cppreference.com
|
|
This page has been machine-translated from the English version of the wiki using Google Translate.
The translation may contain errors and awkward wording. Hover over text to see the original version. You can help to fix errors and improve the translation. For instructions click here. |
| Defined in header <iterator>
|
||
| template< class InputIt > typename std::iterator_traits<InputIt>::difference_type |
||
first間の要素の数を返し、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.
last(おそらく繰り返し)firstをインクリメントすることで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.
目次 |
[編集] パラメータ
| first | - | 最初の要素を指すイテレータを返す
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 | - | 最後の要素を指すイテレータを返す
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
| ||
[編集] 値を返します
firstと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.
[編集] 複雑
リニア.
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.
InputItはさらにRandomAccessIteratorの要件を満たしている場合は、複雑さが一定である.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.
[編集] 例
#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
[編集] も参照してください
| 指定された距離によって進歩イテレータ 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. (機能) | |