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>, 2007.
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_array_list.h"
27 static const char *objects[15] =
29 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
32 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
33 #define ASSERT(expr) \
38 fprintf (stderr, "%s:%d: assertion failed\n", __FILE__, __LINE__); \
43 #define RANDOM(n) (rand () % (n))
44 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
47 check_equals (gl_list_t list1, gl_list_t list2)
51 n = gl_list_size (list1);
52 ASSERT (n == gl_list_size (list2));
53 for (i = 0; i < n; i++)
55 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
60 main (int argc, char *argv[])
62 gl_list_t list1, list2;
64 set_program_name (argv[0]);
66 /* Allow the user to provide a non-default random seed on the command line. */
68 srand (atoi (argv[1]));
71 size_t initial_size = RANDOM (50);
72 const void **contents =
73 (const void **) malloc (initial_size * sizeof (const void *));
77 for (i = 0; i < initial_size; i++)
78 contents[i] = RANDOM_OBJECT ();
81 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, NULL, true,
82 initial_size, contents);
84 list2 = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, NULL, true);
85 for (i = 0; i < initial_size; i++)
86 gl_list_add_last (list2, contents[i]);
88 check_equals (list1, list2);
90 for (repeat = 0; repeat < 10000; repeat++)
92 unsigned int operation = RANDOM (16);
96 if (gl_list_size (list1) > 0)
98 size_t index = RANDOM (gl_list_size (list1));
99 const char *obj = RANDOM_OBJECT ();
100 gl_list_node_t node1, node2;
102 node1 = gl_list_set_at (list1, index, obj);
103 ASSERT (gl_list_get_at (list1, index) == obj);
104 ASSERT (gl_list_node_value (list1, node1) == obj);
106 node2 = gl_list_set_at (list2, index, obj);
107 ASSERT (gl_list_get_at (list2, index) == obj);
108 ASSERT (gl_list_node_value (list2, node2) == obj);
112 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
113 == gl_list_get_at (list1, index - 1));
115 if (index + 1 < gl_list_size (list1))
117 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
118 == gl_list_get_at (list1, index + 1));
124 const char *obj = RANDOM_OBJECT ();
125 gl_list_node_t node1, node2;
126 node1 = gl_list_search (list1, obj);
127 node2 = gl_list_search (list2, obj);
130 ASSERT (node2 == NULL);
134 ASSERT (node2 != NULL);
135 ASSERT (gl_list_node_value (list1, node1) == obj);
136 ASSERT (gl_list_node_value (list2, node2) == obj);
142 const char *obj = RANDOM_OBJECT ();
143 size_t index1, index2;
144 index1 = gl_list_indexof (list1, obj);
145 index2 = gl_list_indexof (list2, obj);
146 if (index1 == (size_t)(-1))
148 ASSERT (index2 == (size_t)(-1));
152 ASSERT (index2 != (size_t)(-1));
153 ASSERT (gl_list_get_at (list1, index1) == obj);
154 ASSERT (gl_list_get_at (list2, index2) == obj);
155 ASSERT (index2 == index1);
159 case 3: /* add 1 element */
161 const char *obj = RANDOM_OBJECT ();
162 gl_list_node_t node1, node2;
163 node1 = gl_list_add_first (list1, obj);
164 node2 = gl_list_add_first (list2, obj);
165 ASSERT (gl_list_node_value (list1, node1) == obj);
166 ASSERT (gl_list_node_value (list2, node2) == obj);
167 ASSERT (gl_list_get_at (list1, 0) == obj);
168 ASSERT (gl_list_get_at (list2, 0) == obj);
171 case 4: /* add 1 element */
173 const char *obj = RANDOM_OBJECT ();
174 gl_list_node_t node1, node2;
175 node1 = gl_list_add_last (list1, obj);
176 node2 = gl_list_add_last (list2, obj);
177 ASSERT (gl_list_node_value (list1, node1) == obj);
178 ASSERT (gl_list_node_value (list2, node2) == obj);
179 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
180 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
183 case 5: /* add 3 elements */
185 const char *obj0 = RANDOM_OBJECT ();
186 const char *obj1 = RANDOM_OBJECT ();
187 const char *obj2 = RANDOM_OBJECT ();
188 gl_list_node_t node1, node2;
189 node1 = gl_list_add_first (list1, obj2);
190 node1 = gl_list_add_before (list1, node1, obj0);
191 node1 = gl_list_add_after (list1, node1, obj1);
192 node2 = gl_list_add_first (list2, obj2);
193 node2 = gl_list_add_before (list2, node2, obj0);
194 node2 = gl_list_add_after (list2, node2, obj1);
195 ASSERT (gl_list_node_value (list1, node1) == obj1);
196 ASSERT (gl_list_node_value (list2, node2) == obj1);
197 ASSERT (gl_list_get_at (list1, 0) == obj0);
198 ASSERT (gl_list_get_at (list1, 1) == obj1);
199 ASSERT (gl_list_get_at (list1, 2) == obj2);
200 ASSERT (gl_list_get_at (list2, 0) == obj0);
201 ASSERT (gl_list_get_at (list2, 1) == obj1);
202 ASSERT (gl_list_get_at (list2, 2) == obj2);
205 case 6: /* add 1 element */
207 size_t index = RANDOM (gl_list_size (list1) + 1);
208 const char *obj = RANDOM_OBJECT ();
209 gl_list_node_t node1, node2;
210 node1 = gl_list_add_at (list1, index, obj);
211 node2 = gl_list_add_at (list2, index, obj);
212 ASSERT (gl_list_get_at (list1, index) == obj);
213 ASSERT (gl_list_node_value (list1, node1) == obj);
214 ASSERT (gl_list_get_at (list2, index) == obj);
215 ASSERT (gl_list_node_value (list2, node2) == obj);
218 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
219 == gl_list_get_at (list1, index - 1));
221 if (index + 1 < gl_list_size (list1))
223 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
224 == gl_list_get_at (list1, index + 1));
228 case 7: case 8: /* remove 1 element */
229 if (gl_list_size (list1) > 0)
231 size_t n = gl_list_size (list1);
232 const char *obj = gl_list_get_at (list1, RANDOM (n));
233 gl_list_node_t node1, node2;
234 node1 = gl_list_search (list1, obj);
235 node2 = gl_list_search (list2, obj);
236 ASSERT (node1 != NULL);
237 ASSERT (node2 != NULL);
238 ASSERT (gl_list_remove_node (list1, node1));
239 ASSERT (gl_list_remove_node (list2, node2));
240 ASSERT (gl_list_size (list1) == n - 1);
243 case 9: case 10: /* remove 1 element */
244 if (gl_list_size (list1) > 0)
246 size_t n = gl_list_size (list1);
247 size_t index = RANDOM (n);
248 ASSERT (gl_list_remove_at (list1, index));
249 ASSERT (gl_list_remove_at (list2, index));
250 ASSERT (gl_list_size (list1) == n - 1);
253 case 11: case 12: /* remove 1 element */
254 if (gl_list_size (list1) > 0)
256 size_t n = gl_list_size (list1);
257 const char *obj = gl_list_get_at (list1, RANDOM (n));
258 ASSERT (gl_list_remove (list1, obj));
259 ASSERT (gl_list_remove (list2, obj));
260 ASSERT (gl_list_size (list1) == n - 1);
264 if (gl_list_size (list1) > 0)
266 size_t n = gl_list_size (list1);
267 const char *obj = "xyzzy";
268 ASSERT (!gl_list_remove (list1, obj));
269 ASSERT (!gl_list_remove (list2, obj));
270 ASSERT (gl_list_size (list1) == n);
275 size_t n = gl_list_size (list1);
276 gl_list_iterator_t iter1, iter2;
278 iter1 = gl_list_iterator (list1);
279 iter2 = gl_list_iterator (list2);
280 for (i = 0; i < n; i++)
282 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
283 ASSERT (gl_list_get_at (list1, i) == elt);
284 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
285 ASSERT (gl_list_get_at (list2, i) == elt);
287 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
288 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
289 gl_list_iterator_free (&iter1);
290 gl_list_iterator_free (&iter2);
295 size_t end = RANDOM (gl_list_size (list1) + 1);
296 size_t start = RANDOM (end + 1);
297 gl_list_iterator_t iter1, iter2;
299 iter1 = gl_list_iterator_from_to (list1, start, end);
300 iter2 = gl_list_iterator_from_to (list2, start, end);
301 for (i = start; i < end; i++)
303 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
304 ASSERT (gl_list_get_at (list1, i) == elt);
305 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
306 ASSERT (gl_list_get_at (list2, i) == elt);
308 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
309 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
310 gl_list_iterator_free (&iter1);
311 gl_list_iterator_free (&iter2);
315 check_equals (list1, list2);
318 gl_list_free (list1);
319 gl_list_free (list2);