Mercurial > hg > th-libs

comparison th_datastruct.h @ 754:d91d1174cfd8

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add th_llist_reverse() for reversing a linked list.
author Matti Hamalainen <ccr@tnsp.org>
date Wed, 01 Feb 2023 13:02:35 +0200
parents 64cb2b1777a9
children 2ab2fece83ea
comparison
equal deleted inserted replaced
753:64cb2b1777a9 754:d91d1174cfd8
40 void th_llist_delete_node(th_llist_t **list, th_llist_t *node); 40 void th_llist_delete_node(th_llist_t **list, th_llist_t *node);
41 41
42 th_llist_t * th_llist_get_nth(th_llist_t *list, const size_t n); 42 th_llist_t * th_llist_get_nth(th_llist_t *list, const size_t n);
43 size_t th_llist_length(const th_llist_t *list); 43 size_t th_llist_length(const th_llist_t *list);
44 ssize_t th_llist_position(const th_llist_t *list, const th_llist_t *node); 44 ssize_t th_llist_position(const th_llist_t *list, const th_llist_t *node);
45 void th_llist_reverse(th_llist_t **list);
45 46
46 void th_llist_foreach(th_llist_t *list, void (*func)(th_llist_t *node, void *userdata), void *data); 47 void th_llist_foreach(th_llist_t *list, void (*func)(th_llist_t *node, void *userdata), void *data);
47 int th_llist_foreach_cond(th_llist_t *list, int (*func)(th_llist_t *node, void *userdata), void *data, th_llist_t **res); 48 int th_llist_foreach_cond(th_llist_t *list, int (*func)(th_llist_t *node, void *userdata), void *data, th_llist_t **res);
48 49
49 th_llist_t * th_llist_find_data(th_llist_t *list, const void *data); 50 th_llist_t * th_llist_find_data(th_llist_t *list, const void *data);