JenkHash 0.1.0

Bob Jenkins hash functions for Rust with a digest-compatible API.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

//! Implementation of the Lookup2 hash algorithm (Jenkins hash function).
//!
//! Lookup2, also known as the Jenkins hash function, is Bob Jenkins' original hash function
//! designed for hash tables. It provides good distribution properties and was widely used
//! before the introduction of Lookup3. The algorithm processes input data and produces
//! a 32-bit hash value.

/// A hasher implementing the Lookup2 (Jenkins hash) algorithm.
///
/// Lookup2 is a hash function designed for hash table implementations. It provides
/// good avalanche properties, ensuring that small changes in input produce significant
/// changes in the output hash value.
///
/// # Examples
///
/// ```
/// use JenkHash::Lookup2;
/// use digest::{Digest, Update, FixedOutput};
///
/// let mut hasher = Lookup2::new();
/// hasher.update(b"hello");
/// hasher.update(b" world");
/// let result = hasher.finalize_fixed();
/// ```
pub struct Lookup2 {}