#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
|