#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.

// $Source: /cvsroot/boost/boost/boost/mpl/aux_/sort_impl.hpp,v $

// $Date: 2004/11/28 01:47:44 $

// $Revision: 1.5 $

#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