Struct rendezvous_hash::WeightedNode

pub struct WeightedNode<N> {
    pub node: N,
    pub capacity: Capacity,
}

Weighted node.

This is used for representing a heterogeneous environment in which there are nodes which have various capacities.

Internally this uses an efficient weighted hash function that based on the "Logarithmic Method" described in the paper "Weighted Distributed Hash Tables". So, normally, additional cost for considering node capacity is negligible.

Fields

node: N

The node.

capacity: Capacity

The capacity of this node.

Methods

impl<N: Node> WeightedNode<N>

pub fn new(node: N, capacity: Capacity) -> Self

Makes a new WeightedNode instance.

Trait Implementations

impl<N: Node> Node for WeightedNode<N>

type NodeId = N::NodeId

Node identifier type.

type HashCode = SignPositiveF64

Hash code type.

fn node_id(&self) -> &Self::NodeId

Returns the identifier of this node.

fn hash_code<H, U: Hash>(&self, hasher: &H, item: &U) -> Self::HashCode where
    H: NodeHasher<Self::NodeId>, 

Returns the hash code for the combination of thid node and item.

impl<N: Clone> Clone for WeightedNode<N>

fn clone(&self) -> WeightedNode<N>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<N: Debug> Debug for WeightedNode<N>

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

Formats the value using the given formatter.