1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006-2009 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_nx_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
91 initial_size, contents);
92 ASSERT (list1 != NULL);
94 list2 = gl_list_nx_create_empty (GL_LINKED_LIST, NULL, NULL, NULL, true);
95 ASSERT (list2 != NULL);
96 for (i = 0; i < initial_size; i++)
97 ASSERT (gl_list_nx_add_last (list2, contents[i]) != NULL);
100 list3 = gl_list_nx_create (GL_LINKED_LIST, NULL, NULL, NULL, true,
101 initial_size, contents);
102 ASSERT (list3 != NULL);
104 check_all (list1, list2, list3);
106 for (repeat = 0; repeat < 10000; repeat++)
108 unsigned int operation = RANDOM (16);
112 if (gl_list_size (list1) > 0)
114 size_t index = RANDOM (gl_list_size (list1));
115 const char *obj = RANDOM_OBJECT ();
116 gl_list_node_t node1, node2, node3;
118 node1 = gl_list_nx_set_at (list1, index, obj);
119 ASSERT (node1 != NULL);
120 ASSERT (gl_list_get_at (list1, index) == obj);
121 ASSERT (gl_list_node_value (list1, node1) == obj);
123 node2 = gl_list_nx_set_at (list2, index, obj);
124 ASSERT (node2 != NULL);
125 ASSERT (gl_list_get_at (list2, index) == obj);
126 ASSERT (gl_list_node_value (list2, node2) == obj);
128 node3 = gl_list_nx_set_at (list3, index, obj);
129 ASSERT (node3 != NULL);
130 ASSERT (gl_list_get_at (list3, index) == obj);
131 ASSERT (gl_list_node_value (list3, node3) == obj);
135 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
136 == gl_list_get_at (list1, index - 1));
137 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
138 == gl_list_get_at (list2, index - 1));
139 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
140 == gl_list_get_at (list2, index - 1));
142 if (index + 1 < gl_list_size (list1))
144 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
145 == gl_list_get_at (list1, index + 1));
146 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
147 == gl_list_get_at (list2, index + 1));
148 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
149 == gl_list_get_at (list2, index + 1));
155 const char *obj = RANDOM_OBJECT ();
156 gl_list_node_t node1, node2, node3;
157 node1 = gl_list_search (list1, obj);
158 node2 = gl_list_search (list2, obj);
159 node3 = gl_list_search (list3, obj);
162 ASSERT (node2 == NULL);
163 ASSERT (node3 == NULL);
167 ASSERT (node2 != NULL);
168 ASSERT (node3 != NULL);
169 ASSERT (gl_list_node_value (list1, node1) == obj);
170 ASSERT (gl_list_node_value (list2, node2) == obj);
171 ASSERT (gl_list_node_value (list3, node3) == obj);
177 const char *obj = RANDOM_OBJECT ();
178 size_t index1, index2, index3;
179 index1 = gl_list_indexof (list1, obj);
180 index2 = gl_list_indexof (list2, obj);
181 index3 = gl_list_indexof (list3, obj);
182 if (index1 == (size_t)(-1))
184 ASSERT (index2 == (size_t)(-1));
185 ASSERT (index3 == (size_t)(-1));
189 ASSERT (index2 != (size_t)(-1));
190 ASSERT (index3 != (size_t)(-1));
191 ASSERT (gl_list_get_at (list1, index1) == obj);
192 ASSERT (gl_list_get_at (list2, index2) == obj);
193 ASSERT (gl_list_get_at (list3, index3) == obj);
194 ASSERT (index2 == index1);
195 ASSERT (index3 == index1);
199 case 3: /* add 1 element */
201 const char *obj = RANDOM_OBJECT ();
202 gl_list_node_t node1, node2, node3;
203 node1 = gl_list_nx_add_first (list1, obj);
204 ASSERT (node1 != NULL);
205 node2 = gl_list_nx_add_first (list2, obj);
206 ASSERT (node2 != NULL);
207 node3 = gl_list_nx_add_first (list3, obj);
208 ASSERT (node3 != NULL);
209 ASSERT (gl_list_node_value (list1, node1) == obj);
210 ASSERT (gl_list_node_value (list2, node2) == obj);
211 ASSERT (gl_list_node_value (list3, node3) == obj);
212 ASSERT (gl_list_get_at (list1, 0) == obj);
213 ASSERT (gl_list_get_at (list2, 0) == obj);
214 ASSERT (gl_list_get_at (list3, 0) == obj);
217 case 4: /* add 1 element */
219 const char *obj = RANDOM_OBJECT ();
220 gl_list_node_t node1, node2, node3;
221 node1 = gl_list_nx_add_last (list1, obj);
222 ASSERT (node1 != NULL);
223 node2 = gl_list_nx_add_last (list2, obj);
224 ASSERT (node2 != NULL);
225 node3 = gl_list_nx_add_last (list3, obj);
226 ASSERT (node3 != NULL);
227 ASSERT (gl_list_node_value (list1, node1) == obj);
228 ASSERT (gl_list_node_value (list2, node2) == obj);
229 ASSERT (gl_list_node_value (list3, node3) == obj);
230 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
231 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
232 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
235 case 5: /* add 3 elements */
237 const char *obj0 = RANDOM_OBJECT ();
238 const char *obj1 = RANDOM_OBJECT ();
239 const char *obj2 = RANDOM_OBJECT ();
240 gl_list_node_t node1, node2, node3;
241 node1 = gl_list_nx_add_first (list1, obj2);
242 ASSERT (node1 != NULL);
243 node1 = gl_list_nx_add_before (list1, node1, obj0);
244 ASSERT (node1 != NULL);
245 node1 = gl_list_nx_add_after (list1, node1, obj1);
246 ASSERT (node1 != NULL);
247 node2 = gl_list_nx_add_first (list2, obj2);
248 ASSERT (node2 != NULL);
249 node2 = gl_list_nx_add_before (list2, node2, obj0);
250 ASSERT (node2 != NULL);
251 node2 = gl_list_nx_add_after (list2, node2, obj1);
252 ASSERT (node2 != NULL);
253 node3 = gl_list_nx_add_first (list3, obj2);
254 ASSERT (node3 != NULL);
255 node3 = gl_list_nx_add_before (list3, node3, obj0);
256 ASSERT (node3 != NULL);
257 node3 = gl_list_nx_add_after (list3, node3, obj1);
258 ASSERT (node3 != NULL);
259 ASSERT (gl_list_node_value (list1, node1) == obj1);
260 ASSERT (gl_list_node_value (list2, node2) == obj1);
261 ASSERT (gl_list_node_value (list3, node3) == obj1);
262 ASSERT (gl_list_get_at (list1, 0) == obj0);
263 ASSERT (gl_list_get_at (list1, 1) == obj1);
264 ASSERT (gl_list_get_at (list1, 2) == obj2);
265 ASSERT (gl_list_get_at (list2, 0) == obj0);
266 ASSERT (gl_list_get_at (list2, 1) == obj1);
267 ASSERT (gl_list_get_at (list2, 2) == obj2);
268 ASSERT (gl_list_get_at (list3, 0) == obj0);
269 ASSERT (gl_list_get_at (list3, 1) == obj1);
270 ASSERT (gl_list_get_at (list3, 2) == obj2);
273 case 6: /* add 1 element */
275 size_t index = RANDOM (gl_list_size (list1) + 1);
276 const char *obj = RANDOM_OBJECT ();
277 gl_list_node_t node1, node2, node3;
278 node1 = gl_list_nx_add_at (list1, index, obj);
279 ASSERT (node1 != NULL);
280 node2 = gl_list_nx_add_at (list2, index, obj);
281 ASSERT (node2 != NULL);
282 node3 = gl_list_nx_add_at (list3, index, obj);
283 ASSERT (node3 != NULL);
284 ASSERT (gl_list_get_at (list1, index) == obj);
285 ASSERT (gl_list_node_value (list1, node1) == obj);
286 ASSERT (gl_list_get_at (list2, index) == obj);
287 ASSERT (gl_list_node_value (list2, node2) == obj);
288 ASSERT (gl_list_get_at (list3, index) == obj);
289 ASSERT (gl_list_node_value (list3, node3) == obj);
292 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
293 == gl_list_get_at (list1, index - 1));
294 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
295 == gl_list_get_at (list2, index - 1));
296 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
297 == gl_list_get_at (list2, index - 1));
299 if (index + 1 < gl_list_size (list1))
301 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
302 == gl_list_get_at (list1, index + 1));
303 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
304 == gl_list_get_at (list2, index + 1));
305 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
306 == gl_list_get_at (list2, index + 1));
310 case 7: case 8: /* remove 1 element */
311 if (gl_list_size (list1) > 0)
313 size_t n = gl_list_size (list1);
314 const char *obj = gl_list_get_at (list1, RANDOM (n));
315 gl_list_node_t node1, node2, node3;
316 node1 = gl_list_search (list1, obj);
317 node2 = gl_list_search (list2, obj);
318 node3 = gl_list_search (list3, obj);
319 ASSERT (node1 != NULL);
320 ASSERT (node2 != NULL);
321 ASSERT (node3 != NULL);
322 ASSERT (gl_list_remove_node (list1, node1));
323 ASSERT (gl_list_remove_node (list2, node2));
324 ASSERT (gl_list_remove_node (list3, node3));
325 ASSERT (gl_list_size (list1) == n - 1);
328 case 9: case 10: /* remove 1 element */
329 if (gl_list_size (list1) > 0)
331 size_t n = gl_list_size (list1);
332 size_t index = RANDOM (n);
333 ASSERT (gl_list_remove_at (list1, index));
334 ASSERT (gl_list_remove_at (list2, index));
335 ASSERT (gl_list_remove_at (list3, index));
336 ASSERT (gl_list_size (list1) == n - 1);
339 case 11: case 12: /* remove 1 element */
340 if (gl_list_size (list1) > 0)
342 size_t n = gl_list_size (list1);
343 const char *obj = gl_list_get_at (list1, RANDOM (n));
344 ASSERT (gl_list_remove (list1, obj));
345 ASSERT (gl_list_remove (list2, obj));
346 ASSERT (gl_list_remove (list3, obj));
347 ASSERT (gl_list_size (list1) == n - 1);
351 if (gl_list_size (list1) > 0)
353 size_t n = gl_list_size (list1);
354 const char *obj = "xyzzy";
355 ASSERT (!gl_list_remove (list1, obj));
356 ASSERT (!gl_list_remove (list2, obj));
357 ASSERT (!gl_list_remove (list3, obj));
358 ASSERT (gl_list_size (list1) == n);
363 size_t n = gl_list_size (list1);
364 gl_list_iterator_t iter1, iter2, iter3;
366 iter1 = gl_list_iterator (list1);
367 iter2 = gl_list_iterator (list2);
368 iter3 = gl_list_iterator (list3);
369 for (i = 0; i < n; i++)
371 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
372 ASSERT (gl_list_get_at (list1, i) == elt);
373 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
374 ASSERT (gl_list_get_at (list2, i) == elt);
375 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
376 ASSERT (gl_list_get_at (list3, i) == elt);
378 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
379 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
380 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
381 gl_list_iterator_free (&iter1);
382 gl_list_iterator_free (&iter2);
383 gl_list_iterator_free (&iter3);
388 size_t end = RANDOM (gl_list_size (list1) + 1);
389 size_t start = RANDOM (end + 1);
390 gl_list_iterator_t iter1, iter2, iter3;
392 iter1 = gl_list_iterator_from_to (list1, start, end);
393 iter2 = gl_list_iterator_from_to (list2, start, end);
394 iter3 = gl_list_iterator_from_to (list3, start, end);
395 for (i = start; i < end; i++)
397 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
398 ASSERT (gl_list_get_at (list1, i) == elt);
399 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
400 ASSERT (gl_list_get_at (list2, i) == elt);
401 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
402 ASSERT (gl_list_get_at (list3, i) == elt);
404 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
405 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
406 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
407 gl_list_iterator_free (&iter1);
408 gl_list_iterator_free (&iter2);
409 gl_list_iterator_free (&iter3);
413 check_all (list1, list2, list3);
416 gl_list_free (list1);
417 gl_list_free (list2);
418 gl_list_free (list3);