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_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__); \
46 #define RANDOM(n) (rand () % (n))
47 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
50 check_equals (gl_list_t list1, gl_list_t list2)
54 n = gl_list_size (list1);
55 ASSERT (n == gl_list_size (list2));
56 for (i = 0; i < n; i++)
58 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
63 check_all (gl_list_t list1, gl_list_t list2, gl_list_t list3)
65 gl_rbtree_list_check_invariants (list2);
66 gl_rbtree_list_check_invariants (list3);
67 check_equals (list1, list2);
68 check_equals (list1, list3);
72 main (int argc, char *argv[])
74 gl_list_t list1, list2, list3;
76 set_program_name (argv[0]);
78 /* Allow the user to provide a non-default random seed on the command line. */
80 srand (atoi (argv[1]));
83 size_t initial_size = RANDOM (50);
84 const void **contents =
85 (const void **) malloc (initial_size * sizeof (const void *));
89 for (i = 0; i < initial_size; i++)
90 contents[i] = RANDOM_OBJECT ();
93 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
94 initial_size, contents);
96 list2 = gl_list_create_empty (GL_RBTREE_LIST, NULL, NULL, NULL, true);
97 for (i = 0; i < initial_size; i++)
98 gl_list_add_last (list2, contents[i]);
101 list3 = gl_list_create (GL_RBTREE_LIST, NULL, NULL, NULL, true,
102 initial_size, contents);
104 check_all (list1, list2, list3);
106 for (repeat = 0; repeat < 10000; repeat++)
108 unsigned int operation = RANDOM (16);
112 if (gl_list_size (list1) > 0)
114 size_t index = RANDOM (gl_list_size (list1));
115 const char *obj = RANDOM_OBJECT ();
116 gl_list_node_t node1, node2, node3;
118 node1 = gl_list_set_at (list1, index, obj);
119 ASSERT (gl_list_get_at (list1, index) == obj);
120 ASSERT (gl_list_node_value (list1, node1) == obj);
122 node2 = gl_list_set_at (list2, index, obj);
123 ASSERT (gl_list_get_at (list2, index) == obj);
124 ASSERT (gl_list_node_value (list2, node2) == obj);
126 node3 = gl_list_set_at (list3, index, obj);
127 ASSERT (gl_list_get_at (list3, index) == obj);
128 ASSERT (gl_list_node_value (list3, node3) == obj);
132 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
133 == gl_list_get_at (list1, index - 1));
134 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
135 == gl_list_get_at (list2, index - 1));
136 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
137 == gl_list_get_at (list2, index - 1));
139 if (index + 1 < gl_list_size (list1))
141 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
142 == gl_list_get_at (list1, index + 1));
143 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
144 == gl_list_get_at (list2, index + 1));
145 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
146 == gl_list_get_at (list2, index + 1));
152 const char *obj = RANDOM_OBJECT ();
153 gl_list_node_t node1, node2, node3;
154 node1 = gl_list_search (list1, obj);
155 node2 = gl_list_search (list2, obj);
156 node3 = gl_list_search (list3, obj);
159 ASSERT (node2 == NULL);
160 ASSERT (node3 == NULL);
164 ASSERT (node2 != NULL);
165 ASSERT (node3 != NULL);
166 ASSERT (gl_list_node_value (list1, node1) == obj);
167 ASSERT (gl_list_node_value (list2, node2) == obj);
168 ASSERT (gl_list_node_value (list3, node3) == obj);
174 const char *obj = RANDOM_OBJECT ();
175 size_t index1, index2, index3;
176 index1 = gl_list_indexof (list1, obj);
177 index2 = gl_list_indexof (list2, obj);
178 index3 = gl_list_indexof (list3, obj);
179 if (index1 == (size_t)(-1))
181 ASSERT (index2 == (size_t)(-1));
182 ASSERT (index3 == (size_t)(-1));
186 ASSERT (index2 != (size_t)(-1));
187 ASSERT (index3 != (size_t)(-1));
188 ASSERT (gl_list_get_at (list1, index1) == obj);
189 ASSERT (gl_list_get_at (list2, index2) == obj);
190 ASSERT (gl_list_get_at (list3, index3) == obj);
191 ASSERT (index2 == index1);
192 ASSERT (index3 == index1);
196 case 3: /* add 1 element */
198 const char *obj = RANDOM_OBJECT ();
199 gl_list_node_t node1, node2, node3;
200 node1 = gl_list_add_first (list1, obj);
201 node2 = gl_list_add_first (list2, obj);
202 node3 = gl_list_add_first (list3, obj);
203 ASSERT (gl_list_node_value (list1, node1) == obj);
204 ASSERT (gl_list_node_value (list2, node2) == obj);
205 ASSERT (gl_list_node_value (list3, node3) == obj);
206 ASSERT (gl_list_get_at (list1, 0) == obj);
207 ASSERT (gl_list_get_at (list2, 0) == obj);
208 ASSERT (gl_list_get_at (list3, 0) == obj);
211 case 4: /* add 1 element */
213 const char *obj = RANDOM_OBJECT ();
214 gl_list_node_t node1, node2, node3;
215 node1 = gl_list_add_last (list1, obj);
216 node2 = gl_list_add_last (list2, obj);
217 node3 = gl_list_add_last (list3, obj);
218 ASSERT (gl_list_node_value (list1, node1) == obj);
219 ASSERT (gl_list_node_value (list2, node2) == obj);
220 ASSERT (gl_list_node_value (list3, node3) == obj);
221 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
222 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
223 ASSERT (gl_list_get_at (list3, gl_list_size (list3) - 1) == obj);
226 case 5: /* add 3 elements */
228 const char *obj0 = RANDOM_OBJECT ();
229 const char *obj1 = RANDOM_OBJECT ();
230 const char *obj2 = RANDOM_OBJECT ();
231 gl_list_node_t node1, node2, node3;
232 node1 = gl_list_add_first (list1, obj2);
233 node1 = gl_list_add_before (list1, node1, obj0);
234 node1 = gl_list_add_after (list1, node1, obj1);
235 node2 = gl_list_add_first (list2, obj2);
236 node2 = gl_list_add_before (list2, node2, obj0);
237 node2 = gl_list_add_after (list2, node2, obj1);
238 node3 = gl_list_add_first (list3, obj2);
239 node3 = gl_list_add_before (list3, node3, obj0);
240 node3 = gl_list_add_after (list3, node3, obj1);
241 ASSERT (gl_list_node_value (list1, node1) == obj1);
242 ASSERT (gl_list_node_value (list2, node2) == obj1);
243 ASSERT (gl_list_node_value (list3, node3) == obj1);
244 ASSERT (gl_list_get_at (list1, 0) == obj0);
245 ASSERT (gl_list_get_at (list1, 1) == obj1);
246 ASSERT (gl_list_get_at (list1, 2) == obj2);
247 ASSERT (gl_list_get_at (list2, 0) == obj0);
248 ASSERT (gl_list_get_at (list2, 1) == obj1);
249 ASSERT (gl_list_get_at (list2, 2) == obj2);
250 ASSERT (gl_list_get_at (list3, 0) == obj0);
251 ASSERT (gl_list_get_at (list3, 1) == obj1);
252 ASSERT (gl_list_get_at (list3, 2) == obj2);
255 case 6: /* add 1 element */
257 size_t index = RANDOM (gl_list_size (list1) + 1);
258 const char *obj = RANDOM_OBJECT ();
259 gl_list_node_t node1, node2, node3;
260 node1 = gl_list_add_at (list1, index, obj);
261 node2 = gl_list_add_at (list2, index, obj);
262 node3 = gl_list_add_at (list3, index, obj);
263 ASSERT (gl_list_get_at (list1, index) == obj);
264 ASSERT (gl_list_node_value (list1, node1) == obj);
265 ASSERT (gl_list_get_at (list2, index) == obj);
266 ASSERT (gl_list_node_value (list2, node2) == obj);
267 ASSERT (gl_list_get_at (list3, index) == obj);
268 ASSERT (gl_list_node_value (list3, node3) == obj);
271 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
272 == gl_list_get_at (list1, index - 1));
273 ASSERT (gl_list_node_value (list2, gl_list_previous_node (list3, node3))
274 == gl_list_get_at (list2, index - 1));
275 ASSERT (gl_list_node_value (list3, gl_list_previous_node (list3, node3))
276 == gl_list_get_at (list2, index - 1));
278 if (index + 1 < gl_list_size (list1))
280 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
281 == gl_list_get_at (list1, index + 1));
282 ASSERT (gl_list_node_value (list2, gl_list_next_node (list3, node3))
283 == gl_list_get_at (list2, index + 1));
284 ASSERT (gl_list_node_value (list3, gl_list_next_node (list3, node3))
285 == gl_list_get_at (list2, index + 1));
289 case 7: case 8: /* remove 1 element */
290 if (gl_list_size (list1) > 0)
292 size_t n = gl_list_size (list1);
293 const char *obj = gl_list_get_at (list1, RANDOM (n));
294 gl_list_node_t node1, node2, node3;
295 node1 = gl_list_search (list1, obj);
296 node2 = gl_list_search (list2, obj);
297 node3 = gl_list_search (list3, obj);
298 ASSERT (node1 != NULL);
299 ASSERT (node2 != NULL);
300 ASSERT (node3 != NULL);
301 ASSERT (gl_list_remove_node (list1, node1));
302 ASSERT (gl_list_remove_node (list2, node2));
303 ASSERT (gl_list_remove_node (list3, node3));
304 ASSERT (gl_list_size (list1) == n - 1);
307 case 9: case 10: /* remove 1 element */
308 if (gl_list_size (list1) > 0)
310 size_t n = gl_list_size (list1);
311 size_t index = RANDOM (n);
312 ASSERT (gl_list_remove_at (list1, index));
313 ASSERT (gl_list_remove_at (list2, index));
314 ASSERT (gl_list_remove_at (list3, index));
315 ASSERT (gl_list_size (list1) == n - 1);
318 case 11: case 12: /* remove 1 element */
319 if (gl_list_size (list1) > 0)
321 size_t n = gl_list_size (list1);
322 const char *obj = gl_list_get_at (list1, RANDOM (n));
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 - 1);
330 if (gl_list_size (list1) > 0)
332 size_t n = gl_list_size (list1);
333 const char *obj = "xyzzy";
334 ASSERT (!gl_list_remove (list1, obj));
335 ASSERT (!gl_list_remove (list2, obj));
336 ASSERT (!gl_list_remove (list3, obj));
337 ASSERT (gl_list_size (list1) == n);
342 size_t n = gl_list_size (list1);
343 gl_list_iterator_t iter1, iter2, iter3;
345 iter1 = gl_list_iterator (list1);
346 iter2 = gl_list_iterator (list2);
347 iter3 = gl_list_iterator (list3);
348 for (i = 0; i < n; i++)
350 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
351 ASSERT (gl_list_get_at (list1, i) == elt);
352 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
353 ASSERT (gl_list_get_at (list2, i) == elt);
354 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
355 ASSERT (gl_list_get_at (list3, i) == elt);
357 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
358 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
359 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
360 gl_list_iterator_free (&iter1);
361 gl_list_iterator_free (&iter2);
362 gl_list_iterator_free (&iter3);
367 size_t end = RANDOM (gl_list_size (list1) + 1);
368 size_t start = RANDOM (end + 1);
369 gl_list_iterator_t iter1, iter2, iter3;
371 iter1 = gl_list_iterator_from_to (list1, start, end);
372 iter2 = gl_list_iterator_from_to (list2, start, end);
373 iter3 = gl_list_iterator_from_to (list3, start, end);
374 for (i = start; i < end; i++)
376 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
377 ASSERT (gl_list_get_at (list1, i) == elt);
378 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
379 ASSERT (gl_list_get_at (list2, i) == elt);
380 ASSERT (gl_list_iterator_next (&iter3, &elt, NULL));
381 ASSERT (gl_list_get_at (list3, i) == elt);
383 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
384 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
385 ASSERT (!gl_list_iterator_next (&iter3, &elt, NULL));
386 gl_list_iterator_free (&iter1);
387 gl_list_iterator_free (&iter2);
388 gl_list_iterator_free (&iter3);
392 check_all (list1, list2, list3);
395 gl_list_free (list1);
396 gl_list_free (list2);
397 gl_list_free (list3);