1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006-2007 Free Software Foundation, Inc.
3 Written by Bruno Haible <bruno@clisp.org>, 2006.
5 This program is free software: you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 3 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program. If not, see <http://www.gnu.org/licenses/>. */
20 #include "gl_avltree_list.h"
25 #include "gl_array_list.h"
28 extern void gl_avltree_list_check_invariants (gl_list_t list);
30 static const char *objects[15] =
32 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
35 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
36 #define ASSERT(expr) \
41 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
46 #define RANDOM(n) (rand () % (n))
47 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
50 check_equals (gl_list_t list1, gl_list_t list2)
54 n = gl_list_size (list1);
55 ASSERT (n == gl_list_size (list2));
56 for (i = 0; i < n; i++)
58 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
63 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
65 gl_avltree_list_check_invariants (list2);
66 gl_avltree_list_check_invariants (list3);
67 check_equals (list1, list2);
68 check_equals (list1, list3);
72 main (int argc, char *argv[])
74 gl_list_t list1, list2, list3;
76 /* Allow the user to provide a non-default random seed on the command line. */
78 srand (atoi (argv[1]));
81 size_t initial_size = RANDOM (50);
82 const void **contents =
83 (const void **) malloc (initial_size * sizeof (const void *));
87 for (i = 0; i < initial_size; i++)
88 contents[i] = RANDOM_OBJECT ();
91 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
92 initial_size, contents);
94 list2 = gl_list_create_empty (GL_AVLTREE_LIST, NULL, NULL, NULL, true);
95 for (i = 0; i < initial_size; i++)
96 gl_list_add_last (list2, contents[i]);
99 list3 = gl_list_create (GL_AVLTREE_LIST, NULL, NULL, NULL, true,
100 initial_size, contents);
102 check_all (list1, list2, list3);
104 for (repeat = 0; repeat < 10000; repeat++)
106 unsigned int operation = RANDOM (16);
110 if (gl_list_size (list1) > 0)
112 size_t index = RANDOM (gl_list_size (list1));
113 const char *obj = RANDOM_OBJECT ();
114 gl_list_node_t node1, node2, node3;
116 node1 = gl_list_set_at (list1, index, obj);
117 ASSERT (gl_list_get_at (list1, index) == obj);
118 ASSERT (gl_list_node_value (list1, node1) == obj);
120 node2 = gl_list_set_at (list2, index, obj);
121 ASSERT (gl_list_get_at (list2, index) == obj);
122 ASSERT (gl_list_node_value (list2, node2) == obj);
124 node3 = gl_list_set_at (list3, index, obj);
125 ASSERT (gl_list_get_at (list3, index) == obj);
126 ASSERT (gl_list_node_value (list3, node3) == obj);
130 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
131 == gl_list_get_at (list1, index - 1));
132 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
133 == gl_list_get_at (list2, index - 1));
134 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
135 == gl_list_get_at (list2, index - 1));
137 if (index + 1 < gl_list_size (list1))
139 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
140 == gl_list_get_at (list1, index + 1));
141 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
142 == gl_list_get_at (list2, index + 1));
143 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
144 == gl_list_get_at (list2, index + 1));
150 const char *obj = RANDOM_OBJECT ();
151 gl_list_node_t node1, node2, node3;
152 node1 = gl_list_search (list1, obj);
153 node2 = gl_list_search (list2, obj);
154 node3 = gl_list_search (list3, obj);
157 ASSERT (node2 == NULL);
158 ASSERT (node3 == NULL);
162 ASSERT (node2 != NULL);
163 ASSERT (node3 != NULL);
164 ASSERT (gl_list_node_value (list1, node1) == obj);
165 ASSERT (gl_list_node_value (list2, node2) == obj);
166 ASSERT (gl_list_node_value (list3, node3) == obj);
172 const char *obj = RANDOM_OBJECT ();
173 size_t index1, index2, index3;
174 index1 = gl_list_indexof (list1, obj);
175 index2 = gl_list_indexof (list2, obj);
176 index3 = gl_list_indexof (list3, obj);
177 if (index1 == (size_t)(-1))
179 ASSERT (index2 == (size_t)(-1));
180 ASSERT (index3 == (size_t)(-1));
184 ASSERT (index2 != (size_t)(-1));
185 ASSERT (index3 != (size_t)(-1));
186 ASSERT (gl_list_get_at (list1, index1) == obj);
187 ASSERT (gl_list_get_at (list2, index2) == obj);
188 ASSERT (gl_list_get_at (list3, index3) == obj);
189 ASSERT (index2 == index1);
190 ASSERT (index3 == index1);
194 case 3: /* add 1 element */
196 const char *obj = RANDOM_OBJECT ();
197 gl_list_node_t node1, node2, node3;
198 node1 = gl_list_add_first (list1, obj);
199 node2 = gl_list_add_first (list2, obj);
200 node3 = gl_list_add_first (list3, obj);
201 ASSERT (gl_list_node_value (list1, node1) == obj);
202 ASSERT (gl_list_node_value (list2, node2) == obj);
203 ASSERT (gl_list_node_value (list3, node3) == obj);
204 ASSERT (gl_list_get_at (list1, 0) == obj);
205 ASSERT (gl_list_get_at (list2, 0) == obj);
206 ASSERT (gl_list_get_at (list3, 0) == obj);
209 case 4: /* add 1 element */
211 const char *obj = RANDOM_OBJECT ();
212 gl_list_node_t node1, node2, node3;
213 node1 = gl_list_add_last (list1, obj);
214 node2 = gl_list_add_last (list2, obj);
215 node3 = gl_list_add_last (list3, obj);
216 ASSERT (gl_list_node_value (list1, node1) == obj);
217 ASSERT (gl_list_node_value (list2, node2) == obj);
218 ASSERT (gl_list_node_value (list3, node3) == obj);
219 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
220 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
221 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
224 case 5: /* add 3 elements */
226 const char *obj0 = RANDOM_OBJECT ();
227 const char *obj1 = RANDOM_OBJECT ();
228 const char *obj2 = RANDOM_OBJECT ();
229 gl_list_node_t node1, node2, node3;
230 node1 = gl_list_add_first (list1, obj2);
231 node1 = gl_list_add_before (list1, node1, obj0);
232 node1 = gl_list_add_after (list1, node1, obj1);
233 node2 = gl_list_add_first (list2, obj2);
234 node2 = gl_list_add_before (list2, node2, obj0);
235 node2 = gl_list_add_after (list2, node2, obj1);
236 node3 = gl_list_add_first (list3, obj2);
237 node3 = gl_list_add_before (list3, node3, obj0);
238 node3 = gl_list_add_after (list3, node3, obj1);
239 ASSERT (gl_list_node_value (list1, node1) == obj1);
240 ASSERT (gl_list_node_value (list2, node2) == obj1);
241 ASSERT (gl_list_node_value (list3, node3) == obj1);
242 ASSERT (gl_list_get_at (list1, 0) == obj0);
243 ASSERT (gl_list_get_at (list1, 1) == obj1);
244 ASSERT (gl_list_get_at (list1, 2) == obj2);
245 ASSERT (gl_list_get_at (list2, 0) == obj0);
246 ASSERT (gl_list_get_at (list2, 1) == obj1);
247 ASSERT (gl_list_get_at (list2, 2) == obj2);
248 ASSERT (gl_list_get_at (list3, 0) == obj0);
249 ASSERT (gl_list_get_at (list3, 1) == obj1);
250 ASSERT (gl_list_get_at (list3, 2) == obj2);
253 case 6: /* add 1 element */
255 size_t index = RANDOM (gl_list_size (list1) + 1);
256 const char *obj = RANDOM_OBJECT ();
257 gl_list_node_t node1, node2, node3;
258 node1 = gl_list_add_at (list1, index, obj);
259 node2 = gl_list_add_at (list2, index, obj);
260 node3 = gl_list_add_at (list3, index, obj);
261 ASSERT (gl_list_get_at (list1, index) == obj);
262 ASSERT (gl_list_node_value (list1, node1) == obj);
263 ASSERT (gl_list_get_at (list2, index) == obj);
264 ASSERT (gl_list_node_value (list2, node2) == obj);
265 ASSERT (gl_list_get_at (list3, index) == obj);
266 ASSERT (gl_list_node_value (list3, node3) == obj);
269 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
270 == gl_list_get_at (list1, index - 1));
271 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
272 == gl_list_get_at (list2, index - 1));
273 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
274 == gl_list_get_at (list2, index - 1));
276 if (index + 1 < gl_list_size (list1))
278 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
279 == gl_list_get_at (list1, index + 1));
280 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
281 == gl_list_get_at (list2, index + 1));
282 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
283 == gl_list_get_at (list2, index + 1));
287 case 7: case 8: /* remove 1 element */
288 if (gl_list_size (list1) > 0)
290 size_t n = gl_list_size (list1);
291 const char *obj = gl_list_get_at (list1, RANDOM (n));
292 gl_list_node_t node1, node2, node3;
293 node1 = gl_list_search (list1, obj);
294 node2 = gl_list_search (list2, obj);
295 node3 = gl_list_search (list3, obj);
296 ASSERT (node1 != NULL);
297 ASSERT (node2 != NULL);
298 ASSERT (node3 != NULL);
299 ASSERT (gl_list_remove_node (list1, node1));
300 ASSERT (gl_list_remove_node (list2, node2));
301 ASSERT (gl_list_remove_node (list3, node3));
302 ASSERT (gl_list_size (list1) == n - 1);
305 case 9: case 10: /* remove 1 element */
306 if (gl_list_size (list1) > 0)
308 size_t n = gl_list_size (list1);
309 size_t index = RANDOM (n);
310 ASSERT (gl_list_remove_at (list1, index));
311 ASSERT (gl_list_remove_at (list2, index));
312 ASSERT (gl_list_remove_at (list3, index));
313 ASSERT (gl_list_size (list1) == n - 1);
316 case 11: case 12: /* remove 1 element */
317 if (gl_list_size (list1) > 0)
319 size_t n = gl_list_size (list1);
320 const char *obj = gl_list_get_at (list1, RANDOM (n));
321 ASSERT (gl_list_remove (list1, obj));
322 ASSERT (gl_list_remove (list2, obj));
323 ASSERT (gl_list_remove (list3, obj));
324 ASSERT (gl_list_size (list1) == n - 1);
328 if (gl_list_size (list1) > 0)
330 size_t n = gl_list_size (list1);
331 const char *obj = "xyzzy";
332 ASSERT (!gl_list_remove (list1, obj));
333 ASSERT (!gl_list_remove (list2, obj));
334 ASSERT (!gl_list_remove (list3, obj));
335 ASSERT (gl_list_size (list1) == n);
340 size_t n = gl_list_size (list1);
341 gl_list_iterator_t iter1, iter2, iter3;
343 iter1 = gl_list_iterator (list1);
344 iter2 = gl_list_iterator (list2);
345 iter3 = gl_list_iterator (list3);
346 for (i = 0; i < n; i++)
348 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
349 ASSERT (gl_list_get_at (list1, i) == elt);
350 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
351 ASSERT (gl_list_get_at (list2, i) == elt);
352 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
353 ASSERT (gl_list_get_at (list3, i) == elt);
355 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
356 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
357 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
358 gl_list_iterator_free (&iter1);
359 gl_list_iterator_free (&iter2);
360 gl_list_iterator_free (&iter3);
365 size_t end = RANDOM (gl_list_size (list1) + 1);
366 size_t start = RANDOM (end + 1);
367 gl_list_iterator_t iter1, iter2, iter3;
369 iter1 = gl_list_iterator_from_to (list1, start, end);
370 iter2 = gl_list_iterator_from_to (list2, start, end);
371 iter3 = gl_list_iterator_from_to (list3, start, end);
372 for (i = start; i < end; i++)
374 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
375 ASSERT (gl_list_get_at (list1, i) == elt);
376 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
377 ASSERT (gl_list_get_at (list2, i) == elt);
378 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
379 ASSERT (gl_list_get_at (list3, i) == elt);
381 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
382 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
383 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
384 gl_list_iterator_free (&iter1);
385 gl_list_iterator_free (&iter2);
386 gl_list_iterator_free (&iter3);
390 check_all (list1, list2, list3);
393 gl_list_free (list1);
394 gl_list_free (list2);
395 gl_list_free (list3);