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_rbtree_list.h"
25 #include "gl_array_list.h"
28 extern void gl_rbtree_list_check_invariants (gl_list_t list);
30 static const char *objects[15] =
32 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
35 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
36 #define ASSERT(expr) \
41 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
47 #define RANDOM(n) (rand () % (n))
48 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
51 check_equals (gl_list_t list1, gl_list_t list2)
55 n = gl_list_size (list1);
56 ASSERT (n == gl_list_size (list2));
57 for (i = 0; i < n; i++)
59 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
64 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
66 gl_rbtree_list_check_invariants (list2);
67 gl_rbtree_list_check_invariants (list3);
68 check_equals (list1, list2);
69 check_equals (list1, list3);
73 main (int argc, char *argv[])
75 gl_list_t list1, list2, list3;
77 set_program_name (argv[0]);
79 /* Allow the user to provide a non-default random seed on the command line. */
81 srand (atoi (argv[1]));
84 size_t initial_size = RANDOM (50);
85 const void **contents =
86 (const void **) malloc (initial_size * sizeof (const void *));
90 for (i = 0; i < initial_size; i++)
91 contents[i] = RANDOM_OBJECT ();
94 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
95 initial_size, contents);
97 list2 = gl_list_create_empty (GL_RBTREE_LIST, NULL, NULL, NULL, true);
98 for (i = 0; i < initial_size; i++)
99 gl_list_add_last (list2, contents[i]);
102 list3 = gl_list_create (GL_RBTREE_LIST, NULL, NULL, NULL, true,
103 initial_size, contents);
105 check_all (list1, list2, list3);
107 for (repeat = 0; repeat < 10000; repeat++)
109 unsigned int operation = RANDOM (16);
113 if (gl_list_size (list1) > 0)
115 size_t index = RANDOM (gl_list_size (list1));
116 const char *obj = RANDOM_OBJECT ();
117 gl_list_node_t node1, node2, node3;
119 node1 = gl_list_set_at (list1, index, obj);
120 ASSERT (gl_list_get_at (list1, index) == obj);
121 ASSERT (gl_list_node_value (list1, node1) == obj);
123 node2 = gl_list_set_at (list2, index, obj);
124 ASSERT (gl_list_get_at (list2, index) == obj);
125 ASSERT (gl_list_node_value (list2, node2) == obj);
127 node3 = gl_list_set_at (list3, index, obj);
128 ASSERT (gl_list_get_at (list3, index) == obj);
129 ASSERT (gl_list_node_value (list3, node3) == obj);
133 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
134 == gl_list_get_at (list1, index - 1));
135 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
136 == gl_list_get_at (list2, index - 1));
137 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
138 == gl_list_get_at (list2, index - 1));
140 if (index + 1 < gl_list_size (list1))
142 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
143 == gl_list_get_at (list1, index + 1));
144 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
145 == gl_list_get_at (list2, index + 1));
146 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
147 == gl_list_get_at (list2, index + 1));
153 const char *obj = RANDOM_OBJECT ();
154 gl_list_node_t node1, node2, node3;
155 node1 = gl_list_search (list1, obj);
156 node2 = gl_list_search (list2, obj);
157 node3 = gl_list_search (list3, obj);
160 ASSERT (node2 == NULL);
161 ASSERT (node3 == NULL);
165 ASSERT (node2 != NULL);
166 ASSERT (node3 != NULL);
167 ASSERT (gl_list_node_value (list1, node1) == obj);
168 ASSERT (gl_list_node_value (list2, node2) == obj);
169 ASSERT (gl_list_node_value (list3, node3) == obj);
175 const char *obj = RANDOM_OBJECT ();
176 size_t index1, index2, index3;
177 index1 = gl_list_indexof (list1, obj);
178 index2 = gl_list_indexof (list2, obj);
179 index3 = gl_list_indexof (list3, obj);
180 if (index1 == (size_t)(-1))
182 ASSERT (index2 == (size_t)(-1));
183 ASSERT (index3 == (size_t)(-1));
187 ASSERT (index2 != (size_t)(-1));
188 ASSERT (index3 != (size_t)(-1));
189 ASSERT (gl_list_get_at (list1, index1) == obj);
190 ASSERT (gl_list_get_at (list2, index2) == obj);
191 ASSERT (gl_list_get_at (list3, index3) == obj);
192 ASSERT (index2 == index1);
193 ASSERT (index3 == index1);
197 case 3: /* add 1 element */
199 const char *obj = RANDOM_OBJECT ();
200 gl_list_node_t node1, node2, node3;
201 node1 = gl_list_add_first (list1, obj);
202 node2 = gl_list_add_first (list2, obj);
203 node3 = gl_list_add_first (list3, obj);
204 ASSERT (gl_list_node_value (list1, node1) == obj);
205 ASSERT (gl_list_node_value (list2, node2) == obj);
206 ASSERT (gl_list_node_value (list3, node3) == obj);
207 ASSERT (gl_list_get_at (list1, 0) == obj);
208 ASSERT (gl_list_get_at (list2, 0) == obj);
209 ASSERT (gl_list_get_at (list3, 0) == obj);
212 case 4: /* add 1 element */
214 const char *obj = RANDOM_OBJECT ();
215 gl_list_node_t node1, node2, node3;
216 node1 = gl_list_add_last (list1, obj);
217 node2 = gl_list_add_last (list2, obj);
218 node3 = gl_list_add_last (list3, obj);
219 ASSERT (gl_list_node_value (list1, node1) == obj);
220 ASSERT (gl_list_node_value (list2, node2) == obj);
221 ASSERT (gl_list_node_value (list3, node3) == obj);
222 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
223 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
224 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
227 case 5: /* add 3 elements */
229 const char *obj0 = RANDOM_OBJECT ();
230 const char *obj1 = RANDOM_OBJECT ();
231 const char *obj2 = RANDOM_OBJECT ();
232 gl_list_node_t node1, node2, node3;
233 node1 = gl_list_add_first (list1, obj2);
234 node1 = gl_list_add_before (list1, node1, obj0);
235 node1 = gl_list_add_after (list1, node1, obj1);
236 node2 = gl_list_add_first (list2, obj2);
237 node2 = gl_list_add_before (list2, node2, obj0);
238 node2 = gl_list_add_after (list2, node2, obj1);
239 node3 = gl_list_add_first (list3, obj2);
240 node3 = gl_list_add_before (list3, node3, obj0);
241 node3 = gl_list_add_after (list3, node3, obj1);
242 ASSERT (gl_list_node_value (list1, node1) == obj1);
243 ASSERT (gl_list_node_value (list2, node2) == obj1);
244 ASSERT (gl_list_node_value (list3, node3) == obj1);
245 ASSERT (gl_list_get_at (list1, 0) == obj0);
246 ASSERT (gl_list_get_at (list1, 1) == obj1);
247 ASSERT (gl_list_get_at (list1, 2) == obj2);
248 ASSERT (gl_list_get_at (list2, 0) == obj0);
249 ASSERT (gl_list_get_at (list2, 1) == obj1);
250 ASSERT (gl_list_get_at (list2, 2) == obj2);
251 ASSERT (gl_list_get_at (list3, 0) == obj0);
252 ASSERT (gl_list_get_at (list3, 1) == obj1);
253 ASSERT (gl_list_get_at (list3, 2) == obj2);
256 case 6: /* add 1 element */
258 size_t index = RANDOM (gl_list_size (list1) + 1);
259 const char *obj = RANDOM_OBJECT ();
260 gl_list_node_t node1, node2, node3;
261 node1 = gl_list_add_at (list1, index, obj);
262 node2 = gl_list_add_at (list2, index, obj);
263 node3 = gl_list_add_at (list3, index, obj);
264 ASSERT (gl_list_get_at (list1, index) == obj);
265 ASSERT (gl_list_node_value (list1, node1) == obj);
266 ASSERT (gl_list_get_at (list2, index) == obj);
267 ASSERT (gl_list_node_value (list2, node2) == obj);
268 ASSERT (gl_list_get_at (list3, index) == obj);
269 ASSERT (gl_list_node_value (list3, node3) == obj);
272 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
273 == gl_list_get_at (list1, index - 1));
274 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
275 == gl_list_get_at (list2, index - 1));
276 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
277 == gl_list_get_at (list2, index - 1));
279 if (index + 1 < gl_list_size (list1))
281 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
282 == gl_list_get_at (list1, index + 1));
283 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
284 == gl_list_get_at (list2, index + 1));
285 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
286 == gl_list_get_at (list2, index + 1));
290 case 7: case 8: /* remove 1 element */
291 if (gl_list_size (list1) > 0)
293 size_t n = gl_list_size (list1);
294 const char *obj = gl_list_get_at (list1, RANDOM (n));
295 gl_list_node_t node1, node2, node3;
296 node1 = gl_list_search (list1, obj);
297 node2 = gl_list_search (list2, obj);
298 node3 = gl_list_search (list3, obj);
299 ASSERT (node1 != NULL);
300 ASSERT (node2 != NULL);
301 ASSERT (node3 != NULL);
302 ASSERT (gl_list_remove_node (list1, node1));
303 ASSERT (gl_list_remove_node (list2, node2));
304 ASSERT (gl_list_remove_node (list3, node3));
305 ASSERT (gl_list_size (list1) == n - 1);
308 case 9: case 10: /* remove 1 element */
309 if (gl_list_size (list1) > 0)
311 size_t n = gl_list_size (list1);
312 size_t index = RANDOM (n);
313 ASSERT (gl_list_remove_at (list1, index));
314 ASSERT (gl_list_remove_at (list2, index));
315 ASSERT (gl_list_remove_at (list3, index));
316 ASSERT (gl_list_size (list1) == n - 1);
319 case 11: case 12: /* remove 1 element */
320 if (gl_list_size (list1) > 0)
322 size_t n = gl_list_size (list1);
323 const char *obj = gl_list_get_at (list1, RANDOM (n));
324 ASSERT (gl_list_remove (list1, obj));
325 ASSERT (gl_list_remove (list2, obj));
326 ASSERT (gl_list_remove (list3, obj));
327 ASSERT (gl_list_size (list1) == n - 1);
331 if (gl_list_size (list1) > 0)
333 size_t n = gl_list_size (list1);
334 const char *obj = "xyzzy";
335 ASSERT (!gl_list_remove (list1, obj));
336 ASSERT (!gl_list_remove (list2, obj));
337 ASSERT (!gl_list_remove (list3, obj));
338 ASSERT (gl_list_size (list1) == n);
343 size_t n = gl_list_size (list1);
344 gl_list_iterator_t iter1, iter2, iter3;
346 iter1 = gl_list_iterator (list1);
347 iter2 = gl_list_iterator (list2);
348 iter3 = gl_list_iterator (list3);
349 for (i = 0; i < n; i++)
351 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
352 ASSERT (gl_list_get_at (list1, i) == elt);
353 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
354 ASSERT (gl_list_get_at (list2, i) == elt);
355 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
356 ASSERT (gl_list_get_at (list3, i) == elt);
358 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
359 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
360 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
361 gl_list_iterator_free (&iter1);
362 gl_list_iterator_free (&iter2);
363 gl_list_iterator_free (&iter3);
368 size_t end = RANDOM (gl_list_size (list1) + 1);
369 size_t start = RANDOM (end + 1);
370 gl_list_iterator_t iter1, iter2, iter3;
372 iter1 = gl_list_iterator_from_to (list1, start, end);
373 iter2 = gl_list_iterator_from_to (list2, start, end);
374 iter3 = gl_list_iterator_from_to (list3, start, end);
375 for (i = start; i < end; i++)
377 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
378 ASSERT (gl_list_get_at (list1, i) == elt);
379 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
380 ASSERT (gl_list_get_at (list2, i) == elt);
381 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
382 ASSERT (gl_list_get_at (list3, i) == elt);
384 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
385 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
386 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
387 gl_list_iterator_free (&iter1);
388 gl_list_iterator_free (&iter2);
389 gl_list_iterator_free (&iter3);
393 check_all (list1, list2, list3);
396 gl_list_free (list1);
397 gl_list_free (list2);
398 gl_list_free (list3);