mktime() function in C++ STL

map rbegin() function in C++ STL

Last Updated : 23 Oct, 2018

The rbegin() is a function in C++ STL. It returns a reverse iterator which points to the last element of the map. The reverse iterator iterates in reverse order and incrementing it means moving towards beginning of map. SYNTAX:

r_i rbegin();
const_r_i rbegin() const;

Parameters: It does not except any parameters. Return Value: This method throws a reverse iterator to the reverse beginning of the sequence container. Time Complexity:

O(1)

Example:

CPP

#include <iostream>
#include <map>
using namespace std;

int main()
{

    map<char, int> mp = {
        { 'a', 1 },
        { 'b', 2 },
        { 'c', 3 },
        { 'd', 4 },
        { 'e', 5 },
    };

    cout << "Map contains "
         << "following elements in"
         << " reverse order"
         << endl;

    for (auto i = mp.rbegin(); i != mp.rend(); ++i) {

        cout << i->first
             << " = "
             << i->second
             << endl;
    }

    return 0;
}

Output:

Map contains following elements in reverse order
e = 5
d = 4
c = 3
b = 2
a = 1

mktime() function in C++ STL

L

lakshita

Improve

Article Tags :

Practice Tags :

CPP

Similar Reads

map rend() function in C++ STL

The rend() function is an inbuilt function in C++ STL which returns a reverse iterator pointing to the theoretical element right before the first key-value pair in the map(which is considered its reverse end). Syntax: map_name.rend() Parameters:The function does not take any parameter. Return Value:

map find() function in C++ STL

The std::map::find() is a built-in function in C++ STL that is used to find an element with given key in the map. It is a member function of std::map container so we can directly use it with any map.Syntaxmap_name.find(key)Parameterskey: Key of the pair to be searched in the map container.Return Val

multimap size() function in C++ STL

The multimap::size() is a built-in function in C++ STL which returns the number of elements in the multimap container. Syntax: multimap_name.size() Parameters: The function does not accept any parameter. Return Value: This function returns the number of elements a multimap container has. CPP // C++

multimap rbegin in C++ STL

multimap::rbegin() is a built-in-function in C++ STL which returns an iterator pointing to the last element of the container. Syntax: multimap_name.rbegiin() Parameters: The function does not take any parameter. Return Value: The function returns a reverse iterator pointing to the last element of th

mktime() function in C++ STL

The mktime() is an inbuilt C++ function which converts the local calendar time to the time since epoch and returns the value as an object of type time_t. Syntax : time_t mktime( struct tm *time_ptr ) Parameters: The function accepts a mandatory parameter pointer time_ptr that points to a tm object s

map erase() Function in C++ STL

In C++, std::map::erase() is a built-in function of std::map container that is used to remove elements from the map using their key or iterator. We can also remove multiple elements using iterators. In this article, we will learn how to use the map::erase() in C++SyntaxThe std::string::erase() funct

map count() Function in C++ STL

The std::map::count() in C++ is a built-in function that is used to count the occurrence of the given key in the map container. It is the member function of the std::map container.In this article, we will learn how to use std::map::count() in C++.Syntaxmp.count(key)Parameters key: The value whose oc

multiset rbegin() and rend() function in C++ STL

multiset::rbegin() is a built-in function in C++ STL which returns a reverse iterator pointing to the last element in the multiset container. Syntax: reverse_iterator multiset_name.rbegin() Parameters: The function does not take any parameter. Return value: The function returns a reverse iterator po

Function Pointer in C++

Prerequisites: Pointers in C++Function in C++ Pointers are symbolic representations of addresses. They enable programs to simulate call-by-reference as well as to create and manipulate dynamic data structures. Iterating over elements in arrays or other data structures is one of the main use of point

list size() function in C++ STL

The list::size() is a built-in function in C++ STL that is used to find the number of elements present in a list container. That is, it is used to find the size of the list container.Syntax: list_name.size(); Time Complexity - Linear O(1) as per c++11 standard. Possible because the implementation ma