2008-08-11 09:30:16 -07:00
|
|
|
/* EINA - EFL data type library
|
|
|
|
* Copyright (C) 2008 Cedric Bail
|
|
|
|
*
|
|
|
|
* This library is free software; you can redistribute it and/or
|
|
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
|
|
* License as published by the Free Software Foundation; either
|
|
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* This library is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
|
* Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
|
|
* License along with this library;
|
|
|
|
* if not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef EINA_ACCESSOR_H__
|
|
|
|
#define EINA_ACCESSOR_H__
|
|
|
|
|
2008-12-08 02:51:51 -08:00
|
|
|
#include "eina_config.h"
|
|
|
|
|
2008-08-11 09:30:16 -07:00
|
|
|
#include "eina_types.h"
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
#include "eina_magic.h"
|
2008-08-11 09:30:16 -07:00
|
|
|
|
2009-06-22 13:03:58 -07:00
|
|
|
/**
|
|
|
|
* @addtogroup Eina_Content_Access_Group Content Access
|
|
|
|
*
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2008-09-07 00:19:19 -07:00
|
|
|
/**
|
|
|
|
* @defgroup Eina_Accessor_Group Accessor Functions
|
|
|
|
*
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @typedef Eina_Accessor
|
|
|
|
* Type for accessors.
|
|
|
|
*/
|
2008-08-11 09:30:16 -07:00
|
|
|
typedef struct _Eina_Accessor Eina_Accessor;
|
|
|
|
|
2010-07-27 19:37:05 -07:00
|
|
|
typedef Eina_Bool (*Eina_Accessor_Get_At_Callback)(Eina_Accessor *it,
|
|
|
|
unsigned int index,
|
|
|
|
void **data);
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
typedef void *(*Eina_Accessor_Get_Container_Callback)(Eina_Accessor *it);
|
|
|
|
typedef void (*Eina_Accessor_Free_Callback)(Eina_Accessor *it);
|
2010-08-11 07:32:30 -07:00
|
|
|
typedef Eina_Bool (*Eina_Accessor_Lock_Callback)(Eina_Accessor *it);
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
|
|
|
|
struct _Eina_Accessor
|
|
|
|
{
|
2010-08-12 23:36:33 -07:00
|
|
|
Eina_Accessor_Get_At_Callback get_at EINA_ARG_NONNULL(1, 3) EINA_WARN_UNUSED_RESULT;
|
|
|
|
Eina_Accessor_Get_Container_Callback get_container EINA_ARG_NONNULL(1) EINA_WARN_UNUSED_RESULT;
|
2010-07-27 19:37:05 -07:00
|
|
|
Eina_Accessor_Free_Callback free EINA_ARG_NONNULL(1);
|
2008-12-05 22:53:14 -08:00
|
|
|
|
2010-08-11 07:32:30 -07:00
|
|
|
Eina_Accessor_Lock_Callback lock EINA_WARN_UNUSED_RESULT;
|
|
|
|
Eina_Accessor_Lock_Callback unlock EINA_WARN_UNUSED_RESULT;
|
|
|
|
|
2008-12-05 22:53:14 -08:00
|
|
|
#define EINA_MAGIC_ACCESSOR 0x98761232
|
* eina/src/include/eina_array.h,
* eina/src/include/eina_f16p16.h,
* eina/src/include/eina_accessor.h,
* eina/src/include/eina_list.h,
* eina/src/include/eina_iterator.h,
* eina/src/lib/eina_rectangle.c,
* eina/src/lib/eina_list.c,
* eina/src/lib/eina_array.c,
* eina/src/lib/eina_hash.c,
* eina/src/lib/eina_module.c,
* eina/src/lib/eina_stringshare.c,
* eina/src/lib/eina_benchmark.c: Fix for windows compilation.
SVN revision: 38663
2009-01-20 07:56:48 -08:00
|
|
|
EINA_MAGIC
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
};
|
|
|
|
|
|
|
|
#define FUNC_ACCESSOR_GET_AT(Function) ((Eina_Accessor_Get_At_Callback)Function)
|
2010-08-12 23:36:33 -07:00
|
|
|
#define FUNC_ACCESSOR_GET_CONTAINER(Function) ((Eina_Accessor_Get_Container_Callback)Function)
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
#define FUNC_ACCESSOR_FREE(Function) ((Eina_Accessor_Free_Callback)Function)
|
2010-08-11 07:32:30 -07:00
|
|
|
#define FUNC_ACCESSOR_LOCK(Function) ((Eina_Accessor_Lock_Callback)Function)
|
Make it possible to create iterators outside Eina.
Many places in EFL we just create walk something, create a list with
walked data, return, then the user walks it again and then deletes
(which will walk again). For such cases it's way better to define
iterators or accessors.
I'm not moving any EFL code to it now, but if people are interested,
things like evas_render_method_list(), evas_font_available_list(),
evas_objects_at_xy_get(), evas_objects_in_rectangle_get(),
evas_object_smart_members_get() are good candidates. If the subject is
already using Eina list, then you can just use
eina_list_iterator_new() and return it, otherwise you can define your
own iterator, which is very easy.
SVN revision: 37956
2008-12-05 19:41:03 -08:00
|
|
|
|
2010-08-12 23:36:33 -07:00
|
|
|
EAPI void eina_accessor_free(Eina_Accessor *accessor) EINA_ARG_NONNULL(1);
|
2010-08-15 23:14:19 -07:00
|
|
|
EAPI Eina_Bool eina_accessor_data_get(Eina_Accessor *accessor,
|
|
|
|
unsigned int position,
|
|
|
|
void **data) EINA_ARG_NONNULL(1);
|
2010-08-12 23:36:33 -07:00
|
|
|
EAPI void * eina_accessor_container_get(Eina_Accessor *accessor) EINA_ARG_NONNULL(1) EINA_PURE;
|
2010-08-15 23:14:19 -07:00
|
|
|
EAPI void eina_accessor_over(Eina_Accessor *accessor,
|
|
|
|
Eina_Each_Cb cb,
|
|
|
|
unsigned int start,
|
|
|
|
unsigned int end,
|
|
|
|
const void *fdata) EINA_ARG_NONNULL(1, 2);
|
2010-08-11 07:32:30 -07:00
|
|
|
EAPI Eina_Bool eina_accessor_lock(Eina_Accessor *accessor) EINA_ARG_NONNULL(1);
|
|
|
|
EAPI Eina_Bool eina_accessor_unlock(Eina_Accessor *accessor) EINA_ARG_NONNULL(1);
|
|
|
|
|
2009-02-27 08:32:22 -08:00
|
|
|
/**
|
|
|
|
* @def EINA_ACCESSOR_FOREACH
|
|
|
|
* @brief Macro to iterate over all elements easily.
|
|
|
|
*
|
|
|
|
* @param accessor The accessor to use.
|
2009-06-22 13:03:58 -07:00
|
|
|
* @param counter A counter used by eina_accessor_data_get() when
|
|
|
|
* iterating over the container.
|
2009-02-27 08:32:22 -08:00
|
|
|
* @param data Where to store * data, must be a pointer support getting
|
2009-06-22 13:03:58 -07:00
|
|
|
* its address since * eina_accessor_data_get() requires a pointer to
|
|
|
|
* pointer!
|
2009-02-27 08:32:22 -08:00
|
|
|
*
|
2009-06-22 13:03:58 -07:00
|
|
|
* This macro allows a convenient way to loop over all elements in an
|
2009-02-27 08:32:22 -08:00
|
|
|
* accessor, very similar to EINA_LIST_FOREACH().
|
|
|
|
*
|
|
|
|
* This macro can be used for freeing the data of a list, like in the
|
|
|
|
* following example. It has the same goal as the one documented in
|
|
|
|
* EINA_LIST_FOREACH(), but using accessors:
|
|
|
|
*
|
|
|
|
* @code
|
|
|
|
* Eina_List *list;
|
|
|
|
* Eina_Accessor *accessor;
|
|
|
|
* unsigned int i;
|
|
|
|
* char *data;
|
|
|
|
*
|
|
|
|
* // list is already filled,
|
|
|
|
* // its elements are just duplicated strings
|
|
|
|
*
|
|
|
|
* accessor = eina_list_accessor_new(list);
|
|
|
|
* EINA_ACCESSOR_FOREACH(accessor, i, data)
|
|
|
|
* free(data);
|
|
|
|
* eina_accessor_free(accessor);
|
|
|
|
* eina_list_free(list);
|
|
|
|
* @endcode
|
|
|
|
*
|
|
|
|
* @note if the datatype provides both iterators and accessors prefer
|
|
|
|
* to use iterators to iterate over, as they're likely to be more
|
|
|
|
* optimized for such task.
|
|
|
|
*
|
|
|
|
* @note this example is not optimal algorithm to release a list since
|
|
|
|
* it will walk the list twice, but it serves as an example. For
|
|
|
|
* optimized version use EINA_LIST_FREE()
|
|
|
|
*
|
|
|
|
* @warning unless explicitly stated in functions returning accessors,
|
|
|
|
* do not modify the accessed object while you walk it, in this
|
|
|
|
* example using lists, do not remove list nodes or you might
|
|
|
|
* crash! This is not a limitiation of accessors themselves,
|
|
|
|
* rather in the accessors implementations to keep them as simple
|
|
|
|
* and fast as possible.
|
|
|
|
*/
|
2010-08-15 22:40:50 -07:00
|
|
|
#define EINA_ACCESSOR_FOREACH(accessor, counter, data) \
|
|
|
|
for ((counter) = 0; \
|
|
|
|
eina_accessor_data_get((accessor), (counter), (void **)&(data)); \
|
|
|
|
(counter)++)
|
2009-02-27 08:32:22 -08:00
|
|
|
|
2009-06-22 13:03:58 -07:00
|
|
|
/**
|
|
|
|
* @}
|
|
|
|
*/
|
|
|
|
|
2008-09-07 00:19:19 -07:00
|
|
|
/**
|
|
|
|
* @}
|
|
|
|
*/
|
|
|
|
|
2008-08-11 09:30:16 -07:00
|
|
|
#endif
|