Struct Tree 

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

Fields

value: T

children: Vec<Tree<T>>

Implementations

impl<T> Tree<T>

pub fn unfold<F, B>(f: &F, b: &B) -> Tree<T>

where F: Fn(&B) -> (T, Vec<B>) + Clone,

Build a tree from a initial seed and a igniter function

(b -> (a, [b])) -> b -> Tree a

pub fn zip<B>(self, other: Tree<B>) -> Tree<(T, B)>

where T: Clone, B: Clone,

Zip two trees together

Tree a -> Tree b -> Tree (a, b)

pub fn iter(&self) -> TreeIter<'_, T>

pub fn update<F>(&mut self, f_mut: &F)

where F: Fn(&mut T),

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> Functor for Tree<T>

type Map<B, F> = Tree<B> where F: Fn(T) -> B + Clone

fn fmap<B, F>(self, f: F) -> Tree<B>

where F: Fn(T) -> B + Clone,

fn fmap1<F>(self, f: F) -> Self

where F: Fn(T) -> T,

impl<T1> Hkt1 for Tree<T1>

type HktArg1 = T1

impl<T> IntoIterator for Tree<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = TreeIntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

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> StructuralPartialEq for Tree<T>