...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
boost::proto::make::impl
// In header: <boost/proto/transform/make.hpp> template<typename Expr, typename State, typename Data> struct impl : proto::transform_impl< Expr, State, Data > { // types typedef see-below result_type; // public member functions result_type operator()(typename impl::expr_param, typename impl::state_param, typename impl::data_param) const; };
impl
public
typestypedef see-below result_type;
proto::make<T>::impl<Expr, State, Data>::result_type
is
computed as follows:
If T
is an ObjectTransform of the form
Object(A_{0},...A_{n})
,
then let O
be the return type
Object
. Otherwise, let O
be T
. The result_type
typedef is
then computed as follows:
If O
is a Transform, then let
the result type be
boost::result_of<proto::when<_, O>(Expr, State, Data)>::type
.
Note that a substitution took place.
O
is a template like
proto::noinvoke<S<X_{0},...X_{n}> >
,
then the result type is calculated as follows:
For each i
in
[0,n]
, let
X_{i}'
be
boost::result_of<proto::make<X_{i}>(Expr, State, Data)>::type
(which evaluates this procedure recursively). Note that a substitution took place. (In this case,
Proto merely assumes that a substitution took place for the sake of compile-time efficiency. There
would be no reason to use proto::noinvoke<>
otherwise.)
The result type is
S<X_{0}',...X_{n}'>
.
O
is a template like
S<X_{0},...X_{n}>
,
then the result type is calculated as follows:
For each i
in
[0,n]
, let
X_{i}'
be
boost::result_of<proto::make<X_{i}>(Expr, State, Data)>::type
(which evaluates this procedure recursively). Note whether any substitutions took place during
this operation.
If any substitutions took place in the above step and
S<X_{0}',...X_{n}'>
has a nested
type
typedef, the result type is
S<X_{0}',...X_{n}'>::type
.
Otherwise, the result type is
S<X_{0}',...X_{n}'>
.
O
, and note that no
substitution took place.
Note that proto::when<>
is implemented
in terms of proto::call<>
and proto::make<>
, so the
above procedure is evaluated recursively.
impl
public member functionsresult_type operator()(typename impl::expr_param expr, typename impl::state_param state, typename impl::data_param data) const;
behaves as follows:
proto::make
<T>::impl<Expr,State,Data>::operator()
If T
is of the form
O(A_{0},...A_{n})
, then:
If
is proto::is_aggregate
<result_type>::value
true
, then construct
and return an object that
as follows:
result_type that = {proto::when
<_
, A_{0}>()(expr, state, data), ...proto::when
<_
, A_{n}>()(expr, state, data) };
Otherwise, construct
and return an object that
as follows:
result_type that(proto::when
<_
, A_{0}>()(expr, state, data), ...proto::when
<_
, A_{n}>()(expr, state, data) );
Otherwise, construct
and return an object that
as follows:
result_type that = result_type();