code/qsort__r_8h_source.html

#ifndef MUTT_MUTT_QSORT_R_H

#define MUTT_MUTT_QSORT_R_H


#include <stddef.h>


typedef int (*sort_t)(const void *a, const void *b, void *sdata);


void mutt_qsort_r(void *base, size_t nmemb, size_t size, sort_t compar, void *sdata);


#endif /* MUTT_MUTT_QSORT_R_H */

sort_t
int(* sort_t)(const void *a, const void *b, void *sdata)
Definition: qsort_r.h:41

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