Enum adapton::catalog::collections::Tree

pub enum Tree<X> {
    Nil,
    Leaf(X),
    Bin(usize, Box<Tree<X>>, Box<Tree<X>>),
    Name(Name, usize, Box<Tree<X>>, Box<Tree<X>>),
    Art(Art<Tree<X>>),
}

Variants

Nil

Leaf(X)

Bin(usize, Box<Tree<X>>, Box<Tree<X>>)

Name(Name, usize, Box<Tree<X>>, Box<Tree<X>>)

Art(Art<Tree<X>>)

Trait Implementations

impl<X: Clone> Clone for Tree<X>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<X: Debug> Debug for Tree<X>

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

Formats the value using the given formatter.

impl<X: Eq> Eq for Tree<X>

impl<X: Hash> Hash for Tree<X>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given [Hasher].

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given [Hasher].

impl<X: PartialEq> PartialEq<Tree<X>> for Tree<X>

fn eq(&self, other: &Tree<X>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Tree<X>) -> bool

This method tests for !=.

impl<X> StructuralEq for Tree<X>

impl<X> StructuralPartialEq for Tree<X>

impl<Leaf: Debug + Hash + PartialEq + Eq + Clone + 'static> TreeElim<usize, Leaf> for Tree<Leaf>

fn elim_arg<Arg, Res, NilC, LeafC, BinC, NameC>(
    tree: Self,
    arg: Arg,
    nil: NilC,
    leaf: LeafC,
    bin: BinC,
    name: NameC
) -> Res where
    NilC: FnOnce(Arg) -> Res,
    LeafC: FnOnce(Leaf, Arg) -> Res,
    BinC: FnOnce(usize, Self, Self, Arg) -> Res,
    NameC: FnOnce(Name, usize, Self, Self, Arg) -> Res, 

fn full_move<Arg, Res, NilC, LeafC, BinC, NameC, ArtC>(
    tree: Self,
    arg: Arg,
    nil: NilC,
    leaf: LeafC,
    bin: BinC,
    name: NameC,
    artf: ArtC
) -> Res where
    NilC: FnOnce(Arg) -> Res,
    LeafC: FnOnce(Leaf, Arg) -> Res,
    BinC: FnOnce(usize, Self, Self, Arg) -> Res,
    NameC: FnOnce(Name, usize, Self, Self, Arg) -> Res,
    ArtC: FnOnce(&Art<Self>, Arg) -> Res, 

fn elim<Res, NilC, LeafC, BinC, NameC>(
    tree: Self,
    nil: NilC,
    leaf: LeafC,
    bin: BinC,
    name: NameC
) -> Res where
    NilC: FnOnce() -> Res,
    LeafC: FnOnce(Leaf) -> Res,
    BinC: FnOnce(usize, Self, Self) -> Res,
    NameC: FnOnce(Name, usize, Self, Self) -> Res, 

fn elim_ref<Res, NilC, LeafC, BinC, NameC>(
    tree: &Self,
    nil: NilC,
    leaf: LeafC,
    bin: BinC,
    name: NameC
) -> Res where
    NilC: FnOnce() -> Res,
    LeafC: FnOnce(&Leaf) -> Res,
    BinC: FnOnce(&usize, &Self, &Self) -> Res,
    NameC: FnOnce(&Name, &usize, &Self, &Self) -> Res, 

fn lev_of_tree(tree: &Self) -> usize

fn is_empty(tree: &Self) -> bool

fn is_nil(tree: &Self) -> bool

impl<Leaf: Debug + Hash + PartialEq + Eq + Clone + 'static> TreeIntro<usize, Leaf> for Tree<Leaf>

fn nil() -> Self

fn leaf(x: Leaf) -> Self

fn bin(lev: usize, l: Self, r: Self) -> Self

fn name(nm: Name, lev: usize, l: Self, r: Self) -> Self

fn art(art: Art<Self>) -> Self