Enum freya::prelude::RootNodeCandidate
pub enum RootNodeCandidate<Key>where
Key: NodeKey,{
Valid(Key, HashSet<Key, BuildHasherDefault<FxHasher>>),
None,
}
Expand description
Contains the best Root node candidate from where to start measuring
Variants§
Implementations§
§impl<Key> RootNodeCandidate<Key>where
Key: NodeKey,
impl<Key> RootNodeCandidate<Key>where Key: NodeKey,
pub fn take(&mut self) -> RootNodeCandidate<Key>
Trait Implementations§
§impl<Key> Clone for RootNodeCandidate<Key>where
Key: Clone + NodeKey,
impl<Key> Clone for RootNodeCandidate<Key>where Key: Clone + NodeKey,
§fn clone(&self) -> RootNodeCandidate<Key>
fn clone(&self) -> RootNodeCandidate<Key>
Returns a copy of the value. Read more
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source
. Read more§impl<Key> Debug for RootNodeCandidate<Key>where
Key: Debug + NodeKey,
impl<Key> Debug for RootNodeCandidate<Key>where Key: Debug + NodeKey,
§impl<Key> PartialEq<RootNodeCandidate<Key>> for RootNodeCandidate<Key>where
Key: PartialEq<Key> + NodeKey,
impl<Key> PartialEq<RootNodeCandidate<Key>> for RootNodeCandidate<Key>where Key: PartialEq<Key> + NodeKey,
§fn eq(&self, other: &RootNodeCandidate<Key>) -> bool
fn eq(&self, other: &RootNodeCandidate<Key>) -> bool
This method tests for
self
and other
values to be equal, and is used
by ==
.impl<Key> StructuralPartialEq for RootNodeCandidate<Key>where Key: NodeKey,
Auto Trait Implementations§
impl<Key> RefUnwindSafe for RootNodeCandidate<Key>where Key: RefUnwindSafe,
impl<Key> Send for RootNodeCandidate<Key>where Key: Send,
impl<Key> Sync for RootNodeCandidate<Key>where Key: Sync,
impl<Key> Unpin for RootNodeCandidate<Key>where Key: Unpin,
impl<Key> UnwindSafe for RootNodeCandidate<Key>where Key: UnwindSafe,
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