QuickXorHash

Fast implementation of QuickXorHash in pure Rust.

A quick, simple non-cryptographic hash algorithm that works by XORing the bytes in a 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]);

License

Licensed under either of

• Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
• MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Authors

• Author: Guy Rutenberg