2023-04-20 09:37:15 -05:00
|
|
|
//@run-rustfix
|
2022-05-24 04:54:49 -05:00
|
|
|
#![warn(clippy::get_first)]
|
2023-06-06 15:56:57 -05:00
|
|
|
#![allow(clippy::useless_vec)]
|
2023-07-03 12:42:48 -05:00
|
|
|
use std::collections::{BTreeMap, HashMap, VecDeque};
|
2022-05-24 04:54:49 -05:00
|
|
|
|
|
|
|
struct Bar {
|
|
|
|
arr: [u32; 3],
|
|
|
|
}
|
|
|
|
|
|
|
|
impl Bar {
|
|
|
|
fn get(&self, pos: usize) -> Option<&u32> {
|
|
|
|
self.arr.get(pos)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
fn main() {
|
|
|
|
let x = vec![2, 3, 5];
|
|
|
|
let _ = x.first(); // Use x.first()
|
|
|
|
let _ = x.get(1);
|
|
|
|
let _ = x[0];
|
|
|
|
|
|
|
|
let y = [2, 3, 5];
|
|
|
|
let _ = y.first(); // Use y.first()
|
|
|
|
let _ = y.get(1);
|
|
|
|
let _ = y[0];
|
|
|
|
|
|
|
|
let z = &[2, 3, 5];
|
|
|
|
let _ = z.first(); // Use z.first()
|
|
|
|
let _ = z.get(1);
|
|
|
|
let _ = z[0];
|
|
|
|
|
|
|
|
let vecdeque: VecDeque<_> = x.iter().cloned().collect();
|
|
|
|
let hashmap: HashMap<u8, char> = HashMap::from_iter(vec![(0, 'a'), (1, 'b')]);
|
|
|
|
let btreemap: BTreeMap<u8, char> = BTreeMap::from_iter(vec![(0, 'a'), (1, 'b')]);
|
|
|
|
let _ = vecdeque.get(0); // Do not lint, because VecDeque is not slice.
|
|
|
|
let _ = hashmap.get(&0); // Do not lint, because HashMap is not slice.
|
|
|
|
let _ = btreemap.get(&0); // Do not lint, because BTreeMap is not slice.
|
|
|
|
|
|
|
|
let bar = Bar { arr: [0, 1, 2] };
|
|
|
|
let _ = bar.get(0); // Do not lint, because Bar is struct.
|
|
|
|
}
|