list::rend
傳回定址位置遵循已反轉清單中最後一個項目的迭代器。
const_reverse_iterator rend( ) const;
reverse_iterator rend( );
傳回值
處理成功最後一個項目的位置在某個反轉清單的反向雙向迭代器 (在這個 unreversed 清單的第一個項目之前) 的位置。
備註
正使用 結束 與清單,rend 搭配已還原的清單。
如果傳回值 rend 給 const_reverse_iterator,則無法修改清單物件。 如果傳回值 rend 給 reverse_iterator,則可以修改清單物件。
rend 可用來測試是否反向 Iterator 是否達到結尾的清單。
不應該取值 rend 所傳回的值。
範例
// list_rend.cpp
// compile with: /EHsc
#include <list>
#include <iostream>
int main( )
{
using namespace std;
list <int> c1;
list <int>::iterator c1_Iter;
list <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
// list <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 list (to point to the first element here)
cout << "The first element in the list is: " << *c1_rIter << endl;
cout << "The list 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 list
cout << "The reversed list 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 list (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 list is:";
for ( c1_rIter = c1.rbegin( ); c1_rIter != c1.rend( ); c1_rIter++ )
cout << " " << *c1_rIter;
cout << endl;
}
需求
標題: <list>
命名空間: std