Enum cmprsd::util::binary_tree::Tree

pub enum Tree<T: Ord> {
    Node {
        content: T,
        left: Box<Tree<T>>,
        right: Box<Tree<T>>,
    },
    Leaf(T),
}

Variants

Node

Fields

content: T

left: Box<Tree<T>>

right: Box<Tree<T>>

Leaf(T)

Implementations

impl Tree<Frequency>

pub fn get_count(&self) -> usize

impl<T: Ord + Copy> Tree<T>

pub fn len(&self) -> usize

pub fn height(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn to_breadth_first_search(&self) -> Vec<T>

pub fn leaf_paths(&self) -> Vec<(Vec<Direction>, T)>

pub fn build_internal_node(content: T, left: Tree<T>, right: Tree<T>) -> Tree<T>

pub fn get_value(&self) -> &T

pub fn get_all_values(&self) -> Vec<T>

pub fn get_value_from_directions( &self, direction: Direction ) -> Option<&Tree<T>>

Trait Implementations

impl<T: Clone + Ord> 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 + Ord> Debug for Tree<T>

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

Formats the value using the given formatter.

impl<T: Ord + Copy> Ord for Tree<T>

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized + PartialOrd,

Restrict a value to a certain interval.

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

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

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Ord + Copy> PartialOrd for Tree<T>

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

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

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

This method tests less than (for self and other) and is used by the < operator.

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

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

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

This method tests greater than (for self and other) and is used by the > operator.

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

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

impl<T: Eq + Ord> Eq for Tree<T>

impl<T: Ord> StructuralPartialEq for Tree<T>