public member function
<set>

std::set::rend

      reverse_iterator rend();
const_reverse_iterator rend() const;

      reverse_iterator rend() noexcept;
const_reverse_iterator rend() const noexcept;
Return reverse iterator to reverse end
Returns a reverse iterator pointing to the theoretical element right before the first element in the set container (which is considered its reverse end).

The range between set::rbegin and set::rend contains all the elements of the container (in reverse order).

Parameters

none

Return Value

A reverse iterator to the reverse end of the sequence container.

If the set object is const-qualified, the function returns a const_reverse_iterator. Otherwise, it returns a reverse_iterator.

Member types reverse_iterator and const_reverse_iterator are reverse bidirectional iterator types pointing to elements. See set member types.

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
 
// set::rbegin/rend
#include <iostream>
#include <set>

int main ()
{
  int myints[] = {21,64,17,78,49};
  std::set<int> myset (myints,myints+5);

  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;
}


Output:
myset contains: 78 64 49 21 17

Complexity

Constant.

Iterator validity

No changes.

Data races

The container is accessed (neither the const nor the non-const versions modify the container).
Concurrently accessing the elements of a set is safe.

Exception safety

No-throw guarantee: this member function never throws exceptions.
The copy construction or assignment of the returned iterator is also guaranteed to never throw.

See also

set::rbegin
Return reverse iterator to reverse beginning (public member function )
set::begin
Return iterator to beginning (public member function )
set::end
Return iterator to end (public member function )

C++