FM / bcc_pre590

/usr/include/boost/mpl/aux_/preprocessed/bcc_pre590/

/usr/include/boost/mpl/aux_/preprocessed/bcc_pre590

Name	Size	Mode	Actions
advance_backward.hpp	2202	0644	edit dl rm
advance_forward.hpp	2182	0644	edit dl rm
and.hpp	1258	0644	edit dl rm
apply.hpp	2745	0644	edit dl rm
apply_fwd.hpp	973	0644	edit dl rm
apply_wrap.hpp	6957	0644	edit dl rm
arg.hpp	2690	0644	edit dl rm
basic_bind.hpp	7118	0644	edit dl rm
bind.hpp	10420	0644	edit dl rm
bind_fwd.hpp	823	0644	edit dl rm
bitand.hpp	3209	0644	edit dl rm
bitor.hpp	3179	0644	edit dl rm
bitxor.hpp	3209	0644	edit dl rm
deque.hpp	9724	0644	edit dl rm
divides.hpp	3192	0644	edit dl rm
equal_to.hpp	2098	0644	edit dl rm
fold_impl.hpp	4350	0644	edit dl rm
full_lambda.hpp	11506	0644	edit dl rm
greater.hpp	2081	0644	edit dl rm
greater_equal.hpp	2172	0644	edit dl rm
inherit.hpp	2750	0644	edit dl rm
iter_fold_if_impl.hpp	4270	0644	edit dl rm
iter_fold_impl.hpp	4154	0644	edit dl rm
lambda_no_ctps.hpp	6473	0644	edit dl rm
less.hpp	2036	0644	edit dl rm
less_equal.hpp	2127	0644	edit dl rm
list.hpp	9617	0644	edit dl rm
list_c.hpp	10718	0644	edit dl rm
map.hpp	9552	0644	edit dl rm
minus.hpp	3132	0644	edit dl rm
modulus.hpp	2294	0644	edit dl rm
not_equal_to.hpp	2157	0644	edit dl rm
or.hpp	1259	0644	edit dl rm
placeholders.hpp	2212	0644	edit dl rm
plus.hpp	3102	0644	edit dl rm
quote.hpp	293	0644	edit dl rm
reverse_fold_impl.hpp	8866	0644	edit dl rm
reverse_iter_fold_impl.hpp	8246	0644	edit dl rm
set.hpp	9552	0644	edit dl rm
set_c.hpp	10653	0644	edit dl rm
shift_left.hpp	2253	0644	edit dl rm
shift_right.hpp	2268	0644	edit dl rm
template_arity.hpp	763	0644	edit dl rm
times.hpp	3132	0644	edit dl rm
unpack_args.hpp	1986	0644	edit dl rm
vector.hpp	9747	0644	edit dl rm
vector_c.hpp	12238	0644	edit dl rm

Edit: /usr/include/boost/mpl/aux_/preprocessed/bcc_pre590/iter_fold_if_impl.hpp (4270B)

// Copyright Aleksey Gurtovoy 2001-2004
// Copyright David Abrahams 2001-2002
//
// 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 the main "iter_fold_if_impl.hpp" header
// -- DO NOT modify by hand!

namespace boost { namespace mpl { namespace aux {

template< typename Iterator, typename State >
struct iter_fold_if_null_step
{
    typedef State state;
    typedef Iterator iterator;
};

template< bool >
struct iter_fold_if_step_impl
{
    template<
          typename Iterator
        , typename State
        , typename StateOp
        , typename IteratorOp
        >
    struct result_
    {
        typedef typename apply2< StateOp,State,Iterator >::type state;
        typedef typename IteratorOp::type iterator;
    };
};

template<>
struct iter_fold_if_step_impl<false>
{
    template<
          typename Iterator
        , typename State
        , typename StateOp
        , typename IteratorOp
        >
    struct result_
    {
        typedef State state;
        typedef Iterator iterator;
    };
};

template<
      typename Iterator
    , typename State
    , typename ForwardOp
    , typename Predicate
    >
struct iter_fold_if_forward_step
{
    typedef typename apply2< Predicate,State,Iterator >::type not_last;
    typedef typename iter_fold_if_step_impl<
          BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value
        >::template result_< Iterator,State,ForwardOp, mpl::next<Iterator> > impl_;

typedef typename impl_::state state;
    typedef typename impl_::iterator iterator;
};

template<
      typename Iterator
    , typename State
    , typename BackwardOp
    , typename Predicate
    >
struct iter_fold_if_backward_step
{
    typedef typename apply2< Predicate,State,Iterator >::type not_last;
    typedef typename iter_fold_if_step_impl<
          BOOST_MPL_AUX_MSVC_VALUE_WKND(not_last)::value
        >::template result_< Iterator,State,BackwardOp, identity<Iterator> > impl_;

typedef typename impl_::state state;
    typedef typename impl_::iterator iterator;
};

template<
      typename Iterator
    , typename State
    , typename ForwardOp
    , typename ForwardPredicate
    , typename BackwardOp
    , typename BackwardPredicate
    >
struct iter_fold_if_impl
{
 private:
    typedef iter_fold_if_null_step< Iterator,State > forward_step0;
    typedef iter_fold_if_forward_step< typename forward_step0::iterator, typename forward_step0::state, ForwardOp, ForwardPredicate > forward_step1;
    typedef iter_fold_if_forward_step< typename forward_step1::iterator, typename forward_step1::state, ForwardOp, ForwardPredicate > forward_step2;
    typedef iter_fold_if_forward_step< typename forward_step2::iterator, typename forward_step2::state, ForwardOp, ForwardPredicate > forward_step3;
    typedef iter_fold_if_forward_step< typename forward_step3::iterator, typename forward_step3::state, ForwardOp, ForwardPredicate > forward_step4;

typedef typename if_<
          typename forward_step4::not_last
        , iter_fold_if_impl<
              typename forward_step4::iterator
            , typename forward_step4::state
            , ForwardOp
            , ForwardPredicate
            , BackwardOp
            , BackwardPredicate
            >
        , iter_fold_if_null_step<
              typename forward_step4::iterator
            , typename forward_step4::state
            >
        >::type backward_step4;

typedef iter_fold_if_backward_step< typename forward_step3::iterator, typename backward_step4::state, BackwardOp, BackwardPredicate > backward_step3;
    typedef iter_fold_if_backward_step< typename forward_step2::iterator, typename backward_step3::state, BackwardOp, BackwardPredicate > backward_step2;
    typedef iter_fold_if_backward_step< typename forward_step1::iterator, typename backward_step2::state, BackwardOp, BackwardPredicate > backward_step1;
    typedef iter_fold_if_backward_step< typename forward_step0::iterator, typename backward_step1::state, BackwardOp, BackwardPredicate > backward_step0;

public:
    typedef typename backward_step0::state state;
    typedef typename backward_step4::iterator iterator;
};

}}}

cmd: