Hello. On 22/09/15 21:41, Thomas Gstädtner wrote: > For this function it makes no sense, that the top list node would be > required. > --- > src/lib/eina/eina_list.h | 12 ------------ > 1 file changed, 12 deletions(-) > > diff --git a/src/lib/eina/eina_list.h b/src/lib/eina/eina_list.h > index e35943e..f713e81 100644 > --- a/src/lib/eina/eina_list.h > +++ b/src/lib/eina/eina_list.h > @@ -1188,8 +1188,6 @@ EAPI void > *eina_list_search_unsorted(const Eina_List *list, Eina > * > * This is a order-1 operation (it takes the same short time > * regardless of the length of the list). > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline Eina_List *eina_list_last(const Eina_List *list) EINA_PURE > EINA_WARN_UNUSED_RESULT; > > @@ -1202,8 +1200,6 @@ static inline Eina_List *eina_list_last(const > Eina_List *list) EINA_PURE EINA_ > * This function returns the next list node after the current one in > * @p list. It is equivalent to list->next. If @p list is @c NULL or > * if no next list node exists, it returns @c NULL. > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline Eina_List *eina_list_next(const Eina_List *list) EINA_PURE > EINA_WARN_UNUSED_RESULT; > > @@ -1217,8 +1213,6 @@ static inline Eina_List *eina_list_next(const > Eina_List *list) EINA_PURE EINA_ > * This function returns the previous list node before the current one > * in @p list. It is equivalent to list->prev. If @p list is @c NULL or > * if no previous list node exists, it returns @c NULL. > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline Eina_List *eina_list_prev(const Eina_List *list) EINA_PURE > EINA_WARN_UNUSED_RESULT; > > @@ -1231,8 +1225,6 @@ static inline Eina_List *eina_list_prev(const > Eina_List *list) EINA_PURE EINA_ > * This function returns the data member of the specified list node @p > * list. It is equivalent to list->data. If @p list is @c NULL, this > * function returns @c NULL. > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline void *eina_list_data_get(const Eina_List *list) > EINA_PURE EINA_WARN_UNUSED_RESULT; > > @@ -1246,8 +1238,6 @@ static inline void *eina_list_data_get(const > Eina_List *list) EINA_PURE E > * This function set the data member @p data of the specified list node > * @p list. It returns the previous data of the node. If @p list is > * @c NULL, this function returns @c NULL. > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline void *eina_list_data_set(Eina_List *list, const void > *data); > > @@ -1262,8 +1252,6 @@ static inline void *eina_list_data_set(Eina_List > *list, const void *data) > * > * NB: This is an order-1 operation and takes the same time regardless > * of the length of the list. > - * > - * @warning @p list must be a pointer to the first element of the list. > */ > static inline unsigned int eina_list_count(const Eina_List *list) EINA_PURE; >
Has this patch been applied? regards Stefan Schmidt ------------------------------------------------------------------------------ _______________________________________________ enlightenment-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/enlightenment-devel
