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_avltreehash_list.h"
27 #include "gl_array_list.h"
30 extern void gl_avltreehash_list_check_invariants (gl_list_t list);
32 static const char *objects[15] =
34 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
37 #define SIZE_BITS (sizeof (size_t) * CHAR_BIT)
40 string_equals (const void *x1, const void *x2)
44 return strcmp (s1, s2) == 0;
47 /* A hash function for NUL-terminated char* strings using
48 the method described by Bruno Haible.
49 See http://www.haible.de/bruno/hashfunc.html. */
51 string_hash (const void *x)
57 h = *s + ((h << 9) | (h >> (SIZE_BITS - 9)));
62 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
63 #define ASSERT(expr) \
68 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
74 #define RANDOM(n) (rand () % (n))
75 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
78 check_equals (gl_list_t list1, gl_list_t list2)
82 n = gl_list_size (list1);
83 ASSERT (n == gl_list_size (list2));
84 for (i = 0; i < n; i++)
86 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
91 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
93 gl_avltreehash_list_check_invariants (list2);
94 gl_avltreehash_list_check_invariants (list3);
95 check_equals (list1, list2);
96 check_equals (list1, list3);
100 main (int argc, char *argv[])
102 gl_list_t list1, list2, list3;
104 set_program_name (argv[0]);
106 /* Allow the user to provide a non-default random seed on the command line. */
108 srand (atoi (argv[1]));
111 size_t initial_size = RANDOM (50);
112 const void **contents =
113 (const void **) malloc (initial_size * sizeof (const void *));
117 for (i = 0; i < initial_size; i++)
118 contents[i] = RANDOM_OBJECT ();
121 list1 = gl_list_create (GL_ARRAY_LIST,
122 string_equals, string_hash, NULL, true,
123 initial_size, contents);
125 list2 = gl_list_create_empty (GL_AVLTREEHASH_LIST,
126 string_equals, string_hash, NULL, true);
127 for (i = 0; i < initial_size; i++)
128 gl_list_add_last (list2, contents[i]);
131 list3 = gl_list_create (GL_AVLTREEHASH_LIST,
132 string_equals, string_hash, NULL, true,
133 initial_size, contents);
135 check_all (list1, list2, list3);
137 for (repeat = 0; repeat < 10000; repeat++)
139 unsigned int operation = RANDOM (16);
143 if (gl_list_size (list1) > 0)
145 size_t index = RANDOM (gl_list_size (list1));
146 const char *obj = RANDOM_OBJECT ();
147 gl_list_node_t node1, node2, node3;
149 node1 = gl_list_set_at (list1, index, obj);
150 ASSERT (gl_list_get_at (list1, index) == obj);
151 ASSERT (gl_list_node_value (list1, node1) == obj);
153 node2 = gl_list_set_at (list2, index, obj);
154 ASSERT (gl_list_get_at (list2, index) == obj);
155 ASSERT (gl_list_node_value (list2, node2) == obj);
157 node3 = gl_list_set_at (list3, index, obj);
158 ASSERT (gl_list_get_at (list3, index) == obj);
159 ASSERT (gl_list_node_value (list3, node3) == obj);
163 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
164 == gl_list_get_at (list1, index - 1));
165 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
166 == gl_list_get_at (list2, index - 1));
167 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
168 == gl_list_get_at (list2, index - 1));
170 if (index + 1 < gl_list_size (list1))
172 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
173 == gl_list_get_at (list1, index + 1));
174 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
175 == gl_list_get_at (list2, index + 1));
176 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
177 == gl_list_get_at (list2, index + 1));
183 const char *obj = RANDOM_OBJECT ();
184 gl_list_node_t node1, node2, node3;
185 node1 = gl_list_search (list1, obj);
186 node2 = gl_list_search (list2, obj);
187 node3 = gl_list_search (list3, obj);
190 ASSERT (node2 == NULL);
191 ASSERT (node3 == NULL);
195 ASSERT (node2 != NULL);
196 ASSERT (node3 != NULL);
197 ASSERT (gl_list_node_value (list1, node1) == obj);
198 ASSERT (gl_list_node_value (list2, node2) == obj);
199 ASSERT (gl_list_node_value (list3, node3) == obj);
205 const char *obj = RANDOM_OBJECT ();
206 size_t index1, index2, index3;
207 index1 = gl_list_indexof (list1, obj);
208 index2 = gl_list_indexof (list2, obj);
209 index3 = gl_list_indexof (list3, obj);
210 if (index1 == (size_t)(-1))
212 ASSERT (index2 == (size_t)(-1));
213 ASSERT (index3 == (size_t)(-1));
217 ASSERT (index2 != (size_t)(-1));
218 ASSERT (index3 != (size_t)(-1));
219 ASSERT (gl_list_get_at (list1, index1) == obj);
220 ASSERT (gl_list_get_at (list2, index2) == obj);
221 ASSERT (gl_list_get_at (list3, index3) == obj);
222 ASSERT (index2 == index1);
223 ASSERT (index3 == index1);
227 case 3: /* add 1 element */
229 const char *obj = RANDOM_OBJECT ();
230 gl_list_node_t node1, node2, node3;
231 node1 = gl_list_add_first (list1, obj);
232 node2 = gl_list_add_first (list2, obj);
233 node3 = gl_list_add_first (list3, obj);
234 ASSERT (gl_list_node_value (list1, node1) == obj);
235 ASSERT (gl_list_node_value (list2, node2) == obj);
236 ASSERT (gl_list_node_value (list3, node3) == obj);
237 ASSERT (gl_list_get_at (list1, 0) == obj);
238 ASSERT (gl_list_get_at (list2, 0) == obj);
239 ASSERT (gl_list_get_at (list3, 0) == obj);
242 case 4: /* add 1 element */
244 const char *obj = RANDOM_OBJECT ();
245 gl_list_node_t node1, node2, node3;
246 node1 = gl_list_add_last (list1, obj);
247 node2 = gl_list_add_last (list2, obj);
248 node3 = gl_list_add_last (list3, obj);
249 ASSERT (gl_list_node_value (list1, node1) == obj);
250 ASSERT (gl_list_node_value (list2, node2) == obj);
251 ASSERT (gl_list_node_value (list3, node3) == obj);
252 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
253 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
254 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
257 case 5: /* add 3 elements */
259 const char *obj0 = RANDOM_OBJECT ();
260 const char *obj1 = RANDOM_OBJECT ();
261 const char *obj2 = RANDOM_OBJECT ();
262 gl_list_node_t node1, node2, node3;
263 node1 = gl_list_add_first (list1, obj2);
264 node1 = gl_list_add_before (list1, node1, obj0);
265 node1 = gl_list_add_after (list1, node1, obj1);
266 node2 = gl_list_add_first (list2, obj2);
267 node2 = gl_list_add_before (list2, node2, obj0);
268 node2 = gl_list_add_after (list2, node2, obj1);
269 node3 = gl_list_add_first (list3, obj2);
270 node3 = gl_list_add_before (list3, node3, obj0);
271 node3 = gl_list_add_after (list3, node3, obj1);
272 ASSERT (gl_list_node_value (list1, node1) == obj1);
273 ASSERT (gl_list_node_value (list2, node2) == obj1);
274 ASSERT (gl_list_node_value (list3, node3) == obj1);
275 ASSERT (gl_list_get_at (list1, 0) == obj0);
276 ASSERT (gl_list_get_at (list1, 1) == obj1);
277 ASSERT (gl_list_get_at (list1, 2) == obj2);
278 ASSERT (gl_list_get_at (list2, 0) == obj0);
279 ASSERT (gl_list_get_at (list2, 1) == obj1);
280 ASSERT (gl_list_get_at (list2, 2) == obj2);
281 ASSERT (gl_list_get_at (list3, 0) == obj0);
282 ASSERT (gl_list_get_at (list3, 1) == obj1);
283 ASSERT (gl_list_get_at (list3, 2) == obj2);
286 case 6: /* add 1 element */
288 size_t index = RANDOM (gl_list_size (list1) + 1);
289 const char *obj = RANDOM_OBJECT ();
290 gl_list_node_t node1, node2, node3;
291 node1 = gl_list_add_at (list1, index, obj);
292 node2 = gl_list_add_at (list2, index, obj);
293 node3 = gl_list_add_at (list3, index, obj);
294 ASSERT (gl_list_get_at (list1, index) == obj);
295 ASSERT (gl_list_node_value (list1, node1) == obj);
296 ASSERT (gl_list_get_at (list2, index) == obj);
297 ASSERT (gl_list_node_value (list2, node2) == obj);
298 ASSERT (gl_list_get_at (list3, index) == obj);
299 ASSERT (gl_list_node_value (list3, node3) == obj);
302 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
303 == gl_list_get_at (list1, index - 1));
304 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
305 == gl_list_get_at (list2, index - 1));
306 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
307 == gl_list_get_at (list2, index - 1));
309 if (index + 1 < gl_list_size (list1))
311 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
312 == gl_list_get_at (list1, index + 1));
313 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
314 == gl_list_get_at (list2, index + 1));
315 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
316 == gl_list_get_at (list2, index + 1));
320 case 7: case 8: /* remove 1 element */
321 if (gl_list_size (list1) > 0)
323 size_t n = gl_list_size (list1);
324 const char *obj = gl_list_get_at (list1, RANDOM (n));
325 gl_list_node_t node1, node2, node3;
326 node1 = gl_list_search (list1, obj);
327 node2 = gl_list_search (list2, obj);
328 node3 = gl_list_search (list3, obj);
329 ASSERT (node1 != NULL);
330 ASSERT (node2 != NULL);
331 ASSERT (node3 != NULL);
332 ASSERT (gl_list_remove_node (list1, node1));
333 ASSERT (gl_list_remove_node (list2, node2));
334 ASSERT (gl_list_remove_node (list3, node3));
335 ASSERT (gl_list_size (list1) == n - 1);
338 case 9: case 10: /* remove 1 element */
339 if (gl_list_size (list1) > 0)
341 size_t n = gl_list_size (list1);
342 size_t index = RANDOM (n);
343 ASSERT (gl_list_remove_at (list1, index));
344 ASSERT (gl_list_remove_at (list2, index));
345 ASSERT (gl_list_remove_at (list3, index));
346 ASSERT (gl_list_size (list1) == n - 1);
349 case 11: case 12: /* remove 1 element */
350 if (gl_list_size (list1) > 0)
352 size_t n = gl_list_size (list1);
353 const char *obj = gl_list_get_at (list1, RANDOM (n));
354 ASSERT (gl_list_remove (list1, obj));
355 ASSERT (gl_list_remove (list2, obj));
356 ASSERT (gl_list_remove (list3, obj));
357 ASSERT (gl_list_size (list1) == n - 1);
361 if (gl_list_size (list1) > 0)
363 size_t n = gl_list_size (list1);
364 const char *obj = "xyzzy";
365 ASSERT (!gl_list_remove (list1, obj));
366 ASSERT (!gl_list_remove (list2, obj));
367 ASSERT (!gl_list_remove (list3, obj));
368 ASSERT (gl_list_size (list1) == n);
373 size_t n = gl_list_size (list1);
374 gl_list_iterator_t iter1, iter2, iter3;
376 iter1 = gl_list_iterator (list1);
377 iter2 = gl_list_iterator (list2);
378 iter3 = gl_list_iterator (list3);
379 for (i = 0; i < n; i++)
381 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
382 ASSERT (gl_list_get_at (list1, i) == elt);
383 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
384 ASSERT (gl_list_get_at (list2, i) == elt);
385 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
386 ASSERT (gl_list_get_at (list3, i) == elt);
388 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
389 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
390 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
391 gl_list_iterator_free (&iter1);
392 gl_list_iterator_free (&iter2);
393 gl_list_iterator_free (&iter3);
398 size_t end = RANDOM (gl_list_size (list1) + 1);
399 size_t start = RANDOM (end + 1);
400 gl_list_iterator_t iter1, iter2, iter3;
402 iter1 = gl_list_iterator_from_to (list1, start, end);
403 iter2 = gl_list_iterator_from_to (list2, start, end);
404 iter3 = gl_list_iterator_from_to (list3, start, end);
405 for (i = start; i < end; i++)
407 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
408 ASSERT (gl_list_get_at (list1, i) == elt);
409 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
410 ASSERT (gl_list_get_at (list2, i) == elt);
411 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
412 ASSERT (gl_list_get_at (list3, i) == elt);
414 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
415 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
416 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
417 gl_list_iterator_free (&iter1);
418 gl_list_iterator_free (&iter2);
419 gl_list_iterator_free (&iter3);
423 check_all (list1, list2, list3);
426 gl_list_free (list1);
427 gl_list_free (list2);
428 gl_list_free (list3);