ꦫꦣꦺꦤ꧀ꦄꦤ꧀ꦠꦱꦺꦤ

PATH: opt / cpanel / ea-ruby27 / src / passenger-release-6.1.2 / src / cxx_supportlib / vendor-modified / boost / mpl / aux_

#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

[-] pop_back_impl.hpp [edit]
[-] logical_op.hpp [edit]
[+] preprocessed
[-] shift_op.hpp [edit]
[-] erase_impl.hpp [edit]
[-] iter_fold_if_impl.hpp [edit]
[+] preprocessor
[-] pop_front_impl.hpp [edit]
[-] contains_impl.hpp [edit]
[-] lambda_no_ctps.hpp [edit]
[-] has_type.hpp [edit]
[-] template_arity_fwd.hpp [edit]
[-] basic_bind.hpp [edit]
[-] msvc_never_true.hpp [edit]
[-] iter_apply.hpp [edit]
[-] numeric_op.hpp [edit]
[-] push_back_impl.hpp [edit]
[-] fold_pred.hpp [edit]
[-] adl_barrier.hpp [edit]
[-] push_front_impl.hpp [edit]
[+] test
[-] fold_impl_body.hpp [edit]
[-] joint_iter.hpp [edit]
[-] size_impl.hpp [edit]
[-] traits_lambda_spec.hpp [edit]
[-] advance_backward.hpp [edit]
[-] transform_iter.hpp [edit]
[-] has_size.hpp [edit]
[-] na.hpp [edit]
[+] config
[-] has_tag.hpp [edit]
[-] apply_1st.hpp [edit]
[-] iter_fold_impl.hpp [edit]
[-] has_rebind.hpp [edit]
[-] na_assert.hpp [edit]
[-] nested_type_wknd.hpp [edit]
[-] iter_push_front.hpp [edit]
[-] begin_end_impl.hpp [edit]
[-] empty_impl.hpp [edit]
[-] ptr_to_ref.hpp [edit]
[-] static_cast.hpp [edit]
[-] single_element_iter.hpp [edit]
[-] count_impl.hpp [edit]
[-] front_impl.hpp [edit]
[-] reverse_iter_fold_impl.hpp [edit]
[-] at_impl.hpp [edit]
[+] ..
[-] lambda_support.hpp [edit]
[-] has_apply.hpp [edit]
[-] arithmetic_op.hpp [edit]
[-] insert_impl.hpp [edit]
[-] advance_forward.hpp [edit]
[-] O1_size_impl.hpp [edit]
[-] reverse_fold_impl.hpp [edit]
[-] arg_typedef.hpp [edit]
[-] na_spec.hpp [edit]
[-] filter_iter.hpp [edit]
[-] arity_spec.hpp [edit]
[-] count_args.hpp [edit]
[-] include_preprocessed.hpp [edit]
[-] fold_impl.hpp [edit]
[-] is_msvc_eti_arg.hpp [edit]
[-] na_fwd.hpp [edit]
[-] msvc_is_class.hpp [edit]
[-] find_if_pred.hpp [edit]
[-] unwrap.hpp [edit]
[-] order_impl.hpp [edit]
[-] fold_op.hpp [edit]
[-] common_name_wknd.hpp [edit]
[-] sequence_wrapper.hpp [edit]
[-] value_wknd.hpp [edit]
[-] template_arity.hpp [edit]
[-] full_lambda.hpp [edit]
[-] largest_int.hpp [edit]
[-] test.hpp [edit]
[-] msvc_eti_base.hpp [edit]
[-] numeric_cast_utils.hpp [edit]
[-] has_key_impl.hpp [edit]
[-] integral_wrapper.hpp [edit]
[-] clear_impl.hpp [edit]
[-] lambda_arity_param.hpp [edit]
[+] range_c
[-] inserter_algorithm.hpp [edit]
[-] arity.hpp [edit]
[-] reverse_fold_impl_body.hpp [edit]
[-] erase_key_impl.hpp [edit]
[-] lambda_spec.hpp [edit]
[-] sort_impl.hpp [edit]
[-] has_begin.hpp [edit]
[-] msvc_dtw.hpp [edit]
[-] comparison_op.hpp [edit]
[-] insert_range_impl.hpp [edit]
[-] overload_names.hpp [edit]
[-] partition_op.hpp [edit]
[-] msvc_type.hpp [edit]
[-] nttp_decl.hpp [edit]
[-] type_wrapper.hpp [edit]
[-] back_impl.hpp [edit]
[-] yes_no.hpp [edit]