Struct BothQuorums 

pub struct BothQuorums<R, W> { /* private fields */ }

A quorum rule that accepts an ID set only when both a read rule and a write rule accept it.

Two read quorums may be disjoint, and so may two write quorums. Every set this rule accepts is both a read quorum and a write quorum. So when every read quorum intersects every write quorum, any two accepted sets intersect; verify_intersection checks that condition. A consensus election can use this rule, so that two candidates cannot both win in one term.

ids() returns the union of the read and write IDs, each ID once.

Implementations

impl<R, W> BothQuorums<R, W>

pub fn new(read: R, write: W) -> Self

Builds a rule that accepts an ID set only when both read and write accept it.

Trait Implementations

impl<R: Clone, W: Clone> Clone for BothQuorums<R, W>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<R: Debug, W: Debug> Debug for BothQuorums<R, W>

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

Formats the value using the given formatter.

impl<R, W> QuorumSet for BothQuorums<R, W>

where R: QuorumSet, W: QuorumSet<Id = R::Id>, R::Id: Ord,

type Id = <R as QuorumSet>::Id

Node ID type in this quorum set.

type Iter = IntoIter<<R as QuorumSet>::Id>

Iterator over every voter ID tracked by this quorum set.

fn is_quorum<'a, I>(&self, ids: I) -> bool

where Self::Id: 'a, I: Iterator<Item = &'a Self::Id> + Clone,

Return true if the candidate IDs satisfy this quorum rule.

fn ids(&self) -> Self::Iter

Return all voter IDs in this quorum set.