Chris@16: #if !defined(BOOST_PROTO_DONT_USE_PREPROCESSED_FILES) Chris@16: Chris@16: #include Chris@16: Chris@16: #elif !defined(BOOST_PP_IS_ITERATING) Chris@16: Chris@16: #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES) Chris@16: #pragma wave option(preserve: 2, line: 0, output: "preprocessed/and_n.hpp") Chris@16: #endif Chris@16: Chris@16: /////////////////////////////////////////////////////////////////////////////// Chris@16: /// \file and_n.hpp Chris@16: /// Definitions of and_N, and_impl Chris@16: // Chris@16: // Copyright 2008 Eric Niebler. Distributed under the Boost Chris@16: // Software License, Version 1.0. (See accompanying file Chris@16: // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) Chris@16: Chris@16: #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES) Chris@16: #pragma wave option(preserve: 1) Chris@16: #endif Chris@16: Chris@16: #define BOOST_PP_ITERATION_PARAMS_1 \ Chris@16: (3, (2, BOOST_PP_MAX(BOOST_PROTO_MAX_ARITY, BOOST_PROTO_MAX_LOGICAL_ARITY), )) Chris@16: #include BOOST_PP_ITERATE() Chris@16: Chris@16: #if defined(__WAVE__) && defined(BOOST_PROTO_CREATE_PREPROCESSED_FILES) Chris@16: #pragma wave option(output: null) Chris@16: #endif Chris@16: Chris@16: #else // BOOST_PP_IS_ITERATING Chris@16: Chris@16: #define N BOOST_PP_ITERATION() Chris@16: Chris@16: // Assymetry here between the handling of and_N and or_N because Chris@16: // and_N is used by lambda_matches up to BOOST_PROTO_MAX_ARITY, Chris@16: // regardless of how low BOOST_PROTO_MAX_LOGICAL_ARITY is. Chris@16: template Chris@16: struct BOOST_PP_CAT(and_, N) Chris@16: #if 2 == N Chris@16: : mpl::bool_ Chris@16: {}; Chris@16: #else Chris@16: : BOOST_PP_CAT(and_, BOOST_PP_DEC(N))< Chris@16: P0::value BOOST_PP_COMMA_IF(BOOST_PP_SUB(N,2)) Chris@16: BOOST_PP_ENUM_SHIFTED_PARAMS(BOOST_PP_DEC(N), P) Chris@16: > Chris@16: {}; Chris@16: #endif Chris@16: Chris@16: template Chris@16: struct BOOST_PP_CAT(and_, N) Chris@16: : mpl::false_ Chris@16: {}; Chris@16: Chris@16: #if N <= BOOST_PROTO_MAX_LOGICAL_ARITY Chris@16: Chris@16: template Chris@16: struct _and_impl, Expr, State, Data> Chris@16: : proto::transform_impl Chris@16: { Chris@16: #define M0(Z, N, DATA) \ Chris@16: typedef \ Chris@16: typename proto::when \ Chris@16: ::template impl \ Chris@16: BOOST_PP_CAT(Gimpl, N); \ Chris@16: /**/ Chris@16: BOOST_PP_REPEAT(N, M0, ~) Chris@16: #undef M0 Chris@16: Chris@16: typedef typename BOOST_PP_CAT(Gimpl, BOOST_PP_DEC(N))::result_type result_type; Chris@16: Chris@16: result_type operator()( Chris@16: typename _and_impl::expr_param e Chris@16: , typename _and_impl::state_param s Chris@16: , typename _and_impl::data_param d Chris@16: ) const Chris@16: { Chris@16: // Fix: jfalcou - 12/29/2010 Chris@16: // Avoid the use of comma operator here so as not to find Proto's Chris@16: // by accident. Chris@16: // expands to G0()(e,s,d); G1()(e,s,d); ... G{N-1}()(e,s,d); Chris@16: #define M0(Z,N,DATA) BOOST_PP_CAT(Gimpl,N)()(e,s,d); Chris@16: BOOST_PP_REPEAT(BOOST_PP_DEC(N),M0,~) Chris@16: return BOOST_PP_CAT(Gimpl,BOOST_PP_DEC(N))()(e,s,d); Chris@16: #undef M0 Chris@16: } Chris@16: }; Chris@16: Chris@16: #endif Chris@16: Chris@16: #undef N Chris@16: Chris@16: #endif