Struct Tree 

pub struct Tree<U, T> { /* private fields */ }

represent the tree data structure inside the component. U: is the type for the Node indentifier (must implement PartialEq) T: is the type for the Node value

Implementations

impl<U, T> Tree<U, T>

where U: PartialEq,

pub fn new(root: Node<U, T>) -> Tree<U, T>

Instantiates a new Tree

pub fn root(&self) -> &Node<U, T>

Returns a reference to the root Node

pub fn root_mut(&mut self) -> &mut Node<U, T>

Returns a mutable reference to the root Node

Trait Implementations

impl<U, T> Clone for Tree<U, T>

where U: Clone, T: Clone,

fn clone(&self) -> Tree<U, T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<U, T> Debug for Tree<U, T>

where U: Debug, T: Debug,

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

Formats the value using the given formatter.

impl<U, T> PartialEq for Tree<U, T>

where U: PartialEq, T: PartialEq,

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

where U: Eq, T: Eq,

impl<U, T> StructuralPartialEq for Tree<U, T>