#include <adobe/config.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <adobe/iterator/set_next.hpp>
#include <algorithm>
#include <utility>
Go to the source code of this file.
Namespaces |
| namespace | adobe |
| namespace | adobe::unsafe |
Functions |
| template<class BidirectionalRange > |
| void | reverse (BidirectionalRange &range) |
| template<typename I > |
| I | reverse_append (I first, I last, I result) |
| template<typename R , typename I > |
| I | reverse_append (R &range, I result) |
| template<class BidirectionalRange , class OutputIterator > |
| void | reverse_copy (const BidirectionalRange &range, OutputIterator result) |
| template<class BidirectionalRange , class OutputIterator > |
| void | reverse_copy (BidirectionalRange &range, OutputIterator result) |
| template<typename R > |
| boost::range_iterator< R >::type | reverse_nodes (R &range) |
| template<typename I > |
| I | reverse_nodes (I first, I last) |
| template<typename I > |
| std::pair< I, I > | reverse_until (I f, I m, I l) |
