1 /* EINA - EFL data type library
2 * Copyright (C) 2012 ProFUSION embedded systems
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"
28 START_TEST(eina_inarray_test_simple)
30 const int test_members = 5;
44 array = eina_inarray_new(sizeof(int), 2);
45 fail_unless(array != NULL);
47 for (i = 0; i < test_members; i++)
49 pos = eina_inarray_push(array, &i);
50 fail_unless(pos == i);
52 fail_unless(eina_inarray_count(array) == (unsigned)test_members);
54 for (i = 0; i < test_members; i++)
56 member = eina_inarray_nth(array, i);
57 fail_unless(*member == i);
60 for (s = specs; s->pos >= 0; s++)
62 fail_unless(eina_inarray_insert_at(array, s->pos, &s->value));
64 for (i = 0; i < s->pos; i++)
66 member = eina_inarray_nth(array, i);
67 fail_unless(*member == i);
69 member = eina_inarray_nth(array, s->pos);
70 fail_unless(*member == s->value);
71 for (i = s->pos + 1; i < test_members + 1; i++)
73 member = eina_inarray_nth(array, i);
74 fail_unless(*member == i - 1);
77 fail_unless(eina_inarray_remove_at(array, s->pos));
78 for (i = 0; i < test_members; i++)
80 member = eina_inarray_nth(array, i);
81 fail_unless(*member == i);
85 eina_inarray_free(array);
91 START_TEST(eina_inarray_test_alloc_at)
99 array = eina_inarray_new(sizeof(int), 2);
100 fail_unless(array != NULL);
102 member = eina_inarray_alloc_at(array, 0, 4);
103 fail_unless(member != NULL);
104 fail_unless(eina_inarray_count(array) == 4);
106 for (i = 0; i < 4; i++)
109 member = eina_inarray_alloc_at(array, 0, 2);
110 fail_unless(member != NULL);
111 fail_unless(eina_inarray_count(array) == 6);
112 for (i = 0; i < 2; i++)
115 member = eina_inarray_alloc_at(array, 6, 2);
116 fail_unless(member != NULL);
117 fail_unless(eina_inarray_count(array) == 8);
118 for (i = 0; i < 2; i++)
121 member = array->members;
122 for (i = 0; i < 8; i++)
123 fail_unless(member[i] == i);
125 eina_inarray_free(array);
130 static const short rand_numbers[] = {
131 9, 0, 2, 3, 6, 5, 4, 7, 8, 1, 10
133 static const int numbers_count = sizeof(rand_numbers)/sizeof(rand_numbers[0]);
136 show_sort_array(const Eina_Inarray *array)
138 int i, len = eina_inarray_count(array);
139 printf("array with %d members:\n", len);
140 for (i = 0; i < len; i++)
142 short *member = eina_inarray_nth(array, i);
143 printf("\tarray[%2d]=%5hd\n", i, *member);
148 check_short_sorted(const Eina_Inarray *array)
151 for (i = 0; i < numbers_count; i++)
153 short *member = eina_inarray_nth(array, i);
154 if (*member != (short)i)
156 show_sort_array(array);
157 fprintf(stderr, "not sorted at %d: %hd\n", i, *member);
165 short_cmp(const void *pa, const void *pb)
167 const short *a = pa, *b = pb;
171 START_TEST(eina_inarray_test_insert_sort)
178 array = eina_inarray_new(sizeof(short), 1);
179 fail_unless(array != NULL);
181 /* insert sorted and already sorted sequence */
182 for (i = 0; i < numbers_count; i++)
185 pos = eina_inarray_insert(array, &val, short_cmp);
186 fail_unless(pos == (int)val);
188 fail_unless(check_short_sorted(array));
189 eina_inarray_flush(array);
191 for (i = 0; i < numbers_count; i++)
194 pos = eina_inarray_insert_sorted(array, &val, short_cmp);
195 fail_unless(pos == (int)val);
197 fail_unless(check_short_sorted(array));
198 eina_inarray_flush(array);
200 /* insert sorted the reverse sequence */
201 for (i = 0; i < numbers_count; i++)
203 short val = numbers_count - i - 1;
204 pos = eina_inarray_insert(array, &val, short_cmp);
205 fail_unless(pos == 0);
207 fail_unless(check_short_sorted(array));
208 eina_inarray_flush(array);
210 for (i = 0; i < numbers_count; i++)
212 short val = numbers_count - i - 1;
213 pos = eina_inarray_insert_sorted(array, &val, short_cmp);
214 fail_unless(pos == 0);
216 fail_unless(check_short_sorted(array));
217 eina_inarray_flush(array);
219 /* insert sorted random numbers */
220 for (i = 0; i < numbers_count; i++)
222 short val = rand_numbers[i];
223 eina_inarray_insert(array, &val, short_cmp);
225 fail_unless(check_short_sorted(array));
226 eina_inarray_flush(array);
228 for (i = 0; i < numbers_count; i++)
230 short val = rand_numbers[i];
231 eina_inarray_insert_sorted(array, &val, short_cmp);
233 fail_unless(check_short_sorted(array));
234 eina_inarray_flush(array);
236 eina_inarray_free(array);
241 START_TEST(eina_inarray_test_sort)
248 array = eina_inarray_new(sizeof(short), 1);
249 fail_unless(array != NULL);
251 for (i = 0; i < numbers_count; i++)
253 short val = rand_numbers[i];
254 eina_inarray_push(array, &val);
256 eina_inarray_sort(array, short_cmp);
257 fail_unless(check_short_sorted(array));
258 eina_inarray_free(array);
263 START_TEST(eina_inarray_test_reverse)
270 array = eina_inarray_new(sizeof(short), 1);
271 fail_unless(array != NULL);
273 for (i = 0; i < numbers_count; i++)
276 eina_inarray_push(array, &val);
278 eina_inarray_reverse(array);
280 for (i = 0; i < numbers_count; i++)
282 short *member = eina_inarray_nth(array, i);
283 fail_unless(*member == (numbers_count - i - 1));
286 eina_inarray_free(array);
292 array_foreach(const void *array __UNUSED__, void *p, void *user_data __UNUSED__)
296 fail_unless(*i == *member);
302 array_foreach_stop_2nd(const void *array __UNUSED__, void *p, void *user_data __UNUSED__)
306 fail_unless(*i == *member);
313 START_TEST(eina_inarray_test_itr)
323 array = eina_inarray_new(sizeof(short), 1);
324 fail_unless(array != NULL);
326 for (i = 0; i < numbers_count; i++)
329 eina_inarray_push(array, &val);
332 EINA_INARRAY_FOREACH(array, member)
334 fail_unless(*member == i);
337 fail_unless(i == numbers_count);
340 EINA_INARRAY_REVERSE_FOREACH(array, member)
342 fail_unless(*member == i);
345 fail_unless(i == -1);
348 fail_unless(eina_inarray_foreach(array, array_foreach, &i));
349 fail_unless(i == numbers_count);
352 fail_if(eina_inarray_foreach(array, array_foreach_stop_2nd, &i));
355 it = eina_inarray_iterator_new(array);
356 fail_unless(it != NULL);
358 EINA_ITERATOR_FOREACH(it, member)
360 fail_unless(*member == i);
363 fail_unless(i == numbers_count);
364 eina_iterator_free(it);
366 it = eina_inarray_iterator_reversed_new(array);
367 fail_unless(it != NULL);
369 EINA_ITERATOR_FOREACH(it, member)
371 fail_unless(*member == i);
374 fail_unless(i == -1);
375 eina_iterator_free(it);
377 ac = eina_inarray_accessor_new(array);
378 fail_unless(ac != NULL);
379 for (i = 0; i < numbers_count; i++)
381 fail_unless(eina_accessor_data_get(ac, i, (void **)&member));
382 fail_unless(*member == i);
384 fail_unless(i == numbers_count);
385 eina_accessor_free(ac);
387 eina_inarray_free(array);
393 eina_test_inarray(TCase *tc)
395 tcase_add_test(tc, eina_inarray_test_simple);
396 tcase_add_test(tc, eina_inarray_test_alloc_at);
397 tcase_add_test(tc, eina_inarray_test_insert_sort);
398 tcase_add_test(tc, eina_inarray_test_sort);
399 tcase_add_test(tc, eina_inarray_test_reverse);
400 tcase_add_test(tc, eina_inarray_test_itr);