I can now demonstrate that the hash implementation is around as fast as
guile internal implementation. But for some workloads like if we have a
hash with millions of elements. And lookups a working set of about 1
key hash pairs the speed is doubled compared to guiles internal. Now this
is maybe
hence find a matching index if
there is a match. So with just a few instructions you will find a matching
index among 16 bytes. This can lead to insane speed in scanning a list of
key value pairs and I noted that scanning 1000 elements takes about 100ns
on my laptop.
Now over to hashes the idea is
