9 releases (stable)

1.1.0 Jun 15, 2020
1.0.4 Sep 18, 2019
1.0.3 Jun 18, 2018
1.0.2 Aug 20, 2017
0.1.0 Aug 24, 2015

#8 in Algorithms

Download history 111680/week @ 2020-03-16 119852/week @ 2020-03-23 117353/week @ 2020-03-30 115810/week @ 2020-04-06 115228/week @ 2020-04-13 124989/week @ 2020-04-20 124107/week @ 2020-04-27 122971/week @ 2020-05-04 131555/week @ 2020-05-11 119980/week @ 2020-05-18 126093/week @ 2020-05-25 136084/week @ 2020-06-01 139605/week @ 2020-06-08 188925/week @ 2020-06-15 192933/week @ 2020-06-22 171653/week @ 2020-06-29

529,489 downloads per month
Used in 956 crates (13 directly)

Zlib license

13KB
251 lines

Build Status Win Build Crates.io Documentation License

What is this?

It is an implementation of the Adler32 rolling hash algorithm in the Rust programming language.

It is adapted from Jean-Loup Gailly's and Mark Adler's original implementation in zlib.


lib.rs:

A minimal implementation of Adler32 for Rust.

This provides the simple method adler32(), that exhausts a Read and computes the Adler32 hash, as well as the RollingAdler32 struct, that can build a hash byte-by-byte, allowing to 'forget' past bytes in a rolling fashion.

The adler32 code has been translated (as accurately as I could manage) from the zlib implementation.

Dependencies

~140KB