1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006-2008 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__); \
47 #define RANDOM(n) (rand () % (n))
48 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
51 check_equals (gl_list_t list1, gl_list_t list2)
55 n = gl_list_size (list1);
56 ASSERT (n == gl_list_size (list2));
57 for (i = 0; i < n; i++)
59 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
64 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
66 gl_avltree_list_check_invariants (list2);
67 gl_avltree_list_check_invariants (list3);
68 check_equals (list1, list2);
69 check_equals (list1, list3);
73 main (int argc, char *argv[])
75 gl_list_t list1, list2, list3;
77 /* Allow the user to provide a non-default random seed on the command line. */
79 srand (atoi (argv[1]));
82 size_t initial_size = RANDOM (50);
83 const void **contents =
84 (const void **) malloc (initial_size * sizeof (const void *));
88 for (i = 0; i < initial_size; i++)
89 contents[i] = RANDOM_OBJECT ();
92 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
93 initial_size, contents);
95 list2 = gl_list_create_empty (GL_AVLTREE_LIST, NULL, NULL, NULL, true);
96 for (i = 0; i < initial_size; i++)
97 gl_list_add_last (list2, contents[i]);
100 list3 = gl_list_create (GL_AVLTREE_LIST, NULL, NULL, NULL, true,
101 initial_size, contents);
103 check_all (list1, list2, list3);
105 for (repeat = 0; repeat < 10000; repeat++)
107 unsigned int operation = RANDOM (16);
111 if (gl_list_size (list1) > 0)
113 size_t index = RANDOM (gl_list_size (list1));
114 const char *obj = RANDOM_OBJECT ();
115 gl_list_node_t node1, node2, node3;
117 node1 = gl_list_set_at (list1, index, obj);
118 ASSERT (gl_list_get_at (list1, index) == obj);
119 ASSERT (gl_list_node_value (list1, node1) == obj);
121 node2 = gl_list_set_at (list2, index, obj);
122 ASSERT (gl_list_get_at (list2, index) == obj);
123 ASSERT (gl_list_node_value (list2, node2) == obj);
125 node3 = gl_list_set_at (list3, index, obj);
126 ASSERT (gl_list_get_at (list3, index) == obj);
127 ASSERT (gl_list_node_value (list3, node3) == obj);
131 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
132 == gl_list_get_at (list1, index - 1));
133 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
134 == gl_list_get_at (list2, index - 1));
135 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
136 == gl_list_get_at (list2, index - 1));
138 if (index + 1 < gl_list_size (list1))
140 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
141 == gl_list_get_at (list1, index + 1));
142 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
143 == gl_list_get_at (list2, index + 1));
144 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
145 == gl_list_get_at (list2, index + 1));
151 const char *obj = RANDOM_OBJECT ();
152 gl_list_node_t node1, node2, node3;
153 node1 = gl_list_search (list1, obj);
154 node2 = gl_list_search (list2, obj);
155 node3 = gl_list_search (list3, obj);
158 ASSERT (node2 == NULL);
159 ASSERT (node3 == NULL);
163 ASSERT (node2 != NULL);
164 ASSERT (node3 != NULL);
165 ASSERT (gl_list_node_value (list1, node1) == obj);
166 ASSERT (gl_list_node_value (list2, node2) == obj);
167 ASSERT (gl_list_node_value (list3, node3) == obj);
173 const char *obj = RANDOM_OBJECT ();
174 size_t index1, index2, index3;
175 index1 = gl_list_indexof (list1, obj);
176 index2 = gl_list_indexof (list2, obj);
177 index3 = gl_list_indexof (list3, obj);
178 if (index1 == (size_t)(-1))
180 ASSERT (index2 == (size_t)(-1));
181 ASSERT (index3 == (size_t)(-1));
185 ASSERT (index2 != (size_t)(-1));
186 ASSERT (index3 != (size_t)(-1));
187 ASSERT (gl_list_get_at (list1, index1) == obj);
188 ASSERT (gl_list_get_at (list2, index2) == obj);
189 ASSERT (gl_list_get_at (list3, index3) == obj);
190 ASSERT (index2 == index1);
191 ASSERT (index3 == index1);
195 case 3: /* add 1 element */
197 const char *obj = RANDOM_OBJECT ();
198 gl_list_node_t node1, node2, node3;
199 node1 = gl_list_add_first (list1, obj);
200 node2 = gl_list_add_first (list2, obj);
201 node3 = gl_list_add_first (list3, obj);
202 ASSERT (gl_list_node_value (list1, node1) == obj);
203 ASSERT (gl_list_node_value (list2, node2) == obj);
204 ASSERT (gl_list_node_value (list3, node3) == obj);
205 ASSERT (gl_list_get_at (list1, 0) == obj);
206 ASSERT (gl_list_get_at (list2, 0) == obj);
207 ASSERT (gl_list_get_at (list3, 0) == obj);
210 case 4: /* add 1 element */
212 const char *obj = RANDOM_OBJECT ();
213 gl_list_node_t node1, node2, node3;
214 node1 = gl_list_add_last (list1, obj);
215 node2 = gl_list_add_last (list2, obj);
216 node3 = gl_list_add_last (list3, obj);
217 ASSERT (gl_list_node_value (list1, node1) == obj);
218 ASSERT (gl_list_node_value (list2, node2) == obj);
219 ASSERT (gl_list_node_value (list3, node3) == obj);
220 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
221 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
222 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
225 case 5: /* add 3 elements */
227 const char *obj0 = RANDOM_OBJECT ();
228 const char *obj1 = RANDOM_OBJECT ();
229 const char *obj2 = RANDOM_OBJECT ();
230 gl_list_node_t node1, node2, node3;
231 node1 = gl_list_add_first (list1, obj2);
232 node1 = gl_list_add_before (list1, node1, obj0);
233 node1 = gl_list_add_after (list1, node1, obj1);
234 node2 = gl_list_add_first (list2, obj2);
235 node2 = gl_list_add_before (list2, node2, obj0);
236 node2 = gl_list_add_after (list2, node2, obj1);
237 node3 = gl_list_add_first (list3, obj2);
238 node3 = gl_list_add_before (list3, node3, obj0);
239 node3 = gl_list_add_after (list3, node3, obj1);
240 ASSERT (gl_list_node_value (list1, node1) == obj1);
241 ASSERT (gl_list_node_value (list2, node2) == obj1);
242 ASSERT (gl_list_node_value (list3, node3) == obj1);
243 ASSERT (gl_list_get_at (list1, 0) == obj0);
244 ASSERT (gl_list_get_at (list1, 1) == obj1);
245 ASSERT (gl_list_get_at (list1, 2) == obj2);
246 ASSERT (gl_list_get_at (list2, 0) == obj0);
247 ASSERT (gl_list_get_at (list2, 1) == obj1);
248 ASSERT (gl_list_get_at (list2, 2) == obj2);
249 ASSERT (gl_list_get_at (list3, 0) == obj0);
250 ASSERT (gl_list_get_at (list3, 1) == obj1);
251 ASSERT (gl_list_get_at (list3, 2) == obj2);
254 case 6: /* add 1 element */
256 size_t index = RANDOM (gl_list_size (list1) + 1);
257 const char *obj = RANDOM_OBJECT ();
258 gl_list_node_t node1, node2, node3;
259 node1 = gl_list_add_at (list1, index, obj);
260 node2 = gl_list_add_at (list2, index, obj);
261 node3 = gl_list_add_at (list3, index, obj);
262 ASSERT (gl_list_get_at (list1, index) == obj);
263 ASSERT (gl_list_node_value (list1, node1) == obj);
264 ASSERT (gl_list_get_at (list2, index) == obj);
265 ASSERT (gl_list_node_value (list2, node2) == obj);
266 ASSERT (gl_list_get_at (list3, index) == obj);
267 ASSERT (gl_list_node_value (list3, node3) == obj);
270 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
271 == gl_list_get_at (list1, index - 1));
272 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
273 == gl_list_get_at (list2, index - 1));
274 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
275 == gl_list_get_at (list2, index - 1));
277 if (index + 1 < gl_list_size (list1))
279 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
280 == gl_list_get_at (list1, index + 1));
281 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
282 == gl_list_get_at (list2, index + 1));
283 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
284 == gl_list_get_at (list2, index + 1));
288 case 7: case 8: /* remove 1 element */
289 if (gl_list_size (list1) > 0)
291 size_t n = gl_list_size (list1);
292 const char *obj = gl_list_get_at (list1, RANDOM (n));
293 gl_list_node_t node1, node2, node3;
294 node1 = gl_list_search (list1, obj);
295 node2 = gl_list_search (list2, obj);
296 node3 = gl_list_search (list3, obj);
297 ASSERT (node1 != NULL);
298 ASSERT (node2 != NULL);
299 ASSERT (node3 != NULL);
300 ASSERT (gl_list_remove_node (list1, node1));
301 ASSERT (gl_list_remove_node (list2, node2));
302 ASSERT (gl_list_remove_node (list3, node3));
303 ASSERT (gl_list_size (list1) == n - 1);
306 case 9: case 10: /* remove 1 element */
307 if (gl_list_size (list1) > 0)
309 size_t n = gl_list_size (list1);
310 size_t index = RANDOM (n);
311 ASSERT (gl_list_remove_at (list1, index));
312 ASSERT (gl_list_remove_at (list2, index));
313 ASSERT (gl_list_remove_at (list3, index));
314 ASSERT (gl_list_size (list1) == n - 1);
317 case 11: case 12: /* remove 1 element */
318 if (gl_list_size (list1) > 0)
320 size_t n = gl_list_size (list1);
321 const char *obj = gl_list_get_at (list1, RANDOM (n));
322 ASSERT (gl_list_remove (list1, obj));
323 ASSERT (gl_list_remove (list2, obj));
324 ASSERT (gl_list_remove (list3, obj));
325 ASSERT (gl_list_size (list1) == n - 1);
329 if (gl_list_size (list1) > 0)
331 size_t n = gl_list_size (list1);
332 const char *obj = "xyzzy";
333 ASSERT (!gl_list_remove (list1, obj));
334 ASSERT (!gl_list_remove (list2, obj));
335 ASSERT (!gl_list_remove (list3, obj));
336 ASSERT (gl_list_size (list1) == n);
341 size_t n = gl_list_size (list1);
342 gl_list_iterator_t iter1, iter2, iter3;
344 iter1 = gl_list_iterator (list1);
345 iter2 = gl_list_iterator (list2);
346 iter3 = gl_list_iterator (list3);
347 for (i = 0; i < n; i++)
349 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
350 ASSERT (gl_list_get_at (list1, i) == elt);
351 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
352 ASSERT (gl_list_get_at (list2, i) == elt);
353 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
354 ASSERT (gl_list_get_at (list3, i) == elt);
356 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
357 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
358 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
359 gl_list_iterator_free (&iter1);
360 gl_list_iterator_free (&iter2);
361 gl_list_iterator_free (&iter3);
366 size_t end = RANDOM (gl_list_size (list1) + 1);
367 size_t start = RANDOM (end + 1);
368 gl_list_iterator_t iter1, iter2, iter3;
370 iter1 = gl_list_iterator_from_to (list1, start, end);
371 iter2 = gl_list_iterator_from_to (list2, start, end);
372 iter3 = gl_list_iterator_from_to (list3, start, end);
373 for (i = start; i < end; i++)
375 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
376 ASSERT (gl_list_get_at (list1, i) == elt);
377 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
378 ASSERT (gl_list_get_at (list2, i) == elt);
379 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
380 ASSERT (gl_list_get_at (list3, i) == elt);
382 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
383 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
384 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
385 gl_list_iterator_free (&iter1);
386 gl_list_iterator_free (&iter2);
387 gl_list_iterator_free (&iter3);
391 check_all (list1, list2, list3);
394 gl_list_free (list1);
395 gl_list_free (list2);
396 gl_list_free (list3);