hashers 1.0.1

A collection of non-cryptographic hashing algorithms for Rust
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85

// The chi^2 test for Hashers.

extern crate rand;

extern crate hashers;

use hashers::{builtin, fnv, fx_hash, jenkins, null, pigeon, oz};

mod samples;

// This function is taken (loosely) from
//
// http://burtleburtle.net/bob/hash/hashfaq.html.
//
// Ok, so the chi2 (χ^2) test can be used to determine if a sample is
// drawn from a uniform distribution. This is useful because a hash
// table with n buckets and m items should have m/n items in each
// bucket (modulo open addressing). Jenkins' page above describes how
// to do this test, although I could not get his computation of chi2 to
// produce reasonable values, so I went with the algorithm presented at
//
// http://www.statisticshowto.com/probability-and-statistics/chi-square/.
//
// No idea if that's right either. And it's not remotely consistent.
//
// It's a giant piece of crap. I hate statistics.
fn chi2(sample: &[Vec<u8>], hfcn: fn(&[u8]) -> u64, mask_size: u32) -> f64 {
    let n_buckets = 2usize.pow(mask_size);
    let mask: u64 = n_buckets as u64 - 1;
    // count the hashes in each bucket
    let mut buckets: Vec<usize> = vec![0; n_buckets];
    sample
        .iter()
        .map(|s| (hfcn(s) & mask) as usize)
        .for_each(|s| buckets[s] += 1);
    // expected uniformly distributed samples
    let expected: f64 = (sample.len() as f64) / (n_buckets as f64);

    let chi2: f64 = buckets
        .iter()
        .map(|&c| (c as f64) - expected)
        .map(|r| (r * r) / expected)
        .sum();
    (chi2 - (n_buckets as f64)) / (n_buckets as f64).sqrt()
}

fn do_print(name: &str, chi2: f64) {
    println!("{: <9}:  {: >12.4}", name, chi2);
}

fn do_hashes(samples: &[Vec<u8>]) {
    do_print("default",   chi2(&samples, builtin::default, 5));
    do_print("djb2",      chi2(&samples, oz::djb2, 5));
    do_print("lookup3",   chi2(&samples, jenkins::lookup3, 5));
    do_print("loselose",  chi2(&samples, oz::loselose, 5));
    do_print("null",      chi2(&samples, null::null, 5));
    do_print("OAAT",      chi2(&samples, jenkins::oaat, 5));
    do_print("Pass",      chi2(&samples, null::passthrough, 5));
    do_print("sdbm",      chi2(&samples, oz::sdbm, 5));
    do_print("fnv1a 32",  chi2(&samples, fnv::fnv1a32, 5));
    do_print("fnv1a 64",  chi2(&samples, fnv::fnv1a64, 5));
    do_print("fxhash",    chi2(&samples, fx_hash::fxhash, 5));
    do_print("fxhash32",  chi2(&samples, fx_hash::fxhash32, 5));
    do_print("fxhash64",  chi2(&samples, fx_hash::fxhash64, 5));
    do_print("spooky",    chi2(&samples, jenkins::spooky_hash::spooky, 5));
    do_print("bricolage", chi2(&samples, pigeon::bricolage, 5));
}

fn main() {
    println!("Uniform distribution");
    let s1 = samples::random_samples(&mut samples::uniform(), 1000, 6);
    do_hashes(&s1);

    println!("\nAlphanumeric distribution");
    let s2 = samples::alphanumeric_samples(1000, 6);
    do_hashes(&s2);

    println!("\nGenerated identifiers");
    let s3 = samples::generated_samples(1000, 6);
    do_hashes(&s3);

    println!("\nDictionary words");
    let s4 = samples::word_samples();
    do_hashes(&s4);
}