3 use std::collections::BTreeMap;
4 use std::collections::HashMap;
5 use std::collections::VecDeque;
6 use std::iter::FromIterator;
8 struct GetFalsePositive {
12 impl GetFalsePositive {
13 fn get(&self, pos: usize) -> Option<&u32> { self.arr.get(pos) }
14 fn get_mut(&mut self, pos: usize) -> Option<&mut u32> { self.arr.get_mut(pos) }
18 let mut boxed_slice: Box<[u8]> = Box::new([0, 1, 2, 3]);
19 let mut some_slice = &mut [0, 1, 2, 3];
20 let mut some_vec = vec![0, 1, 2, 3];
21 let mut some_vecdeque: VecDeque<_> = some_vec.iter().cloned().collect();
22 let mut some_hashmap: HashMap<u8, char> = HashMap::from_iter(vec![(1, 'a'), (2, 'b')]);
23 let mut some_btreemap: BTreeMap<u8, char> = BTreeMap::from_iter(vec![(1, 'a'), (2, 'b')]);
24 let mut false_positive = GetFalsePositive { arr: [0, 1, 2] };
26 { // Test `get().unwrap()`
27 let _ = boxed_slice.get(1).unwrap();
28 let _ = some_slice.get(0).unwrap();
29 let _ = some_vec.get(0).unwrap();
30 let _ = some_vecdeque.get(0).unwrap();
31 let _ = some_hashmap.get(&1).unwrap();
32 let _ = some_btreemap.get(&1).unwrap();
33 let _ = false_positive.get(0).unwrap();
36 { // Test `get_mut().unwrap()`
37 *boxed_slice.get_mut(0).unwrap() = 1;
38 *some_slice.get_mut(0).unwrap() = 1;
39 *some_vec.get_mut(0).unwrap() = 1;
40 *some_vecdeque.get_mut(0).unwrap() = 1;
41 // Check false positives
42 *some_hashmap.get_mut(&1).unwrap() = 'b';
43 *some_btreemap.get_mut(&1).unwrap() = 'b';
44 *false_positive.get_mut(0).unwrap() = 1;
47 { // Test `get().unwrap().foo()` and `get_mut().unwrap().bar()`
48 let _ = some_vec.get(0..1).unwrap().to_vec();
49 let _ = some_vec.get_mut(0..1).unwrap().to_vec();