Mercurial > hg > th-libs

comparison th_datastruct.h @ 757:2ab2fece83ea

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Add th_llist_length_slow().
author Matti Hamalainen <ccr@tnsp.org>
date Wed, 01 Feb 2023 14:09:25 +0200
parents d91d1174cfd8
children 618c7fa3a4f8
comparison
equal deleted inserted replaced
756:4bd82aca5e98 757:2ab2fece83ea
39 th_llist_t * th_llist_prepend(th_llist_t **list, void *data); 39 th_llist_t * th_llist_prepend(th_llist_t **list, void *data);
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 size_t th_llist_length_slow(const th_llist_t *list);
44 ssize_t th_llist_position(const th_llist_t *list, const th_llist_t *node); 45 ssize_t th_llist_position(const th_llist_t *list, const th_llist_t *node);
45 void th_llist_reverse(th_llist_t **list); 46 void th_llist_reverse(th_llist_t **list);
46 47
47 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);
48 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);