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 2, or (at your option)
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, write to the Free Software Foundation,
17 Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
23 #include "gl_avltree_list.h"
27 #include "gl_array_list.h"
30 extern void gl_avltree_list_check_invariants (gl_list_t list);
32 static const char *objects[15] =
34 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
37 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
38 #define ASSERT(condition) if (!(condition)) abort ()
39 #define RANDOM(n) (rand () % (n))
40 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
43 check_equals (gl_list_t list1, gl_list_t list2)
47 n = gl_list_size (list1);
48 ASSERT (n == gl_list_size (list2));
49 for (i = 0; i < n; i++)
51 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
56 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
58 gl_avltree_list_check_invariants (list2);
59 gl_avltree_list_check_invariants (list3);
60 check_equals (list1, list2);
61 check_equals (list1, list3);
65 main (int argc, char *argv[])
67 gl_list_t list1, list2, list3;
69 /* Allow the user to provide a non-default random seed on the command line. */
71 srand (atoi (argv[1]));
74 size_t initial_size = RANDOM (50);
75 const void **contents =
76 (const void **) malloc (initial_size * sizeof (const void *));
80 for (i = 0; i < initial_size; i++)
81 contents[i] = RANDOM_OBJECT ();
84 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
85 initial_size, contents);
87 list2 = gl_list_create_empty (GL_AVLTREE_LIST, NULL, NULL, NULL, true);
88 for (i = 0; i < initial_size; i++)
89 gl_list_add_last (list2, contents[i]);
92 list3 = gl_list_create (GL_AVLTREE_LIST, NULL, NULL, NULL, true,
93 initial_size, contents);
95 check_all (list1, list2, list3);
97 for (repeat = 0; repeat < 10000; repeat++)
99 unsigned int operation = RANDOM (16);
103 if (gl_list_size (list1) > 0)
105 size_t index = RANDOM (gl_list_size (list1));
106 const char *obj = RANDOM_OBJECT ();
107 gl_list_node_t node1, node2, node3;
109 node1 = gl_list_set_at (list1, index, obj);
110 ASSERT (gl_list_get_at (list1, index) == obj);
111 ASSERT (gl_list_node_value (list1, node1) == obj);
113 node2 = gl_list_set_at (list2, index, obj);
114 ASSERT (gl_list_get_at (list2, index) == obj);
115 ASSERT (gl_list_node_value (list2, node2) == obj);
117 node3 = gl_list_set_at (list3, index, obj);
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_add_first (list1, obj);
192 node2 = gl_list_add_first (list2, obj);
193 node3 = gl_list_add_first (list3, obj);
194 ASSERT (gl_list_node_value (list1, node1) == obj);
195 ASSERT (gl_list_node_value (list2, node2) == obj);
196 ASSERT (gl_list_node_value (list3, node3) == obj);
197 ASSERT (gl_list_get_at (list1, 0) == obj);
198 ASSERT (gl_list_get_at (list2, 0) == obj);
199 ASSERT (gl_list_get_at (list3, 0) == obj);
202 case 4: /* add 1 element */
204 const char *obj = RANDOM_OBJECT ();
205 gl_list_node_t node1, node2, node3;
206 node1 = gl_list_add_last (list1, obj);
207 node2 = gl_list_add_last (list2, obj);
208 node3 = gl_list_add_last (list3, obj);
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, gl_list_size (list1) - 1) == obj);
213 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
214 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
217 case 5: /* add 3 elements */
219 const char *obj0 = RANDOM_OBJECT ();
220 const char *obj1 = RANDOM_OBJECT ();
221 const char *obj2 = RANDOM_OBJECT ();
222 gl_list_node_t node1, node2, node3;
223 node1 = gl_list_add_first (list1, obj2);
224 node1 = gl_list_add_before (list1, node1, obj0);
225 node1 = gl_list_add_after (list1, node1, obj1);
226 node2 = gl_list_add_first (list2, obj2);
227 node2 = gl_list_add_before (list2, node2, obj0);
228 node2 = gl_list_add_after (list2, node2, obj1);
229 node3 = gl_list_add_first (list3, obj2);
230 node3 = gl_list_add_before (list3, node3, obj0);
231 node3 = gl_list_add_after (list3, node3, obj1);
232 ASSERT (gl_list_node_value (list1, node1) == obj1);
233 ASSERT (gl_list_node_value (list2, node2) == obj1);
234 ASSERT (gl_list_node_value (list3, node3) == obj1);
235 ASSERT (gl_list_get_at (list1, 0) == obj0);
236 ASSERT (gl_list_get_at (list1, 1) == obj1);
237 ASSERT (gl_list_get_at (list1, 2) == obj2);
238 ASSERT (gl_list_get_at (list2, 0) == obj0);
239 ASSERT (gl_list_get_at (list2, 1) == obj1);
240 ASSERT (gl_list_get_at (list2, 2) == obj2);
241 ASSERT (gl_list_get_at (list3, 0) == obj0);
242 ASSERT (gl_list_get_at (list3, 1) == obj1);
243 ASSERT (gl_list_get_at (list3, 2) == obj2);
246 case 6: /* add 1 element */
248 size_t index = RANDOM (gl_list_size (list1) + 1);
249 const char *obj = RANDOM_OBJECT ();
250 gl_list_node_t node1, node2, node3;
251 node1 = gl_list_add_at (list1, index, obj);
252 node2 = gl_list_add_at (list2, index, obj);
253 node3 = gl_list_add_at (list3, index, obj);
254 ASSERT (gl_list_get_at (list1, index) == obj);
255 ASSERT (gl_list_node_value (list1, node1) == obj);
256 ASSERT (gl_list_get_at (list2, index) == obj);
257 ASSERT (gl_list_node_value (list2, node2) == obj);
258 ASSERT (gl_list_get_at (list3, index) == obj);
259 ASSERT (gl_list_node_value (list3, node3) == obj);
262 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
263 == gl_list_get_at (list1, index - 1));
264 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
265 == gl_list_get_at (list2, index - 1));
266 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
267 == gl_list_get_at (list2, index - 1));
269 if (index + 1 < gl_list_size (list1))
271 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
272 == gl_list_get_at (list1, index + 1));
273 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
274 == gl_list_get_at (list2, index + 1));
275 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
276 == gl_list_get_at (list2, index + 1));
280 case 7: case 8: /* remove 1 element */
281 if (gl_list_size (list1) > 0)
283 size_t n = gl_list_size (list1);
284 const char *obj = gl_list_get_at (list1, RANDOM (n));
285 gl_list_node_t node1, node2, node3;
286 node1 = gl_list_search (list1, obj);
287 node2 = gl_list_search (list2, obj);
288 node3 = gl_list_search (list3, obj);
289 ASSERT (node1 != NULL);
290 ASSERT (node2 != NULL);
291 ASSERT (node3 != NULL);
292 ASSERT (gl_list_remove_node (list1, node1));
293 ASSERT (gl_list_remove_node (list2, node2));
294 ASSERT (gl_list_remove_node (list3, node3));
295 ASSERT (gl_list_size (list1) == n - 1);
298 case 9: case 10: /* remove 1 element */
299 if (gl_list_size (list1) > 0)
301 size_t n = gl_list_size (list1);
302 size_t index = RANDOM (n);
303 ASSERT (gl_list_remove_at (list1, index));
304 ASSERT (gl_list_remove_at (list2, index));
305 ASSERT (gl_list_remove_at (list3, index));
306 ASSERT (gl_list_size (list1) == n - 1);
309 case 11: case 12: /* remove 1 element */
310 if (gl_list_size (list1) > 0)
312 size_t n = gl_list_size (list1);
313 const char *obj = gl_list_get_at (list1, RANDOM (n));
314 ASSERT (gl_list_remove (list1, obj));
315 ASSERT (gl_list_remove (list2, obj));
316 ASSERT (gl_list_remove (list3, obj));
317 ASSERT (gl_list_size (list1) == n - 1);
321 if (gl_list_size (list1) > 0)
323 size_t n = gl_list_size (list1);
324 const char *obj = "xyzzy";
325 ASSERT (!gl_list_remove (list1, obj));
326 ASSERT (!gl_list_remove (list2, obj));
327 ASSERT (!gl_list_remove (list3, obj));
328 ASSERT (gl_list_size (list1) == n);
333 size_t n = gl_list_size (list1);
334 gl_list_iterator_t iter1, iter2, iter3;
336 iter1 = gl_list_iterator (list1);
337 iter2 = gl_list_iterator (list2);
338 iter3 = gl_list_iterator (list3);
339 for (i = 0; i < n; i++)
341 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
342 ASSERT (gl_list_get_at (list1, i) == elt);
343 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
344 ASSERT (gl_list_get_at (list2, i) == elt);
345 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
346 ASSERT (gl_list_get_at (list3, i) == elt);
348 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
349 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
350 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
351 gl_list_iterator_free (&iter1);
352 gl_list_iterator_free (&iter2);
353 gl_list_iterator_free (&iter3);
358 size_t end = RANDOM (gl_list_size (list1) + 1);
359 size_t start = RANDOM (end + 1);
360 gl_list_iterator_t iter1, iter2, iter3;
362 iter1 = gl_list_iterator_from_to (list1, start, end);
363 iter2 = gl_list_iterator_from_to (list2, start, end);
364 iter3 = gl_list_iterator_from_to (list3, start, end);
365 for (i = start; i < end; i++)
367 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
368 ASSERT (gl_list_get_at (list1, i) == elt);
369 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
370 ASSERT (gl_list_get_at (list2, i) == elt);
371 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
372 ASSERT (gl_list_get_at (list3, i) == elt);
374 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
375 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
376 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
377 gl_list_iterator_free (&iter1);
378 gl_list_iterator_free (&iter2);
379 gl_list_iterator_free (&iter3);
383 check_all (list1, list2, list3);
386 gl_list_free (list1);
387 gl_list_free (list2);
388 gl_list_free (list3);