Prototypes | |
int | create_toplist (toplist_t **list, size_t length, size_t size, int(*smaller)(const void *, const void *)) |
void | free_toplist (toplist_t **list) |
int | insert_into_toplist (toplist_t *list, void *element) |
void | clear_toplist (toplist_t *list) |
void | go_through_toplist (toplist_t *list, void(*handle)(void *)) |
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 *)) |
void * | toplist_elem (toplist_t *list, size_t idx) |
int | compare_toplists (toplist_t *list1, toplist_t *list2) |
Go to the source code of this file.
Data Structures | |
struct | toplist_t |
Macros | |
#define | TEST_FSTAT_TOPLIST_INCLUSION(list, element) ( ( (list)->elems < (list)->length ||( ((list)->smaller) ((const void *)(element),((list)->heap)[0]) < 0) ) ) |
#define TEST_FSTAT_TOPLIST_INCLUSION | ( | list, | |
element | |||
) | ( ( (list)->elems < (list)->length ||( ((list)->smaller) ((const void *)(element),((list)->heap)[0]) < 0) ) ) |
Definition at line 68 of file HeapToplist.h.
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 free_toplist | ( | toplist_t ** | list | ) |
Definition at line 139 of file HeapToplist.c.
Definition at line 151 of file HeapToplist.c.
void clear_toplist | ( | toplist_t * | list | ) |
Definition at line 132 of file HeapToplist.c.
void go_through_toplist | ( | toplist_t * | list, |
void(*)(void *) | handle | ||
) |
Definition at line 177 of file HeapToplist.c.
Definition at line 241 of file HeapToplist.c.
Definition at line 249 of file HeapToplist.c.
void* toplist_elem | ( | toplist_t * | list, |
size_t | idx | ||
) |
Definition at line 185 of file HeapToplist.c.
Definition at line 196 of file HeapToplist.c.