From 25d61ff8b5d994a02c0cc2af8e029bebd3a94cb3 Mon Sep 17 00:00:00 2001
From: Nikias Bassen
Date: Mon, 12 Jan 2026 12:13:01 +0100
Subject: hashtable: Remove unnecessary casts by using the correct type for the
 `next` member

---
 src/hashtable.c | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

(limited to 'src/hashtable.c')

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;
 	}
 }
-- 
cgit v1.1-32-gdbae