1 /* Test of ordered set data type implementation.
2 Copyright (C) 2006-2012 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_oset.h"
26 #include "gl_array_list.h"
30 static const char *objects
[30] =
32 "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o",
33 "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z", "<", ">", "[", "]"
36 #define RANDOM(n) (rand () % (n))
37 #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))]
40 check_equals (gl_oset_t set1
, gl_list_t set2
)
42 size_t n
= gl_oset_size (set1
);
43 gl_oset_iterator_t iter1
;
44 gl_list_iterator_t iter2
;
50 iter1
= gl_oset_iterator (set1
);
51 iter2
= gl_list_iterator (set2
);
52 for (i
= 0; i
< n
; i
++)
54 ASSERT (gl_oset_iterator_next (&iter1
, &elt1
));
55 ASSERT (gl_list_iterator_next (&iter2
, &elt2
, &node2
));
56 ASSERT (elt1
== elt2
);
58 ASSERT (!gl_oset_iterator_next (&iter1
, &elt1
));
59 ASSERT (!gl_list_iterator_next (&iter2
, &elt2
, &node2
));
60 gl_oset_iterator_free (&iter1
);
61 gl_list_iterator_free (&iter2
);
65 check_all (gl_oset_t set1
, gl_list_t set2
)
67 check_equals (set1
, set2
);
71 main (int argc
, char *argv
[])
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 (20);
88 set1
= gl_oset_nx_create_empty (GL_ARRAY_OSET
, (gl_setelement_compar_fn
) strcmp
, NULL
);
89 ASSERT (set1
!= NULL
);
92 set2
= gl_list_create_empty (GL_ARRAY_LIST
, NULL
, NULL
, NULL
, false);
94 check_all (set1
, set2
);
96 /* Initialize them. */
97 for (i
= 0; i
< initial_size
; i
++)
99 const char *obj
= RANDOM_OBJECT ();
100 ASSERT (gl_oset_nx_add (set1
, obj
)
101 == (gl_sortedlist_search (set2
, (gl_listelement_compar_fn
)strcmp
, obj
) != NULL
103 : (gl_sortedlist_add (set2
, (gl_listelement_compar_fn
)strcmp
, obj
), true)));
104 check_all (set1
, set2
);
107 for (repeat
= 0; repeat
< 100000; repeat
++)
109 unsigned int operation
= RANDOM (3);
114 const char *obj
= RANDOM_OBJECT ();
115 ASSERT (gl_oset_search (set1
, obj
)
116 == (gl_sortedlist_search (set2
, (gl_listelement_compar_fn
)strcmp
, obj
) != NULL
));
121 const char *obj
= RANDOM_OBJECT ();
122 ASSERT (gl_oset_nx_add (set1
, obj
)
123 == (gl_sortedlist_search (set2
, (gl_listelement_compar_fn
)strcmp
, obj
) != NULL
125 : (gl_sortedlist_add (set2
, (gl_listelement_compar_fn
)strcmp
, obj
), true)));
130 const char *obj
= RANDOM_OBJECT ();
131 ASSERT (gl_oset_remove (set1
, obj
)
132 == gl_sortedlist_remove (set2
, (gl_listelement_compar_fn
)strcmp
, obj
));
136 check_all (set1
, set2
);