Enum uniplate::Tree

pub enum Tree<T: Sized + Clone + Eq> {
    Zero,
    One(T),
    Many(Vector<Tree<T>>),
}

Variants

Zero

One(T)

Many(Vector<Tree<T>>)

Implementations

impl<T: Sized + Clone + Eq + 'static> Tree<T>

pub fn list(self) -> (Vector<T>, Box<dyn Fn(Vector<T>) -> Tree<T>>)

Returns the tree as a list alongside a function to reconstruct the tree from a list.

This preserves the structure of the tree.

pub fn map(self, op: Arc<dyn Fn(T) -> T>) -> Tree<T>

Trait Implementations

impl<T: Clone + Sized + Clone + Eq> Clone for Tree<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Sized + Clone + Eq> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T: Sized + Clone + Eq + 'static> IntoIterator for Tree<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = ConsumingIter<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 + Sized + Clone + Eq> 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 + Sized + Clone + Eq> Eq for Tree<T>

impl<T: Sized + Clone + Eq> StructuralPartialEq for Tree<T>