comparison th_datastruct.h @ 689:9c61834c191b

Remove th_llist_delete() and th_llist_delete_node() and rename th_llist_delete_node_fast() to th_llist_delete_node().
author Matti Hamalainen <ccr@tnsp.org>
date Mon, 09 Mar 2020 15:20:49 +0200
parents 553db886533e
children 4ca6a3b30fe8
comparison
equal deleted inserted replaced
688:a54298eef91a 689:9c61834c191b
35 35
36 void th_llist_append_node(th_llist_t **list, th_llist_t *node); 36 void th_llist_append_node(th_llist_t **list, th_llist_t *node);
37 th_llist_t * th_llist_append(th_llist_t **list, void *data); 37 th_llist_t * th_llist_append(th_llist_t **list, void *data);
38 void th_llist_prepend_node(th_llist_t **list, th_llist_t *node); 38 void th_llist_prepend_node(th_llist_t **list, th_llist_t *node);
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(th_llist_t **list, const void *data);
41 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);
42 void th_llist_delete_node_fast(th_llist_t **list, th_llist_t *node);
43 41
44 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);
45 size_t th_llist_length(const th_llist_t *list); 43 size_t th_llist_length(const th_llist_t *list);
46 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);
47 45