4 use std::collections::BTreeMap;
5 use std::collections::HashMap;
6 use std::collections::VecDeque;
7 use std::iter::FromIterator;
9 struct GetFalsePositive {
13 impl GetFalsePositive {
14 fn get(&self, pos: usize) -> Option<&u32> {
17 fn get_mut(&mut self, pos: usize) -> Option<&mut u32> {
23 let mut boxed_slice: Box<[u8]> = Box::new([0, 1, 2, 3]);
24 let mut some_slice = &mut [0, 1, 2, 3];
25 let mut some_vec = vec![0, 1, 2, 3];
26 let mut some_vecdeque: VecDeque<_> = some_vec.iter().cloned().collect();
27 let mut some_hashmap: HashMap<u8, char> = HashMap::from_iter(vec![(1, 'a'), (2, 'b')]);
28 let mut some_btreemap: BTreeMap<u8, char> = BTreeMap::from_iter(vec![(1, 'a'), (2, 'b')]);
29 let mut false_positive = GetFalsePositive { arr: [0, 1, 2] };
32 // Test `get().unwrap()`
33 let _ = &boxed_slice[1];
34 let _ = &some_slice[0];
36 let _ = &some_vecdeque[0];
37 let _ = &some_hashmap[&1];
38 let _ = &some_btreemap[&1];
39 let _ = false_positive.get(0).unwrap();
41 let _: u8 = boxed_slice[1];
45 // Test `get_mut().unwrap()`
50 // Check false positives
51 *some_hashmap.get_mut(&1).unwrap() = 'b';
52 *some_btreemap.get_mut(&1).unwrap() = 'b';
53 *false_positive.get_mut(0).unwrap() = 1;
57 // Test `get().unwrap().foo()` and `get_mut().unwrap().bar()`
58 let _ = some_vec[0..1].to_vec();
59 let _ = some_vec[0..1].to_vec();