Struct treez::rb::TreeRb

pub struct TreeRb<K, V> where
    K: Ord + Default + Bounded + Clone,
    V: Default + Clone,  { /* fields omitted */ }

vector indexed red-black tree implementation

Implementations

impl<K, V> TreeRb<K, V> where
    K: Ord + Default + Bounded + Clone,
    V: Default + Clone, 

pub fn new() -> TreeRb<K, V>

pub fn len(&self) -> usize

pub fn len_freelist(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn insert(&mut self, key: K, val: V) -> Option<V>

pub fn remove(&mut self, key: &K) -> Option<V>

returns the value of the removed item, otherwise return None

pub fn contains_key(&self, key: K) -> bool

check to see if an item with the input key exists

pub fn shrink_to_fit(&mut self)

calls shrink to fit on all vectors

pub fn with_capacity(capacity: usize) -> Self

creates a new rbtree with buf.capacity = capacity

pub fn predecessor(&self, key: K) -> Option<&V>

returns the biggest value l<=k which is in the tree

pub fn successor(&self, key: K) -> Option<&V>

returns the smallest value l>=k which is in the tree

pub fn get(&self, key: K) -> Option<V>

get the value of the item with the input key, otherwise return None

pub fn clear(&mut self)

pub fn compact(&mut self)

compacts up unused slots in node array

pub fn print(&mut self)

pub fn check_nodes(&self)

Trait Implementations

impl<K: Clone, V: Clone> Clone for TreeRb<K, V> where
    K: Ord + Default + Bounded + Clone,
    V: Default + Clone, 

fn clone(&self) -> TreeRb<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.