Struct Group 

pub struct Group<ID> {
    pub quorum_size: u64,
    pub ids: BTreeSet<ID>,
    pub groups: BTreeMap<String, Group<ID>>,
}

One group of a HierarchicalQuorumSet: its members, which are IDs and child groups, and how many of them a set must reach to reach the group.

A set reaches an ID by holding it, and a child group by reaching enough members of that group in turn. So the groups form a tree whose leaves are IDs, and every level applies the same test.

Fields

quorum_size: u64

The number of members of the group that an accepted set must reach to reach the group.

ids: BTreeSet<ID>

The IDs that the group holds directly.

groups: BTreeMap<String, Group<ID>>

The child groups, by name.

Implementations

impl<ID> Group<ID>

where ID: Ord + Clone,

pub fn of_ids<I>(quorum_size: u64, ids: I) -> Self

where I: IntoIterator<Item = ID>,

Returns a group of ids, which a set reaches by holding quorum_size of them.

pub fn of_groups<I, K>(quorum_size: u64, groups: I) -> Self

where I: IntoIterator<Item = (K, Group<ID>)>, K: Into<String>,

Returns a group of the child groups groups, each given with its name, which a set reaches by reaching quorum_size of them. A later group replaces an earlier one with the same name.

Trait Implementations

impl<ID: Clone> Clone for Group<ID>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<ID: Debug> Debug for Group<ID>

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

Formats the value using the given formatter.

impl<ID: Eq> Eq for Group<ID>

impl<ID: PartialEq> PartialEq for Group<ID>

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl<ID: PartialEq> StructuralPartialEq for Group<ID>