Struct Continuum 

pub struct Continuum { /* private fields */ }

The consistent hashing ring

A Continuum represents a ring of buckets where a node is associated with various points on the ring.

Implementations

impl Continuum

pub fn new(buckets: &[Bucket]) -> Self

pub fn new_with_version(buckets: &[Bucket], version: Version) -> Self

Create a new Continuum with the given list of buckets.

pub fn node_idx(&self, input: &[u8]) -> usize

Find the associated index for the given input.

pub fn node(&self, hash_key: &[u8]) -> Option<SocketAddr>

Hash the given hash_key to the server address.

pub fn node_iter(&self, hash_key: &[u8]) -> NodeIterator<'_>

Get an iterator of nodes starting at the original hashed node of the hash_key.

This function is useful to find failover servers if the original ones are offline, which is cheaper than rebuilding the entire hash ring.

pub fn get_addr(&self, idx: &mut usize) -> Option<&SocketAddr>