text: 
  #ifndef POTHOS_MPL_AUX_SORT_IMPL_HPP_INCLUDED
  #define POTHOS_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: sort_impl.hpp 49267 2008-10-11 06:19:02Z agurtovoy $
  // $Date: 2008-10-10 23:19:02 -0700 (Fri, 10 Oct 2008) $
  // $Revision: 49267 $
  
  #include <Pothos/serialization/impl/mpl/partition.hpp>
  #include <Pothos/serialization/impl/mpl/copy.hpp>
  #include <Pothos/serialization/impl/mpl/vector.hpp>
  #include <Pothos/serialization/impl/mpl/back_inserter.hpp>
  #include <Pothos/serialization/impl/mpl/front_inserter.hpp>
  #include <Pothos/serialization/impl/mpl/iterator_range.hpp>
  #include <Pothos/serialization/impl/mpl/joint_view.hpp>
  #include <Pothos/serialization/impl/mpl/single_view.hpp>
  #include <Pothos/serialization/impl/mpl/begin_end.hpp>
  #include <Pothos/serialization/impl/mpl/empty.hpp>
  #include <Pothos/serialization/impl/mpl/deref.hpp>
  #include <Pothos/serialization/impl/mpl/eval_if.hpp>
  #include <Pothos/serialization/impl/mpl/apply.hpp>
  #include <Pothos/serialization/impl/mpl/identity.hpp>
  #include <Pothos/serialization/impl/mpl/less.hpp>
  #include <Pothos/serialization/impl/mpl/aux_/na.hpp>
  
  namespace Pothos { 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
  