FM / aux

/usr/include/boost/mpl/aux_

Name	Size	Mode	Actions
config/	-	0755	rm
preprocessed/	-	0755	rm
preprocessor/	-	0755	rm
range_c/	-	0755	rm
test/	-	0755	rm
adl_barrier.hpp	1559	0644	edit dl rm
advance_backward.hpp	3419	0644	edit dl rm
advance_forward.hpp	3338	0644	edit dl rm
apply_1st.hpp	731	0644	edit dl rm
arg_typedef.hpp	776	0644	edit dl rm
arithmetic_op.hpp	2441	0644	edit dl rm
arity.hpp	1095	0644	edit dl rm
arity_spec.hpp	1832	0644	edit dl rm
at_impl.hpp	1091	0644	edit dl rm
back_impl.hpp	1121	0644	edit dl rm
basic_bind.hpp	550	0644	edit dl rm
begin_end_impl.hpp	2643	0644	edit dl rm
clear_impl.hpp	827	0644	edit dl rm
common_name_wknd.hpp	877	0644	edit dl rm
comparison_op.hpp	2153	0644	edit dl rm
contains_impl.hpp	1572	0644	edit dl rm
count_args.hpp	2937	0644	edit dl rm
count_impl.hpp	1175	0644	edit dl rm
empty_impl.hpp	1059	0644	edit dl rm
erase_impl.hpp	1767	0644	edit dl rm
erase_key_impl.hpp	749	0644	edit dl rm
filter_iter.hpp	3017	0644	edit dl rm
find_if_pred.hpp	756	0644	edit dl rm
fold_impl.hpp	1271	0644	edit dl rm
fold_impl_body.hpp	8944	0644	edit dl rm
fold_op.hpp	822	0644	edit dl rm
fold_pred.hpp	764	0644	edit dl rm
front_impl.hpp	1032	0644	edit dl rm
full_lambda.hpp	8796	0644	edit dl rm
has_apply.hpp	767	0644	edit dl rm
has_begin.hpp	580	0644	edit dl rm
has_key_impl.hpp	856	0644	edit dl rm
has_rebind.hpp	2571	0644	edit dl rm
has_size.hpp	553	0644	edit dl rm
has_tag.hpp	571	0644	edit dl rm
has_type.hpp	575	0644	edit dl rm
include_preprocessed.hpp	1333	0644	edit dl rm
inserter_algorithm.hpp	4816	0644	edit dl rm
insert_impl.hpp	1714	0644	edit dl rm
insert_range_impl.hpp	2225	0644	edit dl rm
integral_wrapper.hpp	3521	0644	edit dl rm
is_msvc_eti_arg.hpp	1318	0644	edit dl rm
iter_apply.hpp	902	0644	edit dl rm
iter_fold_if_impl.hpp	5848	0644	edit dl rm
iter_fold_impl.hpp	1240	0644	edit dl rm
iter_push_front.hpp	771	0644	edit dl rm
joint_iter.hpp	2877	0644	edit dl rm
lambda_arity_param.hpp	696	0644	edit dl rm
lambda_no_ctps.hpp	4941	0644	edit dl rm
lambda_spec.hpp	1214	0644	edit dl rm
lambda_support.hpp	5366	0644	edit dl rm
largest_int.hpp	1979	0644	edit dl rm
logical_op.hpp	4535	0644	edit dl rm
msvc_dtw.hpp	1742	0644	edit dl rm
msvc_eti_base.hpp	1668	0644	edit dl rm
msvc_is_class.hpp	1485	0644	edit dl rm
msvc_never_true.hpp	743	0644	edit dl rm
msvc_type.hpp	1207	0644	edit dl rm
na.hpp	1645	0644	edit dl rm
na_assert.hpp	958	0644	edit dl rm
na_fwd.hpp	673	0644	edit dl rm
na_spec.hpp	4449	0644	edit dl rm
nested_type_wknd.hpp	1266	0644	edit dl rm
nttp_decl.hpp	844	0644	edit dl rm
numeric_cast_utils.hpp	1763	0644	edit dl rm
numeric_op.hpp	8489	0644	edit dl rm
O1_size_impl.hpp	2104	0644	edit dl rm
order_impl.hpp	2044	0644	edit dl rm
overload_names.hpp	2029	0644	edit dl rm
partition_op.hpp	1390	0644	edit dl rm
pop_back_impl.hpp	804	0644	edit dl rm
pop_front_impl.hpp	1078	0644	edit dl rm
ptr_to_ref.hpp	1095	0644	edit dl rm
push_back_impl.hpp	2071	0644	edit dl rm
push_front_impl.hpp	2092	0644	edit dl rm
reverse_fold_impl.hpp	1384	0644	edit dl rm
reverse_fold_impl_body.hpp	10599	0644	edit dl rm
reverse_iter_fold_impl.hpp	1356	0644	edit dl rm
sequence_wrapper.hpp	8170	0644	edit dl rm
shift_op.hpp	2246	0644	edit dl rm
single_element_iter.hpp	2789	0644	edit dl rm
size_impl.hpp	1324	0644	edit dl rm
sort_impl.hpp	2877	0644	edit dl rm
static_cast.hpp	770	0644	edit dl rm
template_arity.hpp	4735	0644	edit dl rm
template_arity_fwd.hpp	563	0644	edit dl rm
test.hpp	729	0644	edit dl rm
traits_lambda_spec.hpp	1569	0644	edit dl rm
transform_iter.hpp	2636	0644	edit dl rm
type_wrapper.hpp	1181	0644	edit dl rm
unwrap.hpp	929	0644	edit dl rm
value_wknd.hpp	2029	0644	edit dl rm
yes_no.hpp	1180	0644	edit dl rm

Edit: /usr/include/boost/mpl/aux_/sort_impl.hpp (2877B)

#ifndef BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED
#define BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED

// Copyright Eric Friedman 2002-2003
//
// 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)
//
// See http://www.boost.org/libs/mpl for documentation.

// $Id$
// $Date$
// $Revision$

#include <boost/mpl/partition.hpp>
#include <boost/mpl/copy.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/mpl/back_inserter.hpp>
#include <boost/mpl/front_inserter.hpp>
#include <boost/mpl/iterator_range.hpp>
#include <boost/mpl/joint_view.hpp>
#include <boost/mpl/single_view.hpp>
#include <boost/mpl/begin_end.hpp>
#include <boost/mpl/empty.hpp>
#include <boost/mpl/deref.hpp>
#include <boost/mpl/eval_if.hpp>
#include <boost/mpl/apply.hpp>
#include <boost/mpl/identity.hpp>
#include <boost/mpl/less.hpp>
#include <boost/mpl/aux_/na.hpp>

namespace boost { namespace mpl { namespace aux {

template< typename Seq, typename Pred >
struct quick_sort;

// agurt, 10/nov/04: for the sake of deficeint compilers 
template< typename Pred, typename Pivot >
struct quick_sort_pred
{
    template< typename T > struct apply
    {
        typedef typename apply2<Pred,T,Pivot>::type type;
    };
};

template< 
      typename Seq
    , typename Pred
    >
struct quick_sort_impl
{
    typedef typename begin<Seq>::type pivot;
    typedef typename partition<
          iterator_range< 
              typename next<pivot>::type
            , typename end<Seq>::type
            >
        , protect< aux::quick_sort_pred< Pred, typename deref<pivot>::type > >
        , back_inserter< vector<> >
        , back_inserter< vector<> >
        >::type partitioned;

typedef typename quick_sort< typename partitioned::first, Pred >::type part1;
    typedef typename quick_sort< typename partitioned::second, Pred >::type part2;

typedef joint_view< 
              joint_view< part1, single_view< typename deref<pivot>::type > >
            , part2
            > type;
};

template< 
      typename Seq
    , typename Pred
    >
struct quick_sort
    : eval_if<
          empty<Seq>
        , identity<Seq>
        , quick_sort_impl<Seq,Pred>
        >
{
};

template <
      typename Sequence
    , typename Pred
    , typename In
    >
struct sort_impl
{
    typedef typename quick_sort< 
          Sequence
        , typename if_na<Pred,less<> >::type
        >::type result_;
        
    typedef typename copy<result_,In>::type type;
};

template <
      typename Sequence
    , typename Pred
    , typename In
    >
struct reverse_sort_impl
{
    typedef typename quick_sort< 
          Sequence
        , typename if_na<Pred,less<> >::type
        >::type result_;
        
    typedef typename reverse_copy<result_,In>::type type;
};

}}}

#endif // BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED

#ifndef BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED #define BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED // Copyright Eric Friedman 2002-2003 // // 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) // // See http://www.boost.org/libs/mpl for documentation. // $Id$ // $Date$ // $Revision$ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include namespace boost { namespace mpl { namespace aux { template< typename Seq, typename Pred > struct quick_sort; // agurt, 10/nov/04: for the sake of deficeint compilers template< typename Pred, typename Pivot > struct quick_sort_pred { template< typename T > struct apply { typedef typename apply2::type type; }; }; template< typename Seq , typename Pred > struct quick_sort_impl { typedef typename begin::type pivot; typedef typename partition< iterator_range< typename next::type , typename end::type > , protect< aux::quick_sort_pred< Pred, typename deref::type > > , back_inserter< vector<> > , back_inserter< vector<> > >::type partitioned; typedef typename quick_sort< typename partitioned::first, Pred >::type part1; typedef typename quick_sort< typename partitioned::second, Pred >::type part2; typedef joint_view< joint_view< part1, single_view< typename deref::type > > , part2 > type; }; template< typename Seq , typename Pred > struct quick_sort : eval_if< empty , identity , quick_sort_impl > { }; template < typename Sequence , typename Pred , typename In > struct sort_impl { typedef typename quick_sort< Sequence , typename if_na >::type >::type result_; typedef typename copy::type type; }; template < typename Sequence , typename Pred , typename In > struct reverse_sort_impl { typedef typename quick_sort< Sequence , typename if_na >::type >::type result_; typedef typename reverse_copy::type type; }; }}} #endif // BOOST_MPL_AUX_SORT_IMPL_HPP_INCLUDED