|
stlab 2.3.0
Modern, modular C++ algorithms, data structures, and concurrency primitives
|
Reverse algorithms for iterators and intrusive forward sequences.
Functions | |
| template<class BidirectionalRange> | |
| void | stlab::reverse (BidirectionalRange &range) |
| Range-based reverse, will be deprecated in C++20 in favor of std::ranges::reverse. | |
| template<class BidirectionalRange, class OutputIterator> | |
| void | stlab::reverse_copy (BidirectionalRange &range, OutputIterator result) |
| Range-based reverse_copy algorithm, will be deprecated in C++20 in favor of std::ranges::reverse_copy. | |
| template<class BidirectionalRange, class OutputIterator> | |
| void | stlab::reverse_copy (const BidirectionalRange &range, OutputIterator result) |
| Range-based reverse_copy algorithm, will be deprecated in C++20 in favor of std::ranges::reverse_copy. | |
| template<typename I> | |
| auto | stlab::reverse_until (I f, I m, I l) -> std::pair< I, I > |
| Reverses the range [f, l) until m is reached. Returns a range [a, b) of the un-reversed subrange such that either a == m or b == m. | |