Struct tree_layout::TreeNode

pub struct TreeNode<D> {
    pub data: D,
    pub order: usize,
    pub depth: usize,
    pub parent: Option<usize>,
    pub children: Vec<usize>,
}

Fields

data: D

Data needed by the actual algorithm.

order: usize

The position of this node among it’s siblings.

Can also be thought of as the number of left-siblings this node has.

depth: usize

The depth of this node.

Can be thought of as the number of edges between this node and the root node.

parent: Option<usize>

The index into Tree of this node’s parent.

children: Vec<usize>

The indices into Tree of this node’s children.

Implementations

impl<D> TreeNode<D>

pub fn is_leaf(&self) -> bool

pub fn is_root(&self) -> bool

Trait Implementations

impl<D: Clone> Clone for TreeNode<D>

fn clone(&self) -> TreeNode<D>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<D: Debug> Debug for TreeNode<D>

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

Formats the value using the given formatter.

impl<D: PartialEq> PartialEq for TreeNode<D>

fn eq(&self, other: &TreeNode<D>) -> 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<D: Eq> Eq for TreeNode<D>

impl<D> StructuralEq for TreeNode<D>

impl<D> StructuralPartialEq for TreeNode<D>