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, 1 insertions, 1 deletions

diff --git a/utils.c b/utils.c
index f08c670..0979d07 100644
--- a/utils.c
+++ b/utils.c
@@ -49,7 +49,7 @@ err_t _array_remove(void **ptr, size_t idx, size_t len, void **out)
 err_t _hash(char *str, size_t len, size_t *out)
 {
     CHECK(str, INVALID_PARAMS)
-    CHECK((len < 0), INVALID_PARAMS)
+    CHECK((len > 0), INVALID_PARAMS)
 
     // Implements the "murmur" non-cryptographic hash