summaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--src/sord.c4
-rw-r--r--src/zix/hash.c8
-rw-r--r--src/zix/hash.h6
3 files changed, 9 insertions, 9 deletions
diff --git a/src/sord.c b/src/sord.c
index 59e25e9..9475fa2 100644
--- a/src/sord.c
+++ b/src/sord.c
@@ -199,9 +199,9 @@ sord_world_new(void)
}
static void
-free_node_entry(const void* value, void* user_data)
+free_node_entry(void* value, void* user_data)
{
- const SordNode* node = (const SordNode*)value;
+ SordNode* node = (SordNode*)value;
if (node->node.type == SERD_LITERAL) {
sord_node_free((SordWorld*)user_data, node->meta.lit.datatype);
}
diff --git a/src/zix/hash.c b/src/zix/hash.c
index b24ee78..655c5df 100644
--- a/src/zix/hash.c
+++ b/src/zix/hash.c
@@ -46,8 +46,8 @@ struct ZixHashImpl {
unsigned count;
};
-static inline const void*
-zix_hash_value(const ZixHashEntry* entry)
+static inline void*
+zix_hash_value(ZixHashEntry* entry)
{
return entry + 1;
}
@@ -214,13 +214,13 @@ zix_hash_remove(ZixHash* hash, const void* value)
}
ZIX_API void
-zix_hash_foreach(const ZixHash* hash,
+zix_hash_foreach(ZixHash* hash,
ZixHashVisitFunc f,
void* user_data)
{
for (unsigned b = 0; b < *hash->n_buckets; ++b) {
ZixHashEntry* bucket = hash->buckets[b];
- for (const ZixHashEntry* e = bucket; e; e = e->next) {
+ for (ZixHashEntry* e = bucket; e; e = e->next) {
f(zix_hash_value(e), user_data);
}
}
diff --git a/src/zix/hash.h b/src/zix/hash.h
index c992117..5b265ff 100644
--- a/src/zix/hash.h
+++ b/src/zix/hash.h
@@ -43,8 +43,8 @@ typedef uint32_t (*ZixHashFunc)(const void* value);
/**
Function to visit a hash element.
*/
-typedef void (*ZixHashVisitFunc)(const void* value,
- void* user_data);
+typedef void (*ZixHashVisitFunc)(void* value,
+ void* user_data);
/**
Create a new hash table.
@@ -124,7 +124,7 @@ zix_hash_find(const ZixHash* hash,
@param user_data The user_data parameter passed to @p f.
*/
ZIX_API void
-zix_hash_foreach(const ZixHash* hash,
+zix_hash_foreach(ZixHash* hash,
ZixHashVisitFunc f,
void* user_data);