std::prev
De cppreference.com
<metanoindex/>
<tbody> </tbody>| Definido no cabeçalho <iterator>
|
||
template< class BidirIt > BidirIt prev( BidirIt it, typename std::iterator_traits<BidirIt>::difference_type n = 1 ); |
(desde C++11) | |
Retorne o antecessor
nth de it iterador.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.
Parâmetros
| it | - | um iterador
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 | - | número de
it elementos devem ser descendentesOriginal: 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.
| ||
Valor de retorno
O antecessor de
nth it iterador.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.
Possível implementação
template<class BidirIt>
BidirIt prev(BidirIt it, typename std::iterator_traits<BidirIt>::difference_type n = 1)
{
std::advance(it, -n);
return it;
}
|
Exemplo
#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';
}
Saída:
1
