Struct rust_black_trees::unbalancetree::BSTree

pub struct BSTree<T> { /* fields omitted */ }

Arena based memory tree structure

Trait Implementations

impl<T> BaseTree<T> for BSTree<T> where
    T: PartialOrd,
    T: PartialEq,
    T: Debug, 

type MNode = RegularNode<T>

fn get(&self, val: usize) -> &Self::MNode

In order to return a reference to a value of a vector contained within a refcell, a raw pointer is used. The unsafe code could be avoided by replacing each call to self.get(n) with &self.data.borrow()[n] and each call to self.get_mut(n) with &mut self.data.borrow()[n]. This allows us to do the same thing with less keystrokes. It does make the program not thread-safe, but a this data structure is a pretty terrible choice for a multi-threaded data structure anyways, since re-balancing can require that most of the tree be locked to one thread during an insertion or deletion

fn get_mut(&self, val: usize) -> &mut Self::MNode

fn get_root(&self) -> Option<usize>

fn set_root(&mut self, new_root: Option<usize>)

fn crement_size(&mut self, amount: isize)

fn attach_child(&self, p: usize, c: usize, side: Side)

fn rebalance_ins(&mut self, _n: usize)

fn rebalance_del(&mut self, _n: usize, _child: usize)

fn delete_replace(&mut self, n: usize) -> usize

fn replace_node(&mut self, to_delete: usize, to_attach: Option<usize>)

fn get_size(&self) -> usize

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

fn delete_node(&mut self, index: usize)

impl<T: Debug> Debug for BSTree<T>

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

Formats the value using the given formatter.

impl<T> Tree<T> for BSTree<T> where
    T: PartialOrd,
    T: PartialEq,
    T: Debug, 

fn new() -> Self

fn contains(&self, val: &T) -> bool

fn insert(&mut self, val: T)

fn delete(&mut self, val: T) -> bool

fn rotate(&mut self, side: Side, n: usize)

fn find(&self, val: &T) -> usize

fn get_height(&self) -> usize

fn to_string(&self) -> String

fn to_pretty_string(&self) -> String