std::prev
Aus cppreference.com
<metanoindex/>
<tbody> </tbody>| definiert in Header <iterator>
|
||
template< class BidirIt > BidirIt prev( BidirIt it, typename std::iterator_traits<BidirIt>::difference_type n = 1 ); |
(seit C++11) | |
Bringen Sie den
nth Vorgänger Iterator it .Original:
Return the
nth predecessor of iterator it.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.
Parameter
| it | - | ein Iterator
Original: an iterator The text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| n | - | Anzahl der Elemente
it sollte abstammenOriginal: number of elements it should be descendedThe text has been machine-translated via Google Translate. You can help to correct and verify the translation. Click here for instructions. |
| Type requirements | ||
-BidirIt must meet the requirements of BidirectionalIterator.
| ||
Rückgabewert
Die
nth Vorgänger Iterator it .Original:
The
nth predecessor of iterator it.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.
Mögliche Implementierung
template<class BidirIt>
BidirIt prev(BidirIt it, typename std::iterator_traits<BidirIt>::difference_type n = 1)
{
std::advance(it, -n);
return it;
}
|
Beispiel
#include <iostream>
#include <iterator>
#include <vector>
int main()
{
std::vector<int> v{ 3, 1, 4 };
auto it = v.end();
auto pv = std::prev(it, 2);
std::cout << *pv << '\n';
}
Output:
1
