Difference between revisions of "cpp/iterator/rend"
From cppreference.com
m (Update links.) |
(fix see also) |
||
| Line 58: | Line 58: | ||
===See also=== | ===See also=== | ||
{{dsc begin}} | {{dsc begin}} | ||
| − | {{dsc inc | cpp/iterator/dsc | + | {{dsc inc | cpp/iterator/dsc rbegin}} |
{{dsc end}} | {{dsc end}} | ||
Revision as of 22:46, 5 June 2013
| Defined in header <iterator>
|
||
| template< class C > auto rend( C& c ) -> decltype(c.rend()); |
(1) | (since C++14) |
| template< class C > auto rend( const C& c ) -> decltype(c.rend()); |
(1) | (since C++14) |
| template< class T, size_t N > T* rend( T (&array)[N] ); |
(2) | (since C++14) |
| template< class C > auto crend( const C& c ) -> decltype(std::rend(c)); |
(3) | (since C++14) |
Returns an iterator to the reverse-end of the given container c or array array.
1) Returns a possibly const-qualified iterator to the reverse-end of the container
c.2) Returns a pointer to the reverse-end of the array
array.3) Returns a const-qualified iterator to the reverse-end of the container
c.
Contents |
Parameters
| c | - | a container with a rend method
|
| array | - | an array of arbitrary type |
Return value
An iterator to the reverse-end of c or array
Notes
In addition to being included in <iterator>, std::rend is guaranteed to become available if any of the following headers are included: <array>, <deque>, <forward_list>, <list>, <map>, <regex>, <set>, <string>, <unordered_map>, <unordered_set>, and <vector>.
Specializations
Custom specializations of std::rend may be provided for classes that do not expose a suitable rend() member function, yet can be iterated. The following specializations are already provided by the standard library:
| (C++14) |
specializes std::rend (function) |
| specializes std::rend() (function) |
Example
| This section is incomplete Reason: no example |
See also
| (C++14) |
returns a reverse iterator to the beginning of a container or array (function template) |
