Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
-
Updated
Feb 17, 2018 - JavaScript
Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
Asino a stubborn, simple and fast Bloom filter for the rest of us.
Add a description, image, and links to the universal-hashing topic page so that developers can more easily learn about it.
To associate your repository with the universal-hashing topic, visit your repo's landing page and select "manage topics."