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"
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(condition) if (!(condition)) abort ()
34 #define RANDOM(n) (rand () % (n))
35 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
38 check_equals (gl_list_t list1, gl_list_t list2)
42 n = gl_list_size (list1);
43 ASSERT (n == gl_list_size (list2));
44 for (i = 0; i < n; i++)
46 ASSERT (gl_list_get_at (list1, i) == gl_list_get_at (list2, i));
51 main (int argc, char *argv[])
53 gl_list_t list1, list2;
55 /* Allow the user to provide a non-default random seed on the command line. */
57 srand (atoi (argv[1]));
60 size_t initial_size = RANDOM (50);
61 const void **contents =
62 (const void **) malloc (initial_size * sizeof (const void *));
66 for (i = 0; i < initial_size; i++)
67 contents[i] = RANDOM_OBJECT ();
70 list1 = gl_list_create (GL_ARRAY_LIST, NULL, NULL, true,
71 initial_size, contents);
73 list2 = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, true);
74 for (i = 0; i < initial_size; i++)
75 gl_list_add_last (list2, contents[i]);
77 check_equals (list1, list2);
79 for (repeat = 0; repeat < 10000; repeat++)
81 unsigned int operation = RANDOM (16);
85 if (gl_list_size (list1) > 0)
87 size_t index = RANDOM (gl_list_size (list1));
88 const char *obj = RANDOM_OBJECT ();
89 gl_list_node_t node1, node2;
91 node1 = gl_list_set_at (list1, index, obj);
92 ASSERT (gl_list_get_at (list1, index) == obj);
93 ASSERT (gl_list_node_value (list1, node1) == obj);
95 node2 = gl_list_set_at (list2, index, obj);
96 ASSERT (gl_list_get_at (list2, index) == obj);
97 ASSERT (gl_list_node_value (list2, node2) == obj);
101 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
102 == gl_list_get_at (list1, index - 1));
104 if (index + 1 < gl_list_size (list1))
106 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
107 == gl_list_get_at (list1, index + 1));
113 const char *obj = RANDOM_OBJECT ();
114 gl_list_node_t node1, node2;
115 node1 = gl_list_search (list1, obj);
116 node2 = gl_list_search (list2, obj);
119 ASSERT (node2 == NULL);
123 ASSERT (node2 != NULL);
124 ASSERT (gl_list_node_value (list1, node1) == obj);
125 ASSERT (gl_list_node_value (list2, node2) == obj);
131 const char *obj = RANDOM_OBJECT ();
132 size_t index1, index2;
133 index1 = gl_list_indexof (list1, obj);
134 index2 = gl_list_indexof (list2, obj);
135 if (index1 == (size_t)(-1))
137 ASSERT (index2 == (size_t)(-1));
141 ASSERT (index2 != (size_t)(-1));
142 ASSERT (gl_list_get_at (list1, index1) == obj);
143 ASSERT (gl_list_get_at (list2, index2) == obj);
144 ASSERT (index2 == index1);
148 case 3: /* add 1 element */
150 const char *obj = RANDOM_OBJECT ();
151 gl_list_node_t node1, node2;
152 node1 = gl_list_add_first (list1, obj);
153 node2 = gl_list_add_first (list2, obj);
154 ASSERT (gl_list_node_value (list1, node1) == obj);
155 ASSERT (gl_list_node_value (list2, node2) == obj);
156 ASSERT (gl_list_get_at (list1, 0) == obj);
157 ASSERT (gl_list_get_at (list2, 0) == obj);
160 case 4: /* add 1 element */
162 const char *obj = RANDOM_OBJECT ();
163 gl_list_node_t node1, node2;
164 node1 = gl_list_add_last (list1, obj);
165 node2 = gl_list_add_last (list2, obj);
166 ASSERT (gl_list_node_value (list1, node1) == obj);
167 ASSERT (gl_list_node_value (list2, node2) == obj);
168 ASSERT (gl_list_get_at (list1, gl_list_size (list1) - 1) == obj);
169 ASSERT (gl_list_get_at (list2, gl_list_size (list2) - 1) == obj);
172 case 5: /* add 3 elements */
174 const char *obj0 = RANDOM_OBJECT ();
175 const char *obj1 = RANDOM_OBJECT ();
176 const char *obj2 = RANDOM_OBJECT ();
177 gl_list_node_t node1, node2;
178 node1 = gl_list_add_first (list1, obj2);
179 node1 = gl_list_add_before (list1, node1, obj0);
180 node1 = gl_list_add_after (list1, node1, obj1);
181 node2 = gl_list_add_first (list2, obj2);
182 node2 = gl_list_add_before (list2, node2, obj0);
183 node2 = gl_list_add_after (list2, node2, obj1);
184 ASSERT (gl_list_node_value (list1, node1) == obj1);
185 ASSERT (gl_list_node_value (list2, node2) == obj1);
186 ASSERT (gl_list_get_at (list1, 0) == obj0);
187 ASSERT (gl_list_get_at (list1, 1) == obj1);
188 ASSERT (gl_list_get_at (list1, 2) == obj2);
189 ASSERT (gl_list_get_at (list2, 0) == obj0);
190 ASSERT (gl_list_get_at (list2, 1) == obj1);
191 ASSERT (gl_list_get_at (list2, 2) == obj2);
194 case 6: /* add 1 element */
196 size_t index = RANDOM (gl_list_size (list1) + 1);
197 const char *obj = RANDOM_OBJECT ();
198 gl_list_node_t node1, node2;
199 node1 = gl_list_add_at (list1, index, obj);
200 node2 = gl_list_add_at (list2, index, obj);
201 ASSERT (gl_list_get_at (list1, index) == obj);
202 ASSERT (gl_list_node_value (list1, node1) == obj);
203 ASSERT (gl_list_get_at (list2, index) == obj);
204 ASSERT (gl_list_node_value (list2, node2) == obj);
207 ASSERT (gl_list_node_value (list1, gl_list_previous_node (list1, node1))
208 == gl_list_get_at (list1, index - 1));
210 if (index + 1 < gl_list_size (list1))
212 ASSERT (gl_list_node_value (list1, gl_list_next_node (list1, node1))
213 == gl_list_get_at (list1, index + 1));
217 case 7: case 8: /* remove 1 element */
218 if (gl_list_size (list1) > 0)
220 size_t n = gl_list_size (list1);
221 const char *obj = gl_list_get_at (list1, RANDOM (n));
222 gl_list_node_t node1, node2;
223 node1 = gl_list_search (list1, obj);
224 node2 = gl_list_search (list2, obj);
225 ASSERT (node1 != NULL);
226 ASSERT (node2 != NULL);
227 ASSERT (gl_list_remove_node (list1, node1));
228 ASSERT (gl_list_remove_node (list2, node2));
229 ASSERT (gl_list_size (list1) == n - 1);
232 case 9: case 10: /* remove 1 element */
233 if (gl_list_size (list1) > 0)
235 size_t n = gl_list_size (list1);
236 size_t index = RANDOM (n);
237 ASSERT (gl_list_remove_at (list1, index));
238 ASSERT (gl_list_remove_at (list2, index));
239 ASSERT (gl_list_size (list1) == n - 1);
242 case 11: case 12: /* remove 1 element */
243 if (gl_list_size (list1) > 0)
245 size_t n = gl_list_size (list1);
246 const char *obj = gl_list_get_at (list1, RANDOM (n));
247 ASSERT (gl_list_remove (list1, obj));
248 ASSERT (gl_list_remove (list2, obj));
249 ASSERT (gl_list_size (list1) == n - 1);
253 if (gl_list_size (list1) > 0)
255 size_t n = gl_list_size (list1);
256 const char *obj = "xyzzy";
257 ASSERT (!gl_list_remove (list1, obj));
258 ASSERT (!gl_list_remove (list2, obj));
259 ASSERT (gl_list_size (list1) == n);
264 size_t n = gl_list_size (list1);
265 gl_list_iterator_t iter1, iter2;
267 iter1 = gl_list_iterator (list1);
268 iter2 = gl_list_iterator (list2);
269 for (i = 0; i < n; i++)
271 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
272 ASSERT (gl_list_get_at (list1, i) == elt);
273 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
274 ASSERT (gl_list_get_at (list2, i) == elt);
276 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
277 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
278 gl_list_iterator_free (&iter1);
279 gl_list_iterator_free (&iter2);
284 size_t end = RANDOM (gl_list_size (list1) + 1);
285 size_t start = RANDOM (end + 1);
286 gl_list_iterator_t iter1, iter2;
288 iter1 = gl_list_iterator_from_to (list1, start, end);
289 iter2 = gl_list_iterator_from_to (list2, start, end);
290 for (i = start; i < end; i++)
292 ASSERT (gl_list_iterator_next (&iter1, &elt, NULL));
293 ASSERT (gl_list_get_at (list1, i) == elt);
294 ASSERT (gl_list_iterator_next (&iter2, &elt, NULL));
295 ASSERT (gl_list_get_at (list2, i) == elt);
297 ASSERT (!gl_list_iterator_next (&iter1, &elt, NULL));
298 ASSERT (!gl_list_iterator_next (&iter2, &elt, NULL));
299 gl_list_iterator_free (&iter1);
300 gl_list_iterator_free (&iter2);
304 check_equals (list1, list2);
307 gl_list_free (list1);
308 gl_list_free (list2);