Expand description
A immutable view of the Self::data in the Tree with their NodeId.
Fields
id: NodeIdNode ID.
data: &'a TData.
Implementations
sourceimpl<T: Debug> Node<'_, T>
impl<T: Debug> Node<'_, T>
pub fn level(&self) -> usize
pub fn parent(&self) -> usize
sourcepub fn parents(&self) -> ParentIter<'_, T>ⓘNotable traits for ParentIter<'a, T>impl<'a, T: Debug> Iterator for ParentIter<'a, T> type Item = Node<'a, T>;
pub fn parents(&self) -> ParentIter<'_, T>ⓘNotable traits for ParentIter<'a, T>impl<'a, T: Debug> Iterator for ParentIter<'a, T> type Item = Node<'a, T>;
sourcepub fn children(&self) -> ChildrenIter<'_, T>ⓘNotable traits for ChildrenIter<'a, T>impl<'a, T: Debug> Iterator for ChildrenIter<'a, T> type Item = Node<'a, T>;
pub fn children(&self) -> ChildrenIter<'_, T>ⓘNotable traits for ChildrenIter<'a, T>impl<'a, T: Debug> Iterator for ChildrenIter<'a, T> type Item = Node<'a, T>;
sourcepub fn siblings(&self) -> SiblingsIter<'_, T>ⓘNotable traits for SiblingsIter<'a, T>impl<'a, T: Debug> Iterator for SiblingsIter<'a, T> type Item = Node<'a, T>;
pub fn siblings(&self) -> SiblingsIter<'_, T>ⓘNotable traits for SiblingsIter<'a, T>impl<'a, T: Debug> Iterator for SiblingsIter<'a, T> type Item = Node<'a, T>;
Trait Implementations
sourceimpl<'a, T: Ord + 'a> Ord for Node<'a, T>
impl<'a, T: Ord + 'a> Ord for Node<'a, T>
sourceimpl<'a, T: PartialOrd + 'a> PartialOrd<Node<'a, T>> for Node<'a, T>
impl<'a, T: PartialOrd + 'a> PartialOrd<Node<'a, T>> for Node<'a, T>
sourcefn partial_cmp(&self, other: &Node<'a, T>) -> Option<Ordering>
fn partial_cmp(&self, other: &Node<'a, T>) -> Option<Ordering>
This method returns an ordering between self and other values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self and other) and is used by the < operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self and other) and is used by the <=
operator. Read more
impl<'a, T: Copy + 'a> Copy for Node<'a, T>
impl<'a, T: Eq + 'a> Eq for Node<'a, T>
impl<'a, T: 'a> StructuralEq for Node<'a, T>
impl<'a, T: 'a> StructuralPartialEq for Node<'a, T>
Auto Trait Implementations
impl<'a, T> RefUnwindSafe for Node<'a, T> where
T: RefUnwindSafe,
impl<'a, T> Send for Node<'a, T> where
T: Sync,
impl<'a, T> Sync for Node<'a, T> where
T: Sync,
impl<'a, T> Unpin for Node<'a, T>
impl<'a, T> UnwindSafe for Node<'a, T> where
T: RefUnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcepub fn borrow_mut(&mut self) -> &mut T
pub fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcepub fn to_owned(&self) -> T
pub fn to_owned(&self) -> T
Creates owned data from borrowed data, usually by cloning. Read more
sourcepub fn clone_into(&self, target: &mut T)
pub fn clone_into(&self, target: &mut T)
🔬 This is a nightly-only experimental API. (
toowned_clone_into)Uses borrowed data to replace owned data, usually by cloning. Read more