template<typename COMPARE = DefaultCompare, BASESORTFLAGS FLAGS = BASESORTFLAGS::NONE>
class maxon::SimpleParallelSort< COMPARE, FLAGS >
Specialized BaseSort template for simple datatypes.
- Template Parameters
-
COMPARE | Class that offers the methods IsEqual and LessThan. |
FLAGS | See BASESORTFLAGS. |
Example:
BaseArray<Int> array;
SimpleParallelSort<>
test;
#define test
Definition: graminit.h:53
or
BaseArray<Int> array2;
SimpleParallelSort<> test2;
test2.Sort(&array2[0], array2.GetCount());
|
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 |
|