Mercurial > gnulib

changeset 40009:a1bbd7396ce2

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
array-omap: Add tests. * tests/test-array_omap.c: New file. * modules/array-omap-tests: New file.
author Bruno Haible <bruno@clisp.org>
date Tue, 11 Dec 2018 20:56:33 +0100
parents eb287ca6dd6c
children f7c78ac940ad
files ChangeLog modules/array-omap-tests tests/test-array_omap.c
diffstat 3 files changed, 196 insertions(+), 0 deletions(-) [+]
line wrap: on
line diff
--- a/ChangeLog	Tue Dec 11 20:56:30 2018 +0100
+++ b/ChangeLog	Tue Dec 11 20:56:33 2018 +0100
@@ -1,5 +1,9 @@
 2018-12-11  Bruno Haible  <bruno@clisp.org>
 
+	array-omap: Add tests.
+	* tests/test-array_omap.c: New file.
+	* modules/array-omap-tests: New file.
+
 	xomap: New module.
 	* lib/gl_xomap.h: New file.
 	* lib/gl_xomap.c: New file.
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/modules/array-omap-tests	Tue Dec 11 20:56:33 2018 +0100
@@ -0,0 +1,14 @@
+Files:
+tests/test-array_omap.c
+tests/macros.h
+
+Depends-on:
+xlist
+array-list
+
+configure.ac:
+
+Makefile.am:
+TESTS += test-array_omap
+check_PROGRAMS += test-array_omap
+test_array_omap_LDADD = $(LDADD) @LIBINTL@
--- /dev/null	Thu Jan 01 00:00:00 1970 +0000
+++ b/tests/test-array_omap.c	Tue Dec 11 20:56:33 2018 +0100
@@ -0,0 +1,178 @@
+/* Test of ordered map data type implementation.
+   Copyright (C) 2006-2018 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_omap.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_omap_t map1, gl_list_t keys, gl_list_t values)
+{
+  size_t n = gl_omap_size (map1);
+  gl_omap_iterator_t iter1;
+  gl_list_iterator_t iterk, iterv;
+  const void *key1;
+  const void *value1;
+  const void *key2;
+  const void *value2;
+  gl_list_node_t node;
+  size_t i;
+
+  iter1 = gl_omap_iterator (map1);
+  iterk = gl_list_iterator (keys);
+  iterv = gl_list_iterator (values);
+  for (i = 0; i < n; i++)
+    {
+      ASSERT (gl_omap_iterator_next (&iter1, &key1, &value1));
+      ASSERT (gl_list_iterator_next (&iterk, &key2, &node));
+      ASSERT (gl_list_iterator_next (&iterv, &value2, &node));
+      ASSERT (key1 == key2);
+      ASSERT (value1 == value2);
+    }
+  ASSERT (!gl_omap_iterator_next (&iter1, &key1, &value1));
+  ASSERT (!gl_list_iterator_next (&iterk, &key2, &node));
+  ASSERT (!gl_list_iterator_next (&iterv, &value2, &node));
+  gl_omap_iterator_free (&iter1);
+  gl_list_iterator_free (&iterk);
+  gl_list_iterator_free (&iterv);
+}
+
+static void
+check_all (gl_omap_t map1, gl_list_t keys, gl_list_t values)
+{
+  check_equals (map1, keys, values);
+}
+
+int
+main (int argc, char *argv[])
+{
+  gl_omap_t map1;
+  gl_list_t keys;
+  gl_list_t values;
+
+  /* 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 map1.  */
+    map1 = gl_omap_nx_create_empty (GL_ARRAY_OMAP, (gl_mapkey_compar_fn) strcmp, NULL, NULL);
+    ASSERT (map1 != NULL);
+
+    /* Create keys and values.  */
+    keys = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, NULL, false);
+    values = gl_list_create_empty (GL_ARRAY_LIST, NULL, NULL, NULL, false);
+
+    check_all (map1, keys, values);
+
+    /* Initialize them.  */
+    for (i = 0; i < initial_size; i++)
+      {
+        const char *key = RANDOM_OBJECT ();
+        const char *value = RANDOM_OBJECT ();
+        bool added = gl_omap_nx_put (map1, key, value);
+        size_t index = gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+        ASSERT (added == (index == (size_t)(-1)));
+        if (added)
+          {
+            gl_sortedlist_add (keys, (gl_listelement_compar_fn)strcmp, key);
+            index = gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+            gl_list_add_at (values, index, value);
+          }
+        else
+          gl_list_set_at (values, index, value);
+        check_all (map1, keys, values);
+      }
+
+    for (repeat = 0; repeat < 100000; repeat++)
+      {
+        unsigned int operation = RANDOM (3);
+        switch (operation)
+          {
+          case 0:
+            {
+              const char *key = RANDOM_OBJECT ();
+              const void *ret = gl_omap_get (map1, key);
+              size_t index =
+                gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+              ASSERT (ret
+                      == (index != (size_t)(-1) ? gl_list_get_at (values, index) : NULL));
+            }
+            break;
+          case 1:
+            {
+              const char *key = RANDOM_OBJECT ();
+              const char *value = RANDOM_OBJECT ();
+              bool added = gl_omap_nx_put (map1, key, value);
+              size_t index =
+                gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+              ASSERT (added == (index == (size_t)(-1)));
+              if (added)
+                {
+                  gl_sortedlist_add (keys, (gl_listelement_compar_fn)strcmp, key);
+                  index = gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+                  gl_list_add_at (values, index, value);
+                }
+              else
+                gl_list_set_at (values, index, value);
+            }
+            break;
+          case 2:
+            {
+              const char *key = RANDOM_OBJECT ();
+              bool removed = gl_omap_remove (map1, key);
+              size_t index =
+                gl_sortedlist_indexof (keys, (gl_listelement_compar_fn)strcmp, key);
+              ASSERT (removed == (index != (size_t)(-1)));
+              if (removed)
+                {
+                  gl_list_remove_at (keys, index);
+                  gl_list_remove_at (values, index);
+                }
+            }
+            break;
+          }
+        check_all (map1, keys, values);
+      }
+
+    gl_omap_free (map1);
+    gl_list_free (keys);
+    gl_list_free (values);
+  }
+
+  return 0;
+}