#include <parallelsort.h>
Specialized BaseSort template for simple datatypes.
COMPARE | Class that offers the methods IsEqual and LessThan. |
FLAGS | See BASESORTFLAGS. |
Example:
or
Static Public Member Functions | |
template<typename T1 , typename T2 > | |
static Bool | LessThan (const T1 &a, const T2 &b) |
template<typename T1 , typename T2 > | |
static Bool | IsEqual (const T1 &a, const T2 &b) |
Additional Inherited Members | |
![]() | |
using | Super = BaseSort< SimpleParallelSort< DefaultCompare, BASESORTFLAGS::NONE >, FLAGS > |
![]() | |
void | Sort (ITERATOR start, ITERATOR end, JobQueueInterface *queue=JOBQUEUE_CURRENT) const |
void | Sort (ITERATOR start, Int count, JobQueueInterface *queue=JOBQUEUE_CURRENT) const |
void | Sort (ARRAY &arr, JobQueueInterface *queue=JOBQUEUE_CURRENT) const |
![]() | |
template<typename ITERATOR > | |
void | Sort (ITERATOR start, ITERATOR end) const |
template<typename ITERATOR > | |
void | Sort (ITERATOR start, Int count) const |
template<typename ARRAY > | |
void | Sort (ARRAY &arr) const |
template<typename SEARCHTYPE , typename ITERATOR > | |
Int | FindIndex (const SEARCHTYPE &key, ITERATOR arr, Int count) const |
template<typename SEARCHTYPE , typename ITERATOR > | |
ITERATOR | Find (const SEARCHTYPE &key, ITERATOR arr, Int count) const |
template<typename ARRAY , typename SEARCHTYPE > | |
ARRAY::ValueType * | Find (const SEARCHTYPE &key, const ARRAY &arr) const |
template<typename SEARCHTYPE , typename ITERATOR > | |
ITERATOR | FindInsertionIndex (const SEARCHTYPE &key, ITERATOR arr, Int count, Int &insertionIndex) const |
template<typename ARRAY , typename SEARCHTYPE > | |
ARRAY::ValueType * | FindInsertionIndex (const SEARCHTYPE &key, const ARRAY &arr, Int &insertionIndex) const |
|
static |
|
static |