C++ Set Library - crend Function

---

---

Description

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

Declaration

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

C++98

const_reverse_iterator crend() const noexcept;

C++11

const_reverse_iterator crend() const noexcept;

Return value

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

Exceptions

It never throws exceptions.

Time complexity

Time complexity is contstant.

Example

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