include/amino/parallel_sort.h File Reference

#include <algorithm>
#include <stdexcept>
#include <assert.h>
#include <amino/aasort.h>
#include <amino/executor.h>
#include <amino/future.h>
#include <amino/ftask.h>

Go to the source code of this file.

Namespaces
namespace	amino
Classes
class	amino::SortTask< _sort, rand_access_iter >
	this class represents a sort task which can be executed by an executor. More...
class	amino::MergerTask< _merger, rand_access_iter >
	this class represents a merge task which can be executed by an executor. The two merger area must be consecutive. More...
Functions
template<typename value_type, typename local_sort, typename merge_sort, typename rand_access_iter, typename ExecutorType>
void	amino::parallel_sort (rand_access_iter start, rand_access_iter end, local_sort _sort, merge_sort _merge, int threadNum, ExecutorType *executor)
	The most common version of parallel sort, which utilize sort and merge inside STL in a parallel approach.
template<typename ExecutorType, typename value_type>
void	amino::parallel_sort (value_type *start, value_type *end, int threadNum, ExecutorType *executor)