Struct treez::rb::TreeRb [−][src]
pub struct TreeRb<K, V> where
K: Ord + Default + Bounded + Clone,
V: Default + Clone, { /* fields omitted */ }vector indexed red-black tree implementation
Methods
impl<K, V> TreeRb<K, V> where
K: Ord + Default + Bounded + Clone,
V: Default + Clone, [src]
impl<K, V> TreeRb<K, V> where
K: Ord + Default + Bounded + Clone,
V: Default + Clone, pub fn new() -> TreeRb<K, V>[src]
pub fn new() -> TreeRb<K, V>pub fn len(&self) -> usize[src]
pub fn len(&self) -> usizepub fn len_freelist(&self) -> usize[src]
pub fn len_freelist(&self) -> usizepub fn is_empty(&self) -> bool[src]
pub fn is_empty(&self) -> boolpub fn insert(&mut self, key: K, val: V) -> Option<V>[src]
pub fn insert(&mut self, key: K, val: V) -> Option<V>pub fn remove(&mut self, key: &K) -> Option<V>[src]
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[src]
pub fn contains_key(&self, key: K) -> boolcheck to see if an item with the input key exists
pub fn get(&self, key: K) -> Option<V>[src]
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)[src]
pub fn clear(&mut self)pub fn compact(&mut self)[src]
pub fn compact(&mut self)compacts up unused slots in node array
pub fn print(&mut self)[src]
pub fn print(&mut self)pub fn check_nodes(&self)[src]
pub fn check_nodes(&self)