hashtable: Remove unnecessary casts by using the correct type for the `next` member

2 files changed, 6 insertions, 6 deletions

diff --git a/src/hashtable.c b/src/hashtable.c
index 86dae82..dd6dbfc 100644
--- a/src/hashtable.c
+++ b/src/hashtable.c
@@ -47,7 +47,7 @@ void hash_table_destroy(hashtable_t *ht)
 					ht->free_func(e->value);
 				}
 				hashentry_t* old = e;
-				e = (hashentry_t*)e->next;
+				e = e->next;
 				free(old);
 			}
 		}
@@ -71,7 +71,7 @@ void hash_table_insert(hashtable_t* ht, void *key, void *value)
 			e->value = value;
 			return;
 		}
-		e = (hashentry_t*)e->next;
+		e = e->next;
 	}
 
 	// if we get here, the element is not yet in the list.
@@ -103,7 +103,7 @@ void* hash_table_lookup(hashtable_t* ht, void *key)
 		if (ht->compare_func(e->key, key)) {
 			return e->value;
 		}
-		e = (hashentry_t*)e->next;
+		e = e->next;
 	}
 	return NULL;
 }
@@ -124,7 +124,7 @@ void hash_table_remove(hashtable_t* ht, void *key)
 			// found element, remove it from the list
 			hashentry_t* old = e;
 			if (e == ht->entries[idx0]) {
-				ht->entries[idx0] = (hashentry_t*)e->next;
+				ht->entries[idx0] = e->next;
 			} else {
 				last->next = e->next;
 			}
@@ -135,6 +135,6 @@ void hash_table_remove(hashtable_t* ht, void *key)
 			return;
 		}
 		last = e;
-		e = (hashentry_t*)e->next;
+		e = e->next;
 	}
 }
diff --git a/src/hashtable.h b/src/hashtable.h
index 42d7b93..514cfec 100644
--- a/src/hashtable.h
+++ b/src/hashtable.h
@@ -25,7 +25,7 @@
 typedef struct hashentry_t {
 	void *key;
 	void *value;
-	void *next;
+	struct hashentry_t *next;
 } hashentry_t;
 
 typedef unsigned int(*hash_func_t)(const void* key);