Crates.io | hsieh-hash |
lib.rs | hsieh-hash |
version | 0.1.1 |
source | src |
created_at | 2019-07-05 11:15:43.342654 |
updated_at | 2019-07-05 13:33:22.449716 |
description | The `Hsieh Hash` or `SuperFastHash` function |
homepage | https://crates.io/crates/hsieh-hash |
repository | https://github.com/xiphoseer/rust-hsieh-hash |
max_upload_size | |
id | 146523 |
size | 31,639 |
This crate contains the Hsieh Hash
or SuperFastHash
function
created by Paul Hsieh and presented at http://www.azillionmonkeys.com/qed/hash.html
use hsieh_hash::digest;
let hash = digest("Hello World!".as_bytes());
assert_eq!(hash, 1774740540);
The hash value is initialized with the lenght of the input, so the algorithm cannot be used incrementally.