Struct ConsistentHashingRingBuilder 

pub struct ConsistentHashingRingBuilder<T: RingHasherTrait, S: State = Empty> { /* private fields */ }

Implementations

impl<T: RingHasherTrait, S: State> ConsistentHashingRingBuilder<T, S>

pub fn build(self) -> ConsistentHashingRing<T>

where S: IsComplete,

Finish building and return the requested object

pub fn hasher(self, value: T) -> ConsistentHashingRingBuilder<T, SetHasher<S>>

where S::Hasher: IsUnset,

Required.

The hashing function used to compute hash values for keys and nodes.

pub fn replication_factor( self, value: usize, ) -> ConsistentHashingRingBuilder<T, SetReplicationFactor<S>>

where S::ReplicationFactor: IsUnset,

Required.

The number of physical nodes each key is replicated to for fault tolerance.

pub fn hash_to_vid( self, value: BTreeMap<u64, String>, ) -> ConsistentHashingRingBuilder<T, SetHashToVid<S>>

where S::HashToVid: IsUnset,

Required.

A mapping of hash values to virtual node IDs.

pub fn vid_to_pid( self, value: HashMap<String, String>, ) -> ConsistentHashingRingBuilder<T, SetVidToPid<S>>

where S::VidToPid: IsUnset,

Required.

A mapping of virtual node IDs to physical node IDs.

pub fn physicals( self, value: HashMap<String, Rc<RefCell<PhysicalNode>>>, ) -> ConsistentHashingRingBuilder<T, SetPhysicals<S>>

where S::Physicals: IsUnset,

Required.

A mapping of physical node IDs to their corresponding PhysicalNode instances.