Struct light_phylogeny::ArenaTree

pub struct ArenaTree<T> where
    T: PartialEq,  {
    pub arena: Vec<Noeud<T>>,
}

Structure ArenaTree.

Taken from https://dev.to/deciduously/no-more-tears-no-more-knots-arena-allocated-trees-in-rust-44k6

Ben Lovy https://deciduously.com/

Fields

arena: Vec<Noeud<T>>

Implementations

impl<T> ArenaTree<T> where
    T: PartialEq + Default, 

pub fn node(&mut self, val: T) -> usize

Add a node and send its new index. If the node already exists, send its index.

pub fn new_node(&mut self, val: T) -> usize

Add a node and send its new index. If the node already exists, send a panic alert.

pub fn get_node(&mut self, val: T) -> usize

pub fn get_index(&mut self, name: String) -> Result<usize, usize>

Get index of a node from its name

pub fn get_root(&mut self) -> usize

Get the index of the root.

pub fn is_leaf(&self, idx: usize) -> bool

Check if the node is a leaf.

pub fn is_left(&self, idx: usize) -> bool

Check if the node is a left node.

pub fn is_root(&self, idx: usize) -> bool

Check if the node is the root.

pub fn depth(&self, idx: usize) -> usize

Get the depth of the node in the tree.

pub fn get_largest_x(&mut self) -> f32

Get the largest x value of a tree.

pub fn get_largest_y(&mut self) -> f32

Get the largest y value of a tree.

pub fn get_smallest_x(&mut self) -> f32

Get the smallest x value of a tree.

pub fn get_smallest_y(&mut self) -> f32

Get the smallest y value of a tree.

pub fn get_smallest_l(&mut self) -> f32

Get the smallest l value of a tree.

pub fn copie(&mut self) -> ArenaTree<String>

Copy

Trait Implementations

impl<T: Debug> Debug for ArenaTree<T> where
    T: PartialEq, 

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

Formats the value using the given formatter.

impl<T: Default> Default for ArenaTree<T> where
    T: PartialEq, 

fn default() -> ArenaTree<T>

Returns the “default value” for a type.