deque::rend
返回解决成功最后一个元素的位置已取消的、向量、双端队列的迭代器。
const_reverse_iterator rend( ) const;
reverse_iterator rend( );
返回值
解决成功最后一个元素的位置已取消的、向量、双端队列中的反向随机访问迭代器(在前面unreversed、向量、双端队列的第一个元素)的位置。
备注
正 结束 使用、向量、双端队列，rend 使用具有是相反的、向量、双端队列。
如果 rend 的返回值赋给 const_reverse_iterator，不能修改、向量、双端队列对象。 如果 rend 的返回值赋给 reverse_iterator，可以修改、向量、双端队列对象。
rend 可用于测试一反向迭代器是否已到达其、向量、双端队列的末尾。
不应取消引用 rend 返回的值。
示例
// deque_rend.cpp
// compile with: /EHsc
#include <deque>
#include <iostream>
int main( )
{
using namespace std;
deque <int> c1;
deque <int>::iterator c1_Iter;
deque <int>::reverse_iterator c1_rIter;
// If the following line had replaced the line above, an error
// would have resulted in the line modifying an element
// (commented below) because the iterator would have been const
// deque <int>::const_reverse_iterator c1_rIter;
c1.push_back( 10 );
c1.push_back( 20 );
c1.push_back( 30 );
c1_rIter = c1.rend( );
c1_rIter --; // Decrementing a reverse iterator moves it forward
// in the deque (to point to the first element here)
cout << "The first element in the deque is: " << *c1_rIter << endl;
cout << "The deque is: ";
for ( c1_Iter = c1.begin( ); c1_Iter != c1.end( ); c1_Iter++ )
cout << *c1_Iter << " ";
cout << endl;
// rend can be used to test if an iteration is through all of
// the elements of a reversed deque
cout << "The reversed deque is: ";
for ( c1_rIter = c1.rbegin( ); c1_rIter != c1.rend( ); c1_rIter++ )
cout << *c1_rIter << " ";
cout << endl;
c1_rIter = c1.rend( );
c1_rIter--; // Decrementing the reverse iterator moves it backward
// in the reversed deque (to the last element here)
*c1_rIter = 40; // This modification of the last element would
// have caused an error if a const_reverse
// iterator had been declared (as noted above)
cout << "The modified reversed deque is: ";
for ( c1_rIter = c1.rbegin( ); c1_rIter != c1.rend( ); c1_rIter++ )
cout << *c1_rIter << " ";
cout << endl;
}
要求
标头: <deque>
命名空间: std