1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006-2010 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"
24 #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 RANDOM(n) (rand () % (n))
34 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
37 check_equals (gl_list_t list1, gl_list_t list2)
41 n = gl_list_size (list1);
42 ASSERT (n == gl_list_size (list2));
43 for (i = 0; i < n; i++)
45 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
50 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
52 check_equals (list1, list2);
53 check_equals (list1, list3);
57 main (int argc, char *argv[])
59 gl_list_t list1, list2, list3;
61 set_program_name (argv[0]);
63 /* Allow the user to provide a non-default random seed on the command line. */
65 srand (atoi (argv[1]));
68 size_t initial_size = RANDOM (50);
69 const void **contents =
70 (const void **) malloc (initial_size * sizeof (const void *));
74 for (i = 0; i < initial_size; i++)
75 contents[i] = RANDOM_OBJECT ();
78 list1 = gl_list_nx_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
79 initial_size, contents);
80 ASSERT (list1 != NULL);
82 list2 = gl_list_nx_create_empty (GL_LINKED_LIST, NULL, NULL, NULL, true);
83 ASSERT (list2 != NULL);
84 for (i = 0; i < initial_size; i++)
85 ASSERT (gl_list_nx_add_last (list2, contents[i]) != NULL);
88 list3 = gl_list_nx_create (GL_LINKED_LIST, NULL, NULL, NULL, true,
89 initial_size, contents);
90 ASSERT (list3 != NULL);
92 check_all (list1, list2, list3);
94 for (repeat = 0; repeat < 10000; repeat++)
96 unsigned int operation = RANDOM (16);
100 if (gl_list_size (list1) > 0)
102 size_t index = RANDOM (gl_list_size (list1));
103 const char *obj = RANDOM_OBJECT ();
104 gl_list_node_t node1, node2, node3;
106 node1 = gl_list_nx_set_at (list1, index, obj);
107 ASSERT (node1 != NULL);
108 ASSERT (gl_list_get_at (list1, index) == obj);
109 ASSERT (gl_list_node_value (list1, node1) == obj);
111 node2 = gl_list_nx_set_at (list2, index, obj);
112 ASSERT (node2 != NULL);
113 ASSERT (gl_list_get_at (list2, index) == obj);
114 ASSERT (gl_list_node_value (list2, node2) == obj);
116 node3 = gl_list_nx_set_at (list3, index, obj);
117 ASSERT (node3 != NULL);
118 ASSERT (gl_list_get_at (list3, index) == obj);
119 ASSERT (gl_list_node_value (list3, node3) == obj);
123 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
124 == gl_list_get_at (list1, index - 1));
125 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
126 == gl_list_get_at (list2, index - 1));
127 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
128 == gl_list_get_at (list2, index - 1));
130 if (index + 1 < gl_list_size (list1))
132 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
133 == gl_list_get_at (list1, index + 1));
134 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
135 == gl_list_get_at (list2, index + 1));
136 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
137 == gl_list_get_at (list2, index + 1));
143 const char *obj = RANDOM_OBJECT ();
144 gl_list_node_t node1, node2, node3;
145 node1 = gl_list_search (list1, obj);
146 node2 = gl_list_search (list2, obj);
147 node3 = gl_list_search (list3, obj);
150 ASSERT (node2 == NULL);
151 ASSERT (node3 == NULL);
155 ASSERT (node2 != NULL);
156 ASSERT (node3 != NULL);
157 ASSERT (gl_list_node_value (list1, node1) == obj);
158 ASSERT (gl_list_node_value (list2, node2) == obj);
159 ASSERT (gl_list_node_value (list3, node3) == obj);
165 const char *obj = RANDOM_OBJECT ();
166 size_t index1, index2, index3;
167 index1 = gl_list_indexof (list1, obj);
168 index2 = gl_list_indexof (list2, obj);
169 index3 = gl_list_indexof (list3, obj);
170 if (index1 == (size_t)(-1))
172 ASSERT (index2 == (size_t)(-1));
173 ASSERT (index3 == (size_t)(-1));
177 ASSERT (index2 != (size_t)(-1));
178 ASSERT (index3 != (size_t)(-1));
179 ASSERT (gl_list_get_at (list1, index1) == obj);
180 ASSERT (gl_list_get_at (list2, index2) == obj);
181 ASSERT (gl_list_get_at (list3, index3) == obj);
182 ASSERT (index2 == index1);
183 ASSERT (index3 == index1);
187 case 3: /* add 1 element */
189 const char *obj = RANDOM_OBJECT ();
190 gl_list_node_t node1, node2, node3;
191 node1 = gl_list_nx_add_first (list1, obj);
192 ASSERT (node1 != NULL);
193 node2 = gl_list_nx_add_first (list2, obj);
194 ASSERT (node2 != NULL);
195 node3 = gl_list_nx_add_first (list3, obj);
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);
200 ASSERT (gl_list_get_at (list1, 0) == obj);
201 ASSERT (gl_list_get_at (list2, 0) == obj);
202 ASSERT (gl_list_get_at (list3, 0) == obj);
205 case 4: /* add 1 element */
207 const char *obj = RANDOM_OBJECT ();
208 gl_list_node_t node1, node2, node3;
209 node1 = gl_list_nx_add_last (list1, obj);
210 ASSERT (node1 != NULL);
211 node2 = gl_list_nx_add_last (list2, obj);
212 ASSERT (node2 != NULL);
213 node3 = gl_list_nx_add_last (list3, obj);
214 ASSERT (node3 != NULL);
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_nx_add_first (list1, obj2);
230 ASSERT (node1 != NULL);
231 node1 = gl_list_nx_add_before (list1, node1, obj0);
232 ASSERT (node1 != NULL);
233 node1 = gl_list_nx_add_after (list1, node1, obj1);
234 ASSERT (node1 != NULL);
235 node2 = gl_list_nx_add_first (list2, obj2);
236 ASSERT (node2 != NULL);
237 node2 = gl_list_nx_add_before (list2, node2, obj0);
238 ASSERT (node2 != NULL);
239 node2 = gl_list_nx_add_after (list2, node2, obj1);
240 ASSERT (node2 != NULL);
241 node3 = gl_list_nx_add_first (list3, obj2);
242 ASSERT (node3 != NULL);
243 node3 = gl_list_nx_add_before (list3, node3, obj0);
244 ASSERT (node3 != NULL);
245 node3 = gl_list_nx_add_after (list3, node3, obj1);
246 ASSERT (node3 != NULL);
247 ASSERT (gl_list_node_value (list1, node1) == obj1);
248 ASSERT (gl_list_node_value (list2, node2) == obj1);
249 ASSERT (gl_list_node_value (list3, node3) == obj1);
250 ASSERT (gl_list_get_at (list1, 0) == obj0);
251 ASSERT (gl_list_get_at (list1, 1) == obj1);
252 ASSERT (gl_list_get_at (list1, 2) == obj2);
253 ASSERT (gl_list_get_at (list2, 0) == obj0);
254 ASSERT (gl_list_get_at (list2, 1) == obj1);
255 ASSERT (gl_list_get_at (list2, 2) == obj2);
256 ASSERT (gl_list_get_at (list3, 0) == obj0);
257 ASSERT (gl_list_get_at (list3, 1) == obj1);
258 ASSERT (gl_list_get_at (list3, 2) == obj2);
261 case 6: /* add 1 element */
263 size_t index = RANDOM (gl_list_size (list1) + 1);
264 const char *obj = RANDOM_OBJECT ();
265 gl_list_node_t node1, node2, node3;
266 node1 = gl_list_nx_add_at (list1, index, obj);
267 ASSERT (node1 != NULL);
268 node2 = gl_list_nx_add_at (list2, index, obj);
269 ASSERT (node2 != NULL);
270 node3 = gl_list_nx_add_at (list3, index, obj);
271 ASSERT (node3 != NULL);
272 ASSERT (gl_list_get_at (list1, index) == obj);
273 ASSERT (gl_list_node_value (list1, node1) == obj);
274 ASSERT (gl_list_get_at (list2, index) == obj);
275 ASSERT (gl_list_node_value (list2, node2) == obj);
276 ASSERT (gl_list_get_at (list3, index) == obj);
277 ASSERT (gl_list_node_value (list3, node3) == obj);
280 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
281 == gl_list_get_at (list1, index - 1));
282 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
283 == gl_list_get_at (list2, index - 1));
284 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
285 == gl_list_get_at (list2, index - 1));
287 if (index + 1 < gl_list_size (list1))
289 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
290 == gl_list_get_at (list1, index + 1));
291 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
292 == gl_list_get_at (list2, index + 1));
293 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
294 == gl_list_get_at (list2, index + 1));
298 case 7: case 8: /* remove 1 element */
299 if (gl_list_size (list1) > 0)
301 size_t n = gl_list_size (list1);
302 const char *obj = gl_list_get_at (list1, RANDOM (n));
303 gl_list_node_t node1, node2, node3;
304 node1 = gl_list_search (list1, obj);
305 node2 = gl_list_search (list2, obj);
306 node3 = gl_list_search (list3, obj);
307 ASSERT (node1 != NULL);
308 ASSERT (node2 != NULL);
309 ASSERT (node3 != NULL);
310 ASSERT (gl_list_remove_node (list1, node1));
311 ASSERT (gl_list_remove_node (list2, node2));
312 ASSERT (gl_list_remove_node (list3, node3));
313 ASSERT (gl_list_size (list1) == n - 1);
316 case 9: case 10: /* remove 1 element */
317 if (gl_list_size (list1) > 0)
319 size_t n = gl_list_size (list1);
320 size_t index = RANDOM (n);
321 ASSERT (gl_list_remove_at (list1, index));
322 ASSERT (gl_list_remove_at (list2, index));
323 ASSERT (gl_list_remove_at (list3, index));
324 ASSERT (gl_list_size (list1) == n - 1);
327 case 11: case 12: /* remove 1 element */
328 if (gl_list_size (list1) > 0)
330 size_t n = gl_list_size (list1);
331 const char *obj = gl_list_get_at (list1, RANDOM (n));
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 - 1);
339 if (gl_list_size (list1) > 0)
341 size_t n = gl_list_size (list1);
342 const char *obj = "xyzzy";
343 ASSERT (!gl_list_remove (list1, obj));
344 ASSERT (!gl_list_remove (list2, obj));
345 ASSERT (!gl_list_remove (list3, obj));
346 ASSERT (gl_list_size (list1) == n);
351 size_t n = gl_list_size (list1);
352 gl_list_iterator_t iter1, iter2, iter3;
354 iter1 = gl_list_iterator (list1);
355 iter2 = gl_list_iterator (list2);
356 iter3 = gl_list_iterator (list3);
357 for (i = 0; i < n; i++)
359 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
360 ASSERT (gl_list_get_at (list1, i) == elt);
361 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
362 ASSERT (gl_list_get_at (list2, i) == elt);
363 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
364 ASSERT (gl_list_get_at (list3, i) == elt);
366 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
367 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
368 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
369 gl_list_iterator_free (&iter1);
370 gl_list_iterator_free (&iter2);
371 gl_list_iterator_free (&iter3);
376 size_t end = RANDOM (gl_list_size (list1) + 1);
377 size_t start = RANDOM (end + 1);
378 gl_list_iterator_t iter1, iter2, iter3;
380 iter1 = gl_list_iterator_from_to (list1, start, end);
381 iter2 = gl_list_iterator_from_to (list2, start, end);
382 iter3 = gl_list_iterator_from_to (list3, start, end);
383 for (i = start; i < end; i++)
385 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
386 ASSERT (gl_list_get_at (list1, i) == elt);
387 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
388 ASSERT (gl_list_get_at (list2, i) == elt);
389 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
390 ASSERT (gl_list_get_at (list3, i) == elt);
392 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
393 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
394 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
395 gl_list_iterator_free (&iter1);
396 gl_list_iterator_free (&iter2);
397 gl_list_iterator_free (&iter3);
401 check_all (list1, list2, list3);
404 gl_list_free (list1);
405 gl_list_free (list2);
406 gl_list_free (list3);