Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://www.tutorialspoint.com/cpp_standard_library/cpp_set_rbegin.htm below:

C++ Set Library - rbegin Function

It returns a reverse iterator pointing to the last element in the container.

Following are the ways in which std::set::rbegin works in various C++ versions.

   reverse_iterator rbegin();
const_reverse_iterator rbegin() const;

 reverse_iterator rbegin() noexcept;
const_reverse_iterator rbegin() const noexcept;

It returns a reverse iterator pointing to the last element in the container.

It never throws exceptions.

Time complexity is contstant.

The following example shows the usage of std::set::rbegin.

#include <iostream>
#include <set>

int main () {
   int myints[] = {20,40,60,80,100};
   std::set<int> myset (myints,myints+10);

   std::set<int>::reverse_iterator rit;

   std::cout << "myset contains:";
   for (rit = myset.rbegin(); rit != myset.rend(); ++rit)
      std::cout << ' ' << *rit;

   std::cout << '\n';

   return 0;
}

The above program will compile and execute properly.

myset contains: 4203005 100 80 60 40 20 0

set.htm

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4