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 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_array_list.h"
29 static const char *objects[15] =
31 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
34 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
35 #define ASSERT(condition) if (!(condition)) abort ()
36 #define RANDOM(n) (rand () % (n))
37 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
40 check_equals (gl_list_t list1, gl_list_t list2)
44 n = gl_list_size (list1);
45 ASSERT (n == gl_list_size (list2));
46 for (i = 0; i < n; i++)
48 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
53 main (int argc, char *argv[])
55 gl_list_t list1, list2;
57 set_program_name (argv[0]);
59 /* Allow the user to provide a non-default random seed on the command line. */
61 srand (atoi (argv[1]));
64 size_t initial_size = RANDOM (50);
65 const void **contents =
66 (const void **) malloc (initial_size * sizeof (const void *));
70 for (i = 0; i < initial_size; i++)
71 contents[i] = RANDOM_OBJECT ();
74 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, true,
75 initial_size, contents);
77 list2 = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, true);
78 for (i = 0; i < initial_size; i++)
79 gl_list_add_last (list2, contents[i]);
81 check_equals (list1, list2);
83 for (repeat = 0; repeat < 10000; repeat++)
85 unsigned int operation = RANDOM (16);
89 if (gl_list_size (list1) > 0)
91 size_t index = RANDOM (gl_list_size (list1));
92 const char *obj = RANDOM_OBJECT ();
93 gl_list_node_t node1, node2;
95 node1 = gl_list_set_at (list1, index, obj);
96 ASSERT (gl_list_get_at (list1, index) == obj);
97 ASSERT (gl_list_node_value (list1, node1) == obj);
99 node2 = gl_list_set_at (list2, index, obj);
100 ASSERT (gl_list_get_at (list2, index) == obj);
101 ASSERT (gl_list_node_value (list2, node2) == obj);
105 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
106 == gl_list_get_at (list1, index - 1));
108 if (index + 1 < gl_list_size (list1))
110 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
111 == gl_list_get_at (list1, index + 1));
117 const char *obj = RANDOM_OBJECT ();
118 gl_list_node_t node1, node2;
119 node1 = gl_list_search (list1, obj);
120 node2 = gl_list_search (list2, obj);
123 ASSERT (node2 == NULL);
127 ASSERT (node2 != NULL);
128 ASSERT (gl_list_node_value (list1, node1) == obj);
129 ASSERT (gl_list_node_value (list2, node2) == obj);
135 const char *obj = RANDOM_OBJECT ();
136 size_t index1, index2;
137 index1 = gl_list_indexof (list1, obj);
138 index2 = gl_list_indexof (list2, obj);
139 if (index1 == (size_t)(-1))
141 ASSERT (index2 == (size_t)(-1));
145 ASSERT (index2 != (size_t)(-1));
146 ASSERT (gl_list_get_at (list1, index1) == obj);
147 ASSERT (gl_list_get_at (list2, index2) == obj);
148 ASSERT (index2 == index1);
152 case 3: /* add 1 element */
154 const char *obj = RANDOM_OBJECT ();
155 gl_list_node_t node1, node2;
156 node1 = gl_list_add_first (list1, obj);
157 node2 = gl_list_add_first (list2, obj);
158 ASSERT (gl_list_node_value (list1, node1) == obj);
159 ASSERT (gl_list_node_value (list2, node2) == obj);
160 ASSERT (gl_list_get_at (list1, 0) == obj);
161 ASSERT (gl_list_get_at (list2, 0) == obj);
164 case 4: /* add 1 element */
166 const char *obj = RANDOM_OBJECT ();
167 gl_list_node_t node1, node2;
168 node1 = gl_list_add_last (list1, obj);
169 node2 = gl_list_add_last (list2, obj);
170 ASSERT (gl_list_node_value (list1, node1) == obj);
171 ASSERT (gl_list_node_value (list2, node2) == obj);
172 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
173 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
176 case 5: /* add 3 elements */
178 const char *obj0 = RANDOM_OBJECT ();
179 const char *obj1 = RANDOM_OBJECT ();
180 const char *obj2 = RANDOM_OBJECT ();
181 gl_list_node_t node1, node2;
182 node1 = gl_list_add_first (list1, obj2);
183 node1 = gl_list_add_before (list1, node1, obj0);
184 node1 = gl_list_add_after (list1, node1, obj1);
185 node2 = gl_list_add_first (list2, obj2);
186 node2 = gl_list_add_before (list2, node2, obj0);
187 node2 = gl_list_add_after (list2, node2, obj1);
188 ASSERT (gl_list_node_value (list1, node1) == obj1);
189 ASSERT (gl_list_node_value (list2, node2) == obj1);
190 ASSERT (gl_list_get_at (list1, 0) == obj0);
191 ASSERT (gl_list_get_at (list1, 1) == obj1);
192 ASSERT (gl_list_get_at (list1, 2) == obj2);
193 ASSERT (gl_list_get_at (list2, 0) == obj0);
194 ASSERT (gl_list_get_at (list2, 1) == obj1);
195 ASSERT (gl_list_get_at (list2, 2) == obj2);
198 case 6: /* add 1 element */
200 size_t index = RANDOM (gl_list_size (list1) + 1);
201 const char *obj = RANDOM_OBJECT ();
202 gl_list_node_t node1, node2;
203 node1 = gl_list_add_at (list1, index, obj);
204 node2 = gl_list_add_at (list2, index, obj);
205 ASSERT (gl_list_get_at (list1, index) == obj);
206 ASSERT (gl_list_node_value (list1, node1) == obj);
207 ASSERT (gl_list_get_at (list2, index) == obj);
208 ASSERT (gl_list_node_value (list2, node2) == obj);
211 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
212 == gl_list_get_at (list1, index - 1));
214 if (index + 1 < gl_list_size (list1))
216 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
217 == gl_list_get_at (list1, index + 1));
221 case 7: case 8: /* remove 1 element */
222 if (gl_list_size (list1) > 0)
224 size_t n = gl_list_size (list1);
225 const char *obj = gl_list_get_at (list1, RANDOM (n));
226 gl_list_node_t node1, node2;
227 node1 = gl_list_search (list1, obj);
228 node2 = gl_list_search (list2, obj);
229 ASSERT (node1 != NULL);
230 ASSERT (node2 != NULL);
231 ASSERT (gl_list_remove_node (list1, node1));
232 ASSERT (gl_list_remove_node (list2, node2));
233 ASSERT (gl_list_size (list1) == n - 1);
236 case 9: case 10: /* remove 1 element */
237 if (gl_list_size (list1) > 0)
239 size_t n = gl_list_size (list1);
240 size_t index = RANDOM (n);
241 ASSERT (gl_list_remove_at (list1, index));
242 ASSERT (gl_list_remove_at (list2, index));
243 ASSERT (gl_list_size (list1) == n - 1);
246 case 11: case 12: /* remove 1 element */
247 if (gl_list_size (list1) > 0)
249 size_t n = gl_list_size (list1);
250 const char *obj = gl_list_get_at (list1, RANDOM (n));
251 ASSERT (gl_list_remove (list1, obj));
252 ASSERT (gl_list_remove (list2, obj));
253 ASSERT (gl_list_size (list1) == n - 1);
257 if (gl_list_size (list1) > 0)
259 size_t n = gl_list_size (list1);
260 const char *obj = "xyzzy";
261 ASSERT (!gl_list_remove (list1, obj));
262 ASSERT (!gl_list_remove (list2, obj));
263 ASSERT (gl_list_size (list1) == n);
268 size_t n = gl_list_size (list1);
269 gl_list_iterator_t iter1, iter2;
271 iter1 = gl_list_iterator (list1);
272 iter2 = gl_list_iterator (list2);
273 for (i = 0; i < n; i++)
275 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
276 ASSERT (gl_list_get_at (list1, i) == elt);
277 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
278 ASSERT (gl_list_get_at (list2, i) == elt);
280 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
281 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
282 gl_list_iterator_free (&iter1);
283 gl_list_iterator_free (&iter2);
288 size_t end = RANDOM (gl_list_size (list1) + 1);
289 size_t start = RANDOM (end + 1);
290 gl_list_iterator_t iter1, iter2;
292 iter1 = gl_list_iterator_from_to (list1, start, end);
293 iter2 = gl_list_iterator_from_to (list2, start, end);
294 for (i = start; i < end; i++)
296 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
297 ASSERT (gl_list_get_at (list1, i) == elt);
298 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
299 ASSERT (gl_list_get_at (list2, i) == elt);
301 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
302 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
303 gl_list_iterator_free (&iter1);
304 gl_list_iterator_free (&iter2);
308 check_equals (list1, list2);
311 gl_list_free (list1);
312 gl_list_free (list2);