Struct Tree 

pub struct Tree<T> {
    pub item: T,
    pub children: Vec<Tree<T>>,
}

Fields

item: T

children: Vec<Tree<T>>

Implementations

impl<T> Tree<T>

pub fn new(item: T, children: Vec<Tree<T>>) -> Tree<T>

pub fn singleton(item: T) -> Tree<T>

pub fn lookup(&self, path: Path) -> Option<&T>

Lookup the item in the Tree that corresponds to the given Path.

pub fn path_map_map<U>(&self, f: &dyn Fn(&T) -> U) -> TreePathMap<U>

where U: Eq + Hash,

Similar to path_map, but take a function for mapping an item in the tree to an alternative type to use to construct the TreePathMap.

This is useful when there is some information in the item for the Tree that can be thrown away when constructing the TreePathMap.

impl<T> Tree<T>

where T: Clone + Eq + Hash,

pub fn path_map(&self) -> TreePathMap<T>

Create a TreePathMap for the elements in the Tree.

Trait Implementations

impl<T: Clone> Clone for Tree<T>

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for Tree<T>

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

impl<T> StructuralPartialEq for Tree<T>