1 /* EINA - EFL data type library
2 * Copyright (C) 2008 Cedric Bail
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library;
16 * if not, see <http://www.gnu.org/licenses/>.
25 #include "eina_suite.h"
29 eina_iterator_array_check(__UNUSED__ const Eina_Array *array,
30 int *data, int *fdata)
32 fail_if(*fdata > *data);
38 START_TEST(eina_iterator_array_simple)
47 ea = eina_array_new(11);
50 for (i = 0; i < 200; ++i)
52 tmp = malloc(sizeof(int));
56 eina_array_push(ea, tmp);
59 it = eina_array_iterator_new(ea);
63 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_array_check), &i);
66 fail_if(eina_iterator_container_get(it) != ea);
67 fail_if(eina_iterator_next(it, (void **)&tmp) != EINA_FALSE);
69 eina_iterator_free(it);
78 eina_iterator_hash_key_check(const Eina_Hash *hash,
80 __UNUSED__ void *fdata)
82 fail_if(eina_hash_find(hash, key) == NULL);
87 eina_iterator_hash_data_check(const Eina_Hash *hash,
89 __UNUSED__ void *fdata)
93 snprintf(tmp, 10, "%i", *data);
94 fail_if(eina_hash_find(hash, tmp) != data);
99 eina_iterator_hash_tuple_check(__UNUSED__ const Eina_Hash *hash,
100 Eina_Hash_Tuple *tuple,
101 __UNUSED__ void *fdata)
103 fail_if(atoi((char *)tuple->key) != *((int *)tuple->data));
108 START_TEST(eina_iterator_hash_simple)
112 int array[] = { 1, 42, 7, 8, 6 };
116 hash = eina_hash_string_superfast_new(NULL);
117 fail_if(hash == NULL);
119 fail_if(eina_hash_add(hash, "1", &array[0]) != EINA_TRUE);
120 fail_if(eina_hash_add(hash, "42", &array[1]) != EINA_TRUE);
121 fail_if(eina_hash_add(hash, "7", &array[2]) != EINA_TRUE);
122 fail_if(eina_hash_add(hash, "8", &array[3]) != EINA_TRUE);
123 fail_if(eina_hash_add(hash, "6", &array[4]) != EINA_TRUE);
125 it = eina_hash_iterator_key_new(hash);
126 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_hash_key_check), NULL);
127 eina_iterator_free(it);
129 it = eina_hash_iterator_data_new(hash);
130 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_hash_data_check), NULL);
131 eina_iterator_free(it);
133 it = eina_hash_iterator_tuple_new(hash);
134 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_hash_tuple_check), NULL);
135 eina_iterator_free(it);
137 eina_hash_free(hash);
143 typedef struct _Eina_Test_Inlist Eina_Test_Inlist;
144 struct _Eina_Test_Inlist
150 static Eina_Test_Inlist *
151 _eina_test_inlist_build(int i)
153 Eina_Test_Inlist *tmp;
155 tmp = malloc(sizeof(Eina_Test_Inlist));
163 eina_iterator_inlist_data_check(__UNUSED__ const Eina_Inlist *in_list,
164 Eina_Test_Inlist *data,
169 case 0: fail_if(data->i != 27); break;
171 case 1: fail_if(data->i != 42); break;
173 case 2: fail_if(data->i != 3227); break;
175 case 3: fail_if(data->i != 1664); break;
177 case 4: fail_if(data->i != 81); break;
185 START_TEST(eina_iterator_inlist_simple)
187 Eina_Inlist *lst = NULL;
188 Eina_Test_Inlist *tmp;
189 Eina_Test_Inlist *prev;
193 tmp = _eina_test_inlist_build(42);
194 lst = eina_inlist_append(lst, EINA_INLIST_GET(tmp));
197 tmp = _eina_test_inlist_build(1664);
198 lst = eina_inlist_append_relative(lst, EINA_INLIST_GET(tmp), lst);
200 fail_if(((Eina_Test_Inlist *)lst)->i != 42);
203 tmp = _eina_test_inlist_build(3227);
204 lst = eina_inlist_prepend_relative(lst, EINA_INLIST_GET(
205 tmp), EINA_INLIST_GET(prev));
207 fail_if(((Eina_Test_Inlist *)lst)->i != 42);
209 tmp = _eina_test_inlist_build(27);
210 lst = eina_inlist_prepend_relative(lst, EINA_INLIST_GET(tmp), NULL);
212 tmp = _eina_test_inlist_build(81);
213 lst = eina_inlist_append_relative(lst, EINA_INLIST_GET(tmp), NULL);
215 it = eina_inlist_iterator_new(lst);
218 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_inlist_data_check), &i);
219 eina_iterator_free(it);
226 eina_iterator_list_data_check(__UNUSED__ const Eina_List *list,
232 case 0: fail_if(*data != 81); break;
234 case 1: fail_if(*data != 7); break;
236 case 2: fail_if(*data != 9); break;
238 case 3: fail_if(*data != 6); break;
240 case 4: fail_if(*data != 42); break;
242 case 5: fail_if(*data != 1); break;
244 case 6: fail_if(*data != 1337); break;
252 START_TEST(eina_iterator_list_simple)
254 Eina_List *list = NULL;
256 int data[] = { 6, 9, 42, 1, 7, 1337, 81, 1664 };
261 list = eina_list_append(list, &data[0]);
262 fail_if(list == NULL);
264 list = eina_list_prepend(list, &data[1]);
265 fail_if(list == NULL);
267 list = eina_list_append(list, &data[2]);
268 fail_if(list == NULL);
270 list = eina_list_append(list, &data[3]);
271 fail_if(list == NULL);
273 list = eina_list_prepend(list, &data[4]);
274 fail_if(list == NULL);
276 list = eina_list_append(list, &data[5]);
277 fail_if(list == NULL);
279 list = eina_list_prepend(list, &data[6]);
280 fail_if(list == NULL);
282 it = eina_list_iterator_new(list);
285 eina_iterator_foreach(it, EINA_EACH_CB(eina_iterator_list_data_check), &i);
286 eina_iterator_free(it);
290 typedef struct _Eina_Rbtree_Int Eina_Rbtree_Int;
291 struct _Eina_Rbtree_Int
297 static Eina_Rbtree_Direction
298 eina_rbtree_int_cmp(const Eina_Rbtree_Int *left, const Eina_Rbtree_Int *right)
303 if (left->value < right->value)
304 return EINA_RBTREE_LEFT;
306 return EINA_RBTREE_RIGHT;
310 _eina_rbtree_int_new(int value)
314 it = malloc(sizeof (Eina_Rbtree_Int));
323 eina_iterator_rbtree_data_check_sorted(__UNUSED__ const Eina_List *list,
324 Eina_Rbtree_Int *data,
329 case 0: fail_if(data->value != 10); break;
331 case 1: fail_if(data->value != 27); break;
333 case 2: fail_if(data->value != 42); break;
335 case 3: fail_if(data->value != 69); break;
337 case 4: fail_if(data->value != 1337); break;
346 eina_iterator_rbtree_data_check_prefix(__UNUSED__ const Eina_List *list,
347 Eina_Rbtree_Int *data,
352 case 0: fail_if(data->value != 27); break;
354 case 1: fail_if(data->value != 10); break;
356 case 2: fail_if(data->value != 69); break;
358 case 3: fail_if(data->value != 42); break;
360 case 4: fail_if(data->value != 1337); break;
369 eina_iterator_rbtree_data_check_postfix(__UNUSED__ const Eina_List *list,
370 Eina_Rbtree_Int *data,
375 case 0: fail_if(data->value != 10); break;
377 case 1: fail_if(data->value != 42); break;
379 case 2: fail_if(data->value != 1337); break;
381 case 3: fail_if(data->value != 69); break;
383 case 4: fail_if(data->value != 27); break;
391 START_TEST(eina_iterator_rbtree_simple)
393 Eina_Rbtree *root = NULL;
397 root = eina_rbtree_inline_insert(NULL,
398 _eina_rbtree_int_new(10),
399 EINA_RBTREE_CMP_NODE_CB(eina_rbtree_int_cmp),
403 root = eina_rbtree_inline_insert(root,
404 _eina_rbtree_int_new(1337),
405 EINA_RBTREE_CMP_NODE_CB(eina_rbtree_int_cmp),
409 root = eina_rbtree_inline_insert(root,
410 _eina_rbtree_int_new(27),
411 EINA_RBTREE_CMP_NODE_CB(eina_rbtree_int_cmp),
415 root = eina_rbtree_inline_insert(root,
416 _eina_rbtree_int_new(69),
417 EINA_RBTREE_CMP_NODE_CB(eina_rbtree_int_cmp),
421 root = eina_rbtree_inline_insert(root,
422 _eina_rbtree_int_new(42),
423 EINA_RBTREE_CMP_NODE_CB(eina_rbtree_int_cmp),
428 it = eina_rbtree_iterator_prefix(root);
431 eina_iterator_foreach(it,
432 EINA_EACH_CB(eina_iterator_rbtree_data_check_prefix),
434 eina_iterator_free(it);
436 /* This will return the item sorted. */
438 it = eina_rbtree_iterator_infix(root);
441 eina_iterator_foreach(it,
442 EINA_EACH_CB(eina_iterator_rbtree_data_check_sorted),
444 eina_iterator_free(it);
447 it = eina_rbtree_iterator_postfix(root);
450 eina_iterator_foreach(it,
451 EINA_EACH_CB(eina_iterator_rbtree_data_check_postfix),
453 eina_iterator_free(it);
458 eina_test_iterator(TCase *tc)
460 tcase_add_test(tc, eina_iterator_array_simple);
461 tcase_add_test(tc, eina_iterator_hash_simple);
462 tcase_add_test(tc, eina_iterator_inlist_simple);
463 tcase_add_test(tc, eina_iterator_list_simple);
464 tcase_add_test(tc, eina_iterator_rbtree_simple);