3rdParty/boost/1.78.0/libs/mpl/doc/refmanual/reverse-copy.html
| Prev Next | Back Along | Up Home | Full TOC | Front Page / Algorithms / Transformation Algorithms / reverse_copy |
template<
typename Sequence
, typename In =_unspecified_>
struct[reverse\_copy](./reverse-copy.html){
typedef_unspecified_type;
};
Returns a reversed copy of the original sequence.
[Note: This wording applies to a no-inserter version(s) of the algorithm. See the Expression semantics subsection for a precise specification of the algorithm's details in all cases — end note]
#include <[boost/mpl/copy.hpp](../../../../boost/mpl/copy.hpp)>
| Parameter | Requirement | Description |
|---|---|---|
| Sequence | Forward Sequence | A sequence to copy. |
| In | Inserter | An inserter. |
The semantics of an expression are defined only where they differ from, or are not defined in Reversible Algorithm.
For any Forward Sequence s, and an Inserter in:
typedef[reverse\_copy](./reverse-copy.html)<s,in>::type r;
| Return type: |
A type.
| | Semantics: |
Equivalent to
typedef[reverse\_fold](./reverse-fold.html)< s,in::state,in::operation >::type r;
|
Linear. Exactly size<s>::value applications of in::operation.
typedef[list\_c](./list-c.html)<int,10,11,12,13,14,15,16,17,18,19>::type numbers;
typedef[reverse\_copy](./reverse-copy.html)<[range\_c](./range-c.html)<int,0,10>
,[front\_inserter](./front-inserter.html)< numbers >
>::type result;[BOOST\_MPL\_ASSERT\_RELATION](./assert-relation.html)([size](./size.html)<result>::value, ==, 20 );[BOOST\_MPL\_ASSERT](./assert.html)(([equal](./equal.html)< result,[range\_c](./range-c.html)<int,0,20> > ));
Transformation Algorithms, Reversible Algorithm, copy, reverse_copy_if, reverse_transform
| Prev Next | Back Along | Up Home | Full TOC |
Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) |