| /* Test of ordered set data type implementation. |
| Copyright (C) 2006-2016 Free Software Foundation, Inc. |
| Written by Bruno Haible <[email protected]>, 2007. |
| |
| This program is free software: you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation; either version 3 of the License, or |
| (at your option) any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
| |
| #include <config.h> |
| |
| #include "gl_array_oset.h" |
| |
| #include <stdlib.h> |
| #include <string.h> |
| |
| #include "gl_xlist.h" |
| #include "gl_array_list.h" |
| #include "macros.h" |
| |
| static const char *objects[30] = |
| { |
| "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", |
| "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z", "<", ">", "[", "]" |
| }; |
| |
| #define RANDOM(n) (rand () % (n)) |
| #define RANDOM_OBJECT() objects[RANDOM (SIZEOF (objects))] |
| |
| static void |
| check_equals (gl_oset_t set1, gl_list_t set2) |
| { |
| size_t n = gl_oset_size (set1); |
| gl_oset_iterator_t iter1; |
| gl_list_iterator_t iter2; |
| const void *elt1; |
| const void *elt2; |
| gl_list_node_t node2; |
| size_t i; |
| |
| iter1 = gl_oset_iterator (set1); |
| iter2 = gl_list_iterator (set2); |
| for (i = 0; i < n; i++) |
| { |
| ASSERT (gl_oset_iterator_next (&iter1, &elt1)); |
| ASSERT (gl_list_iterator_next (&iter2, &elt2, &node2)); |
| ASSERT (elt1 == elt2); |
| } |
| ASSERT (!gl_oset_iterator_next (&iter1, &elt1)); |
| ASSERT (!gl_list_iterator_next (&iter2, &elt2, &node2)); |
| gl_oset_iterator_free (&iter1); |
| gl_list_iterator_free (&iter2); |
| } |
| |
| static void |
| check_all (gl_oset_t set1, gl_list_t set2) |
| { |
| check_equals (set1, set2); |
| } |
| |
| int |
| main (int argc, char *argv[]) |
| { |
| gl_oset_t set1; |
| gl_list_t set2; |
| |
| /* Allow the user to provide a non-default random seed on the command line. */ |
| if (argc > 1) |
| srand (atoi (argv[1])); |
| |
| { |
| size_t initial_size = RANDOM (20); |
| size_t i; |
| unsigned int repeat; |
| |
| /* Create set1. */ |
| set1 = gl_oset_nx_create_empty (GL_ARRAY_OSET, (gl_setelement_compar_fn) strcmp, NULL); |
| ASSERT (set1 != NULL); |
| |
| /* Create set2. */ |
| set2 = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, NULL, false); |
| |
| check_all (set1, set2); |
| |
| /* Initialize them. */ |
| for (i = 0; i < initial_size; i++) |
| { |
| const char *obj = RANDOM_OBJECT (); |
| ASSERT (gl_oset_nx_add (set1, obj) |
| == (gl_sortedlist_search (set2, (gl_listelement_compar_fn)strcmp, obj) != NULL |
| ? false |
| : (gl_sortedlist_add (set2, (gl_listelement_compar_fn)strcmp, obj), true))); |
| check_all (set1, set2); |
| } |
| |
| for (repeat = 0; repeat < 100000; repeat++) |
| { |
| unsigned int operation = RANDOM (3); |
| switch (operation) |
| { |
| case 0: |
| { |
| const char *obj = RANDOM_OBJECT (); |
| ASSERT (gl_oset_search (set1, obj) |
| == (gl_sortedlist_search (set2, (gl_listelement_compar_fn)strcmp, obj) != NULL)); |
| } |
| break; |
| case 1: |
| { |
| const char *obj = RANDOM_OBJECT (); |
| ASSERT (gl_oset_nx_add (set1, obj) |
| == (gl_sortedlist_search (set2, (gl_listelement_compar_fn)strcmp, obj) != NULL |
| ? false |
| : (gl_sortedlist_add (set2, (gl_listelement_compar_fn)strcmp, obj), true))); |
| } |
| break; |
| case 2: |
| { |
| const char *obj = RANDOM_OBJECT (); |
| ASSERT (gl_oset_remove (set1, obj) |
| == gl_sortedlist_remove (set2, (gl_listelement_compar_fn)strcmp, obj)); |
| } |
| break; |
| } |
| check_all (set1, set2); |
| } |
| |
| gl_oset_free (set1); |
| gl_list_free (set2); |
| } |
| |
| return 0; |
| } |