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_linked_list.h"
25 #include "gl_array_list.h"
28 static const char *objects[15] =
30 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
33 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
34 #define ASSERT(expr) \
39 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
45 #define RANDOM(n) (rand () % (n))
46 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
49 check_equals (gl_list_t list1, gl_list_t list2)
53 n = gl_list_size (list1);
54 ASSERT (n == gl_list_size (list2));
55 for (i = 0; i < n; i++)
57 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
62 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
64 check_equals (list1, list2);
65 check_equals (list1, list3);
69 main (int argc, char *argv[])
71 gl_list_t list1, list2, list3;
73 set_program_name (argv[0]);
75 /* Allow the user to provide a non-default random seed on the command line. */
77 srand (atoi (argv[1]));
80 size_t initial_size = RANDOM (50);
81 const void **contents =
82 (const void **) malloc (initial_size * sizeof (const void *));
86 for (i = 0; i < initial_size; i++)
87 contents[i] = RANDOM_OBJECT ();
90 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
91 initial_size, contents);
93 list2 = gl_list_create_empty (GL_LINKED_LIST, NULL, NULL, NULL, true);
94 for (i = 0; i < initial_size; i++)
95 gl_list_add_last (list2, contents[i]);
98 list3 = gl_list_create (GL_LINKED_LIST, NULL, NULL, NULL, true,
99 initial_size, contents);
101 check_all (list1, list2, list3);
103 for (repeat = 0; repeat < 10000; repeat++)
105 unsigned int operation = RANDOM (16);
109 if (gl_list_size (list1) > 0)
111 size_t index = RANDOM (gl_list_size (list1));
112 const char *obj = RANDOM_OBJECT ();
113 gl_list_node_t node1, node2, node3;
115 node1 = gl_list_set_at (list1, index, obj);
116 ASSERT (gl_list_get_at (list1, index) == obj);
117 ASSERT (gl_list_node_value (list1, node1) == obj);
119 node2 = gl_list_set_at (list2, index, obj);
120 ASSERT (gl_list_get_at (list2, index) == obj);
121 ASSERT (gl_list_node_value (list2, node2) == obj);
123 node3 = gl_list_set_at (list3, index, obj);
124 ASSERT (gl_list_get_at (list3, index) == obj);
125 ASSERT (gl_list_node_value (list3, node3) == obj);
129 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
130 == gl_list_get_at (list1, index - 1));
131 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
132 == gl_list_get_at (list2, index - 1));
133 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
134 == gl_list_get_at (list2, index - 1));
136 if (index + 1 < gl_list_size (list1))
138 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
139 == gl_list_get_at (list1, index + 1));
140 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
141 == gl_list_get_at (list2, index + 1));
142 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
143 == gl_list_get_at (list2, index + 1));
149 const char *obj = RANDOM_OBJECT ();
150 gl_list_node_t node1, node2, node3;
151 node1 = gl_list_search (list1, obj);
152 node2 = gl_list_search (list2, obj);
153 node3 = gl_list_search (list3, obj);
156 ASSERT (node2 == NULL);
157 ASSERT (node3 == NULL);
161 ASSERT (node2 != NULL);
162 ASSERT (node3 != NULL);
163 ASSERT (gl_list_node_value (list1, node1) == obj);
164 ASSERT (gl_list_node_value (list2, node2) == obj);
165 ASSERT (gl_list_node_value (list3, node3) == obj);
171 const char *obj = RANDOM_OBJECT ();
172 size_t index1, index2, index3;
173 index1 = gl_list_indexof (list1, obj);
174 index2 = gl_list_indexof (list2, obj);
175 index3 = gl_list_indexof (list3, obj);
176 if (index1 == (size_t)(-1))
178 ASSERT (index2 == (size_t)(-1));
179 ASSERT (index3 == (size_t)(-1));
183 ASSERT (index2 != (size_t)(-1));
184 ASSERT (index3 != (size_t)(-1));
185 ASSERT (gl_list_get_at (list1, index1) == obj);
186 ASSERT (gl_list_get_at (list2, index2) == obj);
187 ASSERT (gl_list_get_at (list3, index3) == obj);
188 ASSERT (index2 == index1);
189 ASSERT (index3 == index1);
193 case 3: /* add 1 element */
195 const char *obj = RANDOM_OBJECT ();
196 gl_list_node_t node1, node2, node3;
197 node1 = gl_list_add_first (list1, obj);
198 node2 = gl_list_add_first (list2, obj);
199 node3 = gl_list_add_first (list3, obj);
200 ASSERT (gl_list_node_value (list1, node1) == obj);
201 ASSERT (gl_list_node_value (list2, node2) == obj);
202 ASSERT (gl_list_node_value (list3, node3) == obj);
203 ASSERT (gl_list_get_at (list1, 0) == obj);
204 ASSERT (gl_list_get_at (list2, 0) == obj);
205 ASSERT (gl_list_get_at (list3, 0) == obj);
208 case 4: /* add 1 element */
210 const char *obj = RANDOM_OBJECT ();
211 gl_list_node_t node1, node2, node3;
212 node1 = gl_list_add_last (list1, obj);
213 node2 = gl_list_add_last (list2, obj);
214 node3 = gl_list_add_last (list3, obj);
215 ASSERT (gl_list_node_value (list1, node1) == obj);
216 ASSERT (gl_list_node_value (list2, node2) == obj);
217 ASSERT (gl_list_node_value (list3, node3) == obj);
218 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
219 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
220 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
223 case 5: /* add 3 elements */
225 const char *obj0 = RANDOM_OBJECT ();
226 const char *obj1 = RANDOM_OBJECT ();
227 const char *obj2 = RANDOM_OBJECT ();
228 gl_list_node_t node1, node2, node3;
229 node1 = gl_list_add_first (list1, obj2);
230 node1 = gl_list_add_before (list1, node1, obj0);
231 node1 = gl_list_add_after (list1, node1, obj1);
232 node2 = gl_list_add_first (list2, obj2);
233 node2 = gl_list_add_before (list2, node2, obj0);
234 node2 = gl_list_add_after (list2, node2, obj1);
235 node3 = gl_list_add_first (list3, obj2);
236 node3 = gl_list_add_before (list3, node3, obj0);
237 node3 = gl_list_add_after (list3, node3, obj1);
238 ASSERT (gl_list_node_value (list1, node1) == obj1);
239 ASSERT (gl_list_node_value (list2, node2) == obj1);
240 ASSERT (gl_list_node_value (list3, node3) == obj1);
241 ASSERT (gl_list_get_at (list1, 0) == obj0);
242 ASSERT (gl_list_get_at (list1, 1) == obj1);
243 ASSERT (gl_list_get_at (list1, 2) == obj2);
244 ASSERT (gl_list_get_at (list2, 0) == obj0);
245 ASSERT (gl_list_get_at (list2, 1) == obj1);
246 ASSERT (gl_list_get_at (list2, 2) == obj2);
247 ASSERT (gl_list_get_at (list3, 0) == obj0);
248 ASSERT (gl_list_get_at (list3, 1) == obj1);
249 ASSERT (gl_list_get_at (list3, 2) == obj2);
252 case 6: /* add 1 element */
254 size_t index = RANDOM (gl_list_size (list1) + 1);
255 const char *obj = RANDOM_OBJECT ();
256 gl_list_node_t node1, node2, node3;
257 node1 = gl_list_add_at (list1, index, obj);
258 node2 = gl_list_add_at (list2, index, obj);
259 node3 = gl_list_add_at (list3, index, obj);
260 ASSERT (gl_list_get_at (list1, index) == obj);
261 ASSERT (gl_list_node_value (list1, node1) == obj);
262 ASSERT (gl_list_get_at (list2, index) == obj);
263 ASSERT (gl_list_node_value (list2, node2) == obj);
264 ASSERT (gl_list_get_at (list3, index) == obj);
265 ASSERT (gl_list_node_value (list3, node3) == obj);
268 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
269 == gl_list_get_at (list1, index - 1));
270 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
271 == gl_list_get_at (list2, index - 1));
272 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
273 == gl_list_get_at (list2, index - 1));
275 if (index + 1 < gl_list_size (list1))
277 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
278 == gl_list_get_at (list1, index + 1));
279 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
280 == gl_list_get_at (list2, index + 1));
281 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
282 == gl_list_get_at (list2, index + 1));
286 case 7: case 8: /* remove 1 element */
287 if (gl_list_size (list1) > 0)
289 size_t n = gl_list_size (list1);
290 const char *obj = gl_list_get_at (list1, RANDOM (n));
291 gl_list_node_t node1, node2, node3;
292 node1 = gl_list_search (list1, obj);
293 node2 = gl_list_search (list2, obj);
294 node3 = gl_list_search (list3, obj);
295 ASSERT (node1 != NULL);
296 ASSERT (node2 != NULL);
297 ASSERT (node3 != NULL);
298 ASSERT (gl_list_remove_node (list1, node1));
299 ASSERT (gl_list_remove_node (list2, node2));
300 ASSERT (gl_list_remove_node (list3, node3));
301 ASSERT (gl_list_size (list1) == n - 1);
304 case 9: case 10: /* remove 1 element */
305 if (gl_list_size (list1) > 0)
307 size_t n = gl_list_size (list1);
308 size_t index = RANDOM (n);
309 ASSERT (gl_list_remove_at (list1, index));
310 ASSERT (gl_list_remove_at (list2, index));
311 ASSERT (gl_list_remove_at (list3, index));
312 ASSERT (gl_list_size (list1) == n - 1);
315 case 11: case 12: /* remove 1 element */
316 if (gl_list_size (list1) > 0)
318 size_t n = gl_list_size (list1);
319 const char *obj = gl_list_get_at (list1, RANDOM (n));
320 ASSERT (gl_list_remove (list1, obj));
321 ASSERT (gl_list_remove (list2, obj));
322 ASSERT (gl_list_remove (list3, obj));
323 ASSERT (gl_list_size (list1) == n - 1);
327 if (gl_list_size (list1) > 0)
329 size_t n = gl_list_size (list1);
330 const char *obj = "xyzzy";
331 ASSERT (!gl_list_remove (list1, obj));
332 ASSERT (!gl_list_remove (list2, obj));
333 ASSERT (!gl_list_remove (list3, obj));
334 ASSERT (gl_list_size (list1) == n);
339 size_t n = gl_list_size (list1);
340 gl_list_iterator_t iter1, iter2, iter3;
342 iter1 = gl_list_iterator (list1);
343 iter2 = gl_list_iterator (list2);
344 iter3 = gl_list_iterator (list3);
345 for (i = 0; i < n; i++)
347 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
348 ASSERT (gl_list_get_at (list1, i) == elt);
349 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
350 ASSERT (gl_list_get_at (list2, i) == elt);
351 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
352 ASSERT (gl_list_get_at (list3, i) == elt);
354 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
355 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
356 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
357 gl_list_iterator_free (&iter1);
358 gl_list_iterator_free (&iter2);
359 gl_list_iterator_free (&iter3);
364 size_t end = RANDOM (gl_list_size (list1) + 1);
365 size_t start = RANDOM (end + 1);
366 gl_list_iterator_t iter1, iter2, iter3;
368 iter1 = gl_list_iterator_from_to (list1, start, end);
369 iter2 = gl_list_iterator_from_to (list2, start, end);
370 iter3 = gl_list_iterator_from_to (list3, start, end);
371 for (i = start; i < end; i++)
373 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
374 ASSERT (gl_list_get_at (list1, i) == elt);
375 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
376 ASSERT (gl_list_get_at (list2, i) == elt);
377 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
378 ASSERT (gl_list_get_at (list3, i) == elt);
380 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
381 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
382 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
383 gl_list_iterator_free (&iter1);
384 gl_list_iterator_free (&iter2);
385 gl_list_iterator_free (&iter3);
389 check_all (list1, list2, list3);
392 gl_list_free (list1);
393 gl_list_free (list2);
394 gl_list_free (list3);