Lines Matching refs:Map
76 pub struct Map<K, V> struct
85 impl<K, V> Map<K, V> argument
273 impl<K, V> Default for Map<K, V> implementation
284 impl<K, V> Map<K, V> impl
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()
888 let mut m = Map::<u32, f32>::new(); in empty()
912 let mut m = Map::<u32, f32>::new(); in inserting()
1020 fn full_leaf(f: &mut MapForest<u32, f32>) -> Map<u32, f32> { in split_level0_leaf()
1021 let mut m = Map::new(); in split_level0_leaf()
1078 fn full(f: &mut MapForest<u32, f32>) -> Map<u32, f32> { in split_level1_leaf()
1079 let mut m = Map::new(); in split_level1_leaf()
1197 fn two_leaf(f: &mut MapForest<u32, f32>) -> Map<u32, f32> { in two_leaf()
1199 let mut m = Map::new(); in two_leaf()
1293 fn level3_sparse(f: &mut MapForest<u32, f32>) -> Map<u32, f32> { in level3_sparse()
1295 let mut m = Map::new(); in level3_sparse()
1336 let mut m = Map::<u32, f32>::new(); in insert_many()
1368 let mut m = Map::<u32, f32>::new(); in immutable_cursor()
1447 let mut m = Map::<u32, f32>::new(); in into_iter()
1473 let mut m = Map::<u32, f32>::new(); in range()
1547 let mut m = Map::<u32, f32>::new(); in range_next_back()