#include <parallelsort.h>
|
template<typename SORTCLASS , typename SOURCEITERATOR , typename DESTITERATOR , typename HELPER > |
void | ExecuteMerge (const SORTCLASS &sort, SOURCEITERATOR source, DESTITERATOR destination, const HELPER &helper) const |
|
template<typename SORTCLASS , typename ITERATOR > |
void | Split (const SORTCLASS &sort, ITERATOR arr, BaseArray< MergeSegment > &seg, Int &segments) const |
|
Bool | Init (Int block, Int chunksize, Int count) |
|
|
template<typename SORTCLASS , typename TYPE , typename ITERATOR > |
TYPE * | FindMergeInsertionIndex (const SORTCLASS &sort, const TYPE &key, ITERATOR arr, Int count, Int &insertionIndex) const |
|
◆ ExecuteMerge()
void ExecuteMerge |
( |
const SORTCLASS & |
sort, |
|
|
SOURCEITERATOR |
source, |
|
|
DESTITERATOR |
destination, |
|
|
const HELPER & |
helper |
|
) |
| const |
◆ Split()
◆ Init()
◆ FindMergeInsertionIndex()
TYPE * FindMergeInsertionIndex |
( |
const SORTCLASS & |
sort, |
|
|
const TYPE & |
key, |
|
|
ITERATOR |
arr, |
|
|
Int |
count, |
|
|
Int & |
insertionIndex |
|
) |
| const |
|
private |
◆ _a
◆ _b
◆ _destOffset
◆ maximumSplits
◆ maximumSegmentsPerSplit
const Int maximumSegmentsPerSplit |
|
static |