Struct RendezvousHasher 

pub struct RendezvousHasher<H, B>
where
    H: Hasher,
    B: BuildHasher<Hasher = H>,
{ /* private fields */ }

A hasher implementation for the Rendezvous (HRW - Highest Random Weight) hashing algorithm.

Rendezvous hashing provides a way to consistently distribute keys across a set of nodes, with minimal redistribution when nodes are added or removed. It’s particularly useful for distributed systems that need to balance load across multiple servers.

This implementation works with any hasher that implements std::hash::Hasher.

Implementations

impl<H, B> RendezvousHasher<H, B>

where H: Hasher, B: BuildHasher<Hasher = H>,

pub fn new(build_hasher: B) -> Self

Creates a new RendezvousHasher with the provided build hasher.

pub fn select<'a, K, N>(&self, key: &K, nodes: &'a [N]) -> Option<&'a N>

where K: Hash, N: Hash,

Selects the preferred node for a given key from a list of nodes.

This method computes a hash score for each node combined with the key, and returns the node with the highest score.

Parameters

• key - The key to hash
• nodes - A slice of nodes to choose from

Returns

A reference to the selected node, or None if the nodes slice is empty

pub fn select_index<K, N>(&self, key: &K, nodes: &[N]) -> Option<usize>

where K: Hash, N: Hash,

Selects the preferred node for a given key from a list of nodes, returning the index of the selected node.

Parameters

• key - The key to hash
• nodes - A slice of nodes to choose from

Returns

The index of the selected node, or None if the nodes slice is empty

pub fn rank<'a, K, N>(&self, key: &K, nodes: &'a [N]) -> Vec<&'a N>

where K: Hash, N: Hash,

Ranks all nodes for a given key, returning them sorted by preference (highest score to lowest).

Parameters

• key - The key to hash
• nodes - A slice of nodes to rank

Returns

A vector of references to nodes, sorted by preference

Trait Implementations

impl<H, B> Clone for RendezvousHasher<H, B>

where H: Hasher + Clone, B: BuildHasher<Hasher = H> + Clone,

fn clone(&self) -> RendezvousHasher<H, B>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<H, B> Debug for RendezvousHasher<H, B>

where H: Hasher + Debug, B: BuildHasher<Hasher = H> + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.