Reference
C Library
IOstream Library
Strings library
STL Containers
STL Algorithms
Miscellaneous
STL Containers
bitset
deque
list
map
multimap
multiset
priority_queue
queue
set
stack
vector
multimap
comparison operators
multimap::multimap
multimap::~multimap
member functions:
multimap::begin
multimap::clear
multimap::count
multimap::empty
multimap::end
multimap::equal_range
multimap::erase
multimap::find
multimap::get_allocator
multimap::insert
multimap::key_comp
multimap::lower_bound
multimap::max_size
multimap::operator=
multimap::rbegin
multimap::rend
multimap::size
multimap::swap
multimap::upper_bound
multimap::value_comp


multimap::rbegin

public member function
      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

none

Return Value

A reverse iterator to the reverse beginning of the sequence.

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> respectively.

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

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
 
// 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

Constant.

See also

multimap::rend Return reverse iterator to reverse end (public member function)
multimap::begin Return iterator to beginning (public member function)
multimap::end Return iterator to end (public member function)