39 pub struct MapForest<K, V>  struct
47 impl<K, V> MapForest<K, V>  argument
104     pub fn get<C: Comparator<K>>(&self, key: K, forest: &MapForest<K, V>, comp: &C) -> Option<V> {  in get()
120         forest: &MapForest<K, V>,  in get_or_less()
137         forest: &mut MapForest<K, V>,  in insert()
148         forest: &mut MapForest<K, V>,  in try_insert()
158         forest: &mut MapForest<K, V>,  in remove()
170     pub fn clear(&mut self, forest: &mut MapForest<K, V>) {  in clear()
181     pub fn retain<F>(&mut self, forest: &mut MapForest<K, V>, mut predicate: F)  in retain()
207         forest: &'a MapForest<K, V>,  in cursor()
218         forest: &'a mut MapForest<K, V>,  in cursor_mut()
225     pub fn iter<'a>(&'a self, forest: &'a MapForest<K, V>) -> MapIter<'a, K, V> {  in iter()
234     pub fn into_iter(self, forest: MapForest<K, V>) -> MapIntoIter<K, V> {  in into_iter()
246         forest: &'a MapForest<K, V>,  in range()
290     fn verify<C: Comparator<K>>(&self, forest: &MapForest<K, V>, comp: &C)  in verify()
300     fn tpath<C: Comparator<K>>(&self, key: K, forest: &MapForest<K, V>, comp: &C) -> String {  in tpath()
469     fn new(container: &'a Map<K, V>, forest: &'a MapForest<K, V>, comp: &'a C) -> Self {  in new()
552     fn new(container: &'a mut Map<K, V>, forest: &'a mut MapForest<K, V>, comp: &'a C) -> Self {  in new()
885         let mut f = MapForest::<u32, f32>::new();  in empty()
911         let f = &mut MapForest::<u32, f32>::new();  in inserting()
1018         let f = &mut MapForest::<u32, f32>::new();  in split_level0_leaf()
1020         fn full_leaf(f: &mut MapForest<u32, f32>) -> Map<u32, f32> {  in split_level0_leaf()
1069         let f = &mut MapForest::<u32, f32>::new();  in split_level1_leaf()
1078         fn full(f: &mut MapForest<u32, f32>) -> Map<u32, f32> {  in split_level1_leaf()
1197     fn two_leaf(f: &mut MapForest<u32, f32>) -> Map<u32, f32> {  in two_leaf()
1208         let f = &mut MapForest::<u32, f32>::new();  in remove_level1()
1271         let f = &mut MapForest::<u32, f32>::new();  in remove_level1_rightmost()
1293     fn level3_sparse(f: &mut MapForest<u32, f32>) -> Map<u32, f32> {  in level3_sparse()
1304         let f = &mut MapForest::<u32, f32>::new();  in level3_removes()
1335         let f = &mut MapForest::<u32, f32>::new();  in insert_many()
1367         let f = &mut MapForest::<u32, f32>::new();  in immutable_cursor()
1446         let mut f = MapForest::<u32, f32>::new();  in into_iter()
1472         let mut f = MapForest::<u32, f32>::new();  in range()
1546         let mut f = MapForest::<u32, f32>::new();  in range_next_back()