45     fn pair(self) -> (K, V) {  in pair()
65     fn clone(&self) -> NodePtr<K, V> {  in clone()
73     fn cmp(&self, other: &NodePtr<K, V>) -> Ordering {  in cmp()
79     fn partial_cmp(&self, other: &NodePtr<K, V>) -> Option<Ordering> {  in partial_cmp()
85     fn eq(&self, other: &NodePtr<K, V>) -> bool {  in eq()
93     fn new(k: K, v: V) -> NodePtr<K, V> {  in new()
160     fn min_node(self) -> NodePtr<K, V> {  in min_node()
169     fn max_node(self) -> NodePtr<K, V> {  in max_node()
178     fn next(self) -> NodePtr<K, V> {  in next()
196     fn prev(self) -> NodePtr<K, V> {  in prev()
214     fn set_parent(&mut self, parent: NodePtr<K, V>) {  in set_parent()
222     fn set_left(&mut self, left: NodePtr<K, V>) {  in set_left()
230     fn set_right(&mut self, right: NodePtr<K, V>) {  in set_right()
238     fn parent(&self) -> NodePtr<K, V> {  in parent()
246     fn left(&self) -> NodePtr<K, V> {  in left()
254     fn right(&self) -> NodePtr<K, V> {  in right()
273     unsafe fn deep_clone(&self) -> NodePtr<K, V> {  in deep_clone()
356     fn clone(&self) -> RBTree<K, V> {  in clone()
378     fn tree_print(&self, node: NodePtr<K, V>, direction: i32) {  in tree_print()
418     fn eq(&self, other: &RBTree<K, V>) -> bool {  in eq()
448     fn from_iter<T: IntoIterator<Item = (K, V)>>(iter: T) -> RBTree<K, V> {  in from_iter()  argument
482     fn clone(&self) -> Keys<'a, K, V> {  in clone()  argument
499     fn next(&mut self) -> Option<&'a K> {  in next()
527     fn clone(&self) -> Values<'a, K, V> {  in clone()  argument
575     fn clone(&self) -> ValuesMut<'a, K, V> {  in clone()  argument
620     fn next(&mut self) -> Option<(K, V)> {  in next()
648     fn next_back(&mut self) -> Option<(K, V)> {  in next_back()
690     fn clone(&self) -> Iter<'a, K, V> {  in clone()  argument
703     fn next(&mut self) -> Option<(&'a K, &'a V)> {  in next()
725     fn next_back(&mut self) -> Option<(&'a K, &'a V)> {  in next_back()
766     fn clone(&self) -> IterMut<'a, K, V> {  in clone()  argument
779     fn next(&mut self) -> Option<(&'a K, &'a mut V)> {  in next()
801     fn next_back(&mut self) -> Option<(&'a K, &'a mut V)> {  in next_back()
822     fn into_iter(mut self) -> IntoIter<K, V> {  in into_iter()
877     unsafe fn left_rotate(&mut self, mut node: NodePtr<K, V>) {  in left_rotate()
912     unsafe fn right_rotate(&mut self, mut node: NodePtr<K, V>) {  in right_rotate()
946     pub fn replace_or_insert(&mut self, k: K, mut v: V) -> Option<V> {  in replace_or_insert()
961     unsafe fn insert_fixup(&mut self, mut node: NodePtr<K, V>) {  in insert_fixup()
1021     pub fn insert(&mut self, k: K, v: V) {  in insert()
1060     fn find_node(&self, k: &K) -> NodePtr<K, V> {  in find_node()
1082     fn first_child(&self) -> NodePtr<K, V> {  in first_child()
1095     fn last_child(&self) -> NodePtr<K, V> {  in last_child()
1108     pub fn get_first(&self) -> Option<(&K, &V)> {  in get_first()
1117     pub fn get_last(&self) -> Option<(&K, &V)> {  in get_last()
1126     pub fn pop_first(&mut self) -> Option<(K, V)> {  in pop_first()
1135     pub fn pop_last(&mut self) -> Option<(K, V)> {  in pop_last()
1144     pub fn get_first_mut(&mut self) -> Option<(&K, &mut V)> {  in get_first_mut()
1153     pub fn get_last_mut(&mut self) -> Option<(&K, &mut V)> {  in get_last_mut()
1191     fn clear_recurse(&mut self, current: NodePtr<K, V>) {  in clear_recurse()
1224     unsafe fn delete_fixup(&mut self, mut node: NodePtr<K, V>, mut parent: NodePtr<K, V>) {  in delete_fixup()
1296     unsafe fn delete(&mut self, node: NodePtr<K, V>) -> (K, V) {  in delete()  argument
1378     pub fn keys(&self) -> Keys<K, V> {  in keys()
1384     pub fn values(&self) -> Values<K, V> {  in values()
1390     pub fn values_mut(&mut self) -> ValuesMut<K, V> {  in values_mut()
1398     pub fn iter(&self) -> Iter<K, V> {  in iter()
1409     pub fn iter_mut(&mut self) -> IterMut<K, V> {  in iter_mut()