28#ifndef SAF_SORT_H_INCLUDED
29#define SAF_SORT_H_INCLUDED
50void sorti(
int* in_vec,
69void sortf(
float* in_vec,
86void sortd(
double* in_vec,
103void sortc(float_complex* in_vec,
104 float_complex* out_vec,
122void sortz(double_complex* in_vec,
123 double_complex* out_vec,
142 double_complex* out_vec,
188 float* target_dirs_xyz,
191 float* dirs_xyz_closest,
void sortf(float *in_vec, float *out_vec, int *new_indices, int len, int descendFLAG)
Sort a vector of floating-point values into ascending/decending order (optionally returning the new i...
void cmplxPairUp(double_complex *in_vec, double_complex *out_vec, int len)
Pairs up complex numbers and sorts them in ascending order based on their real parts first,...
void sortd(double *in_vec, double *out_vec, int *new_indices, int len, int descendFLAG)
Sort a vector of double floating-point values into ascending/decending order (optionally returning th...
void sortc(float_complex *in_vec, float_complex *out_vec, int len, int descendFLAG)
Sort a vector of complex floating-point values into ascending/decending order.
void sortz(double_complex *in_vec, double_complex *out_vec, int len, int descendFLAG)
Sort a vector of complex double floating-point values into ascending/ decending order.
void sorti(int *in_vec, int *out_vec, int *new_indices, int len, int descendFLAG)
Sort a vector of integer values into ascending/decending order (optionally returning the new indices ...
void findClosestGridPointsCartesian(float *grid_dirs_xyz, int nGrid, float *target_dirs_xyz, int nTarget, int *idx_closest, float *dirs_xyz_closest, float *angle_diff)
Finds indicies into "grid_dirs_xyz" that are the closest to "target dirs_xyz".
void findClosestGridPoints(float *grid_dirs, int nGrid, float *target_dirs, int nTarget, int degFLAG, int *idx_closest, float *dirs_closest, float *angle_diff)
Finds indicies into "grid_dirs" that are the closest to "target dirs".