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. */
25 #include "gl_array_list.h"
28 static const char *objects[15] =
30 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o"
33 #define SIZEOF(array) (sizeof (array) / sizeof (array[0]))
34 #define ASSERT(condition) if (!(condition)) abort ()
35 #define RANDOM(n) (rand () % (n))
36 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
39 check_equals (gl_list_t list1, gl_list_t list2)
43 n = gl_list_size (list1);
44 ASSERT (n == gl_list_size (list2));
45 for (i = 0; i < n; i++)
47 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
52 main (int argc, char *argv[])
54 gl_list_t list1, list2;
56 set_program_name (argv[0]);
58 /* Allow the user to provide a non-default random seed on the command line. */
60 srand (atoi (argv[1]));
63 size_t initial_size = RANDOM (50);
64 const void **contents =
65 (const void **) malloc (initial_size * sizeof (const void *));
69 for (i = 0; i < initial_size; i++)
70 contents[i] = RANDOM_OBJECT ();
73 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, true,
74 initial_size, contents);
76 list2 = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, true);
77 for (i = 0; i < initial_size; i++)
78 gl_list_add_last (list2, contents[i]);
80 check_equals (list1, list2);
82 for (repeat = 0; repeat < 10000; repeat++)
84 unsigned int operation = RANDOM (16);
88 if (gl_list_size (list1) > 0)
90 size_t index = RANDOM (gl_list_size (list1));
91 const char *obj = RANDOM_OBJECT ();
92 gl_list_node_t node1, node2;
94 node1 = gl_list_set_at (list1, index, obj);
95 ASSERT (gl_list_get_at (list1, index) == obj);
96 ASSERT (gl_list_node_value (list1, node1) == obj);
98 node2 = gl_list_set_at (list2, index, obj);
99 ASSERT (gl_list_get_at (list2, index) == obj);
100 ASSERT (gl_list_node_value (list2, node2) == obj);
104 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
105 == gl_list_get_at (list1, index - 1));
107 if (index + 1 < gl_list_size (list1))
109 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
110 == gl_list_get_at (list1, index + 1));
116 const char *obj = RANDOM_OBJECT ();
117 gl_list_node_t node1, node2;
118 node1 = gl_list_search (list1, obj);
119 node2 = gl_list_search (list2, obj);
122 ASSERT (node2 == NULL);
126 ASSERT (node2 != NULL);
127 ASSERT (gl_list_node_value (list1, node1) == obj);
128 ASSERT (gl_list_node_value (list2, node2) == obj);
134 const char *obj = RANDOM_OBJECT ();
135 size_t index1, index2;
136 index1 = gl_list_indexof (list1, obj);
137 index2 = gl_list_indexof (list2, obj);
138 if (index1 == (size_t)(-1))
140 ASSERT (index2 == (size_t)(-1));
144 ASSERT (index2 != (size_t)(-1));
145 ASSERT (gl_list_get_at (list1, index1) == obj);
146 ASSERT (gl_list_get_at (list2, index2) == obj);
147 ASSERT (index2 == index1);
151 case 3: /* add 1 element */
153 const char *obj = RANDOM_OBJECT ();
154 gl_list_node_t node1, node2;
155 node1 = gl_list_add_first (list1, obj);
156 node2 = gl_list_add_first (list2, obj);
157 ASSERT (gl_list_node_value (list1, node1) == obj);
158 ASSERT (gl_list_node_value (list2, node2) == obj);
159 ASSERT (gl_list_get_at (list1, 0) == obj);
160 ASSERT (gl_list_get_at (list2, 0) == obj);
163 case 4: /* add 1 element */
165 const char *obj = RANDOM_OBJECT ();
166 gl_list_node_t node1, node2;
167 node1 = gl_list_add_last (list1, obj);
168 node2 = gl_list_add_last (list2, obj);
169 ASSERT (gl_list_node_value (list1, node1) == obj);
170 ASSERT (gl_list_node_value (list2, node2) == obj);
171 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
172 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
175 case 5: /* add 3 elements */
177 const char *obj0 = RANDOM_OBJECT ();
178 const char *obj1 = RANDOM_OBJECT ();
179 const char *obj2 = RANDOM_OBJECT ();
180 gl_list_node_t node1, node2;
181 node1 = gl_list_add_first (list1, obj2);
182 node1 = gl_list_add_before (list1, node1, obj0);
183 node1 = gl_list_add_after (list1, node1, obj1);
184 node2 = gl_list_add_first (list2, obj2);
185 node2 = gl_list_add_before (list2, node2, obj0);
186 node2 = gl_list_add_after (list2, node2, obj1);
187 ASSERT (gl_list_node_value (list1, node1) == obj1);
188 ASSERT (gl_list_node_value (list2, node2) == obj1);
189 ASSERT (gl_list_get_at (list1, 0) == obj0);
190 ASSERT (gl_list_get_at (list1, 1) == obj1);
191 ASSERT (gl_list_get_at (list1, 2) == obj2);
192 ASSERT (gl_list_get_at (list2, 0) == obj0);
193 ASSERT (gl_list_get_at (list2, 1) == obj1);
194 ASSERT (gl_list_get_at (list2, 2) == obj2);
197 case 6: /* add 1 element */
199 size_t index = RANDOM (gl_list_size (list1) + 1);
200 const char *obj = RANDOM_OBJECT ();
201 gl_list_node_t node1, node2;
202 node1 = gl_list_add_at (list1, index, obj);
203 node2 = gl_list_add_at (list2, index, obj);
204 ASSERT (gl_list_get_at (list1, index) == obj);
205 ASSERT (gl_list_node_value (list1, node1) == obj);
206 ASSERT (gl_list_get_at (list2, index) == obj);
207 ASSERT (gl_list_node_value (list2, node2) == obj);
210 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
211 == gl_list_get_at (list1, index - 1));
213 if (index + 1 < gl_list_size (list1))
215 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
216 == gl_list_get_at (list1, index + 1));
220 case 7: case 8: /* remove 1 element */
221 if (gl_list_size (list1) > 0)
223 size_t n = gl_list_size (list1);
224 const char *obj = gl_list_get_at (list1, RANDOM (n));
225 gl_list_node_t node1, node2;
226 node1 = gl_list_search (list1, obj);
227 node2 = gl_list_search (list2, obj);
228 ASSERT (node1 != NULL);
229 ASSERT (node2 != NULL);
230 ASSERT (gl_list_remove_node (list1, node1));
231 ASSERT (gl_list_remove_node (list2, node2));
232 ASSERT (gl_list_size (list1) == n - 1);
235 case 9: case 10: /* remove 1 element */
236 if (gl_list_size (list1) > 0)
238 size_t n = gl_list_size (list1);
239 size_t index = RANDOM (n);
240 ASSERT (gl_list_remove_at (list1, index));
241 ASSERT (gl_list_remove_at (list2, index));
242 ASSERT (gl_list_size (list1) == n - 1);
245 case 11: case 12: /* remove 1 element */
246 if (gl_list_size (list1) > 0)
248 size_t n = gl_list_size (list1);
249 const char *obj = gl_list_get_at (list1, RANDOM (n));
250 ASSERT (gl_list_remove (list1, obj));
251 ASSERT (gl_list_remove (list2, obj));
252 ASSERT (gl_list_size (list1) == n - 1);
256 if (gl_list_size (list1) > 0)
258 size_t n = gl_list_size (list1);
259 const char *obj = "xyzzy";
260 ASSERT (!gl_list_remove (list1, obj));
261 ASSERT (!gl_list_remove (list2, obj));
262 ASSERT (gl_list_size (list1) == n);
267 size_t n = gl_list_size (list1);
268 gl_list_iterator_t iter1, iter2;
270 iter1 = gl_list_iterator (list1);
271 iter2 = gl_list_iterator (list2);
272 for (i = 0; i < n; i++)
274 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
275 ASSERT (gl_list_get_at (list1, i) == elt);
276 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
277 ASSERT (gl_list_get_at (list2, i) == elt);
279 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
280 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
281 gl_list_iterator_free (&iter1);
282 gl_list_iterator_free (&iter2);
287 size_t end = RANDOM (gl_list_size (list1) + 1);
288 size_t start = RANDOM (end + 1);
289 gl_list_iterator_t iter1, iter2;
291 iter1 = gl_list_iterator_from_to (list1, start, end);
292 iter2 = gl_list_iterator_from_to (list2, start, end);
293 for (i = start; i < end; i++)
295 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
296 ASSERT (gl_list_get_at (list1, i) == elt);
297 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
298 ASSERT (gl_list_get_at (list2, i) == elt);
300 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
301 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
302 gl_list_iterator_free (&iter1);
303 gl_list_iterator_free (&iter2);
307 check_equals (list1, list2);
310 gl_list_free (list1);
311 gl_list_free (list2);