ContextQMD
Back to Arangodb

reverse_transform

3rdParty/boost/1.78.0/libs/mpl/doc/refmanual/reverse-transform.html

3.12.9.14.9 KB
Original Source

| Prev Next | Back Along | Up Home | Full TOC | Front Page / Algorithms / Transformation Algorithms / reverse_transform |

reverse_transform

Synopsis

template<
      typename Seq
    , typename Op
    , typename In =_unspecified_>
struct[reverse\_transform](./reverse-transform.html){
    typedef_unspecified_type;
};

template<
      typename Seq1
    , typename Seq2
    , typename BinaryOp
    , typename In =_unspecified_>
struct[reverse\_transform](./reverse-transform.html){
    typedef_unspecified_type;
};

Description

reverse_transform is an overloaded name:

  • reverse_transform<Seq,Op> returns a reversed, transformed copy of the original sequence produced by applying an unary transformation Op to every element in the [begin<Sequence>::type, end<Sequence>::type) range.
  • reverse_transform<Seq1,Seq2,Op> returns a new sequence produced by applying a binary transformation BinaryOp to a pair of elements (e1, e21) from the corresponding [begin<Seq1>::type, end<Seq1>::type) and [begin<Seq2>::type, end<Seq2>::type) ranges in reverse order.

[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/transform.hpp](../../../../boost/mpl/transform.hpp)>

Model of

Reversible Algorithm

Parameters

ParameterRequirementDescription
Sequence, Seq1, Seq2Forward SequenceSequences to transform.
Op, BinaryOpLambda ExpressionA transformation.
InInserterAn inserter.

Expression semantics

The semantics of an expression are defined only where they differ from, or are not defined in Reversible Algorithm.

For any Forward Sequences s, s1 and s2, Lambda Expressions op and op2, and an Inserter in:

typedef[reverse\_transform](./reverse-transform.html)<s,op,in>::type r;

| Return type: |

A type.

| | Postcondition: |

Equivalent to

typedef[lambda](./lambda.html)<op>::type f;
typedef[lambda](./lambda.html)<in::operation>::type in_op;

typedef[reverse\_fold](./reverse-fold.html)<
      s
    , in::state
    ,[bind](./bind.html)< in_op,[\_1](./placeholders.html),[bind](./bind.html)<f,[\_2](./placeholders.html)> >
    >::type r;

|

typedef[transform](./transform.html)<s1,s2,op,in>::type r;

| Return type: |

A type.

| | Postcondition: |

Equivalent to

typedef[lambda](./lambda.html)<op2>::type f;
typedef[lambda](./lambda.html)<in::operation>::type in_op;

typedef[reverse\_fold](./reverse-fold.html)<
      pair_view<s1,s2>
    , in::state
    ,[bind](./bind.html)<
          in_op
        ,[\_1](./placeholders.html),[bind](./bind.html)<f,[bind](./bind.html)<first<>,[\_2](./placeholders.html)>,[bind](./bind.html)<second<>,[\_2](./placeholders.html)> >
        >
    >::type r;

|

Complexity

Linear. Exactly size<s>::value / size<s1>::value applications of op / op2 and in::operation.

Example

typedef[vector](./vector.html)<char,short,int,long,float,double> types;
typedef[vector](./vector.html)<double*,float*,long*,int*,short*,char*> pointers;
typedef[reverse\_transform](./reverse-transform.html)< types,boost::add_pointer<[\_1](./placeholders.html)> >::type result;[BOOST\_MPL\_ASSERT](./assert.html)(([equal](./equal.html)<result,pointers> ));

See also

Transformation Algorithms, Reversible Algorithm, transform, reverse_copy, replace_if

| 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) |