Enum Tree 

pub enum Tree<Data, LeafData> {
    Node(TreeNode<Data, LeafData>),
    Leaf(LeafData),
}

Variants

Node(TreeNode<Data, LeafData>)

Leaf(LeafData)

Implementations

impl<Data, LeafData> Tree<Data, LeafData>

pub fn leaf(data: LeafData) -> Self

pub fn node(data: Data, open: bool, children: Vec<Self>) -> Self

pub fn child_count(&self) -> usize

pub fn leaf_data(&self) -> Option<&LeafData>

pub fn openable(&self) -> bool

pub fn open(&mut self)

pub fn close(&mut self)

pub fn iter(&self) -> impl Iterator<Item = TreeIterItem<'_, Data, LeafData>>

pub fn iter_open( &self, ) -> impl Iterator<Item = TreeIterItem<'_, Data, LeafData>>

pub fn nth_mut(&mut self, n: usize) -> Option<&mut Self>

Trait Implementations

impl<Data: PartialEq, LeafData: PartialEq> PartialEq for Tree<Data, LeafData>

fn eq(&self, other: &Tree<Data, LeafData>) -> 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<Data: Eq, LeafData: Eq> Eq for Tree<Data, LeafData>

impl<Data, LeafData> StructuralPartialEq for Tree<Data, LeafData>