BSD-3-Clause licensed by Andrew Martin
This version can be pinned in stack with:bytehash-,2109

Module documentation for

Taken together, universal hash functions and a good source of entropy provide a foundation for hash maps guarantee O(1) lookups even if an adversary chooses the keys. This library implements such a hash map. The implementation of lookup is tuned for performance. The functions for building hash maps are not since they are intended to be called infrequently.


Revision history for bytehash – 2020-04-30

  • Initial release.