feat(hash_table): support iterating only occupied buckets

clib.json

@@ -1,6 +1,6 @@
 {
   "name": "libhash",
-  "version": "1.0.0",
+  "version": "1.1.0",
   "author": "Matthew Zito",
   "repo": "exbotanical/libhash",
   "license": "MIT",
@@ -13,6 +13,7 @@
     "src/hash.h",
     "src/prime.c",
     "src/prime.h",
+    "src/list.h",
     "include/libhash.h"
   ],
   "dependencies": {

src/hash_table.c

@@ -44,15 +44,15 @@ static void ht_resize(hash_table *ht, int base_capacity) {
 
   const int tmp_capacity = ht->capacity;
   ht->capacity = new_ht->capacity;
-  new_ht->capacity = tmp_capacity;
 
+  // Cannot free values - we may still be using them.
   ht_entry **tmp_entries = ht->entries;
   ht->entries = new_ht->entries;
-  new_ht->entries = tmp_entries;
+  free(tmp_entries);
+
+  list_free(ht->occupied_buckets);
   ht->occupied_buckets = new_ht->occupied_buckets;
 
-  // Cannot free values - we may still be using them.
-  free(new_ht->entries);
   free(new_ht);
 }
 
@@ -183,6 +183,7 @@ static void __ht_delete_table(hash_table *ht) {
     }
   }
 
+  // list_free(ht->occupied_buckets);
   free(ht->entries);
   free(ht);
 }

src/list.h

@@ -50,9 +50,9 @@ static void list_remove(node_t **head, int value) {
 }
 
 // TODO: Use and test
-static void free_list(node_t *head) {
+static void list_free(node_t *head) {
   node_t *tmp;
-  while (head) {
+  while (head != &LIST_SENTINEL_NODE) {
     tmp = head;
     head = head->next;
     free(tmp);