public member function
<set>
std::set::rendreverse_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).
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.
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;
}
myset contains: 78 64 49 21 17
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