public member function
<map>
std::map::rend
reverse_iterator rend();
const_reverse_iterator rend() const;
reverse_iterator rend() noexcept;
const_reverse_iterator rend() const noexcept;
Return reverse iterator to reverse end
Returns a reverse iterator pointing to the theoretical element right before the first element in the map container (which is considered its reverse end).
The range between map::rbegin and map::rend contains all the elements of the container (in reverse order).
Return Value
A reverse iterator to the reverse end of the sequence container.
If the map object is const-qualified, the function returns a const_reverse_iterator. Otherwise, it returns a reverse_iterator.
Member types reverse_iterator and const_reverse_iterator are reverse bidirectional iterator types pointing to elements. See map member types.
Example
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
|
// map::rbegin/rend
#include <iostream>
#include <map>
int main ()
{
std::map<char,int> mymap;
mymap['x'] = 100;
mymap['y'] = 200;
mymap['z'] = 300;
// show content:
std::map<char,int>::reverse_iterator rit;
for (rit=mymap.rbegin(); rit!=mymap.rend(); ++rit)
std::cout << rit->first << " => " << rit->second << '\n';
return 0;
}
| |
Output:
z => 300
y => 200
x => 100
|
Iterator validity
No changes.
Data races
The container is accessed (neither the const nor the non-const versions modify the container).
No contained elements are accessed by the call, but the iterator returned can be used to access or modify elements. Concurrently accessing or modifying different elements is safe.
Exception safety
No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.
See also
- map::rbegin
- Return reverse iterator to reverse beginning (public member function
)
- map::begin
- Return iterator to beginning (public member function
)
- map::end
- Return iterator to end (public member function
)