TPIE

v1.1rc1-6-g0c97303
parallel_sort.h File Reference

Simple parallel quick sort implementation with progress tracking. More...

#include <algorithm>
#include <boost/bind.hpp>
#include <boost/cstdint.hpp>
#include <boost/iterator/iterator_traits.hpp>
#include <boost/thread/mutex.hpp>
#include <boost/thread/thread.hpp>
#include <cmath>
#include <functional>
#include <tpie/progress_indicator_base.h>
#include <tpie/dummy_progress.h>
#include <tpie/internal_queue.h>
#include <tpie/job.h>
#include <tpie/config.h>

Go to the source code of this file.

Classes

class  tpie::parallel_sort_impl< iterator_type, comp_type, Progress, min_size >
 A simple parallel sort implementation with progress tracking. More...
 
class  tpie::parallel_sort_impl< iterator_type, comp_type, Progress, min_size >::qsort_job
 Represents quick sort work at a given level. More...
 

Namespaces

 tpie
 TPIE's namespace.
 

Functions

template<bool Progress, typename iterator_type , typename comp_type >
void tpie::parallel_sort (iterator_type a, iterator_type b, typename tpie::progress_types< Progress >::base &pi, comp_type comp=std::less< typename boost::iterator_value< iterator_type >::type >())
 Sort items in the range [a,b) using a parallel quick sort. More...
 
template<typename iterator_type , typename comp_type >
void tpie::parallel_sort (iterator_type a, iterator_type b, comp_type comp=std::less< typename boost::iterator_value< iterator_type >::type >())
 Sort items in the range [a,b) using a parallel quick sort. More...
 

Detailed Description

Simple parallel quick sort implementation with progress tracking.

Definition in file parallel_sort.h.