hash_map::rbegin (STL/CLR)

Designates the beginning of the reversed controlled sequence.

    reverse_iterator rbegin();

The member function returns a reverse iterator that designates the last element of the controlled sequence, or just beyond the beginning of an empty sequence. Hence, it designates the beginning of the reverse sequence. You use it to obtain an iterator that designates the current beginning of the controlled sequence seen in reverse order, but its status can change if the length of the controlled sequence changes.

// cliext_hash_map_rbegin.cpp 
// compile with: /clr 
#include <cliext/hash_map> 
typedef cliext::hash_map<wchar_t, int> Myhash_map; 
int main() 
    Myhash_map c1; 
    c1.insert(Myhash_map::make_value(L'a', 1)); 
    c1.insert(Myhash_map::make_value(L'b', 2)); 
    c1.insert(Myhash_map::make_value(L'c', 3)); 
// display contents " [a 1] [b 2] [c 3]" 
    for each (Myhash_map::value_type elem in c1) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
// inspect first two items in reversed sequence 
    Myhash_map::reverse_iterator rit = c1.rbegin(); 
    System::Console::WriteLine("*rbegin() = [{0} {1}]", 
        rit->first, rit->second); 
    System::Console::WriteLine("*++rbegin() = [{0} {1}]", 
        rit->first, rit->second); 
    return (0); 
 [a 1] [b 2] [c 3]
*rbegin() = [c 3]
*++rbegin() = [b 2]

Header: <cliext/hash_map>

Namespace: cliext

Was this page helpful?
(1500 characters remaining)
Thank you for your feedback

Community Additions

© 2014 Microsoft