Adding initial support for HASH nodes

This PR adds initial support for HASH data nodes in libbowl.
This allows a performant key-value store lookup in a node tree.
The hashing code implements the "murmur" hash, which has shown
good performance over at [`libcuckoo`]. Currently there is no
extended hashing strategy, which should definitely be changed.

[`libcuckoo`]: https://github.com/qaul/libcuckoo

(currently a collision will cause a recursive re-alloc)

Some of the type-level hacks also begs the question if a PAIR
data node might be warranted, even though it would break the
simple design around bowl->data.

1 files changed, 11 insertions, 0 deletions

diff --git a/hash.h b/hash.h
new file mode 100644
index 0000000..a5d763d
--- /dev/null
+++ b/hash.h
@@ -0,0 +1,11 @@
+#ifndef HASH_H_
+#define HASH_H_
+
+#include "bowl.h"
+
+err_t hash_insert_key(struct bowl *, char *key, struct bowl *);
+
+err_t hash_remove_key(struct bowl *, char *key, struct bowl **);
+
+#endif // HASH_H_
+