29 lines
1.2 KiB
Rust
29 lines
1.2 KiB
Rust
// run-rustfix
|
|
|
|
#![allow(unused, clippy::suspicious_map)]
|
|
|
|
use std::collections::{BTreeSet, HashMap, HashSet};
|
|
|
|
#[warn(clippy::needless_collect)]
|
|
#[allow(unused_variables, clippy::iter_cloned_collect)]
|
|
fn main() {
|
|
let sample = [1; 5];
|
|
let indirect_with_into_iter = sample.iter().collect::<Vec<_>>();
|
|
let indirect_with_iter = sample.iter().collect::<Vec<_>>();;
|
|
let indirect_negative = sample.iter().collect::<Vec<_>>();;
|
|
let len = sample.iter().collect::<Vec<_>>().len();
|
|
if sample.iter().collect::<Vec<_>>().is_empty() {
|
|
// Empty
|
|
}
|
|
sample.iter().cloned().collect::<Vec<_>>().contains(&1);
|
|
sample.iter().map(|x| (x, x)).collect::<HashMap<_, _>>().len();
|
|
// Notice the `HashSet`--this should not be linted
|
|
sample.iter().collect::<HashSet<_>>().len();
|
|
// Neither should this
|
|
sample.iter().collect::<BTreeSet<_>>().len();
|
|
indirect_with_into_iter.into_iter().map(|x| (x, x+1)).collect::<HashMap<_, _>>();
|
|
indirect_with_iter.iter().map(|x| (x, x+1)).collect::<HashMap<_, _>>();
|
|
indirect_negative.iter().map(|x| (x, x+1)).collect::<HashMap<_, _>>();
|
|
indirect_negative.iter().map(|x| (x, x+1)).collect::<HashMap<_, _>>();
|
|
}
|