# map rend() function in C++ STL

C++Server Side ProgrammingProgramming

In this article we will be discussing the working, syntax and examples of map::rend() function in C++ STL.

## What is a Map in C++ STL?

Maps are the associative container, which facilitates to store the elements formed by a combination of key value and mapped value in a specific order. In a map container the data is internally always sorted with the help of its associated keys. The values in the map container are accessed by its unique keys.

## What is a map::rend()?

map::rend() function is an inbuilt function in C++ STL, which is defined in  header file. rend() implies reverse end function, this function is the reverse of the end(). This function returns an iterator which is pointing to the element preceding the first element of the map container.

## Syntax

Map_name.rend();

## Parameter

This function accepts no parameter.

## Return value

This function returns the iterator which is pointing to the last element of the map container.

## Input

map<char, int> newmap;
newmap[‘a’] = 1;
newmap[‘b’] = 2;
newmap[‘c’] = 3;
newmap.rend();

## Output

error

## Example

Live Demo

#include <bits/stdc++.h>
using namespace std;
int main() {
map<int, int> TP_Map;
TP_Map.insert({3, 50});
TP_Map.insert({2, 30});
TP_Map.insert({1, 10});
TP_Map.insert({4, 70});
cout<<"\nTP Map is : \n";
cout << "MAP_KEY\tMAP_ELEMENT\n";
for (auto i = TP_Map.rbegin(); i!= TP_Map.rend(); i++) {
cout << i->first << "\t" << i->second << endl;
}
return 0;
}

## Output

TP Map is:
MAP_KEY    MAP_ELEMENT
4          70
3          50
2          30
1          10
Published on 15-Apr-2020 12:23:38