error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:8:39 | LL | let indirect_iter = sample.iter().collect::<Vec<_>>(); | ^^^^^^^ LL | indirect_iter.into_iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>(); | ------------------------- the iterator could be used here instead | = note: `-D clippy::needless-collect` implied by `-D warnings` help: use the original Iterator instead of collecting it and then producing a new one | LL ~ LL ~ sample.iter().map(|x| (x, x + 1)).collect::<HashMap<_, _>>(); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:10:38 | LL | let indirect_len = sample.iter().collect::<VecDeque<_>>(); | ^^^^^^^ LL | indirect_len.len(); | ------------------ the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL ~ sample.iter().count(); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:12:40 | LL | let indirect_empty = sample.iter().collect::<VecDeque<_>>(); | ^^^^^^^ LL | indirect_empty.is_empty(); | ------------------------- the iterator could be used here instead | help: check if the original Iterator has anything instead of collecting it and seeing if it's empty | LL ~ LL ~ sample.iter().next().is_none(); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:14:43 | LL | let indirect_contains = sample.iter().collect::<VecDeque<_>>(); | ^^^^^^^ LL | indirect_contains.contains(&&5); | ------------------------------- the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL ~ sample.iter().any(|x| x == &5); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:26:48 | LL | let non_copy_contains = sample.into_iter().collect::<Vec<_>>(); | ^^^^^^^ LL | non_copy_contains.contains(&a); | ------------------------------ the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL ~ sample.into_iter().any(|x| x == a); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:55:51 | LL | let buffer: Vec<&str> = string.split('/').collect(); | ^^^^^^^ LL | buffer.len() | ------------ the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL ~ string.split('/').count() | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:60:55 | LL | let indirect_len: VecDeque<_> = sample.iter().collect(); | ^^^^^^^ LL | indirect_len.len() | ------------------ the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL ~ sample.iter().count() | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:65:57 | LL | let indirect_len: LinkedList<_> = sample.iter().collect(); | ^^^^^^^ LL | indirect_len.len() | ------------------ the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL ~ sample.iter().count() | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:70:57 | LL | let indirect_len: BinaryHeap<_> = sample.iter().collect(); | ^^^^^^^ LL | indirect_len.len() | ------------------ the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL ~ sample.iter().count() | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:130:59 | LL | let y: Vec<usize> = vec.iter().map(|k| k * k).collect(); | ^^^^^^^ ... LL | y.contains(&i); | -------------- the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL | let z: Vec<usize> = vec.iter().map(|k| k * k).collect(); LL | // Do lint LL ~ vec.iter().map(|k| k * k).any(|x| x == i); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:155:59 | LL | let y: Vec<usize> = vec.iter().map(|k| k * k).collect(); | ^^^^^^^ ... LL | y.contains(&n); | -------------- the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL | let z: Vec<usize> = vec.iter().map(|k| k * k).collect(); LL | // Do lint LL ~ vec.iter().map(|k| k * k).any(|x| x == n); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:184:63 | LL | let y: Vec<usize> = vec.iter().map(|k| k * k).collect(); | ^^^^^^^ ... LL | y.contains(&n); | -------------- the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL | let z: Vec<usize> = vec.iter().map(|k| k * k).collect(); LL | // Do lint LL ~ vec.iter().map(|k| k * k).any(|x| x == n); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:220:59 | LL | let y: Vec<usize> = vec.iter().map(|k| k * k).collect(); | ^^^^^^^ ... LL | y.contains(&n); | -------------- the iterator could be used here instead | help: check if the original Iterator contains an element instead of collecting then checking | LL ~ LL | let z: Vec<usize> = vec.iter().map(|k| k * k).collect(); LL | if n < 2 { LL | // Do lint LL ~ vec.iter().map(|k| k * k).any(|x| x == n); | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:245:26 | LL | let w = v.iter().collect::<Vec<_>>(); | ^^^^^^^ LL | // Do lint LL | for _ in 0..w.len() { | ------- the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL | // Do lint LL ~ for _ in 0..v.iter().count() { | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:267:30 | LL | let mut w = v.iter().collect::<Vec<_>>(); | ^^^^^^^ LL | // Do lint LL | while 1 == w.len() { | ------- the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL | // Do lint LL ~ while 1 == v.iter().count() { | error: avoid using `collect()` when not needed --> $DIR/needless_collect_indirect.rs:289:30 | LL | let mut w = v.iter().collect::<Vec<_>>(); | ^^^^^^^ LL | // Do lint LL | while let Some(i) = Some(w.len()) { | ------- the iterator could be used here instead | help: take the original Iterator's count instead of collecting it and finding the length | LL ~ LL | // Do lint LL ~ while let Some(i) = Some(v.iter().count()) { | error: aborting due to 16 previous errors