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

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

C++ Set Library - rend Function

It returns a const_reverse_iterator pointing to the element that would theoretically precede the first element in the container.

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

const_reverse_iterator crend() const noexcept;

const_reverse_iterator crend() const noexcept;

It returns a const_reverse_iterator pointing to the element that would theoretically precede the first element in the container.

It never throws exceptions.

Time complexity is contstant.

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

#include <iostream>
#include <set>

int main () {
   std::set<int> myset = {50,40,30,20,10};

   std::cout << "myset backwards:";
   for (auto rit = myset.crbegin(); rit != myset.crend(); ++rit)
      std::cout << ' ' << *rit;

   std::cout << '\n';

   return 0;
}

The above program will compile and execute properly.

myset backwards: 50 40 30 20 10

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