Enum Tree

pub enum Tree<A> {
    Empty,
    Cons(Rc<Self>, A, Rc<Self>),
}

Variants

Empty

Cons(Rc<Self>, A, Rc<Self>)

Implementations

impl<A> Tree<A>

pub fn single(value: A) -> Self

pub fn cons(left: Self, value: A, right: Self) -> Self

Trait Implementations

impl<A: Clone> Clone for Tree<A>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug> Debug for Tree<A>

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

Formats the value using the given formatter.

impl<A> Empty for Tree<A>

fn empty() -> Self

fn is_empty(&self) -> bool

impl<A: PartialEq> PartialEq for Tree<A>

fn eq(&self, other: &Tree<A>) -> 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<A: PartialOrd> PartialOrd for Tree<A>

fn partial_cmp(&self, other: &Tree<A>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<A: Clone + PartialEq + PartialOrd> Set<A> for Tree<A>

fn insert(self, value: A) -> Self

fn member(&self, value: A) -> bool

fn size(&self) -> usize

impl<A> StructuralPartialEq for Tree<A>