Simple parallel quick sort implementation with progress tracking. More...
#include <algorithm>#include <cstdint>#include <boost/iterator/iterator_traits.hpp>#include <mutex>#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 | |
| pipelining/factory_base.h Base class of pipelining factories | |
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... | |
Simple parallel quick sort implementation with progress tracking.
Definition in file parallel_sort.h.