FM / msvc60

/usr/include/boost/mpl/aux_/preprocessed/msvc60/

/usr/include/boost/mpl/aux_/preprocessed/msvc60

Name	Size	Mode	Actions
advance_backward.hpp	2691	0644	edit dl rm
advance_forward.hpp	2671	0644	edit dl rm
and.hpp	1383	0644	edit dl rm
apply.hpp	2683	0644	edit dl rm
apply_fwd.hpp	829	0644	edit dl rm
apply_wrap.hpp	4692	0644	edit dl rm
arg.hpp	2893	0644	edit dl rm
basic_bind.hpp	7357	0644	edit dl rm
bind.hpp	10869	0644	edit dl rm
bind_fwd.hpp	822	0644	edit dl rm
bitand.hpp	3119	0644	edit dl rm
bitor.hpp	3096	0644	edit dl rm
bitxor.hpp	3119	0644	edit dl rm
deque.hpp	14714	0644	edit dl rm
divides.hpp	3104	0644	edit dl rm
equal_to.hpp	2350	0644	edit dl rm
fold_impl.hpp	6622	0644	edit dl rm
full_lambda.hpp	11215	0644	edit dl rm
greater.hpp	2334	0644	edit dl rm
greater_equal.hpp	2425	0644	edit dl rm
inherit.hpp	3265	0644	edit dl rm
iter_fold_if_impl.hpp	4274	0644	edit dl rm
iter_fold_impl.hpp	6461	0644	edit dl rm
lambda_no_ctps.hpp	6477	0644	edit dl rm
less.hpp	2289	0644	edit dl rm
less_equal.hpp	2380	0644	edit dl rm
list.hpp	14620	0644	edit dl rm
list_c.hpp	13129	0644	edit dl rm
map.hpp	14547	0644	edit dl rm
minus.hpp	3058	0644	edit dl rm
modulus.hpp	2552	0644	edit dl rm
not_equal_to.hpp	2410	0644	edit dl rm
or.hpp	1384	0644	edit dl rm
placeholders.hpp	2211	0644	edit dl rm
plus.hpp	3035	0644	edit dl rm
quote.hpp	292	0644	edit dl rm
reverse_fold_impl.hpp	9758	0644	edit dl rm
reverse_iter_fold_impl.hpp	9138	0644	edit dl rm
set.hpp	14547	0644	edit dl rm
set_c.hpp	13056	0644	edit dl rm
shift_left.hpp	2570	0644	edit dl rm
shift_right.hpp	2587	0644	edit dl rm
template_arity.hpp	833	0644	edit dl rm
times.hpp	3058	0644	edit dl rm
unpack_args.hpp	2296	0644	edit dl rm
vector.hpp	14766	0644	edit dl rm
vector_c.hpp	13905	0644	edit dl rm

Edit: /usr/include/boost/mpl/aux_/preprocessed/msvc60/advance_backward.hpp (2691B)

// 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_/advance_backward.hpp" header
// -- DO NOT modify by hand!

namespace boost { namespace mpl { namespace aux {

template< long N > struct advance_backward;
template<>
struct advance_backward<0>
{
    template< typename Iterator > struct apply
    {
        typedef Iterator iter0;
        typedef iter0 type;
    };

/// ETI workaround
    template<> struct apply<int>
    {
        typedef int type;
    };

};

template<>
struct advance_backward<1>
{
    template< typename Iterator > struct apply
    {
        typedef Iterator iter0;
        typedef typename prior<iter0>::type iter1;
        typedef iter1 type;
    };

/// ETI workaround
    template<> struct apply<int>
    {
        typedef int type;
    };

};

template<>
struct advance_backward<2>
{
    template< typename Iterator > struct apply
    {
        typedef Iterator iter0;
        typedef typename prior<iter0>::type iter1;
        typedef typename prior<iter1>::type iter2;
        typedef iter2 type;
    };

/// ETI workaround
    template<> struct apply<int>
    {
        typedef int type;
    };

};

template<>
struct advance_backward<3>
{
    template< typename Iterator > struct apply
    {
        typedef Iterator iter0;
        typedef typename prior<iter0>::type iter1;
        typedef typename prior<iter1>::type iter2;
        typedef typename prior<iter2>::type iter3;
        typedef iter3 type;
    };

/// ETI workaround
    template<> struct apply<int>
    {
        typedef int type;
    };

};

template<>
struct advance_backward<4>
{
    template< typename Iterator > struct apply
    {
        typedef Iterator iter0;
        typedef typename prior<iter0>::type iter1;
        typedef typename prior<iter1>::type iter2;
        typedef typename prior<iter2>::type iter3;
        typedef typename prior<iter3>::type iter4;
        typedef iter4 type;
    };

/// ETI workaround
    template<> struct apply<int>
    {
        typedef int type;
    };

};

template< long N >
struct advance_backward
{
    template< typename Iterator > struct apply
    {
        typedef typename apply_wrap1<
              advance_backward<4>
            , Iterator
            >::type chunk_result_;

typedef typename apply_wrap1<
              advance_backward<(
                (N - 4) < 0
                    ? 0
                    : N - 4
                    )>
            , chunk_result_
            >::type type;
    };
};

}}}

// 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_/advance_backward.hpp" header // -- DO NOT modify by hand! namespace boost { namespace mpl { namespace aux { template< long N > struct advance_backward; template<> struct advance_backward<0> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef iter0 type; }; /// ETI workaround template<> struct apply { typedef int type; }; }; template<> struct advance_backward<1> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef iter1 type; }; /// ETI workaround template<> struct apply { typedef int type; }; }; template<> struct advance_backward<2> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef iter2 type; }; /// ETI workaround template<> struct apply { typedef int type; }; }; template<> struct advance_backward<3> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef typename prior::type iter3; typedef iter3 type; }; /// ETI workaround template<> struct apply { typedef int type; }; }; template<> struct advance_backward<4> { template< typename Iterator > struct apply { typedef Iterator iter0; typedef typename prior::type iter1; typedef typename prior::type iter2; typedef typename prior::type iter3; typedef typename prior::type iter4; typedef iter4 type; }; /// ETI workaround template<> struct apply { typedef int type; }; }; template< long N > struct advance_backward { template< typename Iterator > struct apply { typedef typename apply_wrap1< advance_backward<4> , Iterator >::type chunk_result_; typedef typename apply_wrap1< advance_backward<( (N - 4) < 0 ? 0 : N - 4 )> , chunk_result_ >::type type; }; }; }}}