Defined in header <iterator> | ||
---|---|---|
template <class Iter> std::reverse_iterator<Iter> make_reverse_iterator( Iter i ); | (since C++14) (until C++17) | |
template <class Iter> constexpr std::reverse_iterator<Iter> make_reverse_iterator( Iter i ); | (since C++17) |
make_reverse_iterator
is a convenience function template that constructs a std::reverse_iterator
for the given iterator i
(which must be a LegacyBidirectionalIterator) with the type deduced from the type of the argument.
i | - | iterator to be converted to reverse iterator |
A std::reverse_iterator
constructed from i
.
Feature-test macro |
---|
__cpp_lib_make_reverse_iterator |
template< class Iter > constexpr std::reverse_iterator<Iter> make_reverse_iterator( Iter i ) { return std::reverse_iterator<Iter>(i); } |
#include <iostream> #include <iterator> #include <vector> #include <algorithm> int main() { std::vector<int> v{ 1, 3, 10, 8, 22 }; std::sort(v.begin(), v.end()); std::copy(v.begin(), v.end(), std::ostream_iterator<int>(std::cout, ", ")); std::cout << '\n'; std::copy( std::make_reverse_iterator(v.end()), std::make_reverse_iterator(v.begin()), std::ostream_iterator<int>(std::cout, ", ")); }
Output:
1, 3, 8, 10, 22, 22, 10, 8, 3, 1,
iterator adaptor for reverse-order traversal (class template) |
|
(C++14) | returns a reverse iterator to the beginning of a container or array (function template) |
(C++14) | returns a reverse end iterator for a container or array (function template) |
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
https://en.cppreference.com/w/cpp/iterator/make_reverse_iterator