/usr/include/boost/mpl/aux_/preprocessed/dmc
NameSizeModeActions
advance_backward.hpp22060644editdlrm
advance_forward.hpp21860644editdlrm
and.hpp12570644editdlrm
apply.hpp27440644editdlrm
apply_fwd.hpp9720644editdlrm
apply_wrap.hpp12380644editdlrm
arg.hpp28930644editdlrm
basic_bind.hpp95300644editdlrm
bind.hpp132530644editdlrm
bind_fwd.hpp10810644editdlrm
bitand.hpp32080644editdlrm
bitor.hpp31780644editdlrm
bitxor.hpp32080644editdlrm
deque.hpp97230644editdlrm
divides.hpp31910644editdlrm
equal_to.hpp20970644editdlrm
fold_impl.hpp43540644editdlrm
full_lambda.hpp107280644editdlrm
greater.hpp20800644editdlrm
greater_equal.hpp21710644editdlrm
inherit.hpp28320644editdlrm
iter_fold_if_impl.hpp42740644editdlrm
iter_fold_impl.hpp41580644editdlrm
lambda_no_ctps.hpp64770644editdlrm
less.hpp20350644editdlrm
less_equal.hpp21260644editdlrm
list.hpp96160644editdlrm
list_c.hpp107170644editdlrm
map.hpp95510644editdlrm
minus.hpp31310644editdlrm
modulus.hpp22930644editdlrm
not_equal_to.hpp21560644editdlrm
or.hpp12580644editdlrm
placeholders.hpp22110644editdlrm
plus.hpp31010644editdlrm
quote.hpp21870644editdlrm
reverse_fold_impl.hpp73720644editdlrm
reverse_iter_fold_impl.hpp67170644editdlrm
set.hpp95510644editdlrm
set_c.hpp106520644editdlrm
shift_left.hpp22520644editdlrm
shift_right.hpp22670644editdlrm
template_arity.hpp3060644editdlrm
times.hpp31310644editdlrm
unpack_args.hpp19060644editdlrm
vector.hpp97460644editdlrm
vector_c.hpp122370644editdlrm
Edit: /usr/include/boost/mpl/aux_/preprocessed/dmc/fold_impl.hpp (4354B)
// Copyright Aleksey Gurtovoy 2000-2004 // // 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) // // Preprocessed version of "boost/mpl/aux_/fold_impl.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { /// forward declaration template< int N , typename First , typename Last , typename State , typename ForwardOp > struct fold_impl; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 0,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef state0 state; typedef iter0 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 1,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef state1 state; typedef iter1 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 2,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef state2 state; typedef iter2 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 3,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, state2, typename deref::type >::type state3; typedef typename mpl::next::type iter3; typedef state3 state; typedef iter3 iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< 4,First,Last,State,ForwardOp > { typedef First iter0; typedef State state0; typedef typename apply2< ForwardOp, state0, typename deref::type >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp, state1, typename deref::type >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp, state2, typename deref::type >::type state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp, state3, typename deref::type >::type state4; typedef typename mpl::next::type iter4; typedef state4 state; typedef iter4 iterator; }; template< int N , typename First , typename Last , typename State , typename ForwardOp > struct fold_impl { typedef fold_impl< 4 , First , Last , State , ForwardOp > chunk_; typedef fold_impl< ( (N - 4) < 0 ? 0 : N - 4 ) , typename chunk_::iterator , Last , typename chunk_::state , ForwardOp > res_; typedef typename res_::state state; typedef typename res_::iterator iterator; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_impl< -1,First,Last,State,ForwardOp > : fold_impl< -1 , typename mpl::next::type , Last , typename apply2::type>::type , ForwardOp > { }; template< typename Last , typename State , typename ForwardOp > struct fold_impl< -1,Last,Last,State,ForwardOp > { typedef State state; typedef Last iterator; }; }}}