RadixSort32

Navigation

API > API/Runtime > API/Runtime/Core

Overloads

RadixSort32(ValueType __restrict, ValueType __restrict, CountType)

template<typename ValueType, typename CountType>  
void RadixSort32  
(  
    ValueType *__restrict Dst,  
    ValueType *__restrict Src,  
    CountType Num  
)  
Copy full snippet

template<typename ValueType, typename CountType> void RadixSort32 (     ValueType *__restrict Dst,     ValueType *__restrict Src,     CountType Num )

RadixSort32(float __restrict, float __restrict, CountType)

template<typename CountType>  
void RadixSort32  
(  
    float *__restrict Dst,  
    float *__restrict Src,  
    CountType Num  
)  
Copy full snippet

template<typename CountType> void RadixSort32 (     float *__restrict Dst,     float *__restrict Src,     CountType Num )

RadixSort32(ValueType __restrict, ValueType __restrict, CountType, const SortKeyClass &)

Description

Very fast 32bit radix sort. SortKeyClass defines operator() that takes ValueType and returns a uint32. Sorting based on key. No comparisons. Is stable. Use a smaller CountType for smaller histograms.

template<typename ValueType, typename CountType, class SortKeyClass>  
void RadixSort32  
(  
    ValueType *__restrict Dst,  
    ValueType *__restrict Src,  
    CountType Num,  
    const SortKeyClass & SortKey  
)  
Copy full snippet

template<typename ValueType, typename CountType, class SortKeyClass> void RadixSort32 (     ValueType *__restrict Dst,     ValueType *__restrict Src,     CountType Num,     const SortKeyClass & SortKey )