]>
Commit | Line | Data |
---|---|---|
7c673cae FG |
1 | [/ |
2 | Copyright 2010 Neil Groves | |
3 | Distributed under the Boost Software License, Version 1.0. | |
4 | (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) | |
5 | /] | |
6 | [section:reverse_copy reverse_copy] | |
7 | ||
8 | [heading Prototype] | |
9 | ||
10 | `` | |
11 | template<class BidirectionalRange, class OutputIterator> | |
12 | OutputIterator reverse_copy(const BidirectionalRange& rng, OutputIterator out); | |
13 | `` | |
14 | ||
15 | [heading Description] | |
16 | ||
17 | `reverse_copy` copies the elements from `rng` in reverse order to `out`. | |
18 | Returns the output iterator one passed the last copied element. | |
19 | ||
20 | [heading Definition] | |
21 | ||
22 | Defined in the header file `boost/range/algorithm/reverse_copy.hpp` | |
23 | ||
24 | [heading Requirements] | |
25 | ||
26 | * `BidirectionalRange` is a model of the __bidirectional_range__ Concept. | |
27 | * `BidirectionalRange` is mutable. | |
28 | * `OutputIterator` is a model of the `OutputIteratorConcept`. | |
29 | ||
30 | [heading Complexity] | |
31 | ||
32 | Linear. `reverse_copy` makes `distance(rng)` copies. | |
33 | ||
34 | [endsect] | |
35 | ||
36 |