Prototypes | |
static void | down_heap (toplist_t *list) |
static void | up_heap (toplist_t *list, size_t node) |
int | create_toplist (toplist_t **list, size_t length, size_t size, int(*smaller)(const void *, const void *)) |
void | clear_toplist (toplist_t *list) |
void | free_toplist (toplist_t **list) |
int | insert_into_toplist (toplist_t *list, void *element) |
void | go_through_toplist (toplist_t *list, void(*handle)(void *)) |
void * | toplist_elem (toplist_t *list, size_t ind) |
int | compare_toplists (toplist_t *list1, toplist_t *list2) |
static int | _qsort_compare2 (const void *a, const void *b) |
static int | _qsort_compare3 (const void *b, const void *a) |
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 *)) |
Go to the source code of this file.
Variables | |
static int(* | _qsort_compare1 )(const void *, const void *) |
|
static |
Definition at line 55 of file HeapToplist.c.
|
static |
Definition at line 81 of file HeapToplist.c.
int create_toplist | ( | toplist_t ** | list, |
size_t | length, | ||
size_t | size, | ||
int(*)(const void *, const void *) | smaller | ||
) |
Definition at line 101 of file HeapToplist.c.
void clear_toplist | ( | toplist_t * | list | ) |
Definition at line 132 of file HeapToplist.c.
void free_toplist | ( | toplist_t ** | list | ) |
Definition at line 139 of file HeapToplist.c.
Definition at line 151 of file HeapToplist.c.
void go_through_toplist | ( | toplist_t * | list, |
void(*)(void *) | handle | ||
) |
Definition at line 177 of file HeapToplist.c.
void* toplist_elem | ( | toplist_t * | list, |
size_t | ind | ||
) |
Definition at line 185 of file HeapToplist.c.
Definition at line 196 of file HeapToplist.c.
Definition at line 229 of file HeapToplist.c.
Definition at line 234 of file HeapToplist.c.
Definition at line 241 of file HeapToplist.c.
Definition at line 249 of file HeapToplist.c.