pub enum Quorum {
One,
Majority,
All,
N(NonZeroUsize),
}Expand description
How many replicas must respond for an operation to be considered successful.
A DHT operation is answered by several nodes, and a caller trades latency against confidence by choosing how many of them to wait for.
Variants§
One
One replica suffices. Lowest latency, weakest guarantee.
Majority
A majority of the replication factor.
All
Every replica in the replication factor.
N(NonZeroUsize)
An explicit number of replicas.
Implementations§
Trait Implementations§
impl Copy for Quorum
impl Eq for Quorum
impl StructuralPartialEq for Quorum
Auto Trait Implementations§
impl Freeze for Quorum
impl RefUnwindSafe for Quorum
impl Send for Quorum
impl Sync for Quorum
impl Unpin for Quorum
impl UnsafeUnpin for Quorum
impl UnwindSafe for Quorum
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more