Enum Node 

pub enum Node<ID>
where
    ID: Ord,
{
    Id(ID),
    Subtree(QuorumTree<ID>),
}

A child of a QuorumTree.

A node can be either a leaf node ID or a nested quorum tree. Nested trees allow hierarchical quorum rules such as “two data centers, each selected by a local majority”.

Variants

Id(ID)

A leaf node ID.

Subtree(QuorumTree<ID>)

A nested quorum tree.

Trait Implementations

impl<ID> CanonicalId for Node<ID>

where ID: CanonicalId + Ord,

fn fmt_canonical_id<W>(&self, f: &mut W) -> Result

where W: Write + ?Sized,

Writes this value’s canonical ID into f.

fn canonical_id(&self) -> String

Returns this value’s canonical ID as a String.

impl<ID> Clone for Node<ID>

where ID: Ord + Clone,

fn clone(&self) -> Node<ID>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<ID> Debug for Node<ID>

where ID: Ord + Debug,

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

Formats the value using the given formatter.

impl<ID> Eq for Node<ID>

where ID: Ord + Eq,

impl<ID> Hash for Node<ID>

where ID: Ord + Hash,

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<ID> Ord for Node<ID>

where ID: Ord + Ord,

fn cmp(&self, other: &Node<ID>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<ID> PartialEq for Node<ID>

where ID: Ord + PartialEq,

fn eq(&self, other: &Node<ID>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<ID> PartialOrd for Node<ID>

where ID: Ord + PartialOrd,

fn partial_cmp(&self, other: &Node<ID>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<ID> StructuralPartialEq for Node<ID>

where ID: Ord + PartialEq,