1 /* Test of sequential list data type implementation.
2 Copyright (C) 2006 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. */
25 #include "gl_array_list.h"
26 #include "gl_rbtree_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(condition) if (!(condition)) abort ()
37 #define RANDOM(n) (rand () % (n))
38 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
41 check_equals (gl_list_t list1, gl_list_t list2)
45 n = gl_list_size (list1);
46 ASSERT (n == gl_list_size (list2));
47 for (i = 0; i < n; i++)
49 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
54 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
56 gl_rbtree_list_check_invariants (list2);
57 gl_rbtree_list_check_invariants (list3);
58 check_equals (list1, list2);
59 check_equals (list1, list3);
63 main (int argc, char *argv[])
65 gl_list_t list1, list2, list3;
67 /* Allow the user to provide a non-default random seed on the command line. */
69 srand (atoi (argv[1]));
72 size_t initial_size = RANDOM (50);
73 const void **contents =
74 (const void **) malloc (initial_size * sizeof (const void *));
78 for (i = 0; i < initial_size; i++)
79 contents[i] = RANDOM_OBJECT ();
82 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, true,
83 initial_size, contents);
85 list2 = gl_list_create_empty (GL_RBTREE_LIST, NULL, NULL, true);
86 for (i = 0; i < initial_size; i++)
87 gl_list_add_last (list2, contents[i]);
90 list3 = gl_list_create (GL_RBTREE_LIST, NULL, NULL, true,
91 initial_size, contents);
93 check_all (list1, list2, list3);
95 for (repeat = 0; repeat < 10000; repeat++)
97 unsigned int operation = RANDOM (16);
101 if (gl_list_size (list1) > 0)
103 size_t index = RANDOM (gl_list_size (list1));
104 const char *obj = RANDOM_OBJECT ();
105 gl_list_node_t node1, node2, node3;
107 node1 = gl_list_set_at (list1, index, obj);
108 ASSERT (gl_list_get_at (list1, index) == obj);
109 ASSERT (gl_list_node_value (list1, node1) == obj);
111 node2 = gl_list_set_at (list2, index, obj);
112 ASSERT (gl_list_get_at (list2, index) == obj);
113 ASSERT (gl_list_node_value (list2, node2) == obj);
115 node3 = gl_list_set_at (list3, index, obj);
116 ASSERT (gl_list_get_at (list3, index) == obj);
117 ASSERT (gl_list_node_value (list3, node3) == obj);
121 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
122 == gl_list_get_at (list1, index - 1));
123 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
124 == gl_list_get_at (list2, index - 1));
125 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
126 == gl_list_get_at (list2, index - 1));
128 if (index + 1 < gl_list_size (list1))
130 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
131 == gl_list_get_at (list1, index + 1));
132 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
133 == gl_list_get_at (list2, index + 1));
134 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
135 == gl_list_get_at (list2, index + 1));
141 const char *obj = RANDOM_OBJECT ();
142 gl_list_node_t node1, node2, node3;
143 node1 = gl_list_search (list1, obj);
144 node2 = gl_list_search (list2, obj);
145 node3 = gl_list_search (list3, obj);
148 ASSERT (node2 == NULL);
149 ASSERT (node3 == NULL);
153 ASSERT (node2 != NULL);
154 ASSERT (node3 != NULL);
155 ASSERT (gl_list_node_value (list1, node1) == obj);
156 ASSERT (gl_list_node_value (list2, node2) == obj);
157 ASSERT (gl_list_node_value (list3, node3) == obj);
163 const char *obj = RANDOM_OBJECT ();
164 size_t index1, index2, index3;
165 index1 = gl_list_indexof (list1, obj);
166 index2 = gl_list_indexof (list2, obj);
167 index3 = gl_list_indexof (list3, obj);
168 if (index1 == (size_t)(-1))
170 ASSERT (index2 == (size_t)(-1));
171 ASSERT (index3 == (size_t)(-1));
175 ASSERT (index2 != (size_t)(-1));
176 ASSERT (index3 != (size_t)(-1));
177 ASSERT (gl_list_get_at (list1, index1) == obj);
178 ASSERT (gl_list_get_at (list2, index2) == obj);
179 ASSERT (gl_list_get_at (list3, index3) == obj);
180 ASSERT (index2 == index1);
181 ASSERT (index3 == index1);
185 case 3: /* add 1 element */
187 const char *obj = RANDOM_OBJECT ();
188 gl_list_node_t node1, node2, node3;
189 node1 = gl_list_add_first (list1, obj);
190 node2 = gl_list_add_first (list2, obj);
191 node3 = gl_list_add_first (list3, obj);
192 ASSERT (gl_list_node_value (list1, node1) == obj);
193 ASSERT (gl_list_node_value (list2, node2) == obj);
194 ASSERT (gl_list_node_value (list3, node3) == obj);
195 ASSERT (gl_list_get_at (list1, 0) == obj);
196 ASSERT (gl_list_get_at (list2, 0) == obj);
197 ASSERT (gl_list_get_at (list3, 0) == obj);
200 case 4: /* add 1 element */
202 const char *obj = RANDOM_OBJECT ();
203 gl_list_node_t node1, node2, node3;
204 node1 = gl_list_add_last (list1, obj);
205 node2 = gl_list_add_last (list2, obj);
206 node3 = gl_list_add_last (list3, obj);
207 ASSERT (gl_list_node_value (list1, node1) == obj);
208 ASSERT (gl_list_node_value (list2, node2) == obj);
209 ASSERT (gl_list_node_value (list3, node3) == obj);
210 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
211 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
212 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
215 case 5: /* add 3 elements */
217 const char *obj0 = RANDOM_OBJECT ();
218 const char *obj1 = RANDOM_OBJECT ();
219 const char *obj2 = RANDOM_OBJECT ();
220 gl_list_node_t node1, node2, node3;
221 node1 = gl_list_add_first (list1, obj2);
222 node1 = gl_list_add_before (list1, node1, obj0);
223 node1 = gl_list_add_after (list1, node1, obj1);
224 node2 = gl_list_add_first (list2, obj2);
225 node2 = gl_list_add_before (list2, node2, obj0);
226 node2 = gl_list_add_after (list2, node2, obj1);
227 node3 = gl_list_add_first (list3, obj2);
228 node3 = gl_list_add_before (list3, node3, obj0);
229 node3 = gl_list_add_after (list3, node3, obj1);
230 ASSERT (gl_list_node_value (list1, node1) == obj1);
231 ASSERT (gl_list_node_value (list2, node2) == obj1);
232 ASSERT (gl_list_node_value (list3, node3) == obj1);
233 ASSERT (gl_list_get_at (list1, 0) == obj0);
234 ASSERT (gl_list_get_at (list1, 1) == obj1);
235 ASSERT (gl_list_get_at (list1, 2) == obj2);
236 ASSERT (gl_list_get_at (list2, 0) == obj0);
237 ASSERT (gl_list_get_at (list2, 1) == obj1);
238 ASSERT (gl_list_get_at (list2, 2) == obj2);
239 ASSERT (gl_list_get_at (list3, 0) == obj0);
240 ASSERT (gl_list_get_at (list3, 1) == obj1);
241 ASSERT (gl_list_get_at (list3, 2) == obj2);
244 case 6: /* add 1 element */
246 size_t index = RANDOM (gl_list_size (list1) + 1);
247 const char *obj = RANDOM_OBJECT ();
248 gl_list_node_t node1, node2, node3;
249 node1 = gl_list_add_at (list1, index, obj);
250 node2 = gl_list_add_at (list2, index, obj);
251 node3 = gl_list_add_at (list3, index, obj);
252 ASSERT (gl_list_get_at (list1, index) == obj);
253 ASSERT (gl_list_node_value (list1, node1) == obj);
254 ASSERT (gl_list_get_at (list2, index) == obj);
255 ASSERT (gl_list_node_value (list2, node2) == obj);
256 ASSERT (gl_list_get_at (list3, index) == obj);
257 ASSERT (gl_list_node_value (list3, node3) == obj);
260 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
261 == gl_list_get_at (list1, index - 1));
262 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
263 == gl_list_get_at (list2, index - 1));
264 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
265 == gl_list_get_at (list2, index - 1));
267 if (index + 1 < gl_list_size (list1))
269 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
270 == gl_list_get_at (list1, index + 1));
271 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
272 == gl_list_get_at (list2, index + 1));
273 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
274 == gl_list_get_at (list2, index + 1));
278 case 7: case 8: /* remove 1 element */
279 if (gl_list_size (list1) > 0)
281 size_t n = gl_list_size (list1);
282 const char *obj = gl_list_get_at (list1, RANDOM (n));
283 gl_list_node_t node1, node2, node3;
284 node1 = gl_list_search (list1, obj);
285 node2 = gl_list_search (list2, obj);
286 node3 = gl_list_search (list3, obj);
287 ASSERT (node1 != NULL);
288 ASSERT (node2 != NULL);
289 ASSERT (node3 != NULL);
290 ASSERT (gl_list_remove_node (list1, node1));
291 ASSERT (gl_list_remove_node (list2, node2));
292 ASSERT (gl_list_remove_node (list3, node3));
293 ASSERT (gl_list_size (list1) == n - 1);
296 case 9: case 10: /* remove 1 element */
297 if (gl_list_size (list1) > 0)
299 size_t n = gl_list_size (list1);
300 size_t index = RANDOM (n);
301 ASSERT (gl_list_remove_at (list1, index));
302 ASSERT (gl_list_remove_at (list2, index));
303 ASSERT (gl_list_remove_at (list3, index));
304 ASSERT (gl_list_size (list1) == n - 1);
307 case 11: case 12: /* remove 1 element */
308 if (gl_list_size (list1) > 0)
310 size_t n = gl_list_size (list1);
311 const char *obj = gl_list_get_at (list1, RANDOM (n));
312 ASSERT (gl_list_remove (list1, obj));
313 ASSERT (gl_list_remove (list2, obj));
314 ASSERT (gl_list_remove (list3, obj));
315 ASSERT (gl_list_size (list1) == n - 1);
319 if (gl_list_size (list1) > 0)
321 size_t n = gl_list_size (list1);
322 const char *obj = "xyzzy";
323 ASSERT (!gl_list_remove (list1, obj));
324 ASSERT (!gl_list_remove (list2, obj));
325 ASSERT (!gl_list_remove (list3, obj));
326 ASSERT (gl_list_size (list1) == n);
331 size_t n = gl_list_size (list1);
332 gl_list_iterator_t iter1, iter2, iter3;
334 iter1 = gl_list_iterator (list1);
335 iter2 = gl_list_iterator (list2);
336 iter3 = gl_list_iterator (list3);
337 for (i = 0; i < n; i++)
339 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
340 ASSERT (gl_list_get_at (list1, i) == elt);
341 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
342 ASSERT (gl_list_get_at (list2, i) == elt);
343 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
344 ASSERT (gl_list_get_at (list3, i) == elt);
346 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
347 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
348 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
349 gl_list_iterator_free (&iter1);
350 gl_list_iterator_free (&iter2);
351 gl_list_iterator_free (&iter3);
356 size_t end = RANDOM (gl_list_size (list1) + 1);
357 size_t start = RANDOM (end + 1);
358 gl_list_iterator_t iter1, iter2, iter3;
360 iter1 = gl_list_iterator_from_to (list1, start, end);
361 iter2 = gl_list_iterator_from_to (list2, start, end);
362 iter3 = gl_list_iterator_from_to (list3, start, end);
363 for (i = start; i < end; i++)
365 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
366 ASSERT (gl_list_get_at (list1, i) == elt);
367 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
368 ASSERT (gl_list_get_at (list2, i) == elt);
369 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
370 ASSERT (gl_list_get_at (list3, i) == elt);
372 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
373 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
374 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
375 gl_list_iterator_free (&iter1);
376 gl_list_iterator_free (&iter2);
377 gl_list_iterator_free (&iter3);
381 check_all (list1, list2, list3);
384 gl_list_free (list1);
385 gl_list_free (list2);
386 gl_list_free (list3);