Various improvements around HASH nodes

The example previously would lead to corrupt memory
when running for items that needed to re-hash the
hash array. This has been fixed.

Secondly, all HASH node memory leaks are now fixed,
that resulted from badly tracking objects through the
resize process. A new function `hash_free_shallow` was
added to help with this. The function `array_free_shallow`
is unused but might become useful in the future and so
was not removed.

The hash strategy is still garbage but this can be fixed later :)

1 files changed, 3 insertions, 1 deletions

diff --git a/array.h b/array.h
index d35a1f8..a1ac8c0 100644
--- a/array.h
+++ b/array.h
@@ -21,7 +21,9 @@ err_t array_remove_key(struct bowl *, size_t, struct bowl **);
 
 err_t array_free(struct bowl *);
 
+err_t array_free_shallow(struct bowl_arr *);
+
 #ifdef __cplusplus
 }
 #endif
-#endif // _ARRAY_H_
\ No newline at end of file
+#endif // _ARRAY_H_