29#include <lal/HeapToplist.h>
33static int smaller(
const void *
a,
const void *b )
37 }
else if ( *( (
const elem_t * )
a ) > *( (
const elem_t * )b ) ) {
46 printf(
"%f ", *( (
elem_t * )
e ) );
49int main(
int argc,
char **argv )
68 for (
i = 0;
i <
n;
i++ ) {
69 elem = rand() / ( double )RAND_MAX;
int create_toplist(toplist_t **list, size_t length, size_t size, int(*smaller)(const void *, const void *))
void free_toplist(toplist_t **list)
void qsort_toplist(toplist_t *list, int(*compare)(const void *, const void *))
void qsort_toplist_r(toplist_t *list, int(*compare)(const void *, const void *))
int insert_into_toplist(toplist_t *list, void *element)
void go_through_toplist(toplist_t *list, void(*handle)(void *))
int main(int argc, char **argv)
static void print_elem(void *e)
static int smaller(const void *a, const void *b)