31 #ifndef GWEN_DUMMY_EMPTY_ARG
34 # define GWEN_DUMMY_EMPTY_ARG
255 #define GWEN_LIST_ELEMENT(t) \
256 GWEN_LIST1_ELEMENT *_list1_element;
264 #define GWEN_LIST_FUNCTION_LIB_DEFS_CONST(t, pr, decl) \
266 typedef struct t##_LIST t##_LIST; \
267 typedef int GWENHYWFAR_CB (*t##_LIST_SORT_FN)(const t *a, const t *b, int ascending); \
268 typedef t* (t##_LIST_FOREACH)(t *element, void *user_data); \
271 decl t* pr##_List_First(const t##_LIST *l); \
272 decl t* pr##_List_Last(const t##_LIST *l); \
273 decl t* pr##_List_Next(const t *element); \
274 decl t* pr##_List_Previous(const t *element); \
275 decl uint32_t pr##_List_GetCount(const t##_LIST *l); \
276 decl int pr##_List_HasElement(const t##_LIST *l, const t *element); \
277 decl t##_LIST_SORT_FN pr##_List_SetSortFn(t##_LIST *l, t##_LIST_SORT_FN fn); \
278 decl void pr##_List_Sort(t##_LIST *l, int ascending); \
279 decl t* pr##_List_ForEach(t##_LIST *l, t##_LIST_FOREACH fn, void *user_data);
282 #define GWEN_LIST_FUNCTION_LIB_DEFS_NOCONST(t, pr, decl) \
283 typedef GWEN_LIST1_ELEMENT t##_LIST_ELEMENT; \
285 decl void pr##_List_Clear(t##_LIST *l); \
286 decl t##_LIST* pr##_List_new(); \
287 decl void pr##_List_free(t##_LIST *l); \
288 decl int pr##_List_AddList(t##_LIST *dst, t##_LIST *l); \
289 decl int pr##_List_Add(t *element, t##_LIST *list); \
290 decl int pr##_List_Insert(t *element, t##_LIST *list); \
291 decl int pr##_List_Del(t *element);
294 #define GWEN_LIST_FUNCTION_DEFS_CONST(t, pr) \
295 GWEN_LIST_FUNCTION_LIB_DEFS_CONST(t, pr, GWEN_DUMMY_EMPTY_ARG)
297 #define GWEN_LIST_FUNCTION_DEFS_NOCONST(t, pr) \
298 GWEN_LIST_FUNCTION_LIB_DEFS_NOCONST(t, pr, GWEN_DUMMY_EMPTY_ARG)
349 #define GWEN_LIST_FUNCTION_LIB_DEFS(t, pr, decl) \
350 GWEN_LIST_FUNCTION_LIB_DEFS_CONST(t, pr, decl) \
351 GWEN_LIST_FUNCTION_LIB_DEFS_NOCONST(t, pr, decl)
358 #define GWEN_LIST_FUNCTION_DEFS(t, pr) \
359 GWEN_LIST_FUNCTION_LIB_DEFS(t, pr, GWEN_DUMMY_EMPTY_ARG)
367 #define GWEN_LIST_FUNCTIONS(t, pr) \
369 int pr##_List_Add(t *element, t##_LIST *l) { \
370 return GWEN_List1_Add((GWEN_LIST1*)l, element->_list1_element); \
373 int pr##_List_AddList(t##_LIST *dst, t##_LIST *l) { \
374 return GWEN_List1_AddList((GWEN_LIST1*)dst, (GWEN_LIST1*)l); \
377 int pr##_List_Insert(t *element, t##_LIST *l) { \
378 return GWEN_List1_Insert((GWEN_LIST1*)l, element->_list1_element); \
381 int pr##_List_Del(t *element){ \
382 return GWEN_List1_Del(element->_list1_element); \
385 t* pr##_List_First(const t##_LIST *l) { \
386 if (l) return (t*)GWEN_List1_GetFirst((GWEN_LIST1*)l);\
390 t* pr##_List_Last(const t##_LIST *l) { \
391 if (l) return (t*) GWEN_List1_GetLast((GWEN_LIST1*)l);\
395 void pr##_List_Clear(t##_LIST *l) { \
397 while( (el=(t*) GWEN_List1_GetFirst((GWEN_LIST1*)l)) ) {\
403 int pr##_List_HasElement(const t##_LIST *l, const t *element) { \
405 el=(t*)GWEN_List1_GetFirst((GWEN_LIST1*)l); \
409 el=(const t*)GWEN_List1Element_GetNext(el->_list1_element); \
414 t##_LIST* pr##_List_new(){\
415 return (t##_LIST*)GWEN_List1_new(); \
418 void pr##_List_free(t##_LIST *l) {\
421 GWEN_List1_free((GWEN_LIST1*)l); \
425 t* pr##_List_Next(const t *element) { \
426 return (t*)GWEN_List1Element_GetNext(element->_list1_element);\
429 t* pr##_List_Previous(const t *element) { \
430 return (t*)GWEN_List1Element_GetPrevious(element->_list1_element);\
433 uint32_t pr##_List_GetCount(const t##_LIST *l){\
434 return GWEN_List1_GetCount((GWEN_LIST1*)l);\
437 t##_LIST_SORT_FN pr##_List_SetSortFn(t##_LIST *l, t##_LIST_SORT_FN fn) { \
438 return (t##_LIST_SORT_FN) GWEN_List1_SetSortFn((GWEN_LIST1*)l, (GWEN_LIST1_SORT_FN) fn); \
441 void pr##_List_Sort(t##_LIST *l, int ascending){\
442 GWEN_List1_Sort((GWEN_LIST1*)l, ascending);\
445 t* pr##_List_ForEach(t##_LIST *l, t##_LIST_FOREACH fn, void *user_data){ \
449 el=pr##_List_First(l); \
452 elReturned=fn(el, user_data); \
456 el=pr##_List_Next(el); \
466 #define GWEN_LIST_INIT(t, element) \
467 element->_list1_element=GWEN_List1Element_new(element);
475 #define GWEN_LIST_FINI(t, element) \
476 if (element && element->_list1_element) { \
477 GWEN_List1Element_free(element->_list1_element); \
478 element->_list1_element=0; \
GWENHYWFAR_API void * GWEN_List1_GetLast(const GWEN_LIST1 *l)
GWENHYWFAR_API void * GWEN_List1Element_GetNext(const GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API void GWEN_List1_free(GWEN_LIST1 *l)
GWENHYWFAR_API GWEN_LIST1_ELEMENT * GWEN_List1Element_new(void *d)
GWENHYWFAR_API int GWEN_List1_Insert(GWEN_LIST1 *l, GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API int GWEN_List1_AddList(GWEN_LIST1 *dest, GWEN_LIST1 *l)
GWENHYWFAR_API int GWEN_List1_Del(GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API void * GWEN_List1Element_GetPrevious(const GWEN_LIST1_ELEMENT *el)
int GWENHYWFAR_CB(* GWEN_LIST1_SORT_FN)(const void *a, const void *b, int ascending)
GWENHYWFAR_API int GWEN_List1_GetCount(const GWEN_LIST1 *l)
struct GWEN_LIST1 GWEN_LIST1
GWENHYWFAR_API int GWEN_List1_Add(GWEN_LIST1 *l, GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API GWEN_LIST1 * GWEN_List1_new(void)
GWENHYWFAR_API GWEN_LIST1_SORT_FN GWEN_List1_SetSortFn(GWEN_LIST1 *l, GWEN_LIST1_SORT_FN fn)
GWENHYWFAR_API void GWEN_List1_Sort(GWEN_LIST1 *l, int ascending)
GWENHYWFAR_API void * GWEN_List1Element_GetData(const GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API void GWEN_List1Element_free(GWEN_LIST1_ELEMENT *el)
GWENHYWFAR_API void * GWEN_List1_GetFirst(const GWEN_LIST1 *l)
struct GWEN_LIST1_ELEMENT GWEN_LIST1_ELEMENT