Name	Size	Mode	Actions
advance_backward.hpp	2206	0644	editdlrm
advance_forward.hpp	2186	0644	editdlrm
and.hpp	1383	0644	editdlrm
apply.hpp	4474	0644	editdlrm
apply_fwd.hpp	915	0644	editdlrm
apply_wrap.hpp	1164	0644	editdlrm
arg.hpp	2893	0644	editdlrm
basic_bind.hpp	10017	0644	editdlrm
bind.hpp	13529	0644	editdlrm
bind_fwd.hpp	964	0644	editdlrm
bitand.hpp	2855	0644	editdlrm
bitor.hpp	2834	0644	editdlrm
bitxor.hpp	2855	0644	editdlrm
deque.hpp	14714	0644	editdlrm
divides.hpp	2838	0644	editdlrm
equal_to.hpp	2091	0644	editdlrm
fold_impl.hpp	5758	0644	editdlrm
full_lambda.hpp	11215	0644	editdlrm
greater.hpp	2074	0644	editdlrm
greater_equal.hpp	2165	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	2029	0644	editdlrm
less_equal.hpp	2120	0644	editdlrm
list.hpp	14620	0644	editdlrm
list_c.hpp	13129	0644	editdlrm
map.hpp	14547	0644	editdlrm
minus.hpp	2796	0644	editdlrm
modulus.hpp	2287	0644	editdlrm
not_equal_to.hpp	2150	0644	editdlrm
or.hpp	1384	0644	editdlrm
placeholders.hpp	2211	0644	editdlrm
plus.hpp	2775	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	2246	0644	editdlrm
shift_right.hpp	2261	0644	editdlrm
template_arity.hpp	767	0644	editdlrm
times.hpp	2796	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_/iter_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 iter_fold_impl; template< int N > struct iter_fold_chunk; template<> struct iter_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 iter_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,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef state1 state; typedef iter1 iterator; }; }; template<> struct iter_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,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef state2 state; typedef iter2 iterator; }; }; template<> struct iter_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,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,state2,iter2 >::type state3; typedef typename mpl::next::type iter3; typedef state3 state; typedef iter3 iterator; }; }; template<> struct iter_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,iter0 >::type state1; typedef typename mpl::next::type iter1; typedef typename apply2< ForwardOp,state1,iter1 >::type state2; typedef typename mpl::next::type iter2; typedef typename apply2< ForwardOp,state2,iter2 >::type state3; typedef typename mpl::next::type iter3; typedef typename apply2< ForwardOp,state3,iter3 >::type state4; typedef typename mpl::next::type iter4; typedef state4 state; typedef iter4 iterator; }; }; template< int N > struct iter_fold_chunk { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { typedef iter_fold_impl< 4 , First , Last , State , ForwardOp > chunk_; typedef iter_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 iter_fold_step; template< typename Last , typename State > struct iter_fold_null_step { typedef Last iterator; typedef State state; }; template<> struct iter_fold_chunk< -1 > { template< typename First , typename Last , typename State , typename ForwardOp > struct result_ { typedef typename if_< typename is_same< First,Last >::type , iter_fold_null_step< Last,State > , iter_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 iter_fold_step { typedef iter_fold_chunk< -1 >::template result_< typename mpl::next::type , Last , typename apply2< ForwardOp,State,First >::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 iter_fold_impl : iter_fold_chunk ::template result_< First,Last,State,ForwardOp > { }; }}}