* free(data);
* @endcode
*/
-#define EINA_LIST_ITER_NEXT(list, l, data) for (l = list, data = eina_list_data_get(l); l; l = eina_list_next(l), data = eina_list_data_get(l))
+#define EINA_LIST_FOREACH(list, l, data) for (l = list, data = eina_list_data_get(l); l; l = eina_list_next(l), data = eina_list_data_get(l))
#include "eina_inline_list.x"
if (list) EINA_MAGIC_CHECK_LIST(list);
- EINA_LIST_ITER_NEXT(list, l, list_data)
+ EINA_LIST_FOREACH(list, l, list_data)
{
if (list_data == relative)
return eina_list_append_relative_list(list, data, l);
if (list) EINA_MAGIC_CHECK_LIST(list);
- EINA_LIST_ITER_NEXT(list, l, list_data)
+ EINA_LIST_FOREACH(list, l, list_data)
{
if (list_data == relative)
return eina_list_prepend_relative_list(list, data, l);
if (list) EINA_MAGIC_CHECK_LIST(list);
- EINA_LIST_ITER_NEXT(list, l, list_data)
+ EINA_LIST_FOREACH(list, l, list_data)
{
if (list_data == data)
return eina_list_remove_list(list, l);
* extern void *my_data;
* void *data
*
- * EINA_LIST_ITER_NEXT(list, l, data)
+ * EINA_LIST_FOREACH(list, l, data)
* {
* if (data == my_data)
* {
* @return A NULL pointer
*
* This function frees all the nodes of @p list. It does not free the
- * data of the nodes. To free them, use #EINA_LIST_ITER_NEXT.
+ * data of the nodes. To free them, use #EINA_LIST_FOREACH.
*/
EAPI Eina_List *
eina_list_free(Eina_List *list)
* extern void *my_data;
* void *data;
*
- * EINA_LIST_ITER_NEXT(list, l, data)
+ * EINA_LIST_FOREACH(list, l, data)
* {
* if (data == my_data)
* {
if (list) EINA_MAGIC_CHECK_LIST(list);
- EINA_LIST_ITER_NEXT(list, l, list_data)
+ EINA_LIST_FOREACH(list, l, list_data)
{
if (list_data == data) return (Eina_List *)l;
}