reverse_iterator rbegin();
const_reverse_iterator rbegin() const;

Return reverse iterator to reverse beginning

Returns a reverse iterator referring to the last element in the container.

Internally, multimap containers keep their elements ordered by their key from lower to higher, therefore rbegin returns an element with the highest key in the container.

Notice that rbegin does not refer to the same element as end, but to the element right before it.

Parameters

Return Value

Both reverse_iterator and const_reverse_iterator are member types. In the multimap class template, these are reverse bidirectional iterators, defined as reverse_iterator<iterator> and reverse_iterator<const_iterator> respectivelly.

Dereferencing this iterator accesses the element's value, which is of type pair<const Key,T>.

Example

// multimap::rbegin/rend
#include <iostream>
#include <map>
using namespace std;

int main ()
{
  multimap<char,int> mymultimap;
  multimap<char,int>::reverse_iterator rit;

  mymultimap.insert (pair<char,int>('x',10));
  mymultimap.insert (pair<char,int>('y',20));
  mymultimap.insert (pair<char,int>('y',150));
  mymultimap.insert (pair<char,int>('z',9));

  // show content:
  for ( rit=mymultimap.rbegin() ; rit != mymultimap.rend(); rit++ )
    cout << rit->first << " => " << rit->second << endl;

  return 0;
}

Output:

z => 9
y => 150
y => 20
x => 10

Complexity

See also