mirror of
https://git.savannah.gnu.org/git/gnulib.git
synced 2026-10-24 00:48:56 +03:00
Reported by Lasse Collin in <https://lists.gnu.org/archive/html/bug-gnulib/2026-08/msg00190.html>. * tests/test-array_map.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-array_omap.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-avltree_omap.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-rbtree_omap.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-array_set.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-array_oset.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-avltree_oset.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-rbtree_oset.c (string_compare): New function. (main): Use instead of casting strcmp to a different function prototype. * tests/test-oset-update.h (test_update): Likewise.
162 lines
4.4 KiB
C
162 lines
4.4 KiB
C
/* Test of set data type implementation.
|
|
Copyright (C) 2006-2026 Free Software Foundation, Inc.
|
|
Written by Bruno Haible <bruno@clisp.org>, 2018.
|
|
|
|
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 <https://www.gnu.org/licenses/>. */
|
|
|
|
#include <config.h>
|
|
|
|
#include "gl_array_set.h"
|
|
|
|
#include <stdcountof.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "gl_xoset.h"
|
|
#include "gl_array_oset.h"
|
|
#include "xalloc.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 (countof (objects))]
|
|
|
|
static int
|
|
cmp_objects_in_array (const void *objptr1, const void *objptr2)
|
|
{
|
|
const void *obj1 = *(const void * const *)objptr1;
|
|
const void *obj2 = *(const void * const *)objptr2;
|
|
return strcmp ((const char *) obj1, (const char *) obj2);
|
|
}
|
|
|
|
static void
|
|
check_equals (gl_set_t set1, gl_oset_t set2)
|
|
{
|
|
size_t n = gl_set_size (set1);
|
|
const void **elements_of_set1 = XNMALLOC (n, const void *);
|
|
const void **elements_of_set2 = XNMALLOC (n, const void *);
|
|
|
|
gl_set_iterator_t iter1;
|
|
gl_oset_iterator_t iter2;
|
|
const void *elt1;
|
|
const void *elt2;
|
|
|
|
iter1 = gl_set_iterator (set1);
|
|
iter2 = gl_oset_iterator (set2);
|
|
for (size_t i = 0; i < n; i++)
|
|
{
|
|
ASSERT (gl_set_iterator_next (&iter1, &elt1));
|
|
ASSERT (gl_oset_iterator_next (&iter2, &elt2));
|
|
elements_of_set1[i] = elt1;
|
|
elements_of_set2[i] = elt2;
|
|
}
|
|
ASSERT (!gl_set_iterator_next (&iter1, &elt1));
|
|
ASSERT (!gl_oset_iterator_next (&iter2, &elt2));
|
|
gl_set_iterator_free (&iter1);
|
|
gl_oset_iterator_free (&iter2);
|
|
|
|
if (n > 0)
|
|
{
|
|
qsort (elements_of_set1, n, sizeof (const void *), cmp_objects_in_array);
|
|
qsort (elements_of_set2, n, sizeof (const void *), cmp_objects_in_array);
|
|
}
|
|
for (size_t i = 0; i < n; i++)
|
|
ASSERT (elements_of_set1[i] == elements_of_set2[i]);
|
|
free (elements_of_set2);
|
|
free (elements_of_set1);
|
|
}
|
|
|
|
static void
|
|
check_all (gl_set_t set1, gl_oset_t set2)
|
|
{
|
|
check_equals (set1, set2);
|
|
}
|
|
|
|
static int
|
|
string_compare (const void *elt1, const void *elt2)
|
|
{
|
|
const char *s1 = elt1;
|
|
const char *s2 = elt2;
|
|
return strcmp (s1, s2);
|
|
}
|
|
|
|
int
|
|
main (int argc, char *argv[])
|
|
{
|
|
gl_set_t set1;
|
|
gl_oset_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);
|
|
|
|
/* Create set1. */
|
|
set1 = gl_set_nx_create_empty (GL_ARRAY_SET, NULL, NULL, NULL);
|
|
ASSERT (set1 != NULL);
|
|
|
|
/* Create set2. */
|
|
set2 = gl_oset_create_empty (GL_ARRAY_OSET, string_compare, NULL);
|
|
|
|
check_all (set1, set2);
|
|
|
|
/* Initialize them. */
|
|
for (size_t i = 0; i < initial_size; i++)
|
|
{
|
|
const char *obj = RANDOM_OBJECT ();
|
|
ASSERT (gl_set_nx_add (set1, obj) == gl_oset_add (set2, obj));
|
|
check_all (set1, set2);
|
|
}
|
|
|
|
for (unsigned int repeat = 0; repeat < 100000; repeat++)
|
|
{
|
|
unsigned int operation = RANDOM (3);
|
|
switch (operation)
|
|
{
|
|
case 0:
|
|
{
|
|
const char *obj = RANDOM_OBJECT ();
|
|
ASSERT (gl_set_search (set1, obj) == gl_oset_search (set2, obj));
|
|
}
|
|
break;
|
|
case 1:
|
|
{
|
|
const char *obj = RANDOM_OBJECT ();
|
|
ASSERT (gl_set_nx_add (set1, obj) == gl_oset_add (set2, obj));
|
|
}
|
|
break;
|
|
case 2:
|
|
{
|
|
const char *obj = RANDOM_OBJECT ();
|
|
ASSERT (gl_set_remove (set1, obj) == gl_oset_remove (set2, obj));
|
|
}
|
|
break;
|
|
}
|
|
check_all (set1, set2);
|
|
}
|
|
|
|
gl_set_free (set1);
|
|
gl_oset_free (set2);
|
|
}
|
|
|
|
return test_exit_status;
|
|
}
|