341 pub struct RBTree<K: Ord, V> {  struct
347 impl<K: Ord, V> Drop for RBTree<K, V> {  argument
355 impl<K: Ord + Clone, V: Clone> Clone for RBTree<K, V> {  implementation
356     fn clone(&self) -> RBTree<K, V> {  in clone()
358             let mut new = RBTree::new();  in clone()
366 impl<K, V> Debug for RBTree<K, V>  implementation
377 impl<K: Ord + Debug, V: Debug> RBTree<K, V> {  impl
413 impl<K, V> PartialEq for RBTree<K, V>  implementation
418     fn eq(&self, other: &RBTree<K, V>) -> bool {  in eq()
428 impl<K, V> Eq for RBTree<K, V>  implementation
435 impl<'a, K, V> Index<&'a K> for RBTree<K, V>  implementation
447 impl<K: Ord, V> FromIterator<(K, V)> for RBTree<K, V> {  implementation
448     fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> RBTree<K, V> {  in from_iter()
449         let mut tree = RBTree::new();  in from_iter()
456 impl<K: Ord, V> Extend<(K, V)> for RBTree<K, V> {  implementation
817 impl<K: Ord, V> IntoIterator for RBTree<K, V> {  implementation
841 impl<K: Ord, V> RBTree<K, V> {  impl
843     pub fn new() -> RBTree<K, V> {  in new()
844         RBTree {  in new()
1423         let mut m = RBTree::new();  in test_insert()
1438         let mut m = RBTree::new();  in test_replace()
1449         let mut m = RBTree::new();  in test_clone()
1464         let mut m: RBTree<isize, bool> = RBTree::new();  in test_empty_remove()
1470         let mut m: RBTree<isize, bool> = RBTree::new();  in test_empty_iter()
1480         let mut m = RBTree::new();  in test_lots_of_insertions()
1543         let mut m = RBTree::new();  in test_find_mut()
1557         let mut m = RBTree::new();  in test_remove()
1574         let mut m = RBTree::new();  in test_is_empty()
1583         let mut m = RBTree::new();  in test_pop()
1598         let mut m = RBTree::new();  in test_iterate()
1616         let map: RBTree<_, _> = vec.into_iter().collect();  in test_keys()
1627         let map: RBTree<_, _> = vec.into_iter().collect();  in test_values()
1638         let mut map: RBTree<_, _> = vec.into_iter().collect();  in test_values_mut()
1651         let mut m = RBTree::new();  in test_find()
1662         let mut m1 = RBTree::new();  in test_eq()
1667         let mut m2 = RBTree::new();  in test_eq()
1680         let mut map = RBTree::new();  in test_show()
1681         let empty: RBTree<i32, i32> = RBTree::new();  in test_show()
1696         let map: RBTree<_, _> = xs.iter().cloned().collect();  in test_from_iter()
1707         let map: RBTree<_, _> = xs.iter().cloned().collect();  in test_size_hint()
1720         let map: RBTree<_, _> = xs.iter().cloned().collect();  in test_iter_len()
1733         let mut map: RBTree<_, _> = xs.iter().cloned().collect();  in test_mut_size_hint()
1746         let mut map: RBTree<_, _> = xs.iter().cloned().collect();  in test_iter_mut_len()
1757         let mut map = RBTree::new();  in test_index()
1769         let mut map = RBTree::new();  in test_index_nonexistent()
1780         let mut a = RBTree::new();  in test_extend_iter()
1782         let mut b = RBTree::new();  in test_extend_iter()