code/qsort__r_8h_source.html

#ifndef MUTT_LIB_QSORT_R_H

#define MUTT_LIB_QSORT_R_H


#include <stddef.h>


typedef int (*qsort_r_compar_t)(const void *a, const void *b, void *arg);


void mutt_qsort_r(void *base, size_t nmemb, size_t size, qsort_r_compar_t compar, void *arg);


#endif /* MUTT_LIB_QSORT_R_H */

mutt_qsort_r
void mutt_qsort_r(void *base, size_t nmemb, size_t size, qsort_r_compar_t compar, void *arg)
Sort an array, where the comparator has access to opaque data rather than requiring global variables.
Definition: qsort_r.c:76

qsort_r_compar_t
int(* qsort_r_compar_t)(const void *a, const void *b, void *arg)
Prototype for generic comparison function, compatible with qsort_r()
Definition: qsort_r.h:37