hrw-hash 2.0.3

A minimalistic implementation of the Highest Random Weight (HRW) aka Rendezvous hashing algorithm
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

#![doc = include_str!("../README.md")]
#![forbid(unsafe_code)]

mod hasher;
mod hrw;

use std::hash::Hash;

pub use {hasher::DefaultHasher, hrw::HrwNodes};

/// Target node which will be used for the hashing.
pub trait HrwNode: Hash + PartialEq + Eq {
    /// Capacity of the node.
    ///
    /// The capacity
    /// what portion of the keyspace the affects the score of the node, thus the
    /// higher the capacity, the more likely the node will be chosen.
    ///
    /// Capacities of all nodes are summed up to determine the total capacity of
    /// the keyspace. The relative capacity of the node is then ratio of the
    /// node's capacity to the total capacity of the keyspace.
    fn capacity(&self) -> usize {
        1
    }
}

macro_rules! impl_hrwnode {
    ($($t:ty),*) => {
        $(impl HrwNode for $t {})*
    };
}

impl_hrwnode!(
    u8,
    u16,
    u32,
    u64,
    usize,
    i8,
    i16,
    i32,
    i64,
    isize,
    char,
    String,
    &str,
    &[u8]
);