Skip to content

Latest commit

 

History

History
8 lines (5 loc) · 265 Bytes

README.md

File metadata and controls

8 lines (5 loc) · 265 Bytes

Data.Digest.XXHash

This is an implementation of the xxHash algorithm in haskell.

It's about as fast as an alder32 checksum written in C (zlib).

You can find benchmarks here.