QuickRank
v2.0
QuickRank: A C++ suite of Learning to Rank algorithms
|
#include "utils/radix.h"
Functions | |
unsigned int | flip (unsigned int x) |
flip a float for sorting: if it's negative, it flips all bits otherwise flips the sign only More... | |
unsigned int | iflip (unsigned int x) |
flip a float back (invert flip) More... | |
std::unique_ptr< size_t[]> | idx_radixsort (float const *fvalues, const size_t nvalues) |
unsigned int * | idxfloat_radixsort (float const *fvalues, const unsigned int nvalues) |
template<sortorder const order> | |
void | float_radixsort (float *fvalues, const unsigned int nvalues) |
template<sortorder const order> | |
float * | copyextfloat_radixsort (float const *extvalues, float const *fvalues, const unsigned int nvalues) |
float* copyextfloat_radixsort | ( | float const * | extvalues, |
float const * | fvalues, | ||
const unsigned int | nvalues | ||
) |
sort an array of float values with respect to another one without modifing the input array and returning permuted indexes of the sorted items
extvalues | input float array |
fvalues | input float array |
nvalues | length of fvalues |
|
inline |
flip a float for sorting: if it's negative, it flips all bits otherwise flips the sign only
void float_radixsort | ( | float * | fvalues, |
const unsigned int | nvalues | ||
) |
sort an array of float values
fvalues | input float array |
nvalues | length of fvalues |
std::unique_ptr<size_t[]> idx_radixsort | ( | float const * | fvalues, |
const size_t | nvalues | ||
) |
unsigned int* idxfloat_radixsort | ( | float const * | fvalues, |
const unsigned int | nvalues | ||
) |
sort an array of float values without modifing the input array and returning permuted indexes of the sorted items
fvalues | input float array |
nvalues | length of fvalues |
|
inline |
flip a float back (invert flip)