Enum freya::prelude::RootNodeCandidate

pub enum RootNodeCandidate<Key>where
    Key: NodeKey,{
    Valid(Key),
    None,
}

Contains the best Root node candidate from where to start measuring

Variants

Valid(Key)

A valid Node ID

None

None

Implementations

impl<Key> RootNodeCandidate<Key>where Key: NodeKey,

pub fn take(&mut self) -> RootNodeCandidate<Key>

pub fn propose_new_candidate( &mut self, proposed_candidate: &Key, dom_adapter: &mut impl DOMAdapter<Key> )

Propose a new root candidate

Trait Implementations

impl<Key> Clone for RootNodeCandidate<Key>where Key: Clone + NodeKey,

fn clone(&self) -> RootNodeCandidate<Key>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Key> Debug for RootNodeCandidate<Key>where Key: Debug + NodeKey,

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

Formats the value using the given formatter.

impl<Key> PartialEq<RootNodeCandidate<Key>> for RootNodeCandidate<Key>where Key: PartialEq<Key> + NodeKey,

fn eq(&self, other: &RootNodeCandidate<Key>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<Key> StructuralPartialEq for RootNodeCandidate<Key>where Key: NodeKey,