1527         for (i, &elt) in enumerate(&insert) {  in insert()
1529             map.insert(elt, elt);  in insert()
1531             assert_eq!(map.get(&elt), Some(&elt));  in insert()
1532             assert_eq!(map[&elt], elt);  in insert()
1536         for &elt in &not_present {  in insert()
1537             assert!(map.get(&elt).is_none());  in insert()
1547         for (i, &elt) in enumerate(&insert) {  in insert_full()
1549             let (index, existing) = map.insert_full(elt, elt);  in insert_full()
1551             assert_eq!(Some(index), map.get_full(&elt).map(|x| x.0));  in insert_full()
1556         for &elt in &present {  in insert_full()
1557             let (index, existing) = map.insert_full(elt, elt);  in insert_full()
1558             assert_eq!(existing, Some(elt));  in insert_full()
1559             assert_eq!(Some(index), map.get_full(&elt).map(|x| x.0));  in insert_full()
1594         for &elt in &insert {  in insert_order()
1595             map.insert(elt, ());  in insert_order()
1614         for (i, &elt) in enumerate(&insert) {  in grow()
1616             map.insert(elt, elt);  in grow()
1618             assert_eq!(map.get(&elt), Some(&elt));  in grow()
1619             assert_eq!(map[&elt], elt);  in grow()
1623         for &elt in &insert {  in grow()
1624             map.insert(elt * 10, elt);  in grow()
1626         for &elt in &insert {  in grow()
1627             map.insert(elt * 100, elt);  in grow()
1629         for (i, &elt) in insert.iter().cycle().enumerate().take(100) {  in grow()
1630             map.insert(elt * 100 + i as i32, elt);  in grow()
1633         for &elt in &not_present {  in grow()
1634             assert!(map.get(&elt).is_none());  in grow()
1680         for &elt in &insert {  in remove()
1681             map.insert(elt, elt);  in remove()
1725         for &elt in &insert {  in swap_remove_index()
1726             map.insert(elt, elt * 2);  in swap_remove_index()