1.1 --- a/src/cx/list.h Fri Oct 08 19:47:31 2021 +0200
1.2 +++ b/src/cx/list.h Sat Oct 09 11:12:48 2021 +0200
1.3 @@ -84,11 +84,6 @@
1.4 size_t (*find)(cx_list_s *list, void *elem);
1.5
1.6 /**
1.7 - * Member function for retrieving the last element.
1.8 - */
1.9 - void *(*last)(cx_list_s *list);
1.10 -
1.11 - /**
1.12 * Member function for sorting the list in place.
1.13 */
1.14 void (*sort)(cx_list_s *list);
1.15 @@ -200,20 +195,6 @@
1.16 }
1.17
1.18 /**
1.19 - * Returns a pointer to the last element of the list.
1.20 - *
1.21 - * This is effectively the same as cxListAt() with \c index=size-1, but
1.22 - * this implementation may be more efficient depending on the list structure
1.23 - * and the conrecte implementation of cxListAt().
1.24 - *
1.25 - * @param list the list
1.26 - * @return a pointer to the last element or \c NULL if the list is empty
1.27 - */
1.28 -static inline void *cxListLast(CxList list) {
1.29 - return list->cl->last(list);
1.30 -}
1.31 -
1.32 -/**
1.33 * Sorts the list in place.
1.34 *
1.35 * \remark The underlying sort algorithm is implementation defined.
