Name	Size	Mode	Actions
advance_backward.hpp	2206	0644	editdlrm
advance_forward.hpp	2186	0644	editdlrm
and.hpp	1374	0644	editdlrm
apply.hpp	2515	0644	editdlrm
apply_fwd.hpp	829	0644	editdlrm
apply_wrap.hpp	2055	0644	editdlrm
arg.hpp	2893	0644	editdlrm
basic_bind.hpp	7357	0644	editdlrm
bind.hpp	10869	0644	editdlrm
bind_fwd.hpp	822	0644	editdlrm
bitand.hpp	3139	0644	editdlrm
bitor.hpp	3116	0644	editdlrm
bitxor.hpp	3139	0644	editdlrm
deque.hpp	14714	0644	editdlrm
divides.hpp	3124	0644	editdlrm
equal_to.hpp	2334	0644	editdlrm
fold_impl.hpp	5758	0644	editdlrm
full_lambda.hpp	11215	0644	editdlrm
greater.hpp	2318	0644	editdlrm
greater_equal.hpp	2409	0644	editdlrm
inherit.hpp	3265	0644	editdlrm
iter_fold_if_impl.hpp	4274	0644	editdlrm
iter_fold_impl.hpp	5597	0644	editdlrm
lambda_no_ctps.hpp	6477	0644	editdlrm
less.hpp	2273	0644	editdlrm
less_equal.hpp	2364	0644	editdlrm
list.hpp	14620	0644	editdlrm
list_c.hpp	13129	0644	editdlrm
map.hpp	14547	0644	editdlrm
minus.hpp	3078	0644	editdlrm
modulus.hpp	2536	0644	editdlrm
not_equal_to.hpp	2394	0644	editdlrm
or.hpp	1375	0644	editdlrm
placeholders.hpp	2211	0644	editdlrm
plus.hpp	3055	0644	editdlrm
quote.hpp	2236	0644	editdlrm
reverse_fold_impl.hpp	8870	0644	editdlrm
reverse_iter_fold_impl.hpp	8250	0644	editdlrm
set.hpp	14547	0644	editdlrm
set_c.hpp	13056	0644	editdlrm
shift_left.hpp	2554	0644	editdlrm
shift_right.hpp	2571	0644	editdlrm
template_arity.hpp	833	0644	editdlrm
times.hpp	3078	0644	editdlrm
unpack_args.hpp	2296	0644	editdlrm
vector.hpp	14766	0644	editdlrm
vector_c.hpp	13905	0644	editdlrm

// 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< int N > struct fold_chunk; template<> struct fold_chunk<0> { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { typedef First iter0; typedef State state0; typedef state0 state; typedef iter0 iterator; }; }; template<> struct fold_chunk<1> { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { 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<> struct fold_chunk<2> { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { 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<> struct fold_chunk<3> { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { 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<> struct fold_chunk<4> { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { 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 > struct fold_chunk { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { 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_step; template< typename Last , typename State > struct fold_null_step { typedef Last iterator; typedef State state; }; template<> struct fold_chunk< -1 > { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { typedef typename if_< typename is_same< First,Last >::type , fold_null_step< Last,State > , fold_step< First,Last,State,ForwardOp > >::type res_; typedef typename res_::state state; typedef typename res_::iterator iterator; }; }; template< typename First , typename Last , typename State , typename ForwardOp > struct fold_step { typedef fold_chunk< -1 >::template result_< typename mpl::next::type , Last , typename apply2::type>::type , ForwardOp > chunk_; typedef typename chunk_::state state; typedef typename chunk_::iterator iterator; }; template< int N , typename First , typename Last , typename State , typename ForwardOp > struct fold_impl : fold_chunk ::template result_< First,Last,State,ForwardOp > { }; }}}