comparison th_datastruct.h @ 762:6d3632306728

Reorder.
author Matti Hamalainen <ccr@tnsp.org>
date Sun, 05 Feb 2023 19:41:05 +0200
parents 618c7fa3a4f8
children
comparison
equal deleted inserted replaced
761:2263dd13cf2d 762:6d3632306728
46 void th_llist_reverse(th_llist_t **list); 46 void th_llist_reverse(th_llist_t **list);
47 47
48 void th_llist_foreach(th_llist_t *list, void (*func)(th_llist_t *node, void *userdata), void *data); 48 void th_llist_foreach(th_llist_t *list, void (*func)(th_llist_t *node, void *userdata), void *data);
49 int th_llist_foreach_cond(th_llist_t *list, int (*func)(th_llist_t *node, void *userdata), void *data, th_llist_t **res); 49 int th_llist_foreach_cond(th_llist_t *list, int (*func)(th_llist_t *node, void *userdata), void *data, th_llist_t **res);
50 50
51 th_llist_t * th_llist_find_func(th_llist_t *list, const void *userdata, int (compare)(const void *, const void *));
51 th_llist_t * th_llist_find_data(th_llist_t *list, const void *data); 52 th_llist_t * th_llist_find_data(th_llist_t *list, const void *data);
52 th_llist_t * th_llist_find_func(th_llist_t *list, const void *userdata, int (compare)(const void *, const void *));
53 53
54 void th_llist_mergesort(th_llist_t **list, 54 void th_llist_mergesort(th_llist_t **list,
55 int (compare)(const th_llist_t *lnode, const th_llist_t *rnode, void *userdata), 55 int (compare)(const th_llist_t *lnode, const th_llist_t *rnode, void *userdata),
56 void *userdata); 56 void *userdata);
57 57