Inheritance diagram for ParallelSorter< T >:

Public Member Functions
	ParallelSorter (T *vals, int sz)
Protected Member Functions
od_int64	nrIterations () const
int	minThreadSize () const
bool	doPrepare (int)
bool	doFinish (bool)
bool	doWork (od_int64, od_int64, int)
od_int64	nrDone () const
Static Protected Member Functions
static bool	mergeLists (const T vals, T res, int start0, int start1, int start2, int stop, int &totalsz)
Protected Attributes
T *	vals_
ArrPtrMan< T >	tmpbuffer_
T *	curvals_
T *	buf_
const int	nrvals_
const int	totalnr_
Threads::ConditionVar	condvar_
TypeSet< int >	starts_
TypeSet< int >	newstarts_
Threads::Barrier	barrier_

Detailed Description

template<class T>
class ParallelSorter< T >

Sorting in parallel. Code is still experimental. The basic principle is: 1. Divide samples into subsets. 2. Sort subsets in parallel 3. Merge pairs of subsets iteratively until there are only one subset left.

Constructor & Destructor Documentation

template<class T >

ParallelSorter< T >::ParallelSorter	(	T *	vals,
		int	sz
	)			`[inline]`

Member Function Documentation

template<class T >

bool ParallelSorter< T >::doFinish ( bool success ) [inline, protected, virtual]

Reimplemented from ParallelTask.

template<class T >

bool ParallelSorter< T >::doPrepare ( int nrthreads ) [inline, protected, virtual]

Reimplemented from ParallelTask.

template<class T >

bool ParallelSorter< T >::doWork	(	od_int64	start,
		od_int64	stop,
		int	thread
	)			`[inline, protected]`

template<class T >

bool ParallelSorter< T >::mergeLists	(	const T *	vals,
		T *	res,
		int	start0,
		int	start1,
		int	start2,
		int	stop,
		int &	totalsz
	)			`[inline, static, protected]`