shash: Make it more convenient to store "const" objects in an shash.

diff --git a/lib/shash.c b/lib/shash.c
index c35164bd92e277b98e5599c46f41f92485f909f5..e6cb6b0db8eccfe4cad50c7b7076b9bd1cbc7192 100644 (file)
--- a/lib/shash.c
+++ b/lib/shash.c
@@ -67,11 +67,11 @@ shash_count(const struct shash *shash)
 /* It is the caller's responsibility to avoid duplicate names, if that is
  * desirable. */
 struct shash_node *
-shash_add(struct shash *sh, const char *name, void *data)
+shash_add(struct shash *sh, const char *name, const void *data)
 {
     struct shash_node *node = xmalloc(sizeof *node);
     node->name = xstrdup(name);
-    node->data = data;
+    node->data = (void *) data;
     hmap_insert(&sh->map, &node->node, hash_name(name));
     return node;
 }

diff --git a/lib/shash.h b/lib/shash.h
index c2d13b157f3f2870b0844fa65620b9599e4c045e..236d865ed09c5df65411f500e8dc3114a3ca0f9f 100644 (file)
--- a/lib/shash.h
+++ b/lib/shash.h
@@ -43,7 +43,7 @@ void shash_destroy(struct shash *);
 void shash_clear(struct shash *);
 bool shash_is_empty(const struct shash *);
 size_t shash_count(const struct shash *);
-struct shash_node *shash_add(struct shash *, const char *, void *);
+struct shash_node *shash_add(struct shash *, const char *, const void *);
 void shash_delete(struct shash *, struct shash_node *);
 struct shash_node *shash_find(const struct shash *, const char *);
 void *shash_find_data(const struct shash *, const char *);