Struct std::collections::BTree[src]
pub struct BTree<K, V> {
// some fields omitted
}Methods
impl<K: Ord, V> BTree<K, V>
fn new<K: Ord, V>(k: K, v: V, lb: uint) -> BTree<K, V>
Returns new BTree with root node (leaf) and user-supplied lower bound The lower bound applies to every node except the root node.
impl<K: Clone + Ord, V: Clone> BTree<K, V>
fn get<K: Clone + Ord, V: Clone>(self, k: K) -> Option<V>
Returns the value of a given key, which may not exist in the tree. Calls the root node's get method.
fn insert<K: Clone + Ord, V: Clone>(self, k: K, v: V) -> BTree<K, V>
An insert method that uses the clone() feature for support.
Trait Implementations
impl<K: Clone + Ord, V: Clone> Clone for BTree<K, V>
fn clone<K: Clone + Ord, V: Clone>(&self) -> BTree<K, V>
Implements the Clone trait for the BTree. Uses a helper function/constructor to produce a new BTree.
fn clone_from<K: Clone + Ord, V: Clone>(&mut self, &BTree<K, V>)
impl<K: Ord, V: Eq> PartialEq for BTree<K, V>
fn eq<K: Ord, V: Eq>(&self, other: &BTree<K, V>) -> bool
fn ne<K: Ord, V: Eq>(&self, &BTree<K, V>) -> bool
impl<K: Ord, V: Eq> Eq for BTree<K, V>
fn assert_receiver_is_total_eq<K: Ord, V: Eq>(&self)
impl<K: Ord, V: Eq> PartialOrd for BTree<K, V>
fn lt<K: Ord, V: Eq>(&self, other: &BTree<K, V>) -> bool
fn le<K: Ord, V: Eq>(&self, &BTree<K, V>) -> bool
fn gt<K: Ord, V: Eq>(&self, &BTree<K, V>) -> bool
fn ge<K: Ord, V: Eq>(&self, &BTree<K, V>) -> bool
impl<K: Ord, V: Eq> Ord for BTree<K, V>
fn cmp<K: Ord, V: Eq>(&self, other: &BTree<K, V>) -> Ordering
Returns an ordering based on the root nodes of each BTree.