1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006-2007 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__); \
44 #define RANDOM(n) (rand () % (n))
45 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
48 check_equals (gl_list_t list1, gl_list_t list2)
52 n = gl_list_size (list1);
53 ASSERT (n == gl_list_size (list2));
54 for (i = 0; i < n; i++)
56 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
61 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
63 check_equals (list1, list2);
64 check_equals (list1, list3);
68 main (int argc, char *argv[])
70 gl_list_t list1, list2, list3;
72 set_program_name (argv[0]);
74 /* Allow the user to provide a non-default random seed on the command line. */
76 srand (atoi (argv[1]));
79 size_t initial_size = RANDOM (50);
80 const void **contents =
81 (const void **) malloc (initial_size * sizeof (const void *));
85 for (i = 0; i < initial_size; i++)
86 contents[i] = RANDOM_OBJECT ();
89 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
90 initial_size, contents);
92 list2 = gl_list_create_empty (GL_LINKED_LIST, NULL, NULL, NULL, true);
93 for (i = 0; i < initial_size; i++)
94 gl_list_add_last (list2, contents[i]);
97 list3 = gl_list_create (GL_LINKED_LIST, NULL, NULL, NULL, true,
98 initial_size, contents);
100 check_all (list1, list2, list3);
102 for (repeat = 0; repeat < 10000; repeat++)
104 unsigned int operation = RANDOM (16);
108 if (gl_list_size (list1) > 0)
110 size_t index = RANDOM (gl_list_size (list1));
111 const char *obj = RANDOM_OBJECT ();
112 gl_list_node_t node1, node2, node3;
114 node1 = gl_list_set_at (list1, index, obj);
115 ASSERT (gl_list_get_at (list1, index) == obj);
116 ASSERT (gl_list_node_value (list1, node1) == obj);
118 node2 = gl_list_set_at (list2, index, obj);
119 ASSERT (gl_list_get_at (list2, index) == obj);
120 ASSERT (gl_list_node_value (list2, node2) == obj);
122 node3 = gl_list_set_at (list3, index, obj);
123 ASSERT (gl_list_get_at (list3, index) == obj);
124 ASSERT (gl_list_node_value (list3, node3) == obj);
128 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
129 == gl_list_get_at (list1, index - 1));
130 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
131 == gl_list_get_at (list2, index - 1));
132 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
133 == gl_list_get_at (list2, index - 1));
135 if (index + 1 < gl_list_size (list1))
137 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
138 == gl_list_get_at (list1, index + 1));
139 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
140 == gl_list_get_at (list2, index + 1));
141 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
142 == gl_list_get_at (list2, index + 1));
148 const char *obj = RANDOM_OBJECT ();
149 gl_list_node_t node1, node2, node3;
150 node1 = gl_list_search (list1, obj);
151 node2 = gl_list_search (list2, obj);
152 node3 = gl_list_search (list3, obj);
155 ASSERT (node2 == NULL);
156 ASSERT (node3 == NULL);
160 ASSERT (node2 != NULL);
161 ASSERT (node3 != NULL);
162 ASSERT (gl_list_node_value (list1, node1) == obj);
163 ASSERT (gl_list_node_value (list2, node2) == obj);
164 ASSERT (gl_list_node_value (list3, node3) == obj);
170 const char *obj = RANDOM_OBJECT ();
171 size_t index1, index2, index3;
172 index1 = gl_list_indexof (list1, obj);
173 index2 = gl_list_indexof (list2, obj);
174 index3 = gl_list_indexof (list3, obj);
175 if (index1 == (size_t)(-1))
177 ASSERT (index2 == (size_t)(-1));
178 ASSERT (index3 == (size_t)(-1));
182 ASSERT (index2 != (size_t)(-1));
183 ASSERT (index3 != (size_t)(-1));
184 ASSERT (gl_list_get_at (list1, index1) == obj);
185 ASSERT (gl_list_get_at (list2, index2) == obj);
186 ASSERT (gl_list_get_at (list3, index3) == obj);
187 ASSERT (index2 == index1);
188 ASSERT (index3 == index1);
192 case 3: /* add 1 element */
194 const char *obj = RANDOM_OBJECT ();
195 gl_list_node_t node1, node2, node3;
196 node1 = gl_list_add_first (list1, obj);
197 node2 = gl_list_add_first (list2, obj);
198 node3 = gl_list_add_first (list3, obj);
199 ASSERT (gl_list_node_value (list1, node1) == obj);
200 ASSERT (gl_list_node_value (list2, node2) == obj);
201 ASSERT (gl_list_node_value (list3, node3) == obj);
202 ASSERT (gl_list_get_at (list1, 0) == obj);
203 ASSERT (gl_list_get_at (list2, 0) == obj);
204 ASSERT (gl_list_get_at (list3, 0) == obj);
207 case 4: /* add 1 element */
209 const char *obj = RANDOM_OBJECT ();
210 gl_list_node_t node1, node2, node3;
211 node1 = gl_list_add_last (list1, obj);
212 node2 = gl_list_add_last (list2, obj);
213 node3 = gl_list_add_last (list3, obj);
214 ASSERT (gl_list_node_value (list1, node1) == obj);
215 ASSERT (gl_list_node_value (list2, node2) == obj);
216 ASSERT (gl_list_node_value (list3, node3) == obj);
217 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
218 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
219 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
222 case 5: /* add 3 elements */
224 const char *obj0 = RANDOM_OBJECT ();
225 const char *obj1 = RANDOM_OBJECT ();
226 const char *obj2 = RANDOM_OBJECT ();
227 gl_list_node_t node1, node2, node3;
228 node1 = gl_list_add_first (list1, obj2);
229 node1 = gl_list_add_before (list1, node1, obj0);
230 node1 = gl_list_add_after (list1, node1, obj1);
231 node2 = gl_list_add_first (list2, obj2);
232 node2 = gl_list_add_before (list2, node2, obj0);
233 node2 = gl_list_add_after (list2, node2, obj1);
234 node3 = gl_list_add_first (list3, obj2);
235 node3 = gl_list_add_before (list3, node3, obj0);
236 node3 = gl_list_add_after (list3, node3, obj1);
237 ASSERT (gl_list_node_value (list1, node1) == obj1);
238 ASSERT (gl_list_node_value (list2, node2) == obj1);
239 ASSERT (gl_list_node_value (list3, node3) == obj1);
240 ASSERT (gl_list_get_at (list1, 0) == obj0);
241 ASSERT (gl_list_get_at (list1, 1) == obj1);
242 ASSERT (gl_list_get_at (list1, 2) == obj2);
243 ASSERT (gl_list_get_at (list2, 0) == obj0);
244 ASSERT (gl_list_get_at (list2, 1) == obj1);
245 ASSERT (gl_list_get_at (list2, 2) == obj2);
246 ASSERT (gl_list_get_at (list3, 0) == obj0);
247 ASSERT (gl_list_get_at (list3, 1) == obj1);
248 ASSERT (gl_list_get_at (list3, 2) == obj2);
251 case 6: /* add 1 element */
253 size_t index = RANDOM (gl_list_size (list1) + 1);
254 const char *obj = RANDOM_OBJECT ();
255 gl_list_node_t node1, node2, node3;
256 node1 = gl_list_add_at (list1, index, obj);
257 node2 = gl_list_add_at (list2, index, obj);
258 node3 = gl_list_add_at (list3, index, obj);
259 ASSERT (gl_list_get_at (list1, index) == obj);
260 ASSERT (gl_list_node_value (list1, node1) == obj);
261 ASSERT (gl_list_get_at (list2, index) == obj);
262 ASSERT (gl_list_node_value (list2, node2) == obj);
263 ASSERT (gl_list_get_at (list3, index) == obj);
264 ASSERT (gl_list_node_value (list3, node3) == obj);
267 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
268 == gl_list_get_at (list1, index - 1));
269 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
270 == gl_list_get_at (list2, index - 1));
271 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
272 == gl_list_get_at (list2, index - 1));
274 if (index + 1 < gl_list_size (list1))
276 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
277 == gl_list_get_at (list1, index + 1));
278 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
279 == gl_list_get_at (list2, index + 1));
280 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
281 == gl_list_get_at (list2, index + 1));
285 case 7: case 8: /* remove 1 element */
286 if (gl_list_size (list1) > 0)
288 size_t n = gl_list_size (list1);
289 const char *obj = gl_list_get_at (list1, RANDOM (n));
290 gl_list_node_t node1, node2, node3;
291 node1 = gl_list_search (list1, obj);
292 node2 = gl_list_search (list2, obj);
293 node3 = gl_list_search (list3, obj);
294 ASSERT (node1 != NULL);
295 ASSERT (node2 != NULL);
296 ASSERT (node3 != NULL);
297 ASSERT (gl_list_remove_node (list1, node1));
298 ASSERT (gl_list_remove_node (list2, node2));
299 ASSERT (gl_list_remove_node (list3, node3));
300 ASSERT (gl_list_size (list1) == n - 1);
303 case 9: case 10: /* remove 1 element */
304 if (gl_list_size (list1) > 0)
306 size_t n = gl_list_size (list1);
307 size_t index = RANDOM (n);
308 ASSERT (gl_list_remove_at (list1, index));
309 ASSERT (gl_list_remove_at (list2, index));
310 ASSERT (gl_list_remove_at (list3, index));
311 ASSERT (gl_list_size (list1) == n - 1);
314 case 11: case 12: /* remove 1 element */
315 if (gl_list_size (list1) > 0)
317 size_t n = gl_list_size (list1);
318 const char *obj = gl_list_get_at (list1, RANDOM (n));
319 ASSERT (gl_list_remove (list1, obj));
320 ASSERT (gl_list_remove (list2, obj));
321 ASSERT (gl_list_remove (list3, obj));
322 ASSERT (gl_list_size (list1) == n - 1);
326 if (gl_list_size (list1) > 0)
328 size_t n = gl_list_size (list1);
329 const char *obj = "xyzzy";
330 ASSERT (!gl_list_remove (list1, obj));
331 ASSERT (!gl_list_remove (list2, obj));
332 ASSERT (!gl_list_remove (list3, obj));
333 ASSERT (gl_list_size (list1) == n);
338 size_t n = gl_list_size (list1);
339 gl_list_iterator_t iter1, iter2, iter3;
341 iter1 = gl_list_iterator (list1);
342 iter2 = gl_list_iterator (list2);
343 iter3 = gl_list_iterator (list3);
344 for (i = 0; i < n; i++)
346 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
347 ASSERT (gl_list_get_at (list1, i) == elt);
348 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
349 ASSERT (gl_list_get_at (list2, i) == elt);
350 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
351 ASSERT (gl_list_get_at (list3, i) == elt);
353 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
354 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
355 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
356 gl_list_iterator_free (&iter1);
357 gl_list_iterator_free (&iter2);
358 gl_list_iterator_free (&iter3);
363 size_t end = RANDOM (gl_list_size (list1) + 1);
364 size_t start = RANDOM (end + 1);
365 gl_list_iterator_t iter1, iter2, iter3;
367 iter1 = gl_list_iterator_from_to (list1, start, end);
368 iter2 = gl_list_iterator_from_to (list2, start, end);
369 iter3 = gl_list_iterator_from_to (list3, start, end);
370 for (i = start; i < end; i++)
372 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
373 ASSERT (gl_list_get_at (list1, i) == elt);
374 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
375 ASSERT (gl_list_get_at (list2, i) == elt);
376 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
377 ASSERT (gl_list_get_at (list3, i) == elt);
379 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
380 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
381 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
382 gl_list_iterator_free (&iter1);
383 gl_list_iterator_free (&iter2);
384 gl_list_iterator_free (&iter3);
388 check_all (list1, list2, list3);
391 gl_list_free (list1);
392 gl_list_free (list2);
393 gl_list_free (list3);