Crate quickxorhash

source ·
Expand description

QuickXorHash implementation in Rust.

A quick, simple non-cryptographic hash algorithm that works by XORing the bytes in a

QuickXorHash

circular-shifting fashion.

Examples

use quickxorhash::QuickXorHash;

let mut qx = QuickXorHash::new();
qx.update(b"hello world");
assert_eq!(qx.finalize(), [104, 40, 3, 27, 216, 240, 6, 16, 220, 225, 13, 114, 107, 3, 25, 0, 0, 0, 0, 0]);

Performance

The best Performance is achieved when updating large chunks which are multiples of BLOCK_SIZE (160).

Structs

Constants