Trait maglev::ConsistentHasher

pub trait ConsistentHasher<N: Sized> {
    fn nodes(&self) -> &[N];
    fn capacity(&self) -> usize;
    fn get<Q: ?Sized>(&self, key: &Q) -> Option<&N>
    where
        Q: Hash + Eq;
}

Consistent hasher is a special kind of hashing such that when a hash table is resized, only K/n keys need to be remapped on average, where K is the number of keys, and n is the number of slots.

Required methods

fn nodes(&self) -> &[N]

Returns all nodes in arbitrary order.

fn capacity(&self) -> usize

Returns the number of slots in the lookup table.

fn get<Q: ?Sized>(&self, key: &Q) -> Option<&N> where
    Q: Hash + Eq, 

Returns a reference to the node corresponding to the key.

Implementors

impl<N, S> ConsistentHasher<N> for Maglev<N, S> where
    N: Hash + Eq,
    S: BuildHasher,