3 use std::collections::HashMap;
7 fn new_drop(b: &mut Bencher) {
9 let m: HashMap<i32, i32> = HashMap::new();
10 assert_eq!(m.len(), 0);
15 fn new_insert_drop(b: &mut Bencher) {
17 let mut m = HashMap::new();
19 assert_eq!(m.len(), 1);
24 fn grow_by_insertion(b: &mut Bencher) {
25 let mut m = HashMap::new();
40 fn find_existing(b: &mut Bencher) {
41 let mut m = HashMap::new();
55 fn find_nonexisting(b: &mut Bencher) {
56 let mut m = HashMap::new();
70 fn hashmap_as_queue(b: &mut Bencher) {
71 let mut m = HashMap::new();
81 m.insert(k + 1000, k + 1000);
87 fn get_remove_insert(b: &mut Bencher) {
88 let mut m = HashMap::new();
100 m.insert(k + 1000, k + 1000);